Option<Rgb> {\\n\\n let colors = str::from_utf8(color).ok()?.split('/').collect::<Vec<_>>();\\n\\n\\n\\n if colors.len() != 3 {\\n\\n return None;\\n\\n }\\n\\n\\n\\n // Scale values instead of filling with `0`s.\\n\\n let scale = |input: &str| {\\n\\n if input.len() > 4 {\\n\\n None\\n\\n } else {\\n\\n let max = u32::pow(16, input.len() as u32) - 1;\\n\\n let value = u32::from_str_radix(input, 16).ok()?;\\n\\n Some((255 * value / max) as u8)\\n\\n }\\n\\n };\\n\\n\\n\\n Some(Rgb { r: scale(colors[0])?, g: scale(colors[1])?, b: scale(colors[2])? })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alacritty_terminal/src/ansi.rs\",\n \"rank\": 61,\n \"score\": 162975.72438347258\n },\n {\n \"content\": \"/// Parse colors in `#r(rrr)g(ggg)b(bbb)` format.\\n\\nfn parse_legacy_color(color: &[u8]) -> Option<Rgb> {\\n\\n let item_len = color.len() / 3;\\n\\n\\n\\n // Truncate/Fill to two byte precision.\\n\\n let color_from_slice = |slice: &[u8]| {\\n\\n let col = usize::from_str_radix(str::from_utf8(slice).ok()?, 16).ok()? << 4;\\n\\n Some((col >> (4 * slice.len().saturating_sub(1))) as u8)\\n\\n };\\n\\n\\n\\n Some(Rgb {\\n\\n r: color_from_slice(&color[0..item_len])?,\\n\\n g: color_from_slice(&color[item_len..item_len * 2])?,\\n\\n b: color_from_slice(&color[item_len * 2..])?,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"alacritty_terminal/src/ansi.rs\",\n \"rank\": 62,\n \"score\": 162975.72438347258\n },\n {\n \"content\": \"pub fn initialize(\\n\\n options: &Options,\\n\\n event_proxy: EventLoopProxy<Event>,\\n\\n) -> Result<Option<PathBuf>, 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<OnDemandLogFile>,\\n\\n stdout: Mutex<LineWriter<Stdout>>,\\n\\n event_proxy: Mutex<EventLoopProxy<Event>>,\\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<Atlas>,\\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<Item = mio::Token>,\\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<Dimensions> {\\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<S: AsRef<OsStr> + ?Sized>(value: &S) -> Vec<u16> {\\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<T: EventListener>(\\n\\n term: &mut Term<T>,\\n\\n mut point: Point<usize>,\\n\\n direction: Direction,\\n\\n side: Side,\\n\\n) -> Point<usize> {\\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<T: EventListener>(\\n\\n term: &mut Term<T>,\\n\\n mut point: Point<usize>,\\n\\n direction: Direction,\\n\\n side: Side,\\n\\n) -> Point<usize> {\\n\\n // Expand semantically based on movement direction.\\n\\n let expand_semantic = |point: Point<usize>| {\\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<Rgb>,\\n\\n #[serde(deserialize_with = \\\"failure_default\\\")]\\n\\n background: Option<Rgb>,\\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<T>(term: &Term<T>, mut point: Point<usize>) -> Point<usize> {\\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<T>(term: &Term<T>, line: usize) -> Option<Point<usize>> {\\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<T>(term: &Term<T>, line: usize) -> Option<Point<usize>> {\\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<T>(term: &Term<T>, mut point: Point<usize>) -> Point<usize> {\\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<Cow<'static, [u8]>>,\\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<Msg> {\\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<X>(\\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<T: tty::EventedPty, U: EventListener> {\\n\\n poll: mio::Poll,\\n\\n pty: T,\\n\\n rx: Receiver<Msg>,\\n\\n tx: Sender<Msg>,\\n\\n terminal: Arc<FairMutex<Term<U>>>,\\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<T, U> EventLoop<T, U>\\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<FairMutex<Term<U>>>,\\n\\n event_proxy: U,\\n\\n pty: T,\\n\\n hold: bool,\\n\\n ref_test: bool,\\n\\n ) -> EventLoop<T, U> {\\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<Writing> {\\n\\n self.writing.take()\\n\",\n \"file_path\": \"alacritty_terminal/src/event_loop.rs\",\n \"rank\": 96,\n \"score\": 132385.51739821292\n }\n]","isConversational":false}}},{"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<Location>),\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<f64> {\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<F: 'static>(&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<Value>| {\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<Value>| {\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<Value>| {\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<Value>| {\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<Value, EvalError>;\n\n#[derive(Clone)]\npub struct Proc {\n inner: Rc<dyn Fn(&[Value], ExprCont) -> CommCont>,\n}\n\nimpl Proc {\n fn new(inner: Rc<dyn Fn(&[Value], ExprCont) -> 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<dyn Fn(&mut Store) -> Answer>;\npub type ExprCont = Rc<dyn Fn(Vec<Value>) -> 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 => \"<unspecified>\".to_string(),\n Undefined => \"<undefined>\".to_string(),\n Procedure(_) => \"<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<Location>),\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<f64> {\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<F: 'static>(&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<Value>| {\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<Value>| {\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<Value>| {\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<Value>| {\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<Value, EvalError>;\n\n#[derive(Clone)]\npub struct Proc {\n inner: Rc<dyn Fn(&[Value], ExprCont) -> CommCont>,\n}\n\nimpl Proc {\n fn new(inner: Rc<dyn Fn(&[Value], ExprCont) -> 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<dyn Fn(&mut Store) -> Answer>;\npub type ExprCont = Rc<dyn Fn(Vec<Value>) -> 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 => \"<unspecified>\".to_string(),\n Undefined => \"<undefined>\".to_string(),\n Procedure(_) => \"<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: 'static>(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: 'static>(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: 'static>(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<dyn Fn(&[Location]) -> 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<dyn Fn(&[Location]) -> 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<AST> {\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::<Option<Vec<_>>>()?;\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::<Option<Vec<_>>>()?;\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<Location> {\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<RefCell<Value>>);\n\n\n\npub type Env = Rc<RefCell<Environment>>;\n\n\n\n#[derive(Default, Clone)]\n\npub struct Environment {\n\n root: Option<Env>,\n\n inner: HashMap<String, Location>,\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<Datum>, Box<Datum>),\n\n Abbrev(Box<Datum>),\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub enum Formals {\n\n List(Vec<String>),\n\n Dot(Vec<String>, String),\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub enum Def {\n\n Variable(String, Box<Expr>),\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<Expr> {\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<Expr>, Vec<Expr>), // procedure call\n\n Lambda(Formals, Vec<Def>, Vec<Expr>), // lambda expression\n\n Cond(Box<Expr>, Box<Expr>, Option<Box<Expr>>), // conditional\n\n Assignment(String, Box<Expr>), // 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<String> {\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<Datum> {\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<Datum>),\n\n}\n\n\n\n#[derive(Clone, Debug, PartialEq)]\n\npub enum ListDatum {\n\n List(Vec<Datum>),\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<I>\n\nwhere\n\n I: Iterator,\n\n{\n\n inner: I,\n\n first: Option<I::Item>,\n\n second: Option<I::Item>,\n\n}\n\n\n\nimpl<I> Lookahead<I>\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<AST>, Vec<AST>),\n\n Lambda(Formals, Vec<AST>, Box<AST>),\n\n Cond(Box<AST>, Box<AST>, Option<Box<AST>>),\n\n Assign(String, Box<AST>),\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<Datum> {\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<char> {\n\n self.chars.clone().next()\n\n }\n\n\n\n pub fn eat(&mut self) -> Option<char> {\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<P: Fn(char) -> 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<Token> {\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<TokenKind> {\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<TokenKind> {\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<TokenKind> {\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<Expr> {\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<TokenKind> {\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<Formals> {\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<Self::Item> {\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<Expr> {\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<Expr> {\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<Vec<Expr>> {\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<Token> {\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<P: Fn(char) -> 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<P: Fn(char) -> 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<Def> {\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<Datum> {\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<Datum> {\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<I> Iterator for Lookahead<I>\n\nwhere\n\n I: Iterator,\n\n{\n\n type Item = I::Item;\n\n\n\n fn next(&mut self) -> Option<Self::Item> {\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<Lexer<'a>>,\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: 'static>(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: 'static>(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: 'static>(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<dyn Fn(&[Location]) -> 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<dyn Fn(&[Location]) -> 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<AST> {\\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::<Option<Vec<_>>>()?;\\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::<Option<Vec<_>>>()?;\\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<Location> {\\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<RefCell<Value>>);\\n\\n\\n\\npub type Env = Rc<RefCell<Environment>>;\\n\\n\\n\\n#[derive(Default, Clone)]\\n\\npub struct Environment {\\n\\n root: Option<Env>,\\n\\n inner: HashMap<String, Location>,\\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<Datum>, Box<Datum>),\\n\\n Abbrev(Box<Datum>),\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub enum Formals {\\n\\n List(Vec<String>),\\n\\n Dot(Vec<String>, String),\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub enum Def {\\n\\n Variable(String, Box<Expr>),\\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<Expr> {\\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<Expr>, Vec<Expr>), // procedure call\\n\\n Lambda(Formals, Vec<Def>, Vec<Expr>), // lambda expression\\n\\n Cond(Box<Expr>, Box<Expr>, Option<Box<Expr>>), // conditional\\n\\n Assignment(String, Box<Expr>), // 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<String> {\\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<Datum> {\\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<Datum>),\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, PartialEq)]\\n\\npub enum ListDatum {\\n\\n List(Vec<Datum>),\\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<I>\\n\\nwhere\\n\\n I: Iterator,\\n\\n{\\n\\n inner: I,\\n\\n first: Option<I::Item>,\\n\\n second: Option<I::Item>,\\n\\n}\\n\\n\\n\\nimpl<I> Lookahead<I>\\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<AST>, Vec<AST>),\\n\\n Lambda(Formals, Vec<AST>, Box<AST>),\\n\\n Cond(Box<AST>, Box<AST>, Option<Box<AST>>),\\n\\n Assign(String, Box<AST>),\\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<Datum> {\\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<char> {\\n\\n self.chars.clone().next()\\n\\n }\\n\\n\\n\\n pub fn eat(&mut self) -> Option<char> {\\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<P: Fn(char) -> 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<Token> {\\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<TokenKind> {\\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<TokenKind> {\\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<TokenKind> {\\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<Expr> {\\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<TokenKind> {\\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<Formals> {\\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<Self::Item> {\\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<Expr> {\\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<Expr> {\\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<Vec<Expr>> {\\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<Token> {\\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<P: Fn(char) -> 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<P: Fn(char) -> 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<Def> {\\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<Datum> {\\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<Datum> {\\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<I> Iterator for Lookahead<I>\\n\\nwhere\\n\\n I: Iterator,\\n\\n{\\n\\n type Item = I::Item;\\n\\n\\n\\n fn next(&mut self) -> Option<Self::Item> {\\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<Lexer<'a>>,\\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]","isConversational":false}}},{"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<File>, 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::<Option<u16>, _, _>(\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::<f64>(0)?;\n\n let length_factor = ctx.get::<f64>(1)?;\n\n let exit_factor = ctx.get::<f64>(2)?;\n\n let recent_failure_factor = ctx.get::<f64>(3)?;\n\n let selected_dir_factor = ctx.get::<f64>(4)?;\n\n let dir_factor = ctx.get::<f64>(5)?;\n\n let overlap_factor = ctx.get::<f64>(6)?;\n\n let immediate_overlap_factor = ctx.get::<f64>(7)?;\n\n let selected_occurrences_factor = ctx.get::<f64>(8)?;\n\n let occurrences_factor = ctx.get::<f64>(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<File>) {\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::<Vec<String>>();\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<String> {\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::<Vec<String>>()\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::<Vec<String>>();\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<String> {\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<String> = 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<String> {\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: Into<String>>(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<S: Into<String>>(&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<i64>,\n\n pub exit_code: Option<i32>,\n\n pub selected: bool,\n\n pub dir: Option<String>,\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<Command> 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<String>, num: i16, offset: u16, random: bool) -> Vec<Command> {\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<F>(&self, records: Option<usize>, 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::<Vec<&Command>>())\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: Into<String>>(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<i64>,\n\n pub exit_code: Option<i32>,\n\n pub old_dir: Option<String>,\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<i64>,\n\n exit_code: Option<i32>,\n\n old_dir: &Option<String>,\n\n ) {\n\n self.possibly_update_paths(command, exit_code);\n\n let selected = self.determine_if_selected_from_ui(command, session_id, dir);\n\n let simplified_command = SimplifiedCommand::new(command, true);\n\n self.connection.execute_named(\"INSERT INTO commands (cmd, cmd_tpl, session_id, when_run, exit_code, selected, dir, old_dir) VALUES (:cmd, :cmd_tpl, :session_id, :when_run, :exit_code, :selected, :dir, :old_dir)\",\n\n &[\n\n (\":cmd\", &command.to_owned()),\n","file_path":"src/history/history.rs","rank":74,"score":8.189390052651643},{"content":" } else {\n\n // Don't try to handle non-utf8 filenames, at least for now.\n\n return;\n\n }\n\n }\n\n\n\n let to_pathbuf = PathBuf::from(&normalized_to);\n\n if to_pathbuf.exists() && to_pathbuf.is_dir() {\n\n self.update_paths(&normalized_from, &normalized_to, false);\n\n }\n\n }\n\n }\n\n }\n\n\n\n pub fn find_matches(&self, cmd: &str, num: i16) -> Vec<Command> {\n\n let mut like_query = \"%\".to_string();\n\n like_query.push_str(cmd);\n\n like_query.push_str(\"%\");\n\n\n\n let query = \"SELECT id, cmd, cmd_tpl, session_id, when_run, exit_code, selected, dir, rank,\n","file_path":"src/history/history.rs","rank":75,"score":8.059899648001318},{"content":"use crate::command_input::{CommandInput, Move};\n\nuse crate::history::History;\n\n\n\nuse crate::fixed_length_grapheme_string::FixedLengthGraphemeString;\n\nuse crate::history::Command;\n\nuse crate::history_cleaner;\n\nuse crate::settings::Settings;\n\nuse crate::settings::KeyScheme;\n\nuse std::io::{stdin, stdout, Write};\n\nuse termion::color;\n\nuse termion::event::Key;\n\nuse termion::input::TermRead;\n\nuse termion::raw::IntoRawMode;\n\nuse termion::screen::AlternateScreen;\n\nuse termion::{clear, cursor, terminal_size};\n\n\n\npub struct Interface<'a> {\n\n history: &'a History,\n\n settings: &'a Settings,\n\n input: CommandInput,\n","file_path":"src/interface.rs","rank":76,"score":8.036056323355927},{"content":" batch_error += error;\n\n batch_samples += 1.0;\n\n\n\n let d_e_d_o_3 = -(target - network.final_output);\n\n let d_o_3_d_s_3 = 1.0 - network.final_sum.tanh().powi(2);\n\n\n\n // Output bias\n\n output_increments[0] = momentum * output_increments[0] + lr * d_e_d_o_3 * d_o_3_d_s_3 * 1.0;\n\n // Final sum node 1 output weight\n\n output_increments[1] = momentum * output_increments[1] + lr * d_e_d_o_3 * d_o_3_d_s_3 * network.hidden_node_outputs[0];\n\n // Final sum node 2 output weight\n\n output_increments[2] = momentum * output_increments[2] + lr * d_e_d_o_3 * d_o_3_d_s_3 * network.hidden_node_outputs[1];\n\n // Final sum node 3 output weight\n\n output_increments[3] = momentum * output_increments[3] + lr * d_e_d_o_3 * d_o_3_d_s_3 * network.hidden_node_outputs[2];\n\n\n\n let d_s_3_d_o_0 = network.final_weights[0];\n\n let d_s_3_d_o_1 = network.final_weights[1];\n\n let d_s_3_d_o_2 = network.final_weights[2];\n\n let d_o_0_d_s_0 = 1.0 - network.hidden_node_sums[0].tanh().powi(2);\n\n let d_o_1_d_s_1 = 1.0 - network.hidden_node_sums[1].tanh().powi(2);\n","file_path":"src/trainer.rs","rank":77,"score":7.819951137942267},{"content":" tmp = 0;\n\n } else if tmp > self.len as isize {\n\n tmp = self.len as isize;\n\n }\n\n self.cursor = tmp as usize;\n\n }\n\n\n\n pub fn delete(&mut self, cmd: Move) {\n\n let mut new_command = String::with_capacity(self.command.len());\n\n let command_copy = self.command.to_owned();\n\n let vec = command_copy.grapheme_indices(true);\n\n\n\n match cmd {\n\n Move::Backward => {\n\n if self.cursor == 0 {\n\n return;\n\n }\n\n self.move_cursor(Move::Backward);\n\n\n\n for (count, (_, item)) in vec.enumerate() {\n","file_path":"src/command_input.rs","rank":78,"score":7.800533078407302},{"content":"use unicode_segmentation::UnicodeSegmentation;\n\n\n\nconst TRUNCATE_TO_N_TOKENS: u16 = 2;\n\n\n\n#[derive(Debug)]\n\npub struct SimplifiedCommand {\n\n pub original: String,\n\n pub result: String,\n\n pub truncate: bool,\n\n}\n\n\n\n#[allow(clippy::collapsible_if)]\n\n/// The goal of SimplifiedCommand is to produce a reduced approximation of the given command for template matching. It may\n\n/// not produce an exact simplification. (For example, it does not handle deeply nested escaping, and it drops escape characters.)\n\n/// Possible enhancements:\n\n/// - Sort and expand command line options.\n\n/// - Check to see if unknown strings represent valid local paths in the directory where the command was run.\n\nimpl SimplifiedCommand {\n\n pub fn new<S: Into<String>>(command: S, truncate: bool) -> SimplifiedCommand {\n\n let mut simplified_command = SimplifiedCommand {\n","file_path":"src/simplified_command.rs","rank":79,"score":7.666363527291704},{"content":"\n\n pub fn record_selected_from_ui(&self, command: &str, session_id: &str, dir: &str) {\n\n self.connection.execute_named(\"INSERT INTO selected_commands (cmd, session_id, dir) VALUES (:cmd, :session_id, :dir)\",\n\n &[\n\n (\":cmd\", &command.to_owned()),\n\n (\":session_id\", &session_id.to_owned()),\n\n (\":dir\", &dir.to_owned())\n\n ]).unwrap_or_else(|err| panic!(format!(\"McFly error: Insert into selected_commands to work ({})\", err)));\n\n }\n\n\n\n // Update historical paths in our database if a directory has been renamed or moved.\n\n pub fn possibly_update_paths(&self, command: &str, exit_code: Option<i32>) {\n\n let successful = exit_code.is_none() || exit_code.unwrap() == 0;\n\n let is_move = |c:&str| c.to_lowercase().starts_with(\"mv \")\n\n && !c.contains('*')\n\n && !c.contains('?');\n\n if successful && is_move(command) {\n\n let parts = path_update_helpers::parse_mv_command(command);\n\n if parts.len() == 2 {\n\n let normalized_from = path_update_helpers::normalize_path(&parts[0]);\n","file_path":"src/history/history.rs","rank":80,"score":7.664434038150662},{"content":" /* percentage of time this command is run relative to the most common command (1: this is the most common command, 0: this is the least common command) */\n\n COUNT(*) / :max_occurrences AS occurrences_factor\n\n\n\n FROM commands c WHERE when_run > :start_time AND when_run < :end_time GROUP BY cmd ORDER BY id DESC;\",\n\n &[\n\n (\":when_run_max\", &when_run_max),\n\n (\":history_duration\", &(when_run_max - when_run_min)),\n\n (\":directory\", &dir.to_owned()),\n\n (\":max_occurrences\", &max_occurrences),\n\n (\":max_length\", &max_length),\n\n (\":max_selected_occurrences\", &max_selected_occurrences),\n\n (\":lookback\", &lookback),\n\n (\":lookback_f64\", &(lookback as f64)),\n\n (\":last_commands0\", &last_commands[0].to_owned()),\n\n (\":last_commands1\", &last_commands[1].to_owned()),\n\n (\":last_commands2\", &last_commands[2].to_owned()),\n\n (\":start_time\", &start_time.unwrap_or(0).to_owned()),\n\n (\":end_time\", &end_time.unwrap_or(SystemTime::now().duration_since(UNIX_EPOCH).unwrap_or_else(|err| panic!(format!(\"McFly error: Time went backwards ({})\", err))).as_secs() as i64).to_owned()),\n\n (\":now\", &now.unwrap_or(SystemTime::now().duration_since(UNIX_EPOCH).unwrap_or_else(|err| panic!(format!(\"McFly error: Time went backwards ({})\", err))).as_secs() as i64).to_owned())\n\n ]).unwrap_or_else(|err| panic!(format!(\"McFly error: Creation of temp table to work ({})\", err)));\n","file_path":"src/history/history.rs","rank":81,"score":7.517174577274475},{"content":"use crate::history::Features;\n\nuse csv::Writer;\n\nuse std::fs::File;\n\nuse csv::Reader;\n\nuse std::path::PathBuf;\n\n\n","file_path":"src/training_cache.rs","rank":82,"score":7.059579217762275},{"content":" if command.cmd.is_empty() { continue; }\n\n\n\n if i % 100 == 0 {\n\n println!(\"Done with {}\", i);\n\n }\n\n\n\n // Setup the cache for the time this command was recorded.\n\n // Unwrap is safe here because we check command.dir.is_none() above.\n\n history.build_cache_table(\n\n &command.dir.to_owned().unwrap(),\n\n &Some(command.session_id.clone()),\n\n None,\n\n command.when_run,\n\n command.when_run,\n\n );\n\n\n\n // Load the entire match set.\n\n let results = history.find_matches(&String::new(), -1);\n\n\n\n // Get the features for this command at the time it was logged.\n","file_path":"src/training_sample_generator.rs","rank":83,"score":6.773572679483965},{"content":"use crate::simplified_command::SimplifiedCommand;\n\nuse rusqlite::{Connection, NO_PARAMS};\n\nuse std::io;\n\nuse std::io::Write;\n\n\n\npub const CURRENT_SCHEMA_VERSION: u16 = 3;\n\n\n","file_path":"src/history/schema.rs","rank":84,"score":6.67718038183284},{"content":" query_map_named(params, closure).\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\n\n\n pub fn last_command(&self, session_id: &Option<String>) -> Option<Command> {\n\n self.commands(session_id, 1, 0, false)\n\n .get(0)\n\n .cloned()\n\n }\n\n\n\n pub fn last_command_templates(\n","file_path":"src/history/history.rs","rank":85,"score":6.651141141204207},{"content":"use core::mem;\n\nuse std::fmt;\n\nuse unicode_segmentation::UnicodeSegmentation;\n\n\n\n#[derive(Debug)]\n\npub enum InputCommand {\n\n Insert(char),\n\n Backspace,\n\n Delete,\n\n Move(Move),\n\n}\n\n\n\n#[derive(Debug)]\n\npub enum Move {\n\n BOL,\n\n EOL,\n\n BackwardWord,\n\n ForwardWord,\n\n Backward,\n\n Forward,\n","file_path":"src/command_input.rs","rank":86,"score":6.647073336406802},{"content":" // Hidden node 2 output (o_2) = tanh(s_2)\n\n // Hidden node 2 sum (s_2) = b_2 + w2_1*f_1 + w2_2*f_2\n\n // Derivative of error with respect to o_3 (d_e/d_o_3 0.5(t - o_3)^2): -(t - o_3)\n\n // Derivative of o_3 respect to s_3 (d_o_3/d_s_3 tanh(s_3)): 1.0 - tanh(s_3)^2\n\n // Derivative of s_3 with respect to weight w3_1 (d_s_3/d_w3_1 bias + w3_1*o_1 + w3_2*o_2): o_1\n\n // Derivative of error with respect to weight w3_1 (d_e/d_o_3 * d_o_3/d_s_3 * d_s_3/d_w3_1): -(t - o_3) * (1 - tanh(s_3)^2) * o_1\n\n // Derivative of s_3 with respect to o_1 (d_s_3/d_o_1 b_3 + w3_1*o_1 + w3_2*o_2): w3_1\n\n // Derivative of o_1 with respect to s_1 (d_o_1/d_s_1): 1.0 - tanh(s_1)^2\n\n // Derivative of s_1 with respect to weight w1_1 (d_s_1/d_w1_1): f_1\n\n // Full derivation of o_3: tanh(b_3 + w3_1*tanh(b_1 + w1_1*f_1 + w1_2*f_2) + w3_2*tanh(b_2 + w2_1*f_1 + w2_2*f_2))\n\n // Full derivation of s_3: b_3 + w3_1*tanh(b_1 + w1_1*f_1 + w1_2*f_2) + w3_2*tanh(b_2 + w2_1*f_1 + w2_2*f_2)\n\n // Full error derivation: 0.5(t - tanh(b_3 + w3_1*tanh(b_1 + w1_1*f_1 + w1_2*f_2) + w3_2*tanh(b_2 + w2_1*f_1 + w2_2*f_2)))^2\n\n // Full derivative for o_1: -(t - o_3) * (1.0 - tanh(s_3)^2) * w3_1\n\n // Full derivative for w1_1: -(t - o_3) * (1.0 - tanh(s_3)^2) * w3_1 * (1.0 - tanh(s_1)^2) * f_1\n\n // Checked: https://www.wolframcloud.com/objects/617707c2-5016-4fb3-b73d-bd688b884967\n\n generator.generate(Some(batch_size), |features: &Features, correct: bool| {\n\n let target = if correct { 1.0 } else { -1.0 };\n\n network.compute(features);\n\n\n\n let error = 0.5 * (target - network.final_output).powi(2);\n","file_path":"src/trainer.rs","rank":87,"score":6.404952648403816},{"content":"\n\n settings.when_run = Some(\n\n value_t!(add_matches, \"when\", i64).unwrap_or(SystemTime::now()\n\n .duration_since(UNIX_EPOCH)\n\n .unwrap_or_else(|err| panic!(format!(\"McFly error: Time went backwards ({})\", err)))\n\n .as_secs()\n\n as i64),\n\n );\n\n\n\n settings.append_to_histfile = add_matches.is_present(\"append_to_histfile\");\n\n\n\n if add_matches.value_of(\"exit\").is_some() {\n\n settings.exit_code =\n\n Some(value_t!(add_matches, \"exit\", i32).unwrap_or_else(|e| e.exit()));\n\n }\n\n\n\n if let Some(dir) = add_matches.value_of(\"directory\") {\n\n settings.dir = dir.to_string();\n\n } else {\n\n settings.dir = env::var(\"PWD\").unwrap_or_else(|err| panic!(format!(\"McFly error: Unable to determine current directory ({})\", err)));\n","file_path":"src/settings.rs","rank":88,"score":6.25501773511613},{"content":"\n\n let mut names = Vec::new();\n\n for command in command_iter {\n\n names.push(command.unwrap_or_else(|err| panic!(format!(\"McFly error: Unable to load command from DB ({})\", err))));\n\n }\n\n\n\n names\n\n }\n\n\n\n pub fn build_cache_table(\n\n &self,\n\n dir: &str,\n\n session_id: &Option<String>,\n\n start_time: Option<i64>,\n\n end_time: Option<i64>,\n\n now: Option<i64>,\n\n ) {\n\n let lookback: u16 = 3;\n\n\n\n let mut last_commands = self.last_command_templates(session_id, lookback as i16, 0);\n","file_path":"src/history/history.rs","rank":89,"score":6.2018861291648495},{"content":" debug: settings.debug,\n\n run: false,\n\n menu_mode: MenuMode::Normal,\n\n in_vim_insert_mode: false\n\n }\n\n }\n\n\n\n pub fn display(&mut self) -> SelectionResult {\n\n self.build_cache_table();\n\n self.select();\n\n\n\n let command = self.input.command.to_owned();\n\n\n\n if command.chars().any(|c| !c.is_whitespace()) {\n\n self.history.record_selected_from_ui(\n\n &command,\n\n &self.settings.session_id,\n\n &self.settings.dir,\n\n );\n\n SelectionResult {\n","file_path":"src/interface.rs","rank":90,"score":6.180962845679868},{"content":" original: command.into().clone(),\n\n result: String::new(),\n\n truncate,\n\n };\n\n simplified_command.simplify();\n\n simplified_command\n\n }\n\n\n\n fn simplify(&mut self) {\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 tokens = 0;\n\n\n\n for grapheme in self.original.graphemes(true) {\n\n match grapheme {\n\n \"\\\\\" => {\n\n escaped = true;\n\n }\n","file_path":"src/simplified_command.rs","rank":91,"score":6.148870267309356},{"content":"use libc;\n\n\n\n// Should we be using https://docs.rs/libc/0.2.44/libc/fn.ioctl.html instead?\n\nextern \"C\" {\n\n pub fn ioctl(fd: i8, request: u32, arg: *const u8) -> i8;\n\n}\n\n\n","file_path":"src/fake_typer.rs","rank":92,"score":6.088269763932789},{"content":" /// the cursor.\n\n fn previous_word_boundary(&self) -> usize {\n\n if self.cursor == 0 {\n\n return 0;\n\n }\n\n\n\n let mut word_boundaries = self.command\n\n .split_word_bound_indices()\n\n .map(|(i, _)| i)\n\n .collect::<Vec<usize>>();\n\n\n\n word_boundaries.push(self.command.len().to_owned());\n\n\n\n let mut word_index: usize = 0;\n\n let mut found_word: bool = false;\n\n let command_copy = self.command.to_owned();\n\n let vec = command_copy\n\n .grapheme_indices(true)\n\n .enumerate()\n\n .collect::<Vec<(usize, (usize, &str))>>();\n","file_path":"src/command_input.rs","rank":93,"score":6.068105683603115},{"content":" (\":cmd_tpl\", &simplified_command.result.to_owned()),\n\n (\":session_id\", &session_id.to_owned()),\n\n (\":when_run\", &when_run.to_owned()),\n\n (\":exit_code\", &exit_code.to_owned()),\n\n (\":selected\", &selected),\n\n (\":dir\", &dir.to_owned()),\n\n (\":old_dir\", &old_dir.to_owned()),\n\n ]).unwrap_or_else(|err| panic!(format!(\"McFly error: Insert into commands to work ({})\", err)));\n\n }\n\n\n\n fn determine_if_selected_from_ui(\n\n &self,\n\n command: &str,\n\n session_id: &str,\n\n dir: &str,\n\n ) -> bool {\n\n let rows_affected = self.connection\n\n .execute_named(\n\n \"DELETE FROM selected_commands \\\n\n WHERE cmd = :cmd \\\n","file_path":"src/history/history.rs","rank":94,"score":6.063705514004625},{"content":"[](https://travis-ci.org/cantino/mcfly)\n\n[](https://crates.io/crates/mcfly)\n\n\n\n# McFly - fly through your shell history\n\n\n\n<img src=\"/docs/screenshot.png\" alt=\"screenshot\" width=\"400\">\n\n\n\nMcFly replaces your default `ctrl-r` Bash history search with an intelligent search engine that takes into account\n\nyour working directory and the context of recently executed commands. McFly's suggestions are prioritized\n\nin real time with a small neural network.\n\n \n\nTL;DR: an upgraded `ctrl-r` for Bash whose history results make sense for what you're working on right now.\n\n\n\n## Features\n\n\n\n* Rebinds `ctrl-r` to bring up a full-screen reverse history search prioritized with a small neural network.\n\n* Augments your shell history to track command exit status, timestamp, and execution directory in a SQLite database.\n\n* Maintains your normal Bash history file as well so that you can stop using McFly whenever you want.\n\n* Unicode support throughout.\n\n* Includes a simple action to scrub any history item from the McFly database and your shell history files.\n\n* Designed to be extensible for other shells in the future.\n\n* Written in Rust, so it's fast and safe.\n\n\n\n## Prioritization\n\n\n\nThe key feature of McFly is smart command prioritization powered by a small neural network that runs\n\nin real time. The goal is for the command you want to run to always be one of the top suggestions.\n\n\n\nWhen suggesting a command, McFly takes into consideration:\n\n\n\n* The directory where you ran the command. You're likely to run that command in the same directory in the future.\n\n* What commands you typed before the command (e.g., the command's execution context).\n\n* How often you run the command.\n\n* When you last ran the command.\n\n* If you've selected the command in McFly before.\n\n* The command's historical exit status. You probably don't want to run old failed commands.\n\n\n\n## Installation\n\n\n","file_path":"README.md","rank":95,"score":6.027897906553508},{"content":" let mut next_word_index: usize = 0;\n\n let mut found_word: bool = false;\n\n\n\n for (count, (offset, item)) in grapheme_indices.enumerate() {\n\n if count >= self.cursor {\n\n if !found_word && item == \" \" {\n\n continue; // Ignore leading spaces\n\n } else if found_word {\n\n if offset == word_boundaries[next_word_index] {\n\n // We've found the next word boundary.\n\n return count;\n\n }\n\n } else {\n\n found_word = true;\n\n\n\n while word_boundaries[next_word_index] <= offset {\n\n next_word_index += 1;\n\n }\n\n }\n\n }\n","file_path":"src/command_input.rs","rank":96,"score":6.004041514126592},{"content":" fn truncate_for_display(\n\n command: &Command,\n\n search: &str,\n\n width: u16,\n\n highlight_color: String,\n\n base_color: String,\n\n debug: bool,\n\n ) -> String {\n\n let mut prev = 0;\n\n let debug_space = if debug { 90 } else { 0 };\n\n let max_grapheme_length = if width > debug_space {\n\n width - debug_space\n\n } else {\n\n 2\n\n };\n\n let mut out = FixedLengthGraphemeString::empty(max_grapheme_length);\n\n\n\n let lowercase_search = search.to_lowercase();\n\n let lowercase_cmd = command.cmd.to_lowercase();\n\n let search_len = search.len();\n","file_path":"src/interface.rs","rank":97,"score":5.863551028101107},{"content":" None => false\n\n };\n\n settings.key_scheme = match env::var(\"MCFLY_KEY_SCHEME\").as_ref().map(String::as_ref) {\n\n Ok(\"vim\") => KeyScheme::Vim,\n\n _ => KeyScheme::Emacs\n\n };\n\n\n\n settings\n\n }\n\n\n\n pub fn mcfly_training_cache_path() -> PathBuf {\n\n Settings::storage_dir_path().join(PathBuf::from(\"training-cache.v1.csv\"))\n\n }\n\n\n\n pub fn storage_dir_path() -> PathBuf {\n\n home_dir()\n\n .unwrap_or_else(|| panic!(\"McFly error: Unable to access home directory\"))\n\n .join(PathBuf::from(\".mcfly\"))\n\n }\n\n\n\n pub fn mcfly_db_path() -> PathBuf {\n\n Settings::storage_dir_path().join(PathBuf::from(\"history.db\"))\n\n }\n\n}\n","file_path":"src/settings.rs","rank":98,"score":5.8498547598953845},{"content":" }\n\n }\n\n\n\n (\"train\", Some(train_matches)) => {\n\n settings.mode = Mode::Train;\n\n settings.refresh_training_cache = train_matches.is_present(\"refresh_cache\");\n\n }\n\n\n\n (\"move\", Some(move_matches)) => {\n\n settings.mode = Mode::Move;\n\n settings.old_dir = Some(String::from(move_matches.value_of(\"old_dir_path\").unwrap_or_else(|| panic!(\"McFly error: Expected value for old_dir_path\"))));\n\n settings.dir = String::from(move_matches.value_of(\"new_dir_path\").unwrap_or_else(|| panic!(\"McFly error: Expected value for new_dir_path\")));\n\n }\n\n\n\n (\"\", None) => println!(\"No subcommand was used\"), // If no subcommand was used it'll match the tuple (\"\", None)\n\n _ => unreachable!(), // If all subcommands are defined above, anything else is unreachable!()\n\n }\n\n\n\n settings.lightmode = match env::var_os(\"MCFLY_LIGHT\") {\n\n Some(_val) => true,\n","file_path":"src/settings.rs","rank":99,"score":5.616000332968991}],"string":"[\n {\n \"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\",\n \"file_path\": \"src/fake_typer.rs\",\n \"rank\": 0,\n \"score\": 89140.51610810748\n },\n {\n \"content\": \"fn output_row(writer: &mut Writer<File>, 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\",\n \"file_path\": \"src/training_cache.rs\",\n \"rank\": 1,\n \"score\": 77339.90674662417\n },\n {\n \"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\",\n \"file_path\": \"src/training_cache.rs\",\n \"rank\": 2,\n \"score\": 72755.75198182782\n },\n {\n \"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\",\n \"file_path\": \"src/training_cache.rs\",\n \"rank\": 3,\n \"score\": 70728.34004358845\n },\n {\n \"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::<Option<u16>, _, _>(\\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\",\n \"file_path\": \"src/history/schema.rs\",\n \"rank\": 4,\n \"score\": 69608.51234032755\n },\n {\n \"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\",\n \"file_path\": \"src/bash_history.rs\",\n \"rank\": 5,\n \"score\": 67134.50407950423\n },\n {\n \"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\",\n \"file_path\": \"src/history/schema.rs\",\n \"rank\": 6,\n \"score\": 65676.29177772088\n },\n {\n \"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::<f64>(0)?;\\n\\n let length_factor = ctx.get::<f64>(1)?;\\n\\n let exit_factor = ctx.get::<f64>(2)?;\\n\\n let recent_failure_factor = ctx.get::<f64>(3)?;\\n\\n let selected_dir_factor = ctx.get::<f64>(4)?;\\n\\n let dir_factor = ctx.get::<f64>(5)?;\\n\\n let overlap_factor = ctx.get::<f64>(6)?;\\n\\n let immediate_overlap_factor = ctx.get::<f64>(7)?;\\n\\n let selected_occurrences_factor = ctx.get::<f64>(8)?;\\n\\n let occurrences_factor = ctx.get::<f64>(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\",\n \"file_path\": \"src/history/db_extensions.rs\",\n \"rank\": 7,\n \"score\": 63960.989204976664\n },\n {\n \"content\": \"fn output_header(writer: &mut Writer<File>) {\\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\",\n \"file_path\": \"src/training_cache.rs\",\n \"rank\": 8,\n \"score\": 63941.97095862917\n },\n {\n \"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\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 9,\n \"score\": 61813.14369458346\n },\n {\n \"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\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 10,\n \"score\": 61813.14369458346\n },\n {\n \"content\": \"fn handle_train(settings: &Settings, history: &mut History) {\\n\\n Trainer::new(settings, history).train();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 11,\n \"score\": 61813.14369458346\n },\n {\n \"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::<Vec<String>>();\\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\",\n \"file_path\": \"src/bash_history.rs\",\n \"rank\": 12,\n \"score\": 60933.71035962482\n },\n {\n \"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\",\n \"file_path\": \"src/path_update_helpers.rs\",\n \"rank\": 13,\n \"score\": 59847.82575198195\n },\n {\n \"content\": \"pub fn full_history(path: &PathBuf) -> Vec<String> {\\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::<Vec<String>>()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bash_history.rs\",\n \"rank\": 14,\n \"score\": 57772.13250976625\n },\n {\n \"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::<Vec<String>>();\\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\",\n \"file_path\": \"src/bash_history.rs\",\n \"rank\": 15,\n \"score\": 57772.13250976625\n },\n {\n \"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\",\n \"file_path\": \"src/bash_history.rs\",\n \"rank\": 16,\n \"score\": 56320.23058608254\n },\n {\n \"content\": \"pub fn parse_mv_command(command: &str) -> Vec<String> {\\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<String> = 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\",\n \"file_path\": \"src/path_update_helpers.rs\",\n \"rank\": 17,\n \"score\": 56320.23058608254\n },\n {\n \"content\": \"pub fn last_history_line(path: &PathBuf) -> Option<String> {\\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\",\n \"file_path\": \"src/bash_history.rs\",\n \"rank\": 18,\n \"score\": 56320.23058608254\n },\n {\n \"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\",\n \"file_path\": \"src/history_cleaner.rs\",\n \"rank\": 19,\n \"score\": 54579.948368321464\n },\n {\n \"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\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 20,\n \"score\": 45499.73857536139\n },\n {\n \"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\",\n \"file_path\": \"src/history/schema.rs\",\n \"rank\": 21,\n \"score\": 33666.39164644902\n },\n {\n \"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\",\n \"file_path\": \"src/history/schema.rs\",\n \"rank\": 22,\n \"score\": 33666.39164644902\n },\n {\n \"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\",\n \"file_path\": \"src/bash_history.rs\",\n \"rank\": 23,\n \"score\": 33077.44954993237\n },\n {\n \"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\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 24,\n \"score\": 31862.54326259064\n },\n {\n \"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\",\n \"file_path\": \"src/bash_history.rs\",\n \"rank\": 25,\n \"score\": 30514.204973013842\n },\n {\n \"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\",\n \"file_path\": \"src/node.rs\",\n \"rank\": 26,\n \"score\": 29912.50903173243\n },\n {\n \"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\",\n \"file_path\": \"src/node.rs\",\n \"rank\": 27,\n \"score\": 29904.23671344071\n },\n {\n \"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\",\n \"file_path\": \"src/node.rs\",\n \"rank\": 28,\n \"score\": 29897.688057811858\n },\n {\n \"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\",\n \"file_path\": \"src/history/schema.rs\",\n \"rank\": 36,\n \"score\": 29087.36113972865\n },\n {\n \"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\",\n \"file_path\": \"src/history_cleaner.rs\",\n \"rank\": 37,\n \"score\": 28578.818596897443\n },\n {\n \"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: Into<String>>(s: S, max_grapheme_length: u16) -> FixedLengthGraphemeString {\\n\\n let mut fixed_length_grapheme_string =\\n\",\n \"file_path\": \"src/fixed_length_grapheme_string.rs\",\n \"rank\": 38,\n \"score\": 25044.323453196896\n },\n {\n \"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<S: Into<String>>(&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\",\n \"file_path\": \"src/fixed_length_grapheme_string.rs\",\n \"rank\": 39,\n \"score\": 25041.043346819057\n },\n {\n \"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\",\n \"file_path\": \"src/fixed_length_grapheme_string.rs\",\n \"rank\": 40,\n \"score\": 25039.03123647981\n },\n {\n \"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\",\n \"file_path\": \"src/trainer.rs\",\n \"rank\": 41,\n \"score\": 28.462234456081788\n },\n {\n \"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\",\n \"file_path\": \"src/trainer.rs\",\n \"rank\": 42,\n \"score\": 27.752867766317337\n },\n {\n \"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\",\n \"file_path\": \"src/trainer.rs\",\n \"rank\": 43,\n \"score\": 27.0498643621335\n },\n {\n \"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\",\n \"file_path\": \"src/trainer.rs\",\n \"rank\": 44,\n \"score\": 25.103203928561193\n },\n {\n \"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\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 45,\n \"score\": 21.192191288838593\n },\n {\n \"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<i64>,\\n\\n pub exit_code: Option<i32>,\\n\\n pub selected: bool,\\n\\n pub dir: Option<String>,\\n\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 46,\n \"score\": 21.113948943040203\n },\n {\n \"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\",\n \"file_path\": \"src/trainer.rs\",\n \"rank\": 47,\n \"score\": 19.456318622194587\n },\n {\n \"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<Command> 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\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 48,\n \"score\": 18.080807443994964\n },\n {\n \"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\",\n \"file_path\": \"src/interface.rs\",\n \"rank\": 49,\n \"score\": 14.835927805564841\n },\n {\n \"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\",\n \"file_path\": \"src/trainer.rs\",\n \"rank\": 50,\n \"score\": 14.233636049125655\n },\n {\n \"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\",\n \"file_path\": \"src/history/db_extensions.rs\",\n \"rank\": 51,\n \"score\": 13.985483677593157\n },\n {\n \"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\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 52,\n \"score\": 13.663961457337916\n },\n {\n \"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\",\n \"file_path\": \"src/trainer.rs\",\n \"rank\": 53,\n \"score\": 13.317087559396164\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn commands(&self, session_id: &Option<String>, num: i16, offset: u16, random: bool) -> Vec<Command> {\\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\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 54,\n \"score\": 12.39810459733944\n },\n {\n \"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\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 55,\n \"score\": 12.387688984599652\n },\n {\n \"content\": \"\\n\\n println!(\\\"Done!\\\");\\n\\n\\n\\n data_set\\n\\n }\\n\\n\\n\\n pub fn generate<F>(&self, records: Option<usize>, 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\",\n \"file_path\": \"src/training_sample_generator.rs\",\n \"rank\": 56,\n \"score\": 11.7534615925689\n },\n {\n \"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\",\n \"file_path\": \"src/training_sample_generator.rs\",\n \"rank\": 57,\n \"score\": 11.658602882473328\n },\n {\n \"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\",\n \"file_path\": \"src/trainer.rs\",\n \"rank\": 58,\n \"score\": 11.193090577883089\n },\n {\n \"content\": \"use rusqlite;\\n\\nuse rusqlite::Connection;\\n\\nuse crate::history::history::Features;\\n\\nuse crate::network::Network;\\n\\n\\n\",\n \"file_path\": \"src/history/db_extensions.rs\",\n \"rank\": 59,\n \"score\": 10.997498576742046\n },\n {\n \"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\",\n \"file_path\": \"src/training_sample_generator.rs\",\n \"rank\": 60,\n \"score\": 10.243557601541902\n },\n {\n \"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\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 61,\n \"score\": 10.189970509795302\n },\n {\n \"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::<Vec<&Command>>())\\n\\n {\\n\\n data_set.push((random_command.features.clone(), false));\\n\\n negative_examples += 1;\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/training_sample_generator.rs\",\n \"rank\": 62,\n \"score\": 10.139210910859843\n },\n {\n \"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\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 63,\n \"score\": 9.887830151362577\n },\n {\n \"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\",\n \"file_path\": \"src/command_input.rs\",\n \"rank\": 64,\n \"score\": 9.873555940457477\n },\n {\n \"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\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 65,\n \"score\": 9.524113840185743\n },\n {\n \"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\",\n \"file_path\": \"src/settings.rs\",\n \"rank\": 66,\n \"score\": 9.380028092497094\n },\n {\n \"content\": \"pub use self::history::{Command, Features, History};\\n\\n\\n\\nmod db_extensions;\\n\\nmod history;\\n\\nmod schema;\\n\",\n \"file_path\": \"src/history/mod.rs\",\n \"rank\": 67,\n \"score\": 9.057607658097634\n },\n {\n \"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\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 68,\n \"score\": 9.04318694062998\n },\n {\n \"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\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 69,\n \"score\": 8.871721658695522\n },\n {\n \"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\",\n \"file_path\": \"src/settings.rs\",\n \"rank\": 70,\n \"score\": 8.864538501817716\n },\n {\n \"content\": \"impl CommandInput {\\n\\n pub fn from<S: Into<String>>(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\",\n \"file_path\": \"src/command_input.rs\",\n \"rank\": 71,\n \"score\": 8.83164648518991\n },\n {\n \"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<i64>,\\n\\n pub exit_code: Option<i32>,\\n\\n pub old_dir: Option<String>,\\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\",\n \"file_path\": \"src/settings.rs\",\n \"rank\": 72,\n \"score\": 8.639407246926611\n },\n {\n \"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\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 73,\n \"score\": 8.57908806609486\n },\n {\n \"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<i64>,\\n\\n exit_code: Option<i32>,\\n\\n old_dir: &Option<String>,\\n\\n ) {\\n\\n self.possibly_update_paths(command, exit_code);\\n\\n let selected = self.determine_if_selected_from_ui(command, session_id, dir);\\n\\n let simplified_command = SimplifiedCommand::new(command, true);\\n\\n self.connection.execute_named(\\\"INSERT INTO commands (cmd, cmd_tpl, session_id, when_run, exit_code, selected, dir, old_dir) VALUES (:cmd, :cmd_tpl, :session_id, :when_run, :exit_code, :selected, :dir, :old_dir)\\\",\\n\\n &[\\n\\n (\\\":cmd\\\", &command.to_owned()),\\n\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 74,\n \"score\": 8.189390052651643\n },\n {\n \"content\": \" } else {\\n\\n // Don't try to handle non-utf8 filenames, at least for now.\\n\\n return;\\n\\n }\\n\\n }\\n\\n\\n\\n let to_pathbuf = PathBuf::from(&normalized_to);\\n\\n if to_pathbuf.exists() && to_pathbuf.is_dir() {\\n\\n self.update_paths(&normalized_from, &normalized_to, false);\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn find_matches(&self, cmd: &str, num: i16) -> Vec<Command> {\\n\\n let mut like_query = \\\"%\\\".to_string();\\n\\n like_query.push_str(cmd);\\n\\n like_query.push_str(\\\"%\\\");\\n\\n\\n\\n let query = \\\"SELECT id, cmd, cmd_tpl, session_id, when_run, exit_code, selected, dir, rank,\\n\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 75,\n \"score\": 8.059899648001318\n },\n {\n \"content\": \"use crate::command_input::{CommandInput, Move};\\n\\nuse crate::history::History;\\n\\n\\n\\nuse crate::fixed_length_grapheme_string::FixedLengthGraphemeString;\\n\\nuse crate::history::Command;\\n\\nuse crate::history_cleaner;\\n\\nuse crate::settings::Settings;\\n\\nuse crate::settings::KeyScheme;\\n\\nuse std::io::{stdin, stdout, Write};\\n\\nuse termion::color;\\n\\nuse termion::event::Key;\\n\\nuse termion::input::TermRead;\\n\\nuse termion::raw::IntoRawMode;\\n\\nuse termion::screen::AlternateScreen;\\n\\nuse termion::{clear, cursor, terminal_size};\\n\\n\\n\\npub struct Interface<'a> {\\n\\n history: &'a History,\\n\\n settings: &'a Settings,\\n\\n input: CommandInput,\\n\",\n \"file_path\": \"src/interface.rs\",\n \"rank\": 76,\n \"score\": 8.036056323355927\n },\n {\n \"content\": \" batch_error += error;\\n\\n batch_samples += 1.0;\\n\\n\\n\\n let d_e_d_o_3 = -(target - network.final_output);\\n\\n let d_o_3_d_s_3 = 1.0 - network.final_sum.tanh().powi(2);\\n\\n\\n\\n // Output bias\\n\\n output_increments[0] = momentum * output_increments[0] + lr * d_e_d_o_3 * d_o_3_d_s_3 * 1.0;\\n\\n // Final sum node 1 output weight\\n\\n output_increments[1] = momentum * output_increments[1] + lr * d_e_d_o_3 * d_o_3_d_s_3 * network.hidden_node_outputs[0];\\n\\n // Final sum node 2 output weight\\n\\n output_increments[2] = momentum * output_increments[2] + lr * d_e_d_o_3 * d_o_3_d_s_3 * network.hidden_node_outputs[1];\\n\\n // Final sum node 3 output weight\\n\\n output_increments[3] = momentum * output_increments[3] + lr * d_e_d_o_3 * d_o_3_d_s_3 * network.hidden_node_outputs[2];\\n\\n\\n\\n let d_s_3_d_o_0 = network.final_weights[0];\\n\\n let d_s_3_d_o_1 = network.final_weights[1];\\n\\n let d_s_3_d_o_2 = network.final_weights[2];\\n\\n let d_o_0_d_s_0 = 1.0 - network.hidden_node_sums[0].tanh().powi(2);\\n\\n let d_o_1_d_s_1 = 1.0 - network.hidden_node_sums[1].tanh().powi(2);\\n\",\n \"file_path\": \"src/trainer.rs\",\n \"rank\": 77,\n \"score\": 7.819951137942267\n },\n {\n \"content\": \" tmp = 0;\\n\\n } else if tmp > self.len as isize {\\n\\n tmp = self.len as isize;\\n\\n }\\n\\n self.cursor = tmp as usize;\\n\\n }\\n\\n\\n\\n pub fn delete(&mut self, cmd: Move) {\\n\\n let mut new_command = String::with_capacity(self.command.len());\\n\\n let command_copy = self.command.to_owned();\\n\\n let vec = command_copy.grapheme_indices(true);\\n\\n\\n\\n match cmd {\\n\\n Move::Backward => {\\n\\n if self.cursor == 0 {\\n\\n return;\\n\\n }\\n\\n self.move_cursor(Move::Backward);\\n\\n\\n\\n for (count, (_, item)) in vec.enumerate() {\\n\",\n \"file_path\": \"src/command_input.rs\",\n \"rank\": 78,\n \"score\": 7.800533078407302\n },\n {\n \"content\": \"use unicode_segmentation::UnicodeSegmentation;\\n\\n\\n\\nconst TRUNCATE_TO_N_TOKENS: u16 = 2;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct SimplifiedCommand {\\n\\n pub original: String,\\n\\n pub result: String,\\n\\n pub truncate: bool,\\n\\n}\\n\\n\\n\\n#[allow(clippy::collapsible_if)]\\n\\n/// The goal of SimplifiedCommand is to produce a reduced approximation of the given command for template matching. It may\\n\\n/// not produce an exact simplification. (For example, it does not handle deeply nested escaping, and it drops escape characters.)\\n\\n/// Possible enhancements:\\n\\n/// - Sort and expand command line options.\\n\\n/// - Check to see if unknown strings represent valid local paths in the directory where the command was run.\\n\\nimpl SimplifiedCommand {\\n\\n pub fn new<S: Into<String>>(command: S, truncate: bool) -> SimplifiedCommand {\\n\\n let mut simplified_command = SimplifiedCommand {\\n\",\n \"file_path\": \"src/simplified_command.rs\",\n \"rank\": 79,\n \"score\": 7.666363527291704\n },\n {\n \"content\": \"\\n\\n pub fn record_selected_from_ui(&self, command: &str, session_id: &str, dir: &str) {\\n\\n self.connection.execute_named(\\\"INSERT INTO selected_commands (cmd, session_id, dir) VALUES (:cmd, :session_id, :dir)\\\",\\n\\n &[\\n\\n (\\\":cmd\\\", &command.to_owned()),\\n\\n (\\\":session_id\\\", &session_id.to_owned()),\\n\\n (\\\":dir\\\", &dir.to_owned())\\n\\n ]).unwrap_or_else(|err| panic!(format!(\\\"McFly error: Insert into selected_commands to work ({})\\\", err)));\\n\\n }\\n\\n\\n\\n // Update historical paths in our database if a directory has been renamed or moved.\\n\\n pub fn possibly_update_paths(&self, command: &str, exit_code: Option<i32>) {\\n\\n let successful = exit_code.is_none() || exit_code.unwrap() == 0;\\n\\n let is_move = |c:&str| c.to_lowercase().starts_with(\\\"mv \\\")\\n\\n && !c.contains('*')\\n\\n && !c.contains('?');\\n\\n if successful && is_move(command) {\\n\\n let parts = path_update_helpers::parse_mv_command(command);\\n\\n if parts.len() == 2 {\\n\\n let normalized_from = path_update_helpers::normalize_path(&parts[0]);\\n\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 80,\n \"score\": 7.664434038150662\n },\n {\n \"content\": \" /* percentage of time this command is run relative to the most common command (1: this is the most common command, 0: this is the least common command) */\\n\\n COUNT(*) / :max_occurrences AS occurrences_factor\\n\\n\\n\\n FROM commands c WHERE when_run > :start_time AND when_run < :end_time GROUP BY cmd ORDER BY id DESC;\\\",\\n\\n &[\\n\\n (\\\":when_run_max\\\", &when_run_max),\\n\\n (\\\":history_duration\\\", &(when_run_max - when_run_min)),\\n\\n (\\\":directory\\\", &dir.to_owned()),\\n\\n (\\\":max_occurrences\\\", &max_occurrences),\\n\\n (\\\":max_length\\\", &max_length),\\n\\n (\\\":max_selected_occurrences\\\", &max_selected_occurrences),\\n\\n (\\\":lookback\\\", &lookback),\\n\\n (\\\":lookback_f64\\\", &(lookback as f64)),\\n\\n (\\\":last_commands0\\\", &last_commands[0].to_owned()),\\n\\n (\\\":last_commands1\\\", &last_commands[1].to_owned()),\\n\\n (\\\":last_commands2\\\", &last_commands[2].to_owned()),\\n\\n (\\\":start_time\\\", &start_time.unwrap_or(0).to_owned()),\\n\\n (\\\":end_time\\\", &end_time.unwrap_or(SystemTime::now().duration_since(UNIX_EPOCH).unwrap_or_else(|err| panic!(format!(\\\"McFly error: Time went backwards ({})\\\", err))).as_secs() as i64).to_owned()),\\n\\n (\\\":now\\\", &now.unwrap_or(SystemTime::now().duration_since(UNIX_EPOCH).unwrap_or_else(|err| panic!(format!(\\\"McFly error: Time went backwards ({})\\\", err))).as_secs() as i64).to_owned())\\n\\n ]).unwrap_or_else(|err| panic!(format!(\\\"McFly error: Creation of temp table to work ({})\\\", err)));\\n\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 81,\n \"score\": 7.517174577274475\n },\n {\n \"content\": \"use crate::history::Features;\\n\\nuse csv::Writer;\\n\\nuse std::fs::File;\\n\\nuse csv::Reader;\\n\\nuse std::path::PathBuf;\\n\\n\\n\",\n \"file_path\": \"src/training_cache.rs\",\n \"rank\": 82,\n \"score\": 7.059579217762275\n },\n {\n \"content\": \" if command.cmd.is_empty() { continue; }\\n\\n\\n\\n if i % 100 == 0 {\\n\\n println!(\\\"Done with {}\\\", i);\\n\\n }\\n\\n\\n\\n // Setup the cache for the time this command was recorded.\\n\\n // Unwrap is safe here because we check command.dir.is_none() above.\\n\\n history.build_cache_table(\\n\\n &command.dir.to_owned().unwrap(),\\n\\n &Some(command.session_id.clone()),\\n\\n None,\\n\\n command.when_run,\\n\\n command.when_run,\\n\\n );\\n\\n\\n\\n // Load the entire match set.\\n\\n let results = history.find_matches(&String::new(), -1);\\n\\n\\n\\n // Get the features for this command at the time it was logged.\\n\",\n \"file_path\": \"src/training_sample_generator.rs\",\n \"rank\": 83,\n \"score\": 6.773572679483965\n },\n {\n \"content\": \"use crate::simplified_command::SimplifiedCommand;\\n\\nuse rusqlite::{Connection, NO_PARAMS};\\n\\nuse std::io;\\n\\nuse std::io::Write;\\n\\n\\n\\npub const CURRENT_SCHEMA_VERSION: u16 = 3;\\n\\n\\n\",\n \"file_path\": \"src/history/schema.rs\",\n \"rank\": 84,\n \"score\": 6.67718038183284\n },\n {\n \"content\": \" query_map_named(params, closure).\\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\\n\\n\\n pub fn last_command(&self, session_id: &Option<String>) -> Option<Command> {\\n\\n self.commands(session_id, 1, 0, false)\\n\\n .get(0)\\n\\n .cloned()\\n\\n }\\n\\n\\n\\n pub fn last_command_templates(\\n\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 85,\n \"score\": 6.651141141204207\n },\n {\n \"content\": \"use core::mem;\\n\\nuse std::fmt;\\n\\nuse unicode_segmentation::UnicodeSegmentation;\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum InputCommand {\\n\\n Insert(char),\\n\\n Backspace,\\n\\n Delete,\\n\\n Move(Move),\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub enum Move {\\n\\n BOL,\\n\\n EOL,\\n\\n BackwardWord,\\n\\n ForwardWord,\\n\\n Backward,\\n\\n Forward,\\n\",\n \"file_path\": \"src/command_input.rs\",\n \"rank\": 86,\n \"score\": 6.647073336406802\n },\n {\n \"content\": \" // Hidden node 2 output (o_2) = tanh(s_2)\\n\\n // Hidden node 2 sum (s_2) = b_2 + w2_1*f_1 + w2_2*f_2\\n\\n // Derivative of error with respect to o_3 (d_e/d_o_3 0.5(t - o_3)^2): -(t - o_3)\\n\\n // Derivative of o_3 respect to s_3 (d_o_3/d_s_3 tanh(s_3)): 1.0 - tanh(s_3)^2\\n\\n // Derivative of s_3 with respect to weight w3_1 (d_s_3/d_w3_1 bias + w3_1*o_1 + w3_2*o_2): o_1\\n\\n // Derivative of error with respect to weight w3_1 (d_e/d_o_3 * d_o_3/d_s_3 * d_s_3/d_w3_1): -(t - o_3) * (1 - tanh(s_3)^2) * o_1\\n\\n // Derivative of s_3 with respect to o_1 (d_s_3/d_o_1 b_3 + w3_1*o_1 + w3_2*o_2): w3_1\\n\\n // Derivative of o_1 with respect to s_1 (d_o_1/d_s_1): 1.0 - tanh(s_1)^2\\n\\n // Derivative of s_1 with respect to weight w1_1 (d_s_1/d_w1_1): f_1\\n\\n // Full derivation of o_3: tanh(b_3 + w3_1*tanh(b_1 + w1_1*f_1 + w1_2*f_2) + w3_2*tanh(b_2 + w2_1*f_1 + w2_2*f_2))\\n\\n // Full derivation of s_3: b_3 + w3_1*tanh(b_1 + w1_1*f_1 + w1_2*f_2) + w3_2*tanh(b_2 + w2_1*f_1 + w2_2*f_2)\\n\\n // Full error derivation: 0.5(t - tanh(b_3 + w3_1*tanh(b_1 + w1_1*f_1 + w1_2*f_2) + w3_2*tanh(b_2 + w2_1*f_1 + w2_2*f_2)))^2\\n\\n // Full derivative for o_1: -(t - o_3) * (1.0 - tanh(s_3)^2) * w3_1\\n\\n // Full derivative for w1_1: -(t - o_3) * (1.0 - tanh(s_3)^2) * w3_1 * (1.0 - tanh(s_1)^2) * f_1\\n\\n // Checked: https://www.wolframcloud.com/objects/617707c2-5016-4fb3-b73d-bd688b884967\\n\\n generator.generate(Some(batch_size), |features: &Features, correct: bool| {\\n\\n let target = if correct { 1.0 } else { -1.0 };\\n\\n network.compute(features);\\n\\n\\n\\n let error = 0.5 * (target - network.final_output).powi(2);\\n\",\n \"file_path\": \"src/trainer.rs\",\n \"rank\": 87,\n \"score\": 6.404952648403816\n },\n {\n \"content\": \"\\n\\n settings.when_run = Some(\\n\\n value_t!(add_matches, \\\"when\\\", i64).unwrap_or(SystemTime::now()\\n\\n .duration_since(UNIX_EPOCH)\\n\\n .unwrap_or_else(|err| panic!(format!(\\\"McFly error: Time went backwards ({})\\\", err)))\\n\\n .as_secs()\\n\\n as i64),\\n\\n );\\n\\n\\n\\n settings.append_to_histfile = add_matches.is_present(\\\"append_to_histfile\\\");\\n\\n\\n\\n if add_matches.value_of(\\\"exit\\\").is_some() {\\n\\n settings.exit_code =\\n\\n Some(value_t!(add_matches, \\\"exit\\\", i32).unwrap_or_else(|e| e.exit()));\\n\\n }\\n\\n\\n\\n if let Some(dir) = add_matches.value_of(\\\"directory\\\") {\\n\\n settings.dir = dir.to_string();\\n\\n } else {\\n\\n settings.dir = env::var(\\\"PWD\\\").unwrap_or_else(|err| panic!(format!(\\\"McFly error: Unable to determine current directory ({})\\\", err)));\\n\",\n \"file_path\": \"src/settings.rs\",\n \"rank\": 88,\n \"score\": 6.25501773511613\n },\n {\n \"content\": \"\\n\\n let mut names = Vec::new();\\n\\n for command in command_iter {\\n\\n names.push(command.unwrap_or_else(|err| panic!(format!(\\\"McFly error: Unable to load command from DB ({})\\\", err))));\\n\\n }\\n\\n\\n\\n names\\n\\n }\\n\\n\\n\\n pub fn build_cache_table(\\n\\n &self,\\n\\n dir: &str,\\n\\n session_id: &Option<String>,\\n\\n start_time: Option<i64>,\\n\\n end_time: Option<i64>,\\n\\n now: Option<i64>,\\n\\n ) {\\n\\n let lookback: u16 = 3;\\n\\n\\n\\n let mut last_commands = self.last_command_templates(session_id, lookback as i16, 0);\\n\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 89,\n \"score\": 6.2018861291648495\n },\n {\n \"content\": \" debug: settings.debug,\\n\\n run: false,\\n\\n menu_mode: MenuMode::Normal,\\n\\n in_vim_insert_mode: false\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn display(&mut self) -> SelectionResult {\\n\\n self.build_cache_table();\\n\\n self.select();\\n\\n\\n\\n let command = self.input.command.to_owned();\\n\\n\\n\\n if command.chars().any(|c| !c.is_whitespace()) {\\n\\n self.history.record_selected_from_ui(\\n\\n &command,\\n\\n &self.settings.session_id,\\n\\n &self.settings.dir,\\n\\n );\\n\\n SelectionResult {\\n\",\n \"file_path\": \"src/interface.rs\",\n \"rank\": 90,\n \"score\": 6.180962845679868\n },\n {\n \"content\": \" original: command.into().clone(),\\n\\n result: String::new(),\\n\\n truncate,\\n\\n };\\n\\n simplified_command.simplify();\\n\\n simplified_command\\n\\n }\\n\\n\\n\\n fn simplify(&mut self) {\\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 tokens = 0;\\n\\n\\n\\n for grapheme in self.original.graphemes(true) {\\n\\n match grapheme {\\n\\n \\\"\\\\\\\\\\\" => {\\n\\n escaped = true;\\n\\n }\\n\",\n \"file_path\": \"src/simplified_command.rs\",\n \"rank\": 91,\n \"score\": 6.148870267309356\n },\n {\n \"content\": \"use libc;\\n\\n\\n\\n// Should we be using https://docs.rs/libc/0.2.44/libc/fn.ioctl.html instead?\\n\\nextern \\\"C\\\" {\\n\\n pub fn ioctl(fd: i8, request: u32, arg: *const u8) -> i8;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/fake_typer.rs\",\n \"rank\": 92,\n \"score\": 6.088269763932789\n },\n {\n \"content\": \" /// the cursor.\\n\\n fn previous_word_boundary(&self) -> usize {\\n\\n if self.cursor == 0 {\\n\\n return 0;\\n\\n }\\n\\n\\n\\n let mut word_boundaries = self.command\\n\\n .split_word_bound_indices()\\n\\n .map(|(i, _)| i)\\n\\n .collect::<Vec<usize>>();\\n\\n\\n\\n word_boundaries.push(self.command.len().to_owned());\\n\\n\\n\\n let mut word_index: usize = 0;\\n\\n let mut found_word: bool = false;\\n\\n let command_copy = self.command.to_owned();\\n\\n let vec = command_copy\\n\\n .grapheme_indices(true)\\n\\n .enumerate()\\n\\n .collect::<Vec<(usize, (usize, &str))>>();\\n\",\n \"file_path\": \"src/command_input.rs\",\n \"rank\": 93,\n \"score\": 6.068105683603115\n },\n {\n \"content\": \" (\\\":cmd_tpl\\\", &simplified_command.result.to_owned()),\\n\\n (\\\":session_id\\\", &session_id.to_owned()),\\n\\n (\\\":when_run\\\", &when_run.to_owned()),\\n\\n (\\\":exit_code\\\", &exit_code.to_owned()),\\n\\n (\\\":selected\\\", &selected),\\n\\n (\\\":dir\\\", &dir.to_owned()),\\n\\n (\\\":old_dir\\\", &old_dir.to_owned()),\\n\\n ]).unwrap_or_else(|err| panic!(format!(\\\"McFly error: Insert into commands to work ({})\\\", err)));\\n\\n }\\n\\n\\n\\n fn determine_if_selected_from_ui(\\n\\n &self,\\n\\n command: &str,\\n\\n session_id: &str,\\n\\n dir: &str,\\n\\n ) -> bool {\\n\\n let rows_affected = self.connection\\n\\n .execute_named(\\n\\n \\\"DELETE FROM selected_commands \\\\\\n\\n WHERE cmd = :cmd \\\\\\n\",\n \"file_path\": \"src/history/history.rs\",\n \"rank\": 94,\n \"score\": 6.063705514004625\n },\n {\n \"content\": \"[](https://travis-ci.org/cantino/mcfly)\\n\\n[](https://crates.io/crates/mcfly)\\n\\n\\n\\n# McFly - fly through your shell history\\n\\n\\n\\n<img src=\\\"/docs/screenshot.png\\\" alt=\\\"screenshot\\\" width=\\\"400\\\">\\n\\n\\n\\nMcFly replaces your default `ctrl-r` Bash history search with an intelligent search engine that takes into account\\n\\nyour working directory and the context of recently executed commands. McFly's suggestions are prioritized\\n\\nin real time with a small neural network.\\n\\n \\n\\nTL;DR: an upgraded `ctrl-r` for Bash whose history results make sense for what you're working on right now.\\n\\n\\n\\n## Features\\n\\n\\n\\n* Rebinds `ctrl-r` to bring up a full-screen reverse history search prioritized with a small neural network.\\n\\n* Augments your shell history to track command exit status, timestamp, and execution directory in a SQLite database.\\n\\n* Maintains your normal Bash history file as well so that you can stop using McFly whenever you want.\\n\\n* Unicode support throughout.\\n\\n* Includes a simple action to scrub any history item from the McFly database and your shell history files.\\n\\n* Designed to be extensible for other shells in the future.\\n\\n* Written in Rust, so it's fast and safe.\\n\\n\\n\\n## Prioritization\\n\\n\\n\\nThe key feature of McFly is smart command prioritization powered by a small neural network that runs\\n\\nin real time. The goal is for the command you want to run to always be one of the top suggestions.\\n\\n\\n\\nWhen suggesting a command, McFly takes into consideration:\\n\\n\\n\\n* The directory where you ran the command. You're likely to run that command in the same directory in the future.\\n\\n* What commands you typed before the command (e.g., the command's execution context).\\n\\n* How often you run the command.\\n\\n* When you last ran the command.\\n\\n* If you've selected the command in McFly before.\\n\\n* The command's historical exit status. You probably don't want to run old failed commands.\\n\\n\\n\\n## Installation\\n\\n\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 95,\n \"score\": 6.027897906553508\n },\n {\n \"content\": \" let mut next_word_index: usize = 0;\\n\\n let mut found_word: bool = false;\\n\\n\\n\\n for (count, (offset, item)) in grapheme_indices.enumerate() {\\n\\n if count >= self.cursor {\\n\\n if !found_word && item == \\\" \\\" {\\n\\n continue; // Ignore leading spaces\\n\\n } else if found_word {\\n\\n if offset == word_boundaries[next_word_index] {\\n\\n // We've found the next word boundary.\\n\\n return count;\\n\\n }\\n\\n } else {\\n\\n found_word = true;\\n\\n\\n\\n while word_boundaries[next_word_index] <= offset {\\n\\n next_word_index += 1;\\n\\n }\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/command_input.rs\",\n \"rank\": 96,\n \"score\": 6.004041514126592\n },\n {\n \"content\": \" fn truncate_for_display(\\n\\n command: &Command,\\n\\n search: &str,\\n\\n width: u16,\\n\\n highlight_color: String,\\n\\n base_color: String,\\n\\n debug: bool,\\n\\n ) -> String {\\n\\n let mut prev = 0;\\n\\n let debug_space = if debug { 90 } else { 0 };\\n\\n let max_grapheme_length = if width > debug_space {\\n\\n width - debug_space\\n\\n } else {\\n\\n 2\\n\\n };\\n\\n let mut out = FixedLengthGraphemeString::empty(max_grapheme_length);\\n\\n\\n\\n let lowercase_search = search.to_lowercase();\\n\\n let lowercase_cmd = command.cmd.to_lowercase();\\n\\n let search_len = search.len();\\n\",\n \"file_path\": \"src/interface.rs\",\n \"rank\": 97,\n \"score\": 5.863551028101107\n },\n {\n \"content\": \" None => false\\n\\n };\\n\\n settings.key_scheme = match env::var(\\\"MCFLY_KEY_SCHEME\\\").as_ref().map(String::as_ref) {\\n\\n Ok(\\\"vim\\\") => KeyScheme::Vim,\\n\\n _ => KeyScheme::Emacs\\n\\n };\\n\\n\\n\\n settings\\n\\n }\\n\\n\\n\\n pub fn mcfly_training_cache_path() -> PathBuf {\\n\\n Settings::storage_dir_path().join(PathBuf::from(\\\"training-cache.v1.csv\\\"))\\n\\n }\\n\\n\\n\\n pub fn storage_dir_path() -> PathBuf {\\n\\n home_dir()\\n\\n .unwrap_or_else(|| panic!(\\\"McFly error: Unable to access home directory\\\"))\\n\\n .join(PathBuf::from(\\\".mcfly\\\"))\\n\\n }\\n\\n\\n\\n pub fn mcfly_db_path() -> PathBuf {\\n\\n Settings::storage_dir_path().join(PathBuf::from(\\\"history.db\\\"))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/settings.rs\",\n \"rank\": 98,\n \"score\": 5.8498547598953845\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n (\\\"train\\\", Some(train_matches)) => {\\n\\n settings.mode = Mode::Train;\\n\\n settings.refresh_training_cache = train_matches.is_present(\\\"refresh_cache\\\");\\n\\n }\\n\\n\\n\\n (\\\"move\\\", Some(move_matches)) => {\\n\\n settings.mode = Mode::Move;\\n\\n settings.old_dir = Some(String::from(move_matches.value_of(\\\"old_dir_path\\\").unwrap_or_else(|| panic!(\\\"McFly error: Expected value for old_dir_path\\\"))));\\n\\n settings.dir = String::from(move_matches.value_of(\\\"new_dir_path\\\").unwrap_or_else(|| panic!(\\\"McFly error: Expected value for new_dir_path\\\")));\\n\\n }\\n\\n\\n\\n (\\\"\\\", None) => println!(\\\"No subcommand was used\\\"), // If no subcommand was used it'll match the tuple (\\\"\\\", None)\\n\\n _ => unreachable!(), // If all subcommands are defined above, anything else is unreachable!()\\n\\n }\\n\\n\\n\\n settings.lightmode = match env::var_os(\\\"MCFLY_LIGHT\\\") {\\n\\n Some(_val) => true,\\n\",\n \"file_path\": \"src/settings.rs\",\n \"rank\": 99,\n \"score\": 5.616000332968991\n }\n]","isConversational":false}}},{"rowIdx":982,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/node_state/leader/follower.rs"},"repo_name":{"kind":"string","value":"yuezato/raftlog"},"commit":{"kind":"string","value":"12315643c559118dbe9c20625ff9e3c415bf9bb3"},"file_code":{"kind":"string","value":"use futures::{Async, Future};\nuse std::collections::BTreeMap;\nuse std::mem;\nuse trackable::error::ErrorKindExt;\n\nuse super::super::Common;\nuse crate::cluster::ClusterConfig;\nuse crate::log::{Log, LogIndex};\nuse crate::message::{AppendEntriesReply, SequenceNumber};\nuse crate::node::NodeId;\nuse crate::{ErrorKind, Io, Result};\n\npub struct FollowersManager<IO: Io> {\n followers: BTreeMap<NodeId, Follower>,\n config: ClusterConfig,\n latest_hearbeat_ack: SequenceNumber,\n last_broadcast_seq_no: SequenceNumber,\n\n \n \n tasks: BTreeMap<NodeId, IO::LoadLog>,\n}\nimpl<IO: Io> FollowersManager<IO> {\n pub fn new(config: ClusterConfig) -> Self {\n let followers = config\n .members()\n .map(|n| (n.clone(), Follower::new()))\n .collect();\n FollowersManager {\n followers,\n config,\n tasks: BTreeMap::new(),\n latest_hearbeat_ack: SequenceNumber::new(0),\n last_broadcast_seq_no: SequenceNumber::new(0),\n }\n }\n pub fn run_once(&mut self, common: &mut Common<IO>) -> Result<()> {\n \n let mut dones = Vec::new();\n for (follower, task) in &mut self.tasks {\n if let Async::Ready(log) = track!(task.poll())? {\n dones.push((follower.clone(), log));\n }\n }\n for (follower, log) in dones {\n let rpc = common.rpc_caller();\n match log {\n Log::Prefix(snapshot) => rpc.send_install_snapshot(&follower, snapshot),\n Log::Suffix(slice) => rpc.send_append_entries(&follower, slice),\n }\n self.tasks.remove(&follower);\n }\n Ok(())\n }\n pub fn latest_hearbeat_ack(&self) -> SequenceNumber {\n self.latest_hearbeat_ack\n }\n\n \n \n \n \n pub fn committed_log_tail(&self) -> LogIndex {\n self.config.consensus_value(|node_id| {\n let f = &self.followers[node_id];\n if f.synced {\n f.log_tail\n } else {\n LogIndex::new(0)\n }\n })\n }\n\n \n \n \n \n \n pub fn joint_committed_log_tail(&self) -> LogIndex {\n self.config.full_consensus_value(|node_id| {\n let f = &self.followers[node_id];\n if f.synced {\n f.log_tail\n } else {\n LogIndex::new(0)\n }\n })\n }\n\n pub fn handle_append_entries_reply(\n &mut self,\n common: &Common<IO>,\n reply: &AppendEntriesReply,\n ) -> bool {\n let updated = self.update_follower_state(common, reply);\n if self.latest_hearbeat_ack < reply.header.seq_no {\n self.latest_hearbeat_ack = self\n .config\n .consensus_value(|node_id| self.followers[node_id].last_seq_no);\n }\n updated\n }\n\n pub fn set_last_broadcast_seq_no(&mut self, seq_no: SequenceNumber) {\n self.last_broadcast_seq_no = seq_no;\n }\n\n \n pub fn log_sync(&mut self, common: &mut Common<IO>, reply: &AppendEntriesReply) -> Result<()> {\n if reply.busy || self.tasks.contains_key(&reply.header.sender) {\n \n return Ok(());\n }\n\n let follower = track!(self\n .followers\n .get_mut(&reply.header.sender)\n .ok_or_else(|| ErrorKind::InconsistentState.error()))?;\n if reply.header.seq_no <= follower.obsolete_seq_no {\n \n \n \n return Ok(());\n }\n follower.obsolete_seq_no = self.last_broadcast_seq_no;\n\n if common.log().tail().index <= follower.log_tail {\n \n return Ok(());\n }\n\n let end = if follower.synced {\n \n common.log().tail().index\n } else {\n \n follower.log_tail\n };\n let future = common.load_log(follower.log_tail, Some(end));\n self.tasks.insert(reply.header.sender.clone(), future);\n Ok(())\n }\n\n \n pub fn handle_config_updated(&mut self, config: &ClusterConfig) {\n \n for id in config.members() {\n if !self.followers.contains_key(id) {\n self.followers.insert(id.clone(), Follower::new());\n }\n }\n\n \n self.followers = mem::take(&mut self.followers)\n .into_iter()\n .filter(|&(ref id, _)| config.is_known_node(id))\n .collect();\n\n self.config = config.clone();\n }\n\n fn update_follower_state(&mut self, common: &Common<IO>, reply: &AppendEntriesReply) -> bool {\n let follower = &mut self\n .followers\n .get_mut(&reply.header.sender)\n .expect(\"Never fails\");\n if follower.last_seq_no < reply.header.seq_no {\n follower.last_seq_no = reply.header.seq_no;\n }\n match *reply {\n AppendEntriesReply { busy: true, .. } => false,\n AppendEntriesReply { log_tail, .. } if follower.synced => {\n let updated = follower.log_tail < log_tail.index;\n if updated {\n follower.log_tail = log_tail.index;\n } else if log_tail.index.as_u64() == 0 && follower.log_tail.as_u64() != 0 {\n \n \n follower.synced = false;\n }\n updated\n }\n AppendEntriesReply { log_tail, .. } => {\n let leader_term = common\n .log()\n .get_record(log_tail.index)\n .map(|r| r.head.prev_term);\n follower.synced = leader_term == Some(log_tail.prev_term);\n if follower.synced {\n follower.log_tail = log_tail.index;\n } else {\n follower.log_tail = log_tail.index.as_u64().saturating_sub(1).into();\n }\n follower.synced\n }\n }\n }\n}\n\n#[derive(Debug)]\nstruct Follower {\n pub obsolete_seq_no: SequenceNumber,\n\n pub log_tail: LogIndex,\n pub last_seq_no: SequenceNumber,\n pub synced: bool,\n}\nimpl Follower {\n pub fn new() -> Self {\n Follower {\n obsolete_seq_no: SequenceNumber::new(0),\n\n log_tail: LogIndex::new(0),\n last_seq_no: SequenceNumber::new(0),\n synced: false,\n }\n }\n}\n"},"prefix":{"kind":"string","value":"use futures::{Async, Future};\nuse std::collections::BTreeMap;\nuse std::mem;\nuse trackable::error::ErrorKindExt;\n\nuse super::super::Common;\nuse crate::cluster::ClusterConfig;\nuse crate::log::{Log, LogIndex};\nuse crate::message::{AppendEntriesReply, SequenceNumber};\nuse crate::node::NodeId;\nuse crate::{ErrorKind, Io, Result};\n\npub struct FollowersManager<IO: Io> {\n followers: BTreeMap<NodeId, Follower>,\n config: ClusterConfig,\n latest_hearbeat_ack: SequenceNumber,\n last_broadcast_seq_no: SequenceNumber,\n\n \n \n tasks: BTreeMap<NodeId, IO::LoadLog>,\n}\nimpl<IO: Io> FollowersManager<IO> {\n pub fn new(config: ClusterConfig) -> Self {\n let followers = config\n .members()\n .map(|n| (n.clone(), Follower::new()))\n .collect();\n FollowersManager {\n followers,\n config,\n tasks: BTreeMap::new(),\n latest_hearbeat_ack: SequenceNumber::new(0),\n last_broadcast_seq_no: SequenceNumber::new(0),\n }\n }\n pub fn run_once(&mut self, common: &mut Common<IO>) -> Result<()> {\n \n let mut dones = Vec::new();\n for (follower, task) in &mut self.tasks {\n if let Async::Ready(log) = track!(task.poll())? {\n dones.push((follower.clone(), log));\n }\n }\n for (follower, log) in dones {\n let rpc = common.rpc_caller();\n match log {\n Log::Prefix(snapshot) => rpc.send_install_snapshot(&follower, snapshot),\n Log::Suffix(slice) => rpc.send_append_entries(&follower, slice),\n }\n self.tasks.remove(&follower);\n }\n Ok(())\n }\n pub fn latest_hearbeat_ack(&self) -> SequenceNumber {\n self.latest_hearbeat_ack\n }\n\n \n \n \n \n pub fn committed_log_tail(&self) -> LogIndex {\n self.config.consensus_value(|node_id| {\n let f = &self.followers[node_id];\n if f.synced {\n f.log_tail\n } else {\n LogIndex::new(0)\n }\n })\n }\n\n \n \n \n \n \n pub fn joint_committed_log_tail(&self) -> LogIndex {\n self.config.full_consensus_value(|node_id| {\n let f = &self.followers[node_id];\n if f.synced {\n f.log_tail\n } else {\n LogIndex::new(0)\n }\n })\n }\n\n pub fn handle_append_entries_reply(\n &mut self,\n common: &Common<IO>,\n reply: &AppendEntriesReply,\n ) -> bool {\n let updated = self.update_follower_state(common, reply);\n if self.latest_hearbeat_ack < reply.header.seq_no {\n self.latest_hearbeat_ack = self\n .config\n .consensus_value(|node_id| self.followers[node_id].last_seq_no);\n }\n updated\n }\n\n pub fn set_last_broadcast_seq_no(&mut self, seq_no: SequenceNumber) {\n self.last_broadcast_seq_no = seq_no;\n }\n\n \n pub fn log_sync(&mut self, common: &mut Common<IO>, reply: &AppendEntriesReply) -> Result<()> {\n if reply.busy || self.tasks.contains_key(&reply.header.sender) {\n \n return Ok(());\n }\n\n "},"suffix":{"kind":"string","value":"\n if reply.header.seq_no <= follower.obsolete_seq_no {\n \n \n \n return Ok(());\n }\n follower.obsolete_seq_no = self.last_broadcast_seq_no;\n\n if common.log().tail().index <= follower.log_tail {\n \n return Ok(());\n }\n\n let end = if follower.synced {\n \n common.log().tail().index\n } else {\n \n follower.log_tail\n };\n let future = common.load_log(follower.log_tail, Some(end));\n self.tasks.insert(reply.header.sender.clone(), future);\n Ok(())\n }\n\n \n pub fn handle_config_updated(&mut self, config: &ClusterConfig) {\n \n for id in config.members() {\n if !self.followers.contains_key(id) {\n self.followers.insert(id.clone(), Follower::new());\n }\n }\n\n \n self.followers = mem::take(&mut self.followers)\n .into_iter()\n .filter(|&(ref id, _)| config.is_known_node(id))\n .collect();\n\n self.config = config.clone();\n }\n\n fn update_follower_state(&mut self, common: &Common<IO>, reply: &AppendEntriesReply) -> bool {\n let follower = &mut self\n .followers\n .get_mut(&reply.header.sender)\n .expect(\"Never fails\");\n if follower.last_seq_no < reply.header.seq_no {\n follower.last_seq_no = reply.header.seq_no;\n }\n match *reply {\n AppendEntriesReply { busy: true, .. } => false,\n AppendEntriesReply { log_tail, .. } if follower.synced => {\n let updated = follower.log_tail < log_tail.index;\n if updated {\n follower.log_tail = log_tail.index;\n } else if log_tail.index.as_u64() == 0 && follower.log_tail.as_u64() != 0 {\n \n \n follower.synced = false;\n }\n updated\n }\n AppendEntriesReply { log_tail, .. } => {\n let leader_term = common\n .log()\n .get_record(log_tail.index)\n .map(|r| r.head.prev_term);\n follower.synced = leader_term == Some(log_tail.prev_term);\n if follower.synced {\n follower.log_tail = log_tail.index;\n } else {\n follower.log_tail = log_tail.index.as_u64().saturating_sub(1).into();\n }\n follower.synced\n }\n }\n }\n}\n\n#[derive(Debug)]\nstruct Follower {\n pub obsolete_seq_no: SequenceNumber,\n\n pub log_tail: LogIndex,\n pub last_seq_no: SequenceNumber,\n pub synced: bool,\n}\nimpl Follower {\n pub fn new() -> Self {\n Follower {\n obsolete_seq_no: SequenceNumber::new(0),\n\n log_tail: LogIndex::new(0),\n last_seq_no: SequenceNumber::new(0),\n synced: false,\n }\n }\n}\n"},"middle":{"kind":"string","value":"let follower = track!(self\n .followers\n .get_mut(&reply.header.sender)\n .ok_or_else(|| ErrorKind::InconsistentState.error()))?;"},"strategy":{"kind":"string","value":"assignment_statement"},"context_items":{"kind":"list like","value":[{"content":"struct InstallSnapshot<IO: Io> {\n\n future: IO::SaveLog,\n\n summary: SnapshotSummary,\n\n}\n\nimpl<IO: Io> InstallSnapshot<IO> {\n\n pub fn new(common: &mut Common<IO>, prefix: LogPrefix) -> Self {\n\n let summary = SnapshotSummary {\n\n tail: prefix.tail,\n\n config: prefix.config.clone(),\n\n };\n\n let future = common.io.save_log_prefix(prefix);\n\n InstallSnapshot { future, summary }\n\n }\n\n}\n\nimpl<IO: Io> Future for InstallSnapshot<IO> {\n\n type Item = SnapshotSummary;\n\n type Error = Error;\n\n fn poll(&mut self) -> Poll<Self::Item, Self::Error> {\n\n Ok(track!(self.future.poll())?.map(|()| self.summary.clone()))\n\n }\n","file_path":"src/node_state/common/mod.rs","rank":0,"score":151795.74627884332},{"content":"fn median<F, T>(members: &ClusterMembers, f: F) -> T\n\nwhere\n\n F: Fn(&NodeId) -> T,\n\n T: Ord + Copy + Default,\n\n{\n\n let mut values = members.iter().map(|n| f(n)).collect::<Vec<_>>();\n\n values.sort();\n\n values.reverse();\n\n if values.is_empty() {\n\n T::default()\n\n } else {\n\n values[members.len() / 2]\n\n }\n\n}\n","file_path":"src/cluster.rs","rank":1,"score":127262.75425114289},{"content":"fn over_write(now: &mut LogSuffix, new: &LogSuffix) {\n\n /*\n\n * 次のような上書き不能な形をしていないか検査する\n\n * now = [...)\n\n * [...) = new\n\n */\n\n assert!(new.head.index <= now.tail().index);\n\n\n\n let (offset, entries_offset) = if now.head.index <= new.head.index {\n\n /*\n\n * [ self ...\n\n * [ next ...\n\n * ^--offset\n\n */\n\n\n\n (new.head.index - now.head.index, 0)\n\n } else {\n\n /*\n\n * Strange case:\n\n * [ self ...\n","file_path":"src/test_dsl/impl_io.rs","rank":2,"score":126114.77761290272},{"content":"/// 引数`rlog`で表される特定のノードが、述語`pred`を満たすかどうかを調べる\n\n/// `pred`を満足する場合は`true`を返し、\n\n/// そうでない場合は`false`を返す。\n\nfn check(rlog: &ReplicatedLog<TestIo>, pred: Pred) -> bool {\n\n use Pred::*;\n\n\n\n match pred {\n\n Not(pred) => !check(rlog, *pred),\n\n IsLeader => rlog.local_node().role == Role::Leader,\n\n IsFollower => rlog.local_node().role == Role::Follower,\n\n LogTermConsistency => {\n\n let mut valid_glue = true;\n\n\n\n // snapshotとrawlogが両方ある場合は、\n\n // snapshotに続く形でrawlogが存在することを確認する\n\n if let Some(snapshot) = &rlog.io().snapshot() {\n\n if let Some(rawlog) = &rlog.io().rawlog() {\n\n valid_glue = snapshot.tail.prev_term == rawlog.head.prev_term;\n\n }\n\n }\n\n\n\n // rawlogが存在する場合は、termが昇順になっていることを確認する\n\n let is_sorted = if let Some(rawlog) = &rlog.io().rawlog() {\n","file_path":"src/test_dsl/dsl.rs","rank":3,"score":115262.26735373196},{"content":"fn make_role_change_histogram(builder: &mut HistogramBuilder) -> Result<Histogram> {\n\n builder\n\n .bucket(0.001)\n\n .bucket(0.005)\n\n .bucket(0.01)\n\n .bucket(0.05)\n\n .bucket(0.1)\n\n .bucket(0.2)\n\n .bucket(0.4)\n\n .bucket(0.6)\n\n .bucket(0.8)\n\n .bucket(1.0)\n\n .bucket(2.0)\n\n .bucket(4.0)\n\n .bucket(6.0)\n\n .bucket(8.0)\n\n .bucket(10.0)\n\n .bucket(20.0)\n\n .bucket(50.0)\n\n .bucket(80.0)\n\n .bucket(320.0)\n\n .bucket(640.0)\n\n .finish()\n\n .map_err(|e| track!(Error::from(e)))\n\n}\n","file_path":"src/metrics.rs","rank":4,"score":107261.07587930831},{"content":"/// Raftの実行に必要なI/O機能を提供するためのトレイト.\n\n///\n\n/// 機能としてはおおまかに以下の三つに区分される:\n\n///\n\n/// - **ストレージ**\n\n/// - ローカルノードの状態やログを保存するための永続ストレージ\n\n/// - Raftが完全に正しく動作するためには、このストレージは完全に信頼できるものである必要がある\n\n/// - 一度書き込まれたデータは(明示的に削除されない限り)失われたり、壊れたりすることは無い\n\n/// - 実際には、それを達成するのは困難なので、信頼性とストレージコストのトレードオフとなる\n\n/// - **チャンネル**\n\n/// - ノード間通信(RPC)用のメッセージ送受信チャンネル\n\n/// - このチャンネルの信頼性はある程度低くても良い\n\n/// - メッセージ群の順番の入れ替わりや、欠損、重複配送、は許容される\n\n/// - ただし、メッセージの改竄や捏造、はNG\n\n/// - **タイマー**\n\n/// - タイムアウト管理用のタイマー\n\npub trait Io {\n\n /// ローカルノードの投票状況を保存するための`Future`.\n\n type SaveBallot: Future<Item = (), Error = Error>;\n\n\n\n /// ノーカルノードの投票情報を取得ための`Future`.\n\n type LoadBallot: Future<Item = Option<Ballot>, Error = Error>;\n\n\n\n /// ローカルログを保存するための`Future`.\n\n type SaveLog: Future<Item = (), Error = Error>;\n\n\n\n /// ローカルログを取得するための`Future`.\n\n type LoadLog: Future<Item = Log, Error = Error>;\n\n\n\n /// タイムアウトを表現するための`Future`.\n\n type Timeout: Future<Item = (), Error = Error>;\n\n\n\n /// ローカルノードに対して送信されたメッセージの受信を試みる.\n\n ///\n\n /// # 注意\n\n ///\n","file_path":"src/io.rs","rank":5,"score":107135.49306210967},{"content":"/// DSLのコマンド列（プログラム）を実行する関数\n\npub fn interpret(cs: &[Command], service: &mut Service) {\n\n for c in cs {\n\n interpret_command(c.clone(), service);\n\n }\n\n}\n\n\n","file_path":"src/test_dsl/dsl.rs","rank":6,"score":107110.84573639274},{"content":"#[derive(Debug, Clone)]\n\nstruct SnapshotSummary {\n\n tail: LogPosition,\n\n config: ClusterConfig,\n\n}\n\n\n","file_path":"src/node_state/common/mod.rs","rank":7,"score":105196.14643878718},{"content":"#[derive(Default, Serialize, Deserialize)]\n\nstruct Config {\n\n simulator: raftlog_simu::SimulatorConfig,\n\n}\n\n\n","file_path":"raftlog_simu/src/main.rs","rank":8,"score":99189.68730412977},{"content":"/// ノードネームの列が与えられた時に\n\n/// 丁度それらを構成要素として含むようなraft clusterを構成する。\n\n///\n\n/// 全点間通信ができる状態にしてあるので\n\n/// complete graph（w.r.t. ネットワークトポロジー）という語を用いている。\n\npub fn build_complete_graph(names: &[NodeName]) -> (Service, ClusterMembers) {\n\n let nodes: BTreeSet<NodeId> = names.iter().map(|s| NodeId::new(s.to_string())).collect();\n\n\n\n let mut ios = BTreeMap::new();\n\n let mut service = BTreeMap::new();\n\n\n\n for node in &nodes {\n\n ios.insert(node.clone(), TestIo::new(node.clone(), false));\n\n }\n\n\n\n for src in &nodes {\n\n let mut io_src = ios.remove(src).unwrap();\n\n for dst in &nodes {\n\n if src != dst {\n\n let io_dst = ios.get(dst).unwrap();\n\n io_src.set_channel(dst.clone(), io_dst.copy_sender());\n\n }\n\n }\n\n ios.insert(src.clone(), io_src);\n\n }\n","file_path":"src/test_dsl/dsl.rs","rank":9,"score":91484.87596065007},{"content":"struct Channel {\n\n clock: u64,\n\n queue: BinaryHeap<DelayedMessage>,\n\n}\n\nimpl Channel {\n\n pub fn new() -> Self {\n\n Channel {\n\n clock: 0,\n\n queue: BinaryHeap::new(),\n\n }\n\n }\n\n pub fn try_recv_message(&mut self) -> Option<Message> {\n\n self.clock += 1;\n\n if let Some(m) = self.queue.pop() {\n\n if m.arrival_time <= self.clock {\n\n Some(m.message)\n\n } else {\n\n self.queue.push(m);\n\n None\n\n }\n","file_path":"raftlog_simu/src/io/transport.rs","rank":11,"score":77140.3932382438},{"content":"struct DelayedMessage {\n\n arrival_time: u64,\n\n message: Message,\n\n}\n\nimpl Ord for DelayedMessage {\n\n fn cmp(&self, other: &Self) -> Ordering {\n\n other.arrival_time.cmp(&self.arrival_time)\n\n }\n\n}\n\nimpl PartialOrd for DelayedMessage {\n\n fn partial_cmp(&self, other: &Self) -> Option<Ordering> {\n\n other.arrival_time.partial_cmp(&self.arrival_time)\n\n }\n\n}\n\nimpl Eq for DelayedMessage {}\n\nimpl PartialEq for DelayedMessage {\n\n fn eq(&self, other: &Self) -> bool {\n\n self.arrival_time == other.arrival_time\n\n }\n\n}\n","file_path":"raftlog_simu/src/io/transport.rs","rank":12,"score":74826.60828906487},{"content":"/// DSLの一つのコマンドを実行する関数\n\nfn interpret_command(c: Command, service: &mut Service) {\n\n use futures::Stream;\n\n use Command::*;\n\n\n\n println!(\"\\n Now executing {:?} ...\", &c);\n\n\n\n match c {\n\n TakeSnapshot(node) => {\n\n let rlog = service.get_mut(&node).unwrap();\n\n let index = rlog.local_history().tail().index;\n\n rlog.install_snapshot(index, Vec::new()).unwrap();\n\n }\n\n Check(node, pred) => {\n\n let rlog = service.get_mut(&node).unwrap();\n\n assert!(check(rlog, pred));\n\n }\n\n Heartbeat(node) => {\n\n let rlog = service.get_mut(&node).unwrap();\n\n rlog.heartbeat().unwrap();\n\n }\n","file_path":"src/test_dsl/dsl.rs","rank":13,"score":74175.63251036819},{"content":"fn message_to_string(m: &Message) -> String {\n\n use Message::*;\n\n match m {\n\n RequestVoteCall(vcall) => {\n\n format!(\n\n \"[Vcall] {:?} {:?} {:?}\",\n\n vcall.header.seq_no, vcall.header.term, vcall.log_tail\n\n )\n\n }\n\n RequestVoteReply(vreply) => {\n\n format!(\n\n \"[Vrep] {:?} {:?} voted={:?}\",\n\n vreply.header.seq_no, vreply.header.term, vreply.voted\n\n )\n\n }\n\n AppendEntriesCall(ecall) => {\n\n format!(\n\n \"[AEcall] {:?} {:?} commited={:?}, suffix={:?}\",\n\n ecall.header.seq_no, ecall.header.term, ecall.committed_log_tail, ecall.suffix\n\n )\n","file_path":"src/test_dsl/impl_io.rs","rank":14,"score":65949.2841820146},{"content":"#[allow(dead_code)]\n\nfn ballot_to_str(b: &Ballot) -> String {\n\n format!(\n\n \"ballot(term: {}, for: {})\",\n\n b.term.as_u64(),\n\n b.voted_for.as_str()\n\n )\n\n}\n\n\n","file_path":"src/test_dsl/impl_io.rs","rank":15,"score":65949.2841820146},{"content":" _phantom: PhantomData<IO>,\n\n}\n\nimpl<IO: Io> FollowerSnapshot<IO> {\n\n pub fn new() -> Self {\n\n FollowerSnapshot {\n\n _phantom: PhantomData,\n\n }\n\n }\n\n pub fn handle_message(\n\n &mut self,\n\n common: &mut Common<IO>,\n\n message: Message,\n\n ) -> Result<NextState<IO>> {\n\n if let Message::AppendEntriesCall(m) = message {\n\n common.rpc_callee(&m.header).reply_busy();\n\n }\n\n Ok(None)\n\n }\n\n pub fn run_once(&mut self, common: &mut Common<IO>) -> Result<NextState<IO>> {\n\n if common.is_snapshot_installing() {\n\n Ok(None)\n\n } else {\n\n let next = Follower::Idle(FollowerIdle::new());\n\n Ok(Some(RoleState::Follower(next)))\n\n }\n\n }\n\n}\n","file_path":"src/node_state/follower/snapshot.rs","rank":16,"score":64125.30242690405},{"content":"use std::marker::PhantomData;\n\n\n\nuse super::super::{Common, NextState, RoleState};\n\nuse super::{Follower, FollowerIdle};\n\nuse crate::message::Message;\n\nuse crate::{Io, Result};\n\n\n\n/// ローカルログへのスナップショット保存を処理するためのフォロワーのサブ状態.\n\n///\n\n/// `InstallSnapshotCast`で送られてきたスナップショットを処理する.\n\n///\n\n/// 正確には、スナップショットの処理自体は共通モジュールで行われるため、\n\n/// ここでの目的は「スナップショットの保存中に、新たなログ追記等が行われないようにする」\n\n/// ということになる.\n\n///\n\n/// なお、既にコミット済みの地点に対するスナップショットのインストール中に、\n\n/// 新規ログ追加が行われても問題は発生しないので、\n\n/// このサブ状態が使われるのは「未コミット地点に対するスナップショット」の\n\n/// インストールをリーダから指示された場合、のみである.\n\npub struct FollowerSnapshot<IO: Io> {\n","file_path":"src/node_state/follower/snapshot.rs","rank":17,"score":64113.76162346708},{"content":"//! `Future`トレイトの実装群.\n\nuse futures::{Async, Future, Poll};\n\nuse raftlog::election::Ballot;\n\nuse raftlog::log::Log;\n\n\n\nuse crate::types::LogicalDuration;\n\nuse crate::Error;\n\n\n\npub type Timeout = DelayedResult<(), Error>;\n\npub type SaveBallot = DelayedResult<(), Error>;\n\npub type LoadBallot = DelayedResult<Option<Ballot>, Error>;\n\npub type SaveLog = DelayedResult<(), Error>;\n\npub type LoadLog = DelayedResult<Log, Error>;\n\n\n\n/// 結果を得られるまでに、生成時に指定された論理時間の経過が必要となる`Result`型.\n\n#[derive(Debug)]\n\npub struct DelayedResult<T, E> {\n\n result: Option<Result<T, E>>,\n\n delay: LogicalDuration,\n\n}\n","file_path":"raftlog_simu/src/io/futures.rs","rank":18,"score":63428.23016583829},{"content":"impl<T, E> DelayedResult<T, E> {\n\n /// `value`を値とする、遅延された成功結果を返す.\n\n pub fn ok(value: T, delay: LogicalDuration) -> Self {\n\n DelayedResult::done(Ok(value), delay)\n\n }\n\n\n\n /// `error`を失敗理由とする、遅延された結果を返す.\n\n pub fn err(error: E, delay: LogicalDuration) -> Self {\n\n DelayedResult::done(Err(error), delay)\n\n }\n\n\n\n /// 遅延された結果を返す.\n\n pub fn done(result: Result<T, E>, delay: LogicalDuration) -> Self {\n\n DelayedResult {\n\n result: Some(result),\n\n delay,\n\n }\n\n }\n\n}\n\nimpl<T, E> Future for DelayedResult<T, E> {\n","file_path":"raftlog_simu/src/io/futures.rs","rank":19,"score":63425.25241986479},{"content":" type Item = T;\n\n type Error = E;\n\n fn poll(&mut self) -> Poll<Self::Item, Self::Error> {\n\n if self.delay == 0 {\n\n let value = self\n\n .result\n\n .take()\n\n .expect(\"Cannot poll DelayedResult twice\")?;\n\n Ok(Async::Ready(value))\n\n } else {\n\n self.delay -= 1;\n\n Ok(Async::NotReady)\n\n }\n\n }\n\n}\n","file_path":"raftlog_simu/src/io/futures.rs","rank":20,"score":63422.31080905979},{"content":"impl Default for StorageConfig {\n\n fn default() -> Self {\n\n StorageConfig {\n\n save_ballot_time: StorageConfig::default_save_ballot_time(),\n\n load_ballot_time: StorageConfig::default_load_ballot_time(),\n\n save_log_entry_time: StorageConfig::default_save_log_entry_time(),\n\n load_log_entry_time: StorageConfig::default_load_log_entry_time(),\n\n save_log_snapshot_time: StorageConfig::default_save_log_snapshot_time(),\n\n load_log_snapshot_time: StorageConfig::default_load_log_snapshot_time(),\n\n }\n\n }\n\n}\n\n\n\n/// 通信チャンネルの構成設定.\n\n#[derive(Debug, Clone, Serialize, Deserialize)]\n\npub struct ChannelConfig {\n\n /// メッセージの消失率.\n\n ///\n\n /// `1.0`なら全てのメッセージが相手に届くことなく消失する.\n\n #[serde(default = \"ChannelConfig::default_drop\")]\n","file_path":"raftlog_simu/src/io/configs.rs","rank":21,"score":63222.64857854171},{"content":"\n\n /// スナップショットの保存に要する時間.\n\n #[serde(default = \"StorageConfig::default_save_log_snapshot_time\")]\n\n pub save_log_snapshot_time: Range<LogicalDuration>,\n\n\n\n /// スナップショットの読み込みに要する時間.\n\n #[serde(default = \"StorageConfig::default_load_log_snapshot_time\")]\n\n pub load_log_snapshot_time: Range<LogicalDuration>,\n\n}\n\nimpl StorageConfig {\n\n /// `1...5`\n\n pub fn default_save_ballot_time() -> Range<LogicalDuration> {\n\n Range { min: 1, max: 5 }\n\n }\n\n\n\n /// `1...5`\n\n pub fn default_load_ballot_time() -> Range<LogicalDuration> {\n\n Range { min: 1, max: 5 }\n\n }\n\n\n","file_path":"raftlog_simu/src/io/configs.rs","rank":22,"score":63221.720309960634},{"content":" /// `1...5`\n\n pub fn default_save_log_entry_time() -> Range<LogicalDuration> {\n\n Range { min: 1, max: 5 }\n\n }\n\n\n\n /// `1...5`\n\n pub fn default_load_log_entry_time() -> Range<LogicalDuration> {\n\n Range { min: 1, max: 5 }\n\n }\n\n\n\n /// `100...500`\n\n pub fn default_save_log_snapshot_time() -> Range<LogicalDuration> {\n\n Range { min: 100, max: 500 }\n\n }\n\n\n\n /// `100...500`\n\n pub fn default_load_log_snapshot_time() -> Range<LogicalDuration> {\n\n Range { min: 100, max: 500 }\n\n }\n\n}\n","file_path":"raftlog_simu/src/io/configs.rs","rank":23,"score":63217.561454083894},{"content":"pub struct StorageConfig {\n\n /// 投票状況の保存に要する時間.\n\n #[serde(default = \"StorageConfig::default_save_ballot_time\")]\n\n pub save_ballot_time: Range<LogicalDuration>,\n\n\n\n /// 投票状況の復元に要する時間.\n\n #[serde(default = \"StorageConfig::default_load_ballot_time\")]\n\n pub load_ballot_time: Range<LogicalDuration>,\n\n\n\n /// 個々のログエントリの保存に要する時間.\n\n ///\n\n /// 対象のエントリ数がNの場合には、時間はN倍になる.\n\n #[serde(default = \"StorageConfig::default_save_log_entry_time\")]\n\n pub save_log_entry_time: Range<LogicalDuration>,\n\n\n\n /// 個々のログエントリの読み込みに要する時間.\n\n ///\n\n /// 対象のエントリ数がNの場合には、時間はN倍になる.\n\n #[serde(default = \"StorageConfig::default_load_log_entry_time\")]\n\n pub load_log_entry_time: Range<LogicalDuration>,\n","file_path":"raftlog_simu/src/io/configs.rs","rank":24,"score":63217.12335804883},{"content":" Probability { prob: 0.05 }\n\n }\n\n\n\n /// `0.01`\n\n pub fn default_duplicate() -> Probability {\n\n Probability { prob: 0.01 }\n\n }\n\n}\n\nimpl Default for ChannelConfig {\n\n fn default() -> Self {\n\n ChannelConfig {\n\n delay: ChannelConfig::default_delay(),\n\n drop: ChannelConfig::default_drop(),\n\n duplicate: ChannelConfig::default_duplicate(),\n\n }\n\n }\n\n}\n","file_path":"raftlog_simu/src/io/configs.rs","rank":25,"score":63216.68517447422},{"content":" pub fn default_election_timeout() -> LogicalDuration {\n\n 1000\n\n }\n\n\n\n /// `heartbeat_interval`フィールドのデフォルト値 (`100`).\n\n pub fn default_heartbeat_interval() -> LogicalDuration {\n\n 100\n\n }\n\n}\n\nimpl Default for TimerConfig {\n\n fn default() -> Self {\n\n TimerConfig {\n\n election_timeout: TimerConfig::default_election_timeout(),\n\n heartbeat_interval: TimerConfig::default_heartbeat_interval(),\n\n }\n\n }\n\n}\n\n\n\n/// `Storage`用の構成設定.\n\n#[derive(Debug, Clone, Serialize, Deserialize)]\n","file_path":"raftlog_simu/src/io/configs.rs","rank":26,"score":63216.62835729769},{"content":"//! I/O関連の構成設定を集めたモジュール.\n\nuse crate::types::{LogicalDuration, Probability, Range};\n\n\n\n/// `Timer`用の構成設定.\n\n#[derive(Debug, Clone, Serialize, Deserialize)]\n\npub struct TimerConfig {\n\n /// 一つの選挙期間のタイムアウト尺.\n\n ///\n\n /// リーダからのハートビートを受信しない期間が、\n\n /// ここで指定された尺を超えた場合には、\n\n /// リーダがダウンしたものと判断されて、次の選挙が始まる.\n\n #[serde(default = \"TimerConfig::default_election_timeout\")]\n\n pub election_timeout: LogicalDuration,\n\n\n\n /// リーダがハートビートを発行する間隔.\n\n #[serde(default = \"TimerConfig::default_heartbeat_interval\")]\n\n pub heartbeat_interval: LogicalDuration,\n\n}\n\nimpl TimerConfig {\n\n /// `election_timeout`フィールドのデフォルト値 (`1000`).\n","file_path":"raftlog_simu/src/io/configs.rs","rank":27,"score":63216.32751880202},{"content":" pub drop: Probability,\n\n\n\n /// メッセージの重複率.\n\n ///\n\n /// `1.0`なら(消失しなかった)全てのメッセージが複製される.\n\n #[serde(default = \"ChannelConfig::default_duplicate\")]\n\n pub duplicate: Probability,\n\n\n\n /// メッセージ遅延.\n\n #[serde(default = \"ChannelConfig::default_delay\")]\n\n pub delay: Range<LogicalDuration>,\n\n}\n\nimpl ChannelConfig {\n\n /// `10..50`\n\n pub fn default_delay() -> Range<LogicalDuration> {\n\n Range { min: 10, max: 50 }\n\n }\n\n\n\n /// `0.05`\n\n pub fn default_drop() -> Probability {\n","file_path":"raftlog_simu/src/io/configs.rs","rank":28,"score":63214.58544422495},{"content":"use super::Common;\n\nuse crate::log::{LogPosition, LogPrefix, LogSuffix};\n\nuse crate::message::{self, AppendEntriesReply, Message, MessageHeader, SequenceNumber};\n\nuse crate::node::NodeId;\n\nuse crate::Io;\n\n\n\n/// RPC要求メッセージの送信を補助するためのビルダ.\n\npub struct RpcCaller<'a, IO: 'a + Io> {\n\n common: &'a mut Common<IO>,\n\n}\n\nimpl<'a, IO: 'a + Io> RpcCaller<'a, IO> {\n\n pub fn new(common: &'a mut Common<IO>) -> Self {\n\n RpcCaller { common }\n\n }\n\n pub fn broadcast_request_vote(mut self) {\n\n let header = self.make_header(&NodeId::new(String::new())); // ブロードキャストノード時に空文字列を宛先に指定\n\n let log_tail = self.common.history.tail();\n\n let request = message::RequestVoteCall {\n\n header: header.clone(),\n\n log_tail,\n","file_path":"src/node_state/common/rpc_builder.rs","rank":29,"score":61473.956702074654},{"content":" if do_self_reply {\n\n self.common.unread_message = Some(self_reply);\n\n }\n\n }\n\n}\n\n\n\n/// RPC応答メッセージの送信を補助するためのビルダ.\n\npub struct RpcCallee<'a, IO: 'a + Io> {\n\n common: &'a mut Common<IO>,\n\n caller: &'a MessageHeader,\n\n}\n\nimpl<'a, IO: 'a + Io> RpcCallee<'a, IO> {\n\n pub fn new(common: &'a mut Common<IO>, caller: &'a MessageHeader) -> Self {\n\n RpcCallee { common, caller }\n\n }\n\n pub fn reply_request_vote(self, voted: bool) {\n\n let header = self.make_header();\n\n let message = message::RequestVoteReply { header, voted }.into();\n\n self.common.io.send_message(message);\n\n }\n","file_path":"src/node_state/common/rpc_builder.rs","rank":30,"score":61472.71678830534},{"content":" fn make_header(&mut self, destination: &NodeId) -> MessageHeader {\n\n let seq_no = self.common.seq_no;\n\n self.common.seq_no = SequenceNumber::new(seq_no.as_u64() + 1);\n\n MessageHeader {\n\n sender: self.common.local_node.id.clone(),\n\n destination: destination.clone(),\n\n seq_no,\n\n term: self.common.local_node.ballot.term,\n\n }\n\n }\n\n fn broadcast(&mut self, mut message: Message, self_reply: Message) {\n\n let mut do_self_reply = false;\n\n for peer in self.common.history.config().members() {\n\n if *peer == self.common.local_node.id {\n\n do_self_reply = true;\n\n } else {\n\n message.set_destination(peer);\n\n self.common.io.send_message(message.clone());\n\n }\n\n }\n","file_path":"src/node_state/common/rpc_builder.rs","rank":31,"score":61466.44635224692},{"content":" busy: false,\n\n }\n\n .into();\n\n self.broadcast(request, self_reply);\n\n }\n\n pub fn send_append_entries(mut self, peer: &NodeId, suffix: LogSuffix) {\n\n let message = message::AppendEntriesCall {\n\n header: self.make_header(peer),\n\n committed_log_tail: self.common.history.committed_tail().index,\n\n suffix,\n\n }\n\n .into();\n\n self.common.io.send_message(message);\n\n }\n\n pub fn send_install_snapshot(mut self, peer: &NodeId, prefix: LogPrefix) {\n\n let header = self.make_header(peer);\n\n let message = message::InstallSnapshotCast { header, prefix }.into();\n\n self.common.io.send_message(message);\n\n }\n\n\n","file_path":"src/node_state/common/rpc_builder.rs","rank":32,"score":61466.36622844293},{"content":" pub fn reply_append_entries(self, log_tail: LogPosition) {\n\n let message = AppendEntriesReply {\n\n header: self.make_header(),\n\n log_tail,\n\n busy: false,\n\n }\n\n .into();\n\n self.common.io.send_message(message);\n\n }\n\n pub fn reply_busy(self) {\n\n let message = AppendEntriesReply {\n\n header: self.make_header(),\n\n log_tail: self.common.history.tail(),\n\n busy: true,\n\n }\n\n .into();\n\n self.common.io.send_message(message);\n\n }\n\n\n\n fn make_header(&self) -> MessageHeader {\n\n MessageHeader {\n\n sender: self.common.local_node.id.clone(),\n\n destination: self.caller.sender.clone(),\n\n seq_no: self.caller.seq_no,\n\n term: self.common.local_node.ballot.term,\n\n }\n\n }\n\n}\n","file_path":"src/node_state/common/rpc_builder.rs","rank":33,"score":61462.59395543706},{"content":" }\n\n .into();\n\n let self_reply = message::RequestVoteReply {\n\n header,\n\n voted: true,\n\n }\n\n .into();\n\n self.broadcast(request, self_reply);\n\n }\n\n pub fn broadcast_append_entries(mut self, suffix: LogSuffix) {\n\n let header = self.make_header(&NodeId::new(String::new())); // ブロードキャストノード時に空文字列を宛先に指定\n\n let request = message::AppendEntriesCall {\n\n header: header.clone(),\n\n committed_log_tail: self.common.history.committed_tail().index,\n\n suffix,\n\n }\n\n .into();\n\n let self_reply = AppendEntriesReply {\n\n header,\n\n log_tail: self.common.history.tail(),\n","file_path":"src/node_state/common/rpc_builder.rs","rank":34,"score":61460.73999155762},{"content":"/// 次に遷移する状態.\n\n///\n\n/// `None`の場合には、遷移はせずに同じ状態が維持される.\n\ntype NextState<IO> = Option<RoleState<IO>>;\n\n\n\n/// ローカルノード用の状態(状態機械).\n\npub struct NodeState<IO: Io> {\n\n pub common: Common<IO>,\n\n pub role: RoleState<IO>,\n\n started_at: Instant,\n\n pub metrics: NodeStateMetrics,\n\n}\n\nimpl<IO: Io> NodeState<IO> {\n\n pub fn load(node_id: NodeId, config: ClusterConfig, io: IO, metrics: NodeStateMetrics) -> Self {\n\n let mut common = Common::new(node_id, io, config, metrics.clone());\n\n let role = RoleState::Loader(Loader::new(&mut common));\n\n let started_at = Instant::now();\n\n NodeState {\n\n common,\n\n role,\n\n started_at,\n\n metrics,\n\n }\n","file_path":"src/node_state/mod.rs","rank":35,"score":52101.20098796432},{"content":"struct Down {\n\n machine: MachineState,\n\n io: DeterministicIo,\n\n restart: LogicalDuration,\n\n}\n\nimpl Down {\n\n pub fn new(machine: MachineState, io: DeterministicIo, restart: LogicalDuration) -> Self {\n\n Down {\n\n machine,\n\n io,\n\n restart,\n\n }\n\n }\n\n pub fn propose_command(&mut self, _command: Command) -> Result<()> {\n\n track_panic!(ErrorKind::NotLeader, \"This process is down\");\n\n }\n\n pub fn propose_config(&mut self, _: ClusterMembers) -> Result<()> {\n\n track_panic!(ErrorKind::NotLeader, \"This process is down\");\n\n }\n\n pub fn heartbeat(&mut self) -> Result<()> {\n","file_path":"raftlog_simu/src/process.rs","rank":36,"score":49891.97055460813},{"content":"struct Alive {\n\n logger: Logger,\n\n machine: MachineState,\n\n next_commit: LogIndex,\n\n rlog: ReplicatedLog<DeterministicIo>,\n\n proposals: Vec<ProposalId>,\n\n heartbeats: VecDeque<SequenceNumber>,\n\n}\n\nimpl Alive {\n\n /// 新しい`Alive`インスタンスを生成する.\n\n pub fn new(\n\n logger: Logger,\n\n node_id: NodeId,\n\n members: ClusterMembers,\n\n io: DeterministicIo,\n\n ) -> Self {\n\n let metric_builder = MetricBuilder::new();\n\n let machine = MachineState::new();\n\n let rlog = ReplicatedLog::new(node_id, members, io, &metric_builder).expect(\"Never fails\");\n\n Alive {\n","file_path":"raftlog_simu/src/process.rs","rank":37,"score":48509.77928443576},{"content":"#[derive(PartialEq, Eq)]\n\nstruct Committed {\n\n entry: LogEntry,\n\n state: MachineState,\n\n}\n","file_path":"raftlog_simu/src/simulator.rs","rank":38,"score":48509.77928443576},{"content":"fn main() {\n\n let matches = app_from_crate!()\n\n .arg(\n\n Arg::with_name(\"CONFIG_FILE\")\n\n .short(\"c\")\n\n .long(\"config\")\n\n .takes_value(true),\n\n ).arg(Arg::with_name(\"RANDOM_SEED\").long(\"seed\").takes_value(true))\n\n .arg(\n\n Arg::with_name(\"LOOP_COUNT\")\n\n .long(\"loop-count\")\n\n .takes_value(true),\n\n ).get_matches();\n\n\n\n //\n\n // 1. Load Configuration\n\n //\n\n let mut config = if let Some(config_file) = matches.value_of(\"CONFIG_FILE\") {\n\n track_try_unwrap!(serdeconv::from_toml_file(config_file))\n\n } else {\n","file_path":"raftlog_simu/src/main.rs","rank":39,"score":48144.619339775345},{"content":"use futures::Future;\n\n\n\nuse crate::election::{Ballot, Role};\n\nuse crate::log::{Log, LogIndex, LogPrefix, LogSuffix};\n\nuse crate::message::Message;\n\nuse crate::{Error, Result};\n\n\n\n/// Raftの実行に必要なI/O機能を提供するためのトレイト.\n\n///\n\n/// 機能としてはおおまかに以下の三つに区分される:\n\n///\n\n/// - **ストレージ**\n\n/// - ローカルノードの状態やログを保存するための永続ストレージ\n\n/// - Raftが完全に正しく動作するためには、このストレージは完全に信頼できるものである必要がある\n\n/// - 一度書き込まれたデータは(明示的に削除されない限り)失われたり、壊れたりすることは無い\n\n/// - 実際には、それを達成するのは困難なので、信頼性とストレージコストのトレードオフとなる\n\n/// - **チャンネル**\n\n/// - ノード間通信(RPC)用のメッセージ送受信チャンネル\n\n/// - このチャンネルの信頼性はある程度低くても良い\n\n/// - メッセージ群の順番の入れ替わりや、欠損、重複配送、は許容される\n\n/// - ただし、メッセージの改竄や捏造、はNG\n\n/// - **タイマー**\n\n/// - タイムアウト管理用のタイマー\n","file_path":"src/io.rs","rank":40,"score":35538.65422440527},{"content":" fn load_log(&mut self, start: LogIndex, end: Option<LogIndex>) -> Self::LoadLog;\n\n\n\n /// 選挙における役割に応じた時間のタイムアウトオブジェクトを生成する.\n\n fn create_timeout(&mut self, role: Role) -> Self::Timeout;\n\n\n\n /// I/O処理を行う余裕があるかどうかを返す.\n\n ///\n\n /// これが`true`を返している間は、フォロワーの同期処理は実施されない.\n\n fn is_busy(&mut self) -> bool {\n\n false\n\n }\n\n}\n","file_path":"src/io.rs","rank":41,"score":35538.235272256396},{"content":" /// 保存に成功した場合は、それ以前のログ領域は破棄してしまって構わない.\n\n fn save_log_prefix(&mut self, prefix: LogPrefix) -> Self::SaveLog;\n\n\n\n /// ローカルログの末尾部分を保存(追記)する.\n\n ///\n\n /// `suffix`の開始位置が、現在のログの末尾よりも前方の場合は、\n\n /// 新しい開始位置よりも後ろの古いエントリは削除してしまって構わない.\n\n /// (リーダの入れ替えにより、ログの未コミット部分で競合が発生したことを示している)\n\n fn save_log_suffix(&mut self, suffix: &LogSuffix) -> Self::SaveLog;\n\n\n\n /// ローカルログの指定範囲のエントリを取得する.\n\n ///\n\n /// 範囲は`start`から始まり、`end`を含まない最後のエントリまでを取得する.\n\n /// `end`の値が`None`の場合には、ログの末端までを取得する.\n\n ///\n\n /// なお、`end`が指定されているにも関わらず、指定よりも少ないエントリしか\n\n /// 取得できなかった場合には「取得できたエントリのみを返す」ないし「エラーを返す」の\n\n /// どちらの挙動も許容される.\n\n ///\n\n /// ただし、`start`とは異なる位置から、エントリの取得を開始することは許可されない.\n","file_path":"src/io.rs","rank":42,"score":35536.336327575984},{"content":" /// このメソッドが`Err`を返した場合には、ローカルのRaftノードが\n\n /// 停止してしまうので、時間経過によって自動的には回復しない\n\n /// 致命的なものを除いては、`Err`は返さないことが望ましい.\n\n fn try_recv_message(&mut self) -> Result<Option<Message>>;\n\n\n\n /// メッセージを送信する.\n\n ///\n\n /// もしメッセージ送信に何らかの理由で失敗した場合でも、単に無視される.\n\n /// 仮にチャンネルの致命的な問題が発生している場合には、次の`try_recv_message`メソッドの\n\n /// 呼び出しで`Err`を返すこと.\n\n fn send_message(&mut self, message: Message);\n\n\n\n /// ローカルノードの投票状況を保存する.\n\n fn save_ballot(&mut self, ballot: Ballot) -> Self::SaveBallot;\n\n\n\n /// ローカルノードの前回の投票状況を取得する.\n\n fn load_ballot(&mut self) -> Self::LoadBallot;\n\n\n\n /// ローカルログの前半部分(i.e., スナップショット)を保存する.\n\n ///\n","file_path":"src/io.rs","rank":43,"score":35534.93172938488},{"content":" /// 新メンバのみの構成への移行完了を把握したい場合には、後続のコミットイベントの\n\n /// 追跡を行う必要がある.\n\n ///\n\n /// もし返り値の`LogPosition`とは分岐した`Event::Committed`が返された場合には、\n\n /// この提案が棄却されたことを示している.\n\n ///\n\n /// 複数の構成変更を並行して実施することは可能だが、\n\n /// その場合は、最後に提案されたものが最終的な構成として採用される.\n\n ///\n\n /// # Errors\n\n ///\n\n /// 非リーダノードに対して、このメソッドが実行された場合には、\n\n /// `ErrorKind::NotLeader`を理由としたエラーが返される.\n\n pub fn propose_config(&mut self, new_members: ClusterMembers) -> Result<ProposalId> {\n\n if let RoleState::Leader(ref mut leader) = self.node.role {\n\n let config = self.node.common.config().start_config_change(new_members);\n\n let term = self.node.common.term();\n\n let entry = LogEntry::Config { term, config };\n\n let proposal_id = leader.propose(&mut self.node.common, entry);\n\n Ok(proposal_id)\n","file_path":"src/replicated_log.rs","rank":44,"score":34270.66912043306},{"content":" ///\n\n /// なお、ノードの再起動時を除いて、`node_id`には対象クラスタの歴史の中でユニークなIDを\n\n /// 割り当てるのが望ましい.\n\n /// (レアケースではあるが、新規追加ノードを、以前に存在したノードと誤認識されてしまうと、\n\n /// 分散ログの整合性が壊れてしまう危険性があるため)\n\n ///\n\n /// また、以前のノードを再起動したい場合でも、もし永続ストレージが壊れている等の理由で、\n\n /// 前回の状態を正確に復元できないのであれば、\n\n /// ノード名を変更して、新規ノード追加扱いにした方が安全である.\n\n #[allow(clippy::new_ret_no_self)]\n\n pub fn new(\n\n node_id: NodeId,\n\n members: ClusterMembers,\n\n io: IO,\n\n metric_builder: &MetricBuilder,\n\n ) -> Result<Self> {\n\n let config = ClusterConfig::new(members);\n\n let mut metric_builder = metric_builder.clone();\n\n metric_builder.namespace(\"raftlog\");\n\n let metrics = track!(RaftlogMetrics::new(&metric_builder))?;\n","file_path":"src/replicated_log.rs","rank":45,"score":34266.54895619708},{"content":" /// 既にローカルログに対するスナップショットのインストールが進行中の場合には、\n\n /// `ErrorKind::Busy`を理由としてエラーが返される.\n\n ///\n\n /// また現在のログの先頭よりも前の地点のスナップショットをインストールしようとした場合には、\n\n /// `ErrorKind::InvalidInput`を理由としたエラーが返される.\n\n pub fn install_snapshot(&mut self, new_head: LogIndex, snapshot: Vec<u8>) -> Result<()> {\n\n track_assert!(\n\n !self.node.is_loading(),\n\n ErrorKind::Busy,\n\n \"Loading node state\"\n\n );\n\n\n\n let (prev_term, config) = {\n\n let record = track!(\n\n self.node\n\n .common\n\n .log()\n\n .get_record(new_head)\n\n .ok_or_else(|| ErrorKind::InvalidInput.error()),\n\n \"Too old log position: new_head={:?}, current_head={:?}, node={:?}\",\n","file_path":"src/replicated_log.rs","rank":46,"score":34265.626708879674},{"content":"use futures::{Poll, Stream};\n\nuse prometrics::metrics::MetricBuilder;\n\nuse std::sync::Arc;\n\nuse trackable::error::ErrorKindExt;\n\n\n\nuse crate::cluster::{ClusterConfig, ClusterMembers};\n\nuse crate::election::{Ballot, Role};\n\nuse crate::io::Io;\n\nuse crate::log::{LogEntry, LogHistory, LogIndex, LogPosition, LogPrefix, ProposalId};\n\nuse crate::message::SequenceNumber;\n\nuse crate::metrics::RaftlogMetrics;\n\nuse crate::node::{Node, NodeId};\n\nuse crate::node_state::{NodeState, RoleState};\n\nuse crate::{Error, ErrorKind, Result};\n\n\n\n/// Raftアルゴリズムに基づく分散複製ログ.\n\n///\n\n/// 利用者は`propose_command`メソッドを使って、コマンドをログに複製保存し、\n\n/// 発生する`Event`をハンドリングすることで、\n\n/// 整合性のある複製状態機械を実現することが可能となる.\n","file_path":"src/replicated_log.rs","rank":47,"score":34263.64583465007},{"content":"///\n\n/// `ReplicatedLog`は`Stream`トレイトを実装しているが、\n\n/// これは無限ストリームであり、エラー時を除いて終了することはない.\n\n///\n\n/// ただし、構成変更によりノードがクラスタから切り離された場合は、\n\n/// 最終的には、イベントが生成されることは無くなる.\n\n/// `this.local_history().config().is_known_node()`メソッドを使うことで、\n\n/// クラスタ内に属しているかどうかは判定可能なので、利用者側が明示的に確認して、\n\n/// 不要になった`ReplicatedLog`インスタンスを回収することは可能.\n\npub struct ReplicatedLog<IO: Io> {\n\n node: NodeState<IO>,\n\n metrics: Arc<RaftlogMetrics>,\n\n}\n\nimpl<IO: Io> ReplicatedLog<IO> {\n\n /// `members`で指定されたクラスタに属する`ReplicatedLog`のローカルインスタンス(ノード)を生成する.\n\n ///\n\n /// ローカルノードのIDは`node_id`で指定するが、これが`members`の含まれている必要は必ずしもない.\n\n /// 例えば、クラスタの構成変更に伴い、新規ノードを追加したい場合には、\n\n /// `members`に現行構成を指定することが望ましいが、このケースでは、\n\n /// `node_id`は`members`の中には含まれないことになる.\n","file_path":"src/replicated_log.rs","rank":48,"score":34263.2415772414},{"content":" /// # Errors\n\n ///\n\n /// 非リーダノードに対して、このメソッドが実行された場合には、\n\n /// `ErrorKind::NotLeader`を理由としたエラーが返される.\n\n pub fn heartbeat(&mut self) -> Result<SequenceNumber> {\n\n if let RoleState::Leader(ref mut leader) = self.node.role {\n\n let seq_no = leader.heartbeat_syn(&mut self.node.common);\n\n Ok(seq_no)\n\n } else {\n\n track_panic!(ErrorKind::NotLeader);\n\n }\n\n }\n\n\n\n /// ローカルログにスナップショットをインストールする.\n\n ///\n\n /// `new_head`が新しいローカルログの先頭位置となり、\n\n /// `snapshot`はその地点までのコマンド群が適用済みの状態機械のスナップショット、となる.\n\n ///\n\n /// # Errors\n\n ///\n","file_path":"src/replicated_log.rs","rank":49,"score":34262.66923943766},{"content":" self.node.common.release_io()\n\n }\n\n}\n\nimpl<IO: Io> Stream for ReplicatedLog<IO> {\n\n type Item = Event;\n\n type Error = Error;\n\n fn poll(&mut self) -> Poll<Option<Self::Item>, Self::Error> {\n\n track!(self.node.poll(), \"node={:?}\", self.local_node())\n\n }\n\n}\n\n\n\n/// `ReplicatedLog`から発生するイベント一覧.\n\n#[derive(Debug, PartialEq, Eq)]\n\n#[allow(missing_docs)]\n\npub enum Event {\n\n /// ローカルノードの役割が変わった.\n\n RoleChanged { new_role: Role },\n\n\n\n /// 新しい選挙期間に移った.\n\n TermChanged { new_ballot: Ballot },\n","file_path":"src/replicated_log.rs","rank":50,"score":34262.59552161272},{"content":"use std::collections::VecDeque;\n\nuse trackable::error::ErrorKindExt;\n\n\n\nuse crate::cluster::ClusterConfig;\n\nuse crate::log::{LogEntry, LogIndex, LogPosition, LogPrefix, LogSuffix};\n\nuse crate::{ErrorKind, Result};\n\n\n\n/// ローカルログの歴史(要約)を保持するためのデータ構造.\n\n///\n\n/// スナップショット地点以降のローカルログに関して発生した、\n\n/// 重要な出来事(i.g., `Term`の変更)が記録されている.\n\n///\n\n/// それ以外に「ログの末尾(log_tail)」および「ログのコミット済み末尾(log_committed_tail)」、\n\n/// 「ログの消費済み末尾(log_consumed_tail)」の三つの地点を保持している.\n\n///\n\n/// それらの関しては`log_consumed_tail <= log_committed_tail <= log_tail`の不変項が維持される.\n\n#[derive(Debug, Clone)]\n\npub struct LogHistory {\n\n appended_tail: LogPosition,\n\n committed_tail: LogPosition,\n","file_path":"src/log/history.rs","rank":51,"score":34262.561864374664},{"content":" ///\n\n /// `new_tail`が`LogSuffix`が保持する範囲の外の場合には、\n\n /// `ErrorKind::InvalidInput`を理由としたエラーが返される.\n\n pub fn truncate(&mut self, new_tail: LogIndex) -> Result<()> {\n\n track_assert!(self.head.index <= new_tail, ErrorKind::InvalidInput);\n\n track_assert!(new_tail <= self.tail().index, ErrorKind::InvalidInput);\n\n let delta = self.tail().index - new_tail;\n\n let new_len = self.entries.len() - delta;\n\n self.entries.truncate(new_len);\n\n Ok(())\n\n }\n\n\n\n /// 指定された範囲のログ領域を切り出して返す.\n\n ///\n\n /// # Errors\n\n ///\n\n /// `self`が指定範囲を包含していない場合には、\n\n /// `ErrorKind::InvalidInput`を理由としてエラーが返される.\n\n pub fn slice(&self, start: LogIndex, end: LogIndex) -> Result<Self> {\n\n track_assert!(self.head.index <= start, ErrorKind::InvalidInput);\n","file_path":"src/log/mod.rs","rank":52,"score":34262.489747051775},{"content":" /// `new_head`は、現在のログの末尾を超えていても良いが、\n\n /// 現在のログの先頭以前のものは許容されない.\n\n /// (スナップショット地点から現在までの歴史が消失してしまうため)\n\n ///\n\n /// なお、`head`以前の記録は歴史から削除される.\n\n pub fn record_snapshot_installed(\n\n &mut self,\n\n new_head: LogPosition,\n\n config: ClusterConfig,\n\n ) -> Result<()> {\n\n track_assert!(\n\n self.head().index <= new_head.index,\n\n ErrorKind::InconsistentState,\n\n \"self.head={:?}, new_head={:?}\",\n\n self.head(),\n\n new_head\n\n );\n\n\n\n // スナップショット地点までの歴史は捨てる\n\n while self\n","file_path":"src/log/history.rs","rank":53,"score":34262.47510815974},{"content":" /// スナップショットが読み込まれたことを記録する.\n\n ///\n\n /// ローカルログ内のスナップショット地点までのエントリは、消費されたものとして扱われる.\n\n pub fn record_snapshot_loaded(&mut self, snapshot: &LogPrefix) -> Result<()> {\n\n if self.consumed_tail.index < snapshot.tail.index {\n\n track_assert!(\n\n snapshot.tail.index <= self.committed_tail.index,\n\n ErrorKind::InconsistentState,\n\n \"snapshot.tail.index={:?}, self.committed_tail.index={:?}\",\n\n snapshot.tail.index,\n\n self.committed_tail.index\n\n );\n\n self.consumed_tail = snapshot.tail;\n\n }\n\n Ok(())\n\n }\n\n}\n\n\n\n/// `LogHistory`に保持されるレコード.\n\n#[derive(Debug, Clone)]\n","file_path":"src/log/history.rs","rank":54,"score":34262.4161360622},{"content":" /// # Errors\n\n ///\n\n /// 非リーダノードに対して、このメソッドが実行された場合には、\n\n /// `ErrorKind::NotLeader`を理由としたエラーが返される.\n\n pub fn propose_command(&mut self, command: Vec<u8>) -> Result<ProposalId> {\n\n if let RoleState::Leader(ref mut leader) = self.node.role {\n\n let term = self.node.common.term();\n\n let entry = LogEntry::Command { term, command };\n\n let proposal_id = leader.propose(&mut self.node.common, entry);\n\n Ok(proposal_id)\n\n } else {\n\n track_panic!(ErrorKind::NotLeader)\n\n }\n\n }\n\n\n\n /// 新しいクラスタ構成(新メンバ群)を提案する.\n\n ///\n\n /// 提案が承認(コミット)された場合には、返り値の`LogPosition`を含む\n\n /// `Event::Committed`イベントが返される.\n\n /// ただし、承認された場合であっても、それは新旧混合状態の構成が承認されただけであり、\n","file_path":"src/replicated_log.rs","rank":55,"score":34262.16914503528},{"content":"//! ノードローカルなログ関連の構成要素群.\n\nuse std::ops::{Add, AddAssign, Sub, SubAssign};\n\n\n\npub use self::history::{HistoryRecord, LogHistory};\n\n\n\nuse crate::cluster::ClusterConfig;\n\nuse crate::election::Term;\n\nuse crate::{ErrorKind, Result};\n\n\n\nmod history;\n\n\n\n/// ローカルログ.\n\n#[derive(Debug)]\n\npub enum Log {\n\n /// ログの前半部分 (i.e., スナップショット).\n\n Prefix(LogPrefix),\n\n\n\n /// ログの後半部分>\n\n Suffix(LogSuffix),\n\n}\n","file_path":"src/log/mod.rs","rank":56,"score":34262.079309011286},{"content":" new_head,\n\n self.local_history().head(),\n\n self.local_node()\n\n )?;\n\n (record.head.prev_term, record.config.clone())\n\n };\n\n let prefix = LogPrefix {\n\n tail: LogPosition {\n\n prev_term,\n\n index: new_head,\n\n },\n\n config,\n\n snapshot,\n\n };\n\n track!(self.node.common.install_snapshot(prefix))?;\n\n Ok(())\n\n }\n\n\n\n /// 新しい選挙を開始する.\n\n ///\n","file_path":"src/replicated_log.rs","rank":57,"score":34261.67656120324},{"content":" }\n\n\n\n /// I/O実装に対する参照を返す.\n\n pub fn io(&self) -> &IO {\n\n self.node.common.io()\n\n }\n\n\n\n /// I/O実装に対する破壊的な参照を返す.\n\n ///\n\n /// # Safety\n\n /// 破壊的な操作は、Raftの管理外の挙動となり、\n\n /// 整合性を崩してしまう可能性もあるので、\n\n /// 注意を喚起する意味で`unsafe`と設定されている.\n\n pub unsafe fn io_mut(&mut self) -> &mut IO {\n\n self.node.common.io_mut()\n\n }\n\n\n\n /// このReplicatedLogの所有権を放棄し、\n\n /// その代わりに内部で使われているIOインスタンスを取得する.\n\n pub fn release_io(self) -> IO {\n","file_path":"src/replicated_log.rs","rank":58,"score":34260.85681905093},{"content":"pub struct HistoryRecord {\n\n /// 記録地点.\n\n pub head: LogPosition,\n\n\n\n /// 記録時のクラスタ構成.\n\n pub config: ClusterConfig,\n\n}\n\nimpl HistoryRecord {\n\n fn new(head: LogPosition, config: ClusterConfig) -> Self {\n\n HistoryRecord { head, config }\n\n }\n\n}\n","file_path":"src/log/history.rs","rank":59,"score":34260.376056602894},{"content":" pub config: ClusterConfig,\n\n\n\n /// 前半部分に含まれるコマンド群の適用後の状態機械のスナップショット.\n\n pub snapshot: Vec<u8>,\n\n}\n\n\n\n/// ログの後半部分.\n\n///\n\n/// 厳密には、常に\"後半部分\"、つまり「ある地点より後ろの全てのエントリ」を\n\n/// 含んでいる訳ではない.\n\n///\n\n/// ただし、このデータ構造自体は、常に追記的なアクセスのために利用され、\n\n/// \"ログの途中の一部だけを更新する\"といった操作は発生しないので、\n\n/// \"常にログの末尾に対して適用される\"的な意味合いで`Suffix`と付けている.\n\n#[derive(Debug, Clone)]\n\npub struct LogSuffix {\n\n /// ログの開始位置.\n\n ///\n\n /// `entries`のサイズが1以上の場合には、\n\n /// その最初のエントリの位置となる.\n","file_path":"src/log/mod.rs","rank":60,"score":34259.9436534265},{"content":" /// 何らかの手段で現在のリーダのダウンを検知した場合に呼び出される.\n\n pub fn start_election(&mut self) {\n\n self.node.start_election();\n\n }\n\n\n\n /// ローカルノードの情報を返す.\n\n pub fn local_node(&self) -> &Node {\n\n self.node.common.local_node()\n\n }\n\n\n\n /// ローカルログの履歴を返す.\n\n pub fn local_history(&self) -> &LogHistory {\n\n self.node.common.log()\n\n }\n\n\n\n /// ローカルログへの書き込み待ちの状態の提案群の数を返す.\n\n ///\n\n /// この値は、ローカルストレージの詰まり具合を把握するために有用である.\n\n ///\n\n /// 「ローカルログへは追記完了 and コミット待ち」の個数は\n","file_path":"src/replicated_log.rs","rank":61,"score":34259.70990628072},{"content":" let node = NodeState::load(node_id, config, io, metrics.node_state.clone());\n\n Ok(ReplicatedLog {\n\n node,\n\n metrics: Arc::new(metrics),\n\n })\n\n }\n\n\n\n /// `raftlog` のメトリクスを返す。\n\n pub fn metrics(&self) -> &Arc<RaftlogMetrics> {\n\n &self.metrics\n\n }\n\n\n\n /// 新しいコマンドを提案する.\n\n ///\n\n /// 提案が承認(コミット)された場合には、返り値の`LogPosition`を含む\n\n /// `Event::Committed`イベントが返される.\n\n ///\n\n /// もし返り値の`LogPosition`とは分岐した`Event::Committed`が返された場合には、\n\n /// この提案が棄却されたことを示している.\n\n ///\n","file_path":"src/replicated_log.rs","rank":62,"score":34259.70951913113},{"content":" pub fn record_appended(&mut self, suffix: &LogSuffix) -> Result<()> {\n\n let entries_offset = if self.appended_tail.index <= suffix.head.index {\n\n 0\n\n } else {\n\n // NOTE:\n\n // 追記中にスナップショットがインストールされた場合に、\n\n // 両者の先頭位置がズレることがあるので調整する\n\n self.appended_tail.index - suffix.head.index\n\n };\n\n for (i, e) in suffix.entries.iter().enumerate().skip(entries_offset) {\n\n let tail = LogPosition {\n\n prev_term: e.term(),\n\n index: suffix.head.index + i + 1,\n\n };\n\n if let LogEntry::Config { ref config, .. } = *e {\n\n if self.last_record().config != *config {\n\n // クラスタ構成が変更された\n\n let record = HistoryRecord::new(tail, config.clone());\n\n self.records.push_back(record);\n\n }\n","file_path":"src/log/history.rs","rank":63,"score":34259.1390156538},{"content":" /// 知りたい場合には`local_history`メソッド経由で取得可能.\n\n ///\n\n /// ローカルノードが非リーダである場合には、常に`0`が返される.\n\n pub fn proposal_queue_len(&self) -> usize {\n\n if let RoleState::Leader(ref leader) = self.node.role {\n\n leader.proposal_queue_len(&self.node.common)\n\n } else {\n\n 0\n\n }\n\n }\n\n\n\n /// スナップショットをインストール中の場合には`true`を返す.\n\n ///\n\n /// このメソッドが`true`を返している間は、\n\n /// 新しいスナップショットのインストールを行うことはできない.\n\n pub fn is_snapshot_installing(&self) -> bool {\n\n // 起動後のロードフェーズの間もスナップショットのインストールは行えないので、\n\n // その場合も`true`を返しておく.\n\n self.node.is_loading() || self.node.common.is_snapshot_installing()\n\n }\n","file_path":"src/replicated_log.rs","rank":64,"score":34259.00493786795},{"content":" ///\n\n /// リーダ選出時には、最初にこのエントリがログに追加され、\n\n /// `Term`が変わったことを記録する.\n\n Noop { term: Term },\n\n\n\n /// クラスタ構成の変更を共有するためのエントリ.\n\n Config { term: Term, config: ClusterConfig },\n\n\n\n /// 状態機械の入力となるコマンドを格納したエントリ.\n\n Command { term: Term, command: Vec<u8> },\n\n}\n\nimpl LogEntry {\n\n /// このエントリが発行された`Term`を返す.\n\n pub fn term(&self) -> Term {\n\n match *self {\n\n LogEntry::Noop { term } => term,\n\n LogEntry::Config { term, .. } => term,\n\n LogEntry::Command { term, .. } => term,\n\n }\n\n }\n","file_path":"src/log/mod.rs","rank":65,"score":34258.610196698566},{"content":" consumed_tail: LogPosition,\n\n records: VecDeque<HistoryRecord>,\n\n}\n\nimpl LogHistory {\n\n /// 初期クラスタ構成を与えて、新しい`LogHistory`インスタンスを生成する.\n\n pub fn new(config: ClusterConfig) -> Self {\n\n let initial = HistoryRecord::new(LogPosition::default(), config);\n\n LogHistory {\n\n appended_tail: LogPosition::default(),\n\n committed_tail: LogPosition::default(),\n\n consumed_tail: LogPosition::default(),\n\n records: vec![initial].into(),\n\n }\n\n }\n\n\n\n /// ローカルログの先端位置を返す.\n\n pub fn head(&self) -> LogPosition {\n\n self.records[0].head\n\n }\n\n\n","file_path":"src/log/history.rs","rank":66,"score":34258.593878833264},{"content":" }\n\n if tail.prev_term != self.last_record().head.prev_term {\n\n // 新しい選挙期間(`Term`)に移った\n\n track_assert!(\n\n self.last_record().head.prev_term < tail.prev_term,\n\n ErrorKind::Other,\n\n \"last_record.head={:?}, tail={:?}\",\n\n self.last_record().head,\n\n tail\n\n );\n\n let record = HistoryRecord::new(tail, self.last_record().config.clone());\n\n self.records.push_back(record);\n\n }\n\n }\n\n self.appended_tail = suffix.tail();\n\n Ok(())\n\n }\n\n\n\n /// `new_tail_index`までコミット済み地点が進んだことを記録する.\n\n pub fn record_committed(&mut self, new_tail_index: LogIndex) -> Result<()> {\n","file_path":"src/log/history.rs","rank":67,"score":34258.092115432504},{"content":" Ok(())\n\n }\n\n\n\n /// `new_tail`までのログに含まれるコマンドが消費されたことを記録する.\n\n ///\n\n /// ここでの\"消費\"とは「状態機械に入力として渡されて実行された」ことを意味する.\n\n pub fn record_consumed(&mut self, new_tail_index: LogIndex) -> Result<()> {\n\n track_assert!(self.consumed_tail.index <= new_tail_index, ErrorKind::Other);\n\n track_assert!(\n\n new_tail_index <= self.committed_tail.index,\n\n ErrorKind::Other\n\n );\n\n\n\n let prev_term =\n\n track!(self.get_record(new_tail_index).ok_or_else(\n\n || ErrorKind::Other.cause(format!(\"Too old index: {:?}\", new_tail_index))\n\n ))?\n\n .head\n\n .prev_term;\n\n self.consumed_tail = LogPosition {\n","file_path":"src/log/history.rs","rank":68,"score":34257.671393677396},{"content":"impl Default for LogSuffix {\n\n fn default() -> Self {\n\n LogSuffix {\n\n head: LogPosition::default(),\n\n entries: Vec::new(),\n\n }\n\n }\n\n}\n\n\n\n/// `LogSuffix`に含まれるログの位置を走査するための`Iterator`実装.\n\n#[derive(Debug)]\n\npub struct LogPositions<'a> {\n\n suffix: &'a LogSuffix,\n\n offset: usize,\n\n}\n\nimpl<'a> Iterator for LogPositions<'a> {\n\n type Item = LogPosition;\n\n fn next(&mut self) -> Option<Self::Item> {\n\n if self.suffix.entries.len() < self.offset {\n\n None\n","file_path":"src/log/mod.rs","rank":69,"score":34257.63386995779},{"content":"\n\n /// 後半部分に含まれるエントリの位置を走査するためのイテレータを返す.\n\n pub fn positions(&self) -> LogPositions {\n\n LogPositions {\n\n suffix: self,\n\n offset: 0,\n\n }\n\n }\n\n\n\n /// `new_head`のまでスキップする.\n\n ///\n\n /// 現在の先頭から`new_head`までのエントリは破棄され、`new_head`が新しい先頭になる.\n\n ///\n\n /// # Errors\n\n ///\n\n /// 以下のいずれかの場合には`ErrorKind::InvalidInput`が返される:\n\n ///\n\n /// - `new_head < self.head.index`\n\n /// - `self.tail().index < new_head`\n\n pub fn skip_to(&mut self, new_head: LogIndex) -> Result<()> {\n","file_path":"src/log/mod.rs","rank":70,"score":34257.56506588406},{"content":" /// ローカルログの終端位置を返す.\n\n pub fn tail(&self) -> LogPosition {\n\n self.appended_tail\n\n }\n\n\n\n /// ローカルログのコミット済みの終端位置を返す.\n\n ///\n\n /// 「コミット済みの終端」==「未コミットの始端」\n\n pub fn committed_tail(&self) -> LogPosition {\n\n self.committed_tail\n\n }\n\n\n\n /// ローカルログの適用済みの終端位置を返す.\n\n pub fn consumed_tail(&self) -> LogPosition {\n\n self.consumed_tail\n\n }\n\n\n\n /// ローカルログに記録された最新のクラスタ構成を返す.\n\n pub fn config(&self) -> &ClusterConfig {\n\n &self.last_record().config\n","file_path":"src/log/history.rs","rank":71,"score":34257.35553214644},{"content":"impl From<LogPrefix> for Log {\n\n fn from(f: LogPrefix) -> Self {\n\n Log::Prefix(f)\n\n }\n\n}\n\nimpl From<LogSuffix> for Log {\n\n fn from(f: LogSuffix) -> Self {\n\n Log::Suffix(f)\n\n }\n\n}\n\n\n\n/// ログの前半部分 (i.e., スナップショット).\n\n#[derive(Debug, Clone)]\n\npub struct LogPrefix {\n\n /// 前半部分の終端位置.\n\n ///\n\n /// \"終端位置\" = \"前半部分に含まれない最初の位置\".\n\n pub tail: LogPosition,\n\n\n\n /// 前半部分に含まれる中で、最新の構成情報.\n","file_path":"src/log/mod.rs","rank":72,"score":34257.00438148588},{"content":" /// 新しい`LogIndex`インスタンスを生成する.\n\n pub fn new(index: u64) -> Self {\n\n LogIndex(index)\n\n }\n\n\n\n /// インデックスの値を返す.\n\n pub fn as_u64(self) -> u64 {\n\n self.0\n\n }\n\n}\n\nimpl From<u64> for LogIndex {\n\n fn from(f: u64) -> Self {\n\n LogIndex::new(f)\n\n }\n\n}\n\nimpl Add<usize> for LogIndex {\n\n type Output = Self;\n\n fn add(self, rhs: usize) -> Self::Output {\n\n LogIndex(self.0 + rhs as u64)\n\n }\n","file_path":"src/log/mod.rs","rank":73,"score":34256.94995746031},{"content":"}\n\nimpl AddAssign<usize> for LogIndex {\n\n fn add_assign(&mut self, rhs: usize) {\n\n self.0 += rhs as u64;\n\n }\n\n}\n\nimpl Sub for LogIndex {\n\n type Output = usize;\n\n fn sub(self, rhs: Self) -> Self::Output {\n\n (self.0 - rhs.0) as usize\n\n }\n\n}\n\nimpl Sub<usize> for LogIndex {\n\n type Output = Self;\n\n fn sub(self, rhs: usize) -> Self::Output {\n\n LogIndex(self.0 - rhs as u64)\n\n }\n\n}\n\nimpl SubAssign<usize> for LogIndex {\n\n fn sub_assign(&mut self, rhs: usize) {\n","file_path":"src/log/mod.rs","rank":74,"score":34256.26600747565},{"content":" let suffix = LogSuffix {\n\n head: LogPosition {\n\n prev_term: 0.into(),\n\n index: 30.into(),\n\n },\n\n entries: vec![noop(0), noop(2), noop(2)],\n\n };\n\n assert_eq!(\n\n suffix.positions().collect::<Vec<_>>(),\n\n [id(0, 30), id(0, 31), id(2, 32), id(2, 33)]\n\n );\n\n assert_eq!(suffix.entries.len(), 3);\n\n\n\n let slice = suffix.slice(31.into(), 33.into()).unwrap();\n\n assert_eq!(\n\n slice.positions().collect::<Vec<_>>(),\n\n [id(0, 31), id(2, 32), id(2, 33)]\n\n );\n\n assert_eq!(slice.entries.len(), 2);\n\n }\n\n}\n","file_path":"src/log/mod.rs","rank":75,"score":34256.1753938002},{"content":" prev_term,\n\n index: new_tail_index,\n\n };\n\n Ok(())\n\n }\n\n\n\n /// 「追記済み and 未コミット」な末尾領域がロールバック(破棄)されたことを記録する.\n\n ///\n\n /// ログの新しい終端は`new_tail`となる.\n\n pub fn record_rollback(&mut self, new_tail: LogPosition) -> Result<()> {\n\n track_assert!(new_tail.index <= self.appended_tail.index, ErrorKind::Other);\n\n track_assert!(\n\n self.committed_tail.index <= new_tail.index,\n\n ErrorKind::Other,\n\n \"old={:?}, new={:?}\",\n\n self.committed_tail,\n\n new_tail\n\n );\n\n track_assert_eq!(\n\n self.get_record(new_tail.index).map(|r| r.head.prev_term),\n","file_path":"src/log/history.rs","rank":76,"score":34256.11570078021},{"content":"\n\n /// 過半数以上の応答を得られた最新のハートビート(i.e., AppendEntriesCall) のシーケンス番号を返す.\n\n ///\n\n /// この値は、同じ選挙期間に関しては減少することはないことが保証されている.\n\n ///\n\n /// # 注意\n\n ///\n\n /// ハートビートを行うのはリーダノードのみなので、それ以外のノードに関しては、\n\n /// このメソッドが返す値は意味を持たない.\n\n pub fn last_heartbeat_ack(&self) -> SequenceNumber {\n\n if let RoleState::Leader(ref leader) = self.node.role {\n\n leader.last_heartbeat_ack()\n\n } else {\n\n SequenceNumber::new(0)\n\n }\n\n }\n\n\n\n /// 現在のクラスタ構成を返す.\n\n pub fn cluster_config(&self) -> &ClusterConfig {\n\n self.node.common.config()\n","file_path":"src/replicated_log.rs","rank":77,"score":34255.59717826611},{"content":" track_assert!(start <= end, ErrorKind::InvalidInput);\n\n track_assert!(end <= self.tail().index, ErrorKind::InvalidInput);\n\n let slice_start = start - self.head.index;\n\n let slice_end = end - self.head.index;\n\n let slice_head = if start == self.head.index {\n\n self.head\n\n } else {\n\n let prev_term = self.entries[slice_start - 1].term();\n\n LogPosition {\n\n prev_term,\n\n index: start,\n\n }\n\n };\n\n let slice_entries = self.entries[slice_start..slice_end].into();\n\n Ok(LogSuffix {\n\n head: slice_head,\n\n entries: slice_entries,\n\n })\n\n }\n\n}\n","file_path":"src/log/mod.rs","rank":78,"score":34255.20345067375},{"content":" };\n\n assert_eq!(\n\n suffix.positions().collect::<Vec<_>>(),\n\n [id(0, 30), id(0, 31), id(2, 32), id(2, 33)]\n\n );\n\n }\n\n #[test]\n\n fn log_suffix_skip_to() {\n\n let mut suffix = LogSuffix {\n\n head: LogPosition {\n\n prev_term: 0.into(),\n\n index: 30.into(),\n\n },\n\n entries: vec![noop(0), noop(2), noop(2)],\n\n };\n\n assert_eq!(\n\n suffix.positions().collect::<Vec<_>>(),\n\n [id(0, 30), id(0, 31), id(2, 32), id(2, 33)]\n\n );\n\n assert_eq!(suffix.entries.len(), 3);\n","file_path":"src/log/mod.rs","rank":79,"score":34254.69927823274},{"content":"\n\n suffix.skip_to(31.into()).unwrap();\n\n assert_eq!(\n\n suffix.positions().collect::<Vec<_>>(),\n\n [id(0, 31), id(2, 32), id(2, 33)]\n\n );\n\n assert_eq!(suffix.entries.len(), 2);\n\n\n\n suffix.skip_to(33.into()).unwrap();\n\n assert_eq!(suffix.positions().collect::<Vec<_>>(), [id(2, 33)]);\n\n assert_eq!(suffix.entries.len(), 0);\n\n\n\n suffix.skip_to(33.into()).unwrap();\n\n assert_eq!(suffix.positions().collect::<Vec<_>>(), [id(2, 33)]);\n\n assert_eq!(suffix.entries.len(), 0);\n\n }\n\n #[test]\n\n fn log_suffix_truncate() {\n\n let mut suffix = LogSuffix {\n\n head: LogPosition {\n","file_path":"src/log/mod.rs","rank":80,"score":34254.46706470018},{"content":" /// let b = LogPosition { prev_term: 10.into(), index: 3.into() };\n\n /// assert!(a.is_newer_or_equal_than(b));\n\n /// assert!(!b.is_newer_or_equal_than(a));\n\n ///\n\n /// // `a`の方がインデックスは大きいが、`b`の方が`Term`は大きい\n\n /// // => 順序が確定できない\n\n /// let a = LogPosition { prev_term: 5.into(), index: 10.into() };\n\n /// let b = LogPosition { prev_term: 10.into(), index: 3.into() };\n\n /// assert!(!a.is_newer_or_equal_than(b));\n\n /// assert!(!b.is_newer_or_equal_than(a));\n\n /// ```\n\n pub fn is_newer_or_equal_than(&self, other: LogPosition) -> bool {\n\n self.prev_term >= other.prev_term && self.index >= other.index\n\n }\n\n}\n\n\n\n/// あるログエントリのインデックス.\n\n#[derive(Debug, Default, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]\n\npub struct LogIndex(u64);\n\nimpl LogIndex {\n","file_path":"src/log/mod.rs","rank":81,"score":34254.29765847175},{"content":" prev_term: 0.into(),\n\n index: 30.into(),\n\n },\n\n entries: vec![noop(0), noop(2), noop(2)],\n\n };\n\n assert_eq!(\n\n suffix.positions().collect::<Vec<_>>(),\n\n [id(0, 30), id(0, 31), id(2, 32), id(2, 33)]\n\n );\n\n assert_eq!(suffix.entries.len(), 3);\n\n\n\n suffix.truncate(31.into()).unwrap();\n\n assert_eq!(\n\n suffix.positions().collect::<Vec<_>>(),\n\n [id(0, 30), id(0, 31)]\n\n );\n\n assert_eq!(suffix.entries.len(), 1);\n\n }\n\n #[test]\n\n fn log_suffix_slice() {\n","file_path":"src/log/mod.rs","rank":82,"score":34253.75957121981},{"content":"\n\n /// 新しいリーダーが選出された.\n\n NewLeaderElected,\n\n\n\n /// 新しいログエントリがコミットされた.\n\n ///\n\n /// エントリの内容がコマンドの場合には、\n\n /// `ReplicatedLog`の利用者は、自身が管理する状態機械に、\n\n /// `command`を適用する必要がある.\n\n ///\n\n /// ログエントリはインデックスの昇順でコミットされ,\n\n /// インデックスは常に一ずつ増加する.\n\n Committed { index: LogIndex, entry: LogEntry },\n\n\n\n /// スナップショットがロードされた.\n\n ///\n\n /// `ReplicatedLog`の利用者は、自身が管理する状態機械を、\n\n /// `snapshot`の状態にリセットする必要がある.\n\n SnapshotLoaded {\n\n new_head: LogPosition,\n","file_path":"src/replicated_log.rs","rank":83,"score":34253.342411234924},{"content":" snapshot: Vec<u8>,\n\n },\n\n\n\n /// スナップショットのインストールが行われた.\n\n ///\n\n /// もし`new_head`の位置が、最新のコミット済み地点よりも\n\n /// 新しい場合には、これとは別に`SnapshotLoaded`イベントが発行される.\n\n SnapshotInstalled { new_head: LogPosition },\n\n}\n","file_path":"src/replicated_log.rs","rank":84,"score":34252.8017413101},{"content":"}\n\n\n\n/// 提案ID.\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\n\npub struct ProposalId {\n\n /// 提案が発行された時の`Term`.\n\n pub term: Term,\n\n\n\n /// 提案を保持するエントリのログ内でのインデックス.\n\n pub index: LogIndex,\n\n}\n\n\n\n/// ログの特定位置を識別するためのデータ構造.\n\n#[derive(Debug, Default, Clone, Copy, PartialEq, Eq, Hash)]\n\npub struct LogPosition {\n\n /// 一つ前のインデックスのエントリの`Term`.\n\n pub prev_term: Term,\n\n\n\n /// この位置のインデックス.\n\n pub index: LogIndex,\n","file_path":"src/log/mod.rs","rank":85,"score":34252.79125566706},{"content":" pub head: LogPosition,\n\n\n\n /// 後半部分に属するエントリ群.\n\n pub entries: Vec<LogEntry>,\n\n}\n\nimpl LogSuffix {\n\n /// ログの終端位置を返す.\n\n ///\n\n /// \"終端位置\" = \"entriesに含まれない最初のエントリの位置\".\n\n ///\n\n /// `entries`の最後の要素が、ログ全体の最後の要素と一致している場合には、\n\n /// \"終端位置\"は「次にログに追加される位置(= ログの末端)」となる.\n\n pub fn tail(&self) -> LogPosition {\n\n let prev_term = self\n\n .entries\n\n .last()\n\n .map_or(self.head.prev_term, LogEntry::term);\n\n let index = self.head.index + self.entries.len();\n\n LogPosition { prev_term, index }\n\n }\n","file_path":"src/log/mod.rs","rank":86,"score":34252.49948547952},{"content":"}\n\nimpl LogPosition {\n\n /// `self`がログ上で、`other`と等しい、あるいは、より後方に位置している場合に`true`が返る.\n\n ///\n\n /// なお`self`と`other`が、それぞれ分岐したログ上に位置しており、\n\n /// 前後関係が判断できない場合には`false`が返される.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// use raftlog::log::LogPosition;\n\n ///\n\n /// // `a`の方がインデックスが大きい\n\n /// let a = LogPosition { prev_term: 10.into(), index: 5.into() };\n\n /// let b = LogPosition { prev_term: 10.into(), index: 3.into() };\n\n /// assert!(a.is_newer_or_equal_than(b));\n\n /// assert!(!b.is_newer_or_equal_than(a));\n\n ///\n\n /// // `a`の方が`Term`が大きい\n\n /// let a = LogPosition { prev_term: 20.into(), index: 3.into() };\n","file_path":"src/log/mod.rs","rank":87,"score":34252.16254650308},{"content":" self.0 -= rhs as u64;\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n\n\n fn id(prev_term: u64, index: u64) -> LogPosition {\n\n LogPosition {\n\n prev_term: prev_term.into(),\n\n index: index.into(),\n\n }\n\n }\n\n fn noop(term: u64) -> LogEntry {\n\n LogEntry::Noop { term: term.into() }\n\n }\n\n\n\n #[test]\n\n fn log_suffix_end() {\n","file_path":"src/log/mod.rs","rank":88,"score":34251.8484899255},{"content":" let suffix = LogSuffix::default();\n\n assert_eq!(suffix.tail().index.as_u64(), 0);\n\n\n\n let suffix = LogSuffix {\n\n head: LogPosition::default(),\n\n entries: vec![noop(0), noop(1)],\n\n };\n\n assert_eq!(suffix.tail().index.as_u64(), 2);\n\n }\n\n #[test]\n\n fn log_suffix_positions() {\n\n let suffix = LogSuffix::default();\n\n assert_eq!(suffix.positions().collect::<Vec<_>>(), [id(0, 0)]);\n\n\n\n let suffix = LogSuffix {\n\n head: LogPosition {\n\n prev_term: 0.into(),\n\n index: 30.into(),\n\n },\n\n entries: vec![noop(0), noop(2), noop(2)],\n","file_path":"src/log/mod.rs","rank":89,"score":34251.51950467414},{"content":" }\n\n\n\n /// 最後に追加された`HistoryRecord`を返す.\n\n pub fn last_record(&self) -> &HistoryRecord {\n\n self.records.back().expect(\"Never fails\")\n\n }\n\n\n\n /// 指定されたインデックスが属するレコードを返す.\n\n ///\n\n /// 既に削除された領域が指定された場合には`None`が返される.\n\n pub fn get_record(&self, index: LogIndex) -> Option<&HistoryRecord> {\n\n for r in self.records.iter().rev() {\n\n if r.head.index <= index {\n\n return Some(r);\n\n }\n\n }\n\n None\n\n }\n\n\n\n /// `suffix`がローカルログに追記されたことを記録する.\n","file_path":"src/log/history.rs","rank":90,"score":34251.03482395725},{"content":" } else {\n\n let id = if self.offset == 0 {\n\n self.suffix.head\n\n } else {\n\n let i = self.offset - 1;\n\n let prev_term = self.suffix.entries[i].term();\n\n let index = self.suffix.head.index + self.offset;\n\n LogPosition { prev_term, index }\n\n };\n\n self.offset += 1;\n\n Some(id)\n\n }\n\n }\n\n}\n\n\n\n/// ログに格納されるエントリ.\n\n#[derive(Debug, Clone, PartialEq, Eq)]\n\n#[allow(missing_docs)]\n\npub enum LogEntry {\n\n /// 特に内容を持たないエントリ.\n","file_path":"src/log/mod.rs","rank":91,"score":34250.84713780836},{"content":" Some(new_tail.prev_term),\n\n ErrorKind::InconsistentState\n\n );\n\n self.appended_tail = new_tail;\n\n\n\n if let Some(new_len) = self\n\n .records\n\n .iter()\n\n .position(|r| r.head.index > new_tail.index)\n\n {\n\n self.records.truncate(new_len);\n\n }\n\n Ok(())\n\n }\n\n\n\n /// スナップショットがインストールされたことを記録する.\n\n ///\n\n /// `new_head`はスナップショットに含まれない最初のエントリのIDで、\n\n /// `config`はスナップショット取得時のクラスタ構成、を示す.\n\n ///\n","file_path":"src/log/history.rs","rank":92,"score":34250.664110564445},{"content":" .records\n\n .front()\n\n .map_or(false, |r| r.head.index <= new_head.index)\n\n {\n\n self.records.pop_front();\n\n }\n\n\n\n // 新しいログの先頭をセット\n\n let record = HistoryRecord::new(new_head, config);\n\n self.records.push_front(record);\n\n\n\n if self.appended_tail.index < new_head.index {\n\n self.appended_tail = new_head;\n\n }\n\n if self.committed_tail.index < new_head.index {\n\n self.committed_tail = new_head;\n\n }\n\n Ok(())\n\n }\n\n\n","file_path":"src/log/history.rs","rank":93,"score":34250.05097646147},{"content":" track_assert!(\n\n self.committed_tail.index <= new_tail_index,\n\n ErrorKind::Other\n\n );\n\n track_assert!(\n\n new_tail_index <= self.appended_tail.index,\n\n ErrorKind::Other,\n\n \"new_tail_index={:?}, self.appended_tail.index={:?}\",\n\n new_tail_index,\n\n self.appended_tail.index\n\n );\n\n let prev_term = track!(self\n\n .get_record(new_tail_index,)\n\n .ok_or_else(|| ErrorKind::Other.error(),))?\n\n .head\n\n .prev_term;\n\n self.committed_tail = LogPosition {\n\n prev_term,\n\n index: new_tail_index,\n\n };\n","file_path":"src/log/history.rs","rank":94,"score":34249.264323838026},{"content":" track_assert!(self.head.index <= new_head, ErrorKind::InvalidInput);\n\n track_assert!(new_head <= self.tail().index, ErrorKind::InvalidInput);\n\n let count = new_head - self.head.index;\n\n if count == 0 {\n\n return Ok(());\n\n }\n\n let prev_term = self\n\n .entries\n\n .drain(0..count)\n\n .last()\n\n .expect(\"Never fails\")\n\n .term();\n\n self.head.prev_term = prev_term;\n\n self.head.index += count;\n\n Ok(())\n\n }\n\n\n\n /// 終端を`new_tail`の位置まで切り詰める.\n\n ///\n\n /// # Errors\n","file_path":"src/log/mod.rs","rank":95,"score":34248.24152689339},{"content":" } else {\n\n track_panic!(ErrorKind::NotLeader)\n\n }\n\n }\n\n\n\n /// 強制的にハートビートメッセージ(i.e., AppendEntriesCall)をブロードキャストする.\n\n ///\n\n /// 返り値は、送信メッセージのシーケンス番号.\n\n ///\n\n /// `last_heartbeat_ack`メソッドを用いることで、\n\n /// このハートビートに対して、過半数以上の応答を得られた\n\n /// タイミングを把握することが可能.\n\n ///\n\n /// また、リーダのコミットを即座にフォロワーに伝えたい場合にも、\n\n /// このメソッドが活用可能。\n\n /// (`Event::Committed`をリーダが生成した直後に`heartbeat`メソッドを呼び出せば良い)\n\n ///\n\n /// なおノードの役割が非リーダに変わった場合には、\n\n /// 応答待機中のハートビートは全て破棄されるので注意が必要.\n\n ///\n","file_path":"src/replicated_log.rs","rank":96,"score":34244.77040871494},{"content":"use raftlog::cluster::ClusterMembers;\n\nuse raftlog::node::NodeId;\n\nuse rand::{Rng, SeedableRng, StdRng};\n\nuse std::collections::BTreeSet;\n\nuse std::time::{SystemTime, UNIX_EPOCH};\n\n\n\nuse crate::io::IoConfig;\n\nuse crate::types::{LogicalDuration, Probability, Range, SharedRng};\n\n\n\n#[derive(Debug, Clone, Serialize, Deserialize)]\n\npub struct SimulatorConfig {\n\n /// シミュレータで使われる乱数のシード.\n\n ///\n\n /// この値によって、シミュレータ上で発生するイベントが全て決定される.\n\n #[serde(default = \"SimulatorConfig::default_seed\")]\n\n pub seed: u64,\n\n\n\n #[serde(default = \"SimulatorConfig::default_loop_count\")]\n\n pub loop_count: usize,\n\n\n","file_path":"raftlog_simu/src/simulator_config.rs","rank":97,"score":32090.618713773903},{"content":" .map(NodeId::new)\n\n .collect::<Vec<_>>();\n\n rng.shuffle(&mut candidates[..]);\n\n candidates.truncate(self.cluster_size.choose(rng));\n\n candidates.into_iter().collect()\n\n }\n\n}\n\nimpl Default for SimulatorConfig {\n\n fn default() -> Self {\n\n SimulatorConfig {\n\n seed: SimulatorConfig::default_seed(),\n\n loop_count: SimulatorConfig::default_loop_count(),\n\n propose_command: SimulatorConfig::default_propose_command(),\n\n manual_heartbeat: SimulatorConfig::default_manual_heartbeat(),\n\n take_snapshot: SimulatorConfig::default_take_snapshot(),\n\n node_down: SimulatorConfig::default_node_down(),\n\n node_restart_interval: SimulatorConfig::default_node_restart_interval(),\n\n cluster_size: SimulatorConfig::default_cluster_size(),\n\n change_cluster: SimulatorConfig::default_change_cluster(),\n\n io: IoConfig::default(),\n\n nodes: SimulatorConfig::default_nodes(),\n\n }\n\n }\n\n}\n","file_path":"raftlog_simu/src/simulator_config.rs","rank":98,"score":32087.848252646214},{"content":" pub fn default_nodes() -> BTreeSet<String> {\n\n [\"foo\", \"bar\", \"baz\", \"qux\", \"quux\", \"corge\", \"grault\"]\n\n .iter()\n\n .map(|n| n.to_string())\n\n .collect()\n\n }\n\n\n\n pub fn make_rng(&self) -> SharedRng {\n\n let mut seed = [0; 32];\n\n for (i, v) in seed.iter_mut().enumerate().take(8) {\n\n *v = (self.seed >> (i * 8)) as u8;\n\n }\n\n let inner = StdRng::from_seed(seed);\n\n SharedRng::new(inner)\n\n }\n\n pub fn choose_members<R: Rng>(&self, rng: &mut R) -> ClusterMembers {\n\n let mut candidates = self\n\n .nodes\n\n .iter()\n\n .cloned()\n","file_path":"raftlog_simu/src/simulator_config.rs","rank":99,"score":32084.732176897018}],"string":"[\n {\n \"content\": \"struct InstallSnapshot<IO: Io> {\\n\\n future: IO::SaveLog,\\n\\n summary: SnapshotSummary,\\n\\n}\\n\\nimpl<IO: Io> InstallSnapshot<IO> {\\n\\n pub fn new(common: &mut Common<IO>, prefix: LogPrefix) -> Self {\\n\\n let summary = SnapshotSummary {\\n\\n tail: prefix.tail,\\n\\n config: prefix.config.clone(),\\n\\n };\\n\\n let future = common.io.save_log_prefix(prefix);\\n\\n InstallSnapshot { future, summary }\\n\\n }\\n\\n}\\n\\nimpl<IO: Io> Future for InstallSnapshot<IO> {\\n\\n type Item = SnapshotSummary;\\n\\n type Error = Error;\\n\\n fn poll(&mut self) -> Poll<Self::Item, Self::Error> {\\n\\n Ok(track!(self.future.poll())?.map(|()| self.summary.clone()))\\n\\n }\\n\",\n \"file_path\": \"src/node_state/common/mod.rs\",\n \"rank\": 0,\n \"score\": 151795.74627884332\n },\n {\n \"content\": \"fn median<F, T>(members: &ClusterMembers, f: F) -> T\\n\\nwhere\\n\\n F: Fn(&NodeId) -> T,\\n\\n T: Ord + Copy + Default,\\n\\n{\\n\\n let mut values = members.iter().map(|n| f(n)).collect::<Vec<_>>();\\n\\n values.sort();\\n\\n values.reverse();\\n\\n if values.is_empty() {\\n\\n T::default()\\n\\n } else {\\n\\n values[members.len() / 2]\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/cluster.rs\",\n \"rank\": 1,\n \"score\": 127262.75425114289\n },\n {\n \"content\": \"fn over_write(now: &mut LogSuffix, new: &LogSuffix) {\\n\\n /*\\n\\n * 次のような上書き不能な形をしていないか検査する\\n\\n * now = [...)\\n\\n * [...) = new\\n\\n */\\n\\n assert!(new.head.index <= now.tail().index);\\n\\n\\n\\n let (offset, entries_offset) = if now.head.index <= new.head.index {\\n\\n /*\\n\\n * [ self ...\\n\\n * [ next ...\\n\\n * ^--offset\\n\\n */\\n\\n\\n\\n (new.head.index - now.head.index, 0)\\n\\n } else {\\n\\n /*\\n\\n * Strange case:\\n\\n * [ self ...\\n\",\n \"file_path\": \"src/test_dsl/impl_io.rs\",\n \"rank\": 2,\n \"score\": 126114.77761290272\n },\n {\n \"content\": \"/// 引数`rlog`で表される特定のノードが、述語`pred`を満たすかどうかを調べる\\n\\n/// `pred`を満足する場合は`true`を返し、\\n\\n/// そうでない場合は`false`を返す。\\n\\nfn check(rlog: &ReplicatedLog<TestIo>, pred: Pred) -> bool {\\n\\n use Pred::*;\\n\\n\\n\\n match pred {\\n\\n Not(pred) => !check(rlog, *pred),\\n\\n IsLeader => rlog.local_node().role == Role::Leader,\\n\\n IsFollower => rlog.local_node().role == Role::Follower,\\n\\n LogTermConsistency => {\\n\\n let mut valid_glue = true;\\n\\n\\n\\n // snapshotとrawlogが両方ある場合は、\\n\\n // snapshotに続く形でrawlogが存在することを確認する\\n\\n if let Some(snapshot) = &rlog.io().snapshot() {\\n\\n if let Some(rawlog) = &rlog.io().rawlog() {\\n\\n valid_glue = snapshot.tail.prev_term == rawlog.head.prev_term;\\n\\n }\\n\\n }\\n\\n\\n\\n // rawlogが存在する場合は、termが昇順になっていることを確認する\\n\\n let is_sorted = if let Some(rawlog) = &rlog.io().rawlog() {\\n\",\n \"file_path\": \"src/test_dsl/dsl.rs\",\n \"rank\": 3,\n \"score\": 115262.26735373196\n },\n {\n \"content\": \"fn make_role_change_histogram(builder: &mut HistogramBuilder) -> Result<Histogram> {\\n\\n builder\\n\\n .bucket(0.001)\\n\\n .bucket(0.005)\\n\\n .bucket(0.01)\\n\\n .bucket(0.05)\\n\\n .bucket(0.1)\\n\\n .bucket(0.2)\\n\\n .bucket(0.4)\\n\\n .bucket(0.6)\\n\\n .bucket(0.8)\\n\\n .bucket(1.0)\\n\\n .bucket(2.0)\\n\\n .bucket(4.0)\\n\\n .bucket(6.0)\\n\\n .bucket(8.0)\\n\\n .bucket(10.0)\\n\\n .bucket(20.0)\\n\\n .bucket(50.0)\\n\\n .bucket(80.0)\\n\\n .bucket(320.0)\\n\\n .bucket(640.0)\\n\\n .finish()\\n\\n .map_err(|e| track!(Error::from(e)))\\n\\n}\\n\",\n \"file_path\": \"src/metrics.rs\",\n \"rank\": 4,\n \"score\": 107261.07587930831\n },\n {\n \"content\": \"/// Raftの実行に必要なI/O機能を提供するためのトレイト.\\n\\n///\\n\\n/// 機能としてはおおまかに以下の三つに区分される:\\n\\n///\\n\\n/// - **ストレージ**\\n\\n/// - ローカルノードの状態やログを保存するための永続ストレージ\\n\\n/// - Raftが完全に正しく動作するためには、このストレージは完全に信頼できるものである必要がある\\n\\n/// - 一度書き込まれたデータは(明示的に削除されない限り)失われたり、壊れたりすることは無い\\n\\n/// - 実際には、それを達成するのは困難なので、信頼性とストレージコストのトレードオフとなる\\n\\n/// - **チャンネル**\\n\\n/// - ノード間通信(RPC)用のメッセージ送受信チャンネル\\n\\n/// - このチャンネルの信頼性はある程度低くても良い\\n\\n/// - メッセージ群の順番の入れ替わりや、欠損、重複配送、は許容される\\n\\n/// - ただし、メッセージの改竄や捏造、はNG\\n\\n/// - **タイマー**\\n\\n/// - タイムアウト管理用のタイマー\\n\\npub trait Io {\\n\\n /// ローカルノードの投票状況を保存するための`Future`.\\n\\n type SaveBallot: Future<Item = (), Error = Error>;\\n\\n\\n\\n /// ノーカルノードの投票情報を取得ための`Future`.\\n\\n type LoadBallot: Future<Item = Option<Ballot>, Error = Error>;\\n\\n\\n\\n /// ローカルログを保存するための`Future`.\\n\\n type SaveLog: Future<Item = (), Error = Error>;\\n\\n\\n\\n /// ローカルログを取得するための`Future`.\\n\\n type LoadLog: Future<Item = Log, Error = Error>;\\n\\n\\n\\n /// タイムアウトを表現するための`Future`.\\n\\n type Timeout: Future<Item = (), Error = Error>;\\n\\n\\n\\n /// ローカルノードに対して送信されたメッセージの受信を試みる.\\n\\n ///\\n\\n /// # 注意\\n\\n ///\\n\",\n \"file_path\": \"src/io.rs\",\n \"rank\": 5,\n \"score\": 107135.49306210967\n },\n {\n \"content\": \"/// DSLのコマンド列（プログラム）を実行する関数\\n\\npub fn interpret(cs: &[Command], service: &mut Service) {\\n\\n for c in cs {\\n\\n interpret_command(c.clone(), service);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test_dsl/dsl.rs\",\n \"rank\": 6,\n \"score\": 107110.84573639274\n },\n {\n \"content\": \"#[derive(Debug, Clone)]\\n\\nstruct SnapshotSummary {\\n\\n tail: LogPosition,\\n\\n config: ClusterConfig,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/node_state/common/mod.rs\",\n \"rank\": 7,\n \"score\": 105196.14643878718\n },\n {\n \"content\": \"#[derive(Default, Serialize, Deserialize)]\\n\\nstruct Config {\\n\\n simulator: raftlog_simu::SimulatorConfig,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"raftlog_simu/src/main.rs\",\n \"rank\": 8,\n \"score\": 99189.68730412977\n },\n {\n \"content\": \"/// ノードネームの列が与えられた時に\\n\\n/// 丁度それらを構成要素として含むようなraft clusterを構成する。\\n\\n///\\n\\n/// 全点間通信ができる状態にしてあるので\\n\\n/// complete graph（w.r.t. ネットワークトポロジー）という語を用いている。\\n\\npub fn build_complete_graph(names: &[NodeName]) -> (Service, ClusterMembers) {\\n\\n let nodes: BTreeSet<NodeId> = names.iter().map(|s| NodeId::new(s.to_string())).collect();\\n\\n\\n\\n let mut ios = BTreeMap::new();\\n\\n let mut service = BTreeMap::new();\\n\\n\\n\\n for node in &nodes {\\n\\n ios.insert(node.clone(), TestIo::new(node.clone(), false));\\n\\n }\\n\\n\\n\\n for src in &nodes {\\n\\n let mut io_src = ios.remove(src).unwrap();\\n\\n for dst in &nodes {\\n\\n if src != dst {\\n\\n let io_dst = ios.get(dst).unwrap();\\n\\n io_src.set_channel(dst.clone(), io_dst.copy_sender());\\n\\n }\\n\\n }\\n\\n ios.insert(src.clone(), io_src);\\n\\n }\\n\",\n \"file_path\": \"src/test_dsl/dsl.rs\",\n \"rank\": 9,\n \"score\": 91484.87596065007\n },\n {\n \"content\": \"struct Channel {\\n\\n clock: u64,\\n\\n queue: BinaryHeap<DelayedMessage>,\\n\\n}\\n\\nimpl Channel {\\n\\n pub fn new() -> Self {\\n\\n Channel {\\n\\n clock: 0,\\n\\n queue: BinaryHeap::new(),\\n\\n }\\n\\n }\\n\\n pub fn try_recv_message(&mut self) -> Option<Message> {\\n\\n self.clock += 1;\\n\\n if let Some(m) = self.queue.pop() {\\n\\n if m.arrival_time <= self.clock {\\n\\n Some(m.message)\\n\\n } else {\\n\\n self.queue.push(m);\\n\\n None\\n\\n }\\n\",\n \"file_path\": \"raftlog_simu/src/io/transport.rs\",\n \"rank\": 11,\n \"score\": 77140.3932382438\n },\n {\n \"content\": \"struct DelayedMessage {\\n\\n arrival_time: u64,\\n\\n message: Message,\\n\\n}\\n\\nimpl Ord for DelayedMessage {\\n\\n fn cmp(&self, other: &Self) -> Ordering {\\n\\n other.arrival_time.cmp(&self.arrival_time)\\n\\n }\\n\\n}\\n\\nimpl PartialOrd for DelayedMessage {\\n\\n fn partial_cmp(&self, other: &Self) -> Option<Ordering> {\\n\\n other.arrival_time.partial_cmp(&self.arrival_time)\\n\\n }\\n\\n}\\n\\nimpl Eq for DelayedMessage {}\\n\\nimpl PartialEq for DelayedMessage {\\n\\n fn eq(&self, other: &Self) -> bool {\\n\\n self.arrival_time == other.arrival_time\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"raftlog_simu/src/io/transport.rs\",\n \"rank\": 12,\n \"score\": 74826.60828906487\n },\n {\n \"content\": \"/// DSLの一つのコマンドを実行する関数\\n\\nfn interpret_command(c: Command, service: &mut Service) {\\n\\n use futures::Stream;\\n\\n use Command::*;\\n\\n\\n\\n println!(\\\"\\\\n Now executing {:?} ...\\\", &c);\\n\\n\\n\\n match c {\\n\\n TakeSnapshot(node) => {\\n\\n let rlog = service.get_mut(&node).unwrap();\\n\\n let index = rlog.local_history().tail().index;\\n\\n rlog.install_snapshot(index, Vec::new()).unwrap();\\n\\n }\\n\\n Check(node, pred) => {\\n\\n let rlog = service.get_mut(&node).unwrap();\\n\\n assert!(check(rlog, pred));\\n\\n }\\n\\n Heartbeat(node) => {\\n\\n let rlog = service.get_mut(&node).unwrap();\\n\\n rlog.heartbeat().unwrap();\\n\\n }\\n\",\n \"file_path\": \"src/test_dsl/dsl.rs\",\n \"rank\": 13,\n \"score\": 74175.63251036819\n },\n {\n \"content\": \"fn message_to_string(m: &Message) -> String {\\n\\n use Message::*;\\n\\n match m {\\n\\n RequestVoteCall(vcall) => {\\n\\n format!(\\n\\n \\\"[Vcall] {:?} {:?} {:?}\\\",\\n\\n vcall.header.seq_no, vcall.header.term, vcall.log_tail\\n\\n )\\n\\n }\\n\\n RequestVoteReply(vreply) => {\\n\\n format!(\\n\\n \\\"[Vrep] {:?} {:?} voted={:?}\\\",\\n\\n vreply.header.seq_no, vreply.header.term, vreply.voted\\n\\n )\\n\\n }\\n\\n AppendEntriesCall(ecall) => {\\n\\n format!(\\n\\n \\\"[AEcall] {:?} {:?} commited={:?}, suffix={:?}\\\",\\n\\n ecall.header.seq_no, ecall.header.term, ecall.committed_log_tail, ecall.suffix\\n\\n )\\n\",\n \"file_path\": \"src/test_dsl/impl_io.rs\",\n \"rank\": 14,\n \"score\": 65949.2841820146\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn ballot_to_str(b: &Ballot) -> String {\\n\\n format!(\\n\\n \\\"ballot(term: {}, for: {})\\\",\\n\\n b.term.as_u64(),\\n\\n b.voted_for.as_str()\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/test_dsl/impl_io.rs\",\n \"rank\": 15,\n \"score\": 65949.2841820146\n },\n {\n \"content\": \" _phantom: PhantomData<IO>,\\n\\n}\\n\\nimpl<IO: Io> FollowerSnapshot<IO> {\\n\\n pub fn new() -> Self {\\n\\n FollowerSnapshot {\\n\\n _phantom: PhantomData,\\n\\n }\\n\\n }\\n\\n pub fn handle_message(\\n\\n &mut self,\\n\\n common: &mut Common<IO>,\\n\\n message: Message,\\n\\n ) -> Result<NextState<IO>> {\\n\\n if let Message::AppendEntriesCall(m) = message {\\n\\n common.rpc_callee(&m.header).reply_busy();\\n\\n }\\n\\n Ok(None)\\n\\n }\\n\\n pub fn run_once(&mut self, common: &mut Common<IO>) -> Result<NextState<IO>> {\\n\\n if common.is_snapshot_installing() {\\n\\n Ok(None)\\n\\n } else {\\n\\n let next = Follower::Idle(FollowerIdle::new());\\n\\n Ok(Some(RoleState::Follower(next)))\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/node_state/follower/snapshot.rs\",\n \"rank\": 16,\n \"score\": 64125.30242690405\n },\n {\n \"content\": \"use std::marker::PhantomData;\\n\\n\\n\\nuse super::super::{Common, NextState, RoleState};\\n\\nuse super::{Follower, FollowerIdle};\\n\\nuse crate::message::Message;\\n\\nuse crate::{Io, Result};\\n\\n\\n\\n/// ローカルログへのスナップショット保存を処理するためのフォロワーのサブ状態.\\n\\n///\\n\\n/// `InstallSnapshotCast`で送られてきたスナップショットを処理する.\\n\\n///\\n\\n/// 正確には、スナップショットの処理自体は共通モジュールで行われるため、\\n\\n/// ここでの目的は「スナップショットの保存中に、新たなログ追記等が行われないようにする」\\n\\n/// ということになる.\\n\\n///\\n\\n/// なお、既にコミット済みの地点に対するスナップショットのインストール中に、\\n\\n/// 新規ログ追加が行われても問題は発生しないので、\\n\\n/// このサブ状態が使われるのは「未コミット地点に対するスナップショット」の\\n\\n/// インストールをリーダから指示された場合、のみである.\\n\\npub struct FollowerSnapshot<IO: Io> {\\n\",\n \"file_path\": \"src/node_state/follower/snapshot.rs\",\n \"rank\": 17,\n \"score\": 64113.76162346708\n },\n {\n \"content\": \"//! `Future`トレイトの実装群.\\n\\nuse futures::{Async, Future, Poll};\\n\\nuse raftlog::election::Ballot;\\n\\nuse raftlog::log::Log;\\n\\n\\n\\nuse crate::types::LogicalDuration;\\n\\nuse crate::Error;\\n\\n\\n\\npub type Timeout = DelayedResult<(), Error>;\\n\\npub type SaveBallot = DelayedResult<(), Error>;\\n\\npub type LoadBallot = DelayedResult<Option<Ballot>, Error>;\\n\\npub type SaveLog = DelayedResult<(), Error>;\\n\\npub type LoadLog = DelayedResult<Log, Error>;\\n\\n\\n\\n/// 結果を得られるまでに、生成時に指定された論理時間の経過が必要となる`Result`型.\\n\\n#[derive(Debug)]\\n\\npub struct DelayedResult<T, E> {\\n\\n result: Option<Result<T, E>>,\\n\\n delay: LogicalDuration,\\n\\n}\\n\",\n \"file_path\": \"raftlog_simu/src/io/futures.rs\",\n \"rank\": 18,\n \"score\": 63428.23016583829\n },\n {\n \"content\": \"impl<T, E> DelayedResult<T, E> {\\n\\n /// `value`を値とする、遅延された成功結果を返す.\\n\\n pub fn ok(value: T, delay: LogicalDuration) -> Self {\\n\\n DelayedResult::done(Ok(value), delay)\\n\\n }\\n\\n\\n\\n /// `error`を失敗理由とする、遅延された結果を返す.\\n\\n pub fn err(error: E, delay: LogicalDuration) -> Self {\\n\\n DelayedResult::done(Err(error), delay)\\n\\n }\\n\\n\\n\\n /// 遅延された結果を返す.\\n\\n pub fn done(result: Result<T, E>, delay: LogicalDuration) -> Self {\\n\\n DelayedResult {\\n\\n result: Some(result),\\n\\n delay,\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl<T, E> Future for DelayedResult<T, E> {\\n\",\n \"file_path\": \"raftlog_simu/src/io/futures.rs\",\n \"rank\": 19,\n \"score\": 63425.25241986479\n },\n {\n \"content\": \" type Item = T;\\n\\n type Error = E;\\n\\n fn poll(&mut self) -> Poll<Self::Item, Self::Error> {\\n\\n if self.delay == 0 {\\n\\n let value = self\\n\\n .result\\n\\n .take()\\n\\n .expect(\\\"Cannot poll DelayedResult twice\\\")?;\\n\\n Ok(Async::Ready(value))\\n\\n } else {\\n\\n self.delay -= 1;\\n\\n Ok(Async::NotReady)\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"raftlog_simu/src/io/futures.rs\",\n \"rank\": 20,\n \"score\": 63422.31080905979\n },\n {\n \"content\": \"impl Default for StorageConfig {\\n\\n fn default() -> Self {\\n\\n StorageConfig {\\n\\n save_ballot_time: StorageConfig::default_save_ballot_time(),\\n\\n load_ballot_time: StorageConfig::default_load_ballot_time(),\\n\\n save_log_entry_time: StorageConfig::default_save_log_entry_time(),\\n\\n load_log_entry_time: StorageConfig::default_load_log_entry_time(),\\n\\n save_log_snapshot_time: StorageConfig::default_save_log_snapshot_time(),\\n\\n load_log_snapshot_time: StorageConfig::default_load_log_snapshot_time(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// 通信チャンネルの構成設定.\\n\\n#[derive(Debug, Clone, Serialize, Deserialize)]\\n\\npub struct ChannelConfig {\\n\\n /// メッセージの消失率.\\n\\n ///\\n\\n /// `1.0`なら全てのメッセージが相手に届くことなく消失する.\\n\\n #[serde(default = \\\"ChannelConfig::default_drop\\\")]\\n\",\n \"file_path\": \"raftlog_simu/src/io/configs.rs\",\n \"rank\": 21,\n \"score\": 63222.64857854171\n },\n {\n \"content\": \"\\n\\n /// スナップショットの保存に要する時間.\\n\\n #[serde(default = \\\"StorageConfig::default_save_log_snapshot_time\\\")]\\n\\n pub save_log_snapshot_time: Range<LogicalDuration>,\\n\\n\\n\\n /// スナップショットの読み込みに要する時間.\\n\\n #[serde(default = \\\"StorageConfig::default_load_log_snapshot_time\\\")]\\n\\n pub load_log_snapshot_time: Range<LogicalDuration>,\\n\\n}\\n\\nimpl StorageConfig {\\n\\n /// `1...5`\\n\\n pub fn default_save_ballot_time() -> Range<LogicalDuration> {\\n\\n Range { min: 1, max: 5 }\\n\\n }\\n\\n\\n\\n /// `1...5`\\n\\n pub fn default_load_ballot_time() -> Range<LogicalDuration> {\\n\\n Range { min: 1, max: 5 }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"raftlog_simu/src/io/configs.rs\",\n \"rank\": 22,\n \"score\": 63221.720309960634\n },\n {\n \"content\": \" /// `1...5`\\n\\n pub fn default_save_log_entry_time() -> Range<LogicalDuration> {\\n\\n Range { min: 1, max: 5 }\\n\\n }\\n\\n\\n\\n /// `1...5`\\n\\n pub fn default_load_log_entry_time() -> Range<LogicalDuration> {\\n\\n Range { min: 1, max: 5 }\\n\\n }\\n\\n\\n\\n /// `100...500`\\n\\n pub fn default_save_log_snapshot_time() -> Range<LogicalDuration> {\\n\\n Range { min: 100, max: 500 }\\n\\n }\\n\\n\\n\\n /// `100...500`\\n\\n pub fn default_load_log_snapshot_time() -> Range<LogicalDuration> {\\n\\n Range { min: 100, max: 500 }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"raftlog_simu/src/io/configs.rs\",\n \"rank\": 23,\n \"score\": 63217.561454083894\n },\n {\n \"content\": \"pub struct StorageConfig {\\n\\n /// 投票状況の保存に要する時間.\\n\\n #[serde(default = \\\"StorageConfig::default_save_ballot_time\\\")]\\n\\n pub save_ballot_time: Range<LogicalDuration>,\\n\\n\\n\\n /// 投票状況の復元に要する時間.\\n\\n #[serde(default = \\\"StorageConfig::default_load_ballot_time\\\")]\\n\\n pub load_ballot_time: Range<LogicalDuration>,\\n\\n\\n\\n /// 個々のログエントリの保存に要する時間.\\n\\n ///\\n\\n /// 対象のエントリ数がNの場合には、時間はN倍になる.\\n\\n #[serde(default = \\\"StorageConfig::default_save_log_entry_time\\\")]\\n\\n pub save_log_entry_time: Range<LogicalDuration>,\\n\\n\\n\\n /// 個々のログエントリの読み込みに要する時間.\\n\\n ///\\n\\n /// 対象のエントリ数がNの場合には、時間はN倍になる.\\n\\n #[serde(default = \\\"StorageConfig::default_load_log_entry_time\\\")]\\n\\n pub load_log_entry_time: Range<LogicalDuration>,\\n\",\n \"file_path\": \"raftlog_simu/src/io/configs.rs\",\n \"rank\": 24,\n \"score\": 63217.12335804883\n },\n {\n \"content\": \" Probability { prob: 0.05 }\\n\\n }\\n\\n\\n\\n /// `0.01`\\n\\n pub fn default_duplicate() -> Probability {\\n\\n Probability { prob: 0.01 }\\n\\n }\\n\\n}\\n\\nimpl Default for ChannelConfig {\\n\\n fn default() -> Self {\\n\\n ChannelConfig {\\n\\n delay: ChannelConfig::default_delay(),\\n\\n drop: ChannelConfig::default_drop(),\\n\\n duplicate: ChannelConfig::default_duplicate(),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"raftlog_simu/src/io/configs.rs\",\n \"rank\": 25,\n \"score\": 63216.68517447422\n },\n {\n \"content\": \" pub fn default_election_timeout() -> LogicalDuration {\\n\\n 1000\\n\\n }\\n\\n\\n\\n /// `heartbeat_interval`フィールドのデフォルト値 (`100`).\\n\\n pub fn default_heartbeat_interval() -> LogicalDuration {\\n\\n 100\\n\\n }\\n\\n}\\n\\nimpl Default for TimerConfig {\\n\\n fn default() -> Self {\\n\\n TimerConfig {\\n\\n election_timeout: TimerConfig::default_election_timeout(),\\n\\n heartbeat_interval: TimerConfig::default_heartbeat_interval(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// `Storage`用の構成設定.\\n\\n#[derive(Debug, Clone, Serialize, Deserialize)]\\n\",\n \"file_path\": \"raftlog_simu/src/io/configs.rs\",\n \"rank\": 26,\n \"score\": 63216.62835729769\n },\n {\n \"content\": \"//! I/O関連の構成設定を集めたモジュール.\\n\\nuse crate::types::{LogicalDuration, Probability, Range};\\n\\n\\n\\n/// `Timer`用の構成設定.\\n\\n#[derive(Debug, Clone, Serialize, Deserialize)]\\n\\npub struct TimerConfig {\\n\\n /// 一つの選挙期間のタイムアウト尺.\\n\\n ///\\n\\n /// リーダからのハートビートを受信しない期間が、\\n\\n /// ここで指定された尺を超えた場合には、\\n\\n /// リーダがダウンしたものと判断されて、次の選挙が始まる.\\n\\n #[serde(default = \\\"TimerConfig::default_election_timeout\\\")]\\n\\n pub election_timeout: LogicalDuration,\\n\\n\\n\\n /// リーダがハートビートを発行する間隔.\\n\\n #[serde(default = \\\"TimerConfig::default_heartbeat_interval\\\")]\\n\\n pub heartbeat_interval: LogicalDuration,\\n\\n}\\n\\nimpl TimerConfig {\\n\\n /// `election_timeout`フィールドのデフォルト値 (`1000`).\\n\",\n \"file_path\": \"raftlog_simu/src/io/configs.rs\",\n \"rank\": 27,\n \"score\": 63216.32751880202\n },\n {\n \"content\": \" pub drop: Probability,\\n\\n\\n\\n /// メッセージの重複率.\\n\\n ///\\n\\n /// `1.0`なら(消失しなかった)全てのメッセージが複製される.\\n\\n #[serde(default = \\\"ChannelConfig::default_duplicate\\\")]\\n\\n pub duplicate: Probability,\\n\\n\\n\\n /// メッセージ遅延.\\n\\n #[serde(default = \\\"ChannelConfig::default_delay\\\")]\\n\\n pub delay: Range<LogicalDuration>,\\n\\n}\\n\\nimpl ChannelConfig {\\n\\n /// `10..50`\\n\\n pub fn default_delay() -> Range<LogicalDuration> {\\n\\n Range { min: 10, max: 50 }\\n\\n }\\n\\n\\n\\n /// `0.05`\\n\\n pub fn default_drop() -> Probability {\\n\",\n \"file_path\": \"raftlog_simu/src/io/configs.rs\",\n \"rank\": 28,\n \"score\": 63214.58544422495\n },\n {\n \"content\": \"use super::Common;\\n\\nuse crate::log::{LogPosition, LogPrefix, LogSuffix};\\n\\nuse crate::message::{self, AppendEntriesReply, Message, MessageHeader, SequenceNumber};\\n\\nuse crate::node::NodeId;\\n\\nuse crate::Io;\\n\\n\\n\\n/// RPC要求メッセージの送信を補助するためのビルダ.\\n\\npub struct RpcCaller<'a, IO: 'a + Io> {\\n\\n common: &'a mut Common<IO>,\\n\\n}\\n\\nimpl<'a, IO: 'a + Io> RpcCaller<'a, IO> {\\n\\n pub fn new(common: &'a mut Common<IO>) -> Self {\\n\\n RpcCaller { common }\\n\\n }\\n\\n pub fn broadcast_request_vote(mut self) {\\n\\n let header = self.make_header(&NodeId::new(String::new())); // ブロードキャストノード時に空文字列を宛先に指定\\n\\n let log_tail = self.common.history.tail();\\n\\n let request = message::RequestVoteCall {\\n\\n header: header.clone(),\\n\\n log_tail,\\n\",\n \"file_path\": \"src/node_state/common/rpc_builder.rs\",\n \"rank\": 29,\n \"score\": 61473.956702074654\n },\n {\n \"content\": \" if do_self_reply {\\n\\n self.common.unread_message = Some(self_reply);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// RPC応答メッセージの送信を補助するためのビルダ.\\n\\npub struct RpcCallee<'a, IO: 'a + Io> {\\n\\n common: &'a mut Common<IO>,\\n\\n caller: &'a MessageHeader,\\n\\n}\\n\\nimpl<'a, IO: 'a + Io> RpcCallee<'a, IO> {\\n\\n pub fn new(common: &'a mut Common<IO>, caller: &'a MessageHeader) -> Self {\\n\\n RpcCallee { common, caller }\\n\\n }\\n\\n pub fn reply_request_vote(self, voted: bool) {\\n\\n let header = self.make_header();\\n\\n let message = message::RequestVoteReply { header, voted }.into();\\n\\n self.common.io.send_message(message);\\n\\n }\\n\",\n \"file_path\": \"src/node_state/common/rpc_builder.rs\",\n \"rank\": 30,\n \"score\": 61472.71678830534\n },\n {\n \"content\": \" fn make_header(&mut self, destination: &NodeId) -> MessageHeader {\\n\\n let seq_no = self.common.seq_no;\\n\\n self.common.seq_no = SequenceNumber::new(seq_no.as_u64() + 1);\\n\\n MessageHeader {\\n\\n sender: self.common.local_node.id.clone(),\\n\\n destination: destination.clone(),\\n\\n seq_no,\\n\\n term: self.common.local_node.ballot.term,\\n\\n }\\n\\n }\\n\\n fn broadcast(&mut self, mut message: Message, self_reply: Message) {\\n\\n let mut do_self_reply = false;\\n\\n for peer in self.common.history.config().members() {\\n\\n if *peer == self.common.local_node.id {\\n\\n do_self_reply = true;\\n\\n } else {\\n\\n message.set_destination(peer);\\n\\n self.common.io.send_message(message.clone());\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/node_state/common/rpc_builder.rs\",\n \"rank\": 31,\n \"score\": 61466.44635224692\n },\n {\n \"content\": \" busy: false,\\n\\n }\\n\\n .into();\\n\\n self.broadcast(request, self_reply);\\n\\n }\\n\\n pub fn send_append_entries(mut self, peer: &NodeId, suffix: LogSuffix) {\\n\\n let message = message::AppendEntriesCall {\\n\\n header: self.make_header(peer),\\n\\n committed_log_tail: self.common.history.committed_tail().index,\\n\\n suffix,\\n\\n }\\n\\n .into();\\n\\n self.common.io.send_message(message);\\n\\n }\\n\\n pub fn send_install_snapshot(mut self, peer: &NodeId, prefix: LogPrefix) {\\n\\n let header = self.make_header(peer);\\n\\n let message = message::InstallSnapshotCast { header, prefix }.into();\\n\\n self.common.io.send_message(message);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/node_state/common/rpc_builder.rs\",\n \"rank\": 32,\n \"score\": 61466.36622844293\n },\n {\n \"content\": \" pub fn reply_append_entries(self, log_tail: LogPosition) {\\n\\n let message = AppendEntriesReply {\\n\\n header: self.make_header(),\\n\\n log_tail,\\n\\n busy: false,\\n\\n }\\n\\n .into();\\n\\n self.common.io.send_message(message);\\n\\n }\\n\\n pub fn reply_busy(self) {\\n\\n let message = AppendEntriesReply {\\n\\n header: self.make_header(),\\n\\n log_tail: self.common.history.tail(),\\n\\n busy: true,\\n\\n }\\n\\n .into();\\n\\n self.common.io.send_message(message);\\n\\n }\\n\\n\\n\\n fn make_header(&self) -> MessageHeader {\\n\\n MessageHeader {\\n\\n sender: self.common.local_node.id.clone(),\\n\\n destination: self.caller.sender.clone(),\\n\\n seq_no: self.caller.seq_no,\\n\\n term: self.common.local_node.ballot.term,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/node_state/common/rpc_builder.rs\",\n \"rank\": 33,\n \"score\": 61462.59395543706\n },\n {\n \"content\": \" }\\n\\n .into();\\n\\n let self_reply = message::RequestVoteReply {\\n\\n header,\\n\\n voted: true,\\n\\n }\\n\\n .into();\\n\\n self.broadcast(request, self_reply);\\n\\n }\\n\\n pub fn broadcast_append_entries(mut self, suffix: LogSuffix) {\\n\\n let header = self.make_header(&NodeId::new(String::new())); // ブロードキャストノード時に空文字列を宛先に指定\\n\\n let request = message::AppendEntriesCall {\\n\\n header: header.clone(),\\n\\n committed_log_tail: self.common.history.committed_tail().index,\\n\\n suffix,\\n\\n }\\n\\n .into();\\n\\n let self_reply = AppendEntriesReply {\\n\\n header,\\n\\n log_tail: self.common.history.tail(),\\n\",\n \"file_path\": \"src/node_state/common/rpc_builder.rs\",\n \"rank\": 34,\n \"score\": 61460.73999155762\n },\n {\n \"content\": \"/// 次に遷移する状態.\\n\\n///\\n\\n/// `None`の場合には、遷移はせずに同じ状態が維持される.\\n\\ntype NextState<IO> = Option<RoleState<IO>>;\\n\\n\\n\\n/// ローカルノード用の状態(状態機械).\\n\\npub struct NodeState<IO: Io> {\\n\\n pub common: Common<IO>,\\n\\n pub role: RoleState<IO>,\\n\\n started_at: Instant,\\n\\n pub metrics: NodeStateMetrics,\\n\\n}\\n\\nimpl<IO: Io> NodeState<IO> {\\n\\n pub fn load(node_id: NodeId, config: ClusterConfig, io: IO, metrics: NodeStateMetrics) -> Self {\\n\\n let mut common = Common::new(node_id, io, config, metrics.clone());\\n\\n let role = RoleState::Loader(Loader::new(&mut common));\\n\\n let started_at = Instant::now();\\n\\n NodeState {\\n\\n common,\\n\\n role,\\n\\n started_at,\\n\\n metrics,\\n\\n }\\n\",\n \"file_path\": \"src/node_state/mod.rs\",\n \"rank\": 35,\n \"score\": 52101.20098796432\n },\n {\n \"content\": \"struct Down {\\n\\n machine: MachineState,\\n\\n io: DeterministicIo,\\n\\n restart: LogicalDuration,\\n\\n}\\n\\nimpl Down {\\n\\n pub fn new(machine: MachineState, io: DeterministicIo, restart: LogicalDuration) -> Self {\\n\\n Down {\\n\\n machine,\\n\\n io,\\n\\n restart,\\n\\n }\\n\\n }\\n\\n pub fn propose_command(&mut self, _command: Command) -> Result<()> {\\n\\n track_panic!(ErrorKind::NotLeader, \\\"This process is down\\\");\\n\\n }\\n\\n pub fn propose_config(&mut self, _: ClusterMembers) -> Result<()> {\\n\\n track_panic!(ErrorKind::NotLeader, \\\"This process is down\\\");\\n\\n }\\n\\n pub fn heartbeat(&mut self) -> Result<()> {\\n\",\n \"file_path\": \"raftlog_simu/src/process.rs\",\n \"rank\": 36,\n \"score\": 49891.97055460813\n },\n {\n \"content\": \"struct Alive {\\n\\n logger: Logger,\\n\\n machine: MachineState,\\n\\n next_commit: LogIndex,\\n\\n rlog: ReplicatedLog<DeterministicIo>,\\n\\n proposals: Vec<ProposalId>,\\n\\n heartbeats: VecDeque<SequenceNumber>,\\n\\n}\\n\\nimpl Alive {\\n\\n /// 新しい`Alive`インスタンスを生成する.\\n\\n pub fn new(\\n\\n logger: Logger,\\n\\n node_id: NodeId,\\n\\n members: ClusterMembers,\\n\\n io: DeterministicIo,\\n\\n ) -> Self {\\n\\n let metric_builder = MetricBuilder::new();\\n\\n let machine = MachineState::new();\\n\\n let rlog = ReplicatedLog::new(node_id, members, io, &metric_builder).expect(\\\"Never fails\\\");\\n\\n Alive {\\n\",\n \"file_path\": \"raftlog_simu/src/process.rs\",\n \"rank\": 37,\n \"score\": 48509.77928443576\n },\n {\n \"content\": \"#[derive(PartialEq, Eq)]\\n\\nstruct Committed {\\n\\n entry: LogEntry,\\n\\n state: MachineState,\\n\\n}\\n\",\n \"file_path\": \"raftlog_simu/src/simulator.rs\",\n \"rank\": 38,\n \"score\": 48509.77928443576\n },\n {\n \"content\": \"fn main() {\\n\\n let matches = app_from_crate!()\\n\\n .arg(\\n\\n Arg::with_name(\\\"CONFIG_FILE\\\")\\n\\n .short(\\\"c\\\")\\n\\n .long(\\\"config\\\")\\n\\n .takes_value(true),\\n\\n ).arg(Arg::with_name(\\\"RANDOM_SEED\\\").long(\\\"seed\\\").takes_value(true))\\n\\n .arg(\\n\\n Arg::with_name(\\\"LOOP_COUNT\\\")\\n\\n .long(\\\"loop-count\\\")\\n\\n .takes_value(true),\\n\\n ).get_matches();\\n\\n\\n\\n //\\n\\n // 1. Load Configuration\\n\\n //\\n\\n let mut config = if let Some(config_file) = matches.value_of(\\\"CONFIG_FILE\\\") {\\n\\n track_try_unwrap!(serdeconv::from_toml_file(config_file))\\n\\n } else {\\n\",\n \"file_path\": \"raftlog_simu/src/main.rs\",\n \"rank\": 39,\n \"score\": 48144.619339775345\n },\n {\n \"content\": \"use futures::Future;\\n\\n\\n\\nuse crate::election::{Ballot, Role};\\n\\nuse crate::log::{Log, LogIndex, LogPrefix, LogSuffix};\\n\\nuse crate::message::Message;\\n\\nuse crate::{Error, Result};\\n\\n\\n\\n/// Raftの実行に必要なI/O機能を提供するためのトレイト.\\n\\n///\\n\\n/// 機能としてはおおまかに以下の三つに区分される:\\n\\n///\\n\\n/// - **ストレージ**\\n\\n/// - ローカルノードの状態やログを保存するための永続ストレージ\\n\\n/// - Raftが完全に正しく動作するためには、このストレージは完全に信頼できるものである必要がある\\n\\n/// - 一度書き込まれたデータは(明示的に削除されない限り)失われたり、壊れたりすることは無い\\n\\n/// - 実際には、それを達成するのは困難なので、信頼性とストレージコストのトレードオフとなる\\n\\n/// - **チャンネル**\\n\\n/// - ノード間通信(RPC)用のメッセージ送受信チャンネル\\n\\n/// - このチャンネルの信頼性はある程度低くても良い\\n\\n/// - メッセージ群の順番の入れ替わりや、欠損、重複配送、は許容される\\n\\n/// - ただし、メッセージの改竄や捏造、はNG\\n\\n/// - **タイマー**\\n\\n/// - タイムアウト管理用のタイマー\\n\",\n \"file_path\": \"src/io.rs\",\n \"rank\": 40,\n \"score\": 35538.65422440527\n },\n {\n \"content\": \" fn load_log(&mut self, start: LogIndex, end: Option<LogIndex>) -> Self::LoadLog;\\n\\n\\n\\n /// 選挙における役割に応じた時間のタイムアウトオブジェクトを生成する.\\n\\n fn create_timeout(&mut self, role: Role) -> Self::Timeout;\\n\\n\\n\\n /// I/O処理を行う余裕があるかどうかを返す.\\n\\n ///\\n\\n /// これが`true`を返している間は、フォロワーの同期処理は実施されない.\\n\\n fn is_busy(&mut self) -> bool {\\n\\n false\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/io.rs\",\n \"rank\": 41,\n \"score\": 35538.235272256396\n },\n {\n \"content\": \" /// 保存に成功した場合は、それ以前のログ領域は破棄してしまって構わない.\\n\\n fn save_log_prefix(&mut self, prefix: LogPrefix) -> Self::SaveLog;\\n\\n\\n\\n /// ローカルログの末尾部分を保存(追記)する.\\n\\n ///\\n\\n /// `suffix`の開始位置が、現在のログの末尾よりも前方の場合は、\\n\\n /// 新しい開始位置よりも後ろの古いエントリは削除してしまって構わない.\\n\\n /// (リーダの入れ替えにより、ログの未コミット部分で競合が発生したことを示している)\\n\\n fn save_log_suffix(&mut self, suffix: &LogSuffix) -> Self::SaveLog;\\n\\n\\n\\n /// ローカルログの指定範囲のエントリを取得する.\\n\\n ///\\n\\n /// 範囲は`start`から始まり、`end`を含まない最後のエントリまでを取得する.\\n\\n /// `end`の値が`None`の場合には、ログの末端までを取得する.\\n\\n ///\\n\\n /// なお、`end`が指定されているにも関わらず、指定よりも少ないエントリしか\\n\\n /// 取得できなかった場合には「取得できたエントリのみを返す」ないし「エラーを返す」の\\n\\n /// どちらの挙動も許容される.\\n\\n ///\\n\\n /// ただし、`start`とは異なる位置から、エントリの取得を開始することは許可されない.\\n\",\n \"file_path\": \"src/io.rs\",\n \"rank\": 42,\n \"score\": 35536.336327575984\n },\n {\n \"content\": \" /// このメソッドが`Err`を返した場合には、ローカルのRaftノードが\\n\\n /// 停止してしまうので、時間経過によって自動的には回復しない\\n\\n /// 致命的なものを除いては、`Err`は返さないことが望ましい.\\n\\n fn try_recv_message(&mut self) -> Result<Option<Message>>;\\n\\n\\n\\n /// メッセージを送信する.\\n\\n ///\\n\\n /// もしメッセージ送信に何らかの理由で失敗した場合でも、単に無視される.\\n\\n /// 仮にチャンネルの致命的な問題が発生している場合には、次の`try_recv_message`メソッドの\\n\\n /// 呼び出しで`Err`を返すこと.\\n\\n fn send_message(&mut self, message: Message);\\n\\n\\n\\n /// ローカルノードの投票状況を保存する.\\n\\n fn save_ballot(&mut self, ballot: Ballot) -> Self::SaveBallot;\\n\\n\\n\\n /// ローカルノードの前回の投票状況を取得する.\\n\\n fn load_ballot(&mut self) -> Self::LoadBallot;\\n\\n\\n\\n /// ローカルログの前半部分(i.e., スナップショット)を保存する.\\n\\n ///\\n\",\n \"file_path\": \"src/io.rs\",\n \"rank\": 43,\n \"score\": 35534.93172938488\n },\n {\n \"content\": \" /// 新メンバのみの構成への移行完了を把握したい場合には、後続のコミットイベントの\\n\\n /// 追跡を行う必要がある.\\n\\n ///\\n\\n /// もし返り値の`LogPosition`とは分岐した`Event::Committed`が返された場合には、\\n\\n /// この提案が棄却されたことを示している.\\n\\n ///\\n\\n /// 複数の構成変更を並行して実施することは可能だが、\\n\\n /// その場合は、最後に提案されたものが最終的な構成として採用される.\\n\\n ///\\n\\n /// # Errors\\n\\n ///\\n\\n /// 非リーダノードに対して、このメソッドが実行された場合には、\\n\\n /// `ErrorKind::NotLeader`を理由としたエラーが返される.\\n\\n pub fn propose_config(&mut self, new_members: ClusterMembers) -> Result<ProposalId> {\\n\\n if let RoleState::Leader(ref mut leader) = self.node.role {\\n\\n let config = self.node.common.config().start_config_change(new_members);\\n\\n let term = self.node.common.term();\\n\\n let entry = LogEntry::Config { term, config };\\n\\n let proposal_id = leader.propose(&mut self.node.common, entry);\\n\\n Ok(proposal_id)\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 44,\n \"score\": 34270.66912043306\n },\n {\n \"content\": \" ///\\n\\n /// なお、ノードの再起動時を除いて、`node_id`には対象クラスタの歴史の中でユニークなIDを\\n\\n /// 割り当てるのが望ましい.\\n\\n /// (レアケースではあるが、新規追加ノードを、以前に存在したノードと誤認識されてしまうと、\\n\\n /// 分散ログの整合性が壊れてしまう危険性があるため)\\n\\n ///\\n\\n /// また、以前のノードを再起動したい場合でも、もし永続ストレージが壊れている等の理由で、\\n\\n /// 前回の状態を正確に復元できないのであれば、\\n\\n /// ノード名を変更して、新規ノード追加扱いにした方が安全である.\\n\\n #[allow(clippy::new_ret_no_self)]\\n\\n pub fn new(\\n\\n node_id: NodeId,\\n\\n members: ClusterMembers,\\n\\n io: IO,\\n\\n metric_builder: &MetricBuilder,\\n\\n ) -> Result<Self> {\\n\\n let config = ClusterConfig::new(members);\\n\\n let mut metric_builder = metric_builder.clone();\\n\\n metric_builder.namespace(\\\"raftlog\\\");\\n\\n let metrics = track!(RaftlogMetrics::new(&metric_builder))?;\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 45,\n \"score\": 34266.54895619708\n },\n {\n \"content\": \" /// 既にローカルログに対するスナップショットのインストールが進行中の場合には、\\n\\n /// `ErrorKind::Busy`を理由としてエラーが返される.\\n\\n ///\\n\\n /// また現在のログの先頭よりも前の地点のスナップショットをインストールしようとした場合には、\\n\\n /// `ErrorKind::InvalidInput`を理由としたエラーが返される.\\n\\n pub fn install_snapshot(&mut self, new_head: LogIndex, snapshot: Vec<u8>) -> Result<()> {\\n\\n track_assert!(\\n\\n !self.node.is_loading(),\\n\\n ErrorKind::Busy,\\n\\n \\\"Loading node state\\\"\\n\\n );\\n\\n\\n\\n let (prev_term, config) = {\\n\\n let record = track!(\\n\\n self.node\\n\\n .common\\n\\n .log()\\n\\n .get_record(new_head)\\n\\n .ok_or_else(|| ErrorKind::InvalidInput.error()),\\n\\n \\\"Too old log position: new_head={:?}, current_head={:?}, node={:?}\\\",\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 46,\n \"score\": 34265.626708879674\n },\n {\n \"content\": \"use futures::{Poll, Stream};\\n\\nuse prometrics::metrics::MetricBuilder;\\n\\nuse std::sync::Arc;\\n\\nuse trackable::error::ErrorKindExt;\\n\\n\\n\\nuse crate::cluster::{ClusterConfig, ClusterMembers};\\n\\nuse crate::election::{Ballot, Role};\\n\\nuse crate::io::Io;\\n\\nuse crate::log::{LogEntry, LogHistory, LogIndex, LogPosition, LogPrefix, ProposalId};\\n\\nuse crate::message::SequenceNumber;\\n\\nuse crate::metrics::RaftlogMetrics;\\n\\nuse crate::node::{Node, NodeId};\\n\\nuse crate::node_state::{NodeState, RoleState};\\n\\nuse crate::{Error, ErrorKind, Result};\\n\\n\\n\\n/// Raftアルゴリズムに基づく分散複製ログ.\\n\\n///\\n\\n/// 利用者は`propose_command`メソッドを使って、コマンドをログに複製保存し、\\n\\n/// 発生する`Event`をハンドリングすることで、\\n\\n/// 整合性のある複製状態機械を実現することが可能となる.\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 47,\n \"score\": 34263.64583465007\n },\n {\n \"content\": \"///\\n\\n/// `ReplicatedLog`は`Stream`トレイトを実装しているが、\\n\\n/// これは無限ストリームであり、エラー時を除いて終了することはない.\\n\\n///\\n\\n/// ただし、構成変更によりノードがクラスタから切り離された場合は、\\n\\n/// 最終的には、イベントが生成されることは無くなる.\\n\\n/// `this.local_history().config().is_known_node()`メソッドを使うことで、\\n\\n/// クラスタ内に属しているかどうかは判定可能なので、利用者側が明示的に確認して、\\n\\n/// 不要になった`ReplicatedLog`インスタンスを回収することは可能.\\n\\npub struct ReplicatedLog<IO: Io> {\\n\\n node: NodeState<IO>,\\n\\n metrics: Arc<RaftlogMetrics>,\\n\\n}\\n\\nimpl<IO: Io> ReplicatedLog<IO> {\\n\\n /// `members`で指定されたクラスタに属する`ReplicatedLog`のローカルインスタンス(ノード)を生成する.\\n\\n ///\\n\\n /// ローカルノードのIDは`node_id`で指定するが、これが`members`の含まれている必要は必ずしもない.\\n\\n /// 例えば、クラスタの構成変更に伴い、新規ノードを追加したい場合には、\\n\\n /// `members`に現行構成を指定することが望ましいが、このケースでは、\\n\\n /// `node_id`は`members`の中には含まれないことになる.\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 48,\n \"score\": 34263.2415772414\n },\n {\n \"content\": \" /// # Errors\\n\\n ///\\n\\n /// 非リーダノードに対して、このメソッドが実行された場合には、\\n\\n /// `ErrorKind::NotLeader`を理由としたエラーが返される.\\n\\n pub fn heartbeat(&mut self) -> Result<SequenceNumber> {\\n\\n if let RoleState::Leader(ref mut leader) = self.node.role {\\n\\n let seq_no = leader.heartbeat_syn(&mut self.node.common);\\n\\n Ok(seq_no)\\n\\n } else {\\n\\n track_panic!(ErrorKind::NotLeader);\\n\\n }\\n\\n }\\n\\n\\n\\n /// ローカルログにスナップショットをインストールする.\\n\\n ///\\n\\n /// `new_head`が新しいローカルログの先頭位置となり、\\n\\n /// `snapshot`はその地点までのコマンド群が適用済みの状態機械のスナップショット、となる.\\n\\n ///\\n\\n /// # Errors\\n\\n ///\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 49,\n \"score\": 34262.66923943766\n },\n {\n \"content\": \" self.node.common.release_io()\\n\\n }\\n\\n}\\n\\nimpl<IO: Io> Stream for ReplicatedLog<IO> {\\n\\n type Item = Event;\\n\\n type Error = Error;\\n\\n fn poll(&mut self) -> Poll<Option<Self::Item>, Self::Error> {\\n\\n track!(self.node.poll(), \\\"node={:?}\\\", self.local_node())\\n\\n }\\n\\n}\\n\\n\\n\\n/// `ReplicatedLog`から発生するイベント一覧.\\n\\n#[derive(Debug, PartialEq, Eq)]\\n\\n#[allow(missing_docs)]\\n\\npub enum Event {\\n\\n /// ローカルノードの役割が変わった.\\n\\n RoleChanged { new_role: Role },\\n\\n\\n\\n /// 新しい選挙期間に移った.\\n\\n TermChanged { new_ballot: Ballot },\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 50,\n \"score\": 34262.59552161272\n },\n {\n \"content\": \"use std::collections::VecDeque;\\n\\nuse trackable::error::ErrorKindExt;\\n\\n\\n\\nuse crate::cluster::ClusterConfig;\\n\\nuse crate::log::{LogEntry, LogIndex, LogPosition, LogPrefix, LogSuffix};\\n\\nuse crate::{ErrorKind, Result};\\n\\n\\n\\n/// ローカルログの歴史(要約)を保持するためのデータ構造.\\n\\n///\\n\\n/// スナップショット地点以降のローカルログに関して発生した、\\n\\n/// 重要な出来事(i.g., `Term`の変更)が記録されている.\\n\\n///\\n\\n/// それ以外に「ログの末尾(log_tail)」および「ログのコミット済み末尾(log_committed_tail)」、\\n\\n/// 「ログの消費済み末尾(log_consumed_tail)」の三つの地点を保持している.\\n\\n///\\n\\n/// それらの関しては`log_consumed_tail <= log_committed_tail <= log_tail`の不変項が維持される.\\n\\n#[derive(Debug, Clone)]\\n\\npub struct LogHistory {\\n\\n appended_tail: LogPosition,\\n\\n committed_tail: LogPosition,\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 51,\n \"score\": 34262.561864374664\n },\n {\n \"content\": \" ///\\n\\n /// `new_tail`が`LogSuffix`が保持する範囲の外の場合には、\\n\\n /// `ErrorKind::InvalidInput`を理由としたエラーが返される.\\n\\n pub fn truncate(&mut self, new_tail: LogIndex) -> Result<()> {\\n\\n track_assert!(self.head.index <= new_tail, ErrorKind::InvalidInput);\\n\\n track_assert!(new_tail <= self.tail().index, ErrorKind::InvalidInput);\\n\\n let delta = self.tail().index - new_tail;\\n\\n let new_len = self.entries.len() - delta;\\n\\n self.entries.truncate(new_len);\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// 指定された範囲のログ領域を切り出して返す.\\n\\n ///\\n\\n /// # Errors\\n\\n ///\\n\\n /// `self`が指定範囲を包含していない場合には、\\n\\n /// `ErrorKind::InvalidInput`を理由としてエラーが返される.\\n\\n pub fn slice(&self, start: LogIndex, end: LogIndex) -> Result<Self> {\\n\\n track_assert!(self.head.index <= start, ErrorKind::InvalidInput);\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 52,\n \"score\": 34262.489747051775\n },\n {\n \"content\": \" /// `new_head`は、現在のログの末尾を超えていても良いが、\\n\\n /// 現在のログの先頭以前のものは許容されない.\\n\\n /// (スナップショット地点から現在までの歴史が消失してしまうため)\\n\\n ///\\n\\n /// なお、`head`以前の記録は歴史から削除される.\\n\\n pub fn record_snapshot_installed(\\n\\n &mut self,\\n\\n new_head: LogPosition,\\n\\n config: ClusterConfig,\\n\\n ) -> Result<()> {\\n\\n track_assert!(\\n\\n self.head().index <= new_head.index,\\n\\n ErrorKind::InconsistentState,\\n\\n \\\"self.head={:?}, new_head={:?}\\\",\\n\\n self.head(),\\n\\n new_head\\n\\n );\\n\\n\\n\\n // スナップショット地点までの歴史は捨てる\\n\\n while self\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 53,\n \"score\": 34262.47510815974\n },\n {\n \"content\": \" /// スナップショットが読み込まれたことを記録する.\\n\\n ///\\n\\n /// ローカルログ内のスナップショット地点までのエントリは、消費されたものとして扱われる.\\n\\n pub fn record_snapshot_loaded(&mut self, snapshot: &LogPrefix) -> Result<()> {\\n\\n if self.consumed_tail.index < snapshot.tail.index {\\n\\n track_assert!(\\n\\n snapshot.tail.index <= self.committed_tail.index,\\n\\n ErrorKind::InconsistentState,\\n\\n \\\"snapshot.tail.index={:?}, self.committed_tail.index={:?}\\\",\\n\\n snapshot.tail.index,\\n\\n self.committed_tail.index\\n\\n );\\n\\n self.consumed_tail = snapshot.tail;\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\\n/// `LogHistory`に保持されるレコード.\\n\\n#[derive(Debug, Clone)]\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 54,\n \"score\": 34262.4161360622\n },\n {\n \"content\": \" /// # Errors\\n\\n ///\\n\\n /// 非リーダノードに対して、このメソッドが実行された場合には、\\n\\n /// `ErrorKind::NotLeader`を理由としたエラーが返される.\\n\\n pub fn propose_command(&mut self, command: Vec<u8>) -> Result<ProposalId> {\\n\\n if let RoleState::Leader(ref mut leader) = self.node.role {\\n\\n let term = self.node.common.term();\\n\\n let entry = LogEntry::Command { term, command };\\n\\n let proposal_id = leader.propose(&mut self.node.common, entry);\\n\\n Ok(proposal_id)\\n\\n } else {\\n\\n track_panic!(ErrorKind::NotLeader)\\n\\n }\\n\\n }\\n\\n\\n\\n /// 新しいクラスタ構成(新メンバ群)を提案する.\\n\\n ///\\n\\n /// 提案が承認(コミット)された場合には、返り値の`LogPosition`を含む\\n\\n /// `Event::Committed`イベントが返される.\\n\\n /// ただし、承認された場合であっても、それは新旧混合状態の構成が承認されただけであり、\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 55,\n \"score\": 34262.16914503528\n },\n {\n \"content\": \"//! ノードローカルなログ関連の構成要素群.\\n\\nuse std::ops::{Add, AddAssign, Sub, SubAssign};\\n\\n\\n\\npub use self::history::{HistoryRecord, LogHistory};\\n\\n\\n\\nuse crate::cluster::ClusterConfig;\\n\\nuse crate::election::Term;\\n\\nuse crate::{ErrorKind, Result};\\n\\n\\n\\nmod history;\\n\\n\\n\\n/// ローカルログ.\\n\\n#[derive(Debug)]\\n\\npub enum Log {\\n\\n /// ログの前半部分 (i.e., スナップショット).\\n\\n Prefix(LogPrefix),\\n\\n\\n\\n /// ログの後半部分>\\n\\n Suffix(LogSuffix),\\n\\n}\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 56,\n \"score\": 34262.079309011286\n },\n {\n \"content\": \" new_head,\\n\\n self.local_history().head(),\\n\\n self.local_node()\\n\\n )?;\\n\\n (record.head.prev_term, record.config.clone())\\n\\n };\\n\\n let prefix = LogPrefix {\\n\\n tail: LogPosition {\\n\\n prev_term,\\n\\n index: new_head,\\n\\n },\\n\\n config,\\n\\n snapshot,\\n\\n };\\n\\n track!(self.node.common.install_snapshot(prefix))?;\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// 新しい選挙を開始する.\\n\\n ///\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 57,\n \"score\": 34261.67656120324\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// I/O実装に対する参照を返す.\\n\\n pub fn io(&self) -> &IO {\\n\\n self.node.common.io()\\n\\n }\\n\\n\\n\\n /// I/O実装に対する破壊的な参照を返す.\\n\\n ///\\n\\n /// # Safety\\n\\n /// 破壊的な操作は、Raftの管理外の挙動となり、\\n\\n /// 整合性を崩してしまう可能性もあるので、\\n\\n /// 注意を喚起する意味で`unsafe`と設定されている.\\n\\n pub unsafe fn io_mut(&mut self) -> &mut IO {\\n\\n self.node.common.io_mut()\\n\\n }\\n\\n\\n\\n /// このReplicatedLogの所有権を放棄し、\\n\\n /// その代わりに内部で使われているIOインスタンスを取得する.\\n\\n pub fn release_io(self) -> IO {\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 58,\n \"score\": 34260.85681905093\n },\n {\n \"content\": \"pub struct HistoryRecord {\\n\\n /// 記録地点.\\n\\n pub head: LogPosition,\\n\\n\\n\\n /// 記録時のクラスタ構成.\\n\\n pub config: ClusterConfig,\\n\\n}\\n\\nimpl HistoryRecord {\\n\\n fn new(head: LogPosition, config: ClusterConfig) -> Self {\\n\\n HistoryRecord { head, config }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 59,\n \"score\": 34260.376056602894\n },\n {\n \"content\": \" pub config: ClusterConfig,\\n\\n\\n\\n /// 前半部分に含まれるコマンド群の適用後の状態機械のスナップショット.\\n\\n pub snapshot: Vec<u8>,\\n\\n}\\n\\n\\n\\n/// ログの後半部分.\\n\\n///\\n\\n/// 厳密には、常に\\\"後半部分\\\"、つまり「ある地点より後ろの全てのエントリ」を\\n\\n/// 含んでいる訳ではない.\\n\\n///\\n\\n/// ただし、このデータ構造自体は、常に追記的なアクセスのために利用され、\\n\\n/// \\\"ログの途中の一部だけを更新する\\\"といった操作は発生しないので、\\n\\n/// \\\"常にログの末尾に対して適用される\\\"的な意味合いで`Suffix`と付けている.\\n\\n#[derive(Debug, Clone)]\\n\\npub struct LogSuffix {\\n\\n /// ログの開始位置.\\n\\n ///\\n\\n /// `entries`のサイズが1以上の場合には、\\n\\n /// その最初のエントリの位置となる.\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 60,\n \"score\": 34259.9436534265\n },\n {\n \"content\": \" /// 何らかの手段で現在のリーダのダウンを検知した場合に呼び出される.\\n\\n pub fn start_election(&mut self) {\\n\\n self.node.start_election();\\n\\n }\\n\\n\\n\\n /// ローカルノードの情報を返す.\\n\\n pub fn local_node(&self) -> &Node {\\n\\n self.node.common.local_node()\\n\\n }\\n\\n\\n\\n /// ローカルログの履歴を返す.\\n\\n pub fn local_history(&self) -> &LogHistory {\\n\\n self.node.common.log()\\n\\n }\\n\\n\\n\\n /// ローカルログへの書き込み待ちの状態の提案群の数を返す.\\n\\n ///\\n\\n /// この値は、ローカルストレージの詰まり具合を把握するために有用である.\\n\\n ///\\n\\n /// 「ローカルログへは追記完了 and コミット待ち」の個数は\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 61,\n \"score\": 34259.70990628072\n },\n {\n \"content\": \" let node = NodeState::load(node_id, config, io, metrics.node_state.clone());\\n\\n Ok(ReplicatedLog {\\n\\n node,\\n\\n metrics: Arc::new(metrics),\\n\\n })\\n\\n }\\n\\n\\n\\n /// `raftlog` のメトリクスを返す。\\n\\n pub fn metrics(&self) -> &Arc<RaftlogMetrics> {\\n\\n &self.metrics\\n\\n }\\n\\n\\n\\n /// 新しいコマンドを提案する.\\n\\n ///\\n\\n /// 提案が承認(コミット)された場合には、返り値の`LogPosition`を含む\\n\\n /// `Event::Committed`イベントが返される.\\n\\n ///\\n\\n /// もし返り値の`LogPosition`とは分岐した`Event::Committed`が返された場合には、\\n\\n /// この提案が棄却されたことを示している.\\n\\n ///\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 62,\n \"score\": 34259.70951913113\n },\n {\n \"content\": \" pub fn record_appended(&mut self, suffix: &LogSuffix) -> Result<()> {\\n\\n let entries_offset = if self.appended_tail.index <= suffix.head.index {\\n\\n 0\\n\\n } else {\\n\\n // NOTE:\\n\\n // 追記中にスナップショットがインストールされた場合に、\\n\\n // 両者の先頭位置がズレることがあるので調整する\\n\\n self.appended_tail.index - suffix.head.index\\n\\n };\\n\\n for (i, e) in suffix.entries.iter().enumerate().skip(entries_offset) {\\n\\n let tail = LogPosition {\\n\\n prev_term: e.term(),\\n\\n index: suffix.head.index + i + 1,\\n\\n };\\n\\n if let LogEntry::Config { ref config, .. } = *e {\\n\\n if self.last_record().config != *config {\\n\\n // クラスタ構成が変更された\\n\\n let record = HistoryRecord::new(tail, config.clone());\\n\\n self.records.push_back(record);\\n\\n }\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 63,\n \"score\": 34259.1390156538\n },\n {\n \"content\": \" /// 知りたい場合には`local_history`メソッド経由で取得可能.\\n\\n ///\\n\\n /// ローカルノードが非リーダである場合には、常に`0`が返される.\\n\\n pub fn proposal_queue_len(&self) -> usize {\\n\\n if let RoleState::Leader(ref leader) = self.node.role {\\n\\n leader.proposal_queue_len(&self.node.common)\\n\\n } else {\\n\\n 0\\n\\n }\\n\\n }\\n\\n\\n\\n /// スナップショットをインストール中の場合には`true`を返す.\\n\\n ///\\n\\n /// このメソッドが`true`を返している間は、\\n\\n /// 新しいスナップショットのインストールを行うことはできない.\\n\\n pub fn is_snapshot_installing(&self) -> bool {\\n\\n // 起動後のロードフェーズの間もスナップショットのインストールは行えないので、\\n\\n // その場合も`true`を返しておく.\\n\\n self.node.is_loading() || self.node.common.is_snapshot_installing()\\n\\n }\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 64,\n \"score\": 34259.00493786795\n },\n {\n \"content\": \" ///\\n\\n /// リーダ選出時には、最初にこのエントリがログに追加され、\\n\\n /// `Term`が変わったことを記録する.\\n\\n Noop { term: Term },\\n\\n\\n\\n /// クラスタ構成の変更を共有するためのエントリ.\\n\\n Config { term: Term, config: ClusterConfig },\\n\\n\\n\\n /// 状態機械の入力となるコマンドを格納したエントリ.\\n\\n Command { term: Term, command: Vec<u8> },\\n\\n}\\n\\nimpl LogEntry {\\n\\n /// このエントリが発行された`Term`を返す.\\n\\n pub fn term(&self) -> Term {\\n\\n match *self {\\n\\n LogEntry::Noop { term } => term,\\n\\n LogEntry::Config { term, .. } => term,\\n\\n LogEntry::Command { term, .. } => term,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 65,\n \"score\": 34258.610196698566\n },\n {\n \"content\": \" consumed_tail: LogPosition,\\n\\n records: VecDeque<HistoryRecord>,\\n\\n}\\n\\nimpl LogHistory {\\n\\n /// 初期クラスタ構成を与えて、新しい`LogHistory`インスタンスを生成する.\\n\\n pub fn new(config: ClusterConfig) -> Self {\\n\\n let initial = HistoryRecord::new(LogPosition::default(), config);\\n\\n LogHistory {\\n\\n appended_tail: LogPosition::default(),\\n\\n committed_tail: LogPosition::default(),\\n\\n consumed_tail: LogPosition::default(),\\n\\n records: vec![initial].into(),\\n\\n }\\n\\n }\\n\\n\\n\\n /// ローカルログの先端位置を返す.\\n\\n pub fn head(&self) -> LogPosition {\\n\\n self.records[0].head\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 66,\n \"score\": 34258.593878833264\n },\n {\n \"content\": \" }\\n\\n if tail.prev_term != self.last_record().head.prev_term {\\n\\n // 新しい選挙期間(`Term`)に移った\\n\\n track_assert!(\\n\\n self.last_record().head.prev_term < tail.prev_term,\\n\\n ErrorKind::Other,\\n\\n \\\"last_record.head={:?}, tail={:?}\\\",\\n\\n self.last_record().head,\\n\\n tail\\n\\n );\\n\\n let record = HistoryRecord::new(tail, self.last_record().config.clone());\\n\\n self.records.push_back(record);\\n\\n }\\n\\n }\\n\\n self.appended_tail = suffix.tail();\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// `new_tail_index`までコミット済み地点が進んだことを記録する.\\n\\n pub fn record_committed(&mut self, new_tail_index: LogIndex) -> Result<()> {\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 67,\n \"score\": 34258.092115432504\n },\n {\n \"content\": \" Ok(())\\n\\n }\\n\\n\\n\\n /// `new_tail`までのログに含まれるコマンドが消費されたことを記録する.\\n\\n ///\\n\\n /// ここでの\\\"消費\\\"とは「状態機械に入力として渡されて実行された」ことを意味する.\\n\\n pub fn record_consumed(&mut self, new_tail_index: LogIndex) -> Result<()> {\\n\\n track_assert!(self.consumed_tail.index <= new_tail_index, ErrorKind::Other);\\n\\n track_assert!(\\n\\n new_tail_index <= self.committed_tail.index,\\n\\n ErrorKind::Other\\n\\n );\\n\\n\\n\\n let prev_term =\\n\\n track!(self.get_record(new_tail_index).ok_or_else(\\n\\n || ErrorKind::Other.cause(format!(\\\"Too old index: {:?}\\\", new_tail_index))\\n\\n ))?\\n\\n .head\\n\\n .prev_term;\\n\\n self.consumed_tail = LogPosition {\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 68,\n \"score\": 34257.671393677396\n },\n {\n \"content\": \"impl Default for LogSuffix {\\n\\n fn default() -> Self {\\n\\n LogSuffix {\\n\\n head: LogPosition::default(),\\n\\n entries: Vec::new(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// `LogSuffix`に含まれるログの位置を走査するための`Iterator`実装.\\n\\n#[derive(Debug)]\\n\\npub struct LogPositions<'a> {\\n\\n suffix: &'a LogSuffix,\\n\\n offset: usize,\\n\\n}\\n\\nimpl<'a> Iterator for LogPositions<'a> {\\n\\n type Item = LogPosition;\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n if self.suffix.entries.len() < self.offset {\\n\\n None\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 69,\n \"score\": 34257.63386995779\n },\n {\n \"content\": \"\\n\\n /// 後半部分に含まれるエントリの位置を走査するためのイテレータを返す.\\n\\n pub fn positions(&self) -> LogPositions {\\n\\n LogPositions {\\n\\n suffix: self,\\n\\n offset: 0,\\n\\n }\\n\\n }\\n\\n\\n\\n /// `new_head`のまでスキップする.\\n\\n ///\\n\\n /// 現在の先頭から`new_head`までのエントリは破棄され、`new_head`が新しい先頭になる.\\n\\n ///\\n\\n /// # Errors\\n\\n ///\\n\\n /// 以下のいずれかの場合には`ErrorKind::InvalidInput`が返される:\\n\\n ///\\n\\n /// - `new_head < self.head.index`\\n\\n /// - `self.tail().index < new_head`\\n\\n pub fn skip_to(&mut self, new_head: LogIndex) -> Result<()> {\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 70,\n \"score\": 34257.56506588406\n },\n {\n \"content\": \" /// ローカルログの終端位置を返す.\\n\\n pub fn tail(&self) -> LogPosition {\\n\\n self.appended_tail\\n\\n }\\n\\n\\n\\n /// ローカルログのコミット済みの終端位置を返す.\\n\\n ///\\n\\n /// 「コミット済みの終端」==「未コミットの始端」\\n\\n pub fn committed_tail(&self) -> LogPosition {\\n\\n self.committed_tail\\n\\n }\\n\\n\\n\\n /// ローカルログの適用済みの終端位置を返す.\\n\\n pub fn consumed_tail(&self) -> LogPosition {\\n\\n self.consumed_tail\\n\\n }\\n\\n\\n\\n /// ローカルログに記録された最新のクラスタ構成を返す.\\n\\n pub fn config(&self) -> &ClusterConfig {\\n\\n &self.last_record().config\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 71,\n \"score\": 34257.35553214644\n },\n {\n \"content\": \"impl From<LogPrefix> for Log {\\n\\n fn from(f: LogPrefix) -> Self {\\n\\n Log::Prefix(f)\\n\\n }\\n\\n}\\n\\nimpl From<LogSuffix> for Log {\\n\\n fn from(f: LogSuffix) -> Self {\\n\\n Log::Suffix(f)\\n\\n }\\n\\n}\\n\\n\\n\\n/// ログの前半部分 (i.e., スナップショット).\\n\\n#[derive(Debug, Clone)]\\n\\npub struct LogPrefix {\\n\\n /// 前半部分の終端位置.\\n\\n ///\\n\\n /// \\\"終端位置\\\" = \\\"前半部分に含まれない最初の位置\\\".\\n\\n pub tail: LogPosition,\\n\\n\\n\\n /// 前半部分に含まれる中で、最新の構成情報.\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 72,\n \"score\": 34257.00438148588\n },\n {\n \"content\": \" /// 新しい`LogIndex`インスタンスを生成する.\\n\\n pub fn new(index: u64) -> Self {\\n\\n LogIndex(index)\\n\\n }\\n\\n\\n\\n /// インデックスの値を返す.\\n\\n pub fn as_u64(self) -> u64 {\\n\\n self.0\\n\\n }\\n\\n}\\n\\nimpl From<u64> for LogIndex {\\n\\n fn from(f: u64) -> Self {\\n\\n LogIndex::new(f)\\n\\n }\\n\\n}\\n\\nimpl Add<usize> for LogIndex {\\n\\n type Output = Self;\\n\\n fn add(self, rhs: usize) -> Self::Output {\\n\\n LogIndex(self.0 + rhs as u64)\\n\\n }\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 73,\n \"score\": 34256.94995746031\n },\n {\n \"content\": \"}\\n\\nimpl AddAssign<usize> for LogIndex {\\n\\n fn add_assign(&mut self, rhs: usize) {\\n\\n self.0 += rhs as u64;\\n\\n }\\n\\n}\\n\\nimpl Sub for LogIndex {\\n\\n type Output = usize;\\n\\n fn sub(self, rhs: Self) -> Self::Output {\\n\\n (self.0 - rhs.0) as usize\\n\\n }\\n\\n}\\n\\nimpl Sub<usize> for LogIndex {\\n\\n type Output = Self;\\n\\n fn sub(self, rhs: usize) -> Self::Output {\\n\\n LogIndex(self.0 - rhs as u64)\\n\\n }\\n\\n}\\n\\nimpl SubAssign<usize> for LogIndex {\\n\\n fn sub_assign(&mut self, rhs: usize) {\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 74,\n \"score\": 34256.26600747565\n },\n {\n \"content\": \" let suffix = LogSuffix {\\n\\n head: LogPosition {\\n\\n prev_term: 0.into(),\\n\\n index: 30.into(),\\n\\n },\\n\\n entries: vec![noop(0), noop(2), noop(2)],\\n\\n };\\n\\n assert_eq!(\\n\\n suffix.positions().collect::<Vec<_>>(),\\n\\n [id(0, 30), id(0, 31), id(2, 32), id(2, 33)]\\n\\n );\\n\\n assert_eq!(suffix.entries.len(), 3);\\n\\n\\n\\n let slice = suffix.slice(31.into(), 33.into()).unwrap();\\n\\n assert_eq!(\\n\\n slice.positions().collect::<Vec<_>>(),\\n\\n [id(0, 31), id(2, 32), id(2, 33)]\\n\\n );\\n\\n assert_eq!(slice.entries.len(), 2);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 75,\n \"score\": 34256.1753938002\n },\n {\n \"content\": \" prev_term,\\n\\n index: new_tail_index,\\n\\n };\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// 「追記済み and 未コミット」な末尾領域がロールバック(破棄)されたことを記録する.\\n\\n ///\\n\\n /// ログの新しい終端は`new_tail`となる.\\n\\n pub fn record_rollback(&mut self, new_tail: LogPosition) -> Result<()> {\\n\\n track_assert!(new_tail.index <= self.appended_tail.index, ErrorKind::Other);\\n\\n track_assert!(\\n\\n self.committed_tail.index <= new_tail.index,\\n\\n ErrorKind::Other,\\n\\n \\\"old={:?}, new={:?}\\\",\\n\\n self.committed_tail,\\n\\n new_tail\\n\\n );\\n\\n track_assert_eq!(\\n\\n self.get_record(new_tail.index).map(|r| r.head.prev_term),\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 76,\n \"score\": 34256.11570078021\n },\n {\n \"content\": \"\\n\\n /// 過半数以上の応答を得られた最新のハートビート(i.e., AppendEntriesCall) のシーケンス番号を返す.\\n\\n ///\\n\\n /// この値は、同じ選挙期間に関しては減少することはないことが保証されている.\\n\\n ///\\n\\n /// # 注意\\n\\n ///\\n\\n /// ハートビートを行うのはリーダノードのみなので、それ以外のノードに関しては、\\n\\n /// このメソッドが返す値は意味を持たない.\\n\\n pub fn last_heartbeat_ack(&self) -> SequenceNumber {\\n\\n if let RoleState::Leader(ref leader) = self.node.role {\\n\\n leader.last_heartbeat_ack()\\n\\n } else {\\n\\n SequenceNumber::new(0)\\n\\n }\\n\\n }\\n\\n\\n\\n /// 現在のクラスタ構成を返す.\\n\\n pub fn cluster_config(&self) -> &ClusterConfig {\\n\\n self.node.common.config()\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 77,\n \"score\": 34255.59717826611\n },\n {\n \"content\": \" track_assert!(start <= end, ErrorKind::InvalidInput);\\n\\n track_assert!(end <= self.tail().index, ErrorKind::InvalidInput);\\n\\n let slice_start = start - self.head.index;\\n\\n let slice_end = end - self.head.index;\\n\\n let slice_head = if start == self.head.index {\\n\\n self.head\\n\\n } else {\\n\\n let prev_term = self.entries[slice_start - 1].term();\\n\\n LogPosition {\\n\\n prev_term,\\n\\n index: start,\\n\\n }\\n\\n };\\n\\n let slice_entries = self.entries[slice_start..slice_end].into();\\n\\n Ok(LogSuffix {\\n\\n head: slice_head,\\n\\n entries: slice_entries,\\n\\n })\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 78,\n \"score\": 34255.20345067375\n },\n {\n \"content\": \" };\\n\\n assert_eq!(\\n\\n suffix.positions().collect::<Vec<_>>(),\\n\\n [id(0, 30), id(0, 31), id(2, 32), id(2, 33)]\\n\\n );\\n\\n }\\n\\n #[test]\\n\\n fn log_suffix_skip_to() {\\n\\n let mut suffix = LogSuffix {\\n\\n head: LogPosition {\\n\\n prev_term: 0.into(),\\n\\n index: 30.into(),\\n\\n },\\n\\n entries: vec![noop(0), noop(2), noop(2)],\\n\\n };\\n\\n assert_eq!(\\n\\n suffix.positions().collect::<Vec<_>>(),\\n\\n [id(0, 30), id(0, 31), id(2, 32), id(2, 33)]\\n\\n );\\n\\n assert_eq!(suffix.entries.len(), 3);\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 79,\n \"score\": 34254.69927823274\n },\n {\n \"content\": \"\\n\\n suffix.skip_to(31.into()).unwrap();\\n\\n assert_eq!(\\n\\n suffix.positions().collect::<Vec<_>>(),\\n\\n [id(0, 31), id(2, 32), id(2, 33)]\\n\\n );\\n\\n assert_eq!(suffix.entries.len(), 2);\\n\\n\\n\\n suffix.skip_to(33.into()).unwrap();\\n\\n assert_eq!(suffix.positions().collect::<Vec<_>>(), [id(2, 33)]);\\n\\n assert_eq!(suffix.entries.len(), 0);\\n\\n\\n\\n suffix.skip_to(33.into()).unwrap();\\n\\n assert_eq!(suffix.positions().collect::<Vec<_>>(), [id(2, 33)]);\\n\\n assert_eq!(suffix.entries.len(), 0);\\n\\n }\\n\\n #[test]\\n\\n fn log_suffix_truncate() {\\n\\n let mut suffix = LogSuffix {\\n\\n head: LogPosition {\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 80,\n \"score\": 34254.46706470018\n },\n {\n \"content\": \" /// let b = LogPosition { prev_term: 10.into(), index: 3.into() };\\n\\n /// assert!(a.is_newer_or_equal_than(b));\\n\\n /// assert!(!b.is_newer_or_equal_than(a));\\n\\n ///\\n\\n /// // `a`の方がインデックスは大きいが、`b`の方が`Term`は大きい\\n\\n /// // => 順序が確定できない\\n\\n /// let a = LogPosition { prev_term: 5.into(), index: 10.into() };\\n\\n /// let b = LogPosition { prev_term: 10.into(), index: 3.into() };\\n\\n /// assert!(!a.is_newer_or_equal_than(b));\\n\\n /// assert!(!b.is_newer_or_equal_than(a));\\n\\n /// ```\\n\\n pub fn is_newer_or_equal_than(&self, other: LogPosition) -> bool {\\n\\n self.prev_term >= other.prev_term && self.index >= other.index\\n\\n }\\n\\n}\\n\\n\\n\\n/// あるログエントリのインデックス.\\n\\n#[derive(Debug, Default, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]\\n\\npub struct LogIndex(u64);\\n\\nimpl LogIndex {\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 81,\n \"score\": 34254.29765847175\n },\n {\n \"content\": \" prev_term: 0.into(),\\n\\n index: 30.into(),\\n\\n },\\n\\n entries: vec![noop(0), noop(2), noop(2)],\\n\\n };\\n\\n assert_eq!(\\n\\n suffix.positions().collect::<Vec<_>>(),\\n\\n [id(0, 30), id(0, 31), id(2, 32), id(2, 33)]\\n\\n );\\n\\n assert_eq!(suffix.entries.len(), 3);\\n\\n\\n\\n suffix.truncate(31.into()).unwrap();\\n\\n assert_eq!(\\n\\n suffix.positions().collect::<Vec<_>>(),\\n\\n [id(0, 30), id(0, 31)]\\n\\n );\\n\\n assert_eq!(suffix.entries.len(), 1);\\n\\n }\\n\\n #[test]\\n\\n fn log_suffix_slice() {\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 82,\n \"score\": 34253.75957121981\n },\n {\n \"content\": \"\\n\\n /// 新しいリーダーが選出された.\\n\\n NewLeaderElected,\\n\\n\\n\\n /// 新しいログエントリがコミットされた.\\n\\n ///\\n\\n /// エントリの内容がコマンドの場合には、\\n\\n /// `ReplicatedLog`の利用者は、自身が管理する状態機械に、\\n\\n /// `command`を適用する必要がある.\\n\\n ///\\n\\n /// ログエントリはインデックスの昇順でコミットされ,\\n\\n /// インデックスは常に一ずつ増加する.\\n\\n Committed { index: LogIndex, entry: LogEntry },\\n\\n\\n\\n /// スナップショットがロードされた.\\n\\n ///\\n\\n /// `ReplicatedLog`の利用者は、自身が管理する状態機械を、\\n\\n /// `snapshot`の状態にリセットする必要がある.\\n\\n SnapshotLoaded {\\n\\n new_head: LogPosition,\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 83,\n \"score\": 34253.342411234924\n },\n {\n \"content\": \" snapshot: Vec<u8>,\\n\\n },\\n\\n\\n\\n /// スナップショットのインストールが行われた.\\n\\n ///\\n\\n /// もし`new_head`の位置が、最新のコミット済み地点よりも\\n\\n /// 新しい場合には、これとは別に`SnapshotLoaded`イベントが発行される.\\n\\n SnapshotInstalled { new_head: LogPosition },\\n\\n}\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 84,\n \"score\": 34252.8017413101\n },\n {\n \"content\": \"}\\n\\n\\n\\n/// 提案ID.\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\\n\\npub struct ProposalId {\\n\\n /// 提案が発行された時の`Term`.\\n\\n pub term: Term,\\n\\n\\n\\n /// 提案を保持するエントリのログ内でのインデックス.\\n\\n pub index: LogIndex,\\n\\n}\\n\\n\\n\\n/// ログの特定位置を識別するためのデータ構造.\\n\\n#[derive(Debug, Default, Clone, Copy, PartialEq, Eq, Hash)]\\n\\npub struct LogPosition {\\n\\n /// 一つ前のインデックスのエントリの`Term`.\\n\\n pub prev_term: Term,\\n\\n\\n\\n /// この位置のインデックス.\\n\\n pub index: LogIndex,\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 85,\n \"score\": 34252.79125566706\n },\n {\n \"content\": \" pub head: LogPosition,\\n\\n\\n\\n /// 後半部分に属するエントリ群.\\n\\n pub entries: Vec<LogEntry>,\\n\\n}\\n\\nimpl LogSuffix {\\n\\n /// ログの終端位置を返す.\\n\\n ///\\n\\n /// \\\"終端位置\\\" = \\\"entriesに含まれない最初のエントリの位置\\\".\\n\\n ///\\n\\n /// `entries`の最後の要素が、ログ全体の最後の要素と一致している場合には、\\n\\n /// \\\"終端位置\\\"は「次にログに追加される位置(= ログの末端)」となる.\\n\\n pub fn tail(&self) -> LogPosition {\\n\\n let prev_term = self\\n\\n .entries\\n\\n .last()\\n\\n .map_or(self.head.prev_term, LogEntry::term);\\n\\n let index = self.head.index + self.entries.len();\\n\\n LogPosition { prev_term, index }\\n\\n }\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 86,\n \"score\": 34252.49948547952\n },\n {\n \"content\": \"}\\n\\nimpl LogPosition {\\n\\n /// `self`がログ上で、`other`と等しい、あるいは、より後方に位置している場合に`true`が返る.\\n\\n ///\\n\\n /// なお`self`と`other`が、それぞれ分岐したログ上に位置しており、\\n\\n /// 前後関係が判断できない場合には`false`が返される.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// use raftlog::log::LogPosition;\\n\\n ///\\n\\n /// // `a`の方がインデックスが大きい\\n\\n /// let a = LogPosition { prev_term: 10.into(), index: 5.into() };\\n\\n /// let b = LogPosition { prev_term: 10.into(), index: 3.into() };\\n\\n /// assert!(a.is_newer_or_equal_than(b));\\n\\n /// assert!(!b.is_newer_or_equal_than(a));\\n\\n ///\\n\\n /// // `a`の方が`Term`が大きい\\n\\n /// let a = LogPosition { prev_term: 20.into(), index: 3.into() };\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 87,\n \"score\": 34252.16254650308\n },\n {\n \"content\": \" self.0 -= rhs as u64;\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n\\n\\n fn id(prev_term: u64, index: u64) -> LogPosition {\\n\\n LogPosition {\\n\\n prev_term: prev_term.into(),\\n\\n index: index.into(),\\n\\n }\\n\\n }\\n\\n fn noop(term: u64) -> LogEntry {\\n\\n LogEntry::Noop { term: term.into() }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn log_suffix_end() {\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 88,\n \"score\": 34251.8484899255\n },\n {\n \"content\": \" let suffix = LogSuffix::default();\\n\\n assert_eq!(suffix.tail().index.as_u64(), 0);\\n\\n\\n\\n let suffix = LogSuffix {\\n\\n head: LogPosition::default(),\\n\\n entries: vec![noop(0), noop(1)],\\n\\n };\\n\\n assert_eq!(suffix.tail().index.as_u64(), 2);\\n\\n }\\n\\n #[test]\\n\\n fn log_suffix_positions() {\\n\\n let suffix = LogSuffix::default();\\n\\n assert_eq!(suffix.positions().collect::<Vec<_>>(), [id(0, 0)]);\\n\\n\\n\\n let suffix = LogSuffix {\\n\\n head: LogPosition {\\n\\n prev_term: 0.into(),\\n\\n index: 30.into(),\\n\\n },\\n\\n entries: vec![noop(0), noop(2), noop(2)],\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 89,\n \"score\": 34251.51950467414\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// 最後に追加された`HistoryRecord`を返す.\\n\\n pub fn last_record(&self) -> &HistoryRecord {\\n\\n self.records.back().expect(\\\"Never fails\\\")\\n\\n }\\n\\n\\n\\n /// 指定されたインデックスが属するレコードを返す.\\n\\n ///\\n\\n /// 既に削除された領域が指定された場合には`None`が返される.\\n\\n pub fn get_record(&self, index: LogIndex) -> Option<&HistoryRecord> {\\n\\n for r in self.records.iter().rev() {\\n\\n if r.head.index <= index {\\n\\n return Some(r);\\n\\n }\\n\\n }\\n\\n None\\n\\n }\\n\\n\\n\\n /// `suffix`がローカルログに追記されたことを記録する.\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 90,\n \"score\": 34251.03482395725\n },\n {\n \"content\": \" } else {\\n\\n let id = if self.offset == 0 {\\n\\n self.suffix.head\\n\\n } else {\\n\\n let i = self.offset - 1;\\n\\n let prev_term = self.suffix.entries[i].term();\\n\\n let index = self.suffix.head.index + self.offset;\\n\\n LogPosition { prev_term, index }\\n\\n };\\n\\n self.offset += 1;\\n\\n Some(id)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// ログに格納されるエントリ.\\n\\n#[derive(Debug, Clone, PartialEq, Eq)]\\n\\n#[allow(missing_docs)]\\n\\npub enum LogEntry {\\n\\n /// 特に内容を持たないエントリ.\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 91,\n \"score\": 34250.84713780836\n },\n {\n \"content\": \" Some(new_tail.prev_term),\\n\\n ErrorKind::InconsistentState\\n\\n );\\n\\n self.appended_tail = new_tail;\\n\\n\\n\\n if let Some(new_len) = self\\n\\n .records\\n\\n .iter()\\n\\n .position(|r| r.head.index > new_tail.index)\\n\\n {\\n\\n self.records.truncate(new_len);\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// スナップショットがインストールされたことを記録する.\\n\\n ///\\n\\n /// `new_head`はスナップショットに含まれない最初のエントリのIDで、\\n\\n /// `config`はスナップショット取得時のクラスタ構成、を示す.\\n\\n ///\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 92,\n \"score\": 34250.664110564445\n },\n {\n \"content\": \" .records\\n\\n .front()\\n\\n .map_or(false, |r| r.head.index <= new_head.index)\\n\\n {\\n\\n self.records.pop_front();\\n\\n }\\n\\n\\n\\n // 新しいログの先頭をセット\\n\\n let record = HistoryRecord::new(new_head, config);\\n\\n self.records.push_front(record);\\n\\n\\n\\n if self.appended_tail.index < new_head.index {\\n\\n self.appended_tail = new_head;\\n\\n }\\n\\n if self.committed_tail.index < new_head.index {\\n\\n self.committed_tail = new_head;\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 93,\n \"score\": 34250.05097646147\n },\n {\n \"content\": \" track_assert!(\\n\\n self.committed_tail.index <= new_tail_index,\\n\\n ErrorKind::Other\\n\\n );\\n\\n track_assert!(\\n\\n new_tail_index <= self.appended_tail.index,\\n\\n ErrorKind::Other,\\n\\n \\\"new_tail_index={:?}, self.appended_tail.index={:?}\\\",\\n\\n new_tail_index,\\n\\n self.appended_tail.index\\n\\n );\\n\\n let prev_term = track!(self\\n\\n .get_record(new_tail_index,)\\n\\n .ok_or_else(|| ErrorKind::Other.error(),))?\\n\\n .head\\n\\n .prev_term;\\n\\n self.committed_tail = LogPosition {\\n\\n prev_term,\\n\\n index: new_tail_index,\\n\\n };\\n\",\n \"file_path\": \"src/log/history.rs\",\n \"rank\": 94,\n \"score\": 34249.264323838026\n },\n {\n \"content\": \" track_assert!(self.head.index <= new_head, ErrorKind::InvalidInput);\\n\\n track_assert!(new_head <= self.tail().index, ErrorKind::InvalidInput);\\n\\n let count = new_head - self.head.index;\\n\\n if count == 0 {\\n\\n return Ok(());\\n\\n }\\n\\n let prev_term = self\\n\\n .entries\\n\\n .drain(0..count)\\n\\n .last()\\n\\n .expect(\\\"Never fails\\\")\\n\\n .term();\\n\\n self.head.prev_term = prev_term;\\n\\n self.head.index += count;\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n /// 終端を`new_tail`の位置まで切り詰める.\\n\\n ///\\n\\n /// # Errors\\n\",\n \"file_path\": \"src/log/mod.rs\",\n \"rank\": 95,\n \"score\": 34248.24152689339\n },\n {\n \"content\": \" } else {\\n\\n track_panic!(ErrorKind::NotLeader)\\n\\n }\\n\\n }\\n\\n\\n\\n /// 強制的にハートビートメッセージ(i.e., AppendEntriesCall)をブロードキャストする.\\n\\n ///\\n\\n /// 返り値は、送信メッセージのシーケンス番号.\\n\\n ///\\n\\n /// `last_heartbeat_ack`メソッドを用いることで、\\n\\n /// このハートビートに対して、過半数以上の応答を得られた\\n\\n /// タイミングを把握することが可能.\\n\\n ///\\n\\n /// また、リーダのコミットを即座にフォロワーに伝えたい場合にも、\\n\\n /// このメソッドが活用可能。\\n\\n /// (`Event::Committed`をリーダが生成した直後に`heartbeat`メソッドを呼び出せば良い)\\n\\n ///\\n\\n /// なおノードの役割が非リーダに変わった場合には、\\n\\n /// 応答待機中のハートビートは全て破棄されるので注意が必要.\\n\\n ///\\n\",\n \"file_path\": \"src/replicated_log.rs\",\n \"rank\": 96,\n \"score\": 34244.77040871494\n },\n {\n \"content\": \"use raftlog::cluster::ClusterMembers;\\n\\nuse raftlog::node::NodeId;\\n\\nuse rand::{Rng, SeedableRng, StdRng};\\n\\nuse std::collections::BTreeSet;\\n\\nuse std::time::{SystemTime, UNIX_EPOCH};\\n\\n\\n\\nuse crate::io::IoConfig;\\n\\nuse crate::types::{LogicalDuration, Probability, Range, SharedRng};\\n\\n\\n\\n#[derive(Debug, Clone, Serialize, Deserialize)]\\n\\npub struct SimulatorConfig {\\n\\n /// シミュレータで使われる乱数のシード.\\n\\n ///\\n\\n /// この値によって、シミュレータ上で発生するイベントが全て決定される.\\n\\n #[serde(default = \\\"SimulatorConfig::default_seed\\\")]\\n\\n pub seed: u64,\\n\\n\\n\\n #[serde(default = \\\"SimulatorConfig::default_loop_count\\\")]\\n\\n pub loop_count: usize,\\n\\n\\n\",\n \"file_path\": \"raftlog_simu/src/simulator_config.rs\",\n \"rank\": 97,\n \"score\": 32090.618713773903\n },\n {\n \"content\": \" .map(NodeId::new)\\n\\n .collect::<Vec<_>>();\\n\\n rng.shuffle(&mut candidates[..]);\\n\\n candidates.truncate(self.cluster_size.choose(rng));\\n\\n candidates.into_iter().collect()\\n\\n }\\n\\n}\\n\\nimpl Default for SimulatorConfig {\\n\\n fn default() -> Self {\\n\\n SimulatorConfig {\\n\\n seed: SimulatorConfig::default_seed(),\\n\\n loop_count: SimulatorConfig::default_loop_count(),\\n\\n propose_command: SimulatorConfig::default_propose_command(),\\n\\n manual_heartbeat: SimulatorConfig::default_manual_heartbeat(),\\n\\n take_snapshot: SimulatorConfig::default_take_snapshot(),\\n\\n node_down: SimulatorConfig::default_node_down(),\\n\\n node_restart_interval: SimulatorConfig::default_node_restart_interval(),\\n\\n cluster_size: SimulatorConfig::default_cluster_size(),\\n\\n change_cluster: SimulatorConfig::default_change_cluster(),\\n\\n io: IoConfig::default(),\\n\\n nodes: SimulatorConfig::default_nodes(),\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"raftlog_simu/src/simulator_config.rs\",\n \"rank\": 98,\n \"score\": 32087.848252646214\n },\n {\n \"content\": \" pub fn default_nodes() -> BTreeSet<String> {\\n\\n [\\\"foo\\\", \\\"bar\\\", \\\"baz\\\", \\\"qux\\\", \\\"quux\\\", \\\"corge\\\", \\\"grault\\\"]\\n\\n .iter()\\n\\n .map(|n| n.to_string())\\n\\n .collect()\\n\\n }\\n\\n\\n\\n pub fn make_rng(&self) -> SharedRng {\\n\\n let mut seed = [0; 32];\\n\\n for (i, v) in seed.iter_mut().enumerate().take(8) {\\n\\n *v = (self.seed >> (i * 8)) as u8;\\n\\n }\\n\\n let inner = StdRng::from_seed(seed);\\n\\n SharedRng::new(inner)\\n\\n }\\n\\n pub fn choose_members<R: Rng>(&self, rng: &mut R) -> ClusterMembers {\\n\\n let mut candidates = self\\n\\n .nodes\\n\\n .iter()\\n\\n .cloned()\\n\",\n \"file_path\": \"raftlog_simu/src/simulator_config.rs\",\n \"rank\": 99,\n \"score\": 32084.732176897018\n }\n]","isConversational":false}}},{"rowIdx":983,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"state/api/src/chain_state.rs"},"repo_name":{"kind":"string","value":"xielong/starcoin"},"commit":{"kind":"string","value":"14faf39ea7231d6a24780a87f847584824e7ff18"},"file_code":{"kind":"string","value":"\n\nuse anyhow::{ensure, format_err, Result};\nuse merkle_tree::{blob::Blob, proof::SparseMerkleProof, RawKey};\nuse serde::de::DeserializeOwned;\nuse serde::{Deserialize, Serialize};\nuse starcoin_crypto::HashValue;\nuse starcoin_types::state_set::AccountStateSet;\nuse starcoin_types::write_set::WriteSet;\nuse starcoin_types::{\n access_path::AccessPath,\n account_address::AccountAddress,\n account_config::{AccountResource, BalanceResource},\n account_state::AccountState,\n language_storage::TypeTag,\n state_set::ChainStateSet,\n};\nuse starcoin_vm_types::account_config::{genesis_address, STC_TOKEN_CODE};\nuse starcoin_vm_types::genesis_config::ChainId;\nuse starcoin_vm_types::language_storage::ModuleId;\nuse starcoin_vm_types::on_chain_resource::{Epoch, EpochData, EpochInfo, GlobalTimeOnChain};\nuse starcoin_vm_types::sips::SIP;\nuse starcoin_vm_types::token::token_code::TokenCode;\nuse starcoin_vm_types::{\n move_resource::MoveResource, on_chain_config::OnChainConfig, state_view::StateView,\n};\nuse std::convert::TryFrom;\nuse std::sync::Arc;\n\n#[derive(Debug, Default, Eq, PartialEq, Clone, Serialize, Deserialize)]\npub struct StateProof {\n pub account_state: Option<Blob>,\n pub account_proof: SparseMerkleProof,\n pub account_state_proof: SparseMerkleProof,\n}\n\nimpl StateProof {\n pub fn new(\n account_state: Option<Vec<u8>>,\n account_proof: SparseMerkleProof,\n account_state_proof: SparseMerkleProof,\n ) -> Self {\n Self {\n account_state: account_state.map(Blob::from),\n account_proof,\n account_state_proof,\n }\n }\n \n \n pub fn verify(\n &self,\n expected_root_hash: HashValue,\n access_path: AccessPath,\n access_resource_blob: Option<&[u8]>,\n ) -> Result<()> {\n let (account_address, data_path) = access_path.into_inner();\n match self.account_state.as_ref() {\n None => {\n ensure!(\n access_resource_blob.is_none(),\n \"accessed resource should not exists\"\n );\n }\n Some(s) => {\n let account_state = AccountState::try_from(s.as_ref())?;\n match account_state.storage_roots()[data_path.data_type().storage_index()] {\n None => {\n ensure!(\n access_resource_blob.is_none(),\n \"accessed resource should not exists\"\n );\n }\n Some(expected_hash) => {\n let blob = access_resource_blob.map(|data| Blob::from(data.to_vec()));\n self.account_state_proof.verify(\n expected_hash,\n data_path.key_hash(),\n blob.as_ref(),\n )?;\n }\n }\n }\n }\n self.account_proof.verify(\n expected_root_hash,\n account_address.key_hash(),\n self.account_state.as_ref(),\n )\n }\n}\n\n#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize)]\npub struct StateWithProof {\n pub state: Option<Vec<u8>>,\n pub proof: StateProof,\n}\n\nimpl StateWithProof {\n pub fn new(state: Option<Vec<u8>>, proof: StateProof) -> Self {\n Self { state, proof }\n }\n\n pub fn get_state(&self) -> &Option<Vec<u8>> {\n &self.state\n }\n}\n\npub trait ChainStateReader: StateView {\n fn get_with_proof(&self, access_path: &AccessPath) -> Result<StateWithProof>;\n\n \n fn get_account_state(&self, address: &AccountAddress) -> Result<Option<AccountState>>;\n\n \n fn get_account_state_set(&self, address: &AccountAddress) -> Result<Option<AccountStateSet>>;\n\n fn exist_account(&self, address: &AccountAddress) -> Result<bool> {\n self.get_account_state(address).map(|state| state.is_some())\n }\n\n \n fn state_root(&self) -> HashValue;\n\n fn dump(&self) -> Result<ChainStateSet>;\n}\n\npub trait ChainStateWriter {\n \n fn set(&self, access_path: &AccessPath, value: Vec<u8>) -> Result<()>;\n\n \n fn remove(&self, access_path: &AccessPath) -> Result<()>;\n \n fn apply(&self, state_set: ChainStateSet) -> Result<()>;\n\n \n fn apply_write_set(&self, write_set: WriteSet) -> Result<()>;\n\n fn commit(&self) -> Result<HashValue>;\n\n fn flush(&self) -> Result<()>;\n}\n\npub trait IntoSuper<Super: ?Sized> {\n fn as_super(&self) -> &Super;\n fn as_super_mut(&mut self) -> &mut Super;\n fn into_super(self: Box<Self>) -> Box<Super>;\n fn into_super_arc(self: Arc<Self>) -> Arc<Super>;\n}\n\npub trait ChainState:\n ChainStateReader\n + ChainStateWriter\n + StateView\n + IntoSuper<dyn StateView>\n + IntoSuper<dyn ChainStateReader>\n + IntoSuper<dyn ChainStateWriter>\n{\n}\n\nimpl<'a, T: 'a + ChainStateReader> IntoSuper<dyn ChainStateReader + 'a> for T {\n fn as_super(&self) -> &(dyn ChainStateReader + 'a) {\n self\n }\n fn as_super_mut(&mut self) -> &mut (dyn ChainStateReader + 'a) {\n self\n }\n fn into_super(self: Box<Self>) -> Box<dyn ChainStateReader + 'a> {\n self\n }\n fn into_super_arc(self: Arc<Self>) -> Arc<dyn ChainStateReader + 'a> {\n self\n }\n}\n\nimpl<'a, T: 'a + ChainStateWriter> IntoSuper<dyn ChainStateWriter + 'a> for T {\n fn as_super(&self) -> &(dyn ChainStateWriter + 'a) {\n self\n }\n fn as_super_mut(&mut self) -> &mut (dyn ChainStateWriter + 'a) {\n self\n }\n fn into_super(self: Box<Self>) -> Box<dyn ChainStateWriter + 'a> {\n self\n }\n fn into_super_arc(self: Arc<Self>) -> Arc<dyn ChainStateWriter + 'a> {\n self\n }\n}\n\nimpl<'a, T: 'a + StateView> IntoSuper<dyn StateView + 'a> for T {\n fn as_super(&self) -> &(dyn StateView + 'a) {\n self\n }\n fn as_super_mut(&mut self) -> &mut (dyn StateView + 'a) {\n self\n }\n fn into_super(self: Box<Self>) -> Box<dyn StateView + 'a> {\n self\n }\n fn into_super_arc(self: Arc<Self>) -> Arc<dyn StateView + 'a> {\n self\n }\n}\n\nimpl<T: ?Sized> StateReaderExt for T where T: ChainStateReader {}\n\npub trait StateReaderExt: ChainStateReader {\n \n fn get_account_resource(&self, address: AccountAddress) -> Result<Option<AccountResource>> {\n self.get_resource::<AccountResource>(address)\n }\n\n \n fn get_resource<R>(&self, address: AccountAddress) -> Result<Option<R>>\n where\n R: MoveResource + DeserializeOwned,\n {\n let access_path = AccessPath::new(address, R::resource_path());\n let r = self.get(&access_path).and_then(|state| match state {\n Some(state) => Ok(Some(bcs_ext::from_bytes::<R>(state.as_slice())?)),\n None => Ok(None),\n })?;\n Ok(r)\n }\n\n fn get_sequence_number(&self, address: AccountAddress) -> Result<u64> {\n self.get_account_resource(address)?\n .map(|resource| resource.sequence_number())\n .ok_or_else(|| format_err!(\"Can not find account by address:{}\", address))\n }\n\n fn get_on_chain_config<C>(&self) -> Result<Option<C>>\n where\n C: OnChainConfig,\n Self: Sized,\n {\n C::fetch_config(self)\n }\n\n fn get_balance(&self, address: AccountAddress) -> Result<Option<u128>> {\n self.get_balance_by_token_code(address, STC_TOKEN_CODE.clone())\n }\n\n \n fn get_balance_by_type(\n &self,\n address: AccountAddress,\n type_tag: TypeTag,\n ) -> Result<Option<u128>> {\n Ok(self\n .get(&AccessPath::new(\n address,\n BalanceResource::access_path_for(type_tag),\n ))\n .and_then(|bytes| match bytes {\n Some(bytes) => Ok(Some(bcs_ext::from_bytes::<BalanceResource>(\n bytes.as_slice(),\n )?)),\n None => Ok(None),\n })?\n .map(|resource| resource.token()))\n }\n\n fn get_balance_by_token_code(\n &self,\n address: AccountAddress,\n token_code: TokenCode,\n ) -> Result<Option<u128>> {\n self.get_balance_by_type(address, token_code.into())\n }\n\n fn get_epoch(&self) -> Result<Epoch> {\n self.get_resource::<Epoch>(genesis_address())?\n .ok_or_else(|| format_err!(\"Epoch is none.\"))\n }\n\n fn get_epoch_info(&self) -> Result<EpochInfo> {\n let epoch = self\n .get_resource::<Epoch>(genesis_address())?\n .ok_or_else(|| format_err!(\"Epoch is none.\"))?;\n\n let epoch_data = self\n .get_resource::<EpochData>(genesis_address())?\n .ok_or_else(|| format_err!(\"Epoch is none.\"))?;\n\n Ok(EpochInfo::new(epoch, epoch_data))\n }\n\n fn get_timestamp(&self) -> Result<GlobalTimeOnChain> {\n self.get_resource(genesis_address())?\n .ok_or_else(|| format_err!(\"Timestamp resource should exist.\"))\n }\n\n fn get_chain_id(&self) -> Result<ChainId> {\n self.get_resource::<ChainId>(genesis_address())?\n .ok_or_else(|| format_err!(\"ChainId resource should exist at genesis address. \"))\n }\n\n fn get_code(&self, module_id: ModuleId) -> Result<Option<Vec<u8>>> {\n self.get(&AccessPath::from(&module_id))\n }\n\n \n fn is_activated(&self, sip: SIP) -> Result<bool> {\n self.get_code(sip.module_id()).map(|code| code.is_some())\n }\n}\n\npub struct AccountStateReader<'a, Reader> {\n \n reader: &'a Reader,\n}\n\nimpl<'a, Reader> AccountStateReader<'a, Reader>\nwhere\n Reader: ChainStateReader,\n{\n pub fn new(reader: &'a Reader) -> Self {\n Self { reader }\n }\n\n \n pub fn get_account_resource(\n &self,\n address: &AccountAddress,\n ) -> Result<Option<AccountResource>> {\n self.reader.get_account_resource(*address)\n }\n\n \n pub fn get_resource<R>(&self, address: AccountAddress) -> Result<Option<R>>\n where\n R: MoveResource + DeserializeOwned,\n {\n self.reader.get_resource(address)\n }\n\n pub fn get_sequence_number(&self, address: AccountAddress) -> Result<u64> {\n self.reader.get_sequence_number(address)\n }\n\n pub fn get_on_chain_config<C>(&self) -> Result<Option<C>>\n where\n C: OnChainConfig,\n {\n self.reader.get_on_chain_config()\n }\n\n pub fn get_balance(&self, address: &AccountAddress) -> Result<Option<u128>> {\n self.reader.get_balance(*address)\n }\n\n \n pub fn get_balance_by_type(\n &self,\n address: &AccountAddress,\n type_tag: TypeTag,\n ) -> Result<Option<u128>> {\n self.reader.get_balance_by_type(*address, type_tag)\n }\n\n pub fn get_balance_by_token_code(\n &self,\n address: &AccountAddress,\n token_code: TokenCode,\n ) -> Result<Option<u128>> {\n self.reader.get_balance_by_token_code(*address, token_code)\n }\n\n pub fn get_epoch(&self) -> Result<Epoch> {\n self.reader.get_epoch()\n }\n\n pub fn get_epoch_info(&self) -> Result<EpochInfo> {\n self.reader.get_epoch_info()\n }\n\n pub fn get_timestamp(&self) -> Result<GlobalTimeOnChain> {\n self.reader.get_timestamp()\n }\n\n pub fn get_chain_id(&self) -> Result<ChainId> {\n self.reader.get_chain_id()\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse anyhow::{ensure, format_err, Result};\nuse merkle_tree::{blob::Blob, proof::SparseMerkleProof, RawKey};\nuse serde::de::DeserializeOwned;\nuse serde::{Deserialize, Serialize};\nuse starcoin_crypto::HashValue;\nuse starcoin_types::state_set::AccountStateSet;\nuse starcoin_types::write_set::WriteSet;\nuse starcoin_types::{\n access_path::AccessPath,\n account_address::AccountAddress,\n account_config::{AccountResource, BalanceResource},\n account_state::AccountState,\n language_storage::TypeTag,\n state_set::ChainStateSet,\n};\nuse starcoin_vm_types::account_config::{genesis_address, STC_TOKEN_CODE};\nuse starcoin_vm_types::genesis_config::ChainId;\nuse starcoin_vm_types::language_storage::ModuleId;\nuse starcoin_vm_types::on_chain_resource::{Epoch, EpochData, EpochInfo, GlobalTimeOnChain};\nuse starcoin_vm_types::sips::SIP;\nuse starcoin_vm_types::token::token_code::TokenCode;\nuse starcoin_vm_types::{\n move_resource::MoveResource, on_chain_config::OnChainConfig, state_view::StateView,\n};\nuse std::convert::TryFrom;\nuse std::sync::Arc;\n\n#[derive(Debug, Default, Eq, PartialEq, Clone, Serialize, Deserialize)]\npub struct StateProof {\n pub account_state: Option<Blob>,\n pub account_proof: SparseMerkleProof,\n pub account_state_proof: SparseMerkleProof,\n}\n\nimpl StateProof {\n pub fn new(\n account_state: Option<Vec<u8>>,\n account_proof: SparseMerkleProof,\n account_state_proof: SparseMerkleProof,\n ) -> Self {\n Self {\n account_state: account_state.map(Blob::from),\n account_proof,\n account_state_proof,\n }\n }\n \n \n pub fn verify(\n &self,\n expected_root_hash: HashValue,\n access_path: AccessPath,\n access_resource_blob: Option<&[u8]>,\n ) -> Result<()> {\n let (account_address, data_path) = access_path.into_inner();\n match self.account_state.as_ref() {\n None => {\n ensure!(\n access_resource_blob.is_none(),\n \"accessed resource should not exists\"\n );\n }\n Some(s) => {\n let account_state = AccountState::try_from(s.as_ref())?;\n match account_state.storage_roots()[data_path.data_type().storage_index()] {\n None => {\n ensure!(\n access_resource_blob.is_none(),\n \"accessed resource should not exists\"\n );\n }\n Some(expected_hash) => {\n let blob = access_resource_blob.map(|data| Blob::from(data.to_vec()));\n self.account_state_proof.verify(\n expected_hash,\n data_path.key_hash(),\n blob.as_ref(),\n )?;\n }\n }\n }\n }\n self.account_proof.verify(\n expected_root_hash,\n account_address.key_hash(),\n self.account_state.as_ref(),\n )\n }\n}\n\n#[derive(Debug, Eq, PartialEq, Clone, Serialize, Deserialize)]\npub struct StateWithProof {\n pub state: Option<Vec<u8>>,\n pub proof: StateProof,\n}\n\nimpl StateWithProof {\n pub fn new(state: Option<Vec<u8>>, proof: StateProof) -> Self {\n Self { state, proof }\n }\n\n pub fn get_state(&self) -> &Option<Vec<u8>> {\n &self.state\n }\n}\n\npub trait ChainStateReader: StateView {\n fn get_with_proof(&self, access_path: &AccessPath) -> Result<StateWithProof>;\n\n \n fn get_account_state(&self, address: &AccountAddress) -> Result<Option<AccountState>>;\n\n \n fn get_account_state_set(&self, address: &AccountAddress) -> Result<Option<AccountStateSet>>;\n\n fn exist_account(&self, address: &AccountAddress) -> Result<bool> {\n self.get_account_state(address).map(|state| state.is_some())\n }\n\n \n fn state_root(&self) -> HashValue;\n\n fn dump(&self) -> Result<ChainStateSet>;\n}\n\npub trait ChainStateWriter {\n \n fn set(&self, access_path: &AccessPath, value: Vec<u8>) -> Result<()>;\n\n \n fn remove(&self, access_path: &AccessPath) -> Result<()>;\n \n fn apply(&self, state_set: ChainStateSet) -> Result<()>;\n\n \n fn apply_write_set(&self, write_set: WriteSet) -> Result<()>;\n\n fn commit(&self) -> Result<HashValue>;\n\n fn flush(&self) -> Result<()>;\n}\n\npub trait IntoSuper<Super: ?Sized> {\n fn as_super(&self) -> &Super;\n fn as_super_mut(&mut self) -> &mut Super;\n fn into_super(self: Box<Self>) -> Box<Super>;\n fn into_super_arc(self: Arc<Self>) -> Arc<Super>;\n}\n\npub trait ChainState:\n ChainStateReader\n + ChainStateWriter\n + StateView\n + IntoSuper<dyn StateView>\n + IntoSuper<dyn ChainStateReader>\n + IntoSuper<dyn ChainStateWriter>\n{\n}\n\nimpl<'a, T: 'a + ChainStateReader> IntoSuper<dyn ChainStateReader + 'a> for T {\n fn as_super(&self) -> &(dyn ChainStateReader + 'a) {\n self\n }\n fn as_super_mut(&mut self) -> &mut (dyn ChainStateReader + 'a) {\n self\n }\n fn into_super(self: Box<Self>) -> Box<dyn ChainStateReader + 'a> {\n self\n }\n fn into_super_arc(self: Arc<Self>) -> Arc<dyn ChainStateReader + 'a> {\n self\n }\n}\n\nimpl<'a, T: 'a + ChainStateWriter> IntoSuper<dyn ChainStateWriter + 'a> for T {\n fn as_super(&self) -> &(dyn ChainStateWriter + 'a) {\n self\n }\n fn as_super_mut(&mut self) -> &mut (dyn ChainStateWriter + 'a) {\n self\n }\n fn into_super(self: Box<Self>) -> Box<dyn ChainStateWriter + 'a> {\n self\n }\n fn into_super_arc(self: Arc<Self>) -> Arc<dyn ChainStateWriter + 'a> {\n self\n }\n}\n\nimpl<'a, T: 'a + StateView> IntoSuper<dyn StateView + 'a> for T {\n fn as_super(&self) -> &(dyn StateView + 'a) {\n self\n }\n fn as_super_mut(&mut self) -> &mut (dyn StateView + 'a) {\n self\n }\n fn into_super(self: Box<Self>) -> Box<dyn StateView + 'a> {\n self\n }\n fn into_super_arc(self: Arc<Self>) -> Arc<dyn StateView + 'a> {\n self\n }\n}\n\nimpl<T: ?Sized> StateReaderExt for T where T: ChainStateReader {}\n\npub trait StateReaderExt: ChainStateReader {\n \n fn get_account_resource(&self, address: AccountAddress) -> Result<Option<AccountResource>> {\n self.get_resource::<AccountResource>(address)\n }\n\n \n fn get_resource<R>(&self, address: AccountAddress) -> Result<Option<R>>\n where\n R: MoveResource + DeserializeOwned,\n {\n let access_path = AccessPath::new(address, R::resource_path());\n let r = self.get(&access_path).and_then(|state| match state {\n Some(state) => Ok(Some(bcs_ext::from_bytes::<R>(state.as_slice())?)),\n None => Ok(None),\n })?;\n Ok(r)\n }\n\n fn get_sequence_number(&self, address: AccountAddress) -> Result<u64> {\n self.get_account_resource(address)?\n .map(|resource| resource.sequence_number())\n .ok_or_else(|| format_err!(\"Can not find account by address:{}\", address))\n }\n\n fn get_on_chain_config<C>(&self) -> Result<Option<C>>\n where\n C: OnChainConfig,\n Self: Sized,\n {\n C::fetch_config(self)\n }\n\n fn get_balance(&self, address: AccountAddress) -> Result<Option<u128>> {\n self.get_balance_by_token_code(address, STC_TOKEN_CODE.clone())\n }\n\n \n fn get_balance_by_type(\n &self,\n address: AccountAddress,\n type_tag: TypeTag,\n ) -> Result<Option<u128>> {\n Ok(self\n .get(&AccessPath::new(\n address,\n BalanceResource::access_path_for(type_tag),\n ))\n .and_then(|bytes| match bytes {\n Some(bytes) => Ok(Some(bcs_ext::from_bytes::<BalanceResource>(\n bytes.as_slice(),\n )?)),\n None => Ok(None),\n })?\n .map(|resource| resource.token()))\n }\n\n fn get_balance_by_token_code(\n &self,\n address: AccountAddress,\n token_code: TokenCode,\n ) -> Result<Option<u128>> {\n self.get_balance_by_type(address, token_code.into())\n }\n\n fn get_epoch(&self) -> Result<Epoch> {\n self.get_resource::<Epoch>(genesis_address())?\n .ok_or_else(|| format_err!(\"Epoch is none.\"))\n }\n\n fn get_epoch_info(&self) -> Result<EpochInfo> {\n let epoch = self\n .get_resource::<Epoch>(genesis_address())?\n .ok_or_else(|| format_err!(\"Epoch is none.\"))?;\n\n let epoch_data = self\n .get_resource::<EpochData>(genesis_address())?\n .ok_or_else(|| format_err!(\"Epoch is none.\"))?;\n\n Ok(EpochInfo::new(epoch, epoch_data))\n }\n\n fn get_timestamp(&self) -> Result<GlobalTimeOnChain> {\n self.get_resource(genesis_address())?\n .ok_or_else(|| format_err!(\"Timestamp resource should exist.\"))\n }\n\n fn get_chain_id(&self) -> Result<ChainId> {\n self.get_resource::<ChainId>(genesis_address())?\n .ok_or_else(|| format_err!(\"ChainId resource should exist at genesis address. \"))\n }\n\n fn get_code(&self, module_id: ModuleId) -> Result<Option<Vec<u8>>> {\n self.get(&AccessPath::from(&module_id))\n }\n\n \n fn is_activated(&self, sip: SIP) -> Result<bool> {\n self.get_code(sip.module_id()).map(|code| code.is_some())\n }\n}\n\npub struct AccountStateReader<'a, Reader> {\n \n reader: &'a Reader,\n}\n\nimpl<'a, Reader> AccountStateReader<'a, Reader>\nwhere\n Reader: ChainStateReader,\n{\n pub fn new(reader: &'a Reader) -> Self {\n Self { reader }\n }\n\n \n pub fn get_account_resource(\n &self,\n address: &AccountAddress,\n ) -> Result<Option<AccountResource>> {\n self.reader.get_account_resource(*address)\n }\n\n \n pub fn get_resource<R>(&self, address: AccountAddress) -> Result<Option<R>>\n where\n R: MoveResource + DeserializeOwned,\n {\n self.reader.get_resource(address)\n }\n\n pub fn get_sequence_number(&self, address: AccountAddress) -> Result<u64> {\n self.reader.get_sequence_number(address)\n }\n\n "},"suffix":{"kind":"string","value":"\n\n pub fn get_balance(&self, address: &AccountAddress) -> Result<Option<u128>> {\n self.reader.get_balance(*address)\n }\n\n \n pub fn get_balance_by_type(\n &self,\n address: &AccountAddress,\n type_tag: TypeTag,\n ) -> Result<Option<u128>> {\n self.reader.get_balance_by_type(*address, type_tag)\n }\n\n pub fn get_balance_by_token_code(\n &self,\n address: &AccountAddress,\n token_code: TokenCode,\n ) -> Result<Option<u128>> {\n self.reader.get_balance_by_token_code(*address, token_code)\n }\n\n pub fn get_epoch(&self) -> Result<Epoch> {\n self.reader.get_epoch()\n }\n\n pub fn get_epoch_info(&self) -> Result<EpochInfo> {\n self.reader.get_epoch_info()\n }\n\n pub fn get_timestamp(&self) -> Result<GlobalTimeOnChain> {\n self.reader.get_timestamp()\n }\n\n pub fn get_chain_id(&self) -> Result<ChainId> {\n self.reader.get_chain_id()\n }\n}\n"},"middle":{"kind":"string","value":"pub fn get_on_chain_config<C>(&self) -> Result<Option<C>>\n where\n C: OnChainConfig,\n {\n self.reader.get_on_chain_config()\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub fn access_path_for_module_upgrade_strategy(address: AccountAddress) -> AccessPath {\n\n AccessPath::resource_access_path(address, ModuleUpgradeStrategy::struct_tag())\n\n}\n\n\n\n#[derive(Debug, Serialize, Deserialize)]\n\npub struct TwoPhaseUpgradeV2Resource {\n\n config: TwoPhaseUpgradeConfigResource,\n\n plan: Option<UpgradePlanV2Resource>,\n\n version_cap: ModifyConfigCapabilityResource,\n\n upgrade_event: EventHandle,\n\n}\n\nimpl TwoPhaseUpgradeV2Resource {\n\n pub fn enforced(&self) -> bool {\n\n match &self.plan {\n\n Some(plan) => plan.enforced,\n\n None => false,\n\n }\n\n }\n\n}\n\nimpl MoveResource for TwoPhaseUpgradeV2Resource {\n\n const MODULE_NAME: &'static str = \"PackageTxnManager\";\n\n const STRUCT_NAME: &'static str = \"TwoPhaseUpgradeV2\";\n\n}\n\n\n","file_path":"vm/types/src/account_config/resources/module_upgrade_strategy.rs","rank":0,"score":417676.32461471495},{"content":"pub fn access_path_for_two_phase_upgrade_v2(address: AccountAddress) -> AccessPath {\n\n AccessPath::resource_access_path(address, TwoPhaseUpgradeV2Resource::struct_tag())\n\n}\n\n\n\n#[derive(Debug, Serialize, Deserialize)]\n\npub struct TwoPhaseUpgradeConfigResource {\n\n min_time_limit: u64,\n\n}\n\nimpl MoveResource for TwoPhaseUpgradeConfigResource {\n\n const MODULE_NAME: &'static str = \"PackageTxnManager\";\n\n const STRUCT_NAME: &'static str = \"TwoPhaseUpgradeConfig\";\n\n}\n\n\n\n#[derive(Debug, Serialize, Deserialize)]\n\npub struct UpgradePlanV2Resource {\n\n package_hash: Vec<u8>,\n\n active_after_time: u64,\n\n version: u64,\n\n enforced: bool,\n\n}\n\nimpl MoveResource for UpgradePlanV2Resource {\n\n const MODULE_NAME: &'static str = \"PackageTxnManager\";\n\n const STRUCT_NAME: &'static str = \"UpgradePlanV2\";\n\n}\n\n\n","file_path":"vm/types/src/account_config/resources/module_upgrade_strategy.rs","rank":1,"score":413162.00266730215},{"content":"pub fn get_balance(address: AccountAddress, chain_state: &dyn ChainState) -> u128 {\n\n chain_state\n\n .get_balance(address)\n\n .expect(\"read balance resource should ok\")\n\n .unwrap_or_default()\n\n}\n\n\n","file_path":"test-helper/src/executor.rs","rank":2,"score":394306.63406488404},{"content":"pub fn genesis_address() -> AccountAddress {\n\n CORE_CODE_ADDRESS\n\n}\n","file_path":"vm/types/src/account_config/constants/addresses.rs","rank":4,"score":363150.7785622754},{"content":"#[test]\n\npub fn test_state_proof() -> Result<()> {\n\n let s = MockStateNodeStore::new();\n\n let state = StateTree::new(Arc::new(s), None);\n\n assert_eq!(state.root_hash(), *SPARSE_MERKLE_PLACEHOLDER_HASH);\n\n\n\n let hash_value = HashValue::random().into();\n\n\n\n let account1 = update_nibble(&hash_value, 0, 1);\n\n // re-update to make sure account2 never equal to account1\n\n let account1 = update_nibble(&account1, 2, 1);\n\n\n\n let account2 = update_nibble(&account1, 2, 2);\n\n for (k, v) in vec![(account1, vec![0, 0, 0]), (account2, vec![1, 1, 1])] {\n\n state.put(k, v);\n\n }\n\n let (value, _) = state.get_with_proof(&account1)?;\n\n assert!(value.is_none());\n\n let new_root_hash = state.commit()?;\n\n let (value, proof) = state.get_with_proof(&account1)?;\n\n assert!(value.is_some());\n","file_path":"state/state-tree/src/state_tree_test.rs","rank":5,"score":352208.4928017484},{"content":"pub fn get_sequence_number(addr: AccountAddress, chain_state: &dyn ChainState) -> u64 {\n\n chain_state\n\n .get_account_resource(addr)\n\n .expect(\"read account state should ok\")\n\n .map(|res| res.sequence_number())\n\n .unwrap_or_default()\n\n}\n\n\n","file_path":"test-helper/src/executor.rs","rank":6,"score":349142.2813541572},{"content":"#[test]\n\npub fn test_put_blob() -> Result<()> {\n\n let s = MockStateNodeStore::new();\n\n let state = StateTree::<HashValueKey>::new(Arc::new(s), None);\n\n assert_eq!(state.root_hash(), *SPARSE_MERKLE_PLACEHOLDER_HASH);\n\n\n\n let hash_value = HashValue::random().into();\n\n\n\n let account1 = update_nibble(&hash_value, 0, 1);\n\n let account1 = update_nibble(&account1, 2, 2);\n\n state.put(account1, vec![0, 0, 0]);\n\n\n\n assert_eq!(state.get(&account1)?, Some(vec![0, 0, 0]));\n\n assert_eq!(state.get(&update_nibble(&hash_value, 0, 8))?, None);\n\n\n\n let new_root_hash = state.commit()?;\n\n assert_eq!(state.root_hash(), new_root_hash);\n\n assert_eq!(state.get(&account1)?, Some(vec![0, 0, 0]));\n\n assert_eq!(state.get(&update_nibble(&hash_value, 0, 8))?, None);\n\n\n\n let (root, updates) = state.change_sets();\n","file_path":"state/state-tree/src/state_tree_test.rs","rank":7,"score":347816.01634253626},{"content":"/// Get the AccessPath to a resource stored under `address` with type name `tag`\n\nfn create_access_path(address: AccountAddress, tag: StructTag) -> AccessPath {\n\n AccessPath::resource_access_path(address, tag)\n\n}\n","file_path":"vm/vm-runtime/src/lib.rs","rank":8,"score":344026.3415165982},{"content":"pub fn deserialize_from_string<'de, D, R>(d: D) -> std::result::Result<R, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n R: FromStr + Deserialize<'de>,\n\n R::Err: Sized + std::error::Error,\n\n{\n\n if d.is_human_readable() {\n\n let s = <String>::deserialize(d)?;\n\n R::from_str(&s).map_err(D::Error::custom)\n\n } else {\n\n R::deserialize(d)\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests;\n","file_path":"commons/serde-helpers/src/lib.rs","rank":10,"score":319539.502068173},{"content":"pub fn association_address() -> AccountAddress {\n\n AccountAddress::from_hex_literal(\"0xA550C18\")\n\n .expect(\"Parsing valid hex literal should always succeed\")\n\n}\n","file_path":"vm/types/src/account_config/constants/addresses.rs","rank":11,"score":318304.4707669556},{"content":"#[stest::test]\n\nfn test_eth_state_proof_verify() -> Result<()> {\n\n let (chain_state, net) = prepare_genesis();\n\n // deploy the module\n\n {\n\n let source = include_str!(\"../../modules/EthStateVerifier.move\");\n\n let modules = compile_modules_with_address(association_address(), source);\n\n\n\n let package = Package::new(modules, None)?;\n\n association_execute(&net, &chain_state, TransactionPayload::Package(package))?;\n\n }\n\n\n\n // load the example proof\n\n let account_proof: EthAccount = {\n\n let proofs = include_str!(\"proof.json\");\n\n let value: serde_json::Value = serde_json::from_str(proofs)?;\n\n serde_json::from_value(value)?\n\n };\n\n\n\n // verify account proof\n\n {\n","file_path":"contrib-contracts/src/eth_state_verifier_test/mod.rs","rank":12,"score":317759.4803911141},{"content":"#[ignore]\n\n#[test]\n\npub fn test_wallet_account() -> Result<()> {\n\n use bcs_ext::BCSCodec;\n\n use core::convert::{From, TryFrom};\n\n use starcoin_crypto::ed25519::{Ed25519PrivateKey, Ed25519PublicKey, Ed25519Signature};\n\n use starcoin_crypto::{hash::CryptoHash, HashValue};\n\n use starcoin_types::transaction::authenticator::AuthenticationKey;\n\n\n\n let bytes = hex::decode(\"2c78c6fd8829de80451cda02310250b27307360ddc972d614fa0c8462ae41b3e\")?;\n\n let private_key = Ed25519PrivateKey::try_from(&bytes[..])?;\n\n let public_key = Ed25519PublicKey::from(&private_key);\n\n\n\n let message = [1, 2, 3, 4];\n\n // need add fuzzing features on libra-crypto for this.\n\n let result = <Ed25519PrivateKey as SigningKey>::sign_arbitrary_message(&private_key, &message);\n\n\n\n let address = starcoin_types::account_address::from_public_key(&public_key);\n\n let hash_value = HashValue::sha3_256_of(&public_key.to_bytes());\n\n let key = AuthenticationKey::new(*HashValue::sha3_256_of(&public_key.to_bytes()).as_ref());\n\n\n\n let sign_bytes = vec![\n","file_path":"account/src/account_test.rs","rank":14,"score":315953.36221747356},{"content":"#[test]\n\npub fn test_import_account() -> Result<()> {\n\n let tempdir = tempfile::tempdir()?;\n\n let storage = AccountStorage::create_from_path(tempdir.path(), RocksdbConfig::default())?;\n\n let manager = AccountManager::new(storage)?;\n\n\n\n // should success\n\n let wallet = manager.create_account(\"hello\")?;\n\n let private_key = super::account_manager::gen_private_key();\n\n let result = manager.import_account(*wallet.address(), private_key.to_bytes().to_vec(), \"abc\");\n\n assert!(result.is_err());\n\n\n\n assert!(\n\n matches!(result.err().unwrap(), AccountError::AccountAlreadyExist(addr) if addr == *wallet.address())\n\n );\n\n\n\n let normal_address = AccountAddress::random();\n\n let _account =\n\n manager.import_account(normal_address, private_key.to_bytes().to_vec(), \"abc\")?;\n\n assert_eq!(manager.list_account_infos()?.len(), 2);\n\n Ok(())\n\n}\n\n\n","file_path":"account/src/account_test.rs","rank":15,"score":315953.36221747356},{"content":"pub trait IntoSuper<Super: ?Sized> {\n\n fn as_super(&self) -> &Super;\n\n fn as_super_mut(&mut self) -> &mut Super;\n\n fn into_super(self: Box<Self>) -> Box<Super>;\n\n fn into_super_arc(self: Arc<Self>) -> Arc<Super>;\n\n}\n\n\n\nimpl<'a, T: 'a + StateNodeStore> IntoSuper<dyn StateNodeStore + 'a> for T {\n\n fn as_super(&self) -> &(dyn StateNodeStore + 'a) {\n\n self\n\n }\n\n fn as_super_mut(&mut self) -> &mut (dyn StateNodeStore + 'a) {\n\n self\n\n }\n\n fn into_super(self: Box<Self>) -> Box<dyn StateNodeStore + 'a> {\n\n self\n\n }\n\n fn into_super_arc(self: Arc<Self>) -> Arc<dyn StateNodeStore + 'a> {\n\n self\n\n }\n","file_path":"storage/src/lib.rs","rank":16,"score":315648.7462130314},{"content":"pub fn core_code_address() -> AccountAddress {\n\n CORE_CODE_ADDRESS\n\n}\n\n\n","file_path":"vm/types/src/account_config/constants/addresses.rs","rank":17,"score":314392.43545395},{"content":"/// Get the target of next pow work\n\npub fn get_next_work_required(chain: &dyn ChainReader) -> Result<U256> {\n\n let epoch = chain.epoch();\n\n let current_header = chain.current_header();\n\n if current_header.number() <= 1 {\n\n return Ok(difficult_to_target(current_header.difficulty()));\n\n }\n\n let start_window_num = if current_header.number() < epoch.block_difficulty_window() {\n\n 0\n\n } else {\n\n current_header\n\n .number()\n\n .saturating_sub(epoch.block_difficulty_window())\n\n .checked_add(1)\n\n .ok_or_else(|| format_err!(\"block number overflow\"))?\n\n };\n\n let blocks = (start_window_num\n\n ..current_header\n\n .number()\n\n .checked_add(1)\n\n .ok_or_else(|| format_err!(\"block number overflow\"))?)\n","file_path":"consensus/src/difficulty.rs","rank":18,"score":314186.43476823147},{"content":"#[test]\n\npub fn test_wallet() -> Result<()> {\n\n let tempdir = tempfile::tempdir()?;\n\n let storage = AccountStorage::create_from_path(tempdir.path(), RocksdbConfig::default())?;\n\n let manager = AccountManager::new(storage.clone())?;\n\n\n\n // should success\n\n let wallet = manager.create_account(\"hello\")?;\n\n\n\n let wallet_address = wallet.address();\n\n\n\n // test reload\n\n let loaded_wallet = Account::load(*wallet_address, \"hello\", storage)?;\n\n assert!(loaded_wallet.is_some());\n\n let reloaded_wallet = loaded_wallet.unwrap();\n\n assert_eq!(\n\n reloaded_wallet.private_key().to_bytes(),\n\n wallet.private_key().to_bytes()\n\n );\n\n\n\n // test default wallet\n","file_path":"account/src/account_test.rs","rank":19,"score":314175.16201696126},{"content":"fn read_two_phase_upgrade_v2_resource(state_view: &dyn StateView) -> Result<bool> {\n\n let two_phase_upgrade_v2_path = access_path_for_two_phase_upgrade_v2(genesis_address());\n\n match state_view.get(&two_phase_upgrade_v2_path)? {\n\n Some(data) => Ok(bcs_ext::from_bytes::<TwoPhaseUpgradeV2Resource>(&data)?.enforced()),\n\n _ => Err(format_err!(\"read two phase upgrade resource fail.\")),\n\n }\n\n}\n\n\n","file_path":"executor/src/stdlib_test/module_upgrade_test.rs","rank":20,"score":311635.0169082418},{"content":"#[test]\n\npub fn test_wallet_unlock() -> Result<()> {\n\n let tempdir = tempfile::tempdir()?;\n\n let storage = AccountStorage::create_from_path(tempdir.path(), RocksdbConfig::default())?;\n\n let manager = AccountManager::new(storage)?;\n\n\n\n let wallet = manager.create_account(\"hello\")?;\n\n\n\n let unlock_result = manager.unlock_account(*wallet.address(), \"hell0\", Duration::from_secs(1));\n\n assert!(unlock_result.is_err());\n\n manager.unlock_account(*wallet.address(), \"hello\", Duration::from_secs(1))?;\n\n let fake_txn = RawUserTransaction::new_with_default_gas_token(\n\n *wallet.address(),\n\n 1,\n\n TransactionPayload::Script(Script::new(vec![], vec![], vec![])),\n\n 1000,\n\n 1,\n\n 100000,\n\n ChainId::new(1),\n\n );\n\n let _signed = manager.sign_txn(*wallet.address(), fake_txn)?;\n","file_path":"account/src/account_test.rs","rank":21,"score":309129.78826249356},{"content":"pub fn deserialize_from_string_opt<'de, D, R>(d: D) -> std::result::Result<Option<R>, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n R: FromStr + Deserialize<'de>,\n\n R::Err: Sized + std::error::Error,\n\n{\n\n if d.is_human_readable() {\n\n let s = <Option<String>>::deserialize(d)?;\n\n s.map(|s| R::from_str(&s).map_err(D::Error::custom))\n\n .transpose()\n\n } else {\n\n Option::<R>::deserialize(d)\n\n }\n\n}\n\n\n","file_path":"commons/serde-helpers/src/lib.rs","rank":22,"score":307813.28584576526},{"content":"#[test]\n\npub fn test_state_commit() -> Result<()> {\n\n let s = MockStateNodeStore::new();\n\n let state = StateTree::new(Arc::new(s), None);\n\n assert_eq!(state.root_hash(), *SPARSE_MERKLE_PLACEHOLDER_HASH);\n\n\n\n let hash_value = HashValue::random().into();\n\n\n\n let account1 = update_nibble(&hash_value, 0, 1);\n\n let account1 = update_nibble(&account1, 2, 2);\n\n state.put(account1, vec![0, 0, 0]);\n\n let _new_root_hash = state.commit()?;\n\n\n\n let account3 = update_nibble(&account1, 2, 3);\n\n for (k, v) in vec![(account1, vec![1, 1, 0]), (account3, vec![0, 0, 0])] {\n\n state.put(k, v);\n\n }\n\n let new_root_hash = state.commit()?;\n\n\n\n state.flush()?;\n\n assert_eq!(state.root_hash(), new_root_hash);\n\n assert_eq!(state.get(&account1)?, Some(vec![1, 1, 0]));\n\n assert_eq!(state.get(&account3)?, Some(vec![0, 0, 0]));\n\n assert_eq!(state.get(&update_nibble(&account1, 2, 10))?, None);\n\n Ok(())\n\n}\n\n\n","file_path":"state/state-tree/src/state_tree_test.rs","rank":23,"score":307283.2099750214},{"content":"#[test]\n\npub fn test_state_dump() -> Result<()> {\n\n let s = MockStateNodeStore::new();\n\n let state = StateTree::new(Arc::new(s), None);\n\n let hash_value = HashValueKey(HashValue::random());\n\n let value = vec![1u8, 2u8];\n\n state.put(hash_value, value);\n\n state.commit()?;\n\n let state_set = state.dump()?;\n\n assert_eq!(1, state_set.len());\n\n Ok(())\n\n}\n\n\n","file_path":"state/state-tree/src/state_tree_test.rs","rank":24,"score":307283.2099750214},{"content":"pub fn encode(idx: u64, address: AccountAddress, amount: u128) -> anyhow::Result<Vec<u8>> {\n\n let mut index = bcs_ext::to_bytes(&idx)?;\n\n let mut address = bcs_ext::to_bytes(&address)?;\n\n let mut amount = bcs_ext::to_bytes(&amount)?;\n\n index.append(&mut address);\n\n index.append(&mut amount);\n\n Ok(index)\n\n}\n\n\n\npub struct Sha3Algorithm(Sha3);\n\n\n\nimpl Default for Sha3Algorithm {\n\n fn default() -> Self {\n\n Self(Sha3::sha3_256())\n\n }\n\n}\n\n\n\nimpl Hasher for Sha3Algorithm {\n\n #[inline]\n\n fn finish(&self) -> u64 {\n","file_path":"cmd/merkle-generator/src/lib.rs","rank":25,"score":305234.96420436946},{"content":"pub fn generate_server_module(rpc_trait: &mut ItemTrait) -> anyhow::Result<TokenStream> {\n\n let delegate_methods: Vec<TokenStream> = rpc_trait\n\n .items\n\n .iter()\n\n .filter_map(|trait_item| {\n\n if let syn::TraitItem::Method(method) = trait_item {\n\n Some(generate_to_delegate(method))\n\n } else {\n\n None\n\n }\n\n })\n\n .collect();\n\n let mut rpc_server_trait = rpc_trait.clone();\n\n let io_delegate_type = quote!(network_rpc_core::delegates::IoDelegate);\n\n let to_delegate_body = quote! {\n\n let mut del = #io_delegate_type::new(self.into());\n\n #(#delegate_methods)*\n\n del\n\n };\n\n let to_delegate_method: syn::TraitItemMethod = parse_quote! {\n","file_path":"network-rpc/derive/src/to_server.rs","rank":26,"score":304671.18195318675},{"content":"pub fn print_table(value: Value) -> Result<()> {\n\n if value.is_null() {\n\n return Ok(());\n\n }\n\n match value {\n\n Value::Array(values) => print_vec_table(values),\n\n value => print_value_table(value),\n\n }\n\n}\n\n\n","file_path":"commons/scmd/src/result.rs","rank":27,"score":303267.5785138615},{"content":"pub fn print_json(value: Value) -> Result<()> {\n\n let json = serde_json::to_string_pretty(&value)?;\n\n println!(\"{}\", json);\n\n Ok(())\n\n}\n\n\n","file_path":"commons/scmd/src/result.rs","rank":28,"score":303267.5785138615},{"content":"#[test]\n\npub fn test_repeat_commit() -> Result<()> {\n\n let s = MockStateNodeStore::new();\n\n let state = StateTree::new(Arc::new(s), None);\n\n let hash_value = HashValueKey(HashValue::random());\n\n let value = vec![1u8, 2u8];\n\n state.put(hash_value, value.clone());\n\n state.commit()?;\n\n\n\n let root_hash1 = state.root_hash();\n\n state.put(hash_value, value);\n\n state.commit()?;\n\n let root_hash2 = state.root_hash();\n\n assert_eq!(root_hash1, root_hash2);\n\n Ok(())\n\n}\n","file_path":"state/state-tree/src/state_tree_test.rs","rank":29,"score":302875.8623966829},{"content":"/// Helper function to deserialize versions from above encoding.\n\nfn deserialize_u64_varint<T>(reader: &mut T) -> Result<u64>\n\nwhere\n\n T: Read,\n\n{\n\n let mut num = 0u64;\n\n for i in 0..8 {\n\n let byte = reader.read_u8()?;\n\n let more = (byte & 0x80) != 0;\n\n num |= u64::from(byte & 0x7f) << (i * 7);\n\n if !more {\n\n return Ok(num);\n\n }\n\n }\n\n // Last byte is encoded as is.\n\n let byte = reader.read_u8()?;\n\n num |= u64::from(byte) << 56;\n\n Ok(num)\n\n}\n\n\n","file_path":"commons/forkable-jellyfish-merkle/src/node_type/mod.rs","rank":30,"score":301523.3785266625},{"content":"pub trait HashAccountAddress {\n\n fn hash(&self) -> HashValue;\n\n}\n\n\n\nimpl HashAccountAddress for AccountAddress {\n\n fn hash(&self) -> HashValue {\n\n let mut state = hasher::AccountAddressHasher::default();\n\n state.update(self.as_ref());\n\n state.finish()\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use hex::FromHex;\n\n\n\n #[test]\n\n fn address_hash() {\n\n let address: AccountAddress = \"ca843279e3427144cead5e4d5999a3d0\".parse().unwrap();\n","file_path":"vm/types/src/account_address.rs","rank":31,"score":299171.8851595842},{"content":"pub fn voting_period(state_view: &dyn StateView, token: TypeTag) -> u64 {\n\n let mut ret = execute_readonly_function(\n\n state_view,\n\n &ModuleId::new(genesis_address(), Identifier::new(\"Dao\").unwrap()),\n\n &Identifier::new(\"voting_period\").unwrap(),\n\n vec![token],\n\n vec![],\n\n )\n\n .unwrap();\n\n assert_eq!(ret.len(), 1);\n\n ret.pop().unwrap().1.cast().unwrap()\n\n}\n\n\n","file_path":"test-helper/src/dao.rs","rank":32,"score":297570.83185840165},{"content":"pub fn quorum_vote(state_view: &dyn StateView, token: TypeTag) -> u128 {\n\n let mut ret = execute_readonly_function(\n\n state_view,\n\n &ModuleId::new(genesis_address(), Identifier::new(\"Dao\").unwrap()),\n\n &Identifier::new(\"quorum_votes\").unwrap(),\n\n vec![token],\n\n vec![],\n\n )\n\n .unwrap();\n\n assert_eq!(ret.len(), 1);\n\n ret.pop().unwrap().1.cast().unwrap()\n\n}\n\n\n","file_path":"test-helper/src/dao.rs","rank":33,"score":297570.83185840165},{"content":"pub fn voting_delay(state_view: &dyn StateView, token: TypeTag) -> u64 {\n\n let mut ret = execute_readonly_function(\n\n state_view,\n\n &ModuleId::new(genesis_address(), Identifier::new(\"Dao\").unwrap()),\n\n &Identifier::new(\"voting_delay\").unwrap(),\n\n vec![token],\n\n vec![],\n\n )\n\n .unwrap();\n\n assert_eq!(ret.len(), 1);\n\n ret.pop().unwrap().1.cast().unwrap()\n\n}\n","file_path":"test-helper/src/dao.rs","rank":34,"score":297570.83185840165},{"content":"/// Output transaction builders in Rust for the given ABIs.\n\n/// If `local_types` is true, we generate a file suitable for the Diem codebase itself\n\n/// rather than using serde-generated, standalone definitions.\n\npub fn output(out: &mut dyn Write, abis: &[ScriptABI], local_types: bool) -> Result<()> {\n\n let mut emitter = RustEmitter {\n\n out: IndentedWriter::new(out, IndentConfig::Space(4)),\n\n local_types,\n\n };\n\n\n\n emitter.output_preamble()?;\n\n emitter.output_script_call_enum_with_imports(abis)?;\n\n\n\n emitter.output_transaction_script_impl(&common::transaction_script_abis(abis))?;\n\n emitter.output_script_function_impl(&common::script_function_abis(abis))?;\n\n\n\n for abi in abis {\n\n emitter.output_script_encoder_function(abi)?;\n\n }\n\n\n\n for abi in abis {\n\n emitter.output_script_decoder_function(abi)?;\n\n }\n\n\n\n emitter.output_transaction_script_decoder_map(&common::transaction_script_abis(abis))?;\n\n emitter.output_script_function_decoder_map(&common::script_function_abis(abis))?;\n\n emitter.output_decoding_helpers(abis)?;\n\n\n\n for abi in &common::transaction_script_abis(abis) {\n\n emitter.output_code_constant(abi)?;\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"vm/transaction-builder-generator/src/rust.rs","rank":35,"score":295215.4833596454},{"content":"pub fn current_block_number(state_view: &dyn StateView) -> u64 {\n\n let mut ret = execute_readonly_function(\n\n state_view,\n\n &ModuleId::new(genesis_address(), Identifier::new(\"Block\").unwrap()),\n\n &Identifier::new(\"get_current_block_number\").unwrap(),\n\n vec![],\n\n vec![],\n\n )\n\n .unwrap();\n\n assert_eq!(ret.len(), 1);\n\n ret.pop().unwrap().1.cast().unwrap()\n\n}\n\n\n","file_path":"test-helper/src/executor.rs","rank":36,"score":294093.5221516206},{"content":"pub fn min_action_delay(state_view: &dyn StateView, token: TypeTag) -> u64 {\n\n let mut ret = execute_readonly_function(\n\n state_view,\n\n &ModuleId::new(genesis_address(), Identifier::new(\"Dao\").unwrap()),\n\n &Identifier::new(\"min_action_delay\").unwrap(),\n\n vec![token],\n\n vec![],\n\n )\n\n .unwrap();\n\n assert_eq!(ret.len(), 1);\n\n ret.pop().unwrap().1.cast().unwrap()\n\n}\n\n\n","file_path":"test-helper/src/dao.rs","rank":37,"score":294049.81674028025},{"content":"pub fn make_genesis_accounts() -> BTreeMap<String, Account> {\n\n let mut m = BTreeMap::new();\n\n m.insert(ASSOCIATION_NAME.to_string(), Account::new_association());\n\n m.insert(\n\n GENESIS_NAME.to_string(),\n\n Account::new_genesis_account(genesis_address()),\n\n );\n\n m\n\n}\n","file_path":"vm/functional-tests/src/genesis_accounts.rs","rank":38,"score":290968.00809411256},{"content":"/// Output a header-only library providing C++ transaction builders for the given ABIs.\n\npub fn output(out: &mut dyn Write, abis: &[ScriptABI], namespace: Option<&str>) -> Result<()> {\n\n let mut emitter = CppEmitter {\n\n out: IndentedWriter::new(out, IndentConfig::Space(4)),\n\n namespace,\n\n inlined_definitions: true,\n\n };\n\n emitter.output_preamble()?;\n\n emitter.output_open_namespace()?;\n\n emitter.output_using_namespaces()?;\n\n for abi in abis {\n\n match abi {\n\n ScriptABI::TransactionScript(abi) => {\n\n emitter.output_transaction_script_builder_definition(abi)?\n\n }\n\n ScriptABI::ScriptFunction(abi) => emitter.output_script_fun_builder_definition(abi)?,\n\n };\n\n }\n\n emitter.output_close_namespace()\n\n}\n\n\n","file_path":"vm/transaction-builder-generator/src/cpp.rs","rank":39,"score":290170.12903166376},{"content":"pub fn to_bytes<T>(value: &T) -> Result<Vec<u8>>\n\nwhere\n\n T: ?Sized + Serialize,\n\n{\n\n bcs::to_bytes(value).map_err(|e| e.into())\n\n}\n\n\n","file_path":"commons/bcs_ext/src/lib.rs","rank":40,"score":288268.9632115961},{"content":"pub fn from_public_key(public_key: &Ed25519PublicKey) -> AccountAddress {\n\n AuthenticationKey::ed25519(public_key).derived_address()\n\n}\n","file_path":"types/src/account_address.rs","rank":41,"score":287019.105758151},{"content":"#[test]\n\nfn test_state_proof() -> Result<()> {\n\n let storage = MockStateNodeStore::new();\n\n let chain_state_db = ChainStateDB::new(Arc::new(storage), None);\n\n let access_path = AccessPath::random_resource();\n\n let state0 = random_bytes();\n\n chain_state_db.apply_write_set(to_write_set(access_path.clone(), state0.clone()))?;\n\n\n\n let state_root = chain_state_db.commit()?;\n\n let state1 = chain_state_db.get(&access_path)?;\n\n assert!(state1.is_some());\n\n assert_eq!(state0, state1.unwrap());\n\n println!(\"{}\", access_path.address.key_hash());\n\n println!(\"{}\", access_path.key_hash());\n\n let state_with_proof = chain_state_db.get_with_proof(&access_path)?;\n\n println!(\"{:?}\", state_with_proof);\n\n state_with_proof\n\n .proof\n\n .verify(state_root, access_path, state_with_proof.state.as_deref())?;\n\n Ok(())\n\n}\n\n\n","file_path":"state/statedb/src/tests.rs","rank":42,"score":286981.308996017},{"content":"fn to_write_set(access_path: AccessPath, value: Vec<u8>) -> WriteSet {\n\n WriteSetMut::new(vec![(access_path, WriteOp::Value(value))])\n\n .freeze()\n\n .expect(\"freeze write_set must success.\")\n\n}\n\n\n","file_path":"state/statedb/src/tests.rs","rank":43,"score":284414.4658332745},{"content":"pub fn compile_modules_with_address(address: AccountAddress, code: &str) -> Vec<Module> {\n\n let temp_dir = temp_path();\n\n let stdlib_files =\n\n restore_stdlib_in_dir(temp_dir.path()).expect(\"get stdlib modules should be ok\");\n\n let compiled_result =\n\n starcoin_move_compiler::compile_source_string_no_report(code, &stdlib_files, address)\n\n .expect(\"compile fail\")\n\n .1\n\n .expect(\"compile fail\");\n\n compiled_result\n\n .into_iter()\n\n .map(|m| Module::new(m.serialize()))\n\n .collect()\n\n}\n","file_path":"test-helper/src/executor.rs","rank":44,"score":284320.46653935604},{"content":"fn bench_get_with_proof(c: &mut Criterion) {\n\n ::logger::init();\n\n let tmp_dir = starcoin_config::temp_path();\n\n let db_store = new_empty_store(tmp_dir.as_ref()) as Arc<dyn StateNodeStore>;\n\n\n\n let mem_store = Arc::new(MockStateNodeStore::new()) as Arc<dyn StateNodeStore>;\n\n\n\n let mut group = c.benchmark_group(\"get_with_proof\");\n\n for (id, s) in [(\"mem_store\", mem_store), (\"db_store\", db_store)].iter() {\n\n let tree = StateTree::new(s.clone(), None);\n\n let (kvs, _root) = prepare_tree(&tree, &[1, 2, 3, 4], 100_000);\n\n let ks = kvs.keys().copied().collect::<Vec<_>>();\n\n group\n\n .bench_with_input(*id, &(tree, kvs, ks), |b, input| {\n\n let (tree, kvs, ks) = input;\n\n let k_len = ks.len();\n\n let mut i = 0usize;\n\n b.iter_with_setup(\n\n || {\n\n let k = &ks[i % k_len];\n","file_path":"benchmarks/benches/bench_state_tree.rs","rank":45,"score":283724.5231293807},{"content":"pub fn from_public_key(public_key: &Ed25519PublicKey) -> AccountAddress {\n\n AuthenticationKey::ed25519(public_key).derived_address()\n\n}\n\n\n\n// Define the Hasher used for hashing AccountAddress types. In order to properly use the\n\n// CryptoHasher derive macro we need to have this in its own module so that it doesn't conflict\n\n// with the imported `AccountAddress` from move-core-types. It needs to have the same name since\n\n// the hash salt is calculated using the name of the type.\n\nmod hasher {\n\n use starcoin_crypto::hash::CryptoHasher;\n\n #[derive(serde::Deserialize, CryptoHasher)]\n\n struct AccountAddress;\n\n}\n\n\n","file_path":"vm/types/src/account_address.rs","rank":46,"score":283271.0410197339},{"content":"fn get_epoch_from_statedb(statedb: &ChainStateDB) -> Result<Epoch> {\n\n let account_reader = AccountStateReader::new(statedb);\n\n account_reader\n\n .get_resource::<Epoch>(genesis_address())?\n\n .ok_or_else(|| format_err!(\"Epoch is none.\"))\n\n}\n\n\n","file_path":"chain/src/chain.rs","rank":47,"score":281234.07403724926},{"content":"pub trait TokenUnit: Clone + Copy {\n\n fn symbol(&self) -> &'static str;\n\n\n\n fn scale(&self) -> u32;\n\n\n\n fn scaling_factor(&self) -> u128 {\n\n 10u32.pow(self.scale()) as u128\n\n }\n\n\n\n fn scaling(&self, value: u128) -> u128 {\n\n self.scaling_factor() * value\n\n }\n\n\n\n fn split(&self, value: u128) -> (u128, u128) {\n\n let scaling_factor = self.scaling_factor();\n\n if value >= scaling_factor {\n\n let h = value / scaling_factor;\n\n let l = value - (h * scaling_factor);\n\n (h, l)\n\n } else {\n","file_path":"vm/types/src/token/token_value.rs","rank":48,"score":281046.95716688957},{"content":"/// `StateView` is a trait that defines a read-only snapshot of the global state. It is passed to\n\n/// the VM for transaction execution, during which the VM is guaranteed to read anything at the\n\n/// given state.\n\npub trait StateView {\n\n /// Gets the state for a single access path.\n\n fn get(&self, access_path: &AccessPath) -> Result<Option<Vec<u8>>>;\n\n\n\n /// Gets states for a list of access paths.\n\n fn multi_get(&self, access_paths: &[AccessPath]) -> Result<Vec<Option<Vec<u8>>>>;\n\n\n\n /// VM needs this method to know whether the current state view is for genesis state creation.\n\n /// Currently TransactionPayload::WriteSet is only valid for genesis state creation.\n\n fn is_genesis(&self) -> bool;\n\n}\n","file_path":"vm/types/src/state_view.rs","rank":49,"score":279881.584506251},{"content":"pub fn account_struct_tag() -> StructTag {\n\n StructTag {\n\n address: CORE_CODE_ADDRESS,\n\n module: ACCOUNT_MODULE_IDENTIFIER.clone(),\n\n name: ACCOUNT_STRUCT_NAME.to_owned(),\n\n type_params: vec![],\n\n }\n\n}\n","file_path":"vm/types/src/account_config/constants/account.rs","rank":50,"score":278290.6472724031},{"content":"pub fn get_free_mem_size() -> Result<u64> {\n\n let sys = System::new();\n\n let free = match sys.memory() {\n\n Ok(mem) => mem.free.as_u64(),\n\n Err(_x) => 0u64,\n\n };\n\n Ok(free)\n\n}\n","file_path":"commons/system/src/lib.rs","rank":51,"score":276808.8209477427},{"content":"fn check_data<T: Sample + Serialize + DeserializeOwned + PartialEq>() -> Result<T> {\n\n let type_name = type_name::<T>();\n\n ensure!(\n\n T::sample() == T::sample(),\n\n \"Type {}'s sample return result is not stable.\"\n\n );\n\n if let Some(t) = read_and_check_data::<T>()? {\n\n info!(\"Check {} ok\", type_name);\n\n Ok(t)\n\n } else {\n\n let t = T::sample();\n\n write_data(&t)?;\n\n Ok(t)\n\n }\n\n}\n","file_path":"test-helper/tests/types_check.rs","rank":52,"score":274925.47671293153},{"content":"/// This produces the genesis block\n\npub fn genesis_strategy(storage: Arc<Storage>) -> impl Strategy<Value = Block> {\n\n let net = &ChainNetwork::new_test();\n\n let genesis = Genesis::load(net).unwrap();\n\n genesis.execute_genesis_block(net, storage).unwrap();\n\n Just(genesis.block().clone())\n\n}\n\n\n","file_path":"chain/tests/block_test_utils.rs","rank":53,"score":274548.401495822},{"content":"pub fn run(mut args: Args, xctx: XContext) -> Result<()> {\n\n let config = xctx.config();\n\n\n\n let mut packages = args.package_args.to_selected_packages(&xctx)?;\n\n if args.unit {\n\n packages.add_excludes(config.system_tests().iter().map(|(p, _)| p.as_str()));\n\n }\n\n\n\n args.args.extend(args.testname.clone());\n\n\n\n let generate_coverage = args.html_cov_dir.is_some() || args.html_lcov_dir.is_some();\n\n\n\n let env_vars: &[(&str, Option<&str>)] = if generate_coverage {\n\n if !xctx.installer().install_if_needed(\"grcov\") {\n\n return Err(anyhow!(\"Could not install grcov\"));\n\n }\n\n info!(\"Running \\\"cargo clean\\\" before collecting coverage\");\n\n let mut clean_cmd = Command::new(\"cargo\");\n\n clean_cmd.arg(\"clean\");\n\n clean_cmd.output()?;\n","file_path":"devtools/x/src/test.rs","rank":54,"score":273378.95643422706},{"content":"fn get_epoch_data_from_statedb(statedb: &ChainStateDB) -> Result<EpochData> {\n\n let account_reader = AccountStateReader::new(statedb);\n\n account_reader\n\n .get_resource::<EpochData>(genesis_address())?\n\n .ok_or_else(|| format_err!(\"Epoch is none.\"))\n\n}\n","file_path":"chain/src/chain.rs","rank":55,"score":273049.01271969447},{"content":"fn read_and_check_data<T: Serialize + DeserializeOwned + PartialEq>() -> Result<Option<T>> {\n\n let data_path = data_file::<T>();\n\n let json_path = json_file::<T>();\n\n if data_path.exists() && json_path.exists() {\n\n debug!(\"Read data from {:?}\", data_path);\n\n let data = hex::decode(std::fs::read_to_string(data_path)?.as_str())?;\n\n let data_t = bcs_ext::from_bytes::<T>(data.as_slice())?;\n\n let json_t = serde_json::from_str::<T>(std::fs::read_to_string(json_path)?.as_str())?;\n\n ensure!(\n\n data_t == json_t,\n\n \"{}'s bcs and json serialize data is not equals.\",\n\n type_name::<T>()\n\n );\n\n\n\n let new_data = bcs_ext::to_bytes(&data_t)?;\n\n ensure!(\n\n data == new_data,\n\n \"Check type {}'s serialize/deserialize fail, expect:{}, got: {}\",\n\n type_name::<T>(),\n\n hex::encode(data),\n\n hex::encode(new_data)\n\n );\n\n Ok(Some(data_t))\n\n } else {\n\n Ok(None)\n\n }\n\n}\n\n\n","file_path":"test-helper/tests/types_check.rs","rank":56,"score":270452.87769768655},{"content":"pub trait ValueCodec: Clone + Sized + Debug + std::marker::Send + std::marker::Sync {\n\n /// Converts `self` to bytes to be stored in DB.\n\n fn encode_value(&self) -> Result<Vec<u8>>;\n\n /// Converts bytes fetched from DB to `Self`.\n\n fn decode_value(data: &[u8]) -> Result<Self>;\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub enum WriteOp<V> {\n\n Value(V),\n\n Deletion,\n\n}\n\n\n\nimpl<V> WriteOp<V>\n\nwhere\n\n V: ValueCodec,\n\n{\n\n pub fn into_raw_op(self) -> Result<WriteOp<Vec<u8>>> {\n\n Ok(match self {\n\n WriteOp::Value(v) => WriteOp::Value(v.encode_value()?),\n","file_path":"storage/src/storage.rs","rank":57,"score":270004.96153614065},{"content":"pub fn blockmeta_execute(state: &ChainStateDB, meta: BlockMetadata) -> Result<TransactionOutput> {\n\n let txn = Transaction::BlockMetadata(meta);\n\n let output = execute_and_apply(state, txn);\n\n if let TransactionStatus::Discard(s) = output.status() {\n\n bail!(\"txn discard, status: {:?}\", s);\n\n }\n\n\n\n Ok(output)\n\n}\n\n\n","file_path":"test-helper/src/executor.rs","rank":58,"score":268874.21291581413},{"content":"pub trait TaskState: Sized + Clone + std::marker::Unpin + std::marker::Send {\n\n type Item: Debug + std::marker::Send;\n\n\n\n fn task_name() -> &'static str {\n\n type_name::<Self>()\n\n }\n\n fn new_sub_task(self) -> BoxFuture<'static, Result<Vec<Self::Item>>>;\n\n fn next(&self) -> Option<Self>;\n\n fn total_items(&self) -> Option<u64> {\n\n None\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests;\n","file_path":"commons/stream-task/src/lib.rs","rank":59,"score":268626.92295679863},{"content":"pub trait RawKey: Clone + Ord {\n\n /// Raw key's hash, will used as tree's nibble path\n\n /// Directly use origin byte's sha3_256 hash, do not use CryptoHash to add salt.\n\n fn key_hash(&self) -> HashValue {\n\n HashValue::sha3_256_of(\n\n self.encode_key()\n\n .expect(\"Serialize key failed when hash.\")\n\n .as_slice(),\n\n )\n\n }\n\n\n\n /// Encode the raw key, the raw key's bytes will store to leaf node.\n\n fn encode_key(&self) -> Result<Vec<u8>>;\n\n\n\n fn decode_key(bytes: &[u8]) -> Result<Self>;\n\n}\n\n\n\nimpl<T> RawKey for T\n\nwhere\n\n T: Clone + Ord + Serialize + DeserializeOwned,\n","file_path":"commons/forkable-jellyfish-merkle/src/lib.rs","rank":60,"score":267985.91973988723},{"content":"pub fn create_new_block(\n\n chain: &BlockChain,\n\n account: &Account,\n\n txns: Vec<SignedUserTransaction>,\n\n) -> Result<Block> {\n\n let (template, _) = chain.create_block_template(\n\n *account.address(),\n\n Some(account.auth_key()),\n\n None,\n\n txns,\n\n vec![],\n\n None,\n\n )?;\n\n chain\n\n .consensus()\n\n .create_block(template, chain.time_service().as_ref())\n\n}\n\n\n","file_path":"chain/tests/test_epoch_switch.rs","rank":61,"score":266593.0390970136},{"content":"fn build_rows(values: &[Value]) -> Result<(Vec<Row>, Box<dyn RowBuilder>)> {\n\n let bold = CellFormat::builder().bold(true).build();\n\n let mut rows = vec![];\n\n let mut field_names = Vec::new();\n\n let is_simple = |value: &Value| value.is_number() || value.is_boolean() || value.is_string();\n\n let mut exist_not_simple = false;\n\n for value in values {\n\n if is_simple(value) {\n\n rows.push(Row::new(vec![Cell::new(\"Result\", bold)]));\n\n } else {\n\n exist_not_simple = true;\n\n let mut flat = json!({});\n\n flatten(value, &mut flat, None, true, None)\n\n .map_err(|e| anyhow::Error::msg(e.description().to_string()))?;\n\n let obj = flat.as_object().expect(\"must be a object\");\n\n let mut cells = vec![];\n\n obj.keys().for_each(|key| {\n\n cells.push(Cell::new(key, bold));\n\n if !field_names.contains(key) {\n\n field_names.push(key.to_string());\n","file_path":"commons/scmd/src/result.rs","rank":62,"score":263674.07663652225},{"content":"#[stest::test]\n\nfn test_find_ancestor_genesis() -> Result<()> {\n\n let mut mock_chain = MockChain::new(ChainNetwork::new_test())?;\n\n mock_chain.produce_and_apply_times(3)?;\n\n\n\n let mut mock_chain2 = MockChain::new(ChainNetwork::new_test())?;\n\n mock_chain2.produce_and_apply_times(4)?;\n\n let ancestor = mock_chain.head().find_ancestor(mock_chain2.head())?;\n\n assert!(ancestor.is_some());\n\n assert_eq!(ancestor.unwrap().number, 0);\n\n Ok(())\n\n}\n\n\n","file_path":"chain/tests/test_block_chain.rs","rank":63,"score":262717.17328976706},{"content":"/// State sequence number client\n\npub trait AccountSeqNumberClient: fmt::Debug + Clone + Any {\n\n /// Fetch only account nonce for given sender.\n\n fn account_seq_number(&self, address: &Address) -> SeqNumber;\n\n}\n\n\n","file_path":"txpool/src/pool/client.rs","rank":64,"score":262308.76254803536},{"content":"pub fn deserialize<'de, D>(deserializer: D) -> Result<Vec<Vec<u8>>, D::Error>\n\nwhere\n\n D: Deserializer<'de>,\n\n{\n\n Ok(<Vec<serde_bytes::ByteBuf>>::deserialize(deserializer)?\n\n .into_iter()\n\n .map(serde_bytes::ByteBuf::into_vec)\n\n .collect())\n\n}\n","file_path":"vm/types/src/serde_helper/vec_bytes.rs","rank":65,"score":261977.32754900763},{"content":"pub fn transaction_execution(c: &mut Criterion) {\n\n ::logger::init();\n\n let mut group = c.benchmark_group(\"vm\");\n\n group.sample_size(10);\n\n let bench_id = \"transaction_execution\";\n\n for i in vec![1u64, 5, 10, 20, 50].into_iter() {\n\n group.bench_function(BenchmarkId::new(bench_id, i), |b| {\n\n b.iter(|| run_benchmark(20, 1_000_000, i as usize, 1))\n\n });\n\n }\n\n}\n\n\n\ncriterion_group!(starcoin_vm_benches, transaction_execution);\n\ncriterion_main!(starcoin_vm_benches);\n","file_path":"benchmarks/benches/bench_vm.rs","rank":66,"score":261810.95831577142},{"content":"pub fn convert_changeset_and_events_cached<C: AccessPathCache>(\n\n ap_cache: &mut C,\n\n changeset: MoveChangeSet,\n\n events: Vec<MoveEvent>,\n\n) -> Result<(WriteSet, Vec<ContractEvent>), VMStatus> {\n\n // TODO: Cache access path computations if necessary.\n\n let mut ops = vec![];\n\n\n\n for (addr, account_changeset) in changeset.accounts {\n\n for (struct_tag, blob_opt) in account_changeset.resources {\n\n let ap = ap_cache.get_resource_path(addr, struct_tag);\n\n let op = match blob_opt {\n\n None => WriteOp::Deletion,\n\n Some(blob) => WriteOp::Value(blob),\n\n };\n\n ops.push((ap, op))\n\n }\n\n\n\n for (name, blob_opt) in account_changeset.modules {\n\n let ap = ap_cache.get_module_path(ModuleId::new(addr, name));\n","file_path":"vm/vm-runtime/src/starcoin_vm.rs","rank":67,"score":260676.84409480722},{"content":"pub fn from_bytes<'a, T>(bytes: &'a [u8]) -> Result<T>\n\nwhere\n\n T: Deserialize<'a>,\n\n{\n\n bcs::from_bytes(bytes).map_err(|e| e.into())\n\n}\n\n\n","file_path":"commons/bcs_ext/src/lib.rs","rank":68,"score":259419.1776502243},{"content":"pub fn serialize<S>(data: &[Vec<u8>], serializer: S) -> Result<S::Ok, S::Error>\n\nwhere\n\n S: Serializer,\n\n{\n\n let mut seq = serializer.serialize_seq(Some(data.len()))?;\n\n for e in data {\n\n seq.serialize_element(serde_bytes::Bytes::new(e.as_slice()))?;\n\n }\n\n seq.end()\n\n}\n\n\n","file_path":"vm/types/src/serde_helper/vec_bytes.rs","rank":69,"score":255378.3686716952},{"content":"#[async_trait::async_trait]\n\npub trait ChainStateAsyncService: Clone + std::marker::Unpin + Send + Sync {\n\n async fn get(self, access_path: AccessPath) -> Result<Option<Vec<u8>>>;\n\n\n\n async fn get_with_proof(self, access_path: AccessPath) -> Result<StateWithProof>;\n\n\n\n async fn get_resource<R>(self, address: AccountAddress) -> Result<Option<R>>\n\n where\n\n R: MoveResource + DeserializeOwned,\n\n {\n\n let access_path = AccessPath::new(address, R::resource_path());\n\n let r = self.get(access_path).await.and_then(|state| match state {\n\n Some(state) => Ok(Some(bcs_ext::from_bytes::<R>(state.as_slice())?)),\n\n None => Ok(None),\n\n })?;\n\n Ok(r)\n\n }\n\n\n\n async fn get_account_state(self, address: AccountAddress) -> Result<Option<AccountState>>;\n\n\n\n /// get account stateset on state_root(if empty, use current state root).\n","file_path":"state/api/src/lib.rs","rank":70,"score":254677.3133500325},{"content":"pub trait Solver: Send + DynClone {\n\n fn solve(\n\n &mut self,\n\n strategy: ConsensusStrategy,\n\n minting_blob: &[u8],\n\n diff: U256,\n\n nonce_tx: UnboundedSender<(Vec<u8>, u32)>,\n\n stop_rx: UnboundedReceiver<bool>,\n\n );\n\n}\n\n\n\n#[derive(Clone, Debug, Message)]\n\n#[rtype(result = \"Result<()>\")]\n\npub struct SealEvent {\n\n minting_blob: Vec<u8>,\n\n nonce: u32,\n\n extra: BlockHeaderExtra,\n\n}\n","file_path":"cmd/miner_client/src/lib.rs","rank":71,"score":252888.7650050032},{"content":"pub fn rpc_impl(input: syn::Item, options: &options::DeriveOptions) -> Result<TokenStream> {\n\n let mut rpc_trait = match input {\n\n syn::Item::Trait(item_trait) => item_trait,\n\n item => {\n\n return Err(Error::from(syn::Error::new_spanned(\n\n item,\n\n \"The #[net_rpc] custom attribute only works with trait declarations\",\n\n )));\n\n }\n\n };\n\n let mut exports = Vec::new();\n\n if options.enable_client {\n\n let client_module = generate_client_module(&rpc_trait)?;\n\n exports.push(client_module);\n\n }\n\n if options.enable_server {\n\n let server_module = generate_server_module(&mut rpc_trait)?;\n\n exports.push(server_module);\n\n }\n\n Ok(quote! {\n\n #(#exports)*\n\n })\n\n}\n","file_path":"network-rpc/derive/src/rpc_trait.rs","rank":72,"score":252867.857219573},{"content":"pub fn _sign_txn_with_default_account_by_rpc_client(\n\n cli_state: &CliState,\n\n max_gas_amount: u64,\n\n gas_price: u64,\n\n expiration_time: u64,\n\n payload: TransactionPayload,\n\n) -> Result<SignedUserTransaction> {\n\n sign_txn_by_rpc_client(\n\n cli_state,\n\n max_gas_amount,\n\n gas_price,\n\n expiration_time,\n\n payload,\n\n None,\n\n )\n\n}\n\n\n","file_path":"cmd/starcoin/src/dev/tests.rs","rank":73,"score":252141.9387074266},{"content":"pub fn get_dao_config(cli_state: &CliState) -> Result<DaoConfig> {\n\n let client = cli_state.client();\n\n let chain_state_reader = RemoteStateReader::new(client)?;\n\n let account_state_reader = AccountStateReader::new(&chain_state_reader);\n\n account_state_reader\n\n .get_on_chain_config::<DaoConfig>()?\n\n .ok_or_else(|| format_err!(\"DaoConfig not exist on chain.\"))\n\n}\n","file_path":"cmd/starcoin/src/dev/sign_txn_helper.rs","rank":74,"score":250889.27988412417},{"content":"pub fn account_balance_struct_name() -> &'static IdentStr {\n\n &*ACCOUNT_BALANCE_STRUCT_NAME\n\n}\n\n\n","file_path":"vm/types/src/account_config/constants/account.rs","rank":75,"score":250199.22912803866},{"content":"pub fn generate_client_module(rpc_trait: &ItemTrait) -> anyhow::Result<TokenStream> {\n\n let mut rpc_info = Vec::new();\n\n let client_methods: Vec<TokenStream> = rpc_trait\n\n .items\n\n .iter()\n\n .filter_map(|trait_item| {\n\n if let syn::TraitItem::Method(method) = trait_item {\n\n let name = &method.sig.ident;\n\n let args = compute_args(&method);\n\n let arg_names = compute_arg_identifiers(&args).unwrap();\n\n let returns = match compute_returns(method) {\n\n Ok(r) => r,\n\n Err(e) => panic!(\"{}\", e)\n\n };\n\n if arg_names.len() < 2 {\n\n panic!(\"network Rpc method must has at least two argument\");\n\n }\n\n let peer_id_indent = arg_names[0];\n\n // TODO: Only support one user custom argument currently\n\n let user_arg_indent = arg_names[1];\n","file_path":"network-rpc/derive/src/to_client.rs","rank":76,"score":248973.1529861758},{"content":"/// Splits a Multiaddress into a Multiaddress and PeerId.\n\npub fn parse_addr(mut addr: Multiaddr) -> Result<(PeerId, Multiaddr), ParseErr> {\n\n let who = match addr.pop() {\n\n Some(multiaddr::Protocol::P2p(key)) => {\n\n PeerId::from_multihash(key).map_err(|_| ParseErr::InvalidPeerId)?\n\n }\n\n _ => return Err(ParseErr::PeerIdMissing),\n\n };\n\n\n\n Ok((who, addr))\n\n}\n\n\n","file_path":"network-p2p/types/src/lib.rs","rank":77,"score":248170.7020348324},{"content":"pub fn event_handle_generator_struct_tag() -> StructTag {\n\n StructTag {\n\n address: CORE_CODE_ADDRESS,\n\n module: event_module_name().to_owned(),\n\n name: event_handle_generator_struct_name().to_owned(),\n\n type_params: vec![],\n\n }\n\n}\n","file_path":"vm/types/src/account_config/constants/event.rs","rank":78,"score":248119.15312097495},{"content":"//TODO this trait should move to consensus?\n\npub trait BlockVerifier {\n\n fn verify_header<R>(current_chain: &R, new_block_header: &BlockHeader) -> Result<()>\n\n where\n\n R: ChainReader;\n\n fn verify_block<R>(current_chain: &R, new_block: Block) -> Result<VerifiedBlock>\n\n where\n\n R: ChainReader,\n\n {\n\n watch(CHAIN_WATCH_NAME, \"n11\");\n\n //verify header\n\n let new_block_header = new_block.header();\n\n Self::verify_header(current_chain, new_block_header)?;\n\n watch(CHAIN_WATCH_NAME, \"n12\");\n\n //verify body\n\n let body_hash = new_block.body.hash();\n\n verify_block!(\n\n VerifyBlockField::Body,\n\n body_hash == new_block_header.body_hash(),\n\n \"verify block body hash mismatch, expect: {}, got: {}\",\n\n new_block_header.body_hash(),\n","file_path":"chain/src/verifier/mod.rs","rank":80,"score":244318.60017262568},{"content":"#[stest::test]\n\npub fn test_open_block() -> Result<()> {\n\n let config = Arc::new(NodeConfig::random_for_test());\n\n let chain = test_helper::gen_blockchain_for_test(config.net())?;\n\n let header = chain.current_header();\n\n let block_gas_limit = 10000000;\n\n\n\n let mut opened_block = {\n\n let miner_account = AccountInfo::random();\n\n OpenedBlock::new(\n\n chain.get_storage(),\n\n header,\n\n block_gas_limit,\n\n miner_account.address,\n\n Some(miner_account.public_key.authentication_key()),\n\n config.net().time_service().now_millis(),\n\n vec![],\n\n U256::from(0),\n\n chain.consensus(),\n\n )?\n\n };\n","file_path":"chain/tests/test_opened_block.rs","rank":82,"score":242889.5239975736},{"content":"pub fn new_epoch_event_key() -> EventKey {\n\n EventKey::new_from_address(&genesis_address(), 0)\n\n}\n\n\n","file_path":"vm/types/src/on_chain_config/mod.rs","rank":83,"score":241269.85328593952},{"content":"/// Serializes the script then deserializes it.\n\nfn serialize_and_deserialize_script(script: &CompiledScript) -> Result<()> {\n\n let mut script_blob = vec![];\n\n script.serialize(&mut script_blob)?;\n\n let deserialized_script = CompiledScript::deserialize(&script_blob)\n\n .map_err(|e| e.finish(Location::Undefined).into_vm_status())?;\n\n\n\n if *script != deserialized_script {\n\n return Err(ErrorKind::Other(\n\n \"deserialized script different from original one\".to_string(),\n\n )\n\n .into());\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"vm/functional-tests/src/evaluator.rs","rank":84,"score":241005.34122100944},{"content":"/// Serializes the module then deserializes it.\n\nfn serialize_and_deserialize_module(module: &CompiledModule) -> Result<()> {\n\n let mut module_blob = vec![];\n\n module.serialize(&mut module_blob)?;\n\n let deserialized_module = CompiledModule::deserialize(&module_blob)\n\n .map_err(|e| e.finish(Location::Undefined).into_vm_status())?;\n\n\n\n if *module != deserialized_module {\n\n return Err(ErrorKind::Other(\n\n \"deserialized module different from original one\".to_string(),\n\n )\n\n .into());\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"vm/functional-tests/src/evaluator.rs","rank":85,"score":241005.34122100944},{"content":"pub trait MoveResource {\n\n const MODULE_NAME: &'static str;\n\n const STRUCT_NAME: &'static str;\n\n\n\n fn module_identifier() -> Identifier {\n\n IdentStr::new(Self::MODULE_NAME)\n\n .expect(\"failed to get IdentStr for Move module\")\n\n .to_owned()\n\n }\n\n\n\n fn struct_identifier() -> Identifier {\n\n IdentStr::new(Self::STRUCT_NAME)\n\n .expect(\"failed to get IdentStr for Move struct\")\n\n .to_owned()\n\n }\n\n\n\n fn type_params() -> Vec<TypeTag> {\n\n vec![]\n\n }\n\n\n","file_path":"vm/types/src/move_resource.rs","rank":86,"score":240375.8599545182},{"content":"#[rpc]\n\npub trait StateApi {\n\n #[rpc(name = \"state.get\")]\n\n fn get(&self, access_path: AccessPath) -> FutureResult<Option<Vec<u8>>>;\n\n\n\n #[rpc(name = \"state.get_with_proof\")]\n\n fn get_with_proof(&self, access_path: AccessPath) -> FutureResult<StateWithProofView>;\n\n\n\n #[rpc(name = \"state.get_account_state\")]\n\n fn get_account_state(&self, address: AccountAddress) -> FutureResult<Option<AccountState>>;\n\n\n\n #[rpc(name = \"state.get_account_state_set\")]\n\n fn get_account_state_set(\n\n &self,\n\n address: AccountAddress,\n\n ) -> FutureResult<Option<AccountStateSetView>>;\n\n\n\n #[rpc(name = \"state.get_state_root\")]\n\n fn get_state_root(&self) -> FutureResult<HashValue>;\n\n\n\n #[rpc(name = \"state.get_with_proof_by_root\")]\n\n fn get_with_proof_by_root(\n\n &self,\n\n access_path: AccessPath,\n\n state_root: HashValue,\n\n ) -> FutureResult<StateWithProofView>;\n\n}\n","file_path":"rpc/api/src/state/mod.rs","rank":87,"score":240232.95097851352},{"content":"#[async_trait::async_trait]\n\npub trait AccountAsyncService:\n\n Clone + std::marker::Unpin + std::marker::Sync + std::marker::Send\n\n{\n\n async fn create_account(&self, password: String) -> Result<AccountInfo>;\n\n\n\n async fn get_default_account(&self) -> Result<Option<AccountInfo>>;\n\n async fn set_default_account(&self, address: AccountAddress) -> Result<Option<AccountInfo>>;\n\n async fn get_accounts(&self) -> Result<Vec<AccountInfo>>;\n\n\n\n async fn get_account(&self, address: AccountAddress) -> Result<Option<AccountInfo>>;\n\n\n\n /// Signs the hash of data with given address.\n\n async fn sign_message(\n\n &self,\n\n address: AccountAddress,\n\n message: SigningMessage,\n\n ) -> Result<Vec<u8>>;\n\n\n\n async fn sign_txn(\n\n &self,\n","file_path":"account/api/src/service.rs","rank":88,"score":240092.592511278},{"content":"#[rpc]\n\npub trait AccountApi {\n\n /// Get default account\n\n #[rpc(name = \"account.default\")]\n\n fn default(&self) -> FutureResult<Option<AccountInfo>>;\n\n\n\n #[rpc(name = \"account.set_default_account\")]\n\n fn set_default_account(&self, addr: AccountAddress) -> FutureResult<Option<AccountInfo>>;\n\n\n\n #[rpc(name = \"account.create\")]\n\n fn create(&self, password: String) -> FutureResult<AccountInfo>;\n\n #[rpc(name = \"account.list\")]\n\n fn list(&self) -> FutureResult<Vec<AccountInfo>>;\n\n #[rpc(name = \"account.get\")]\n\n fn get(&self, address: AccountAddress) -> FutureResult<Option<AccountInfo>>;\n\n\n\n #[rpc(name = \"account.sign\")]\n\n fn sign(&self, address: AccountAddress, data: SigningMessage)\n\n -> FutureResult<StrView<Vec<u8>>>;\n\n\n\n /// sign a txn request, return hex encoded bcs_ext bytes of signed user txn.\n","file_path":"rpc/api/src/account/mod.rs","rank":89,"score":240085.1203027959},{"content":"pub fn prepare_genesis() -> (ChainStateDB, ChainNetwork) {\n\n let net = ChainNetwork::new_test();\n\n let chain_state = ChainStateDB::mock();\n\n let genesis_txn = Genesis::build_genesis_transaction(&net).unwrap();\n\n Genesis::execute_genesis_txn(&chain_state, genesis_txn).unwrap();\n\n (chain_state, net)\n\n}\n\n\n","file_path":"test-helper/src/executor.rs","rank":90,"score":239788.42702401849},{"content":"fn print_value_table(value: Value) -> Result<()> {\n\n let simple_value =\n\n value.is_number() || value.is_boolean() || value.is_boolean() || value.is_string();\n\n if simple_value {\n\n println!(\"{}\", value_to_string(&value));\n\n } else {\n\n // value must be a object at here.\n\n let bold = CellFormat::builder().bold(true).build();\n\n let mut flat = json!({});\n\n flatten(&value, &mut flat, None, true, None)\n\n .map_err(|e| anyhow::Error::msg(e.description().to_string()))?;\n\n let obj = flat.as_object().expect(\"must be a object\");\n\n let mut rows = vec![];\n\n for (k, v) in obj {\n\n let row = Row::new(vec![\n\n Cell::new(k, bold),\n\n Cell::new(value_to_string(&v).as_str(), Default::default()),\n\n ]);\n\n rows.push(row);\n\n }\n\n let table = Table::new(rows, Default::default())?;\n\n table.print_stdout()?;\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"commons/scmd/src/result.rs","rank":91,"score":239018.12485621087},{"content":"pub trait ServiceHandler<S, R>\n\nwhere\n\n S: ActorService,\n\n R: ServiceRequest,\n\n{\n\n fn handle(&mut self, msg: R, ctx: &mut ServiceContext<S>) -> <R as ServiceRequest>::Response;\n\n}\n\n\n","file_path":"commons/service-registry/src/service.rs","rank":92,"score":238627.59698996882},{"content":"fn parse_struct_tag(input: &str) -> anyhow::Result<StructTag> {\n\n match parse_type_tag(input)? {\n\n TypeTag::Struct(s) => Ok(s),\n\n _ => {\n\n anyhow::bail!(\"invalid struct tag\")\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, StructOpt)]\n\n#[structopt(name = \"resource-exporter\", about = \"onchain resource exporter\")]\n\npub struct ExporterOptions {\n\n #[structopt(long, short = \"o\", parse(from_os_str))]\n\n /// output file, like accounts.csv\n\n pub output: PathBuf,\n\n #[structopt(long, short = \"i\", parse(from_os_str))]\n\n /// starcoin node db path. like ~/.starcoin/barnard/starcoindb/db\n\n pub db_path: PathBuf,\n\n\n\n #[structopt(long)]\n","file_path":"cmd/resource-exporter/src/main.rs","rank":93,"score":238559.48332747573},{"content":"fn write_indent(f: &mut Formatter, indent: u64) -> std::fmt::Result {\n\n for _i in 0..indent {\n\n write!(f, \" \")?;\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"vm/resource-viewer/src/lib.rs","rank":94,"score":237365.50490755745},{"content":"#[test]\n\nfn test_state_db() -> Result<()> {\n\n let storage = MockStateNodeStore::new();\n\n let chain_state_db = ChainStateDB::new(Arc::new(storage), None);\n\n let access_path = AccessPath::random_resource();\n\n\n\n let state0 = random_bytes();\n\n chain_state_db.apply_write_set(to_write_set(access_path.clone(), state0))?;\n\n let state_root = chain_state_db.commit()?;\n\n\n\n let state1 = random_bytes();\n\n chain_state_db.apply_write_set(to_write_set(access_path, state1))?;\n\n let new_state_root = chain_state_db.commit()?;\n\n assert_ne!(state_root, new_state_root);\n\n Ok(())\n\n}\n\n\n","file_path":"state/statedb/src/tests.rs","rank":95,"score":237142.61132815055},{"content":"#[test]\n\nfn test_state_version() -> Result<()> {\n\n let storage = Arc::new(MockStateNodeStore::new());\n\n let chain_state_db = ChainStateDB::new(storage.clone(), None);\n\n let account_address = AccountAddress::random();\n\n let access_path = AccessPath::new(account_address, AccountResource::resource_path());\n\n let old_state = random_bytes();\n\n chain_state_db.apply_write_set(to_write_set(access_path.clone(), old_state.clone()))?;\n\n chain_state_db.commit()?;\n\n chain_state_db.flush()?;\n\n let old_root = chain_state_db.state_root();\n\n\n\n let new_state = random_bytes();\n\n chain_state_db.apply_write_set(to_write_set(access_path.clone(), new_state))?;\n\n\n\n let chain_state_db_ori = ChainStateDB::new(storage, Some(old_root));\n\n let old_state2 = chain_state_db_ori.get(&access_path)?.unwrap();\n\n assert_eq!(old_state, old_state2);\n\n\n\n Ok(())\n\n}\n","file_path":"state/statedb/src/tests.rs","rank":96,"score":237142.61132815055},{"content":"fn bench_put_and_commit(c: &mut Criterion) {\n\n ::logger::init_for_test();\n\n let mut group = c.benchmark_group(\"put_and_commit\");\n\n group.sample_size(80);\n\n for i in vec![1u64, 5, 10, 50, 100].into_iter() {\n\n let tmp_dir = starcoin_config::temp_path();\n\n let db_store = new_empty_store(tmp_dir.as_ref()) as Arc<dyn StateNodeStore>;\n\n let mem_store = Arc::new(MockStateNodeStore::new()) as Arc<dyn StateNodeStore>;\n\n let mut rng: StdRng = {\n\n let seed = [1u8, 2, 3, 4];\n\n let mut actual_seed = [0u8; 32];\n\n actual_seed[..seed.len()].copy_from_slice(&seed);\n\n StdRng::from_seed(actual_seed)\n\n };\n\n for (id, store) in vec![(\"mem_store\", mem_store), (\"db_store\", db_store)].into_iter() {\n\n let tree = StateTree::new(store, None);\n\n // init tree with 10w keys.\n\n let _ = prepare_tree(&tree, &[2u8, 3, 4, 5], 100_000);\n\n group.bench_with_input(BenchmarkId::new(id, i), &(tree, i), |b, input| {\n\n let (tree, n) = input;\n","file_path":"benchmarks/benches/bench_state_tree.rs","rank":97,"score":236469.91063297176},{"content":"pub trait WalletStorageTrait {\n\n fn save_default_settings(&self, setting: Setting) -> Result<()>;\n\n\n\n fn save_accepted_token(&self, token: TokenCode) -> Result<()>;\n\n fn contain_wallet(&self, address: AccountAddress) -> Result<bool>;\n\n}\n","file_path":"account/api/src/rich_wallet.rs","rank":98,"score":236401.81016469415},{"content":"pub fn print_action_result(\n\n format: OutputFormat,\n\n result: Result<Value>,\n\n console_mode: bool,\n\n) -> Result<()> {\n\n match format {\n\n OutputFormat::JSON => {\n\n // if in console, and is err, print error directly.\n\n if console_mode && result.is_err() {\n\n println!(\"{}\", result.unwrap_err().to_string());\n\n return Ok(());\n\n }\n\n\n\n let value = match result {\n\n Ok(value) => json!({ \"ok\": value }),\n\n Err(err) => json!({\"err\": err.to_string()}),\n\n };\n\n print_json(value)\n\n }\n\n OutputFormat::TABLE => {\n\n match result {\n\n Ok(value) => print_table(value)?,\n\n // err may contains help message, so directly print err.\n\n Err(err) => println!(\"{}\", err.to_string()),\n\n };\n\n Ok(())\n\n }\n\n }\n\n}\n\n\n","file_path":"commons/scmd/src/result.rs","rank":99,"score":236012.88861608843}],"string":"[\n {\n \"content\": \"pub fn access_path_for_module_upgrade_strategy(address: AccountAddress) -> AccessPath {\\n\\n AccessPath::resource_access_path(address, ModuleUpgradeStrategy::struct_tag())\\n\\n}\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize)]\\n\\npub struct TwoPhaseUpgradeV2Resource {\\n\\n config: TwoPhaseUpgradeConfigResource,\\n\\n plan: Option<UpgradePlanV2Resource>,\\n\\n version_cap: ModifyConfigCapabilityResource,\\n\\n upgrade_event: EventHandle,\\n\\n}\\n\\nimpl TwoPhaseUpgradeV2Resource {\\n\\n pub fn enforced(&self) -> bool {\\n\\n match &self.plan {\\n\\n Some(plan) => plan.enforced,\\n\\n None => false,\\n\\n }\\n\\n }\\n\\n}\\n\\nimpl MoveResource for TwoPhaseUpgradeV2Resource {\\n\\n const MODULE_NAME: &'static str = \\\"PackageTxnManager\\\";\\n\\n const STRUCT_NAME: &'static str = \\\"TwoPhaseUpgradeV2\\\";\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm/types/src/account_config/resources/module_upgrade_strategy.rs\",\n \"rank\": 0,\n \"score\": 417676.32461471495\n },\n {\n \"content\": \"pub fn access_path_for_two_phase_upgrade_v2(address: AccountAddress) -> AccessPath {\\n\\n AccessPath::resource_access_path(address, TwoPhaseUpgradeV2Resource::struct_tag())\\n\\n}\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize)]\\n\\npub struct TwoPhaseUpgradeConfigResource {\\n\\n min_time_limit: u64,\\n\\n}\\n\\nimpl MoveResource for TwoPhaseUpgradeConfigResource {\\n\\n const MODULE_NAME: &'static str = \\\"PackageTxnManager\\\";\\n\\n const STRUCT_NAME: &'static str = \\\"TwoPhaseUpgradeConfig\\\";\\n\\n}\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize)]\\n\\npub struct UpgradePlanV2Resource {\\n\\n package_hash: Vec<u8>,\\n\\n active_after_time: u64,\\n\\n version: u64,\\n\\n enforced: bool,\\n\\n}\\n\\nimpl MoveResource for UpgradePlanV2Resource {\\n\\n const MODULE_NAME: &'static str = \\\"PackageTxnManager\\\";\\n\\n const STRUCT_NAME: &'static str = \\\"UpgradePlanV2\\\";\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm/types/src/account_config/resources/module_upgrade_strategy.rs\",\n \"rank\": 1,\n \"score\": 413162.00266730215\n },\n {\n \"content\": \"pub fn get_balance(address: AccountAddress, chain_state: &dyn ChainState) -> u128 {\\n\\n chain_state\\n\\n .get_balance(address)\\n\\n .expect(\\\"read balance resource should ok\\\")\\n\\n .unwrap_or_default()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test-helper/src/executor.rs\",\n \"rank\": 2,\n \"score\": 394306.63406488404\n },\n {\n \"content\": \"pub fn genesis_address() -> AccountAddress {\\n\\n CORE_CODE_ADDRESS\\n\\n}\\n\",\n \"file_path\": \"vm/types/src/account_config/constants/addresses.rs\",\n \"rank\": 4,\n \"score\": 363150.7785622754\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_state_proof() -> Result<()> {\\n\\n let s = MockStateNodeStore::new();\\n\\n let state = StateTree::new(Arc::new(s), None);\\n\\n assert_eq!(state.root_hash(), *SPARSE_MERKLE_PLACEHOLDER_HASH);\\n\\n\\n\\n let hash_value = HashValue::random().into();\\n\\n\\n\\n let account1 = update_nibble(&hash_value, 0, 1);\\n\\n // re-update to make sure account2 never equal to account1\\n\\n let account1 = update_nibble(&account1, 2, 1);\\n\\n\\n\\n let account2 = update_nibble(&account1, 2, 2);\\n\\n for (k, v) in vec![(account1, vec![0, 0, 0]), (account2, vec![1, 1, 1])] {\\n\\n state.put(k, v);\\n\\n }\\n\\n let (value, _) = state.get_with_proof(&account1)?;\\n\\n assert!(value.is_none());\\n\\n let new_root_hash = state.commit()?;\\n\\n let (value, proof) = state.get_with_proof(&account1)?;\\n\\n assert!(value.is_some());\\n\",\n \"file_path\": \"state/state-tree/src/state_tree_test.rs\",\n \"rank\": 5,\n \"score\": 352208.4928017484\n },\n {\n \"content\": \"pub fn get_sequence_number(addr: AccountAddress, chain_state: &dyn ChainState) -> u64 {\\n\\n chain_state\\n\\n .get_account_resource(addr)\\n\\n .expect(\\\"read account state should ok\\\")\\n\\n .map(|res| res.sequence_number())\\n\\n .unwrap_or_default()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test-helper/src/executor.rs\",\n \"rank\": 6,\n \"score\": 349142.2813541572\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_put_blob() -> Result<()> {\\n\\n let s = MockStateNodeStore::new();\\n\\n let state = StateTree::<HashValueKey>::new(Arc::new(s), None);\\n\\n assert_eq!(state.root_hash(), *SPARSE_MERKLE_PLACEHOLDER_HASH);\\n\\n\\n\\n let hash_value = HashValue::random().into();\\n\\n\\n\\n let account1 = update_nibble(&hash_value, 0, 1);\\n\\n let account1 = update_nibble(&account1, 2, 2);\\n\\n state.put(account1, vec![0, 0, 0]);\\n\\n\\n\\n assert_eq!(state.get(&account1)?, Some(vec![0, 0, 0]));\\n\\n assert_eq!(state.get(&update_nibble(&hash_value, 0, 8))?, None);\\n\\n\\n\\n let new_root_hash = state.commit()?;\\n\\n assert_eq!(state.root_hash(), new_root_hash);\\n\\n assert_eq!(state.get(&account1)?, Some(vec![0, 0, 0]));\\n\\n assert_eq!(state.get(&update_nibble(&hash_value, 0, 8))?, None);\\n\\n\\n\\n let (root, updates) = state.change_sets();\\n\",\n \"file_path\": \"state/state-tree/src/state_tree_test.rs\",\n \"rank\": 7,\n \"score\": 347816.01634253626\n },\n {\n \"content\": \"/// Get the AccessPath to a resource stored under `address` with type name `tag`\\n\\nfn create_access_path(address: AccountAddress, tag: StructTag) -> AccessPath {\\n\\n AccessPath::resource_access_path(address, tag)\\n\\n}\\n\",\n \"file_path\": \"vm/vm-runtime/src/lib.rs\",\n \"rank\": 8,\n \"score\": 344026.3415165982\n },\n {\n \"content\": \"pub fn deserialize_from_string<'de, D, R>(d: D) -> std::result::Result<R, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n R: FromStr + Deserialize<'de>,\\n\\n R::Err: Sized + std::error::Error,\\n\\n{\\n\\n if d.is_human_readable() {\\n\\n let s = <String>::deserialize(d)?;\\n\\n R::from_str(&s).map_err(D::Error::custom)\\n\\n } else {\\n\\n R::deserialize(d)\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests;\\n\",\n \"file_path\": \"commons/serde-helpers/src/lib.rs\",\n \"rank\": 10,\n \"score\": 319539.502068173\n },\n {\n \"content\": \"pub fn association_address() -> AccountAddress {\\n\\n AccountAddress::from_hex_literal(\\\"0xA550C18\\\")\\n\\n .expect(\\\"Parsing valid hex literal should always succeed\\\")\\n\\n}\\n\",\n \"file_path\": \"vm/types/src/account_config/constants/addresses.rs\",\n \"rank\": 11,\n \"score\": 318304.4707669556\n },\n {\n \"content\": \"#[stest::test]\\n\\nfn test_eth_state_proof_verify() -> Result<()> {\\n\\n let (chain_state, net) = prepare_genesis();\\n\\n // deploy the module\\n\\n {\\n\\n let source = include_str!(\\\"../../modules/EthStateVerifier.move\\\");\\n\\n let modules = compile_modules_with_address(association_address(), source);\\n\\n\\n\\n let package = Package::new(modules, None)?;\\n\\n association_execute(&net, &chain_state, TransactionPayload::Package(package))?;\\n\\n }\\n\\n\\n\\n // load the example proof\\n\\n let account_proof: EthAccount = {\\n\\n let proofs = include_str!(\\\"proof.json\\\");\\n\\n let value: serde_json::Value = serde_json::from_str(proofs)?;\\n\\n serde_json::from_value(value)?\\n\\n };\\n\\n\\n\\n // verify account proof\\n\\n {\\n\",\n \"file_path\": \"contrib-contracts/src/eth_state_verifier_test/mod.rs\",\n \"rank\": 12,\n \"score\": 317759.4803911141\n },\n {\n \"content\": \"#[ignore]\\n\\n#[test]\\n\\npub fn test_wallet_account() -> Result<()> {\\n\\n use bcs_ext::BCSCodec;\\n\\n use core::convert::{From, TryFrom};\\n\\n use starcoin_crypto::ed25519::{Ed25519PrivateKey, Ed25519PublicKey, Ed25519Signature};\\n\\n use starcoin_crypto::{hash::CryptoHash, HashValue};\\n\\n use starcoin_types::transaction::authenticator::AuthenticationKey;\\n\\n\\n\\n let bytes = hex::decode(\\\"2c78c6fd8829de80451cda02310250b27307360ddc972d614fa0c8462ae41b3e\\\")?;\\n\\n let private_key = Ed25519PrivateKey::try_from(&bytes[..])?;\\n\\n let public_key = Ed25519PublicKey::from(&private_key);\\n\\n\\n\\n let message = [1, 2, 3, 4];\\n\\n // need add fuzzing features on libra-crypto for this.\\n\\n let result = <Ed25519PrivateKey as SigningKey>::sign_arbitrary_message(&private_key, &message);\\n\\n\\n\\n let address = starcoin_types::account_address::from_public_key(&public_key);\\n\\n let hash_value = HashValue::sha3_256_of(&public_key.to_bytes());\\n\\n let key = AuthenticationKey::new(*HashValue::sha3_256_of(&public_key.to_bytes()).as_ref());\\n\\n\\n\\n let sign_bytes = vec![\\n\",\n \"file_path\": \"account/src/account_test.rs\",\n \"rank\": 14,\n \"score\": 315953.36221747356\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_import_account() -> Result<()> {\\n\\n let tempdir = tempfile::tempdir()?;\\n\\n let storage = AccountStorage::create_from_path(tempdir.path(), RocksdbConfig::default())?;\\n\\n let manager = AccountManager::new(storage)?;\\n\\n\\n\\n // should success\\n\\n let wallet = manager.create_account(\\\"hello\\\")?;\\n\\n let private_key = super::account_manager::gen_private_key();\\n\\n let result = manager.import_account(*wallet.address(), private_key.to_bytes().to_vec(), \\\"abc\\\");\\n\\n assert!(result.is_err());\\n\\n\\n\\n assert!(\\n\\n matches!(result.err().unwrap(), AccountError::AccountAlreadyExist(addr) if addr == *wallet.address())\\n\\n );\\n\\n\\n\\n let normal_address = AccountAddress::random();\\n\\n let _account =\\n\\n manager.import_account(normal_address, private_key.to_bytes().to_vec(), \\\"abc\\\")?;\\n\\n assert_eq!(manager.list_account_infos()?.len(), 2);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"account/src/account_test.rs\",\n \"rank\": 15,\n \"score\": 315953.36221747356\n },\n {\n \"content\": \"pub trait IntoSuper<Super: ?Sized> {\\n\\n fn as_super(&self) -> &Super;\\n\\n fn as_super_mut(&mut self) -> &mut Super;\\n\\n fn into_super(self: Box<Self>) -> Box<Super>;\\n\\n fn into_super_arc(self: Arc<Self>) -> Arc<Super>;\\n\\n}\\n\\n\\n\\nimpl<'a, T: 'a + StateNodeStore> IntoSuper<dyn StateNodeStore + 'a> for T {\\n\\n fn as_super(&self) -> &(dyn StateNodeStore + 'a) {\\n\\n self\\n\\n }\\n\\n fn as_super_mut(&mut self) -> &mut (dyn StateNodeStore + 'a) {\\n\\n self\\n\\n }\\n\\n fn into_super(self: Box<Self>) -> Box<dyn StateNodeStore + 'a> {\\n\\n self\\n\\n }\\n\\n fn into_super_arc(self: Arc<Self>) -> Arc<dyn StateNodeStore + 'a> {\\n\\n self\\n\\n }\\n\",\n \"file_path\": \"storage/src/lib.rs\",\n \"rank\": 16,\n \"score\": 315648.7462130314\n },\n {\n \"content\": \"pub fn core_code_address() -> AccountAddress {\\n\\n CORE_CODE_ADDRESS\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm/types/src/account_config/constants/addresses.rs\",\n \"rank\": 17,\n \"score\": 314392.43545395\n },\n {\n \"content\": \"/// Get the target of next pow work\\n\\npub fn get_next_work_required(chain: &dyn ChainReader) -> Result<U256> {\\n\\n let epoch = chain.epoch();\\n\\n let current_header = chain.current_header();\\n\\n if current_header.number() <= 1 {\\n\\n return Ok(difficult_to_target(current_header.difficulty()));\\n\\n }\\n\\n let start_window_num = if current_header.number() < epoch.block_difficulty_window() {\\n\\n 0\\n\\n } else {\\n\\n current_header\\n\\n .number()\\n\\n .saturating_sub(epoch.block_difficulty_window())\\n\\n .checked_add(1)\\n\\n .ok_or_else(|| format_err!(\\\"block number overflow\\\"))?\\n\\n };\\n\\n let blocks = (start_window_num\\n\\n ..current_header\\n\\n .number()\\n\\n .checked_add(1)\\n\\n .ok_or_else(|| format_err!(\\\"block number overflow\\\"))?)\\n\",\n \"file_path\": \"consensus/src/difficulty.rs\",\n \"rank\": 18,\n \"score\": 314186.43476823147\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_wallet() -> Result<()> {\\n\\n let tempdir = tempfile::tempdir()?;\\n\\n let storage = AccountStorage::create_from_path(tempdir.path(), RocksdbConfig::default())?;\\n\\n let manager = AccountManager::new(storage.clone())?;\\n\\n\\n\\n // should success\\n\\n let wallet = manager.create_account(\\\"hello\\\")?;\\n\\n\\n\\n let wallet_address = wallet.address();\\n\\n\\n\\n // test reload\\n\\n let loaded_wallet = Account::load(*wallet_address, \\\"hello\\\", storage)?;\\n\\n assert!(loaded_wallet.is_some());\\n\\n let reloaded_wallet = loaded_wallet.unwrap();\\n\\n assert_eq!(\\n\\n reloaded_wallet.private_key().to_bytes(),\\n\\n wallet.private_key().to_bytes()\\n\\n );\\n\\n\\n\\n // test default wallet\\n\",\n \"file_path\": \"account/src/account_test.rs\",\n \"rank\": 19,\n \"score\": 314175.16201696126\n },\n {\n \"content\": \"fn read_two_phase_upgrade_v2_resource(state_view: &dyn StateView) -> Result<bool> {\\n\\n let two_phase_upgrade_v2_path = access_path_for_two_phase_upgrade_v2(genesis_address());\\n\\n match state_view.get(&two_phase_upgrade_v2_path)? {\\n\\n Some(data) => Ok(bcs_ext::from_bytes::<TwoPhaseUpgradeV2Resource>(&data)?.enforced()),\\n\\n _ => Err(format_err!(\\\"read two phase upgrade resource fail.\\\")),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"executor/src/stdlib_test/module_upgrade_test.rs\",\n \"rank\": 20,\n \"score\": 311635.0169082418\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_wallet_unlock() -> Result<()> {\\n\\n let tempdir = tempfile::tempdir()?;\\n\\n let storage = AccountStorage::create_from_path(tempdir.path(), RocksdbConfig::default())?;\\n\\n let manager = AccountManager::new(storage)?;\\n\\n\\n\\n let wallet = manager.create_account(\\\"hello\\\")?;\\n\\n\\n\\n let unlock_result = manager.unlock_account(*wallet.address(), \\\"hell0\\\", Duration::from_secs(1));\\n\\n assert!(unlock_result.is_err());\\n\\n manager.unlock_account(*wallet.address(), \\\"hello\\\", Duration::from_secs(1))?;\\n\\n let fake_txn = RawUserTransaction::new_with_default_gas_token(\\n\\n *wallet.address(),\\n\\n 1,\\n\\n TransactionPayload::Script(Script::new(vec![], vec![], vec![])),\\n\\n 1000,\\n\\n 1,\\n\\n 100000,\\n\\n ChainId::new(1),\\n\\n );\\n\\n let _signed = manager.sign_txn(*wallet.address(), fake_txn)?;\\n\",\n \"file_path\": \"account/src/account_test.rs\",\n \"rank\": 21,\n \"score\": 309129.78826249356\n },\n {\n \"content\": \"pub fn deserialize_from_string_opt<'de, D, R>(d: D) -> std::result::Result<Option<R>, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n R: FromStr + Deserialize<'de>,\\n\\n R::Err: Sized + std::error::Error,\\n\\n{\\n\\n if d.is_human_readable() {\\n\\n let s = <Option<String>>::deserialize(d)?;\\n\\n s.map(|s| R::from_str(&s).map_err(D::Error::custom))\\n\\n .transpose()\\n\\n } else {\\n\\n Option::<R>::deserialize(d)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"commons/serde-helpers/src/lib.rs\",\n \"rank\": 22,\n \"score\": 307813.28584576526\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_state_commit() -> Result<()> {\\n\\n let s = MockStateNodeStore::new();\\n\\n let state = StateTree::new(Arc::new(s), None);\\n\\n assert_eq!(state.root_hash(), *SPARSE_MERKLE_PLACEHOLDER_HASH);\\n\\n\\n\\n let hash_value = HashValue::random().into();\\n\\n\\n\\n let account1 = update_nibble(&hash_value, 0, 1);\\n\\n let account1 = update_nibble(&account1, 2, 2);\\n\\n state.put(account1, vec![0, 0, 0]);\\n\\n let _new_root_hash = state.commit()?;\\n\\n\\n\\n let account3 = update_nibble(&account1, 2, 3);\\n\\n for (k, v) in vec![(account1, vec![1, 1, 0]), (account3, vec![0, 0, 0])] {\\n\\n state.put(k, v);\\n\\n }\\n\\n let new_root_hash = state.commit()?;\\n\\n\\n\\n state.flush()?;\\n\\n assert_eq!(state.root_hash(), new_root_hash);\\n\\n assert_eq!(state.get(&account1)?, Some(vec![1, 1, 0]));\\n\\n assert_eq!(state.get(&account3)?, Some(vec![0, 0, 0]));\\n\\n assert_eq!(state.get(&update_nibble(&account1, 2, 10))?, None);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"state/state-tree/src/state_tree_test.rs\",\n \"rank\": 23,\n \"score\": 307283.2099750214\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_state_dump() -> Result<()> {\\n\\n let s = MockStateNodeStore::new();\\n\\n let state = StateTree::new(Arc::new(s), None);\\n\\n let hash_value = HashValueKey(HashValue::random());\\n\\n let value = vec![1u8, 2u8];\\n\\n state.put(hash_value, value);\\n\\n state.commit()?;\\n\\n let state_set = state.dump()?;\\n\\n assert_eq!(1, state_set.len());\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"state/state-tree/src/state_tree_test.rs\",\n \"rank\": 24,\n \"score\": 307283.2099750214\n },\n {\n \"content\": \"pub fn encode(idx: u64, address: AccountAddress, amount: u128) -> anyhow::Result<Vec<u8>> {\\n\\n let mut index = bcs_ext::to_bytes(&idx)?;\\n\\n let mut address = bcs_ext::to_bytes(&address)?;\\n\\n let mut amount = bcs_ext::to_bytes(&amount)?;\\n\\n index.append(&mut address);\\n\\n index.append(&mut amount);\\n\\n Ok(index)\\n\\n}\\n\\n\\n\\npub struct Sha3Algorithm(Sha3);\\n\\n\\n\\nimpl Default for Sha3Algorithm {\\n\\n fn default() -> Self {\\n\\n Self(Sha3::sha3_256())\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Hasher for Sha3Algorithm {\\n\\n #[inline]\\n\\n fn finish(&self) -> u64 {\\n\",\n \"file_path\": \"cmd/merkle-generator/src/lib.rs\",\n \"rank\": 25,\n \"score\": 305234.96420436946\n },\n {\n \"content\": \"pub fn generate_server_module(rpc_trait: &mut ItemTrait) -> anyhow::Result<TokenStream> {\\n\\n let delegate_methods: Vec<TokenStream> = rpc_trait\\n\\n .items\\n\\n .iter()\\n\\n .filter_map(|trait_item| {\\n\\n if let syn::TraitItem::Method(method) = trait_item {\\n\\n Some(generate_to_delegate(method))\\n\\n } else {\\n\\n None\\n\\n }\\n\\n })\\n\\n .collect();\\n\\n let mut rpc_server_trait = rpc_trait.clone();\\n\\n let io_delegate_type = quote!(network_rpc_core::delegates::IoDelegate);\\n\\n let to_delegate_body = quote! {\\n\\n let mut del = #io_delegate_type::new(self.into());\\n\\n #(#delegate_methods)*\\n\\n del\\n\\n };\\n\\n let to_delegate_method: syn::TraitItemMethod = parse_quote! {\\n\",\n \"file_path\": \"network-rpc/derive/src/to_server.rs\",\n \"rank\": 26,\n \"score\": 304671.18195318675\n },\n {\n \"content\": \"pub fn print_table(value: Value) -> Result<()> {\\n\\n if value.is_null() {\\n\\n return Ok(());\\n\\n }\\n\\n match value {\\n\\n Value::Array(values) => print_vec_table(values),\\n\\n value => print_value_table(value),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"commons/scmd/src/result.rs\",\n \"rank\": 27,\n \"score\": 303267.5785138615\n },\n {\n \"content\": \"pub fn print_json(value: Value) -> Result<()> {\\n\\n let json = serde_json::to_string_pretty(&value)?;\\n\\n println!(\\\"{}\\\", json);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"commons/scmd/src/result.rs\",\n \"rank\": 28,\n \"score\": 303267.5785138615\n },\n {\n \"content\": \"#[test]\\n\\npub fn test_repeat_commit() -> Result<()> {\\n\\n let s = MockStateNodeStore::new();\\n\\n let state = StateTree::new(Arc::new(s), None);\\n\\n let hash_value = HashValueKey(HashValue::random());\\n\\n let value = vec![1u8, 2u8];\\n\\n state.put(hash_value, value.clone());\\n\\n state.commit()?;\\n\\n\\n\\n let root_hash1 = state.root_hash();\\n\\n state.put(hash_value, value);\\n\\n state.commit()?;\\n\\n let root_hash2 = state.root_hash();\\n\\n assert_eq!(root_hash1, root_hash2);\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"state/state-tree/src/state_tree_test.rs\",\n \"rank\": 29,\n \"score\": 302875.8623966829\n },\n {\n \"content\": \"/// Helper function to deserialize versions from above encoding.\\n\\nfn deserialize_u64_varint<T>(reader: &mut T) -> Result<u64>\\n\\nwhere\\n\\n T: Read,\\n\\n{\\n\\n let mut num = 0u64;\\n\\n for i in 0..8 {\\n\\n let byte = reader.read_u8()?;\\n\\n let more = (byte & 0x80) != 0;\\n\\n num |= u64::from(byte & 0x7f) << (i * 7);\\n\\n if !more {\\n\\n return Ok(num);\\n\\n }\\n\\n }\\n\\n // Last byte is encoded as is.\\n\\n let byte = reader.read_u8()?;\\n\\n num |= u64::from(byte) << 56;\\n\\n Ok(num)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"commons/forkable-jellyfish-merkle/src/node_type/mod.rs\",\n \"rank\": 30,\n \"score\": 301523.3785266625\n },\n {\n \"content\": \"pub trait HashAccountAddress {\\n\\n fn hash(&self) -> HashValue;\\n\\n}\\n\\n\\n\\nimpl HashAccountAddress for AccountAddress {\\n\\n fn hash(&self) -> HashValue {\\n\\n let mut state = hasher::AccountAddressHasher::default();\\n\\n state.update(self.as_ref());\\n\\n state.finish()\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use hex::FromHex;\\n\\n\\n\\n #[test]\\n\\n fn address_hash() {\\n\\n let address: AccountAddress = \\\"ca843279e3427144cead5e4d5999a3d0\\\".parse().unwrap();\\n\",\n \"file_path\": \"vm/types/src/account_address.rs\",\n \"rank\": 31,\n \"score\": 299171.8851595842\n },\n {\n \"content\": \"pub fn voting_period(state_view: &dyn StateView, token: TypeTag) -> u64 {\\n\\n let mut ret = execute_readonly_function(\\n\\n state_view,\\n\\n &ModuleId::new(genesis_address(), Identifier::new(\\\"Dao\\\").unwrap()),\\n\\n &Identifier::new(\\\"voting_period\\\").unwrap(),\\n\\n vec![token],\\n\\n vec![],\\n\\n )\\n\\n .unwrap();\\n\\n assert_eq!(ret.len(), 1);\\n\\n ret.pop().unwrap().1.cast().unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test-helper/src/dao.rs\",\n \"rank\": 32,\n \"score\": 297570.83185840165\n },\n {\n \"content\": \"pub fn quorum_vote(state_view: &dyn StateView, token: TypeTag) -> u128 {\\n\\n let mut ret = execute_readonly_function(\\n\\n state_view,\\n\\n &ModuleId::new(genesis_address(), Identifier::new(\\\"Dao\\\").unwrap()),\\n\\n &Identifier::new(\\\"quorum_votes\\\").unwrap(),\\n\\n vec![token],\\n\\n vec![],\\n\\n )\\n\\n .unwrap();\\n\\n assert_eq!(ret.len(), 1);\\n\\n ret.pop().unwrap().1.cast().unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test-helper/src/dao.rs\",\n \"rank\": 33,\n \"score\": 297570.83185840165\n },\n {\n \"content\": \"pub fn voting_delay(state_view: &dyn StateView, token: TypeTag) -> u64 {\\n\\n let mut ret = execute_readonly_function(\\n\\n state_view,\\n\\n &ModuleId::new(genesis_address(), Identifier::new(\\\"Dao\\\").unwrap()),\\n\\n &Identifier::new(\\\"voting_delay\\\").unwrap(),\\n\\n vec![token],\\n\\n vec![],\\n\\n )\\n\\n .unwrap();\\n\\n assert_eq!(ret.len(), 1);\\n\\n ret.pop().unwrap().1.cast().unwrap()\\n\\n}\\n\",\n \"file_path\": \"test-helper/src/dao.rs\",\n \"rank\": 34,\n \"score\": 297570.83185840165\n },\n {\n \"content\": \"/// Output transaction builders in Rust for the given ABIs.\\n\\n/// If `local_types` is true, we generate a file suitable for the Diem codebase itself\\n\\n/// rather than using serde-generated, standalone definitions.\\n\\npub fn output(out: &mut dyn Write, abis: &[ScriptABI], local_types: bool) -> Result<()> {\\n\\n let mut emitter = RustEmitter {\\n\\n out: IndentedWriter::new(out, IndentConfig::Space(4)),\\n\\n local_types,\\n\\n };\\n\\n\\n\\n emitter.output_preamble()?;\\n\\n emitter.output_script_call_enum_with_imports(abis)?;\\n\\n\\n\\n emitter.output_transaction_script_impl(&common::transaction_script_abis(abis))?;\\n\\n emitter.output_script_function_impl(&common::script_function_abis(abis))?;\\n\\n\\n\\n for abi in abis {\\n\\n emitter.output_script_encoder_function(abi)?;\\n\\n }\\n\\n\\n\\n for abi in abis {\\n\\n emitter.output_script_decoder_function(abi)?;\\n\\n }\\n\\n\\n\\n emitter.output_transaction_script_decoder_map(&common::transaction_script_abis(abis))?;\\n\\n emitter.output_script_function_decoder_map(&common::script_function_abis(abis))?;\\n\\n emitter.output_decoding_helpers(abis)?;\\n\\n\\n\\n for abi in &common::transaction_script_abis(abis) {\\n\\n emitter.output_code_constant(abi)?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm/transaction-builder-generator/src/rust.rs\",\n \"rank\": 35,\n \"score\": 295215.4833596454\n },\n {\n \"content\": \"pub fn current_block_number(state_view: &dyn StateView) -> u64 {\\n\\n let mut ret = execute_readonly_function(\\n\\n state_view,\\n\\n &ModuleId::new(genesis_address(), Identifier::new(\\\"Block\\\").unwrap()),\\n\\n &Identifier::new(\\\"get_current_block_number\\\").unwrap(),\\n\\n vec![],\\n\\n vec![],\\n\\n )\\n\\n .unwrap();\\n\\n assert_eq!(ret.len(), 1);\\n\\n ret.pop().unwrap().1.cast().unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test-helper/src/executor.rs\",\n \"rank\": 36,\n \"score\": 294093.5221516206\n },\n {\n \"content\": \"pub fn min_action_delay(state_view: &dyn StateView, token: TypeTag) -> u64 {\\n\\n let mut ret = execute_readonly_function(\\n\\n state_view,\\n\\n &ModuleId::new(genesis_address(), Identifier::new(\\\"Dao\\\").unwrap()),\\n\\n &Identifier::new(\\\"min_action_delay\\\").unwrap(),\\n\\n vec![token],\\n\\n vec![],\\n\\n )\\n\\n .unwrap();\\n\\n assert_eq!(ret.len(), 1);\\n\\n ret.pop().unwrap().1.cast().unwrap()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test-helper/src/dao.rs\",\n \"rank\": 37,\n \"score\": 294049.81674028025\n },\n {\n \"content\": \"pub fn make_genesis_accounts() -> BTreeMap<String, Account> {\\n\\n let mut m = BTreeMap::new();\\n\\n m.insert(ASSOCIATION_NAME.to_string(), Account::new_association());\\n\\n m.insert(\\n\\n GENESIS_NAME.to_string(),\\n\\n Account::new_genesis_account(genesis_address()),\\n\\n );\\n\\n m\\n\\n}\\n\",\n \"file_path\": \"vm/functional-tests/src/genesis_accounts.rs\",\n \"rank\": 38,\n \"score\": 290968.00809411256\n },\n {\n \"content\": \"/// Output a header-only library providing C++ transaction builders for the given ABIs.\\n\\npub fn output(out: &mut dyn Write, abis: &[ScriptABI], namespace: Option<&str>) -> Result<()> {\\n\\n let mut emitter = CppEmitter {\\n\\n out: IndentedWriter::new(out, IndentConfig::Space(4)),\\n\\n namespace,\\n\\n inlined_definitions: true,\\n\\n };\\n\\n emitter.output_preamble()?;\\n\\n emitter.output_open_namespace()?;\\n\\n emitter.output_using_namespaces()?;\\n\\n for abi in abis {\\n\\n match abi {\\n\\n ScriptABI::TransactionScript(abi) => {\\n\\n emitter.output_transaction_script_builder_definition(abi)?\\n\\n }\\n\\n ScriptABI::ScriptFunction(abi) => emitter.output_script_fun_builder_definition(abi)?,\\n\\n };\\n\\n }\\n\\n emitter.output_close_namespace()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm/transaction-builder-generator/src/cpp.rs\",\n \"rank\": 39,\n \"score\": 290170.12903166376\n },\n {\n \"content\": \"pub fn to_bytes<T>(value: &T) -> Result<Vec<u8>>\\n\\nwhere\\n\\n T: ?Sized + Serialize,\\n\\n{\\n\\n bcs::to_bytes(value).map_err(|e| e.into())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"commons/bcs_ext/src/lib.rs\",\n \"rank\": 40,\n \"score\": 288268.9632115961\n },\n {\n \"content\": \"pub fn from_public_key(public_key: &Ed25519PublicKey) -> AccountAddress {\\n\\n AuthenticationKey::ed25519(public_key).derived_address()\\n\\n}\\n\",\n \"file_path\": \"types/src/account_address.rs\",\n \"rank\": 41,\n \"score\": 287019.105758151\n },\n {\n \"content\": \"#[test]\\n\\nfn test_state_proof() -> Result<()> {\\n\\n let storage = MockStateNodeStore::new();\\n\\n let chain_state_db = ChainStateDB::new(Arc::new(storage), None);\\n\\n let access_path = AccessPath::random_resource();\\n\\n let state0 = random_bytes();\\n\\n chain_state_db.apply_write_set(to_write_set(access_path.clone(), state0.clone()))?;\\n\\n\\n\\n let state_root = chain_state_db.commit()?;\\n\\n let state1 = chain_state_db.get(&access_path)?;\\n\\n assert!(state1.is_some());\\n\\n assert_eq!(state0, state1.unwrap());\\n\\n println!(\\\"{}\\\", access_path.address.key_hash());\\n\\n println!(\\\"{}\\\", access_path.key_hash());\\n\\n let state_with_proof = chain_state_db.get_with_proof(&access_path)?;\\n\\n println!(\\\"{:?}\\\", state_with_proof);\\n\\n state_with_proof\\n\\n .proof\\n\\n .verify(state_root, access_path, state_with_proof.state.as_deref())?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"state/statedb/src/tests.rs\",\n \"rank\": 42,\n \"score\": 286981.308996017\n },\n {\n \"content\": \"fn to_write_set(access_path: AccessPath, value: Vec<u8>) -> WriteSet {\\n\\n WriteSetMut::new(vec![(access_path, WriteOp::Value(value))])\\n\\n .freeze()\\n\\n .expect(\\\"freeze write_set must success.\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"state/statedb/src/tests.rs\",\n \"rank\": 43,\n \"score\": 284414.4658332745\n },\n {\n \"content\": \"pub fn compile_modules_with_address(address: AccountAddress, code: &str) -> Vec<Module> {\\n\\n let temp_dir = temp_path();\\n\\n let stdlib_files =\\n\\n restore_stdlib_in_dir(temp_dir.path()).expect(\\\"get stdlib modules should be ok\\\");\\n\\n let compiled_result =\\n\\n starcoin_move_compiler::compile_source_string_no_report(code, &stdlib_files, address)\\n\\n .expect(\\\"compile fail\\\")\\n\\n .1\\n\\n .expect(\\\"compile fail\\\");\\n\\n compiled_result\\n\\n .into_iter()\\n\\n .map(|m| Module::new(m.serialize()))\\n\\n .collect()\\n\\n}\\n\",\n \"file_path\": \"test-helper/src/executor.rs\",\n \"rank\": 44,\n \"score\": 284320.46653935604\n },\n {\n \"content\": \"fn bench_get_with_proof(c: &mut Criterion) {\\n\\n ::logger::init();\\n\\n let tmp_dir = starcoin_config::temp_path();\\n\\n let db_store = new_empty_store(tmp_dir.as_ref()) as Arc<dyn StateNodeStore>;\\n\\n\\n\\n let mem_store = Arc::new(MockStateNodeStore::new()) as Arc<dyn StateNodeStore>;\\n\\n\\n\\n let mut group = c.benchmark_group(\\\"get_with_proof\\\");\\n\\n for (id, s) in [(\\\"mem_store\\\", mem_store), (\\\"db_store\\\", db_store)].iter() {\\n\\n let tree = StateTree::new(s.clone(), None);\\n\\n let (kvs, _root) = prepare_tree(&tree, &[1, 2, 3, 4], 100_000);\\n\\n let ks = kvs.keys().copied().collect::<Vec<_>>();\\n\\n group\\n\\n .bench_with_input(*id, &(tree, kvs, ks), |b, input| {\\n\\n let (tree, kvs, ks) = input;\\n\\n let k_len = ks.len();\\n\\n let mut i = 0usize;\\n\\n b.iter_with_setup(\\n\\n || {\\n\\n let k = &ks[i % k_len];\\n\",\n \"file_path\": \"benchmarks/benches/bench_state_tree.rs\",\n \"rank\": 45,\n \"score\": 283724.5231293807\n },\n {\n \"content\": \"pub fn from_public_key(public_key: &Ed25519PublicKey) -> AccountAddress {\\n\\n AuthenticationKey::ed25519(public_key).derived_address()\\n\\n}\\n\\n\\n\\n// Define the Hasher used for hashing AccountAddress types. In order to properly use the\\n\\n// CryptoHasher derive macro we need to have this in its own module so that it doesn't conflict\\n\\n// with the imported `AccountAddress` from move-core-types. It needs to have the same name since\\n\\n// the hash salt is calculated using the name of the type.\\n\\nmod hasher {\\n\\n use starcoin_crypto::hash::CryptoHasher;\\n\\n #[derive(serde::Deserialize, CryptoHasher)]\\n\\n struct AccountAddress;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm/types/src/account_address.rs\",\n \"rank\": 46,\n \"score\": 283271.0410197339\n },\n {\n \"content\": \"fn get_epoch_from_statedb(statedb: &ChainStateDB) -> Result<Epoch> {\\n\\n let account_reader = AccountStateReader::new(statedb);\\n\\n account_reader\\n\\n .get_resource::<Epoch>(genesis_address())?\\n\\n .ok_or_else(|| format_err!(\\\"Epoch is none.\\\"))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"chain/src/chain.rs\",\n \"rank\": 47,\n \"score\": 281234.07403724926\n },\n {\n \"content\": \"pub trait TokenUnit: Clone + Copy {\\n\\n fn symbol(&self) -> &'static str;\\n\\n\\n\\n fn scale(&self) -> u32;\\n\\n\\n\\n fn scaling_factor(&self) -> u128 {\\n\\n 10u32.pow(self.scale()) as u128\\n\\n }\\n\\n\\n\\n fn scaling(&self, value: u128) -> u128 {\\n\\n self.scaling_factor() * value\\n\\n }\\n\\n\\n\\n fn split(&self, value: u128) -> (u128, u128) {\\n\\n let scaling_factor = self.scaling_factor();\\n\\n if value >= scaling_factor {\\n\\n let h = value / scaling_factor;\\n\\n let l = value - (h * scaling_factor);\\n\\n (h, l)\\n\\n } else {\\n\",\n \"file_path\": \"vm/types/src/token/token_value.rs\",\n \"rank\": 48,\n \"score\": 281046.95716688957\n },\n {\n \"content\": \"/// `StateView` is a trait that defines a read-only snapshot of the global state. It is passed to\\n\\n/// the VM for transaction execution, during which the VM is guaranteed to read anything at the\\n\\n/// given state.\\n\\npub trait StateView {\\n\\n /// Gets the state for a single access path.\\n\\n fn get(&self, access_path: &AccessPath) -> Result<Option<Vec<u8>>>;\\n\\n\\n\\n /// Gets states for a list of access paths.\\n\\n fn multi_get(&self, access_paths: &[AccessPath]) -> Result<Vec<Option<Vec<u8>>>>;\\n\\n\\n\\n /// VM needs this method to know whether the current state view is for genesis state creation.\\n\\n /// Currently TransactionPayload::WriteSet is only valid for genesis state creation.\\n\\n fn is_genesis(&self) -> bool;\\n\\n}\\n\",\n \"file_path\": \"vm/types/src/state_view.rs\",\n \"rank\": 49,\n \"score\": 279881.584506251\n },\n {\n \"content\": \"pub fn account_struct_tag() -> StructTag {\\n\\n StructTag {\\n\\n address: CORE_CODE_ADDRESS,\\n\\n module: ACCOUNT_MODULE_IDENTIFIER.clone(),\\n\\n name: ACCOUNT_STRUCT_NAME.to_owned(),\\n\\n type_params: vec![],\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"vm/types/src/account_config/constants/account.rs\",\n \"rank\": 50,\n \"score\": 278290.6472724031\n },\n {\n \"content\": \"pub fn get_free_mem_size() -> Result<u64> {\\n\\n let sys = System::new();\\n\\n let free = match sys.memory() {\\n\\n Ok(mem) => mem.free.as_u64(),\\n\\n Err(_x) => 0u64,\\n\\n };\\n\\n Ok(free)\\n\\n}\\n\",\n \"file_path\": \"commons/system/src/lib.rs\",\n \"rank\": 51,\n \"score\": 276808.8209477427\n },\n {\n \"content\": \"fn check_data<T: Sample + Serialize + DeserializeOwned + PartialEq>() -> Result<T> {\\n\\n let type_name = type_name::<T>();\\n\\n ensure!(\\n\\n T::sample() == T::sample(),\\n\\n \\\"Type {}'s sample return result is not stable.\\\"\\n\\n );\\n\\n if let Some(t) = read_and_check_data::<T>()? {\\n\\n info!(\\\"Check {} ok\\\", type_name);\\n\\n Ok(t)\\n\\n } else {\\n\\n let t = T::sample();\\n\\n write_data(&t)?;\\n\\n Ok(t)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"test-helper/tests/types_check.rs\",\n \"rank\": 52,\n \"score\": 274925.47671293153\n },\n {\n \"content\": \"/// This produces the genesis block\\n\\npub fn genesis_strategy(storage: Arc<Storage>) -> impl Strategy<Value = Block> {\\n\\n let net = &ChainNetwork::new_test();\\n\\n let genesis = Genesis::load(net).unwrap();\\n\\n genesis.execute_genesis_block(net, storage).unwrap();\\n\\n Just(genesis.block().clone())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"chain/tests/block_test_utils.rs\",\n \"rank\": 53,\n \"score\": 274548.401495822\n },\n {\n \"content\": \"pub fn run(mut args: Args, xctx: XContext) -> Result<()> {\\n\\n let config = xctx.config();\\n\\n\\n\\n let mut packages = args.package_args.to_selected_packages(&xctx)?;\\n\\n if args.unit {\\n\\n packages.add_excludes(config.system_tests().iter().map(|(p, _)| p.as_str()));\\n\\n }\\n\\n\\n\\n args.args.extend(args.testname.clone());\\n\\n\\n\\n let generate_coverage = args.html_cov_dir.is_some() || args.html_lcov_dir.is_some();\\n\\n\\n\\n let env_vars: &[(&str, Option<&str>)] = if generate_coverage {\\n\\n if !xctx.installer().install_if_needed(\\\"grcov\\\") {\\n\\n return Err(anyhow!(\\\"Could not install grcov\\\"));\\n\\n }\\n\\n info!(\\\"Running \\\\\\\"cargo clean\\\\\\\" before collecting coverage\\\");\\n\\n let mut clean_cmd = Command::new(\\\"cargo\\\");\\n\\n clean_cmd.arg(\\\"clean\\\");\\n\\n clean_cmd.output()?;\\n\",\n \"file_path\": \"devtools/x/src/test.rs\",\n \"rank\": 54,\n \"score\": 273378.95643422706\n },\n {\n \"content\": \"fn get_epoch_data_from_statedb(statedb: &ChainStateDB) -> Result<EpochData> {\\n\\n let account_reader = AccountStateReader::new(statedb);\\n\\n account_reader\\n\\n .get_resource::<EpochData>(genesis_address())?\\n\\n .ok_or_else(|| format_err!(\\\"Epoch is none.\\\"))\\n\\n}\\n\",\n \"file_path\": \"chain/src/chain.rs\",\n \"rank\": 55,\n \"score\": 273049.01271969447\n },\n {\n \"content\": \"fn read_and_check_data<T: Serialize + DeserializeOwned + PartialEq>() -> Result<Option<T>> {\\n\\n let data_path = data_file::<T>();\\n\\n let json_path = json_file::<T>();\\n\\n if data_path.exists() && json_path.exists() {\\n\\n debug!(\\\"Read data from {:?}\\\", data_path);\\n\\n let data = hex::decode(std::fs::read_to_string(data_path)?.as_str())?;\\n\\n let data_t = bcs_ext::from_bytes::<T>(data.as_slice())?;\\n\\n let json_t = serde_json::from_str::<T>(std::fs::read_to_string(json_path)?.as_str())?;\\n\\n ensure!(\\n\\n data_t == json_t,\\n\\n \\\"{}'s bcs and json serialize data is not equals.\\\",\\n\\n type_name::<T>()\\n\\n );\\n\\n\\n\\n let new_data = bcs_ext::to_bytes(&data_t)?;\\n\\n ensure!(\\n\\n data == new_data,\\n\\n \\\"Check type {}'s serialize/deserialize fail, expect:{}, got: {}\\\",\\n\\n type_name::<T>(),\\n\\n hex::encode(data),\\n\\n hex::encode(new_data)\\n\\n );\\n\\n Ok(Some(data_t))\\n\\n } else {\\n\\n Ok(None)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test-helper/tests/types_check.rs\",\n \"rank\": 56,\n \"score\": 270452.87769768655\n },\n {\n \"content\": \"pub trait ValueCodec: Clone + Sized + Debug + std::marker::Send + std::marker::Sync {\\n\\n /// Converts `self` to bytes to be stored in DB.\\n\\n fn encode_value(&self) -> Result<Vec<u8>>;\\n\\n /// Converts bytes fetched from DB to `Self`.\\n\\n fn decode_value(data: &[u8]) -> Result<Self>;\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub enum WriteOp<V> {\\n\\n Value(V),\\n\\n Deletion,\\n\\n}\\n\\n\\n\\nimpl<V> WriteOp<V>\\n\\nwhere\\n\\n V: ValueCodec,\\n\\n{\\n\\n pub fn into_raw_op(self) -> Result<WriteOp<Vec<u8>>> {\\n\\n Ok(match self {\\n\\n WriteOp::Value(v) => WriteOp::Value(v.encode_value()?),\\n\",\n \"file_path\": \"storage/src/storage.rs\",\n \"rank\": 57,\n \"score\": 270004.96153614065\n },\n {\n \"content\": \"pub fn blockmeta_execute(state: &ChainStateDB, meta: BlockMetadata) -> Result<TransactionOutput> {\\n\\n let txn = Transaction::BlockMetadata(meta);\\n\\n let output = execute_and_apply(state, txn);\\n\\n if let TransactionStatus::Discard(s) = output.status() {\\n\\n bail!(\\\"txn discard, status: {:?}\\\", s);\\n\\n }\\n\\n\\n\\n Ok(output)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test-helper/src/executor.rs\",\n \"rank\": 58,\n \"score\": 268874.21291581413\n },\n {\n \"content\": \"pub trait TaskState: Sized + Clone + std::marker::Unpin + std::marker::Send {\\n\\n type Item: Debug + std::marker::Send;\\n\\n\\n\\n fn task_name() -> &'static str {\\n\\n type_name::<Self>()\\n\\n }\\n\\n fn new_sub_task(self) -> BoxFuture<'static, Result<Vec<Self::Item>>>;\\n\\n fn next(&self) -> Option<Self>;\\n\\n fn total_items(&self) -> Option<u64> {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests;\\n\",\n \"file_path\": \"commons/stream-task/src/lib.rs\",\n \"rank\": 59,\n \"score\": 268626.92295679863\n },\n {\n \"content\": \"pub trait RawKey: Clone + Ord {\\n\\n /// Raw key's hash, will used as tree's nibble path\\n\\n /// Directly use origin byte's sha3_256 hash, do not use CryptoHash to add salt.\\n\\n fn key_hash(&self) -> HashValue {\\n\\n HashValue::sha3_256_of(\\n\\n self.encode_key()\\n\\n .expect(\\\"Serialize key failed when hash.\\\")\\n\\n .as_slice(),\\n\\n )\\n\\n }\\n\\n\\n\\n /// Encode the raw key, the raw key's bytes will store to leaf node.\\n\\n fn encode_key(&self) -> Result<Vec<u8>>;\\n\\n\\n\\n fn decode_key(bytes: &[u8]) -> Result<Self>;\\n\\n}\\n\\n\\n\\nimpl<T> RawKey for T\\n\\nwhere\\n\\n T: Clone + Ord + Serialize + DeserializeOwned,\\n\",\n \"file_path\": \"commons/forkable-jellyfish-merkle/src/lib.rs\",\n \"rank\": 60,\n \"score\": 267985.91973988723\n },\n {\n \"content\": \"pub fn create_new_block(\\n\\n chain: &BlockChain,\\n\\n account: &Account,\\n\\n txns: Vec<SignedUserTransaction>,\\n\\n) -> Result<Block> {\\n\\n let (template, _) = chain.create_block_template(\\n\\n *account.address(),\\n\\n Some(account.auth_key()),\\n\\n None,\\n\\n txns,\\n\\n vec![],\\n\\n None,\\n\\n )?;\\n\\n chain\\n\\n .consensus()\\n\\n .create_block(template, chain.time_service().as_ref())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"chain/tests/test_epoch_switch.rs\",\n \"rank\": 61,\n \"score\": 266593.0390970136\n },\n {\n \"content\": \"fn build_rows(values: &[Value]) -> Result<(Vec<Row>, Box<dyn RowBuilder>)> {\\n\\n let bold = CellFormat::builder().bold(true).build();\\n\\n let mut rows = vec![];\\n\\n let mut field_names = Vec::new();\\n\\n let is_simple = |value: &Value| value.is_number() || value.is_boolean() || value.is_string();\\n\\n let mut exist_not_simple = false;\\n\\n for value in values {\\n\\n if is_simple(value) {\\n\\n rows.push(Row::new(vec![Cell::new(\\\"Result\\\", bold)]));\\n\\n } else {\\n\\n exist_not_simple = true;\\n\\n let mut flat = json!({});\\n\\n flatten(value, &mut flat, None, true, None)\\n\\n .map_err(|e| anyhow::Error::msg(e.description().to_string()))?;\\n\\n let obj = flat.as_object().expect(\\\"must be a object\\\");\\n\\n let mut cells = vec![];\\n\\n obj.keys().for_each(|key| {\\n\\n cells.push(Cell::new(key, bold));\\n\\n if !field_names.contains(key) {\\n\\n field_names.push(key.to_string());\\n\",\n \"file_path\": \"commons/scmd/src/result.rs\",\n \"rank\": 62,\n \"score\": 263674.07663652225\n },\n {\n \"content\": \"#[stest::test]\\n\\nfn test_find_ancestor_genesis() -> Result<()> {\\n\\n let mut mock_chain = MockChain::new(ChainNetwork::new_test())?;\\n\\n mock_chain.produce_and_apply_times(3)?;\\n\\n\\n\\n let mut mock_chain2 = MockChain::new(ChainNetwork::new_test())?;\\n\\n mock_chain2.produce_and_apply_times(4)?;\\n\\n let ancestor = mock_chain.head().find_ancestor(mock_chain2.head())?;\\n\\n assert!(ancestor.is_some());\\n\\n assert_eq!(ancestor.unwrap().number, 0);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"chain/tests/test_block_chain.rs\",\n \"rank\": 63,\n \"score\": 262717.17328976706\n },\n {\n \"content\": \"/// State sequence number client\\n\\npub trait AccountSeqNumberClient: fmt::Debug + Clone + Any {\\n\\n /// Fetch only account nonce for given sender.\\n\\n fn account_seq_number(&self, address: &Address) -> SeqNumber;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"txpool/src/pool/client.rs\",\n \"rank\": 64,\n \"score\": 262308.76254803536\n },\n {\n \"content\": \"pub fn deserialize<'de, D>(deserializer: D) -> Result<Vec<Vec<u8>>, D::Error>\\n\\nwhere\\n\\n D: Deserializer<'de>,\\n\\n{\\n\\n Ok(<Vec<serde_bytes::ByteBuf>>::deserialize(deserializer)?\\n\\n .into_iter()\\n\\n .map(serde_bytes::ByteBuf::into_vec)\\n\\n .collect())\\n\\n}\\n\",\n \"file_path\": \"vm/types/src/serde_helper/vec_bytes.rs\",\n \"rank\": 65,\n \"score\": 261977.32754900763\n },\n {\n \"content\": \"pub fn transaction_execution(c: &mut Criterion) {\\n\\n ::logger::init();\\n\\n let mut group = c.benchmark_group(\\\"vm\\\");\\n\\n group.sample_size(10);\\n\\n let bench_id = \\\"transaction_execution\\\";\\n\\n for i in vec![1u64, 5, 10, 20, 50].into_iter() {\\n\\n group.bench_function(BenchmarkId::new(bench_id, i), |b| {\\n\\n b.iter(|| run_benchmark(20, 1_000_000, i as usize, 1))\\n\\n });\\n\\n }\\n\\n}\\n\\n\\n\\ncriterion_group!(starcoin_vm_benches, transaction_execution);\\n\\ncriterion_main!(starcoin_vm_benches);\\n\",\n \"file_path\": \"benchmarks/benches/bench_vm.rs\",\n \"rank\": 66,\n \"score\": 261810.95831577142\n },\n {\n \"content\": \"pub fn convert_changeset_and_events_cached<C: AccessPathCache>(\\n\\n ap_cache: &mut C,\\n\\n changeset: MoveChangeSet,\\n\\n events: Vec<MoveEvent>,\\n\\n) -> Result<(WriteSet, Vec<ContractEvent>), VMStatus> {\\n\\n // TODO: Cache access path computations if necessary.\\n\\n let mut ops = vec![];\\n\\n\\n\\n for (addr, account_changeset) in changeset.accounts {\\n\\n for (struct_tag, blob_opt) in account_changeset.resources {\\n\\n let ap = ap_cache.get_resource_path(addr, struct_tag);\\n\\n let op = match blob_opt {\\n\\n None => WriteOp::Deletion,\\n\\n Some(blob) => WriteOp::Value(blob),\\n\\n };\\n\\n ops.push((ap, op))\\n\\n }\\n\\n\\n\\n for (name, blob_opt) in account_changeset.modules {\\n\\n let ap = ap_cache.get_module_path(ModuleId::new(addr, name));\\n\",\n \"file_path\": \"vm/vm-runtime/src/starcoin_vm.rs\",\n \"rank\": 67,\n \"score\": 260676.84409480722\n },\n {\n \"content\": \"pub fn from_bytes<'a, T>(bytes: &'a [u8]) -> Result<T>\\n\\nwhere\\n\\n T: Deserialize<'a>,\\n\\n{\\n\\n bcs::from_bytes(bytes).map_err(|e| e.into())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"commons/bcs_ext/src/lib.rs\",\n \"rank\": 68,\n \"score\": 259419.1776502243\n },\n {\n \"content\": \"pub fn serialize<S>(data: &[Vec<u8>], serializer: S) -> Result<S::Ok, S::Error>\\n\\nwhere\\n\\n S: Serializer,\\n\\n{\\n\\n let mut seq = serializer.serialize_seq(Some(data.len()))?;\\n\\n for e in data {\\n\\n seq.serialize_element(serde_bytes::Bytes::new(e.as_slice()))?;\\n\\n }\\n\\n seq.end()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm/types/src/serde_helper/vec_bytes.rs\",\n \"rank\": 69,\n \"score\": 255378.3686716952\n },\n {\n \"content\": \"#[async_trait::async_trait]\\n\\npub trait ChainStateAsyncService: Clone + std::marker::Unpin + Send + Sync {\\n\\n async fn get(self, access_path: AccessPath) -> Result<Option<Vec<u8>>>;\\n\\n\\n\\n async fn get_with_proof(self, access_path: AccessPath) -> Result<StateWithProof>;\\n\\n\\n\\n async fn get_resource<R>(self, address: AccountAddress) -> Result<Option<R>>\\n\\n where\\n\\n R: MoveResource + DeserializeOwned,\\n\\n {\\n\\n let access_path = AccessPath::new(address, R::resource_path());\\n\\n let r = self.get(access_path).await.and_then(|state| match state {\\n\\n Some(state) => Ok(Some(bcs_ext::from_bytes::<R>(state.as_slice())?)),\\n\\n None => Ok(None),\\n\\n })?;\\n\\n Ok(r)\\n\\n }\\n\\n\\n\\n async fn get_account_state(self, address: AccountAddress) -> Result<Option<AccountState>>;\\n\\n\\n\\n /// get account stateset on state_root(if empty, use current state root).\\n\",\n \"file_path\": \"state/api/src/lib.rs\",\n \"rank\": 70,\n \"score\": 254677.3133500325\n },\n {\n \"content\": \"pub trait Solver: Send + DynClone {\\n\\n fn solve(\\n\\n &mut self,\\n\\n strategy: ConsensusStrategy,\\n\\n minting_blob: &[u8],\\n\\n diff: U256,\\n\\n nonce_tx: UnboundedSender<(Vec<u8>, u32)>,\\n\\n stop_rx: UnboundedReceiver<bool>,\\n\\n );\\n\\n}\\n\\n\\n\\n#[derive(Clone, Debug, Message)]\\n\\n#[rtype(result = \\\"Result<()>\\\")]\\n\\npub struct SealEvent {\\n\\n minting_blob: Vec<u8>,\\n\\n nonce: u32,\\n\\n extra: BlockHeaderExtra,\\n\\n}\\n\",\n \"file_path\": \"cmd/miner_client/src/lib.rs\",\n \"rank\": 71,\n \"score\": 252888.7650050032\n },\n {\n \"content\": \"pub fn rpc_impl(input: syn::Item, options: &options::DeriveOptions) -> Result<TokenStream> {\\n\\n let mut rpc_trait = match input {\\n\\n syn::Item::Trait(item_trait) => item_trait,\\n\\n item => {\\n\\n return Err(Error::from(syn::Error::new_spanned(\\n\\n item,\\n\\n \\\"The #[net_rpc] custom attribute only works with trait declarations\\\",\\n\\n )));\\n\\n }\\n\\n };\\n\\n let mut exports = Vec::new();\\n\\n if options.enable_client {\\n\\n let client_module = generate_client_module(&rpc_trait)?;\\n\\n exports.push(client_module);\\n\\n }\\n\\n if options.enable_server {\\n\\n let server_module = generate_server_module(&mut rpc_trait)?;\\n\\n exports.push(server_module);\\n\\n }\\n\\n Ok(quote! {\\n\\n #(#exports)*\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"network-rpc/derive/src/rpc_trait.rs\",\n \"rank\": 72,\n \"score\": 252867.857219573\n },\n {\n \"content\": \"pub fn _sign_txn_with_default_account_by_rpc_client(\\n\\n cli_state: &CliState,\\n\\n max_gas_amount: u64,\\n\\n gas_price: u64,\\n\\n expiration_time: u64,\\n\\n payload: TransactionPayload,\\n\\n) -> Result<SignedUserTransaction> {\\n\\n sign_txn_by_rpc_client(\\n\\n cli_state,\\n\\n max_gas_amount,\\n\\n gas_price,\\n\\n expiration_time,\\n\\n payload,\\n\\n None,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cmd/starcoin/src/dev/tests.rs\",\n \"rank\": 73,\n \"score\": 252141.9387074266\n },\n {\n \"content\": \"pub fn get_dao_config(cli_state: &CliState) -> Result<DaoConfig> {\\n\\n let client = cli_state.client();\\n\\n let chain_state_reader = RemoteStateReader::new(client)?;\\n\\n let account_state_reader = AccountStateReader::new(&chain_state_reader);\\n\\n account_state_reader\\n\\n .get_on_chain_config::<DaoConfig>()?\\n\\n .ok_or_else(|| format_err!(\\\"DaoConfig not exist on chain.\\\"))\\n\\n}\\n\",\n \"file_path\": \"cmd/starcoin/src/dev/sign_txn_helper.rs\",\n \"rank\": 74,\n \"score\": 250889.27988412417\n },\n {\n \"content\": \"pub fn account_balance_struct_name() -> &'static IdentStr {\\n\\n &*ACCOUNT_BALANCE_STRUCT_NAME\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm/types/src/account_config/constants/account.rs\",\n \"rank\": 75,\n \"score\": 250199.22912803866\n },\n {\n \"content\": \"pub fn generate_client_module(rpc_trait: &ItemTrait) -> anyhow::Result<TokenStream> {\\n\\n let mut rpc_info = Vec::new();\\n\\n let client_methods: Vec<TokenStream> = rpc_trait\\n\\n .items\\n\\n .iter()\\n\\n .filter_map(|trait_item| {\\n\\n if let syn::TraitItem::Method(method) = trait_item {\\n\\n let name = &method.sig.ident;\\n\\n let args = compute_args(&method);\\n\\n let arg_names = compute_arg_identifiers(&args).unwrap();\\n\\n let returns = match compute_returns(method) {\\n\\n Ok(r) => r,\\n\\n Err(e) => panic!(\\\"{}\\\", e)\\n\\n };\\n\\n if arg_names.len() < 2 {\\n\\n panic!(\\\"network Rpc method must has at least two argument\\\");\\n\\n }\\n\\n let peer_id_indent = arg_names[0];\\n\\n // TODO: Only support one user custom argument currently\\n\\n let user_arg_indent = arg_names[1];\\n\",\n \"file_path\": \"network-rpc/derive/src/to_client.rs\",\n \"rank\": 76,\n \"score\": 248973.1529861758\n },\n {\n \"content\": \"/// Splits a Multiaddress into a Multiaddress and PeerId.\\n\\npub fn parse_addr(mut addr: Multiaddr) -> Result<(PeerId, Multiaddr), ParseErr> {\\n\\n let who = match addr.pop() {\\n\\n Some(multiaddr::Protocol::P2p(key)) => {\\n\\n PeerId::from_multihash(key).map_err(|_| ParseErr::InvalidPeerId)?\\n\\n }\\n\\n _ => return Err(ParseErr::PeerIdMissing),\\n\\n };\\n\\n\\n\\n Ok((who, addr))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"network-p2p/types/src/lib.rs\",\n \"rank\": 77,\n \"score\": 248170.7020348324\n },\n {\n \"content\": \"pub fn event_handle_generator_struct_tag() -> StructTag {\\n\\n StructTag {\\n\\n address: CORE_CODE_ADDRESS,\\n\\n module: event_module_name().to_owned(),\\n\\n name: event_handle_generator_struct_name().to_owned(),\\n\\n type_params: vec![],\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"vm/types/src/account_config/constants/event.rs\",\n \"rank\": 78,\n \"score\": 248119.15312097495\n },\n {\n \"content\": \"//TODO this trait should move to consensus?\\n\\npub trait BlockVerifier {\\n\\n fn verify_header<R>(current_chain: &R, new_block_header: &BlockHeader) -> Result<()>\\n\\n where\\n\\n R: ChainReader;\\n\\n fn verify_block<R>(current_chain: &R, new_block: Block) -> Result<VerifiedBlock>\\n\\n where\\n\\n R: ChainReader,\\n\\n {\\n\\n watch(CHAIN_WATCH_NAME, \\\"n11\\\");\\n\\n //verify header\\n\\n let new_block_header = new_block.header();\\n\\n Self::verify_header(current_chain, new_block_header)?;\\n\\n watch(CHAIN_WATCH_NAME, \\\"n12\\\");\\n\\n //verify body\\n\\n let body_hash = new_block.body.hash();\\n\\n verify_block!(\\n\\n VerifyBlockField::Body,\\n\\n body_hash == new_block_header.body_hash(),\\n\\n \\\"verify block body hash mismatch, expect: {}, got: {}\\\",\\n\\n new_block_header.body_hash(),\\n\",\n \"file_path\": \"chain/src/verifier/mod.rs\",\n \"rank\": 80,\n \"score\": 244318.60017262568\n },\n {\n \"content\": \"#[stest::test]\\n\\npub fn test_open_block() -> Result<()> {\\n\\n let config = Arc::new(NodeConfig::random_for_test());\\n\\n let chain = test_helper::gen_blockchain_for_test(config.net())?;\\n\\n let header = chain.current_header();\\n\\n let block_gas_limit = 10000000;\\n\\n\\n\\n let mut opened_block = {\\n\\n let miner_account = AccountInfo::random();\\n\\n OpenedBlock::new(\\n\\n chain.get_storage(),\\n\\n header,\\n\\n block_gas_limit,\\n\\n miner_account.address,\\n\\n Some(miner_account.public_key.authentication_key()),\\n\\n config.net().time_service().now_millis(),\\n\\n vec![],\\n\\n U256::from(0),\\n\\n chain.consensus(),\\n\\n )?\\n\\n };\\n\",\n \"file_path\": \"chain/tests/test_opened_block.rs\",\n \"rank\": 82,\n \"score\": 242889.5239975736\n },\n {\n \"content\": \"pub fn new_epoch_event_key() -> EventKey {\\n\\n EventKey::new_from_address(&genesis_address(), 0)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm/types/src/on_chain_config/mod.rs\",\n \"rank\": 83,\n \"score\": 241269.85328593952\n },\n {\n \"content\": \"/// Serializes the script then deserializes it.\\n\\nfn serialize_and_deserialize_script(script: &CompiledScript) -> Result<()> {\\n\\n let mut script_blob = vec![];\\n\\n script.serialize(&mut script_blob)?;\\n\\n let deserialized_script = CompiledScript::deserialize(&script_blob)\\n\\n .map_err(|e| e.finish(Location::Undefined).into_vm_status())?;\\n\\n\\n\\n if *script != deserialized_script {\\n\\n return Err(ErrorKind::Other(\\n\\n \\\"deserialized script different from original one\\\".to_string(),\\n\\n )\\n\\n .into());\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm/functional-tests/src/evaluator.rs\",\n \"rank\": 84,\n \"score\": 241005.34122100944\n },\n {\n \"content\": \"/// Serializes the module then deserializes it.\\n\\nfn serialize_and_deserialize_module(module: &CompiledModule) -> Result<()> {\\n\\n let mut module_blob = vec![];\\n\\n module.serialize(&mut module_blob)?;\\n\\n let deserialized_module = CompiledModule::deserialize(&module_blob)\\n\\n .map_err(|e| e.finish(Location::Undefined).into_vm_status())?;\\n\\n\\n\\n if *module != deserialized_module {\\n\\n return Err(ErrorKind::Other(\\n\\n \\\"deserialized module different from original one\\\".to_string(),\\n\\n )\\n\\n .into());\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm/functional-tests/src/evaluator.rs\",\n \"rank\": 85,\n \"score\": 241005.34122100944\n },\n {\n \"content\": \"pub trait MoveResource {\\n\\n const MODULE_NAME: &'static str;\\n\\n const STRUCT_NAME: &'static str;\\n\\n\\n\\n fn module_identifier() -> Identifier {\\n\\n IdentStr::new(Self::MODULE_NAME)\\n\\n .expect(\\\"failed to get IdentStr for Move module\\\")\\n\\n .to_owned()\\n\\n }\\n\\n\\n\\n fn struct_identifier() -> Identifier {\\n\\n IdentStr::new(Self::STRUCT_NAME)\\n\\n .expect(\\\"failed to get IdentStr for Move struct\\\")\\n\\n .to_owned()\\n\\n }\\n\\n\\n\\n fn type_params() -> Vec<TypeTag> {\\n\\n vec![]\\n\\n }\\n\\n\\n\",\n \"file_path\": \"vm/types/src/move_resource.rs\",\n \"rank\": 86,\n \"score\": 240375.8599545182\n },\n {\n \"content\": \"#[rpc]\\n\\npub trait StateApi {\\n\\n #[rpc(name = \\\"state.get\\\")]\\n\\n fn get(&self, access_path: AccessPath) -> FutureResult<Option<Vec<u8>>>;\\n\\n\\n\\n #[rpc(name = \\\"state.get_with_proof\\\")]\\n\\n fn get_with_proof(&self, access_path: AccessPath) -> FutureResult<StateWithProofView>;\\n\\n\\n\\n #[rpc(name = \\\"state.get_account_state\\\")]\\n\\n fn get_account_state(&self, address: AccountAddress) -> FutureResult<Option<AccountState>>;\\n\\n\\n\\n #[rpc(name = \\\"state.get_account_state_set\\\")]\\n\\n fn get_account_state_set(\\n\\n &self,\\n\\n address: AccountAddress,\\n\\n ) -> FutureResult<Option<AccountStateSetView>>;\\n\\n\\n\\n #[rpc(name = \\\"state.get_state_root\\\")]\\n\\n fn get_state_root(&self) -> FutureResult<HashValue>;\\n\\n\\n\\n #[rpc(name = \\\"state.get_with_proof_by_root\\\")]\\n\\n fn get_with_proof_by_root(\\n\\n &self,\\n\\n access_path: AccessPath,\\n\\n state_root: HashValue,\\n\\n ) -> FutureResult<StateWithProofView>;\\n\\n}\\n\",\n \"file_path\": \"rpc/api/src/state/mod.rs\",\n \"rank\": 87,\n \"score\": 240232.95097851352\n },\n {\n \"content\": \"#[async_trait::async_trait]\\n\\npub trait AccountAsyncService:\\n\\n Clone + std::marker::Unpin + std::marker::Sync + std::marker::Send\\n\\n{\\n\\n async fn create_account(&self, password: String) -> Result<AccountInfo>;\\n\\n\\n\\n async fn get_default_account(&self) -> Result<Option<AccountInfo>>;\\n\\n async fn set_default_account(&self, address: AccountAddress) -> Result<Option<AccountInfo>>;\\n\\n async fn get_accounts(&self) -> Result<Vec<AccountInfo>>;\\n\\n\\n\\n async fn get_account(&self, address: AccountAddress) -> Result<Option<AccountInfo>>;\\n\\n\\n\\n /// Signs the hash of data with given address.\\n\\n async fn sign_message(\\n\\n &self,\\n\\n address: AccountAddress,\\n\\n message: SigningMessage,\\n\\n ) -> Result<Vec<u8>>;\\n\\n\\n\\n async fn sign_txn(\\n\\n &self,\\n\",\n \"file_path\": \"account/api/src/service.rs\",\n \"rank\": 88,\n \"score\": 240092.592511278\n },\n {\n \"content\": \"#[rpc]\\n\\npub trait AccountApi {\\n\\n /// Get default account\\n\\n #[rpc(name = \\\"account.default\\\")]\\n\\n fn default(&self) -> FutureResult<Option<AccountInfo>>;\\n\\n\\n\\n #[rpc(name = \\\"account.set_default_account\\\")]\\n\\n fn set_default_account(&self, addr: AccountAddress) -> FutureResult<Option<AccountInfo>>;\\n\\n\\n\\n #[rpc(name = \\\"account.create\\\")]\\n\\n fn create(&self, password: String) -> FutureResult<AccountInfo>;\\n\\n #[rpc(name = \\\"account.list\\\")]\\n\\n fn list(&self) -> FutureResult<Vec<AccountInfo>>;\\n\\n #[rpc(name = \\\"account.get\\\")]\\n\\n fn get(&self, address: AccountAddress) -> FutureResult<Option<AccountInfo>>;\\n\\n\\n\\n #[rpc(name = \\\"account.sign\\\")]\\n\\n fn sign(&self, address: AccountAddress, data: SigningMessage)\\n\\n -> FutureResult<StrView<Vec<u8>>>;\\n\\n\\n\\n /// sign a txn request, return hex encoded bcs_ext bytes of signed user txn.\\n\",\n \"file_path\": \"rpc/api/src/account/mod.rs\",\n \"rank\": 89,\n \"score\": 240085.1203027959\n },\n {\n \"content\": \"pub fn prepare_genesis() -> (ChainStateDB, ChainNetwork) {\\n\\n let net = ChainNetwork::new_test();\\n\\n let chain_state = ChainStateDB::mock();\\n\\n let genesis_txn = Genesis::build_genesis_transaction(&net).unwrap();\\n\\n Genesis::execute_genesis_txn(&chain_state, genesis_txn).unwrap();\\n\\n (chain_state, net)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"test-helper/src/executor.rs\",\n \"rank\": 90,\n \"score\": 239788.42702401849\n },\n {\n \"content\": \"fn print_value_table(value: Value) -> Result<()> {\\n\\n let simple_value =\\n\\n value.is_number() || value.is_boolean() || value.is_boolean() || value.is_string();\\n\\n if simple_value {\\n\\n println!(\\\"{}\\\", value_to_string(&value));\\n\\n } else {\\n\\n // value must be a object at here.\\n\\n let bold = CellFormat::builder().bold(true).build();\\n\\n let mut flat = json!({});\\n\\n flatten(&value, &mut flat, None, true, None)\\n\\n .map_err(|e| anyhow::Error::msg(e.description().to_string()))?;\\n\\n let obj = flat.as_object().expect(\\\"must be a object\\\");\\n\\n let mut rows = vec![];\\n\\n for (k, v) in obj {\\n\\n let row = Row::new(vec![\\n\\n Cell::new(k, bold),\\n\\n Cell::new(value_to_string(&v).as_str(), Default::default()),\\n\\n ]);\\n\\n rows.push(row);\\n\\n }\\n\\n let table = Table::new(rows, Default::default())?;\\n\\n table.print_stdout()?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"commons/scmd/src/result.rs\",\n \"rank\": 91,\n \"score\": 239018.12485621087\n },\n {\n \"content\": \"pub trait ServiceHandler<S, R>\\n\\nwhere\\n\\n S: ActorService,\\n\\n R: ServiceRequest,\\n\\n{\\n\\n fn handle(&mut self, msg: R, ctx: &mut ServiceContext<S>) -> <R as ServiceRequest>::Response;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"commons/service-registry/src/service.rs\",\n \"rank\": 92,\n \"score\": 238627.59698996882\n },\n {\n \"content\": \"fn parse_struct_tag(input: &str) -> anyhow::Result<StructTag> {\\n\\n match parse_type_tag(input)? {\\n\\n TypeTag::Struct(s) => Ok(s),\\n\\n _ => {\\n\\n anyhow::bail!(\\\"invalid struct tag\\\")\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, StructOpt)]\\n\\n#[structopt(name = \\\"resource-exporter\\\", about = \\\"onchain resource exporter\\\")]\\n\\npub struct ExporterOptions {\\n\\n #[structopt(long, short = \\\"o\\\", parse(from_os_str))]\\n\\n /// output file, like accounts.csv\\n\\n pub output: PathBuf,\\n\\n #[structopt(long, short = \\\"i\\\", parse(from_os_str))]\\n\\n /// starcoin node db path. like ~/.starcoin/barnard/starcoindb/db\\n\\n pub db_path: PathBuf,\\n\\n\\n\\n #[structopt(long)]\\n\",\n \"file_path\": \"cmd/resource-exporter/src/main.rs\",\n \"rank\": 93,\n \"score\": 238559.48332747573\n },\n {\n \"content\": \"fn write_indent(f: &mut Formatter, indent: u64) -> std::fmt::Result {\\n\\n for _i in 0..indent {\\n\\n write!(f, \\\" \\\")?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"vm/resource-viewer/src/lib.rs\",\n \"rank\": 94,\n \"score\": 237365.50490755745\n },\n {\n \"content\": \"#[test]\\n\\nfn test_state_db() -> Result<()> {\\n\\n let storage = MockStateNodeStore::new();\\n\\n let chain_state_db = ChainStateDB::new(Arc::new(storage), None);\\n\\n let access_path = AccessPath::random_resource();\\n\\n\\n\\n let state0 = random_bytes();\\n\\n chain_state_db.apply_write_set(to_write_set(access_path.clone(), state0))?;\\n\\n let state_root = chain_state_db.commit()?;\\n\\n\\n\\n let state1 = random_bytes();\\n\\n chain_state_db.apply_write_set(to_write_set(access_path, state1))?;\\n\\n let new_state_root = chain_state_db.commit()?;\\n\\n assert_ne!(state_root, new_state_root);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"state/statedb/src/tests.rs\",\n \"rank\": 95,\n \"score\": 237142.61132815055\n },\n {\n \"content\": \"#[test]\\n\\nfn test_state_version() -> Result<()> {\\n\\n let storage = Arc::new(MockStateNodeStore::new());\\n\\n let chain_state_db = ChainStateDB::new(storage.clone(), None);\\n\\n let account_address = AccountAddress::random();\\n\\n let access_path = AccessPath::new(account_address, AccountResource::resource_path());\\n\\n let old_state = random_bytes();\\n\\n chain_state_db.apply_write_set(to_write_set(access_path.clone(), old_state.clone()))?;\\n\\n chain_state_db.commit()?;\\n\\n chain_state_db.flush()?;\\n\\n let old_root = chain_state_db.state_root();\\n\\n\\n\\n let new_state = random_bytes();\\n\\n chain_state_db.apply_write_set(to_write_set(access_path.clone(), new_state))?;\\n\\n\\n\\n let chain_state_db_ori = ChainStateDB::new(storage, Some(old_root));\\n\\n let old_state2 = chain_state_db_ori.get(&access_path)?.unwrap();\\n\\n assert_eq!(old_state, old_state2);\\n\\n\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"state/statedb/src/tests.rs\",\n \"rank\": 96,\n \"score\": 237142.61132815055\n },\n {\n \"content\": \"fn bench_put_and_commit(c: &mut Criterion) {\\n\\n ::logger::init_for_test();\\n\\n let mut group = c.benchmark_group(\\\"put_and_commit\\\");\\n\\n group.sample_size(80);\\n\\n for i in vec![1u64, 5, 10, 50, 100].into_iter() {\\n\\n let tmp_dir = starcoin_config::temp_path();\\n\\n let db_store = new_empty_store(tmp_dir.as_ref()) as Arc<dyn StateNodeStore>;\\n\\n let mem_store = Arc::new(MockStateNodeStore::new()) as Arc<dyn StateNodeStore>;\\n\\n let mut rng: StdRng = {\\n\\n let seed = [1u8, 2, 3, 4];\\n\\n let mut actual_seed = [0u8; 32];\\n\\n actual_seed[..seed.len()].copy_from_slice(&seed);\\n\\n StdRng::from_seed(actual_seed)\\n\\n };\\n\\n for (id, store) in vec![(\\\"mem_store\\\", mem_store), (\\\"db_store\\\", db_store)].into_iter() {\\n\\n let tree = StateTree::new(store, None);\\n\\n // init tree with 10w keys.\\n\\n let _ = prepare_tree(&tree, &[2u8, 3, 4, 5], 100_000);\\n\\n group.bench_with_input(BenchmarkId::new(id, i), &(tree, i), |b, input| {\\n\\n let (tree, n) = input;\\n\",\n \"file_path\": \"benchmarks/benches/bench_state_tree.rs\",\n \"rank\": 97,\n \"score\": 236469.91063297176\n },\n {\n \"content\": \"pub trait WalletStorageTrait {\\n\\n fn save_default_settings(&self, setting: Setting) -> Result<()>;\\n\\n\\n\\n fn save_accepted_token(&self, token: TokenCode) -> Result<()>;\\n\\n fn contain_wallet(&self, address: AccountAddress) -> Result<bool>;\\n\\n}\\n\",\n \"file_path\": \"account/api/src/rich_wallet.rs\",\n \"rank\": 98,\n \"score\": 236401.81016469415\n },\n {\n \"content\": \"pub fn print_action_result(\\n\\n format: OutputFormat,\\n\\n result: Result<Value>,\\n\\n console_mode: bool,\\n\\n) -> Result<()> {\\n\\n match format {\\n\\n OutputFormat::JSON => {\\n\\n // if in console, and is err, print error directly.\\n\\n if console_mode && result.is_err() {\\n\\n println!(\\\"{}\\\", result.unwrap_err().to_string());\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n let value = match result {\\n\\n Ok(value) => json!({ \\\"ok\\\": value }),\\n\\n Err(err) => json!({\\\"err\\\": err.to_string()}),\\n\\n };\\n\\n print_json(value)\\n\\n }\\n\\n OutputFormat::TABLE => {\\n\\n match result {\\n\\n Ok(value) => print_table(value)?,\\n\\n // err may contains help message, so directly print err.\\n\\n Err(err) => println!(\\\"{}\\\", err.to_string()),\\n\\n };\\n\\n Ok(())\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"commons/scmd/src/result.rs\",\n \"rank\": 99,\n \"score\": 236012.88861608843\n }\n]","isConversational":false}}},{"rowIdx":984,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"multi-skill/src/systems/true_skill/normal.rs"},"repo_name":{"kind":"string","value":"kiwec/Elo-MMR"},"commit":{"kind":"string","value":"bf64ea75e8c0dbb946d379b9bee1753e604b388a"},"file_code":{"kind":"string","value":"use super::float::{erfc, Float, MyFloat, PI, TWO, ZERO};\nuse overload::overload;\nuse std::ops;\n\n#[derive(Clone, Debug)]\npub struct Gaussian {\n pub mu: MyFloat,\n pub sigma: MyFloat,\n}\n\npub const G_ZERO: Gaussian = Gaussian {\n mu: ZERO,\n sigma: ZERO,\n};\n\npub const G_ONE: Gaussian = Gaussian {\n mu: ZERO,\n sigma: MyFloat::INFINITY,\n};\n\noverload!((a: ?Gaussian) + (b: ?Gaussian) -> Gaussian {\n Gaussian {\n mu: a.mu + b.mu,\n sigma: a.sigma.hypot(b.sigma),\n }\n});\n\noverload!((a: &mut Gaussian) += (b: ?Gaussian) {\n a.mu += b.mu;\n a.sigma = a.sigma.hypot(b.sigma);\n});\n\noverload!((a: ?Gaussian) - (b: ?Gaussian) -> Gaussian {\n Gaussian {\n mu: a.mu - b.mu,\n sigma: a.sigma.hypot(b.sigma),\n }\n});\n\noverload!((a: &mut Gaussian) -= (b: ?Gaussian) {\n a.mu -= b.mu;\n a.sigma = a.sigma.hypot(b.sigma);\n});\n\noverload!(-(a: &mut Gaussian) -> Gaussian {\n Gaussian {\n mu: -a.mu,\n sigma: a.sigma,\n }\n});\n\noverload!((a: ?Gaussian) * (b: ?MyFloat) -> Gaussian {\n Gaussian {\n mu: a.mu * b,\n sigma: a.sigma * b.abs(),\n }\n});\n\noverload!((a: &mut Gaussian) *= (b: ?MyFloat) {\n a.mu *= b;\n a.sigma *= b.abs();\n});\n\noverload!((a: ?Gaussian) / (b: ?MyFloat) -> Gaussian {\n Gaussian {\n mu: a.mu / b,\n sigma: a.sigma / b.abs(),\n }\n});\n\noverload!((a: &mut Gaussian) /= (b: ?MyFloat) {\n a.mu /= b;\n a.sigma /= b.abs();\n});\n\noverload!((a: ?Gaussian) * (b: ?Gaussian) -> Gaussian {\n if a.sigma.is_infinite() {\n return b.clone();\n }\n if b.sigma.is_infinite() {\n return a.clone();\n }\n\n let ssigma1 = a.sigma.powi(2);\n let ssigma2 = b.sigma.powi(2);\n Gaussian {\n mu: (a.mu * ssigma2 + b.mu * ssigma1) / (ssigma1 + ssigma2),\n sigma: a.sigma * b.sigma / (ssigma1 + ssigma2).sqrt(),\n }\n});\n\noverload!((a: &mut Gaussian) *= (b: ?Gaussian) {\n *a = a.clone() * b;\n});\n\noverload!((a: ?Gaussian) / (b: ?Gaussian) -> Gaussian {\n if b.sigma.is_infinite() {\n return a.clone();\n }\n if a.sigma.is_infinite() {\n return Gaussian {\n mu: -b.mu,\n sigma: b.sigma,\n }\n }\n let ssigma1 = a.sigma.powi(2);\n let ssigma2 = b.sigma.powi(2);\n\n Gaussian {\n mu: (a.mu * ssigma2 - b.mu * ssigma1) / (ssigma2 - ssigma1),\n sigma: a.sigma * b.sigma / (ssigma2 - ssigma1).abs().sqrt(),\n }\n});\n\noverload!((a: &mut Gaussian) /= (b: ?Gaussian) {\n *a = a.clone() / b;\n});\n\nfn gauss_exponent(mu: MyFloat, sigma: MyFloat, t: MyFloat) -> MyFloat {\n (-((t - mu) / sigma).powi(2)).exp()\n}\n\nfn moment0(mu: MyFloat, sigma: MyFloat, t: MyFloat) -> MyFloat {\n sigma * PI.sqrt() / TWO * erfc((t - mu) / sigma)\n}\n\nfn moment1(mu: MyFloat, sigma: MyFloat, t: MyFloat) -> MyFloat {\n mu * moment0(ZERO, sigma, t - mu) + sigma.powi(2) / TWO * gauss_exponent(mu, sigma, t)\n}\n\nfn moment2(mu: MyFloat, sigma: MyFloat, t: MyFloat) -> MyFloat {\n mu.powi(2) * moment0(ZERO, sigma, t - mu)\n + TWO * mu * moment1(ZERO, sigma, t - mu)\n + (sigma / TWO).powi(2)\n * (TWO * gauss_exponent(mu, sigma, t) * (t - mu)\n + sigma * PI.sqrt() * erfc((t - mu) / sigma))\n}\n\nimpl Gaussian {\n pub fn leq_eps(&self, eps: MyFloat) -> Gaussian {\n assert!(eps >= ZERO);\n assert!(!self.sigma.is_infinite());\n\n let alpha = moment0(self.mu, self.sigma, -eps) - moment0(self.mu, self.sigma, eps);\n\n const FLOAT_CMP_EPS: f64 = 1e-8;\n let (mu, sigma) = if alpha < FLOAT_CMP_EPS.into() {\n (eps, eps)\n } else {\n let mu =\n (moment1(self.mu, self.sigma, -eps) - moment1(self.mu, self.sigma, eps)) / alpha;\n let sigma2 = (moment2(self.mu, self.sigma, -eps) - moment2(self.mu, self.sigma, eps))\n / alpha\n - mu.powi(2);\n \n (mu, sigma2.max(ZERO).sqrt())\n };\n\n assert!(\n !mu.is_nan() && !sigma.is_nan(),\n \"{:?}\\teps {} {} {}\",\n self,\n eps,\n mu,\n sigma\n );\n\n Gaussian { mu, sigma } / self\n }\n\n pub fn greater_eps(&self, eps: MyFloat) -> Gaussian {\n assert!(eps >= ZERO);\n assert!(!self.sigma.is_infinite());\n\n let alpha = moment0(self.mu, self.sigma, eps);\n\n const FLOAT_CMP_EPS: f64 = 1e-8;\n let (mu, sigma) = if alpha < FLOAT_CMP_EPS.into() {\n (eps, eps)\n } else {\n let mu = moment1(self.mu, self.sigma, eps) / alpha;\n let sigma2 = moment2(self.mu, self.sigma, eps) / alpha - mu.powi(2);\n \n (mu, sigma2.max(ZERO).sqrt())\n };\n\n assert!(!mu.is_nan() && !sigma.is_nan(), \"{:?}\\teps {}\", self, eps);\n\n Gaussian { mu, sigma } / self\n }\n}\n"},"prefix":{"kind":"string","value":"use super::float::{erfc, Float, MyFloat, PI, TWO, ZERO};\nuse overload::overload;\nuse std::ops;\n\n#[derive(Clone, Debug)]\npub struct Gaussian {\n pub mu: MyFloat,\n pub sigma: MyFloat,\n}\n\npub const G_ZERO: Gaussian = Gaussian {\n mu: ZERO,\n sigma: ZERO,\n};\n\npub const G_ONE: Gaussian = Gaussian {\n mu: ZERO,\n sigma: MyFloat::INFINITY,\n};\n\noverload!((a: ?Gaussian) + (b: ?Gaussian) -> Gaussian {\n Gaussian {\n mu: a.mu + b.mu,\n sigma: a.sigma.hypot(b.sigma),\n }\n});\n\noverload!((a: &mut Gaussian) += (b: ?Gaussian) {\n a.mu += b.mu;\n a.sigma = a.sigma.hypot(b.sigma);\n});\n\noverload!((a: ?Gaussian) - (b: ?Gaussian) -> Gaussian {\n Gaussian {\n mu: a.mu - b.mu,\n sigma: a.sigma.hypot(b.sigma),\n }\n});\n\noverload!((a: &mut Gaussian) -= (b: ?Gaussian) {\n a.mu -= b.mu;\n a.sigma = a.sigma.hypot(b.sigma);\n});\n\noverload!(-(a: &mut Gaussian) -> Gaussian {\n Gaussian {\n mu: -a.mu,\n sigma: a.sigma,\n }\n});\n\noverload!((a: ?Gaussian) * (b: ?MyFloat) -> Gaussian {\n Gaussian {\n mu: a.mu * b,\n sigma: a.sigma * b.abs(),\n }\n});\n\noverload!((a: &mut Gaussian) *= (b: ?MyFloat) {\n a.mu *= b;\n a.sigma *= b.abs();\n});\n\noverload!((a: ?Gaussian) / (b: ?MyFloat) -> Gaussian {\n Gaussian {\n mu: a.mu / b,\n sigma: a.sigma / b.abs(),\n }\n});\n\noverload!((a: &mut Gaussian) /= (b: ?MyFloat) {\n a.mu /= b;\n a.sigma /= b.abs();\n});\n\noverload!((a: ?Gaussian) * (b: ?Gaussian) -> Gaussian {\n if a.sigma.is_infinite() {\n return b.clone();\n }\n if b.sigma.is_infinite() {\n return a.clone();\n }\n\n let ssigma1 = a.sigma.powi(2);\n let ssigma2 = b.sigma.powi(2);\n Gaussian {\n mu: (a.mu * ssigma2 + b.mu * ssigma1) / (ssigma1 + ssigma2),\n sigma: a.sigma * b.sigma / (ssigma1 + ssigma2).sqrt(),\n }\n});\n\noverload!((a: &mut Gaussian) *= (b: ?Gaussian) {\n *a = a.clone() * b;\n});\n\noverload!((a: ?Gaussian) / (b: ?Gaussian) -> Gaussian {\n if b.sigma.is_infinite() {\n return a.clone();\n }\n if a.sigma.is_infinite() {\n return Gaussian {\n mu: -b.mu,\n sigma: b.sigma,\n }\n }\n let ssigma1 = a.sigma.powi(2);\n let ssigma2 = b.sigma.powi(2);\n\n Gaussian {\n mu: (a.mu * ssigma2 - b.mu * ssigma1) / (ssigma2 - ssigma1),\n sigma: a.sigma * b.sigma / (ssigma2 - ssigma1).abs().sqrt(),\n }\n});\n\noverload!((a: &mut Gaussian) /= (b: ?Gaussian) {\n *a = a.clone() / b;\n});\n\nfn gauss_exponent(mu: MyFloat, sigma: MyFloat, t: MyFloat) -> MyFloat {\n (-((t - mu) / sigma).powi(2)).exp()\n}\n\nfn moment0(mu: MyFloat, sigma: MyFloat, t: MyFloat) -> MyFloat {\n sigma * PI.sqrt() / TWO * erfc((t - mu) / sigma)\n}\n\nfn moment1(mu: MyFloat, sigma: MyFloat, t: MyFloat) -> MyFloat {\n mu * moment0(ZERO, sigma, t - mu) + sigma.powi(2) / TWO * gauss_exponent(mu, sigma, t)\n}\n\nfn moment2(mu: MyFloat, sigma: MyFloat, t: MyFloat) -> MyFloat {\n "},"suffix":{"kind":"string","value":"\n\nimpl Gaussian {\n pub fn leq_eps(&self, eps: MyFloat) -> Gaussian {\n assert!(eps >= ZERO);\n assert!(!self.sigma.is_infinite());\n\n let alpha = moment0(self.mu, self.sigma, -eps) - moment0(self.mu, self.sigma, eps);\n\n const FLOAT_CMP_EPS: f64 = 1e-8;\n let (mu, sigma) = if alpha < FLOAT_CMP_EPS.into() {\n (eps, eps)\n } else {\n let mu =\n (moment1(self.mu, self.sigma, -eps) - moment1(self.mu, self.sigma, eps)) / alpha;\n let sigma2 = (moment2(self.mu, self.sigma, -eps) - moment2(self.mu, self.sigma, eps))\n / alpha\n - mu.powi(2);\n \n (mu, sigma2.max(ZERO).sqrt())\n };\n\n assert!(\n !mu.is_nan() && !sigma.is_nan(),\n \"{:?}\\teps {} {} {}\",\n self,\n eps,\n mu,\n sigma\n );\n\n Gaussian { mu, sigma } / self\n }\n\n pub fn greater_eps(&self, eps: MyFloat) -> Gaussian {\n assert!(eps >= ZERO);\n assert!(!self.sigma.is_infinite());\n\n let alpha = moment0(self.mu, self.sigma, eps);\n\n const FLOAT_CMP_EPS: f64 = 1e-8;\n let (mu, sigma) = if alpha < FLOAT_CMP_EPS.into() {\n (eps, eps)\n } else {\n let mu = moment1(self.mu, self.sigma, eps) / alpha;\n let sigma2 = moment2(self.mu, self.sigma, eps) / alpha - mu.powi(2);\n \n (mu, sigma2.max(ZERO).sqrt())\n };\n\n assert!(!mu.is_nan() && !sigma.is_nan(), \"{:?}\\teps {}\", self, eps);\n\n Gaussian { mu, sigma } / self\n }\n}\n"},"middle":{"kind":"string","value":"mu.powi(2) * moment0(ZERO, sigma, t - mu)\n + TWO * mu * moment1(ZERO, sigma, t - mu)\n + (sigma / TWO).powi(2)\n * (TWO * gauss_exponent(mu, sigma, t) * (t - mu)\n + sigma * PI.sqrt() * erfc((t - mu) / sigma))\n}"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":985,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"runtime/src/account_info.rs"},"repo_name":{"kind":"string","value":"luma-team/solana"},"commit":{"kind":"string","value":"b02c412d5b5c1902bd5b3616f427ffc0c9925cef"},"file_code":{"kind":"string","value":"\n\nuse crate::{\n accounts_db::{AppendVecId, CACHE_VIRTUAL_OFFSET},\n accounts_index::{IsCached, ZeroLamport},\n append_vec::ALIGN_BOUNDARY_OFFSET,\n};\n\npub type Offset = usize;\n\npub type StoredSize = u32;\n\n#[derive(Debug)]\npub enum StorageLocation {\n AppendVec(AppendVecId, Offset),\n Cached,\n}\n\nimpl StorageLocation {\n pub fn is_offset_equal(&self, other: &StorageLocation) -> bool {\n match self {\n StorageLocation::Cached => {\n matches!(other, StorageLocation::Cached) \n }\n StorageLocation::AppendVec(_, offset) => {\n match other {\n StorageLocation::Cached => {\n false \n }\n StorageLocation::AppendVec(_, other_offset) => other_offset == offset,\n }\n }\n }\n }\n pub fn is_store_id_equal(&self, other: &StorageLocation) -> bool {\n match self {\n StorageLocation::Cached => {\n matches!(other, StorageLocation::Cached) \n }\n StorageLocation::AppendVec(store_id, _) => {\n match other {\n StorageLocation::Cached => {\n false \n }\n StorageLocation::AppendVec(other_store_id, _) => other_store_id == store_id,\n }\n }\n }\n }\n}\n\npub type OffsetReduced = u32;\n\n#[derive(Default, Debug, PartialEq, Eq, Clone, Copy)]\npub struct AccountInfo {\n \n store_id: AppendVecId,\n\n \n \n reduced_offset: OffsetReduced,\n\n \n \n \n \n stored_size_mask: StoredSize,\n}\n\nconst IS_ZERO_LAMPORT_FLAG: StoredSize = 1 << (StoredSize::BITS - 1);\n\nconst IS_CACHED_STORE_ID_FLAG: StoredSize = 1 << (StoredSize::BITS - 2);\nconst ALL_FLAGS: StoredSize = IS_ZERO_LAMPORT_FLAG | IS_CACHED_STORE_ID_FLAG;\n\nimpl ZeroLamport for AccountInfo {\n fn is_zero_lamport(&self) -> bool {\n self.stored_size_mask & IS_ZERO_LAMPORT_FLAG == IS_ZERO_LAMPORT_FLAG\n }\n}\n\nimpl IsCached for AccountInfo {\n fn is_cached(&self) -> bool {\n self.stored_size_mask & IS_CACHED_STORE_ID_FLAG == IS_CACHED_STORE_ID_FLAG\n }\n}\n\nimpl IsCached for StorageLocation {\n fn is_cached(&self) -> bool {\n matches!(self, StorageLocation::Cached)\n }\n}\n\nconst CACHE_VIRTUAL_STORAGE_ID: AppendVecId = AppendVecId::MAX;\n\nimpl AccountInfo {\n pub fn new(storage_location: StorageLocation, stored_size: StoredSize, lamports: u64) -> Self {\n assert_eq!(stored_size & ALL_FLAGS, 0);\n let mut stored_size_mask = stored_size;\n let (store_id, raw_offset) = match storage_location {\n StorageLocation::AppendVec(store_id, offset) => (store_id, offset),\n StorageLocation::Cached => {\n stored_size_mask |= IS_CACHED_STORE_ID_FLAG;\n (CACHE_VIRTUAL_STORAGE_ID, CACHE_VIRTUAL_OFFSET)\n }\n };\n if lamports == 0 {\n stored_size_mask |= IS_ZERO_LAMPORT_FLAG;\n }\n let reduced_offset: OffsetReduced = (raw_offset / ALIGN_BOUNDARY_OFFSET) as OffsetReduced;\n let result = Self {\n store_id,\n reduced_offset,\n stored_size_mask,\n };\n assert_eq!(result.offset(), raw_offset, \"illegal offset\");\n result\n }\n\n pub fn store_id(&self) -> AppendVecId {\n \n assert!(!self.is_cached());\n self.store_id\n }\n\n pub fn offset(&self) -> Offset {\n (self.reduced_offset as Offset) * ALIGN_BOUNDARY_OFFSET\n }\n\n pub fn stored_size(&self) -> StoredSize {\n \n self.stored_size_mask & !ALL_FLAGS\n }\n\n \n \n pub fn matches_storage_location(&self, store_id: AppendVecId, offset: Offset) -> bool {\n \n self.store_id == store_id && self.offset() == offset && !self.is_cached()\n }\n\n pub fn storage_location(&self) -> StorageLocation {\n if self.is_cached() {\n StorageLocation::Cached\n } else {\n StorageLocation::AppendVec(self.store_id, self.offset())\n }\n }\n}\n#[cfg(test)]\nmod test {\n use {super::*, crate::append_vec::MAXIMUM_APPEND_VEC_FILE_SIZE};\n\n #[test]\n fn test_limits() {\n for offset in [\n MAXIMUM_APPEND_VEC_FILE_SIZE as Offset,\n 0,\n ALIGN_BOUNDARY_OFFSET,\n 4 * ALIGN_BOUNDARY_OFFSET,\n ] {\n let info = AccountInfo::new(StorageLocation::AppendVec(0, offset), 0, 0);\n assert!(info.offset() == offset);\n }\n }\n\n #[test]\n #[should_panic(expected = \"illegal offset\")]\n fn test_alignment() {\n let offset = 1; \n AccountInfo::new(StorageLocation::AppendVec(0, offset), 0, 0);\n }\n\n #[test]\n fn test_matches_storage_location() {\n let offset = 0;\n let id = 0;\n let info = AccountInfo::new(StorageLocation::AppendVec(id, offset), 0, 0);\n assert!(info.matches_storage_location(id, offset));\n\n \n let offset = ALIGN_BOUNDARY_OFFSET;\n assert!(!info.matches_storage_location(id, offset));\n\n \n let offset = 0;\n let id = 1;\n assert!(!info.matches_storage_location(id, offset));\n\n \n let id = CACHE_VIRTUAL_STORAGE_ID;\n let info = AccountInfo::new(StorageLocation::Cached, 0, 0);\n assert!(!info.matches_storage_location(id, offset));\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::{\n accounts_db::{AppendVecId, CACHE_VIRTUAL_OFFSET},\n accounts_index::{IsCached, ZeroLamport},\n append_vec::ALIGN_BOUNDARY_OFFSET,\n};\n\npub type Offset = usize;\n\npub type StoredSize = u32;\n\n#[derive(Debug)]\npub enum StorageLocation {\n AppendVec(AppendVecId, Offset),\n Cached,\n}\n\nimpl StorageLocation {\n pub fn is_offset_equal(&self, other: &StorageLocation) -> bool {\n match self {\n StorageLocation::Cached => {\n matches!(other, StorageLocation::Cached) \n }\n StorageLocation::AppendVec(_, offset) => {\n match other {\n StorageLocation::Cached => {\n false \n }\n StorageLocation::AppendVec(_, other_offset) => other_offset == offset,\n }\n }\n }\n }\n pub fn is_store_id_equal(&self, other: &StorageLocation) -> bool {\n match self {\n StorageLocation::Cached => {\n matches!(other, StorageLocation::Cached) \n }\n StorageLocation::AppendVec(store_id, _) => {\n match other {\n StorageLocation::Cached => {\n false \n }\n StorageLocation::AppendVec(other_store_id, _) => other_store_id == store_id,\n }\n }\n }\n }\n}\n\npub type OffsetReduced = u32;\n\n#[derive(Default, Debug, PartialEq, Eq, Clone, Copy)]\npub struct AccountInfo {\n \n store_id: AppendVecId,\n\n \n \n reduced_offset: OffsetReduced,\n\n \n \n \n \n stored_size_mask: StoredSize,\n}\n\nconst IS_ZERO_LAMPORT_FLAG: StoredSize = 1 << (StoredSize::BITS - 1);\n\nconst IS_CACHED_STORE_ID_FLAG: StoredSize = 1 << (StoredSize::BITS - 2);\nconst ALL_FLAGS: StoredSize = IS_ZERO_LAMPORT_FLAG | IS_CACHED_STORE_ID_FLAG;\n\nimpl ZeroLamport for AccountInfo {\n fn is_zero_lamport(&self) -> bool {\n self.stored_size_mask & IS_ZERO_LAMPORT_FLAG == IS_ZERO_LAMPORT_FLAG\n }\n}\n\nimpl IsCached for AccountInfo {\n fn is_cached(&self) -> bool {\n self.stored_size_mask & IS_CACHED_STORE_ID_FLAG == IS_CACHED_STORE_ID_FLAG\n }\n}\n\nimpl IsCached for StorageLocation {\n fn is_cached(&self) -> bool {\n matches!(self, StorageLocation::Cached)\n }\n}\n\nconst CACHE_VIRTUAL_STORAGE_ID: AppendVecId = AppendVecId::MAX;\n\nimpl AccountInfo {\n pub fn new(storage_location: StorageLocation, stored_size: StoredSize, lamports: u64) -> Self {\n assert_eq!(stored_size & ALL_FLAGS, 0);\n let mut stored_size_mask = stored_size;\n let (store_id, raw_offset) = match storage_location {\n StorageLocation::AppendVec(store_id, offset) => (store_id, offset),\n StorageLocation::Cached => {\n stored_size_mask |= IS_CACHED_STORE_ID_FLAG;\n (CACHE_VIRTUAL_STORAGE_ID, CACHE_VIRTUAL_OFFSET)\n }\n };\n if lamports == 0 {\n stored_size_mask |= IS_ZERO_LAMPORT_FLAG;\n }\n let reduced_offset: OffsetReduced = (raw_offset / ALIGN_BOUNDARY_OFFSET) as OffsetReduced;\n let result = Self {\n store_id,\n reduced_offset,\n stored_size_mask,\n };\n assert_eq!(result.offset(), raw_offset, \"illegal offset\");\n result\n }\n\n pub fn store_id(&self) -> AppendVecId {\n \n assert!(!self.is_cached());\n self.store_id\n }\n\n pub fn offset(&self) -> Offset {\n (self.reduced_offset as Offset) * ALIGN_BOUNDARY_OFFSET\n }\n\n pub fn stored_size(&self) -> StoredSize {\n \n self.stored_size_mask & !ALL_FLAGS\n }\n\n \n \n pub fn matches_storage_location(&self, store_id: AppendVecId, offset: Offset) -> bool {\n \n self.store_id == store_id && self.offset() == offset && !self.is_cached()\n }\n\n pub fn storage_location(&self) -> StorageLocation {\n if self.is_cached() {\n StorageLocation::Cached\n } else {\n StorageLocation::AppendVec(self.store_id, self.offset())\n }\n }\n}\n#[cfg(test)]\nmod test {\n use {super::*, crate::append_vec::MAXIMUM_APPEND_VEC_FILE_SIZE};\n\n #[test]\n fn test_limits() {\n for offset in [\n MAXIMUM_APPEND_VEC_FILE_SIZE as Offset,\n 0,\n ALIGN_BOUNDARY_OFFSET,\n 4 * ALIGN_BOUNDARY_OFFSET,\n ] {\n let info = AccountInfo::new(StorageLocation::AppendVec(0, offset), 0, 0);\n assert!(info.offset() == offset);\n }\n }\n\n #[test]\n #[should_panic(expected = \"illegal offset\")]\n fn test_alignment() {\n let offset = 1; \n AccountInfo::new(StorageLocation::AppendVec(0, offset), 0, 0);\n }\n\n #[test]\n fn test_matches_storage_location() {\n let offset = 0;\n let id = 0;\n let info = AccountInfo::new(StorageLocation::AppendVec(id, offset), 0, 0);\n assert!(info.matches_storage_location(id, offset));\n\n \n let offset = ALIGN_BOUNDARY_OFFSET;\n assert!(!info.matches_storage_location(id, offset));\n\n \n let offset = 0;\n let id = 1;\n assert!(!info.matches_storage_location(id, offset));\n\n \n let id = CACHE_VI"},"suffix":{"kind":"string","value":"\n}\n"},"middle":{"kind":"string","value":"RTUAL_STORAGE_ID;\n let info = AccountInfo::new(StorageLocation::Cached, 0, 0);\n assert!(!info.matches_storage_location(id, offset));\n }"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"pub fn is_sysvar_id(id: &Pubkey) -> bool {\n\n ALL_IDS.iter().any(|key| key == id)\n\n}\n\n\n\n/// Declares an ID that implements [`SysvarId`].\n\n#[macro_export]\n\nmacro_rules! declare_sysvar_id(\n\n ($name:expr, $type:ty) => (\n\n $crate::declare_id!($name);\n\n\n\n impl $crate::sysvar::SysvarId for $type {\n\n fn id() -> $crate::pubkey::Pubkey {\n\n id()\n\n }\n\n\n\n fn check_id(pubkey: &$crate::pubkey::Pubkey) -> bool {\n\n check_id(pubkey)\n\n }\n\n }\n\n\n","file_path":"sdk/program/src/sysvar/mod.rs","rank":0,"score":392744.15703830356},{"content":"pub fn build_balance_message(lamports: u64, use_lamports_unit: bool, show_unit: bool) -> String {\n\n build_balance_message_with_config(\n\n lamports,\n\n &BuildBalanceMessageConfig {\n\n use_lamports_unit,\n\n show_unit,\n\n ..BuildBalanceMessageConfig::default()\n\n },\n\n )\n\n}\n\n\n","file_path":"cli-output/src/display.rs","rank":1,"score":392328.75173838995},{"content":"pub fn info(config_file: &str, local_info_only: bool, eval: bool) -> Result<(), String> {\n\n let config = Config::load(config_file)?;\n\n\n\n if eval {\n\n println!(\n\n \"SOLANA_INSTALL_ACTIVE_RELEASE={}\",\n\n &config.active_release_dir().to_str().unwrap_or(\"\")\n\n );\n\n config\n\n .explicit_release\n\n .map(|er| match er {\n\n ExplicitRelease::Semver(semver) => semver,\n\n ExplicitRelease::Channel(channel) => channel,\n\n })\n\n .and_then(|channel| {\n\n println!(\"SOLANA_INSTALL_ACTIVE_CHANNEL={}\", channel,);\n\n Option::<String>::None\n\n });\n\n return Ok(());\n\n }\n","file_path":"install/src/command.rs","rank":2,"score":386530.95343980176},{"content":"pub fn recv_from(batch: &mut PacketBatch, socket: &UdpSocket, max_wait_ms: u64) -> Result<usize> {\n\n let mut i = 0;\n\n //DOCUMENTED SIDE-EFFECT\n\n //Performance out of the IO without poll\n\n // * block on the socket until it's readable\n\n // * set the socket to non blocking\n\n // * read until it fails\n\n // * set it back to blocking before returning\n\n socket.set_nonblocking(false)?;\n\n trace!(\"receiving on {}\", socket.local_addr().unwrap());\n\n let start = Instant::now();\n\n loop {\n\n batch.resize(\n\n std::cmp::min(i + NUM_RCVMMSGS, PACKETS_PER_BATCH),\n\n Packet::default(),\n\n );\n\n match recv_mmsg(socket, &mut batch[i..]) {\n\n Err(_) if i > 0 => {\n\n if start.elapsed().as_millis() as u64 > max_wait_ms {\n\n break;\n","file_path":"streamer/src/packet.rs","rank":3,"score":356909.91296266543},{"content":"/// Format data as hex.\n\n///\n\n/// If `data`'s length is greater than 0, add a field called \"data\" to `f`. The\n\n/// first 64 bytes of `data` is displayed; bytes after that are ignored.\n\npub fn debug_account_data(data: &[u8], f: &mut fmt::DebugStruct<'_, '_>) {\n\n let data_len = cmp::min(MAX_DEBUG_ACCOUNT_DATA, data.len());\n\n if data_len > 0 {\n\n f.field(\"data\", &Hex(&data[..data_len]));\n\n }\n\n}\n\n\n\npub(crate) struct Hex<'a>(pub(crate) &'a [u8]);\n\nimpl fmt::Debug for Hex<'_> {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n for &byte in self.0 {\n\n write!(f, \"{:02x}\", byte)?;\n\n }\n\n Ok(())\n\n }\n\n}\n","file_path":"sdk/program/src/debug_account_data.rs","rank":4,"score":348275.408960791},{"content":"pub fn add_genesis_accounts(genesis_config: &mut GenesisConfig, mut issued_lamports: u64) {\n\n // add_stakes() and add_validators() award tokens for rent exemption and\n\n // to cover an initial transfer-free period of the network\n\n\n\n issued_lamports += add_stakes(\n\n genesis_config,\n\n CREATOR_STAKER_INFOS,\n\n &UNLOCKS_HALF_AT_9_MONTHS,\n\n ) + add_stakes(\n\n genesis_config,\n\n SERVICE_STAKER_INFOS,\n\n &UNLOCKS_ALL_AT_9_MONTHS,\n\n ) + add_stakes(\n\n genesis_config,\n\n FOUNDATION_STAKER_INFOS,\n\n &UNLOCKS_ALL_DAY_ZERO,\n\n ) + add_stakes(genesis_config, GRANTS_STAKER_INFOS, &UNLOCKS_ALL_DAY_ZERO)\n\n + add_stakes(\n\n genesis_config,\n\n COMMUNITY_STAKER_INFOS,\n","file_path":"genesis/src/genesis_accounts.rs","rank":5,"score":346203.6286580678},{"content":"pub fn parse_get_epoch_info(_matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n Ok(CliCommandInfo {\n\n command: CliCommand::GetEpochInfo,\n\n signers: vec![],\n\n })\n\n}\n\n\n","file_path":"cli/src/cluster_query.rs","rank":6,"score":344467.0118484084},{"content":"pub fn parse_supply(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n let print_accounts = matches.is_present(\"print_accounts\");\n\n Ok(CliCommandInfo {\n\n command: CliCommand::Supply { print_accounts },\n\n signers: vec![],\n\n })\n\n}\n\n\n","file_path":"cli/src/cluster_query.rs","rank":7,"score":337390.9570174261},{"content":"pub fn parse_decode_transaction(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n let blob = value_t_or_exit!(matches, \"transaction\", String);\n\n let binary_encoding = match matches.value_of(\"encoding\").unwrap() {\n\n \"base58\" => TransactionBinaryEncoding::Base58,\n\n \"base64\" => TransactionBinaryEncoding::Base64,\n\n _ => unreachable!(),\n\n };\n\n\n\n let encoded_transaction = EncodedTransaction::Binary(blob, binary_encoding);\n\n if let Some(transaction) = encoded_transaction.decode() {\n\n Ok(CliCommandInfo {\n\n command: CliCommand::DecodeTransaction(transaction),\n\n signers: vec![],\n\n })\n\n } else {\n\n Err(CliError::BadParameter(\n\n \"Unable to decode transaction\".to_string(),\n\n ))\n\n }\n\n}\n\n\n","file_path":"cli/src/wallet.rs","rank":8,"score":337390.9570174261},{"content":"pub fn lamports_of_sol(matches: &ArgMatches<'_>, name: &str) -> Option<u64> {\n\n value_of(matches, name).map(sol_to_lamports)\n\n}\n\n\n","file_path":"clap-utils/src/input_parsers.rs","rank":9,"score":336678.5429464319},{"content":"#[doc(hidden)]\n\npub fn checked_add(a: u64, b: u64) -> Result<u64, InstructionError> {\n\n a.checked_add(b).ok_or(InstructionError::InsufficientFunds)\n\n}\n\n\n\n/// Describes a single account read or written by a program during instruction\n\n/// execution.\n\n///\n\n/// When constructing an [`Instruction`], a list of all accounts that may be\n\n/// read or written during the execution of that instruction must be supplied.\n\n/// Any account that may be mutated by the program during execution, either its\n\n/// data or metadata such as held lamports, must be writable.\n\n///\n\n/// Note that because the Solana runtime schedules parallel transaction\n\n/// execution around which accounts are writable, care should be taken that only\n\n/// accounts which actually may be mutated are specified as writable. As the\n\n/// default [`AccountMeta::new`] constructor creates writable accounts, this is\n\n/// a minor hazard: use [`AccountMeta::new_readonly`] to specify that an account\n\n/// is not writable.\n\n#[repr(C)]\n\n#[derive(Debug, Default, PartialEq, Eq, Clone, Serialize, Deserialize)]\n","file_path":"sdk/program/src/instruction.rs","rank":10,"score":333428.7267325333},{"content":"pub fn parse_show_validators(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n let use_lamports_unit = matches.is_present(\"lamports\");\n\n let number_validators = matches.is_present(\"number\");\n\n let reverse_sort = matches.is_present(\"reverse\");\n\n let keep_unstaked_delinquents = matches.is_present(\"keep_unstaked_delinquents\");\n\n let delinquent_slot_distance = value_of(matches, \"delinquent_slot_distance\");\n\n\n\n let sort_order = match value_t_or_exit!(matches, \"sort\", String).as_str() {\n\n \"delinquent\" => CliValidatorsSortOrder::Delinquent,\n\n \"commission\" => CliValidatorsSortOrder::Commission,\n\n \"credits\" => CliValidatorsSortOrder::EpochCredits,\n\n \"identity\" => CliValidatorsSortOrder::Identity,\n\n \"last-vote\" => CliValidatorsSortOrder::LastVote,\n\n \"root\" => CliValidatorsSortOrder::Root,\n\n \"skip-rate\" => CliValidatorsSortOrder::SkipRate,\n\n \"stake\" => CliValidatorsSortOrder::Stake,\n\n \"vote-account\" => CliValidatorsSortOrder::VoteAccount,\n\n \"version\" => CliValidatorsSortOrder::Version,\n\n _ => unreachable!(),\n\n };\n","file_path":"cli/src/cluster_query.rs","rank":11,"score":332228.4574413766},{"content":"pub fn parse_get_epoch(_matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n Ok(CliCommandInfo {\n\n command: CliCommand::GetEpoch,\n\n signers: vec![],\n\n })\n\n}\n\n\n","file_path":"cli/src/cluster_query.rs","rank":12,"score":332228.4574413766},{"content":"pub fn parse_get_block(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n let slot = value_of(matches, \"slot\");\n\n Ok(CliCommandInfo {\n\n command: CliCommand::GetBlock { slot },\n\n signers: vec![],\n\n })\n\n}\n\n\n","file_path":"cli/src/cluster_query.rs","rank":13,"score":332228.4574413766},{"content":"pub fn parse_largest_accounts(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n let filter = if matches.is_present(\"circulating\") {\n\n Some(RpcLargestAccountsFilter::Circulating)\n\n } else if matches.is_present(\"non_circulating\") {\n\n Some(RpcLargestAccountsFilter::NonCirculating)\n\n } else {\n\n None\n\n };\n\n Ok(CliCommandInfo {\n\n command: CliCommand::LargestAccounts { filter },\n\n signers: vec![],\n\n })\n\n}\n\n\n","file_path":"cli/src/cluster_query.rs","rank":14,"score":332228.4574413766},{"content":"pub fn parse_leader_schedule(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n let epoch = value_of(matches, \"epoch\");\n\n Ok(CliCommandInfo {\n\n command: CliCommand::LeaderSchedule { epoch },\n\n signers: vec![],\n\n })\n\n}\n\n\n","file_path":"cli/src/cluster_query.rs","rank":15,"score":332228.4574413766},{"content":"pub fn parse_show_stake_history(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n let use_lamports_unit = matches.is_present(\"lamports\");\n\n let limit_results = value_of(matches, \"limit\").unwrap();\n\n Ok(CliCommandInfo {\n\n command: CliCommand::ShowStakeHistory {\n\n use_lamports_unit,\n\n limit_results,\n\n },\n\n signers: vec![],\n\n })\n\n}\n\n\n","file_path":"cli/src/stake.rs","rank":16,"score":332228.4574413766},{"content":"pub fn parse_get_slot(_matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n Ok(CliCommandInfo {\n\n command: CliCommand::GetSlot,\n\n signers: vec![],\n\n })\n\n}\n\n\n","file_path":"cli/src/cluster_query.rs","rank":17,"score":332228.4574413766},{"content":"pub fn parse_total_supply(_matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n Ok(CliCommandInfo {\n\n command: CliCommand::TotalSupply,\n\n signers: vec![],\n\n })\n\n}\n\n\n","file_path":"cli/src/cluster_query.rs","rank":18,"score":332228.4574413766},{"content":"pub fn load_genesis_accounts(file: &str, genesis_config: &mut GenesisConfig) -> io::Result<u64> {\n\n let mut lamports = 0;\n\n let accounts_file = File::open(file)?;\n\n\n\n let genesis_accounts: HashMap<String, Base64Account> =\n\n serde_yaml::from_reader(accounts_file)\n\n .map_err(|err| io::Error::new(io::ErrorKind::Other, format!(\"{:?}\", err)))?;\n\n\n\n for (key, account_details) in genesis_accounts {\n\n let pubkey = pubkey_from_str(key.as_str()).map_err(|err| {\n\n io::Error::new(\n\n io::ErrorKind::Other,\n\n format!(\"Invalid pubkey/keypair {}: {:?}\", key, err),\n\n )\n\n })?;\n\n\n\n let owner_program_id = Pubkey::from_str(account_details.owner.as_str()).map_err(|err| {\n\n io::Error::new(\n\n io::ErrorKind::Other,\n\n format!(\"Invalid owner: {}: {:?}\", account_details.owner, err),\n","file_path":"genesis/src/main.rs","rank":19,"score":327988.0046824709},{"content":"pub fn parse_get_transaction_count(_matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n Ok(CliCommandInfo {\n\n command: CliCommand::GetTransactionCount,\n\n signers: vec![],\n\n })\n\n}\n\n\n","file_path":"cli/src/cluster_query.rs","rank":20,"score":327298.9371430176},{"content":"pub fn parse_get_block_height(_matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n Ok(CliCommandInfo {\n\n command: CliCommand::GetBlockHeight,\n\n signers: vec![],\n\n })\n\n}\n\n\n","file_path":"cli/src/cluster_query.rs","rank":21,"score":327298.9371430176},{"content":"pub fn parse_get_block_time(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n let slot = value_of(matches, \"slot\");\n\n Ok(CliCommandInfo {\n\n command: CliCommand::GetBlockTime { slot },\n\n signers: vec![],\n\n })\n\n}\n\n\n","file_path":"cli/src/cluster_query.rs","rank":22,"score":327298.9371430176},{"content":"pub fn parse_show_block_production(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\n\n let epoch = value_t!(matches, \"epoch\", Epoch).ok();\n\n let slot_limit = value_t!(matches, \"slot_limit\", u64).ok();\n\n\n\n Ok(CliCommandInfo {\n\n command: CliCommand::ShowBlockProduction { epoch, slot_limit },\n\n signers: vec![],\n\n })\n\n}\n\n\n","file_path":"cli/src/cluster_query.rs","rank":23,"score":327298.93714301765},{"content":"// same as genesis_config::create_genesis_config, but with bootstrap_validator staking logic\n\n// for the core crate tests\n\npub fn create_genesis_config(mint_lamports: u64) -> GenesisConfigInfo {\n\n create_genesis_config_with_leader(\n\n mint_lamports,\n\n &solana_sdk::pubkey::new_rand(),\n\n bootstrap_validator_stake_lamports(),\n\n )\n\n}\n","file_path":"ledger/src/genesis_utils.rs","rank":24,"score":321818.65266600804},{"content":"pub fn create_genesis_config(mint_lamports: u64) -> GenesisConfigInfo {\n\n // Note that zero lamports for validator stake will result in stake account\n\n // not being stored in accounts-db but still cached in bank stakes. This\n\n // causes discrepancy between cached stakes accounts in bank and\n\n // accounts-db which in particular will break snapshots test.\n\n create_genesis_config_with_leader(\n\n mint_lamports,\n\n &solana_sdk::pubkey::new_rand(), // validator_pubkey\n\n 0, // validator_stake_lamports\n\n )\n\n}\n\n\n","file_path":"runtime/src/genesis_utils.rs","rank":25,"score":321805.20022950484},{"content":"pub fn check_for_tracer_packet(packet: &mut Packet) -> bool {\n\n let first_pubkey_start: usize = TRACER_KEY_OFFSET_IN_TRANSACTION;\n\n let first_pubkey_end = match first_pubkey_start.checked_add(size_of::<Pubkey>()) {\n\n Some(offset) => offset,\n\n None => return false,\n\n };\n\n // Check for tracer pubkey\n\n match packet.data(first_pubkey_start..first_pubkey_end) {\n\n Some(pubkey) if pubkey == TRACER_KEY.as_ref() => {\n\n packet.meta.set_tracer(true);\n\n true\n\n }\n\n _ => false,\n\n }\n\n}\n\n\n","file_path":"perf/src/sigverify.rs","rank":26,"score":317754.78846294957},{"content":"/// Helper function for programs to call [`GetMinimumDelegation`] and then fetch the return data\n\n///\n\n/// This fn handles performing the CPI to call the [`GetMinimumDelegation`] function, and then\n\n/// calls [`get_return_data()`] to fetch the return data.\n\n///\n\n/// [`GetMinimumDelegation`]: super::instruction::StakeInstruction::GetMinimumDelegation\n\n/// [`get_return_data()`]: crate::program::get_return_data\n\npub fn get_minimum_delegation() -> Result<u64, ProgramError> {\n\n let instruction = super::instruction::get_minimum_delegation();\n\n crate::program::invoke_unchecked(&instruction, &[])?;\n\n get_minimum_delegation_return_data()\n\n}\n\n\n","file_path":"sdk/program/src/stake/tools.rs","rank":27,"score":316760.68725986104},{"content":"// fun fact: rustc is very close to make this const fn.\n\npub fn bootstrap_validator_stake_lamports() -> u64 {\n\n Rent::default().minimum_balance(StakeState::size_of())\n\n}\n\n\n\n// Number of lamports automatically used for genesis accounts\n\npub const fn genesis_sysvar_and_builtin_program_lamports() -> u64 {\n\n const NUM_BUILTIN_PROGRAMS: u64 = 4;\n\n const FEES_SYSVAR_MIN_BALANCE: u64 = 946_560;\n\n const STAKE_HISTORY_MIN_BALANCE: u64 = 114_979_200;\n\n const CLOCK_SYSVAR_MIN_BALANCE: u64 = 1_169_280;\n\n const RENT_SYSVAR_MIN_BALANCE: u64 = 1_009_200;\n\n const EPOCH_SCHEDULE_SYSVAR_MIN_BALANCE: u64 = 1_120_560;\n\n const RECENT_BLOCKHASHES_SYSVAR_MIN_BALANCE: u64 = 42_706_560;\n\n\n\n FEES_SYSVAR_MIN_BALANCE\n\n + STAKE_HISTORY_MIN_BALANCE\n\n + CLOCK_SYSVAR_MIN_BALANCE\n\n + RENT_SYSVAR_MIN_BALANCE\n\n + EPOCH_SCHEDULE_SYSVAR_MIN_BALANCE\n\n + RECENT_BLOCKHASHES_SYSVAR_MIN_BALANCE\n","file_path":"runtime/src/genesis_utils.rs","rank":28,"score":316424.61475510825},{"content":"pub fn update(config_file: &str, check_only: bool) -> Result<bool, String> {\n\n init_or_update(config_file, false, check_only)\n\n}\n\n\n","file_path":"install/src/command.rs","rank":29,"score":316134.8873880227},{"content":"pub fn create_account(lamports: u64, separate_domains: bool) -> RefCell<AccountSharedData> {\n\n RefCell::new(\n\n AccountSharedData::new_data_with_space(\n\n lamports,\n\n &Versions::new(State::Uninitialized, separate_domains),\n\n State::size(),\n\n &crate::system_program::id(),\n\n )\n\n .expect(\"nonce_account\"),\n\n )\n\n}\n\n\n","file_path":"sdk/src/nonce_account.rs","rank":30,"score":315246.39339322114},{"content":"#[allow(clippy::type_complexity)]\n\nfn run_simulation(stakes: &[u64], fanout: usize) {\n\n let num_threads = num_threads();\n\n // set timeout to 5 minutes\n\n let timeout = 60 * 5;\n\n\n\n // describe the leader\n\n let leader_info = ContactInfo::new_localhost(&solana_sdk::pubkey::new_rand(), 0);\n\n let cluster_info = ClusterInfo::new(\n\n leader_info.clone(),\n\n Arc::new(Keypair::new()),\n\n SocketAddrSpace::Unspecified,\n\n );\n\n\n\n // setup staked nodes\n\n let mut staked_nodes = HashMap::new();\n\n\n\n // setup accounts for all nodes (leader has 0 bal)\n\n let (s, r) = unbounded();\n\n let senders: Arc<Mutex<HashMap<Pubkey, Sender<(i32, bool)>>>> =\n\n Arc::new(Mutex::new(HashMap::new()));\n","file_path":"gossip/tests/cluster_info.rs","rank":31,"score":314431.6721822928},{"content":"/// Approximately convert fractional native tokens (lamports) into native tokens (SOL)\n\npub fn lamports_to_sol(lamports: u64) -> f64 {\n\n lamports as f64 / LAMPORTS_PER_SOL as f64\n\n}\n\n\n","file_path":"sdk/program/src/native_token.rs","rank":32,"score":309632.6382775324},{"content":"pub fn lamports_of_sol(matches: &ArgMatches, name: &str) -> Option<u64> {\n\n value_of(matches, name).map(sol_to_lamports)\n\n}\n\n\n","file_path":"clap-v3-utils/src/input_parsers.rs","rank":33,"score":309361.78459706303},{"content":"pub fn init_or_update(config_file: &str, is_init: bool, check_only: bool) -> Result<bool, String> {\n\n let mut config = Config::load(config_file)?;\n\n\n\n let semver_update_type = if is_init {\n\n SemverUpdateType::Fixed\n\n } else {\n\n SemverUpdateType::Patch\n\n };\n\n\n\n let (updated_version, download_url_and_sha256, release_dir) = if let Some(explicit_release) =\n\n &config.explicit_release\n\n {\n\n match explicit_release {\n\n ExplicitRelease::Semver(current_release_semver) => {\n\n let progress_bar = new_spinner_progress_bar();\n\n progress_bar.set_message(format!(\"{}Checking for updates...\", LOOKING_GLASS));\n\n\n\n let github_release = check_for_newer_github_release(\n\n semver::VersionReq::parse(&format!(\n\n \"{}{}\",\n","file_path":"install/src/command.rs","rank":34,"score":308979.70543065824},{"content":"/// Computes the numbr of milliseconds `num_blocks` blocks will take given\n\n/// each slot contains `ticks_per_slot`\n\npub fn ms_for_n_slots(num_blocks: u64, ticks_per_slot: u64) -> u64 {\n\n ((ticks_per_slot * DEFAULT_MS_PER_SLOT * num_blocks) + DEFAULT_TICKS_PER_SLOT - 1)\n\n / DEFAULT_TICKS_PER_SLOT\n\n}\n\n\n","file_path":"local-cluster/tests/common.rs","rank":35,"score":308028.8563601868},{"content":"fn stake_weighted_shuffle(stakes_and_index: &[(u64, usize)], seed: [u8; 32]) -> Vec<(u64, usize)> {\n\n let mut rng = ChaChaRng::from_seed(seed);\n\n let stake_weights: Vec<_> = stakes_and_index.iter().map(|(w, _)| *w).collect();\n\n let shuffle = WeightedShuffle::new(\"stake_weighted_shuffle\", &stake_weights);\n\n shuffle\n\n .shuffle(&mut rng)\n\n .map(|i| stakes_and_index[i])\n\n .collect()\n\n}\n\n\n","file_path":"gossip/tests/cluster_info.rs","rank":36,"score":306589.7603793087},{"content":"/// Search for the a node with the given balance\n\nfn find_insert_shred(id: &Pubkey, shred: i32, batches: &mut [Nodes]) {\n\n batches.par_iter_mut().for_each(|batch| {\n\n if batch.contains_key(id) {\n\n let _ = batch.get_mut(id).unwrap().1.insert(shred);\n\n }\n\n });\n\n}\n\n\n","file_path":"gossip/tests/cluster_info.rs","rank":37,"score":304011.5955035154},{"content":"pub fn ed25519_verify_cpu(batches: &mut [PacketBatch], reject_non_vote: bool, packet_count: usize) {\n\n debug!(\"CPU ECDSA for {}\", packet_count);\n\n let desired_thread_count = packet_count\n\n .saturating_add(VERIFY_MIN_PACKETS_PER_THREAD)\n\n .saturating_div(VERIFY_MIN_PACKETS_PER_THREAD);\n\n if desired_thread_count <= 1 {\n\n // When using single thread, skip rayon overhead.\n\n batches.iter_mut().for_each(|batch| {\n\n batch.iter_mut().for_each(|packet| {\n\n if !packet.meta.discard() && !verify_packet(packet, reject_non_vote) {\n\n packet.meta.set_discard(true);\n\n }\n\n })\n\n });\n\n } else if desired_thread_count < get_thread_count() {\n\n // Dynamically compute minimum packet length to spread the load while minimizing threads.\n\n let packets_per_thread = packet_count.saturating_div(desired_thread_count);\n\n PAR_THREAD_POOL.install(|| {\n\n batches\n\n .into_par_iter()\n","file_path":"perf/src/sigverify.rs","rank":38,"score":303790.8855595963},{"content":"pub fn read_u8(current: &mut usize, data: &[u8]) -> Result<u8, SanitizeError> {\n\n if data.len() < *current + 1 {\n\n return Err(SanitizeError::IndexOutOfBounds);\n\n }\n\n let e = data[*current];\n\n *current += 1;\n\n Ok(e)\n\n}\n\n\n","file_path":"sdk/program/src/serialize_utils.rs","rank":39,"score":302848.27634783497},{"content":"pub fn read_u16(current: &mut usize, data: &[u8]) -> Result<u16, SanitizeError> {\n\n if data.len() < *current + 2 {\n\n return Err(SanitizeError::IndexOutOfBounds);\n\n }\n\n let mut fixed_data = [0u8; 2];\n\n fixed_data.copy_from_slice(&data[*current..*current + 2]);\n\n let e = u16::from_le_bytes(fixed_data);\n\n *current += 2;\n\n Ok(e)\n\n}\n\n\n","file_path":"sdk/program/src/serialize_utils.rs","rank":40,"score":302848.27634783497},{"content":"pub fn read_pubkey(current: &mut usize, data: &[u8]) -> Result<Pubkey, SanitizeError> {\n\n let len = std::mem::size_of::<Pubkey>();\n\n if data.len() < *current + len {\n\n return Err(SanitizeError::IndexOutOfBounds);\n\n }\n\n let e = Pubkey::new(&data[*current..*current + len]);\n\n *current += len;\n\n Ok(e)\n\n}\n\n\n","file_path":"sdk/program/src/serialize_utils.rs","rank":41,"score":302848.27634783497},{"content":"pub fn add_genesis_accounts(genesis_config: &mut GenesisConfig) -> u64 {\n\n config::add_genesis_account(genesis_config)\n\n}\n\n\n\n/// The minimum stake amount that can be delegated, in lamports.\n\n/// NOTE: This is also used to calculate the minimum balance of a stake account, which is the\n\n/// rent exempt reserve _plus_ the minimum stake delegation.\n","file_path":"programs/stake/src/lib.rs","rank":42,"score":302433.560792087},{"content":"pub fn add_genesis_account(genesis_config: &mut GenesisConfig) -> u64 {\n\n let mut account = create_config_account(vec![], &Config::default(), 0);\n\n let lamports = genesis_config.rent.minimum_balance(account.data().len());\n\n\n\n account.set_lamports(lamports.max(1));\n\n\n\n genesis_config.add_account(config::id(), account);\n\n\n\n lamports\n\n}\n","file_path":"programs/stake/src/config.rs","rank":43,"score":302433.560792087},{"content":"#[test]\n\npub fn cluster_info_retransmit() {\n\n solana_logger::setup();\n\n let exit = Arc::new(AtomicBool::new(false));\n\n trace!(\"c1:\");\n\n let (c1, dr1, tn1) = test_node(&exit);\n\n trace!(\"c2:\");\n\n let (c2, dr2, tn2) = test_node(&exit);\n\n trace!(\"c3:\");\n\n let (c3, dr3, tn3) = test_node(&exit);\n\n let c1_contact_info = c1.my_contact_info();\n\n\n\n c2.insert_info(c1_contact_info.clone());\n\n c3.insert_info(c1_contact_info);\n\n\n\n let num = 3;\n\n\n\n //wait to converge\n\n trace!(\"waiting to converge:\");\n\n let mut done = false;\n\n for _ in 0..30 {\n","file_path":"gossip/tests/gossip.rs","rank":44,"score":301892.0214559047},{"content":"#[test]\n\n#[ignore]\n\npub fn cluster_info_scale() {\n\n use {\n\n solana_measure::measure::Measure,\n\n solana_perf::test_tx::test_tx,\n\n solana_runtime::{\n\n bank::Bank,\n\n genesis_utils::{create_genesis_config_with_vote_accounts, ValidatorVoteKeypairs},\n\n },\n\n };\n\n solana_logger::setup();\n\n let exit = Arc::new(AtomicBool::new(false));\n\n let num_nodes: usize = std::env::var(\"NUM_NODES\")\n\n .unwrap_or_else(|_| \"10\".to_string())\n\n .parse()\n\n .expect(\"could not parse NUM_NODES as a number\");\n\n\n\n let vote_keypairs: Vec<_> = (0..num_nodes)\n\n .map(|_| ValidatorVoteKeypairs::new_rand())\n\n .collect();\n\n let genesis_config_info = create_genesis_config_with_vote_accounts(\n","file_path":"gossip/tests/gossip.rs","rank":45,"score":301891.9504263966},{"content":"#[allow(clippy::integer_arithmetic)]\n\nfn check_overlapping_do_not_use(src_addr: u64, dst_addr: u64, n: u64) -> bool {\n\n (src_addr <= dst_addr && src_addr + n > dst_addr)\n\n || (dst_addr <= src_addr && dst_addr + n > src_addr)\n\n}\n\n\n","file_path":"programs/bpf_loader/src/syscalls.rs","rank":46,"score":299843.1479505471},{"content":"// Check if the provided program id as a known SPL Token program id\n\npub fn is_known_spl_token_id(program_id: &Pubkey) -> bool {\n\n *program_id == spl_token_id() || *program_id == spl_token_2022_id()\n\n}\n\n\n","file_path":"account-decoder/src/parse_token.rs","rank":47,"score":294585.30090657074},{"content":"/// Return true if the first keyed_account is executable, used to determine if\n\n/// the loader should call a program's 'main'\n\npub fn is_executable(keyed_accounts: &[KeyedAccount]) -> Result<bool, InstructionError> {\n\n Ok(!keyed_accounts.is_empty() && keyed_accounts[0].executable()?)\n\n}\n\n\n\nimpl<'a, T> State<T> for crate::keyed_account::KeyedAccount<'a>\n\nwhere\n\n T: serde::Serialize + serde::de::DeserializeOwned,\n\n{\n\n fn state(&self) -> Result<T, InstructionError> {\n\n self.try_account_ref()?.state()\n\n }\n\n fn set_state(&self, state: &T) -> Result<(), InstructionError> {\n\n self.try_account_ref_mut()?.set_state(state)\n\n }\n\n}\n","file_path":"sdk/src/keyed_account.rs","rank":48,"score":294136.9710972106},{"content":"#[cfg(not(target_os = \"linux\"))]\n\npub fn recv_mmsg(socket: &UdpSocket, packets: &mut [Packet]) -> io::Result</*num packets:*/ usize> {\n\n debug_assert!(packets.iter().all(|pkt| pkt.meta == Meta::default()));\n\n let mut i = 0;\n\n let count = cmp::min(NUM_RCVMMSGS, packets.len());\n\n for p in packets.iter_mut().take(count) {\n\n p.meta.size = 0;\n\n match socket.recv_from(p.buffer_mut()) {\n\n Err(_) if i > 0 => {\n\n break;\n\n }\n\n Err(e) => {\n\n return Err(e);\n\n }\n\n Ok((nrecv, from)) => {\n\n p.meta.size = nrecv;\n\n p.meta.set_socket_addr(&from);\n\n if i == 0 {\n\n socket.set_nonblocking(true)?;\n\n }\n\n }\n\n }\n\n i += 1;\n\n }\n\n Ok(i)\n\n}\n\n\n","file_path":"streamer/src/recvmmsg.rs","rank":49,"score":293169.12655833317},{"content":"#[cfg(target_os = \"linux\")]\n\n#[allow(clippy::uninit_assumed_init)]\n\npub fn recv_mmsg(sock: &UdpSocket, packets: &mut [Packet]) -> io::Result</*num packets:*/ usize> {\n\n // Assert that there are no leftovers in packets.\n\n debug_assert!(packets.iter().all(|pkt| pkt.meta == Meta::default()));\n\n const SOCKADDR_STORAGE_SIZE: usize = mem::size_of::<sockaddr_storage>();\n\n\n\n let mut hdrs: [mmsghdr; NUM_RCVMMSGS] = unsafe { mem::zeroed() };\n\n let mut iovs: [iovec; NUM_RCVMMSGS] = unsafe { mem::MaybeUninit::uninit().assume_init() };\n\n let mut addrs: [sockaddr_storage; NUM_RCVMMSGS] = unsafe { mem::zeroed() };\n\n\n\n let sock_fd = sock.as_raw_fd();\n\n let count = cmp::min(iovs.len(), packets.len());\n\n\n\n for (packet, hdr, iov, addr) in\n\n izip!(packets.iter_mut(), &mut hdrs, &mut iovs, &mut addrs).take(count)\n\n {\n\n let buffer = packet.buffer_mut();\n\n *iov = iovec {\n\n iov_base: buffer.as_mut_ptr() as *mut libc::c_void,\n\n iov_len: buffer.len(),\n\n };\n","file_path":"streamer/src/recvmmsg.rs","rank":50,"score":293169.12655833317},{"content":"fn parse_settings(matches: &ArgMatches<'_>) -> Result<bool, Box<dyn error::Error>> {\n\n let parse_args = match matches.subcommand() {\n\n (\"config\", Some(matches)) => {\n\n let config_file = match matches.value_of(\"config_file\") {\n\n None => {\n\n println!(\n\n \"{} Either provide the `--config` arg or ensure home directory exists to use the default config location\",\n\n style(\"No config file found.\").bold()\n\n );\n\n return Ok(false);\n\n }\n\n Some(config_file) => config_file,\n\n };\n\n let mut config = Config::load(config_file).unwrap_or_default();\n\n\n\n match matches.subcommand() {\n\n (\"get\", Some(subcommand_matches)) => {\n\n let (url_setting_type, json_rpc_url) =\n\n ConfigInput::compute_json_rpc_url_setting(\"\", &config.json_rpc_url);\n\n let (ws_setting_type, websocket_url) =\n","file_path":"cli/src/main.rs","rank":51,"score":293063.59119374276},{"content":"/// Approximately convert native tokens (SOL) into fractional native tokens (lamports)\n\npub fn sol_to_lamports(sol: f64) -> u64 {\n\n (sol * LAMPORTS_PER_SOL as f64) as u64\n\n}\n\n\n\nuse std::fmt::{Debug, Display, Formatter, Result};\n\npub struct Sol(pub u64);\n\n\n\nimpl Sol {\n\n fn write_in_sol(&self, f: &mut Formatter) -> Result {\n\n write!(\n\n f,\n\n \"◎{}.{:09}\",\n\n self.0 / LAMPORTS_PER_SOL,\n\n self.0 % LAMPORTS_PER_SOL\n\n )\n\n }\n\n}\n\n\n\nimpl Display for Sol {\n\n fn fmt(&self, f: &mut Formatter) -> Result {\n\n self.write_in_sol(f)\n\n }\n\n}\n\n\n\nimpl Debug for Sol {\n\n fn fmt(&self, f: &mut Formatter) -> Result {\n\n self.write_in_sol(f)\n\n }\n\n}\n","file_path":"sdk/program/src/native_token.rs","rank":52,"score":292714.1969021525},{"content":"#[cfg(not(windows))]\n\npub fn stop_process(process: &mut Child) -> Result<(), io::Error> {\n\n use {\n\n nix::{\n\n errno::Errno::{EINVAL, EPERM, ESRCH},\n\n sys::signal::{kill, Signal},\n\n unistd::Pid,\n\n },\n\n std::{\n\n io::ErrorKind,\n\n thread,\n\n time::{Duration, Instant},\n\n },\n\n };\n\n\n\n let nice_wait = Duration::from_secs(5);\n\n let pid = Pid::from_raw(process.id() as i32);\n\n match kill(pid, Signal::SIGINT) {\n\n Ok(()) => {\n\n let expire = Instant::now() + nice_wait;\n\n while let Ok(None) = process.try_wait() {\n","file_path":"install/src/stop_process.rs","rank":53,"score":291561.81816975446},{"content":"#[cfg(not(target_os = \"solana\"))]\n\npub fn split_u64(\n\n amount: u64,\n\n lo_bit_length: usize,\n\n hi_bit_length: usize,\n\n) -> Result<(u64, u64), ProofError> {\n\n assert!(lo_bit_length <= 64);\n\n assert!(hi_bit_length <= 64);\n\n\n\n if !bool::from((amount >> (lo_bit_length + hi_bit_length)).ct_eq(&0u64)) {\n\n return Err(ProofError::TransferAmount);\n\n }\n\n\n\n let lo = amount << (64 - lo_bit_length) >> (64 - lo_bit_length);\n\n let hi = amount >> lo_bit_length;\n\n\n\n Ok((lo, hi))\n\n}\n\n\n","file_path":"zk-token-sdk/src/instruction/mod.rs","rank":54,"score":289015.5451990266},{"content":"pub fn copy_return_values(sig_lens: &[Vec<u32>], out: &PinnedVec<u8>, rvs: &mut [Vec<u8>]) {\n\n let mut num = 0;\n\n for (vs, sig_vs) in rvs.iter_mut().zip(sig_lens.iter()) {\n\n for (v, sig_v) in vs.iter_mut().zip(sig_vs.iter()) {\n\n if *sig_v == 0 {\n\n *v = 0;\n\n } else {\n\n let mut vout = 1;\n\n for _ in 0..*sig_v {\n\n if 0 == out[num] {\n\n vout = 0;\n\n }\n\n num = num.saturating_add(1);\n\n }\n\n *v = vout;\n\n }\n\n if *v != 0 {\n\n trace!(\"VERIFIED PACKET!!!!!\");\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"perf/src/sigverify.rs","rank":55,"score":288484.96715814364},{"content":"/// return timestamp as ms\n\npub fn timestamp() -> u64 {\n\n let now = SystemTime::now()\n\n .duration_since(UNIX_EPOCH)\n\n .expect(\"create timestamp in timing\");\n\n duration_as_ms(&now)\n\n}\n\n\n\npub const SECONDS_PER_YEAR: f64 = 365.242_199 * 24.0 * 60.0 * 60.0;\n\n\n","file_path":"sdk/src/timing.rs","rank":56,"score":286581.67556795524},{"content":"// Return an error if a validator field is longer than the max length.\n\npub fn is_short_field(string: String) -> Result<(), String> {\n\n if string.len() > MAX_SHORT_FIELD_LENGTH {\n\n Err(format!(\n\n \"validator field longer than {:?}-byte limit\",\n\n MAX_SHORT_FIELD_LENGTH\n\n ))\n\n } else {\n\n Ok(())\n\n }\n\n}\n\n\n","file_path":"cli/src/validator_info.rs","rank":57,"score":285301.0404440205},{"content":"// Return an error if url field is too long or cannot be parsed.\n\npub fn check_url(string: String) -> Result<(), String> {\n\n is_url(string.clone())?;\n\n if string.len() > MAX_SHORT_FIELD_LENGTH {\n\n Err(format!(\n\n \"url longer than {:?}-byte limit\",\n\n MAX_SHORT_FIELD_LENGTH\n\n ))\n\n } else {\n\n Ok(())\n\n }\n\n}\n\n\n","file_path":"cli/src/validator_info.rs","rank":58,"score":285301.0404440205},{"content":"#[allow(clippy::same_item_push)]\n\npub fn create_ticks(num_ticks: u64, hashes_per_tick: u64, mut hash: Hash) -> Vec<Entry> {\n\n let mut ticks = Vec::with_capacity(num_ticks as usize);\n\n for _ in 0..num_ticks {\n\n let new_tick = next_entry_mut(&mut hash, hashes_per_tick, vec![]);\n\n ticks.push(new_tick);\n\n }\n\n\n\n ticks\n\n}\n\n\n","file_path":"entry/src/entry.rs","rank":59,"score":283163.3284964023},{"content":"pub fn create_test_account(sample: usize) -> (StoredMeta, AccountSharedData) {\n\n let data_len = sample % 256;\n\n let mut account = AccountSharedData::new(sample as u64, 0, &Pubkey::default());\n\n account.set_data((0..data_len).map(|_| data_len as u8).collect());\n\n let stored_meta = StoredMeta {\n\n write_version: 0,\n\n pubkey: Pubkey::default(),\n\n data_len: data_len as u64,\n\n };\n\n (stored_meta, account)\n\n}\n","file_path":"runtime/src/append_vec/test_utils.rs","rank":60,"score":283076.69283467135},{"content":"fn run_tpu_send_transaction(tpu_use_quic: bool) {\n\n let mint_keypair = Keypair::new();\n\n let mint_pubkey = mint_keypair.pubkey();\n\n let test_validator =\n\n TestValidator::with_no_fees(mint_pubkey, None, SocketAddrSpace::Unspecified);\n\n let rpc_client = Arc::new(RpcClient::new_with_commitment(\n\n test_validator.rpc_url(),\n\n CommitmentConfig::processed(),\n\n ));\n\n let connection_cache = Arc::new(ConnectionCache::new(\n\n tpu_use_quic,\n\n DEFAULT_TPU_CONNECTION_POOL_SIZE,\n\n ));\n\n let tpu_client = TpuClient::new_with_connection_cache(\n\n rpc_client.clone(),\n\n &test_validator.rpc_pubsub_url(),\n\n TpuClientConfig::default(),\n\n connection_cache,\n\n )\n\n .unwrap();\n","file_path":"rpc-test/tests/rpc.rs","rank":61,"score":282586.35242217686},{"content":"/// Check if the detected device is a valid `Ledger device` by checking both the product ID and the vendor ID\n\npub fn is_valid_ledger(vendor_id: u16, product_id: u16) -> bool {\n\n vendor_id == LEDGER_VID\n\n && (LEDGER_NANO_S_PIDS.contains(&product_id) || LEDGER_NANO_X_PIDS.contains(&product_id))\n\n}\n\n\n","file_path":"remote-wallet/src/ledger.rs","rank":62,"score":281349.5106993562},{"content":"/// Invoke a cross-program instruction.\n\n///\n\n/// Invoking one program from another program requires an [`Instruction`]\n\n/// containing the program ID of the other program, instruction data that\n\n/// will be understood by the other program, and a list of [`AccountInfo`]s\n\n/// corresponding to all of the accounts accessed by the other program. Because\n\n/// the only way for a program to acquire `AccountInfo` values is by receiving\n\n/// them from the runtime at the [program entrypoint][entrypoint!], any account\n\n/// required by the callee program must transitively be required by the caller\n\n/// program, and provided by _its_ caller. The same is true of the program ID of\n\n/// the called program.\n\n///\n\n/// The `Instruction` is usually built from within the calling program, but may\n\n/// be deserialized from an external source.\n\n///\n\n/// This function will not return if the called program returns anything other\n\n/// than success. If the callee returns an error or aborts then the entire\n\n/// transaction will immediately fail. To return data as the result of a\n\n/// cross-program invocation use the [`set_return_data`] / [`get_return_data`]\n\n/// functions, or have the callee write to a dedicated account for that purpose.\n\n///\n\n/// A program may directly call itself recursively, but may not be indirectly\n\n/// called recursively (reentered) by another program. Indirect reentrancy will\n\n/// cause the transaction to immediately fail.\n\n///\n\n/// # Validation of shared data between programs\n\n///\n\n/// The `AccountInfo` structures passed to this function contain data that is\n\n/// directly accessed by the runtime and is copied to and from the memory space\n\n/// of the called program. Some of that data, the [`AccountInfo::lamports`] and\n\n/// [`AccountInfo::data`] fields, may be mutated as a side-effect of the called\n\n/// program, if that program has writable access to the given account.\n\n///\n\n/// These two fields are stored in [`RefCell`]s to enforce the aliasing\n\n/// discipline for mutated values required by the Rust language. Prior to\n\n/// invoking the runtime, this routine will test that each `RefCell` is\n\n/// borrowable as required by the callee and return an error if not.\n\n///\n\n/// The CPU cost of these runtime checks can be avoided with the unsafe\n\n/// [`invoke_unchecked`] function.\n\n///\n\n/// [`RefCell`]: std::cell::RefCell\n\n///\n\n/// # Errors\n\n///\n\n/// If the called program completes successfully and violates no runtime\n\n/// invariants, then this function will return successfully. If the callee\n\n/// completes and returns a [`ProgramError`], then the transaction will\n\n/// immediately fail. Control will not return to the caller.\n\n///\n\n/// Various runtime invariants are checked before the callee is invoked and\n\n/// before returning control to the caller. If any of these invariants are\n\n/// violated then the transaction will immediately fail. A non-exhaustive list\n\n/// of these invariants includes:\n\n///\n\n/// - The sum of lamports owned by all referenced accounts has not changed.\n\n/// - A program has not debited lamports from an account it does not own.\n\n/// - A program has not otherwise written to an account that it does not own.\n\n/// - A program has not written to an account that is not writable.\n\n/// - The size of account data has not exceeded applicable limits.\n\n///\n\n/// If the invoked program does not exist or is not executable then\n\n/// the transaction will immediately fail.\n\n///\n\n/// If any of the `RefCell`s within the provided `AccountInfo`s cannot be\n\n/// borrowed in accordance with the call's requirements, an error of\n\n/// [`ProgramError::AccountBorrowFailed`] is returned.\n\n///\n\n/// [`ProgramError`]: crate::program_error::ProgramError\n\n/// [`ProgramError::AccountBorrowFailed`]: crate::program_error::ProgramError::AccountBorrowFailed\n\n///\n\n/// # Examples\n\n///\n\n/// A simple example of transferring lamports via CPI:\n\n///\n\n/// ```\n\n/// use solana_program::{\n\n/// account_info::{next_account_info, AccountInfo},\n\n/// entrypoint,\n\n/// entrypoint::ProgramResult,\n\n/// program::invoke,\n\n/// pubkey::Pubkey,\n\n/// system_instruction,\n\n/// system_program,\n\n/// };\n\n///\n\n/// entrypoint!(process_instruction);\n\n///\n\n/// fn process_instruction(\n\n/// program_id: &Pubkey,\n\n/// accounts: &[AccountInfo],\n\n/// instruction_data: &[u8],\n\n/// ) -> ProgramResult {\n\n/// let account_info_iter = &mut accounts.iter();\n\n///\n\n/// let payer = next_account_info(account_info_iter)?;\n\n/// let recipient = next_account_info(account_info_iter)?;\n\n/// // The system program is a required account to invoke a system\n\n/// // instruction, even though we don't use it directly.\n\n/// let system_program_account = next_account_info(account_info_iter)?;\n\n///\n\n/// assert!(payer.is_writable);\n\n/// assert!(payer.is_signer);\n\n/// assert!(recipient.is_writable);\n\n/// assert!(system_program::check_id(system_program_account.key));\n\n///\n\n/// let lamports = 1000000;\n\n///\n\n/// invoke(\n\n/// &system_instruction::transfer(payer.key, recipient.key, lamports),\n\n/// &[payer.clone(), recipient.clone(), system_program_account.clone()],\n\n/// )\n\n/// }\n\n/// ```\n\npub fn invoke(instruction: &Instruction, account_infos: &[AccountInfo]) -> ProgramResult {\n\n invoke_signed(instruction, account_infos, &[])\n\n}\n\n\n","file_path":"sdk/program/src/program.rs","rank":63,"score":281248.1852152104},{"content":"#[allow(clippy::result_unit_err)]\n\npub fn decode_shortu16_len(bytes: &[u8]) -> Result<(usize, usize), ()> {\n\n let mut val = 0;\n\n for (nth_byte, byte) in bytes.iter().take(MAX_ENCODING_LENGTH).enumerate() {\n\n match visit_byte(*byte, val, nth_byte).map_err(|_| ())? {\n\n VisitStatus::More(new_val) => val = new_val,\n\n VisitStatus::Done(new_val) => {\n\n return Ok((usize::from(new_val), nth_byte.saturating_add(1)));\n\n }\n\n }\n\n }\n\n Err(())\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use {\n\n super::*,\n\n assert_matches::assert_matches,\n\n bincode::{deserialize, serialize},\n\n };\n","file_path":"sdk/program/src/short_vec.rs","rank":64,"score":281151.4766003186},{"content":"pub fn new_test_vote_tx<R>(rng: &mut R) -> Transaction\n\nwhere\n\n R: CryptoRng + RngCore,\n\n{\n\n let mut slots: Vec<Slot> = std::iter::repeat_with(|| rng.gen()).take(5).collect();\n\n slots.sort_unstable();\n\n slots.dedup();\n\n let switch_proof_hash = rng.gen_bool(0.5).then(|| solana_sdk::hash::new_rand(rng));\n\n vote_transaction::new_vote_transaction(\n\n slots,\n\n solana_sdk::hash::new_rand(rng), // bank_hash\n\n solana_sdk::hash::new_rand(rng), // blockhash\n\n &Keypair::generate(rng), // node_keypair\n\n &Keypair::generate(rng), // vote_keypair\n\n &Keypair::generate(rng), // authorized_voter_keypair\n\n switch_proof_hash,\n\n )\n\n}\n","file_path":"perf/src/test_tx.rs","rank":65,"score":280785.8355750196},{"content":"fn deposit_many(bank: &Bank, pubkeys: &mut Vec<Pubkey>, num: usize) -> Result<(), LamportsError> {\n\n for t in 0..num {\n\n let pubkey = solana_sdk::pubkey::new_rand();\n\n let account =\n\n AccountSharedData::new((t + 1) as u64, 0, AccountSharedData::default().owner());\n\n pubkeys.push(pubkey);\n\n assert!(bank.get_account(&pubkey).is_none());\n\n bank.deposit(&pubkey, (t + 1) as u64)?;\n\n assert_eq!(bank.get_account(&pubkey).unwrap(), account);\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"runtime/benches/accounts.rs","rank":66,"score":280116.43889215693},{"content":"// Return an error if a validator details are longer than the max length.\n\npub fn check_details_length(string: String) -> Result<(), String> {\n\n if string.len() > MAX_LONG_FIELD_LENGTH {\n\n Err(format!(\n\n \"validator details longer than {:?}-byte limit\",\n\n MAX_LONG_FIELD_LENGTH\n\n ))\n\n } else {\n\n Ok(())\n\n }\n\n}\n\n\n","file_path":"cli/src/validator_info.rs","rank":67,"score":279919.35310558707},{"content":"pub fn cluster_type_of(matches: &ArgMatches<'_>, name: &str) -> Option<ClusterType> {\n\n value_of(matches, name)\n\n}\n\n\n","file_path":"clap-utils/src/input_parsers.rs","rank":68,"score":279531.7390459175},{"content":"pub fn max_ticks_per_n_shreds(num_shreds: u64, shred_data_size: Option<usize>) -> u64 {\n\n let ticks = create_ticks(1, 0, Hash::default());\n\n max_entries_per_n_shred(&ticks[0], num_shreds, shred_data_size)\n\n}\n\n\n","file_path":"ledger/src/shred.rs","rank":69,"score":276878.0587683183},{"content":"/// Invoke a cross-program instruction but don't enforce Rust's aliasing rules.\n\n///\n\n/// This function is like [`invoke`] except that it does not check that\n\n/// [`RefCell`]s within [`AccountInfo`]s are properly borrowable as described in\n\n/// the documentation for that function. Those checks consume CPU cycles that\n\n/// this function avoids.\n\n///\n\n/// [`RefCell`]: std::cell::RefCell\n\n///\n\n/// # Safety\n\n///\n\n/// __This function is incorrectly missing an `unsafe` declaration.__\n\n///\n\n/// If any of the writable accounts passed to the callee contain data that is\n\n/// borrowed within the calling program, and that data is written to by the\n\n/// callee, then Rust's aliasing rules will be violated and cause undefined\n\n/// behavior.\n\npub fn invoke_unchecked(instruction: &Instruction, account_infos: &[AccountInfo]) -> ProgramResult {\n\n invoke_signed_unchecked(instruction, account_infos, &[])\n\n}\n\n\n","file_path":"sdk/program/src/program.rs","rank":70,"score":276678.85992667463},{"content":"pub fn open_db(path: &str, dry_run: bool) -> Result<PickleDb, Error> {\n\n let policy = if dry_run {\n\n PickleDbDumpPolicy::NeverDump\n\n } else {\n\n PickleDbDumpPolicy::DumpUponRequest\n\n };\n\n let path = Path::new(path);\n\n let db = if path.exists() {\n\n PickleDb::load_yaml(path, policy)?\n\n } else {\n\n if let Some(parent) = path.parent() {\n\n fs::create_dir_all(parent).unwrap();\n\n }\n\n PickleDb::new_yaml(path, policy)\n\n };\n\n Ok(db)\n\n}\n\n\n","file_path":"tokens/src/db.rs","rank":71,"score":275907.6552429135},{"content":"pub fn get_fees_for_messages(messages: &[Message], client: &RpcClient) -> Result<u64, Error> {\n\n // This is an arbitrary value to get regular blockhash updates for balance checks without\n\n // hitting the RPC node with too many requests\n\n const BLOCKHASH_REFRESH_MILLIS: u64 = DEFAULT_MS_PER_SLOT * 32;\n\n\n\n let mut latest_blockhash = client.get_latest_blockhash()?;\n\n let mut now = Instant::now();\n\n let mut fees = 0;\n\n for mut message in messages.iter().cloned() {\n\n if now.elapsed() > Duration::from_millis(BLOCKHASH_REFRESH_MILLIS) {\n\n latest_blockhash = client.get_latest_blockhash()?;\n\n now = Instant::now();\n\n }\n\n message.recent_blockhash = latest_blockhash;\n\n fees += client.get_fee_for_message(&message)?;\n\n }\n\n Ok(fees)\n\n}\n\n\n","file_path":"tokens/src/commands.rs","rank":72,"score":275891.10070906265},{"content":"#[allow(clippy::same_item_push)]\n\npub fn create_random_ticks(num_ticks: u64, max_hashes_per_tick: u64, mut hash: Hash) -> Vec<Entry> {\n\n let mut ticks = Vec::with_capacity(num_ticks as usize);\n\n for _ in 0..num_ticks {\n\n let hashes_per_tick = thread_rng().gen_range(1, max_hashes_per_tick);\n\n let new_tick = next_entry_mut(&mut hash, hashes_per_tick, vec![]);\n\n ticks.push(new_tick);\n\n }\n\n\n\n ticks\n\n}\n\n\n","file_path":"entry/src/entry.rs","rank":73,"score":275775.73724449583},{"content":"// useful for basic tests\n\npub fn create_genesis_config(lamports: u64) -> (GenesisConfig, Keypair) {\n\n let faucet_keypair = Keypair::new();\n\n (\n\n GenesisConfig::new(\n\n &[(\n\n faucet_keypair.pubkey(),\n\n AccountSharedData::new(lamports, 0, &system_program::id()),\n\n )],\n\n &[],\n\n ),\n\n faucet_keypair,\n\n )\n\n}\n\n\n\nimpl Default for GenesisConfig {\n\n fn default() -> Self {\n\n Self {\n\n creation_time: SystemTime::now()\n\n .duration_since(UNIX_EPOCH)\n\n .unwrap()\n","file_path":"sdk/src/genesis_config.rs","rank":74,"score":275155.5347348731},{"content":"#[cfg_attr(not(target_os = \"linux\"), allow(dead_code))]\n\nfn parse_udp_stats(reader: &mut impl BufRead) -> Result<UdpStats, String> {\n\n let mut udp_lines = Vec::default();\n\n for line in reader.lines() {\n\n let line = line.map_err(|e| e.to_string())?;\n\n if line.starts_with(\"Udp:\") {\n\n udp_lines.push(line);\n\n if udp_lines.len() == 2 {\n\n break;\n\n }\n\n }\n\n }\n\n if udp_lines.len() != 2 {\n\n return Err(format!(\n\n \"parse error, expected 2 lines, num lines: {}\",\n\n udp_lines.len()\n\n ));\n\n }\n\n\n\n let pairs: Vec<_> = udp_lines[0]\n\n .split_ascii_whitespace()\n","file_path":"core/src/system_monitor_service.rs","rank":75,"score":274939.5013633986},{"content":"pub fn next_entry_mut(start: &mut Hash, num_hashes: u64, transactions: Vec<Transaction>) -> Entry {\n\n let entry = Entry::new(start, num_hashes, transactions);\n\n *start = entry.hash;\n\n entry\n\n}\n\n\n","file_path":"entry/src/entry.rs","rank":76,"score":273876.75310222694},{"content":"fn check_loader_id(id: &Pubkey) -> bool {\n\n bpf_loader::check_id(id)\n\n || bpf_loader_deprecated::check_id(id)\n\n || bpf_loader_upgradeable::check_id(id)\n\n}\n\n\n","file_path":"programs/bpf_loader/src/lib.rs","rank":77,"score":271152.0147084979},{"content":"pub fn main() -> Result<(), String> {\n\n solana_logger::setup();\n\n\n\n let matches = App::new(crate_name!())\n\n .about(crate_description!())\n\n .version(solana_version::version!())\n\n .setting(AppSettings::SubcommandRequiredElseHelp)\n\n .arg({\n\n let arg = Arg::with_name(\"config_file\")\n\n .short(\"c\")\n\n .long(\"config\")\n\n .value_name(\"PATH\")\n\n .takes_value(true)\n\n .global(true)\n\n .help(\"Configuration file to use\");\n\n match *defaults::CONFIG_FILE {\n\n Some(ref config_file) => arg.default_value(config_file),\n\n None => arg.required(true),\n\n }\n\n })\n","file_path":"install/src/lib.rs","rank":78,"score":271141.49512706866},{"content":"pub fn lamports_per_signature_of(account: &AccountSharedData) -> Option<u64> {\n\n match StateMut::<Versions>::state(account).ok()?.state() {\n\n State::Initialized(data) => Some(data.fee_calculator.lamports_per_signature),\n\n State::Uninitialized => None,\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use {\n\n super::*,\n\n crate::{\n\n fee_calculator::FeeCalculator,\n\n nonce::state::{Data, DurableNonce},\n\n pubkey::Pubkey,\n\n system_program,\n\n },\n\n };\n\n\n\n #[test]\n","file_path":"sdk/src/nonce_account.rs","rank":79,"score":270316.8390019919},{"content":"#[bench]\n\nfn test_statuscache_serialize(bencher: &mut Bencher) {\n\n let mut status_cache = BankStatusCache::default();\n\n status_cache.add_root(0);\n\n status_cache.clear();\n\n for hash_index in 0..100 {\n\n let blockhash = Hash::new(&vec![hash_index; std::mem::size_of::<Hash>()]);\n\n let mut id = blockhash;\n\n for _ in 0..100 {\n\n id = hash(id.as_ref());\n\n let mut sigbytes = Vec::from(id.as_ref());\n\n id = hash(id.as_ref());\n\n sigbytes.extend(id.as_ref());\n\n let sig = Signature::new(&sigbytes);\n\n status_cache.insert(&blockhash, &sig, 0, ());\n\n }\n\n }\n\n bencher.iter(|| {\n\n let _ = serialize(&status_cache.slot_deltas(&[0])).unwrap();\n\n });\n\n}\n","file_path":"runtime/benches/status_cache.rs","rank":80,"score":269896.6243642488},{"content":"pub fn overwrite_slot_hashes_with_slots(context: &mut ProgramTestContext, slots: &[Slot]) {\n\n let mut slot_hashes = SlotHashes::default();\n\n for slot in slots {\n\n slot_hashes.add(*slot, Hash::new_unique());\n\n }\n\n context.set_sysvar(&slot_hashes);\n\n}\n","file_path":"programs/address-lookup-table-tests/tests/common.rs","rank":81,"score":269683.35722813755},{"content":"pub fn create_account(feature: &Feature, lamports: u64) -> AccountSharedData {\n\n let data_len = Feature::size_of().max(bincode::serialized_size(feature).unwrap() as usize);\n\n let mut account = AccountSharedData::new(lamports, data_len, &id());\n\n to_account(feature, &mut account).unwrap();\n\n account\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n\n\n #[test]\n\n fn feature_deserialize_none() {\n\n let just_initialized = AccountSharedData::new(42, Feature::size_of(), &id());\n\n assert_eq!(\n\n from_account(&just_initialized),\n\n Some(Feature { activated_at: None })\n\n );\n\n }\n\n}\n","file_path":"sdk/src/feature.rs","rank":82,"score":268993.17022435454},{"content":"/// Returns Neighbor Nodes and Children Nodes `(neighbors, children)` for a given node based on its stake\n\npub fn compute_retransmit_peers<T: Copy>(\n\n fanout: usize,\n\n index: usize, // Local node's index withing the nodes slice.\n\n nodes: &[T],\n\n) -> (Vec<T> /*neighbors*/, Vec<T> /*children*/) {\n\n // 1st layer: fanout nodes starting at 0\n\n // 2nd layer: fanout**2 nodes starting at fanout\n\n // 3rd layer: fanout**3 nodes starting at fanout + fanout**2\n\n // ...\n\n // Each layer is divided into neighborhoods of fanout nodes each.\n\n let offset = index % fanout; // Node's index within its neighborhood.\n\n let anchor = index - offset; // First node in the neighborhood.\n\n let neighbors = (anchor..)\n\n .take(fanout)\n\n .map(|i| nodes.get(i).copied())\n\n .while_some()\n\n .collect();\n\n let children = ((anchor + 1) * fanout + offset..)\n\n .step_by(fanout)\n\n .take(fanout)\n","file_path":"gossip/src/cluster_info.rs","rank":83,"score":268959.0922242513},{"content":"/// Check if a program is a precompiled program\n\npub fn is_precompile<F>(program_id: &Pubkey, is_enabled: F) -> bool\n\nwhere\n\n F: Fn(&Pubkey) -> bool,\n\n{\n\n PRECOMPILES\n\n .iter()\n\n .any(|precompile| precompile.check_id(program_id, |feature_id| is_enabled(feature_id)))\n\n}\n\n\n","file_path":"sdk/src/precompiles.rs","rank":84,"score":268709.78486750013},{"content":"// Get the activated stake percentage (based on the provided bank) that is visible in gossip\n\nfn get_stake_percent_in_gossip(bank: &Bank, cluster_info: &ClusterInfo, log: bool) -> u64 {\n\n let mut online_stake = 0;\n\n let mut wrong_shred_stake = 0;\n\n let mut wrong_shred_nodes = vec![];\n\n let mut offline_stake = 0;\n\n let mut offline_nodes = vec![];\n\n\n\n let mut total_activated_stake = 0;\n\n let now = timestamp();\n\n // Nodes contact infos are saved to disk and restored on validator startup.\n\n // Staked nodes entries will not expire until an epoch after. So it\n\n // is necessary here to filter for recent entries to establish liveness.\n\n let peers: HashMap<_, _> = cluster_info\n\n .all_tvu_peers()\n\n .into_iter()\n\n .filter(|node| {\n\n let age = now.saturating_sub(node.wallclock);\n\n // Contact infos are refreshed twice during this period.\n\n age < CRDS_GOSSIP_PULL_CRDS_TIMEOUT_MS\n\n })\n","file_path":"core/src/validator.rs","rank":85,"score":268104.8108337479},{"content":"pub fn compute_hash_time_ns(hashes_sample_size: u64) -> u64 {\n\n info!(\"Running {} hashes...\", hashes_sample_size);\n\n let mut v = Hash::default();\n\n let start = Instant::now();\n\n for _ in 0..hashes_sample_size {\n\n v = hash(v.as_ref());\n\n }\n\n start.elapsed().as_nanos() as u64\n\n}\n\n\n","file_path":"entry/src/poh.rs","rank":86,"score":267879.4877889093},{"content":"pub fn main_init() -> Result<(), String> {\n\n solana_logger::setup();\n\n\n\n let matches = App::new(\"solana-install-init\")\n\n .about(\"Initializes a new installation\")\n\n .version(solana_version::version!())\n\n .arg({\n\n let arg = Arg::with_name(\"config_file\")\n\n .short(\"c\")\n\n .long(\"config\")\n\n .value_name(\"PATH\")\n\n .takes_value(true)\n\n .help(\"Configuration file to use\");\n\n match *defaults::CONFIG_FILE {\n\n Some(ref config_file) => arg.default_value(config_file),\n\n None => arg.required(true),\n\n }\n\n })\n\n .arg({\n\n let arg = Arg::with_name(\"data_dir\")\n","file_path":"install/src/lib.rs","rank":87,"score":266010.0368365113},{"content":"pub fn create_account(lamports: u64, config: &Config) -> AccountSharedData {\n\n create_config_account(vec![], config, lamports)\n\n}\n\n\n","file_path":"programs/stake/src/config.rs","rank":88,"score":264169.01049803814},{"content":"#[inline]\n\npub fn sol_memset(s: &mut [u8], c: u8, n: usize) {\n\n #[cfg(target_os = \"solana\")]\n\n unsafe {\n\n crate::syscalls::sol_memset_(s.as_mut_ptr(), c, n as u64);\n\n }\n\n\n\n #[cfg(not(target_os = \"solana\"))]\n\n crate::program_stubs::sol_memset(s.as_mut_ptr(), c, n);\n\n}\n","file_path":"sdk/program/src/program_memory.rs","rank":89,"score":263815.49865804287},{"content":"pub fn serialize_snapshot_data_file<F>(data_file_path: &Path, serializer: F) -> Result<u64>\n\nwhere\n\n F: FnOnce(&mut BufWriter<File>) -> Result<()>,\n\n{\n\n serialize_snapshot_data_file_capped::<F>(\n\n data_file_path,\n\n MAX_SNAPSHOT_DATA_FILE_SIZE,\n\n serializer,\n\n )\n\n}\n\n\n","file_path":"runtime/src/snapshot_utils.rs","rank":90,"score":263483.71577955876},{"content":"pub fn set_entries_for_tests_only(entries: usize) {\n\n NUM_ENTRIES.store(entries, Ordering::Relaxed);\n\n}\n\n\n\npub type SlotHash = (Slot, Hash);\n\n\n\n#[repr(C)]\n\n#[derive(Serialize, Deserialize, PartialEq, Eq, Debug, Default)]\n\npub struct SlotHashes(Vec<SlotHash>);\n\n\n\nimpl SlotHashes {\n\n pub fn add(&mut self, slot: Slot, hash: Hash) {\n\n match self.binary_search_by(|(probe, _)| slot.cmp(probe)) {\n\n Ok(index) => (self.0)[index] = (slot, hash),\n\n Err(index) => (self.0).insert(index, (slot, hash)),\n\n }\n\n (self.0).truncate(get_entries());\n\n }\n\n pub fn position(&self, slot: &Slot) -> Option<usize> {\n\n self.binary_search_by(|(probe, _)| slot.cmp(probe)).ok()\n","file_path":"sdk/program/src/slot_hashes.rs","rank":91,"score":263039.3769318061},{"content":"fn checked_total_count_increment(total_count: u64, limit_count: u64) -> Result<u64> {\n\n let total_count = total_count + 1;\n\n if total_count > limit_count {\n\n return Err(UnpackError::Archive(format!(\n\n \"too many files in snapshot: {:?}\",\n\n total_count\n\n )));\n\n }\n\n Ok(total_count)\n\n}\n\n\n","file_path":"runtime/src/hardened_unpack.rs","rank":92,"score":262881.61984795856},{"content":"fn debug_fmt<T: ReadableAccount>(item: &T, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n let mut f = f.debug_struct(\"Account\");\n\n\n\n f.field(\"lamports\", &item.lamports())\n\n .field(\"data.len\", &item.data().len())\n\n .field(\"owner\", &item.owner())\n\n .field(\"executable\", &item.executable())\n\n .field(\"rent_epoch\", &item.rent_epoch());\n\n debug_account_data(item.data(), &mut f);\n\n\n\n f.finish()\n\n}\n\n\n\nimpl fmt::Debug for Account {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n debug_fmt(self, f)\n\n }\n\n}\n\n\n\nimpl fmt::Debug for AccountSharedData {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n debug_fmt(self, f)\n\n }\n\n}\n\n\n","file_path":"sdk/src/account.rs","rank":93,"score":261433.02519797103},{"content":"pub fn realloc(program_id: &Pubkey, address: &Pubkey, size: usize, bump: &mut u8) -> Instruction {\n\n let mut instruction_data = vec![REALLOC, *bump];\n\n instruction_data.extend_from_slice(&size.to_le_bytes());\n\n\n\n *bump = bump.saturating_add(1);\n\n\n\n Instruction::new_with_bytes(\n\n *program_id,\n\n &instruction_data,\n\n vec![AccountMeta::new(*address, false)],\n\n )\n\n}\n\n\n","file_path":"programs/bpf/rust/realloc/src/instructions.rs","rank":94,"score":261061.23460435704},{"content":"pub fn create_loadable_account(name: &str, lamports: u64) -> AccountSharedData {\n\n create_loadable_account_with_fields(name, (lamports, INITIAL_RENT_EPOCH))\n\n}\n\n\n","file_path":"sdk/src/native_loader.rs","rank":95,"score":259593.67191487906},{"content":"/// Store the current `Instruction`'s index in the Instructions Sysvar data\n\npub fn store_current_index(data: &mut [u8], instruction_index: u16) {\n\n let last_index = data.len() - 2;\n\n data[last_index..last_index + 2].copy_from_slice(&instruction_index.to_le_bytes());\n\n}\n\n\n","file_path":"sdk/program/src/sysvar/instructions.rs","rank":96,"score":259474.1300784176},{"content":"pub fn activate_feature(genesis_config: &mut GenesisConfig, feature_id: Pubkey) {\n\n genesis_config.accounts.insert(\n\n feature_id,\n\n Account::from(feature::create_account(\n\n &Feature {\n\n activated_at: Some(0),\n\n },\n\n std::cmp::max(genesis_config.rent.minimum_balance(Feature::size_of()), 1),\n\n )),\n\n );\n\n}\n\n\n","file_path":"runtime/src/genesis_utils.rs","rank":97,"score":259453.44688201032},{"content":"pub fn create_account<S: Sysvar>(sysvar: &S, lamports: u64) -> Account {\n\n create_account_with_fields(sysvar, (lamports, INITIAL_RENT_EPOCH))\n\n}\n\n\n","file_path":"sdk/src/account.rs","rank":98,"score":258853.19561595586}],"string":"[\n {\n \"content\": \"pub fn is_sysvar_id(id: &Pubkey) -> bool {\\n\\n ALL_IDS.iter().any(|key| key == id)\\n\\n}\\n\\n\\n\\n/// Declares an ID that implements [`SysvarId`].\\n\\n#[macro_export]\\n\\nmacro_rules! declare_sysvar_id(\\n\\n ($name:expr, $type:ty) => (\\n\\n $crate::declare_id!($name);\\n\\n\\n\\n impl $crate::sysvar::SysvarId for $type {\\n\\n fn id() -> $crate::pubkey::Pubkey {\\n\\n id()\\n\\n }\\n\\n\\n\\n fn check_id(pubkey: &$crate::pubkey::Pubkey) -> bool {\\n\\n check_id(pubkey)\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"sdk/program/src/sysvar/mod.rs\",\n \"rank\": 0,\n \"score\": 392744.15703830356\n },\n {\n \"content\": \"pub fn build_balance_message(lamports: u64, use_lamports_unit: bool, show_unit: bool) -> String {\\n\\n build_balance_message_with_config(\\n\\n lamports,\\n\\n &BuildBalanceMessageConfig {\\n\\n use_lamports_unit,\\n\\n show_unit,\\n\\n ..BuildBalanceMessageConfig::default()\\n\\n },\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli-output/src/display.rs\",\n \"rank\": 1,\n \"score\": 392328.75173838995\n },\n {\n \"content\": \"pub fn info(config_file: &str, local_info_only: bool, eval: bool) -> Result<(), String> {\\n\\n let config = Config::load(config_file)?;\\n\\n\\n\\n if eval {\\n\\n println!(\\n\\n \\\"SOLANA_INSTALL_ACTIVE_RELEASE={}\\\",\\n\\n &config.active_release_dir().to_str().unwrap_or(\\\"\\\")\\n\\n );\\n\\n config\\n\\n .explicit_release\\n\\n .map(|er| match er {\\n\\n ExplicitRelease::Semver(semver) => semver,\\n\\n ExplicitRelease::Channel(channel) => channel,\\n\\n })\\n\\n .and_then(|channel| {\\n\\n println!(\\\"SOLANA_INSTALL_ACTIVE_CHANNEL={}\\\", channel,);\\n\\n Option::<String>::None\\n\\n });\\n\\n return Ok(());\\n\\n }\\n\",\n \"file_path\": \"install/src/command.rs\",\n \"rank\": 2,\n \"score\": 386530.95343980176\n },\n {\n \"content\": \"pub fn recv_from(batch: &mut PacketBatch, socket: &UdpSocket, max_wait_ms: u64) -> Result<usize> {\\n\\n let mut i = 0;\\n\\n //DOCUMENTED SIDE-EFFECT\\n\\n //Performance out of the IO without poll\\n\\n // * block on the socket until it's readable\\n\\n // * set the socket to non blocking\\n\\n // * read until it fails\\n\\n // * set it back to blocking before returning\\n\\n socket.set_nonblocking(false)?;\\n\\n trace!(\\\"receiving on {}\\\", socket.local_addr().unwrap());\\n\\n let start = Instant::now();\\n\\n loop {\\n\\n batch.resize(\\n\\n std::cmp::min(i + NUM_RCVMMSGS, PACKETS_PER_BATCH),\\n\\n Packet::default(),\\n\\n );\\n\\n match recv_mmsg(socket, &mut batch[i..]) {\\n\\n Err(_) if i > 0 => {\\n\\n if start.elapsed().as_millis() as u64 > max_wait_ms {\\n\\n break;\\n\",\n \"file_path\": \"streamer/src/packet.rs\",\n \"rank\": 3,\n \"score\": 356909.91296266543\n },\n {\n \"content\": \"/// Format data as hex.\\n\\n///\\n\\n/// If `data`'s length is greater than 0, add a field called \\\"data\\\" to `f`. The\\n\\n/// first 64 bytes of `data` is displayed; bytes after that are ignored.\\n\\npub fn debug_account_data(data: &[u8], f: &mut fmt::DebugStruct<'_, '_>) {\\n\\n let data_len = cmp::min(MAX_DEBUG_ACCOUNT_DATA, data.len());\\n\\n if data_len > 0 {\\n\\n f.field(\\\"data\\\", &Hex(&data[..data_len]));\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) struct Hex<'a>(pub(crate) &'a [u8]);\\n\\nimpl fmt::Debug for Hex<'_> {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n for &byte in self.0 {\\n\\n write!(f, \\\"{:02x}\\\", byte)?;\\n\\n }\\n\\n Ok(())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sdk/program/src/debug_account_data.rs\",\n \"rank\": 4,\n \"score\": 348275.408960791\n },\n {\n \"content\": \"pub fn add_genesis_accounts(genesis_config: &mut GenesisConfig, mut issued_lamports: u64) {\\n\\n // add_stakes() and add_validators() award tokens for rent exemption and\\n\\n // to cover an initial transfer-free period of the network\\n\\n\\n\\n issued_lamports += add_stakes(\\n\\n genesis_config,\\n\\n CREATOR_STAKER_INFOS,\\n\\n &UNLOCKS_HALF_AT_9_MONTHS,\\n\\n ) + add_stakes(\\n\\n genesis_config,\\n\\n SERVICE_STAKER_INFOS,\\n\\n &UNLOCKS_ALL_AT_9_MONTHS,\\n\\n ) + add_stakes(\\n\\n genesis_config,\\n\\n FOUNDATION_STAKER_INFOS,\\n\\n &UNLOCKS_ALL_DAY_ZERO,\\n\\n ) + add_stakes(genesis_config, GRANTS_STAKER_INFOS, &UNLOCKS_ALL_DAY_ZERO)\\n\\n + add_stakes(\\n\\n genesis_config,\\n\\n COMMUNITY_STAKER_INFOS,\\n\",\n \"file_path\": \"genesis/src/genesis_accounts.rs\",\n \"rank\": 5,\n \"score\": 346203.6286580678\n },\n {\n \"content\": \"pub fn parse_get_epoch_info(_matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::GetEpochInfo,\\n\\n signers: vec![],\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/cluster_query.rs\",\n \"rank\": 6,\n \"score\": 344467.0118484084\n },\n {\n \"content\": \"pub fn parse_supply(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n let print_accounts = matches.is_present(\\\"print_accounts\\\");\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::Supply { print_accounts },\\n\\n signers: vec![],\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/cluster_query.rs\",\n \"rank\": 7,\n \"score\": 337390.9570174261\n },\n {\n \"content\": \"pub fn parse_decode_transaction(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n let blob = value_t_or_exit!(matches, \\\"transaction\\\", String);\\n\\n let binary_encoding = match matches.value_of(\\\"encoding\\\").unwrap() {\\n\\n \\\"base58\\\" => TransactionBinaryEncoding::Base58,\\n\\n \\\"base64\\\" => TransactionBinaryEncoding::Base64,\\n\\n _ => unreachable!(),\\n\\n };\\n\\n\\n\\n let encoded_transaction = EncodedTransaction::Binary(blob, binary_encoding);\\n\\n if let Some(transaction) = encoded_transaction.decode() {\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::DecodeTransaction(transaction),\\n\\n signers: vec![],\\n\\n })\\n\\n } else {\\n\\n Err(CliError::BadParameter(\\n\\n \\\"Unable to decode transaction\\\".to_string(),\\n\\n ))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/wallet.rs\",\n \"rank\": 8,\n \"score\": 337390.9570174261\n },\n {\n \"content\": \"pub fn lamports_of_sol(matches: &ArgMatches<'_>, name: &str) -> Option<u64> {\\n\\n value_of(matches, name).map(sol_to_lamports)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"clap-utils/src/input_parsers.rs\",\n \"rank\": 9,\n \"score\": 336678.5429464319\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub fn checked_add(a: u64, b: u64) -> Result<u64, InstructionError> {\\n\\n a.checked_add(b).ok_or(InstructionError::InsufficientFunds)\\n\\n}\\n\\n\\n\\n/// Describes a single account read or written by a program during instruction\\n\\n/// execution.\\n\\n///\\n\\n/// When constructing an [`Instruction`], a list of all accounts that may be\\n\\n/// read or written during the execution of that instruction must be supplied.\\n\\n/// Any account that may be mutated by the program during execution, either its\\n\\n/// data or metadata such as held lamports, must be writable.\\n\\n///\\n\\n/// Note that because the Solana runtime schedules parallel transaction\\n\\n/// execution around which accounts are writable, care should be taken that only\\n\\n/// accounts which actually may be mutated are specified as writable. As the\\n\\n/// default [`AccountMeta::new`] constructor creates writable accounts, this is\\n\\n/// a minor hazard: use [`AccountMeta::new_readonly`] to specify that an account\\n\\n/// is not writable.\\n\\n#[repr(C)]\\n\\n#[derive(Debug, Default, PartialEq, Eq, Clone, Serialize, Deserialize)]\\n\",\n \"file_path\": \"sdk/program/src/instruction.rs\",\n \"rank\": 10,\n \"score\": 333428.7267325333\n },\n {\n \"content\": \"pub fn parse_show_validators(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n let use_lamports_unit = matches.is_present(\\\"lamports\\\");\\n\\n let number_validators = matches.is_present(\\\"number\\\");\\n\\n let reverse_sort = matches.is_present(\\\"reverse\\\");\\n\\n let keep_unstaked_delinquents = matches.is_present(\\\"keep_unstaked_delinquents\\\");\\n\\n let delinquent_slot_distance = value_of(matches, \\\"delinquent_slot_distance\\\");\\n\\n\\n\\n let sort_order = match value_t_or_exit!(matches, \\\"sort\\\", String).as_str() {\\n\\n \\\"delinquent\\\" => CliValidatorsSortOrder::Delinquent,\\n\\n \\\"commission\\\" => CliValidatorsSortOrder::Commission,\\n\\n \\\"credits\\\" => CliValidatorsSortOrder::EpochCredits,\\n\\n \\\"identity\\\" => CliValidatorsSortOrder::Identity,\\n\\n \\\"last-vote\\\" => CliValidatorsSortOrder::LastVote,\\n\\n \\\"root\\\" => CliValidatorsSortOrder::Root,\\n\\n \\\"skip-rate\\\" => CliValidatorsSortOrder::SkipRate,\\n\\n \\\"stake\\\" => CliValidatorsSortOrder::Stake,\\n\\n \\\"vote-account\\\" => CliValidatorsSortOrder::VoteAccount,\\n\\n \\\"version\\\" => CliValidatorsSortOrder::Version,\\n\\n _ => unreachable!(),\\n\\n };\\n\",\n \"file_path\": \"cli/src/cluster_query.rs\",\n \"rank\": 11,\n \"score\": 332228.4574413766\n },\n {\n \"content\": \"pub fn parse_get_epoch(_matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::GetEpoch,\\n\\n signers: vec![],\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/cluster_query.rs\",\n \"rank\": 12,\n \"score\": 332228.4574413766\n },\n {\n \"content\": \"pub fn parse_get_block(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n let slot = value_of(matches, \\\"slot\\\");\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::GetBlock { slot },\\n\\n signers: vec![],\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/cluster_query.rs\",\n \"rank\": 13,\n \"score\": 332228.4574413766\n },\n {\n \"content\": \"pub fn parse_largest_accounts(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n let filter = if matches.is_present(\\\"circulating\\\") {\\n\\n Some(RpcLargestAccountsFilter::Circulating)\\n\\n } else if matches.is_present(\\\"non_circulating\\\") {\\n\\n Some(RpcLargestAccountsFilter::NonCirculating)\\n\\n } else {\\n\\n None\\n\\n };\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::LargestAccounts { filter },\\n\\n signers: vec![],\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/cluster_query.rs\",\n \"rank\": 14,\n \"score\": 332228.4574413766\n },\n {\n \"content\": \"pub fn parse_leader_schedule(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n let epoch = value_of(matches, \\\"epoch\\\");\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::LeaderSchedule { epoch },\\n\\n signers: vec![],\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/cluster_query.rs\",\n \"rank\": 15,\n \"score\": 332228.4574413766\n },\n {\n \"content\": \"pub fn parse_show_stake_history(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n let use_lamports_unit = matches.is_present(\\\"lamports\\\");\\n\\n let limit_results = value_of(matches, \\\"limit\\\").unwrap();\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::ShowStakeHistory {\\n\\n use_lamports_unit,\\n\\n limit_results,\\n\\n },\\n\\n signers: vec![],\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/stake.rs\",\n \"rank\": 16,\n \"score\": 332228.4574413766\n },\n {\n \"content\": \"pub fn parse_get_slot(_matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::GetSlot,\\n\\n signers: vec![],\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/cluster_query.rs\",\n \"rank\": 17,\n \"score\": 332228.4574413766\n },\n {\n \"content\": \"pub fn parse_total_supply(_matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::TotalSupply,\\n\\n signers: vec![],\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/cluster_query.rs\",\n \"rank\": 18,\n \"score\": 332228.4574413766\n },\n {\n \"content\": \"pub fn load_genesis_accounts(file: &str, genesis_config: &mut GenesisConfig) -> io::Result<u64> {\\n\\n let mut lamports = 0;\\n\\n let accounts_file = File::open(file)?;\\n\\n\\n\\n let genesis_accounts: HashMap<String, Base64Account> =\\n\\n serde_yaml::from_reader(accounts_file)\\n\\n .map_err(|err| io::Error::new(io::ErrorKind::Other, format!(\\\"{:?}\\\", err)))?;\\n\\n\\n\\n for (key, account_details) in genesis_accounts {\\n\\n let pubkey = pubkey_from_str(key.as_str()).map_err(|err| {\\n\\n io::Error::new(\\n\\n io::ErrorKind::Other,\\n\\n format!(\\\"Invalid pubkey/keypair {}: {:?}\\\", key, err),\\n\\n )\\n\\n })?;\\n\\n\\n\\n let owner_program_id = Pubkey::from_str(account_details.owner.as_str()).map_err(|err| {\\n\\n io::Error::new(\\n\\n io::ErrorKind::Other,\\n\\n format!(\\\"Invalid owner: {}: {:?}\\\", account_details.owner, err),\\n\",\n \"file_path\": \"genesis/src/main.rs\",\n \"rank\": 19,\n \"score\": 327988.0046824709\n },\n {\n \"content\": \"pub fn parse_get_transaction_count(_matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::GetTransactionCount,\\n\\n signers: vec![],\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/cluster_query.rs\",\n \"rank\": 20,\n \"score\": 327298.9371430176\n },\n {\n \"content\": \"pub fn parse_get_block_height(_matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::GetBlockHeight,\\n\\n signers: vec![],\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/cluster_query.rs\",\n \"rank\": 21,\n \"score\": 327298.9371430176\n },\n {\n \"content\": \"pub fn parse_get_block_time(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n let slot = value_of(matches, \\\"slot\\\");\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::GetBlockTime { slot },\\n\\n signers: vec![],\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/cluster_query.rs\",\n \"rank\": 22,\n \"score\": 327298.9371430176\n },\n {\n \"content\": \"pub fn parse_show_block_production(matches: &ArgMatches<'_>) -> Result<CliCommandInfo, CliError> {\\n\\n let epoch = value_t!(matches, \\\"epoch\\\", Epoch).ok();\\n\\n let slot_limit = value_t!(matches, \\\"slot_limit\\\", u64).ok();\\n\\n\\n\\n Ok(CliCommandInfo {\\n\\n command: CliCommand::ShowBlockProduction { epoch, slot_limit },\\n\\n signers: vec![],\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/cluster_query.rs\",\n \"rank\": 23,\n \"score\": 327298.93714301765\n },\n {\n \"content\": \"// same as genesis_config::create_genesis_config, but with bootstrap_validator staking logic\\n\\n// for the core crate tests\\n\\npub fn create_genesis_config(mint_lamports: u64) -> GenesisConfigInfo {\\n\\n create_genesis_config_with_leader(\\n\\n mint_lamports,\\n\\n &solana_sdk::pubkey::new_rand(),\\n\\n bootstrap_validator_stake_lamports(),\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"ledger/src/genesis_utils.rs\",\n \"rank\": 24,\n \"score\": 321818.65266600804\n },\n {\n \"content\": \"pub fn create_genesis_config(mint_lamports: u64) -> GenesisConfigInfo {\\n\\n // Note that zero lamports for validator stake will result in stake account\\n\\n // not being stored in accounts-db but still cached in bank stakes. This\\n\\n // causes discrepancy between cached stakes accounts in bank and\\n\\n // accounts-db which in particular will break snapshots test.\\n\\n create_genesis_config_with_leader(\\n\\n mint_lamports,\\n\\n &solana_sdk::pubkey::new_rand(), // validator_pubkey\\n\\n 0, // validator_stake_lamports\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"runtime/src/genesis_utils.rs\",\n \"rank\": 25,\n \"score\": 321805.20022950484\n },\n {\n \"content\": \"pub fn check_for_tracer_packet(packet: &mut Packet) -> bool {\\n\\n let first_pubkey_start: usize = TRACER_KEY_OFFSET_IN_TRANSACTION;\\n\\n let first_pubkey_end = match first_pubkey_start.checked_add(size_of::<Pubkey>()) {\\n\\n Some(offset) => offset,\\n\\n None => return false,\\n\\n };\\n\\n // Check for tracer pubkey\\n\\n match packet.data(first_pubkey_start..first_pubkey_end) {\\n\\n Some(pubkey) if pubkey == TRACER_KEY.as_ref() => {\\n\\n packet.meta.set_tracer(true);\\n\\n true\\n\\n }\\n\\n _ => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"perf/src/sigverify.rs\",\n \"rank\": 26,\n \"score\": 317754.78846294957\n },\n {\n \"content\": \"/// Helper function for programs to call [`GetMinimumDelegation`] and then fetch the return data\\n\\n///\\n\\n/// This fn handles performing the CPI to call the [`GetMinimumDelegation`] function, and then\\n\\n/// calls [`get_return_data()`] to fetch the return data.\\n\\n///\\n\\n/// [`GetMinimumDelegation`]: super::instruction::StakeInstruction::GetMinimumDelegation\\n\\n/// [`get_return_data()`]: crate::program::get_return_data\\n\\npub fn get_minimum_delegation() -> Result<u64, ProgramError> {\\n\\n let instruction = super::instruction::get_minimum_delegation();\\n\\n crate::program::invoke_unchecked(&instruction, &[])?;\\n\\n get_minimum_delegation_return_data()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sdk/program/src/stake/tools.rs\",\n \"rank\": 27,\n \"score\": 316760.68725986104\n },\n {\n \"content\": \"// fun fact: rustc is very close to make this const fn.\\n\\npub fn bootstrap_validator_stake_lamports() -> u64 {\\n\\n Rent::default().minimum_balance(StakeState::size_of())\\n\\n}\\n\\n\\n\\n// Number of lamports automatically used for genesis accounts\\n\\npub const fn genesis_sysvar_and_builtin_program_lamports() -> u64 {\\n\\n const NUM_BUILTIN_PROGRAMS: u64 = 4;\\n\\n const FEES_SYSVAR_MIN_BALANCE: u64 = 946_560;\\n\\n const STAKE_HISTORY_MIN_BALANCE: u64 = 114_979_200;\\n\\n const CLOCK_SYSVAR_MIN_BALANCE: u64 = 1_169_280;\\n\\n const RENT_SYSVAR_MIN_BALANCE: u64 = 1_009_200;\\n\\n const EPOCH_SCHEDULE_SYSVAR_MIN_BALANCE: u64 = 1_120_560;\\n\\n const RECENT_BLOCKHASHES_SYSVAR_MIN_BALANCE: u64 = 42_706_560;\\n\\n\\n\\n FEES_SYSVAR_MIN_BALANCE\\n\\n + STAKE_HISTORY_MIN_BALANCE\\n\\n + CLOCK_SYSVAR_MIN_BALANCE\\n\\n + RENT_SYSVAR_MIN_BALANCE\\n\\n + EPOCH_SCHEDULE_SYSVAR_MIN_BALANCE\\n\\n + RECENT_BLOCKHASHES_SYSVAR_MIN_BALANCE\\n\",\n \"file_path\": \"runtime/src/genesis_utils.rs\",\n \"rank\": 28,\n \"score\": 316424.61475510825\n },\n {\n \"content\": \"pub fn update(config_file: &str, check_only: bool) -> Result<bool, String> {\\n\\n init_or_update(config_file, false, check_only)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"install/src/command.rs\",\n \"rank\": 29,\n \"score\": 316134.8873880227\n },\n {\n \"content\": \"pub fn create_account(lamports: u64, separate_domains: bool) -> RefCell<AccountSharedData> {\\n\\n RefCell::new(\\n\\n AccountSharedData::new_data_with_space(\\n\\n lamports,\\n\\n &Versions::new(State::Uninitialized, separate_domains),\\n\\n State::size(),\\n\\n &crate::system_program::id(),\\n\\n )\\n\\n .expect(\\\"nonce_account\\\"),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sdk/src/nonce_account.rs\",\n \"rank\": 30,\n \"score\": 315246.39339322114\n },\n {\n \"content\": \"#[allow(clippy::type_complexity)]\\n\\nfn run_simulation(stakes: &[u64], fanout: usize) {\\n\\n let num_threads = num_threads();\\n\\n // set timeout to 5 minutes\\n\\n let timeout = 60 * 5;\\n\\n\\n\\n // describe the leader\\n\\n let leader_info = ContactInfo::new_localhost(&solana_sdk::pubkey::new_rand(), 0);\\n\\n let cluster_info = ClusterInfo::new(\\n\\n leader_info.clone(),\\n\\n Arc::new(Keypair::new()),\\n\\n SocketAddrSpace::Unspecified,\\n\\n );\\n\\n\\n\\n // setup staked nodes\\n\\n let mut staked_nodes = HashMap::new();\\n\\n\\n\\n // setup accounts for all nodes (leader has 0 bal)\\n\\n let (s, r) = unbounded();\\n\\n let senders: Arc<Mutex<HashMap<Pubkey, Sender<(i32, bool)>>>> =\\n\\n Arc::new(Mutex::new(HashMap::new()));\\n\",\n \"file_path\": \"gossip/tests/cluster_info.rs\",\n \"rank\": 31,\n \"score\": 314431.6721822928\n },\n {\n \"content\": \"/// Approximately convert fractional native tokens (lamports) into native tokens (SOL)\\n\\npub fn lamports_to_sol(lamports: u64) -> f64 {\\n\\n lamports as f64 / LAMPORTS_PER_SOL as f64\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sdk/program/src/native_token.rs\",\n \"rank\": 32,\n \"score\": 309632.6382775324\n },\n {\n \"content\": \"pub fn lamports_of_sol(matches: &ArgMatches, name: &str) -> Option<u64> {\\n\\n value_of(matches, name).map(sol_to_lamports)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"clap-v3-utils/src/input_parsers.rs\",\n \"rank\": 33,\n \"score\": 309361.78459706303\n },\n {\n \"content\": \"pub fn init_or_update(config_file: &str, is_init: bool, check_only: bool) -> Result<bool, String> {\\n\\n let mut config = Config::load(config_file)?;\\n\\n\\n\\n let semver_update_type = if is_init {\\n\\n SemverUpdateType::Fixed\\n\\n } else {\\n\\n SemverUpdateType::Patch\\n\\n };\\n\\n\\n\\n let (updated_version, download_url_and_sha256, release_dir) = if let Some(explicit_release) =\\n\\n &config.explicit_release\\n\\n {\\n\\n match explicit_release {\\n\\n ExplicitRelease::Semver(current_release_semver) => {\\n\\n let progress_bar = new_spinner_progress_bar();\\n\\n progress_bar.set_message(format!(\\\"{}Checking for updates...\\\", LOOKING_GLASS));\\n\\n\\n\\n let github_release = check_for_newer_github_release(\\n\\n semver::VersionReq::parse(&format!(\\n\\n \\\"{}{}\\\",\\n\",\n \"file_path\": \"install/src/command.rs\",\n \"rank\": 34,\n \"score\": 308979.70543065824\n },\n {\n \"content\": \"/// Computes the numbr of milliseconds `num_blocks` blocks will take given\\n\\n/// each slot contains `ticks_per_slot`\\n\\npub fn ms_for_n_slots(num_blocks: u64, ticks_per_slot: u64) -> u64 {\\n\\n ((ticks_per_slot * DEFAULT_MS_PER_SLOT * num_blocks) + DEFAULT_TICKS_PER_SLOT - 1)\\n\\n / DEFAULT_TICKS_PER_SLOT\\n\\n}\\n\\n\\n\",\n \"file_path\": \"local-cluster/tests/common.rs\",\n \"rank\": 35,\n \"score\": 308028.8563601868\n },\n {\n \"content\": \"fn stake_weighted_shuffle(stakes_and_index: &[(u64, usize)], seed: [u8; 32]) -> Vec<(u64, usize)> {\\n\\n let mut rng = ChaChaRng::from_seed(seed);\\n\\n let stake_weights: Vec<_> = stakes_and_index.iter().map(|(w, _)| *w).collect();\\n\\n let shuffle = WeightedShuffle::new(\\\"stake_weighted_shuffle\\\", &stake_weights);\\n\\n shuffle\\n\\n .shuffle(&mut rng)\\n\\n .map(|i| stakes_and_index[i])\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gossip/tests/cluster_info.rs\",\n \"rank\": 36,\n \"score\": 306589.7603793087\n },\n {\n \"content\": \"/// Search for the a node with the given balance\\n\\nfn find_insert_shred(id: &Pubkey, shred: i32, batches: &mut [Nodes]) {\\n\\n batches.par_iter_mut().for_each(|batch| {\\n\\n if batch.contains_key(id) {\\n\\n let _ = batch.get_mut(id).unwrap().1.insert(shred);\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"gossip/tests/cluster_info.rs\",\n \"rank\": 37,\n \"score\": 304011.5955035154\n },\n {\n \"content\": \"pub fn ed25519_verify_cpu(batches: &mut [PacketBatch], reject_non_vote: bool, packet_count: usize) {\\n\\n debug!(\\\"CPU ECDSA for {}\\\", packet_count);\\n\\n let desired_thread_count = packet_count\\n\\n .saturating_add(VERIFY_MIN_PACKETS_PER_THREAD)\\n\\n .saturating_div(VERIFY_MIN_PACKETS_PER_THREAD);\\n\\n if desired_thread_count <= 1 {\\n\\n // When using single thread, skip rayon overhead.\\n\\n batches.iter_mut().for_each(|batch| {\\n\\n batch.iter_mut().for_each(|packet| {\\n\\n if !packet.meta.discard() && !verify_packet(packet, reject_non_vote) {\\n\\n packet.meta.set_discard(true);\\n\\n }\\n\\n })\\n\\n });\\n\\n } else if desired_thread_count < get_thread_count() {\\n\\n // Dynamically compute minimum packet length to spread the load while minimizing threads.\\n\\n let packets_per_thread = packet_count.saturating_div(desired_thread_count);\\n\\n PAR_THREAD_POOL.install(|| {\\n\\n batches\\n\\n .into_par_iter()\\n\",\n \"file_path\": \"perf/src/sigverify.rs\",\n \"rank\": 38,\n \"score\": 303790.8855595963\n },\n {\n \"content\": \"pub fn read_u8(current: &mut usize, data: &[u8]) -> Result<u8, SanitizeError> {\\n\\n if data.len() < *current + 1 {\\n\\n return Err(SanitizeError::IndexOutOfBounds);\\n\\n }\\n\\n let e = data[*current];\\n\\n *current += 1;\\n\\n Ok(e)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sdk/program/src/serialize_utils.rs\",\n \"rank\": 39,\n \"score\": 302848.27634783497\n },\n {\n \"content\": \"pub fn read_u16(current: &mut usize, data: &[u8]) -> Result<u16, SanitizeError> {\\n\\n if data.len() < *current + 2 {\\n\\n return Err(SanitizeError::IndexOutOfBounds);\\n\\n }\\n\\n let mut fixed_data = [0u8; 2];\\n\\n fixed_data.copy_from_slice(&data[*current..*current + 2]);\\n\\n let e = u16::from_le_bytes(fixed_data);\\n\\n *current += 2;\\n\\n Ok(e)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sdk/program/src/serialize_utils.rs\",\n \"rank\": 40,\n \"score\": 302848.27634783497\n },\n {\n \"content\": \"pub fn read_pubkey(current: &mut usize, data: &[u8]) -> Result<Pubkey, SanitizeError> {\\n\\n let len = std::mem::size_of::<Pubkey>();\\n\\n if data.len() < *current + len {\\n\\n return Err(SanitizeError::IndexOutOfBounds);\\n\\n }\\n\\n let e = Pubkey::new(&data[*current..*current + len]);\\n\\n *current += len;\\n\\n Ok(e)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sdk/program/src/serialize_utils.rs\",\n \"rank\": 41,\n \"score\": 302848.27634783497\n },\n {\n \"content\": \"pub fn add_genesis_accounts(genesis_config: &mut GenesisConfig) -> u64 {\\n\\n config::add_genesis_account(genesis_config)\\n\\n}\\n\\n\\n\\n/// The minimum stake amount that can be delegated, in lamports.\\n\\n/// NOTE: This is also used to calculate the minimum balance of a stake account, which is the\\n\\n/// rent exempt reserve _plus_ the minimum stake delegation.\\n\",\n \"file_path\": \"programs/stake/src/lib.rs\",\n \"rank\": 42,\n \"score\": 302433.560792087\n },\n {\n \"content\": \"pub fn add_genesis_account(genesis_config: &mut GenesisConfig) -> u64 {\\n\\n let mut account = create_config_account(vec![], &Config::default(), 0);\\n\\n let lamports = genesis_config.rent.minimum_balance(account.data().len());\\n\\n\\n\\n account.set_lamports(lamports.max(1));\\n\\n\\n\\n genesis_config.add_account(config::id(), account);\\n\\n\\n\\n lamports\\n\\n}\\n\",\n \"file_path\": \"programs/stake/src/config.rs\",\n \"rank\": 43,\n \"score\": 302433.560792087\n },\n {\n \"content\": \"#[test]\\n\\npub fn cluster_info_retransmit() {\\n\\n solana_logger::setup();\\n\\n let exit = Arc::new(AtomicBool::new(false));\\n\\n trace!(\\\"c1:\\\");\\n\\n let (c1, dr1, tn1) = test_node(&exit);\\n\\n trace!(\\\"c2:\\\");\\n\\n let (c2, dr2, tn2) = test_node(&exit);\\n\\n trace!(\\\"c3:\\\");\\n\\n let (c3, dr3, tn3) = test_node(&exit);\\n\\n let c1_contact_info = c1.my_contact_info();\\n\\n\\n\\n c2.insert_info(c1_contact_info.clone());\\n\\n c3.insert_info(c1_contact_info);\\n\\n\\n\\n let num = 3;\\n\\n\\n\\n //wait to converge\\n\\n trace!(\\\"waiting to converge:\\\");\\n\\n let mut done = false;\\n\\n for _ in 0..30 {\\n\",\n \"file_path\": \"gossip/tests/gossip.rs\",\n \"rank\": 44,\n \"score\": 301892.0214559047\n },\n {\n \"content\": \"#[test]\\n\\n#[ignore]\\n\\npub fn cluster_info_scale() {\\n\\n use {\\n\\n solana_measure::measure::Measure,\\n\\n solana_perf::test_tx::test_tx,\\n\\n solana_runtime::{\\n\\n bank::Bank,\\n\\n genesis_utils::{create_genesis_config_with_vote_accounts, ValidatorVoteKeypairs},\\n\\n },\\n\\n };\\n\\n solana_logger::setup();\\n\\n let exit = Arc::new(AtomicBool::new(false));\\n\\n let num_nodes: usize = std::env::var(\\\"NUM_NODES\\\")\\n\\n .unwrap_or_else(|_| \\\"10\\\".to_string())\\n\\n .parse()\\n\\n .expect(\\\"could not parse NUM_NODES as a number\\\");\\n\\n\\n\\n let vote_keypairs: Vec<_> = (0..num_nodes)\\n\\n .map(|_| ValidatorVoteKeypairs::new_rand())\\n\\n .collect();\\n\\n let genesis_config_info = create_genesis_config_with_vote_accounts(\\n\",\n \"file_path\": \"gossip/tests/gossip.rs\",\n \"rank\": 45,\n \"score\": 301891.9504263966\n },\n {\n \"content\": \"#[allow(clippy::integer_arithmetic)]\\n\\nfn check_overlapping_do_not_use(src_addr: u64, dst_addr: u64, n: u64) -> bool {\\n\\n (src_addr <= dst_addr && src_addr + n > dst_addr)\\n\\n || (dst_addr <= src_addr && dst_addr + n > src_addr)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"programs/bpf_loader/src/syscalls.rs\",\n \"rank\": 46,\n \"score\": 299843.1479505471\n },\n {\n \"content\": \"// Check if the provided program id as a known SPL Token program id\\n\\npub fn is_known_spl_token_id(program_id: &Pubkey) -> bool {\\n\\n *program_id == spl_token_id() || *program_id == spl_token_2022_id()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"account-decoder/src/parse_token.rs\",\n \"rank\": 47,\n \"score\": 294585.30090657074\n },\n {\n \"content\": \"/// Return true if the first keyed_account is executable, used to determine if\\n\\n/// the loader should call a program's 'main'\\n\\npub fn is_executable(keyed_accounts: &[KeyedAccount]) -> Result<bool, InstructionError> {\\n\\n Ok(!keyed_accounts.is_empty() && keyed_accounts[0].executable()?)\\n\\n}\\n\\n\\n\\nimpl<'a, T> State<T> for crate::keyed_account::KeyedAccount<'a>\\n\\nwhere\\n\\n T: serde::Serialize + serde::de::DeserializeOwned,\\n\\n{\\n\\n fn state(&self) -> Result<T, InstructionError> {\\n\\n self.try_account_ref()?.state()\\n\\n }\\n\\n fn set_state(&self, state: &T) -> Result<(), InstructionError> {\\n\\n self.try_account_ref_mut()?.set_state(state)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sdk/src/keyed_account.rs\",\n \"rank\": 48,\n \"score\": 294136.9710972106\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"linux\\\"))]\\n\\npub fn recv_mmsg(socket: &UdpSocket, packets: &mut [Packet]) -> io::Result</*num packets:*/ usize> {\\n\\n debug_assert!(packets.iter().all(|pkt| pkt.meta == Meta::default()));\\n\\n let mut i = 0;\\n\\n let count = cmp::min(NUM_RCVMMSGS, packets.len());\\n\\n for p in packets.iter_mut().take(count) {\\n\\n p.meta.size = 0;\\n\\n match socket.recv_from(p.buffer_mut()) {\\n\\n Err(_) if i > 0 => {\\n\\n break;\\n\\n }\\n\\n Err(e) => {\\n\\n return Err(e);\\n\\n }\\n\\n Ok((nrecv, from)) => {\\n\\n p.meta.size = nrecv;\\n\\n p.meta.set_socket_addr(&from);\\n\\n if i == 0 {\\n\\n socket.set_nonblocking(true)?;\\n\\n }\\n\\n }\\n\\n }\\n\\n i += 1;\\n\\n }\\n\\n Ok(i)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"streamer/src/recvmmsg.rs\",\n \"rank\": 49,\n \"score\": 293169.12655833317\n },\n {\n \"content\": \"#[cfg(target_os = \\\"linux\\\")]\\n\\n#[allow(clippy::uninit_assumed_init)]\\n\\npub fn recv_mmsg(sock: &UdpSocket, packets: &mut [Packet]) -> io::Result</*num packets:*/ usize> {\\n\\n // Assert that there are no leftovers in packets.\\n\\n debug_assert!(packets.iter().all(|pkt| pkt.meta == Meta::default()));\\n\\n const SOCKADDR_STORAGE_SIZE: usize = mem::size_of::<sockaddr_storage>();\\n\\n\\n\\n let mut hdrs: [mmsghdr; NUM_RCVMMSGS] = unsafe { mem::zeroed() };\\n\\n let mut iovs: [iovec; NUM_RCVMMSGS] = unsafe { mem::MaybeUninit::uninit().assume_init() };\\n\\n let mut addrs: [sockaddr_storage; NUM_RCVMMSGS] = unsafe { mem::zeroed() };\\n\\n\\n\\n let sock_fd = sock.as_raw_fd();\\n\\n let count = cmp::min(iovs.len(), packets.len());\\n\\n\\n\\n for (packet, hdr, iov, addr) in\\n\\n izip!(packets.iter_mut(), &mut hdrs, &mut iovs, &mut addrs).take(count)\\n\\n {\\n\\n let buffer = packet.buffer_mut();\\n\\n *iov = iovec {\\n\\n iov_base: buffer.as_mut_ptr() as *mut libc::c_void,\\n\\n iov_len: buffer.len(),\\n\\n };\\n\",\n \"file_path\": \"streamer/src/recvmmsg.rs\",\n \"rank\": 50,\n \"score\": 293169.12655833317\n },\n {\n \"content\": \"fn parse_settings(matches: &ArgMatches<'_>) -> Result<bool, Box<dyn error::Error>> {\\n\\n let parse_args = match matches.subcommand() {\\n\\n (\\\"config\\\", Some(matches)) => {\\n\\n let config_file = match matches.value_of(\\\"config_file\\\") {\\n\\n None => {\\n\\n println!(\\n\\n \\\"{} Either provide the `--config` arg or ensure home directory exists to use the default config location\\\",\\n\\n style(\\\"No config file found.\\\").bold()\\n\\n );\\n\\n return Ok(false);\\n\\n }\\n\\n Some(config_file) => config_file,\\n\\n };\\n\\n let mut config = Config::load(config_file).unwrap_or_default();\\n\\n\\n\\n match matches.subcommand() {\\n\\n (\\\"get\\\", Some(subcommand_matches)) => {\\n\\n let (url_setting_type, json_rpc_url) =\\n\\n ConfigInput::compute_json_rpc_url_setting(\\\"\\\", &config.json_rpc_url);\\n\\n let (ws_setting_type, websocket_url) =\\n\",\n \"file_path\": \"cli/src/main.rs\",\n \"rank\": 51,\n \"score\": 293063.59119374276\n },\n {\n \"content\": \"/// Approximately convert native tokens (SOL) into fractional native tokens (lamports)\\n\\npub fn sol_to_lamports(sol: f64) -> u64 {\\n\\n (sol * LAMPORTS_PER_SOL as f64) as u64\\n\\n}\\n\\n\\n\\nuse std::fmt::{Debug, Display, Formatter, Result};\\n\\npub struct Sol(pub u64);\\n\\n\\n\\nimpl Sol {\\n\\n fn write_in_sol(&self, f: &mut Formatter) -> Result {\\n\\n write!(\\n\\n f,\\n\\n \\\"◎{}.{:09}\\\",\\n\\n self.0 / LAMPORTS_PER_SOL,\\n\\n self.0 % LAMPORTS_PER_SOL\\n\\n )\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Display for Sol {\\n\\n fn fmt(&self, f: &mut Formatter) -> Result {\\n\\n self.write_in_sol(f)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Debug for Sol {\\n\\n fn fmt(&self, f: &mut Formatter) -> Result {\\n\\n self.write_in_sol(f)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sdk/program/src/native_token.rs\",\n \"rank\": 52,\n \"score\": 292714.1969021525\n },\n {\n \"content\": \"#[cfg(not(windows))]\\n\\npub fn stop_process(process: &mut Child) -> Result<(), io::Error> {\\n\\n use {\\n\\n nix::{\\n\\n errno::Errno::{EINVAL, EPERM, ESRCH},\\n\\n sys::signal::{kill, Signal},\\n\\n unistd::Pid,\\n\\n },\\n\\n std::{\\n\\n io::ErrorKind,\\n\\n thread,\\n\\n time::{Duration, Instant},\\n\\n },\\n\\n };\\n\\n\\n\\n let nice_wait = Duration::from_secs(5);\\n\\n let pid = Pid::from_raw(process.id() as i32);\\n\\n match kill(pid, Signal::SIGINT) {\\n\\n Ok(()) => {\\n\\n let expire = Instant::now() + nice_wait;\\n\\n while let Ok(None) = process.try_wait() {\\n\",\n \"file_path\": \"install/src/stop_process.rs\",\n \"rank\": 53,\n \"score\": 291561.81816975446\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"solana\\\"))]\\n\\npub fn split_u64(\\n\\n amount: u64,\\n\\n lo_bit_length: usize,\\n\\n hi_bit_length: usize,\\n\\n) -> Result<(u64, u64), ProofError> {\\n\\n assert!(lo_bit_length <= 64);\\n\\n assert!(hi_bit_length <= 64);\\n\\n\\n\\n if !bool::from((amount >> (lo_bit_length + hi_bit_length)).ct_eq(&0u64)) {\\n\\n return Err(ProofError::TransferAmount);\\n\\n }\\n\\n\\n\\n let lo = amount << (64 - lo_bit_length) >> (64 - lo_bit_length);\\n\\n let hi = amount >> lo_bit_length;\\n\\n\\n\\n Ok((lo, hi))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"zk-token-sdk/src/instruction/mod.rs\",\n \"rank\": 54,\n \"score\": 289015.5451990266\n },\n {\n \"content\": \"pub fn copy_return_values(sig_lens: &[Vec<u32>], out: &PinnedVec<u8>, rvs: &mut [Vec<u8>]) {\\n\\n let mut num = 0;\\n\\n for (vs, sig_vs) in rvs.iter_mut().zip(sig_lens.iter()) {\\n\\n for (v, sig_v) in vs.iter_mut().zip(sig_vs.iter()) {\\n\\n if *sig_v == 0 {\\n\\n *v = 0;\\n\\n } else {\\n\\n let mut vout = 1;\\n\\n for _ in 0..*sig_v {\\n\\n if 0 == out[num] {\\n\\n vout = 0;\\n\\n }\\n\\n num = num.saturating_add(1);\\n\\n }\\n\\n *v = vout;\\n\\n }\\n\\n if *v != 0 {\\n\\n trace!(\\\"VERIFIED PACKET!!!!!\\\");\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"perf/src/sigverify.rs\",\n \"rank\": 55,\n \"score\": 288484.96715814364\n },\n {\n \"content\": \"/// return timestamp as ms\\n\\npub fn timestamp() -> u64 {\\n\\n let now = SystemTime::now()\\n\\n .duration_since(UNIX_EPOCH)\\n\\n .expect(\\\"create timestamp in timing\\\");\\n\\n duration_as_ms(&now)\\n\\n}\\n\\n\\n\\npub const SECONDS_PER_YEAR: f64 = 365.242_199 * 24.0 * 60.0 * 60.0;\\n\\n\\n\",\n \"file_path\": \"sdk/src/timing.rs\",\n \"rank\": 56,\n \"score\": 286581.67556795524\n },\n {\n \"content\": \"// Return an error if a validator field is longer than the max length.\\n\\npub fn is_short_field(string: String) -> Result<(), String> {\\n\\n if string.len() > MAX_SHORT_FIELD_LENGTH {\\n\\n Err(format!(\\n\\n \\\"validator field longer than {:?}-byte limit\\\",\\n\\n MAX_SHORT_FIELD_LENGTH\\n\\n ))\\n\\n } else {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/validator_info.rs\",\n \"rank\": 57,\n \"score\": 285301.0404440205\n },\n {\n \"content\": \"// Return an error if url field is too long or cannot be parsed.\\n\\npub fn check_url(string: String) -> Result<(), String> {\\n\\n is_url(string.clone())?;\\n\\n if string.len() > MAX_SHORT_FIELD_LENGTH {\\n\\n Err(format!(\\n\\n \\\"url longer than {:?}-byte limit\\\",\\n\\n MAX_SHORT_FIELD_LENGTH\\n\\n ))\\n\\n } else {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/validator_info.rs\",\n \"rank\": 58,\n \"score\": 285301.0404440205\n },\n {\n \"content\": \"#[allow(clippy::same_item_push)]\\n\\npub fn create_ticks(num_ticks: u64, hashes_per_tick: u64, mut hash: Hash) -> Vec<Entry> {\\n\\n let mut ticks = Vec::with_capacity(num_ticks as usize);\\n\\n for _ in 0..num_ticks {\\n\\n let new_tick = next_entry_mut(&mut hash, hashes_per_tick, vec![]);\\n\\n ticks.push(new_tick);\\n\\n }\\n\\n\\n\\n ticks\\n\\n}\\n\\n\\n\",\n \"file_path\": \"entry/src/entry.rs\",\n \"rank\": 59,\n \"score\": 283163.3284964023\n },\n {\n \"content\": \"pub fn create_test_account(sample: usize) -> (StoredMeta, AccountSharedData) {\\n\\n let data_len = sample % 256;\\n\\n let mut account = AccountSharedData::new(sample as u64, 0, &Pubkey::default());\\n\\n account.set_data((0..data_len).map(|_| data_len as u8).collect());\\n\\n let stored_meta = StoredMeta {\\n\\n write_version: 0,\\n\\n pubkey: Pubkey::default(),\\n\\n data_len: data_len as u64,\\n\\n };\\n\\n (stored_meta, account)\\n\\n}\\n\",\n \"file_path\": \"runtime/src/append_vec/test_utils.rs\",\n \"rank\": 60,\n \"score\": 283076.69283467135\n },\n {\n \"content\": \"fn run_tpu_send_transaction(tpu_use_quic: bool) {\\n\\n let mint_keypair = Keypair::new();\\n\\n let mint_pubkey = mint_keypair.pubkey();\\n\\n let test_validator =\\n\\n TestValidator::with_no_fees(mint_pubkey, None, SocketAddrSpace::Unspecified);\\n\\n let rpc_client = Arc::new(RpcClient::new_with_commitment(\\n\\n test_validator.rpc_url(),\\n\\n CommitmentConfig::processed(),\\n\\n ));\\n\\n let connection_cache = Arc::new(ConnectionCache::new(\\n\\n tpu_use_quic,\\n\\n DEFAULT_TPU_CONNECTION_POOL_SIZE,\\n\\n ));\\n\\n let tpu_client = TpuClient::new_with_connection_cache(\\n\\n rpc_client.clone(),\\n\\n &test_validator.rpc_pubsub_url(),\\n\\n TpuClientConfig::default(),\\n\\n connection_cache,\\n\\n )\\n\\n .unwrap();\\n\",\n \"file_path\": \"rpc-test/tests/rpc.rs\",\n \"rank\": 61,\n \"score\": 282586.35242217686\n },\n {\n \"content\": \"/// Check if the detected device is a valid `Ledger device` by checking both the product ID and the vendor ID\\n\\npub fn is_valid_ledger(vendor_id: u16, product_id: u16) -> bool {\\n\\n vendor_id == LEDGER_VID\\n\\n && (LEDGER_NANO_S_PIDS.contains(&product_id) || LEDGER_NANO_X_PIDS.contains(&product_id))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"remote-wallet/src/ledger.rs\",\n \"rank\": 62,\n \"score\": 281349.5106993562\n },\n {\n \"content\": \"/// Invoke a cross-program instruction.\\n\\n///\\n\\n/// Invoking one program from another program requires an [`Instruction`]\\n\\n/// containing the program ID of the other program, instruction data that\\n\\n/// will be understood by the other program, and a list of [`AccountInfo`]s\\n\\n/// corresponding to all of the accounts accessed by the other program. Because\\n\\n/// the only way for a program to acquire `AccountInfo` values is by receiving\\n\\n/// them from the runtime at the [program entrypoint][entrypoint!], any account\\n\\n/// required by the callee program must transitively be required by the caller\\n\\n/// program, and provided by _its_ caller. The same is true of the program ID of\\n\\n/// the called program.\\n\\n///\\n\\n/// The `Instruction` is usually built from within the calling program, but may\\n\\n/// be deserialized from an external source.\\n\\n///\\n\\n/// This function will not return if the called program returns anything other\\n\\n/// than success. If the callee returns an error or aborts then the entire\\n\\n/// transaction will immediately fail. To return data as the result of a\\n\\n/// cross-program invocation use the [`set_return_data`] / [`get_return_data`]\\n\\n/// functions, or have the callee write to a dedicated account for that purpose.\\n\\n///\\n\\n/// A program may directly call itself recursively, but may not be indirectly\\n\\n/// called recursively (reentered) by another program. Indirect reentrancy will\\n\\n/// cause the transaction to immediately fail.\\n\\n///\\n\\n/// # Validation of shared data between programs\\n\\n///\\n\\n/// The `AccountInfo` structures passed to this function contain data that is\\n\\n/// directly accessed by the runtime and is copied to and from the memory space\\n\\n/// of the called program. Some of that data, the [`AccountInfo::lamports`] and\\n\\n/// [`AccountInfo::data`] fields, may be mutated as a side-effect of the called\\n\\n/// program, if that program has writable access to the given account.\\n\\n///\\n\\n/// These two fields are stored in [`RefCell`]s to enforce the aliasing\\n\\n/// discipline for mutated values required by the Rust language. Prior to\\n\\n/// invoking the runtime, this routine will test that each `RefCell` is\\n\\n/// borrowable as required by the callee and return an error if not.\\n\\n///\\n\\n/// The CPU cost of these runtime checks can be avoided with the unsafe\\n\\n/// [`invoke_unchecked`] function.\\n\\n///\\n\\n/// [`RefCell`]: std::cell::RefCell\\n\\n///\\n\\n/// # Errors\\n\\n///\\n\\n/// If the called program completes successfully and violates no runtime\\n\\n/// invariants, then this function will return successfully. If the callee\\n\\n/// completes and returns a [`ProgramError`], then the transaction will\\n\\n/// immediately fail. Control will not return to the caller.\\n\\n///\\n\\n/// Various runtime invariants are checked before the callee is invoked and\\n\\n/// before returning control to the caller. If any of these invariants are\\n\\n/// violated then the transaction will immediately fail. A non-exhaustive list\\n\\n/// of these invariants includes:\\n\\n///\\n\\n/// - The sum of lamports owned by all referenced accounts has not changed.\\n\\n/// - A program has not debited lamports from an account it does not own.\\n\\n/// - A program has not otherwise written to an account that it does not own.\\n\\n/// - A program has not written to an account that is not writable.\\n\\n/// - The size of account data has not exceeded applicable limits.\\n\\n///\\n\\n/// If the invoked program does not exist or is not executable then\\n\\n/// the transaction will immediately fail.\\n\\n///\\n\\n/// If any of the `RefCell`s within the provided `AccountInfo`s cannot be\\n\\n/// borrowed in accordance with the call's requirements, an error of\\n\\n/// [`ProgramError::AccountBorrowFailed`] is returned.\\n\\n///\\n\\n/// [`ProgramError`]: crate::program_error::ProgramError\\n\\n/// [`ProgramError::AccountBorrowFailed`]: crate::program_error::ProgramError::AccountBorrowFailed\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// A simple example of transferring lamports via CPI:\\n\\n///\\n\\n/// ```\\n\\n/// use solana_program::{\\n\\n/// account_info::{next_account_info, AccountInfo},\\n\\n/// entrypoint,\\n\\n/// entrypoint::ProgramResult,\\n\\n/// program::invoke,\\n\\n/// pubkey::Pubkey,\\n\\n/// system_instruction,\\n\\n/// system_program,\\n\\n/// };\\n\\n///\\n\\n/// entrypoint!(process_instruction);\\n\\n///\\n\\n/// fn process_instruction(\\n\\n/// program_id: &Pubkey,\\n\\n/// accounts: &[AccountInfo],\\n\\n/// instruction_data: &[u8],\\n\\n/// ) -> ProgramResult {\\n\\n/// let account_info_iter = &mut accounts.iter();\\n\\n///\\n\\n/// let payer = next_account_info(account_info_iter)?;\\n\\n/// let recipient = next_account_info(account_info_iter)?;\\n\\n/// // The system program is a required account to invoke a system\\n\\n/// // instruction, even though we don't use it directly.\\n\\n/// let system_program_account = next_account_info(account_info_iter)?;\\n\\n///\\n\\n/// assert!(payer.is_writable);\\n\\n/// assert!(payer.is_signer);\\n\\n/// assert!(recipient.is_writable);\\n\\n/// assert!(system_program::check_id(system_program_account.key));\\n\\n///\\n\\n/// let lamports = 1000000;\\n\\n///\\n\\n/// invoke(\\n\\n/// &system_instruction::transfer(payer.key, recipient.key, lamports),\\n\\n/// &[payer.clone(), recipient.clone(), system_program_account.clone()],\\n\\n/// )\\n\\n/// }\\n\\n/// ```\\n\\npub fn invoke(instruction: &Instruction, account_infos: &[AccountInfo]) -> ProgramResult {\\n\\n invoke_signed(instruction, account_infos, &[])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sdk/program/src/program.rs\",\n \"rank\": 63,\n \"score\": 281248.1852152104\n },\n {\n \"content\": \"#[allow(clippy::result_unit_err)]\\n\\npub fn decode_shortu16_len(bytes: &[u8]) -> Result<(usize, usize), ()> {\\n\\n let mut val = 0;\\n\\n for (nth_byte, byte) in bytes.iter().take(MAX_ENCODING_LENGTH).enumerate() {\\n\\n match visit_byte(*byte, val, nth_byte).map_err(|_| ())? {\\n\\n VisitStatus::More(new_val) => val = new_val,\\n\\n VisitStatus::Done(new_val) => {\\n\\n return Ok((usize::from(new_val), nth_byte.saturating_add(1)));\\n\\n }\\n\\n }\\n\\n }\\n\\n Err(())\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use {\\n\\n super::*,\\n\\n assert_matches::assert_matches,\\n\\n bincode::{deserialize, serialize},\\n\\n };\\n\",\n \"file_path\": \"sdk/program/src/short_vec.rs\",\n \"rank\": 64,\n \"score\": 281151.4766003186\n },\n {\n \"content\": \"pub fn new_test_vote_tx<R>(rng: &mut R) -> Transaction\\n\\nwhere\\n\\n R: CryptoRng + RngCore,\\n\\n{\\n\\n let mut slots: Vec<Slot> = std::iter::repeat_with(|| rng.gen()).take(5).collect();\\n\\n slots.sort_unstable();\\n\\n slots.dedup();\\n\\n let switch_proof_hash = rng.gen_bool(0.5).then(|| solana_sdk::hash::new_rand(rng));\\n\\n vote_transaction::new_vote_transaction(\\n\\n slots,\\n\\n solana_sdk::hash::new_rand(rng), // bank_hash\\n\\n solana_sdk::hash::new_rand(rng), // blockhash\\n\\n &Keypair::generate(rng), // node_keypair\\n\\n &Keypair::generate(rng), // vote_keypair\\n\\n &Keypair::generate(rng), // authorized_voter_keypair\\n\\n switch_proof_hash,\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"perf/src/test_tx.rs\",\n \"rank\": 65,\n \"score\": 280785.8355750196\n },\n {\n \"content\": \"fn deposit_many(bank: &Bank, pubkeys: &mut Vec<Pubkey>, num: usize) -> Result<(), LamportsError> {\\n\\n for t in 0..num {\\n\\n let pubkey = solana_sdk::pubkey::new_rand();\\n\\n let account =\\n\\n AccountSharedData::new((t + 1) as u64, 0, AccountSharedData::default().owner());\\n\\n pubkeys.push(pubkey);\\n\\n assert!(bank.get_account(&pubkey).is_none());\\n\\n bank.deposit(&pubkey, (t + 1) as u64)?;\\n\\n assert_eq!(bank.get_account(&pubkey).unwrap(), account);\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"runtime/benches/accounts.rs\",\n \"rank\": 66,\n \"score\": 280116.43889215693\n },\n {\n \"content\": \"// Return an error if a validator details are longer than the max length.\\n\\npub fn check_details_length(string: String) -> Result<(), String> {\\n\\n if string.len() > MAX_LONG_FIELD_LENGTH {\\n\\n Err(format!(\\n\\n \\\"validator details longer than {:?}-byte limit\\\",\\n\\n MAX_LONG_FIELD_LENGTH\\n\\n ))\\n\\n } else {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cli/src/validator_info.rs\",\n \"rank\": 67,\n \"score\": 279919.35310558707\n },\n {\n \"content\": \"pub fn cluster_type_of(matches: &ArgMatches<'_>, name: &str) -> Option<ClusterType> {\\n\\n value_of(matches, name)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"clap-utils/src/input_parsers.rs\",\n \"rank\": 68,\n \"score\": 279531.7390459175\n },\n {\n \"content\": \"pub fn max_ticks_per_n_shreds(num_shreds: u64, shred_data_size: Option<usize>) -> u64 {\\n\\n let ticks = create_ticks(1, 0, Hash::default());\\n\\n max_entries_per_n_shred(&ticks[0], num_shreds, shred_data_size)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"ledger/src/shred.rs\",\n \"rank\": 69,\n \"score\": 276878.0587683183\n },\n {\n \"content\": \"/// Invoke a cross-program instruction but don't enforce Rust's aliasing rules.\\n\\n///\\n\\n/// This function is like [`invoke`] except that it does not check that\\n\\n/// [`RefCell`]s within [`AccountInfo`]s are properly borrowable as described in\\n\\n/// the documentation for that function. Those checks consume CPU cycles that\\n\\n/// this function avoids.\\n\\n///\\n\\n/// [`RefCell`]: std::cell::RefCell\\n\\n///\\n\\n/// # Safety\\n\\n///\\n\\n/// __This function is incorrectly missing an `unsafe` declaration.__\\n\\n///\\n\\n/// If any of the writable accounts passed to the callee contain data that is\\n\\n/// borrowed within the calling program, and that data is written to by the\\n\\n/// callee, then Rust's aliasing rules will be violated and cause undefined\\n\\n/// behavior.\\n\\npub fn invoke_unchecked(instruction: &Instruction, account_infos: &[AccountInfo]) -> ProgramResult {\\n\\n invoke_signed_unchecked(instruction, account_infos, &[])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sdk/program/src/program.rs\",\n \"rank\": 70,\n \"score\": 276678.85992667463\n },\n {\n \"content\": \"pub fn open_db(path: &str, dry_run: bool) -> Result<PickleDb, Error> {\\n\\n let policy = if dry_run {\\n\\n PickleDbDumpPolicy::NeverDump\\n\\n } else {\\n\\n PickleDbDumpPolicy::DumpUponRequest\\n\\n };\\n\\n let path = Path::new(path);\\n\\n let db = if path.exists() {\\n\\n PickleDb::load_yaml(path, policy)?\\n\\n } else {\\n\\n if let Some(parent) = path.parent() {\\n\\n fs::create_dir_all(parent).unwrap();\\n\\n }\\n\\n PickleDb::new_yaml(path, policy)\\n\\n };\\n\\n Ok(db)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tokens/src/db.rs\",\n \"rank\": 71,\n \"score\": 275907.6552429135\n },\n {\n \"content\": \"pub fn get_fees_for_messages(messages: &[Message], client: &RpcClient) -> Result<u64, Error> {\\n\\n // This is an arbitrary value to get regular blockhash updates for balance checks without\\n\\n // hitting the RPC node with too many requests\\n\\n const BLOCKHASH_REFRESH_MILLIS: u64 = DEFAULT_MS_PER_SLOT * 32;\\n\\n\\n\\n let mut latest_blockhash = client.get_latest_blockhash()?;\\n\\n let mut now = Instant::now();\\n\\n let mut fees = 0;\\n\\n for mut message in messages.iter().cloned() {\\n\\n if now.elapsed() > Duration::from_millis(BLOCKHASH_REFRESH_MILLIS) {\\n\\n latest_blockhash = client.get_latest_blockhash()?;\\n\\n now = Instant::now();\\n\\n }\\n\\n message.recent_blockhash = latest_blockhash;\\n\\n fees += client.get_fee_for_message(&message)?;\\n\\n }\\n\\n Ok(fees)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tokens/src/commands.rs\",\n \"rank\": 72,\n \"score\": 275891.10070906265\n },\n {\n \"content\": \"#[allow(clippy::same_item_push)]\\n\\npub fn create_random_ticks(num_ticks: u64, max_hashes_per_tick: u64, mut hash: Hash) -> Vec<Entry> {\\n\\n let mut ticks = Vec::with_capacity(num_ticks as usize);\\n\\n for _ in 0..num_ticks {\\n\\n let hashes_per_tick = thread_rng().gen_range(1, max_hashes_per_tick);\\n\\n let new_tick = next_entry_mut(&mut hash, hashes_per_tick, vec![]);\\n\\n ticks.push(new_tick);\\n\\n }\\n\\n\\n\\n ticks\\n\\n}\\n\\n\\n\",\n \"file_path\": \"entry/src/entry.rs\",\n \"rank\": 73,\n \"score\": 275775.73724449583\n },\n {\n \"content\": \"// useful for basic tests\\n\\npub fn create_genesis_config(lamports: u64) -> (GenesisConfig, Keypair) {\\n\\n let faucet_keypair = Keypair::new();\\n\\n (\\n\\n GenesisConfig::new(\\n\\n &[(\\n\\n faucet_keypair.pubkey(),\\n\\n AccountSharedData::new(lamports, 0, &system_program::id()),\\n\\n )],\\n\\n &[],\\n\\n ),\\n\\n faucet_keypair,\\n\\n )\\n\\n}\\n\\n\\n\\nimpl Default for GenesisConfig {\\n\\n fn default() -> Self {\\n\\n Self {\\n\\n creation_time: SystemTime::now()\\n\\n .duration_since(UNIX_EPOCH)\\n\\n .unwrap()\\n\",\n \"file_path\": \"sdk/src/genesis_config.rs\",\n \"rank\": 74,\n \"score\": 275155.5347348731\n },\n {\n \"content\": \"#[cfg_attr(not(target_os = \\\"linux\\\"), allow(dead_code))]\\n\\nfn parse_udp_stats(reader: &mut impl BufRead) -> Result<UdpStats, String> {\\n\\n let mut udp_lines = Vec::default();\\n\\n for line in reader.lines() {\\n\\n let line = line.map_err(|e| e.to_string())?;\\n\\n if line.starts_with(\\\"Udp:\\\") {\\n\\n udp_lines.push(line);\\n\\n if udp_lines.len() == 2 {\\n\\n break;\\n\\n }\\n\\n }\\n\\n }\\n\\n if udp_lines.len() != 2 {\\n\\n return Err(format!(\\n\\n \\\"parse error, expected 2 lines, num lines: {}\\\",\\n\\n udp_lines.len()\\n\\n ));\\n\\n }\\n\\n\\n\\n let pairs: Vec<_> = udp_lines[0]\\n\\n .split_ascii_whitespace()\\n\",\n \"file_path\": \"core/src/system_monitor_service.rs\",\n \"rank\": 75,\n \"score\": 274939.5013633986\n },\n {\n \"content\": \"pub fn next_entry_mut(start: &mut Hash, num_hashes: u64, transactions: Vec<Transaction>) -> Entry {\\n\\n let entry = Entry::new(start, num_hashes, transactions);\\n\\n *start = entry.hash;\\n\\n entry\\n\\n}\\n\\n\\n\",\n \"file_path\": \"entry/src/entry.rs\",\n \"rank\": 76,\n \"score\": 273876.75310222694\n },\n {\n \"content\": \"fn check_loader_id(id: &Pubkey) -> bool {\\n\\n bpf_loader::check_id(id)\\n\\n || bpf_loader_deprecated::check_id(id)\\n\\n || bpf_loader_upgradeable::check_id(id)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"programs/bpf_loader/src/lib.rs\",\n \"rank\": 77,\n \"score\": 271152.0147084979\n },\n {\n \"content\": \"pub fn main() -> Result<(), String> {\\n\\n solana_logger::setup();\\n\\n\\n\\n let matches = App::new(crate_name!())\\n\\n .about(crate_description!())\\n\\n .version(solana_version::version!())\\n\\n .setting(AppSettings::SubcommandRequiredElseHelp)\\n\\n .arg({\\n\\n let arg = Arg::with_name(\\\"config_file\\\")\\n\\n .short(\\\"c\\\")\\n\\n .long(\\\"config\\\")\\n\\n .value_name(\\\"PATH\\\")\\n\\n .takes_value(true)\\n\\n .global(true)\\n\\n .help(\\\"Configuration file to use\\\");\\n\\n match *defaults::CONFIG_FILE {\\n\\n Some(ref config_file) => arg.default_value(config_file),\\n\\n None => arg.required(true),\\n\\n }\\n\\n })\\n\",\n \"file_path\": \"install/src/lib.rs\",\n \"rank\": 78,\n \"score\": 271141.49512706866\n },\n {\n \"content\": \"pub fn lamports_per_signature_of(account: &AccountSharedData) -> Option<u64> {\\n\\n match StateMut::<Versions>::state(account).ok()?.state() {\\n\\n State::Initialized(data) => Some(data.fee_calculator.lamports_per_signature),\\n\\n State::Uninitialized => None,\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use {\\n\\n super::*,\\n\\n crate::{\\n\\n fee_calculator::FeeCalculator,\\n\\n nonce::state::{Data, DurableNonce},\\n\\n pubkey::Pubkey,\\n\\n system_program,\\n\\n },\\n\\n };\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"sdk/src/nonce_account.rs\",\n \"rank\": 79,\n \"score\": 270316.8390019919\n },\n {\n \"content\": \"#[bench]\\n\\nfn test_statuscache_serialize(bencher: &mut Bencher) {\\n\\n let mut status_cache = BankStatusCache::default();\\n\\n status_cache.add_root(0);\\n\\n status_cache.clear();\\n\\n for hash_index in 0..100 {\\n\\n let blockhash = Hash::new(&vec![hash_index; std::mem::size_of::<Hash>()]);\\n\\n let mut id = blockhash;\\n\\n for _ in 0..100 {\\n\\n id = hash(id.as_ref());\\n\\n let mut sigbytes = Vec::from(id.as_ref());\\n\\n id = hash(id.as_ref());\\n\\n sigbytes.extend(id.as_ref());\\n\\n let sig = Signature::new(&sigbytes);\\n\\n status_cache.insert(&blockhash, &sig, 0, ());\\n\\n }\\n\\n }\\n\\n bencher.iter(|| {\\n\\n let _ = serialize(&status_cache.slot_deltas(&[0])).unwrap();\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"runtime/benches/status_cache.rs\",\n \"rank\": 80,\n \"score\": 269896.6243642488\n },\n {\n \"content\": \"pub fn overwrite_slot_hashes_with_slots(context: &mut ProgramTestContext, slots: &[Slot]) {\\n\\n let mut slot_hashes = SlotHashes::default();\\n\\n for slot in slots {\\n\\n slot_hashes.add(*slot, Hash::new_unique());\\n\\n }\\n\\n context.set_sysvar(&slot_hashes);\\n\\n}\\n\",\n \"file_path\": \"programs/address-lookup-table-tests/tests/common.rs\",\n \"rank\": 81,\n \"score\": 269683.35722813755\n },\n {\n \"content\": \"pub fn create_account(feature: &Feature, lamports: u64) -> AccountSharedData {\\n\\n let data_len = Feature::size_of().max(bincode::serialized_size(feature).unwrap() as usize);\\n\\n let mut account = AccountSharedData::new(lamports, data_len, &id());\\n\\n to_account(feature, &mut account).unwrap();\\n\\n account\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn feature_deserialize_none() {\\n\\n let just_initialized = AccountSharedData::new(42, Feature::size_of(), &id());\\n\\n assert_eq!(\\n\\n from_account(&just_initialized),\\n\\n Some(Feature { activated_at: None })\\n\\n );\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"sdk/src/feature.rs\",\n \"rank\": 82,\n \"score\": 268993.17022435454\n },\n {\n \"content\": \"/// Returns Neighbor Nodes and Children Nodes `(neighbors, children)` for a given node based on its stake\\n\\npub fn compute_retransmit_peers<T: Copy>(\\n\\n fanout: usize,\\n\\n index: usize, // Local node's index withing the nodes slice.\\n\\n nodes: &[T],\\n\\n) -> (Vec<T> /*neighbors*/, Vec<T> /*children*/) {\\n\\n // 1st layer: fanout nodes starting at 0\\n\\n // 2nd layer: fanout**2 nodes starting at fanout\\n\\n // 3rd layer: fanout**3 nodes starting at fanout + fanout**2\\n\\n // ...\\n\\n // Each layer is divided into neighborhoods of fanout nodes each.\\n\\n let offset = index % fanout; // Node's index within its neighborhood.\\n\\n let anchor = index - offset; // First node in the neighborhood.\\n\\n let neighbors = (anchor..)\\n\\n .take(fanout)\\n\\n .map(|i| nodes.get(i).copied())\\n\\n .while_some()\\n\\n .collect();\\n\\n let children = ((anchor + 1) * fanout + offset..)\\n\\n .step_by(fanout)\\n\\n .take(fanout)\\n\",\n \"file_path\": \"gossip/src/cluster_info.rs\",\n \"rank\": 83,\n \"score\": 268959.0922242513\n },\n {\n \"content\": \"/// Check if a program is a precompiled program\\n\\npub fn is_precompile<F>(program_id: &Pubkey, is_enabled: F) -> bool\\n\\nwhere\\n\\n F: Fn(&Pubkey) -> bool,\\n\\n{\\n\\n PRECOMPILES\\n\\n .iter()\\n\\n .any(|precompile| precompile.check_id(program_id, |feature_id| is_enabled(feature_id)))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sdk/src/precompiles.rs\",\n \"rank\": 84,\n \"score\": 268709.78486750013\n },\n {\n \"content\": \"// Get the activated stake percentage (based on the provided bank) that is visible in gossip\\n\\nfn get_stake_percent_in_gossip(bank: &Bank, cluster_info: &ClusterInfo, log: bool) -> u64 {\\n\\n let mut online_stake = 0;\\n\\n let mut wrong_shred_stake = 0;\\n\\n let mut wrong_shred_nodes = vec![];\\n\\n let mut offline_stake = 0;\\n\\n let mut offline_nodes = vec![];\\n\\n\\n\\n let mut total_activated_stake = 0;\\n\\n let now = timestamp();\\n\\n // Nodes contact infos are saved to disk and restored on validator startup.\\n\\n // Staked nodes entries will not expire until an epoch after. So it\\n\\n // is necessary here to filter for recent entries to establish liveness.\\n\\n let peers: HashMap<_, _> = cluster_info\\n\\n .all_tvu_peers()\\n\\n .into_iter()\\n\\n .filter(|node| {\\n\\n let age = now.saturating_sub(node.wallclock);\\n\\n // Contact infos are refreshed twice during this period.\\n\\n age < CRDS_GOSSIP_PULL_CRDS_TIMEOUT_MS\\n\\n })\\n\",\n \"file_path\": \"core/src/validator.rs\",\n \"rank\": 85,\n \"score\": 268104.8108337479\n },\n {\n \"content\": \"pub fn compute_hash_time_ns(hashes_sample_size: u64) -> u64 {\\n\\n info!(\\\"Running {} hashes...\\\", hashes_sample_size);\\n\\n let mut v = Hash::default();\\n\\n let start = Instant::now();\\n\\n for _ in 0..hashes_sample_size {\\n\\n v = hash(v.as_ref());\\n\\n }\\n\\n start.elapsed().as_nanos() as u64\\n\\n}\\n\\n\\n\",\n \"file_path\": \"entry/src/poh.rs\",\n \"rank\": 86,\n \"score\": 267879.4877889093\n },\n {\n \"content\": \"pub fn main_init() -> Result<(), String> {\\n\\n solana_logger::setup();\\n\\n\\n\\n let matches = App::new(\\\"solana-install-init\\\")\\n\\n .about(\\\"Initializes a new installation\\\")\\n\\n .version(solana_version::version!())\\n\\n .arg({\\n\\n let arg = Arg::with_name(\\\"config_file\\\")\\n\\n .short(\\\"c\\\")\\n\\n .long(\\\"config\\\")\\n\\n .value_name(\\\"PATH\\\")\\n\\n .takes_value(true)\\n\\n .help(\\\"Configuration file to use\\\");\\n\\n match *defaults::CONFIG_FILE {\\n\\n Some(ref config_file) => arg.default_value(config_file),\\n\\n None => arg.required(true),\\n\\n }\\n\\n })\\n\\n .arg({\\n\\n let arg = Arg::with_name(\\\"data_dir\\\")\\n\",\n \"file_path\": \"install/src/lib.rs\",\n \"rank\": 87,\n \"score\": 266010.0368365113\n },\n {\n \"content\": \"pub fn create_account(lamports: u64, config: &Config) -> AccountSharedData {\\n\\n create_config_account(vec![], config, lamports)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"programs/stake/src/config.rs\",\n \"rank\": 88,\n \"score\": 264169.01049803814\n },\n {\n \"content\": \"#[inline]\\n\\npub fn sol_memset(s: &mut [u8], c: u8, n: usize) {\\n\\n #[cfg(target_os = \\\"solana\\\")]\\n\\n unsafe {\\n\\n crate::syscalls::sol_memset_(s.as_mut_ptr(), c, n as u64);\\n\\n }\\n\\n\\n\\n #[cfg(not(target_os = \\\"solana\\\"))]\\n\\n crate::program_stubs::sol_memset(s.as_mut_ptr(), c, n);\\n\\n}\\n\",\n \"file_path\": \"sdk/program/src/program_memory.rs\",\n \"rank\": 89,\n \"score\": 263815.49865804287\n },\n {\n \"content\": \"pub fn serialize_snapshot_data_file<F>(data_file_path: &Path, serializer: F) -> Result<u64>\\n\\nwhere\\n\\n F: FnOnce(&mut BufWriter<File>) -> Result<()>,\\n\\n{\\n\\n serialize_snapshot_data_file_capped::<F>(\\n\\n data_file_path,\\n\\n MAX_SNAPSHOT_DATA_FILE_SIZE,\\n\\n serializer,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"runtime/src/snapshot_utils.rs\",\n \"rank\": 90,\n \"score\": 263483.71577955876\n },\n {\n \"content\": \"pub fn set_entries_for_tests_only(entries: usize) {\\n\\n NUM_ENTRIES.store(entries, Ordering::Relaxed);\\n\\n}\\n\\n\\n\\npub type SlotHash = (Slot, Hash);\\n\\n\\n\\n#[repr(C)]\\n\\n#[derive(Serialize, Deserialize, PartialEq, Eq, Debug, Default)]\\n\\npub struct SlotHashes(Vec<SlotHash>);\\n\\n\\n\\nimpl SlotHashes {\\n\\n pub fn add(&mut self, slot: Slot, hash: Hash) {\\n\\n match self.binary_search_by(|(probe, _)| slot.cmp(probe)) {\\n\\n Ok(index) => (self.0)[index] = (slot, hash),\\n\\n Err(index) => (self.0).insert(index, (slot, hash)),\\n\\n }\\n\\n (self.0).truncate(get_entries());\\n\\n }\\n\\n pub fn position(&self, slot: &Slot) -> Option<usize> {\\n\\n self.binary_search_by(|(probe, _)| slot.cmp(probe)).ok()\\n\",\n \"file_path\": \"sdk/program/src/slot_hashes.rs\",\n \"rank\": 91,\n \"score\": 263039.3769318061\n },\n {\n \"content\": \"fn checked_total_count_increment(total_count: u64, limit_count: u64) -> Result<u64> {\\n\\n let total_count = total_count + 1;\\n\\n if total_count > limit_count {\\n\\n return Err(UnpackError::Archive(format!(\\n\\n \\\"too many files in snapshot: {:?}\\\",\\n\\n total_count\\n\\n )));\\n\\n }\\n\\n Ok(total_count)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"runtime/src/hardened_unpack.rs\",\n \"rank\": 92,\n \"score\": 262881.61984795856\n },\n {\n \"content\": \"fn debug_fmt<T: ReadableAccount>(item: &T, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n let mut f = f.debug_struct(\\\"Account\\\");\\n\\n\\n\\n f.field(\\\"lamports\\\", &item.lamports())\\n\\n .field(\\\"data.len\\\", &item.data().len())\\n\\n .field(\\\"owner\\\", &item.owner())\\n\\n .field(\\\"executable\\\", &item.executable())\\n\\n .field(\\\"rent_epoch\\\", &item.rent_epoch());\\n\\n debug_account_data(item.data(), &mut f);\\n\\n\\n\\n f.finish()\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for Account {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n debug_fmt(self, f)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl fmt::Debug for AccountSharedData {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n debug_fmt(self, f)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sdk/src/account.rs\",\n \"rank\": 93,\n \"score\": 261433.02519797103\n },\n {\n \"content\": \"pub fn realloc(program_id: &Pubkey, address: &Pubkey, size: usize, bump: &mut u8) -> Instruction {\\n\\n let mut instruction_data = vec![REALLOC, *bump];\\n\\n instruction_data.extend_from_slice(&size.to_le_bytes());\\n\\n\\n\\n *bump = bump.saturating_add(1);\\n\\n\\n\\n Instruction::new_with_bytes(\\n\\n *program_id,\\n\\n &instruction_data,\\n\\n vec![AccountMeta::new(*address, false)],\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"programs/bpf/rust/realloc/src/instructions.rs\",\n \"rank\": 94,\n \"score\": 261061.23460435704\n },\n {\n \"content\": \"pub fn create_loadable_account(name: &str, lamports: u64) -> AccountSharedData {\\n\\n create_loadable_account_with_fields(name, (lamports, INITIAL_RENT_EPOCH))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sdk/src/native_loader.rs\",\n \"rank\": 95,\n \"score\": 259593.67191487906\n },\n {\n \"content\": \"/// Store the current `Instruction`'s index in the Instructions Sysvar data\\n\\npub fn store_current_index(data: &mut [u8], instruction_index: u16) {\\n\\n let last_index = data.len() - 2;\\n\\n data[last_index..last_index + 2].copy_from_slice(&instruction_index.to_le_bytes());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sdk/program/src/sysvar/instructions.rs\",\n \"rank\": 96,\n \"score\": 259474.1300784176\n },\n {\n \"content\": \"pub fn activate_feature(genesis_config: &mut GenesisConfig, feature_id: Pubkey) {\\n\\n genesis_config.accounts.insert(\\n\\n feature_id,\\n\\n Account::from(feature::create_account(\\n\\n &Feature {\\n\\n activated_at: Some(0),\\n\\n },\\n\\n std::cmp::max(genesis_config.rent.minimum_balance(Feature::size_of()), 1),\\n\\n )),\\n\\n );\\n\\n}\\n\\n\\n\",\n \"file_path\": \"runtime/src/genesis_utils.rs\",\n \"rank\": 97,\n \"score\": 259453.44688201032\n },\n {\n \"content\": \"pub fn create_account<S: Sysvar>(sysvar: &S, lamports: u64) -> Account {\\n\\n create_account_with_fields(sysvar, (lamports, INITIAL_RENT_EPOCH))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sdk/src/account.rs\",\n \"rank\": 98,\n \"score\": 258853.19561595586\n }\n]","isConversational":false}}},{"rowIdx":986,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"egui/src/grid.rs"},"repo_name":{"kind":"string","value":"katyo/egui"},"commit":{"kind":"string","value":"02db9ee5835a522ddf04308f259025388abf0185"},"file_code":{"kind":"string","value":"use crate::*;\n\n#[derive(Clone, Debug, Default, PartialEq)]\n#[cfg_attr(feature = \"persistence\", derive(serde::Deserialize, serde::Serialize))]\npub(crate) struct State {\n col_widths: Vec<f32>,\n row_heights: Vec<f32>,\n}\n\nimpl State {\n fn set_min_col_width(&mut self, col: usize, width: f32) {\n self.col_widths\n .resize(self.col_widths.len().max(col + 1), 0.0);\n self.col_widths[col] = self.col_widths[col].max(width);\n }\n\n fn set_min_row_height(&mut self, row: usize, height: f32) {\n self.row_heights\n .resize(self.row_heights.len().max(row + 1), 0.0);\n self.row_heights[row] = self.row_heights[row].max(height);\n }\n\n fn col_width(&self, col: usize) -> Option<f32> {\n self.col_widths.get(col).copied()\n }\n\n fn row_height(&self, row: usize) -> Option<f32> {\n self.row_heights.get(row).copied()\n }\n\n fn full_width(&self, x_spacing: f32) -> f32 {\n self.col_widths.iter().sum::<f32>()\n + (self.col_widths.len().at_least(1) - 1) as f32 * x_spacing\n }\n}\n\npub(crate) struct GridLayout {\n ctx: CtxRef,\n style: std::sync::Arc<Style>,\n id: Id,\n\n \n \n prev_state: State,\n \n curr_state: State,\n\n spacing: Vec2,\n\n striped: bool,\n initial_x: f32,\n min_cell_size: Vec2,\n max_cell_size: Vec2,\n col: usize,\n row: usize,\n}\n\nimpl GridLayout {\n pub(crate) fn new(ui: &Ui, id: Id) -> Self {\n let prev_state = ui.memory().id_data.get_or_default::<State>(id).clone();\n\n \n\n let available = ui.placer().max_rect().intersect(ui.cursor());\n let initial_x = available.min.x;\n assert!(\n initial_x.is_finite(),\n \"Grid not yet available for right-to-left layouts\"\n );\n\n Self {\n ctx: ui.ctx().clone(),\n style: ui.style().clone(),\n id,\n prev_state,\n curr_state: State::default(),\n spacing: ui.spacing().item_spacing,\n striped: false,\n initial_x,\n min_cell_size: ui.spacing().interact_size,\n max_cell_size: Vec2::INFINITY,\n col: 0,\n row: 0,\n }\n }\n}\n\nimpl GridLayout {\n fn prev_col_width(&self, col: usize) -> f32 {\n self.prev_state\n .col_width(col)\n .unwrap_or(self.min_cell_size.x)\n }\n fn prev_row_height(&self, row: usize) -> f32 {\n self.prev_state\n .row_height(row)\n .unwrap_or(self.min_cell_size.y)\n }\n\n pub(crate) fn wrap_text(&self) -> bool {\n self.max_cell_size.x.is_finite()\n }\n\n pub(crate) fn available_rect(&self, region: &Region) -> Rect {\n \n self.available_rect_finite(region)\n }\n\n pub(crate) fn available_rect_finite(&self, region: &Region) -> Rect {\n let width = if self.max_cell_size.x.is_finite() {\n \n self.max_cell_size.x\n } else {\n \n \n self.prev_state\n .col_width(self.col)\n .or_else(|| self.curr_state.col_width(self.col))\n .unwrap_or(self.min_cell_size.x)\n };\n\n let available = region.max_rect.intersect(region.cursor);\n\n let height = region.max_rect_finite().max.y - available.top();\n let height = height\n .at_least(self.min_cell_size.y)\n .at_most(self.max_cell_size.y);\n\n Rect::from_min_size(available.min, vec2(width, height))\n }\n\n pub(crate) fn next_cell(&self, cursor: Rect, child_size: Vec2) -> Rect {\n let width = self.prev_state.col_width(self.col).unwrap_or(0.0);\n let height = self.prev_row_height(self.row);\n let size = child_size.max(vec2(width, height));\n Rect::from_min_size(cursor.min, size)\n }\n\n #[allow(clippy::unused_self)]\n pub(crate) fn align_size_within_rect(&self, size: Vec2, frame: Rect) -> Rect {\n \n Align2::LEFT_CENTER.align_size_within_rect(size, frame)\n }\n\n pub(crate) fn justify_and_align(&self, frame: Rect, size: Vec2) -> Rect {\n self.align_size_within_rect(size, frame)\n }\n\n pub(crate) fn advance(&mut self, cursor: &mut Rect, frame_rect: Rect, widget_rect: Rect) {\n let debug_expand_width = self.style.debug.show_expand_width;\n let debug_expand_height = self.style.debug.show_expand_height;\n if debug_expand_width || debug_expand_height {\n let rect = widget_rect;\n let too_wide = rect.width() > self.prev_col_width(self.col);\n let too_high = rect.height() > self.prev_row_height(self.row);\n\n if (debug_expand_width && too_wide) || (debug_expand_height && too_high) {\n let painter = self.ctx.debug_painter();\n painter.rect_stroke(rect, 0.0, (1.0, Color32::LIGHT_BLUE));\n\n let stroke = Stroke::new(2.5, Color32::from_rgb(200, 0, 0));\n let paint_line_seg = |a, b| painter.line_segment([a, b], stroke);\n\n if debug_expand_width && too_wide {\n paint_line_seg(rect.left_top(), rect.left_bottom());\n paint_line_seg(rect.left_center(), rect.right_center());\n paint_line_seg(rect.right_top(), rect.right_bottom());\n }\n }\n }\n\n self.curr_state\n .set_min_col_width(self.col, widget_rect.width().at_least(self.min_cell_size.x));\n self.curr_state.set_min_row_height(\n self.row,\n widget_rect.height().at_least(self.min_cell_size.y),\n );\n\n self.col += 1;\n cursor.min.x += frame_rect.width() + self.spacing.x;\n }\n\n pub(crate) fn end_row(&mut self, cursor: &mut Rect, painter: &Painter) {\n let row_height = self.prev_row_height(self.row);\n\n cursor.min.x = self.initial_x;\n cursor.min.y += row_height + self.spacing.y;\n self.col = 0;\n self.row += 1;\n\n if self.striped && self.row % 2 == 1 {\n if let Some(height) = self.prev_state.row_height(self.row) {\n \n let size = Vec2::new(self.prev_state.full_width(self.spacing.x), height);\n let rect = Rect::from_min_size(cursor.min, size);\n let rect = rect.expand2(0.5 * self.spacing.y * Vec2::Y);\n let rect = rect.expand2(2.0 * Vec2::X); \n\n let color = if self.style.visuals.dark_mode {\n Rgba::from_white_alpha(0.0075)\n } else {\n Rgba::from_black_alpha(0.075)\n };\n painter.rect_filled(rect, 2.0, color);\n }\n }\n }\n\n pub(crate) fn save(&self) {\n if self.curr_state != self.prev_state {\n self.ctx\n .memory()\n .id_data\n .insert(self.id, self.curr_state.clone());\n self.ctx.request_repaint();\n }\n }\n}\n\n#[must_use = \"You should call .show()\"]\npub struct Grid {\n id_source: Id,\n striped: bool,\n min_col_width: Option<f32>,\n min_row_height: Option<f32>,\n max_cell_size: Vec2,\n spacing: Option<Vec2>,\n start_row: usize,\n}\n\nimpl Grid {\n \n pub fn new(id_source: impl std::hash::Hash) -> Self {\n Self {\n id_source: Id::new(id_source),\n striped: false,\n min_col_width: None,\n min_row_height: None,\n max_cell_size: Vec2::INFINITY,\n spacing: None,\n start_row: 0,\n }\n }\n\n \n \n \n \n pub fn striped(mut self, striped: bool) -> Self {\n self.striped = striped;\n self\n }\n\n \n \n pub fn min_col_width(mut self, min_col_width: f32) -> Self {\n self.min_col_width = Some(min_col_width);\n self\n }\n\n \n \n pub fn min_row_height(mut self, min_row_height: f32) -> Self {\n self.min_row_height = Some(min_row_height);\n self\n }\n\n \n pub fn max_col_width(mut self, max_col_width: f32) -> Self {\n self.max_cell_size.x = max_col_width;\n self\n }\n\n \n \n pub fn spacing(mut self, spacing: impl Into<Vec2>) -> Self {\n self.spacing = Some(spacing.into());\n self\n }\n\n \n \n pub fn start_row(mut self, start_row: usize) -> Self {\n self.start_row = start_row;\n self\n }\n}\n\nimpl Grid {\n pub fn show<R>(self, ui: &mut Ui, add_contents: impl FnOnce(&mut Ui) -> R) -> InnerResponse<R> {\n let Self {\n id_source,\n striped,\n min_col_width,\n min_row_height,\n max_cell_size,\n spacing,\n start_row,\n } = self;\n let min_col_width = min_col_width.unwrap_or_else(|| ui.spacing().interact_size.x);\n let min_row_height = min_row_height.unwrap_or_else(|| ui.spacing().interact_size.y);\n let spacing = spacing.unwrap_or_else(|| ui.spacing().item_spacing);\n\n \n \n \n \n ui.horizontal(|ui| {\n let id = ui.make_persistent_id(id_source);\n let grid = GridLayout {\n striped,\n spacing,\n min_cell_size: vec2(min_col_width, min_row_height),\n max_cell_size,\n row: start_row,\n ..GridLayout::new(ui, id)\n };\n\n ui.set_grid(grid);\n let r = add_contents(ui);\n ui.save_grid();\n r\n })\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::*;\n\n#[derive(Clone, Debug, Default, PartialEq)]\n#[cfg_attr(feature = \"persistence\", derive(serde::Deserialize, serde::Serialize))]\npub(crate) struct State {\n col_widths: Vec<f32>,\n row_heights: Vec<f32>,\n}\n\nimpl State {\n fn set_min_col_width(&mut self, col: usize, width: f32) {\n self.col_widths\n .resize(self.col_widths.len().max(col + 1), 0.0);\n self.col_widths[col] = self.col_widths[col].max(width);\n }\n\n fn set_min_row_height(&mut self, row: usize, height: f32) {\n self.row_heights\n .resize(self.row_heights.len().max(row + 1), 0.0);\n self.row_heights[row] = self.row_heights[row].max(height);\n }\n\n fn col_width(&self, col: usize) -> Option<f32> {\n self.col_widths.get(col).copied()\n }\n\n fn row_height(&self, row: usize) -> Option<f32> {\n self.row_heights.get(row).copied()\n }\n\n fn full_width(&self, x_spacing: f32) -> f32 {\n self.col_widths.iter().sum::<f32>()\n + (self.col_widths.len().at_least(1) - 1) as f32 * x_spacing\n }\n}\n\npub(crate) struct GridLayout {\n ctx: CtxRef,\n style: std::sync::Arc<Style>,\n id: Id,\n\n \n \n prev_state: State,\n \n curr_state: State,\n\n spacing: Vec2,\n\n striped: bool,\n initial_x: f32,\n min_cell_size: Vec2,\n max_cell_size: Vec2,\n col: usize,\n row: usize,\n}\n\nimpl GridLayout {\n pub(crate) fn new(ui: &Ui, id: Id) -> Self {\n let prev_state = ui.memory().id_data.get_or_default::<State>(id).clone();\n\n \n\n let available = ui.placer().max_rect().intersect(ui.cursor());\n let initial_x = available.min.x;\n assert!(\n initial_x.is_finite(),\n \"Grid not yet available for right-to-left layouts\"\n );\n\n Self {\n ctx: ui.ctx().clone(),\n style: ui.style().clone(),\n id,\n prev_state,\n curr_state: State::default(),\n spacing: ui.spacing().item_spacing,\n striped: false,\n initial_x,\n min_cell_size: ui.spacing().interact_size,\n max_cell_size: Vec2::INFINITY,\n col: 0,\n row: 0,\n }\n }\n}\n\nimpl GridLayout {\n fn prev_col_width(&self, col: usize) -> f32 {\n self.prev_state\n .col_width(col)\n .unwrap_or(self.min_cell_size.x)\n }\n fn prev_row_height(&self, row: usize) -> f32 {\n self.prev_state\n .row_height(row)\n .unwrap_or(self.min_cell_size.y)\n }\n\n pub(crate) fn wrap_text(&self) -> bool {\n self.max_cell_size.x.is_finite()\n }\n\n pub(crate) fn available_rect(&self, region: &Region) -> Rect {\n \n self.available_rect_finite(region)\n }\n\n pub(crate) fn available_rect_finite(&self, region: &Region) -> Rect {\n let width = if self.max_cell_size.x.is_finite() {\n \n self.max_cell_size.x\n } else {\n \n \n self.prev_state\n .col_width(self.col)\n .or_else(|| self.curr_state.col_width(self.col))\n .unwrap_or(self.min_cell_size.x)\n };\n\n let available = region.max_rect.intersect(region.cursor);\n\n let height = region.max_rect_finite().max.y - available.top();\n let height = height\n .at_least(self.min_cell_size.y)\n .at_most(self.max_cell_size.y);\n\n Rect::from_min_size(available.min, vec2(width, height))\n }\n\n pub(crate) fn next_cell(&self, cursor: Rect, child_size: Vec2) -> Rect {\n let width = self.prev_state.col_width(self.col).unwrap_or(0.0);\n let height = self.prev_row_height(self.row);\n let size = child_size.max(vec2(width, height));\n Rect::from_min_size(cursor.min, size)\n }\n\n #[allow(clippy::unused_self)]\n pub(crate) fn align_size_within_rect(&self, size: Vec2, frame: Rect) -> Rect {\n \n Align2::LEFT_CENTER.align_size_within_rect(size, frame)\n }\n\n pub(crate) fn justify_and_align(&self, frame: Rect, size: Vec2) -> Rect {\n self.align_size_within_rect(size, frame)\n }\n\n pub(crate) fn advance(&mut self, cursor: &mut Rect, frame_rect: Rect, widget_rect: Rect) {\n let debug_expand_width = self.style.debug.show_expand_width;\n let debug_expand_height = self.style.debug.show_expand_height;\n if debug_expand_width || debug_expand_height {\n let rect = widget_rect;\n let too_wide = rect.width() > self.prev_col_width(self.col);\n let too_high = rect.height() > self.prev_row_height(self.row);\n\n if (debug_expand_width && too_wide) || (debug_expand_height && too_high) {\n let painter = self.ctx.debug_painter();\n painter.rect_stroke(rect, 0.0, (1.0, Color32::LIGHT_BLUE));\n\n let stroke = Stroke::new(2.5, Color32::from_rgb(200, 0, 0));\n let paint_line_seg = |a, b| painter.line_segment([a, b], stroke);\n\n if debug_expand_width && too_wide {\n paint_line_seg(rect.left_top(), rect.left_bottom());\n paint_line_seg(rect.left_center(), rect.right_center());\n paint_line_seg(rect.right_top(), rect.right_bottom());\n }\n }\n }\n\n self.curr_state\n .set_min_col_width(self.col, widget_rect.width().at_least(self.min_cell_size.x));\n self.curr_state.set_min_row_height(\n self.row,\n widget_rect.height().at_least(self.min_cell_size.y),\n );\n\n self.col += 1;\n cursor.min.x += frame_rect.width() + self.spacing.x;\n }\n\n pub(crate) fn end_row(&mut self, cursor: &mut Rect, painter: &Painter) {\n let row_height = self.prev_row_height(self.row);\n\n cursor.min.x = self.initial_x;\n cursor.min.y += row_height + self.spacing.y;\n self.col = 0;\n self.row += 1;\n\n if self.striped && self.row % 2 == 1 {\n if let Some(height) = self.prev_state.row_height(self.row) {\n \n let size = Vec2::new(self.prev_state.full_width(self.spacing.x), height);\n let rect = Rect::from_min_size(cursor.min, size);\n let rect = rect.expand2(0.5 * self.spacing.y * Vec2::Y);\n let rect = rect.expand2(2.0 * Vec2::X); \n\n let color = if self.style.visuals.dark_mode {\n "},"suffix":{"kind":"string","value":"\n\n pub(crate) fn save(&self) {\n if self.curr_state != self.prev_state {\n self.ctx\n .memory()\n .id_data\n .insert(self.id, self.curr_state.clone());\n self.ctx.request_repaint();\n }\n }\n}\n\n#[must_use = \"You should call .show()\"]\npub struct Grid {\n id_source: Id,\n striped: bool,\n min_col_width: Option<f32>,\n min_row_height: Option<f32>,\n max_cell_size: Vec2,\n spacing: Option<Vec2>,\n start_row: usize,\n}\n\nimpl Grid {\n \n pub fn new(id_source: impl std::hash::Hash) -> Self {\n Self {\n id_source: Id::new(id_source),\n striped: false,\n min_col_width: None,\n min_row_height: None,\n max_cell_size: Vec2::INFINITY,\n spacing: None,\n start_row: 0,\n }\n }\n\n \n \n \n \n pub fn striped(mut self, striped: bool) -> Self {\n self.striped = striped;\n self\n }\n\n \n \n pub fn min_col_width(mut self, min_col_width: f32) -> Self {\n self.min_col_width = Some(min_col_width);\n self\n }\n\n \n \n pub fn min_row_height(mut self, min_row_height: f32) -> Self {\n self.min_row_height = Some(min_row_height);\n self\n }\n\n \n pub fn max_col_width(mut self, max_col_width: f32) -> Self {\n self.max_cell_size.x = max_col_width;\n self\n }\n\n \n \n pub fn spacing(mut self, spacing: impl Into<Vec2>) -> Self {\n self.spacing = Some(spacing.into());\n self\n }\n\n \n \n pub fn start_row(mut self, start_row: usize) -> Self {\n self.start_row = start_row;\n self\n }\n}\n\nimpl Grid {\n pub fn show<R>(self, ui: &mut Ui, add_contents: impl FnOnce(&mut Ui) -> R) -> InnerResponse<R> {\n let Self {\n id_source,\n striped,\n min_col_width,\n min_row_height,\n max_cell_size,\n spacing,\n start_row,\n } = self;\n let min_col_width = min_col_width.unwrap_or_else(|| ui.spacing().interact_size.x);\n let min_row_height = min_row_height.unwrap_or_else(|| ui.spacing().interact_size.y);\n let spacing = spacing.unwrap_or_else(|| ui.spacing().item_spacing);\n\n \n \n \n \n ui.horizontal(|ui| {\n let id = ui.make_persistent_id(id_source);\n let grid = GridLayout {\n striped,\n spacing,\n min_cell_size: vec2(min_col_width, min_row_height),\n max_cell_size,\n row: start_row,\n ..GridLayout::new(ui, id)\n };\n\n ui.set_grid(grid);\n let r = add_contents(ui);\n ui.save_grid();\n r\n })\n }\n}\n"},"middle":{"kind":"string","value":"Rgba::from_white_alpha(0.0075)\n } else {\n Rgba::from_black_alpha(0.075)\n };\n painter.rect_filled(rect, 2.0, color);\n }\n }\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"pub fn show_tooltip_under(ctx: &CtxRef, id: Id, rect: &Rect, add_contents: impl FnOnce(&mut Ui)) {\n\n show_tooltip_at(\n\n ctx,\n\n id,\n\n Some(rect.left_bottom() + vec2(-2.0, 4.0)),\n\n add_contents,\n\n )\n\n}\n\n\n","file_path":"egui/src/containers/popup.rs","rank":0,"score":496410.7242350833},{"content":"/// Show a tooltip at the current pointer position (if any).\n\n///\n\n/// Most of the time it is easier to use [`Response::on_hover_ui`].\n\n///\n\n/// See also [`show_tooltip_text`].\n\n///\n\n/// ```\n\n/// # let mut ui = egui::Ui::__test();\n\n/// if ui.ui_contains_pointer() {\n\n/// egui::show_tooltip(ui.ctx(), egui::Id::new(\"my_tooltip\"), |ui| {\n\n/// ui.label(\"Helpful text\");\n\n/// });\n\n/// }\n\n/// ```\n\npub fn show_tooltip(ctx: &CtxRef, id: Id, add_contents: impl FnOnce(&mut Ui)) {\n\n show_tooltip_at_pointer(ctx, id, add_contents)\n\n}\n\n\n","file_path":"egui/src/containers/popup.rs","rank":1,"score":435091.79898475885},{"content":"pub fn show_color(ui: &mut Ui, color: impl Into<Hsva>, desired_size: Vec2) -> Response {\n\n show_hsva(ui, color.into(), desired_size)\n\n}\n\n\n","file_path":"egui/src/widgets/color_picker.rs","rank":2,"score":435078.4534569054},{"content":"fn color_slider_1d(ui: &mut Ui, value: &mut f32, color_at: impl Fn(f32) -> Color32) -> Response {\n\n #![allow(clippy::identity_op)]\n\n\n\n let desired_size = vec2(\n\n ui.spacing().slider_width,\n\n ui.spacing().interact_size.y * 2.0,\n\n );\n\n let (rect, response) = ui.allocate_at_least(desired_size, Sense::click_and_drag());\n\n\n\n if let Some(mpos) = response.interact_pointer_pos() {\n\n *value = remap_clamp(mpos.x, rect.left()..=rect.right(), 0.0..=1.0);\n\n }\n\n\n\n let visuals = ui.style().interact(&response);\n\n\n\n background_checkers(ui.painter(), rect); // for alpha:\n\n\n\n {\n\n // fill color:\n\n let mut mesh = Mesh::default();\n","file_path":"egui/src/widgets/color_picker.rs","rank":3,"score":434817.4546166628},{"content":"pub fn show_tooltip_at_pointer(ctx: &CtxRef, id: Id, add_contents: impl FnOnce(&mut Ui)) {\n\n let suggested_pos = ctx\n\n .input()\n\n .pointer\n\n .hover_pos()\n\n .map(|pointer_pos| pointer_pos + vec2(16.0, 16.0));\n\n show_tooltip_at(ctx, id, suggested_pos, add_contents)\n\n}\n\n\n","file_path":"egui/src/containers/popup.rs","rank":4,"score":431105.3235280281},{"content":"pub fn paint_resize_corner_with_style(ui: &mut Ui, rect: &Rect, stroke: Stroke, corner: Align2) {\n\n let painter = ui.painter();\n\n let cp = painter.round_pos_to_pixels(corner.pos_in_rect(rect));\n\n let mut w = 2.0;\n\n\n\n while w <= rect.width() && w <= rect.height() {\n\n painter.line_segment(\n\n [\n\n pos2(cp.x - w * corner.x().to_sign(), cp.y),\n\n pos2(cp.x, cp.y - w * corner.y().to_sign()),\n\n ],\n\n stroke,\n\n );\n\n w += 4.0;\n\n }\n\n}\n","file_path":"egui/src/containers/resize.rs","rank":5,"score":406946.1417069399},{"content":"fn show_hsva(ui: &mut Ui, color: Hsva, desired_size: Vec2) -> Response {\n\n let (rect, response) = ui.allocate_at_least(desired_size, Sense::hover());\n\n background_checkers(ui.painter(), rect);\n\n if true {\n\n let left = Rect::from_min_max(rect.left_top(), rect.center_bottom());\n\n let right = Rect::from_min_max(rect.center_top(), rect.right_bottom());\n\n ui.painter().rect_filled(left, 0.0, color);\n\n ui.painter().rect_filled(right, 0.0, color.to_opaque());\n\n } else {\n\n ui.painter().add(Shape::Rect {\n\n rect,\n\n corner_radius: 2.0,\n\n fill: color.into(),\n\n stroke: Stroke::new(3.0, color.to_opaque()),\n\n });\n\n }\n\n response\n\n}\n\n\n","file_path":"egui/src/widgets/color_picker.rs","rank":6,"score":391408.09614316985},{"content":"pub fn center_size_in_rect(size: Vec2, frame: Rect) -> Rect {\n\n Align2::CENTER_CENTER.align_size_within_rect(size, frame)\n\n}\n","file_path":"emath/src/align.rs","rank":7,"score":388795.6804672339},{"content":"pub fn stroke_ui(ui: &mut crate::Ui, stroke: &mut epaint::Stroke, text: &str) {\n\n let epaint::Stroke { width, color } = stroke;\n\n ui.horizontal(|ui| {\n\n ui.add(DragValue::new(width).speed(0.1).clamp_range(0.0..=5.0))\n\n .on_hover_text(\"Width\");\n\n ui.color_edit_button_srgba(color);\n\n ui.label(text);\n\n\n\n // stroke preview:\n\n let (_id, stroke_rect) = ui.allocate_space(ui.spacing().interact_size);\n\n let left = stroke_rect.left_center();\n\n let right = stroke_rect.right_center();\n\n ui.painter().line_segment([left, right], (*width, *color));\n\n });\n\n}\n\n\n\npub(crate) fn shadow_ui(ui: &mut Ui, shadow: &mut epaint::Shadow, text: &str) {\n\n let epaint::Shadow { extrusion, color } = shadow;\n\n ui.horizontal(|ui| {\n\n ui.label(text);\n\n ui.add(\n\n DragValue::new(extrusion)\n\n .speed(1.0)\n\n .clamp_range(0.0..=100.0),\n\n )\n\n .on_hover_text(\"Extrusion\");\n\n ui.color_edit_button_srgba(color);\n\n });\n\n}\n","file_path":"egui/src/widgets/mod.rs","rank":8,"score":382180.5042271465},{"content":"pub fn drag_source(ui: &mut Ui, id: Id, body: impl FnOnce(&mut Ui)) {\n\n let is_being_dragged = ui.memory().is_being_dragged(id);\n\n\n\n if !is_being_dragged {\n\n let response = ui.scope(body).response;\n\n\n\n // Check for drags:\n\n let response = ui.interact(response.rect, id, Sense::drag());\n\n if response.hovered() {\n\n ui.output().cursor_icon = CursorIcon::Grab;\n\n }\n\n } else {\n\n ui.output().cursor_icon = CursorIcon::Grabbing;\n\n\n\n // Paint the body to a new layer:\n\n let layer_id = LayerId::new(Order::Tooltip, id);\n\n let response = ui.with_layer_id(layer_id, body).response;\n\n\n\n // Now we move the visuals of the body to where the mouse is.\n\n // Normally you need to decide a location for a widget first,\n","file_path":"egui_demo_lib/src/apps/demo/drag_and_drop.rs","rank":9,"score":381401.5292750436},{"content":"fn color_text_ui(ui: &mut Ui, color: impl Into<Color32>) {\n\n let color = color.into();\n\n ui.horizontal(|ui| {\n\n let [r, g, b, a] = color.to_array();\n\n ui.label(format!(\n\n \"RGBA (premultiplied): rgba({}, {}, {}, {})\",\n\n r, g, b, a\n\n ));\n\n\n\n if ui.button(\"📋\").on_hover_text(\"Click to copy\").clicked() {\n\n ui.output().copied_text = format!(\"{}, {}, {}, {}\", r, g, b, a);\n\n }\n\n });\n\n}\n\n\n","file_path":"egui/src/widgets/color_picker.rs","rank":10,"score":378758.67014943296},{"content":"/// Helper function that adds a label when compiling with debug assertions enabled.\n\npub fn warn_if_debug_build(ui: &mut crate::Ui) {\n\n if cfg!(debug_assertions) {\n\n ui.label(\n\n crate::Label::new(\"‼ Debug build ‼\")\n\n .small()\n\n .text_color(crate::Color32::RED),\n\n )\n\n .on_hover_text(\"egui was compiled with debug assertions enabled.\");\n\n }\n\n}\n\n\n\n// ----------------------------------------------------------------------------\n\n\n\n/// Create a [`Hyperlink`](crate::Hyperlink) to the current [`file!()`] (and line) on Github\n\n///\n\n/// Example: `ui.add(github_link_file_line!(\"https://github.com/YOUR/PROJECT/blob/master/\", \"(source code)\"));`\n\n#[macro_export]\n\nmacro_rules! github_link_file_line {\n\n ($github_url:expr, $label:expr) => {{\n\n let url = format!(\"{}{}#L{}\", $github_url, file!(), line!());\n","file_path":"egui/src/lib.rs","rank":11,"score":349251.1172759094},{"content":"fn bullet_point(ui: &mut Ui, width: f32) -> Response {\n\n let row_height = ui.fonts()[TextStyle::Body].row_height();\n\n let (rect, response) = ui.allocate_exact_size(vec2(width, row_height), Sense::hover());\n\n ui.painter().circle_filled(\n\n rect.center(),\n\n rect.height() / 8.0,\n\n ui.visuals().strong_text_color(),\n\n );\n\n response\n\n}\n\n\n","file_path":"egui_demo_lib/src/easy_mark/easy_mark_viewer.rs","rank":12,"score":348811.76782343996},{"content":"/// return true on change\n\nfn color_picker_hsva_2d(ui: &mut Ui, hsva: &mut Hsva, alpha: Alpha) -> bool {\n\n let mut hsvag = HsvaGamma::from(*hsva);\n\n color_picker_hsvag_2d(ui, &mut hsvag, alpha);\n\n let new_hasva = Hsva::from(hsvag);\n\n if *hsva == new_hasva {\n\n false\n\n } else {\n\n *hsva = new_hasva;\n\n true\n\n }\n\n}\n\n\n","file_path":"egui/src/widgets/color_picker.rs","rank":13,"score":341958.0579281187},{"content":"fn numbered_point(ui: &mut Ui, width: f32, number: &str) -> Response {\n\n let row_height = ui.fonts()[TextStyle::Body].row_height();\n\n let (rect, response) = ui.allocate_exact_size(vec2(width, row_height), Sense::hover());\n\n let text = format!(\"{}.\", number);\n\n let text_color = ui.visuals().strong_text_color();\n\n ui.painter().text(\n\n rect.right_center(),\n\n Align2::RIGHT_CENTER,\n\n text,\n\n TextStyle::Body,\n\n text_color,\n\n );\n\n response\n\n}\n","file_path":"egui_demo_lib/src/easy_mark/easy_mark_viewer.rs","rank":14,"score":330070.6152235584},{"content":"/// Construct a top level menu in a menu bar. This would be e.g. \"File\", \"Edit\" etc.\n\npub fn menu(ui: &mut Ui, title: impl ToString, add_contents: impl FnOnce(&mut Ui)) {\n\n menu_impl(ui, title, Box::new(add_contents))\n\n}\n\n\n","file_path":"egui/src/menu.rs","rank":15,"score":329402.50982299785},{"content":"fn ui_color(ui: &mut Ui, srgba: &mut Color32, text: &str) {\n\n ui.horizontal(|ui| {\n\n ui.color_edit_button_srgba(srgba);\n\n ui.label(text);\n\n });\n\n}\n","file_path":"egui/src/style.rs","rank":16,"score":327716.3970900571},{"content":"fn close_button(ui: &mut Ui, rect: Rect) -> Response {\n\n let close_id = ui.auto_id_with(\"window_close_button\");\n\n let response = ui.interact(rect, close_id, Sense::click());\n\n ui.expand_to_include_rect(response.rect);\n\n\n\n let visuals = ui.style().interact(&response);\n\n let rect = rect.shrink(2.0).expand(visuals.expansion);\n\n let stroke = visuals.fg_stroke;\n\n ui.painter()\n\n .line_segment([rect.left_top(), rect.right_bottom()], stroke);\n\n ui.painter()\n\n .line_segment([rect.right_top(), rect.left_bottom()], stroke);\n\n response\n\n}\n","file_path":"egui/src/containers/window.rs","rank":17,"score":320592.58225311164},{"content":"/// Show some text at the current pointer position (if any).\n\n///\n\n/// Most of the time it is easier to use [`Response::on_hover_text`].\n\n///\n\n/// See also [`show_tooltip`].\n\n///\n\n/// ```\n\n/// # let mut ui = egui::Ui::__test();\n\n/// if ui.ui_contains_pointer() {\n\n/// egui::show_tooltip_text(ui.ctx(), egui::Id::new(\"my_tooltip\"), \"Helpful text\");\n\n/// }\n\n/// ```\n\npub fn show_tooltip_text(ctx: &CtxRef, id: Id, text: impl ToString) {\n\n show_tooltip(ctx, id, |ui| {\n\n ui.add(crate::widgets::Label::new(text));\n\n })\n\n}\n\n\n","file_path":"egui/src/containers/popup.rs","rank":18,"score":316954.1682352518},{"content":"fn color_button(ui: &mut Ui, color: Color32) -> Response {\n\n let size = ui.spacing().interact_size;\n\n let (rect, response) = ui.allocate_exact_size(size, Sense::click());\n\n response.widget_info(|| WidgetInfo::new(WidgetType::ColorButton));\n\n let visuals = ui.style().interact(&response);\n\n let rect = rect.expand(visuals.expansion);\n\n\n\n background_checkers(ui.painter(), rect);\n\n\n\n let left_half = Rect::from_min_max(rect.left_top(), rect.center_bottom());\n\n let right_half = Rect::from_min_max(rect.center_top(), rect.right_bottom());\n\n ui.painter().rect_filled(left_half, 0.0, color);\n\n ui.painter().rect_filled(right_half, 0.0, color.to_opaque());\n\n\n\n let corner_radius = visuals.corner_radius.at_most(2.0);\n\n ui.painter()\n\n .rect_stroke(rect, corner_radius, (2.0, visuals.bg_fill)); // fill is intentional!\n\n\n\n response\n\n}\n\n\n","file_path":"egui/src/widgets/color_picker.rs","rank":19,"score":313089.81223149464},{"content":"/// Show a button to reset a value to its default.\n\n/// The button is only enabled if the value does not already have its original value.\n\npub fn reset_button<T: Default + PartialEq>(ui: &mut Ui, value: &mut T) {\n\n let def = T::default();\n\n if ui\n\n .add(Button::new(\"Reset\").enabled(*value != def))\n\n .clicked()\n\n {\n\n *value = def;\n\n }\n\n}\n\n\n\n// ----------------------------------------------------------------------------\n\n\n","file_path":"egui/src/widgets/mod.rs","rank":20,"score":312761.9634476489},{"content":"#[allow(clippy::needless_pass_by_value)]\n\nfn menu_impl<'c>(ui: &mut Ui, title: impl ToString, add_contents: Box<dyn FnOnce(&mut Ui) + 'c>) {\n\n let title = title.to_string();\n\n let bar_id = ui.id();\n\n let menu_id = bar_id.with(&title);\n\n\n\n let mut bar_state = BarState::load(ui.ctx(), &bar_id);\n\n\n\n let mut button = Button::new(title);\n\n\n\n if bar_state.open_menu == Some(menu_id) {\n\n button = button.fill(Some(ui.visuals().selection.bg_fill));\n\n }\n\n\n\n let button_response = ui.add(button);\n\n if button_response.clicked() {\n\n // Toggle\n\n if bar_state.open_menu == Some(menu_id) {\n\n bar_state.open_menu = None;\n\n } else {\n\n bar_state.open_menu = Some(menu_id);\n","file_path":"egui/src/menu.rs","rank":21,"score":310597.87449471315},{"content":"fn ui_url(ui: &mut egui::Ui, frame: &mut epi::Frame<'_>, url: &mut String) -> Option<String> {\n\n let mut trigger_fetch = false;\n\n\n\n ui.horizontal(|ui| {\n\n ui.label(\"URL:\");\n\n trigger_fetch |= ui.text_edit_singleline(url).lost_focus();\n\n trigger_fetch |= ui.button(\"GET\").clicked();\n\n });\n\n\n\n if frame.is_web() {\n\n ui.label(\"HINT: paste the url of this page into the field above!\");\n\n }\n\n\n\n ui.horizontal(|ui| {\n\n if ui.button(\"Source code for this example\").clicked() {\n\n *url = format!(\n\n \"https://raw.githubusercontent.com/emilk/egui/master/{}\",\n\n file!()\n\n );\n\n trigger_fetch = true;\n","file_path":"egui_demo_lib/src/apps/http_app.rs","rank":22,"score":305511.0877685263},{"content":"fn background_checkers(painter: &Painter, rect: Rect) {\n\n let rect = rect.shrink(0.5); // Small hack to avoid the checkers from peeking through the sides\n\n if !rect.is_positive() {\n\n return;\n\n }\n\n\n\n let mut top_color = Color32::from_gray(128);\n\n let mut bottom_color = Color32::from_gray(32);\n\n let checker_size = Vec2::splat(rect.height() / 2.0);\n\n let n = (rect.width() / checker_size.x).round() as u32;\n\n\n\n let mut mesh = Mesh::default();\n\n for i in 0..n {\n\n let x = lerp(rect.left()..=rect.right(), i as f32 / (n as f32));\n\n mesh.add_colored_rect(\n\n Rect::from_min_size(pos2(x, rect.top()), checker_size),\n\n top_color,\n\n );\n\n mesh.add_colored_rect(\n\n Rect::from_min_size(pos2(x, rect.center().y), checker_size),\n\n bottom_color,\n\n );\n\n std::mem::swap(&mut top_color, &mut bottom_color);\n\n }\n\n painter.add(Shape::mesh(mesh));\n\n}\n\n\n","file_path":"egui/src/widgets/color_picker.rs","rank":23,"score":304308.5139438763},{"content":"fn paint_cursor_end(ui: &mut Ui, pos: Pos2, galley: &Galley, cursor: &Cursor) {\n\n let stroke = ui.visuals().selection.stroke;\n\n\n\n let cursor_pos = galley.pos_from_cursor(cursor).translate(pos.to_vec2());\n\n let cursor_pos = cursor_pos.expand(1.5); // slightly above/below row\n\n\n\n let top = cursor_pos.center_top();\n\n let bottom = cursor_pos.center_bottom();\n\n\n\n ui.painter().line_segment(\n\n [top, bottom],\n\n (ui.visuals().text_cursor_width, stroke.color),\n\n );\n\n\n\n if false {\n\n // Roof/floor:\n\n let extrusion = 3.0;\n\n let width = 1.0;\n\n ui.painter().line_segment(\n\n [top - vec2(extrusion, 0.0), top + vec2(extrusion, 0.0)],\n","file_path":"egui/src/widgets/text_edit.rs","rank":24,"score":298845.0229283991},{"content":"/// The menu bar goes well in a [`TopBottomPanel::top`],\n\n/// but can also be placed in a `Window`.\n\n/// In the latter case you may want to wrap it in `Frame`.\n\npub fn bar<R>(ui: &mut Ui, add_contents: impl FnOnce(&mut Ui) -> R) -> InnerResponse<R> {\n\n ui.horizontal(|ui| {\n\n let mut style = (**ui.style()).clone();\n\n style.spacing.button_padding = vec2(2.0, 0.0);\n\n // style.visuals.widgets.active.bg_fill = Color32::TRANSPARENT;\n\n style.visuals.widgets.active.bg_stroke = Stroke::none();\n\n // style.visuals.widgets.hovered.bg_fill = Color32::TRANSPARENT;\n\n style.visuals.widgets.hovered.bg_stroke = Stroke::none();\n\n style.visuals.widgets.inactive.bg_fill = Color32::TRANSPARENT;\n\n style.visuals.widgets.inactive.bg_stroke = Stroke::none();\n\n ui.set_style(style);\n\n\n\n // Take full width and fixed height:\n\n let height = ui.spacing().interact_size.y;\n\n ui.set_min_size(vec2(ui.available_width(), height));\n\n\n\n add_contents(ui)\n\n })\n\n}\n\n\n","file_path":"egui/src/menu.rs","rank":25,"score":297987.70146027685},{"content":"#[allow(dead_code)]\n\nfn toggle_ui_compact(ui: &mut egui::Ui, on: &mut bool) -> egui::Response {\n\n let desired_size = ui.spacing().interact_size.y * egui::vec2(2.0, 1.0);\n\n let (rect, mut response) = ui.allocate_exact_size(desired_size, egui::Sense::click());\n\n if response.clicked() {\n\n *on = !*on;\n\n response.mark_changed();\n\n }\n\n response.widget_info(|| egui::WidgetInfo::selected(egui::WidgetType::Checkbox, *on, \"\"));\n\n\n\n let how_on = ui.ctx().animate_bool(response.id, *on);\n\n let visuals = ui.style().interact_selectable(&response, *on);\n\n let rect = rect.expand(visuals.expansion);\n\n let radius = 0.5 * rect.height();\n\n ui.painter()\n\n .rect(rect, radius, visuals.bg_fill, visuals.bg_stroke);\n\n let circle_x = egui::lerp((rect.left() + radius)..=(rect.right() - radius), how_on);\n\n let center = egui::pos2(circle_x, rect.center().y);\n\n ui.painter()\n\n .circle(center, 0.75 * radius, visuals.bg_fill, visuals.fg_stroke);\n\n\n\n response\n\n}\n\n\n","file_path":"egui_demo_lib/src/apps/demo/toggle_switch.rs","rank":26,"score":293219.7925957732},{"content":"/// iOS-style toggle switch:\n\n///\n\n/// ``` text\n\n/// _____________\n\n/// / /.....\\\n\n/// | |.......|\n\n/// \\_______\\_____/\n\n/// ```\n\n///\n\n/// ## Example:\n\n/// ``` ignore\n\n/// toggle_ui(ui, &mut my_bool);\n\n/// ```\n\npub fn toggle_ui(ui: &mut egui::Ui, on: &mut bool) -> egui::Response {\n\n // Widget code can be broken up in four steps:\n\n // 1. Decide a size for the widget\n\n // 2. Allocate space for it\n\n // 3. Handle interactions with the widget (if any)\n\n // 4. Paint the widget\n\n\n\n // 1. Deciding widget size:\n\n // You can query the `ui` how much space is available,\n\n // but in this example we have a fixed size widget based on the height of a standard button:\n\n let desired_size = ui.spacing().interact_size.y * egui::vec2(2.0, 1.0);\n\n\n\n // 2. Allocating space:\n\n // This is where we get a region of the screen assigned.\n\n // We also tell the Ui to sense clicks in the allocated region.\n\n let (rect, mut response) = ui.allocate_exact_size(desired_size, egui::Sense::click());\n\n\n\n // 3. Interact: Time to check for clicks!\n\n if response.clicked() {\n\n *on = !*on;\n","file_path":"egui_demo_lib/src/apps/demo/toggle_switch.rs","rank":27,"score":289397.0496747466},{"content":"fn demo_ui(ui: &mut Ui) {\n\n ui.monospace(\"Example widgets:\");\n\n for _ in 0..3 {\n\n ui.label(\"label\");\n\n }\n\n for _ in 0..3 {\n\n let mut dummy = false;\n\n ui.checkbox(&mut dummy, \"checkbox\");\n\n }\n\n for _ in 0..3 {\n\n let _ = ui.button(\"button\");\n\n }\n\n}\n","file_path":"egui_demo_lib/src/apps/demo/layout_test.rs","rank":28,"score":284314.35728022165},{"content":"fn color_picker_hsvag_2d(ui: &mut Ui, hsva: &mut HsvaGamma, alpha: Alpha) {\n\n color_text_ui(ui, *hsva);\n\n\n\n if alpha == Alpha::BlendOrAdditive {\n\n // We signal additive blending by storing a negative alpha (a bit ironic).\n\n let a = &mut hsva.a;\n\n let mut additive = *a < 0.0;\n\n ui.horizontal(|ui| {\n\n ui.label(\"Blending:\");\n\n ui.radio_value(&mut additive, false, \"Normal\");\n\n ui.radio_value(&mut additive, true, \"Additive\");\n\n\n\n if additive {\n\n *a = -a.abs();\n\n }\n\n\n\n if !additive {\n\n *a = a.abs();\n\n }\n\n });\n","file_path":"egui/src/widgets/color_picker.rs","rank":29,"score":282221.69976555696},{"content":"fn pixel_test(ui: &mut Ui) {\n\n ui.label(\"Each subsequent square should be one physical pixel larger than the previous. They should be exactly one physical pixel apart. They should be perfectly aligned to the pixel grid.\");\n\n\n\n let pixels_per_point = ui.ctx().pixels_per_point();\n\n let num_squares: u32 = 8;\n\n let size_pixels = Vec2::new(\n\n ((num_squares + 1) * (num_squares + 2) / 2) as f32,\n\n num_squares as f32,\n\n );\n\n let size_points = size_pixels / pixels_per_point + Vec2::splat(2.0);\n\n let (response, painter) = ui.allocate_painter(size_points, Sense::hover());\n\n\n\n let mut cursor_pixel = Pos2::new(\n\n response.rect.min.x * pixels_per_point,\n\n response.rect.min.y * pixels_per_point,\n\n )\n\n .ceil();\n\n for size in 1..=num_squares {\n\n let rect_points = Rect::from_min_size(\n\n Pos2::new(\n\n cursor_pixel.x / pixels_per_point,\n\n cursor_pixel.y / pixels_per_point,\n\n ),\n\n Vec2::splat(size as f32) / pixels_per_point,\n\n );\n\n painter.rect_filled(rect_points, 0.0, egui::Color32::WHITE);\n\n cursor_pixel.x += (1 + size) as f32;\n\n }\n\n}\n","file_path":"egui_demo_lib/src/apps/color_test.rs","rank":30,"score":281426.69966376974},{"content":"pub fn adjust_colors(shape: &mut Shape, adjust_color: &impl Fn(&mut Color32)) {\n\n #![allow(clippy::match_same_arms)]\n\n match shape {\n\n Shape::Noop => {}\n\n Shape::Vec(shapes) => {\n\n for shape in shapes {\n\n adjust_colors(shape, adjust_color)\n\n }\n\n }\n\n Shape::Circle { fill, stroke, .. } => {\n\n adjust_color(fill);\n\n adjust_color(&mut stroke.color);\n\n }\n\n Shape::LineSegment { stroke, .. } => {\n\n adjust_color(&mut stroke.color);\n\n }\n\n Shape::Path { fill, stroke, .. } => {\n\n adjust_color(fill);\n\n adjust_color(&mut stroke.color);\n\n }\n","file_path":"epaint/src/shape_transform.rs","rank":31,"score":280810.2794342743},{"content":"fn max_scroll_bar_width_with_margin(ui: &Ui) -> f32 {\n\n ui.spacing().item_spacing.x + 16.0\n\n}\n","file_path":"egui/src/containers/scroll_area.rs","rank":32,"score":279106.300256946},{"content":"/// Shows a button with the given color.\n\n/// If the user clicks the button, a full color picker is shown.\n\npub fn color_edit_button_srgba(ui: &mut Ui, srgba: &mut Color32, alpha: Alpha) -> Response {\n\n // To ensure we keep hue slider when `srgba` is gray we store the\n\n // full `Hsva` in a cache:\n\n\n\n let mut hsva = ui\n\n .ctx()\n\n .memory()\n\n .data_temp\n\n .get_or_default::<Cache<Color32, Hsva>>()\n\n .get(srgba)\n\n .cloned()\n\n .unwrap_or_else(|| Hsva::from(*srgba));\n\n\n\n let response = color_edit_button_hsva(ui, &mut hsva, alpha);\n\n\n\n *srgba = Color32::from(hsva);\n\n\n\n ui.ctx()\n\n .memory()\n\n .data_temp\n\n .get_mut_or_default::<Cache<Color32, Hsva>>()\n\n .set(*srgba, hsva);\n\n\n\n response\n\n}\n","file_path":"egui/src/widgets/color_picker.rs","rank":33,"score":271122.8867873156},{"content":"pub fn color_edit_button_hsva(ui: &mut Ui, hsva: &mut Hsva, alpha: Alpha) -> Response {\n\n let pupup_id = ui.auto_id_with(\"popup\");\n\n let mut button_response = color_button(ui, (*hsva).into()).on_hover_text(\"Click to edit color\");\n\n\n\n if button_response.clicked() {\n\n ui.memory().toggle_popup(pupup_id);\n\n }\n\n // TODO: make it easier to show a temporary popup that closes when you click outside it\n\n if ui.memory().is_popup_open(pupup_id) {\n\n let area_response = Area::new(pupup_id)\n\n .order(Order::Foreground)\n\n .default_pos(button_response.rect.max)\n\n .show(ui.ctx(), |ui| {\n\n ui.spacing_mut().slider_width = 256.0;\n\n Frame::popup(ui.style()).show(ui, |ui| {\n\n if color_picker_hsva_2d(ui, hsva, alpha) {\n\n button_response.mark_changed();\n\n }\n\n });\n\n });\n","file_path":"egui/src/widgets/color_picker.rs","rank":34,"score":271116.7177644797},{"content":"fn huge_content_painter(ui: &mut egui::Ui) {\n\n // This is similar to the other demo, but is fully manual, for when you want to do custom painting.\n\n ui.label(\"A lot of rows, but only the visible ones are painted, so performance is still good:\");\n\n ui.add_space(4.0);\n\n\n\n let text_style = TextStyle::Body;\n\n let row_height = ui.fonts()[text_style].row_height() + ui.spacing().item_spacing.y;\n\n let num_rows = 10_000;\n\n\n\n ScrollArea::auto_sized().show_viewport(ui, |ui, viewport| {\n\n ui.set_height(row_height * num_rows as f32);\n\n\n\n let first_item = (viewport.min.y / row_height).floor().at_least(0.0) as usize;\n\n let last_item = (viewport.max.y / row_height).ceil() as usize + 1;\n\n let last_item = last_item.at_most(num_rows);\n\n\n\n for i in first_item..last_item {\n\n let indentation = (i % 100) as f32;\n\n let x = ui.min_rect().left() + indentation;\n\n let y = ui.min_rect().top() + i as f32 * row_height;\n","file_path":"egui_demo_lib/src/apps/demo/scrolling.rs","rank":35,"score":270334.2839303363},{"content":"/// Return true when arguments are the same within some rounding error.\n\n///\n\n/// For instance `almost_equal(x, x.to_degrees().to_radians(), f32::EPSILON)` should hold true for all x.\n\n/// The `epsilon` can be `f32::EPSILON` to handle simple transforms (like degrees -> radians)\n\n/// but should be higher to handle more complex transformations.\n\npub fn almost_equal(a: f32, b: f32, epsilon: f32) -> bool {\n\n if a == b {\n\n true // handle infinites\n\n } else {\n\n let abs_max = a.abs().max(b.abs());\n\n abs_max <= epsilon || ((a - b).abs() / abs_max) <= epsilon\n\n }\n\n}\n\n\n","file_path":"emath/src/lib.rs","rank":36,"score":262569.305860132},{"content":"fn pointer_pressed_on_area(ctx: &Context, layer_id: LayerId) -> bool {\n\n if let Some(pointer_pos) = ctx.input().pointer.interact_pos() {\n\n ctx.input().pointer.any_pressed() && ctx.layer_id_at(pointer_pos) == Some(layer_id)\n\n } else {\n\n false\n\n }\n\n}\n\n\n","file_path":"egui/src/containers/area.rs","rank":37,"score":257701.49247998136},{"content":"// A wrapper that allows the more idiomatic usage pattern: `ui.add(toggle(&mut my_bool))`\n\n/// iOS-style toggle switch.\n\n///\n\n/// ## Example:\n\n/// ``` ignore\n\n/// ui.add(toggle(&mut my_bool));\n\n/// ```\n\npub fn toggle(on: &mut bool) -> impl egui::Widget + '_ {\n\n move |ui: &mut egui::Ui| toggle_ui(ui, on)\n\n}\n\n\n","file_path":"egui_demo_lib/src/apps/demo/toggle_switch.rs","rank":38,"score":256252.35435519397},{"content":"fn paint_cursor_selection(ui: &mut Ui, pos: Pos2, galley: &Galley, cursorp: &CursorPair) {\n\n let color = ui.visuals().selection.bg_fill;\n\n if cursorp.is_empty() {\n\n return;\n\n }\n\n let [min, max] = cursorp.sorted();\n\n let min = min.rcursor;\n\n let max = max.rcursor;\n\n\n\n for ri in min.row..=max.row {\n\n let row = &galley.rows[ri];\n\n let left = if ri == min.row {\n\n row.x_offset(min.column)\n\n } else {\n\n row.min_x()\n\n };\n\n let right = if ri == max.row {\n\n row.x_offset(max.column)\n\n } else {\n\n let newline_size = if row.ends_with_newline {\n","file_path":"egui/src/widgets/text_edit.rs","rank":39,"score":253579.7511905129},{"content":"fn handle_radius(rect: &Rect) -> f32 {\n\n rect.height() / 2.5\n\n}\n\n\n","file_path":"egui/src/widgets/slider.rs","rank":40,"score":249995.16440015912},{"content":"fn paint_icon(painter: &Painter, rect: Rect, visuals: &WidgetVisuals) {\n\n let rect = Rect::from_center_size(\n\n rect.center(),\n\n vec2(rect.width() * 0.7, rect.height() * 0.45),\n\n );\n\n painter.add(Shape::closed_line(\n\n vec![rect.left_top(), rect.right_top(), rect.center_bottom()],\n\n visuals.fg_stroke,\n\n ));\n\n}\n","file_path":"egui/src/containers/combo_box.rs","rank":41,"score":247208.07721278223},{"content":"fn vertex_gradient(ui: &mut Ui, bg_fill: Color32, gradient: &Gradient) -> Response {\n\n use egui::epaint::*;\n\n let (rect, response) = ui.allocate_at_least(GRADIENT_SIZE, Sense::hover());\n\n if bg_fill != Default::default() {\n\n let mut mesh = Mesh::default();\n\n mesh.add_colored_rect(rect, bg_fill);\n\n ui.painter().add(Shape::mesh(mesh));\n\n }\n\n {\n\n let n = gradient.0.len();\n\n assert!(n >= 2);\n\n let mut mesh = Mesh::default();\n\n for (i, &color) in gradient.0.iter().enumerate() {\n\n let t = i as f32 / (n as f32 - 1.0);\n\n let x = lerp(rect.x_range(), t);\n\n mesh.colored_vertex(pos2(x, rect.top()), color);\n\n mesh.colored_vertex(pos2(x, rect.bottom()), color);\n\n if i < n - 1 {\n\n let i = i as u32;\n\n mesh.add_triangle(2 * i, 2 * i + 1, 2 * i + 2);\n\n mesh.add_triangle(2 * i + 1, 2 * i + 2, 2 * i + 3);\n\n }\n\n }\n\n ui.painter().add(Shape::mesh(mesh));\n\n }\n\n response\n\n}\n\n\n","file_path":"egui_demo_lib/src/apps/color_test.rs","rank":42,"score":243438.32937194032},{"content":"fn x_range(rect: &Rect) -> RangeInclusive<f32> {\n\n let handle_radius = handle_radius(rect);\n\n (rect.left() + handle_radius)..=(rect.right() - handle_radius)\n\n}\n\n\n\nimpl<'a> Slider<'a> {\n\n /// Just the slider, no text\n\n #[allow(clippy::unused_self)]\n\n fn allocate_slider_space(&self, ui: &mut Ui, height: f32) -> Response {\n\n let desired_size = vec2(ui.spacing().slider_width, height);\n\n ui.allocate_response(desired_size, Sense::click_and_drag())\n\n }\n\n\n\n /// Just the slider, no text\n\n fn slider_ui(&mut self, ui: &mut Ui, response: &Response) {\n\n let rect = &response.rect;\n\n let x_range = x_range(rect);\n\n\n\n if let Some(pointer_pos) = response.interact_pointer_pos() {\n\n let new_value = if self.smart_aim {\n","file_path":"egui/src/widgets/slider.rs","rank":43,"score":242482.0768925804},{"content":"/// All ranges in 0-1, rgb is linear.\n\npub fn hsv_from_rgb([r, g, b]: [f32; 3]) -> (f32, f32, f32) {\n\n #![allow(clippy::many_single_char_names)]\n\n let min = r.min(g.min(b));\n\n let max = r.max(g.max(b)); // value\n\n\n\n let range = max - min;\n\n\n\n let h = if max == min {\n\n 0.0 // hue is undefined\n\n } else if max == r {\n\n (g - b) / (6.0 * range)\n\n } else if max == g {\n\n (b - r) / (6.0 * range) + 1.0 / 3.0\n\n } else {\n\n // max == b\n\n (r - g) / (6.0 * range) + 2.0 / 3.0\n\n };\n\n let h = (h + 1.0).fract(); // wrap\n\n let s = if max == 0.0 { 0.0 } else { 1.0 - min / max };\n\n (h, s, max)\n\n}\n\n\n","file_path":"epaint/src/color.rs","rank":44,"score":242315.30373005875},{"content":"pub fn easy_mark_it<'em>(ui: &mut Ui, items: impl Iterator<Item = easy_mark::Item<'em>>) {\n\n ui.horizontal_wrapped(|ui| {\n\n ui.spacing_mut().item_spacing = Vec2::new(0.0, 0.0);\n\n ui.set_row_height(ui.fonts()[TextStyle::Body].row_height());\n\n\n\n for item in items {\n\n item_ui(ui, item);\n\n }\n\n });\n\n}\n\n\n","file_path":"egui_demo_lib/src/easy_mark/easy_mark_viewer.rs","rank":45,"score":240333.69801996058},{"content":"/// Wrap angle to `[-PI, PI]` range.\n\npub fn normalized_angle(mut angle: f32) -> f32 {\n\n use std::f32::consts::{PI, TAU};\n\n angle %= TAU;\n\n if angle > PI {\n\n angle -= TAU;\n\n } else if angle < -PI {\n\n angle += TAU;\n\n }\n\n angle\n\n}\n\n\n","file_path":"emath/src/lib.rs","rank":46,"score":237321.82842927641},{"content":"fn show_menu_bar(ui: &mut Ui) {\n\n trace!(ui);\n\n use egui::*;\n\n\n\n menu::bar(ui, |ui| {\n\n menu::menu(ui, \"File\", |ui| {\n\n if ui.button(\"Organize windows\").clicked() {\n\n ui.ctx().memory().reset_areas();\n\n }\n\n if ui\n\n .button(\"Clear egui memory\")\n\n .on_hover_text(\"Forget scroll, positions, sizes etc\")\n\n .clicked()\n\n {\n\n *ui.ctx().memory() = Default::default();\n\n }\n\n });\n\n });\n\n}\n","file_path":"egui_demo_lib/src/apps/demo/demo_app_windows.rs","rank":47,"score":233043.79009414837},{"content":"fn contrast_color(color: impl Into<Rgba>) -> Color32 {\n\n if color.into().intensity() < 0.5 {\n\n Color32::WHITE\n\n } else {\n\n Color32::BLACK\n\n }\n\n}\n\n\n\n/// Number of vertices per dimension in the color sliders.\n\n/// We need at least 6 for hues, and more for smooth 2D areas.\n\n/// Should always be a multiple of 6 to hit the peak hues in HSV/HSL (every 60°).\n\nconst N: u32 = 6 * 6;\n\n\n","file_path":"egui/src/widgets/color_picker.rs","rank":48,"score":231032.4193015113},{"content":"fn next_word_boundary_char_index(it: impl Iterator<Item = char>, mut index: usize) -> usize {\n\n let mut it = it.skip(index);\n\n if let Some(_first) = it.next() {\n\n index += 1;\n\n\n\n if let Some(second) = it.next() {\n\n index += 1;\n\n for next in it {\n\n if is_word_char(next) != is_word_char(second) {\n\n break;\n\n }\n\n index += 1;\n\n }\n\n }\n\n }\n\n index\n\n}\n\n\n","file_path":"egui/src/widgets/text_edit.rs","rank":49,"score":230858.20148835247},{"content":"/// Show a button to switch to/from dark/light mode (globally).\n\nfn dark_light_mode_switch(ui: &mut egui::Ui) {\n\n let style: egui::Style = (*ui.ctx().style()).clone();\n\n let new_visuals = style.visuals.light_dark_small_toggle_button(ui);\n\n if let Some(visuals) = new_visuals {\n\n ui.ctx().set_visuals(visuals);\n\n }\n\n}\n","file_path":"egui_demo_lib/src/wrap_app.rs","rank":50,"score":230687.35329764133},{"content":"fn huge_content_lines(ui: &mut egui::Ui) {\n\n ui.label(\n\n \"A lot of rows, but only the visible ones are layed out, so performance is still good:\",\n\n );\n\n ui.add_space(4.0);\n\n\n\n let text_style = TextStyle::Body;\n\n let row_height = ui.fonts()[text_style].row_height();\n\n let num_rows = 10_000;\n\n ScrollArea::auto_sized().show_rows(ui, row_height, num_rows, |ui, row_range| {\n\n for row in row_range {\n\n let text = format!(\"This is row {}/{}\", row + 1, num_rows);\n\n ui.label(text);\n\n }\n\n });\n\n}\n\n\n","file_path":"egui_demo_lib/src/apps/demo/scrolling.rs","rank":51,"score":230687.35329764133},{"content":"/// Password entry field with ability to toggle character hiding.\n\n///\n\n/// ## Example:\n\n/// ``` ignore\n\n/// password_ui(ui, &mut password);\n\n/// ```\n\npub fn password_ui(ui: &mut egui::Ui, text: &mut String) -> egui::Response {\n\n // This widget has its own state — show or hide password characters.\n\n\n\n // 1. Declare state struct\n\n // This struct represents the state of this widget.\n\n // It must implement at least `Clone` and be `'static`.\n\n // If you use the `persistence` feature, it also must implement `serde::{Deserialize, Serialize}`.\n\n // You should prefer creating custom newtype structs or enums like this, to avoid `TypeId`\n\n // intersection errors, especially when you use `Memory::data` without `Id`.\n\n #[derive(Clone, Copy, Default)]\n\n struct State(bool);\n\n\n\n // 2. Create id\n\n let id = ui.id().with(\"show_password\");\n\n\n\n // 3. Get state for this widget\n\n // You can read more about available `Memory` functions in the documentation of `egui::Memory`\n\n // struct and `egui::any` module.\n\n // You should get state by value, not by reference to avoid borrowing of `Memory`.\n\n let mut plaintext = *ui.memory().id_data_temp.get_or_default::<State>(id);\n","file_path":"egui_demo_lib/src/apps/demo/password.rs","rank":52,"score":229027.32060864696},{"content":"fn mul_color(color: Color32, factor: f32) -> Color32 {\n\n crate::epaint_assert!(0.0 <= factor && factor <= 1.0);\n\n // As an unfortunate side-effect of using premultiplied alpha\n\n // we need a somewhat expensive conversion to linear space and back.\n\n color.linear_multiply(factor)\n\n}\n\n\n\n// ----------------------------------------------------------------------------\n\n\n\n/// Converts [`Shape`]s into [`Mesh`].\n\npub struct Tessellator {\n\n options: TessellationOptions,\n\n /// Only used for culling\n\n clip_rect: Rect,\n\n scratchpad_points: Vec<Pos2>,\n\n scratchpad_path: Path,\n\n}\n\n\n\nimpl Tessellator {\n\n pub fn from_options(options: TessellationOptions) -> Self {\n","file_path":"epaint/src/tessellator.rs","rank":53,"score":227919.1353068523},{"content":"pub fn paint_resize_corner(ui: &mut Ui, response: &Response) {\n\n let stroke = ui.style().interact(response).fg_stroke;\n\n paint_resize_corner_with_style(ui, &response.rect, stroke, Align2::RIGHT_BOTTOM);\n\n}\n\n\n","file_path":"egui/src/containers/resize.rs","rank":54,"score":224941.77045303903},{"content":"pub fn canvas_size_in_points(canvas_id: &str) -> egui::Vec2 {\n\n let canvas = canvas_element(canvas_id).unwrap();\n\n let pixels_per_point = native_pixels_per_point();\n\n egui::vec2(\n\n canvas.width() as f32 / pixels_per_point,\n\n canvas.height() as f32 / pixels_per_point,\n\n )\n\n}\n\n\n","file_path":"egui_web/src/lib.rs","rank":55,"score":217922.32834867778},{"content":"/// All ranges in 0-1, rgb is linear.\n\npub fn rgb_from_hsv((h, s, v): (f32, f32, f32)) -> [f32; 3] {\n\n #![allow(clippy::many_single_char_names)]\n\n let h = (h.fract() + 1.0).fract(); // wrap\n\n let s = s.clamp(0.0, 1.0);\n\n\n\n let f = h * 6.0 - (h * 6.0).floor();\n\n let p = v * (1.0 - s);\n\n let q = v * (1.0 - f * s);\n\n let t = v * (1.0 - (1.0 - f) * s);\n\n\n\n match (h * 6.0).floor() as i32 % 6 {\n\n 0 => [v, t, p],\n\n 1 => [q, v, p],\n\n 2 => [p, v, t],\n\n 3 => [p, q, v],\n\n 4 => [t, p, v],\n\n 5 => [v, p, q],\n\n _ => unreachable!(),\n\n }\n\n}\n\n\n","file_path":"epaint/src/color.rs","rank":56,"score":216750.57900517806},{"content":"/// Alternative to `FileStorage`\n\npub fn read_memory(ctx: &egui::Context, memory_file_path: impl AsRef<std::path::Path>) {\n\n let memory: Option<egui::Memory> = read_ron(memory_file_path);\n\n if let Some(memory) = memory {\n\n *ctx.memory() = memory;\n\n }\n\n}\n\n\n","file_path":"egui_glium/src/persistence.rs","rank":57,"score":215671.72584753655},{"content":"/// Parse and display a VERY simple and small subset of Markdown.\n\npub fn easy_mark(ui: &mut Ui, easy_mark: &str) {\n\n easy_mark_it(ui, easy_mark::Parser::new(easy_mark))\n\n}\n\n\n","file_path":"egui_demo_lib/src/easy_mark/easy_mark_viewer.rs","rank":58,"score":213828.59729024785},{"content":"fn move_single_cursor(cursor: &mut Cursor, galley: &Galley, key: Key, modifiers: &Modifiers) {\n\n match key {\n\n Key::ArrowLeft => {\n\n if modifiers.alt || modifiers.ctrl {\n\n // alt on mac, ctrl on windows\n\n *cursor = galley.from_ccursor(ccursor_previous_word(&galley.text, cursor.ccursor));\n\n } else if modifiers.mac_cmd {\n\n *cursor = galley.cursor_begin_of_row(cursor);\n\n } else {\n\n *cursor = galley.cursor_left_one_character(cursor);\n\n }\n\n }\n\n Key::ArrowRight => {\n\n if modifiers.alt || modifiers.ctrl {\n\n // alt on mac, ctrl on windows\n\n *cursor = galley.from_ccursor(ccursor_next_word(&galley.text, cursor.ccursor));\n\n } else if modifiers.mac_cmd {\n\n *cursor = galley.cursor_end_of_row(cursor);\n\n } else {\n\n *cursor = galley.cursor_right_one_character(cursor);\n","file_path":"egui/src/widgets/text_edit.rs","rank":59,"score":213416.29967451934},{"content":"/// linear [0, 1] -> gamma [0, 1] (not clamped).\n\n/// Works for numbers outside this range (e.g. negative numbers).\n\npub fn gamma_from_linear(linear: f32) -> f32 {\n\n if linear < 0.0 {\n\n -gamma_from_linear(-linear)\n\n } else if linear <= 0.0031308 {\n\n 12.92 * linear\n\n } else {\n\n 1.055 * linear.powf(1.0 / 2.4) - 0.055\n\n }\n\n}\n\n\n\n// ----------------------------------------------------------------------------\n\n\n\n/// Hue, saturation, value, alpha. All in the range [0, 1].\n\n/// No premultiplied alpha.\n\n#[derive(Clone, Copy, Debug, Default, PartialEq)]\n\npub struct Hsva {\n\n /// hue 0-1\n\n pub h: f32,\n\n /// saturation 0-1\n\n pub s: f32,\n","file_path":"epaint/src/color.rs","rank":60,"score":212971.53256515547},{"content":"/// gamma [0, 1] -> linear [0, 1] (not clamped).\n\n/// Works for numbers outside this range (e.g. negative numbers).\n\npub fn linear_from_gamma(gamma: f32) -> f32 {\n\n if gamma < 0.0 {\n\n -linear_from_gamma(-gamma)\n\n } else if gamma <= 0.04045 {\n\n gamma / 12.92\n\n } else {\n\n ((gamma + 0.055) / 1.055).powf(2.4)\n\n }\n\n}\n\n\n","file_path":"epaint/src/color.rs","rank":61,"score":212971.53256515547},{"content":"pub fn item_ui(ui: &mut Ui, item: easy_mark::Item<'_>) {\n\n let row_height = ui.fonts()[TextStyle::Body].row_height();\n\n let one_indent = row_height / 2.0;\n\n\n\n match item {\n\n easy_mark::Item::Newline => {\n\n // ui.label(\"\\n\"); // too much spacing (paragraph spacing)\n\n ui.allocate_exact_size(vec2(0.0, row_height), Sense::hover()); // make sure we take up some height\n\n ui.end_row();\n\n ui.set_row_height(row_height);\n\n }\n\n\n\n easy_mark::Item::Text(style, text) => {\n\n ui.add(label_from_style(text, &style));\n\n }\n\n easy_mark::Item::Hyperlink(style, text, url) => {\n\n let label = label_from_style(text, &style);\n\n ui.add(Hyperlink::from_label_and_url(label, url));\n\n }\n\n\n","file_path":"egui_demo_lib/src/easy_mark/easy_mark_viewer.rs","rank":62,"score":211698.87276590505},{"content":"pub fn resize_canvas_to_screen_size(canvas_id: &str, max_size_points: egui::Vec2) -> Option<()> {\n\n let canvas = canvas_element(canvas_id)?;\n\n\n\n let screen_size_points = screen_size_in_native_points()?;\n\n let pixels_per_point = native_pixels_per_point();\n\n\n\n let max_size_pixels = pixels_per_point * max_size_points;\n\n\n\n let canvas_size_pixels = pixels_per_point * screen_size_points;\n\n let canvas_size_pixels = canvas_size_pixels.min(max_size_pixels);\n\n let canvas_size_points = canvas_size_pixels / pixels_per_point;\n\n\n\n // Make sure that the height and width are always even numbers.\n\n // otherwise, the page renders blurry on some platforms.\n\n // See https://github.com/emilk/egui/issues/103\n\n fn round_to_even(v: f32) -> f32 {\n\n (v / 2.0).round() * 2.0\n\n }\n\n\n\n canvas\n","file_path":"egui_web/src/lib.rs","rank":63,"score":210463.45357401326},{"content":"fn set_open(open: &mut BTreeSet<String>, key: &'static str, is_open: bool) {\n\n if is_open {\n\n if !open.contains(key) {\n\n open.insert(key.to_owned());\n\n }\n\n } else {\n\n open.remove(key);\n\n }\n\n}\n\n\n\n// ----------------------------------------------------------------------------\n\n\n\n/// A menu bar in which you can select different demo windows to show.\n\n#[derive(Default)]\n\n#[cfg_attr(feature = \"persistence\", derive(serde::Deserialize, serde::Serialize))]\n\n#[cfg_attr(feature = \"persistence\", serde(default))]\n\npub struct DemoWindows {\n\n demos: Demos,\n\n tests: Tests,\n\n}\n","file_path":"egui_demo_lib/src/apps/demo/demo_app_windows.rs","rank":64,"score":207490.4422496751},{"content":"fn clock_button(ui: &mut egui::Ui, seconds_since_midnight: f64) -> egui::Response {\n\n let time = seconds_since_midnight;\n\n let time = format!(\n\n \"{:02}:{:02}:{:02}.{:02}\",\n\n (time % (24.0 * 60.0 * 60.0) / 3600.0).floor(),\n\n (time % (60.0 * 60.0) / 60.0).floor(),\n\n (time % 60.0).floor(),\n\n (time % 1.0 * 100.0).floor()\n\n );\n\n\n\n ui.add(egui::Button::new(time).text_style(egui::TextStyle::Monospace))\n\n}\n\n\n","file_path":"egui_demo_lib/src/wrap_app.rs","rank":65,"score":206955.59565958838},{"content":"pub fn label(ui: &mut Ui, alloc_info: &epaint::stats::AllocInfo, what: &str) -> Response {\n\n ui.add(Label::new(alloc_info.format(what)).wrap(false))\n\n}\n\n\n\nimpl Widget for &mut epaint::TessellationOptions {\n\n fn ui(self, ui: &mut Ui) -> Response {\n\n ui.vertical(|ui| {\n\n let epaint::TessellationOptions {\n\n pixels_per_point: _,\n\n aa_size: _,\n\n anti_alias,\n\n coarse_tessellation_culling,\n\n debug_paint_clip_rects,\n\n debug_paint_text_rects,\n\n debug_ignore_clip_rects,\n\n } = self;\n\n ui.checkbox(anti_alias, \"Antialias\");\n\n ui.checkbox(\n\n coarse_tessellation_culling,\n\n \"Do coarse culling in the tessellator\",\n","file_path":"egui/src/introspection.rs","rank":66,"score":202630.20317113682},{"content":"fn megabytes(size: usize) -> String {\n\n format!(\"{:.2} MB\", size as f64 / 1e6)\n\n}\n","file_path":"epaint/src/stats.rs","rank":67,"score":201299.49303948836},{"content":"/// linear [0, 1] -> gamma [0, 255] (clamped).\n\n/// Values outside this range will be clamped to the range.\n\npub fn gamma_u8_from_linear_f32(l: f32) -> u8 {\n\n if l <= 0.0 {\n\n 0\n\n } else if l <= 0.0031308 {\n\n (3294.6 * l).round() as u8\n\n } else if l <= 1.0 {\n\n (269.025 * l.powf(1.0 / 2.4) - 14.025).round() as u8\n\n } else {\n\n 255\n\n }\n\n}\n\n\n\n/// linear [0, 1] -> linear [0, 255] (clamped).\n\n/// Useful for alpha-channel.\n","file_path":"epaint/src/color.rs","rank":68,"score":200346.5979814853},{"content":"#[inline(always)]\n\npub fn linear_u8_from_linear_f32(a: f32) -> u8 {\n\n (a * 255.0).round() as u8 // rust does a saturating cast since 1.45\n\n}\n\n\n","file_path":"epaint/src/color.rs","rank":69,"score":200346.5979814853},{"content":"#[inline(always)]\n\npub fn linear_f32_from_linear_u8(a: u8) -> f32 {\n\n a as f32 / 255.0\n\n}\n\n\n","file_path":"epaint/src/color.rs","rank":70,"score":200346.5979814853},{"content":"/// gamma [0, 255] -> linear [0, 1].\n\npub fn linear_f32_from_gamma_u8(s: u8) -> f32 {\n\n if s <= 10 {\n\n s as f32 / 3294.6\n\n } else {\n\n ((s as f32 + 14.025) / 269.025).powf(2.4)\n\n }\n\n}\n\n\n\n/// linear [0, 255] -> linear [0, 1].\n\n/// Useful for alpha-channel.\n","file_path":"epaint/src/color.rs","rank":71,"score":200346.5979814853},{"content":"fn move_and_resize_window(ctx: &Context, window_interaction: &WindowInteraction) -> Option<Rect> {\n\n window_interaction.set_cursor(ctx);\n\n let pointer_pos = ctx.input().pointer.interact_pos()?;\n\n let mut rect = window_interaction.start_rect; // prevent drift\n\n\n\n if window_interaction.is_resize() {\n\n if window_interaction.left {\n\n rect.min.x = ctx.round_to_pixel(pointer_pos.x);\n\n } else if window_interaction.right {\n\n rect.max.x = ctx.round_to_pixel(pointer_pos.x);\n\n }\n\n\n\n if window_interaction.top {\n\n rect.min.y = ctx.round_to_pixel(pointer_pos.y);\n\n } else if window_interaction.bottom {\n\n rect.max.y = ctx.round_to_pixel(pointer_pos.y);\n\n }\n\n } else {\n\n // Movement.\n\n\n","file_path":"egui/src/containers/window.rs","rank":72,"score":198880.32687673485},{"content":"// A wrapper that allows the more idiomatic usage pattern: `ui.add(...)`\n\n/// Password entry field with ability to toggle character hiding.\n\n///\n\n/// ## Example:\n\n/// ``` ignore\n\n/// ui.add(password(&mut password));\n\n/// ```\n\npub fn password(text: &mut String) -> impl egui::Widget + '_ {\n\n move |ui: &mut egui::Ui| password_ui(ui, text)\n\n}\n\n\n","file_path":"egui_demo_lib/src/apps/demo/password.rs","rank":73,"score":190864.305842794},{"content":"fn delete_selected_ccursor_range<S: TextBuffer>(text: &mut S, [min, max]: [CCursor; 2]) -> CCursor {\n\n text.delete_char_range(min.index..max.index);\n\n CCursor {\n\n index: min.index,\n\n prefer_next_row: true,\n\n }\n\n}\n\n\n","file_path":"egui/src/widgets/text_edit.rs","rank":74,"score":185719.3219992062},{"content":"fn decrease_identation<S: TextBuffer>(ccursor: &mut CCursor, text: &mut S) {\n\n let line_start = find_line_start(text.as_ref(), *ccursor);\n\n\n\n let remove_len = if text.as_ref()[line_start.index..].starts_with('\\t') {\n\n Some(1)\n\n } else if text.as_ref()[line_start.index..]\n\n .chars()\n\n .take(text::TAB_SIZE)\n\n .all(|c| c == ' ')\n\n {\n\n Some(text::TAB_SIZE)\n\n } else {\n\n None\n\n };\n\n\n\n if let Some(len) = remove_len {\n\n text.delete_char_range(line_start.index..(line_start.index + len));\n\n if *ccursor != line_start {\n\n *ccursor -= len;\n\n }\n\n }\n\n}\n","file_path":"egui/src/widgets/text_edit.rs","rank":75,"score":182959.6558744192},{"content":"pub fn screen_size_in_native_points() -> Option<egui::Vec2> {\n\n let window = web_sys::window()?;\n\n Some(egui::Vec2::new(\n\n window.inner_width().ok()?.as_f64()? as f32,\n\n window.inner_height().ok()?.as_f64()? as f32,\n\n ))\n\n}\n\n\n","file_path":"egui_web/src/lib.rs","rank":76,"score":182944.19914087895},{"content":"fn tint_shape_towards(shape: &mut Shape, target: Color32) {\n\n epaint::shape_transform::adjust_colors(shape, &|color| {\n\n *color = crate::color::tint_color_towards(*color, target);\n\n });\n\n}\n","file_path":"egui/src/painter.rs","rank":77,"score":181804.40375164352},{"content":"// Move text agent to text cursor's position, on desktop/laptop,\n\n// candidate window moves following text element (agent),\n\n// so it appears that the IME candidate window moves with text cursor.\n\n// On mobile devices, there is no need to do that.\n\nfn move_text_cursor(cursor: &Option<egui::Pos2>, canvas_id: &str) -> Option<()> {\n\n let style = text_agent().style();\n\n // Note: movint agent on mobile devices will lead to unpredictable scroll.\n\n if is_mobile() == Some(false) {\n\n cursor.as_ref().and_then(|&egui::Pos2 { x, y }| {\n\n let canvas = canvas_element(canvas_id)?;\n\n let y = y + (canvas.scroll_top() + canvas.offset_top()) as f32;\n\n let x = x + (canvas.scroll_left() + canvas.offset_left()) as f32;\n\n // Canvas is translated 50% horizontally in html.\n\n let x = x - canvas.offset_width() as f32 / 2.0;\n\n style.set_property(\"position\", \"absolute\").ok()?;\n\n style.set_property(\"top\", &(y.to_string() + \"px\")).ok()?;\n\n style.set_property(\"left\", &(x.to_string() + \"px\")).ok()\n\n })\n\n } else {\n\n style.set_property(\"position\", \"absolute\").ok()?;\n\n style.set_property(\"top\", \"0px\").ok()?;\n\n style.set_property(\"left\", \"0px\").ok()\n\n }\n\n}\n","file_path":"egui_web/src/lib.rs","rank":78,"score":180237.64206273062},{"content":"pub fn screen_size_in_pixels(display: &glium::Display) -> Vec2 {\n\n let (width_in_pixels, height_in_pixels) = display.get_framebuffer_dimensions();\n\n vec2(width_in_pixels as f32, height_in_pixels as f32)\n\n}\n\n\n","file_path":"egui_glium/src/lib.rs","rank":79,"score":180016.82124804464},{"content":"// TODO: improve and standardize `slider_vec2`\n\nfn slider_vec2<'a>(\n\n value: &'a mut Vec2,\n\n range: std::ops::RangeInclusive<f32>,\n\n text: &'a str,\n\n) -> impl Widget + 'a {\n\n move |ui: &mut crate::Ui| {\n\n ui.horizontal(|ui| {\n\n ui.add(Slider::new(&mut value.x, range.clone()).text(\"w\"));\n\n ui.add(Slider::new(&mut value.y, range.clone()).text(\"h\"));\n\n ui.label(text);\n\n })\n\n .response\n\n }\n\n}\n\n\n","file_path":"egui/src/style.rs","rank":80,"score":177775.37319783468},{"content":"#[cfg(feature = \"syntect\")]\n\nstruct ColoredText(Vec<Vec<(syntect::highlighting::Style, String)>>);\n\n\n\n#[cfg(feature = \"syntect\")]\n\nimpl ColoredText {\n\n /// e.g. `text_with_extension(\"fn foo() {}\", \"rs\")`\n\n pub fn text_with_extension(text: &str, extension: &str) -> Option<ColoredText> {\n\n use syntect::easy::HighlightLines;\n\n use syntect::highlighting::ThemeSet;\n\n use syntect::parsing::SyntaxSet;\n\n use syntect::util::LinesWithEndings;\n\n\n\n let ps = SyntaxSet::load_defaults_newlines(); // should be cached and reused\n\n let ts = ThemeSet::load_defaults(); // should be cached and reused\n\n\n\n let syntax = ps.find_syntax_by_extension(extension)?;\n\n\n\n let mut h = HighlightLines::new(syntax, &ts.themes[\"base16-mocha.dark\"]);\n\n\n\n let lines = LinesWithEndings::from(text)\n\n .map(|line| {\n","file_path":"egui_demo_lib/src/apps/http_app.rs","rank":81,"score":174179.6246202818},{"content":"fn insert_text<S: TextBuffer>(ccursor: &mut CCursor, text: &mut S, text_to_insert: &str) {\n\n ccursor.index += text.insert_text(text_to_insert, ccursor.index);\n\n}\n\n\n\n// ----------------------------------------------------------------------------\n\n\n","file_path":"egui/src/widgets/text_edit.rs","rank":82,"score":173138.44605971093},{"content":"fn delete_selected<S: TextBuffer>(text: &mut S, cursorp: &CursorPair) -> CCursor {\n\n let [min, max] = cursorp.sorted();\n\n delete_selected_ccursor_range(text, [min.ccursor, max.ccursor])\n\n}\n\n\n","file_path":"egui/src/widgets/text_edit.rs","rank":83,"score":170797.38162102585},{"content":"#[derive(Clone)]\n\nstruct Flux<State> {\n\n start_time: f64,\n\n latest_change_time: f64,\n\n latest_state: State,\n\n}\n\n\n\nimpl<State> Undoer<State>\n\nwhere\n\n State: Clone + PartialEq,\n\n{\n\n /// Do we have an undo point different from the given state?\n\n pub fn has_undo(&self, current_state: &State) -> bool {\n\n match self.undos.len() {\n\n 0 => false,\n\n 1 => self.undos.back() != Some(current_state),\n\n _ => true,\n\n }\n\n }\n\n\n\n /// Return true if the state is currently changing\n","file_path":"egui/src/util/undoer.rs","rank":84,"score":170572.39352899988},{"content":"fn clamp_to_range(x: f32, range: RangeInclusive<f32>) -> f32 {\n\n x.clamp(\n\n range.start().min(*range.end()),\n\n range.start().max(*range.end()),\n\n )\n\n}\n","file_path":"egui/src/containers/panel.rs","rank":85,"score":169702.21881603982},{"content":"fn delete_previous_char<S: TextBuffer>(text: &mut S, ccursor: CCursor) -> CCursor {\n\n if ccursor.index > 0 {\n\n let max_ccursor = ccursor;\n\n let min_ccursor = max_ccursor - 1;\n\n delete_selected_ccursor_range(text, [min_ccursor, max_ccursor])\n\n } else {\n\n ccursor\n\n }\n\n}\n\n\n","file_path":"egui/src/widgets/text_edit.rs","rank":86,"score":168796.92775360297},{"content":"fn delete_next_char<S: TextBuffer>(text: &mut S, ccursor: CCursor) -> CCursor {\n\n delete_selected_ccursor_range(text, [ccursor, ccursor + 1])\n\n}\n\n\n","file_path":"egui/src/widgets/text_edit.rs","rank":87,"score":168796.92775360297},{"content":"fn delete_next_word<S: TextBuffer>(text: &mut S, min_ccursor: CCursor) -> CCursor {\n\n let max_ccursor = ccursor_next_word(text.as_ref(), min_ccursor);\n\n delete_selected_ccursor_range(text, [min_ccursor, max_ccursor])\n\n}\n\n\n","file_path":"egui/src/widgets/text_edit.rs","rank":88,"score":166862.85358750433},{"content":"fn delete_previous_word<S: TextBuffer>(text: &mut S, max_ccursor: CCursor) -> CCursor {\n\n let min_ccursor = ccursor_previous_word(text.as_ref(), max_ccursor);\n\n delete_selected_ccursor_range(text, [min_ccursor, max_ccursor])\n\n}\n\n\n","file_path":"egui/src/widgets/text_edit.rs","rank":89,"score":166862.85358750433},{"content":"pub fn read_ron<T>(ron_path: impl AsRef<Path>) -> Option<T>\n\nwhere\n\n T: serde::de::DeserializeOwned,\n\n{\n\n match std::fs::File::open(ron_path) {\n\n Ok(file) => {\n\n let reader = std::io::BufReader::new(file);\n\n match ron::de::from_reader(reader) {\n\n Ok(value) => Some(value),\n\n Err(err) => {\n\n eprintln!(\"ERROR: Failed to parse RON: {}\", err);\n\n None\n\n }\n\n }\n\n }\n\n Err(_err) => {\n\n // File probably doesn't exist. That's fine.\n\n None\n\n }\n\n }\n\n}\n\n// ----------------------------------------------------------------------------\n\n\n","file_path":"egui_glium/src/persistence.rs","rank":90,"score":165057.0376474284},{"content":"/// If context is running under mobile device?\n\nfn is_mobile() -> Option<bool> {\n\n let user_agent = web_sys::window()?.navigator().user_agent().ok()?;\n\n let is_mobile = MOBILE_DEVICE.iter().any(|&name| user_agent.contains(name));\n\n Some(is_mobile)\n\n}\n\n\n","file_path":"egui_web/src/lib.rs","rank":91,"score":158198.21247841945},{"content":"fn label_from_style(text: &str, style: &easy_mark::Style) -> Label {\n\n let easy_mark::Style {\n\n heading,\n\n quoted,\n\n code,\n\n strong,\n\n underline,\n\n strikethrough,\n\n italics,\n\n small,\n\n raised,\n\n } = *style;\n\n\n\n let small = small || raised; // Raised text is also smaller\n\n\n\n let mut label = Label::new(text);\n\n if heading && !small {\n\n label = label.heading().strong();\n\n }\n\n if small && !heading {\n","file_path":"egui_demo_lib/src/easy_mark/easy_mark_viewer.rs","rank":92,"score":156494.0846761277},{"content":"pub fn set_cursor_icon(cursor: egui::CursorIcon) -> Option<()> {\n\n let document = web_sys::window()?.document()?;\n\n document\n\n .body()?\n\n .style()\n\n .set_property(\"cursor\", cursor_web_name(cursor))\n\n .ok()\n\n}\n\n\n","file_path":"egui_web/src/lib.rs","rank":93,"score":155633.01376496477},{"content":"fn cursor_web_name(cursor: egui::CursorIcon) -> &'static str {\n\n match cursor {\n\n egui::CursorIcon::Alias => \"alias\",\n\n egui::CursorIcon::AllScroll => \"all-scroll\",\n\n egui::CursorIcon::Cell => \"cell\",\n\n egui::CursorIcon::ContextMenu => \"context-menu\",\n\n egui::CursorIcon::Copy => \"copy\",\n\n egui::CursorIcon::Crosshair => \"crosshair\",\n\n egui::CursorIcon::Default => \"default\",\n\n egui::CursorIcon::Grab => \"grab\",\n\n egui::CursorIcon::Grabbing => \"grabbing\",\n\n egui::CursorIcon::Help => \"help\",\n\n egui::CursorIcon::Move => \"move\",\n\n egui::CursorIcon::NoDrop => \"no-drop\",\n\n egui::CursorIcon::None => \"none\",\n\n egui::CursorIcon::NotAllowed => \"not-allowed\",\n\n egui::CursorIcon::PointingHand => \"pointer\",\n\n egui::CursorIcon::Progress => \"progress\",\n\n egui::CursorIcon::ResizeHorizontal => \"ew-resize\",\n\n egui::CursorIcon::ResizeNeSw => \"nesw-resize\",\n\n egui::CursorIcon::ResizeNwSe => \"nwse-resize\",\n\n egui::CursorIcon::ResizeVertical => \"ns-resize\",\n\n egui::CursorIcon::Text => \"text\",\n\n egui::CursorIcon::VerticalText => \"vertical-text\",\n\n egui::CursorIcon::Wait => \"wait\",\n\n egui::CursorIcon::ZoomIn => \"zoom-in\",\n\n egui::CursorIcon::ZoomOut => \"zoom-out\",\n\n }\n\n}\n\n\n","file_path":"egui_web/src/lib.rs","rank":94,"score":155633.01376496477},{"content":"fn is_integer(f: f64) -> bool {\n\n f.round() == f\n\n}\n\n\n","file_path":"emath/src/smart_aim.rs","rank":95,"score":154583.46079302934},{"content":"#[inline]\n\nfn is_chinese(c: char) -> bool {\n\n ('\\u{4E00}' <= c && c <= '\\u{9FFF}')\n\n || ('\\u{3400}' <= c && c <= '\\u{4DBF}')\n\n || ('\\u{2B740}' <= c && c <= '\\u{2B81F}')\n\n}\n\n\n","file_path":"epaint/src/text/font.rs","rank":96,"score":154583.46079302934},{"content":"/// Cheap and ugly.\n\n/// Made for graying out disabled `Ui`:s.\n\npub fn tint_color_towards(color: Color32, target: Color32) -> Color32 {\n\n let [mut r, mut g, mut b, mut a] = color.to_array();\n\n\n\n if a == 0 {\n\n r /= 2;\n\n g /= 2;\n\n b /= 2;\n\n } else if a < 170 {\n\n // Cheapish and looks ok.\n\n // Works for e.g. grid stripes.\n\n let div = (2 * 255 / a as i32) as u8;\n\n r = r / 2 + target.r() / div;\n\n g = g / 2 + target.g() / div;\n\n b = b / 2 + target.b() / div;\n\n a /= 2;\n\n } else {\n\n r = r / 2 + target.r() / 2;\n\n g = g / 2 + target.g() / 2;\n\n b = b / 2 + target.b() / 2;\n\n }\n","file_path":"epaint/src/color.rs","rank":97,"score":154197.5456467208},{"content":"#[inline]\n\nfn invisible_char(c: char) -> bool {\n\n // See https://github.com/emilk/egui/issues/336\n\n\n\n // From https://www.fileformat.info/info/unicode/category/Cf/list.htm\n\n ('\\u{200B}'..='\\u{206F}').contains(&c) // TODO: heed bidi characters\n\n}\n\n\n","file_path":"epaint/src/text/font.rs","rank":98,"score":152402.6618448578},{"content":"#[derive(Default)]\n\nstruct TextureManager(HashMap<Gradient, TextureId>);\n\n\n\nimpl TextureManager {\n\n fn get(\n\n &mut self,\n\n tex_allocator: &mut dyn epi::TextureAllocator,\n\n gradient: &Gradient,\n\n ) -> TextureId {\n\n *self.0.entry(gradient.clone()).or_insert_with(|| {\n\n let pixels = gradient.to_pixel_row();\n\n let width = pixels.len();\n\n let height = 1;\n\n tex_allocator.alloc_srgba_premultiplied((width, height), &pixels)\n\n })\n\n }\n\n}\n\n\n","file_path":"egui_demo_lib/src/apps/color_test.rs","rank":99,"score":152171.14804814168}],"string":"[\n {\n \"content\": \"pub fn show_tooltip_under(ctx: &CtxRef, id: Id, rect: &Rect, add_contents: impl FnOnce(&mut Ui)) {\\n\\n show_tooltip_at(\\n\\n ctx,\\n\\n id,\\n\\n Some(rect.left_bottom() + vec2(-2.0, 4.0)),\\n\\n add_contents,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/containers/popup.rs\",\n \"rank\": 0,\n \"score\": 496410.7242350833\n },\n {\n \"content\": \"/// Show a tooltip at the current pointer position (if any).\\n\\n///\\n\\n/// Most of the time it is easier to use [`Response::on_hover_ui`].\\n\\n///\\n\\n/// See also [`show_tooltip_text`].\\n\\n///\\n\\n/// ```\\n\\n/// # let mut ui = egui::Ui::__test();\\n\\n/// if ui.ui_contains_pointer() {\\n\\n/// egui::show_tooltip(ui.ctx(), egui::Id::new(\\\"my_tooltip\\\"), |ui| {\\n\\n/// ui.label(\\\"Helpful text\\\");\\n\\n/// });\\n\\n/// }\\n\\n/// ```\\n\\npub fn show_tooltip(ctx: &CtxRef, id: Id, add_contents: impl FnOnce(&mut Ui)) {\\n\\n show_tooltip_at_pointer(ctx, id, add_contents)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/containers/popup.rs\",\n \"rank\": 1,\n \"score\": 435091.79898475885\n },\n {\n \"content\": \"pub fn show_color(ui: &mut Ui, color: impl Into<Hsva>, desired_size: Vec2) -> Response {\\n\\n show_hsva(ui, color.into(), desired_size)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/color_picker.rs\",\n \"rank\": 2,\n \"score\": 435078.4534569054\n },\n {\n \"content\": \"fn color_slider_1d(ui: &mut Ui, value: &mut f32, color_at: impl Fn(f32) -> Color32) -> Response {\\n\\n #![allow(clippy::identity_op)]\\n\\n\\n\\n let desired_size = vec2(\\n\\n ui.spacing().slider_width,\\n\\n ui.spacing().interact_size.y * 2.0,\\n\\n );\\n\\n let (rect, response) = ui.allocate_at_least(desired_size, Sense::click_and_drag());\\n\\n\\n\\n if let Some(mpos) = response.interact_pointer_pos() {\\n\\n *value = remap_clamp(mpos.x, rect.left()..=rect.right(), 0.0..=1.0);\\n\\n }\\n\\n\\n\\n let visuals = ui.style().interact(&response);\\n\\n\\n\\n background_checkers(ui.painter(), rect); // for alpha:\\n\\n\\n\\n {\\n\\n // fill color:\\n\\n let mut mesh = Mesh::default();\\n\",\n \"file_path\": \"egui/src/widgets/color_picker.rs\",\n \"rank\": 3,\n \"score\": 434817.4546166628\n },\n {\n \"content\": \"pub fn show_tooltip_at_pointer(ctx: &CtxRef, id: Id, add_contents: impl FnOnce(&mut Ui)) {\\n\\n let suggested_pos = ctx\\n\\n .input()\\n\\n .pointer\\n\\n .hover_pos()\\n\\n .map(|pointer_pos| pointer_pos + vec2(16.0, 16.0));\\n\\n show_tooltip_at(ctx, id, suggested_pos, add_contents)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/containers/popup.rs\",\n \"rank\": 4,\n \"score\": 431105.3235280281\n },\n {\n \"content\": \"pub fn paint_resize_corner_with_style(ui: &mut Ui, rect: &Rect, stroke: Stroke, corner: Align2) {\\n\\n let painter = ui.painter();\\n\\n let cp = painter.round_pos_to_pixels(corner.pos_in_rect(rect));\\n\\n let mut w = 2.0;\\n\\n\\n\\n while w <= rect.width() && w <= rect.height() {\\n\\n painter.line_segment(\\n\\n [\\n\\n pos2(cp.x - w * corner.x().to_sign(), cp.y),\\n\\n pos2(cp.x, cp.y - w * corner.y().to_sign()),\\n\\n ],\\n\\n stroke,\\n\\n );\\n\\n w += 4.0;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"egui/src/containers/resize.rs\",\n \"rank\": 5,\n \"score\": 406946.1417069399\n },\n {\n \"content\": \"fn show_hsva(ui: &mut Ui, color: Hsva, desired_size: Vec2) -> Response {\\n\\n let (rect, response) = ui.allocate_at_least(desired_size, Sense::hover());\\n\\n background_checkers(ui.painter(), rect);\\n\\n if true {\\n\\n let left = Rect::from_min_max(rect.left_top(), rect.center_bottom());\\n\\n let right = Rect::from_min_max(rect.center_top(), rect.right_bottom());\\n\\n ui.painter().rect_filled(left, 0.0, color);\\n\\n ui.painter().rect_filled(right, 0.0, color.to_opaque());\\n\\n } else {\\n\\n ui.painter().add(Shape::Rect {\\n\\n rect,\\n\\n corner_radius: 2.0,\\n\\n fill: color.into(),\\n\\n stroke: Stroke::new(3.0, color.to_opaque()),\\n\\n });\\n\\n }\\n\\n response\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/color_picker.rs\",\n \"rank\": 6,\n \"score\": 391408.09614316985\n },\n {\n \"content\": \"pub fn center_size_in_rect(size: Vec2, frame: Rect) -> Rect {\\n\\n Align2::CENTER_CENTER.align_size_within_rect(size, frame)\\n\\n}\\n\",\n \"file_path\": \"emath/src/align.rs\",\n \"rank\": 7,\n \"score\": 388795.6804672339\n },\n {\n \"content\": \"pub fn stroke_ui(ui: &mut crate::Ui, stroke: &mut epaint::Stroke, text: &str) {\\n\\n let epaint::Stroke { width, color } = stroke;\\n\\n ui.horizontal(|ui| {\\n\\n ui.add(DragValue::new(width).speed(0.1).clamp_range(0.0..=5.0))\\n\\n .on_hover_text(\\\"Width\\\");\\n\\n ui.color_edit_button_srgba(color);\\n\\n ui.label(text);\\n\\n\\n\\n // stroke preview:\\n\\n let (_id, stroke_rect) = ui.allocate_space(ui.spacing().interact_size);\\n\\n let left = stroke_rect.left_center();\\n\\n let right = stroke_rect.right_center();\\n\\n ui.painter().line_segment([left, right], (*width, *color));\\n\\n });\\n\\n}\\n\\n\\n\\npub(crate) fn shadow_ui(ui: &mut Ui, shadow: &mut epaint::Shadow, text: &str) {\\n\\n let epaint::Shadow { extrusion, color } = shadow;\\n\\n ui.horizontal(|ui| {\\n\\n ui.label(text);\\n\\n ui.add(\\n\\n DragValue::new(extrusion)\\n\\n .speed(1.0)\\n\\n .clamp_range(0.0..=100.0),\\n\\n )\\n\\n .on_hover_text(\\\"Extrusion\\\");\\n\\n ui.color_edit_button_srgba(color);\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"egui/src/widgets/mod.rs\",\n \"rank\": 8,\n \"score\": 382180.5042271465\n },\n {\n \"content\": \"pub fn drag_source(ui: &mut Ui, id: Id, body: impl FnOnce(&mut Ui)) {\\n\\n let is_being_dragged = ui.memory().is_being_dragged(id);\\n\\n\\n\\n if !is_being_dragged {\\n\\n let response = ui.scope(body).response;\\n\\n\\n\\n // Check for drags:\\n\\n let response = ui.interact(response.rect, id, Sense::drag());\\n\\n if response.hovered() {\\n\\n ui.output().cursor_icon = CursorIcon::Grab;\\n\\n }\\n\\n } else {\\n\\n ui.output().cursor_icon = CursorIcon::Grabbing;\\n\\n\\n\\n // Paint the body to a new layer:\\n\\n let layer_id = LayerId::new(Order::Tooltip, id);\\n\\n let response = ui.with_layer_id(layer_id, body).response;\\n\\n\\n\\n // Now we move the visuals of the body to where the mouse is.\\n\\n // Normally you need to decide a location for a widget first,\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/demo/drag_and_drop.rs\",\n \"rank\": 9,\n \"score\": 381401.5292750436\n },\n {\n \"content\": \"fn color_text_ui(ui: &mut Ui, color: impl Into<Color32>) {\\n\\n let color = color.into();\\n\\n ui.horizontal(|ui| {\\n\\n let [r, g, b, a] = color.to_array();\\n\\n ui.label(format!(\\n\\n \\\"RGBA (premultiplied): rgba({}, {}, {}, {})\\\",\\n\\n r, g, b, a\\n\\n ));\\n\\n\\n\\n if ui.button(\\\"📋\\\").on_hover_text(\\\"Click to copy\\\").clicked() {\\n\\n ui.output().copied_text = format!(\\\"{}, {}, {}, {}\\\", r, g, b, a);\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/color_picker.rs\",\n \"rank\": 10,\n \"score\": 378758.67014943296\n },\n {\n \"content\": \"/// Helper function that adds a label when compiling with debug assertions enabled.\\n\\npub fn warn_if_debug_build(ui: &mut crate::Ui) {\\n\\n if cfg!(debug_assertions) {\\n\\n ui.label(\\n\\n crate::Label::new(\\\"‼ Debug build ‼\\\")\\n\\n .small()\\n\\n .text_color(crate::Color32::RED),\\n\\n )\\n\\n .on_hover_text(\\\"egui was compiled with debug assertions enabled.\\\");\\n\\n }\\n\\n}\\n\\n\\n\\n// ----------------------------------------------------------------------------\\n\\n\\n\\n/// Create a [`Hyperlink`](crate::Hyperlink) to the current [`file!()`] (and line) on Github\\n\\n///\\n\\n/// Example: `ui.add(github_link_file_line!(\\\"https://github.com/YOUR/PROJECT/blob/master/\\\", \\\"(source code)\\\"));`\\n\\n#[macro_export]\\n\\nmacro_rules! github_link_file_line {\\n\\n ($github_url:expr, $label:expr) => {{\\n\\n let url = format!(\\\"{}{}#L{}\\\", $github_url, file!(), line!());\\n\",\n \"file_path\": \"egui/src/lib.rs\",\n \"rank\": 11,\n \"score\": 349251.1172759094\n },\n {\n \"content\": \"fn bullet_point(ui: &mut Ui, width: f32) -> Response {\\n\\n let row_height = ui.fonts()[TextStyle::Body].row_height();\\n\\n let (rect, response) = ui.allocate_exact_size(vec2(width, row_height), Sense::hover());\\n\\n ui.painter().circle_filled(\\n\\n rect.center(),\\n\\n rect.height() / 8.0,\\n\\n ui.visuals().strong_text_color(),\\n\\n );\\n\\n response\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_demo_lib/src/easy_mark/easy_mark_viewer.rs\",\n \"rank\": 12,\n \"score\": 348811.76782343996\n },\n {\n \"content\": \"/// return true on change\\n\\nfn color_picker_hsva_2d(ui: &mut Ui, hsva: &mut Hsva, alpha: Alpha) -> bool {\\n\\n let mut hsvag = HsvaGamma::from(*hsva);\\n\\n color_picker_hsvag_2d(ui, &mut hsvag, alpha);\\n\\n let new_hasva = Hsva::from(hsvag);\\n\\n if *hsva == new_hasva {\\n\\n false\\n\\n } else {\\n\\n *hsva = new_hasva;\\n\\n true\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/color_picker.rs\",\n \"rank\": 13,\n \"score\": 341958.0579281187\n },\n {\n \"content\": \"fn numbered_point(ui: &mut Ui, width: f32, number: &str) -> Response {\\n\\n let row_height = ui.fonts()[TextStyle::Body].row_height();\\n\\n let (rect, response) = ui.allocate_exact_size(vec2(width, row_height), Sense::hover());\\n\\n let text = format!(\\\"{}.\\\", number);\\n\\n let text_color = ui.visuals().strong_text_color();\\n\\n ui.painter().text(\\n\\n rect.right_center(),\\n\\n Align2::RIGHT_CENTER,\\n\\n text,\\n\\n TextStyle::Body,\\n\\n text_color,\\n\\n );\\n\\n response\\n\\n}\\n\",\n \"file_path\": \"egui_demo_lib/src/easy_mark/easy_mark_viewer.rs\",\n \"rank\": 14,\n \"score\": 330070.6152235584\n },\n {\n \"content\": \"/// Construct a top level menu in a menu bar. This would be e.g. \\\"File\\\", \\\"Edit\\\" etc.\\n\\npub fn menu(ui: &mut Ui, title: impl ToString, add_contents: impl FnOnce(&mut Ui)) {\\n\\n menu_impl(ui, title, Box::new(add_contents))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/menu.rs\",\n \"rank\": 15,\n \"score\": 329402.50982299785\n },\n {\n \"content\": \"fn ui_color(ui: &mut Ui, srgba: &mut Color32, text: &str) {\\n\\n ui.horizontal(|ui| {\\n\\n ui.color_edit_button_srgba(srgba);\\n\\n ui.label(text);\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"egui/src/style.rs\",\n \"rank\": 16,\n \"score\": 327716.3970900571\n },\n {\n \"content\": \"fn close_button(ui: &mut Ui, rect: Rect) -> Response {\\n\\n let close_id = ui.auto_id_with(\\\"window_close_button\\\");\\n\\n let response = ui.interact(rect, close_id, Sense::click());\\n\\n ui.expand_to_include_rect(response.rect);\\n\\n\\n\\n let visuals = ui.style().interact(&response);\\n\\n let rect = rect.shrink(2.0).expand(visuals.expansion);\\n\\n let stroke = visuals.fg_stroke;\\n\\n ui.painter()\\n\\n .line_segment([rect.left_top(), rect.right_bottom()], stroke);\\n\\n ui.painter()\\n\\n .line_segment([rect.right_top(), rect.left_bottom()], stroke);\\n\\n response\\n\\n}\\n\",\n \"file_path\": \"egui/src/containers/window.rs\",\n \"rank\": 17,\n \"score\": 320592.58225311164\n },\n {\n \"content\": \"/// Show some text at the current pointer position (if any).\\n\\n///\\n\\n/// Most of the time it is easier to use [`Response::on_hover_text`].\\n\\n///\\n\\n/// See also [`show_tooltip`].\\n\\n///\\n\\n/// ```\\n\\n/// # let mut ui = egui::Ui::__test();\\n\\n/// if ui.ui_contains_pointer() {\\n\\n/// egui::show_tooltip_text(ui.ctx(), egui::Id::new(\\\"my_tooltip\\\"), \\\"Helpful text\\\");\\n\\n/// }\\n\\n/// ```\\n\\npub fn show_tooltip_text(ctx: &CtxRef, id: Id, text: impl ToString) {\\n\\n show_tooltip(ctx, id, |ui| {\\n\\n ui.add(crate::widgets::Label::new(text));\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/containers/popup.rs\",\n \"rank\": 18,\n \"score\": 316954.1682352518\n },\n {\n \"content\": \"fn color_button(ui: &mut Ui, color: Color32) -> Response {\\n\\n let size = ui.spacing().interact_size;\\n\\n let (rect, response) = ui.allocate_exact_size(size, Sense::click());\\n\\n response.widget_info(|| WidgetInfo::new(WidgetType::ColorButton));\\n\\n let visuals = ui.style().interact(&response);\\n\\n let rect = rect.expand(visuals.expansion);\\n\\n\\n\\n background_checkers(ui.painter(), rect);\\n\\n\\n\\n let left_half = Rect::from_min_max(rect.left_top(), rect.center_bottom());\\n\\n let right_half = Rect::from_min_max(rect.center_top(), rect.right_bottom());\\n\\n ui.painter().rect_filled(left_half, 0.0, color);\\n\\n ui.painter().rect_filled(right_half, 0.0, color.to_opaque());\\n\\n\\n\\n let corner_radius = visuals.corner_radius.at_most(2.0);\\n\\n ui.painter()\\n\\n .rect_stroke(rect, corner_radius, (2.0, visuals.bg_fill)); // fill is intentional!\\n\\n\\n\\n response\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/color_picker.rs\",\n \"rank\": 19,\n \"score\": 313089.81223149464\n },\n {\n \"content\": \"/// Show a button to reset a value to its default.\\n\\n/// The button is only enabled if the value does not already have its original value.\\n\\npub fn reset_button<T: Default + PartialEq>(ui: &mut Ui, value: &mut T) {\\n\\n let def = T::default();\\n\\n if ui\\n\\n .add(Button::new(\\\"Reset\\\").enabled(*value != def))\\n\\n .clicked()\\n\\n {\\n\\n *value = def;\\n\\n }\\n\\n}\\n\\n\\n\\n// ----------------------------------------------------------------------------\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/mod.rs\",\n \"rank\": 20,\n \"score\": 312761.9634476489\n },\n {\n \"content\": \"#[allow(clippy::needless_pass_by_value)]\\n\\nfn menu_impl<'c>(ui: &mut Ui, title: impl ToString, add_contents: Box<dyn FnOnce(&mut Ui) + 'c>) {\\n\\n let title = title.to_string();\\n\\n let bar_id = ui.id();\\n\\n let menu_id = bar_id.with(&title);\\n\\n\\n\\n let mut bar_state = BarState::load(ui.ctx(), &bar_id);\\n\\n\\n\\n let mut button = Button::new(title);\\n\\n\\n\\n if bar_state.open_menu == Some(menu_id) {\\n\\n button = button.fill(Some(ui.visuals().selection.bg_fill));\\n\\n }\\n\\n\\n\\n let button_response = ui.add(button);\\n\\n if button_response.clicked() {\\n\\n // Toggle\\n\\n if bar_state.open_menu == Some(menu_id) {\\n\\n bar_state.open_menu = None;\\n\\n } else {\\n\\n bar_state.open_menu = Some(menu_id);\\n\",\n \"file_path\": \"egui/src/menu.rs\",\n \"rank\": 21,\n \"score\": 310597.87449471315\n },\n {\n \"content\": \"fn ui_url(ui: &mut egui::Ui, frame: &mut epi::Frame<'_>, url: &mut String) -> Option<String> {\\n\\n let mut trigger_fetch = false;\\n\\n\\n\\n ui.horizontal(|ui| {\\n\\n ui.label(\\\"URL:\\\");\\n\\n trigger_fetch |= ui.text_edit_singleline(url).lost_focus();\\n\\n trigger_fetch |= ui.button(\\\"GET\\\").clicked();\\n\\n });\\n\\n\\n\\n if frame.is_web() {\\n\\n ui.label(\\\"HINT: paste the url of this page into the field above!\\\");\\n\\n }\\n\\n\\n\\n ui.horizontal(|ui| {\\n\\n if ui.button(\\\"Source code for this example\\\").clicked() {\\n\\n *url = format!(\\n\\n \\\"https://raw.githubusercontent.com/emilk/egui/master/{}\\\",\\n\\n file!()\\n\\n );\\n\\n trigger_fetch = true;\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/http_app.rs\",\n \"rank\": 22,\n \"score\": 305511.0877685263\n },\n {\n \"content\": \"fn background_checkers(painter: &Painter, rect: Rect) {\\n\\n let rect = rect.shrink(0.5); // Small hack to avoid the checkers from peeking through the sides\\n\\n if !rect.is_positive() {\\n\\n return;\\n\\n }\\n\\n\\n\\n let mut top_color = Color32::from_gray(128);\\n\\n let mut bottom_color = Color32::from_gray(32);\\n\\n let checker_size = Vec2::splat(rect.height() / 2.0);\\n\\n let n = (rect.width() / checker_size.x).round() as u32;\\n\\n\\n\\n let mut mesh = Mesh::default();\\n\\n for i in 0..n {\\n\\n let x = lerp(rect.left()..=rect.right(), i as f32 / (n as f32));\\n\\n mesh.add_colored_rect(\\n\\n Rect::from_min_size(pos2(x, rect.top()), checker_size),\\n\\n top_color,\\n\\n );\\n\\n mesh.add_colored_rect(\\n\\n Rect::from_min_size(pos2(x, rect.center().y), checker_size),\\n\\n bottom_color,\\n\\n );\\n\\n std::mem::swap(&mut top_color, &mut bottom_color);\\n\\n }\\n\\n painter.add(Shape::mesh(mesh));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/color_picker.rs\",\n \"rank\": 23,\n \"score\": 304308.5139438763\n },\n {\n \"content\": \"fn paint_cursor_end(ui: &mut Ui, pos: Pos2, galley: &Galley, cursor: &Cursor) {\\n\\n let stroke = ui.visuals().selection.stroke;\\n\\n\\n\\n let cursor_pos = galley.pos_from_cursor(cursor).translate(pos.to_vec2());\\n\\n let cursor_pos = cursor_pos.expand(1.5); // slightly above/below row\\n\\n\\n\\n let top = cursor_pos.center_top();\\n\\n let bottom = cursor_pos.center_bottom();\\n\\n\\n\\n ui.painter().line_segment(\\n\\n [top, bottom],\\n\\n (ui.visuals().text_cursor_width, stroke.color),\\n\\n );\\n\\n\\n\\n if false {\\n\\n // Roof/floor:\\n\\n let extrusion = 3.0;\\n\\n let width = 1.0;\\n\\n ui.painter().line_segment(\\n\\n [top - vec2(extrusion, 0.0), top + vec2(extrusion, 0.0)],\\n\",\n \"file_path\": \"egui/src/widgets/text_edit.rs\",\n \"rank\": 24,\n \"score\": 298845.0229283991\n },\n {\n \"content\": \"/// The menu bar goes well in a [`TopBottomPanel::top`],\\n\\n/// but can also be placed in a `Window`.\\n\\n/// In the latter case you may want to wrap it in `Frame`.\\n\\npub fn bar<R>(ui: &mut Ui, add_contents: impl FnOnce(&mut Ui) -> R) -> InnerResponse<R> {\\n\\n ui.horizontal(|ui| {\\n\\n let mut style = (**ui.style()).clone();\\n\\n style.spacing.button_padding = vec2(2.0, 0.0);\\n\\n // style.visuals.widgets.active.bg_fill = Color32::TRANSPARENT;\\n\\n style.visuals.widgets.active.bg_stroke = Stroke::none();\\n\\n // style.visuals.widgets.hovered.bg_fill = Color32::TRANSPARENT;\\n\\n style.visuals.widgets.hovered.bg_stroke = Stroke::none();\\n\\n style.visuals.widgets.inactive.bg_fill = Color32::TRANSPARENT;\\n\\n style.visuals.widgets.inactive.bg_stroke = Stroke::none();\\n\\n ui.set_style(style);\\n\\n\\n\\n // Take full width and fixed height:\\n\\n let height = ui.spacing().interact_size.y;\\n\\n ui.set_min_size(vec2(ui.available_width(), height));\\n\\n\\n\\n add_contents(ui)\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/menu.rs\",\n \"rank\": 25,\n \"score\": 297987.70146027685\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\nfn toggle_ui_compact(ui: &mut egui::Ui, on: &mut bool) -> egui::Response {\\n\\n let desired_size = ui.spacing().interact_size.y * egui::vec2(2.0, 1.0);\\n\\n let (rect, mut response) = ui.allocate_exact_size(desired_size, egui::Sense::click());\\n\\n if response.clicked() {\\n\\n *on = !*on;\\n\\n response.mark_changed();\\n\\n }\\n\\n response.widget_info(|| egui::WidgetInfo::selected(egui::WidgetType::Checkbox, *on, \\\"\\\"));\\n\\n\\n\\n let how_on = ui.ctx().animate_bool(response.id, *on);\\n\\n let visuals = ui.style().interact_selectable(&response, *on);\\n\\n let rect = rect.expand(visuals.expansion);\\n\\n let radius = 0.5 * rect.height();\\n\\n ui.painter()\\n\\n .rect(rect, radius, visuals.bg_fill, visuals.bg_stroke);\\n\\n let circle_x = egui::lerp((rect.left() + radius)..=(rect.right() - radius), how_on);\\n\\n let center = egui::pos2(circle_x, rect.center().y);\\n\\n ui.painter()\\n\\n .circle(center, 0.75 * radius, visuals.bg_fill, visuals.fg_stroke);\\n\\n\\n\\n response\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/demo/toggle_switch.rs\",\n \"rank\": 26,\n \"score\": 293219.7925957732\n },\n {\n \"content\": \"/// iOS-style toggle switch:\\n\\n///\\n\\n/// ``` text\\n\\n/// _____________\\n\\n/// / /.....\\\\\\n\\n/// | |.......|\\n\\n/// \\\\_______\\\\_____/\\n\\n/// ```\\n\\n///\\n\\n/// ## Example:\\n\\n/// ``` ignore\\n\\n/// toggle_ui(ui, &mut my_bool);\\n\\n/// ```\\n\\npub fn toggle_ui(ui: &mut egui::Ui, on: &mut bool) -> egui::Response {\\n\\n // Widget code can be broken up in four steps:\\n\\n // 1. Decide a size for the widget\\n\\n // 2. Allocate space for it\\n\\n // 3. Handle interactions with the widget (if any)\\n\\n // 4. Paint the widget\\n\\n\\n\\n // 1. Deciding widget size:\\n\\n // You can query the `ui` how much space is available,\\n\\n // but in this example we have a fixed size widget based on the height of a standard button:\\n\\n let desired_size = ui.spacing().interact_size.y * egui::vec2(2.0, 1.0);\\n\\n\\n\\n // 2. Allocating space:\\n\\n // This is where we get a region of the screen assigned.\\n\\n // We also tell the Ui to sense clicks in the allocated region.\\n\\n let (rect, mut response) = ui.allocate_exact_size(desired_size, egui::Sense::click());\\n\\n\\n\\n // 3. Interact: Time to check for clicks!\\n\\n if response.clicked() {\\n\\n *on = !*on;\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/demo/toggle_switch.rs\",\n \"rank\": 27,\n \"score\": 289397.0496747466\n },\n {\n \"content\": \"fn demo_ui(ui: &mut Ui) {\\n\\n ui.monospace(\\\"Example widgets:\\\");\\n\\n for _ in 0..3 {\\n\\n ui.label(\\\"label\\\");\\n\\n }\\n\\n for _ in 0..3 {\\n\\n let mut dummy = false;\\n\\n ui.checkbox(&mut dummy, \\\"checkbox\\\");\\n\\n }\\n\\n for _ in 0..3 {\\n\\n let _ = ui.button(\\\"button\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/demo/layout_test.rs\",\n \"rank\": 28,\n \"score\": 284314.35728022165\n },\n {\n \"content\": \"fn color_picker_hsvag_2d(ui: &mut Ui, hsva: &mut HsvaGamma, alpha: Alpha) {\\n\\n color_text_ui(ui, *hsva);\\n\\n\\n\\n if alpha == Alpha::BlendOrAdditive {\\n\\n // We signal additive blending by storing a negative alpha (a bit ironic).\\n\\n let a = &mut hsva.a;\\n\\n let mut additive = *a < 0.0;\\n\\n ui.horizontal(|ui| {\\n\\n ui.label(\\\"Blending:\\\");\\n\\n ui.radio_value(&mut additive, false, \\\"Normal\\\");\\n\\n ui.radio_value(&mut additive, true, \\\"Additive\\\");\\n\\n\\n\\n if additive {\\n\\n *a = -a.abs();\\n\\n }\\n\\n\\n\\n if !additive {\\n\\n *a = a.abs();\\n\\n }\\n\\n });\\n\",\n \"file_path\": \"egui/src/widgets/color_picker.rs\",\n \"rank\": 29,\n \"score\": 282221.69976555696\n },\n {\n \"content\": \"fn pixel_test(ui: &mut Ui) {\\n\\n ui.label(\\\"Each subsequent square should be one physical pixel larger than the previous. They should be exactly one physical pixel apart. They should be perfectly aligned to the pixel grid.\\\");\\n\\n\\n\\n let pixels_per_point = ui.ctx().pixels_per_point();\\n\\n let num_squares: u32 = 8;\\n\\n let size_pixels = Vec2::new(\\n\\n ((num_squares + 1) * (num_squares + 2) / 2) as f32,\\n\\n num_squares as f32,\\n\\n );\\n\\n let size_points = size_pixels / pixels_per_point + Vec2::splat(2.0);\\n\\n let (response, painter) = ui.allocate_painter(size_points, Sense::hover());\\n\\n\\n\\n let mut cursor_pixel = Pos2::new(\\n\\n response.rect.min.x * pixels_per_point,\\n\\n response.rect.min.y * pixels_per_point,\\n\\n )\\n\\n .ceil();\\n\\n for size in 1..=num_squares {\\n\\n let rect_points = Rect::from_min_size(\\n\\n Pos2::new(\\n\\n cursor_pixel.x / pixels_per_point,\\n\\n cursor_pixel.y / pixels_per_point,\\n\\n ),\\n\\n Vec2::splat(size as f32) / pixels_per_point,\\n\\n );\\n\\n painter.rect_filled(rect_points, 0.0, egui::Color32::WHITE);\\n\\n cursor_pixel.x += (1 + size) as f32;\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/color_test.rs\",\n \"rank\": 30,\n \"score\": 281426.69966376974\n },\n {\n \"content\": \"pub fn adjust_colors(shape: &mut Shape, adjust_color: &impl Fn(&mut Color32)) {\\n\\n #![allow(clippy::match_same_arms)]\\n\\n match shape {\\n\\n Shape::Noop => {}\\n\\n Shape::Vec(shapes) => {\\n\\n for shape in shapes {\\n\\n adjust_colors(shape, adjust_color)\\n\\n }\\n\\n }\\n\\n Shape::Circle { fill, stroke, .. } => {\\n\\n adjust_color(fill);\\n\\n adjust_color(&mut stroke.color);\\n\\n }\\n\\n Shape::LineSegment { stroke, .. } => {\\n\\n adjust_color(&mut stroke.color);\\n\\n }\\n\\n Shape::Path { fill, stroke, .. } => {\\n\\n adjust_color(fill);\\n\\n adjust_color(&mut stroke.color);\\n\\n }\\n\",\n \"file_path\": \"epaint/src/shape_transform.rs\",\n \"rank\": 31,\n \"score\": 280810.2794342743\n },\n {\n \"content\": \"fn max_scroll_bar_width_with_margin(ui: &Ui) -> f32 {\\n\\n ui.spacing().item_spacing.x + 16.0\\n\\n}\\n\",\n \"file_path\": \"egui/src/containers/scroll_area.rs\",\n \"rank\": 32,\n \"score\": 279106.300256946\n },\n {\n \"content\": \"/// Shows a button with the given color.\\n\\n/// If the user clicks the button, a full color picker is shown.\\n\\npub fn color_edit_button_srgba(ui: &mut Ui, srgba: &mut Color32, alpha: Alpha) -> Response {\\n\\n // To ensure we keep hue slider when `srgba` is gray we store the\\n\\n // full `Hsva` in a cache:\\n\\n\\n\\n let mut hsva = ui\\n\\n .ctx()\\n\\n .memory()\\n\\n .data_temp\\n\\n .get_or_default::<Cache<Color32, Hsva>>()\\n\\n .get(srgba)\\n\\n .cloned()\\n\\n .unwrap_or_else(|| Hsva::from(*srgba));\\n\\n\\n\\n let response = color_edit_button_hsva(ui, &mut hsva, alpha);\\n\\n\\n\\n *srgba = Color32::from(hsva);\\n\\n\\n\\n ui.ctx()\\n\\n .memory()\\n\\n .data_temp\\n\\n .get_mut_or_default::<Cache<Color32, Hsva>>()\\n\\n .set(*srgba, hsva);\\n\\n\\n\\n response\\n\\n}\\n\",\n \"file_path\": \"egui/src/widgets/color_picker.rs\",\n \"rank\": 33,\n \"score\": 271122.8867873156\n },\n {\n \"content\": \"pub fn color_edit_button_hsva(ui: &mut Ui, hsva: &mut Hsva, alpha: Alpha) -> Response {\\n\\n let pupup_id = ui.auto_id_with(\\\"popup\\\");\\n\\n let mut button_response = color_button(ui, (*hsva).into()).on_hover_text(\\\"Click to edit color\\\");\\n\\n\\n\\n if button_response.clicked() {\\n\\n ui.memory().toggle_popup(pupup_id);\\n\\n }\\n\\n // TODO: make it easier to show a temporary popup that closes when you click outside it\\n\\n if ui.memory().is_popup_open(pupup_id) {\\n\\n let area_response = Area::new(pupup_id)\\n\\n .order(Order::Foreground)\\n\\n .default_pos(button_response.rect.max)\\n\\n .show(ui.ctx(), |ui| {\\n\\n ui.spacing_mut().slider_width = 256.0;\\n\\n Frame::popup(ui.style()).show(ui, |ui| {\\n\\n if color_picker_hsva_2d(ui, hsva, alpha) {\\n\\n button_response.mark_changed();\\n\\n }\\n\\n });\\n\\n });\\n\",\n \"file_path\": \"egui/src/widgets/color_picker.rs\",\n \"rank\": 34,\n \"score\": 271116.7177644797\n },\n {\n \"content\": \"fn huge_content_painter(ui: &mut egui::Ui) {\\n\\n // This is similar to the other demo, but is fully manual, for when you want to do custom painting.\\n\\n ui.label(\\\"A lot of rows, but only the visible ones are painted, so performance is still good:\\\");\\n\\n ui.add_space(4.0);\\n\\n\\n\\n let text_style = TextStyle::Body;\\n\\n let row_height = ui.fonts()[text_style].row_height() + ui.spacing().item_spacing.y;\\n\\n let num_rows = 10_000;\\n\\n\\n\\n ScrollArea::auto_sized().show_viewport(ui, |ui, viewport| {\\n\\n ui.set_height(row_height * num_rows as f32);\\n\\n\\n\\n let first_item = (viewport.min.y / row_height).floor().at_least(0.0) as usize;\\n\\n let last_item = (viewport.max.y / row_height).ceil() as usize + 1;\\n\\n let last_item = last_item.at_most(num_rows);\\n\\n\\n\\n for i in first_item..last_item {\\n\\n let indentation = (i % 100) as f32;\\n\\n let x = ui.min_rect().left() + indentation;\\n\\n let y = ui.min_rect().top() + i as f32 * row_height;\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/demo/scrolling.rs\",\n \"rank\": 35,\n \"score\": 270334.2839303363\n },\n {\n \"content\": \"/// Return true when arguments are the same within some rounding error.\\n\\n///\\n\\n/// For instance `almost_equal(x, x.to_degrees().to_radians(), f32::EPSILON)` should hold true for all x.\\n\\n/// The `epsilon` can be `f32::EPSILON` to handle simple transforms (like degrees -> radians)\\n\\n/// but should be higher to handle more complex transformations.\\n\\npub fn almost_equal(a: f32, b: f32, epsilon: f32) -> bool {\\n\\n if a == b {\\n\\n true // handle infinites\\n\\n } else {\\n\\n let abs_max = a.abs().max(b.abs());\\n\\n abs_max <= epsilon || ((a - b).abs() / abs_max) <= epsilon\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"emath/src/lib.rs\",\n \"rank\": 36,\n \"score\": 262569.305860132\n },\n {\n \"content\": \"fn pointer_pressed_on_area(ctx: &Context, layer_id: LayerId) -> bool {\\n\\n if let Some(pointer_pos) = ctx.input().pointer.interact_pos() {\\n\\n ctx.input().pointer.any_pressed() && ctx.layer_id_at(pointer_pos) == Some(layer_id)\\n\\n } else {\\n\\n false\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/containers/area.rs\",\n \"rank\": 37,\n \"score\": 257701.49247998136\n },\n {\n \"content\": \"// A wrapper that allows the more idiomatic usage pattern: `ui.add(toggle(&mut my_bool))`\\n\\n/// iOS-style toggle switch.\\n\\n///\\n\\n/// ## Example:\\n\\n/// ``` ignore\\n\\n/// ui.add(toggle(&mut my_bool));\\n\\n/// ```\\n\\npub fn toggle(on: &mut bool) -> impl egui::Widget + '_ {\\n\\n move |ui: &mut egui::Ui| toggle_ui(ui, on)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/demo/toggle_switch.rs\",\n \"rank\": 38,\n \"score\": 256252.35435519397\n },\n {\n \"content\": \"fn paint_cursor_selection(ui: &mut Ui, pos: Pos2, galley: &Galley, cursorp: &CursorPair) {\\n\\n let color = ui.visuals().selection.bg_fill;\\n\\n if cursorp.is_empty() {\\n\\n return;\\n\\n }\\n\\n let [min, max] = cursorp.sorted();\\n\\n let min = min.rcursor;\\n\\n let max = max.rcursor;\\n\\n\\n\\n for ri in min.row..=max.row {\\n\\n let row = &galley.rows[ri];\\n\\n let left = if ri == min.row {\\n\\n row.x_offset(min.column)\\n\\n } else {\\n\\n row.min_x()\\n\\n };\\n\\n let right = if ri == max.row {\\n\\n row.x_offset(max.column)\\n\\n } else {\\n\\n let newline_size = if row.ends_with_newline {\\n\",\n \"file_path\": \"egui/src/widgets/text_edit.rs\",\n \"rank\": 39,\n \"score\": 253579.7511905129\n },\n {\n \"content\": \"fn handle_radius(rect: &Rect) -> f32 {\\n\\n rect.height() / 2.5\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/slider.rs\",\n \"rank\": 40,\n \"score\": 249995.16440015912\n },\n {\n \"content\": \"fn paint_icon(painter: &Painter, rect: Rect, visuals: &WidgetVisuals) {\\n\\n let rect = Rect::from_center_size(\\n\\n rect.center(),\\n\\n vec2(rect.width() * 0.7, rect.height() * 0.45),\\n\\n );\\n\\n painter.add(Shape::closed_line(\\n\\n vec![rect.left_top(), rect.right_top(), rect.center_bottom()],\\n\\n visuals.fg_stroke,\\n\\n ));\\n\\n}\\n\",\n \"file_path\": \"egui/src/containers/combo_box.rs\",\n \"rank\": 41,\n \"score\": 247208.07721278223\n },\n {\n \"content\": \"fn vertex_gradient(ui: &mut Ui, bg_fill: Color32, gradient: &Gradient) -> Response {\\n\\n use egui::epaint::*;\\n\\n let (rect, response) = ui.allocate_at_least(GRADIENT_SIZE, Sense::hover());\\n\\n if bg_fill != Default::default() {\\n\\n let mut mesh = Mesh::default();\\n\\n mesh.add_colored_rect(rect, bg_fill);\\n\\n ui.painter().add(Shape::mesh(mesh));\\n\\n }\\n\\n {\\n\\n let n = gradient.0.len();\\n\\n assert!(n >= 2);\\n\\n let mut mesh = Mesh::default();\\n\\n for (i, &color) in gradient.0.iter().enumerate() {\\n\\n let t = i as f32 / (n as f32 - 1.0);\\n\\n let x = lerp(rect.x_range(), t);\\n\\n mesh.colored_vertex(pos2(x, rect.top()), color);\\n\\n mesh.colored_vertex(pos2(x, rect.bottom()), color);\\n\\n if i < n - 1 {\\n\\n let i = i as u32;\\n\\n mesh.add_triangle(2 * i, 2 * i + 1, 2 * i + 2);\\n\\n mesh.add_triangle(2 * i + 1, 2 * i + 2, 2 * i + 3);\\n\\n }\\n\\n }\\n\\n ui.painter().add(Shape::mesh(mesh));\\n\\n }\\n\\n response\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/color_test.rs\",\n \"rank\": 42,\n \"score\": 243438.32937194032\n },\n {\n \"content\": \"fn x_range(rect: &Rect) -> RangeInclusive<f32> {\\n\\n let handle_radius = handle_radius(rect);\\n\\n (rect.left() + handle_radius)..=(rect.right() - handle_radius)\\n\\n}\\n\\n\\n\\nimpl<'a> Slider<'a> {\\n\\n /// Just the slider, no text\\n\\n #[allow(clippy::unused_self)]\\n\\n fn allocate_slider_space(&self, ui: &mut Ui, height: f32) -> Response {\\n\\n let desired_size = vec2(ui.spacing().slider_width, height);\\n\\n ui.allocate_response(desired_size, Sense::click_and_drag())\\n\\n }\\n\\n\\n\\n /// Just the slider, no text\\n\\n fn slider_ui(&mut self, ui: &mut Ui, response: &Response) {\\n\\n let rect = &response.rect;\\n\\n let x_range = x_range(rect);\\n\\n\\n\\n if let Some(pointer_pos) = response.interact_pointer_pos() {\\n\\n let new_value = if self.smart_aim {\\n\",\n \"file_path\": \"egui/src/widgets/slider.rs\",\n \"rank\": 43,\n \"score\": 242482.0768925804\n },\n {\n \"content\": \"/// All ranges in 0-1, rgb is linear.\\n\\npub fn hsv_from_rgb([r, g, b]: [f32; 3]) -> (f32, f32, f32) {\\n\\n #![allow(clippy::many_single_char_names)]\\n\\n let min = r.min(g.min(b));\\n\\n let max = r.max(g.max(b)); // value\\n\\n\\n\\n let range = max - min;\\n\\n\\n\\n let h = if max == min {\\n\\n 0.0 // hue is undefined\\n\\n } else if max == r {\\n\\n (g - b) / (6.0 * range)\\n\\n } else if max == g {\\n\\n (b - r) / (6.0 * range) + 1.0 / 3.0\\n\\n } else {\\n\\n // max == b\\n\\n (r - g) / (6.0 * range) + 2.0 / 3.0\\n\\n };\\n\\n let h = (h + 1.0).fract(); // wrap\\n\\n let s = if max == 0.0 { 0.0 } else { 1.0 - min / max };\\n\\n (h, s, max)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"epaint/src/color.rs\",\n \"rank\": 44,\n \"score\": 242315.30373005875\n },\n {\n \"content\": \"pub fn easy_mark_it<'em>(ui: &mut Ui, items: impl Iterator<Item = easy_mark::Item<'em>>) {\\n\\n ui.horizontal_wrapped(|ui| {\\n\\n ui.spacing_mut().item_spacing = Vec2::new(0.0, 0.0);\\n\\n ui.set_row_height(ui.fonts()[TextStyle::Body].row_height());\\n\\n\\n\\n for item in items {\\n\\n item_ui(ui, item);\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_demo_lib/src/easy_mark/easy_mark_viewer.rs\",\n \"rank\": 45,\n \"score\": 240333.69801996058\n },\n {\n \"content\": \"/// Wrap angle to `[-PI, PI]` range.\\n\\npub fn normalized_angle(mut angle: f32) -> f32 {\\n\\n use std::f32::consts::{PI, TAU};\\n\\n angle %= TAU;\\n\\n if angle > PI {\\n\\n angle -= TAU;\\n\\n } else if angle < -PI {\\n\\n angle += TAU;\\n\\n }\\n\\n angle\\n\\n}\\n\\n\\n\",\n \"file_path\": \"emath/src/lib.rs\",\n \"rank\": 46,\n \"score\": 237321.82842927641\n },\n {\n \"content\": \"fn show_menu_bar(ui: &mut Ui) {\\n\\n trace!(ui);\\n\\n use egui::*;\\n\\n\\n\\n menu::bar(ui, |ui| {\\n\\n menu::menu(ui, \\\"File\\\", |ui| {\\n\\n if ui.button(\\\"Organize windows\\\").clicked() {\\n\\n ui.ctx().memory().reset_areas();\\n\\n }\\n\\n if ui\\n\\n .button(\\\"Clear egui memory\\\")\\n\\n .on_hover_text(\\\"Forget scroll, positions, sizes etc\\\")\\n\\n .clicked()\\n\\n {\\n\\n *ui.ctx().memory() = Default::default();\\n\\n }\\n\\n });\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/demo/demo_app_windows.rs\",\n \"rank\": 47,\n \"score\": 233043.79009414837\n },\n {\n \"content\": \"fn contrast_color(color: impl Into<Rgba>) -> Color32 {\\n\\n if color.into().intensity() < 0.5 {\\n\\n Color32::WHITE\\n\\n } else {\\n\\n Color32::BLACK\\n\\n }\\n\\n}\\n\\n\\n\\n/// Number of vertices per dimension in the color sliders.\\n\\n/// We need at least 6 for hues, and more for smooth 2D areas.\\n\\n/// Should always be a multiple of 6 to hit the peak hues in HSV/HSL (every 60°).\\n\\nconst N: u32 = 6 * 6;\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/color_picker.rs\",\n \"rank\": 48,\n \"score\": 231032.4193015113\n },\n {\n \"content\": \"fn next_word_boundary_char_index(it: impl Iterator<Item = char>, mut index: usize) -> usize {\\n\\n let mut it = it.skip(index);\\n\\n if let Some(_first) = it.next() {\\n\\n index += 1;\\n\\n\\n\\n if let Some(second) = it.next() {\\n\\n index += 1;\\n\\n for next in it {\\n\\n if is_word_char(next) != is_word_char(second) {\\n\\n break;\\n\\n }\\n\\n index += 1;\\n\\n }\\n\\n }\\n\\n }\\n\\n index\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/text_edit.rs\",\n \"rank\": 49,\n \"score\": 230858.20148835247\n },\n {\n \"content\": \"/// Show a button to switch to/from dark/light mode (globally).\\n\\nfn dark_light_mode_switch(ui: &mut egui::Ui) {\\n\\n let style: egui::Style = (*ui.ctx().style()).clone();\\n\\n let new_visuals = style.visuals.light_dark_small_toggle_button(ui);\\n\\n if let Some(visuals) = new_visuals {\\n\\n ui.ctx().set_visuals(visuals);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"egui_demo_lib/src/wrap_app.rs\",\n \"rank\": 50,\n \"score\": 230687.35329764133\n },\n {\n \"content\": \"fn huge_content_lines(ui: &mut egui::Ui) {\\n\\n ui.label(\\n\\n \\\"A lot of rows, but only the visible ones are layed out, so performance is still good:\\\",\\n\\n );\\n\\n ui.add_space(4.0);\\n\\n\\n\\n let text_style = TextStyle::Body;\\n\\n let row_height = ui.fonts()[text_style].row_height();\\n\\n let num_rows = 10_000;\\n\\n ScrollArea::auto_sized().show_rows(ui, row_height, num_rows, |ui, row_range| {\\n\\n for row in row_range {\\n\\n let text = format!(\\\"This is row {}/{}\\\", row + 1, num_rows);\\n\\n ui.label(text);\\n\\n }\\n\\n });\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/demo/scrolling.rs\",\n \"rank\": 51,\n \"score\": 230687.35329764133\n },\n {\n \"content\": \"/// Password entry field with ability to toggle character hiding.\\n\\n///\\n\\n/// ## Example:\\n\\n/// ``` ignore\\n\\n/// password_ui(ui, &mut password);\\n\\n/// ```\\n\\npub fn password_ui(ui: &mut egui::Ui, text: &mut String) -> egui::Response {\\n\\n // This widget has its own state — show or hide password characters.\\n\\n\\n\\n // 1. Declare state struct\\n\\n // This struct represents the state of this widget.\\n\\n // It must implement at least `Clone` and be `'static`.\\n\\n // If you use the `persistence` feature, it also must implement `serde::{Deserialize, Serialize}`.\\n\\n // You should prefer creating custom newtype structs or enums like this, to avoid `TypeId`\\n\\n // intersection errors, especially when you use `Memory::data` without `Id`.\\n\\n #[derive(Clone, Copy, Default)]\\n\\n struct State(bool);\\n\\n\\n\\n // 2. Create id\\n\\n let id = ui.id().with(\\\"show_password\\\");\\n\\n\\n\\n // 3. Get state for this widget\\n\\n // You can read more about available `Memory` functions in the documentation of `egui::Memory`\\n\\n // struct and `egui::any` module.\\n\\n // You should get state by value, not by reference to avoid borrowing of `Memory`.\\n\\n let mut plaintext = *ui.memory().id_data_temp.get_or_default::<State>(id);\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/demo/password.rs\",\n \"rank\": 52,\n \"score\": 229027.32060864696\n },\n {\n \"content\": \"fn mul_color(color: Color32, factor: f32) -> Color32 {\\n\\n crate::epaint_assert!(0.0 <= factor && factor <= 1.0);\\n\\n // As an unfortunate side-effect of using premultiplied alpha\\n\\n // we need a somewhat expensive conversion to linear space and back.\\n\\n color.linear_multiply(factor)\\n\\n}\\n\\n\\n\\n// ----------------------------------------------------------------------------\\n\\n\\n\\n/// Converts [`Shape`]s into [`Mesh`].\\n\\npub struct Tessellator {\\n\\n options: TessellationOptions,\\n\\n /// Only used for culling\\n\\n clip_rect: Rect,\\n\\n scratchpad_points: Vec<Pos2>,\\n\\n scratchpad_path: Path,\\n\\n}\\n\\n\\n\\nimpl Tessellator {\\n\\n pub fn from_options(options: TessellationOptions) -> Self {\\n\",\n \"file_path\": \"epaint/src/tessellator.rs\",\n \"rank\": 53,\n \"score\": 227919.1353068523\n },\n {\n \"content\": \"pub fn paint_resize_corner(ui: &mut Ui, response: &Response) {\\n\\n let stroke = ui.style().interact(response).fg_stroke;\\n\\n paint_resize_corner_with_style(ui, &response.rect, stroke, Align2::RIGHT_BOTTOM);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/containers/resize.rs\",\n \"rank\": 54,\n \"score\": 224941.77045303903\n },\n {\n \"content\": \"pub fn canvas_size_in_points(canvas_id: &str) -> egui::Vec2 {\\n\\n let canvas = canvas_element(canvas_id).unwrap();\\n\\n let pixels_per_point = native_pixels_per_point();\\n\\n egui::vec2(\\n\\n canvas.width() as f32 / pixels_per_point,\\n\\n canvas.height() as f32 / pixels_per_point,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_web/src/lib.rs\",\n \"rank\": 55,\n \"score\": 217922.32834867778\n },\n {\n \"content\": \"/// All ranges in 0-1, rgb is linear.\\n\\npub fn rgb_from_hsv((h, s, v): (f32, f32, f32)) -> [f32; 3] {\\n\\n #![allow(clippy::many_single_char_names)]\\n\\n let h = (h.fract() + 1.0).fract(); // wrap\\n\\n let s = s.clamp(0.0, 1.0);\\n\\n\\n\\n let f = h * 6.0 - (h * 6.0).floor();\\n\\n let p = v * (1.0 - s);\\n\\n let q = v * (1.0 - f * s);\\n\\n let t = v * (1.0 - (1.0 - f) * s);\\n\\n\\n\\n match (h * 6.0).floor() as i32 % 6 {\\n\\n 0 => [v, t, p],\\n\\n 1 => [q, v, p],\\n\\n 2 => [p, v, t],\\n\\n 3 => [p, q, v],\\n\\n 4 => [t, p, v],\\n\\n 5 => [v, p, q],\\n\\n _ => unreachable!(),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"epaint/src/color.rs\",\n \"rank\": 56,\n \"score\": 216750.57900517806\n },\n {\n \"content\": \"/// Alternative to `FileStorage`\\n\\npub fn read_memory(ctx: &egui::Context, memory_file_path: impl AsRef<std::path::Path>) {\\n\\n let memory: Option<egui::Memory> = read_ron(memory_file_path);\\n\\n if let Some(memory) = memory {\\n\\n *ctx.memory() = memory;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_glium/src/persistence.rs\",\n \"rank\": 57,\n \"score\": 215671.72584753655\n },\n {\n \"content\": \"/// Parse and display a VERY simple and small subset of Markdown.\\n\\npub fn easy_mark(ui: &mut Ui, easy_mark: &str) {\\n\\n easy_mark_it(ui, easy_mark::Parser::new(easy_mark))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_demo_lib/src/easy_mark/easy_mark_viewer.rs\",\n \"rank\": 58,\n \"score\": 213828.59729024785\n },\n {\n \"content\": \"fn move_single_cursor(cursor: &mut Cursor, galley: &Galley, key: Key, modifiers: &Modifiers) {\\n\\n match key {\\n\\n Key::ArrowLeft => {\\n\\n if modifiers.alt || modifiers.ctrl {\\n\\n // alt on mac, ctrl on windows\\n\\n *cursor = galley.from_ccursor(ccursor_previous_word(&galley.text, cursor.ccursor));\\n\\n } else if modifiers.mac_cmd {\\n\\n *cursor = galley.cursor_begin_of_row(cursor);\\n\\n } else {\\n\\n *cursor = galley.cursor_left_one_character(cursor);\\n\\n }\\n\\n }\\n\\n Key::ArrowRight => {\\n\\n if modifiers.alt || modifiers.ctrl {\\n\\n // alt on mac, ctrl on windows\\n\\n *cursor = galley.from_ccursor(ccursor_next_word(&galley.text, cursor.ccursor));\\n\\n } else if modifiers.mac_cmd {\\n\\n *cursor = galley.cursor_end_of_row(cursor);\\n\\n } else {\\n\\n *cursor = galley.cursor_right_one_character(cursor);\\n\",\n \"file_path\": \"egui/src/widgets/text_edit.rs\",\n \"rank\": 59,\n \"score\": 213416.29967451934\n },\n {\n \"content\": \"/// linear [0, 1] -> gamma [0, 1] (not clamped).\\n\\n/// Works for numbers outside this range (e.g. negative numbers).\\n\\npub fn gamma_from_linear(linear: f32) -> f32 {\\n\\n if linear < 0.0 {\\n\\n -gamma_from_linear(-linear)\\n\\n } else if linear <= 0.0031308 {\\n\\n 12.92 * linear\\n\\n } else {\\n\\n 1.055 * linear.powf(1.0 / 2.4) - 0.055\\n\\n }\\n\\n}\\n\\n\\n\\n// ----------------------------------------------------------------------------\\n\\n\\n\\n/// Hue, saturation, value, alpha. All in the range [0, 1].\\n\\n/// No premultiplied alpha.\\n\\n#[derive(Clone, Copy, Debug, Default, PartialEq)]\\n\\npub struct Hsva {\\n\\n /// hue 0-1\\n\\n pub h: f32,\\n\\n /// saturation 0-1\\n\\n pub s: f32,\\n\",\n \"file_path\": \"epaint/src/color.rs\",\n \"rank\": 60,\n \"score\": 212971.53256515547\n },\n {\n \"content\": \"/// gamma [0, 1] -> linear [0, 1] (not clamped).\\n\\n/// Works for numbers outside this range (e.g. negative numbers).\\n\\npub fn linear_from_gamma(gamma: f32) -> f32 {\\n\\n if gamma < 0.0 {\\n\\n -linear_from_gamma(-gamma)\\n\\n } else if gamma <= 0.04045 {\\n\\n gamma / 12.92\\n\\n } else {\\n\\n ((gamma + 0.055) / 1.055).powf(2.4)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"epaint/src/color.rs\",\n \"rank\": 61,\n \"score\": 212971.53256515547\n },\n {\n \"content\": \"pub fn item_ui(ui: &mut Ui, item: easy_mark::Item<'_>) {\\n\\n let row_height = ui.fonts()[TextStyle::Body].row_height();\\n\\n let one_indent = row_height / 2.0;\\n\\n\\n\\n match item {\\n\\n easy_mark::Item::Newline => {\\n\\n // ui.label(\\\"\\\\n\\\"); // too much spacing (paragraph spacing)\\n\\n ui.allocate_exact_size(vec2(0.0, row_height), Sense::hover()); // make sure we take up some height\\n\\n ui.end_row();\\n\\n ui.set_row_height(row_height);\\n\\n }\\n\\n\\n\\n easy_mark::Item::Text(style, text) => {\\n\\n ui.add(label_from_style(text, &style));\\n\\n }\\n\\n easy_mark::Item::Hyperlink(style, text, url) => {\\n\\n let label = label_from_style(text, &style);\\n\\n ui.add(Hyperlink::from_label_and_url(label, url));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"egui_demo_lib/src/easy_mark/easy_mark_viewer.rs\",\n \"rank\": 62,\n \"score\": 211698.87276590505\n },\n {\n \"content\": \"pub fn resize_canvas_to_screen_size(canvas_id: &str, max_size_points: egui::Vec2) -> Option<()> {\\n\\n let canvas = canvas_element(canvas_id)?;\\n\\n\\n\\n let screen_size_points = screen_size_in_native_points()?;\\n\\n let pixels_per_point = native_pixels_per_point();\\n\\n\\n\\n let max_size_pixels = pixels_per_point * max_size_points;\\n\\n\\n\\n let canvas_size_pixels = pixels_per_point * screen_size_points;\\n\\n let canvas_size_pixels = canvas_size_pixels.min(max_size_pixels);\\n\\n let canvas_size_points = canvas_size_pixels / pixels_per_point;\\n\\n\\n\\n // Make sure that the height and width are always even numbers.\\n\\n // otherwise, the page renders blurry on some platforms.\\n\\n // See https://github.com/emilk/egui/issues/103\\n\\n fn round_to_even(v: f32) -> f32 {\\n\\n (v / 2.0).round() * 2.0\\n\\n }\\n\\n\\n\\n canvas\\n\",\n \"file_path\": \"egui_web/src/lib.rs\",\n \"rank\": 63,\n \"score\": 210463.45357401326\n },\n {\n \"content\": \"fn set_open(open: &mut BTreeSet<String>, key: &'static str, is_open: bool) {\\n\\n if is_open {\\n\\n if !open.contains(key) {\\n\\n open.insert(key.to_owned());\\n\\n }\\n\\n } else {\\n\\n open.remove(key);\\n\\n }\\n\\n}\\n\\n\\n\\n// ----------------------------------------------------------------------------\\n\\n\\n\\n/// A menu bar in which you can select different demo windows to show.\\n\\n#[derive(Default)]\\n\\n#[cfg_attr(feature = \\\"persistence\\\", derive(serde::Deserialize, serde::Serialize))]\\n\\n#[cfg_attr(feature = \\\"persistence\\\", serde(default))]\\n\\npub struct DemoWindows {\\n\\n demos: Demos,\\n\\n tests: Tests,\\n\\n}\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/demo/demo_app_windows.rs\",\n \"rank\": 64,\n \"score\": 207490.4422496751\n },\n {\n \"content\": \"fn clock_button(ui: &mut egui::Ui, seconds_since_midnight: f64) -> egui::Response {\\n\\n let time = seconds_since_midnight;\\n\\n let time = format!(\\n\\n \\\"{:02}:{:02}:{:02}.{:02}\\\",\\n\\n (time % (24.0 * 60.0 * 60.0) / 3600.0).floor(),\\n\\n (time % (60.0 * 60.0) / 60.0).floor(),\\n\\n (time % 60.0).floor(),\\n\\n (time % 1.0 * 100.0).floor()\\n\\n );\\n\\n\\n\\n ui.add(egui::Button::new(time).text_style(egui::TextStyle::Monospace))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_demo_lib/src/wrap_app.rs\",\n \"rank\": 65,\n \"score\": 206955.59565958838\n },\n {\n \"content\": \"pub fn label(ui: &mut Ui, alloc_info: &epaint::stats::AllocInfo, what: &str) -> Response {\\n\\n ui.add(Label::new(alloc_info.format(what)).wrap(false))\\n\\n}\\n\\n\\n\\nimpl Widget for &mut epaint::TessellationOptions {\\n\\n fn ui(self, ui: &mut Ui) -> Response {\\n\\n ui.vertical(|ui| {\\n\\n let epaint::TessellationOptions {\\n\\n pixels_per_point: _,\\n\\n aa_size: _,\\n\\n anti_alias,\\n\\n coarse_tessellation_culling,\\n\\n debug_paint_clip_rects,\\n\\n debug_paint_text_rects,\\n\\n debug_ignore_clip_rects,\\n\\n } = self;\\n\\n ui.checkbox(anti_alias, \\\"Antialias\\\");\\n\\n ui.checkbox(\\n\\n coarse_tessellation_culling,\\n\\n \\\"Do coarse culling in the tessellator\\\",\\n\",\n \"file_path\": \"egui/src/introspection.rs\",\n \"rank\": 66,\n \"score\": 202630.20317113682\n },\n {\n \"content\": \"fn megabytes(size: usize) -> String {\\n\\n format!(\\\"{:.2} MB\\\", size as f64 / 1e6)\\n\\n}\\n\",\n \"file_path\": \"epaint/src/stats.rs\",\n \"rank\": 67,\n \"score\": 201299.49303948836\n },\n {\n \"content\": \"/// linear [0, 1] -> gamma [0, 255] (clamped).\\n\\n/// Values outside this range will be clamped to the range.\\n\\npub fn gamma_u8_from_linear_f32(l: f32) -> u8 {\\n\\n if l <= 0.0 {\\n\\n 0\\n\\n } else if l <= 0.0031308 {\\n\\n (3294.6 * l).round() as u8\\n\\n } else if l <= 1.0 {\\n\\n (269.025 * l.powf(1.0 / 2.4) - 14.025).round() as u8\\n\\n } else {\\n\\n 255\\n\\n }\\n\\n}\\n\\n\\n\\n/// linear [0, 1] -> linear [0, 255] (clamped).\\n\\n/// Useful for alpha-channel.\\n\",\n \"file_path\": \"epaint/src/color.rs\",\n \"rank\": 68,\n \"score\": 200346.5979814853\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn linear_u8_from_linear_f32(a: f32) -> u8 {\\n\\n (a * 255.0).round() as u8 // rust does a saturating cast since 1.45\\n\\n}\\n\\n\\n\",\n \"file_path\": \"epaint/src/color.rs\",\n \"rank\": 69,\n \"score\": 200346.5979814853\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn linear_f32_from_linear_u8(a: u8) -> f32 {\\n\\n a as f32 / 255.0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"epaint/src/color.rs\",\n \"rank\": 70,\n \"score\": 200346.5979814853\n },\n {\n \"content\": \"/// gamma [0, 255] -> linear [0, 1].\\n\\npub fn linear_f32_from_gamma_u8(s: u8) -> f32 {\\n\\n if s <= 10 {\\n\\n s as f32 / 3294.6\\n\\n } else {\\n\\n ((s as f32 + 14.025) / 269.025).powf(2.4)\\n\\n }\\n\\n}\\n\\n\\n\\n/// linear [0, 255] -> linear [0, 1].\\n\\n/// Useful for alpha-channel.\\n\",\n \"file_path\": \"epaint/src/color.rs\",\n \"rank\": 71,\n \"score\": 200346.5979814853\n },\n {\n \"content\": \"fn move_and_resize_window(ctx: &Context, window_interaction: &WindowInteraction) -> Option<Rect> {\\n\\n window_interaction.set_cursor(ctx);\\n\\n let pointer_pos = ctx.input().pointer.interact_pos()?;\\n\\n let mut rect = window_interaction.start_rect; // prevent drift\\n\\n\\n\\n if window_interaction.is_resize() {\\n\\n if window_interaction.left {\\n\\n rect.min.x = ctx.round_to_pixel(pointer_pos.x);\\n\\n } else if window_interaction.right {\\n\\n rect.max.x = ctx.round_to_pixel(pointer_pos.x);\\n\\n }\\n\\n\\n\\n if window_interaction.top {\\n\\n rect.min.y = ctx.round_to_pixel(pointer_pos.y);\\n\\n } else if window_interaction.bottom {\\n\\n rect.max.y = ctx.round_to_pixel(pointer_pos.y);\\n\\n }\\n\\n } else {\\n\\n // Movement.\\n\\n\\n\",\n \"file_path\": \"egui/src/containers/window.rs\",\n \"rank\": 72,\n \"score\": 198880.32687673485\n },\n {\n \"content\": \"// A wrapper that allows the more idiomatic usage pattern: `ui.add(...)`\\n\\n/// Password entry field with ability to toggle character hiding.\\n\\n///\\n\\n/// ## Example:\\n\\n/// ``` ignore\\n\\n/// ui.add(password(&mut password));\\n\\n/// ```\\n\\npub fn password(text: &mut String) -> impl egui::Widget + '_ {\\n\\n move |ui: &mut egui::Ui| password_ui(ui, text)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/demo/password.rs\",\n \"rank\": 73,\n \"score\": 190864.305842794\n },\n {\n \"content\": \"fn delete_selected_ccursor_range<S: TextBuffer>(text: &mut S, [min, max]: [CCursor; 2]) -> CCursor {\\n\\n text.delete_char_range(min.index..max.index);\\n\\n CCursor {\\n\\n index: min.index,\\n\\n prefer_next_row: true,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/text_edit.rs\",\n \"rank\": 74,\n \"score\": 185719.3219992062\n },\n {\n \"content\": \"fn decrease_identation<S: TextBuffer>(ccursor: &mut CCursor, text: &mut S) {\\n\\n let line_start = find_line_start(text.as_ref(), *ccursor);\\n\\n\\n\\n let remove_len = if text.as_ref()[line_start.index..].starts_with('\\\\t') {\\n\\n Some(1)\\n\\n } else if text.as_ref()[line_start.index..]\\n\\n .chars()\\n\\n .take(text::TAB_SIZE)\\n\\n .all(|c| c == ' ')\\n\\n {\\n\\n Some(text::TAB_SIZE)\\n\\n } else {\\n\\n None\\n\\n };\\n\\n\\n\\n if let Some(len) = remove_len {\\n\\n text.delete_char_range(line_start.index..(line_start.index + len));\\n\\n if *ccursor != line_start {\\n\\n *ccursor -= len;\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"egui/src/widgets/text_edit.rs\",\n \"rank\": 75,\n \"score\": 182959.6558744192\n },\n {\n \"content\": \"pub fn screen_size_in_native_points() -> Option<egui::Vec2> {\\n\\n let window = web_sys::window()?;\\n\\n Some(egui::Vec2::new(\\n\\n window.inner_width().ok()?.as_f64()? as f32,\\n\\n window.inner_height().ok()?.as_f64()? as f32,\\n\\n ))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_web/src/lib.rs\",\n \"rank\": 76,\n \"score\": 182944.19914087895\n },\n {\n \"content\": \"fn tint_shape_towards(shape: &mut Shape, target: Color32) {\\n\\n epaint::shape_transform::adjust_colors(shape, &|color| {\\n\\n *color = crate::color::tint_color_towards(*color, target);\\n\\n });\\n\\n}\\n\",\n \"file_path\": \"egui/src/painter.rs\",\n \"rank\": 77,\n \"score\": 181804.40375164352\n },\n {\n \"content\": \"// Move text agent to text cursor's position, on desktop/laptop,\\n\\n// candidate window moves following text element (agent),\\n\\n// so it appears that the IME candidate window moves with text cursor.\\n\\n// On mobile devices, there is no need to do that.\\n\\nfn move_text_cursor(cursor: &Option<egui::Pos2>, canvas_id: &str) -> Option<()> {\\n\\n let style = text_agent().style();\\n\\n // Note: movint agent on mobile devices will lead to unpredictable scroll.\\n\\n if is_mobile() == Some(false) {\\n\\n cursor.as_ref().and_then(|&egui::Pos2 { x, y }| {\\n\\n let canvas = canvas_element(canvas_id)?;\\n\\n let y = y + (canvas.scroll_top() + canvas.offset_top()) as f32;\\n\\n let x = x + (canvas.scroll_left() + canvas.offset_left()) as f32;\\n\\n // Canvas is translated 50% horizontally in html.\\n\\n let x = x - canvas.offset_width() as f32 / 2.0;\\n\\n style.set_property(\\\"position\\\", \\\"absolute\\\").ok()?;\\n\\n style.set_property(\\\"top\\\", &(y.to_string() + \\\"px\\\")).ok()?;\\n\\n style.set_property(\\\"left\\\", &(x.to_string() + \\\"px\\\")).ok()\\n\\n })\\n\\n } else {\\n\\n style.set_property(\\\"position\\\", \\\"absolute\\\").ok()?;\\n\\n style.set_property(\\\"top\\\", \\\"0px\\\").ok()?;\\n\\n style.set_property(\\\"left\\\", \\\"0px\\\").ok()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"egui_web/src/lib.rs\",\n \"rank\": 78,\n \"score\": 180237.64206273062\n },\n {\n \"content\": \"pub fn screen_size_in_pixels(display: &glium::Display) -> Vec2 {\\n\\n let (width_in_pixels, height_in_pixels) = display.get_framebuffer_dimensions();\\n\\n vec2(width_in_pixels as f32, height_in_pixels as f32)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_glium/src/lib.rs\",\n \"rank\": 79,\n \"score\": 180016.82124804464\n },\n {\n \"content\": \"// TODO: improve and standardize `slider_vec2`\\n\\nfn slider_vec2<'a>(\\n\\n value: &'a mut Vec2,\\n\\n range: std::ops::RangeInclusive<f32>,\\n\\n text: &'a str,\\n\\n) -> impl Widget + 'a {\\n\\n move |ui: &mut crate::Ui| {\\n\\n ui.horizontal(|ui| {\\n\\n ui.add(Slider::new(&mut value.x, range.clone()).text(\\\"w\\\"));\\n\\n ui.add(Slider::new(&mut value.y, range.clone()).text(\\\"h\\\"));\\n\\n ui.label(text);\\n\\n })\\n\\n .response\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/style.rs\",\n \"rank\": 80,\n \"score\": 177775.37319783468\n },\n {\n \"content\": \"#[cfg(feature = \\\"syntect\\\")]\\n\\nstruct ColoredText(Vec<Vec<(syntect::highlighting::Style, String)>>);\\n\\n\\n\\n#[cfg(feature = \\\"syntect\\\")]\\n\\nimpl ColoredText {\\n\\n /// e.g. `text_with_extension(\\\"fn foo() {}\\\", \\\"rs\\\")`\\n\\n pub fn text_with_extension(text: &str, extension: &str) -> Option<ColoredText> {\\n\\n use syntect::easy::HighlightLines;\\n\\n use syntect::highlighting::ThemeSet;\\n\\n use syntect::parsing::SyntaxSet;\\n\\n use syntect::util::LinesWithEndings;\\n\\n\\n\\n let ps = SyntaxSet::load_defaults_newlines(); // should be cached and reused\\n\\n let ts = ThemeSet::load_defaults(); // should be cached and reused\\n\\n\\n\\n let syntax = ps.find_syntax_by_extension(extension)?;\\n\\n\\n\\n let mut h = HighlightLines::new(syntax, &ts.themes[\\\"base16-mocha.dark\\\"]);\\n\\n\\n\\n let lines = LinesWithEndings::from(text)\\n\\n .map(|line| {\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/http_app.rs\",\n \"rank\": 81,\n \"score\": 174179.6246202818\n },\n {\n \"content\": \"fn insert_text<S: TextBuffer>(ccursor: &mut CCursor, text: &mut S, text_to_insert: &str) {\\n\\n ccursor.index += text.insert_text(text_to_insert, ccursor.index);\\n\\n}\\n\\n\\n\\n// ----------------------------------------------------------------------------\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/text_edit.rs\",\n \"rank\": 82,\n \"score\": 173138.44605971093\n },\n {\n \"content\": \"fn delete_selected<S: TextBuffer>(text: &mut S, cursorp: &CursorPair) -> CCursor {\\n\\n let [min, max] = cursorp.sorted();\\n\\n delete_selected_ccursor_range(text, [min.ccursor, max.ccursor])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/text_edit.rs\",\n \"rank\": 83,\n \"score\": 170797.38162102585\n },\n {\n \"content\": \"#[derive(Clone)]\\n\\nstruct Flux<State> {\\n\\n start_time: f64,\\n\\n latest_change_time: f64,\\n\\n latest_state: State,\\n\\n}\\n\\n\\n\\nimpl<State> Undoer<State>\\n\\nwhere\\n\\n State: Clone + PartialEq,\\n\\n{\\n\\n /// Do we have an undo point different from the given state?\\n\\n pub fn has_undo(&self, current_state: &State) -> bool {\\n\\n match self.undos.len() {\\n\\n 0 => false,\\n\\n 1 => self.undos.back() != Some(current_state),\\n\\n _ => true,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Return true if the state is currently changing\\n\",\n \"file_path\": \"egui/src/util/undoer.rs\",\n \"rank\": 84,\n \"score\": 170572.39352899988\n },\n {\n \"content\": \"fn clamp_to_range(x: f32, range: RangeInclusive<f32>) -> f32 {\\n\\n x.clamp(\\n\\n range.start().min(*range.end()),\\n\\n range.start().max(*range.end()),\\n\\n )\\n\\n}\\n\",\n \"file_path\": \"egui/src/containers/panel.rs\",\n \"rank\": 85,\n \"score\": 169702.21881603982\n },\n {\n \"content\": \"fn delete_previous_char<S: TextBuffer>(text: &mut S, ccursor: CCursor) -> CCursor {\\n\\n if ccursor.index > 0 {\\n\\n let max_ccursor = ccursor;\\n\\n let min_ccursor = max_ccursor - 1;\\n\\n delete_selected_ccursor_range(text, [min_ccursor, max_ccursor])\\n\\n } else {\\n\\n ccursor\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/text_edit.rs\",\n \"rank\": 86,\n \"score\": 168796.92775360297\n },\n {\n \"content\": \"fn delete_next_char<S: TextBuffer>(text: &mut S, ccursor: CCursor) -> CCursor {\\n\\n delete_selected_ccursor_range(text, [ccursor, ccursor + 1])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/text_edit.rs\",\n \"rank\": 87,\n \"score\": 168796.92775360297\n },\n {\n \"content\": \"fn delete_next_word<S: TextBuffer>(text: &mut S, min_ccursor: CCursor) -> CCursor {\\n\\n let max_ccursor = ccursor_next_word(text.as_ref(), min_ccursor);\\n\\n delete_selected_ccursor_range(text, [min_ccursor, max_ccursor])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/text_edit.rs\",\n \"rank\": 88,\n \"score\": 166862.85358750433\n },\n {\n \"content\": \"fn delete_previous_word<S: TextBuffer>(text: &mut S, max_ccursor: CCursor) -> CCursor {\\n\\n let min_ccursor = ccursor_previous_word(text.as_ref(), max_ccursor);\\n\\n delete_selected_ccursor_range(text, [min_ccursor, max_ccursor])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui/src/widgets/text_edit.rs\",\n \"rank\": 89,\n \"score\": 166862.85358750433\n },\n {\n \"content\": \"pub fn read_ron<T>(ron_path: impl AsRef<Path>) -> Option<T>\\n\\nwhere\\n\\n T: serde::de::DeserializeOwned,\\n\\n{\\n\\n match std::fs::File::open(ron_path) {\\n\\n Ok(file) => {\\n\\n let reader = std::io::BufReader::new(file);\\n\\n match ron::de::from_reader(reader) {\\n\\n Ok(value) => Some(value),\\n\\n Err(err) => {\\n\\n eprintln!(\\\"ERROR: Failed to parse RON: {}\\\", err);\\n\\n None\\n\\n }\\n\\n }\\n\\n }\\n\\n Err(_err) => {\\n\\n // File probably doesn't exist. That's fine.\\n\\n None\\n\\n }\\n\\n }\\n\\n}\\n\\n// ----------------------------------------------------------------------------\\n\\n\\n\",\n \"file_path\": \"egui_glium/src/persistence.rs\",\n \"rank\": 90,\n \"score\": 165057.0376474284\n },\n {\n \"content\": \"/// If context is running under mobile device?\\n\\nfn is_mobile() -> Option<bool> {\\n\\n let user_agent = web_sys::window()?.navigator().user_agent().ok()?;\\n\\n let is_mobile = MOBILE_DEVICE.iter().any(|&name| user_agent.contains(name));\\n\\n Some(is_mobile)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_web/src/lib.rs\",\n \"rank\": 91,\n \"score\": 158198.21247841945\n },\n {\n \"content\": \"fn label_from_style(text: &str, style: &easy_mark::Style) -> Label {\\n\\n let easy_mark::Style {\\n\\n heading,\\n\\n quoted,\\n\\n code,\\n\\n strong,\\n\\n underline,\\n\\n strikethrough,\\n\\n italics,\\n\\n small,\\n\\n raised,\\n\\n } = *style;\\n\\n\\n\\n let small = small || raised; // Raised text is also smaller\\n\\n\\n\\n let mut label = Label::new(text);\\n\\n if heading && !small {\\n\\n label = label.heading().strong();\\n\\n }\\n\\n if small && !heading {\\n\",\n \"file_path\": \"egui_demo_lib/src/easy_mark/easy_mark_viewer.rs\",\n \"rank\": 92,\n \"score\": 156494.0846761277\n },\n {\n \"content\": \"pub fn set_cursor_icon(cursor: egui::CursorIcon) -> Option<()> {\\n\\n let document = web_sys::window()?.document()?;\\n\\n document\\n\\n .body()?\\n\\n .style()\\n\\n .set_property(\\\"cursor\\\", cursor_web_name(cursor))\\n\\n .ok()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_web/src/lib.rs\",\n \"rank\": 93,\n \"score\": 155633.01376496477\n },\n {\n \"content\": \"fn cursor_web_name(cursor: egui::CursorIcon) -> &'static str {\\n\\n match cursor {\\n\\n egui::CursorIcon::Alias => \\\"alias\\\",\\n\\n egui::CursorIcon::AllScroll => \\\"all-scroll\\\",\\n\\n egui::CursorIcon::Cell => \\\"cell\\\",\\n\\n egui::CursorIcon::ContextMenu => \\\"context-menu\\\",\\n\\n egui::CursorIcon::Copy => \\\"copy\\\",\\n\\n egui::CursorIcon::Crosshair => \\\"crosshair\\\",\\n\\n egui::CursorIcon::Default => \\\"default\\\",\\n\\n egui::CursorIcon::Grab => \\\"grab\\\",\\n\\n egui::CursorIcon::Grabbing => \\\"grabbing\\\",\\n\\n egui::CursorIcon::Help => \\\"help\\\",\\n\\n egui::CursorIcon::Move => \\\"move\\\",\\n\\n egui::CursorIcon::NoDrop => \\\"no-drop\\\",\\n\\n egui::CursorIcon::None => \\\"none\\\",\\n\\n egui::CursorIcon::NotAllowed => \\\"not-allowed\\\",\\n\\n egui::CursorIcon::PointingHand => \\\"pointer\\\",\\n\\n egui::CursorIcon::Progress => \\\"progress\\\",\\n\\n egui::CursorIcon::ResizeHorizontal => \\\"ew-resize\\\",\\n\\n egui::CursorIcon::ResizeNeSw => \\\"nesw-resize\\\",\\n\\n egui::CursorIcon::ResizeNwSe => \\\"nwse-resize\\\",\\n\\n egui::CursorIcon::ResizeVertical => \\\"ns-resize\\\",\\n\\n egui::CursorIcon::Text => \\\"text\\\",\\n\\n egui::CursorIcon::VerticalText => \\\"vertical-text\\\",\\n\\n egui::CursorIcon::Wait => \\\"wait\\\",\\n\\n egui::CursorIcon::ZoomIn => \\\"zoom-in\\\",\\n\\n egui::CursorIcon::ZoomOut => \\\"zoom-out\\\",\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_web/src/lib.rs\",\n \"rank\": 94,\n \"score\": 155633.01376496477\n },\n {\n \"content\": \"fn is_integer(f: f64) -> bool {\\n\\n f.round() == f\\n\\n}\\n\\n\\n\",\n \"file_path\": \"emath/src/smart_aim.rs\",\n \"rank\": 95,\n \"score\": 154583.46079302934\n },\n {\n \"content\": \"#[inline]\\n\\nfn is_chinese(c: char) -> bool {\\n\\n ('\\\\u{4E00}' <= c && c <= '\\\\u{9FFF}')\\n\\n || ('\\\\u{3400}' <= c && c <= '\\\\u{4DBF}')\\n\\n || ('\\\\u{2B740}' <= c && c <= '\\\\u{2B81F}')\\n\\n}\\n\\n\\n\",\n \"file_path\": \"epaint/src/text/font.rs\",\n \"rank\": 96,\n \"score\": 154583.46079302934\n },\n {\n \"content\": \"/// Cheap and ugly.\\n\\n/// Made for graying out disabled `Ui`:s.\\n\\npub fn tint_color_towards(color: Color32, target: Color32) -> Color32 {\\n\\n let [mut r, mut g, mut b, mut a] = color.to_array();\\n\\n\\n\\n if a == 0 {\\n\\n r /= 2;\\n\\n g /= 2;\\n\\n b /= 2;\\n\\n } else if a < 170 {\\n\\n // Cheapish and looks ok.\\n\\n // Works for e.g. grid stripes.\\n\\n let div = (2 * 255 / a as i32) as u8;\\n\\n r = r / 2 + target.r() / div;\\n\\n g = g / 2 + target.g() / div;\\n\\n b = b / 2 + target.b() / div;\\n\\n a /= 2;\\n\\n } else {\\n\\n r = r / 2 + target.r() / 2;\\n\\n g = g / 2 + target.g() / 2;\\n\\n b = b / 2 + target.b() / 2;\\n\\n }\\n\",\n \"file_path\": \"epaint/src/color.rs\",\n \"rank\": 97,\n \"score\": 154197.5456467208\n },\n {\n \"content\": \"#[inline]\\n\\nfn invisible_char(c: char) -> bool {\\n\\n // See https://github.com/emilk/egui/issues/336\\n\\n\\n\\n // From https://www.fileformat.info/info/unicode/category/Cf/list.htm\\n\\n ('\\\\u{200B}'..='\\\\u{206F}').contains(&c) // TODO: heed bidi characters\\n\\n}\\n\\n\\n\",\n \"file_path\": \"epaint/src/text/font.rs\",\n \"rank\": 98,\n \"score\": 152402.6618448578\n },\n {\n \"content\": \"#[derive(Default)]\\n\\nstruct TextureManager(HashMap<Gradient, TextureId>);\\n\\n\\n\\nimpl TextureManager {\\n\\n fn get(\\n\\n &mut self,\\n\\n tex_allocator: &mut dyn epi::TextureAllocator,\\n\\n gradient: &Gradient,\\n\\n ) -> TextureId {\\n\\n *self.0.entry(gradient.clone()).or_insert_with(|| {\\n\\n let pixels = gradient.to_pixel_row();\\n\\n let width = pixels.len();\\n\\n let height = 1;\\n\\n tex_allocator.alloc_srgba_premultiplied((width, height), &pixels)\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"egui_demo_lib/src/apps/color_test.rs\",\n \"rank\": 99,\n \"score\": 152171.14804814168\n }\n]","isConversational":false}}},{"rowIdx":987,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"crates/regex/src/re_set.rs"},"repo_name":{"kind":"string","value":"CryZe/libtww"},"commit":{"kind":"string","value":"0b8de9f451e7d8afda7a14d618bd3a7784b1d679"},"file_code":{"kind":"string","value":"\n\nmacro_rules! define_set {\n ($name:ident, $exec_build:expr, $text_ty:ty, $as_bytes:expr) => {\n pub mod $name {\n use libtww::std::fmt;\n use libtww::std::iter;\n use libtww::std::slice;\n use libtww::std::vec;\n\n use error::Error;\n use exec::{Exec, ExecBuilder};\n use re_trait::RegularExpression;\n\n#[derive(Clone)]\npub struct RegexSet(Exec);\n\nimpl RegexSet {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn new<I, S>(exprs: I) -> Result<RegexSet, Error>\n where S: AsRef<str>, I: IntoIterator<Item=S> {\n let exec = try!($exec_build(exprs));\n Ok(RegexSet(exec))\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn is_match(&self, text: $text_ty) -> bool {\n self.0.searcher().is_match_at($as_bytes(text), 0)\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn matches(&self, text: $text_ty) -> SetMatches {\n let mut matches = vec![false; self.0.regex_strings().len()];\n let any = self.0.searcher().many_matches_at(\n &mut matches, $as_bytes(text), 0);\n SetMatches {\n matched_any: any,\n matches: matches,\n }\n }\n\n \n pub fn len(&self) -> usize {\n self.0.regex_strings().len()\n }\n}\n\n#[derive(Clone, Debug)]\npub struct SetMatches {\n matched_any: bool,\n matches: Vec<bool>,\n}\n\nimpl SetMatches {\n \n pub fn matched_any(&self) -> bool {\n self.matched_any\n }\n\n \n \n \n \n \n \n \n \n pub fn matched(&self, regex_index: usize) -> bool {\n self.matches[regex_index]\n }\n\n \n pub fn len(&self) -> usize {\n self.matches.len()\n }\n\n \n pub fn iter(&self) -> SetMatchesIter {\n SetMatchesIter((&*self.matches).into_iter().enumerate())\n }\n}\n\nimpl IntoIterator for SetMatches {\n type IntoIter = SetMatchesIntoIter;\n type Item = usize;\n\n fn into_iter(self) -> Self::IntoIter {\n SetMatchesIntoIter(self.matches.into_iter().enumerate())\n }\n}\n\nimpl<'a> IntoIterator for &'a SetMatches {\n type IntoIter = SetMatchesIter<'a>;\n type Item = usize;\n\n fn into_iter(self) -> Self::IntoIter {\n self.iter()\n }\n}\n\npub struct SetMatchesIntoIter(iter::Enumerate<vec::IntoIter<bool>>);\n\nimpl Iterator for SetMatchesIntoIter {\n type Item = usize;\n\n fn next(&mut self) -> Option<usize> {\n loop {\n match self.0.next() {\n None => return None,\n Some((_, false)) => {}\n Some((i, true)) => return Some(i),\n }\n }\n }\n}\n\nimpl DoubleEndedIterator for SetMatchesIntoIter {\n fn next_back(&mut self) -> Option<usize> {\n loop {\n match self.0.next_back() {\n None => return None,\n Some((_, false)) => {}\n Some((i, true)) => return Some(i),\n }\n }\n }\n}\n\n#[derive(Clone)]\npub struct SetMatchesIter<'a>(iter::Enumerate<slice::Iter<'a, bool>>);\n\nimpl<'a> Iterator for SetMatchesIter<'a> {\n type Item = usize;\n\n fn next(&mut self) -> Option<usize> {\n loop {\n match self.0.next() {\n None => return None,\n Some((_, &false)) => {}\n Some((i, &true)) => return Some(i),\n }\n }\n }\n}\n\nimpl<'a> DoubleEndedIterator for SetMatchesIter<'a> {\n fn next_back(&mut self) -> Option<usize> {\n loop {\n match self.0.next_back() {\n None => return None,\n Some((_, &false)) => {}\n Some((i, &true)) => return Some(i),\n }\n }\n }\n}\n\n#[doc(hidden)]\nimpl From<Exec> for RegexSet {\n fn from(exec: Exec) -> Self {\n RegexSet(exec)\n }\n}\n\nimpl fmt::Debug for RegexSet {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"RegexSet({:?})\", self.0.regex_strings())\n }\n}\n\n#[allow(dead_code)] fn as_bytes_str(text: &str) -> &[u8] { text.as_bytes() }\n#[allow(dead_code)] fn as_bytes_bytes(text: &[u8]) -> &[u8] { text }\n }\n }\n}\n\ndefine_set! {\n unicode,\n |exprs| ExecBuilder::new_many(exprs).build(),\n &str,\n as_bytes_str\n}\n\ndefine_set! {\n bytes,\n |exprs| ExecBuilder::new_many(exprs).only_utf8(false).build(),\n &[u8],\n as_bytes_bytes\n}\n"},"prefix":{"kind":"string","value":"\n\nmacro_rules! define_set {\n ($name:ident, $exec_build:expr, $text_ty:ty, $as_bytes:expr) => {\n pub mod $name {\n use libtww::std::fmt;\n use libtww::std::iter;\n use libtww::std::slice;\n use libtww::std::vec;\n\n use error::Error;\n use exec::{Exec, ExecBuilder};\n use re_trait::RegularExpression;\n\n#[derive(Clone)]\npub struct RegexSet(Exec);\n\nimpl RegexSet {\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn new<I, S>(exprs: I) -> Result<RegexSet, Error>\n where S: AsRef<str>, I: IntoIterator<Item=S> {\n let exec = try!($exec_build(exprs));\n Ok(RegexSet(exec))\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn is_match(&self, text: $text_ty) -> bool {\n self.0.searcher().is_match_at($as_bytes(text), 0)\n }\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n pub fn matches(&self, text: $text_ty) -> SetMatches {\n let mut matches = vec![false; self.0.regex_strings().len()];\n let any = self.0.searcher().many_matches_at(\n &mut matches, $as_bytes(text), 0);\n SetMatches {\n matched_any: any,\n matches: matches,\n }\n }\n\n \n pub fn len(&self) -> usize {\n self.0.regex_strings().len()\n }\n}\n\n#[derive(Clone, Debug)]\npub struct SetMatches {\n matched_any: bool,\n matches: Vec<bool>,\n}\n\nimpl SetMatches {\n \n pub fn matched_any(&self) -> bool {\n self.matched_any\n }\n\n \n \n \n \n \n \n \n \n pub fn matched(&self, regex_index: usize) -> bool {\n self.matches[regex_index]\n }\n\n \n pub fn len(&self) -> usize {\n self.matches.len()\n }\n\n \n pub fn iter(&self) -> SetMatchesIter {\n SetMatchesIter((&*self.matches).into_iter().enumerate())\n }\n}\n\nimpl IntoIterator for SetMatches {\n type IntoIter = SetMatchesIntoIter;\n type Item = usize;\n\n fn into_iter(self) -> Self::IntoIter {\n SetMatchesIntoIter(self.matches.into_iter().enumerate())\n }\n}\n\nimpl<'a> IntoIterator for &'a SetMatches {\n type IntoIter = SetMatchesIter<'a>;\n type Item = usize;\n\n fn into_iter(self) -> Self::IntoIter {\n self.iter()\n }\n}\n\npub struct SetMatchesIntoIter(iter::Enumerate<vec::IntoIter<bool>>);\n\nimpl Iterator for SetMatchesIntoIter {\n type Item = usize;\n\n fn next(&mut self) -> Option"},"suffix":{"kind":"string","value":"dedIterator for SetMatchesIter<'a> {\n fn next_back(&mut self) -> Option<usize> {\n loop {\n match self.0.next_back() {\n None => return None,\n Some((_, &false)) => {}\n Some((i, &true)) => return Some(i),\n }\n }\n }\n}\n\n#[doc(hidden)]\nimpl From<Exec> for RegexSet {\n fn from(exec: Exec) -> Self {\n RegexSet(exec)\n }\n}\n\nimpl fmt::Debug for RegexSet {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"RegexSet({:?})\", self.0.regex_strings())\n }\n}\n\n#[allow(dead_code)] fn as_bytes_str(text: &str) -> &[u8] { text.as_bytes() }\n#[allow(dead_code)] fn as_bytes_bytes(text: &[u8]) -> &[u8] { text }\n }\n }\n}\n\ndefine_set! {\n unicode,\n |exprs| ExecBuilder::new_many(exprs).build(),\n &str,\n as_bytes_str\n}\n\ndefine_set! {\n bytes,\n |exprs| ExecBuilder::new_many(exprs).only_utf8(false).build(),\n &[u8],\n as_bytes_bytes\n}\n"},"middle":{"kind":"string","value":"<usize> {\n loop {\n match self.0.next() {\n None => return None,\n Some((_, false)) => {}\n Some((i, true)) => return Some(i),\n }\n }\n }\n}\n\nimpl DoubleEndedIterator for SetMatchesIntoIter {\n fn next_back(&mut self) -> Option<usize> {\n loop {\n match self.0.next_back() {\n None => return None,\n Some((_, false)) => {}\n Some((i, true)) => return Some(i),\n }\n }\n }\n}\n\n#[derive(Clone)]\npub struct SetMatchesIter<'a>(iter::Enumerate<slice::Iter<'a, bool>>);\n\nimpl<'a> Iterator for SetMatchesIter<'a> {\n type Item = usize;\n\n fn next(&mut self) -> Option<usize> {\n loop {\n match self.0.next() {\n None => return None,\n Some((_, &false)) => {}\n Some((i, &true)) => return Some(i),\n }\n }\n }\n}\n\nimpl<'a> DoubleEn"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"/// Tests if the given regular expression matches somewhere in the text given.\n\n///\n\n/// If there was a problem compiling the regular expression, an error is\n\n/// returned.\n\n///\n\n/// To find submatches, split or replace text, you'll need to compile an\n\n/// expression first.\n\npub fn is_match(regex: &str, text: &str) -> Result<bool, Error> {\n\n Regex::new(regex).map(|r| r.is_match(text))\n\n}\n\n\n\n/// A compiled regular expression for matching Unicode strings.\n\n///\n\n/// It is represented as either a sequence of bytecode instructions (dynamic)\n\n/// or as a specialized Rust function (native). It can be used to search, split\n\n/// or replace text. All searching is done with an implicit `.*?` at the\n\n/// beginning and end of an expression. To force an expression to match the\n\n/// whole string (or a prefix or a suffix), you must use an anchor like `^` or\n\n/// `$` (or `\\A` and `\\z`).\n\n///\n\n/// While this crate will handle Unicode strings (whether in the regular\n\n/// expression or in the search text), all positions returned are **byte\n\n/// indices**. Every byte index is guaranteed to be at a Unicode code point\n\n/// boundary.\n\n///\n\n/// The lifetimes `'r` and `'t` in this crate correspond to the lifetime of a\n\n/// compiled regular expression and text to search, respectively.\n","file_path":"crates/regex/src/re_unicode.rs","rank":0,"score":369525.8213242965},{"content":"/// Returns true iff the given regex and input should be executed by this\n\n/// engine with reasonable memory usage.\n\npub fn should_exec(num_insts: usize, text_len: usize) -> bool {\n\n // Total memory usage in bytes is determined by:\n\n //\n\n // ((len(insts) * (len(input) + 1) + bits - 1) / bits) * (size_of(u32))\n\n //\n\n // The actual limit picked is pretty much a heuristic.\n\n // See: https://github.com/rust-lang-nursery/regex/issues/215\n\n let size = ((num_insts * (text_len + 1) + BIT_SIZE - 1) / BIT_SIZE) * 4;\n\n size <= MAX_SIZE_BYTES\n\n}\n\n\n\n/// A backtracking matching engine.\n\n#[derive(Debug)]\n\npub struct Bounded<'a, 'm, 'r, 's, I> {\n\n prog: &'r Program,\n\n input: I,\n\n matches: &'m mut [bool],\n\n slots: &'s mut [Slot],\n\n m: &'a mut Cache,\n\n}\n","file_path":"crates/regex/src/backtrack.rs","rank":1,"score":348370.78929305903},{"content":"fn match_digits(ss: &mut &str, min_digits : usize, max_digits: usize, ws: bool) -> Option<i32> {\n\n match match_digits_i64(ss, min_digits, max_digits, ws) {\n\n Some(v) => Some(v as i32),\n\n None => None\n\n }\n\n}\n\n\n","file_path":"crates/time/src/parse.rs","rank":2,"score":318946.6122572385},{"content":"fn match_digits_i64(ss: &mut &str, min_digits : usize, max_digits: usize, ws: bool) -> Option<i64> {\n\n let mut value : i64 = 0;\n\n let mut n = 0;\n\n if ws {\n\n let s2 = ss.trim_left_matches(\" \");\n\n n = ss.len() - s2.len();\n\n if n > max_digits { return None }\n\n }\n\n let chars = ss[n..].char_indices();\n\n for (_, ch) in chars.take(max_digits - n) {\n\n match ch {\n\n '0' ... '9' => value = value * 10 + (ch as i64 - '0' as i64),\n\n _ => break,\n\n }\n\n n += 1;\n\n }\n\n\n\n if n >= min_digits && n <= max_digits {\n\n *ss = &ss[n..];\n\n Some(value)\n\n } else {\n\n None\n\n }\n\n}\n\n\n","file_path":"crates/time/src/parse.rs","rank":3,"score":314223.4581688106},{"content":"// Iterate through `iter` while it matches `prefix`; return `None` if `prefix`\n\n// is not a prefix of `iter`, otherwise return `Some(iter_after_prefix)` giving\n\n// `iter` after having exhausted `prefix`.\n\nfn iter_after<A, I, J>(mut iter: I, mut prefix: J) -> Option<I>\n\n where I: Iterator<Item = A> + Clone,\n\n J: Iterator<Item = A>,\n\n A: PartialEq\n\n{\n\n loop {\n\n let mut iter_next = iter.clone();\n\n match (iter_next.next(), prefix.next()) {\n\n (Some(ref x), Some(ref y)) if x == y => (),\n\n (Some(_), Some(_)) => return None,\n\n (Some(_), None) => return Some(iter),\n\n (None, None) => return Some(iter),\n\n (None, Some(_)) => return None,\n\n }\n\n iter = iter_next;\n\n }\n\n}\n\n\n","file_path":"src/system/path.rs","rank":4,"score":302600.7622541302},{"content":"#[allow(dead_code)]\n\n#[inline]\n\npub fn encode_utf8(character: char, dst: &mut [u8]) -> Option<usize> {\n\n let code = character as u32;\n\n if code <= 0x7F && !dst.is_empty() {\n\n dst[0] = code as u8;\n\n Some(1)\n\n } else if code <= 0x7FF && dst.len() >= 2 {\n\n dst[0] = (code >> 6 & 0x1F) as u8 | TAG_TWO;\n\n dst[1] = (code & 0x3F) as u8 | TAG_CONT;\n\n Some(2)\n\n } else if code <= 0xFFFF && dst.len() >= 3 {\n\n dst[0] = (code >> 12 & 0x0F) as u8 | TAG_THREE;\n\n dst[1] = (code >> 6 & 0x3F) as u8 | TAG_CONT;\n\n dst[2] = (code & 0x3F) as u8 | TAG_CONT;\n\n Some(3)\n\n } else if dst.len() >= 4 {\n\n dst[0] = (code >> 18 & 0x07) as u8 | TAG_FOUR;\n\n dst[1] = (code >> 12 & 0x3F) as u8 | TAG_CONT;\n\n dst[2] = (code >> 6 & 0x3F) as u8 | TAG_CONT;\n\n dst[3] = (code & 0x3F) as u8 | TAG_CONT;\n\n Some(4)\n","file_path":"crates/regex/src/utf8.rs","rank":5,"score":302195.4791308948},{"content":"#[inline]\n\npub fn encode_utf8(character: char, dst: &mut [u8]) -> Option<usize> {\n\n let code = character as u32;\n\n if code < MAX_ONE_B && !dst.is_empty() {\n\n dst[0] = code as u8;\n\n Some(1)\n\n } else if code < MAX_TWO_B && dst.len() >= 2 {\n\n dst[0] = (code >> 6 & 0x1F) as u8 | TAG_TWO_B;\n\n dst[1] = (code & 0x3F) as u8 | TAG_CONT;\n\n Some(2)\n\n } else if code < MAX_THREE_B && dst.len() >= 3 {\n\n dst[0] = (code >> 12 & 0x0F) as u8 | TAG_THREE_B;\n\n dst[1] = (code >> 6 & 0x3F) as u8 | TAG_CONT;\n\n dst[2] = (code & 0x3F) as u8 | TAG_CONT;\n\n Some(3)\n\n } else if dst.len() >= 4 {\n\n dst[0] = (code >> 18 & 0x07) as u8 | TAG_FOUR_B;\n\n dst[1] = (code >> 12 & 0x3F) as u8 | TAG_CONT;\n\n dst[2] = (code >> 6 & 0x3F) as u8 | TAG_CONT;\n\n dst[3] = (code & 0x3F) as u8 | TAG_CONT;\n\n Some(4)\n\n } else {\n\n None\n\n }\n\n}\n","file_path":"crates/utf8-ranges/src/char_utf8.rs","rank":6,"score":292542.5575042928},{"content":"#[inline]\n\npub fn checked_pow<T: Clone + One + CheckedMul>(mut base: T, mut exp: usize) -> Option<T> {\n\n if exp == 0 {\n\n return Some(T::one());\n\n }\n\n\n\n macro_rules! optry {\n\n ( $ expr : expr ) => {\n\n if let Some(val) = $expr { val } else { return None }\n\n }\n\n }\n\n\n\n while exp & 1 == 0 {\n\n base = optry!(base.checked_mul(&base));\n\n exp >>= 1;\n\n }\n\n if exp == 1 {\n\n return Some(base);\n\n }\n\n\n\n let mut acc = base.clone();\n\n while exp > 1 {\n\n exp >>= 1;\n\n base = optry!(base.checked_mul(&base));\n\n if exp & 1 == 1 {\n\n acc = optry!(acc.checked_mul(&base));\n\n }\n\n }\n\n Some(acc)\n\n}\n","file_path":"crates/num/traits/src/pow.rs","rank":7,"score":277576.94251781714},{"content":"/// Return true if and only if the given program can be executed by a DFA.\n\n///\n\n/// Generally, a DFA is always possible. A pathological case where it is not\n\n/// possible is if the number of NFA states exceeds u32::MAX, in which case,\n\n/// this function will return false.\n\n///\n\n/// This function will also return false if the given program has any Unicode\n\n/// instructions (Char or Ranges) since the DFA operates on bytes only.\n\npub fn can_exec(insts: &Program) -> bool {\n\n use prog::Inst::*;\n\n // If for some reason we manage to allocate a regex program with more\n\n // than i32::MAX instructions, then we can't execute the DFA because we\n\n // use 32 bit instruction pointer deltas for memory savings.\n\n // If i32::MAX is the largest positive delta,\n\n // then -i32::MAX == i32::MIN + 1 is the largest negative delta,\n\n // and we are OK to use 32 bits.\n\n if insts.len() > ::libtww::std::i32::MAX as usize {\n\n return false;\n\n }\n\n for inst in insts {\n\n match *inst {\n\n Char(_) | Ranges(_) => return false,\n\n EmptyLook(_) | Match(_) | Save(_) | Split(_) | Bytes(_) => {}\n\n }\n\n }\n\n true\n\n}\n\n\n","file_path":"crates/regex/src/dfa.rs","rank":8,"score":273910.85926777753},{"content":"/// Returns the smallest possible index of the next valid UTF-8 sequence\n\n/// starting after `i`.\n\npub fn next_utf8(text: &[u8], i: usize) -> usize {\n\n let b = match text.get(i) {\n\n None => return i + 1,\n\n Some(&b) => b,\n\n };\n\n let inc = if b <= 0x7F {\n\n 1\n\n } else if b <= 0b110_11111 {\n\n 2\n\n } else if b <= 0b1110_1111 {\n\n 3\n\n } else {\n\n 4\n\n };\n\n i + inc\n\n}\n\n\n\n/// Encode the given Unicode character to `dst` as a single UTF-8 sequence.\n\n///\n\n/// If `dst` is not long enough, then `None` is returned. Otherwise, the number\n\n/// of bytes written is returned.\n","file_path":"crates/regex/src/utf8.rs","rank":9,"score":272793.01972902124},{"content":"fn match_str(s: &mut &str, needle: &str) -> bool {\n\n if s.starts_with(needle) {\n\n *s = &s[needle.len()..];\n\n true\n\n } else {\n\n false\n\n }\n\n}\n\n\n","file_path":"crates/time/src/parse.rs","rank":10,"score":258604.53662282825},{"content":"/// Tries to format given arguments with given formatting items.\n\n/// Internally used by `DelayedFormat`.\n\npub fn format<'a, I>(w: &mut fmt::Formatter,\n\n date: Option<&NaiveDate>,\n\n time: Option<&NaiveTime>,\n\n off: Option<&(String, Duration)>,\n\n items: I)\n\n -> fmt::Result\n\n where I: Iterator<Item = Item<'a>>\n\n{\n\n // full and abbreviated month and weekday names\n\n static SHORT_MONTHS: [&'static str; 12] = [\"Jan\", \"Feb\", \"Mar\", \"Apr\", \"May\", \"Jun\", \"Jul\",\n\n \"Aug\", \"Sep\", \"Oct\", \"Nov\", \"Dec\"];\n\n static LONG_MONTHS: [&'static str; 12] = [\"January\",\n\n \"February\",\n\n \"March\",\n\n \"April\",\n\n \"May\",\n\n \"June\",\n\n \"July\",\n\n \"August\",\n\n \"September\",\n","file_path":"crates/chrono/src/format/mod.rs","rank":11,"score":257442.7441833754},{"content":"/// Base functionality for all errors in Rust.\n\npub trait Error: Debug + Display + Reflect {\n\n /// A short description of the error.\n\n ///\n\n /// The description should not contain newlines or sentence-ending\n\n /// punctuation, to facilitate embedding in larger user-facing\n\n /// strings.\n\n ///\n\n /// # Examples\n\n ///\n\n /// ```\n\n /// use std::error::Error;\n\n ///\n\n /// match \"xc\".parse::<u32>() {\n\n /// Err(e) => {\n\n /// println!(\"Error: {}\", e.description());\n\n /// }\n\n /// _ => println!(\"No error\"),\n\n /// }\n\n /// ```\n\n fn description(&self) -> &str;\n","file_path":"src/system/error.rs","rank":12,"score":255098.22362046636},{"content":"pub fn event_cancel() -> bool {\n\n memory::read(0x803BD3A3)\n\n}\n\n\n","file_path":"src/game/event.rs","rank":13,"score":255017.30957531842},{"content":"pub fn is_pause_menu_up() -> bool {\n\n read(0x803EA537) // alternative: 0x80396228\n\n}\n\n\n","file_path":"src/system/tww.rs","rank":14,"score":255017.30957531842},{"content":"#[inline(always)] // reduces constant overhead\n\npub fn memrchr(needle: u8, haystack: &[u8]) -> Option<usize> {\n\n\n\n fn memrchr_specific(needle: u8, haystack: &[u8]) -> Option<usize> {\n\n fallback::memrchr(needle, haystack)\n\n }\n\n\n\n memrchr_specific(needle, haystack)\n\n}\n\n\n\nmod fallback {\n\n use std::cmp;\n\n use super::{USIZE_BYTES, contains_zero_byte, repeat_byte};\n\n\n\n /// Return the first index matching the byte `a` in `text`.\n\n pub fn memchr(x: u8, text: &[u8]) -> Option<usize> {\n\n // Scan for a single byte value by reading two `usize` words at a time.\n\n //\n\n // Split `text` in three parts\n\n // - unaligned inital part, before the first word aligned address in text\n\n // - body, scan by 2 words at a time\n","file_path":"src/system/memchr.rs","rank":15,"score":253398.16734351212},{"content":"#[inline(always)] // reduces constant overhead\n\npub fn memchr(needle: u8, haystack: &[u8]) -> Option<usize> {\n\n fn memchr_specific(needle: u8, haystack: &[u8]) -> Option<usize> {\n\n fallback::memchr(needle, haystack)\n\n }\n\n\n\n memchr_specific(needle, haystack)\n\n}\n\n\n\n/// A safe interface to `memrchr`.\n\n///\n\n/// Returns the index corresponding to the last occurrence of `needle` in\n\n/// `haystack`, or `None` if one is not found.\n\n///\n\n/// # Example\n\n///\n\n/// This shows how to find the last position of a byte in a byte string.\n\n///\n\n/// ```rust\n\n/// use memchr::memrchr;\n\n///\n\n/// let haystack = b\"the quick brown fox\";\n\n/// assert_eq!(memrchr(b'o', haystack), Some(17));\n\n/// ```\n","file_path":"src/system/memchr.rs","rank":16,"score":253398.16734351212},{"content":"#[inline]\n\npub fn decode_utf8(src: &[u8]) -> Option<(char, usize)> {\n\n let b0 = match src.get(0) {\n\n None => return None,\n\n Some(&b) if b <= 0x7F => return Some((b as char, 1)),\n\n Some(&b) => b,\n\n };\n\n match b0 {\n\n 0b110_00000...0b110_11111 => {\n\n if src.len() < 2 {\n\n return None;\n\n }\n\n let b1 = src[1];\n\n let cp = ((b0 & !TAG_TWO) as u32) << 6 | ((b1 & !TAG_CONT) as u32);\n\n match cp {\n\n 0x80...0x7FF => char::from_u32(cp).map(|cp| (cp, 2)),\n\n _ => None,\n\n }\n\n }\n\n 0b1110_0000...0b1110_1111 => {\n\n if src.len() < 3 {\n","file_path":"crates/regex/src/utf8.rs","rank":17,"score":253384.1926516733},{"content":"/// Randomly sample up to `amount` elements from an iterator.\n\n///\n\n/// # Example\n\n///\n\n/// ```rust\n\n/// use rand::{thread_rng, sample};\n\n///\n\n/// let mut rng = thread_rng();\n\n/// let sample = sample(&mut rng, 1..100, 5);\n\n/// println!(\"{:?}\", sample);\n\n/// ```\n\npub fn sample<T, I, R>(rng: &mut R, iterable: I, amount: usize) -> Vec<T>\n\n where I: IntoIterator<Item = T>,\n\n R: Rng\n\n{\n\n let mut iter = iterable.into_iter();\n\n let mut reservoir: Vec<T> = iter.by_ref().take(amount).collect();\n\n // continue unless the iterator was exhausted\n\n if reservoir.len() == amount {\n\n for (i, elem) in iter.enumerate() {\n\n let k = rng.gen_range(0, i + 1 + amount);\n\n if let Some(spot) = reservoir.get_mut(k) {\n\n *spot = elem;\n\n }\n\n }\n\n }\n\n reservoir\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n","file_path":"crates/rand/src/lib.rs","rank":18,"score":251955.50998658492},{"content":"pub fn is_new_game_plus() -> bool {\n\n read(0x803B82A8)\n\n}\n\n\n","file_path":"src/game/savefile.rs","rank":19,"score":250710.30468077626},{"content":"/// Returns an encoding from Windows code page number.\n\n/// http://msdn.microsoft.com/en-us/library/windows/desktop/dd317756%28v=vs.85%29.aspx\n\n/// Sometimes it can return a *superset* of the requested encoding, e.g. for several CJK encodings.\n\npub fn encoding_from_windows_code_page(cp: usize) -> Option<EncodingRef> {\n\n match cp {\n\n 65001 => Some(all::UTF_8 as EncodingRef),\n\n 866 => Some(all::IBM866 as EncodingRef),\n\n 28591 => Some(all::ISO_8859_1 as EncodingRef),\n\n 28592 => Some(all::ISO_8859_2 as EncodingRef),\n\n 28593 => Some(all::ISO_8859_3 as EncodingRef),\n\n 28594 => Some(all::ISO_8859_4 as EncodingRef),\n\n 28595 => Some(all::ISO_8859_5 as EncodingRef),\n\n 28596 => Some(all::ISO_8859_6 as EncodingRef),\n\n 28597 => Some(all::ISO_8859_7 as EncodingRef),\n\n 28598 => Some(all::ISO_8859_8 as EncodingRef),\n\n 38598 => Some(all::whatwg::ISO_8859_8_I as EncodingRef),\n\n 28603 => Some(all::ISO_8859_13 as EncodingRef),\n\n 28605 => Some(all::ISO_8859_15 as EncodingRef),\n\n 20866 => Some(all::KOI8_R as EncodingRef),\n\n 21866 => Some(all::KOI8_U as EncodingRef),\n\n 10000 => Some(all::MAC_ROMAN as EncodingRef),\n\n 874 => Some(all::WINDOWS_874 as EncodingRef),\n\n 1250 => Some(all::WINDOWS_1250 as EncodingRef),\n","file_path":"crates/encoding/src/label.rs","rank":20,"score":250037.10002328246},{"content":"fn read_one_byte(reader: &mut Read) -> Option<Result<u8>> {\n\n let mut buf = [0];\n\n loop {\n\n return match reader.read(&mut buf) {\n\n Ok(0) => None,\n\n Ok(..) => Some(Ok(buf[0])),\n\n Err(ref e) if e.kind() == ErrorKind::Interrupted => continue,\n\n Err(e) => Some(Err(e)),\n\n };\n\n }\n\n}\n\n\n\n/// An iterator over `u8` values of a reader.\n\n///\n\n/// This struct is generally created by calling [`bytes()`][bytes] on a reader.\n\n/// Please see the documentation of `bytes()` for more details.\n\n///\n\n/// [bytes]: trait.Read.html#method.bytes\n\npub struct Bytes<R> {\n\n inner: R,\n","file_path":"src/system/io/mod.rs","rank":21,"score":249415.50375555747},{"content":"/// Like decode_utf8, but decodes the last UTF-8 sequence in `src` instead of\n\n/// the first.\n\npub fn decode_last_utf8(src: &[u8]) -> Option<(char, usize)> {\n\n if src.is_empty() {\n\n return None;\n\n }\n\n let mut start = src.len() - 1;\n\n if src[start] <= 0x7F {\n\n return Some((src[start] as char, 1));\n\n }\n\n while start > src.len().saturating_sub(4) {\n\n start -= 1;\n\n if is_start_byte(src[start]) {\n\n break;\n\n }\n\n }\n\n match decode_utf8(&src[start..]) {\n\n None => None,\n\n Some((_, n)) if n < src.len() - start => None,\n\n Some((cp, n)) => Some((cp, n)),\n\n }\n\n}\n\n\n","file_path":"crates/regex/src/utf8.rs","rank":22,"score":249015.2626778964},{"content":"#[inline(always)] // reduces constant overhead\n\npub fn memchr(needle: u8, haystack: &[u8]) -> Option<usize> {\n\n fn memchr_specific(needle: u8, haystack: &[u8]) -> Option<usize> {\n\n fallback::memchr(needle, haystack)\n\n }\n\n\n\n memchr_specific(needle, haystack)\n\n}\n\n\n\n/// A safe interface to `memrchr`.\n\n///\n\n/// Returns the index corresponding to the last occurrence of `needle` in\n\n/// `haystack`, or `None` if one is not found.\n\n///\n\n/// # Example\n\n///\n\n/// This shows how to find the last position of a byte in a byte string.\n\n///\n\n/// ```rust\n\n/// use memchr::memrchr;\n\n///\n\n/// let haystack = b\"the quick brown fox\";\n\n/// assert_eq!(memrchr(b'o', haystack), Some(17));\n\n/// ```\n","file_path":"crates/memchr/src/lib.rs","rank":23,"score":248796.0544518493},{"content":"#[inline(always)] // reduces constant overhead\n\npub fn memrchr(needle: u8, haystack: &[u8]) -> Option<usize> {\n\n\n\n fn memrchr_specific(needle: u8, haystack: &[u8]) -> Option<usize> {\n\n fallback::memrchr(needle, haystack)\n\n }\n\n\n\n memrchr_specific(needle, haystack)\n\n}\n\n\n","file_path":"crates/memchr/src/lib.rs","rank":24,"score":248796.0544518493},{"content":"/// Tries to parse given string into `parsed` with given formatting items.\n\n/// Returns `Ok` when the entire string has been parsed (otherwise `parsed` should not be used).\n\n/// There should be no trailing string after parsing;\n\n/// use a stray [`Item::Space`](./enum.Item.html#variant.Space) to trim whitespaces.\n\n///\n\n/// This particular date and time parser is:\n\n///\n\n/// - Greedy. It will consume the longest possible prefix.\n\n/// For example, `April` is always consumed entirely when the long month name is requested;\n\n/// it equally accepts `Apr`, but prefers the longer prefix in this case.\n\n///\n\n/// - Padding-agnostic (for numeric items).\n\n/// The [`Pad`](./enum.Pad.html) field is completely ignored,\n\n/// so one can prepend any number of whitespace then any number of zeroes before numbers.\n\n///\n\n/// - (Still) obeying the intrinsic parsing width. This allows, for example, parsing `HHMMSS`.\n\npub fn parse<'a, I>(parsed: &mut Parsed, mut s: &str, items: I) -> ParseResult<()>\n\n where I: Iterator<Item = Item<'a>>\n\n{\n\n macro_rules! try_consume {\n\n ($e:expr) => ({ let (s_, v) = try!($e); s = s_; v })\n\n }\n\n\n\n for item in items {\n\n match item {\n\n Item::Literal(prefix) => {\n\n if s.len() < prefix.len() {\n\n return Err(TOO_SHORT);\n\n }\n\n if !s.starts_with(prefix) {\n\n return Err(INVALID);\n\n }\n\n s = &s[prefix.len()..];\n\n }\n\n\n\n Item::Space(_) => {\n","file_path":"crates/chrono/src/format/parse.rs","rank":25,"score":245298.5475246195},{"content":"pub fn set_event_cancel(b: bool) {\n\n memory::write(0x803BD3A3, b);\n\n}\n","file_path":"src/game/event.rs","rank":26,"score":242898.84684095831},{"content":"pub fn is_teddy_128_available() -> bool {\n\n true\n\n}\n\n\n\n/// Match reports match information.\n\n#[derive(Debug, Clone)]\n\npub struct Match {\n\n /// The index of the pattern that matched. The index is in correspondence\n\n /// with the order of the patterns given at construction.\n\n pub pat: usize,\n\n /// The start byte offset of the match.\n\n pub start: usize,\n\n /// The end byte offset of the match. This is always `start + pat.len()`.\n\n pub end: usize,\n\n}\n\n\n\n/// A SIMD accelerated multi substring searcher.\n\n#[derive(Debug, Clone)]\n\npub struct Teddy {\n\n /// A list of substrings to match.\n","file_path":"crates/regex/src/simd_accel/teddy128.rs","rank":27,"score":242804.8367670538},{"content":"pub fn is_teddy_128_available() -> bool {\n\n false\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct Teddy(());\n\n\n\n#[derive(Debug, Clone)]\n\npub struct Match {\n\n pub pat: usize,\n\n pub start: usize,\n\n pub end: usize,\n\n}\n\n\n\nimpl Teddy {\n\n pub fn new(_pats: &syntax::Literals) -> Option<Teddy> { None }\n\n pub fn patterns(&self) -> &[Vec<u8>] { &[] }\n\n pub fn len(&self) -> usize { 0 }\n\n pub fn approximate_size(&self) -> usize { 0 }\n\n pub fn find(&self, _haystack: &[u8]) -> Option<Match> { None }\n\n}\n","file_path":"crates/regex/src/simd_fallback/teddy128.rs","rank":28,"score":242804.8367670538},{"content":"fn position(needle: &[u8], mut haystack: &[u8]) -> Option<usize> {\n\n let mut i = 0;\n\n while haystack.len() >= needle.len() {\n\n if needle == &haystack[..needle.len()] {\n\n return Some(i);\n\n }\n\n i += 1;\n\n haystack = &haystack[1..];\n\n }\n\n None\n\n}\n\n\n","file_path":"crates/regex/regex-syntax/src/literals.rs","rank":29,"score":240837.88700221514},{"content":"pub fn spawn(coord: &Coord, item: u8) {\n\n layer::switch_to_safe_layer();\n\n\n\n let func =\n\n unsafe { transmute::<Addr, extern \"C\" fn(*const Coord, u8, u32, u32, u32)>(0x80026920) };\n\n func(coord, item, 0x7f, 0, 0);\n\n}\n","file_path":"src/link/item.rs","rank":30,"score":240745.15362500364},{"content":"/// Determines whether the character is one of the permitted path\n\n/// separators for the current platform.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use std::path;\n\n///\n\n/// assert!(path::is_separator('/'));\n\n/// assert!(!path::is_separator('❤'));\n\n/// ```\n\npub fn is_separator(c: char) -> bool {\n\n c.is_ascii() && is_sep_byte(c as u8)\n\n}\n\n\n\n/// The primary separator for the current platform\n\npub const MAIN_SEPARATOR: char = MAIN_SEP;\n\n\n\n/// /////////////////////////////////////////////////////////////////////////////\n\n/// Misc helpers\n\n/// /////////////////////////////////////////////////////////////////////////////\n\n\n","file_path":"src/system/path.rs","rank":31,"score":240466.4492435412},{"content":"pub fn is_down(buttons: u16) -> bool {\n\n buttons_down() & buttons == buttons\n\n}\n\n\n","file_path":"src/game/controller.rs","rank":32,"score":240461.55716703238},{"content":"fn match_strs(ss: &mut &str, strs: &[(&str, i32)]) -> Option<i32> {\n\n for &(needle, value) in strs.iter() {\n\n if match_str(ss, needle) {\n\n return Some(value)\n\n }\n\n }\n\n None\n\n}\n\n\n","file_path":"crates/time/src/parse.rs","rank":33,"score":236732.5951279308},{"content":"#[inline]\n\npub fn is_sep_byte(b: u8) -> bool {\n\n b == b'/'\n\n}\n\n\n","file_path":"src/system/path.rs","rank":34,"score":236154.5522724902},{"content":"#[inline]\n\npub fn is_verbatim_sep(b: u8) -> bool {\n\n b == b'/'\n\n}\n\n\n","file_path":"src/system/path.rs","rank":35,"score":236154.5522724902},{"content":"pub fn is_pressed(buttons: u16) -> bool {\n\n buttons_pressed() & buttons == buttons\n\n}\n","file_path":"src/game/controller.rs","rank":36,"score":236154.5522724902},{"content":"/// Like `memchr`, but searches for two bytes instead of one.\n\npub fn memchr2(needle1: u8, needle2: u8, haystack: &[u8]) -> Option<usize> {\n\n use libtww::std::cmp;\n\n\n\n fn slow(b1: u8, b2: u8, haystack: &[u8]) -> Option<usize> {\n\n haystack.iter().position(|&b| b == b1 || b == b2)\n\n }\n\n\n\n let len = haystack.len();\n\n let ptr = haystack.as_ptr();\n\n let align = (ptr as usize) & (USIZE_BYTES - 1);\n\n let mut i = 0;\n\n if align > 0 {\n\n i = cmp::min(USIZE_BYTES - align, len);\n\n if let Some(found) = slow(needle1, needle2, &haystack[..i]) {\n\n return Some(found);\n\n }\n\n }\n\n let repeated_b1 = repeat_byte(needle1);\n\n let repeated_b2 = repeat_byte(needle2);\n\n if len >= USIZE_BYTES {\n","file_path":"crates/memchr/src/lib.rs","rank":37,"score":232499.5115816465},{"content":"/// Parses the time from the string according to the format string.\n\npub fn strptime(mut s: &str, format: &str) -> Result<Tm, ParseError> {\n\n let mut tm = Tm {\n\n tm_sec: 0,\n\n tm_min: 0,\n\n tm_hour: 0,\n\n tm_mday: 0,\n\n tm_mon: 0,\n\n tm_year: 0,\n\n tm_wday: 0,\n\n tm_yday: 0,\n\n tm_isdst: 0,\n\n tm_utcoff: 0,\n\n tm_nsec: 0,\n\n };\n\n let mut chars = format.chars();\n\n\n\n while let Some(ch) = chars.next() {\n\n if ch == '%' {\n\n if let Some(ch) = chars.next() {\n\n try!(parse_type(&mut s, ch, &mut tm));\n\n }\n\n } else {\n\n try!(parse_char(&mut s, ch));\n\n }\n\n }\n\n\n\n Ok(tm)\n\n}\n\n\n","file_path":"crates/time/src/parse.rs","rank":38,"score":231950.06834229702},{"content":"pub fn get_entrance() -> &'static mut Entrance {\n\n reference(0x803B8138)\n\n}\n","file_path":"src/game/savefile.rs","rank":39,"score":231373.493238003},{"content":"/// Escapes all regular expression meta characters in `text`.\n\n///\n\n/// The string returned may be safely used as a literal in a regular\n\n/// expression.\n\npub fn quote(text: &str) -> String {\n\n syntax::quote(text)\n\n}\n\n\n","file_path":"crates/regex/src/re_unicode.rs","rank":40,"score":228358.07316238756},{"content":"/// Returns true if the give character has significance in a regex.\n\npub fn is_punct(c: char) -> bool {\n\n match c {\n\n '\\\\' | '.' | '+' | '*' | '?' | '(' | ')' | '|' | '[' | ']' | '{' | '}' | '^' | '$' |\n\n '#' => true,\n\n _ => false,\n\n }\n\n}\n\n\n","file_path":"crates/regex/regex-syntax/src/parser.rs","rank":41,"score":228249.08435876775},{"content":"/// Blocks unless or until the current thread's token is made available.\n\n///\n\n/// Every thread is equipped with some basic low-level blocking support, via\n\n/// the `park()` function and the [`unpark()`][unpark] method. These can be\n\n/// used as a more CPU-efficient implementation of a spinlock.\n\n///\n\n/// [unpark]: struct.Thread.html#method.unpark\n\n///\n\n/// The API is typically used by acquiring a handle to the current thread,\n\n/// placing that handle in a shared data structure so that other threads can\n\n/// find it, and then parking (in a loop with a check for the token actually\n\n/// being acquired).\n\n///\n\n/// A call to `park` does not guarantee that the thread will remain parked\n\n/// forever, and callers should be prepared for this possibility.\n\n///\n\n/// See the [module documentation][thread] for more detail.\n\n///\n\n/// [thread]: index.html\n\n// The implementation currently uses the trivial strategy of a Mutex+Condvar\n\n// with wakeup flag, which does not actually allow spurious wakeups. In the\n\n// future, this will be implemented in a more efficient way, perhaps along the lines of\n\n// http://cr.openjdk.java.net/~stefank/6989984.1/raw_files/new/src/os/linux/vm/os_linux.cpp\n\n// or futuxes, and in either case may allow spurious wakeups.\n\npub fn park() {\n\n OS::suspend_thread(OS::get_current_thread());\n\n}\n\n\n\npub use self::manager::{collect, current, JoinHandle, Thread, spawn};","file_path":"src/system/thread/mod.rs","rank":42,"score":227763.1960233709},{"content":"fn parse_type(s: &mut &str, ch: char, tm: &mut Tm) -> Result<(), ParseError> {\n\n match ch {\n\n 'A' => match match_strs(s, &[(\"Sunday\", 0),\n\n (\"Monday\", 1),\n\n (\"Tuesday\", 2),\n\n (\"Wednesday\", 3),\n\n (\"Thursday\", 4),\n\n (\"Friday\", 5),\n\n (\"Saturday\", 6)]) {\n\n Some(v) => { tm.tm_wday = v; Ok(()) }\n\n None => Err(ParseError::InvalidDay)\n\n },\n\n 'a' => match match_strs(s, &[(\"Sun\", 0),\n\n (\"Mon\", 1),\n\n (\"Tue\", 2),\n\n (\"Wed\", 3),\n\n (\"Thu\", 4),\n\n (\"Fri\", 5),\n\n (\"Sat\", 6)]) {\n\n Some(v) => { tm.tm_wday = v; Ok(()) }\n","file_path":"crates/time/src/parse.rs","rank":43,"score":225621.67450600077},{"content":"/// Escapes all regular expression meta characters in `text`.\n\n///\n\n/// The string returned may be safely used as a literal in a regular\n\n/// expression.\n\npub fn quote(text: &str) -> String {\n\n let mut quoted = String::with_capacity(text.len());\n\n for c in text.chars() {\n\n if parser::is_punct(c) {\n\n quoted.push('\\\\');\n\n }\n\n quoted.push(c);\n\n }\n\n quoted\n\n}\n\n\n","file_path":"crates/regex/regex-syntax/src/lib.rs","rank":44,"score":224721.37883491698},{"content":"#[doc(hidden)]\n\npub fn is_word_char(c: char) -> bool {\n\n match c {\n\n '_' | '0'...'9' | 'a'...'z' | 'A'...'Z' => true,\n\n _ => {\n\n ::unicode::regex::PERLW.binary_search_by(|&(start, end)| {\n\n if c >= start && c <= end {\n\n Ordering::Equal\n\n } else if start > c {\n\n Ordering::Greater\n\n } else {\n\n Ordering::Less\n\n }\n\n })\n\n .is_ok()\n\n }\n\n }\n\n}\n\n\n\n/// Returns true if and only if `c` is an ASCII word byte.\n","file_path":"crates/regex/regex-syntax/src/lib.rs","rank":45,"score":224612.80433109048},{"content":"#[doc(hidden)]\n\npub fn is_word_byte(b: u8) -> bool {\n\n match b {\n\n b'_' | b'0'...b'9' | b'a'...b'z' | b'A'...b'Z' => true,\n\n _ => false,\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod properties;\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use {CharClass, ClassRange, ByteClass, ByteRange, Expr};\n\n\n\n fn class(ranges: &[(char, char)]) -> CharClass {\n\n let ranges = ranges.iter()\n\n .cloned()\n\n .map(|(c1, c2)| ClassRange::new(c1, c2))\n\n .collect();\n\n CharClass::new(ranges)\n","file_path":"crates/regex/regex-syntax/src/lib.rs","rank":46,"score":224612.80433109048},{"content":"#[plugin_registrar]\n\n#[doc(hidden)]\n\npub fn plugin_registrar(reg: &mut Registry) {\n\n reg.register_syntax_extension(\n\n token::intern(\"derive_NumFromPrimitive\"),\n\n MultiDecorator(Box::new(expand_deriving_from_primitive)));\n\n}\n","file_path":"crates/num/macros/src/lib.rs","rank":47,"score":223902.31590692053},{"content":"pub fn fopacm_create_append() -> &'static mut ActorMemory {\n\n let fopacm_create_append =\n\n unsafe { transmute::<Addr, extern \"C\" fn() -> *mut ActorMemory>(0x80023f3c) };\n\n let actor_memory = fopacm_create_append();\n\n unsafe { &mut *actor_memory }\n\n}\n\n\n\n\n","file_path":"src/system/tww.rs","rank":48,"score":223902.31590692053},{"content":"/// Cooperatively gives up a timeslice to the OS scheduler.\n\npub fn yield_now() {\n\n OS::yield_thread()\n\n}\n\n\n","file_path":"src/system/thread/mod.rs","rank":49,"score":223192.4666534207},{"content":"pub fn parse_prefix(_: &OsStr) -> Option<Prefix> {\n\n None\n\n}\n\n\n\npub const MAIN_SEP_STR: &'static str = \"/\";\n\npub const MAIN_SEP: char = '/';\n\n\n\n/// /////////////////////////////////////////////////////////////////////////////\n\n/// GENERAL NOTES\n\n/// /////////////////////////////////////////////////////////////////////////////\n\n///\n\n/// Parsing in this module is done by directly transmuting OsStr to [u8] slices,\n\n/// taking advantage of the fact that OsStr always encodes ASCII characters\n\n/// as-is. Eventually, this transmutation should be replaced by direct uses of\n\n/// OsStr APIs for parsing, but it will take a while for those to become\n\n/// available.\n\n\n\n/// /////////////////////////////////////////////////////////////////////////////\n\n/// Windows Prefixes\n\n/// /////////////////////////////////////////////////////////////////////////////\n","file_path":"src/system/path.rs","rank":50,"score":222365.76977615542},{"content":"pub fn mktime(tm: &mut Tm) -> time_t {\n\n let mut new: Tm = unsafe { uninitialized() };\n\n let mut opp = unsafe { uninitialized() };\n\n let mut t = tm_to_secs(tm);\n\n\n\n secs_to_zone(t, 1, &mut new.tm_isdst, &mut new.tm_utcoff, &mut opp);\n\n\n\n if tm.tm_isdst >= 0 && new.tm_isdst != tm.tm_isdst {\n\n t -= opp as c_longlong - new.tm_utcoff as c_longlong;\n\n }\n\n\n\n t -= new.tm_utcoff as c_longlong;\n\n\n\n // if t as time_t != t {\n\n // return -1;\n\n // }\n\n\n\n secs_to_zone(t, 0, &mut new.tm_isdst, &mut new.tm_utcoff, &mut opp);\n\n\n\n if secs_to_tm(t + new.tm_utcoff as c_longlong, &mut new) < 0 {\n\n return -1;\n\n }\n\n\n\n *tm = new;\n\n t as time_t\n\n}","file_path":"crates/time/src/musl.rs","rank":51,"score":221691.8125619393},{"content":"pub fn timegm(tm: &mut Tm) -> time_t {\n\n let mut new: Tm = unsafe { uninitialized() };\n\n let t = tm_to_secs(tm);\n\n\n\n if secs_to_tm(t, &mut new) < 0 {\n\n return -1;\n\n }\n\n\n\n *tm = new;\n\n tm.tm_isdst = 0;\n\n tm.tm_utcoff = 0;\n\n\n\n t as time_t\n\n}\n\n\n","file_path":"crates/time/src/musl.rs","rank":52,"score":221691.8125619393},{"content":"#[plugin_registrar]\n\n#[doc(hidden)]\n\npub fn plugin_registrar(reg: &mut Registry) {\n\n reg.register_macro(\"regex\", native);\n\n}\n\n\n","file_path":"crates/regex/regex_macros/src/lib.rs","rank":53,"score":220458.02296188287},{"content":"#[plugin_registrar]\n\npub fn plugin_registrar(reg: &mut Registry) {\n\n reg.register_syntax_extension(token::intern(\"derive_Rand\"),\n\n base::MultiDecorator(Box::new(expand_deriving_rand)));\n\n}\n\n\n\n\n\n\n\n\n","file_path":"crates/rand/rand_macros/src/lib.rs","rank":54,"score":220458.02296188287},{"content":"fn ascii_class(name: &str) -> Option<CharClass> {\n\n ASCII_CLASSES.binary_search_by(|&(s, _)| s.cmp(name))\n\n .ok()\n\n .map(|i| raw_class_to_expr(ASCII_CLASSES[i].1))\n\n}\n\n\n","file_path":"crates/regex/regex-syntax/src/parser.rs","rank":55,"score":219390.77079468936},{"content":"fn unicode_class(name: &str) -> Option<CharClass> {\n\n UNICODE_CLASSES.binary_search_by(|&(s, _)| s.cmp(name))\n\n .ok()\n\n .map(|i| raw_class_to_expr(UNICODE_CLASSES[i].1))\n\n}\n\n\n","file_path":"crates/regex/regex-syntax/src/parser.rs","rank":56,"score":219390.77079468936},{"content":"/// Like `memchr`, but searches for three bytes instead of one.\n\npub fn memchr3(needle1: u8, needle2: u8, needle3: u8, haystack: &[u8]) -> Option<usize> {\n\n use libtww::std::cmp;\n\n\n\n fn slow(b1: u8, b2: u8, b3: u8, haystack: &[u8]) -> Option<usize> {\n\n haystack.iter().position(|&b| b == b1 || b == b2 || b == b3)\n\n }\n\n\n\n let len = haystack.len();\n\n let ptr = haystack.as_ptr();\n\n let align = (ptr as usize) & (USIZE_BYTES - 1);\n\n let mut i = 0;\n\n if align > 0 {\n\n i = cmp::min(USIZE_BYTES - align, len);\n\n if let Some(found) = slow(needle1, needle2, needle3, &haystack[..i]) {\n\n return Some(found);\n\n }\n\n }\n\n let repeated_b1 = repeat_byte(needle1);\n\n let repeated_b2 = repeat_byte(needle2);\n\n let repeated_b3 = repeat_byte(needle3);\n","file_path":"crates/memchr/src/lib.rs","rank":57,"score":218442.66012752388},{"content":"/// Says whether the first byte after the prefix is a separator.\n\nfn has_physical_root(s: &[u8], prefix: Option<Prefix>) -> bool {\n\n let path = if let Some(p) = prefix {\n\n &s[p.len()..]\n\n } else {\n\n s\n\n };\n\n !path.is_empty() && is_sep_byte(path[0])\n\n}\n\n\n","file_path":"src/system/path.rs","rank":58,"score":218434.80417396006},{"content":"// This uses an adaptive system to extend the vector when it fills. We want to\n\n// avoid paying to allocate and zero a huge chunk of memory if the reader only\n\n// has 4 bytes while still making large reads if the reader does have a ton\n\n// of data to return. Simply tacking on an extra DEFAULT_BUF_SIZE space every\n\n// time is 4,500 times (!) slower than this if the reader has a very small\n\n// amount of data to return.\n\nfn read_to_end<R: Read + ?Sized>(r: &mut R, buf: &mut Vec<u8>) -> Result<usize> {\n\n let start_len = buf.len();\n\n let mut len = start_len;\n\n let mut new_write_size = 16;\n\n let ret;\n\n loop {\n\n if len == buf.len() {\n\n if new_write_size < DEFAULT_BUF_SIZE {\n\n new_write_size *= 2;\n\n }\n\n buf.resize(len + new_write_size, 0);\n\n }\n\n\n\n match r.read(&mut buf[len..]) {\n\n Ok(0) => {\n\n ret = Ok(len - start_len);\n\n break;\n\n }\n\n Ok(n) => len += n,\n\n Err(ref e) if e.kind() == ErrorKind::Interrupted => {}\n","file_path":"src/system/io/mod.rs","rank":59,"score":217768.53195675247},{"content":"#[inline]\n\npub fn pow<T: Clone + One + Mul<T, Output = T>>(mut base: T, mut exp: usize) -> T {\n\n if exp == 0 {\n\n return T::one();\n\n }\n\n\n\n while exp & 1 == 0 {\n\n base = base.clone() * base;\n\n exp >>= 1;\n\n }\n\n if exp == 1 {\n\n return base;\n\n }\n\n\n\n let mut acc = base.clone();\n\n while exp > 1 {\n\n exp >>= 1;\n\n base = base.clone() * base;\n\n if exp & 1 == 1 {\n\n acc = acc * base.clone();\n\n }\n","file_path":"crates/num/traits/src/pow.rs","rank":60,"score":217651.72489835887},{"content":"pub fn expand_deriving_from_primitive(cx: &mut ExtCtxt,\n\n span: Span,\n\n mitem: &MetaItem,\n\n item: &Annotatable,\n\n push: &mut FnMut(Annotatable))\n\n{\n\n let inline = cx.meta_word(span, InternedString::new(\"inline\"));\n\n let attrs = vec!(cx.attribute(span, inline));\n\n let trait_def = TraitDef {\n\n is_unsafe: false,\n\n span: span,\n\n attributes: Vec::new(),\n\n path: path!(num::FromPrimitive),\n\n additional_bounds: Vec::new(),\n\n generics: LifetimeBounds::empty(),\n\n methods: vec!(\n\n MethodDef {\n\n name: \"from_i64\",\n\n is_unsafe: false,\n\n unify_fieldless_variants: false,\n","file_path":"crates/num/macros/src/lib.rs","rank":61,"score":217188.24774335138},{"content":"pub fn ptr<T>(addr: Addr) -> *mut T {\n\n unsafe { mem::transmute(addr) }\n\n}\n\n\n","file_path":"src/system/memory.rs","rank":62,"score":216550.5217375946},{"content":"// A few methods below (read_to_string, read_line) will append data into a\n\n// `String` buffer, but we need to be pretty careful when doing this. The\n\n// implementation will just call `.as_mut_vec()` and then delegate to a\n\n// byte-oriented reading method, but we must ensure that when returning we never\n\n// leave `buf` in a state such that it contains invalid UTF-8 in its bounds.\n\n//\n\n// To this end, we use an RAII guard (to protect against panics) which updates\n\n// the length of the string when it is dropped. This guard initially truncates\n\n// the string to the prior length and only after we've validated that the\n\n// new contents are valid UTF-8 do we allow it to set a longer length.\n\n//\n\n// The unsafety in this function is twofold:\n\n//\n\n// 1. We're looking at the raw bytes of `buf`, so we take on the burden of UTF-8\n\n// checks.\n\n// 2. We're passing a raw buffer to the function `f`, and it is expected that\n\n// the function only *appends* bytes to the buffer. We'll get undefined\n\n// behavior if existing bytes are overwritten to have non-UTF-8 data.\n\nfn append_to_string<F>(buf: &mut String, f: F) -> Result<usize>\n\n where F: FnOnce(&mut Vec<u8>) -> Result<usize>\n\n{\n\n struct Guard<'a> {\n\n s: &'a mut Vec<u8>,\n\n len: usize,\n\n }\n\n impl<'a> Drop for Guard<'a> {\n\n fn drop(&mut self) {\n\n unsafe {\n\n self.s.set_len(self.len);\n\n }\n\n }\n\n }\n\n\n\n unsafe {\n\n let mut g = Guard {\n\n len: buf.len(),\n\n s: buf.as_mut_vec(),\n\n };\n","file_path":"src/system/io/mod.rs","rank":63,"score":215230.05448546784},{"content":"pub fn expand_deriving_rand(cx: &mut ExtCtxt,\n\n span: Span,\n\n mitem: &MetaItem,\n\n item: &Annotatable,\n\n push: &mut FnMut(Annotatable)) {\n\n let trait_def = TraitDef {\n\n span: span,\n\n attributes: Vec::new(),\n\n path: Path::new(vec!(\"rand\", \"Rand\")),\n\n additional_bounds: Vec::new(),\n\n generics: LifetimeBounds::empty(),\n\n is_unsafe: false,\n\n methods: vec!(\n\n MethodDef {\n\n name: \"rand\",\n\n is_unsafe: false,\n\n generics: LifetimeBounds {\n\n lifetimes: Vec::new(),\n\n bounds: vec!((\"R\",\n\n vec!( Path::new(vec!(\"rand\", \"Rng\")) )))\n","file_path":"crates/rand/rand_macros/src/lib.rs","rank":64,"score":214080.0541094322},{"content":"fn find_cap_ref(mut replacement: &[u8]) -> Option<CaptureRef> {\n\n if replacement.len() <= 1 || replacement[0] != b'$' {\n\n return None;\n\n }\n\n let mut brace = false;\n\n replacement = &replacement[1..];\n\n if replacement[0] == b'{' {\n\n brace = true;\n\n replacement = &replacement[1..];\n\n }\n\n let mut cap_end = 0;\n\n while replacement.get(cap_end).map_or(false, is_valid_cap_letter) {\n\n cap_end += 1;\n\n }\n\n if cap_end == 0 {\n\n return None;\n\n }\n\n // We just verified that the range 0..cap_end is valid ASCII, so it must\n\n // therefore be valid UTF-8. If we really cared, we could avoid this UTF-8\n\n // check with either unsafe or by parsing the number straight from &[u8].\n","file_path":"crates/regex/src/expand.rs","rank":65,"score":212636.63645916083},{"content":"type CaptureName = Option<String>;\n\n\n\n/// The type of a repeat operator expression.\n\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\n\npub enum Repeater {\n\n /// Match zero or one (`?`).\n\n ZeroOrOne,\n\n /// Match zero or more (`*`).\n\n ZeroOrMore,\n\n /// Match one or more (`+`).\n\n OneOrMore,\n\n /// Match for at least `min` and at most `max` (`{m,n}`).\n\n ///\n\n /// When `max` is `None`, there is no upper bound on the number of matches.\n\n Range {\n\n /// Lower bound on the number of matches.\n\n min: u32,\n\n /// Optional upper bound on the number of matches.\n\n max: Option<u32>,\n\n },\n","file_path":"crates/regex/regex-syntax/src/lib.rs","rank":66,"score":212074.1525931839},{"content":"type CaptureIndex = Option<usize>;\n\n\n","file_path":"crates/regex/regex-syntax/src/lib.rs","rank":67,"score":212025.98364913109},{"content":"/// Returns an encoding from given label, defined in the WHATWG Encoding standard, if any.\n\n/// Implements \"get an encoding\" algorithm: http://encoding.spec.whatwg.org/#concept-encoding-get\n\npub fn encoding_from_whatwg_label(label: &str) -> Option<EncodingRef> {\n\n let label = label.trim_matches(&[' ', '\\n', '\\r', '\\t', '\\x0C'][..]);\n\n let label: String =\n\n label.chars().map(|c| match c { 'A'...'Z' => (c as u8 + 32) as char, _ => c }).collect();\n\n match &label[..] {\n\n \"unicode-1-1-utf-8\" |\n\n \"utf-8\" |\n\n \"utf8\" =>\n\n Some(all::UTF_8 as EncodingRef),\n\n \"866\" |\n\n \"cp866\" |\n\n \"csibm866\" |\n\n \"ibm866\" =>\n\n Some(all::IBM866 as EncodingRef),\n\n \"csisolatin2\" |\n\n \"iso-8859-2\" |\n\n \"iso-ir-101\" |\n\n \"iso8859-2\" |\n\n \"iso88592\" |\n\n \"iso_8859-2\" |\n","file_path":"crates/encoding/src/label.rs","rank":68,"score":212009.77855231738},{"content":"pub fn expand(caps: &Captures, mut replacement: &[u8], dst: &mut Vec<u8>) {\n\n while !replacement.is_empty() {\n\n match memchr(b'$', replacement) {\n\n None => break,\n\n Some(i) => {\n\n dst.extend(&replacement[..i]);\n\n replacement = &replacement[i..];\n\n }\n\n }\n\n if replacement.get(1).map_or(false, |&b| b == b'$') {\n\n dst.push(b'$');\n\n replacement = &replacement[2..];\n\n continue;\n\n }\n\n debug_assert!(!replacement.is_empty());\n\n let cap_ref = match find_cap_ref(replacement) {\n\n Some(cap_ref) => cap_ref,\n\n None => {\n\n dst.push(b'$');\n\n replacement = &replacement[1..];\n","file_path":"crates/regex/src/expand.rs","rank":69,"score":211163.04832301792},{"content":"pub fn localtime_r<'a>(t: &time_t, tm: &'a mut Tm) -> Result<&'a mut Tm, ()> {\n\n let mut opp = unsafe { uninitialized() };\n\n\n\n // Reject time_t values whose year would overflow int because\n\n // __secs_to_zone cannot safely handle them.\n\n // if (*t < INT_MIN * 31622400LL || *t > INT_MAX * 31622400LL) {\n\n // \terrno = EOVERFLOW;\n\n // \treturn 0;\n\n // }\n\n\n\n secs_to_zone(*t as c_longlong,\n\n 0,\n\n &mut tm.tm_isdst,\n\n &mut tm.tm_utcoff,\n\n &mut opp);\n\n\n\n if secs_to_tm(*t as c_longlong + tm.tm_utcoff as c_longlong, tm) < 0 {\n\n return Err(());\n\n }\n\n\n\n Ok(tm)\n\n}\n\n\n","file_path":"crates/time/src/musl.rs","rank":70,"score":211026.04145709044},{"content":"fn year_to_secs(year: c_longlong, is_leap: &mut bool) -> c_longlong {\n\n if year - 2 <= 136 {\n\n let y = year;\n\n let mut leaps = (y - 68) >> 2;\n\n if (y - 68) & 3 == 0 {\n\n leaps -= 1;\n\n *is_leap = true;\n\n } else {\n\n *is_leap = false;\n\n }\n\n return 31536000 * (y - 70) + 86400 * leaps;\n\n }\n\n\n\n let (mut cycles, centuries, mut leaps, mut rem);\n\n\n\n cycles = (year - 100) / 400;\n\n rem = (year - 100) % 400;\n\n\n\n if rem < 0 {\n\n cycles -= 1;\n","file_path":"crates/time/src/musl.rs","rank":71,"score":210705.81741707143},{"content":"#[inline]\n\nfn contains_zero_byte(x: usize) -> bool {\n\n x.wrapping_sub(LO_USIZE) & !x & HI_USIZE != 0\n\n}\n\n\n","file_path":"src/system/memchr.rs","rank":72,"score":209603.43706822154},{"content":"pub fn sub2(a: &mut [BigDigit], b: &[BigDigit]) {\n\n let mut borrow = 0;\n\n\n\n let len = cmp::min(a.len(), b.len());\n\n let (a_lo, a_hi) = a.split_at_mut(len);\n\n let (b_lo, b_hi) = b.split_at(len);\n\n\n\n for (a, b) in a_lo.iter_mut().zip(b_lo) {\n\n *a = sbb(*a, *b, &mut borrow);\n\n }\n\n\n\n if borrow != 0 {\n\n for a in a_hi {\n\n *a = sbb(*a, 0, &mut borrow);\n\n if borrow == 0 { break }\n\n }\n\n }\n\n\n\n // note: we're _required_ to fail on underflow\n\n assert!(borrow == 0 && b_hi.iter().all(|x| *x == 0),\n\n \"Cannot subtract b from a because b is larger than a.\");\n\n}\n\n\n","file_path":"crates/num/bigint/src/algorithms.rs","rank":73,"score":209473.06323632528},{"content":"pub fn sub2rev(a: &[BigDigit], b: &mut [BigDigit]) {\n\n debug_assert!(b.len() >= a.len());\n\n\n\n let mut borrow = 0;\n\n\n\n let len = cmp::min(a.len(), b.len());\n\n let (a_lo, a_hi) = a.split_at(len);\n\n let (b_lo, b_hi) = b.split_at_mut(len);\n\n\n\n for (a, b) in a_lo.iter().zip(b_lo) {\n\n *b = sbb(*a, *b, &mut borrow);\n\n }\n\n\n\n assert!(a_hi.is_empty());\n\n\n\n // note: we're _required_ to fail on underflow\n\n assert!(borrow == 0 && b_hi.iter().all(|x| *x == 0),\n\n \"Cannot subtract b from a because b is larger than a.\");\n\n}\n\n\n","file_path":"crates/num/bigint/src/algorithms.rs","rank":74,"score":209473.06323632528},{"content":"/// /Two argument addition of raw slices:\n\n/// a += b\n\n///\n\n/// The caller _must_ ensure that a is big enough to store the result - typically this means\n\n/// resizing a to max(a.len(), b.len()) + 1, to fit a possible carry.\n\npub fn add2(a: &mut [BigDigit], b: &[BigDigit]) {\n\n let carry = __add2(a, b);\n\n\n\n debug_assert!(carry == 0);\n\n}\n\n\n","file_path":"crates/num/bigint/src/algorithms.rs","rank":75,"score":209473.06323632528},{"content":"pub fn reference<T>(addr: Addr) -> &'static mut T {\n\n unsafe { &mut *ptr(addr) }\n\n}\n\n\n","file_path":"src/system/memory.rs","rank":76,"score":208358.9891297673},{"content":"fn read_until<R: BufRead + ?Sized>(r: &mut R, delim: u8, buf: &mut Vec<u8>) -> Result<usize> {\n\n let mut read = 0;\n\n loop {\n\n let (done, used) = {\n\n let available = match r.fill_buf() {\n\n Ok(n) => n,\n\n Err(ref e) if e.kind() == ErrorKind::Interrupted => continue,\n\n Err(e) => return Err(e),\n\n };\n\n match memchr::memchr(delim, available) {\n\n Some(i) => {\n\n buf.extend_from_slice(&available[..i + 1]);\n\n (true, i + 1)\n\n }\n\n None => {\n\n buf.extend_from_slice(available);\n\n (false, available.len())\n\n }\n\n }\n\n };\n\n r.consume(used);\n\n read += used;\n\n if done || used == 0 {\n\n return Ok(read);\n\n }\n\n }\n\n}\n\n\n","file_path":"src/system/io/mod.rs","rank":77,"score":207556.85195196944},{"content":"#[inline]\n\nfn contains_zero_byte(x: usize) -> bool {\n\n x.wrapping_sub(LO_USIZE) & !x & HI_USIZE != 0\n\n}\n\n\n","file_path":"crates/memchr/src/lib.rs","rank":78,"score":205533.80365387173},{"content":"/// Almost equivalent to `libtww::std::str::from_utf8`.\n\n/// This function is provided for the fair benchmark against the stdlib's UTF-8 conversion\n\n/// functions, as rust-encoding always allocates a new string.\n\npub fn from_utf8<'a>(input: &'a [u8]) -> Option<&'a str> {\n\n let mut iter = input.iter();\n\n let mut state;\n\n\n\n macro_rules! return_as_whole(() => (return Some(unsafe {mem::transmute(input)})));\n\n\n\n // optimization: if we are in the initial state, quickly skip to the first non-MSB-set byte.\n\n loop {\n\n match iter.next() {\n\n Some(&ch) if ch < 0x80 => {}\n\n Some(&ch) => {\n\n state = next_state!(INITIAL_STATE, ch);\n\n break;\n\n }\n\n None => {\n\n return_as_whole!();\n\n }\n\n }\n\n }\n\n\n","file_path":"crates/encoding/src/codec/utf_8.rs","rank":79,"score":204870.682024443},{"content":"/// Creates a new synchronous, bounded channel.\n\n///\n\n/// Like asynchronous channels, the `Receiver` will block until a message\n\n/// becomes available. These channels differ greatly in the semantics of the\n\n/// sender from asynchronous channels, however.\n\n///\n\n/// This channel has an internal buffer on which messages will be queued. When\n\n/// the internal buffer becomes full, future sends will *block* waiting for the\n\n/// buffer to open up. Note that a buffer size of 0 is valid, in which case this\n\n/// becomes \"rendezvous channel\" where each send will not return until a recv\n\n/// is paired with it.\n\n///\n\n/// As with asynchronous channels, all senders will panic in `send` if the\n\n/// `Receiver` has been destroyed.\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// use std::sync::mpsc::sync_channel;\n\n/// use std::thread;\n\n///\n\n/// let (tx, rx) = sync_channel(1);\n\n///\n\n/// // this returns immediately\n\n/// tx.send(1).unwrap();\n\n///\n\n/// thread::spawn(move|| {\n\n/// // this will block until the previous message has been received\n\n/// tx.send(2).unwrap();\n\n/// });\n\n///\n\n/// assert_eq!(rx.recv().unwrap(), 1);\n\n/// assert_eq!(rx.recv().unwrap(), 2);\n\n/// ```\n\npub fn sync_channel<T>(bound: usize) -> (SyncSender<T>, Receiver<T>) {\n\n let a = Arc::new(UnsafeCell::new(sync::Packet::new(bound)));\n\n (SyncSender::new(a.clone()), Receiver::new(Flavor::Sync(a)))\n\n}\n\n\n\n/// /////////////////////////////////////////////////////////////////////////////\n\n/// Sender\n\n/// /////////////////////////////////////////////////////////////////////////////\n\n\n\nimpl<T> Sender<T> {\n\n fn new(inner: Flavor<T>) -> Sender<T> {\n\n Sender { inner: UnsafeCell::new(inner) }\n\n }\n\n\n\n /// Attempts to send a value on this channel, returning it back if it could\n\n /// not be sent.\n\n ///\n\n /// A successful send occurs when it is determined that the other end of\n\n /// the channel has not hung up already. An unsuccessful send would be one\n\n /// where the corresponding receiver has already been deallocated. Note\n","file_path":"src/system/sync/mpsc/mod.rs","rank":80,"score":202833.98223927512},{"content":"fn match_digits_in_range(ss: &mut &str,\n\n min_digits : usize, max_digits : usize,\n\n ws: bool, min: i32, max: i32) -> Option<i32> {\n\n let before = *ss;\n\n match match_digits(ss, min_digits, max_digits, ws) {\n\n Some(val) if val >= min && val <= max => Some(val),\n\n _ => { *ss = before; None }\n\n }\n\n}\n\n\n","file_path":"crates/time/src/parse.rs","rank":81,"score":200947.80033506488},{"content":"#[bench]\n\nfn iterator_memchr3(b: &mut test::Bencher) {\n\n let haystack = bench_data();\n\n let (needle1, needle2, needle3) = (b'a', b'b', b'c');\n\n b.iter(|| {\n\n assert!(haystack.iter().position(|&b| {\n\n b == needle1 || b == needle2 || b == needle3\n\n }).is_none());\n\n });\n\n b.bytes = haystack.len() as u64;\n\n}\n\n\n","file_path":"crates/memchr/benches/bench.rs","rank":82,"score":200389.1918942631},{"content":"#[bench]\n\nfn iterator_memchr(b: &mut test::Bencher) {\n\n let haystack = bench_data();\n\n let needle = b'a';\n\n b.iter(|| {\n\n assert!(haystack.iter().position(|&b| b == needle).is_none());\n\n });\n\n b.bytes = haystack.len() as u64;\n\n}\n\n\n","file_path":"crates/memchr/benches/bench.rs","rank":83,"score":200389.1918942631},{"content":"#[bench]\n\nfn iterator_memchr2(b: &mut test::Bencher) {\n\n let haystack = bench_data();\n\n let (needle1, needle2) = (b'a', b'b');\n\n b.iter(|| {\n\n assert!(haystack.iter().position(|&b| {\n\n b == needle1 || b == needle2\n\n }).is_none());\n\n });\n\n b.bytes = haystack.len() as u64;\n\n}\n\n\n","file_path":"crates/memchr/benches/bench.rs","rank":84,"score":200389.1918942631},{"content":"#[bench]\n\nfn iterator_memrchr(b: &mut test::Bencher) {\n\n let haystack = bench_data();\n\n let needle = b'a';\n\n b.iter(|| {\n\n assert!(haystack.iter().rposition(|&b| b == needle).is_none());\n\n });\n\n b.bytes = haystack.len() as u64;\n\n}\n\n\n","file_path":"crates/memchr/benches/bench.rs","rank":85,"score":200389.1918942631},{"content":"/// Tries to parse `[-+]\\d\\d` continued by `\\d\\d`. Return an offset in seconds if possible.\n\n///\n\n/// The additional `colon` may be used to parse a mandatory or optional `:`\n\n/// between hours and minutes, and should return either a new suffix or `Err` when parsing fails.\n\npub fn timezone_offset<F>(mut s: &str, mut colon: F) -> ParseResult<(&str, i32)>\n\n where F: FnMut(&str) -> ParseResult<&str> {\n\n fn digits(s: &str) -> ParseResult<(u8, u8)> {\n\n let b = s.as_bytes();\n\n if b.len() < 2 {\n\n Err(TOO_SHORT)\n\n } else {\n\n Ok((b[0], b[1]))\n\n }\n\n }\n\n let negative = match s.as_bytes().first() {\n\n Some(&b'+') => false,\n\n Some(&b'-') => true,\n\n Some(_) => return Err(INVALID),\n\n None => return Err(TOO_SHORT),\n\n };\n\n s = &s[1..];\n\n\n\n // hours (00--99)\n\n let hours = match try!(digits(s)) {\n","file_path":"crates/chrono/src/format/scan.rs","rank":86,"score":200026.8010887546},{"content":"/// Same to `timezone_offset` but also allows for RFC 2822 legacy timezones.\n\n/// May return `None` which indicates an insufficient offset data (i.e. `-0000`).\n\npub fn timezone_offset_2822(s: &str) -> ParseResult<(&str, Option<i32>)> {\n\n // tries to parse legacy time zone names\n\n let upto = s.as_bytes().iter().position(|&c| match c { b'a'...b'z' | b'A'...b'Z' => false,\n\n _ => true }).unwrap_or(s.len());\n\n if upto > 0 {\n\n let name = &s[..upto];\n\n let s = &s[upto..];\n\n if equals(name, \"gmt\") || equals(name, \"ut\") {\n\n Ok((s, Some(0)))\n\n } else if equals(name, \"est\") {\n\n Ok((s, Some(-5 * 3600)))\n\n } else if equals(name, \"edt\") {\n\n Ok((s, Some(-4 * 3600)))\n\n } else if equals(name, \"cst\") {\n\n Ok((s, Some(-6 * 3600)))\n\n } else if equals(name, \"cdt\") {\n\n Ok((s, Some(-5 * 3600)))\n\n } else if equals(name, \"mst\") {\n\n Ok((s, Some(-7 * 3600)))\n\n } else if equals(name, \"mdt\") {\n","file_path":"crates/chrono/src/format/scan.rs","rank":87,"score":199135.9469563465},{"content":"#[must_use]\n\n#[inline]\n\npub fn __add2(a: &mut [BigDigit], b: &[BigDigit]) -> BigDigit {\n\n debug_assert!(a.len() >= b.len());\n\n\n\n let mut carry = 0;\n\n let (a_lo, a_hi) = a.split_at_mut(b.len());\n\n\n\n for (a, b) in a_lo.iter_mut().zip(b) {\n\n *a = adc(*a, *b, &mut carry);\n\n }\n\n\n\n if carry != 0 {\n\n for a in a_hi {\n\n *a = adc(*a, 0, &mut carry);\n\n if carry == 0 { break }\n\n }\n\n }\n\n\n\n carry\n\n}\n\n\n","file_path":"crates/num/bigint/src/algorithms.rs","rank":88,"score":198542.87015984353},{"content":"pub fn dstage_actor_create(template: *const ActorTemplate, memory: *mut ActorMemory) {\n\n let dstage_actor_create = unsafe {\n\n transmute::<Addr, extern \"C\" fn(*const ActorTemplate, *mut ActorMemory)>(0x8003f484)\n\n };\n\n dstage_actor_create(template, memory);\n\n}\n\n\n","file_path":"src/system/tww.rs","rank":89,"score":195578.42683612404},{"content":"fn multiply_bench(b: &mut Bencher, xbits: usize, ybits: usize) {\n\n let mut rng = get_rng();\n\n let x = rng.gen_bigint(xbits);\n\n let y = rng.gen_bigint(ybits);\n\n\n\n b.iter(|| &x * &y);\n\n}\n\n\n","file_path":"crates/num/benches/bigint.rs","rank":90,"score":194033.06356799748},{"content":"fn divide_bench(b: &mut Bencher, xbits: usize, ybits: usize) {\n\n let mut rng = get_rng();\n\n let x = rng.gen_bigint(xbits);\n\n let y = rng.gen_bigint(ybits);\n\n\n\n b.iter(|| &x / &y);\n\n}\n\n\n","file_path":"crates/num/benches/bigint.rs","rank":91,"score":194033.06356799748},{"content":"#[bench]\n\nfn ac_one_prefix_byte_no_match(b: &mut Bencher) {\n\n let aut = $aut(vec![\"zbc\"]);\n\n $bench(b, aut, &haystack_same('y'));\n\n}\n\n\n","file_path":"crates/aho-corasick/benches/bench.rs","rank":92,"score":193859.8857244603},{"content":"#[bench]\n\nfn naive_one_prefix_byte_no_match(b: &mut Bencher) {\n\n bench_naive_no_match(b, vec![\"zbc\"], &haystack_same('y'));\n\n}\n\n\n","file_path":"crates/aho-corasick/benches/bench.rs","rank":93,"score":193859.8857244603},{"content":"type Result<T> = result::Result<T, Box<error::Error + Send + Sync>>;\n\n\n","file_path":"crates/regex/regex-debug/src/main.rs","rank":94,"score":193104.96987525586},{"content":"fn match_fractional_seconds(ss: &mut &str) -> i32 {\n\n let mut value = 0;\n\n let mut multiplier = NSEC_PER_SEC / 10;\n\n\n\n let mut chars = ss.char_indices();\n\n let orig = *ss;\n\n for (i, ch) in &mut chars {\n\n *ss = &orig[i..];\n\n match ch {\n\n '0' ... '9' => {\n\n // This will drop digits after the nanoseconds place\n\n let digit = ch as i32 - '0' as i32;\n\n value += digit * multiplier;\n\n multiplier /= 10;\n\n }\n\n _ => break\n\n }\n\n }\n\n\n\n value\n\n}\n\n\n","file_path":"crates/time/src/parse.rs","rank":95,"score":192896.31019169162},{"content":"/// The offset from the local time to UTC.\n\npub trait Offset: Sized + Clone + fmt::Debug {\n\n /// Returns the offset from UTC to the local time stored.\n\n fn local_minus_utc(&self) -> Duration;\n\n}\n\n\n","file_path":"crates/chrono/src/offset/mod.rs","rank":96,"score":192571.5302052089},{"content":"pub fn write_str<T: AsRef<str>>(ptr: *mut u8, value: T) {\n\n let mut dst = ptr;\n\n for &byte in value.as_ref().as_bytes().iter() {\n\n unsafe {\n\n *dst = byte;\n\n dst = dst.offset(1);\n\n }\n\n if byte == 0 {\n\n return;\n\n }\n\n }\n\n unsafe {\n\n *dst = 0;\n\n }\n\n}\n\n\n","file_path":"src/system/memory.rs","rank":97,"score":190812.5932832366},{"content":"#[bench]\n\nfn ac_one_prefix_byte_every_match(b: &mut Bencher) {\n\n // We lose the benefit of `memchr` because the first byte matches\n\n // in every position in the haystack.\n\n let aut = $aut(vec![\"zbc\"]);\n\n $bench(b, aut, &haystack_same('z'));\n\n}\n\n\n","file_path":"crates/aho-corasick/benches/bench.rs","rank":98,"score":190585.27979908953},{"content":"#[bench]\n\nfn ac_two_one_prefix_byte_no_match(b: &mut Bencher) {\n\n let aut = $aut(vec![\"zbcdef\", \"zmnopq\"]);\n\n $bench(b, aut, &haystack_same('y'));\n\n}\n\n\n","file_path":"crates/aho-corasick/benches/bench.rs","rank":99,"score":190585.27979908953}],"string":"[\n {\n \"content\": \"/// Tests if the given regular expression matches somewhere in the text given.\\n\\n///\\n\\n/// If there was a problem compiling the regular expression, an error is\\n\\n/// returned.\\n\\n///\\n\\n/// To find submatches, split or replace text, you'll need to compile an\\n\\n/// expression first.\\n\\npub fn is_match(regex: &str, text: &str) -> Result<bool, Error> {\\n\\n Regex::new(regex).map(|r| r.is_match(text))\\n\\n}\\n\\n\\n\\n/// A compiled regular expression for matching Unicode strings.\\n\\n///\\n\\n/// It is represented as either a sequence of bytecode instructions (dynamic)\\n\\n/// or as a specialized Rust function (native). It can be used to search, split\\n\\n/// or replace text. All searching is done with an implicit `.*?` at the\\n\\n/// beginning and end of an expression. To force an expression to match the\\n\\n/// whole string (or a prefix or a suffix), you must use an anchor like `^` or\\n\\n/// `$` (or `\\\\A` and `\\\\z`).\\n\\n///\\n\\n/// While this crate will handle Unicode strings (whether in the regular\\n\\n/// expression or in the search text), all positions returned are **byte\\n\\n/// indices**. Every byte index is guaranteed to be at a Unicode code point\\n\\n/// boundary.\\n\\n///\\n\\n/// The lifetimes `'r` and `'t` in this crate correspond to the lifetime of a\\n\\n/// compiled regular expression and text to search, respectively.\\n\",\n \"file_path\": \"crates/regex/src/re_unicode.rs\",\n \"rank\": 0,\n \"score\": 369525.8213242965\n },\n {\n \"content\": \"/// Returns true iff the given regex and input should be executed by this\\n\\n/// engine with reasonable memory usage.\\n\\npub fn should_exec(num_insts: usize, text_len: usize) -> bool {\\n\\n // Total memory usage in bytes is determined by:\\n\\n //\\n\\n // ((len(insts) * (len(input) + 1) + bits - 1) / bits) * (size_of(u32))\\n\\n //\\n\\n // The actual limit picked is pretty much a heuristic.\\n\\n // See: https://github.com/rust-lang-nursery/regex/issues/215\\n\\n let size = ((num_insts * (text_len + 1) + BIT_SIZE - 1) / BIT_SIZE) * 4;\\n\\n size <= MAX_SIZE_BYTES\\n\\n}\\n\\n\\n\\n/// A backtracking matching engine.\\n\\n#[derive(Debug)]\\n\\npub struct Bounded<'a, 'm, 'r, 's, I> {\\n\\n prog: &'r Program,\\n\\n input: I,\\n\\n matches: &'m mut [bool],\\n\\n slots: &'s mut [Slot],\\n\\n m: &'a mut Cache,\\n\\n}\\n\",\n \"file_path\": \"crates/regex/src/backtrack.rs\",\n \"rank\": 1,\n \"score\": 348370.78929305903\n },\n {\n \"content\": \"fn match_digits(ss: &mut &str, min_digits : usize, max_digits: usize, ws: bool) -> Option<i32> {\\n\\n match match_digits_i64(ss, min_digits, max_digits, ws) {\\n\\n Some(v) => Some(v as i32),\\n\\n None => None\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/time/src/parse.rs\",\n \"rank\": 2,\n \"score\": 318946.6122572385\n },\n {\n \"content\": \"fn match_digits_i64(ss: &mut &str, min_digits : usize, max_digits: usize, ws: bool) -> Option<i64> {\\n\\n let mut value : i64 = 0;\\n\\n let mut n = 0;\\n\\n if ws {\\n\\n let s2 = ss.trim_left_matches(\\\" \\\");\\n\\n n = ss.len() - s2.len();\\n\\n if n > max_digits { return None }\\n\\n }\\n\\n let chars = ss[n..].char_indices();\\n\\n for (_, ch) in chars.take(max_digits - n) {\\n\\n match ch {\\n\\n '0' ... '9' => value = value * 10 + (ch as i64 - '0' as i64),\\n\\n _ => break,\\n\\n }\\n\\n n += 1;\\n\\n }\\n\\n\\n\\n if n >= min_digits && n <= max_digits {\\n\\n *ss = &ss[n..];\\n\\n Some(value)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/time/src/parse.rs\",\n \"rank\": 3,\n \"score\": 314223.4581688106\n },\n {\n \"content\": \"// Iterate through `iter` while it matches `prefix`; return `None` if `prefix`\\n\\n// is not a prefix of `iter`, otherwise return `Some(iter_after_prefix)` giving\\n\\n// `iter` after having exhausted `prefix`.\\n\\nfn iter_after<A, I, J>(mut iter: I, mut prefix: J) -> Option<I>\\n\\n where I: Iterator<Item = A> + Clone,\\n\\n J: Iterator<Item = A>,\\n\\n A: PartialEq\\n\\n{\\n\\n loop {\\n\\n let mut iter_next = iter.clone();\\n\\n match (iter_next.next(), prefix.next()) {\\n\\n (Some(ref x), Some(ref y)) if x == y => (),\\n\\n (Some(_), Some(_)) => return None,\\n\\n (Some(_), None) => return Some(iter),\\n\\n (None, None) => return Some(iter),\\n\\n (None, Some(_)) => return None,\\n\\n }\\n\\n iter = iter_next;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/path.rs\",\n \"rank\": 4,\n \"score\": 302600.7622541302\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\n#[inline]\\n\\npub fn encode_utf8(character: char, dst: &mut [u8]) -> Option<usize> {\\n\\n let code = character as u32;\\n\\n if code <= 0x7F && !dst.is_empty() {\\n\\n dst[0] = code as u8;\\n\\n Some(1)\\n\\n } else if code <= 0x7FF && dst.len() >= 2 {\\n\\n dst[0] = (code >> 6 & 0x1F) as u8 | TAG_TWO;\\n\\n dst[1] = (code & 0x3F) as u8 | TAG_CONT;\\n\\n Some(2)\\n\\n } else if code <= 0xFFFF && dst.len() >= 3 {\\n\\n dst[0] = (code >> 12 & 0x0F) as u8 | TAG_THREE;\\n\\n dst[1] = (code >> 6 & 0x3F) as u8 | TAG_CONT;\\n\\n dst[2] = (code & 0x3F) as u8 | TAG_CONT;\\n\\n Some(3)\\n\\n } else if dst.len() >= 4 {\\n\\n dst[0] = (code >> 18 & 0x07) as u8 | TAG_FOUR;\\n\\n dst[1] = (code >> 12 & 0x3F) as u8 | TAG_CONT;\\n\\n dst[2] = (code >> 6 & 0x3F) as u8 | TAG_CONT;\\n\\n dst[3] = (code & 0x3F) as u8 | TAG_CONT;\\n\\n Some(4)\\n\",\n \"file_path\": \"crates/regex/src/utf8.rs\",\n \"rank\": 5,\n \"score\": 302195.4791308948\n },\n {\n \"content\": \"#[inline]\\n\\npub fn encode_utf8(character: char, dst: &mut [u8]) -> Option<usize> {\\n\\n let code = character as u32;\\n\\n if code < MAX_ONE_B && !dst.is_empty() {\\n\\n dst[0] = code as u8;\\n\\n Some(1)\\n\\n } else if code < MAX_TWO_B && dst.len() >= 2 {\\n\\n dst[0] = (code >> 6 & 0x1F) as u8 | TAG_TWO_B;\\n\\n dst[1] = (code & 0x3F) as u8 | TAG_CONT;\\n\\n Some(2)\\n\\n } else if code < MAX_THREE_B && dst.len() >= 3 {\\n\\n dst[0] = (code >> 12 & 0x0F) as u8 | TAG_THREE_B;\\n\\n dst[1] = (code >> 6 & 0x3F) as u8 | TAG_CONT;\\n\\n dst[2] = (code & 0x3F) as u8 | TAG_CONT;\\n\\n Some(3)\\n\\n } else if dst.len() >= 4 {\\n\\n dst[0] = (code >> 18 & 0x07) as u8 | TAG_FOUR_B;\\n\\n dst[1] = (code >> 12 & 0x3F) as u8 | TAG_CONT;\\n\\n dst[2] = (code >> 6 & 0x3F) as u8 | TAG_CONT;\\n\\n dst[3] = (code & 0x3F) as u8 | TAG_CONT;\\n\\n Some(4)\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"crates/utf8-ranges/src/char_utf8.rs\",\n \"rank\": 6,\n \"score\": 292542.5575042928\n },\n {\n \"content\": \"#[inline]\\n\\npub fn checked_pow<T: Clone + One + CheckedMul>(mut base: T, mut exp: usize) -> Option<T> {\\n\\n if exp == 0 {\\n\\n return Some(T::one());\\n\\n }\\n\\n\\n\\n macro_rules! optry {\\n\\n ( $ expr : expr ) => {\\n\\n if let Some(val) = $expr { val } else { return None }\\n\\n }\\n\\n }\\n\\n\\n\\n while exp & 1 == 0 {\\n\\n base = optry!(base.checked_mul(&base));\\n\\n exp >>= 1;\\n\\n }\\n\\n if exp == 1 {\\n\\n return Some(base);\\n\\n }\\n\\n\\n\\n let mut acc = base.clone();\\n\\n while exp > 1 {\\n\\n exp >>= 1;\\n\\n base = optry!(base.checked_mul(&base));\\n\\n if exp & 1 == 1 {\\n\\n acc = optry!(acc.checked_mul(&base));\\n\\n }\\n\\n }\\n\\n Some(acc)\\n\\n}\\n\",\n \"file_path\": \"crates/num/traits/src/pow.rs\",\n \"rank\": 7,\n \"score\": 277576.94251781714\n },\n {\n \"content\": \"/// Return true if and only if the given program can be executed by a DFA.\\n\\n///\\n\\n/// Generally, a DFA is always possible. A pathological case where it is not\\n\\n/// possible is if the number of NFA states exceeds u32::MAX, in which case,\\n\\n/// this function will return false.\\n\\n///\\n\\n/// This function will also return false if the given program has any Unicode\\n\\n/// instructions (Char or Ranges) since the DFA operates on bytes only.\\n\\npub fn can_exec(insts: &Program) -> bool {\\n\\n use prog::Inst::*;\\n\\n // If for some reason we manage to allocate a regex program with more\\n\\n // than i32::MAX instructions, then we can't execute the DFA because we\\n\\n // use 32 bit instruction pointer deltas for memory savings.\\n\\n // If i32::MAX is the largest positive delta,\\n\\n // then -i32::MAX == i32::MIN + 1 is the largest negative delta,\\n\\n // and we are OK to use 32 bits.\\n\\n if insts.len() > ::libtww::std::i32::MAX as usize {\\n\\n return false;\\n\\n }\\n\\n for inst in insts {\\n\\n match *inst {\\n\\n Char(_) | Ranges(_) => return false,\\n\\n EmptyLook(_) | Match(_) | Save(_) | Split(_) | Bytes(_) => {}\\n\\n }\\n\\n }\\n\\n true\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/regex/src/dfa.rs\",\n \"rank\": 8,\n \"score\": 273910.85926777753\n },\n {\n \"content\": \"/// Returns the smallest possible index of the next valid UTF-8 sequence\\n\\n/// starting after `i`.\\n\\npub fn next_utf8(text: &[u8], i: usize) -> usize {\\n\\n let b = match text.get(i) {\\n\\n None => return i + 1,\\n\\n Some(&b) => b,\\n\\n };\\n\\n let inc = if b <= 0x7F {\\n\\n 1\\n\\n } else if b <= 0b110_11111 {\\n\\n 2\\n\\n } else if b <= 0b1110_1111 {\\n\\n 3\\n\\n } else {\\n\\n 4\\n\\n };\\n\\n i + inc\\n\\n}\\n\\n\\n\\n/// Encode the given Unicode character to `dst` as a single UTF-8 sequence.\\n\\n///\\n\\n/// If `dst` is not long enough, then `None` is returned. Otherwise, the number\\n\\n/// of bytes written is returned.\\n\",\n \"file_path\": \"crates/regex/src/utf8.rs\",\n \"rank\": 9,\n \"score\": 272793.01972902124\n },\n {\n \"content\": \"fn match_str(s: &mut &str, needle: &str) -> bool {\\n\\n if s.starts_with(needle) {\\n\\n *s = &s[needle.len()..];\\n\\n true\\n\\n } else {\\n\\n false\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/time/src/parse.rs\",\n \"rank\": 10,\n \"score\": 258604.53662282825\n },\n {\n \"content\": \"/// Tries to format given arguments with given formatting items.\\n\\n/// Internally used by `DelayedFormat`.\\n\\npub fn format<'a, I>(w: &mut fmt::Formatter,\\n\\n date: Option<&NaiveDate>,\\n\\n time: Option<&NaiveTime>,\\n\\n off: Option<&(String, Duration)>,\\n\\n items: I)\\n\\n -> fmt::Result\\n\\n where I: Iterator<Item = Item<'a>>\\n\\n{\\n\\n // full and abbreviated month and weekday names\\n\\n static SHORT_MONTHS: [&'static str; 12] = [\\\"Jan\\\", \\\"Feb\\\", \\\"Mar\\\", \\\"Apr\\\", \\\"May\\\", \\\"Jun\\\", \\\"Jul\\\",\\n\\n \\\"Aug\\\", \\\"Sep\\\", \\\"Oct\\\", \\\"Nov\\\", \\\"Dec\\\"];\\n\\n static LONG_MONTHS: [&'static str; 12] = [\\\"January\\\",\\n\\n \\\"February\\\",\\n\\n \\\"March\\\",\\n\\n \\\"April\\\",\\n\\n \\\"May\\\",\\n\\n \\\"June\\\",\\n\\n \\\"July\\\",\\n\\n \\\"August\\\",\\n\\n \\\"September\\\",\\n\",\n \"file_path\": \"crates/chrono/src/format/mod.rs\",\n \"rank\": 11,\n \"score\": 257442.7441833754\n },\n {\n \"content\": \"/// Base functionality for all errors in Rust.\\n\\npub trait Error: Debug + Display + Reflect {\\n\\n /// A short description of the error.\\n\\n ///\\n\\n /// The description should not contain newlines or sentence-ending\\n\\n /// punctuation, to facilitate embedding in larger user-facing\\n\\n /// strings.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// ```\\n\\n /// use std::error::Error;\\n\\n ///\\n\\n /// match \\\"xc\\\".parse::<u32>() {\\n\\n /// Err(e) => {\\n\\n /// println!(\\\"Error: {}\\\", e.description());\\n\\n /// }\\n\\n /// _ => println!(\\\"No error\\\"),\\n\\n /// }\\n\\n /// ```\\n\\n fn description(&self) -> &str;\\n\",\n \"file_path\": \"src/system/error.rs\",\n \"rank\": 12,\n \"score\": 255098.22362046636\n },\n {\n \"content\": \"pub fn event_cancel() -> bool {\\n\\n memory::read(0x803BD3A3)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/game/event.rs\",\n \"rank\": 13,\n \"score\": 255017.30957531842\n },\n {\n \"content\": \"pub fn is_pause_menu_up() -> bool {\\n\\n read(0x803EA537) // alternative: 0x80396228\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/tww.rs\",\n \"rank\": 14,\n \"score\": 255017.30957531842\n },\n {\n \"content\": \"#[inline(always)] // reduces constant overhead\\n\\npub fn memrchr(needle: u8, haystack: &[u8]) -> Option<usize> {\\n\\n\\n\\n fn memrchr_specific(needle: u8, haystack: &[u8]) -> Option<usize> {\\n\\n fallback::memrchr(needle, haystack)\\n\\n }\\n\\n\\n\\n memrchr_specific(needle, haystack)\\n\\n}\\n\\n\\n\\nmod fallback {\\n\\n use std::cmp;\\n\\n use super::{USIZE_BYTES, contains_zero_byte, repeat_byte};\\n\\n\\n\\n /// Return the first index matching the byte `a` in `text`.\\n\\n pub fn memchr(x: u8, text: &[u8]) -> Option<usize> {\\n\\n // Scan for a single byte value by reading two `usize` words at a time.\\n\\n //\\n\\n // Split `text` in three parts\\n\\n // - unaligned inital part, before the first word aligned address in text\\n\\n // - body, scan by 2 words at a time\\n\",\n \"file_path\": \"src/system/memchr.rs\",\n \"rank\": 15,\n \"score\": 253398.16734351212\n },\n {\n \"content\": \"#[inline(always)] // reduces constant overhead\\n\\npub fn memchr(needle: u8, haystack: &[u8]) -> Option<usize> {\\n\\n fn memchr_specific(needle: u8, haystack: &[u8]) -> Option<usize> {\\n\\n fallback::memchr(needle, haystack)\\n\\n }\\n\\n\\n\\n memchr_specific(needle, haystack)\\n\\n}\\n\\n\\n\\n/// A safe interface to `memrchr`.\\n\\n///\\n\\n/// Returns the index corresponding to the last occurrence of `needle` in\\n\\n/// `haystack`, or `None` if one is not found.\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// This shows how to find the last position of a byte in a byte string.\\n\\n///\\n\\n/// ```rust\\n\\n/// use memchr::memrchr;\\n\\n///\\n\\n/// let haystack = b\\\"the quick brown fox\\\";\\n\\n/// assert_eq!(memrchr(b'o', haystack), Some(17));\\n\\n/// ```\\n\",\n \"file_path\": \"src/system/memchr.rs\",\n \"rank\": 16,\n \"score\": 253398.16734351212\n },\n {\n \"content\": \"#[inline]\\n\\npub fn decode_utf8(src: &[u8]) -> Option<(char, usize)> {\\n\\n let b0 = match src.get(0) {\\n\\n None => return None,\\n\\n Some(&b) if b <= 0x7F => return Some((b as char, 1)),\\n\\n Some(&b) => b,\\n\\n };\\n\\n match b0 {\\n\\n 0b110_00000...0b110_11111 => {\\n\\n if src.len() < 2 {\\n\\n return None;\\n\\n }\\n\\n let b1 = src[1];\\n\\n let cp = ((b0 & !TAG_TWO) as u32) << 6 | ((b1 & !TAG_CONT) as u32);\\n\\n match cp {\\n\\n 0x80...0x7FF => char::from_u32(cp).map(|cp| (cp, 2)),\\n\\n _ => None,\\n\\n }\\n\\n }\\n\\n 0b1110_0000...0b1110_1111 => {\\n\\n if src.len() < 3 {\\n\",\n \"file_path\": \"crates/regex/src/utf8.rs\",\n \"rank\": 17,\n \"score\": 253384.1926516733\n },\n {\n \"content\": \"/// Randomly sample up to `amount` elements from an iterator.\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// ```rust\\n\\n/// use rand::{thread_rng, sample};\\n\\n///\\n\\n/// let mut rng = thread_rng();\\n\\n/// let sample = sample(&mut rng, 1..100, 5);\\n\\n/// println!(\\\"{:?}\\\", sample);\\n\\n/// ```\\n\\npub fn sample<T, I, R>(rng: &mut R, iterable: I, amount: usize) -> Vec<T>\\n\\n where I: IntoIterator<Item = T>,\\n\\n R: Rng\\n\\n{\\n\\n let mut iter = iterable.into_iter();\\n\\n let mut reservoir: Vec<T> = iter.by_ref().take(amount).collect();\\n\\n // continue unless the iterator was exhausted\\n\\n if reservoir.len() == amount {\\n\\n for (i, elem) in iter.enumerate() {\\n\\n let k = rng.gen_range(0, i + 1 + amount);\\n\\n if let Some(spot) = reservoir.get_mut(k) {\\n\\n *spot = elem;\\n\\n }\\n\\n }\\n\\n }\\n\\n reservoir\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\",\n \"file_path\": \"crates/rand/src/lib.rs\",\n \"rank\": 18,\n \"score\": 251955.50998658492\n },\n {\n \"content\": \"pub fn is_new_game_plus() -> bool {\\n\\n read(0x803B82A8)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/game/savefile.rs\",\n \"rank\": 19,\n \"score\": 250710.30468077626\n },\n {\n \"content\": \"/// Returns an encoding from Windows code page number.\\n\\n/// http://msdn.microsoft.com/en-us/library/windows/desktop/dd317756%28v=vs.85%29.aspx\\n\\n/// Sometimes it can return a *superset* of the requested encoding, e.g. for several CJK encodings.\\n\\npub fn encoding_from_windows_code_page(cp: usize) -> Option<EncodingRef> {\\n\\n match cp {\\n\\n 65001 => Some(all::UTF_8 as EncodingRef),\\n\\n 866 => Some(all::IBM866 as EncodingRef),\\n\\n 28591 => Some(all::ISO_8859_1 as EncodingRef),\\n\\n 28592 => Some(all::ISO_8859_2 as EncodingRef),\\n\\n 28593 => Some(all::ISO_8859_3 as EncodingRef),\\n\\n 28594 => Some(all::ISO_8859_4 as EncodingRef),\\n\\n 28595 => Some(all::ISO_8859_5 as EncodingRef),\\n\\n 28596 => Some(all::ISO_8859_6 as EncodingRef),\\n\\n 28597 => Some(all::ISO_8859_7 as EncodingRef),\\n\\n 28598 => Some(all::ISO_8859_8 as EncodingRef),\\n\\n 38598 => Some(all::whatwg::ISO_8859_8_I as EncodingRef),\\n\\n 28603 => Some(all::ISO_8859_13 as EncodingRef),\\n\\n 28605 => Some(all::ISO_8859_15 as EncodingRef),\\n\\n 20866 => Some(all::KOI8_R as EncodingRef),\\n\\n 21866 => Some(all::KOI8_U as EncodingRef),\\n\\n 10000 => Some(all::MAC_ROMAN as EncodingRef),\\n\\n 874 => Some(all::WINDOWS_874 as EncodingRef),\\n\\n 1250 => Some(all::WINDOWS_1250 as EncodingRef),\\n\",\n \"file_path\": \"crates/encoding/src/label.rs\",\n \"rank\": 20,\n \"score\": 250037.10002328246\n },\n {\n \"content\": \"fn read_one_byte(reader: &mut Read) -> Option<Result<u8>> {\\n\\n let mut buf = [0];\\n\\n loop {\\n\\n return match reader.read(&mut buf) {\\n\\n Ok(0) => None,\\n\\n Ok(..) => Some(Ok(buf[0])),\\n\\n Err(ref e) if e.kind() == ErrorKind::Interrupted => continue,\\n\\n Err(e) => Some(Err(e)),\\n\\n };\\n\\n }\\n\\n}\\n\\n\\n\\n/// An iterator over `u8` values of a reader.\\n\\n///\\n\\n/// This struct is generally created by calling [`bytes()`][bytes] on a reader.\\n\\n/// Please see the documentation of `bytes()` for more details.\\n\\n///\\n\\n/// [bytes]: trait.Read.html#method.bytes\\n\\npub struct Bytes<R> {\\n\\n inner: R,\\n\",\n \"file_path\": \"src/system/io/mod.rs\",\n \"rank\": 21,\n \"score\": 249415.50375555747\n },\n {\n \"content\": \"/// Like decode_utf8, but decodes the last UTF-8 sequence in `src` instead of\\n\\n/// the first.\\n\\npub fn decode_last_utf8(src: &[u8]) -> Option<(char, usize)> {\\n\\n if src.is_empty() {\\n\\n return None;\\n\\n }\\n\\n let mut start = src.len() - 1;\\n\\n if src[start] <= 0x7F {\\n\\n return Some((src[start] as char, 1));\\n\\n }\\n\\n while start > src.len().saturating_sub(4) {\\n\\n start -= 1;\\n\\n if is_start_byte(src[start]) {\\n\\n break;\\n\\n }\\n\\n }\\n\\n match decode_utf8(&src[start..]) {\\n\\n None => None,\\n\\n Some((_, n)) if n < src.len() - start => None,\\n\\n Some((cp, n)) => Some((cp, n)),\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/regex/src/utf8.rs\",\n \"rank\": 22,\n \"score\": 249015.2626778964\n },\n {\n \"content\": \"#[inline(always)] // reduces constant overhead\\n\\npub fn memchr(needle: u8, haystack: &[u8]) -> Option<usize> {\\n\\n fn memchr_specific(needle: u8, haystack: &[u8]) -> Option<usize> {\\n\\n fallback::memchr(needle, haystack)\\n\\n }\\n\\n\\n\\n memchr_specific(needle, haystack)\\n\\n}\\n\\n\\n\\n/// A safe interface to `memrchr`.\\n\\n///\\n\\n/// Returns the index corresponding to the last occurrence of `needle` in\\n\\n/// `haystack`, or `None` if one is not found.\\n\\n///\\n\\n/// # Example\\n\\n///\\n\\n/// This shows how to find the last position of a byte in a byte string.\\n\\n///\\n\\n/// ```rust\\n\\n/// use memchr::memrchr;\\n\\n///\\n\\n/// let haystack = b\\\"the quick brown fox\\\";\\n\\n/// assert_eq!(memrchr(b'o', haystack), Some(17));\\n\\n/// ```\\n\",\n \"file_path\": \"crates/memchr/src/lib.rs\",\n \"rank\": 23,\n \"score\": 248796.0544518493\n },\n {\n \"content\": \"#[inline(always)] // reduces constant overhead\\n\\npub fn memrchr(needle: u8, haystack: &[u8]) -> Option<usize> {\\n\\n\\n\\n fn memrchr_specific(needle: u8, haystack: &[u8]) -> Option<usize> {\\n\\n fallback::memrchr(needle, haystack)\\n\\n }\\n\\n\\n\\n memrchr_specific(needle, haystack)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/memchr/src/lib.rs\",\n \"rank\": 24,\n \"score\": 248796.0544518493\n },\n {\n \"content\": \"/// Tries to parse given string into `parsed` with given formatting items.\\n\\n/// Returns `Ok` when the entire string has been parsed (otherwise `parsed` should not be used).\\n\\n/// There should be no trailing string after parsing;\\n\\n/// use a stray [`Item::Space`](./enum.Item.html#variant.Space) to trim whitespaces.\\n\\n///\\n\\n/// This particular date and time parser is:\\n\\n///\\n\\n/// - Greedy. It will consume the longest possible prefix.\\n\\n/// For example, `April` is always consumed entirely when the long month name is requested;\\n\\n/// it equally accepts `Apr`, but prefers the longer prefix in this case.\\n\\n///\\n\\n/// - Padding-agnostic (for numeric items).\\n\\n/// The [`Pad`](./enum.Pad.html) field is completely ignored,\\n\\n/// so one can prepend any number of whitespace then any number of zeroes before numbers.\\n\\n///\\n\\n/// - (Still) obeying the intrinsic parsing width. This allows, for example, parsing `HHMMSS`.\\n\\npub fn parse<'a, I>(parsed: &mut Parsed, mut s: &str, items: I) -> ParseResult<()>\\n\\n where I: Iterator<Item = Item<'a>>\\n\\n{\\n\\n macro_rules! try_consume {\\n\\n ($e:expr) => ({ let (s_, v) = try!($e); s = s_; v })\\n\\n }\\n\\n\\n\\n for item in items {\\n\\n match item {\\n\\n Item::Literal(prefix) => {\\n\\n if s.len() < prefix.len() {\\n\\n return Err(TOO_SHORT);\\n\\n }\\n\\n if !s.starts_with(prefix) {\\n\\n return Err(INVALID);\\n\\n }\\n\\n s = &s[prefix.len()..];\\n\\n }\\n\\n\\n\\n Item::Space(_) => {\\n\",\n \"file_path\": \"crates/chrono/src/format/parse.rs\",\n \"rank\": 25,\n \"score\": 245298.5475246195\n },\n {\n \"content\": \"pub fn set_event_cancel(b: bool) {\\n\\n memory::write(0x803BD3A3, b);\\n\\n}\\n\",\n \"file_path\": \"src/game/event.rs\",\n \"rank\": 26,\n \"score\": 242898.84684095831\n },\n {\n \"content\": \"pub fn is_teddy_128_available() -> bool {\\n\\n true\\n\\n}\\n\\n\\n\\n/// Match reports match information.\\n\\n#[derive(Debug, Clone)]\\n\\npub struct Match {\\n\\n /// The index of the pattern that matched. The index is in correspondence\\n\\n /// with the order of the patterns given at construction.\\n\\n pub pat: usize,\\n\\n /// The start byte offset of the match.\\n\\n pub start: usize,\\n\\n /// The end byte offset of the match. This is always `start + pat.len()`.\\n\\n pub end: usize,\\n\\n}\\n\\n\\n\\n/// A SIMD accelerated multi substring searcher.\\n\\n#[derive(Debug, Clone)]\\n\\npub struct Teddy {\\n\\n /// A list of substrings to match.\\n\",\n \"file_path\": \"crates/regex/src/simd_accel/teddy128.rs\",\n \"rank\": 27,\n \"score\": 242804.8367670538\n },\n {\n \"content\": \"pub fn is_teddy_128_available() -> bool {\\n\\n false\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct Teddy(());\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct Match {\\n\\n pub pat: usize,\\n\\n pub start: usize,\\n\\n pub end: usize,\\n\\n}\\n\\n\\n\\nimpl Teddy {\\n\\n pub fn new(_pats: &syntax::Literals) -> Option<Teddy> { None }\\n\\n pub fn patterns(&self) -> &[Vec<u8>] { &[] }\\n\\n pub fn len(&self) -> usize { 0 }\\n\\n pub fn approximate_size(&self) -> usize { 0 }\\n\\n pub fn find(&self, _haystack: &[u8]) -> Option<Match> { None }\\n\\n}\\n\",\n \"file_path\": \"crates/regex/src/simd_fallback/teddy128.rs\",\n \"rank\": 28,\n \"score\": 242804.8367670538\n },\n {\n \"content\": \"fn position(needle: &[u8], mut haystack: &[u8]) -> Option<usize> {\\n\\n let mut i = 0;\\n\\n while haystack.len() >= needle.len() {\\n\\n if needle == &haystack[..needle.len()] {\\n\\n return Some(i);\\n\\n }\\n\\n i += 1;\\n\\n haystack = &haystack[1..];\\n\\n }\\n\\n None\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/regex/regex-syntax/src/literals.rs\",\n \"rank\": 29,\n \"score\": 240837.88700221514\n },\n {\n \"content\": \"pub fn spawn(coord: &Coord, item: u8) {\\n\\n layer::switch_to_safe_layer();\\n\\n\\n\\n let func =\\n\\n unsafe { transmute::<Addr, extern \\\"C\\\" fn(*const Coord, u8, u32, u32, u32)>(0x80026920) };\\n\\n func(coord, item, 0x7f, 0, 0);\\n\\n}\\n\",\n \"file_path\": \"src/link/item.rs\",\n \"rank\": 30,\n \"score\": 240745.15362500364\n },\n {\n \"content\": \"/// Determines whether the character is one of the permitted path\\n\\n/// separators for the current platform.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use std::path;\\n\\n///\\n\\n/// assert!(path::is_separator('/'));\\n\\n/// assert!(!path::is_separator('❤'));\\n\\n/// ```\\n\\npub fn is_separator(c: char) -> bool {\\n\\n c.is_ascii() && is_sep_byte(c as u8)\\n\\n}\\n\\n\\n\\n/// The primary separator for the current platform\\n\\npub const MAIN_SEPARATOR: char = MAIN_SEP;\\n\\n\\n\\n/// /////////////////////////////////////////////////////////////////////////////\\n\\n/// Misc helpers\\n\\n/// /////////////////////////////////////////////////////////////////////////////\\n\\n\\n\",\n \"file_path\": \"src/system/path.rs\",\n \"rank\": 31,\n \"score\": 240466.4492435412\n },\n {\n \"content\": \"pub fn is_down(buttons: u16) -> bool {\\n\\n buttons_down() & buttons == buttons\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/game/controller.rs\",\n \"rank\": 32,\n \"score\": 240461.55716703238\n },\n {\n \"content\": \"fn match_strs(ss: &mut &str, strs: &[(&str, i32)]) -> Option<i32> {\\n\\n for &(needle, value) in strs.iter() {\\n\\n if match_str(ss, needle) {\\n\\n return Some(value)\\n\\n }\\n\\n }\\n\\n None\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/time/src/parse.rs\",\n \"rank\": 33,\n \"score\": 236732.5951279308\n },\n {\n \"content\": \"#[inline]\\n\\npub fn is_sep_byte(b: u8) -> bool {\\n\\n b == b'/'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/path.rs\",\n \"rank\": 34,\n \"score\": 236154.5522724902\n },\n {\n \"content\": \"#[inline]\\n\\npub fn is_verbatim_sep(b: u8) -> bool {\\n\\n b == b'/'\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/path.rs\",\n \"rank\": 35,\n \"score\": 236154.5522724902\n },\n {\n \"content\": \"pub fn is_pressed(buttons: u16) -> bool {\\n\\n buttons_pressed() & buttons == buttons\\n\\n}\\n\",\n \"file_path\": \"src/game/controller.rs\",\n \"rank\": 36,\n \"score\": 236154.5522724902\n },\n {\n \"content\": \"/// Like `memchr`, but searches for two bytes instead of one.\\n\\npub fn memchr2(needle1: u8, needle2: u8, haystack: &[u8]) -> Option<usize> {\\n\\n use libtww::std::cmp;\\n\\n\\n\\n fn slow(b1: u8, b2: u8, haystack: &[u8]) -> Option<usize> {\\n\\n haystack.iter().position(|&b| b == b1 || b == b2)\\n\\n }\\n\\n\\n\\n let len = haystack.len();\\n\\n let ptr = haystack.as_ptr();\\n\\n let align = (ptr as usize) & (USIZE_BYTES - 1);\\n\\n let mut i = 0;\\n\\n if align > 0 {\\n\\n i = cmp::min(USIZE_BYTES - align, len);\\n\\n if let Some(found) = slow(needle1, needle2, &haystack[..i]) {\\n\\n return Some(found);\\n\\n }\\n\\n }\\n\\n let repeated_b1 = repeat_byte(needle1);\\n\\n let repeated_b2 = repeat_byte(needle2);\\n\\n if len >= USIZE_BYTES {\\n\",\n \"file_path\": \"crates/memchr/src/lib.rs\",\n \"rank\": 37,\n \"score\": 232499.5115816465\n },\n {\n \"content\": \"/// Parses the time from the string according to the format string.\\n\\npub fn strptime(mut s: &str, format: &str) -> Result<Tm, ParseError> {\\n\\n let mut tm = Tm {\\n\\n tm_sec: 0,\\n\\n tm_min: 0,\\n\\n tm_hour: 0,\\n\\n tm_mday: 0,\\n\\n tm_mon: 0,\\n\\n tm_year: 0,\\n\\n tm_wday: 0,\\n\\n tm_yday: 0,\\n\\n tm_isdst: 0,\\n\\n tm_utcoff: 0,\\n\\n tm_nsec: 0,\\n\\n };\\n\\n let mut chars = format.chars();\\n\\n\\n\\n while let Some(ch) = chars.next() {\\n\\n if ch == '%' {\\n\\n if let Some(ch) = chars.next() {\\n\\n try!(parse_type(&mut s, ch, &mut tm));\\n\\n }\\n\\n } else {\\n\\n try!(parse_char(&mut s, ch));\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(tm)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/time/src/parse.rs\",\n \"rank\": 38,\n \"score\": 231950.06834229702\n },\n {\n \"content\": \"pub fn get_entrance() -> &'static mut Entrance {\\n\\n reference(0x803B8138)\\n\\n}\\n\",\n \"file_path\": \"src/game/savefile.rs\",\n \"rank\": 39,\n \"score\": 231373.493238003\n },\n {\n \"content\": \"/// Escapes all regular expression meta characters in `text`.\\n\\n///\\n\\n/// The string returned may be safely used as a literal in a regular\\n\\n/// expression.\\n\\npub fn quote(text: &str) -> String {\\n\\n syntax::quote(text)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/regex/src/re_unicode.rs\",\n \"rank\": 40,\n \"score\": 228358.07316238756\n },\n {\n \"content\": \"/// Returns true if the give character has significance in a regex.\\n\\npub fn is_punct(c: char) -> bool {\\n\\n match c {\\n\\n '\\\\\\\\' | '.' | '+' | '*' | '?' | '(' | ')' | '|' | '[' | ']' | '{' | '}' | '^' | '$' |\\n\\n '#' => true,\\n\\n _ => false,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/regex/regex-syntax/src/parser.rs\",\n \"rank\": 41,\n \"score\": 228249.08435876775\n },\n {\n \"content\": \"/// Blocks unless or until the current thread's token is made available.\\n\\n///\\n\\n/// Every thread is equipped with some basic low-level blocking support, via\\n\\n/// the `park()` function and the [`unpark()`][unpark] method. These can be\\n\\n/// used as a more CPU-efficient implementation of a spinlock.\\n\\n///\\n\\n/// [unpark]: struct.Thread.html#method.unpark\\n\\n///\\n\\n/// The API is typically used by acquiring a handle to the current thread,\\n\\n/// placing that handle in a shared data structure so that other threads can\\n\\n/// find it, and then parking (in a loop with a check for the token actually\\n\\n/// being acquired).\\n\\n///\\n\\n/// A call to `park` does not guarantee that the thread will remain parked\\n\\n/// forever, and callers should be prepared for this possibility.\\n\\n///\\n\\n/// See the [module documentation][thread] for more detail.\\n\\n///\\n\\n/// [thread]: index.html\\n\\n// The implementation currently uses the trivial strategy of a Mutex+Condvar\\n\\n// with wakeup flag, which does not actually allow spurious wakeups. In the\\n\\n// future, this will be implemented in a more efficient way, perhaps along the lines of\\n\\n// http://cr.openjdk.java.net/~stefank/6989984.1/raw_files/new/src/os/linux/vm/os_linux.cpp\\n\\n// or futuxes, and in either case may allow spurious wakeups.\\n\\npub fn park() {\\n\\n OS::suspend_thread(OS::get_current_thread());\\n\\n}\\n\\n\\n\\npub use self::manager::{collect, current, JoinHandle, Thread, spawn};\",\n \"file_path\": \"src/system/thread/mod.rs\",\n \"rank\": 42,\n \"score\": 227763.1960233709\n },\n {\n \"content\": \"fn parse_type(s: &mut &str, ch: char, tm: &mut Tm) -> Result<(), ParseError> {\\n\\n match ch {\\n\\n 'A' => match match_strs(s, &[(\\\"Sunday\\\", 0),\\n\\n (\\\"Monday\\\", 1),\\n\\n (\\\"Tuesday\\\", 2),\\n\\n (\\\"Wednesday\\\", 3),\\n\\n (\\\"Thursday\\\", 4),\\n\\n (\\\"Friday\\\", 5),\\n\\n (\\\"Saturday\\\", 6)]) {\\n\\n Some(v) => { tm.tm_wday = v; Ok(()) }\\n\\n None => Err(ParseError::InvalidDay)\\n\\n },\\n\\n 'a' => match match_strs(s, &[(\\\"Sun\\\", 0),\\n\\n (\\\"Mon\\\", 1),\\n\\n (\\\"Tue\\\", 2),\\n\\n (\\\"Wed\\\", 3),\\n\\n (\\\"Thu\\\", 4),\\n\\n (\\\"Fri\\\", 5),\\n\\n (\\\"Sat\\\", 6)]) {\\n\\n Some(v) => { tm.tm_wday = v; Ok(()) }\\n\",\n \"file_path\": \"crates/time/src/parse.rs\",\n \"rank\": 43,\n \"score\": 225621.67450600077\n },\n {\n \"content\": \"/// Escapes all regular expression meta characters in `text`.\\n\\n///\\n\\n/// The string returned may be safely used as a literal in a regular\\n\\n/// expression.\\n\\npub fn quote(text: &str) -> String {\\n\\n let mut quoted = String::with_capacity(text.len());\\n\\n for c in text.chars() {\\n\\n if parser::is_punct(c) {\\n\\n quoted.push('\\\\\\\\');\\n\\n }\\n\\n quoted.push(c);\\n\\n }\\n\\n quoted\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/regex/regex-syntax/src/lib.rs\",\n \"rank\": 44,\n \"score\": 224721.37883491698\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub fn is_word_char(c: char) -> bool {\\n\\n match c {\\n\\n '_' | '0'...'9' | 'a'...'z' | 'A'...'Z' => true,\\n\\n _ => {\\n\\n ::unicode::regex::PERLW.binary_search_by(|&(start, end)| {\\n\\n if c >= start && c <= end {\\n\\n Ordering::Equal\\n\\n } else if start > c {\\n\\n Ordering::Greater\\n\\n } else {\\n\\n Ordering::Less\\n\\n }\\n\\n })\\n\\n .is_ok()\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// Returns true if and only if `c` is an ASCII word byte.\\n\",\n \"file_path\": \"crates/regex/regex-syntax/src/lib.rs\",\n \"rank\": 45,\n \"score\": 224612.80433109048\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\npub fn is_word_byte(b: u8) -> bool {\\n\\n match b {\\n\\n b'_' | b'0'...b'9' | b'a'...b'z' | b'A'...b'Z' => true,\\n\\n _ => false,\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod properties;\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use {CharClass, ClassRange, ByteClass, ByteRange, Expr};\\n\\n\\n\\n fn class(ranges: &[(char, char)]) -> CharClass {\\n\\n let ranges = ranges.iter()\\n\\n .cloned()\\n\\n .map(|(c1, c2)| ClassRange::new(c1, c2))\\n\\n .collect();\\n\\n CharClass::new(ranges)\\n\",\n \"file_path\": \"crates/regex/regex-syntax/src/lib.rs\",\n \"rank\": 46,\n \"score\": 224612.80433109048\n },\n {\n \"content\": \"#[plugin_registrar]\\n\\n#[doc(hidden)]\\n\\npub fn plugin_registrar(reg: &mut Registry) {\\n\\n reg.register_syntax_extension(\\n\\n token::intern(\\\"derive_NumFromPrimitive\\\"),\\n\\n MultiDecorator(Box::new(expand_deriving_from_primitive)));\\n\\n}\\n\",\n \"file_path\": \"crates/num/macros/src/lib.rs\",\n \"rank\": 47,\n \"score\": 223902.31590692053\n },\n {\n \"content\": \"pub fn fopacm_create_append() -> &'static mut ActorMemory {\\n\\n let fopacm_create_append =\\n\\n unsafe { transmute::<Addr, extern \\\"C\\\" fn() -> *mut ActorMemory>(0x80023f3c) };\\n\\n let actor_memory = fopacm_create_append();\\n\\n unsafe { &mut *actor_memory }\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"src/system/tww.rs\",\n \"rank\": 48,\n \"score\": 223902.31590692053\n },\n {\n \"content\": \"/// Cooperatively gives up a timeslice to the OS scheduler.\\n\\npub fn yield_now() {\\n\\n OS::yield_thread()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/thread/mod.rs\",\n \"rank\": 49,\n \"score\": 223192.4666534207\n },\n {\n \"content\": \"pub fn parse_prefix(_: &OsStr) -> Option<Prefix> {\\n\\n None\\n\\n}\\n\\n\\n\\npub const MAIN_SEP_STR: &'static str = \\\"/\\\";\\n\\npub const MAIN_SEP: char = '/';\\n\\n\\n\\n/// /////////////////////////////////////////////////////////////////////////////\\n\\n/// GENERAL NOTES\\n\\n/// /////////////////////////////////////////////////////////////////////////////\\n\\n///\\n\\n/// Parsing in this module is done by directly transmuting OsStr to [u8] slices,\\n\\n/// taking advantage of the fact that OsStr always encodes ASCII characters\\n\\n/// as-is. Eventually, this transmutation should be replaced by direct uses of\\n\\n/// OsStr APIs for parsing, but it will take a while for those to become\\n\\n/// available.\\n\\n\\n\\n/// /////////////////////////////////////////////////////////////////////////////\\n\\n/// Windows Prefixes\\n\\n/// /////////////////////////////////////////////////////////////////////////////\\n\",\n \"file_path\": \"src/system/path.rs\",\n \"rank\": 50,\n \"score\": 222365.76977615542\n },\n {\n \"content\": \"pub fn mktime(tm: &mut Tm) -> time_t {\\n\\n let mut new: Tm = unsafe { uninitialized() };\\n\\n let mut opp = unsafe { uninitialized() };\\n\\n let mut t = tm_to_secs(tm);\\n\\n\\n\\n secs_to_zone(t, 1, &mut new.tm_isdst, &mut new.tm_utcoff, &mut opp);\\n\\n\\n\\n if tm.tm_isdst >= 0 && new.tm_isdst != tm.tm_isdst {\\n\\n t -= opp as c_longlong - new.tm_utcoff as c_longlong;\\n\\n }\\n\\n\\n\\n t -= new.tm_utcoff as c_longlong;\\n\\n\\n\\n // if t as time_t != t {\\n\\n // return -1;\\n\\n // }\\n\\n\\n\\n secs_to_zone(t, 0, &mut new.tm_isdst, &mut new.tm_utcoff, &mut opp);\\n\\n\\n\\n if secs_to_tm(t + new.tm_utcoff as c_longlong, &mut new) < 0 {\\n\\n return -1;\\n\\n }\\n\\n\\n\\n *tm = new;\\n\\n t as time_t\\n\\n}\",\n \"file_path\": \"crates/time/src/musl.rs\",\n \"rank\": 51,\n \"score\": 221691.8125619393\n },\n {\n \"content\": \"pub fn timegm(tm: &mut Tm) -> time_t {\\n\\n let mut new: Tm = unsafe { uninitialized() };\\n\\n let t = tm_to_secs(tm);\\n\\n\\n\\n if secs_to_tm(t, &mut new) < 0 {\\n\\n return -1;\\n\\n }\\n\\n\\n\\n *tm = new;\\n\\n tm.tm_isdst = 0;\\n\\n tm.tm_utcoff = 0;\\n\\n\\n\\n t as time_t\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/time/src/musl.rs\",\n \"rank\": 52,\n \"score\": 221691.8125619393\n },\n {\n \"content\": \"#[plugin_registrar]\\n\\n#[doc(hidden)]\\n\\npub fn plugin_registrar(reg: &mut Registry) {\\n\\n reg.register_macro(\\\"regex\\\", native);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/regex/regex_macros/src/lib.rs\",\n \"rank\": 53,\n \"score\": 220458.02296188287\n },\n {\n \"content\": \"#[plugin_registrar]\\n\\npub fn plugin_registrar(reg: &mut Registry) {\\n\\n reg.register_syntax_extension(token::intern(\\\"derive_Rand\\\"),\\n\\n base::MultiDecorator(Box::new(expand_deriving_rand)));\\n\\n}\\n\\n\\n\\n\\n\\n\\n\\n\\n\",\n \"file_path\": \"crates/rand/rand_macros/src/lib.rs\",\n \"rank\": 54,\n \"score\": 220458.02296188287\n },\n {\n \"content\": \"fn ascii_class(name: &str) -> Option<CharClass> {\\n\\n ASCII_CLASSES.binary_search_by(|&(s, _)| s.cmp(name))\\n\\n .ok()\\n\\n .map(|i| raw_class_to_expr(ASCII_CLASSES[i].1))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/regex/regex-syntax/src/parser.rs\",\n \"rank\": 55,\n \"score\": 219390.77079468936\n },\n {\n \"content\": \"fn unicode_class(name: &str) -> Option<CharClass> {\\n\\n UNICODE_CLASSES.binary_search_by(|&(s, _)| s.cmp(name))\\n\\n .ok()\\n\\n .map(|i| raw_class_to_expr(UNICODE_CLASSES[i].1))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/regex/regex-syntax/src/parser.rs\",\n \"rank\": 56,\n \"score\": 219390.77079468936\n },\n {\n \"content\": \"/// Like `memchr`, but searches for three bytes instead of one.\\n\\npub fn memchr3(needle1: u8, needle2: u8, needle3: u8, haystack: &[u8]) -> Option<usize> {\\n\\n use libtww::std::cmp;\\n\\n\\n\\n fn slow(b1: u8, b2: u8, b3: u8, haystack: &[u8]) -> Option<usize> {\\n\\n haystack.iter().position(|&b| b == b1 || b == b2 || b == b3)\\n\\n }\\n\\n\\n\\n let len = haystack.len();\\n\\n let ptr = haystack.as_ptr();\\n\\n let align = (ptr as usize) & (USIZE_BYTES - 1);\\n\\n let mut i = 0;\\n\\n if align > 0 {\\n\\n i = cmp::min(USIZE_BYTES - align, len);\\n\\n if let Some(found) = slow(needle1, needle2, needle3, &haystack[..i]) {\\n\\n return Some(found);\\n\\n }\\n\\n }\\n\\n let repeated_b1 = repeat_byte(needle1);\\n\\n let repeated_b2 = repeat_byte(needle2);\\n\\n let repeated_b3 = repeat_byte(needle3);\\n\",\n \"file_path\": \"crates/memchr/src/lib.rs\",\n \"rank\": 57,\n \"score\": 218442.66012752388\n },\n {\n \"content\": \"/// Says whether the first byte after the prefix is a separator.\\n\\nfn has_physical_root(s: &[u8], prefix: Option<Prefix>) -> bool {\\n\\n let path = if let Some(p) = prefix {\\n\\n &s[p.len()..]\\n\\n } else {\\n\\n s\\n\\n };\\n\\n !path.is_empty() && is_sep_byte(path[0])\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/path.rs\",\n \"rank\": 58,\n \"score\": 218434.80417396006\n },\n {\n \"content\": \"// This uses an adaptive system to extend the vector when it fills. We want to\\n\\n// avoid paying to allocate and zero a huge chunk of memory if the reader only\\n\\n// has 4 bytes while still making large reads if the reader does have a ton\\n\\n// of data to return. Simply tacking on an extra DEFAULT_BUF_SIZE space every\\n\\n// time is 4,500 times (!) slower than this if the reader has a very small\\n\\n// amount of data to return.\\n\\nfn read_to_end<R: Read + ?Sized>(r: &mut R, buf: &mut Vec<u8>) -> Result<usize> {\\n\\n let start_len = buf.len();\\n\\n let mut len = start_len;\\n\\n let mut new_write_size = 16;\\n\\n let ret;\\n\\n loop {\\n\\n if len == buf.len() {\\n\\n if new_write_size < DEFAULT_BUF_SIZE {\\n\\n new_write_size *= 2;\\n\\n }\\n\\n buf.resize(len + new_write_size, 0);\\n\\n }\\n\\n\\n\\n match r.read(&mut buf[len..]) {\\n\\n Ok(0) => {\\n\\n ret = Ok(len - start_len);\\n\\n break;\\n\\n }\\n\\n Ok(n) => len += n,\\n\\n Err(ref e) if e.kind() == ErrorKind::Interrupted => {}\\n\",\n \"file_path\": \"src/system/io/mod.rs\",\n \"rank\": 59,\n \"score\": 217768.53195675247\n },\n {\n \"content\": \"#[inline]\\n\\npub fn pow<T: Clone + One + Mul<T, Output = T>>(mut base: T, mut exp: usize) -> T {\\n\\n if exp == 0 {\\n\\n return T::one();\\n\\n }\\n\\n\\n\\n while exp & 1 == 0 {\\n\\n base = base.clone() * base;\\n\\n exp >>= 1;\\n\\n }\\n\\n if exp == 1 {\\n\\n return base;\\n\\n }\\n\\n\\n\\n let mut acc = base.clone();\\n\\n while exp > 1 {\\n\\n exp >>= 1;\\n\\n base = base.clone() * base;\\n\\n if exp & 1 == 1 {\\n\\n acc = acc * base.clone();\\n\\n }\\n\",\n \"file_path\": \"crates/num/traits/src/pow.rs\",\n \"rank\": 60,\n \"score\": 217651.72489835887\n },\n {\n \"content\": \"pub fn expand_deriving_from_primitive(cx: &mut ExtCtxt,\\n\\n span: Span,\\n\\n mitem: &MetaItem,\\n\\n item: &Annotatable,\\n\\n push: &mut FnMut(Annotatable))\\n\\n{\\n\\n let inline = cx.meta_word(span, InternedString::new(\\\"inline\\\"));\\n\\n let attrs = vec!(cx.attribute(span, inline));\\n\\n let trait_def = TraitDef {\\n\\n is_unsafe: false,\\n\\n span: span,\\n\\n attributes: Vec::new(),\\n\\n path: path!(num::FromPrimitive),\\n\\n additional_bounds: Vec::new(),\\n\\n generics: LifetimeBounds::empty(),\\n\\n methods: vec!(\\n\\n MethodDef {\\n\\n name: \\\"from_i64\\\",\\n\\n is_unsafe: false,\\n\\n unify_fieldless_variants: false,\\n\",\n \"file_path\": \"crates/num/macros/src/lib.rs\",\n \"rank\": 61,\n \"score\": 217188.24774335138\n },\n {\n \"content\": \"pub fn ptr<T>(addr: Addr) -> *mut T {\\n\\n unsafe { mem::transmute(addr) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/memory.rs\",\n \"rank\": 62,\n \"score\": 216550.5217375946\n },\n {\n \"content\": \"// A few methods below (read_to_string, read_line) will append data into a\\n\\n// `String` buffer, but we need to be pretty careful when doing this. The\\n\\n// implementation will just call `.as_mut_vec()` and then delegate to a\\n\\n// byte-oriented reading method, but we must ensure that when returning we never\\n\\n// leave `buf` in a state such that it contains invalid UTF-8 in its bounds.\\n\\n//\\n\\n// To this end, we use an RAII guard (to protect against panics) which updates\\n\\n// the length of the string when it is dropped. This guard initially truncates\\n\\n// the string to the prior length and only after we've validated that the\\n\\n// new contents are valid UTF-8 do we allow it to set a longer length.\\n\\n//\\n\\n// The unsafety in this function is twofold:\\n\\n//\\n\\n// 1. We're looking at the raw bytes of `buf`, so we take on the burden of UTF-8\\n\\n// checks.\\n\\n// 2. We're passing a raw buffer to the function `f`, and it is expected that\\n\\n// the function only *appends* bytes to the buffer. We'll get undefined\\n\\n// behavior if existing bytes are overwritten to have non-UTF-8 data.\\n\\nfn append_to_string<F>(buf: &mut String, f: F) -> Result<usize>\\n\\n where F: FnOnce(&mut Vec<u8>) -> Result<usize>\\n\\n{\\n\\n struct Guard<'a> {\\n\\n s: &'a mut Vec<u8>,\\n\\n len: usize,\\n\\n }\\n\\n impl<'a> Drop for Guard<'a> {\\n\\n fn drop(&mut self) {\\n\\n unsafe {\\n\\n self.s.set_len(self.len);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n unsafe {\\n\\n let mut g = Guard {\\n\\n len: buf.len(),\\n\\n s: buf.as_mut_vec(),\\n\\n };\\n\",\n \"file_path\": \"src/system/io/mod.rs\",\n \"rank\": 63,\n \"score\": 215230.05448546784\n },\n {\n \"content\": \"pub fn expand_deriving_rand(cx: &mut ExtCtxt,\\n\\n span: Span,\\n\\n mitem: &MetaItem,\\n\\n item: &Annotatable,\\n\\n push: &mut FnMut(Annotatable)) {\\n\\n let trait_def = TraitDef {\\n\\n span: span,\\n\\n attributes: Vec::new(),\\n\\n path: Path::new(vec!(\\\"rand\\\", \\\"Rand\\\")),\\n\\n additional_bounds: Vec::new(),\\n\\n generics: LifetimeBounds::empty(),\\n\\n is_unsafe: false,\\n\\n methods: vec!(\\n\\n MethodDef {\\n\\n name: \\\"rand\\\",\\n\\n is_unsafe: false,\\n\\n generics: LifetimeBounds {\\n\\n lifetimes: Vec::new(),\\n\\n bounds: vec!((\\\"R\\\",\\n\\n vec!( Path::new(vec!(\\\"rand\\\", \\\"Rng\\\")) )))\\n\",\n \"file_path\": \"crates/rand/rand_macros/src/lib.rs\",\n \"rank\": 64,\n \"score\": 214080.0541094322\n },\n {\n \"content\": \"fn find_cap_ref(mut replacement: &[u8]) -> Option<CaptureRef> {\\n\\n if replacement.len() <= 1 || replacement[0] != b'$' {\\n\\n return None;\\n\\n }\\n\\n let mut brace = false;\\n\\n replacement = &replacement[1..];\\n\\n if replacement[0] == b'{' {\\n\\n brace = true;\\n\\n replacement = &replacement[1..];\\n\\n }\\n\\n let mut cap_end = 0;\\n\\n while replacement.get(cap_end).map_or(false, is_valid_cap_letter) {\\n\\n cap_end += 1;\\n\\n }\\n\\n if cap_end == 0 {\\n\\n return None;\\n\\n }\\n\\n // We just verified that the range 0..cap_end is valid ASCII, so it must\\n\\n // therefore be valid UTF-8. If we really cared, we could avoid this UTF-8\\n\\n // check with either unsafe or by parsing the number straight from &[u8].\\n\",\n \"file_path\": \"crates/regex/src/expand.rs\",\n \"rank\": 65,\n \"score\": 212636.63645916083\n },\n {\n \"content\": \"type CaptureName = Option<String>;\\n\\n\\n\\n/// The type of a repeat operator expression.\\n\\n#[derive(Clone, Copy, Debug, PartialEq, Eq)]\\n\\npub enum Repeater {\\n\\n /// Match zero or one (`?`).\\n\\n ZeroOrOne,\\n\\n /// Match zero or more (`*`).\\n\\n ZeroOrMore,\\n\\n /// Match one or more (`+`).\\n\\n OneOrMore,\\n\\n /// Match for at least `min` and at most `max` (`{m,n}`).\\n\\n ///\\n\\n /// When `max` is `None`, there is no upper bound on the number of matches.\\n\\n Range {\\n\\n /// Lower bound on the number of matches.\\n\\n min: u32,\\n\\n /// Optional upper bound on the number of matches.\\n\\n max: Option<u32>,\\n\\n },\\n\",\n \"file_path\": \"crates/regex/regex-syntax/src/lib.rs\",\n \"rank\": 66,\n \"score\": 212074.1525931839\n },\n {\n \"content\": \"type CaptureIndex = Option<usize>;\\n\\n\\n\",\n \"file_path\": \"crates/regex/regex-syntax/src/lib.rs\",\n \"rank\": 67,\n \"score\": 212025.98364913109\n },\n {\n \"content\": \"/// Returns an encoding from given label, defined in the WHATWG Encoding standard, if any.\\n\\n/// Implements \\\"get an encoding\\\" algorithm: http://encoding.spec.whatwg.org/#concept-encoding-get\\n\\npub fn encoding_from_whatwg_label(label: &str) -> Option<EncodingRef> {\\n\\n let label = label.trim_matches(&[' ', '\\\\n', '\\\\r', '\\\\t', '\\\\x0C'][..]);\\n\\n let label: String =\\n\\n label.chars().map(|c| match c { 'A'...'Z' => (c as u8 + 32) as char, _ => c }).collect();\\n\\n match &label[..] {\\n\\n \\\"unicode-1-1-utf-8\\\" |\\n\\n \\\"utf-8\\\" |\\n\\n \\\"utf8\\\" =>\\n\\n Some(all::UTF_8 as EncodingRef),\\n\\n \\\"866\\\" |\\n\\n \\\"cp866\\\" |\\n\\n \\\"csibm866\\\" |\\n\\n \\\"ibm866\\\" =>\\n\\n Some(all::IBM866 as EncodingRef),\\n\\n \\\"csisolatin2\\\" |\\n\\n \\\"iso-8859-2\\\" |\\n\\n \\\"iso-ir-101\\\" |\\n\\n \\\"iso8859-2\\\" |\\n\\n \\\"iso88592\\\" |\\n\\n \\\"iso_8859-2\\\" |\\n\",\n \"file_path\": \"crates/encoding/src/label.rs\",\n \"rank\": 68,\n \"score\": 212009.77855231738\n },\n {\n \"content\": \"pub fn expand(caps: &Captures, mut replacement: &[u8], dst: &mut Vec<u8>) {\\n\\n while !replacement.is_empty() {\\n\\n match memchr(b'$', replacement) {\\n\\n None => break,\\n\\n Some(i) => {\\n\\n dst.extend(&replacement[..i]);\\n\\n replacement = &replacement[i..];\\n\\n }\\n\\n }\\n\\n if replacement.get(1).map_or(false, |&b| b == b'$') {\\n\\n dst.push(b'$');\\n\\n replacement = &replacement[2..];\\n\\n continue;\\n\\n }\\n\\n debug_assert!(!replacement.is_empty());\\n\\n let cap_ref = match find_cap_ref(replacement) {\\n\\n Some(cap_ref) => cap_ref,\\n\\n None => {\\n\\n dst.push(b'$');\\n\\n replacement = &replacement[1..];\\n\",\n \"file_path\": \"crates/regex/src/expand.rs\",\n \"rank\": 69,\n \"score\": 211163.04832301792\n },\n {\n \"content\": \"pub fn localtime_r<'a>(t: &time_t, tm: &'a mut Tm) -> Result<&'a mut Tm, ()> {\\n\\n let mut opp = unsafe { uninitialized() };\\n\\n\\n\\n // Reject time_t values whose year would overflow int because\\n\\n // __secs_to_zone cannot safely handle them.\\n\\n // if (*t < INT_MIN * 31622400LL || *t > INT_MAX * 31622400LL) {\\n\\n // \\terrno = EOVERFLOW;\\n\\n // \\treturn 0;\\n\\n // }\\n\\n\\n\\n secs_to_zone(*t as c_longlong,\\n\\n 0,\\n\\n &mut tm.tm_isdst,\\n\\n &mut tm.tm_utcoff,\\n\\n &mut opp);\\n\\n\\n\\n if secs_to_tm(*t as c_longlong + tm.tm_utcoff as c_longlong, tm) < 0 {\\n\\n return Err(());\\n\\n }\\n\\n\\n\\n Ok(tm)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/time/src/musl.rs\",\n \"rank\": 70,\n \"score\": 211026.04145709044\n },\n {\n \"content\": \"fn year_to_secs(year: c_longlong, is_leap: &mut bool) -> c_longlong {\\n\\n if year - 2 <= 136 {\\n\\n let y = year;\\n\\n let mut leaps = (y - 68) >> 2;\\n\\n if (y - 68) & 3 == 0 {\\n\\n leaps -= 1;\\n\\n *is_leap = true;\\n\\n } else {\\n\\n *is_leap = false;\\n\\n }\\n\\n return 31536000 * (y - 70) + 86400 * leaps;\\n\\n }\\n\\n\\n\\n let (mut cycles, centuries, mut leaps, mut rem);\\n\\n\\n\\n cycles = (year - 100) / 400;\\n\\n rem = (year - 100) % 400;\\n\\n\\n\\n if rem < 0 {\\n\\n cycles -= 1;\\n\",\n \"file_path\": \"crates/time/src/musl.rs\",\n \"rank\": 71,\n \"score\": 210705.81741707143\n },\n {\n \"content\": \"#[inline]\\n\\nfn contains_zero_byte(x: usize) -> bool {\\n\\n x.wrapping_sub(LO_USIZE) & !x & HI_USIZE != 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/memchr.rs\",\n \"rank\": 72,\n \"score\": 209603.43706822154\n },\n {\n \"content\": \"pub fn sub2(a: &mut [BigDigit], b: &[BigDigit]) {\\n\\n let mut borrow = 0;\\n\\n\\n\\n let len = cmp::min(a.len(), b.len());\\n\\n let (a_lo, a_hi) = a.split_at_mut(len);\\n\\n let (b_lo, b_hi) = b.split_at(len);\\n\\n\\n\\n for (a, b) in a_lo.iter_mut().zip(b_lo) {\\n\\n *a = sbb(*a, *b, &mut borrow);\\n\\n }\\n\\n\\n\\n if borrow != 0 {\\n\\n for a in a_hi {\\n\\n *a = sbb(*a, 0, &mut borrow);\\n\\n if borrow == 0 { break }\\n\\n }\\n\\n }\\n\\n\\n\\n // note: we're _required_ to fail on underflow\\n\\n assert!(borrow == 0 && b_hi.iter().all(|x| *x == 0),\\n\\n \\\"Cannot subtract b from a because b is larger than a.\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/num/bigint/src/algorithms.rs\",\n \"rank\": 73,\n \"score\": 209473.06323632528\n },\n {\n \"content\": \"pub fn sub2rev(a: &[BigDigit], b: &mut [BigDigit]) {\\n\\n debug_assert!(b.len() >= a.len());\\n\\n\\n\\n let mut borrow = 0;\\n\\n\\n\\n let len = cmp::min(a.len(), b.len());\\n\\n let (a_lo, a_hi) = a.split_at(len);\\n\\n let (b_lo, b_hi) = b.split_at_mut(len);\\n\\n\\n\\n for (a, b) in a_lo.iter().zip(b_lo) {\\n\\n *b = sbb(*a, *b, &mut borrow);\\n\\n }\\n\\n\\n\\n assert!(a_hi.is_empty());\\n\\n\\n\\n // note: we're _required_ to fail on underflow\\n\\n assert!(borrow == 0 && b_hi.iter().all(|x| *x == 0),\\n\\n \\\"Cannot subtract b from a because b is larger than a.\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/num/bigint/src/algorithms.rs\",\n \"rank\": 74,\n \"score\": 209473.06323632528\n },\n {\n \"content\": \"/// /Two argument addition of raw slices:\\n\\n/// a += b\\n\\n///\\n\\n/// The caller _must_ ensure that a is big enough to store the result - typically this means\\n\\n/// resizing a to max(a.len(), b.len()) + 1, to fit a possible carry.\\n\\npub fn add2(a: &mut [BigDigit], b: &[BigDigit]) {\\n\\n let carry = __add2(a, b);\\n\\n\\n\\n debug_assert!(carry == 0);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/num/bigint/src/algorithms.rs\",\n \"rank\": 75,\n \"score\": 209473.06323632528\n },\n {\n \"content\": \"pub fn reference<T>(addr: Addr) -> &'static mut T {\\n\\n unsafe { &mut *ptr(addr) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/memory.rs\",\n \"rank\": 76,\n \"score\": 208358.9891297673\n },\n {\n \"content\": \"fn read_until<R: BufRead + ?Sized>(r: &mut R, delim: u8, buf: &mut Vec<u8>) -> Result<usize> {\\n\\n let mut read = 0;\\n\\n loop {\\n\\n let (done, used) = {\\n\\n let available = match r.fill_buf() {\\n\\n Ok(n) => n,\\n\\n Err(ref e) if e.kind() == ErrorKind::Interrupted => continue,\\n\\n Err(e) => return Err(e),\\n\\n };\\n\\n match memchr::memchr(delim, available) {\\n\\n Some(i) => {\\n\\n buf.extend_from_slice(&available[..i + 1]);\\n\\n (true, i + 1)\\n\\n }\\n\\n None => {\\n\\n buf.extend_from_slice(available);\\n\\n (false, available.len())\\n\\n }\\n\\n }\\n\\n };\\n\\n r.consume(used);\\n\\n read += used;\\n\\n if done || used == 0 {\\n\\n return Ok(read);\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/io/mod.rs\",\n \"rank\": 77,\n \"score\": 207556.85195196944\n },\n {\n \"content\": \"#[inline]\\n\\nfn contains_zero_byte(x: usize) -> bool {\\n\\n x.wrapping_sub(LO_USIZE) & !x & HI_USIZE != 0\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/memchr/src/lib.rs\",\n \"rank\": 78,\n \"score\": 205533.80365387173\n },\n {\n \"content\": \"/// Almost equivalent to `libtww::std::str::from_utf8`.\\n\\n/// This function is provided for the fair benchmark against the stdlib's UTF-8 conversion\\n\\n/// functions, as rust-encoding always allocates a new string.\\n\\npub fn from_utf8<'a>(input: &'a [u8]) -> Option<&'a str> {\\n\\n let mut iter = input.iter();\\n\\n let mut state;\\n\\n\\n\\n macro_rules! return_as_whole(() => (return Some(unsafe {mem::transmute(input)})));\\n\\n\\n\\n // optimization: if we are in the initial state, quickly skip to the first non-MSB-set byte.\\n\\n loop {\\n\\n match iter.next() {\\n\\n Some(&ch) if ch < 0x80 => {}\\n\\n Some(&ch) => {\\n\\n state = next_state!(INITIAL_STATE, ch);\\n\\n break;\\n\\n }\\n\\n None => {\\n\\n return_as_whole!();\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\",\n \"file_path\": \"crates/encoding/src/codec/utf_8.rs\",\n \"rank\": 79,\n \"score\": 204870.682024443\n },\n {\n \"content\": \"/// Creates a new synchronous, bounded channel.\\n\\n///\\n\\n/// Like asynchronous channels, the `Receiver` will block until a message\\n\\n/// becomes available. These channels differ greatly in the semantics of the\\n\\n/// sender from asynchronous channels, however.\\n\\n///\\n\\n/// This channel has an internal buffer on which messages will be queued. When\\n\\n/// the internal buffer becomes full, future sends will *block* waiting for the\\n\\n/// buffer to open up. Note that a buffer size of 0 is valid, in which case this\\n\\n/// becomes \\\"rendezvous channel\\\" where each send will not return until a recv\\n\\n/// is paired with it.\\n\\n///\\n\\n/// As with asynchronous channels, all senders will panic in `send` if the\\n\\n/// `Receiver` has been destroyed.\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// use std::sync::mpsc::sync_channel;\\n\\n/// use std::thread;\\n\\n///\\n\\n/// let (tx, rx) = sync_channel(1);\\n\\n///\\n\\n/// // this returns immediately\\n\\n/// tx.send(1).unwrap();\\n\\n///\\n\\n/// thread::spawn(move|| {\\n\\n/// // this will block until the previous message has been received\\n\\n/// tx.send(2).unwrap();\\n\\n/// });\\n\\n///\\n\\n/// assert_eq!(rx.recv().unwrap(), 1);\\n\\n/// assert_eq!(rx.recv().unwrap(), 2);\\n\\n/// ```\\n\\npub fn sync_channel<T>(bound: usize) -> (SyncSender<T>, Receiver<T>) {\\n\\n let a = Arc::new(UnsafeCell::new(sync::Packet::new(bound)));\\n\\n (SyncSender::new(a.clone()), Receiver::new(Flavor::Sync(a)))\\n\\n}\\n\\n\\n\\n/// /////////////////////////////////////////////////////////////////////////////\\n\\n/// Sender\\n\\n/// /////////////////////////////////////////////////////////////////////////////\\n\\n\\n\\nimpl<T> Sender<T> {\\n\\n fn new(inner: Flavor<T>) -> Sender<T> {\\n\\n Sender { inner: UnsafeCell::new(inner) }\\n\\n }\\n\\n\\n\\n /// Attempts to send a value on this channel, returning it back if it could\\n\\n /// not be sent.\\n\\n ///\\n\\n /// A successful send occurs when it is determined that the other end of\\n\\n /// the channel has not hung up already. An unsuccessful send would be one\\n\\n /// where the corresponding receiver has already been deallocated. Note\\n\",\n \"file_path\": \"src/system/sync/mpsc/mod.rs\",\n \"rank\": 80,\n \"score\": 202833.98223927512\n },\n {\n \"content\": \"fn match_digits_in_range(ss: &mut &str,\\n\\n min_digits : usize, max_digits : usize,\\n\\n ws: bool, min: i32, max: i32) -> Option<i32> {\\n\\n let before = *ss;\\n\\n match match_digits(ss, min_digits, max_digits, ws) {\\n\\n Some(val) if val >= min && val <= max => Some(val),\\n\\n _ => { *ss = before; None }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/time/src/parse.rs\",\n \"rank\": 81,\n \"score\": 200947.80033506488\n },\n {\n \"content\": \"#[bench]\\n\\nfn iterator_memchr3(b: &mut test::Bencher) {\\n\\n let haystack = bench_data();\\n\\n let (needle1, needle2, needle3) = (b'a', b'b', b'c');\\n\\n b.iter(|| {\\n\\n assert!(haystack.iter().position(|&b| {\\n\\n b == needle1 || b == needle2 || b == needle3\\n\\n }).is_none());\\n\\n });\\n\\n b.bytes = haystack.len() as u64;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/memchr/benches/bench.rs\",\n \"rank\": 82,\n \"score\": 200389.1918942631\n },\n {\n \"content\": \"#[bench]\\n\\nfn iterator_memchr(b: &mut test::Bencher) {\\n\\n let haystack = bench_data();\\n\\n let needle = b'a';\\n\\n b.iter(|| {\\n\\n assert!(haystack.iter().position(|&b| b == needle).is_none());\\n\\n });\\n\\n b.bytes = haystack.len() as u64;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/memchr/benches/bench.rs\",\n \"rank\": 83,\n \"score\": 200389.1918942631\n },\n {\n \"content\": \"#[bench]\\n\\nfn iterator_memchr2(b: &mut test::Bencher) {\\n\\n let haystack = bench_data();\\n\\n let (needle1, needle2) = (b'a', b'b');\\n\\n b.iter(|| {\\n\\n assert!(haystack.iter().position(|&b| {\\n\\n b == needle1 || b == needle2\\n\\n }).is_none());\\n\\n });\\n\\n b.bytes = haystack.len() as u64;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/memchr/benches/bench.rs\",\n \"rank\": 84,\n \"score\": 200389.1918942631\n },\n {\n \"content\": \"#[bench]\\n\\nfn iterator_memrchr(b: &mut test::Bencher) {\\n\\n let haystack = bench_data();\\n\\n let needle = b'a';\\n\\n b.iter(|| {\\n\\n assert!(haystack.iter().rposition(|&b| b == needle).is_none());\\n\\n });\\n\\n b.bytes = haystack.len() as u64;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/memchr/benches/bench.rs\",\n \"rank\": 85,\n \"score\": 200389.1918942631\n },\n {\n \"content\": \"/// Tries to parse `[-+]\\\\d\\\\d` continued by `\\\\d\\\\d`. Return an offset in seconds if possible.\\n\\n///\\n\\n/// The additional `colon` may be used to parse a mandatory or optional `:`\\n\\n/// between hours and minutes, and should return either a new suffix or `Err` when parsing fails.\\n\\npub fn timezone_offset<F>(mut s: &str, mut colon: F) -> ParseResult<(&str, i32)>\\n\\n where F: FnMut(&str) -> ParseResult<&str> {\\n\\n fn digits(s: &str) -> ParseResult<(u8, u8)> {\\n\\n let b = s.as_bytes();\\n\\n if b.len() < 2 {\\n\\n Err(TOO_SHORT)\\n\\n } else {\\n\\n Ok((b[0], b[1]))\\n\\n }\\n\\n }\\n\\n let negative = match s.as_bytes().first() {\\n\\n Some(&b'+') => false,\\n\\n Some(&b'-') => true,\\n\\n Some(_) => return Err(INVALID),\\n\\n None => return Err(TOO_SHORT),\\n\\n };\\n\\n s = &s[1..];\\n\\n\\n\\n // hours (00--99)\\n\\n let hours = match try!(digits(s)) {\\n\",\n \"file_path\": \"crates/chrono/src/format/scan.rs\",\n \"rank\": 86,\n \"score\": 200026.8010887546\n },\n {\n \"content\": \"/// Same to `timezone_offset` but also allows for RFC 2822 legacy timezones.\\n\\n/// May return `None` which indicates an insufficient offset data (i.e. `-0000`).\\n\\npub fn timezone_offset_2822(s: &str) -> ParseResult<(&str, Option<i32>)> {\\n\\n // tries to parse legacy time zone names\\n\\n let upto = s.as_bytes().iter().position(|&c| match c { b'a'...b'z' | b'A'...b'Z' => false,\\n\\n _ => true }).unwrap_or(s.len());\\n\\n if upto > 0 {\\n\\n let name = &s[..upto];\\n\\n let s = &s[upto..];\\n\\n if equals(name, \\\"gmt\\\") || equals(name, \\\"ut\\\") {\\n\\n Ok((s, Some(0)))\\n\\n } else if equals(name, \\\"est\\\") {\\n\\n Ok((s, Some(-5 * 3600)))\\n\\n } else if equals(name, \\\"edt\\\") {\\n\\n Ok((s, Some(-4 * 3600)))\\n\\n } else if equals(name, \\\"cst\\\") {\\n\\n Ok((s, Some(-6 * 3600)))\\n\\n } else if equals(name, \\\"cdt\\\") {\\n\\n Ok((s, Some(-5 * 3600)))\\n\\n } else if equals(name, \\\"mst\\\") {\\n\\n Ok((s, Some(-7 * 3600)))\\n\\n } else if equals(name, \\\"mdt\\\") {\\n\",\n \"file_path\": \"crates/chrono/src/format/scan.rs\",\n \"rank\": 87,\n \"score\": 199135.9469563465\n },\n {\n \"content\": \"#[must_use]\\n\\n#[inline]\\n\\npub fn __add2(a: &mut [BigDigit], b: &[BigDigit]) -> BigDigit {\\n\\n debug_assert!(a.len() >= b.len());\\n\\n\\n\\n let mut carry = 0;\\n\\n let (a_lo, a_hi) = a.split_at_mut(b.len());\\n\\n\\n\\n for (a, b) in a_lo.iter_mut().zip(b) {\\n\\n *a = adc(*a, *b, &mut carry);\\n\\n }\\n\\n\\n\\n if carry != 0 {\\n\\n for a in a_hi {\\n\\n *a = adc(*a, 0, &mut carry);\\n\\n if carry == 0 { break }\\n\\n }\\n\\n }\\n\\n\\n\\n carry\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/num/bigint/src/algorithms.rs\",\n \"rank\": 88,\n \"score\": 198542.87015984353\n },\n {\n \"content\": \"pub fn dstage_actor_create(template: *const ActorTemplate, memory: *mut ActorMemory) {\\n\\n let dstage_actor_create = unsafe {\\n\\n transmute::<Addr, extern \\\"C\\\" fn(*const ActorTemplate, *mut ActorMemory)>(0x8003f484)\\n\\n };\\n\\n dstage_actor_create(template, memory);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/tww.rs\",\n \"rank\": 89,\n \"score\": 195578.42683612404\n },\n {\n \"content\": \"fn multiply_bench(b: &mut Bencher, xbits: usize, ybits: usize) {\\n\\n let mut rng = get_rng();\\n\\n let x = rng.gen_bigint(xbits);\\n\\n let y = rng.gen_bigint(ybits);\\n\\n\\n\\n b.iter(|| &x * &y);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/num/benches/bigint.rs\",\n \"rank\": 90,\n \"score\": 194033.06356799748\n },\n {\n \"content\": \"fn divide_bench(b: &mut Bencher, xbits: usize, ybits: usize) {\\n\\n let mut rng = get_rng();\\n\\n let x = rng.gen_bigint(xbits);\\n\\n let y = rng.gen_bigint(ybits);\\n\\n\\n\\n b.iter(|| &x / &y);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/num/benches/bigint.rs\",\n \"rank\": 91,\n \"score\": 194033.06356799748\n },\n {\n \"content\": \"#[bench]\\n\\nfn ac_one_prefix_byte_no_match(b: &mut Bencher) {\\n\\n let aut = $aut(vec![\\\"zbc\\\"]);\\n\\n $bench(b, aut, &haystack_same('y'));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/aho-corasick/benches/bench.rs\",\n \"rank\": 92,\n \"score\": 193859.8857244603\n },\n {\n \"content\": \"#[bench]\\n\\nfn naive_one_prefix_byte_no_match(b: &mut Bencher) {\\n\\n bench_naive_no_match(b, vec![\\\"zbc\\\"], &haystack_same('y'));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/aho-corasick/benches/bench.rs\",\n \"rank\": 93,\n \"score\": 193859.8857244603\n },\n {\n \"content\": \"type Result<T> = result::Result<T, Box<error::Error + Send + Sync>>;\\n\\n\\n\",\n \"file_path\": \"crates/regex/regex-debug/src/main.rs\",\n \"rank\": 94,\n \"score\": 193104.96987525586\n },\n {\n \"content\": \"fn match_fractional_seconds(ss: &mut &str) -> i32 {\\n\\n let mut value = 0;\\n\\n let mut multiplier = NSEC_PER_SEC / 10;\\n\\n\\n\\n let mut chars = ss.char_indices();\\n\\n let orig = *ss;\\n\\n for (i, ch) in &mut chars {\\n\\n *ss = &orig[i..];\\n\\n match ch {\\n\\n '0' ... '9' => {\\n\\n // This will drop digits after the nanoseconds place\\n\\n let digit = ch as i32 - '0' as i32;\\n\\n value += digit * multiplier;\\n\\n multiplier /= 10;\\n\\n }\\n\\n _ => break\\n\\n }\\n\\n }\\n\\n\\n\\n value\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/time/src/parse.rs\",\n \"rank\": 95,\n \"score\": 192896.31019169162\n },\n {\n \"content\": \"/// The offset from the local time to UTC.\\n\\npub trait Offset: Sized + Clone + fmt::Debug {\\n\\n /// Returns the offset from UTC to the local time stored.\\n\\n fn local_minus_utc(&self) -> Duration;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/chrono/src/offset/mod.rs\",\n \"rank\": 96,\n \"score\": 192571.5302052089\n },\n {\n \"content\": \"pub fn write_str<T: AsRef<str>>(ptr: *mut u8, value: T) {\\n\\n let mut dst = ptr;\\n\\n for &byte in value.as_ref().as_bytes().iter() {\\n\\n unsafe {\\n\\n *dst = byte;\\n\\n dst = dst.offset(1);\\n\\n }\\n\\n if byte == 0 {\\n\\n return;\\n\\n }\\n\\n }\\n\\n unsafe {\\n\\n *dst = 0;\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/system/memory.rs\",\n \"rank\": 97,\n \"score\": 190812.5932832366\n },\n {\n \"content\": \"#[bench]\\n\\nfn ac_one_prefix_byte_every_match(b: &mut Bencher) {\\n\\n // We lose the benefit of `memchr` because the first byte matches\\n\\n // in every position in the haystack.\\n\\n let aut = $aut(vec![\\\"zbc\\\"]);\\n\\n $bench(b, aut, &haystack_same('z'));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/aho-corasick/benches/bench.rs\",\n \"rank\": 98,\n \"score\": 190585.27979908953\n },\n {\n \"content\": \"#[bench]\\n\\nfn ac_two_one_prefix_byte_no_match(b: &mut Bencher) {\\n\\n let aut = $aut(vec![\\\"zbcdef\\\", \\\"zmnopq\\\"]);\\n\\n $bench(b, aut, &haystack_same('y'));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"crates/aho-corasick/benches/bench.rs\",\n \"rank\": 99,\n \"score\": 190585.27979908953\n }\n]","isConversational":false}}},{"rowIdx":988,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/passes/mod.rs"},"repo_name":{"kind":"string","value":"Kixiron/cranial-coitus"},"commit":{"kind":"string","value":"2f0b158709b23f23a4d84045846829b250779f31"},"file_code":{"kind":"string","value":"mod add_sub_loop;\nmod associative_ops;\nmod canonicalize;\nmod const_folding;\nmod copy_cell;\nmod dataflow;\nmod dce;\nmod eliminate_const_gamma;\nmod equality;\nmod expr_dedup;\nmod fold_arithmetic;\nmod fuse_io;\nmod licm;\nmod mem2reg;\nmod move_cell;\nmod scan_loops;\nmod square_cell;\nmod symbolic_eval;\nmod unobserved_store;\nmod utils;\nmod zero_loop;\n\npub use add_sub_loop::AddSubLoop;\npub use associative_ops::AssociativeOps;\npub use canonicalize::Canonicalize;\npub use const_folding::ConstFolding;\npub use copy_cell::CopyCell;\npub use dataflow::{Dataflow, DataflowSettings};\npub use dce::Dce;\npub use eliminate_const_gamma::ElimConstGamma;\npub use equality::Equality;\npub use expr_dedup::ExprDedup;\npub use fold_arithmetic::FoldArithmetic;\npub use fuse_io::FuseIO;\npub use licm::Licm;\npub use mem2reg::Mem2Reg;\npub use move_cell::MoveCell;\npub use scan_loops::ScanLoops;\npub use square_cell::SquareCell;\npub use symbolic_eval::SymbolicEval;\npub use unobserved_store::UnobservedStore;\npub use zero_loop::ZeroLoop;\n\nuse crate::{\n graph::{\n Add, Bool, Byte, End, Eq, Gamma, Input, InputParam, Int, Load, Mul, Neg, Neq, Node,\n NodeExt, NodeId, Not, Output, OutputParam, Rvsdg, Scan, Start, Store, Sub, Theta,\n },\n passes::utils::ChangeReport,\n utils::HashSet,\n values::{Cell, Ptr},\n};\nuse std::{cell::RefCell, collections::VecDeque};\n\n#[derive(Debug, Clone)]\npub struct PassConfig {\n tape_len: u16,\n tape_operations_wrap: bool,\n cell_operations_wrap: bool,\n}\n\nimpl PassConfig {\n pub fn new(tape_len: u16, tape_operations_wrap: bool, cell_operations_wrap: bool) -> Self {\n Self {\n tape_len,\n tape_operations_wrap,\n cell_operations_wrap,\n }\n }\n}\n\npub fn default_passes(config: &PassConfig) -> Vec<Box<dyn Pass>> {\n let tape_len = config.tape_len;\n\n bvec![\n UnobservedStore::new(tape_len),\n ConstFolding::new(tape_len),\n FoldArithmetic::new(tape_len),\n AssociativeOps::new(tape_len),\n ZeroLoop::new(tape_len),\n Mem2Reg::new(tape_len),\n AddSubLoop::new(tape_len),\n FuseIO::new(),\n MoveCell::new(tape_len),\n ScanLoops::new(tape_len),\n Dce::new(),\n ElimConstGamma::new(tape_len),\n ConstFolding::new(tape_len),\n \n SymbolicEval::new(tape_len),\n Licm::new(),\n CopyCell::new(tape_len),\n Equality::new(),\n ExprDedup::new(tape_len),\n \n Canonicalize::new(),\n Dce::new(),\n ]\n}\n\nthread_local! {\n \n \n #[allow(clippy::declare_interior_mutable_const)]\n #[allow(clippy::type_complexity)]\n static VISIT_GRAPH_CACHE: RefCell<Vec<(VecDeque<NodeId>, HashSet<NodeId>, Vec<NodeId>)>>\n = const { RefCell::new(Vec::new()) };\n}\n\npub trait Pass {\n \n fn pass_name(&self) -> &'static str;\n\n fn did_change(&self) -> bool;\n\n fn reset(&mut self);\n\n fn report(&self) -> ChangeReport {\n ChangeReport::default()\n }\n\n fn visit_graph(&mut self, graph: &mut Rvsdg) -> bool {\n \n let (mut stack, mut visited, mut buffer) = VISIT_GRAPH_CACHE\n .with(|buffers| buffers.borrow_mut().pop())\n \n .unwrap_or_else(|| {\n (\n VecDeque::with_capacity(graph.node_len() / 2),\n HashSet::with_capacity_and_hasher(graph.node_len(), Default::default()),\n Vec::new(),\n )\n });\n\n let result = self.visit_graph_inner(graph, &mut stack, &mut visited, &mut buffer);\n\n \n stack.clear();\n visited.clear();\n buffer.clear();\n VISIT_GRAPH_CACHE.with(|buffers| buffers.borrow_mut().push((stack, visited, buffer)));\n\n result\n }\n\n \n \n \n \n fn visit_graph_inner(\n &mut self,\n graph: &mut Rvsdg,\n stack: &mut VecDeque<NodeId>,\n visited: &mut HashSet<NodeId>,\n buffer: &mut Vec<NodeId>,\n ) -> bool {\n visited.clear();\n buffer.clear();\n\n \n \n \n \n for node_id in graph.node_ids() {\n let node = graph.get_node(node_id);\n\n if node.is_start() || node.is_input_param() {\n stack.push_back(node_id);\n } else if node.is_end() || node.is_output_param() {\n stack.push_front(node_id);\n }\n }\n\n while let Some(node_id) = stack.pop_back() {\n \n \n if visited.contains(&node_id) || !graph.contains_node(node_id) {\n continue;\n }\n\n \n let mut missing_inputs = false;\n buffer.extend(graph.try_inputs(node_id).filter_map(|(_, input)| {\n input.and_then(|(input, ..)| {\n let input_id = input.node();\n\n if !visited.contains(&input_id) {\n missing_inputs = true;\n Some(input_id)\n } else {\n None\n }\n })\n }));\n\n \n \n \n if missing_inputs {\n stack.reserve(buffer.len() + 1);\n stack.push_back(node_id);\n stack.extend(buffer.drain(..));\n\n continue;\n }\n\n \n self.visit(graph, node_id);\n self.after_visit(graph, node_id);\n\n \n let didnt_exist = visited.insert(node_id);\n debug_assert!(didnt_exist);\n\n \n if graph.contains_node(node_id) {\n \n buffer.extend(\n graph\n .get_node(node_id)\n .all_output_ports()\n .into_iter()\n .flat_map(|output| graph.get_outputs(output))\n .filter_map(|(output_node, ..)| {\n let output_id = output_node.node();\n\n \n \n (!visited.contains(&output_id) && !stack.contains(&output_id))\n .then(|| output_id)\n }),\n );\n\n stack.extend(buffer.drain(..));\n }\n }\n\n self.post_visit_graph(graph, visited);\n stack.clear();\n buffer.clear();\n visited.clear();\n\n self.did_change()\n }\n\n fn post_visit_graph(&mut self, _graph: &mut Rvsdg, _visited: &HashSet<NodeId>) {}\n\n fn after_visit(&mut self, _graph: &mut Rvsdg, _node_id: NodeId) {}\n\n fn visit(&mut self, graph: &mut Rvsdg, node_id: NodeId) {\n \n if let Some(node) = graph.try_node(node_id).cloned() {\n match node {\n Node::Int(int, value) => self.visit_int(graph, int, value),\n Node::Byte(byte, value) => self.visit_byte(graph, byte, value),\n Node::Bool(bool, value) => self.visit_bool(graph, bool, value),\n Node::Add(add) => self.visit_add(graph, add),\n Node::Sub(sub) => self.visit_sub(graph, sub),\n Node::Mul(mul) => self.visit_mul(graph, mul),\n Node::Load(load) => self.visit_load(graph, load),\n Node::Store(store) => self.visit_store(graph, store),\n Node::Scan(scan) => self.visit_scan(graph, scan),\n Node::Start(start) => self.visit_start(graph, start),\n Node::End(end) => self.visit_end(graph, end),\n Node::Input(input) => self.visit_input(graph, input),\n Node::Output(output) => self.visit_output(graph, output),\n Node::Theta(theta) => self.visit_theta(graph, *theta),\n Node::Eq(eq) => self.visit_eq(graph, eq),\n Node::Neq(neq) => self.visit_neq(graph, neq),\n Node::Not(not) => self.visit_not(graph, not),\n Node::Neg(neg) => self.visit_neg(graph, neg),\n Node::Gamma(gamma) => self.visit_gamma(graph, *gamma),\n Node::InputParam(input_param) => self.visit_input_param(graph, input_param),\n Node::OutputParam(output_param) => self.visit_output_param(graph, output_param),\n }\n } else {\n tracing::error!(\"visited node that doesn't exist: {:?}\", node_id);\n }\n }\n\n fn visit_int(&mut self, _graph: &mut Rvsdg, _int: Int, _value: Ptr) {}\n fn visit_byte(&mut self, _graph: &mut Rvsdg, _byte: Byte, _value: Cell) {}\n fn visit_bool(&mut self, _graph: &mut Rvsdg, _bool: Bool, _value: bool) {}\n\n fn visit_add(&mut self, _graph: &mut Rvsdg, _add: Add) {}\n fn visit_sub(&mut self, _graph: &mut Rvsdg, _sub: Sub) {}\n fn visit_mul(&mut self, _graph: &mut Rvsdg, _mul: Mul) {}\n\n fn visit_not(&mut self, _graph: &mut Rvsdg, _not: Not) {}\n fn visit_neg(&mut self, _graph: &mut Rvsdg, _neg: Neg) {}\n\n fn visit_eq(&mut self, _graph: &mut Rvsdg, _eq: Eq) {}\n fn visit_neq(&mut self, _graph: &mut Rvsdg, _neq: Neq) {}\n\n fn visit_load(&mut self, _graph: &mut Rvsdg, _load: Load) {}\n fn visit_store(&mut self, _graph: &mut Rvsdg, _store: Store) {}\n\n fn visit_scan(&mut self, _graph: &mut Rvsdg, _scan: Scan) {}\n fn visit_input(&mut self, _graph: &mut Rvsdg, _input: Input) {}\n fn visit_output(&mut self, _graph: &mut Rvsdg, _output: Output) {}\n\n \n \n \n \n \n \n \n fn visit_theta(&mut self, _graph: &mut Rvsdg, _theta: Theta) {}\n fn visit_gamma(&mut self, _graph: &mut Rvsdg, _gamma: Gamma) {}\n\n fn visit_input_param(&mut self, _graph: &mut Rvsdg, _input: InputParam) {}\n fn visit_output_param(&mut self, _graph: &mut Rvsdg, _output: OutputParam) {}\n\n fn visit_start(&mut self, _graph: &mut Rvsdg, _start: Start) {}\n fn visit_end(&mut self, _graph: &mut Rvsdg, _end: End) {}\n}\n\ntest_opts! {\n \n \n \n \n \n \n \n \n \n memchr_loop,\n passes = |tape_len| bvec![ZeroLoop::new(tape_len)],\n output = [0],\n |graph, mut effect, tape_len| {\n let mut ptr = graph.int(Ptr::zero(tape_len)).value();\n\n \n let not_zero = graph.int(Ptr::new(255, tape_len)).value();\n let store = graph.store(ptr, not_zero, effect);\n effect = store.output_effect();\n\n \n let theta = graph.theta([], [ptr], effect, |graph, mut effect, _invariant, variant| {\n let ptr = variant[0];\n\n let zero = graph.int(Ptr::zero(tape_len)).value();\n let four = graph.int(Ptr::new(4, tape_len)).value();\n\n let add = graph.add(ptr, four);\n let load = graph.load(add.value(), effect);\n effect = load.output_effect();\n\n let not_eq_zero = graph.neq(load.output_value(), zero);\n\n ThetaData::new([ptr], not_eq_zero.value(), effect)\n });\n ptr = theta.output_ports().next().unwrap();\n effect = theta.output_effect().unwrap();\n\n \n let load = graph.load(ptr, effect);\n effect = load.output_effect();\n\n \n let output = graph.output(load.output_value(), effect);\n output.output_effect()\n },\n}\n"},"prefix":{"kind":"string","value":"mod add_sub_loop;\nmod associative_ops;\nmod canonicalize;\nmod const_folding;\nmod copy_cell;\nmod dataflow;\nmod dce;\nmod eliminate_const_gamma;\nmod equality;\nmod expr_dedup;\nmod fold_arithmetic;\nmod fuse_io;\nmod licm;\nmod mem2reg;\nmod move_cell;\nmod scan_loops;\nmod square_cell;\nmod symbolic_eval;\nmod unobserved_store;\nmod utils;\nmod zero_loop;\n\npub use add_sub_loop::AddSubLoop;\npub use associative_ops::AssociativeOps;\npub use canonicalize::Canonicalize;\npub use const_folding::ConstFolding;\npub use copy_cell::CopyCell;\npub use dataflow::{Dataflow, DataflowSettings};\npub use dce::Dce;\npub use eliminate_const_gamma::ElimConstGamma;\npub use equality::Equality;\npub use expr_dedup::ExprDedup;\npub use fold_arithmetic::FoldArithmetic;\npub use fuse_io::FuseIO;\npub use licm::Licm;\npub use mem2reg::Mem2Reg;\npub use move_cell::MoveCell;\npub use scan_loops::ScanLoops;\npub use square_cell::SquareCell;\npub use symbolic_eval::SymbolicEval;\npub use unobserved_store::UnobservedStore;\npub use zero_loop::ZeroLoop;\n\nuse crate::{\n graph::{\n Add, Bool, Byte, End, Eq, Gamma, Input, InputParam, Int, Load, Mul, Neg, Neq, Node,\n NodeExt, NodeId, Not, Output, OutputParam, Rvsdg, Scan, Start, Store, Sub, Theta,\n },\n passes::utils::ChangeReport,\n utils::HashSet,\n values::{Cell, Ptr},\n};\nuse std::{cell::RefCell, collections::VecDeque};\n\n#[derive(Debug, Clone)]\npub struct PassConfig {\n tape_len: u16,\n tape_operations_wrap: bool,\n cell_operations_wrap: bool,\n}\n\nimpl PassConfig {\n pub fn new(tape_len: u16, tape_operations_wrap: bool, cell_operations_wrap: bool) -> Self {\n Self {\n tape_len,\n tape_operations_wrap,\n cell_operations_wrap,\n }\n }\n}\n\npub fn default_passes(config: &PassConfig) -> Vec<Box<dyn Pass>> {\n let tape_len = config.tape_len;\n\n bvec![\n UnobservedStore::new(tape_len),\n ConstFolding::new(tape_len),\n FoldArithmetic::new(tape_len),\n AssociativeOps::new(tape_len),\n ZeroLoop::new(tape_len),\n Mem2Reg::new(tape_len),\n AddSubLoop::new(tape_len),\n FuseIO::new(),\n MoveCell::new(tape_len),\n ScanLoops::new(tape_len),\n Dce::new(),\n ElimConstGamma::new(tape_len),\n ConstFolding::new(tape_len),\n \n SymbolicEval::new(tape_len),\n Licm::new(),\n CopyCell::new(tape_len),\n Equality::new(),\n ExprDedup::new(tape_len),\n \n Canonicalize::new(),\n Dce::new(),\n ]\n}\n\nthread_local! {\n \n \n #[allow(clippy::declare_interior_mutable_const)]\n #[allow(clippy::type_complexity)]\n static VISIT_GRAPH_CACHE: RefCell<Vec<(VecDeque<NodeId>, HashSet<NodeId>, Vec<NodeId>)>>\n = const { RefCell::new(Vec::new()) };\n}\n\npub trait Pass {\n \n fn pass_name(&self) -> &'static str;\n\n fn did_change(&self) -> bool;\n\n fn reset(&mut self);\n\n fn report(&self) -> ChangeReport {\n ChangeReport::default()\n }\n\n "},"suffix":{"kind":"string","value":"\n\n \n \n \n \n fn visit_graph_inner(\n &mut self,\n graph: &mut Rvsdg,\n stack: &mut VecDeque<NodeId>,\n visited: &mut HashSet<NodeId>,\n buffer: &mut Vec<NodeId>,\n ) -> bool {\n visited.clear();\n buffer.clear();\n\n \n \n \n \n for node_id in graph.node_ids() {\n let node = graph.get_node(node_id);\n\n if node.is_start() || node.is_input_param() {\n stack.push_back(node_id);\n } else if node.is_end() || node.is_output_param() {\n stack.push_front(node_id);\n }\n }\n\n while let Some(node_id) = stack.pop_back() {\n \n \n if visited.contains(&node_id) || !graph.contains_node(node_id) {\n continue;\n }\n\n \n let mut missing_inputs = false;\n buffer.extend(graph.try_inputs(node_id).filter_map(|(_, input)| {\n input.and_then(|(input, ..)| {\n let input_id = input.node();\n\n if !visited.contains(&input_id) {\n missing_inputs = true;\n Some(input_id)\n } else {\n None\n }\n })\n }));\n\n \n \n \n if missing_inputs {\n stack.reserve(buffer.len() + 1);\n stack.push_back(node_id);\n stack.extend(buffer.drain(..));\n\n continue;\n }\n\n \n self.visit(graph, node_id);\n self.after_visit(graph, node_id);\n\n \n let didnt_exist = visited.insert(node_id);\n debug_assert!(didnt_exist);\n\n \n if graph.contains_node(node_id) {\n \n buffer.extend(\n graph\n .get_node(node_id)\n .all_output_ports()\n .into_iter()\n .flat_map(|output| graph.get_outputs(output))\n .filter_map(|(output_node, ..)| {\n let output_id = output_node.node();\n\n \n \n (!visited.contains(&output_id) && !stack.contains(&output_id))\n .then(|| output_id)\n }),\n );\n\n stack.extend(buffer.drain(..));\n }\n }\n\n self.post_visit_graph(graph, visited);\n stack.clear();\n buffer.clear();\n visited.clear();\n\n self.did_change()\n }\n\n fn post_visit_graph(&mut self, _graph: &mut Rvsdg, _visited: &HashSet<NodeId>) {}\n\n fn after_visit(&mut self, _graph: &mut Rvsdg, _node_id: NodeId) {}\n\n fn visit(&mut self, graph: &mut Rvsdg, node_id: NodeId) {\n \n if let Some(node) = graph.try_node(node_id).cloned() {\n match node {\n Node::Int(int, value) => self.visit_int(graph, int, value),\n Node::Byte(byte, value) => self.visit_byte(graph, byte, value),\n Node::Bool(bool, value) => self.visit_bool(graph, bool, value),\n Node::Add(add) => self.visit_add(graph, add),\n Node::Sub(sub) => self.visit_sub(graph, sub),\n Node::Mul(mul) => self.visit_mul(graph, mul),\n Node::Load(load) => self.visit_load(graph, load),\n Node::Store(store) => self.visit_store(graph, store),\n Node::Scan(scan) => self.visit_scan(graph, scan),\n Node::Start(start) => self.visit_start(graph, start),\n Node::End(end) => self.visit_end(graph, end),\n Node::Input(input) => self.visit_input(graph, input),\n Node::Output(output) => self.visit_output(graph, output),\n Node::Theta(theta) => self.visit_theta(graph, *theta),\n Node::Eq(eq) => self.visit_eq(graph, eq),\n Node::Neq(neq) => self.visit_neq(graph, neq),\n Node::Not(not) => self.visit_not(graph, not),\n Node::Neg(neg) => self.visit_neg(graph, neg),\n Node::Gamma(gamma) => self.visit_gamma(graph, *gamma),\n Node::InputParam(input_param) => self.visit_input_param(graph, input_param),\n Node::OutputParam(output_param) => self.visit_output_param(graph, output_param),\n }\n } else {\n tracing::error!(\"visited node that doesn't exist: {:?}\", node_id);\n }\n }\n\n fn visit_int(&mut self, _graph: &mut Rvsdg, _int: Int, _value: Ptr) {}\n fn visit_byte(&mut self, _graph: &mut Rvsdg, _byte: Byte, _value: Cell) {}\n fn visit_bool(&mut self, _graph: &mut Rvsdg, _bool: Bool, _value: bool) {}\n\n fn visit_add(&mut self, _graph: &mut Rvsdg, _add: Add) {}\n fn visit_sub(&mut self, _graph: &mut Rvsdg, _sub: Sub) {}\n fn visit_mul(&mut self, _graph: &mut Rvsdg, _mul: Mul) {}\n\n fn visit_not(&mut self, _graph: &mut Rvsdg, _not: Not) {}\n fn visit_neg(&mut self, _graph: &mut Rvsdg, _neg: Neg) {}\n\n fn visit_eq(&mut self, _graph: &mut Rvsdg, _eq: Eq) {}\n fn visit_neq(&mut self, _graph: &mut Rvsdg, _neq: Neq) {}\n\n fn visit_load(&mut self, _graph: &mut Rvsdg, _load: Load) {}\n fn visit_store(&mut self, _graph: &mut Rvsdg, _store: Store) {}\n\n fn visit_scan(&mut self, _graph: &mut Rvsdg, _scan: Scan) {}\n fn visit_input(&mut self, _graph: &mut Rvsdg, _input: Input) {}\n fn visit_output(&mut self, _graph: &mut Rvsdg, _output: Output) {}\n\n \n \n \n \n \n \n \n fn visit_theta(&mut self, _graph: &mut Rvsdg, _theta: Theta) {}\n fn visit_gamma(&mut self, _graph: &mut Rvsdg, _gamma: Gamma) {}\n\n fn visit_input_param(&mut self, _graph: &mut Rvsdg, _input: InputParam) {}\n fn visit_output_param(&mut self, _graph: &mut Rvsdg, _output: OutputParam) {}\n\n fn visit_start(&mut self, _graph: &mut Rvsdg, _start: Start) {}\n fn visit_end(&mut self, _graph: &mut Rvsdg, _end: End) {}\n}\n\ntest_opts! {\n \n \n \n \n \n \n \n \n \n memchr_loop,\n passes = |tape_len| bvec![ZeroLoop::new(tape_len)],\n output = [0],\n |graph, mut effect, tape_len| {\n let mut ptr = graph.int(Ptr::zero(tape_len)).value();\n\n \n let not_zero = graph.int(Ptr::new(255, tape_len)).value();\n let store = graph.store(ptr, not_zero, effect);\n effect = store.output_effect();\n\n \n let theta = graph.theta([], [ptr], effect, |graph, mut effect, _invariant, variant| {\n let ptr = variant[0];\n\n let zero = graph.int(Ptr::zero(tape_len)).value();\n let four = graph.int(Ptr::new(4, tape_len)).value();\n\n let add = graph.add(ptr, four);\n let load = graph.load(add.value(), effect);\n effect = load.output_effect();\n\n let not_eq_zero = graph.neq(load.output_value(), zero);\n\n ThetaData::new([ptr], not_eq_zero.value(), effect)\n });\n ptr = theta.output_ports().next().unwrap();\n effect = theta.output_effect().unwrap();\n\n \n let load = graph.load(ptr, effect);\n effect = load.output_effect();\n\n \n let output = graph.output(load.output_value(), effect);\n output.output_effect()\n },\n}\n"},"middle":{"kind":"string","value":"fn visit_graph(&mut self, graph: &mut Rvsdg) -> bool {\n \n let (mut stack, mut visited, mut buffer) = VISIT_GRAPH_CACHE\n .with(|buffers| buffers.borrow_mut().pop())\n \n .unwrap_or_else(|| {\n (\n VecDeque::with_capacity(graph.node_len() / 2),\n HashSet::with_capacity_and_hasher(graph.node_len(), Default::default()),\n Vec::new(),\n )\n });\n\n let result = self.visit_graph_inner(graph, &mut stack, &mut visited, &mut buffer);\n\n \n stack.clear();\n visited.clear();\n buffer.clear();\n VISIT_GRAPH_CACHE.with(|buffers| buffers.borrow_mut().push((stack, visited, buffer)));\n\n result\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub fn stdout_output() -> impl FnMut(u8) + 'static {\n\n move |byte| {\n\n // FIXME: Lock once, move into closure\n\n let stdout_handle = io::stdout();\n\n let mut stdout = stdout_handle.lock();\n\n\n\n tracing::trace!(\n\n \"wrote output value {byte}, hex: {byte:#X}, binary: {byte:#08b}\",\n\n byte = byte,\n\n );\n\n\n\n stdout\n\n .write_all(&[byte])\n\n .expect(\"failed to write to stdout\");\n\n\n\n // FIXME: Flush infrequently, somehow?\n\n stdout.flush().expect(\"failed to flush stdout\");\n\n }\n\n}\n","file_path":"src/driver.rs","rank":0,"score":284483.938117387},{"content":"pub fn stdin_input() -> impl FnMut() -> u8 + 'static {\n\n move || {\n\n // FIXME: Lock once, move into closure\n\n let stdin_handle = io::stdin();\n\n let mut stdin = stdin_handle.lock();\n\n\n\n let mut buf = [0];\n\n stdin\n\n .read_exact(&mut buf)\n\n .expect(\"failed to read from stdin\");\n\n let [byte] = buf;\n\n\n\n tracing::trace!(\n\n \"read input value {byte}, hex: {byte:#X}, binary: {byte:#08b}\",\n\n byte = byte,\n\n );\n\n\n\n byte\n\n }\n\n}\n\n\n","file_path":"src/driver.rs","rank":1,"score":284480.49422218825},{"content":"#[tracing::instrument(skip_all)]\n\npub fn build_graph<T>(tokens: T, tape_len: u16) -> Rvsdg\n\nwhere\n\n T: AsRef<[Token]>,\n\n{\n\n let tokens = tokens.as_ref();\n\n\n\n tracing::info!(\"started building rvsdg\");\n\n let event = PerfEvent::new(\"build-graph\");\n\n\n\n let mut graph = Rvsdg::new();\n\n // Create the graph's start node\n\n let start = graph.start();\n\n\n\n // Get the starting effect and create the initial pointer (zero)\n\n let effect = start.effect();\n\n let ptr = graph.int(Ptr::zero(tape_len)).value();\n\n\n\n // Lower all of the program's tokens into the graph\n\n let (_ptr, effect) = lower_tokens::lower_tokens(&mut graph, ptr, effect, tokens);\n\n // Create the program's end node\n\n graph.end(effect);\n\n\n\n let elapsed = event.finish();\n\n tracing::info!(\"finished building rvsdg in {:#?}\", elapsed);\n\n\n\n graph\n\n}\n\n\n","file_path":"src/driver.rs","rank":2,"score":270343.2500085946},{"content":"pub trait Port: Debug + Clone + Copy + PartialEq + Eq + Hash {\n\n fn port(&self) -> PortId;\n\n\n\n fn raw(&self) -> u32 {\n\n self.port().0\n\n }\n\n}\n\n\n\n#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Default)]\n\n#[repr(transparent)]\n\npub struct PortId(u32);\n\n\n\nimpl PortId {\n\n pub const fn new(id: u32) -> Self {\n\n Self(id)\n\n }\n\n\n\n const fn inner(&self) -> u32 {\n\n self.0\n\n }\n","file_path":"src/graph/ports.rs","rank":3,"score":267061.738792638},{"content":"pub trait UnaryOp: NodeExt {\n\n fn name() -> &'static str;\n\n\n\n fn symbol() -> &'static str;\n\n\n\n fn make_in_graph(graph: &mut Rvsdg, input: OutputPort) -> Self;\n\n\n\n fn apply(input: Const) -> Const;\n\n\n\n fn input(&self) -> InputPort;\n\n\n\n fn value(&self) -> OutputPort;\n\n}\n\n\n\nimpl UnaryOp for Neg {\n\n fn name() -> &'static str {\n\n \"neg\"\n\n }\n\n\n\n fn symbol() -> &'static str {\n","file_path":"src/passes/utils/unary_op.rs","rank":5,"score":265848.2771781817},{"content":"pub trait BinaryOp: NodeExt {\n\n fn name() -> &'static str;\n\n\n\n fn symbol() -> &'static str;\n\n\n\n fn make_in_graph(graph: &mut Rvsdg, lhs: OutputPort, rhs: OutputPort) -> Self;\n\n\n\n fn apply(lhs: Const, rhs: Const) -> Const;\n\n\n\n fn lhs(&self) -> InputPort;\n\n\n\n fn rhs(&self) -> InputPort;\n\n\n\n fn value(&self) -> OutputPort;\n\n\n\n fn is_associative() -> bool;\n\n\n\n fn is_commutative() -> bool;\n\n}\n\n\n","file_path":"src/passes/utils/binary_op.rs","rank":6,"score":265848.2771781817},{"content":"// TODO:\n\n// - .effect_inputs()\n\n// - .value_inputs()\n\n// - .effect_outputs()\n\n// - .value_outputs()\n\n// - .has_effect_inputs()\n\n// - .has_value_inputs()\n\n// - .has_effect_outputs()\n\n// - .has_value_outputs()\n\n// - .update_output()\n\n// - .update_outputs()\n\n// - .num_input_ports()\n\n// - .num_input_effect_ports()\n\n// - .num_input_value_ports()\n\n// - .num_output_ports()\n\n// - .num_output_effect_ports()\n\n// - .num_output_value_ports()\n\n// - .has_input(&self, InputPort) -> bool\n\n// - .has_output(&self, OutputPort) -> bool\n\npub trait NodeExt {\n\n fn node(&self) -> NodeId;\n\n\n\n fn input_desc(&self) -> EdgeDescriptor;\n\n\n\n fn all_input_ports(&self) -> InputPorts;\n\n\n\n fn all_input_port_kinds(&self) -> InputPortKinds;\n\n\n\n fn update_inputs<F>(&mut self, mut update: F) -> bool\n\n where\n\n F: FnMut(InputPort, EdgeKind) -> Option<InputPort>,\n\n {\n\n let mut changed = false;\n\n for (input, kind) in self.all_input_port_kinds() {\n\n if let Some(new_input) = update(input, kind) {\n\n self.update_input(input, new_input);\n\n changed = true;\n\n }\n\n }\n","file_path":"src/graph/nodes/node_ext.rs","rank":7,"score":260836.38906571933},{"content":"/// Returns `true` if the given graph has no other nodes between its [`Start`] and [`End`] nodes\n\nfn gamma_branch_is_empty(branch: &Rvsdg) -> bool {\n\n debug_assert_eq!(branch.start_nodes().len(), 1);\n\n debug_assert_eq!(branch.end_nodes().len(), 1);\n\n\n\n let start = branch.to_node::<Start>(branch.start_nodes()[0]);\n\n let end = branch.to_node::<End>(branch.end_nodes()[0]);\n\n\n\n branch.input_source(end.input_effect()) == start.effect()\n\n}\n\n\n\nimpl Pass for SquareCell {\n\n fn pass_name(&self) -> &'static str {\n\n \"square-cell\"\n\n }\n\n\n\n fn did_change(&self) -> bool {\n\n self.changed\n\n }\n\n\n\n fn reset(&mut self) {\n","file_path":"src/passes/square_cell.rs","rank":8,"score":259480.25919347192},{"content":"#[inline(always)]\n\nfn bit(index: u16) -> usize {\n\n index as usize % 64\n\n}\n\n\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":9,"score":241665.37749713077},{"content":"#[inline(always)]\n\nfn key(index: u16) -> usize {\n\n index as usize / 64\n\n}\n\n\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":10,"score":241665.37749713077},{"content":"pub fn array_output(output: &mut Vec<u8>) -> impl FnMut(u8) + '_ {\n\n move |byte| {\n\n tracing::trace!(\n\n output_len = output.len() + 1,\n\n \"pushed output value {byte}, hex: {byte:#X}, binary: {byte:#08b}\",\n\n byte = byte,\n\n );\n\n output.push(byte);\n\n }\n\n}\n\n\n","file_path":"src/driver.rs","rank":12,"score":230587.15394510148},{"content":"pub fn diff_ir(old: &str, new: &str) -> String {\n\n let start_time = Instant::now();\n\n\n\n let diff = TextDiff::configure()\n\n .algorithm(Algorithm::Patience)\n\n .deadline(Instant::now() + Duration::from_secs(1))\n\n .diff_lines(old, new);\n\n\n\n let diff = format!(\"{}\", diff.unified_diff());\n\n\n\n let elapsed = start_time.elapsed();\n\n tracing::debug!(\n\n target: \"timings\",\n\n \"took {:#?} to diff ir\",\n\n elapsed,\n\n );\n\n\n\n diff\n\n}\n\n\n","file_path":"src/utils.rs","rank":13,"score":229591.7780706408},{"content":"pub fn array_input(input: &mut VecDeque<u8>) -> impl FnMut() -> u8 + '_ {\n\n move || {\n\n let (byte, was_empty) = input.pop_front().map_or((0, true), |byte| (byte, false));\n\n\n\n tracing::trace!(\n\n input_len = input.len(),\n\n was_empty,\n\n \"popped input value {byte}, hex: {byte:#X}, binary: {byte:#08b}\",\n\n byte = byte,\n\n );\n\n\n\n byte\n\n }\n\n}\n\n\n","file_path":"src/driver.rs","rank":14,"score":227321.37345707772},{"content":" pub trait True {}\n\n\n\n impl True for Assert<true> {}\n\n\n\n pub const fn contains(changes: &[&str], name: &str) -> bool {\n\n let mut idx = 0;\n\n while idx < changes.len() {\n\n if str_eq(changes[idx], name) {\n\n return true;\n\n }\n\n\n\n idx += 1;\n\n }\n\n\n\n false\n\n }\n\n\n\n const fn index_of(changes: &[&str], name: &str) -> usize {\n\n let mut idx = 0;\n\n while idx < changes.len() {\n","file_path":"src/passes/utils/changes.rs","rank":15,"score":224407.75348419492},{"content":"#[inline]\n\npub fn lsb(chunk: u64) -> Option<u8> {\n\n if chunk == 0 {\n\n None\n\n } else {\n\n Some(chunk.trailing_zeros() as u8)\n\n }\n\n}\n\n\n\n/// Returns the last (most significant) bit of `chunk`, or `None` if `chunk` is\n\n/// 0.\n","file_path":"src/passes/dataflow/domain/utils.rs","rank":16,"score":223467.3953258172},{"content":"#[inline]\n\npub fn msb(chunk: u64) -> Option<u8> {\n\n if chunk == 0 {\n\n None\n\n } else {\n\n let bits = u64::BITS - 1;\n\n Some((bits as u8) ^ chunk.leading_zeros() as u8)\n\n }\n\n}\n\n\n\n/// Removes the first (least significant) bit from `chunk` and returns it, or\n\n/// `None` if `chunk` is 0.\n","file_path":"src/passes/dataflow/domain/utils.rs","rank":17,"score":223467.3953258172},{"content":"#[inline]\n\npub fn pop_msb(chunk: &mut u64) -> Option<u8> {\n\n let msb = msb(*chunk)?;\n\n *chunk ^= 1 << msb;\n\n Some(msb)\n\n}\n","file_path":"src/passes/dataflow/domain/utils.rs","rank":18,"score":212121.2620166552},{"content":"#[inline]\n\npub fn pop_lsb(chunk: &mut u64) -> Option<u8> {\n\n let lsb = lsb(*chunk)?;\n\n *chunk ^= 1 << lsb;\n\n Some(lsb)\n\n}\n\n\n\n/// Removes the last (most significant) bit from `chunk` and returns it, or\n\n/// `None` if `chunk` is 0.\n","file_path":"src/passes/dataflow/domain/utils.rs","rank":19,"score":212121.2620166552},{"content":"#[test]\n\nfn const_add() {\n\n use crate::{driver, passes::PassConfig};\n\n\n\n let mut input = {\n\n let mut graph = Rvsdg::new();\n\n\n\n let start = graph.start();\n\n let lhs = graph.byte(10);\n\n let rhs = graph.byte(20);\n\n let sum = graph.add(lhs.value(), rhs.value());\n\n let output = graph.output(sum.value(), start.effect());\n\n let _end = graph.end(output.output_effect());\n\n\n\n graph\n\n };\n\n driver::run_opt_passes(\n\n &mut input,\n\n usize::MAX,\n\n &PassConfig::new(30_000, true, true),\n\n None,\n","file_path":"src/passes/const_folding.rs","rank":20,"score":208839.77021813847},{"content":"// TODO: Turn validation into a pass\n\n// TODO: Make validation check edge and port kinds\n\nfn validate(graph: &Rvsdg) {\n\n tracing::debug!(\n\n target: \"timings\",\n\n \"started validating graph\",\n\n );\n\n let start_time = Instant::now();\n\n\n\n let mut stack: Vec<_> = graph.node_ids().map(|node_id| (node_id, graph)).collect();\n\n\n\n while let Some((node_id, graph)) = stack.pop() {\n\n let node = graph.get_node(node_id);\n\n\n\n if let Node::Theta(theta) = node {\n\n stack.extend(\n\n theta\n\n .body()\n\n .node_ids()\n\n .map(|node_id| (node_id, theta.body())),\n\n );\n\n } else if let Node::Gamma(gamma) = node {\n","file_path":"src/main.rs","rank":21,"score":206214.02288971373},{"content":"#[inline]\n\nfn zeroed_bit_box() -> BitBox {\n\n pop_bit_cache()\n\n .map(|mut bits| {\n\n arch::set_bits_zero(&mut bits);\n\n bits\n\n })\n\n // Safety: u64s are zeroable\n\n .unwrap_or_else(|| ManuallyDrop::new(unsafe { Box::new_zeroed().assume_init() }))\n\n}\n\n\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":22,"score":205297.94350081487},{"content":"// Calculates the filtered cartesian product of both domains where the values are inequal\n\n// (a, b) := { (a, b) ∈ A × B | A ≠ B }\n\npub fn differential_product(lhs: &Domain, rhs: &Domain) -> (Domain, Domain) {\n\n match (lhs, rhs) {\n\n (Domain::Bool(lhs), Domain::Bool(rhs)) => {\n\n let (mut lhs_false, mut rhs_false) = (BoolSet::empty(), BoolSet::empty());\n\n for &lhs in lhs.as_slice() {\n\n for &rhs in rhs.as_slice() {\n\n if lhs != rhs {\n\n lhs_false.add(lhs);\n\n rhs_false.add(rhs);\n\n }\n\n }\n\n }\n\n\n\n (Domain::Bool(lhs_false), Domain::Bool(rhs_false))\n\n }\n\n\n\n (Domain::Byte(lhs), Domain::Byte(rhs)) => {\n\n let (mut lhs_false, mut rhs_false) = (ByteSet::empty(), ByteSet::empty());\n\n for lhs in lhs.iter() {\n\n for rhs in rhs.iter() {\n","file_path":"src/passes/dataflow/domain/mod.rs","rank":23,"score":205220.5725801081},{"content":"#[inline]\n\nfn pop_bit_cache() -> Option<BitBox> {\n\n BITMAP_CACHE.with_borrow_mut(|cache| cache.pop().map(ManuallyDrop::new))\n\n}\n\n\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":24,"score":198887.63036987657},{"content":"#[derive(Debug)]\n\nstruct LoadMutateStore {\n\n output_effect: OutputPort,\n\n loaded_value: AddOrSub,\n\n mutated_value: Const,\n\n ptr: OutputPort,\n\n}\n","file_path":"src/passes/move_cell.rs","rank":25,"score":196451.36688782205},{"content":"type PopcountPtr = unsafe fn(&BitArray) -> u32;\n\n\n\npub(super) fn popcount(bits: &BitArray) -> u32 {\n\n static POPCOUNT: AtomicPtr<()> = AtomicPtr::new(select_popcount as *mut ());\n\n\n\n unsafe fn select_popcount(bits: &BitArray) -> u32 {\n\n let selected: PopcountPtr = if is_x86_feature_detected!(\"avx2\") {\n\n popcount_avx2 as _\n\n } else {\n\n popcount_scalar as _\n\n };\n\n POPCOUNT.store(selected as *mut (), Ordering::Relaxed);\n\n\n\n unsafe { selected(bits) }\n\n }\n\n\n\n let popcount = POPCOUNT.load(Ordering::Relaxed);\n\n let popcount = unsafe { transmute::<*mut (), PopcountPtr>(popcount) };\n\n unsafe { popcount(bits) }\n\n}\n","file_path":"src/passes/dataflow/domain/bitmap_u16/arch.rs","rank":26,"score":192354.2155793597},{"content":"pub fn parse(source: &str) -> Parsed {\n\n let tokens = source.chars().flat_map(|token| {\n\n Some(match token {\n\n '>' => RawToken::IncPtr,\n\n '<' => RawToken::DecPtr,\n\n '+' => RawToken::Inc,\n\n '-' => RawToken::Dec,\n\n '.' => RawToken::Output,\n\n ',' => RawToken::Input,\n\n '[' => RawToken::JumpStart,\n\n ']' => RawToken::JumpEnd,\n\n _ => return None,\n\n })\n\n });\n\n\n\n let (mut scopes, mut total_tokens, mut deepest_nesting) = (vec![Vec::new()], 0, 0);\n\n for token in tokens {\n\n match token {\n\n RawToken::IncPtr => scopes.last_mut().unwrap().push(Token::IncPtr),\n\n RawToken::DecPtr => scopes.last_mut().unwrap().push(Token::DecPtr),\n","file_path":"src/parse.rs","rank":27,"score":188013.88039443037},{"content":"/// Returns `true` if the label matches `\\.[a-zA-Z0-9_]+\n\nfn is_valid_label_name(label: &str) -> bool {\n\n label.starts_with('.')\n\n && label.len() >= 2\n\n && label\n\n .chars()\n\n .skip(1)\n\n .all(|char| char.is_alphanumeric() || char == '_')\n\n}\n","file_path":"src/jit/disassemble.rs","rank":28,"score":187194.01427970076},{"content":"#[cfg(test)]\n\npub fn compile_brainfuck_into(\n\n source: &str,\n\n graph: &mut Rvsdg,\n\n ptr: OutputPort,\n\n effect: OutputPort,\n\n) -> (OutputPort, OutputPort) {\n\n use crate::parse::Parsed;\n\n\n\n let parsing_start = Instant::now();\n\n\n\n let span = tracing::info_span!(\"parsing\");\n\n let tokens = span.in_scope(|| {\n\n tracing::info!(\"started parsing source code\");\n\n let Parsed {\n\n tokens,\n\n source_len,\n\n total_tokens,\n\n deepest_nesting,\n\n } = parse::parse(source);\n\n\n","file_path":"src/utils.rs","rank":29,"score":184586.67726760055},{"content":"#[inline]\n\nfn uninit_bit_box() -> Box<[MaybeUninit<u64>; BITS_LEN]> {\n\n pop_bit_cache()\n\n .map(|bits| {\n\n let bits = ManuallyDrop::into_inner(bits);\n\n // Safety: We can act like this array isn't initialized\n\n unsafe { Box::from_raw(Box::into_raw(bits).cast::<[MaybeUninit<u64>; BITS_LEN]>()) }\n\n })\n\n // Safety: We're creating an uninit array\n\n .unwrap_or_else(|| unsafe { Box::new_uninit().assume_init() })\n\n}\n\n\n\n/// # Safety\n\n///\n\n/// The caller must ensure that all bits within the bit box are initialized\n\n#[inline]\n\nunsafe fn assume_bit_box_init(bits: Box<[MaybeUninit<u64>; BITS_LEN]>) -> BitBox {\n\n ManuallyDrop::new(unsafe { Box::from_raw(Box::into_raw(bits).cast::<BitArray>()) })\n\n}\n\n\n\n#[cfg(test)]\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":30,"score":183737.1553673665},{"content":"#[tracing::instrument(level = \"debug\", skip_all)]\n\npub fn sequentialize_graph(\n\n args: &Settings,\n\n graph: &Rvsdg,\n\n dump_dir: Option<&Path>,\n\n config: PrettyConfig,\n\n) -> Result<(Block, String)> {\n\n // Sequentialize the graph into serial instructions\n\n let program = {\n\n tracing::debug!(\"started sequentializing graph\");\n\n let event = PerfEvent::new(\"sequentializing-graph\");\n\n\n\n let sequential_code = IrBuilder::new(!args.dont_inline_constants).translate(graph);\n\n\n\n let elapsed = event.finish();\n\n tracing::debug!(\"finished sequentializing graph in {:#?}\", elapsed);\n\n\n\n sequential_code\n\n };\n\n\n\n // Pretty print the IR\n","file_path":"src/driver.rs","rank":31,"score":183574.9453174238},{"content":"pub trait Set<K> {\n\n fn contains(&self, value: &K) -> bool;\n\n\n\n fn is_empty(&self) -> bool;\n\n}\n\n\n\nimpl<K> Set<K> for HashSet<K>\n\nwhere\n\n K: Eq + Hash,\n\n{\n\n #[inline]\n\n fn contains(&self, value: &K) -> bool {\n\n HashSet::contains(self, value)\n\n }\n\n\n\n #[inline]\n\n fn is_empty(&self) -> bool {\n\n HashSet::is_empty(self)\n\n }\n\n}\n","file_path":"src/utils.rs","rank":32,"score":183255.43386034472},{"content":"pub trait OptionExt<T> {\n\n fn inspect<F>(self, inspect: F) -> Self\n\n where\n\n F: FnOnce(&T);\n\n}\n\n\n\nimpl<T> OptionExt<T> for Option<T> {\n\n fn inspect<F>(self, inspect: F) -> Self\n\n where\n\n F: FnOnce(&T),\n\n {\n\n if let Some(value) = &self {\n\n inspect(value);\n\n }\n\n\n\n self\n\n }\n\n}\n\n\n\npub(crate) fn set_logger() {\n","file_path":"src/utils.rs","rank":33,"score":179338.67265274315},{"content":"#[tracing::instrument(skip_all)]\n\npub fn run_opt_passes(\n\n graph: &mut Rvsdg,\n\n iteration_limit: usize,\n\n pass_config: &PassConfig,\n\n mut stats: Option<&mut HashMap<String, (usize, Duration)>>,\n\n) -> usize {\n\n let mut passes = passes::default_passes(pass_config);\n\n if let Some(stats) = stats.as_mut() {\n\n stats.reserve(passes.len());\n\n }\n\n\n\n let (mut pass_num, mut stack, mut visited, mut buffer) = (\n\n 1,\n\n VecDeque::new(),\n\n HashSet::with_hasher(Default::default()),\n\n Vec::new(),\n\n );\n\n\n\n loop {\n\n let mut changed = false;\n","file_path":"src/driver.rs","rank":34,"score":178036.54300647316},{"content":"mod arch;\n\nmod iter;\n\n\n\npub(super) use iter::{IntoIter, Iter};\n\n\n\nuse crate::passes::dataflow::domain::ByteSet;\n\nuse std::{\n\n cell::{Cell, RefCell},\n\n fmt::{self, Debug},\n\n mem::{ManuallyDrop, MaybeUninit},\n\n thread,\n\n};\n\n\n\nconst BITS_LEN: usize = 1024;\n\nconst MAX_LEN: u32 = u16::MAX as u32 + 1;\n\n\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":35,"score":164447.75561896755},{"content":"mod tests {\n\n use crate::passes::dataflow::domain::bitmap_u16::U16Bitmap;\n\n\n\n #[test]\n\n fn bitmap_as_singleton() {\n\n let mut bitmap = U16Bitmap::singleton(10);\n\n assert_eq!(bitmap.as_singleton(), Some(10));\n\n\n\n bitmap.insert(200);\n\n assert_eq!(bitmap.as_singleton(), None);\n\n\n\n bitmap.clear();\n\n bitmap.insert(20_000);\n\n assert_eq!(bitmap.as_singleton(), Some(20_000));\n\n }\n\n\n\n #[test]\n\n fn drop_a_bunch() {\n\n let mut maps = Vec::new();\n\n for _ in 0..100_000 {\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":36,"score":164443.502644551},{"content":" fn default() -> Self {\n\n Self::empty()\n\n }\n\n}\n\n\n\nimpl PartialEq for U16Bitmap {\n\n fn eq(&self, other: &Self) -> bool {\n\n // If the lengths of the two bitmaps aren't equal, their contents\n\n // can't possibly be. This allows us to potentially skip on the more\n\n // expensive equality check if both bitmaps already know their\n\n // lengths\n\n let equal_lengths = self\n\n .raw_len()\n\n .zip(other.raw_len())\n\n .map_or(true, |(lhs, rhs)| lhs == rhs);\n\n\n\n equal_lengths && arch::bitmap_eq(self.as_array(), other.as_array())\n\n }\n\n}\n\n\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":37,"score":164440.60173025922},{"content":" }\n\n\n\n pub(crate) fn intersects_bytes(&self, other: ByteSet) -> bool {\n\n let lhs = ByteSet::from_ref((&self.bits[..ByteSet::LEN]).try_into().unwrap());\n\n lhs.intersects(other)\n\n }\n\n\n\n pub fn is_disjoint(&self, other: &Self) -> bool {\n\n arch::is_disjoint(self.as_array(), other.as_array())\n\n }\n\n\n\n pub fn is_subset(&self, other: &Self) -> bool {\n\n arch::is_subset(self.as_array(), other.as_array())\n\n }\n\n\n\n #[inline]\n\n fn as_array(&self) -> &BitArray {\n\n &*self.bits\n\n }\n\n\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":38,"score":164439.0721977406},{"content":"impl Eq for U16Bitmap {}\n\n\n\nimpl Debug for U16Bitmap {\n\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\n\n f.debug_set().entries(self.iter()).finish()\n\n }\n\n}\n\n\n\nimpl Clone for U16Bitmap {\n\n fn clone(&self) -> Self {\n\n let mut bits = uninit_bit_box();\n\n MaybeUninit::write_slice(&mut *bits, self.as_array());\n\n\n\n let clone = Self {\n\n // Safety: We've initialized the bits\n\n bits: unsafe { assume_bit_box_init(bits) },\n\n length: self.length.clone(),\n\n };\n\n debug_assert_eq!(self, &clone);\n\n\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":39,"score":164438.869310791},{"content":" }\n\n\n\n pub(super) fn intersect_bytes(&mut self, rhs: &ByteSet) -> bool {\n\n let array_ref = (&mut self.bits[..ByteSet::LEN]).try_into().unwrap();\n\n let lhs = ByteSet::from_mut(array_ref);\n\n lhs.intersect(rhs)\n\n }\n\n\n\n pub(super) fn intersect_bytes_new(&self, rhs: &ByteSet) -> Self {\n\n let mut lhs = self.clone();\n\n lhs.intersect_bytes(rhs);\n\n lhs\n\n }\n\n\n\n pub fn intersects(&self, other: &Self) -> bool {\n\n if self.shallow_empty() || other.shallow_empty() {\n\n false\n\n } else {\n\n arch::intersects(self.as_array(), other.as_array())\n\n }\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":40,"score":164437.34038437047},{"content":"\n\n pub(super) fn union_bytes(&mut self, rhs: ByteSet) -> bool {\n\n let array_ref = (&mut self.bits[..ByteSet::LEN]).try_into().unwrap();\n\n let lhs = ByteSet::from_mut(array_ref);\n\n lhs.union(rhs)\n\n }\n\n\n\n pub fn intersect(&mut self, other: &Self) {\n\n if self.shallow_empty() {\n\n // Do nothing, we're already empty and an intersection between anything\n\n // and an empty set is nothing\n\n } else if other.shallow_empty() {\n\n self.clear();\n\n } else {\n\n self.length.set(None);\n\n arch::intersect(self.as_mut_array(), other.as_array());\n\n }\n\n }\n\n\n\n pub fn intersect_into(&self, other: &Self, output: &mut Self) {\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":41,"score":164435.79731008445},{"content":" ///\n\n pub fn union_into(&self, other: &Self, output: &mut Self) -> bool {\n\n output.length.set(None);\n\n arch::union_into(self.as_array(), other.as_array(), output.as_mut_array())\n\n }\n\n\n\n /// Creates a new [`U16Bitmap`] with the set of all integers contained\n\n /// in `self`, `other` or both `self` and `other\n\n ///\n\n /// Computes `self ∪ other`, returning the result.\n\n ///\n\n pub fn union_new(&self, other: &Self) -> Self {\n\n let mut uninit = uninit_bit_box();\n\n arch::union_into_uninit(self.as_array(), other.as_array(), &mut *uninit);\n\n\n\n Self {\n\n bits: unsafe { assume_bit_box_init(uninit) },\n\n length: Cell::new(None),\n\n }\n\n }\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":42,"score":164435.44871149998},{"content":"\n\n pub fn full() -> Self {\n\n let mut bits = uninit_bit_box();\n\n arch::set_uninit_bits_one(&mut bits);\n\n\n\n Self {\n\n // Safety: All bits have been initialized\n\n bits: unsafe { assume_bit_box_init(bits) },\n\n length: Cell::new(Some(MAX_LEN)),\n\n }\n\n }\n\n\n\n pub fn singleton(value: u16) -> Self {\n\n let mut this = Self::empty();\n\n this.insert(value);\n\n this\n\n }\n\n\n\n pub fn is_empty(&self) -> bool {\n\n match self.raw_len() {\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":43,"score":164431.5170675487},{"content":" clone\n\n }\n\n\n\n fn clone_from(&mut self, other: &Self) {\n\n self.as_mut_array().copy_from_slice(other.as_array());\n\n self.length = other.length.clone();\n\n debug_assert_eq!(self, other);\n\n }\n\n}\n\n\n\nimpl Drop for U16Bitmap {\n\n fn drop(&mut self) {\n\n // If the thread is panicking we just want to deallocate the box\n\n if thread::panicking() {\n\n // Safety: The box's contents will never be touched again\n\n unsafe { ManuallyDrop::drop(&mut self.bits) };\n\n\n\n // Otherwise we want to keep the allocation around for reuse\n\n } else {\n\n // Safety: The bits of this bitmap won't be touched again\n\n let bits = unsafe { ManuallyDrop::take(&mut self.bits) };\n\n BITMAP_CACHE.with_borrow_mut(|cache| cache.push(bits));\n\n }\n\n }\n\n}\n\n\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":44,"score":164431.28356440808},{"content":" #[inline]\n\n fn shallow_not_full(&self) -> bool {\n\n matches!(self.raw_len(), Some(len) if len != MAX_LEN)\n\n }\n\n\n\n #[inline]\n\n fn raw_len(&self) -> Option<u32> {\n\n self.length.get()\n\n }\n\n\n\n pub(super) fn iter(&self) -> Iter<'_> {\n\n Iter::new(self)\n\n }\n\n\n\n pub(super) fn into_iter(self) -> IntoIter {\n\n IntoIter::new(self)\n\n }\n\n}\n\n\n\nimpl Default for U16Bitmap {\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":45,"score":164430.28012297882},{"content":" }\n\n }\n\n\n\n pub fn clear(&mut self) {\n\n if self.shallow_not_empty() {\n\n self.length.set(Some(0));\n\n arch::set_bits_zero(self.as_mut_array());\n\n }\n\n }\n\n\n\n /// Fills `self` with the set of all integers contained\n\n /// in `self`, `other` or both `self` and `other\n\n ///\n\n /// Computes `self ∪ other`, storing the result in `self` and returning\n\n /// a boolean as to whether or not `self` has changed any\n\n ///\n\n pub fn union(&mut self, other: &Self) -> bool {\n\n // If both sets are empty, their union is empty\n\n if self.shallow_empty() && other.shallow_empty() {\n\n false\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":46,"score":164429.81372302654},{"content":" let len = arch::popcount(self.as_array());\n\n self.length.set(Some(len));\n\n len\n\n });\n\n\n\n length as usize\n\n }\n\n\n\n pub fn contains(&self, value: u16) -> bool {\n\n let (index, offset) = (key(value), bit(value));\n\n debug_assert!(index < BITS_LEN);\n\n\n\n let lane = unsafe { *self.bits.get_unchecked(index) };\n\n lane & (1 << offset) != 0\n\n }\n\n\n\n pub fn insert(&mut self, value: u16) -> bool {\n\n let (index, offset) = (key(value), bit(value));\n\n debug_assert!(index < BITS_LEN);\n\n\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":47,"score":164427.26187258787},{"content":" if self.shallow_empty() || other.shallow_empty() {\n\n output.clear();\n\n } else {\n\n output.length.set(None);\n\n arch::intersect_into(self.as_array(), other.as_array(), output.as_mut_array())\n\n }\n\n }\n\n\n\n pub fn intersect_new(&self, other: &Self) -> Self {\n\n if self.shallow_empty() || other.shallow_empty() {\n\n Self::empty()\n\n } else {\n\n let mut uninit = uninit_bit_box();\n\n arch::intersect_into_uninit(self.as_array(), other.as_array(), &mut *uninit);\n\n\n\n Self {\n\n bits: unsafe { assume_bit_box_init(uninit) },\n\n length: Cell::new(None),\n\n }\n\n }\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":48,"score":164427.12607931378},{"content":" assert_eq!(full, full);\n\n assert_eq!(empty, empty);\n\n }\n\n\n\n #[test]\n\n fn union() {\n\n let mut empty = U16Bitmap::empty();\n\n let full = U16Bitmap::full();\n\n\n\n assert_eq!(empty.union_new(&full), full);\n\n\n\n let mut half: U16Bitmap = (0..=u16::MAX).step_by(2).collect();\n\n assert_eq!(half.union_new(&empty), half);\n\n assert_eq!(half.union_new(&half), half);\n\n\n\n assert!(!half.union(&empty));\n\n assert!(empty.union(&half));\n\n assert_eq!(empty, half);\n\n }\n\n}\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":49,"score":164424.53893782536},{"content":" maps.push(U16Bitmap::empty());\n\n }\n\n }\n\n\n\n #[test]\n\n fn equality() {\n\n let mut empty = U16Bitmap::empty();\n\n let full = U16Bitmap::full();\n\n\n\n assert_ne!(empty, full);\n\n\n\n // Force an actual equality check instead of just checking\n\n // for length equality\n\n full.length.set(None);\n\n assert_ne!(empty, full);\n\n\n\n empty.insert(10000);\n\n empty.insert(u16::MAX);\n\n assert_ne!(empty, full);\n\n\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":50,"score":164424.27718669293},{"content":" let target = unsafe { self.bits.get_unchecked_mut(index) };\n\n let old = *target;\n\n *target |= 1 << offset;\n\n\n\n let was_inserted = *target != old;\n\n if was_inserted {\n\n self.length.update(|length| length.map(|length| length + 1));\n\n }\n\n\n\n was_inserted\n\n }\n\n\n\n pub fn remove(&mut self, value: u16) -> bool {\n\n let (index, offset) = (key(value), bit(value));\n\n debug_assert!(index < BITS_LEN);\n\n\n\n let target = unsafe { self.bits.get_unchecked_mut(index) };\n\n let old = *target;\n\n *target &= !(1 << offset);\n\n\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":51,"score":164423.72802093343},{"content":"\n\n // If self is empty and other isn't, copy the bits of other into self\n\n } else if self.shallow_empty() && other.shallow_not_empty() {\n\n self.length.set(other.raw_len());\n\n self.bits.copy_from_slice(&**other.bits);\n\n true\n\n\n\n // Otherwise calculate the union\n\n } else {\n\n self.length.set(None);\n\n arch::union(self.as_mut_array(), other.as_array())\n\n }\n\n }\n\n\n\n /// Fills `output` with the set of all integers contained\n\n /// in `self`, `other` or both `self` and `other\n\n ///\n\n /// Computes `self ∪ other`, storing the result in `output` and returning\n\n /// a boolean as to whether or not `output` has changed any in comparison\n\n /// to `self` (that is, this function returns `true` if `output != self`)\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":52,"score":164422.07392504695},{"content":" let was_removed = *target != old;\n\n if was_removed {\n\n self.length.update(|length| length.map(|length| length - 1));\n\n }\n\n\n\n was_removed\n\n }\n\n\n\n pub fn as_singleton(&self) -> Option<u16> {\n\n if self.len() != 1 {\n\n None\n\n } else {\n\n self.iter().next()\n\n }\n\n }\n\n\n\n pub fn fill(&mut self) {\n\n if self.shallow_not_full() {\n\n self.length.set(Some(MAX_LEN));\n\n arch::set_bits_one(self.as_mut_array());\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":53,"score":164421.96184387998},{"content":" // len ≡ 0\n\n Some(0) => true,\n\n\n\n // len ≠ 0\n\n Some(_) => false,\n\n\n\n // len unknown\n\n None => {\n\n let is_empty = arch::all_bits_are_unset(self.as_array());\n\n if is_empty {\n\n self.length.set(Some(0));\n\n }\n\n\n\n is_empty\n\n }\n\n }\n\n }\n\n\n\n pub fn is_full(&self) -> bool {\n\n match self.raw_len() {\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":54,"score":164421.65939916813},{"content":" #[inline]\n\n fn as_mut_array(&mut self) -> &mut BitArray {\n\n &mut *self.bits\n\n }\n\n\n\n #[inline]\n\n fn shallow_empty(&self) -> bool {\n\n matches!(self.raw_len(), Some(0))\n\n }\n\n\n\n #[inline]\n\n fn shallow_not_empty(&self) -> bool {\n\n matches!(self.raw_len(), Some(len) if len != 0)\n\n }\n\n\n\n #[inline]\n\n fn shallow_full(&self) -> bool {\n\n matches!(self.raw_len(), Some(len) if len == MAX_LEN)\n\n }\n\n\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":55,"score":164418.39222195558},{"content":" // len ≡ MAX_LEN\n\n Some(len) if len == MAX_LEN => true,\n\n\n\n // len ≠ MAX_LEN\n\n Some(_) => false,\n\n\n\n // len unknown\n\n None => {\n\n let is_full = arch::all_bits_are_set(self.as_array());\n\n if is_full {\n\n self.length.set(Some(MAX_LEN));\n\n }\n\n\n\n is_full\n\n }\n\n }\n\n }\n\n\n\n pub fn len(&self) -> usize {\n\n let length = self.raw_len().unwrap_or_else(|| {\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":56,"score":164416.71887236778},{"content":"#[tracing::instrument(skip(source))]\n\npub fn parse_source(file: &Path, source: &str) -> Box<[Token]> {\n\n let file = file.display();\n\n\n\n tracing::info!(source_len = source.len(), \"started parsing '{}'\", file);\n\n let event = PerfEvent::new(\"parsing\");\n\n\n\n // Parse the program's source code into tokens\n\n let Parsed {\n\n tokens,\n\n source_len,\n\n total_tokens,\n\n deepest_nesting,\n\n } = parse::parse(source);\n\n\n\n let elapsed = event.finish();\n\n tracing::info!(\n\n source_len,\n\n total_tokens,\n\n deepest_nesting,\n\n \"finished parsing '{}' in {:#?}\",\n\n file,\n\n elapsed,\n\n );\n\n\n\n tokens\n\n}\n\n\n","file_path":"src/driver.rs","rank":57,"score":164313.20330518874},{"content":"struct ExpressionPuller<'a> {\n\n graph: &'a mut Rvsdg,\n\n body: &'a mut Rvsdg,\n\n removals: BTreeSet<NodeId>,\n\n params: Vec<(OutputPort, NodeId)>,\n\n constants: HashMap<OutputPort, Const>,\n\n invariant_exprs: VecDeque<OutputPort>,\n\n input_pairs: HashMap<OutputPort, OutputPort>,\n\n param_to_new: HashMap<OutputPort, OutputPort>,\n\n}\n\n\n\nimpl<'a> ExpressionPuller<'a> {\n\n fn new(\n\n graph: &'a mut Rvsdg,\n\n body: &'a mut Rvsdg,\n\n invariant_inputs: &[(OutputPort, OutputPort)],\n\n invariant_exprs: VecDeque<OutputPort>,\n\n input_pairs: HashMap<OutputPort, OutputPort>,\n\n ) -> Self {\n\n // TODO: Buffers\n","file_path":"src/passes/licm.rs","rank":58,"score":158823.68461825632},{"content":"/// Creates an [`IrBuilder`] for gamma branches\n\nfn gamma_branch_builder(inline_constants: bool) -> IrBuilder {\n\n IrBuilder {\n\n values: BTreeMap::new(),\n\n instructions: Vec::new(),\n\n evaluated: BTreeSet::new(),\n\n evaluation_stack: Vec::new(),\n\n top_level: false,\n\n inline_constants,\n\n }\n\n}\n\n\n","file_path":"src/ir/builder.rs","rank":59,"score":157711.4702059238},{"content":"#[derive(Debug)]\n\nstruct OutmostTheta {\n\n inner_gamma_id: NodeId,\n\n src_ptr: OutputPort,\n\n temp0_ptr: OutputPort,\n\n temp1_ptr: OutputPort,\n\n}\n\n\n\nimpl OutmostTheta {\n\n const fn new(\n\n inner_gamma_id: NodeId,\n\n src_ptr: OutputPort,\n\n temp0_ptr: OutputPort,\n\n temp1_ptr: OutputPort,\n\n ) -> Self {\n\n Self {\n\n inner_gamma_id,\n\n src_ptr,\n\n temp0_ptr,\n\n temp1_ptr,\n\n }\n\n }\n\n}\n\n\n","file_path":"src/passes/square_cell.rs","rank":60,"score":157633.83408170496},{"content":"#[derive(Debug)]\n\nstruct InnerGamma {\n\n inner_theta_id: NodeId,\n\n}\n\n\n\nimpl InnerGamma {\n\n const fn new(inner_theta_id: NodeId) -> Self {\n\n Self { inner_theta_id }\n\n }\n\n}\n\n\n\ntest_opts! {\n\n square_input,\n\n passes = |tape_len| bvec![SquareCell::new(tape_len)],\n\n input = [10],\n\n output = [100],\n\n |graph, effect, tape_len| {\n\n let source = include_str!(concat!(env!(\"CARGO_MANIFEST_DIR\"), \"/examples/square.bf\"));\n\n\n\n let ptr = graph.int(Ptr::new(0, tape_len));\n\n let (_ptr, effect) = compile_brainfuck_into(source, graph, ptr.value(), effect);\n\n effect\n\n },\n\n}\n","file_path":"src/passes/square_cell.rs","rank":61,"score":157573.73516726206},{"content":"/// Builds an input parameter for a gamma branch\n\nfn gamma_input_param(\n\n block: &mut Block,\n\n builder: &mut IrBuilder,\n\n graph: &Rvsdg,\n\n input_values: &BTreeMap<InputPort, Value>,\n\n input: InputPort,\n\n param: NodeId,\n\n branch: &str,\n\n) {\n\n let input_param = graph.to_node::<InputParam>(param);\n\n let input_id = VarId::new(input_param.output());\n\n\n\n let value = input_values.get(&input).cloned().unwrap_or(Value::Missing);\n\n block.push(Assign::input(input_id, value, Variance::None).into());\n\n\n\n if value.is_missing() {\n\n tracing::warn!(\n\n \"missing input value for gamma {} branch input {:?}: {:?}\",\n\n branch,\n\n input,\n\n input_param,\n\n );\n\n }\n\n\n\n builder\n\n .values\n\n .insert(input_param.output(), input_id.into())\n\n .debug_unwrap_none();\n\n}\n","file_path":"src/ir/builder.rs","rank":62,"score":157136.866574627},{"content":"#[cold]\n\n#[track_caller]\n\n#[inline(never)]\n\nfn panic_none_with_message(value: &dyn Debug, message: &str) -> ! {\n\n panic!(\n\n \"unwrapped {:?} when `None` was expected: {}\",\n\n value, message\n\n )\n\n}\n\n\n","file_path":"src/utils.rs","rank":63,"score":154608.69359776456},{"content":"pub fn percent_total(total: usize, subset: usize) -> f64 {\n\n let diff = (subset as f64 * 100.0) / total as f64;\n\n\n\n if diff.is_nan() || diff == -0.0 {\n\n 0.0\n\n } else {\n\n diff\n\n }\n\n}\n\n\n","file_path":"src/utils.rs","rank":64,"score":151311.8869069935},{"content":"pub fn hex_encode<T: AsRef<[u8]>>(data: T) -> String {\n\n const HEX_CHARACTERS: [u8; 16] = *b\"0123456789abcdef\";\n\n\n\n let data = data.as_ref();\n\n\n\n let mut output = String::with_capacity(data.len() * 2);\n\n for &byte in data {\n\n output.push(HEX_CHARACTERS[(byte >> 4) as usize] as char);\n\n output.push(HEX_CHARACTERS[(byte & 0xF) as usize] as char);\n\n }\n\n\n\n output\n\n}\n\n\n\npub(crate) enum DebugCollapse<T> {\n\n Single(T),\n\n Many(T, usize, usize),\n\n}\n\n\n\nimpl<T> Debug for DebugCollapse<T>\n","file_path":"src/utils.rs","rank":65,"score":146301.8227448228},{"content":"type BitArray = [u64; BITS_LEN];\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":66,"score":143994.2652770764},{"content":"pub trait Pretty {\n\n fn pretty_print(&self, config: PrettyConfig) -> String {\n\n let construction_start = Instant::now();\n\n\n\n let arena = Arena::<()>::new();\n\n let pretty = self.pretty(&arena, config);\n\n\n\n if STATIC_MAX_LEVEL >= LevelFilter::DEBUG && config.duration_logging {\n\n let elapsed = construction_start.elapsed();\n\n tracing::debug!(\n\n target: \"timings\",\n\n \"took {:#?} to construct pretty printed ir\",\n\n elapsed,\n\n );\n\n }\n\n\n\n let format_start = Instant::now();\n\n\n\n let mut output = String::with_capacity(4096);\n\n write!(output, \"{}\", pretty.1.pretty(RENDER_WIDTH))\n","file_path":"src/ir/pretty_print.rs","rank":67,"score":140512.48940950018},{"content":"fn from_utf8_lossy_buffered<'a>(buffer: &'a mut String, bytes: &'a [u8]) -> &'a str {\n\n let mut iter = Utf8Lossy::from_bytes(bytes).chunks();\n\n\n\n let first_valid = if let Some(chunk) = iter.next() {\n\n let Utf8LossyChunk { valid, broken } = chunk;\n\n if broken.is_empty() {\n\n debug_assert_eq!(valid.len(), bytes.len());\n\n return valid;\n\n }\n\n valid\n\n } else {\n\n return \"\";\n\n };\n\n\n\n const REPLACEMENT: &str = \"\\u{FFFD}\";\n\n\n\n buffer.clear();\n\n buffer.reserve(bytes.len());\n\n buffer.push_str(first_valid);\n\n buffer.push_str(REPLACEMENT);\n","file_path":"src/jit/ffi.rs","rank":68,"score":139521.89684738676},{"content":"pub fn lower_tokens(\n\n graph: &mut Rvsdg,\n\n mut ptr: OutputPort,\n\n mut effect: OutputPort,\n\n tokens: &[Token],\n\n) -> (OutputPort, OutputPort) {\n\n // FIXME: Byte node\n\n let (zero, one) = (graph.byte(0).value(), graph.byte(1).value());\n\n\n\n for token in tokens {\n\n match token {\n\n Token::IncPtr => ptr = graph.add(ptr, one).value(),\n\n Token::DecPtr => ptr = graph.sub(ptr, one).value(),\n\n\n\n Token::Inc => {\n\n // Load the pointed-to cell's current value\n\n let load = graph.load(ptr, effect);\n\n effect = load.output_effect();\n\n\n\n // Increment the loaded cell's value\n","file_path":"src/lower_tokens.rs","rank":69,"score":137408.56094493048},{"content":"type BitBox = ManuallyDrop<Box<BitArray>>;\n\n\n\nthread_local! {\n\n // FIXME: https://github.com/rust-lang/rust-clippy/issues/8493\n\n #[allow(clippy::declare_interior_mutable_const)]\n\n static BITMAP_CACHE: RefCell<Vec<Box<BitArray>>> = const { RefCell::new(Vec::new()) };\n\n}\n\n\n\npub struct U16Bitmap {\n\n bits: BitBox,\n\n length: Cell<Option<u32>>,\n\n}\n\n\n\nimpl U16Bitmap {\n\n pub fn empty() -> Self {\n\n Self {\n\n bits: zeroed_bit_box(),\n\n length: Cell::new(Some(0)),\n\n }\n\n }\n","file_path":"src/passes/dataflow/domain/bitmap_u16/mod.rs","rank":70,"score":137179.7309835569},{"content":"}\n\n\n\nimpl Scan {\n\n #[must_use]\n\n #[allow(clippy::too_many_arguments)]\n\n pub(in crate::graph) const fn new(\n\n node: NodeId,\n\n direction: ScanDirection,\n\n ptr: InputPort,\n\n step: InputPort,\n\n needle: InputPort,\n\n output_ptr: OutputPort,\n\n input_effect: InputPort,\n\n output_effect: OutputPort,\n\n ) -> Self {\n\n Self {\n\n node,\n\n direction,\n\n ptr,\n\n step,\n","file_path":"src/graph/nodes/scan.rs","rank":71,"score":136715.38981800413},{"content":"use crate::graph::{\n\n nodes::node_ext::{InputPortKinds, InputPorts, OutputPortKinds, OutputPorts},\n\n EdgeCount, EdgeDescriptor, EdgeKind, InputPort, NodeExt, NodeId, OutputPort,\n\n};\n\nuse tinyvec::tiny_vec;\n\n\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\n\npub struct Scan {\n\n /// The id of the scan node\n\n node: NodeId,\n\n\n\n /// The direction the scan goes in, forwards or backwards\n\n direction: ScanDirection,\n\n\n\n /// The pointer to start scanning at\n\n ptr: InputPort,\n\n\n\n /// The distance the scan steps by\n\n step: InputPort,\n\n\n","file_path":"src/graph/nodes/scan.rs","rank":72,"score":136715.17958120824},{"content":" self.output_ptr = to;\n\n }\n\n\n\n if self.output_effect == from {\n\n self.output_effect = to;\n\n }\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\n\npub enum ScanDirection {\n\n Forward,\n\n Backward,\n\n}\n\n\n\nimpl ScanDirection {\n\n /// Returns `true` if the scan direction is [`Forward`].\n\n ///\n\n /// [`Forward`]: ScanDirection::Forward\n\n #[must_use]\n","file_path":"src/graph/nodes/scan.rs","rank":73,"score":136701.72831719552},{"content":" }\n\n\n\n /// Get the scan's output pointer\n\n pub const fn output_ptr(&self) -> OutputPort {\n\n self.output_ptr\n\n }\n\n\n\n /// Get the scan's needle\n\n pub const fn needle(&self) -> InputPort {\n\n self.needle\n\n }\n\n\n\n /// Get the scan's input effect\n\n pub const fn input_effect(&self) -> InputPort {\n\n self.input_effect\n\n }\n\n\n\n /// Get the scan's output effect\n\n pub const fn output_effect(&self) -> OutputPort {\n\n self.output_effect\n","file_path":"src/graph/nodes/scan.rs","rank":74,"score":136692.8794153726},{"content":" needle,\n\n output_ptr,\n\n input_effect,\n\n output_effect,\n\n }\n\n }\n\n\n\n /// Get the scan's direction\n\n pub const fn direction(&self) -> ScanDirection {\n\n self.direction\n\n }\n\n\n\n /// Get the scan's pointer\n\n pub const fn ptr(&self) -> InputPort {\n\n self.ptr\n\n }\n\n\n\n /// Get the scan's step\n\n pub const fn step(&self) -> InputPort {\n\n self.step\n","file_path":"src/graph/nodes/scan.rs","rank":75,"score":136692.21420624747},{"content":" pub const fn is_forward(&self) -> bool {\n\n matches!(self, Self::Forward)\n\n }\n\n\n\n /// Returns `true` if the scan direction is [`Backward`].\n\n ///\n\n /// [`Backward`]: ScanDirection::Backward\n\n #[must_use]\n\n pub const fn is_backward(&self) -> bool {\n\n matches!(self, Self::Backward)\n\n }\n\n}\n","file_path":"src/graph/nodes/scan.rs","rank":76,"score":136690.5949803368},{"content":" /// The byte values being scanned for\n\n needle: InputPort,\n\n\n\n /// A pointer to a cell containing one of the requested needles,\n\n /// effectively `ptr ± offset` where `offset` is the offset to a cell\n\n /// with one of the requested needles and `ptr` is `self.ptr`.\n\n ///\n\n /// The relative offset can be either positive or negative (that is,\n\n /// the output pointer can be greater or less than the input pointer)\n\n /// no matter the scan direction because of the wrapping semantics of\n\n /// the program tape.\n\n ///\n\n /// Loops infinitely if no cells with the proper needle value can be found\n\n output_ptr: OutputPort,\n\n\n\n /// Input effect stream\n\n input_effect: InputPort,\n\n\n\n /// Output effect stream\n\n output_effect: OutputPort,\n","file_path":"src/graph/nodes/scan.rs","rank":77,"score":136688.5787304865},{"content":" }\n\n}\n\n\n\nimpl NodeExt for Scan {\n\n fn node(&self) -> NodeId {\n\n self.node\n\n }\n\n\n\n fn input_desc(&self) -> EdgeDescriptor {\n\n EdgeDescriptor::new(EdgeCount::one(), EdgeCount::exact(3))\n\n }\n\n\n\n fn all_input_ports(&self) -> InputPorts {\n\n tiny_vec![self.ptr, self.step, self.needle, self.input_effect]\n\n }\n\n\n\n fn all_input_port_kinds(&self) -> InputPortKinds {\n\n tiny_vec![[_; 4] =>\n\n (self.ptr, EdgeKind::Value),\n\n (self.step, EdgeKind::Value),\n","file_path":"src/graph/nodes/scan.rs","rank":78,"score":136687.97060593715},{"content":" }\n\n }\n\n\n\n fn output_desc(&self) -> EdgeDescriptor {\n\n EdgeDescriptor::new(EdgeCount::one(), EdgeCount::one())\n\n }\n\n\n\n fn all_output_ports(&self) -> OutputPorts {\n\n tiny_vec![self.output_ptr, self.output_effect]\n\n }\n\n\n\n fn all_output_port_kinds(&self) -> OutputPortKinds {\n\n tiny_vec![[_; 4] =>\n\n (self.output_ptr, EdgeKind::Value),\n\n (self.output_effect, EdgeKind::Effect),\n\n ]\n\n }\n\n\n\n fn update_output(&mut self, from: OutputPort, to: OutputPort) {\n\n if self.output_ptr == from {\n","file_path":"src/graph/nodes/scan.rs","rank":79,"score":136675.659620963},{"content":" (self.needle, EdgeKind::Value),\n\n (self.input_effect, EdgeKind::Effect),\n\n ]\n\n }\n\n\n\n fn update_input(&mut self, from: InputPort, to: InputPort) {\n\n if from == self.ptr {\n\n self.ptr = to;\n\n }\n\n\n\n if from == self.step {\n\n self.step = to;\n\n }\n\n\n\n if from == self.needle {\n\n self.needle = to;\n\n }\n\n\n\n if from == self.input_effect {\n\n self.input_effect = to;\n","file_path":"src/graph/nodes/scan.rs","rank":80,"score":136675.48953392237},{"content":"//! The theta node\n\n\n\nuse crate::{\n\n graph::{\n\n nodes::node_ext::{InputPortKinds, InputPorts, OutputPortKinds, OutputPorts},\n\n EdgeCount, EdgeDescriptor, EdgeKind, End, InputParam, InputPort, NodeExt, NodeId,\n\n OutputParam, OutputPort, Rvsdg, Start, Subgraph,\n\n },\n\n utils::{AssertNone, HashMap},\n\n};\n\nuse tinyvec::TinyVec;\n\n\n\n// TODO: Probably want reverse lookup maps as well as the current forward ones\n\n#[derive(Debug, Clone, PartialEq)]\n\npub struct Theta {\n\n /// The theta's [`NodeId`]\n\n node: NodeId,\n\n\n\n /// Theta nodes don't have to have effects, the inner [`Subgraph`]\n\n /// will have them regardless (only from [`Start`] to [`End`] node though).\n","file_path":"src/graph/nodes/theta.rs","rank":81,"score":136645.22180320136},{"content":" tracing::trace!(\n\n node = ?parent_node,\n\n \"tried to replace output effect {:?} of Theta with {:?} but Theta doesn't have that port\",\n\n from, to,\n\n );\n\n }\n\n }\n\n}\n\n\n\n/// The effects of a theta node\n\n#[derive(Debug, Clone, Copy, PartialEq, Eq)]\n\npub(in crate::graph) struct ThetaEffects {\n\n /// The input effect's port on the theta node\n\n input: InputPort,\n\n /// The output effect's port on the theta node\n\n output: OutputPort,\n\n}\n\n\n\nimpl ThetaEffects {\n\n pub const fn new(input: InputPort, output: OutputPort) -> Self {\n","file_path":"src/graph/nodes/theta.rs","rank":82,"score":136639.81126906764},{"content":" /// [`End`]: crate::graph::End\n\n subgraph: Box<Subgraph>,\n\n}\n\n\n\nimpl Theta {\n\n /// Create a new theta node\n\n #[allow(clippy::too_many_arguments)]\n\n pub(in crate::graph) fn new(\n\n node: NodeId,\n\n effects: Option<ThetaEffects>,\n\n invariant_inputs: HashMap<InputPort, NodeId>,\n\n variant_inputs: HashMap<InputPort, NodeId>,\n\n outputs: HashMap<OutputPort, NodeId>,\n\n output_feedback: HashMap<OutputPort, InputPort>,\n\n condition: NodeId,\n\n subgraph: Box<Subgraph>,\n\n ) -> Self {\n\n if cfg!(debug_assertions) {\n\n assert_eq!(variant_inputs.len(), outputs.len());\n\n assert_eq!(outputs.len(), output_feedback.len());\n","file_path":"src/graph/nodes/theta.rs","rank":83,"score":136637.3205292428},{"content":" Self { input, output }\n\n }\n\n\n\n #[allow(dead_code)]\n\n pub const fn output(&self) -> OutputPort {\n\n self.output\n\n }\n\n}\n\n\n\n#[derive(Debug, Clone, PartialEq)]\n\npub struct ThetaData {\n\n pub(in crate::graph) outputs: Box<[OutputPort]>,\n\n pub(in crate::graph) condition: OutputPort,\n\n pub(in crate::graph) effect: OutputPort,\n\n}\n\n\n\nimpl ThetaData {\n\n pub fn new<O>(outputs: O, condition: OutputPort, effect: OutputPort) -> Self\n\n where\n\n O: IntoIterator<Item = OutputPort>,\n\n {\n\n Self {\n\n outputs: outputs.into_iter().collect(),\n\n condition,\n\n effect,\n\n }\n\n }\n\n}\n","file_path":"src/graph/nodes/theta.rs","rank":84,"score":136634.75114642555},{"content":" has_child_thetas\n\n }\n\n}\n\n\n\n/// Utility functions\n\n// TODO: Function to inline the theta's body into the given graph\n\nimpl Theta {\n\n pub fn get_output_param(&self, port: OutputPort) -> Option<OutputParam> {\n\n self.outputs\n\n .get(&port)\n\n .map(|&node| self.subgraph.to_node(node))\n\n .copied()\n\n }\n\n\n\n /// Returns `true` if the theta's condition is always `false`\n\n pub fn is_infinite(&self) -> bool {\n\n let cond = self.condition();\n\n let condition_is_false = self\n\n .body()\n\n .input_source_node(cond.input())\n","file_path":"src/graph/nodes/theta.rs","rank":85,"score":136630.0412736898},{"content":" /// Just because a theta node isn't effectful doesn't mean it's useless,\n\n /// it can still have data dependencies\n\n ///\n\n /// [`Start`]: crate::graph::Start\n\n /// [`End`]: crate::graph::End\n\n effects: Option<ThetaEffects>,\n\n\n\n /// These are the inputs that go into the loop's body\n\n /// but do not change between iterations\n\n ///\n\n /// These point from an [`InputPort`] on the theta to the [`NodeId`]\n\n /// of an [`InputParam`] within the theta's body\n\n invariant_inputs: HashMap<InputPort, NodeId>,\n\n\n\n /// These inputs change upon each iteration, they're connected to `output_back_edges`\n\n ///\n\n /// These point from an [`InputPort`] on the theta to the [`NodeId`]\n\n /// of an [`InputParam`] within the theta's body\n\n variant_inputs: HashMap<InputPort, NodeId>,\n\n\n","file_path":"src/graph/nodes/theta.rs","rank":86,"score":136627.1646519455},{"content":" /// The node's outputs, these all must be included in `output_back_edges`. Any invariant\n\n /// data must go around the loop to reach dependents after it\n\n ///\n\n /// These point from an [`OutputPort`] on the theta to the [`NodeId`]\n\n /// of an [`OutputParam`] within the theta's body\n\n outputs: HashMap<OutputPort, NodeId>,\n\n\n\n /// These are the relationships between outputs and variant inputs\n\n ///\n\n /// These point from an [`OutputPort`] in `outputs` to an [`InputPort`] in `variant_inputs`\n\n output_feedback: HashMap<OutputPort, InputPort>,\n\n\n\n /// The theta's condition, it should be an expression that evaluates to a boolean\n\n ///\n\n /// Points to an [`OutputParam`] within the theta's body\n\n condition: NodeId,\n\n\n\n /// The theta's loop body, contains the [`Start`] and [`End`] [`NodeId`]s\n\n ///\n\n /// [`Start`]: crate::graph::Start\n","file_path":"src/graph/nodes/theta.rs","rank":87,"score":136625.9849243502},{"content":" pub fn output_params(&self) -> impl Iterator<Item = OutputParam> + '_ {\n\n self.outputs\n\n .iter()\n\n .map(|(_, ¶m)| self.subgraph.to_node(param))\n\n .copied()\n\n }\n\n\n\n /// Returns the node ids of outputs from the theta node, *not including effect outputs*\n\n pub fn output_param_ids(&self) -> impl Iterator<Item = NodeId> + '_ {\n\n self.outputs.values().copied()\n\n }\n\n\n\n /// Returns all variant inputs to the theta node along with the output\n\n /// that loops back into the given input\n\n pub fn variant_inputs_loopback(&self) -> impl Iterator<Item = (InputParam, OutputParam)> + '_ {\n\n self.output_feedback.iter().map(|(output, input)| {\n\n let (input, output) = (self.variant_inputs[input], self.outputs[output]);\n\n (\n\n *self.subgraph.to_node(input),\n\n *self.subgraph.to_node(output),\n","file_path":"src/graph/nodes/theta.rs","rank":88,"score":136621.31811640895},{"content":" )\n\n })\n\n }\n\n\n\n /// Returns `true` if the given [`OutputParam`] feeds back to the given variant [`InputParam`]\n\n ///\n\n /// Will return `false` if either of the given [`OutputParam`] or [`InputParam`]s don't exist\n\n /// within the current [`Theta`] or if the given [`InputParam`] isn't a *variant* input.\n\n pub(crate) fn output_feeds_back_to(\n\n &self,\n\n output: &OutputParam,\n\n variant_input: &InputParam,\n\n ) -> bool {\n\n self.outputs\n\n .iter()\n\n .find(|(_, &output_id)| output_id == output.node())\n\n .and_then(|(output_port, _)| self.output_feedback.get(output_port))\n\n .and_then(|input_port| self.variant_inputs.get(input_port))\n\n .map_or(false, |&input_node| input_node == variant_input.node())\n\n }\n","file_path":"src/graph/nodes/theta.rs","rank":89,"score":136619.47356333592},{"content":"\n\n /// Gets the [`InputPort`] of the parent [`Theta`] that feeds into the given variant [`InputParam`]\n\n pub fn variant_input_source(&self, variant_input: &InputParam) -> Option<InputPort> {\n\n self.variant_inputs\n\n .iter()\n\n .find(|(_, &input)| input == variant_input.node())\n\n .map(|(&input_port, _)| input_port)\n\n }\n\n\n\n pub(crate) fn has_child_thetas(&self) -> bool {\n\n let mut has_child_thetas = false;\n\n self.body().try_for_each_transitive_node(|_, node| {\n\n if node.is_theta() {\n\n has_child_thetas = true;\n\n false\n\n } else {\n\n true\n\n }\n\n });\n\n\n","file_path":"src/graph/nodes/theta.rs","rank":90,"score":136618.77244390166},{"content":" self.outputs.remove(&output).debug_unwrap();\n\n }\n\n\n\n /// Returns the number of all inputs (variant and invariant) to the theta node,\n\n /// *not including effect inputs*\n\n pub fn inputs_len(&self) -> usize {\n\n self.invariant_inputs_len() + self.variant_inputs_len()\n\n }\n\n\n\n /// Returns the input ports of all inputs (variant and invariant) to the theta node,\n\n /// *not including effect inputs*\n\n pub fn input_ports(&self) -> impl Iterator<Item = InputPort> + '_ {\n\n self.invariant_input_ports()\n\n .chain(self.variant_input_ports())\n\n }\n\n\n\n /// Returns the input ports and the associated input param of all inputs (variant and invariant)\n\n /// to the theta node, *not including effect inputs*\n\n pub fn input_pairs(&self) -> impl Iterator<Item = (InputPort, InputParam)> + '_ {\n\n self.invariant_input_pairs()\n","file_path":"src/graph/nodes/theta.rs","rank":91,"score":136618.65592759947},{"content":" tracing::error!(\"tried to set input effect on theta without effect edges\");\n\n }\n\n }\n\n\n\n pub fn set_output_effect(&mut self, output_effect: OutputPort) {\n\n if let Some(effects) = self.effects.as_mut() {\n\n effects.output = output_effect;\n\n } else {\n\n tracing::error!(\"tried to set output effect on theta without effect edges\");\n\n }\n\n }\n\n\n\n pub fn remove_invariant_input(&mut self, input: InputPort) {\n\n self.invariant_inputs.remove(&input);\n\n }\n\n\n\n pub fn add_invariant_input_raw(&mut self, input: InputPort, param: NodeId) {\n\n debug_assert!(self.body().contains_node(param));\n\n debug_assert!(self.body().get_node(param).is_input_param());\n\n\n","file_path":"src/graph/nodes/theta.rs","rank":92,"score":136618.21390916433},{"content":" subgraph,\n\n }\n\n }\n\n\n\n /// Get the [`NodeId`] of the theta node's condition\n\n ///\n\n /// Should be an [`OutputParam`] in the theta's body\n\n pub const fn condition_id(&self) -> NodeId {\n\n self.condition\n\n }\n\n\n\n /// Get the [`OutputParam`] of the theta's condition from within its body\n\n pub fn condition(&self) -> OutputParam {\n\n *self.subgraph.to_node(self.condition)\n\n }\n\n\n\n /// Get the [`Start`] of the theta's body\n\n pub fn start_node(&self) -> Start {\n\n self.subgraph.start_node()\n\n }\n","file_path":"src/graph/nodes/theta.rs","rank":93,"score":136617.8459959413},{"content":"\n\n /// Get the [`End`] of the theta's body\n\n pub fn end_node(&self) -> End {\n\n self.subgraph.end_node()\n\n }\n\n\n\n /// Get the [`NodeId`] of the theta body's [`End`] node\n\n pub const fn end_node_id(&self) -> NodeId {\n\n self.subgraph.end\n\n }\n\n\n\n /// Get access to the theta node's body\n\n pub fn body(&self) -> &Rvsdg {\n\n &self.subgraph\n\n }\n\n\n\n /// Get mutable access to the theta node's body\n\n pub fn body_mut(&mut self) -> &mut Rvsdg {\n\n &mut self.subgraph\n\n }\n","file_path":"src/graph/nodes/theta.rs","rank":94,"score":136617.61348186442},{"content":"\n\n /// Get the input effect's port from the theta node if it's available\n\n pub fn input_effect(&self) -> Option<InputPort> {\n\n self.effects.map(|effects| effects.input)\n\n }\n\n\n\n /// Get a mutable reference to the input effect's port from\n\n /// the theta node if it's available\n\n pub fn input_effect_mut(&mut self) -> Option<&mut InputPort> {\n\n self.effects.as_mut().map(|effects| &mut effects.input)\n\n }\n\n\n\n /// Get the output effect's port from the theta node if available\n\n pub fn output_effect(&self) -> Option<OutputPort> {\n\n self.effects.map(|effects| effects.output)\n\n }\n\n\n\n /// Get a mutable reference to the output effect's port from\n\n /// the theta node if it's available\n\n pub fn output_effect_mut(&mut self) -> Option<&mut OutputPort> {\n","file_path":"src/graph/nodes/theta.rs","rank":95,"score":136616.53523696284},{"content":" self.outputs.iter().map(|(&port, ¶m)| (port, param))\n\n }\n\n\n\n pub fn output_pair_ids_with_feedback(\n\n &self,\n\n ) -> impl Iterator<Item = (OutputPort, NodeId, InputPort)> + '_ {\n\n self.outputs\n\n .iter()\n\n .map(|(&port, ¶m)| (port, param, self.output_feedback[&port]))\n\n }\n\n\n\n pub fn replace_outputs(&mut self, outputs: HashMap<OutputPort, NodeId>) {\n\n self.outputs = outputs;\n\n }\n\n\n\n pub fn replace_output_feedback(&mut self, output_feedback: HashMap<OutputPort, InputPort>) {\n\n self.output_feedback = output_feedback;\n\n }\n\n\n\n /// Returns the outputs from the theta node, *not including effect outputs*\n","file_path":"src/graph/nodes/theta.rs","rank":96,"score":136616.35040865358},{"content":"\n\n /// Returns the node ids of each variant input and the input port that feeds into them\n\n pub fn variant_input_pair_ids(&self) -> impl Iterator<Item = (InputPort, NodeId)> + '_ {\n\n self.variant_inputs\n\n .iter()\n\n .map(|(&port, ¶m)| (port, param))\n\n }\n\n\n\n /// Returns the variant inputs to the theta node\n\n pub fn variant_input_params(&self) -> impl Iterator<Item = InputParam> + '_ {\n\n self.variant_inputs\n\n .iter()\n\n .map(|(_, ¶m)| self.subgraph.to_node(param))\n\n .copied()\n\n }\n\n\n\n /// Returns the node ids of variant inputs to the theta node\n\n pub fn variant_input_param_ids(&self) -> impl Iterator<Item = NodeId> + '_ {\n\n self.variant_inputs.values().copied()\n\n }\n","file_path":"src/graph/nodes/theta.rs","rank":97,"score":136615.6285229743},{"content":" /// Returns the node ids of each invariant input and the input port that feeds into them\n\n pub fn invariant_input_pair_ids(&self) -> impl Iterator<Item = (InputPort, NodeId)> + '_ {\n\n self.invariant_inputs\n\n .iter()\n\n .map(|(&port, ¶m)| (port, param))\n\n }\n\n\n\n /// Returns the invariant inputs to the theta node\n\n pub fn invariant_input_params(&self) -> impl Iterator<Item = InputParam> + '_ {\n\n self.invariant_inputs\n\n .iter()\n\n .map(|(_, ¶m)| self.subgraph.to_node(param))\n\n .copied()\n\n }\n\n\n\n /// Returns the node ids of invariant inputs to the theta node\n\n pub fn invariant_input_param_ids(&self) -> impl Iterator<Item = NodeId> + '_ {\n\n self.invariant_inputs.values().copied()\n\n }\n\n\n","file_path":"src/graph/nodes/theta.rs","rank":98,"score":136615.6285229743},{"content":"\n\n pub fn retain_invariant_inputs<F>(&mut self, mut retain: F)\n\n where\n\n F: FnMut(InputPort, NodeId) -> bool,\n\n {\n\n self.invariant_inputs\n\n .retain(|&port, &mut param| retain(port, param));\n\n }\n\n\n\n /// Removes a variant input, the output it's fed from and the feedback entry for them\n\n pub fn remove_variant_input(&mut self, input: InputPort) {\n\n self.variant_inputs.remove(&input).debug_unwrap();\n\n\n\n let output = self\n\n .output_feedback\n\n .iter()\n\n .find_map(|(&output, &port)| (port == input).then(|| output))\n\n .unwrap();\n\n\n\n self.output_feedback.remove(&output).debug_unwrap();\n","file_path":"src/graph/nodes/theta.rs","rank":99,"score":136615.60752106982}],"string":"[\n {\n \"content\": \"pub fn stdout_output() -> impl FnMut(u8) + 'static {\\n\\n move |byte| {\\n\\n // FIXME: Lock once, move into closure\\n\\n let stdout_handle = io::stdout();\\n\\n let mut stdout = stdout_handle.lock();\\n\\n\\n\\n tracing::trace!(\\n\\n \\\"wrote output value {byte}, hex: {byte:#X}, binary: {byte:#08b}\\\",\\n\\n byte = byte,\\n\\n );\\n\\n\\n\\n stdout\\n\\n .write_all(&[byte])\\n\\n .expect(\\\"failed to write to stdout\\\");\\n\\n\\n\\n // FIXME: Flush infrequently, somehow?\\n\\n stdout.flush().expect(\\\"failed to flush stdout\\\");\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/driver.rs\",\n \"rank\": 0,\n \"score\": 284483.938117387\n },\n {\n \"content\": \"pub fn stdin_input() -> impl FnMut() -> u8 + 'static {\\n\\n move || {\\n\\n // FIXME: Lock once, move into closure\\n\\n let stdin_handle = io::stdin();\\n\\n let mut stdin = stdin_handle.lock();\\n\\n\\n\\n let mut buf = [0];\\n\\n stdin\\n\\n .read_exact(&mut buf)\\n\\n .expect(\\\"failed to read from stdin\\\");\\n\\n let [byte] = buf;\\n\\n\\n\\n tracing::trace!(\\n\\n \\\"read input value {byte}, hex: {byte:#X}, binary: {byte:#08b}\\\",\\n\\n byte = byte,\\n\\n );\\n\\n\\n\\n byte\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/driver.rs\",\n \"rank\": 1,\n \"score\": 284480.49422218825\n },\n {\n \"content\": \"#[tracing::instrument(skip_all)]\\n\\npub fn build_graph<T>(tokens: T, tape_len: u16) -> Rvsdg\\n\\nwhere\\n\\n T: AsRef<[Token]>,\\n\\n{\\n\\n let tokens = tokens.as_ref();\\n\\n\\n\\n tracing::info!(\\\"started building rvsdg\\\");\\n\\n let event = PerfEvent::new(\\\"build-graph\\\");\\n\\n\\n\\n let mut graph = Rvsdg::new();\\n\\n // Create the graph's start node\\n\\n let start = graph.start();\\n\\n\\n\\n // Get the starting effect and create the initial pointer (zero)\\n\\n let effect = start.effect();\\n\\n let ptr = graph.int(Ptr::zero(tape_len)).value();\\n\\n\\n\\n // Lower all of the program's tokens into the graph\\n\\n let (_ptr, effect) = lower_tokens::lower_tokens(&mut graph, ptr, effect, tokens);\\n\\n // Create the program's end node\\n\\n graph.end(effect);\\n\\n\\n\\n let elapsed = event.finish();\\n\\n tracing::info!(\\\"finished building rvsdg in {:#?}\\\", elapsed);\\n\\n\\n\\n graph\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/driver.rs\",\n \"rank\": 2,\n \"score\": 270343.2500085946\n },\n {\n \"content\": \"pub trait Port: Debug + Clone + Copy + PartialEq + Eq + Hash {\\n\\n fn port(&self) -> PortId;\\n\\n\\n\\n fn raw(&self) -> u32 {\\n\\n self.port().0\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Default)]\\n\\n#[repr(transparent)]\\n\\npub struct PortId(u32);\\n\\n\\n\\nimpl PortId {\\n\\n pub const fn new(id: u32) -> Self {\\n\\n Self(id)\\n\\n }\\n\\n\\n\\n const fn inner(&self) -> u32 {\\n\\n self.0\\n\\n }\\n\",\n \"file_path\": \"src/graph/ports.rs\",\n \"rank\": 3,\n \"score\": 267061.738792638\n },\n {\n \"content\": \"pub trait UnaryOp: NodeExt {\\n\\n fn name() -> &'static str;\\n\\n\\n\\n fn symbol() -> &'static str;\\n\\n\\n\\n fn make_in_graph(graph: &mut Rvsdg, input: OutputPort) -> Self;\\n\\n\\n\\n fn apply(input: Const) -> Const;\\n\\n\\n\\n fn input(&self) -> InputPort;\\n\\n\\n\\n fn value(&self) -> OutputPort;\\n\\n}\\n\\n\\n\\nimpl UnaryOp for Neg {\\n\\n fn name() -> &'static str {\\n\\n \\\"neg\\\"\\n\\n }\\n\\n\\n\\n fn symbol() -> &'static str {\\n\",\n \"file_path\": \"src/passes/utils/unary_op.rs\",\n \"rank\": 5,\n \"score\": 265848.2771781817\n },\n {\n \"content\": \"pub trait BinaryOp: NodeExt {\\n\\n fn name() -> &'static str;\\n\\n\\n\\n fn symbol() -> &'static str;\\n\\n\\n\\n fn make_in_graph(graph: &mut Rvsdg, lhs: OutputPort, rhs: OutputPort) -> Self;\\n\\n\\n\\n fn apply(lhs: Const, rhs: Const) -> Const;\\n\\n\\n\\n fn lhs(&self) -> InputPort;\\n\\n\\n\\n fn rhs(&self) -> InputPort;\\n\\n\\n\\n fn value(&self) -> OutputPort;\\n\\n\\n\\n fn is_associative() -> bool;\\n\\n\\n\\n fn is_commutative() -> bool;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/passes/utils/binary_op.rs\",\n \"rank\": 6,\n \"score\": 265848.2771781817\n },\n {\n \"content\": \"// TODO:\\n\\n// - .effect_inputs()\\n\\n// - .value_inputs()\\n\\n// - .effect_outputs()\\n\\n// - .value_outputs()\\n\\n// - .has_effect_inputs()\\n\\n// - .has_value_inputs()\\n\\n// - .has_effect_outputs()\\n\\n// - .has_value_outputs()\\n\\n// - .update_output()\\n\\n// - .update_outputs()\\n\\n// - .num_input_ports()\\n\\n// - .num_input_effect_ports()\\n\\n// - .num_input_value_ports()\\n\\n// - .num_output_ports()\\n\\n// - .num_output_effect_ports()\\n\\n// - .num_output_value_ports()\\n\\n// - .has_input(&self, InputPort) -> bool\\n\\n// - .has_output(&self, OutputPort) -> bool\\n\\npub trait NodeExt {\\n\\n fn node(&self) -> NodeId;\\n\\n\\n\\n fn input_desc(&self) -> EdgeDescriptor;\\n\\n\\n\\n fn all_input_ports(&self) -> InputPorts;\\n\\n\\n\\n fn all_input_port_kinds(&self) -> InputPortKinds;\\n\\n\\n\\n fn update_inputs<F>(&mut self, mut update: F) -> bool\\n\\n where\\n\\n F: FnMut(InputPort, EdgeKind) -> Option<InputPort>,\\n\\n {\\n\\n let mut changed = false;\\n\\n for (input, kind) in self.all_input_port_kinds() {\\n\\n if let Some(new_input) = update(input, kind) {\\n\\n self.update_input(input, new_input);\\n\\n changed = true;\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/graph/nodes/node_ext.rs\",\n \"rank\": 7,\n \"score\": 260836.38906571933\n },\n {\n \"content\": \"/// Returns `true` if the given graph has no other nodes between its [`Start`] and [`End`] nodes\\n\\nfn gamma_branch_is_empty(branch: &Rvsdg) -> bool {\\n\\n debug_assert_eq!(branch.start_nodes().len(), 1);\\n\\n debug_assert_eq!(branch.end_nodes().len(), 1);\\n\\n\\n\\n let start = branch.to_node::<Start>(branch.start_nodes()[0]);\\n\\n let end = branch.to_node::<End>(branch.end_nodes()[0]);\\n\\n\\n\\n branch.input_source(end.input_effect()) == start.effect()\\n\\n}\\n\\n\\n\\nimpl Pass for SquareCell {\\n\\n fn pass_name(&self) -> &'static str {\\n\\n \\\"square-cell\\\"\\n\\n }\\n\\n\\n\\n fn did_change(&self) -> bool {\\n\\n self.changed\\n\\n }\\n\\n\\n\\n fn reset(&mut self) {\\n\",\n \"file_path\": \"src/passes/square_cell.rs\",\n \"rank\": 8,\n \"score\": 259480.25919347192\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn bit(index: u16) -> usize {\\n\\n index as usize % 64\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 9,\n \"score\": 241665.37749713077\n },\n {\n \"content\": \"#[inline(always)]\\n\\nfn key(index: u16) -> usize {\\n\\n index as usize / 64\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 10,\n \"score\": 241665.37749713077\n },\n {\n \"content\": \"pub fn array_output(output: &mut Vec<u8>) -> impl FnMut(u8) + '_ {\\n\\n move |byte| {\\n\\n tracing::trace!(\\n\\n output_len = output.len() + 1,\\n\\n \\\"pushed output value {byte}, hex: {byte:#X}, binary: {byte:#08b}\\\",\\n\\n byte = byte,\\n\\n );\\n\\n output.push(byte);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/driver.rs\",\n \"rank\": 12,\n \"score\": 230587.15394510148\n },\n {\n \"content\": \"pub fn diff_ir(old: &str, new: &str) -> String {\\n\\n let start_time = Instant::now();\\n\\n\\n\\n let diff = TextDiff::configure()\\n\\n .algorithm(Algorithm::Patience)\\n\\n .deadline(Instant::now() + Duration::from_secs(1))\\n\\n .diff_lines(old, new);\\n\\n\\n\\n let diff = format!(\\\"{}\\\", diff.unified_diff());\\n\\n\\n\\n let elapsed = start_time.elapsed();\\n\\n tracing::debug!(\\n\\n target: \\\"timings\\\",\\n\\n \\\"took {:#?} to diff ir\\\",\\n\\n elapsed,\\n\\n );\\n\\n\\n\\n diff\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 13,\n \"score\": 229591.7780706408\n },\n {\n \"content\": \"pub fn array_input(input: &mut VecDeque<u8>) -> impl FnMut() -> u8 + '_ {\\n\\n move || {\\n\\n let (byte, was_empty) = input.pop_front().map_or((0, true), |byte| (byte, false));\\n\\n\\n\\n tracing::trace!(\\n\\n input_len = input.len(),\\n\\n was_empty,\\n\\n \\\"popped input value {byte}, hex: {byte:#X}, binary: {byte:#08b}\\\",\\n\\n byte = byte,\\n\\n );\\n\\n\\n\\n byte\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/driver.rs\",\n \"rank\": 14,\n \"score\": 227321.37345707772\n },\n {\n \"content\": \" pub trait True {}\\n\\n\\n\\n impl True for Assert<true> {}\\n\\n\\n\\n pub const fn contains(changes: &[&str], name: &str) -> bool {\\n\\n let mut idx = 0;\\n\\n while idx < changes.len() {\\n\\n if str_eq(changes[idx], name) {\\n\\n return true;\\n\\n }\\n\\n\\n\\n idx += 1;\\n\\n }\\n\\n\\n\\n false\\n\\n }\\n\\n\\n\\n const fn index_of(changes: &[&str], name: &str) -> usize {\\n\\n let mut idx = 0;\\n\\n while idx < changes.len() {\\n\",\n \"file_path\": \"src/passes/utils/changes.rs\",\n \"rank\": 15,\n \"score\": 224407.75348419492\n },\n {\n \"content\": \"#[inline]\\n\\npub fn lsb(chunk: u64) -> Option<u8> {\\n\\n if chunk == 0 {\\n\\n None\\n\\n } else {\\n\\n Some(chunk.trailing_zeros() as u8)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Returns the last (most significant) bit of `chunk`, or `None` if `chunk` is\\n\\n/// 0.\\n\",\n \"file_path\": \"src/passes/dataflow/domain/utils.rs\",\n \"rank\": 16,\n \"score\": 223467.3953258172\n },\n {\n \"content\": \"#[inline]\\n\\npub fn msb(chunk: u64) -> Option<u8> {\\n\\n if chunk == 0 {\\n\\n None\\n\\n } else {\\n\\n let bits = u64::BITS - 1;\\n\\n Some((bits as u8) ^ chunk.leading_zeros() as u8)\\n\\n }\\n\\n}\\n\\n\\n\\n/// Removes the first (least significant) bit from `chunk` and returns it, or\\n\\n/// `None` if `chunk` is 0.\\n\",\n \"file_path\": \"src/passes/dataflow/domain/utils.rs\",\n \"rank\": 17,\n \"score\": 223467.3953258172\n },\n {\n \"content\": \"#[inline]\\n\\npub fn pop_msb(chunk: &mut u64) -> Option<u8> {\\n\\n let msb = msb(*chunk)?;\\n\\n *chunk ^= 1 << msb;\\n\\n Some(msb)\\n\\n}\\n\",\n \"file_path\": \"src/passes/dataflow/domain/utils.rs\",\n \"rank\": 18,\n \"score\": 212121.2620166552\n },\n {\n \"content\": \"#[inline]\\n\\npub fn pop_lsb(chunk: &mut u64) -> Option<u8> {\\n\\n let lsb = lsb(*chunk)?;\\n\\n *chunk ^= 1 << lsb;\\n\\n Some(lsb)\\n\\n}\\n\\n\\n\\n/// Removes the last (most significant) bit from `chunk` and returns it, or\\n\\n/// `None` if `chunk` is 0.\\n\",\n \"file_path\": \"src/passes/dataflow/domain/utils.rs\",\n \"rank\": 19,\n \"score\": 212121.2620166552\n },\n {\n \"content\": \"#[test]\\n\\nfn const_add() {\\n\\n use crate::{driver, passes::PassConfig};\\n\\n\\n\\n let mut input = {\\n\\n let mut graph = Rvsdg::new();\\n\\n\\n\\n let start = graph.start();\\n\\n let lhs = graph.byte(10);\\n\\n let rhs = graph.byte(20);\\n\\n let sum = graph.add(lhs.value(), rhs.value());\\n\\n let output = graph.output(sum.value(), start.effect());\\n\\n let _end = graph.end(output.output_effect());\\n\\n\\n\\n graph\\n\\n };\\n\\n driver::run_opt_passes(\\n\\n &mut input,\\n\\n usize::MAX,\\n\\n &PassConfig::new(30_000, true, true),\\n\\n None,\\n\",\n \"file_path\": \"src/passes/const_folding.rs\",\n \"rank\": 20,\n \"score\": 208839.77021813847\n },\n {\n \"content\": \"// TODO: Turn validation into a pass\\n\\n// TODO: Make validation check edge and port kinds\\n\\nfn validate(graph: &Rvsdg) {\\n\\n tracing::debug!(\\n\\n target: \\\"timings\\\",\\n\\n \\\"started validating graph\\\",\\n\\n );\\n\\n let start_time = Instant::now();\\n\\n\\n\\n let mut stack: Vec<_> = graph.node_ids().map(|node_id| (node_id, graph)).collect();\\n\\n\\n\\n while let Some((node_id, graph)) = stack.pop() {\\n\\n let node = graph.get_node(node_id);\\n\\n\\n\\n if let Node::Theta(theta) = node {\\n\\n stack.extend(\\n\\n theta\\n\\n .body()\\n\\n .node_ids()\\n\\n .map(|node_id| (node_id, theta.body())),\\n\\n );\\n\\n } else if let Node::Gamma(gamma) = node {\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 21,\n \"score\": 206214.02288971373\n },\n {\n \"content\": \"#[inline]\\n\\nfn zeroed_bit_box() -> BitBox {\\n\\n pop_bit_cache()\\n\\n .map(|mut bits| {\\n\\n arch::set_bits_zero(&mut bits);\\n\\n bits\\n\\n })\\n\\n // Safety: u64s are zeroable\\n\\n .unwrap_or_else(|| ManuallyDrop::new(unsafe { Box::new_zeroed().assume_init() }))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 22,\n \"score\": 205297.94350081487\n },\n {\n \"content\": \"// Calculates the filtered cartesian product of both domains where the values are inequal\\n\\n// (a, b) := { (a, b) ∈ A × B | A ≠ B }\\n\\npub fn differential_product(lhs: &Domain, rhs: &Domain) -> (Domain, Domain) {\\n\\n match (lhs, rhs) {\\n\\n (Domain::Bool(lhs), Domain::Bool(rhs)) => {\\n\\n let (mut lhs_false, mut rhs_false) = (BoolSet::empty(), BoolSet::empty());\\n\\n for &lhs in lhs.as_slice() {\\n\\n for &rhs in rhs.as_slice() {\\n\\n if lhs != rhs {\\n\\n lhs_false.add(lhs);\\n\\n rhs_false.add(rhs);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n (Domain::Bool(lhs_false), Domain::Bool(rhs_false))\\n\\n }\\n\\n\\n\\n (Domain::Byte(lhs), Domain::Byte(rhs)) => {\\n\\n let (mut lhs_false, mut rhs_false) = (ByteSet::empty(), ByteSet::empty());\\n\\n for lhs in lhs.iter() {\\n\\n for rhs in rhs.iter() {\\n\",\n \"file_path\": \"src/passes/dataflow/domain/mod.rs\",\n \"rank\": 23,\n \"score\": 205220.5725801081\n },\n {\n \"content\": \"#[inline]\\n\\nfn pop_bit_cache() -> Option<BitBox> {\\n\\n BITMAP_CACHE.with_borrow_mut(|cache| cache.pop().map(ManuallyDrop::new))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 24,\n \"score\": 198887.63036987657\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct LoadMutateStore {\\n\\n output_effect: OutputPort,\\n\\n loaded_value: AddOrSub,\\n\\n mutated_value: Const,\\n\\n ptr: OutputPort,\\n\\n}\\n\",\n \"file_path\": \"src/passes/move_cell.rs\",\n \"rank\": 25,\n \"score\": 196451.36688782205\n },\n {\n \"content\": \"type PopcountPtr = unsafe fn(&BitArray) -> u32;\\n\\n\\n\\npub(super) fn popcount(bits: &BitArray) -> u32 {\\n\\n static POPCOUNT: AtomicPtr<()> = AtomicPtr::new(select_popcount as *mut ());\\n\\n\\n\\n unsafe fn select_popcount(bits: &BitArray) -> u32 {\\n\\n let selected: PopcountPtr = if is_x86_feature_detected!(\\\"avx2\\\") {\\n\\n popcount_avx2 as _\\n\\n } else {\\n\\n popcount_scalar as _\\n\\n };\\n\\n POPCOUNT.store(selected as *mut (), Ordering::Relaxed);\\n\\n\\n\\n unsafe { selected(bits) }\\n\\n }\\n\\n\\n\\n let popcount = POPCOUNT.load(Ordering::Relaxed);\\n\\n let popcount = unsafe { transmute::<*mut (), PopcountPtr>(popcount) };\\n\\n unsafe { popcount(bits) }\\n\\n}\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/arch.rs\",\n \"rank\": 26,\n \"score\": 192354.2155793597\n },\n {\n \"content\": \"pub fn parse(source: &str) -> Parsed {\\n\\n let tokens = source.chars().flat_map(|token| {\\n\\n Some(match token {\\n\\n '>' => RawToken::IncPtr,\\n\\n '<' => RawToken::DecPtr,\\n\\n '+' => RawToken::Inc,\\n\\n '-' => RawToken::Dec,\\n\\n '.' => RawToken::Output,\\n\\n ',' => RawToken::Input,\\n\\n '[' => RawToken::JumpStart,\\n\\n ']' => RawToken::JumpEnd,\\n\\n _ => return None,\\n\\n })\\n\\n });\\n\\n\\n\\n let (mut scopes, mut total_tokens, mut deepest_nesting) = (vec![Vec::new()], 0, 0);\\n\\n for token in tokens {\\n\\n match token {\\n\\n RawToken::IncPtr => scopes.last_mut().unwrap().push(Token::IncPtr),\\n\\n RawToken::DecPtr => scopes.last_mut().unwrap().push(Token::DecPtr),\\n\",\n \"file_path\": \"src/parse.rs\",\n \"rank\": 27,\n \"score\": 188013.88039443037\n },\n {\n \"content\": \"/// Returns `true` if the label matches `\\\\.[a-zA-Z0-9_]+\\n\\nfn is_valid_label_name(label: &str) -> bool {\\n\\n label.starts_with('.')\\n\\n && label.len() >= 2\\n\\n && label\\n\\n .chars()\\n\\n .skip(1)\\n\\n .all(|char| char.is_alphanumeric() || char == '_')\\n\\n}\\n\",\n \"file_path\": \"src/jit/disassemble.rs\",\n \"rank\": 28,\n \"score\": 187194.01427970076\n },\n {\n \"content\": \"#[cfg(test)]\\n\\npub fn compile_brainfuck_into(\\n\\n source: &str,\\n\\n graph: &mut Rvsdg,\\n\\n ptr: OutputPort,\\n\\n effect: OutputPort,\\n\\n) -> (OutputPort, OutputPort) {\\n\\n use crate::parse::Parsed;\\n\\n\\n\\n let parsing_start = Instant::now();\\n\\n\\n\\n let span = tracing::info_span!(\\\"parsing\\\");\\n\\n let tokens = span.in_scope(|| {\\n\\n tracing::info!(\\\"started parsing source code\\\");\\n\\n let Parsed {\\n\\n tokens,\\n\\n source_len,\\n\\n total_tokens,\\n\\n deepest_nesting,\\n\\n } = parse::parse(source);\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 29,\n \"score\": 184586.67726760055\n },\n {\n \"content\": \"#[inline]\\n\\nfn uninit_bit_box() -> Box<[MaybeUninit<u64>; BITS_LEN]> {\\n\\n pop_bit_cache()\\n\\n .map(|bits| {\\n\\n let bits = ManuallyDrop::into_inner(bits);\\n\\n // Safety: We can act like this array isn't initialized\\n\\n unsafe { Box::from_raw(Box::into_raw(bits).cast::<[MaybeUninit<u64>; BITS_LEN]>()) }\\n\\n })\\n\\n // Safety: We're creating an uninit array\\n\\n .unwrap_or_else(|| unsafe { Box::new_uninit().assume_init() })\\n\\n}\\n\\n\\n\\n/// # Safety\\n\\n///\\n\\n/// The caller must ensure that all bits within the bit box are initialized\\n\\n#[inline]\\n\\nunsafe fn assume_bit_box_init(bits: Box<[MaybeUninit<u64>; BITS_LEN]>) -> BitBox {\\n\\n ManuallyDrop::new(unsafe { Box::from_raw(Box::into_raw(bits).cast::<BitArray>()) })\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 30,\n \"score\": 183737.1553673665\n },\n {\n \"content\": \"#[tracing::instrument(level = \\\"debug\\\", skip_all)]\\n\\npub fn sequentialize_graph(\\n\\n args: &Settings,\\n\\n graph: &Rvsdg,\\n\\n dump_dir: Option<&Path>,\\n\\n config: PrettyConfig,\\n\\n) -> Result<(Block, String)> {\\n\\n // Sequentialize the graph into serial instructions\\n\\n let program = {\\n\\n tracing::debug!(\\\"started sequentializing graph\\\");\\n\\n let event = PerfEvent::new(\\\"sequentializing-graph\\\");\\n\\n\\n\\n let sequential_code = IrBuilder::new(!args.dont_inline_constants).translate(graph);\\n\\n\\n\\n let elapsed = event.finish();\\n\\n tracing::debug!(\\\"finished sequentializing graph in {:#?}\\\", elapsed);\\n\\n\\n\\n sequential_code\\n\\n };\\n\\n\\n\\n // Pretty print the IR\\n\",\n \"file_path\": \"src/driver.rs\",\n \"rank\": 31,\n \"score\": 183574.9453174238\n },\n {\n \"content\": \"pub trait Set<K> {\\n\\n fn contains(&self, value: &K) -> bool;\\n\\n\\n\\n fn is_empty(&self) -> bool;\\n\\n}\\n\\n\\n\\nimpl<K> Set<K> for HashSet<K>\\n\\nwhere\\n\\n K: Eq + Hash,\\n\\n{\\n\\n #[inline]\\n\\n fn contains(&self, value: &K) -> bool {\\n\\n HashSet::contains(self, value)\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn is_empty(&self) -> bool {\\n\\n HashSet::is_empty(self)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 32,\n \"score\": 183255.43386034472\n },\n {\n \"content\": \"pub trait OptionExt<T> {\\n\\n fn inspect<F>(self, inspect: F) -> Self\\n\\n where\\n\\n F: FnOnce(&T);\\n\\n}\\n\\n\\n\\nimpl<T> OptionExt<T> for Option<T> {\\n\\n fn inspect<F>(self, inspect: F) -> Self\\n\\n where\\n\\n F: FnOnce(&T),\\n\\n {\\n\\n if let Some(value) = &self {\\n\\n inspect(value);\\n\\n }\\n\\n\\n\\n self\\n\\n }\\n\\n}\\n\\n\\n\\npub(crate) fn set_logger() {\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 33,\n \"score\": 179338.67265274315\n },\n {\n \"content\": \"#[tracing::instrument(skip_all)]\\n\\npub fn run_opt_passes(\\n\\n graph: &mut Rvsdg,\\n\\n iteration_limit: usize,\\n\\n pass_config: &PassConfig,\\n\\n mut stats: Option<&mut HashMap<String, (usize, Duration)>>,\\n\\n) -> usize {\\n\\n let mut passes = passes::default_passes(pass_config);\\n\\n if let Some(stats) = stats.as_mut() {\\n\\n stats.reserve(passes.len());\\n\\n }\\n\\n\\n\\n let (mut pass_num, mut stack, mut visited, mut buffer) = (\\n\\n 1,\\n\\n VecDeque::new(),\\n\\n HashSet::with_hasher(Default::default()),\\n\\n Vec::new(),\\n\\n );\\n\\n\\n\\n loop {\\n\\n let mut changed = false;\\n\",\n \"file_path\": \"src/driver.rs\",\n \"rank\": 34,\n \"score\": 178036.54300647316\n },\n {\n \"content\": \"mod arch;\\n\\nmod iter;\\n\\n\\n\\npub(super) use iter::{IntoIter, Iter};\\n\\n\\n\\nuse crate::passes::dataflow::domain::ByteSet;\\n\\nuse std::{\\n\\n cell::{Cell, RefCell},\\n\\n fmt::{self, Debug},\\n\\n mem::{ManuallyDrop, MaybeUninit},\\n\\n thread,\\n\\n};\\n\\n\\n\\nconst BITS_LEN: usize = 1024;\\n\\nconst MAX_LEN: u32 = u16::MAX as u32 + 1;\\n\\n\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 35,\n \"score\": 164447.75561896755\n },\n {\n \"content\": \"mod tests {\\n\\n use crate::passes::dataflow::domain::bitmap_u16::U16Bitmap;\\n\\n\\n\\n #[test]\\n\\n fn bitmap_as_singleton() {\\n\\n let mut bitmap = U16Bitmap::singleton(10);\\n\\n assert_eq!(bitmap.as_singleton(), Some(10));\\n\\n\\n\\n bitmap.insert(200);\\n\\n assert_eq!(bitmap.as_singleton(), None);\\n\\n\\n\\n bitmap.clear();\\n\\n bitmap.insert(20_000);\\n\\n assert_eq!(bitmap.as_singleton(), Some(20_000));\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn drop_a_bunch() {\\n\\n let mut maps = Vec::new();\\n\\n for _ in 0..100_000 {\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 36,\n \"score\": 164443.502644551\n },\n {\n \"content\": \" fn default() -> Self {\\n\\n Self::empty()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PartialEq for U16Bitmap {\\n\\n fn eq(&self, other: &Self) -> bool {\\n\\n // If the lengths of the two bitmaps aren't equal, their contents\\n\\n // can't possibly be. This allows us to potentially skip on the more\\n\\n // expensive equality check if both bitmaps already know their\\n\\n // lengths\\n\\n let equal_lengths = self\\n\\n .raw_len()\\n\\n .zip(other.raw_len())\\n\\n .map_or(true, |(lhs, rhs)| lhs == rhs);\\n\\n\\n\\n equal_lengths && arch::bitmap_eq(self.as_array(), other.as_array())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 37,\n \"score\": 164440.60173025922\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub(crate) fn intersects_bytes(&self, other: ByteSet) -> bool {\\n\\n let lhs = ByteSet::from_ref((&self.bits[..ByteSet::LEN]).try_into().unwrap());\\n\\n lhs.intersects(other)\\n\\n }\\n\\n\\n\\n pub fn is_disjoint(&self, other: &Self) -> bool {\\n\\n arch::is_disjoint(self.as_array(), other.as_array())\\n\\n }\\n\\n\\n\\n pub fn is_subset(&self, other: &Self) -> bool {\\n\\n arch::is_subset(self.as_array(), other.as_array())\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn as_array(&self) -> &BitArray {\\n\\n &*self.bits\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 38,\n \"score\": 164439.0721977406\n },\n {\n \"content\": \"impl Eq for U16Bitmap {}\\n\\n\\n\\nimpl Debug for U16Bitmap {\\n\\n fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {\\n\\n f.debug_set().entries(self.iter()).finish()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Clone for U16Bitmap {\\n\\n fn clone(&self) -> Self {\\n\\n let mut bits = uninit_bit_box();\\n\\n MaybeUninit::write_slice(&mut *bits, self.as_array());\\n\\n\\n\\n let clone = Self {\\n\\n // Safety: We've initialized the bits\\n\\n bits: unsafe { assume_bit_box_init(bits) },\\n\\n length: self.length.clone(),\\n\\n };\\n\\n debug_assert_eq!(self, &clone);\\n\\n\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 39,\n \"score\": 164438.869310791\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub(super) fn intersect_bytes(&mut self, rhs: &ByteSet) -> bool {\\n\\n let array_ref = (&mut self.bits[..ByteSet::LEN]).try_into().unwrap();\\n\\n let lhs = ByteSet::from_mut(array_ref);\\n\\n lhs.intersect(rhs)\\n\\n }\\n\\n\\n\\n pub(super) fn intersect_bytes_new(&self, rhs: &ByteSet) -> Self {\\n\\n let mut lhs = self.clone();\\n\\n lhs.intersect_bytes(rhs);\\n\\n lhs\\n\\n }\\n\\n\\n\\n pub fn intersects(&self, other: &Self) -> bool {\\n\\n if self.shallow_empty() || other.shallow_empty() {\\n\\n false\\n\\n } else {\\n\\n arch::intersects(self.as_array(), other.as_array())\\n\\n }\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 40,\n \"score\": 164437.34038437047\n },\n {\n \"content\": \"\\n\\n pub(super) fn union_bytes(&mut self, rhs: ByteSet) -> bool {\\n\\n let array_ref = (&mut self.bits[..ByteSet::LEN]).try_into().unwrap();\\n\\n let lhs = ByteSet::from_mut(array_ref);\\n\\n lhs.union(rhs)\\n\\n }\\n\\n\\n\\n pub fn intersect(&mut self, other: &Self) {\\n\\n if self.shallow_empty() {\\n\\n // Do nothing, we're already empty and an intersection between anything\\n\\n // and an empty set is nothing\\n\\n } else if other.shallow_empty() {\\n\\n self.clear();\\n\\n } else {\\n\\n self.length.set(None);\\n\\n arch::intersect(self.as_mut_array(), other.as_array());\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn intersect_into(&self, other: &Self, output: &mut Self) {\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 41,\n \"score\": 164435.79731008445\n },\n {\n \"content\": \" ///\\n\\n pub fn union_into(&self, other: &Self, output: &mut Self) -> bool {\\n\\n output.length.set(None);\\n\\n arch::union_into(self.as_array(), other.as_array(), output.as_mut_array())\\n\\n }\\n\\n\\n\\n /// Creates a new [`U16Bitmap`] with the set of all integers contained\\n\\n /// in `self`, `other` or both `self` and `other\\n\\n ///\\n\\n /// Computes `self ∪ other`, returning the result.\\n\\n ///\\n\\n pub fn union_new(&self, other: &Self) -> Self {\\n\\n let mut uninit = uninit_bit_box();\\n\\n arch::union_into_uninit(self.as_array(), other.as_array(), &mut *uninit);\\n\\n\\n\\n Self {\\n\\n bits: unsafe { assume_bit_box_init(uninit) },\\n\\n length: Cell::new(None),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 42,\n \"score\": 164435.44871149998\n },\n {\n \"content\": \"\\n\\n pub fn full() -> Self {\\n\\n let mut bits = uninit_bit_box();\\n\\n arch::set_uninit_bits_one(&mut bits);\\n\\n\\n\\n Self {\\n\\n // Safety: All bits have been initialized\\n\\n bits: unsafe { assume_bit_box_init(bits) },\\n\\n length: Cell::new(Some(MAX_LEN)),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn singleton(value: u16) -> Self {\\n\\n let mut this = Self::empty();\\n\\n this.insert(value);\\n\\n this\\n\\n }\\n\\n\\n\\n pub fn is_empty(&self) -> bool {\\n\\n match self.raw_len() {\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 43,\n \"score\": 164431.5170675487\n },\n {\n \"content\": \" clone\\n\\n }\\n\\n\\n\\n fn clone_from(&mut self, other: &Self) {\\n\\n self.as_mut_array().copy_from_slice(other.as_array());\\n\\n self.length = other.length.clone();\\n\\n debug_assert_eq!(self, other);\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Drop for U16Bitmap {\\n\\n fn drop(&mut self) {\\n\\n // If the thread is panicking we just want to deallocate the box\\n\\n if thread::panicking() {\\n\\n // Safety: The box's contents will never be touched again\\n\\n unsafe { ManuallyDrop::drop(&mut self.bits) };\\n\\n\\n\\n // Otherwise we want to keep the allocation around for reuse\\n\\n } else {\\n\\n // Safety: The bits of this bitmap won't be touched again\\n\\n let bits = unsafe { ManuallyDrop::take(&mut self.bits) };\\n\\n BITMAP_CACHE.with_borrow_mut(|cache| cache.push(bits));\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 44,\n \"score\": 164431.28356440808\n },\n {\n \"content\": \" #[inline]\\n\\n fn shallow_not_full(&self) -> bool {\\n\\n matches!(self.raw_len(), Some(len) if len != MAX_LEN)\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn raw_len(&self) -> Option<u32> {\\n\\n self.length.get()\\n\\n }\\n\\n\\n\\n pub(super) fn iter(&self) -> Iter<'_> {\\n\\n Iter::new(self)\\n\\n }\\n\\n\\n\\n pub(super) fn into_iter(self) -> IntoIter {\\n\\n IntoIter::new(self)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Default for U16Bitmap {\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 45,\n \"score\": 164430.28012297882\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn clear(&mut self) {\\n\\n if self.shallow_not_empty() {\\n\\n self.length.set(Some(0));\\n\\n arch::set_bits_zero(self.as_mut_array());\\n\\n }\\n\\n }\\n\\n\\n\\n /// Fills `self` with the set of all integers contained\\n\\n /// in `self`, `other` or both `self` and `other\\n\\n ///\\n\\n /// Computes `self ∪ other`, storing the result in `self` and returning\\n\\n /// a boolean as to whether or not `self` has changed any\\n\\n ///\\n\\n pub fn union(&mut self, other: &Self) -> bool {\\n\\n // If both sets are empty, their union is empty\\n\\n if self.shallow_empty() && other.shallow_empty() {\\n\\n false\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 46,\n \"score\": 164429.81372302654\n },\n {\n \"content\": \" let len = arch::popcount(self.as_array());\\n\\n self.length.set(Some(len));\\n\\n len\\n\\n });\\n\\n\\n\\n length as usize\\n\\n }\\n\\n\\n\\n pub fn contains(&self, value: u16) -> bool {\\n\\n let (index, offset) = (key(value), bit(value));\\n\\n debug_assert!(index < BITS_LEN);\\n\\n\\n\\n let lane = unsafe { *self.bits.get_unchecked(index) };\\n\\n lane & (1 << offset) != 0\\n\\n }\\n\\n\\n\\n pub fn insert(&mut self, value: u16) -> bool {\\n\\n let (index, offset) = (key(value), bit(value));\\n\\n debug_assert!(index < BITS_LEN);\\n\\n\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 47,\n \"score\": 164427.26187258787\n },\n {\n \"content\": \" if self.shallow_empty() || other.shallow_empty() {\\n\\n output.clear();\\n\\n } else {\\n\\n output.length.set(None);\\n\\n arch::intersect_into(self.as_array(), other.as_array(), output.as_mut_array())\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn intersect_new(&self, other: &Self) -> Self {\\n\\n if self.shallow_empty() || other.shallow_empty() {\\n\\n Self::empty()\\n\\n } else {\\n\\n let mut uninit = uninit_bit_box();\\n\\n arch::intersect_into_uninit(self.as_array(), other.as_array(), &mut *uninit);\\n\\n\\n\\n Self {\\n\\n bits: unsafe { assume_bit_box_init(uninit) },\\n\\n length: Cell::new(None),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 48,\n \"score\": 164427.12607931378\n },\n {\n \"content\": \" assert_eq!(full, full);\\n\\n assert_eq!(empty, empty);\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn union() {\\n\\n let mut empty = U16Bitmap::empty();\\n\\n let full = U16Bitmap::full();\\n\\n\\n\\n assert_eq!(empty.union_new(&full), full);\\n\\n\\n\\n let mut half: U16Bitmap = (0..=u16::MAX).step_by(2).collect();\\n\\n assert_eq!(half.union_new(&empty), half);\\n\\n assert_eq!(half.union_new(&half), half);\\n\\n\\n\\n assert!(!half.union(&empty));\\n\\n assert!(empty.union(&half));\\n\\n assert_eq!(empty, half);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 49,\n \"score\": 164424.53893782536\n },\n {\n \"content\": \" maps.push(U16Bitmap::empty());\\n\\n }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn equality() {\\n\\n let mut empty = U16Bitmap::empty();\\n\\n let full = U16Bitmap::full();\\n\\n\\n\\n assert_ne!(empty, full);\\n\\n\\n\\n // Force an actual equality check instead of just checking\\n\\n // for length equality\\n\\n full.length.set(None);\\n\\n assert_ne!(empty, full);\\n\\n\\n\\n empty.insert(10000);\\n\\n empty.insert(u16::MAX);\\n\\n assert_ne!(empty, full);\\n\\n\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 50,\n \"score\": 164424.27718669293\n },\n {\n \"content\": \" let target = unsafe { self.bits.get_unchecked_mut(index) };\\n\\n let old = *target;\\n\\n *target |= 1 << offset;\\n\\n\\n\\n let was_inserted = *target != old;\\n\\n if was_inserted {\\n\\n self.length.update(|length| length.map(|length| length + 1));\\n\\n }\\n\\n\\n\\n was_inserted\\n\\n }\\n\\n\\n\\n pub fn remove(&mut self, value: u16) -> bool {\\n\\n let (index, offset) = (key(value), bit(value));\\n\\n debug_assert!(index < BITS_LEN);\\n\\n\\n\\n let target = unsafe { self.bits.get_unchecked_mut(index) };\\n\\n let old = *target;\\n\\n *target &= !(1 << offset);\\n\\n\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 51,\n \"score\": 164423.72802093343\n },\n {\n \"content\": \"\\n\\n // If self is empty and other isn't, copy the bits of other into self\\n\\n } else if self.shallow_empty() && other.shallow_not_empty() {\\n\\n self.length.set(other.raw_len());\\n\\n self.bits.copy_from_slice(&**other.bits);\\n\\n true\\n\\n\\n\\n // Otherwise calculate the union\\n\\n } else {\\n\\n self.length.set(None);\\n\\n arch::union(self.as_mut_array(), other.as_array())\\n\\n }\\n\\n }\\n\\n\\n\\n /// Fills `output` with the set of all integers contained\\n\\n /// in `self`, `other` or both `self` and `other\\n\\n ///\\n\\n /// Computes `self ∪ other`, storing the result in `output` and returning\\n\\n /// a boolean as to whether or not `output` has changed any in comparison\\n\\n /// to `self` (that is, this function returns `true` if `output != self`)\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 52,\n \"score\": 164422.07392504695\n },\n {\n \"content\": \" let was_removed = *target != old;\\n\\n if was_removed {\\n\\n self.length.update(|length| length.map(|length| length - 1));\\n\\n }\\n\\n\\n\\n was_removed\\n\\n }\\n\\n\\n\\n pub fn as_singleton(&self) -> Option<u16> {\\n\\n if self.len() != 1 {\\n\\n None\\n\\n } else {\\n\\n self.iter().next()\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn fill(&mut self) {\\n\\n if self.shallow_not_full() {\\n\\n self.length.set(Some(MAX_LEN));\\n\\n arch::set_bits_one(self.as_mut_array());\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 53,\n \"score\": 164421.96184387998\n },\n {\n \"content\": \" // len ≡ 0\\n\\n Some(0) => true,\\n\\n\\n\\n // len ≠ 0\\n\\n Some(_) => false,\\n\\n\\n\\n // len unknown\\n\\n None => {\\n\\n let is_empty = arch::all_bits_are_unset(self.as_array());\\n\\n if is_empty {\\n\\n self.length.set(Some(0));\\n\\n }\\n\\n\\n\\n is_empty\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn is_full(&self) -> bool {\\n\\n match self.raw_len() {\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 54,\n \"score\": 164421.65939916813\n },\n {\n \"content\": \" #[inline]\\n\\n fn as_mut_array(&mut self) -> &mut BitArray {\\n\\n &mut *self.bits\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn shallow_empty(&self) -> bool {\\n\\n matches!(self.raw_len(), Some(0))\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn shallow_not_empty(&self) -> bool {\\n\\n matches!(self.raw_len(), Some(len) if len != 0)\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn shallow_full(&self) -> bool {\\n\\n matches!(self.raw_len(), Some(len) if len == MAX_LEN)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 55,\n \"score\": 164418.39222195558\n },\n {\n \"content\": \" // len ≡ MAX_LEN\\n\\n Some(len) if len == MAX_LEN => true,\\n\\n\\n\\n // len ≠ MAX_LEN\\n\\n Some(_) => false,\\n\\n\\n\\n // len unknown\\n\\n None => {\\n\\n let is_full = arch::all_bits_are_set(self.as_array());\\n\\n if is_full {\\n\\n self.length.set(Some(MAX_LEN));\\n\\n }\\n\\n\\n\\n is_full\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn len(&self) -> usize {\\n\\n let length = self.raw_len().unwrap_or_else(|| {\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 56,\n \"score\": 164416.71887236778\n },\n {\n \"content\": \"#[tracing::instrument(skip(source))]\\n\\npub fn parse_source(file: &Path, source: &str) -> Box<[Token]> {\\n\\n let file = file.display();\\n\\n\\n\\n tracing::info!(source_len = source.len(), \\\"started parsing '{}'\\\", file);\\n\\n let event = PerfEvent::new(\\\"parsing\\\");\\n\\n\\n\\n // Parse the program's source code into tokens\\n\\n let Parsed {\\n\\n tokens,\\n\\n source_len,\\n\\n total_tokens,\\n\\n deepest_nesting,\\n\\n } = parse::parse(source);\\n\\n\\n\\n let elapsed = event.finish();\\n\\n tracing::info!(\\n\\n source_len,\\n\\n total_tokens,\\n\\n deepest_nesting,\\n\\n \\\"finished parsing '{}' in {:#?}\\\",\\n\\n file,\\n\\n elapsed,\\n\\n );\\n\\n\\n\\n tokens\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/driver.rs\",\n \"rank\": 57,\n \"score\": 164313.20330518874\n },\n {\n \"content\": \"struct ExpressionPuller<'a> {\\n\\n graph: &'a mut Rvsdg,\\n\\n body: &'a mut Rvsdg,\\n\\n removals: BTreeSet<NodeId>,\\n\\n params: Vec<(OutputPort, NodeId)>,\\n\\n constants: HashMap<OutputPort, Const>,\\n\\n invariant_exprs: VecDeque<OutputPort>,\\n\\n input_pairs: HashMap<OutputPort, OutputPort>,\\n\\n param_to_new: HashMap<OutputPort, OutputPort>,\\n\\n}\\n\\n\\n\\nimpl<'a> ExpressionPuller<'a> {\\n\\n fn new(\\n\\n graph: &'a mut Rvsdg,\\n\\n body: &'a mut Rvsdg,\\n\\n invariant_inputs: &[(OutputPort, OutputPort)],\\n\\n invariant_exprs: VecDeque<OutputPort>,\\n\\n input_pairs: HashMap<OutputPort, OutputPort>,\\n\\n ) -> Self {\\n\\n // TODO: Buffers\\n\",\n \"file_path\": \"src/passes/licm.rs\",\n \"rank\": 58,\n \"score\": 158823.68461825632\n },\n {\n \"content\": \"/// Creates an [`IrBuilder`] for gamma branches\\n\\nfn gamma_branch_builder(inline_constants: bool) -> IrBuilder {\\n\\n IrBuilder {\\n\\n values: BTreeMap::new(),\\n\\n instructions: Vec::new(),\\n\\n evaluated: BTreeSet::new(),\\n\\n evaluation_stack: Vec::new(),\\n\\n top_level: false,\\n\\n inline_constants,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/ir/builder.rs\",\n \"rank\": 59,\n \"score\": 157711.4702059238\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct OutmostTheta {\\n\\n inner_gamma_id: NodeId,\\n\\n src_ptr: OutputPort,\\n\\n temp0_ptr: OutputPort,\\n\\n temp1_ptr: OutputPort,\\n\\n}\\n\\n\\n\\nimpl OutmostTheta {\\n\\n const fn new(\\n\\n inner_gamma_id: NodeId,\\n\\n src_ptr: OutputPort,\\n\\n temp0_ptr: OutputPort,\\n\\n temp1_ptr: OutputPort,\\n\\n ) -> Self {\\n\\n Self {\\n\\n inner_gamma_id,\\n\\n src_ptr,\\n\\n temp0_ptr,\\n\\n temp1_ptr,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/passes/square_cell.rs\",\n \"rank\": 60,\n \"score\": 157633.83408170496\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nstruct InnerGamma {\\n\\n inner_theta_id: NodeId,\\n\\n}\\n\\n\\n\\nimpl InnerGamma {\\n\\n const fn new(inner_theta_id: NodeId) -> Self {\\n\\n Self { inner_theta_id }\\n\\n }\\n\\n}\\n\\n\\n\\ntest_opts! {\\n\\n square_input,\\n\\n passes = |tape_len| bvec![SquareCell::new(tape_len)],\\n\\n input = [10],\\n\\n output = [100],\\n\\n |graph, effect, tape_len| {\\n\\n let source = include_str!(concat!(env!(\\\"CARGO_MANIFEST_DIR\\\"), \\\"/examples/square.bf\\\"));\\n\\n\\n\\n let ptr = graph.int(Ptr::new(0, tape_len));\\n\\n let (_ptr, effect) = compile_brainfuck_into(source, graph, ptr.value(), effect);\\n\\n effect\\n\\n },\\n\\n}\\n\",\n \"file_path\": \"src/passes/square_cell.rs\",\n \"rank\": 61,\n \"score\": 157573.73516726206\n },\n {\n \"content\": \"/// Builds an input parameter for a gamma branch\\n\\nfn gamma_input_param(\\n\\n block: &mut Block,\\n\\n builder: &mut IrBuilder,\\n\\n graph: &Rvsdg,\\n\\n input_values: &BTreeMap<InputPort, Value>,\\n\\n input: InputPort,\\n\\n param: NodeId,\\n\\n branch: &str,\\n\\n) {\\n\\n let input_param = graph.to_node::<InputParam>(param);\\n\\n let input_id = VarId::new(input_param.output());\\n\\n\\n\\n let value = input_values.get(&input).cloned().unwrap_or(Value::Missing);\\n\\n block.push(Assign::input(input_id, value, Variance::None).into());\\n\\n\\n\\n if value.is_missing() {\\n\\n tracing::warn!(\\n\\n \\\"missing input value for gamma {} branch input {:?}: {:?}\\\",\\n\\n branch,\\n\\n input,\\n\\n input_param,\\n\\n );\\n\\n }\\n\\n\\n\\n builder\\n\\n .values\\n\\n .insert(input_param.output(), input_id.into())\\n\\n .debug_unwrap_none();\\n\\n}\\n\",\n \"file_path\": \"src/ir/builder.rs\",\n \"rank\": 62,\n \"score\": 157136.866574627\n },\n {\n \"content\": \"#[cold]\\n\\n#[track_caller]\\n\\n#[inline(never)]\\n\\nfn panic_none_with_message(value: &dyn Debug, message: &str) -> ! {\\n\\n panic!(\\n\\n \\\"unwrapped {:?} when `None` was expected: {}\\\",\\n\\n value, message\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 63,\n \"score\": 154608.69359776456\n },\n {\n \"content\": \"pub fn percent_total(total: usize, subset: usize) -> f64 {\\n\\n let diff = (subset as f64 * 100.0) / total as f64;\\n\\n\\n\\n if diff.is_nan() || diff == -0.0 {\\n\\n 0.0\\n\\n } else {\\n\\n diff\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 64,\n \"score\": 151311.8869069935\n },\n {\n \"content\": \"pub fn hex_encode<T: AsRef<[u8]>>(data: T) -> String {\\n\\n const HEX_CHARACTERS: [u8; 16] = *b\\\"0123456789abcdef\\\";\\n\\n\\n\\n let data = data.as_ref();\\n\\n\\n\\n let mut output = String::with_capacity(data.len() * 2);\\n\\n for &byte in data {\\n\\n output.push(HEX_CHARACTERS[(byte >> 4) as usize] as char);\\n\\n output.push(HEX_CHARACTERS[(byte & 0xF) as usize] as char);\\n\\n }\\n\\n\\n\\n output\\n\\n}\\n\\n\\n\\npub(crate) enum DebugCollapse<T> {\\n\\n Single(T),\\n\\n Many(T, usize, usize),\\n\\n}\\n\\n\\n\\nimpl<T> Debug for DebugCollapse<T>\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 65,\n \"score\": 146301.8227448228\n },\n {\n \"content\": \"type BitArray = [u64; BITS_LEN];\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 66,\n \"score\": 143994.2652770764\n },\n {\n \"content\": \"pub trait Pretty {\\n\\n fn pretty_print(&self, config: PrettyConfig) -> String {\\n\\n let construction_start = Instant::now();\\n\\n\\n\\n let arena = Arena::<()>::new();\\n\\n let pretty = self.pretty(&arena, config);\\n\\n\\n\\n if STATIC_MAX_LEVEL >= LevelFilter::DEBUG && config.duration_logging {\\n\\n let elapsed = construction_start.elapsed();\\n\\n tracing::debug!(\\n\\n target: \\\"timings\\\",\\n\\n \\\"took {:#?} to construct pretty printed ir\\\",\\n\\n elapsed,\\n\\n );\\n\\n }\\n\\n\\n\\n let format_start = Instant::now();\\n\\n\\n\\n let mut output = String::with_capacity(4096);\\n\\n write!(output, \\\"{}\\\", pretty.1.pretty(RENDER_WIDTH))\\n\",\n \"file_path\": \"src/ir/pretty_print.rs\",\n \"rank\": 67,\n \"score\": 140512.48940950018\n },\n {\n \"content\": \"fn from_utf8_lossy_buffered<'a>(buffer: &'a mut String, bytes: &'a [u8]) -> &'a str {\\n\\n let mut iter = Utf8Lossy::from_bytes(bytes).chunks();\\n\\n\\n\\n let first_valid = if let Some(chunk) = iter.next() {\\n\\n let Utf8LossyChunk { valid, broken } = chunk;\\n\\n if broken.is_empty() {\\n\\n debug_assert_eq!(valid.len(), bytes.len());\\n\\n return valid;\\n\\n }\\n\\n valid\\n\\n } else {\\n\\n return \\\"\\\";\\n\\n };\\n\\n\\n\\n const REPLACEMENT: &str = \\\"\\\\u{FFFD}\\\";\\n\\n\\n\\n buffer.clear();\\n\\n buffer.reserve(bytes.len());\\n\\n buffer.push_str(first_valid);\\n\\n buffer.push_str(REPLACEMENT);\\n\",\n \"file_path\": \"src/jit/ffi.rs\",\n \"rank\": 68,\n \"score\": 139521.89684738676\n },\n {\n \"content\": \"pub fn lower_tokens(\\n\\n graph: &mut Rvsdg,\\n\\n mut ptr: OutputPort,\\n\\n mut effect: OutputPort,\\n\\n tokens: &[Token],\\n\\n) -> (OutputPort, OutputPort) {\\n\\n // FIXME: Byte node\\n\\n let (zero, one) = (graph.byte(0).value(), graph.byte(1).value());\\n\\n\\n\\n for token in tokens {\\n\\n match token {\\n\\n Token::IncPtr => ptr = graph.add(ptr, one).value(),\\n\\n Token::DecPtr => ptr = graph.sub(ptr, one).value(),\\n\\n\\n\\n Token::Inc => {\\n\\n // Load the pointed-to cell's current value\\n\\n let load = graph.load(ptr, effect);\\n\\n effect = load.output_effect();\\n\\n\\n\\n // Increment the loaded cell's value\\n\",\n \"file_path\": \"src/lower_tokens.rs\",\n \"rank\": 69,\n \"score\": 137408.56094493048\n },\n {\n \"content\": \"type BitBox = ManuallyDrop<Box<BitArray>>;\\n\\n\\n\\nthread_local! {\\n\\n // FIXME: https://github.com/rust-lang/rust-clippy/issues/8493\\n\\n #[allow(clippy::declare_interior_mutable_const)]\\n\\n static BITMAP_CACHE: RefCell<Vec<Box<BitArray>>> = const { RefCell::new(Vec::new()) };\\n\\n}\\n\\n\\n\\npub struct U16Bitmap {\\n\\n bits: BitBox,\\n\\n length: Cell<Option<u32>>,\\n\\n}\\n\\n\\n\\nimpl U16Bitmap {\\n\\n pub fn empty() -> Self {\\n\\n Self {\\n\\n bits: zeroed_bit_box(),\\n\\n length: Cell::new(Some(0)),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/passes/dataflow/domain/bitmap_u16/mod.rs\",\n \"rank\": 70,\n \"score\": 137179.7309835569\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl Scan {\\n\\n #[must_use]\\n\\n #[allow(clippy::too_many_arguments)]\\n\\n pub(in crate::graph) const fn new(\\n\\n node: NodeId,\\n\\n direction: ScanDirection,\\n\\n ptr: InputPort,\\n\\n step: InputPort,\\n\\n needle: InputPort,\\n\\n output_ptr: OutputPort,\\n\\n input_effect: InputPort,\\n\\n output_effect: OutputPort,\\n\\n ) -> Self {\\n\\n Self {\\n\\n node,\\n\\n direction,\\n\\n ptr,\\n\\n step,\\n\",\n \"file_path\": \"src/graph/nodes/scan.rs\",\n \"rank\": 71,\n \"score\": 136715.38981800413\n },\n {\n \"content\": \"use crate::graph::{\\n\\n nodes::node_ext::{InputPortKinds, InputPorts, OutputPortKinds, OutputPorts},\\n\\n EdgeCount, EdgeDescriptor, EdgeKind, InputPort, NodeExt, NodeId, OutputPort,\\n\\n};\\n\\nuse tinyvec::tiny_vec;\\n\\n\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\\n\\npub struct Scan {\\n\\n /// The id of the scan node\\n\\n node: NodeId,\\n\\n\\n\\n /// The direction the scan goes in, forwards or backwards\\n\\n direction: ScanDirection,\\n\\n\\n\\n /// The pointer to start scanning at\\n\\n ptr: InputPort,\\n\\n\\n\\n /// The distance the scan steps by\\n\\n step: InputPort,\\n\\n\\n\",\n \"file_path\": \"src/graph/nodes/scan.rs\",\n \"rank\": 72,\n \"score\": 136715.17958120824\n },\n {\n \"content\": \" self.output_ptr = to;\\n\\n }\\n\\n\\n\\n if self.output_effect == from {\\n\\n self.output_effect = to;\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]\\n\\npub enum ScanDirection {\\n\\n Forward,\\n\\n Backward,\\n\\n}\\n\\n\\n\\nimpl ScanDirection {\\n\\n /// Returns `true` if the scan direction is [`Forward`].\\n\\n ///\\n\\n /// [`Forward`]: ScanDirection::Forward\\n\\n #[must_use]\\n\",\n \"file_path\": \"src/graph/nodes/scan.rs\",\n \"rank\": 73,\n \"score\": 136701.72831719552\n },\n {\n \"content\": \" }\\n\\n\\n\\n /// Get the scan's output pointer\\n\\n pub const fn output_ptr(&self) -> OutputPort {\\n\\n self.output_ptr\\n\\n }\\n\\n\\n\\n /// Get the scan's needle\\n\\n pub const fn needle(&self) -> InputPort {\\n\\n self.needle\\n\\n }\\n\\n\\n\\n /// Get the scan's input effect\\n\\n pub const fn input_effect(&self) -> InputPort {\\n\\n self.input_effect\\n\\n }\\n\\n\\n\\n /// Get the scan's output effect\\n\\n pub const fn output_effect(&self) -> OutputPort {\\n\\n self.output_effect\\n\",\n \"file_path\": \"src/graph/nodes/scan.rs\",\n \"rank\": 74,\n \"score\": 136692.8794153726\n },\n {\n \"content\": \" needle,\\n\\n output_ptr,\\n\\n input_effect,\\n\\n output_effect,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Get the scan's direction\\n\\n pub const fn direction(&self) -> ScanDirection {\\n\\n self.direction\\n\\n }\\n\\n\\n\\n /// Get the scan's pointer\\n\\n pub const fn ptr(&self) -> InputPort {\\n\\n self.ptr\\n\\n }\\n\\n\\n\\n /// Get the scan's step\\n\\n pub const fn step(&self) -> InputPort {\\n\\n self.step\\n\",\n \"file_path\": \"src/graph/nodes/scan.rs\",\n \"rank\": 75,\n \"score\": 136692.21420624747\n },\n {\n \"content\": \" pub const fn is_forward(&self) -> bool {\\n\\n matches!(self, Self::Forward)\\n\\n }\\n\\n\\n\\n /// Returns `true` if the scan direction is [`Backward`].\\n\\n ///\\n\\n /// [`Backward`]: ScanDirection::Backward\\n\\n #[must_use]\\n\\n pub const fn is_backward(&self) -> bool {\\n\\n matches!(self, Self::Backward)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/graph/nodes/scan.rs\",\n \"rank\": 76,\n \"score\": 136690.5949803368\n },\n {\n \"content\": \" /// The byte values being scanned for\\n\\n needle: InputPort,\\n\\n\\n\\n /// A pointer to a cell containing one of the requested needles,\\n\\n /// effectively `ptr ± offset` where `offset` is the offset to a cell\\n\\n /// with one of the requested needles and `ptr` is `self.ptr`.\\n\\n ///\\n\\n /// The relative offset can be either positive or negative (that is,\\n\\n /// the output pointer can be greater or less than the input pointer)\\n\\n /// no matter the scan direction because of the wrapping semantics of\\n\\n /// the program tape.\\n\\n ///\\n\\n /// Loops infinitely if no cells with the proper needle value can be found\\n\\n output_ptr: OutputPort,\\n\\n\\n\\n /// Input effect stream\\n\\n input_effect: InputPort,\\n\\n\\n\\n /// Output effect stream\\n\\n output_effect: OutputPort,\\n\",\n \"file_path\": \"src/graph/nodes/scan.rs\",\n \"rank\": 77,\n \"score\": 136688.5787304865\n },\n {\n \"content\": \" }\\n\\n}\\n\\n\\n\\nimpl NodeExt for Scan {\\n\\n fn node(&self) -> NodeId {\\n\\n self.node\\n\\n }\\n\\n\\n\\n fn input_desc(&self) -> EdgeDescriptor {\\n\\n EdgeDescriptor::new(EdgeCount::one(), EdgeCount::exact(3))\\n\\n }\\n\\n\\n\\n fn all_input_ports(&self) -> InputPorts {\\n\\n tiny_vec![self.ptr, self.step, self.needle, self.input_effect]\\n\\n }\\n\\n\\n\\n fn all_input_port_kinds(&self) -> InputPortKinds {\\n\\n tiny_vec![[_; 4] =>\\n\\n (self.ptr, EdgeKind::Value),\\n\\n (self.step, EdgeKind::Value),\\n\",\n \"file_path\": \"src/graph/nodes/scan.rs\",\n \"rank\": 78,\n \"score\": 136687.97060593715\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n fn output_desc(&self) -> EdgeDescriptor {\\n\\n EdgeDescriptor::new(EdgeCount::one(), EdgeCount::one())\\n\\n }\\n\\n\\n\\n fn all_output_ports(&self) -> OutputPorts {\\n\\n tiny_vec![self.output_ptr, self.output_effect]\\n\\n }\\n\\n\\n\\n fn all_output_port_kinds(&self) -> OutputPortKinds {\\n\\n tiny_vec![[_; 4] =>\\n\\n (self.output_ptr, EdgeKind::Value),\\n\\n (self.output_effect, EdgeKind::Effect),\\n\\n ]\\n\\n }\\n\\n\\n\\n fn update_output(&mut self, from: OutputPort, to: OutputPort) {\\n\\n if self.output_ptr == from {\\n\",\n \"file_path\": \"src/graph/nodes/scan.rs\",\n \"rank\": 79,\n \"score\": 136675.659620963\n },\n {\n \"content\": \" (self.needle, EdgeKind::Value),\\n\\n (self.input_effect, EdgeKind::Effect),\\n\\n ]\\n\\n }\\n\\n\\n\\n fn update_input(&mut self, from: InputPort, to: InputPort) {\\n\\n if from == self.ptr {\\n\\n self.ptr = to;\\n\\n }\\n\\n\\n\\n if from == self.step {\\n\\n self.step = to;\\n\\n }\\n\\n\\n\\n if from == self.needle {\\n\\n self.needle = to;\\n\\n }\\n\\n\\n\\n if from == self.input_effect {\\n\\n self.input_effect = to;\\n\",\n \"file_path\": \"src/graph/nodes/scan.rs\",\n \"rank\": 80,\n \"score\": 136675.48953392237\n },\n {\n \"content\": \"//! The theta node\\n\\n\\n\\nuse crate::{\\n\\n graph::{\\n\\n nodes::node_ext::{InputPortKinds, InputPorts, OutputPortKinds, OutputPorts},\\n\\n EdgeCount, EdgeDescriptor, EdgeKind, End, InputParam, InputPort, NodeExt, NodeId,\\n\\n OutputParam, OutputPort, Rvsdg, Start, Subgraph,\\n\\n },\\n\\n utils::{AssertNone, HashMap},\\n\\n};\\n\\nuse tinyvec::TinyVec;\\n\\n\\n\\n// TODO: Probably want reverse lookup maps as well as the current forward ones\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub struct Theta {\\n\\n /// The theta's [`NodeId`]\\n\\n node: NodeId,\\n\\n\\n\\n /// Theta nodes don't have to have effects, the inner [`Subgraph`]\\n\\n /// will have them regardless (only from [`Start`] to [`End`] node though).\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 81,\n \"score\": 136645.22180320136\n },\n {\n \"content\": \" tracing::trace!(\\n\\n node = ?parent_node,\\n\\n \\\"tried to replace output effect {:?} of Theta with {:?} but Theta doesn't have that port\\\",\\n\\n from, to,\\n\\n );\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n/// The effects of a theta node\\n\\n#[derive(Debug, Clone, Copy, PartialEq, Eq)]\\n\\npub(in crate::graph) struct ThetaEffects {\\n\\n /// The input effect's port on the theta node\\n\\n input: InputPort,\\n\\n /// The output effect's port on the theta node\\n\\n output: OutputPort,\\n\\n}\\n\\n\\n\\nimpl ThetaEffects {\\n\\n pub const fn new(input: InputPort, output: OutputPort) -> Self {\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 82,\n \"score\": 136639.81126906764\n },\n {\n \"content\": \" /// [`End`]: crate::graph::End\\n\\n subgraph: Box<Subgraph>,\\n\\n}\\n\\n\\n\\nimpl Theta {\\n\\n /// Create a new theta node\\n\\n #[allow(clippy::too_many_arguments)]\\n\\n pub(in crate::graph) fn new(\\n\\n node: NodeId,\\n\\n effects: Option<ThetaEffects>,\\n\\n invariant_inputs: HashMap<InputPort, NodeId>,\\n\\n variant_inputs: HashMap<InputPort, NodeId>,\\n\\n outputs: HashMap<OutputPort, NodeId>,\\n\\n output_feedback: HashMap<OutputPort, InputPort>,\\n\\n condition: NodeId,\\n\\n subgraph: Box<Subgraph>,\\n\\n ) -> Self {\\n\\n if cfg!(debug_assertions) {\\n\\n assert_eq!(variant_inputs.len(), outputs.len());\\n\\n assert_eq!(outputs.len(), output_feedback.len());\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 83,\n \"score\": 136637.3205292428\n },\n {\n \"content\": \" Self { input, output }\\n\\n }\\n\\n\\n\\n #[allow(dead_code)]\\n\\n pub const fn output(&self) -> OutputPort {\\n\\n self.output\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub struct ThetaData {\\n\\n pub(in crate::graph) outputs: Box<[OutputPort]>,\\n\\n pub(in crate::graph) condition: OutputPort,\\n\\n pub(in crate::graph) effect: OutputPort,\\n\\n}\\n\\n\\n\\nimpl ThetaData {\\n\\n pub fn new<O>(outputs: O, condition: OutputPort, effect: OutputPort) -> Self\\n\\n where\\n\\n O: IntoIterator<Item = OutputPort>,\\n\\n {\\n\\n Self {\\n\\n outputs: outputs.into_iter().collect(),\\n\\n condition,\\n\\n effect,\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 84,\n \"score\": 136634.75114642555\n },\n {\n \"content\": \" has_child_thetas\\n\\n }\\n\\n}\\n\\n\\n\\n/// Utility functions\\n\\n// TODO: Function to inline the theta's body into the given graph\\n\\nimpl Theta {\\n\\n pub fn get_output_param(&self, port: OutputPort) -> Option<OutputParam> {\\n\\n self.outputs\\n\\n .get(&port)\\n\\n .map(|&node| self.subgraph.to_node(node))\\n\\n .copied()\\n\\n }\\n\\n\\n\\n /// Returns `true` if the theta's condition is always `false`\\n\\n pub fn is_infinite(&self) -> bool {\\n\\n let cond = self.condition();\\n\\n let condition_is_false = self\\n\\n .body()\\n\\n .input_source_node(cond.input())\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 85,\n \"score\": 136630.0412736898\n },\n {\n \"content\": \" /// Just because a theta node isn't effectful doesn't mean it's useless,\\n\\n /// it can still have data dependencies\\n\\n ///\\n\\n /// [`Start`]: crate::graph::Start\\n\\n /// [`End`]: crate::graph::End\\n\\n effects: Option<ThetaEffects>,\\n\\n\\n\\n /// These are the inputs that go into the loop's body\\n\\n /// but do not change between iterations\\n\\n ///\\n\\n /// These point from an [`InputPort`] on the theta to the [`NodeId`]\\n\\n /// of an [`InputParam`] within the theta's body\\n\\n invariant_inputs: HashMap<InputPort, NodeId>,\\n\\n\\n\\n /// These inputs change upon each iteration, they're connected to `output_back_edges`\\n\\n ///\\n\\n /// These point from an [`InputPort`] on the theta to the [`NodeId`]\\n\\n /// of an [`InputParam`] within the theta's body\\n\\n variant_inputs: HashMap<InputPort, NodeId>,\\n\\n\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 86,\n \"score\": 136627.1646519455\n },\n {\n \"content\": \" /// The node's outputs, these all must be included in `output_back_edges`. Any invariant\\n\\n /// data must go around the loop to reach dependents after it\\n\\n ///\\n\\n /// These point from an [`OutputPort`] on the theta to the [`NodeId`]\\n\\n /// of an [`OutputParam`] within the theta's body\\n\\n outputs: HashMap<OutputPort, NodeId>,\\n\\n\\n\\n /// These are the relationships between outputs and variant inputs\\n\\n ///\\n\\n /// These point from an [`OutputPort`] in `outputs` to an [`InputPort`] in `variant_inputs`\\n\\n output_feedback: HashMap<OutputPort, InputPort>,\\n\\n\\n\\n /// The theta's condition, it should be an expression that evaluates to a boolean\\n\\n ///\\n\\n /// Points to an [`OutputParam`] within the theta's body\\n\\n condition: NodeId,\\n\\n\\n\\n /// The theta's loop body, contains the [`Start`] and [`End`] [`NodeId`]s\\n\\n ///\\n\\n /// [`Start`]: crate::graph::Start\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 87,\n \"score\": 136625.9849243502\n },\n {\n \"content\": \" pub fn output_params(&self) -> impl Iterator<Item = OutputParam> + '_ {\\n\\n self.outputs\\n\\n .iter()\\n\\n .map(|(_, ¶m)| self.subgraph.to_node(param))\\n\\n .copied()\\n\\n }\\n\\n\\n\\n /// Returns the node ids of outputs from the theta node, *not including effect outputs*\\n\\n pub fn output_param_ids(&self) -> impl Iterator<Item = NodeId> + '_ {\\n\\n self.outputs.values().copied()\\n\\n }\\n\\n\\n\\n /// Returns all variant inputs to the theta node along with the output\\n\\n /// that loops back into the given input\\n\\n pub fn variant_inputs_loopback(&self) -> impl Iterator<Item = (InputParam, OutputParam)> + '_ {\\n\\n self.output_feedback.iter().map(|(output, input)| {\\n\\n let (input, output) = (self.variant_inputs[input], self.outputs[output]);\\n\\n (\\n\\n *self.subgraph.to_node(input),\\n\\n *self.subgraph.to_node(output),\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 88,\n \"score\": 136621.31811640895\n },\n {\n \"content\": \" )\\n\\n })\\n\\n }\\n\\n\\n\\n /// Returns `true` if the given [`OutputParam`] feeds back to the given variant [`InputParam`]\\n\\n ///\\n\\n /// Will return `false` if either of the given [`OutputParam`] or [`InputParam`]s don't exist\\n\\n /// within the current [`Theta`] or if the given [`InputParam`] isn't a *variant* input.\\n\\n pub(crate) fn output_feeds_back_to(\\n\\n &self,\\n\\n output: &OutputParam,\\n\\n variant_input: &InputParam,\\n\\n ) -> bool {\\n\\n self.outputs\\n\\n .iter()\\n\\n .find(|(_, &output_id)| output_id == output.node())\\n\\n .and_then(|(output_port, _)| self.output_feedback.get(output_port))\\n\\n .and_then(|input_port| self.variant_inputs.get(input_port))\\n\\n .map_or(false, |&input_node| input_node == variant_input.node())\\n\\n }\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 89,\n \"score\": 136619.47356333592\n },\n {\n \"content\": \"\\n\\n /// Gets the [`InputPort`] of the parent [`Theta`] that feeds into the given variant [`InputParam`]\\n\\n pub fn variant_input_source(&self, variant_input: &InputParam) -> Option<InputPort> {\\n\\n self.variant_inputs\\n\\n .iter()\\n\\n .find(|(_, &input)| input == variant_input.node())\\n\\n .map(|(&input_port, _)| input_port)\\n\\n }\\n\\n\\n\\n pub(crate) fn has_child_thetas(&self) -> bool {\\n\\n let mut has_child_thetas = false;\\n\\n self.body().try_for_each_transitive_node(|_, node| {\\n\\n if node.is_theta() {\\n\\n has_child_thetas = true;\\n\\n false\\n\\n } else {\\n\\n true\\n\\n }\\n\\n });\\n\\n\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 90,\n \"score\": 136618.77244390166\n },\n {\n \"content\": \" self.outputs.remove(&output).debug_unwrap();\\n\\n }\\n\\n\\n\\n /// Returns the number of all inputs (variant and invariant) to the theta node,\\n\\n /// *not including effect inputs*\\n\\n pub fn inputs_len(&self) -> usize {\\n\\n self.invariant_inputs_len() + self.variant_inputs_len()\\n\\n }\\n\\n\\n\\n /// Returns the input ports of all inputs (variant and invariant) to the theta node,\\n\\n /// *not including effect inputs*\\n\\n pub fn input_ports(&self) -> impl Iterator<Item = InputPort> + '_ {\\n\\n self.invariant_input_ports()\\n\\n .chain(self.variant_input_ports())\\n\\n }\\n\\n\\n\\n /// Returns the input ports and the associated input param of all inputs (variant and invariant)\\n\\n /// to the theta node, *not including effect inputs*\\n\\n pub fn input_pairs(&self) -> impl Iterator<Item = (InputPort, InputParam)> + '_ {\\n\\n self.invariant_input_pairs()\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 91,\n \"score\": 136618.65592759947\n },\n {\n \"content\": \" tracing::error!(\\\"tried to set input effect on theta without effect edges\\\");\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn set_output_effect(&mut self, output_effect: OutputPort) {\\n\\n if let Some(effects) = self.effects.as_mut() {\\n\\n effects.output = output_effect;\\n\\n } else {\\n\\n tracing::error!(\\\"tried to set output effect on theta without effect edges\\\");\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn remove_invariant_input(&mut self, input: InputPort) {\\n\\n self.invariant_inputs.remove(&input);\\n\\n }\\n\\n\\n\\n pub fn add_invariant_input_raw(&mut self, input: InputPort, param: NodeId) {\\n\\n debug_assert!(self.body().contains_node(param));\\n\\n debug_assert!(self.body().get_node(param).is_input_param());\\n\\n\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 92,\n \"score\": 136618.21390916433\n },\n {\n \"content\": \" subgraph,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Get the [`NodeId`] of the theta node's condition\\n\\n ///\\n\\n /// Should be an [`OutputParam`] in the theta's body\\n\\n pub const fn condition_id(&self) -> NodeId {\\n\\n self.condition\\n\\n }\\n\\n\\n\\n /// Get the [`OutputParam`] of the theta's condition from within its body\\n\\n pub fn condition(&self) -> OutputParam {\\n\\n *self.subgraph.to_node(self.condition)\\n\\n }\\n\\n\\n\\n /// Get the [`Start`] of the theta's body\\n\\n pub fn start_node(&self) -> Start {\\n\\n self.subgraph.start_node()\\n\\n }\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 93,\n \"score\": 136617.8459959413\n },\n {\n \"content\": \"\\n\\n /// Get the [`End`] of the theta's body\\n\\n pub fn end_node(&self) -> End {\\n\\n self.subgraph.end_node()\\n\\n }\\n\\n\\n\\n /// Get the [`NodeId`] of the theta body's [`End`] node\\n\\n pub const fn end_node_id(&self) -> NodeId {\\n\\n self.subgraph.end\\n\\n }\\n\\n\\n\\n /// Get access to the theta node's body\\n\\n pub fn body(&self) -> &Rvsdg {\\n\\n &self.subgraph\\n\\n }\\n\\n\\n\\n /// Get mutable access to the theta node's body\\n\\n pub fn body_mut(&mut self) -> &mut Rvsdg {\\n\\n &mut self.subgraph\\n\\n }\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 94,\n \"score\": 136617.61348186442\n },\n {\n \"content\": \"\\n\\n /// Get the input effect's port from the theta node if it's available\\n\\n pub fn input_effect(&self) -> Option<InputPort> {\\n\\n self.effects.map(|effects| effects.input)\\n\\n }\\n\\n\\n\\n /// Get a mutable reference to the input effect's port from\\n\\n /// the theta node if it's available\\n\\n pub fn input_effect_mut(&mut self) -> Option<&mut InputPort> {\\n\\n self.effects.as_mut().map(|effects| &mut effects.input)\\n\\n }\\n\\n\\n\\n /// Get the output effect's port from the theta node if available\\n\\n pub fn output_effect(&self) -> Option<OutputPort> {\\n\\n self.effects.map(|effects| effects.output)\\n\\n }\\n\\n\\n\\n /// Get a mutable reference to the output effect's port from\\n\\n /// the theta node if it's available\\n\\n pub fn output_effect_mut(&mut self) -> Option<&mut OutputPort> {\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 95,\n \"score\": 136616.53523696284\n },\n {\n \"content\": \" self.outputs.iter().map(|(&port, ¶m)| (port, param))\\n\\n }\\n\\n\\n\\n pub fn output_pair_ids_with_feedback(\\n\\n &self,\\n\\n ) -> impl Iterator<Item = (OutputPort, NodeId, InputPort)> + '_ {\\n\\n self.outputs\\n\\n .iter()\\n\\n .map(|(&port, ¶m)| (port, param, self.output_feedback[&port]))\\n\\n }\\n\\n\\n\\n pub fn replace_outputs(&mut self, outputs: HashMap<OutputPort, NodeId>) {\\n\\n self.outputs = outputs;\\n\\n }\\n\\n\\n\\n pub fn replace_output_feedback(&mut self, output_feedback: HashMap<OutputPort, InputPort>) {\\n\\n self.output_feedback = output_feedback;\\n\\n }\\n\\n\\n\\n /// Returns the outputs from the theta node, *not including effect outputs*\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 96,\n \"score\": 136616.35040865358\n },\n {\n \"content\": \"\\n\\n /// Returns the node ids of each variant input and the input port that feeds into them\\n\\n pub fn variant_input_pair_ids(&self) -> impl Iterator<Item = (InputPort, NodeId)> + '_ {\\n\\n self.variant_inputs\\n\\n .iter()\\n\\n .map(|(&port, ¶m)| (port, param))\\n\\n }\\n\\n\\n\\n /// Returns the variant inputs to the theta node\\n\\n pub fn variant_input_params(&self) -> impl Iterator<Item = InputParam> + '_ {\\n\\n self.variant_inputs\\n\\n .iter()\\n\\n .map(|(_, ¶m)| self.subgraph.to_node(param))\\n\\n .copied()\\n\\n }\\n\\n\\n\\n /// Returns the node ids of variant inputs to the theta node\\n\\n pub fn variant_input_param_ids(&self) -> impl Iterator<Item = NodeId> + '_ {\\n\\n self.variant_inputs.values().copied()\\n\\n }\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 97,\n \"score\": 136615.6285229743\n },\n {\n \"content\": \" /// Returns the node ids of each invariant input and the input port that feeds into them\\n\\n pub fn invariant_input_pair_ids(&self) -> impl Iterator<Item = (InputPort, NodeId)> + '_ {\\n\\n self.invariant_inputs\\n\\n .iter()\\n\\n .map(|(&port, ¶m)| (port, param))\\n\\n }\\n\\n\\n\\n /// Returns the invariant inputs to the theta node\\n\\n pub fn invariant_input_params(&self) -> impl Iterator<Item = InputParam> + '_ {\\n\\n self.invariant_inputs\\n\\n .iter()\\n\\n .map(|(_, ¶m)| self.subgraph.to_node(param))\\n\\n .copied()\\n\\n }\\n\\n\\n\\n /// Returns the node ids of invariant inputs to the theta node\\n\\n pub fn invariant_input_param_ids(&self) -> impl Iterator<Item = NodeId> + '_ {\\n\\n self.invariant_inputs.values().copied()\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 98,\n \"score\": 136615.6285229743\n },\n {\n \"content\": \"\\n\\n pub fn retain_invariant_inputs<F>(&mut self, mut retain: F)\\n\\n where\\n\\n F: FnMut(InputPort, NodeId) -> bool,\\n\\n {\\n\\n self.invariant_inputs\\n\\n .retain(|&port, &mut param| retain(port, param));\\n\\n }\\n\\n\\n\\n /// Removes a variant input, the output it's fed from and the feedback entry for them\\n\\n pub fn remove_variant_input(&mut self, input: InputPort) {\\n\\n self.variant_inputs.remove(&input).debug_unwrap();\\n\\n\\n\\n let output = self\\n\\n .output_feedback\\n\\n .iter()\\n\\n .find_map(|(&output, &port)| (port == input).then(|| output))\\n\\n .unwrap();\\n\\n\\n\\n self.output_feedback.remove(&output).debug_unwrap();\\n\",\n \"file_path\": \"src/graph/nodes/theta.rs\",\n \"rank\": 99,\n \"score\": 136615.60752106982\n }\n]","isConversational":false}}},{"rowIdx":989,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"garnet/bin/setui/src/tests/media_buttons_agent_tests.rs"},"repo_name":{"kind":"string","value":"allansrc/fuchsia"},"commit":{"kind":"string","value":"a2c235b33fc4305044d496354a08775f30cdcf37"},"file_code":{"kind":"string","value":"\n\nuse crate::agent::media_buttons;\nuse crate::agent::Invocation;\nuse crate::agent::Lifespan;\nuse crate::agent::{Context, Payload};\nuse crate::event::{self, Event};\nuse crate::input::{MediaButtons, VolumeGain};\nuse crate::message::base::{Audience, MessengerType};\nuse crate::message::MessageHubUtil;\nuse crate::service;\nuse crate::service_context::ServiceContext;\nuse crate::tests::fakes::input_device_registry_service::InputDeviceRegistryService;\nuse crate::tests::fakes::service_registry::ServiceRegistry;\nuse fidl_fuchsia_ui_input::MediaButtonsEvent;\nuse futures::lock::Mutex;\nuse media_buttons::MediaButtonsAgent;\nuse std::collections::HashSet;\nuse std::sync::Arc;\n\nstruct FakeServices {\n input_device_registry: Arc<Mutex<InputDeviceRegistryService>>,\n}\n\nasync fn create_services() -> (Arc<Mutex<ServiceRegistry>>, FakeServices) {\n let service_registry = ServiceRegistry::create();\n\n let input_device_registry_service_handle =\n Arc::new(Mutex::new(InputDeviceRegistryService::new()));\n service_registry.lock().await.register_service(input_device_registry_service_handle.clone());\n\n (service_registry, FakeServices { input_device_registry: input_device_registry_service_handle })\n}\n\n#[fuchsia_async::run_until_stalled(test)]\nasync fn test_media_buttons_proxied() {\n let service_hub = service::MessageHub::create_hub();\n \n let agent_receptor = service_hub\n .create(MessengerType::Unbound)\n .await\n .expect(\"Unable to create agent messenger\")\n .1;\n let signature = agent_receptor.get_signature();\n\n \n let (agent_messenger, _) =\n service_hub.create(MessengerType::Unbound).await.expect(\"Unable to create agent messenger\");\n \n let mut event_receptor = service::build_event_listener(&service_hub).await;\n\n \n let context =\n Context::new(agent_receptor, service_hub, HashSet::new(), HashSet::new(), None).await;\n MediaButtonsAgent::create(context).await;\n\n \n let (service_registry, fake_services) = create_services().await;\n let service_context =\n Arc::new(ServiceContext::new(Some(ServiceRegistry::serve(service_registry)), None));\n\n \n let invocation = Invocation { lifespan: Lifespan::Service, service_context };\n let mut reply_receptor = agent_messenger\n .message(Payload::Invocation(invocation).into(), Audience::Messenger(signature))\n .send();\n let mut completion_result = None;\n if let Ok((Payload::Complete(result), _)) = reply_receptor.next_of::<Payload>().await {\n completion_result = Some(result);\n }\n\n \n assert!(\n matches!(completion_result, Some(Ok(()))),\n \"Did not receive a completion event from the invocation message\"\n );\n\n \n fake_services\n .input_device_registry\n .lock()\n .await\n .send_media_button_event(MediaButtonsEvent {\n volume: Some(1),\n mic_mute: Some(true),\n pause: None,\n camera_disable: None,\n ..MediaButtonsEvent::EMPTY\n })\n .await;\n\n \n let mut mic_mute_received = false;\n let mut volume_received = false;\n while let Ok((event::Payload::Event(event), _)) =\n event_receptor.next_of::<event::Payload>().await\n {\n if let Event::MediaButtons(event) = event {\n match event {\n event::media_buttons::Event::OnButton(MediaButtons {\n mic_mute: Some(true),\n ..\n }) => {\n mic_mute_received = true;\n if volume_received {\n break;\n }\n }\n event::media_buttons::Event::OnVolume(VolumeGain::Up) => {\n volume_received = true;\n if mic_mute_received {\n break;\n }\n }\n _ => {}\n }\n }\n }\n\n \n assert!(mic_mute_received);\n assert!(volume_received);\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::agent::media_buttons;\nuse crate::agent::Invocation;\nuse crate::agent::Lifespan;\nuse crate::agent::{Context, Payload};\nuse crate::event::{self, Event};\nuse crate::input::{MediaButtons, VolumeGain};\nuse crate::message::base::{Audience, MessengerType};\nuse crate::message::MessageHubUtil;\nuse crate::service;\nuse crate::service_context::ServiceContext;\nuse crate::tests::fakes::input_device_registry_service::InputDeviceRegistryService;\nuse crate::tests::fakes::service_registry::ServiceRegistry;\nuse fidl_fuchsia_ui_input::MediaButtonsEvent;\nuse futures::lock::Mutex;\nuse media_buttons::MediaButtonsAgent;\nuse std::collections::HashSet;\nuse std::sync::Arc;\n\nstruct FakeServices {\n input_device_registry: Arc<Mutex<InputDeviceRegistryService>>,\n}\n\nasync fn create_services() -> (Arc<Mutex<ServiceRegistry>>, FakeServices) {\n let service_registry = ServiceRegistry::create();\n\n let input_device_registry_service_handle =\n Arc::new(Mutex::new(InputDeviceRegistryService::new()));\n service_registry.lock().await.register_service(input_device_registry_service_handle.clone());\n\n (service_registry, FakeServices { input_device_registry: input_device_registry_service_handle })\n}\n\n#[fuchsia_async::run_until_stalled(test)]\nasync fn test_media_buttons_proxied() {\n let service_hub = service::MessageHub::create_hub();\n \n let agent_receptor = service_hub\n .create(MessengerType::Unbound)\n .await\n .expect(\"Unable to create agent messenger\")\n .1;\n let signature = agent_receptor.get_signature();\n\n \n let (agent_messenger, _) =\n service_hub.create(MessengerType::Unbound).await.expect(\"Unable to create agent messenger\");\n \n let mut event_receptor = service::build_event_listener(&service_hub).await;\n\n \n let context =\n Context::new(agent_receptor, service_hub, HashSet::new(), HashSet::new(), None).await;\n MediaButtonsAgent::create(context).await;\n\n \n let (service_registry, fake_services) = create_services().await;\n let service_context =\n Arc::new(ServiceContext::new(Some(ServiceRegistry::serve(service_registry)), None));\n\n \n let invocation = Invocation { lifespan: Lifespan::Service, service_context };\n let mut reply_receptor = agent_messenger\n .message(Payload::Invocation(invocation).into(), Audience::Messenger(signature))\n .send();\n let mut completion_result = None;\n "},"suffix":{"kind":"string","value":"\n\n \n assert!(\n matches!(completion_result, Some(Ok(()))),\n \"Did not receive a completion event from the invocation message\"\n );\n\n \n fake_services\n .input_device_registry\n .lock()\n .await\n .send_media_button_event(MediaButtonsEvent {\n volume: Some(1),\n mic_mute: Some(true),\n pause: None,\n camera_disable: None,\n ..MediaButtonsEvent::EMPTY\n })\n .await;\n\n \n let mut mic_mute_received = false;\n let mut volume_received = false;\n while let Ok((event::Payload::Event(event), _)) =\n event_receptor.next_of::<event::Payload>().await\n {\n if let Event::MediaButtons(event) = event {\n match event {\n event::media_buttons::Event::OnButton(MediaButtons {\n mic_mute: Some(true),\n ..\n }) => {\n mic_mute_received = true;\n if volume_received {\n break;\n }\n }\n event::media_buttons::Event::OnVolume(VolumeGain::Up) => {\n volume_received = true;\n if mic_mute_received {\n break;\n }\n }\n _ => {}\n }\n }\n }\n\n \n assert!(mic_mute_received);\n assert!(volume_received);\n}\n"},"middle":{"kind":"string","value":"if let Ok((Payload::Complete(result), _)) = reply_receptor.next_of::<Payload>().await {\n completion_result = Some(result);\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":990,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/reconnectable_ws.rs"},"repo_name":{"kind":"string","value":"hermanodecastro/openlimits"},"commit":{"kind":"string","value":"af7b4d59c6a874c662bbc5ace9271bcb1956a8c5"},"file_code":{"kind":"string","value":"use crate::errors::OpenLimitsError;\nuse crate::exchange_ws::{CallbackHandle, ExchangeWs, OpenLimitsWs, Subscriptions};\nuse crate::model::websocket::{Subscription, WebSocketResponse};\nuse crate::shared::Result;\nuse futures::stream::BoxStream;\nuse std::sync::Arc;\nuse std::thread::sleep;\nuse tokio::sync::mpsc::{unbounded_channel, UnboundedSender};\nuse tokio::sync::Mutex;\nuse tokio::time::Duration;\n\npub type SubscriptionCallback<Response> =\n Arc<dyn Fn(&Result<WebSocketResponse<Response>>) + Sync + Send + 'static>;\n\npub type SubscriptionCallbackRegistry<E> = (\n Subscription,\n SubscriptionCallback<<E as ExchangeWs>::Response>,\n);\n\npub struct ReconnectableWebsocket<E: ExchangeWs> {\n websocket: Arc<Mutex<OpenLimitsWs<E>>>,\n tx: UnboundedSender<()>,\n subscriptions: Arc<Mutex<Vec<SubscriptionCallbackRegistry<E>>>>,\n}\n\nimpl<E: ExchangeWs + 'static> ReconnectableWebsocket<E> {\n pub async fn instantiate(params: E::InitParams, reattempt_interval: Duration) -> Result<Self> {\n let websocket = E::new(params.clone()).await?;\n let websocket = OpenLimitsWs { websocket };\n let websocket = Arc::new(Mutex::new(websocket));\n let subscriptions: Arc<Mutex<Vec<SubscriptionCallbackRegistry<E>>>> =\n Arc::new(Mutex::new(Default::default()));\n let (tx, mut rx) = unbounded_channel();\n {\n let websocket = Arc::downgrade(&websocket);\n let subscriptions = Arc::downgrade(&subscriptions);\n let tx = tx.clone();\n tokio::spawn(async move {\n while rx.recv().await.is_some() {\n 'reconnection: loop {\n if let (Some(websocket), Some(subscriptions)) =\n (websocket.upgrade(), subscriptions.upgrade())\n {\n if let Ok(new_websocket) = E::new(params.clone()).await {\n let new_websocket = OpenLimitsWs {\n websocket: new_websocket,\n };\n let mut websocket = websocket.lock().await;\n *websocket = new_websocket;\n\n let subscriptions = { subscriptions.lock().await.clone() };\n let subscriptions =\n subscriptions.iter().map(|(subscription, callback)| {\n let callback = callback.clone();\n let tx = tx.clone();\n websocket.subscribe(subscription.clone(), move |message| {\n if let Err(OpenLimitsError::SocketError()) =\n message.as_ref()\n {\n tx.send(()).ok();\n }\n callback(message)\n })\n });\n if futures_util::future::join_all(subscriptions)\n .await\n .iter()\n .all(|subscription| subscription.is_ok())\n {\n break 'reconnection;\n }\n }\n sleep(reattempt_interval);\n }\n }\n }\n });\n }\n Ok(Self {\n websocket,\n tx,\n subscriptions,\n })\n }\n\n pub async fn create_stream_specific(\n &self,\n subscriptions: Subscriptions<E::Subscription>,\n ) -> Result<BoxStream<'static, Result<E::Response>>> {\n self.websocket\n .lock()\n .await\n .create_stream_specific(subscriptions)\n .await\n }\n\n pub async fn subscribe<\n F: Fn(&Result<WebSocketResponse<E::Response>>) + Sync + Send + Clone + 'static,\n >(\n &self,\n subscription: Subscription,\n callback: F,\n ) -> Result<CallbackHandle> {\n let tx = self.tx.clone();\n self.subscriptions\n .lock()\n .await\n .push((subscription.clone(), Arc::new(callback.clone())));\n self.websocket\n .lock()\n .await\n .subscribe(subscription, move |message| {\n if let Err(OpenLimitsError::SocketError()) = message.as_ref() {\n tx.send(()).ok();\n }\n callback(message);\n })\n .await\n }\n\n pub async fn create_stream<S: Into<E::Subscription> + Clone + Send + Sync>(\n &self,\n subscriptions: &[S],\n ) -> Result<BoxStream<'static, Result<WebSocketResponse<E::Response>>>> {\n self.websocket\n .lock()\n .await\n .create_stream(subscriptions)\n .await\n }\n\n pub async fn disconnect(&self) {\n self.websocket.lock().await.disconnect().await;\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::errors::OpenLimitsError;\nuse crate::exchange_ws::{CallbackHandle, ExchangeWs, OpenLimitsWs, Subscriptions};\nuse crate::model::websocket::{Subscription, WebSocketResponse};\nuse crate::shared::Result;\nuse futures::stream::BoxStream;\nuse std::sync::Arc;\nuse std::thread::sleep;\nuse tokio::sync::mpsc::{unbounded_channel, UnboundedSender};\nuse tokio::sync::Mutex;\nuse tokio::time::Duration;\n\npub type SubscriptionCallback<Response> =\n Arc<dyn Fn(&Result<WebSocketResponse<Response>>) + Sync + Send + 'static>;\n\npub type SubscriptionCallbackRegistry<E> = (\n Subscription,\n SubscriptionCallback<<E as ExchangeWs>::Response>,\n);\n\npub struct ReconnectableWebsocket<E: ExchangeWs> {\n websocket: Arc<Mutex<OpenLimitsWs<E>>>,\n tx: UnboundedSender<()>,\n subscriptions: Arc<Mutex<Vec<SubscriptionCallbackRegistry<E>>>>,\n}\n\nimpl<E: ExchangeWs + 'static> ReconnectableWebsocket<E> {\n pub async fn instantiate(params: E::InitParams, reattempt_interval: Duration) -> Result<Self> {\n let websocket = E::new(params.clone()).await?;\n let websocket = OpenLimitsWs { websocket };\n let websocket = Arc::new(Mutex::new(websocket));\n let subscriptions: Arc<Mutex<Vec<SubscriptionCallbackRegistry<E>>>> =\n Arc::new(Mutex::new(Default::default()));\n let (tx, mut rx) = unbounded_channel();\n {\n let websocket = Arc::downgrade(&websocket);\n let subscriptions = Arc::downgrade(&subscriptions);\n let tx = tx.clone();\n tokio::spawn(async move {\n while rx.recv().await.is_some() {\n 'reconnection: loop {\n if let (Some(websocket), Some(subscriptions)) =\n (websocket.upgrade(), subscriptions.upgrade())\n {\n if let Ok(new_websocket) = E::new(params.clone()).await {\n let new_websocket = OpenLimitsWs {\n websocket: new_websocket,\n };\n let mut websocket = websocket.lock().await;\n *websocket = new_websocket;\n\n let subscriptions = { subscriptions.lock().await.clone() };\n let subscriptions =\n subscriptions.iter().map(|(subscription, callback)| {\n let callback = callback.clone();\n let tx = tx.clone();\n websocket.subscribe(subscription.clone(), move |message| {\n if let Err(OpenLimitsError::SocketError()) =\n message.as_ref()\n {\n tx.send(()).ok();\n }\n "},"suffix":{"kind":"string","value":"\n\n pub async fn create_stream_specific(\n &self,\n subscriptions: Subscriptions<E::Subscription>,\n ) -> Result<BoxStream<'static, Result<E::Response>>> {\n self.websocket\n .lock()\n .await\n .create_stream_specific(subscriptions)\n .await\n }\n\n pub async fn subscribe<\n F: Fn(&Result<WebSocketResponse<E::Response>>) + Sync + Send + Clone + 'static,\n >(\n &self,\n subscription: Subscription,\n callback: F,\n ) -> Result<CallbackHandle> {\n let tx = self.tx.clone();\n self.subscriptions\n .lock()\n .await\n .push((subscription.clone(), Arc::new(callback.clone())));\n self.websocket\n .lock()\n .await\n .subscribe(subscription, move |message| {\n if let Err(OpenLimitsError::SocketError()) = message.as_ref() {\n tx.send(()).ok();\n }\n callback(message);\n })\n .await\n }\n\n pub async fn create_stream<S: Into<E::Subscription> + Clone + Send + Sync>(\n &self,\n subscriptions: &[S],\n ) -> Result<BoxStream<'static, Result<WebSocketResponse<E::Response>>>> {\n self.websocket\n .lock()\n .await\n .create_stream(subscriptions)\n .await\n }\n\n pub async fn disconnect(&self) {\n self.websocket.lock().await.disconnect().await;\n }\n}\n"},"middle":{"kind":"string","value":"callback(message)\n })\n });\n if futures_util::future::join_all(subscriptions)\n .await\n .iter()\n .all(|subscription| subscription.is_ok())\n {\n break 'reconnection;\n }\n }\n sleep(reattempt_interval);\n }\n }\n }\n });\n }\n Ok(Self {\n websocket,\n tx,\n subscriptions,\n })\n }"},"strategy":{"kind":"string","value":"function_block-function_prefix_line"},"context_items":{"kind":"list like","value":[{"content":"#[async_trait]\n\npub trait ExchangeWs: Send + Sync + Sized {\n\n type InitParams: Clone + Send + Sync + 'static;\n\n type Subscription: From<Subscription> + Send + Sync + Sized + Clone;\n\n type Response: TryInto<WebSocketResponse<Self::Response>, Error = OpenLimitsError>\n\n + Send\n\n + Sync\n\n + Clone\n\n + Sized\n\n + Debug\n\n + 'static;\n\n\n\n async fn new(params: Self::InitParams) -> Result<Self>;\n\n\n\n async fn disconnect(&self);\n\n\n\n async fn create_stream_specific(\n\n &self,\n\n subscriptions: Subscriptions<Self::Subscription>,\n\n ) -> Result<BoxStream<'static, Result<Self::Response>>>;\n\n\n","file_path":"src/exchange_ws.rs","rank":0,"score":119419.3980410245},{"content":"fn parse_message(ws_message: Message) -> Result<CoinbaseWebsocketMessage> {\n\n let msg = match ws_message {\n\n Message::Text(m) => m,\n\n _ => return Err(OpenLimitsError::SocketError()),\n\n };\n\n Ok(serde_json::from_str(&msg)?)\n\n}\n\n\n\n#[async_trait]\n\nimpl ExchangeWs for CoinbaseWebsocket {\n\n type InitParams = CoinbaseParameters;\n\n type Subscription = CoinbaseSubscription;\n\n type Response = CoinbaseWebsocketMessage;\n\n\n\n async fn new(parameters: Self::InitParams) -> Result<Self> {\n\n Ok(CoinbaseWebsocket::new(parameters))\n\n }\n\n\n\n async fn disconnect(&self) {\n\n if let Ok(mut senders) = self.disconnection_senders.lock() {\n","file_path":"src/coinbase/client/websocket.rs","rank":1,"score":115496.55660945199},{"content":"fn parse_message(ws_message: Message) -> Result<BinanceWebsocketMessage> {\n\n let msg = match ws_message {\n\n Message::Text(m) => m,\n\n Message::Binary(b) => return Ok(BinanceWebsocketMessage::Binary(b)),\n\n Message::Pong(..) => return Ok(BinanceWebsocketMessage::Pong),\n\n Message::Ping(..) => return Ok(BinanceWebsocketMessage::Ping),\n\n Message::Close(..) => return Ok(BinanceWebsocketMessage::Close),\n\n };\n\n\n\n serde_json::from_str(&msg).map_err(OpenLimitsError::JsonError)\n\n}\n","file_path":"src/binance/client/websocket.rs","rank":2,"score":115496.55660945199},{"content":"#[derive(Deserialize)]\n\nstruct BinanceWebsocketStream {\n\n #[serde(rename = \"stream\")]\n\n pub name: String,\n\n pub data: Value,\n\n}\n\n\n\nimpl<'de> Deserialize<'de> for BinanceWebsocketMessage {\n\n fn deserialize<D>(deserializer: D) -> core::result::Result<Self, D::Error>\n\n where\n\n D: serde::Deserializer<'de>,\n\n {\n\n let stream: BinanceWebsocketStream = BinanceWebsocketStream::deserialize(deserializer)?;\n\n\n\n if stream.name.ends_with(\"@aggTrade\") {\n\n Ok(BinanceWebsocketMessage::AggregateTrade(\n\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\n\n ))\n\n } else if stream.name.contains(\"@trade\") {\n\n Ok(BinanceWebsocketMessage::Trade(\n\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\n","file_path":"src/binance/client/websocket.rs","rank":3,"score":90397.1879028519},{"content":"#[async_trait]\n\npub trait ExchangeInfoRetrieval: Sync {\n\n async fn get_pair(&self, name: &str) -> Result<MarketPairHandle>;\n\n async fn retrieve_pairs(&self) -> Result<Vec<MarketPair>>;\n\n async fn refresh_market_info(&self) -> Result<Vec<MarketPairHandle>>;\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct MarketPair {\n\n pub base: String,\n\n pub quote: String,\n\n pub symbol: String,\n\n pub base_increment: Decimal,\n\n pub quote_increment: Decimal,\n\n pub min_base_trade_size: Option<Decimal>,\n\n pub min_quote_trade_size: Option<Decimal>,\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct MarketPairHandle {\n\n pub inner: Arc<RwLock<MarketPair>>,\n","file_path":"src/exchange_info.rs","rank":4,"score":87427.25960978286},{"content":"pub fn timestamp_to_naive_datetime(timestamp: u64) -> chrono::naive::NaiveDateTime {\n\n let seconds = (timestamp / 1000) as i64;\n\n let nanos = ((timestamp % 1000) * 1_000_000) as u32;\n\n\n\n chrono::NaiveDateTime::from_timestamp(seconds, nanos)\n\n}\n\n\n","file_path":"src/shared.rs","rank":5,"score":67634.16532944998},{"content":"pub fn timestamp_to_utc_datetime(timestamp: u64) -> chrono::DateTime<chrono::Utc> {\n\n let d = timestamp_to_naive_datetime(timestamp);\n\n chrono::DateTime::<chrono::Utc>::from_utc(d, chrono::Utc)\n\n}\n","file_path":"src/shared.rs","rank":6,"score":66198.15495627497},{"content":"type WSStream = WebSocketStream<MaybeTlsStream<TcpStream>>;\n\n\n\npub struct CoinbaseWebsocket {\n\n pub subscriptions: HashMap<CoinbaseSubscription, SplitStream<WSStream>>,\n\n pub parameters: CoinbaseParameters,\n\n disconnection_senders: Mutex<Vec<UnboundedSender<()>>>,\n\n}\n\n\n\nimpl CoinbaseWebsocket {\n\n pub fn new(parameters: CoinbaseParameters) -> Self {\n\n Self {\n\n subscriptions: Default::default(),\n\n parameters,\n\n disconnection_senders: Default::default(),\n\n }\n\n }\n\n\n\n pub async fn subscribe_(&mut self, subscription: CoinbaseSubscription) -> Result<()> {\n\n let (channels, product_ids) = match &subscription {\n\n CoinbaseSubscription::Level2(product_id) => (\n","file_path":"src/coinbase/client/websocket.rs","rank":7,"score":59985.75342014043},{"content":"pub fn get_pair<'a>(name: &str, exchange_info: &'a ExchangeInfo) -> Result<MarketPairHandle> {\n\n exchange_info.get_pair(name)\n\n}\n\n\n","file_path":"src/exchange_info.rs","rank":8,"score":59519.84419099382},{"content":"#[cfg(not(target_os = \"windows\"))]\n\nfn main() {}","file_path":"build.rs","rank":9,"score":57066.61250315179},{"content":"#[cfg(target_os = \"windows\")]\n\nfn main() {\n\n use std::process::Command;\n\n use std::path::Path;\n\n\n\n let rustup_output = Command::new(\"rustup\")\n\n .arg(\"which\")\n\n .arg(\"rustc\")\n\n .output()\n\n .expect(\"Couldn't get rustup output.\");\n\n let rustc_path = String::from_utf8(rustup_output.stdout).expect(\"Couldn't get toolchain path\");\n\n let toolchain_path = Path::new(&rustc_path)\n\n .parent().unwrap()\n\n .parent().unwrap();\n\n\n\n let toolchain_triple = toolchain_path\n\n .file_name()\n\n .map(|name| name.to_string_lossy().to_string())\n\n .map(|name| name.replace(\"stable-\", \"\"))\n\n .expect(\"Couldn't get toolchain triple.\");\n\n let architecture = if let Some(_) = toolchain_triple.find(\"x86_64\") {\n","file_path":"build.rs","rank":10,"score":57066.61250315179},{"content":"// chrono::Duration does not have a serde serialize/deserialize option\n\nstruct TimeInForceVisitor;\n\n\n\nimpl<'de> Visitor<'de> for TimeInForceVisitor {\n\n type Value = TimeInForce;\n\n\n\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\n\n formatter.write_str(\"an string, either GTC, IOC, FOK, GTT,duration\")\n\n }\n\n fn visit_str<E>(self, v: &str) -> Result<Self::Value, E>\n\n where\n\n E: de::Error,\n\n {\n\n if v.starts_with(\"GTT,\") {\n\n match v[4..].parse::<u64>() {\n\n Ok(v) => Ok(TimeInForce::GoodTillTime(Duration::milliseconds(v as i64))),\n\n _ => Err(E::custom(format!(\"Invalid GTG: {}\", v))),\n\n }\n\n } else {\n\n match v {\n\n \"GTC\" => Ok(TimeInForce::GoodTillCancelled),\n","file_path":"src/model/mod.rs","rank":11,"score":51574.02577249582},{"content":"fn try_split_paginator(\n\n paginator: Option<Paginator>,\n\n) -> crate::shared::Result<(\n\n Option<String>,\n\n Option<i64>,\n\n Option<nash_protocol::types::DateTimeRange>,\n\n)> {\n\n Ok(match paginator {\n\n Some(paginator) => (\n\n paginator.before,\n\n match paginator.limit {\n\n Some(v) => Some(i64::try_from(v).map_err(|_| {\n\n OpenLimitsError::InvalidParameter(\n\n \"Couldn't convert paginator limit to i64\".to_string(),\n\n )\n\n })?),\n\n None => None,\n\n },\n\n if paginator.start_time.is_some() && paginator.end_time.is_some() {\n\n Some(nash_protocol::types::DateTimeRange {\n","file_path":"src/nash/mod.rs","rank":12,"score":50582.08388160035},{"content":"#[async_trait]\n\npub trait ExchangeAccount {\n\n async fn limit_buy(&self, req: &OpenLimitOrderRequest) -> Result<Order>;\n\n async fn limit_sell(&self, req: &OpenLimitOrderRequest) -> Result<Order>;\n\n async fn market_buy(&self, req: &OpenMarketOrderRequest) -> Result<Order>;\n\n async fn market_sell(&self, req: &OpenMarketOrderRequest) -> Result<Order>;\n\n async fn cancel_order(&self, req: &CancelOrderRequest) -> Result<OrderCanceled>;\n\n async fn cancel_all_orders(&self, req: &CancelAllOrdersRequest) -> Result<Vec<OrderCanceled>>;\n\n async fn get_all_open_orders(&self) -> Result<Vec<Order>>;\n\n async fn get_order_history(&self, req: &GetOrderHistoryRequest) -> Result<Vec<Order>>;\n\n async fn get_trade_history(&self, req: &TradeHistoryRequest) -> Result<Vec<Trade>>;\n\n async fn get_account_balances(&self, paginator: Option<Paginator>) -> Result<Vec<Balance>>;\n\n async fn get_order(&self, req: &GetOrderRequest) -> Result<Order>;\n\n}\n","file_path":"src/exchange.rs","rank":13,"score":49346.80818312607},{"content":"#[async_trait]\n\npub trait ExchangeMarketData {\n\n async fn order_book(&self, req: &OrderBookRequest) -> Result<OrderBookResponse>;\n\n async fn get_price_ticker(&self, req: &GetPriceTickerRequest) -> Result<Ticker>;\n\n async fn get_historic_rates(&self, req: &GetHistoricRatesRequest) -> Result<Vec<Candle>>;\n\n async fn get_historic_trades(&self, req: &GetHistoricTradesRequest) -> Result<Vec<Trade>>;\n\n}\n\n\n","file_path":"src/exchange.rs","rank":14,"score":47939.49257124301},{"content":"pub trait BookLevel {\n\n fn level() -> u8;\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Debug, Clone)]\n\npub struct BookRecordL1 {\n\n #[serde(with = \"string_to_decimal\")]\n\n pub price: Decimal,\n\n #[serde(with = \"string_to_decimal\")]\n\n pub size: Decimal,\n\n pub num_orders: usize,\n\n}\n\n\n\nimpl BookLevel for BookRecordL1 {\n\n fn level() -> u8 {\n\n 1\n\n }\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Debug, Clone)]\n","file_path":"src/coinbase/model/mod.rs","rank":15,"score":46641.8614312603},{"content":"type HmacSha256 = Hmac<Sha256>;\n\n\n\nstatic RECV_WINDOW: usize = 7000;\n\n\n\n#[derive(Clone)]\n\npub struct Transport {\n\n credential: Option<(String, String)>,\n\n client: reqwest::Client,\n\n pub recv_window: usize,\n\n base_url: String,\n\n}\n\n\n\nimpl Transport {\n\n pub fn new(sandbox: bool) -> Result<Self> {\n\n let default_headers = Transport::default_headers(None);\n\n let client = reqwest::Client::builder()\n\n .default_headers(default_headers)\n\n .build()?;\n\n\n\n Ok(Transport {\n","file_path":"src/binance/transport.rs","rank":16,"score":45140.135832319414},{"content":"type HmacSha256 = Hmac<Sha256>;\n\n\n\n#[derive(Clone)]\n\npub struct Transport {\n\n api_secret: Option<String>,\n\n client: reqwest::Client,\n\n base_url: String,\n\n}\n\n\n\nimpl Transport {\n\n pub fn new(sandbox: bool) -> Result<Self> {\n\n let default_headers = Transport::default_headers();\n\n\n\n let client = reqwest::Client::builder()\n\n .default_headers(default_headers)\n\n .build()?;\n\n\n\n Ok(Transport {\n\n client,\n\n api_secret: None,\n","file_path":"src/coinbase/transport.rs","rank":17,"score":45140.135832319414},{"content":"fn to_decimal(v: &Value) -> Decimal {\n\n v.as_str()\n\n .expect(\"Couldn't get JSON Value as str.\")\n\n .parse()\n\n .expect(\"Couldn't parse str as Decimal.\")\n\n}\n","file_path":"src/binance/client/market.rs","rank":18,"score":42900.46836895768},{"content":"fn to_i64(v: &Value) -> i64 {\n\n v.as_i64().expect(\"Couldn't get JSON Value as i64.\")\n\n}\n\n\n","file_path":"src/binance/client/market.rs","rank":19,"score":42900.46836895768},{"content":"use nash_native_client::Environment;\n\nuse openlimits::shared::Result;\n\nuse openlimits::{model::websocket::Subscription, nash::NashWebsocket};\n\nuse tokio::time::Duration;\n\n\n\nuse openlimits::binance::{BinanceParameters, BinanceWebsocket};\n\nuse openlimits::coinbase::client::websocket::CoinbaseWebsocket;\n\nuse openlimits::coinbase::CoinbaseParameters;\n\nuse openlimits::exchange_ws::ExchangeWs;\n\nuse openlimits::nash::NashParameters;\n\nuse openlimits::reconnectable_ws::ReconnectableWebsocket;\n\nuse std::sync::mpsc::sync_channel;\n\nuse std::sync::{Arc, Mutex};\n\n\n\nasync fn test_subscription_callback<E: ExchangeWs + 'static>(\n\n websocket: ReconnectableWebsocket<E>,\n\n sub: Subscription,\n\n) {\n\n let disconnections = Arc::new(Mutex::new(0 as u32));\n\n let (tx, rx) = sync_channel(0);\n","file_path":"tests/any_exchange/reconnection.rs","rank":22,"score":36578.048481956124},{"content":" let websocket = Arc::new(websocket);\n\n let weak_websocket = Arc::downgrade(&websocket);\n\n websocket\n\n .subscribe(sub, move |message| match message.as_ref() {\n\n Ok(_message) => {\n\n if let Ok(disconnections) = disconnections.lock().map(|value| *value) {\n\n if disconnections >= 2 {\n\n tx.send(()).expect(\"Couldn't send sync.\");\n\n }\n\n }\n\n let websocket = weak_websocket.upgrade().expect(\"Couldn't get websocket.\");\n\n tokio::spawn(async move { websocket.disconnect().await });\n\n }\n\n Err(_error) => {\n\n *disconnections\n\n .lock()\n\n .expect(\"Couldn't lock disconnections.\") += 1;\n\n }\n\n })\n\n .await\n","file_path":"tests/any_exchange/reconnection.rs","rank":27,"score":36568.2754281955},{"content":"async fn binance() {\n\n let client = init_binance().await;\n\n let sub = Subscription::OrderBookUpdates(\"bnbbtc\".to_string());\n\n test_subscription_callback(client.expect(\"Couldn't create client.\"), sub).await;\n\n}\n\n\n\nasync fn init_coinbase() -> Result<ReconnectableWebsocket<CoinbaseWebsocket>> {\n\n ReconnectableWebsocket::instantiate(\n\n CoinbaseParameters {\n\n credentials: None,\n\n sandbox: true,\n\n },\n\n Duration::from_secs_f32(1.0),\n\n )\n\n .await\n\n}\n\n\n\nasync fn init_nash() -> Result<ReconnectableWebsocket<NashWebsocket>> {\n\n ReconnectableWebsocket::instantiate(\n\n NashParameters {\n","file_path":"tests/any_exchange/reconnection.rs","rank":28,"score":36565.9769105866},{"content":" timeout: Duration::from_secs_f32(2.0),\n\n client_id: 123,\n\n credentials: None,\n\n affiliate_code: None,\n\n environment: Environment::Production,\n\n sign_states_loop_interval: None,\n\n },\n\n Duration::from_secs_f32(1.0),\n\n )\n\n .await\n\n}\n\n\n\nasync fn init_binance() -> Result<ReconnectableWebsocket<BinanceWebsocket>> {\n\n ReconnectableWebsocket::instantiate(\n\n BinanceParameters {\n\n sandbox: false,\n\n credentials: None,\n\n },\n\n Duration::from_secs_f32(1.0),\n\n )\n\n .await\n\n}\n","file_path":"tests/any_exchange/reconnection.rs","rank":30,"score":36562.01003529361},{"content":" .expect(\"Couldn't subscribe\");\n\n rx.recv_timeout(Duration::from_secs_f32(10.0))\n\n .expect(\"Couldn't receive sync.\");\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn coinbase() {\n\n let client = init_coinbase().await;\n\n let sub = Subscription::OrderBookUpdates(\"BTC-USD\".to_string());\n\n test_subscription_callback(client.expect(\"Couldn't create client.\"), sub).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn nash() {\n\n let client = init_nash().await;\n\n let sub = Subscription::OrderBookUpdates(\"btc_usdc\".to_string());\n\n test_subscription_callback(client.expect(\"Couldn't create client.\"), sub).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n","file_path":"tests/any_exchange/reconnection.rs","rank":31,"score":36560.652400375184},{"content":" m.as_ref().expect(\"Couldn't get response.\");\n\n tx.send(()).expect(\"Couldn't send sync message.\");\n\n })\n\n .await\n\n .expect(\"Couldn't subscribe.\");\n\n\n\n rx.recv().expect(\"Couldn't receive sync message.\");\n\n}\n\n\n\nasync fn test_account_subscription_callback(\n\n websocket: OpenLimitsWs<NashWebsocket>,\n\n sub: Subscription,\n\n cancel_orders: bool,\n\n) {\n\n let (tx, rx) = sync_channel(0);\n\n\n\n websocket\n\n .subscribe(sub, move |m| {\n\n m.as_ref().expect(\"Couldn't get response.\");\n\n tx.send(()).expect(\"Couldn't send sync message.\");\n","file_path":"tests/nash/websocket.rs","rank":32,"score":35680.92798291303},{"content":" credentials: Some(NashCredentials {\n\n secret: env::var(\"NASH_API_SECRET\").expect(\"Couldn't get environment variable.\"),\n\n session: env::var(\"NASH_API_KEY\").expect(\"Couldn't get environment variable.\"),\n\n }),\n\n environment: Environment::Sandbox,\n\n client_id: 1,\n\n timeout: NativeDuration::new(10, 0),\n\n sign_states_loop_interval: None,\n\n };\n\n\n\n OpenLimits::instantiate(parameters)\n\n .await\n\n .expect(\"Failed to create Client\")\n\n}\n\n\n\nasync fn test_subscription_callback(websocket: OpenLimitsWs<NashWebsocket>, sub: Subscription) {\n\n let (tx, rx) = sync_channel(0);\n\n\n\n websocket\n\n .subscribe(sub, move |m| {\n","file_path":"tests/nash/websocket.rs","rank":33,"score":35671.38835745391},{"content":"use crate::openlimits::exchange::ExchangeAccount;\n\nuse dotenv::dotenv;\n\nuse nash_native_client::Environment;\n\nuse openlimits::exchange::OpenLimits;\n\nuse openlimits::exchange_ws::ExchangeWs;\n\nuse openlimits::model::websocket::AccountOrders;\n\nuse openlimits::model::{CancelAllOrdersRequest, OpenLimitOrderRequest, TimeInForce};\n\nuse openlimits::nash::{Nash, NashCredentials, NashParameters};\n\nuse openlimits::{exchange_ws::OpenLimitsWs, model::websocket::Subscription, nash::NashWebsocket};\n\nuse rust_decimal::Decimal;\n\nuse std::str::FromStr;\n\nuse std::time::Duration as NativeDuration;\n\nuse std::{env, sync::mpsc::sync_channel};\n\nuse tokio::time::Duration;\n\n\n\nasync fn init_exchange() -> Nash {\n\n dotenv().ok();\n\n\n\n let parameters = NashParameters {\n\n affiliate_code: None,\n","file_path":"tests/nash/websocket.rs","rank":34,"score":35662.99230224671},{"content":" market_pair: Some(\"eth_btc\".to_string()),\n\n };\n\n\n\n let resp = exchange\n\n .cancel_all_orders(&req)\n\n .await\n\n .expect(\"Couldn't cancel all orders.\");\n\n println!(\"{:?}\", resp);\n\n }\n\n\n\n rx.recv().expect(\"Couldn't receive sync message.\");\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn account_orders() {\n\n let client = init().await;\n\n let sub = Subscription::AccountOrders(AccountOrders {\n\n market: Some(\"eth_btc\".to_string()),\n\n order_type: None,\n\n status: None,\n","file_path":"tests/nash/websocket.rs","rank":35,"score":35659.98086671665},{"content":"#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn orderbook() {\n\n let client = init().await;\n\n let sub = Subscription::OrderBookUpdates(\"btc_usdc\".to_string());\n\n test_subscription_callback(client, sub).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn trades() {\n\n let client = init().await;\n\n let sub = Subscription::Trades(\"btc_usdc\".to_string());\n\n test_subscription_callback(client, sub).await;\n\n}\n\n\n\nasync fn init() -> OpenLimitsWs<NashWebsocket> {\n\n dotenv().ok();\n\n\n\n let websocket = NashWebsocket::new(NashParameters {\n\n credentials: Some(NashCredentials {\n\n secret: env::var(\"NASH_API_SECRET\").expect(\"Couldn't get environment variable.\"),\n","file_path":"tests/nash/websocket.rs","rank":36,"score":35658.65980268255},{"content":"use super::{OrderBookResponse, Trade};\n\nuse crate::model::{OrderStatus, OrderType, Side};\n\nuse serde::{Deserialize, Serialize};\n\nuse std::ops::Range;\n\n\n\n#[derive(Serialize, Deserialize, Debug, Clone, PartialEq, Eq, Hash)]\n\npub struct AccountOrders {\n\n pub market: Option<String>,\n\n pub order_type: Option<Vec<OrderType>>,\n\n pub buy_or_sell: Option<Side>,\n\n pub range: Option<Range<u64>>,\n\n pub status: Option<Vec<OrderStatus>>,\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Debug, Clone, PartialEq, Eq, Hash)]\n\npub enum Subscription {\n\n Ticker(String), // symbol\n\n OrderBookUpdates(String), // symbol\n\n Trades(String), // symbol\n\n AccountTrades(String), // symbol\n","file_path":"src/model/websocket.rs","rank":37,"score":35658.174555141115},{"content":"// FIXME: These test cases aren't implemented.\n\n// The purpose of this module is to be sure we have the same functionalities across all the\n\n// supported exchanges.\n\n\n\nuse dotenv::dotenv;\n\nuse nash_native_client::Environment;\n\nuse openlimits::any_exchange::{AnyExchange, AnyWsExchange};\n\nuse openlimits::binance::{Binance, BinanceCredentials, BinanceParameters};\n\nuse openlimits::coinbase::client::websocket::CoinbaseWebsocket;\n\nuse openlimits::coinbase::{Coinbase, CoinbaseCredentials, CoinbaseParameters};\n\nuse openlimits::exchange::OpenLimits;\n\nuse openlimits::exchange_ws::OpenLimitsWs;\n\nuse openlimits::nash::{Nash, NashCredentials, NashParameters};\n\nuse openlimits::shared::Result;\n\nuse std::env;\n\nuse tokio::time::Duration;\n\n\n\n#[tokio::test]\n\nasync fn account_test() {\n\n let _exchange = init().await;\n","file_path":"tests/any_exchange/websocket.rs","rank":38,"score":35656.08067819529},{"content":" buy_or_sell: None,\n\n range: None,\n\n });\n\n test_account_subscription_callback(client, sub, true).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn account_trades() {\n\n let client = init().await;\n\n let sub = Subscription::AccountTrades(\"eth_btc\".to_string());\n\n test_account_subscription_callback(client, sub, false).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn account_balance() {\n\n let client = init().await;\n\n let sub = Subscription::AccountBalance(\"eth\".to_string());\n\n test_account_subscription_callback(client, sub, false).await;\n\n}\n\n\n","file_path":"tests/nash/websocket.rs","rank":39,"score":35655.41915505281},{"content":"}\n\n\n\n#[tokio::test]\n\nasync fn ws_test() {\n\n let _websocket = init_ws().await;\n\n}\n\n\n\nasync fn _nash() -> Result<Nash> {\n\n let parameters = NashParameters {\n\n affiliate_code: None,\n\n credentials: Some(NashCredentials {\n\n secret: env::var(\"NASH_API_SECRET\").expect(\"Couldn't get environment variable.\"),\n\n session: env::var(\"NASH_API_KEY\").expect(\"Couldn't get environment variable.\"),\n\n }),\n\n environment: Environment::Sandbox,\n\n client_id: 1,\n\n timeout: Duration::from_secs_f32(10.0),\n\n sign_states_loop_interval: None,\n\n };\n\n OpenLimits::instantiate(parameters).await\n","file_path":"tests/any_exchange/websocket.rs","rank":40,"score":35654.57568267983},{"content":" session: env::var(\"NASH_API_KEY\").expect(\"Couldn't get environment variable.\"),\n\n }),\n\n affiliate_code: None,\n\n client_id: 1234,\n\n environment: Environment::Sandbox,\n\n timeout: Duration::from_secs(10),\n\n sign_states_loop_interval: None,\n\n })\n\n .await\n\n .expect(\"Couldn't connect.\");\n\n\n\n OpenLimitsWs { websocket }\n\n}\n","file_path":"tests/nash/websocket.rs","rank":41,"score":35653.08586869406},{"content":" }),\n\n };\n\n OpenLimits::instantiate(parameters).await\n\n}\n\n\n\nasync fn init() -> Result<AnyExchange> {\n\n dotenv().ok();\n\n coinbase().await.map(|exchange| exchange.into())\n\n}\n\n\n\nasync fn coinbase_websocket() -> OpenLimitsWs<CoinbaseWebsocket> {\n\n dotenv().ok();\n\n\n\n let websocket = CoinbaseWebsocket::new(CoinbaseParameters {\n\n sandbox: false,\n\n credentials: Some(CoinbaseCredentials {\n\n api_secret: env::var(\"COINBASE_API_SECRET\").unwrap(),\n\n api_key: env::var(\"COINBASE_API_KEY\").unwrap(),\n\n passphrase: env::var(\"COINBASE_PASSPHRASE\").unwrap(),\n\n }),\n\n });\n\n OpenLimitsWs { websocket }\n\n}\n\n\n\nasync fn init_ws() -> AnyWsExchange {\n\n coinbase_websocket().await.into()\n\n}\n","file_path":"tests/any_exchange/websocket.rs","rank":42,"score":35651.94287182948},{"content":" AccountBalance(String), // symbol\n\n AccountOrders(AccountOrders),\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub enum WebSocketResponse<T> {\n\n Generic(OpenLimitsWebSocketMessage),\n\n Raw(T),\n\n}\n\n\n\n#[derive(Debug, Clone, Serialize)]\n\npub enum OpenLimitsWebSocketMessage {\n\n Ping,\n\n OrderBook(OrderBookResponse),\n\n OrderBookDiff(OrderBookResponse),\n\n Trades(Vec<Trade>),\n\n}\n","file_path":"src/model/websocket.rs","rank":43,"score":35650.83967345624},{"content":"}\n\n\n\nasync fn _binance() -> Result<Binance> {\n\n let parameters = BinanceParameters {\n\n credentials: Some(BinanceCredentials {\n\n api_key: env::var(\"BINANCE_API_KEY\").expect(\"Couldn't get environment variable.\"),\n\n api_secret: env::var(\"BINANCE_API_SECRET\").expect(\"Couldn't get environment variable.\"),\n\n }),\n\n sandbox: true,\n\n };\n\n OpenLimits::instantiate(parameters).await\n\n}\n\n\n\nasync fn coinbase() -> Result<Coinbase> {\n\n let parameters = CoinbaseParameters {\n\n sandbox: true,\n\n credentials: Some(CoinbaseCredentials {\n\n api_key: env::var(\"COINBASE_API_KEY\").unwrap(),\n\n api_secret: env::var(\"COINBASE_API_SECRET\").unwrap(),\n\n passphrase: env::var(\"COINBASE_PASSPHRASE\").unwrap(),\n","file_path":"tests/any_exchange/websocket.rs","rank":44,"score":35646.43922103795},{"content":" })\n\n .await\n\n .expect(\"Couldn't subscribe.\");\n\n\n\n let exchange = init_exchange().await;\n\n let req = OpenLimitOrderRequest {\n\n time_in_force: TimeInForce::GoodTillCancelled,\n\n price: Decimal::from_str(\"0.01\").expect(\"Couldn't parse string.\"),\n\n size: Decimal::from_str(\"0.1\").expect(\"Couldn't parse string.\"),\n\n market_pair: String::from(\"eth_btc\"),\n\n post_only: false,\n\n };\n\n\n\n exchange\n\n .limit_buy(&req)\n\n .await\n\n .expect(\"Couldn't limit sell.\");\n\n\n\n if cancel_orders {\n\n let req = CancelAllOrdersRequest {\n","file_path":"tests/nash/websocket.rs","rank":45,"score":35643.16369010782},{"content":"use std::sync::mpsc::sync_channel;\n\n\n\nuse openlimits::{\n\n binance::{client::websocket::BinanceWebsocket, BinanceParameters},\n\n exchange_ws::{ExchangeWs, OpenLimitsWs},\n\n model::websocket::Subscription,\n\n};\n\n\n\nasync fn test_subscription_callback(websocket: OpenLimitsWs<BinanceWebsocket>, sub: Subscription) {\n\n let (tx, rx) = sync_channel(0);\n\n\n\n websocket\n\n .subscribe(sub, move |m| {\n\n m.as_ref().expect(\"Couldn't get response.\");\n\n tx.send(()).expect(\"Couldn't send sync message.\");\n\n })\n\n .await\n\n .expect(\"Couldn't subscribe.\");\n\n\n\n rx.recv().expect(\"Couldn't receive sync message.\");\n","file_path":"tests/binance/ws_callbacks.rs","rank":46,"score":35004.89908277085},{"content":"}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn orderbook() {\n\n let ws = init().await;\n\n let sub = Subscription::OrderBookUpdates(\"bnbbtc\".to_string());\n\n test_subscription_callback(ws, sub).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn trades() {\n\n let ws = init().await;\n\n let sub = Subscription::Trades(\"btcusdt\".to_string());\n\n test_subscription_callback(ws, sub).await;\n\n}\n\n\n\nasync fn init() -> OpenLimitsWs<BinanceWebsocket> {\n\n OpenLimitsWs {\n\n websocket: BinanceWebsocket::new(BinanceParameters::prod())\n\n .await\n\n .expect(\"Failed to create Client\"),\n\n }\n\n}\n","file_path":"tests/binance/ws_callbacks.rs","rank":47,"score":34981.54214039709},{"content":"#[async_trait]\n\npub trait Exchange: ExchangeInfoRetrieval + ExchangeAccount + ExchangeMarketData + Sized {\n\n type InitParams;\n\n type InnerClient;\n\n async fn new(params: Self::InitParams) -> Result<Self>;\n\n fn inner_client(&self) -> Option<&Self::InnerClient>;\n\n}\n\n\n","file_path":"src/exchange.rs","rank":48,"score":34709.1008143585},{"content":"use openlimits::{\n\n binance::{\n\n client::websocket::BinanceWebsocket, model::websocket::BinanceSubscription,\n\n BinanceParameters,\n\n },\n\n exchange_ws::ExchangeWs,\n\n};\n\nuse std::sync::mpsc::sync_channel;\n\n\n\nasync fn test_subscription_callback(websocket: BinanceWebsocket, sub: BinanceSubscription) {\n\n let (tx, rx) = sync_channel(0);\n\n\n\n websocket\n\n .subscribe(sub, move |m| {\n\n m.as_ref().expect(\"Couldn't get response.\");\n\n tx.send(()).expect(\"Couldn't send sync message.\");\n\n })\n\n .await\n\n .expect(\"Couldn't subscribe.\");\n\n\n","file_path":"tests/apis/binance/websocket.rs","rank":49,"score":34039.684895664184},{"content":"use openlimits::coinbase::{\n\n client::websocket::CoinbaseWebsocket, model::websocket::CoinbaseSubscription,\n\n CoinbaseParameters,\n\n};\n\nuse openlimits::exchange_ws::ExchangeWs;\n\nuse openlimits::model::websocket::{OpenLimitsWebSocketMessage, WebSocketResponse};\n\nuse std::sync::mpsc::sync_channel;\n\nuse std::time::Duration;\n\n\n\nasync fn test_subscription_callback(\n\n websocket: CoinbaseWebsocket,\n\n sub: CoinbaseSubscription,\n\n expected_messages: Vec<OpenLimitsWebSocketMessage>,\n\n) {\n\n let (tx, rx) = sync_channel(0);\n\n\n\n let mut received_messages: Vec<bool> = expected_messages.iter().map(|_| false).collect();\n\n\n\n websocket\n\n .subscribe(sub, move |message| {\n","file_path":"tests/apis/coinbase/websocket.rs","rank":50,"score":34039.45575880161},{"content":" rx.recv_timeout(Duration::from_secs(3))\n\n .expect(\"Couldn't receive sync message.\");\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn order_book() {\n\n let websocket = init().await;\n\n let sub = CoinbaseSubscription::Level2(\"BTC-USD\".to_string());\n\n let expected = vec![\n\n OpenLimitsWebSocketMessage::OrderBook(Default::default()),\n\n OpenLimitsWebSocketMessage::OrderBookDiff(Default::default()),\n\n ];\n\n test_subscription_callback(websocket, sub, expected).await;\n\n}\n\n\n\nasync fn init() -> CoinbaseWebsocket {\n\n CoinbaseWebsocket::new(CoinbaseParameters {\n\n sandbox: true,\n\n credentials: None,\n\n })\n\n}\n","file_path":"tests/apis/coinbase/websocket.rs","rank":51,"score":34025.94700567293},{"content":" rx.recv().expect(\"Couldn't receive sync message.\");\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn aggregate_trade() {\n\n let websocket = init().await;\n\n let sub = BinanceSubscription::AggregateTrade(\"bnbbtc\".to_string());\n\n test_subscription_callback(websocket, sub).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn candlestick() {\n\n let websocket = init().await;\n\n let sub = BinanceSubscription::Candlestick(\"bnbbtc\".to_string(), \"1m\".to_string());\n\n test_subscription_callback(websocket, sub).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn depth() {\n\n let websocket = init().await;\n","file_path":"tests/apis/binance/websocket.rs","rank":52,"score":34024.7457998738},{"content":"use crate::{\n\n binance::{\n\n model::websocket::{BinanceSubscription, BinanceWebsocketMessage},\n\n BinanceParameters,\n\n },\n\n errors::OpenLimitsError,\n\n exchange_ws::ExchangeWs,\n\n exchange_ws::Subscriptions,\n\n model::websocket::OpenLimitsWebSocketMessage,\n\n model::websocket::Subscription,\n\n model::websocket::WebSocketResponse,\n\n shared::Result,\n\n};\n\n\n\nuse async_trait::async_trait;\n\nuse futures::{stream::BoxStream, SinkExt, StreamExt};\n\nuse serde::{de, Deserialize, Serialize};\n\nuse serde_json::Value;\n\nuse std::sync::Mutex;\n\nuse std::{convert::TryFrom, fmt::Display};\n\nuse tokio::sync::mpsc::{unbounded_channel, UnboundedSender};\n\nuse tokio_tungstenite::{connect_async, tungstenite::protocol::Message};\n\n\n\nconst WS_URL_PROD: &str = \"wss://stream.binance.com:9443/stream\";\n\nconst WS_URL_SANDBOX: &str = \"wss://testnet.binance.vision/stream\";\n\n\n\n#[derive(Debug, Clone, Deserialize, Serialize)]\n\n#[serde(untagged)]\n","file_path":"src/binance/client/websocket.rs","rank":53,"score":34023.09582255776},{"content":"\n\n pub async fn connect(&self, subscribe: Subscribe) -> Result<SplitStream<WSStream>> {\n\n let ws_url = if self.parameters.sandbox {\n\n WS_URL_SANDBOX\n\n } else {\n\n WS_URL_PROD\n\n };\n\n let url = url::Url::parse(ws_url).expect(\"Couldn't parse url.\");\n\n let (ws_stream, _) = connect_async(&url).await?;\n\n let (mut sink, stream) = ws_stream.split();\n\n let subscribe = serde_json::to_string(&subscribe)?;\n\n\n\n sink.send(Message::Text(subscribe)).await?;\n\n Ok(stream)\n\n }\n\n}\n\n\n\nimpl Stream for CoinbaseWebsocket {\n\n type Item = Result<CoinbaseWebsocketMessage>;\n\n\n","file_path":"src/coinbase/client/websocket.rs","rank":54,"score":34021.48078759435},{"content":"use async_trait::async_trait;\n\nuse std::{collections::HashMap, pin::Pin, task::Poll};\n\n\n\nuse futures::{\n\n stream::{SplitStream, Stream},\n\n SinkExt, StreamExt,\n\n};\n\nuse serde::{Deserialize, Serialize};\n\nuse tokio::net::TcpStream;\n\n\n\nuse tokio_tungstenite::tungstenite::Message;\n\nuse tokio_tungstenite::{connect_async, MaybeTlsStream, WebSocketStream};\n\n\n\nuse crate::{\n\n coinbase::model::websocket::{\n\n Channel, CoinbaseSubscription, CoinbaseWebsocketMessage, Subscribe, SubscribeCmd,\n\n },\n\n errors::OpenLimitsError,\n\n shared::Result,\n\n};\n","file_path":"src/coinbase/client/websocket.rs","rank":55,"score":34019.2466445153},{"content":" })\n\n }\n\n\n\n async fn disconnect(&self) {\n\n if let Ok(mut senders) = self.disconnection_senders.lock() {\n\n for sender in senders.iter() {\n\n sender.send(()).ok();\n\n }\n\n senders.clear();\n\n }\n\n }\n\n\n\n async fn create_stream_specific(\n\n &self,\n\n subscriptions: Subscriptions<Self::Subscription>,\n\n ) -> Result<BoxStream<'static, Result<Self::Response>>> {\n\n let streams = subscriptions\n\n .into_iter()\n\n .map(|bs| bs.to_string())\n\n .collect::<Vec<String>>()\n","file_path":"src/binance/client/websocket.rs","rank":56,"score":34018.72896775577},{"content":" let sub = BinanceSubscription::Depth(\"bnbbtc\".to_string(), Some(1));\n\n test_subscription_callback(websocket, sub).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn mini_ticker() {\n\n let websocket = init().await;\n\n let sub = BinanceSubscription::MiniTicker(\"bnbbtc\".to_string());\n\n test_subscription_callback(websocket, sub).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn mini_ticker_all() {\n\n let websocket = init().await;\n\n let sub = BinanceSubscription::MiniTickerAll;\n\n test_subscription_callback(websocket, sub).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn order_book() {\n","file_path":"tests/apis/binance/websocket.rs","rank":57,"score":34018.15476889218},{"content":" if let Ok(message) = message.as_ref() {\n\n if let WebSocketResponse::Generic(message) = message {\n\n let expected_iter = expected_messages.iter().map(|expected| {\n\n std::mem::discriminant(expected) == std::mem::discriminant(&message)\n\n });\n\n for (already_received, currently_received) in\n\n received_messages.iter_mut().zip(expected_iter)\n\n {\n\n if !*already_received {\n\n *already_received = currently_received;\n\n }\n\n }\n\n if received_messages.iter().all(|received| *received) {\n\n tx.send(()).expect(\"Couldn't send sync message.\");\n\n }\n\n }\n\n }\n\n })\n\n .await\n\n .expect(\"Couldn't subscribe.\");\n","file_path":"tests/apis/coinbase/websocket.rs","rank":58,"score":34018.018603024844},{"content":" let websocket = init().await;\n\n let sub = BinanceSubscription::OrderBook(\"bnbbtc\".to_string(), 10);\n\n test_subscription_callback(websocket, sub).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn ticker() {\n\n let websocket = init().await;\n\n let sub = BinanceSubscription::Ticker(\"bnbbtc\".to_string());\n\n test_subscription_callback(websocket, sub).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n\nasync fn ticker_all() {\n\n let websocket = init().await;\n\n let sub = BinanceSubscription::TickerAll;\n\n test_subscription_callback(websocket, sub).await;\n\n}\n\n\n\n#[tokio::test(flavor = \"multi_thread\", worker_threads = 2)]\n","file_path":"tests/apis/binance/websocket.rs","rank":59,"score":34017.9609656571},{"content":"}\n\n\n\nimpl From<InputMessage> for CoinbaseWebsocketMessage {\n\n fn from(msg: InputMessage) -> Self {\n\n match msg {\n\n InputMessage::Subscriptions { channels } => {\n\n CoinbaseWebsocketMessage::Subscriptions { channels }\n\n }\n\n InputMessage::Heartbeat {\n\n sequence,\n\n last_trade_id,\n\n product_id,\n\n time,\n\n } => CoinbaseWebsocketMessage::Heartbeat {\n\n sequence,\n\n last_trade_id,\n\n product_id,\n\n time,\n\n },\n\n InputMessage::Ticker(ticker) => CoinbaseWebsocketMessage::Ticker(ticker),\n","file_path":"src/coinbase/model/websocket.rs","rank":60,"score":34017.47847149938},{"content":"async fn trade() {\n\n let websocket = init().await;\n\n let sub = BinanceSubscription::Trade(\"bnbbtc\".to_string());\n\n test_subscription_callback(websocket, sub).await;\n\n}\n\n\n\nasync fn init() -> BinanceWebsocket {\n\n BinanceWebsocket::new(BinanceParameters::sandbox())\n\n .await\n\n .expect(\"Failed to create Client\")\n\n}\n","file_path":"tests/apis/binance/websocket.rs","rank":61,"score":34017.41036611352},{"content":" CoinbaseSubscription::Level2(product_id) => (\n\n vec![Channel::Name(ChannelType::Level2)],\n\n vec![product_id.clone()],\n\n ),\n\n CoinbaseSubscription::Heartbeat(product_id) => (\n\n vec![Channel::Name(ChannelType::Heartbeat)],\n\n vec![product_id.clone()],\n\n ),\n\n _ => unimplemented!(),\n\n };\n\n let subscribe = Subscribe {\n\n _type: SubscribeCmd::Subscribe,\n\n auth: None,\n\n channels,\n\n product_ids,\n\n };\n\n let subscribe = serde_json::to_string(&subscribe)?;\n\n let (mut sink, stream) = ws_stream.split();\n\n let (disconnection_sender, mut disconnection_receiver) = unbounded_channel();\n\n sink.send(Message::Text(subscribe)).await?;\n","file_path":"src/coinbase/client/websocket.rs","rank":62,"score":34017.16909982844},{"content":"\n\nuse crate::coinbase::model::websocket::ChannelType;\n\nuse crate::coinbase::CoinbaseParameters;\n\nuse crate::exchange_ws::{ExchangeWs, Subscriptions};\n\nuse futures::stream::BoxStream;\n\nuse std::sync::Mutex;\n\nuse tokio::sync::mpsc::{unbounded_channel, UnboundedSender};\n\n\n\nconst WS_URL_PROD: &str = \"wss://ws-feed.pro.coinbase.com\";\n\nconst WS_URL_SANDBOX: &str = \"wss://ws-feed-public.sandbox.pro.coinbase.com\";\n\n\n\n#[derive(Debug, Clone, Deserialize, Serialize)]\n\n#[serde(untagged)]\n","file_path":"src/coinbase/client/websocket.rs","rank":63,"score":34017.06042642117},{"content":" ))\n\n } else if stream.name.ends_with(\"@depth\") {\n\n Ok(BinanceWebsocketMessage::Depth(\n\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\n\n ))\n\n } else if stream.name.contains(\"@depth\") {\n\n Ok(BinanceWebsocketMessage::OrderBook(\n\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\n\n ))\n\n } else {\n\n panic!(\"Not supported Subscription\");\n\n }\n\n }\n\n}\n\n\n\nimpl Display for BinanceSubscription {\n\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n\n match self {\n\n BinanceSubscription::AggregateTrade(ref symbol) => write!(f, \"{}@aggTrade\", symbol),\n\n BinanceSubscription::Candlestick(ref symbol, ref interval) => {\n","file_path":"src/binance/client/websocket.rs","rank":64,"score":34017.005420769885},{"content":" fn from(subscription: Subscription) -> Self {\n\n match subscription {\n\n Subscription::OrderBookUpdates(symbol) => BinanceSubscription::Depth(symbol, None),\n\n Subscription::Trades(symbol) => BinanceSubscription::Trade(symbol),\n\n _ => unimplemented!(),\n\n }\n\n }\n\n}\n\n\n\nimpl TryFrom<BinanceWebsocketMessage> for WebSocketResponse<BinanceWebsocketMessage> {\n\n type Error = OpenLimitsError;\n\n\n\n fn try_from(value: BinanceWebsocketMessage) -> Result<Self> {\n\n match value {\n\n BinanceWebsocketMessage::Depth(orderbook) => Ok(WebSocketResponse::Generic(\n\n OpenLimitsWebSocketMessage::OrderBook(orderbook.into()),\n\n )),\n\n BinanceWebsocketMessage::Trade(trade) => Ok(WebSocketResponse::Generic(\n\n OpenLimitsWebSocketMessage::Trades(trade.into()),\n\n )),\n\n BinanceWebsocketMessage::Ping => {\n\n Ok(WebSocketResponse::Generic(OpenLimitsWebSocketMessage::Ping))\n\n }\n\n BinanceWebsocketMessage::Close => Err(OpenLimitsError::SocketError()),\n\n _ => Ok(WebSocketResponse::Raw(value)),\n\n }\n\n }\n\n}\n\n\n","file_path":"src/binance/client/websocket.rs","rank":65,"score":34016.89482633964},{"content":" pub private: bool,\n\n pub user_id: Option<String>,\n\n #[serde(default)]\n\n pub profile_id: Option<String>,\n\n}\n\n\n\n#[derive(Deserialize, Debug, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub enum StopType {\n\n Entry,\n\n Exit,\n\n}\n\n\n\nimpl From<Subscription> for CoinbaseSubscription {\n\n fn from(subscription: Subscription) -> Self {\n\n match subscription {\n\n Subscription::OrderBookUpdates(symbol) => CoinbaseSubscription::Level2(symbol),\n\n _ => unimplemented!(),\n\n }\n\n }\n","file_path":"src/coinbase/model/websocket.rs","rank":66,"score":34016.391421075285},{"content":"use crate::coinbase::model::OrderSide;\n\nuse crate::errors::OpenLimitsError;\n\nuse crate::model::websocket::{OpenLimitsWebSocketMessage, Subscription, WebSocketResponse};\n\nuse crate::model::{AskBid, OrderBookResponse};\n\nuse crate::shared::Result;\n\nuse crate::shared::{string_to_decimal, string_to_opt_decimal};\n\nuse rust_decimal::prelude::Decimal;\n\nuse serde::{Deserialize, Deserializer, Serialize};\n\nuse std::convert::{TryFrom, TryInto};\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq, Hash)]\n\npub enum CoinbaseSubscription {\n\n Heartbeat(String),\n\n Status,\n\n // Ticker(String),\n\n Level2(String),\n\n // User,\n\n // Matches,\n\n // FullChannel\n\n}\n","file_path":"src/coinbase/model/websocket.rs","rank":67,"score":34015.97811804122},{"content":" tokio::spawn(async move {\n\n if disconnection_receiver.recv().await.is_some() {\n\n sink.close().await.ok();\n\n }\n\n });\n\n\n\n if let Ok(mut senders) = self.disconnection_senders.lock() {\n\n senders.push(disconnection_sender);\n\n }\n\n let s = stream.map(|message| parse_message(message?));\n\n\n\n Ok(s.boxed())\n\n }\n\n}\n","file_path":"src/coinbase/client/websocket.rs","rank":68,"score":34015.533868012484},{"content":"\n\nimpl TryFrom<CoinbaseWebsocketMessage> for WebSocketResponse<CoinbaseWebsocketMessage> {\n\n type Error = OpenLimitsError;\n\n\n\n fn try_from(value: CoinbaseWebsocketMessage) -> Result<Self> {\n\n match value {\n\n CoinbaseWebsocketMessage::Level2(level2) => {\n\n Ok(WebSocketResponse::Generic(level2.try_into()?))\n\n }\n\n _ => Ok(WebSocketResponse::Raw(value)),\n\n }\n\n }\n\n}\n\n\n\n#[derive(Deserialize, Debug, Clone)]\n\npub enum Level2 {\n\n Snapshot {\n\n product_id: String,\n\n bids: Vec<Level2SnapshotRecord>,\n\n asks: Vec<Level2SnapshotRecord>,\n","file_path":"src/coinbase/model/websocket.rs","rank":69,"score":34015.00187563144},{"content":"\n\n#[derive(Debug, Clone)]\n\npub enum CoinbaseWebsocketMessage {\n\n Subscriptions {\n\n channels: Vec<Channel>,\n\n },\n\n Heartbeat {\n\n sequence: usize,\n\n last_trade_id: usize,\n\n product_id: String,\n\n time: String,\n\n },\n\n Ticker(Ticker),\n\n Level2(Level2),\n\n Match(Match),\n\n Full(Full),\n\n Error {\n\n message: String,\n\n },\n\n}\n","file_path":"src/coinbase/model/websocket.rs","rank":70,"score":34014.58668012692},{"content":" for sender in senders.iter() {\n\n sender.send(()).ok();\n\n }\n\n senders.clear();\n\n }\n\n }\n\n\n\n async fn create_stream_specific(\n\n &self,\n\n subscription: Subscriptions<Self::Subscription>,\n\n ) -> Result<BoxStream<'static, Result<Self::Response>>> {\n\n let ws_url = if self.parameters.sandbox {\n\n WS_URL_SANDBOX\n\n } else {\n\n WS_URL_PROD\n\n };\n\n let endpoint = url::Url::parse(ws_url).expect(\"Couldn't parse url.\");\n\n let (ws_stream, _) = connect_async(endpoint).await?;\n\n\n\n let (channels, product_ids) = match &subscription.as_slice()[0] {\n","file_path":"src/coinbase/client/websocket.rs","rank":71,"score":34014.452588387285},{"content":" fn poll_next(\n\n mut self: std::pin::Pin<&mut Self>,\n\n cx: &mut std::task::Context<'_>,\n\n ) -> Poll<Option<Self::Item>> {\n\n for (_sub, stream) in &mut self.subscriptions.iter_mut() {\n\n if let Poll::Ready(Some(message)) = Pin::new(stream).poll_next(cx) {\n\n let message = parse_message(message?);\n\n return Poll::Ready(Some(message));\n\n }\n\n }\n\n\n\n std::task::Poll::Pending\n\n }\n\n}\n\n\n","file_path":"src/coinbase/client/websocket.rs","rank":72,"score":34013.913545598625},{"content":"use serde::{Deserialize, Serialize};\n\n\n\nuse crate::shared::string_to_decimal;\n\n\n\nuse super::{\n\n AskBid, Kline, OrderBook, OrderExecType, OrderRejectReason, OrderStatus, OrderType, Side,\n\n TimeInForce,\n\n};\n\n\n\nuse rust_decimal::prelude::Decimal;\n\n\n\n#[derive(Debug, Clone, PartialEq, Eq, Hash)]\n\npub enum BinanceSubscription {\n\n UserData(String), // listen key\n\n AggregateTrade(String), // symbol\n\n Trade(String), // symbol\n\n Candlestick(String, String), // (symbol, interval)\n\n MiniTicker(String), // symbol\n\n MiniTickerAll,\n\n Ticker(String), // symbol\n","file_path":"src/binance/model/websocket.rs","rank":73,"score":34013.48717151605},{"content":" InputMessage::Open(open) => CoinbaseWebsocketMessage::Full(Full::Open(open)),\n\n InputMessage::Done(done) => CoinbaseWebsocketMessage::Full(Full::Done(done)),\n\n InputMessage::Match(_match) => CoinbaseWebsocketMessage::Full(Full::Match(_match)),\n\n InputMessage::Change(change) => CoinbaseWebsocketMessage::Full(Full::Change(change)),\n\n InputMessage::Activate(activate) => {\n\n CoinbaseWebsocketMessage::Full(Full::Activate(activate))\n\n }\n\n InputMessage::Error { message } => CoinbaseWebsocketMessage::Error { message },\n\n }\n\n }\n\n}\n\n\n\nimpl<'de> Deserialize<'de> for CoinbaseWebsocketMessage {\n\n fn deserialize<D>(deserializer: D) -> std::result::Result<Self, D::Error>\n\n where\n\n D: Deserializer<'de>,\n\n {\n\n Deserialize::deserialize(deserializer).map(|input_msg: InputMessage| input_msg.into())\n\n }\n\n}\n","file_path":"src/coinbase/model/websocket.rs","rank":74,"score":34013.037297399154},{"content":" Close,\n\n Binary(Vec<u8>), // Unexpected, unparsed\n\n}\n\n\n\n#[derive(Debug, Serialize, Deserialize, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct TradeMessage {\n\n #[serde(rename = \"e\")]\n\n pub event_type: String,\n\n #[serde(rename = \"E\")]\n\n pub event_time: u64,\n\n #[serde(rename = \"s\")]\n\n pub symbol: String,\n\n #[serde(rename = \"t\")]\n\n pub trade_id: u64,\n\n #[serde(rename = \"p\", with = \"string_to_decimal\")]\n\n pub price: Decimal,\n\n #[serde(rename = \"q\", with = \"string_to_decimal\")]\n\n pub qty: Decimal,\n\n #[serde(rename = \"b\")]\n","file_path":"src/binance/model/websocket.rs","rank":75,"score":34010.97963197999},{"content":" pub quote_volume: Decimal,\n\n #[serde(rename = \"O\")]\n\n pub open_time: u64,\n\n #[serde(rename = \"C\")]\n\n pub close_time: u64,\n\n #[serde(rename = \"F\")]\n\n pub first_trade_id: u64,\n\n #[serde(rename = \"L\")]\n\n pub last_trade_id: u64,\n\n #[serde(rename = \"n\")]\n\n pub num_trades: u64,\n\n}\n\n\n\n#[derive(Debug, Serialize, Deserialize, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct CandlestickMessage {\n\n #[serde(rename = \"e\")]\n\n pub event_type: String,\n\n #[serde(rename = \"E\")]\n\n pub event_time: u64,\n","file_path":"src/binance/model/websocket.rs","rank":76,"score":34010.8316087225},{"content":" InputMessage::Snapshot {\n\n product_id,\n\n bids,\n\n asks,\n\n } => CoinbaseWebsocketMessage::Level2(Level2::Snapshot {\n\n product_id,\n\n bids,\n\n asks,\n\n }),\n\n InputMessage::L2update {\n\n product_id,\n\n changes,\n\n } => CoinbaseWebsocketMessage::Level2(Level2::L2update {\n\n product_id,\n\n changes,\n\n }),\n\n InputMessage::LastMatch(_match) => CoinbaseWebsocketMessage::Match(_match),\n\n InputMessage::Received(_match) => {\n\n CoinbaseWebsocketMessage::Full(Full::Received(_match))\n\n }\n","file_path":"src/coinbase/model/websocket.rs","rank":77,"score":34010.705277768866},{"content":" update_id,\n\n last_update_id,\n\n };\n\n OpenLimitsWebSocketMessage::OrderBookDiff(order_book_response)\n\n }\n\n })\n\n }\n\n}\n\n\n\n#[derive(Deserialize, Debug, Clone)]\n\npub struct Level2SnapshotRecord {\n\n #[serde(with = \"string_to_decimal\")]\n\n pub price: Decimal,\n\n #[serde(with = \"string_to_decimal\")]\n\n pub size: Decimal,\n\n}\n\n\n\nimpl From<&Level2SnapshotRecord> for AskBid {\n\n fn from(record: &Level2SnapshotRecord) -> Self {\n\n let price = record.price;\n","file_path":"src/coinbase/model/websocket.rs","rank":78,"score":34010.53481975771},{"content":" .join(\"/\");\n\n\n\n let ws_url = match self.parameters.sandbox {\n\n true => WS_URL_SANDBOX,\n\n false => WS_URL_PROD,\n\n };\n\n let endpoint = url::Url::parse(&format!(\"{}?streams={}\", ws_url, streams))\n\n .map_err(OpenLimitsError::UrlParserError)?;\n\n let (ws_stream, _) = connect_async(endpoint).await?;\n\n\n\n let (mut sink, stream) = ws_stream.split();\n\n let (disconnection_sender, mut disconnection_receiver) = unbounded_channel();\n\n tokio::spawn(async move {\n\n if disconnection_receiver.recv().await.is_some() {\n\n sink.close().await.ok();\n\n }\n\n });\n\n\n\n if let Ok(mut senders) = self.disconnection_senders.lock() {\n\n senders.push(disconnection_sender);\n","file_path":"src/binance/client/websocket.rs","rank":79,"score":34010.49404861168},{"content":" Level2,\n\n Matches,\n\n Full,\n\n User,\n\n}\n\n\n\n#[derive(Deserialize, Debug)]\n\n#[serde(tag = \"type\")]\n\n#[serde(rename_all = \"snake_case\")]\n\npub(crate) enum InputMessage {\n\n Subscriptions {\n\n channels: Vec<Channel>,\n\n },\n\n Heartbeat {\n\n sequence: usize,\n\n last_trade_id: usize,\n\n product_id: String,\n\n time: String,\n\n },\n\n Ticker(Ticker),\n","file_path":"src/coinbase/model/websocket.rs","rank":80,"score":34010.23276333194},{"content":" TickerAll,\n\n OrderBook(String, i64), // (symbol, depth)\n\n Depth(String, Option<u16>), // (symbol, interval)\n\n}\n\n\n\n#[derive(Debug, Clone, Serialize)]\n\npub enum BinanceWebsocketMessage {\n\n UserOrderUpdate(UserOrderUpdate),\n\n UserAccountUpdate(AccountUpdate),\n\n AggregateTrade(AggregateTrade),\n\n Trade(TradeMessage),\n\n Candlestick(CandlestickMessage),\n\n MiniTicker(MiniTicker),\n\n MiniTickerAll(Vec<MiniTicker>),\n\n Ticker(Ticker),\n\n TickerAll(Vec<Ticker>),\n\n OrderBook(OrderBook),\n\n Depth(Depth),\n\n Ping,\n\n Pong,\n","file_path":"src/binance/model/websocket.rs","rank":81,"score":34009.892001461165},{"content":"pub struct UserOrderUpdate {\n\n #[serde(rename = \"e\")]\n\n pub event_type: String,\n\n #[serde(rename = \"E\")]\n\n pub event_time: u64,\n\n #[serde(rename = \"s\")]\n\n pub symbol: String,\n\n #[serde(rename = \"c\")]\n\n pub new_client_order_id: String,\n\n #[serde(rename = \"S\")]\n\n pub side: Side,\n\n #[serde(rename = \"o\")]\n\n pub order_type: OrderType,\n\n #[serde(rename = \"f\")]\n\n pub time_in_force: TimeInForce,\n\n #[serde(rename = \"q\", with = \"string_to_decimal\")]\n\n pub qty: Decimal,\n\n #[serde(rename = \"p\", with = \"string_to_decimal\")]\n\n pub price: Decimal,\n\n #[serde(rename = \"P\", with = \"string_to_decimal\")]\n","file_path":"src/binance/model/websocket.rs","rank":82,"score":34009.86135053109},{"content":" vec![Channel::Name(ChannelType::Level2)],\n\n vec![product_id.clone()],\n\n ),\n\n CoinbaseSubscription::Heartbeat(product_id) => (\n\n vec![Channel::Name(ChannelType::Heartbeat)],\n\n vec![product_id.clone()],\n\n ),\n\n _ => unimplemented!(),\n\n };\n\n let subscribe = Subscribe {\n\n _type: SubscribeCmd::Subscribe,\n\n auth: None,\n\n channels,\n\n product_ids,\n\n };\n\n\n\n let stream = self.connect(subscribe).await?;\n\n self.subscriptions.insert(subscription, stream);\n\n Ok(())\n\n }\n","file_path":"src/coinbase/client/websocket.rs","rank":83,"score":34009.66385391634},{"content":" pub price: Option<Decimal>,\n\n pub side: super::OrderSide,\n\n pub user_id: Option<String>,\n\n #[serde(default)]\n\n pub profile_id: Option<String>,\n\n}\n\n\n\n#[derive(Deserialize, Debug, Clone)]\n\npub struct Activate {\n\n pub product_id: String,\n\n #[serde(with = \"string_to_decimal\")]\n\n pub timestamp: Decimal,\n\n pub order_id: String,\n\n pub stop_type: StopType,\n\n #[serde(with = \"string_to_decimal\")]\n\n pub size: Decimal,\n\n #[serde(with = \"string_to_decimal\")]\n\n pub funds: Decimal,\n\n #[serde(with = \"string_to_decimal\")]\n\n pub taker_fee_rate: Decimal,\n","file_path":"src/coinbase/model/websocket.rs","rank":84,"score":34009.46424399006},{"content":" ))\n\n } else if stream.name.contains(\"@kline_\") {\n\n Ok(BinanceWebsocketMessage::Candlestick(\n\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\n\n ))\n\n } else if stream.name.contains(\"@ticker\") {\n\n Ok(BinanceWebsocketMessage::Ticker(\n\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\n\n ))\n\n } else if stream.name.eq(\"!ticker@arr\") {\n\n Ok(BinanceWebsocketMessage::TickerAll(\n\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\n\n ))\n\n } else if stream.name.ends_with(\"@miniTicker\") {\n\n Ok(BinanceWebsocketMessage::MiniTicker(\n\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\n\n ))\n\n } else if stream.name.ends_with(\"!miniTicker@arr\") {\n\n Ok(BinanceWebsocketMessage::MiniTickerAll(\n\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\n","file_path":"src/binance/client/websocket.rs","rank":85,"score":34009.44827499353},{"content":"#[serde(rename_all = \"camelCase\")]\n\npub enum SubscribeCmd {\n\n Subscribe,\n\n}\n\n\n\n#[derive(Serialize, Clone, Deserialize, Debug, PartialEq, Eq, Hash)]\n\n#[serde(untagged)]\n\npub enum Channel {\n\n Name(ChannelType),\n\n WithProduct {\n\n name: ChannelType,\n\n product_ids: Vec<String>,\n\n },\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Debug, Clone, PartialEq, Eq, Hash)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub enum ChannelType {\n\n Heartbeat,\n\n Ticker,\n","file_path":"src/coinbase/model/websocket.rs","rank":86,"score":34009.31483031311},{"content":" pub stop_price: Decimal,\n\n #[serde(rename = \"F\", with = \"string_to_decimal\")]\n\n pub iceberg_qty: Decimal,\n\n #[serde(skip_serializing)]\n\n pub g: i32,\n\n #[serde(skip_serializing, rename = \"C\")]\n\n pub c_ignore: Option<String>,\n\n #[serde(rename = \"x\")]\n\n pub execution_type: OrderExecType,\n\n #[serde(rename = \"X\")]\n\n pub order_status: OrderStatus,\n\n #[serde(rename = \"r\")]\n\n pub order_reject_reason: OrderRejectReason,\n\n #[serde(rename = \"i\")]\n\n pub order_id: u64,\n\n #[serde(rename = \"l\", with = \"string_to_decimal\")]\n\n pub qty_last_filled_trade: Decimal,\n\n #[serde(rename = \"z\", with = \"string_to_decimal\")]\n\n pub accumulated_qty_filled_trades: Decimal,\n\n #[serde(rename = \"L\", with = \"string_to_decimal\")]\n","file_path":"src/binance/model/websocket.rs","rank":87,"score":34008.95406686824},{"content":"\n\n#[derive(Serialize, Deserialize, Debug)]\n\npub struct Auth {\n\n pub signature: String,\n\n pub key: String,\n\n pub passphrase: String,\n\n pub timestamp: String,\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Debug)]\n\npub struct Subscribe {\n\n #[serde(rename = \"type\")]\n\n pub _type: SubscribeCmd,\n\n pub product_ids: Vec<String>,\n\n pub channels: Vec<Channel>,\n\n #[serde(flatten)]\n\n pub auth: Option<Auth>,\n\n}\n\n\n\n#[derive(Serialize, Deserialize, Debug)]\n","file_path":"src/coinbase/model/websocket.rs","rank":88,"score":34008.77893187938},{"content":" #[serde(rename = \"s\")]\n\n pub symbol: String,\n\n #[serde(rename = \"k\")]\n\n pub kline: Kline,\n\n}\n\n\n\n#[derive(Debug, Serialize, Deserialize, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct AccountUpdate {\n\n #[serde(rename = \"e\")]\n\n pub event_type: String,\n\n #[serde(rename = \"E\")]\n\n pub event_time: u64,\n\n #[serde(rename = \"m\")]\n\n pub maker_commision_rate: u64,\n\n #[serde(rename = \"t\")]\n\n pub taker_commision_rate: u64,\n\n #[serde(rename = \"b\")]\n\n pub buyer_commision_rate: u64,\n\n #[serde(rename = \"s\")]\n","file_path":"src/binance/model/websocket.rs","rank":89,"score":34008.403710471706},{"content":" pub buyer_order_id: u64,\n\n #[serde(rename = \"a\")]\n\n pub seller_order_id: u64,\n\n #[serde(rename = \"T\")]\n\n pub trade_order_time: u64,\n\n #[serde(rename = \"m\")]\n\n pub is_buyer_maker: bool,\n\n #[serde(skip_serializing, rename = \"M\")]\n\n pub m_ignore: bool,\n\n}\n\n\n\n#[derive(Debug, Serialize, Deserialize, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct AggregateTrade {\n\n #[serde(rename = \"e\")]\n\n pub event_type: String,\n\n #[serde(rename = \"E\")]\n\n pub event_time: u64,\n\n #[serde(rename = \"s\")]\n\n pub symbol: String,\n","file_path":"src/binance/model/websocket.rs","rank":90,"score":34008.28863090266},{"content":" pub cumulative_quote_asset_transacted_qty: Decimal,\n\n}\n\n\n\n#[derive(Debug, Serialize, Deserialize, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct Depth {\n\n #[serde(rename = \"e\")]\n\n pub event_type: String,\n\n #[serde(rename = \"E\")]\n\n pub event_time: u64,\n\n #[serde(rename = \"s\")]\n\n pub symbol: String,\n\n #[serde(rename = \"U\")]\n\n pub first_update_id: u64,\n\n #[serde(rename = \"u\")]\n\n pub final_update_id: u64,\n\n #[serde(rename = \"b\")]\n\n pub bids: Vec<AskBid>,\n\n #[serde(rename = \"a\")]\n\n pub asks: Vec<AskBid>,\n","file_path":"src/binance/model/websocket.rs","rank":91,"score":34008.26233379846},{"content":"}\n\n\n\n#[derive(Debug, Serialize, Deserialize, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct Ticker {\n\n #[serde(rename = \"e\")]\n\n pub event_type: String,\n\n #[serde(rename = \"E\")]\n\n pub event_time: u64,\n\n #[serde(rename = \"s\")]\n\n pub symbol: String,\n\n #[serde(rename = \"p\", with = \"string_to_decimal\")]\n\n pub price_change: Decimal,\n\n #[serde(rename = \"P\", with = \"string_to_decimal\")]\n\n pub price_change_percent: Decimal,\n\n #[serde(rename = \"w\", with = \"string_to_decimal\")]\n\n pub average_price: Decimal,\n\n #[serde(rename = \"x\", with = \"string_to_decimal\")]\n\n pub prev_close: Decimal,\n\n #[serde(rename = \"c\", with = \"string_to_decimal\")]\n","file_path":"src/binance/model/websocket.rs","rank":92,"score":34008.12590061864},{"content":" write!(f, \"{}@kline_{}\", symbol, interval)\n\n }\n\n BinanceSubscription::Depth(ref symbol, interval) => match interval {\n\n None => write!(f, \"{}@depth\", symbol),\n\n Some(i) => write!(f, \"{}@depth@{}ms\", symbol, i),\n\n },\n\n BinanceSubscription::MiniTicker(symbol) => write!(f, \"{}@miniTicker\", symbol),\n\n BinanceSubscription::MiniTickerAll => write!(f, \"!miniTicker@arr\"),\n\n BinanceSubscription::OrderBook(ref symbol, depth) => {\n\n write!(f, \"{}@depth{}\", symbol, depth)\n\n }\n\n BinanceSubscription::Ticker(ref symbol) => write!(f, \"{}@ticker\", symbol),\n\n BinanceSubscription::TickerAll => write!(f, \"!ticker@arr\"),\n\n BinanceSubscription::Trade(ref symbol) => write!(f, \"{}@trade\", symbol),\n\n BinanceSubscription::UserData(ref key) => write!(f, \"{}\", key),\n\n }\n\n }\n\n}\n\n\n\nimpl From<Subscription> for BinanceSubscription {\n","file_path":"src/binance/client/websocket.rs","rank":93,"score":34008.111954646614},{"content":" #[serde(rename = \"l\", with = \"string_to_decimal\")]\n\n pub locked: Decimal,\n\n}\n\n\n\n#[derive(Debug, Serialize, Deserialize, Clone)]\n\n#[serde(rename_all = \"camelCase\")]\n\npub struct MiniTicker {\n\n #[serde(rename = \"e\")]\n\n pub event_type: String,\n\n #[serde(rename = \"E\")]\n\n pub event_time: u64,\n\n #[serde(rename = \"s\")]\n\n pub symbol: String,\n\n #[serde(rename = \"c\", with = \"string_to_decimal\")]\n\n pub close: Decimal,\n\n #[serde(rename = \"o\", with = \"string_to_decimal\")]\n\n pub open: Decimal,\n\n #[serde(rename = \"l\", with = \"string_to_decimal\")]\n\n pub low: Decimal,\n\n #[serde(rename = \"h\", with = \"string_to_decimal\")]\n\n pub high: Decimal,\n\n #[serde(rename = \"v\", with = \"string_to_decimal\")]\n\n pub volume: Decimal,\n\n #[serde(rename = \"q\", with = \"string_to_decimal\")]\n\n pub quote_volume: Decimal,\n\n}\n","file_path":"src/binance/model/websocket.rs","rank":94,"score":34008.041164706694},{"content":" let qty = record.size;\n\n Self { price, qty }\n\n }\n\n}\n\n\n\n#[derive(Deserialize, Debug, Clone)]\n\npub struct Level2UpdateRecord {\n\n pub side: super::OrderSide,\n\n #[serde(with = \"string_to_decimal\")]\n\n pub price: Decimal,\n\n #[serde(with = \"string_to_decimal\")]\n\n pub size: Decimal,\n\n}\n\n\n\nimpl From<&Level2UpdateRecord> for AskBid {\n\n fn from(record: &Level2UpdateRecord) -> Self {\n\n let price = record.price;\n\n let qty = record.size;\n\n Self { price, qty }\n\n }\n","file_path":"src/coinbase/model/websocket.rs","rank":95,"score":34007.939476025975},{"content":" },\n\n Empty {\n\n sequence: usize,\n\n product_id: String,\n\n #[serde(with = \"string_to_opt_decimal\")]\n\n price: Option<Decimal>,\n\n },\n\n}\n\n\n\nimpl Ticker {\n\n pub fn price(&self) -> Decimal {\n\n match self {\n\n Ticker::Full { price, .. } => *price,\n\n Ticker::Empty { price, .. } => price.expect(\"Couldn't get price.\"),\n\n }\n\n }\n\n\n\n pub fn time(&self) -> Option<&String> {\n\n match self {\n\n Ticker::Full { time, .. } => Some(time),\n","file_path":"src/coinbase/model/websocket.rs","rank":96,"score":34007.59879699431},{"content":" Ticker::Full { best_ask, .. } => Some(best_ask.expect(\"Couldn't get best ask.\")),\n\n Ticker::Empty { .. } => None,\n\n }\n\n }\n\n}\n\n\n\n#[derive(Deserialize, Debug, Clone)]\n\npub enum Full {\n\n Received(Received),\n\n Open(Open),\n\n Done(Done),\n\n Match(Match),\n\n Change(Change),\n\n Activate(Activate),\n\n}\n\n\n\nimpl Full {\n\n pub fn price(&self) -> Option<&Decimal> {\n\n match self {\n\n Full::Received(Received::Limit { price, .. }) => Some(price),\n","file_path":"src/coinbase/model/websocket.rs","rank":97,"score":34007.36727483327},{"content":"#[derive(Deserialize, Debug, Clone)]\n\npub struct Match {\n\n pub trade_id: usize,\n\n pub sequence: usize,\n\n pub maker_order_id: String,\n\n pub taker_order_id: String,\n\n pub time: String,\n\n pub product_id: String,\n\n #[serde(with = \"string_to_decimal\")]\n\n pub size: Decimal,\n\n #[serde(with = \"string_to_decimal\")]\n\n pub price: Decimal,\n\n pub side: super::OrderSide,\n\n pub taker_user_id: Option<String>,\n\n pub taker_profile_id: Option<String>,\n\n pub maker_user_id: Option<String>,\n\n pub maker_profile_id: Option<String>,\n\n pub user_id: Option<String>,\n\n #[serde(default)]\n\n pub profile_id: Option<String>,\n","file_path":"src/coinbase/model/websocket.rs","rank":98,"score":34005.937378898816},{"content":" }\n\n }\n\n\n\n pub fn sequence(&self) -> Option<&usize> {\n\n match self {\n\n Full::Received(Received::Limit { sequence, .. }) => Some(sequence),\n\n Full::Received(Received::Market { sequence, .. }) => Some(sequence),\n\n Full::Open(Open { sequence, .. }) => Some(sequence),\n\n Full::Done(Done::Limit { sequence, .. }) => sequence.as_ref(),\n\n Full::Done(Done::Market { sequence, .. }) => Some(sequence),\n\n Full::Match(Match { sequence, .. }) => Some(sequence),\n\n Full::Change(Change { sequence, .. }) => Some(sequence),\n\n Full::Activate(Activate { .. }) => None,\n\n }\n\n }\n\n}\n\n\n\n#[derive(Deserialize, Debug, Clone)]\n\n#[serde(tag = \"order_type\")]\n\n#[serde(rename_all = \"camelCase\")]\n","file_path":"src/coinbase/model/websocket.rs","rank":99,"score":34005.79113737625}],"string":"[\n {\n \"content\": \"#[async_trait]\\n\\npub trait ExchangeWs: Send + Sync + Sized {\\n\\n type InitParams: Clone + Send + Sync + 'static;\\n\\n type Subscription: From<Subscription> + Send + Sync + Sized + Clone;\\n\\n type Response: TryInto<WebSocketResponse<Self::Response>, Error = OpenLimitsError>\\n\\n + Send\\n\\n + Sync\\n\\n + Clone\\n\\n + Sized\\n\\n + Debug\\n\\n + 'static;\\n\\n\\n\\n async fn new(params: Self::InitParams) -> Result<Self>;\\n\\n\\n\\n async fn disconnect(&self);\\n\\n\\n\\n async fn create_stream_specific(\\n\\n &self,\\n\\n subscriptions: Subscriptions<Self::Subscription>,\\n\\n ) -> Result<BoxStream<'static, Result<Self::Response>>>;\\n\\n\\n\",\n \"file_path\": \"src/exchange_ws.rs\",\n \"rank\": 0,\n \"score\": 119419.3980410245\n },\n {\n \"content\": \"fn parse_message(ws_message: Message) -> Result<CoinbaseWebsocketMessage> {\\n\\n let msg = match ws_message {\\n\\n Message::Text(m) => m,\\n\\n _ => return Err(OpenLimitsError::SocketError()),\\n\\n };\\n\\n Ok(serde_json::from_str(&msg)?)\\n\\n}\\n\\n\\n\\n#[async_trait]\\n\\nimpl ExchangeWs for CoinbaseWebsocket {\\n\\n type InitParams = CoinbaseParameters;\\n\\n type Subscription = CoinbaseSubscription;\\n\\n type Response = CoinbaseWebsocketMessage;\\n\\n\\n\\n async fn new(parameters: Self::InitParams) -> Result<Self> {\\n\\n Ok(CoinbaseWebsocket::new(parameters))\\n\\n }\\n\\n\\n\\n async fn disconnect(&self) {\\n\\n if let Ok(mut senders) = self.disconnection_senders.lock() {\\n\",\n \"file_path\": \"src/coinbase/client/websocket.rs\",\n \"rank\": 1,\n \"score\": 115496.55660945199\n },\n {\n \"content\": \"fn parse_message(ws_message: Message) -> Result<BinanceWebsocketMessage> {\\n\\n let msg = match ws_message {\\n\\n Message::Text(m) => m,\\n\\n Message::Binary(b) => return Ok(BinanceWebsocketMessage::Binary(b)),\\n\\n Message::Pong(..) => return Ok(BinanceWebsocketMessage::Pong),\\n\\n Message::Ping(..) => return Ok(BinanceWebsocketMessage::Ping),\\n\\n Message::Close(..) => return Ok(BinanceWebsocketMessage::Close),\\n\\n };\\n\\n\\n\\n serde_json::from_str(&msg).map_err(OpenLimitsError::JsonError)\\n\\n}\\n\",\n \"file_path\": \"src/binance/client/websocket.rs\",\n \"rank\": 2,\n \"score\": 115496.55660945199\n },\n {\n \"content\": \"#[derive(Deserialize)]\\n\\nstruct BinanceWebsocketStream {\\n\\n #[serde(rename = \\\"stream\\\")]\\n\\n pub name: String,\\n\\n pub data: Value,\\n\\n}\\n\\n\\n\\nimpl<'de> Deserialize<'de> for BinanceWebsocketMessage {\\n\\n fn deserialize<D>(deserializer: D) -> core::result::Result<Self, D::Error>\\n\\n where\\n\\n D: serde::Deserializer<'de>,\\n\\n {\\n\\n let stream: BinanceWebsocketStream = BinanceWebsocketStream::deserialize(deserializer)?;\\n\\n\\n\\n if stream.name.ends_with(\\\"@aggTrade\\\") {\\n\\n Ok(BinanceWebsocketMessage::AggregateTrade(\\n\\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\\n\\n ))\\n\\n } else if stream.name.contains(\\\"@trade\\\") {\\n\\n Ok(BinanceWebsocketMessage::Trade(\\n\\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\\n\",\n \"file_path\": \"src/binance/client/websocket.rs\",\n \"rank\": 3,\n \"score\": 90397.1879028519\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait ExchangeInfoRetrieval: Sync {\\n\\n async fn get_pair(&self, name: &str) -> Result<MarketPairHandle>;\\n\\n async fn retrieve_pairs(&self) -> Result<Vec<MarketPair>>;\\n\\n async fn refresh_market_info(&self) -> Result<Vec<MarketPairHandle>>;\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct MarketPair {\\n\\n pub base: String,\\n\\n pub quote: String,\\n\\n pub symbol: String,\\n\\n pub base_increment: Decimal,\\n\\n pub quote_increment: Decimal,\\n\\n pub min_base_trade_size: Option<Decimal>,\\n\\n pub min_quote_trade_size: Option<Decimal>,\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct MarketPairHandle {\\n\\n pub inner: Arc<RwLock<MarketPair>>,\\n\",\n \"file_path\": \"src/exchange_info.rs\",\n \"rank\": 4,\n \"score\": 87427.25960978286\n },\n {\n \"content\": \"pub fn timestamp_to_naive_datetime(timestamp: u64) -> chrono::naive::NaiveDateTime {\\n\\n let seconds = (timestamp / 1000) as i64;\\n\\n let nanos = ((timestamp % 1000) * 1_000_000) as u32;\\n\\n\\n\\n chrono::NaiveDateTime::from_timestamp(seconds, nanos)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/shared.rs\",\n \"rank\": 5,\n \"score\": 67634.16532944998\n },\n {\n \"content\": \"pub fn timestamp_to_utc_datetime(timestamp: u64) -> chrono::DateTime<chrono::Utc> {\\n\\n let d = timestamp_to_naive_datetime(timestamp);\\n\\n chrono::DateTime::<chrono::Utc>::from_utc(d, chrono::Utc)\\n\\n}\\n\",\n \"file_path\": \"src/shared.rs\",\n \"rank\": 6,\n \"score\": 66198.15495627497\n },\n {\n \"content\": \"type WSStream = WebSocketStream<MaybeTlsStream<TcpStream>>;\\n\\n\\n\\npub struct CoinbaseWebsocket {\\n\\n pub subscriptions: HashMap<CoinbaseSubscription, SplitStream<WSStream>>,\\n\\n pub parameters: CoinbaseParameters,\\n\\n disconnection_senders: Mutex<Vec<UnboundedSender<()>>>,\\n\\n}\\n\\n\\n\\nimpl CoinbaseWebsocket {\\n\\n pub fn new(parameters: CoinbaseParameters) -> Self {\\n\\n Self {\\n\\n subscriptions: Default::default(),\\n\\n parameters,\\n\\n disconnection_senders: Default::default(),\\n\\n }\\n\\n }\\n\\n\\n\\n pub async fn subscribe_(&mut self, subscription: CoinbaseSubscription) -> Result<()> {\\n\\n let (channels, product_ids) = match &subscription {\\n\\n CoinbaseSubscription::Level2(product_id) => (\\n\",\n \"file_path\": \"src/coinbase/client/websocket.rs\",\n \"rank\": 7,\n \"score\": 59985.75342014043\n },\n {\n \"content\": \"pub fn get_pair<'a>(name: &str, exchange_info: &'a ExchangeInfo) -> Result<MarketPairHandle> {\\n\\n exchange_info.get_pair(name)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/exchange_info.rs\",\n \"rank\": 8,\n \"score\": 59519.84419099382\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"windows\\\"))]\\n\\nfn main() {}\",\n \"file_path\": \"build.rs\",\n \"rank\": 9,\n \"score\": 57066.61250315179\n },\n {\n \"content\": \"#[cfg(target_os = \\\"windows\\\")]\\n\\nfn main() {\\n\\n use std::process::Command;\\n\\n use std::path::Path;\\n\\n\\n\\n let rustup_output = Command::new(\\\"rustup\\\")\\n\\n .arg(\\\"which\\\")\\n\\n .arg(\\\"rustc\\\")\\n\\n .output()\\n\\n .expect(\\\"Couldn't get rustup output.\\\");\\n\\n let rustc_path = String::from_utf8(rustup_output.stdout).expect(\\\"Couldn't get toolchain path\\\");\\n\\n let toolchain_path = Path::new(&rustc_path)\\n\\n .parent().unwrap()\\n\\n .parent().unwrap();\\n\\n\\n\\n let toolchain_triple = toolchain_path\\n\\n .file_name()\\n\\n .map(|name| name.to_string_lossy().to_string())\\n\\n .map(|name| name.replace(\\\"stable-\\\", \\\"\\\"))\\n\\n .expect(\\\"Couldn't get toolchain triple.\\\");\\n\\n let architecture = if let Some(_) = toolchain_triple.find(\\\"x86_64\\\") {\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 10,\n \"score\": 57066.61250315179\n },\n {\n \"content\": \"// chrono::Duration does not have a serde serialize/deserialize option\\n\\nstruct TimeInForceVisitor;\\n\\n\\n\\nimpl<'de> Visitor<'de> for TimeInForceVisitor {\\n\\n type Value = TimeInForce;\\n\\n\\n\\n fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {\\n\\n formatter.write_str(\\\"an string, either GTC, IOC, FOK, GTT,duration\\\")\\n\\n }\\n\\n fn visit_str<E>(self, v: &str) -> Result<Self::Value, E>\\n\\n where\\n\\n E: de::Error,\\n\\n {\\n\\n if v.starts_with(\\\"GTT,\\\") {\\n\\n match v[4..].parse::<u64>() {\\n\\n Ok(v) => Ok(TimeInForce::GoodTillTime(Duration::milliseconds(v as i64))),\\n\\n _ => Err(E::custom(format!(\\\"Invalid GTG: {}\\\", v))),\\n\\n }\\n\\n } else {\\n\\n match v {\\n\\n \\\"GTC\\\" => Ok(TimeInForce::GoodTillCancelled),\\n\",\n \"file_path\": \"src/model/mod.rs\",\n \"rank\": 11,\n \"score\": 51574.02577249582\n },\n {\n \"content\": \"fn try_split_paginator(\\n\\n paginator: Option<Paginator>,\\n\\n) -> crate::shared::Result<(\\n\\n Option<String>,\\n\\n Option<i64>,\\n\\n Option<nash_protocol::types::DateTimeRange>,\\n\\n)> {\\n\\n Ok(match paginator {\\n\\n Some(paginator) => (\\n\\n paginator.before,\\n\\n match paginator.limit {\\n\\n Some(v) => Some(i64::try_from(v).map_err(|_| {\\n\\n OpenLimitsError::InvalidParameter(\\n\\n \\\"Couldn't convert paginator limit to i64\\\".to_string(),\\n\\n )\\n\\n })?),\\n\\n None => None,\\n\\n },\\n\\n if paginator.start_time.is_some() && paginator.end_time.is_some() {\\n\\n Some(nash_protocol::types::DateTimeRange {\\n\",\n \"file_path\": \"src/nash/mod.rs\",\n \"rank\": 12,\n \"score\": 50582.08388160035\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait ExchangeAccount {\\n\\n async fn limit_buy(&self, req: &OpenLimitOrderRequest) -> Result<Order>;\\n\\n async fn limit_sell(&self, req: &OpenLimitOrderRequest) -> Result<Order>;\\n\\n async fn market_buy(&self, req: &OpenMarketOrderRequest) -> Result<Order>;\\n\\n async fn market_sell(&self, req: &OpenMarketOrderRequest) -> Result<Order>;\\n\\n async fn cancel_order(&self, req: &CancelOrderRequest) -> Result<OrderCanceled>;\\n\\n async fn cancel_all_orders(&self, req: &CancelAllOrdersRequest) -> Result<Vec<OrderCanceled>>;\\n\\n async fn get_all_open_orders(&self) -> Result<Vec<Order>>;\\n\\n async fn get_order_history(&self, req: &GetOrderHistoryRequest) -> Result<Vec<Order>>;\\n\\n async fn get_trade_history(&self, req: &TradeHistoryRequest) -> Result<Vec<Trade>>;\\n\\n async fn get_account_balances(&self, paginator: Option<Paginator>) -> Result<Vec<Balance>>;\\n\\n async fn get_order(&self, req: &GetOrderRequest) -> Result<Order>;\\n\\n}\\n\",\n \"file_path\": \"src/exchange.rs\",\n \"rank\": 13,\n \"score\": 49346.80818312607\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait ExchangeMarketData {\\n\\n async fn order_book(&self, req: &OrderBookRequest) -> Result<OrderBookResponse>;\\n\\n async fn get_price_ticker(&self, req: &GetPriceTickerRequest) -> Result<Ticker>;\\n\\n async fn get_historic_rates(&self, req: &GetHistoricRatesRequest) -> Result<Vec<Candle>>;\\n\\n async fn get_historic_trades(&self, req: &GetHistoricTradesRequest) -> Result<Vec<Trade>>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/exchange.rs\",\n \"rank\": 14,\n \"score\": 47939.49257124301\n },\n {\n \"content\": \"pub trait BookLevel {\\n\\n fn level() -> u8;\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Debug, Clone)]\\n\\npub struct BookRecordL1 {\\n\\n #[serde(with = \\\"string_to_decimal\\\")]\\n\\n pub price: Decimal,\\n\\n #[serde(with = \\\"string_to_decimal\\\")]\\n\\n pub size: Decimal,\\n\\n pub num_orders: usize,\\n\\n}\\n\\n\\n\\nimpl BookLevel for BookRecordL1 {\\n\\n fn level() -> u8 {\\n\\n 1\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Debug, Clone)]\\n\",\n \"file_path\": \"src/coinbase/model/mod.rs\",\n \"rank\": 15,\n \"score\": 46641.8614312603\n },\n {\n \"content\": \"type HmacSha256 = Hmac<Sha256>;\\n\\n\\n\\nstatic RECV_WINDOW: usize = 7000;\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct Transport {\\n\\n credential: Option<(String, String)>,\\n\\n client: reqwest::Client,\\n\\n pub recv_window: usize,\\n\\n base_url: String,\\n\\n}\\n\\n\\n\\nimpl Transport {\\n\\n pub fn new(sandbox: bool) -> Result<Self> {\\n\\n let default_headers = Transport::default_headers(None);\\n\\n let client = reqwest::Client::builder()\\n\\n .default_headers(default_headers)\\n\\n .build()?;\\n\\n\\n\\n Ok(Transport {\\n\",\n \"file_path\": \"src/binance/transport.rs\",\n \"rank\": 16,\n \"score\": 45140.135832319414\n },\n {\n \"content\": \"type HmacSha256 = Hmac<Sha256>;\\n\\n\\n\\n#[derive(Clone)]\\n\\npub struct Transport {\\n\\n api_secret: Option<String>,\\n\\n client: reqwest::Client,\\n\\n base_url: String,\\n\\n}\\n\\n\\n\\nimpl Transport {\\n\\n pub fn new(sandbox: bool) -> Result<Self> {\\n\\n let default_headers = Transport::default_headers();\\n\\n\\n\\n let client = reqwest::Client::builder()\\n\\n .default_headers(default_headers)\\n\\n .build()?;\\n\\n\\n\\n Ok(Transport {\\n\\n client,\\n\\n api_secret: None,\\n\",\n \"file_path\": \"src/coinbase/transport.rs\",\n \"rank\": 17,\n \"score\": 45140.135832319414\n },\n {\n \"content\": \"fn to_decimal(v: &Value) -> Decimal {\\n\\n v.as_str()\\n\\n .expect(\\\"Couldn't get JSON Value as str.\\\")\\n\\n .parse()\\n\\n .expect(\\\"Couldn't parse str as Decimal.\\\")\\n\\n}\\n\",\n \"file_path\": \"src/binance/client/market.rs\",\n \"rank\": 18,\n \"score\": 42900.46836895768\n },\n {\n \"content\": \"fn to_i64(v: &Value) -> i64 {\\n\\n v.as_i64().expect(\\\"Couldn't get JSON Value as i64.\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/binance/client/market.rs\",\n \"rank\": 19,\n \"score\": 42900.46836895768\n },\n {\n \"content\": \"use nash_native_client::Environment;\\n\\nuse openlimits::shared::Result;\\n\\nuse openlimits::{model::websocket::Subscription, nash::NashWebsocket};\\n\\nuse tokio::time::Duration;\\n\\n\\n\\nuse openlimits::binance::{BinanceParameters, BinanceWebsocket};\\n\\nuse openlimits::coinbase::client::websocket::CoinbaseWebsocket;\\n\\nuse openlimits::coinbase::CoinbaseParameters;\\n\\nuse openlimits::exchange_ws::ExchangeWs;\\n\\nuse openlimits::nash::NashParameters;\\n\\nuse openlimits::reconnectable_ws::ReconnectableWebsocket;\\n\\nuse std::sync::mpsc::sync_channel;\\n\\nuse std::sync::{Arc, Mutex};\\n\\n\\n\\nasync fn test_subscription_callback<E: ExchangeWs + 'static>(\\n\\n websocket: ReconnectableWebsocket<E>,\\n\\n sub: Subscription,\\n\\n) {\\n\\n let disconnections = Arc::new(Mutex::new(0 as u32));\\n\\n let (tx, rx) = sync_channel(0);\\n\",\n \"file_path\": \"tests/any_exchange/reconnection.rs\",\n \"rank\": 22,\n \"score\": 36578.048481956124\n },\n {\n \"content\": \" let websocket = Arc::new(websocket);\\n\\n let weak_websocket = Arc::downgrade(&websocket);\\n\\n websocket\\n\\n .subscribe(sub, move |message| match message.as_ref() {\\n\\n Ok(_message) => {\\n\\n if let Ok(disconnections) = disconnections.lock().map(|value| *value) {\\n\\n if disconnections >= 2 {\\n\\n tx.send(()).expect(\\\"Couldn't send sync.\\\");\\n\\n }\\n\\n }\\n\\n let websocket = weak_websocket.upgrade().expect(\\\"Couldn't get websocket.\\\");\\n\\n tokio::spawn(async move { websocket.disconnect().await });\\n\\n }\\n\\n Err(_error) => {\\n\\n *disconnections\\n\\n .lock()\\n\\n .expect(\\\"Couldn't lock disconnections.\\\") += 1;\\n\\n }\\n\\n })\\n\\n .await\\n\",\n \"file_path\": \"tests/any_exchange/reconnection.rs\",\n \"rank\": 27,\n \"score\": 36568.2754281955\n },\n {\n \"content\": \"async fn binance() {\\n\\n let client = init_binance().await;\\n\\n let sub = Subscription::OrderBookUpdates(\\\"bnbbtc\\\".to_string());\\n\\n test_subscription_callback(client.expect(\\\"Couldn't create client.\\\"), sub).await;\\n\\n}\\n\\n\\n\\nasync fn init_coinbase() -> Result<ReconnectableWebsocket<CoinbaseWebsocket>> {\\n\\n ReconnectableWebsocket::instantiate(\\n\\n CoinbaseParameters {\\n\\n credentials: None,\\n\\n sandbox: true,\\n\\n },\\n\\n Duration::from_secs_f32(1.0),\\n\\n )\\n\\n .await\\n\\n}\\n\\n\\n\\nasync fn init_nash() -> Result<ReconnectableWebsocket<NashWebsocket>> {\\n\\n ReconnectableWebsocket::instantiate(\\n\\n NashParameters {\\n\",\n \"file_path\": \"tests/any_exchange/reconnection.rs\",\n \"rank\": 28,\n \"score\": 36565.9769105866\n },\n {\n \"content\": \" timeout: Duration::from_secs_f32(2.0),\\n\\n client_id: 123,\\n\\n credentials: None,\\n\\n affiliate_code: None,\\n\\n environment: Environment::Production,\\n\\n sign_states_loop_interval: None,\\n\\n },\\n\\n Duration::from_secs_f32(1.0),\\n\\n )\\n\\n .await\\n\\n}\\n\\n\\n\\nasync fn init_binance() -> Result<ReconnectableWebsocket<BinanceWebsocket>> {\\n\\n ReconnectableWebsocket::instantiate(\\n\\n BinanceParameters {\\n\\n sandbox: false,\\n\\n credentials: None,\\n\\n },\\n\\n Duration::from_secs_f32(1.0),\\n\\n )\\n\\n .await\\n\\n}\\n\",\n \"file_path\": \"tests/any_exchange/reconnection.rs\",\n \"rank\": 30,\n \"score\": 36562.01003529361\n },\n {\n \"content\": \" .expect(\\\"Couldn't subscribe\\\");\\n\\n rx.recv_timeout(Duration::from_secs_f32(10.0))\\n\\n .expect(\\\"Couldn't receive sync.\\\");\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn coinbase() {\\n\\n let client = init_coinbase().await;\\n\\n let sub = Subscription::OrderBookUpdates(\\\"BTC-USD\\\".to_string());\\n\\n test_subscription_callback(client.expect(\\\"Couldn't create client.\\\"), sub).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn nash() {\\n\\n let client = init_nash().await;\\n\\n let sub = Subscription::OrderBookUpdates(\\\"btc_usdc\\\".to_string());\\n\\n test_subscription_callback(client.expect(\\\"Couldn't create client.\\\"), sub).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\",\n \"file_path\": \"tests/any_exchange/reconnection.rs\",\n \"rank\": 31,\n \"score\": 36560.652400375184\n },\n {\n \"content\": \" m.as_ref().expect(\\\"Couldn't get response.\\\");\\n\\n tx.send(()).expect(\\\"Couldn't send sync message.\\\");\\n\\n })\\n\\n .await\\n\\n .expect(\\\"Couldn't subscribe.\\\");\\n\\n\\n\\n rx.recv().expect(\\\"Couldn't receive sync message.\\\");\\n\\n}\\n\\n\\n\\nasync fn test_account_subscription_callback(\\n\\n websocket: OpenLimitsWs<NashWebsocket>,\\n\\n sub: Subscription,\\n\\n cancel_orders: bool,\\n\\n) {\\n\\n let (tx, rx) = sync_channel(0);\\n\\n\\n\\n websocket\\n\\n .subscribe(sub, move |m| {\\n\\n m.as_ref().expect(\\\"Couldn't get response.\\\");\\n\\n tx.send(()).expect(\\\"Couldn't send sync message.\\\");\\n\",\n \"file_path\": \"tests/nash/websocket.rs\",\n \"rank\": 32,\n \"score\": 35680.92798291303\n },\n {\n \"content\": \" credentials: Some(NashCredentials {\\n\\n secret: env::var(\\\"NASH_API_SECRET\\\").expect(\\\"Couldn't get environment variable.\\\"),\\n\\n session: env::var(\\\"NASH_API_KEY\\\").expect(\\\"Couldn't get environment variable.\\\"),\\n\\n }),\\n\\n environment: Environment::Sandbox,\\n\\n client_id: 1,\\n\\n timeout: NativeDuration::new(10, 0),\\n\\n sign_states_loop_interval: None,\\n\\n };\\n\\n\\n\\n OpenLimits::instantiate(parameters)\\n\\n .await\\n\\n .expect(\\\"Failed to create Client\\\")\\n\\n}\\n\\n\\n\\nasync fn test_subscription_callback(websocket: OpenLimitsWs<NashWebsocket>, sub: Subscription) {\\n\\n let (tx, rx) = sync_channel(0);\\n\\n\\n\\n websocket\\n\\n .subscribe(sub, move |m| {\\n\",\n \"file_path\": \"tests/nash/websocket.rs\",\n \"rank\": 33,\n \"score\": 35671.38835745391\n },\n {\n \"content\": \"use crate::openlimits::exchange::ExchangeAccount;\\n\\nuse dotenv::dotenv;\\n\\nuse nash_native_client::Environment;\\n\\nuse openlimits::exchange::OpenLimits;\\n\\nuse openlimits::exchange_ws::ExchangeWs;\\n\\nuse openlimits::model::websocket::AccountOrders;\\n\\nuse openlimits::model::{CancelAllOrdersRequest, OpenLimitOrderRequest, TimeInForce};\\n\\nuse openlimits::nash::{Nash, NashCredentials, NashParameters};\\n\\nuse openlimits::{exchange_ws::OpenLimitsWs, model::websocket::Subscription, nash::NashWebsocket};\\n\\nuse rust_decimal::Decimal;\\n\\nuse std::str::FromStr;\\n\\nuse std::time::Duration as NativeDuration;\\n\\nuse std::{env, sync::mpsc::sync_channel};\\n\\nuse tokio::time::Duration;\\n\\n\\n\\nasync fn init_exchange() -> Nash {\\n\\n dotenv().ok();\\n\\n\\n\\n let parameters = NashParameters {\\n\\n affiliate_code: None,\\n\",\n \"file_path\": \"tests/nash/websocket.rs\",\n \"rank\": 34,\n \"score\": 35662.99230224671\n },\n {\n \"content\": \" market_pair: Some(\\\"eth_btc\\\".to_string()),\\n\\n };\\n\\n\\n\\n let resp = exchange\\n\\n .cancel_all_orders(&req)\\n\\n .await\\n\\n .expect(\\\"Couldn't cancel all orders.\\\");\\n\\n println!(\\\"{:?}\\\", resp);\\n\\n }\\n\\n\\n\\n rx.recv().expect(\\\"Couldn't receive sync message.\\\");\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn account_orders() {\\n\\n let client = init().await;\\n\\n let sub = Subscription::AccountOrders(AccountOrders {\\n\\n market: Some(\\\"eth_btc\\\".to_string()),\\n\\n order_type: None,\\n\\n status: None,\\n\",\n \"file_path\": \"tests/nash/websocket.rs\",\n \"rank\": 35,\n \"score\": 35659.98086671665\n },\n {\n \"content\": \"#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn orderbook() {\\n\\n let client = init().await;\\n\\n let sub = Subscription::OrderBookUpdates(\\\"btc_usdc\\\".to_string());\\n\\n test_subscription_callback(client, sub).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn trades() {\\n\\n let client = init().await;\\n\\n let sub = Subscription::Trades(\\\"btc_usdc\\\".to_string());\\n\\n test_subscription_callback(client, sub).await;\\n\\n}\\n\\n\\n\\nasync fn init() -> OpenLimitsWs<NashWebsocket> {\\n\\n dotenv().ok();\\n\\n\\n\\n let websocket = NashWebsocket::new(NashParameters {\\n\\n credentials: Some(NashCredentials {\\n\\n secret: env::var(\\\"NASH_API_SECRET\\\").expect(\\\"Couldn't get environment variable.\\\"),\\n\",\n \"file_path\": \"tests/nash/websocket.rs\",\n \"rank\": 36,\n \"score\": 35658.65980268255\n },\n {\n \"content\": \"use super::{OrderBookResponse, Trade};\\n\\nuse crate::model::{OrderStatus, OrderType, Side};\\n\\nuse serde::{Deserialize, Serialize};\\n\\nuse std::ops::Range;\\n\\n\\n\\n#[derive(Serialize, Deserialize, Debug, Clone, PartialEq, Eq, Hash)]\\n\\npub struct AccountOrders {\\n\\n pub market: Option<String>,\\n\\n pub order_type: Option<Vec<OrderType>>,\\n\\n pub buy_or_sell: Option<Side>,\\n\\n pub range: Option<Range<u64>>,\\n\\n pub status: Option<Vec<OrderStatus>>,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Debug, Clone, PartialEq, Eq, Hash)]\\n\\npub enum Subscription {\\n\\n Ticker(String), // symbol\\n\\n OrderBookUpdates(String), // symbol\\n\\n Trades(String), // symbol\\n\\n AccountTrades(String), // symbol\\n\",\n \"file_path\": \"src/model/websocket.rs\",\n \"rank\": 37,\n \"score\": 35658.174555141115\n },\n {\n \"content\": \"// FIXME: These test cases aren't implemented.\\n\\n// The purpose of this module is to be sure we have the same functionalities across all the\\n\\n// supported exchanges.\\n\\n\\n\\nuse dotenv::dotenv;\\n\\nuse nash_native_client::Environment;\\n\\nuse openlimits::any_exchange::{AnyExchange, AnyWsExchange};\\n\\nuse openlimits::binance::{Binance, BinanceCredentials, BinanceParameters};\\n\\nuse openlimits::coinbase::client::websocket::CoinbaseWebsocket;\\n\\nuse openlimits::coinbase::{Coinbase, CoinbaseCredentials, CoinbaseParameters};\\n\\nuse openlimits::exchange::OpenLimits;\\n\\nuse openlimits::exchange_ws::OpenLimitsWs;\\n\\nuse openlimits::nash::{Nash, NashCredentials, NashParameters};\\n\\nuse openlimits::shared::Result;\\n\\nuse std::env;\\n\\nuse tokio::time::Duration;\\n\\n\\n\\n#[tokio::test]\\n\\nasync fn account_test() {\\n\\n let _exchange = init().await;\\n\",\n \"file_path\": \"tests/any_exchange/websocket.rs\",\n \"rank\": 38,\n \"score\": 35656.08067819529\n },\n {\n \"content\": \" buy_or_sell: None,\\n\\n range: None,\\n\\n });\\n\\n test_account_subscription_callback(client, sub, true).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn account_trades() {\\n\\n let client = init().await;\\n\\n let sub = Subscription::AccountTrades(\\\"eth_btc\\\".to_string());\\n\\n test_account_subscription_callback(client, sub, false).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn account_balance() {\\n\\n let client = init().await;\\n\\n let sub = Subscription::AccountBalance(\\\"eth\\\".to_string());\\n\\n test_account_subscription_callback(client, sub, false).await;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"tests/nash/websocket.rs\",\n \"rank\": 39,\n \"score\": 35655.41915505281\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[tokio::test]\\n\\nasync fn ws_test() {\\n\\n let _websocket = init_ws().await;\\n\\n}\\n\\n\\n\\nasync fn _nash() -> Result<Nash> {\\n\\n let parameters = NashParameters {\\n\\n affiliate_code: None,\\n\\n credentials: Some(NashCredentials {\\n\\n secret: env::var(\\\"NASH_API_SECRET\\\").expect(\\\"Couldn't get environment variable.\\\"),\\n\\n session: env::var(\\\"NASH_API_KEY\\\").expect(\\\"Couldn't get environment variable.\\\"),\\n\\n }),\\n\\n environment: Environment::Sandbox,\\n\\n client_id: 1,\\n\\n timeout: Duration::from_secs_f32(10.0),\\n\\n sign_states_loop_interval: None,\\n\\n };\\n\\n OpenLimits::instantiate(parameters).await\\n\",\n \"file_path\": \"tests/any_exchange/websocket.rs\",\n \"rank\": 40,\n \"score\": 35654.57568267983\n },\n {\n \"content\": \" session: env::var(\\\"NASH_API_KEY\\\").expect(\\\"Couldn't get environment variable.\\\"),\\n\\n }),\\n\\n affiliate_code: None,\\n\\n client_id: 1234,\\n\\n environment: Environment::Sandbox,\\n\\n timeout: Duration::from_secs(10),\\n\\n sign_states_loop_interval: None,\\n\\n })\\n\\n .await\\n\\n .expect(\\\"Couldn't connect.\\\");\\n\\n\\n\\n OpenLimitsWs { websocket }\\n\\n}\\n\",\n \"file_path\": \"tests/nash/websocket.rs\",\n \"rank\": 41,\n \"score\": 35653.08586869406\n },\n {\n \"content\": \" }),\\n\\n };\\n\\n OpenLimits::instantiate(parameters).await\\n\\n}\\n\\n\\n\\nasync fn init() -> Result<AnyExchange> {\\n\\n dotenv().ok();\\n\\n coinbase().await.map(|exchange| exchange.into())\\n\\n}\\n\\n\\n\\nasync fn coinbase_websocket() -> OpenLimitsWs<CoinbaseWebsocket> {\\n\\n dotenv().ok();\\n\\n\\n\\n let websocket = CoinbaseWebsocket::new(CoinbaseParameters {\\n\\n sandbox: false,\\n\\n credentials: Some(CoinbaseCredentials {\\n\\n api_secret: env::var(\\\"COINBASE_API_SECRET\\\").unwrap(),\\n\\n api_key: env::var(\\\"COINBASE_API_KEY\\\").unwrap(),\\n\\n passphrase: env::var(\\\"COINBASE_PASSPHRASE\\\").unwrap(),\\n\\n }),\\n\\n });\\n\\n OpenLimitsWs { websocket }\\n\\n}\\n\\n\\n\\nasync fn init_ws() -> AnyWsExchange {\\n\\n coinbase_websocket().await.into()\\n\\n}\\n\",\n \"file_path\": \"tests/any_exchange/websocket.rs\",\n \"rank\": 42,\n \"score\": 35651.94287182948\n },\n {\n \"content\": \" AccountBalance(String), // symbol\\n\\n AccountOrders(AccountOrders),\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub enum WebSocketResponse<T> {\\n\\n Generic(OpenLimitsWebSocketMessage),\\n\\n Raw(T),\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Serialize)]\\n\\npub enum OpenLimitsWebSocketMessage {\\n\\n Ping,\\n\\n OrderBook(OrderBookResponse),\\n\\n OrderBookDiff(OrderBookResponse),\\n\\n Trades(Vec<Trade>),\\n\\n}\\n\",\n \"file_path\": \"src/model/websocket.rs\",\n \"rank\": 43,\n \"score\": 35650.83967345624\n },\n {\n \"content\": \"}\\n\\n\\n\\nasync fn _binance() -> Result<Binance> {\\n\\n let parameters = BinanceParameters {\\n\\n credentials: Some(BinanceCredentials {\\n\\n api_key: env::var(\\\"BINANCE_API_KEY\\\").expect(\\\"Couldn't get environment variable.\\\"),\\n\\n api_secret: env::var(\\\"BINANCE_API_SECRET\\\").expect(\\\"Couldn't get environment variable.\\\"),\\n\\n }),\\n\\n sandbox: true,\\n\\n };\\n\\n OpenLimits::instantiate(parameters).await\\n\\n}\\n\\n\\n\\nasync fn coinbase() -> Result<Coinbase> {\\n\\n let parameters = CoinbaseParameters {\\n\\n sandbox: true,\\n\\n credentials: Some(CoinbaseCredentials {\\n\\n api_key: env::var(\\\"COINBASE_API_KEY\\\").unwrap(),\\n\\n api_secret: env::var(\\\"COINBASE_API_SECRET\\\").unwrap(),\\n\\n passphrase: env::var(\\\"COINBASE_PASSPHRASE\\\").unwrap(),\\n\",\n \"file_path\": \"tests/any_exchange/websocket.rs\",\n \"rank\": 44,\n \"score\": 35646.43922103795\n },\n {\n \"content\": \" })\\n\\n .await\\n\\n .expect(\\\"Couldn't subscribe.\\\");\\n\\n\\n\\n let exchange = init_exchange().await;\\n\\n let req = OpenLimitOrderRequest {\\n\\n time_in_force: TimeInForce::GoodTillCancelled,\\n\\n price: Decimal::from_str(\\\"0.01\\\").expect(\\\"Couldn't parse string.\\\"),\\n\\n size: Decimal::from_str(\\\"0.1\\\").expect(\\\"Couldn't parse string.\\\"),\\n\\n market_pair: String::from(\\\"eth_btc\\\"),\\n\\n post_only: false,\\n\\n };\\n\\n\\n\\n exchange\\n\\n .limit_buy(&req)\\n\\n .await\\n\\n .expect(\\\"Couldn't limit sell.\\\");\\n\\n\\n\\n if cancel_orders {\\n\\n let req = CancelAllOrdersRequest {\\n\",\n \"file_path\": \"tests/nash/websocket.rs\",\n \"rank\": 45,\n \"score\": 35643.16369010782\n },\n {\n \"content\": \"use std::sync::mpsc::sync_channel;\\n\\n\\n\\nuse openlimits::{\\n\\n binance::{client::websocket::BinanceWebsocket, BinanceParameters},\\n\\n exchange_ws::{ExchangeWs, OpenLimitsWs},\\n\\n model::websocket::Subscription,\\n\\n};\\n\\n\\n\\nasync fn test_subscription_callback(websocket: OpenLimitsWs<BinanceWebsocket>, sub: Subscription) {\\n\\n let (tx, rx) = sync_channel(0);\\n\\n\\n\\n websocket\\n\\n .subscribe(sub, move |m| {\\n\\n m.as_ref().expect(\\\"Couldn't get response.\\\");\\n\\n tx.send(()).expect(\\\"Couldn't send sync message.\\\");\\n\\n })\\n\\n .await\\n\\n .expect(\\\"Couldn't subscribe.\\\");\\n\\n\\n\\n rx.recv().expect(\\\"Couldn't receive sync message.\\\");\\n\",\n \"file_path\": \"tests/binance/ws_callbacks.rs\",\n \"rank\": 46,\n \"score\": 35004.89908277085\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn orderbook() {\\n\\n let ws = init().await;\\n\\n let sub = Subscription::OrderBookUpdates(\\\"bnbbtc\\\".to_string());\\n\\n test_subscription_callback(ws, sub).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn trades() {\\n\\n let ws = init().await;\\n\\n let sub = Subscription::Trades(\\\"btcusdt\\\".to_string());\\n\\n test_subscription_callback(ws, sub).await;\\n\\n}\\n\\n\\n\\nasync fn init() -> OpenLimitsWs<BinanceWebsocket> {\\n\\n OpenLimitsWs {\\n\\n websocket: BinanceWebsocket::new(BinanceParameters::prod())\\n\\n .await\\n\\n .expect(\\\"Failed to create Client\\\"),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"tests/binance/ws_callbacks.rs\",\n \"rank\": 47,\n \"score\": 34981.54214039709\n },\n {\n \"content\": \"#[async_trait]\\n\\npub trait Exchange: ExchangeInfoRetrieval + ExchangeAccount + ExchangeMarketData + Sized {\\n\\n type InitParams;\\n\\n type InnerClient;\\n\\n async fn new(params: Self::InitParams) -> Result<Self>;\\n\\n fn inner_client(&self) -> Option<&Self::InnerClient>;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/exchange.rs\",\n \"rank\": 48,\n \"score\": 34709.1008143585\n },\n {\n \"content\": \"use openlimits::{\\n\\n binance::{\\n\\n client::websocket::BinanceWebsocket, model::websocket::BinanceSubscription,\\n\\n BinanceParameters,\\n\\n },\\n\\n exchange_ws::ExchangeWs,\\n\\n};\\n\\nuse std::sync::mpsc::sync_channel;\\n\\n\\n\\nasync fn test_subscription_callback(websocket: BinanceWebsocket, sub: BinanceSubscription) {\\n\\n let (tx, rx) = sync_channel(0);\\n\\n\\n\\n websocket\\n\\n .subscribe(sub, move |m| {\\n\\n m.as_ref().expect(\\\"Couldn't get response.\\\");\\n\\n tx.send(()).expect(\\\"Couldn't send sync message.\\\");\\n\\n })\\n\\n .await\\n\\n .expect(\\\"Couldn't subscribe.\\\");\\n\\n\\n\",\n \"file_path\": \"tests/apis/binance/websocket.rs\",\n \"rank\": 49,\n \"score\": 34039.684895664184\n },\n {\n \"content\": \"use openlimits::coinbase::{\\n\\n client::websocket::CoinbaseWebsocket, model::websocket::CoinbaseSubscription,\\n\\n CoinbaseParameters,\\n\\n};\\n\\nuse openlimits::exchange_ws::ExchangeWs;\\n\\nuse openlimits::model::websocket::{OpenLimitsWebSocketMessage, WebSocketResponse};\\n\\nuse std::sync::mpsc::sync_channel;\\n\\nuse std::time::Duration;\\n\\n\\n\\nasync fn test_subscription_callback(\\n\\n websocket: CoinbaseWebsocket,\\n\\n sub: CoinbaseSubscription,\\n\\n expected_messages: Vec<OpenLimitsWebSocketMessage>,\\n\\n) {\\n\\n let (tx, rx) = sync_channel(0);\\n\\n\\n\\n let mut received_messages: Vec<bool> = expected_messages.iter().map(|_| false).collect();\\n\\n\\n\\n websocket\\n\\n .subscribe(sub, move |message| {\\n\",\n \"file_path\": \"tests/apis/coinbase/websocket.rs\",\n \"rank\": 50,\n \"score\": 34039.45575880161\n },\n {\n \"content\": \" rx.recv_timeout(Duration::from_secs(3))\\n\\n .expect(\\\"Couldn't receive sync message.\\\");\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn order_book() {\\n\\n let websocket = init().await;\\n\\n let sub = CoinbaseSubscription::Level2(\\\"BTC-USD\\\".to_string());\\n\\n let expected = vec![\\n\\n OpenLimitsWebSocketMessage::OrderBook(Default::default()),\\n\\n OpenLimitsWebSocketMessage::OrderBookDiff(Default::default()),\\n\\n ];\\n\\n test_subscription_callback(websocket, sub, expected).await;\\n\\n}\\n\\n\\n\\nasync fn init() -> CoinbaseWebsocket {\\n\\n CoinbaseWebsocket::new(CoinbaseParameters {\\n\\n sandbox: true,\\n\\n credentials: None,\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"tests/apis/coinbase/websocket.rs\",\n \"rank\": 51,\n \"score\": 34025.94700567293\n },\n {\n \"content\": \" rx.recv().expect(\\\"Couldn't receive sync message.\\\");\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn aggregate_trade() {\\n\\n let websocket = init().await;\\n\\n let sub = BinanceSubscription::AggregateTrade(\\\"bnbbtc\\\".to_string());\\n\\n test_subscription_callback(websocket, sub).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn candlestick() {\\n\\n let websocket = init().await;\\n\\n let sub = BinanceSubscription::Candlestick(\\\"bnbbtc\\\".to_string(), \\\"1m\\\".to_string());\\n\\n test_subscription_callback(websocket, sub).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn depth() {\\n\\n let websocket = init().await;\\n\",\n \"file_path\": \"tests/apis/binance/websocket.rs\",\n \"rank\": 52,\n \"score\": 34024.7457998738\n },\n {\n \"content\": \"use crate::{\\n\\n binance::{\\n\\n model::websocket::{BinanceSubscription, BinanceWebsocketMessage},\\n\\n BinanceParameters,\\n\\n },\\n\\n errors::OpenLimitsError,\\n\\n exchange_ws::ExchangeWs,\\n\\n exchange_ws::Subscriptions,\\n\\n model::websocket::OpenLimitsWebSocketMessage,\\n\\n model::websocket::Subscription,\\n\\n model::websocket::WebSocketResponse,\\n\\n shared::Result,\\n\\n};\\n\\n\\n\\nuse async_trait::async_trait;\\n\\nuse futures::{stream::BoxStream, SinkExt, StreamExt};\\n\\nuse serde::{de, Deserialize, Serialize};\\n\\nuse serde_json::Value;\\n\\nuse std::sync::Mutex;\\n\\nuse std::{convert::TryFrom, fmt::Display};\\n\\nuse tokio::sync::mpsc::{unbounded_channel, UnboundedSender};\\n\\nuse tokio_tungstenite::{connect_async, tungstenite::protocol::Message};\\n\\n\\n\\nconst WS_URL_PROD: &str = \\\"wss://stream.binance.com:9443/stream\\\";\\n\\nconst WS_URL_SANDBOX: &str = \\\"wss://testnet.binance.vision/stream\\\";\\n\\n\\n\\n#[derive(Debug, Clone, Deserialize, Serialize)]\\n\\n#[serde(untagged)]\\n\",\n \"file_path\": \"src/binance/client/websocket.rs\",\n \"rank\": 53,\n \"score\": 34023.09582255776\n },\n {\n \"content\": \"\\n\\n pub async fn connect(&self, subscribe: Subscribe) -> Result<SplitStream<WSStream>> {\\n\\n let ws_url = if self.parameters.sandbox {\\n\\n WS_URL_SANDBOX\\n\\n } else {\\n\\n WS_URL_PROD\\n\\n };\\n\\n let url = url::Url::parse(ws_url).expect(\\\"Couldn't parse url.\\\");\\n\\n let (ws_stream, _) = connect_async(&url).await?;\\n\\n let (mut sink, stream) = ws_stream.split();\\n\\n let subscribe = serde_json::to_string(&subscribe)?;\\n\\n\\n\\n sink.send(Message::Text(subscribe)).await?;\\n\\n Ok(stream)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Stream for CoinbaseWebsocket {\\n\\n type Item = Result<CoinbaseWebsocketMessage>;\\n\\n\\n\",\n \"file_path\": \"src/coinbase/client/websocket.rs\",\n \"rank\": 54,\n \"score\": 34021.48078759435\n },\n {\n \"content\": \"use async_trait::async_trait;\\n\\nuse std::{collections::HashMap, pin::Pin, task::Poll};\\n\\n\\n\\nuse futures::{\\n\\n stream::{SplitStream, Stream},\\n\\n SinkExt, StreamExt,\\n\\n};\\n\\nuse serde::{Deserialize, Serialize};\\n\\nuse tokio::net::TcpStream;\\n\\n\\n\\nuse tokio_tungstenite::tungstenite::Message;\\n\\nuse tokio_tungstenite::{connect_async, MaybeTlsStream, WebSocketStream};\\n\\n\\n\\nuse crate::{\\n\\n coinbase::model::websocket::{\\n\\n Channel, CoinbaseSubscription, CoinbaseWebsocketMessage, Subscribe, SubscribeCmd,\\n\\n },\\n\\n errors::OpenLimitsError,\\n\\n shared::Result,\\n\\n};\\n\",\n \"file_path\": \"src/coinbase/client/websocket.rs\",\n \"rank\": 55,\n \"score\": 34019.2466445153\n },\n {\n \"content\": \" })\\n\\n }\\n\\n\\n\\n async fn disconnect(&self) {\\n\\n if let Ok(mut senders) = self.disconnection_senders.lock() {\\n\\n for sender in senders.iter() {\\n\\n sender.send(()).ok();\\n\\n }\\n\\n senders.clear();\\n\\n }\\n\\n }\\n\\n\\n\\n async fn create_stream_specific(\\n\\n &self,\\n\\n subscriptions: Subscriptions<Self::Subscription>,\\n\\n ) -> Result<BoxStream<'static, Result<Self::Response>>> {\\n\\n let streams = subscriptions\\n\\n .into_iter()\\n\\n .map(|bs| bs.to_string())\\n\\n .collect::<Vec<String>>()\\n\",\n \"file_path\": \"src/binance/client/websocket.rs\",\n \"rank\": 56,\n \"score\": 34018.72896775577\n },\n {\n \"content\": \" let sub = BinanceSubscription::Depth(\\\"bnbbtc\\\".to_string(), Some(1));\\n\\n test_subscription_callback(websocket, sub).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn mini_ticker() {\\n\\n let websocket = init().await;\\n\\n let sub = BinanceSubscription::MiniTicker(\\\"bnbbtc\\\".to_string());\\n\\n test_subscription_callback(websocket, sub).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn mini_ticker_all() {\\n\\n let websocket = init().await;\\n\\n let sub = BinanceSubscription::MiniTickerAll;\\n\\n test_subscription_callback(websocket, sub).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn order_book() {\\n\",\n \"file_path\": \"tests/apis/binance/websocket.rs\",\n \"rank\": 57,\n \"score\": 34018.15476889218\n },\n {\n \"content\": \" if let Ok(message) = message.as_ref() {\\n\\n if let WebSocketResponse::Generic(message) = message {\\n\\n let expected_iter = expected_messages.iter().map(|expected| {\\n\\n std::mem::discriminant(expected) == std::mem::discriminant(&message)\\n\\n });\\n\\n for (already_received, currently_received) in\\n\\n received_messages.iter_mut().zip(expected_iter)\\n\\n {\\n\\n if !*already_received {\\n\\n *already_received = currently_received;\\n\\n }\\n\\n }\\n\\n if received_messages.iter().all(|received| *received) {\\n\\n tx.send(()).expect(\\\"Couldn't send sync message.\\\");\\n\\n }\\n\\n }\\n\\n }\\n\\n })\\n\\n .await\\n\\n .expect(\\\"Couldn't subscribe.\\\");\\n\",\n \"file_path\": \"tests/apis/coinbase/websocket.rs\",\n \"rank\": 58,\n \"score\": 34018.018603024844\n },\n {\n \"content\": \" let websocket = init().await;\\n\\n let sub = BinanceSubscription::OrderBook(\\\"bnbbtc\\\".to_string(), 10);\\n\\n test_subscription_callback(websocket, sub).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn ticker() {\\n\\n let websocket = init().await;\\n\\n let sub = BinanceSubscription::Ticker(\\\"bnbbtc\\\".to_string());\\n\\n test_subscription_callback(websocket, sub).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\\nasync fn ticker_all() {\\n\\n let websocket = init().await;\\n\\n let sub = BinanceSubscription::TickerAll;\\n\\n test_subscription_callback(websocket, sub).await;\\n\\n}\\n\\n\\n\\n#[tokio::test(flavor = \\\"multi_thread\\\", worker_threads = 2)]\\n\",\n \"file_path\": \"tests/apis/binance/websocket.rs\",\n \"rank\": 59,\n \"score\": 34017.9609656571\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl From<InputMessage> for CoinbaseWebsocketMessage {\\n\\n fn from(msg: InputMessage) -> Self {\\n\\n match msg {\\n\\n InputMessage::Subscriptions { channels } => {\\n\\n CoinbaseWebsocketMessage::Subscriptions { channels }\\n\\n }\\n\\n InputMessage::Heartbeat {\\n\\n sequence,\\n\\n last_trade_id,\\n\\n product_id,\\n\\n time,\\n\\n } => CoinbaseWebsocketMessage::Heartbeat {\\n\\n sequence,\\n\\n last_trade_id,\\n\\n product_id,\\n\\n time,\\n\\n },\\n\\n InputMessage::Ticker(ticker) => CoinbaseWebsocketMessage::Ticker(ticker),\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 60,\n \"score\": 34017.47847149938\n },\n {\n \"content\": \"async fn trade() {\\n\\n let websocket = init().await;\\n\\n let sub = BinanceSubscription::Trade(\\\"bnbbtc\\\".to_string());\\n\\n test_subscription_callback(websocket, sub).await;\\n\\n}\\n\\n\\n\\nasync fn init() -> BinanceWebsocket {\\n\\n BinanceWebsocket::new(BinanceParameters::sandbox())\\n\\n .await\\n\\n .expect(\\\"Failed to create Client\\\")\\n\\n}\\n\",\n \"file_path\": \"tests/apis/binance/websocket.rs\",\n \"rank\": 61,\n \"score\": 34017.41036611352\n },\n {\n \"content\": \" CoinbaseSubscription::Level2(product_id) => (\\n\\n vec![Channel::Name(ChannelType::Level2)],\\n\\n vec![product_id.clone()],\\n\\n ),\\n\\n CoinbaseSubscription::Heartbeat(product_id) => (\\n\\n vec![Channel::Name(ChannelType::Heartbeat)],\\n\\n vec![product_id.clone()],\\n\\n ),\\n\\n _ => unimplemented!(),\\n\\n };\\n\\n let subscribe = Subscribe {\\n\\n _type: SubscribeCmd::Subscribe,\\n\\n auth: None,\\n\\n channels,\\n\\n product_ids,\\n\\n };\\n\\n let subscribe = serde_json::to_string(&subscribe)?;\\n\\n let (mut sink, stream) = ws_stream.split();\\n\\n let (disconnection_sender, mut disconnection_receiver) = unbounded_channel();\\n\\n sink.send(Message::Text(subscribe)).await?;\\n\",\n \"file_path\": \"src/coinbase/client/websocket.rs\",\n \"rank\": 62,\n \"score\": 34017.16909982844\n },\n {\n \"content\": \"\\n\\nuse crate::coinbase::model::websocket::ChannelType;\\n\\nuse crate::coinbase::CoinbaseParameters;\\n\\nuse crate::exchange_ws::{ExchangeWs, Subscriptions};\\n\\nuse futures::stream::BoxStream;\\n\\nuse std::sync::Mutex;\\n\\nuse tokio::sync::mpsc::{unbounded_channel, UnboundedSender};\\n\\n\\n\\nconst WS_URL_PROD: &str = \\\"wss://ws-feed.pro.coinbase.com\\\";\\n\\nconst WS_URL_SANDBOX: &str = \\\"wss://ws-feed-public.sandbox.pro.coinbase.com\\\";\\n\\n\\n\\n#[derive(Debug, Clone, Deserialize, Serialize)]\\n\\n#[serde(untagged)]\\n\",\n \"file_path\": \"src/coinbase/client/websocket.rs\",\n \"rank\": 63,\n \"score\": 34017.06042642117\n },\n {\n \"content\": \" ))\\n\\n } else if stream.name.ends_with(\\\"@depth\\\") {\\n\\n Ok(BinanceWebsocketMessage::Depth(\\n\\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\\n\\n ))\\n\\n } else if stream.name.contains(\\\"@depth\\\") {\\n\\n Ok(BinanceWebsocketMessage::OrderBook(\\n\\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\\n\\n ))\\n\\n } else {\\n\\n panic!(\\\"Not supported Subscription\\\");\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Display for BinanceSubscription {\\n\\n fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\\n\\n match self {\\n\\n BinanceSubscription::AggregateTrade(ref symbol) => write!(f, \\\"{}@aggTrade\\\", symbol),\\n\\n BinanceSubscription::Candlestick(ref symbol, ref interval) => {\\n\",\n \"file_path\": \"src/binance/client/websocket.rs\",\n \"rank\": 64,\n \"score\": 34017.005420769885\n },\n {\n \"content\": \" fn from(subscription: Subscription) -> Self {\\n\\n match subscription {\\n\\n Subscription::OrderBookUpdates(symbol) => BinanceSubscription::Depth(symbol, None),\\n\\n Subscription::Trades(symbol) => BinanceSubscription::Trade(symbol),\\n\\n _ => unimplemented!(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl TryFrom<BinanceWebsocketMessage> for WebSocketResponse<BinanceWebsocketMessage> {\\n\\n type Error = OpenLimitsError;\\n\\n\\n\\n fn try_from(value: BinanceWebsocketMessage) -> Result<Self> {\\n\\n match value {\\n\\n BinanceWebsocketMessage::Depth(orderbook) => Ok(WebSocketResponse::Generic(\\n\\n OpenLimitsWebSocketMessage::OrderBook(orderbook.into()),\\n\\n )),\\n\\n BinanceWebsocketMessage::Trade(trade) => Ok(WebSocketResponse::Generic(\\n\\n OpenLimitsWebSocketMessage::Trades(trade.into()),\\n\\n )),\\n\\n BinanceWebsocketMessage::Ping => {\\n\\n Ok(WebSocketResponse::Generic(OpenLimitsWebSocketMessage::Ping))\\n\\n }\\n\\n BinanceWebsocketMessage::Close => Err(OpenLimitsError::SocketError()),\\n\\n _ => Ok(WebSocketResponse::Raw(value)),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/binance/client/websocket.rs\",\n \"rank\": 65,\n \"score\": 34016.89482633964\n },\n {\n \"content\": \" pub private: bool,\\n\\n pub user_id: Option<String>,\\n\\n #[serde(default)]\\n\\n pub profile_id: Option<String>,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Debug, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub enum StopType {\\n\\n Entry,\\n\\n Exit,\\n\\n}\\n\\n\\n\\nimpl From<Subscription> for CoinbaseSubscription {\\n\\n fn from(subscription: Subscription) -> Self {\\n\\n match subscription {\\n\\n Subscription::OrderBookUpdates(symbol) => CoinbaseSubscription::Level2(symbol),\\n\\n _ => unimplemented!(),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 66,\n \"score\": 34016.391421075285\n },\n {\n \"content\": \"use crate::coinbase::model::OrderSide;\\n\\nuse crate::errors::OpenLimitsError;\\n\\nuse crate::model::websocket::{OpenLimitsWebSocketMessage, Subscription, WebSocketResponse};\\n\\nuse crate::model::{AskBid, OrderBookResponse};\\n\\nuse crate::shared::Result;\\n\\nuse crate::shared::{string_to_decimal, string_to_opt_decimal};\\n\\nuse rust_decimal::prelude::Decimal;\\n\\nuse serde::{Deserialize, Deserializer, Serialize};\\n\\nuse std::convert::{TryFrom, TryInto};\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq, Hash)]\\n\\npub enum CoinbaseSubscription {\\n\\n Heartbeat(String),\\n\\n Status,\\n\\n // Ticker(String),\\n\\n Level2(String),\\n\\n // User,\\n\\n // Matches,\\n\\n // FullChannel\\n\\n}\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 67,\n \"score\": 34015.97811804122\n },\n {\n \"content\": \" tokio::spawn(async move {\\n\\n if disconnection_receiver.recv().await.is_some() {\\n\\n sink.close().await.ok();\\n\\n }\\n\\n });\\n\\n\\n\\n if let Ok(mut senders) = self.disconnection_senders.lock() {\\n\\n senders.push(disconnection_sender);\\n\\n }\\n\\n let s = stream.map(|message| parse_message(message?));\\n\\n\\n\\n Ok(s.boxed())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/coinbase/client/websocket.rs\",\n \"rank\": 68,\n \"score\": 34015.533868012484\n },\n {\n \"content\": \"\\n\\nimpl TryFrom<CoinbaseWebsocketMessage> for WebSocketResponse<CoinbaseWebsocketMessage> {\\n\\n type Error = OpenLimitsError;\\n\\n\\n\\n fn try_from(value: CoinbaseWebsocketMessage) -> Result<Self> {\\n\\n match value {\\n\\n CoinbaseWebsocketMessage::Level2(level2) => {\\n\\n Ok(WebSocketResponse::Generic(level2.try_into()?))\\n\\n }\\n\\n _ => Ok(WebSocketResponse::Raw(value)),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Debug, Clone)]\\n\\npub enum Level2 {\\n\\n Snapshot {\\n\\n product_id: String,\\n\\n bids: Vec<Level2SnapshotRecord>,\\n\\n asks: Vec<Level2SnapshotRecord>,\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 69,\n \"score\": 34015.00187563144\n },\n {\n \"content\": \"\\n\\n#[derive(Debug, Clone)]\\n\\npub enum CoinbaseWebsocketMessage {\\n\\n Subscriptions {\\n\\n channels: Vec<Channel>,\\n\\n },\\n\\n Heartbeat {\\n\\n sequence: usize,\\n\\n last_trade_id: usize,\\n\\n product_id: String,\\n\\n time: String,\\n\\n },\\n\\n Ticker(Ticker),\\n\\n Level2(Level2),\\n\\n Match(Match),\\n\\n Full(Full),\\n\\n Error {\\n\\n message: String,\\n\\n },\\n\\n}\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 70,\n \"score\": 34014.58668012692\n },\n {\n \"content\": \" for sender in senders.iter() {\\n\\n sender.send(()).ok();\\n\\n }\\n\\n senders.clear();\\n\\n }\\n\\n }\\n\\n\\n\\n async fn create_stream_specific(\\n\\n &self,\\n\\n subscription: Subscriptions<Self::Subscription>,\\n\\n ) -> Result<BoxStream<'static, Result<Self::Response>>> {\\n\\n let ws_url = if self.parameters.sandbox {\\n\\n WS_URL_SANDBOX\\n\\n } else {\\n\\n WS_URL_PROD\\n\\n };\\n\\n let endpoint = url::Url::parse(ws_url).expect(\\\"Couldn't parse url.\\\");\\n\\n let (ws_stream, _) = connect_async(endpoint).await?;\\n\\n\\n\\n let (channels, product_ids) = match &subscription.as_slice()[0] {\\n\",\n \"file_path\": \"src/coinbase/client/websocket.rs\",\n \"rank\": 71,\n \"score\": 34014.452588387285\n },\n {\n \"content\": \" fn poll_next(\\n\\n mut self: std::pin::Pin<&mut Self>,\\n\\n cx: &mut std::task::Context<'_>,\\n\\n ) -> Poll<Option<Self::Item>> {\\n\\n for (_sub, stream) in &mut self.subscriptions.iter_mut() {\\n\\n if let Poll::Ready(Some(message)) = Pin::new(stream).poll_next(cx) {\\n\\n let message = parse_message(message?);\\n\\n return Poll::Ready(Some(message));\\n\\n }\\n\\n }\\n\\n\\n\\n std::task::Poll::Pending\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/coinbase/client/websocket.rs\",\n \"rank\": 72,\n \"score\": 34013.913545598625\n },\n {\n \"content\": \"use serde::{Deserialize, Serialize};\\n\\n\\n\\nuse crate::shared::string_to_decimal;\\n\\n\\n\\nuse super::{\\n\\n AskBid, Kline, OrderBook, OrderExecType, OrderRejectReason, OrderStatus, OrderType, Side,\\n\\n TimeInForce,\\n\\n};\\n\\n\\n\\nuse rust_decimal::prelude::Decimal;\\n\\n\\n\\n#[derive(Debug, Clone, PartialEq, Eq, Hash)]\\n\\npub enum BinanceSubscription {\\n\\n UserData(String), // listen key\\n\\n AggregateTrade(String), // symbol\\n\\n Trade(String), // symbol\\n\\n Candlestick(String, String), // (symbol, interval)\\n\\n MiniTicker(String), // symbol\\n\\n MiniTickerAll,\\n\\n Ticker(String), // symbol\\n\",\n \"file_path\": \"src/binance/model/websocket.rs\",\n \"rank\": 73,\n \"score\": 34013.48717151605\n },\n {\n \"content\": \" InputMessage::Open(open) => CoinbaseWebsocketMessage::Full(Full::Open(open)),\\n\\n InputMessage::Done(done) => CoinbaseWebsocketMessage::Full(Full::Done(done)),\\n\\n InputMessage::Match(_match) => CoinbaseWebsocketMessage::Full(Full::Match(_match)),\\n\\n InputMessage::Change(change) => CoinbaseWebsocketMessage::Full(Full::Change(change)),\\n\\n InputMessage::Activate(activate) => {\\n\\n CoinbaseWebsocketMessage::Full(Full::Activate(activate))\\n\\n }\\n\\n InputMessage::Error { message } => CoinbaseWebsocketMessage::Error { message },\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'de> Deserialize<'de> for CoinbaseWebsocketMessage {\\n\\n fn deserialize<D>(deserializer: D) -> std::result::Result<Self, D::Error>\\n\\n where\\n\\n D: Deserializer<'de>,\\n\\n {\\n\\n Deserialize::deserialize(deserializer).map(|input_msg: InputMessage| input_msg.into())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 74,\n \"score\": 34013.037297399154\n },\n {\n \"content\": \" Close,\\n\\n Binary(Vec<u8>), // Unexpected, unparsed\\n\\n}\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct TradeMessage {\\n\\n #[serde(rename = \\\"e\\\")]\\n\\n pub event_type: String,\\n\\n #[serde(rename = \\\"E\\\")]\\n\\n pub event_time: u64,\\n\\n #[serde(rename = \\\"s\\\")]\\n\\n pub symbol: String,\\n\\n #[serde(rename = \\\"t\\\")]\\n\\n pub trade_id: u64,\\n\\n #[serde(rename = \\\"p\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub price: Decimal,\\n\\n #[serde(rename = \\\"q\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub qty: Decimal,\\n\\n #[serde(rename = \\\"b\\\")]\\n\",\n \"file_path\": \"src/binance/model/websocket.rs\",\n \"rank\": 75,\n \"score\": 34010.97963197999\n },\n {\n \"content\": \" pub quote_volume: Decimal,\\n\\n #[serde(rename = \\\"O\\\")]\\n\\n pub open_time: u64,\\n\\n #[serde(rename = \\\"C\\\")]\\n\\n pub close_time: u64,\\n\\n #[serde(rename = \\\"F\\\")]\\n\\n pub first_trade_id: u64,\\n\\n #[serde(rename = \\\"L\\\")]\\n\\n pub last_trade_id: u64,\\n\\n #[serde(rename = \\\"n\\\")]\\n\\n pub num_trades: u64,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct CandlestickMessage {\\n\\n #[serde(rename = \\\"e\\\")]\\n\\n pub event_type: String,\\n\\n #[serde(rename = \\\"E\\\")]\\n\\n pub event_time: u64,\\n\",\n \"file_path\": \"src/binance/model/websocket.rs\",\n \"rank\": 76,\n \"score\": 34010.8316087225\n },\n {\n \"content\": \" InputMessage::Snapshot {\\n\\n product_id,\\n\\n bids,\\n\\n asks,\\n\\n } => CoinbaseWebsocketMessage::Level2(Level2::Snapshot {\\n\\n product_id,\\n\\n bids,\\n\\n asks,\\n\\n }),\\n\\n InputMessage::L2update {\\n\\n product_id,\\n\\n changes,\\n\\n } => CoinbaseWebsocketMessage::Level2(Level2::L2update {\\n\\n product_id,\\n\\n changes,\\n\\n }),\\n\\n InputMessage::LastMatch(_match) => CoinbaseWebsocketMessage::Match(_match),\\n\\n InputMessage::Received(_match) => {\\n\\n CoinbaseWebsocketMessage::Full(Full::Received(_match))\\n\\n }\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 77,\n \"score\": 34010.705277768866\n },\n {\n \"content\": \" update_id,\\n\\n last_update_id,\\n\\n };\\n\\n OpenLimitsWebSocketMessage::OrderBookDiff(order_book_response)\\n\\n }\\n\\n })\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Debug, Clone)]\\n\\npub struct Level2SnapshotRecord {\\n\\n #[serde(with = \\\"string_to_decimal\\\")]\\n\\n pub price: Decimal,\\n\\n #[serde(with = \\\"string_to_decimal\\\")]\\n\\n pub size: Decimal,\\n\\n}\\n\\n\\n\\nimpl From<&Level2SnapshotRecord> for AskBid {\\n\\n fn from(record: &Level2SnapshotRecord) -> Self {\\n\\n let price = record.price;\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 78,\n \"score\": 34010.53481975771\n },\n {\n \"content\": \" .join(\\\"/\\\");\\n\\n\\n\\n let ws_url = match self.parameters.sandbox {\\n\\n true => WS_URL_SANDBOX,\\n\\n false => WS_URL_PROD,\\n\\n };\\n\\n let endpoint = url::Url::parse(&format!(\\\"{}?streams={}\\\", ws_url, streams))\\n\\n .map_err(OpenLimitsError::UrlParserError)?;\\n\\n let (ws_stream, _) = connect_async(endpoint).await?;\\n\\n\\n\\n let (mut sink, stream) = ws_stream.split();\\n\\n let (disconnection_sender, mut disconnection_receiver) = unbounded_channel();\\n\\n tokio::spawn(async move {\\n\\n if disconnection_receiver.recv().await.is_some() {\\n\\n sink.close().await.ok();\\n\\n }\\n\\n });\\n\\n\\n\\n if let Ok(mut senders) = self.disconnection_senders.lock() {\\n\\n senders.push(disconnection_sender);\\n\",\n \"file_path\": \"src/binance/client/websocket.rs\",\n \"rank\": 79,\n \"score\": 34010.49404861168\n },\n {\n \"content\": \" Level2,\\n\\n Matches,\\n\\n Full,\\n\\n User,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Debug)]\\n\\n#[serde(tag = \\\"type\\\")]\\n\\n#[serde(rename_all = \\\"snake_case\\\")]\\n\\npub(crate) enum InputMessage {\\n\\n Subscriptions {\\n\\n channels: Vec<Channel>,\\n\\n },\\n\\n Heartbeat {\\n\\n sequence: usize,\\n\\n last_trade_id: usize,\\n\\n product_id: String,\\n\\n time: String,\\n\\n },\\n\\n Ticker(Ticker),\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 80,\n \"score\": 34010.23276333194\n },\n {\n \"content\": \" TickerAll,\\n\\n OrderBook(String, i64), // (symbol, depth)\\n\\n Depth(String, Option<u16>), // (symbol, interval)\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone, Serialize)]\\n\\npub enum BinanceWebsocketMessage {\\n\\n UserOrderUpdate(UserOrderUpdate),\\n\\n UserAccountUpdate(AccountUpdate),\\n\\n AggregateTrade(AggregateTrade),\\n\\n Trade(TradeMessage),\\n\\n Candlestick(CandlestickMessage),\\n\\n MiniTicker(MiniTicker),\\n\\n MiniTickerAll(Vec<MiniTicker>),\\n\\n Ticker(Ticker),\\n\\n TickerAll(Vec<Ticker>),\\n\\n OrderBook(OrderBook),\\n\\n Depth(Depth),\\n\\n Ping,\\n\\n Pong,\\n\",\n \"file_path\": \"src/binance/model/websocket.rs\",\n \"rank\": 81,\n \"score\": 34009.892001461165\n },\n {\n \"content\": \"pub struct UserOrderUpdate {\\n\\n #[serde(rename = \\\"e\\\")]\\n\\n pub event_type: String,\\n\\n #[serde(rename = \\\"E\\\")]\\n\\n pub event_time: u64,\\n\\n #[serde(rename = \\\"s\\\")]\\n\\n pub symbol: String,\\n\\n #[serde(rename = \\\"c\\\")]\\n\\n pub new_client_order_id: String,\\n\\n #[serde(rename = \\\"S\\\")]\\n\\n pub side: Side,\\n\\n #[serde(rename = \\\"o\\\")]\\n\\n pub order_type: OrderType,\\n\\n #[serde(rename = \\\"f\\\")]\\n\\n pub time_in_force: TimeInForce,\\n\\n #[serde(rename = \\\"q\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub qty: Decimal,\\n\\n #[serde(rename = \\\"p\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub price: Decimal,\\n\\n #[serde(rename = \\\"P\\\", with = \\\"string_to_decimal\\\")]\\n\",\n \"file_path\": \"src/binance/model/websocket.rs\",\n \"rank\": 82,\n \"score\": 34009.86135053109\n },\n {\n \"content\": \" vec![Channel::Name(ChannelType::Level2)],\\n\\n vec![product_id.clone()],\\n\\n ),\\n\\n CoinbaseSubscription::Heartbeat(product_id) => (\\n\\n vec![Channel::Name(ChannelType::Heartbeat)],\\n\\n vec![product_id.clone()],\\n\\n ),\\n\\n _ => unimplemented!(),\\n\\n };\\n\\n let subscribe = Subscribe {\\n\\n _type: SubscribeCmd::Subscribe,\\n\\n auth: None,\\n\\n channels,\\n\\n product_ids,\\n\\n };\\n\\n\\n\\n let stream = self.connect(subscribe).await?;\\n\\n self.subscriptions.insert(subscription, stream);\\n\\n Ok(())\\n\\n }\\n\",\n \"file_path\": \"src/coinbase/client/websocket.rs\",\n \"rank\": 83,\n \"score\": 34009.66385391634\n },\n {\n \"content\": \" pub price: Option<Decimal>,\\n\\n pub side: super::OrderSide,\\n\\n pub user_id: Option<String>,\\n\\n #[serde(default)]\\n\\n pub profile_id: Option<String>,\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Debug, Clone)]\\n\\npub struct Activate {\\n\\n pub product_id: String,\\n\\n #[serde(with = \\\"string_to_decimal\\\")]\\n\\n pub timestamp: Decimal,\\n\\n pub order_id: String,\\n\\n pub stop_type: StopType,\\n\\n #[serde(with = \\\"string_to_decimal\\\")]\\n\\n pub size: Decimal,\\n\\n #[serde(with = \\\"string_to_decimal\\\")]\\n\\n pub funds: Decimal,\\n\\n #[serde(with = \\\"string_to_decimal\\\")]\\n\\n pub taker_fee_rate: Decimal,\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 84,\n \"score\": 34009.46424399006\n },\n {\n \"content\": \" ))\\n\\n } else if stream.name.contains(\\\"@kline_\\\") {\\n\\n Ok(BinanceWebsocketMessage::Candlestick(\\n\\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\\n\\n ))\\n\\n } else if stream.name.contains(\\\"@ticker\\\") {\\n\\n Ok(BinanceWebsocketMessage::Ticker(\\n\\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\\n\\n ))\\n\\n } else if stream.name.eq(\\\"!ticker@arr\\\") {\\n\\n Ok(BinanceWebsocketMessage::TickerAll(\\n\\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\\n\\n ))\\n\\n } else if stream.name.ends_with(\\\"@miniTicker\\\") {\\n\\n Ok(BinanceWebsocketMessage::MiniTicker(\\n\\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\\n\\n ))\\n\\n } else if stream.name.ends_with(\\\"!miniTicker@arr\\\") {\\n\\n Ok(BinanceWebsocketMessage::MiniTickerAll(\\n\\n serde_json::from_value(stream.data).map_err(de::Error::custom)?,\\n\",\n \"file_path\": \"src/binance/client/websocket.rs\",\n \"rank\": 85,\n \"score\": 34009.44827499353\n },\n {\n \"content\": \"#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub enum SubscribeCmd {\\n\\n Subscribe,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Clone, Deserialize, Debug, PartialEq, Eq, Hash)]\\n\\n#[serde(untagged)]\\n\\npub enum Channel {\\n\\n Name(ChannelType),\\n\\n WithProduct {\\n\\n name: ChannelType,\\n\\n product_ids: Vec<String>,\\n\\n },\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Debug, Clone, PartialEq, Eq, Hash)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub enum ChannelType {\\n\\n Heartbeat,\\n\\n Ticker,\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 86,\n \"score\": 34009.31483031311\n },\n {\n \"content\": \" pub stop_price: Decimal,\\n\\n #[serde(rename = \\\"F\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub iceberg_qty: Decimal,\\n\\n #[serde(skip_serializing)]\\n\\n pub g: i32,\\n\\n #[serde(skip_serializing, rename = \\\"C\\\")]\\n\\n pub c_ignore: Option<String>,\\n\\n #[serde(rename = \\\"x\\\")]\\n\\n pub execution_type: OrderExecType,\\n\\n #[serde(rename = \\\"X\\\")]\\n\\n pub order_status: OrderStatus,\\n\\n #[serde(rename = \\\"r\\\")]\\n\\n pub order_reject_reason: OrderRejectReason,\\n\\n #[serde(rename = \\\"i\\\")]\\n\\n pub order_id: u64,\\n\\n #[serde(rename = \\\"l\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub qty_last_filled_trade: Decimal,\\n\\n #[serde(rename = \\\"z\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub accumulated_qty_filled_trades: Decimal,\\n\\n #[serde(rename = \\\"L\\\", with = \\\"string_to_decimal\\\")]\\n\",\n \"file_path\": \"src/binance/model/websocket.rs\",\n \"rank\": 87,\n \"score\": 34008.95406686824\n },\n {\n \"content\": \"\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\\npub struct Auth {\\n\\n pub signature: String,\\n\\n pub key: String,\\n\\n pub passphrase: String,\\n\\n pub timestamp: String,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\\npub struct Subscribe {\\n\\n #[serde(rename = \\\"type\\\")]\\n\\n pub _type: SubscribeCmd,\\n\\n pub product_ids: Vec<String>,\\n\\n pub channels: Vec<Channel>,\\n\\n #[serde(flatten)]\\n\\n pub auth: Option<Auth>,\\n\\n}\\n\\n\\n\\n#[derive(Serialize, Deserialize, Debug)]\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 88,\n \"score\": 34008.77893187938\n },\n {\n \"content\": \" #[serde(rename = \\\"s\\\")]\\n\\n pub symbol: String,\\n\\n #[serde(rename = \\\"k\\\")]\\n\\n pub kline: Kline,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct AccountUpdate {\\n\\n #[serde(rename = \\\"e\\\")]\\n\\n pub event_type: String,\\n\\n #[serde(rename = \\\"E\\\")]\\n\\n pub event_time: u64,\\n\\n #[serde(rename = \\\"m\\\")]\\n\\n pub maker_commision_rate: u64,\\n\\n #[serde(rename = \\\"t\\\")]\\n\\n pub taker_commision_rate: u64,\\n\\n #[serde(rename = \\\"b\\\")]\\n\\n pub buyer_commision_rate: u64,\\n\\n #[serde(rename = \\\"s\\\")]\\n\",\n \"file_path\": \"src/binance/model/websocket.rs\",\n \"rank\": 89,\n \"score\": 34008.403710471706\n },\n {\n \"content\": \" pub buyer_order_id: u64,\\n\\n #[serde(rename = \\\"a\\\")]\\n\\n pub seller_order_id: u64,\\n\\n #[serde(rename = \\\"T\\\")]\\n\\n pub trade_order_time: u64,\\n\\n #[serde(rename = \\\"m\\\")]\\n\\n pub is_buyer_maker: bool,\\n\\n #[serde(skip_serializing, rename = \\\"M\\\")]\\n\\n pub m_ignore: bool,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct AggregateTrade {\\n\\n #[serde(rename = \\\"e\\\")]\\n\\n pub event_type: String,\\n\\n #[serde(rename = \\\"E\\\")]\\n\\n pub event_time: u64,\\n\\n #[serde(rename = \\\"s\\\")]\\n\\n pub symbol: String,\\n\",\n \"file_path\": \"src/binance/model/websocket.rs\",\n \"rank\": 90,\n \"score\": 34008.28863090266\n },\n {\n \"content\": \" pub cumulative_quote_asset_transacted_qty: Decimal,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct Depth {\\n\\n #[serde(rename = \\\"e\\\")]\\n\\n pub event_type: String,\\n\\n #[serde(rename = \\\"E\\\")]\\n\\n pub event_time: u64,\\n\\n #[serde(rename = \\\"s\\\")]\\n\\n pub symbol: String,\\n\\n #[serde(rename = \\\"U\\\")]\\n\\n pub first_update_id: u64,\\n\\n #[serde(rename = \\\"u\\\")]\\n\\n pub final_update_id: u64,\\n\\n #[serde(rename = \\\"b\\\")]\\n\\n pub bids: Vec<AskBid>,\\n\\n #[serde(rename = \\\"a\\\")]\\n\\n pub asks: Vec<AskBid>,\\n\",\n \"file_path\": \"src/binance/model/websocket.rs\",\n \"rank\": 91,\n \"score\": 34008.26233379846\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct Ticker {\\n\\n #[serde(rename = \\\"e\\\")]\\n\\n pub event_type: String,\\n\\n #[serde(rename = \\\"E\\\")]\\n\\n pub event_time: u64,\\n\\n #[serde(rename = \\\"s\\\")]\\n\\n pub symbol: String,\\n\\n #[serde(rename = \\\"p\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub price_change: Decimal,\\n\\n #[serde(rename = \\\"P\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub price_change_percent: Decimal,\\n\\n #[serde(rename = \\\"w\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub average_price: Decimal,\\n\\n #[serde(rename = \\\"x\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub prev_close: Decimal,\\n\\n #[serde(rename = \\\"c\\\", with = \\\"string_to_decimal\\\")]\\n\",\n \"file_path\": \"src/binance/model/websocket.rs\",\n \"rank\": 92,\n \"score\": 34008.12590061864\n },\n {\n \"content\": \" write!(f, \\\"{}@kline_{}\\\", symbol, interval)\\n\\n }\\n\\n BinanceSubscription::Depth(ref symbol, interval) => match interval {\\n\\n None => write!(f, \\\"{}@depth\\\", symbol),\\n\\n Some(i) => write!(f, \\\"{}@depth@{}ms\\\", symbol, i),\\n\\n },\\n\\n BinanceSubscription::MiniTicker(symbol) => write!(f, \\\"{}@miniTicker\\\", symbol),\\n\\n BinanceSubscription::MiniTickerAll => write!(f, \\\"!miniTicker@arr\\\"),\\n\\n BinanceSubscription::OrderBook(ref symbol, depth) => {\\n\\n write!(f, \\\"{}@depth{}\\\", symbol, depth)\\n\\n }\\n\\n BinanceSubscription::Ticker(ref symbol) => write!(f, \\\"{}@ticker\\\", symbol),\\n\\n BinanceSubscription::TickerAll => write!(f, \\\"!ticker@arr\\\"),\\n\\n BinanceSubscription::Trade(ref symbol) => write!(f, \\\"{}@trade\\\", symbol),\\n\\n BinanceSubscription::UserData(ref key) => write!(f, \\\"{}\\\", key),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl From<Subscription> for BinanceSubscription {\\n\",\n \"file_path\": \"src/binance/client/websocket.rs\",\n \"rank\": 93,\n \"score\": 34008.111954646614\n },\n {\n \"content\": \" #[serde(rename = \\\"l\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub locked: Decimal,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Serialize, Deserialize, Clone)]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\\npub struct MiniTicker {\\n\\n #[serde(rename = \\\"e\\\")]\\n\\n pub event_type: String,\\n\\n #[serde(rename = \\\"E\\\")]\\n\\n pub event_time: u64,\\n\\n #[serde(rename = \\\"s\\\")]\\n\\n pub symbol: String,\\n\\n #[serde(rename = \\\"c\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub close: Decimal,\\n\\n #[serde(rename = \\\"o\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub open: Decimal,\\n\\n #[serde(rename = \\\"l\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub low: Decimal,\\n\\n #[serde(rename = \\\"h\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub high: Decimal,\\n\\n #[serde(rename = \\\"v\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub volume: Decimal,\\n\\n #[serde(rename = \\\"q\\\", with = \\\"string_to_decimal\\\")]\\n\\n pub quote_volume: Decimal,\\n\\n}\\n\",\n \"file_path\": \"src/binance/model/websocket.rs\",\n \"rank\": 94,\n \"score\": 34008.041164706694\n },\n {\n \"content\": \" let qty = record.size;\\n\\n Self { price, qty }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Debug, Clone)]\\n\\npub struct Level2UpdateRecord {\\n\\n pub side: super::OrderSide,\\n\\n #[serde(with = \\\"string_to_decimal\\\")]\\n\\n pub price: Decimal,\\n\\n #[serde(with = \\\"string_to_decimal\\\")]\\n\\n pub size: Decimal,\\n\\n}\\n\\n\\n\\nimpl From<&Level2UpdateRecord> for AskBid {\\n\\n fn from(record: &Level2UpdateRecord) -> Self {\\n\\n let price = record.price;\\n\\n let qty = record.size;\\n\\n Self { price, qty }\\n\\n }\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 95,\n \"score\": 34007.939476025975\n },\n {\n \"content\": \" },\\n\\n Empty {\\n\\n sequence: usize,\\n\\n product_id: String,\\n\\n #[serde(with = \\\"string_to_opt_decimal\\\")]\\n\\n price: Option<Decimal>,\\n\\n },\\n\\n}\\n\\n\\n\\nimpl Ticker {\\n\\n pub fn price(&self) -> Decimal {\\n\\n match self {\\n\\n Ticker::Full { price, .. } => *price,\\n\\n Ticker::Empty { price, .. } => price.expect(\\\"Couldn't get price.\\\"),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn time(&self) -> Option<&String> {\\n\\n match self {\\n\\n Ticker::Full { time, .. } => Some(time),\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 96,\n \"score\": 34007.59879699431\n },\n {\n \"content\": \" Ticker::Full { best_ask, .. } => Some(best_ask.expect(\\\"Couldn't get best ask.\\\")),\\n\\n Ticker::Empty { .. } => None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Debug, Clone)]\\n\\npub enum Full {\\n\\n Received(Received),\\n\\n Open(Open),\\n\\n Done(Done),\\n\\n Match(Match),\\n\\n Change(Change),\\n\\n Activate(Activate),\\n\\n}\\n\\n\\n\\nimpl Full {\\n\\n pub fn price(&self) -> Option<&Decimal> {\\n\\n match self {\\n\\n Full::Received(Received::Limit { price, .. }) => Some(price),\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 97,\n \"score\": 34007.36727483327\n },\n {\n \"content\": \"#[derive(Deserialize, Debug, Clone)]\\n\\npub struct Match {\\n\\n pub trade_id: usize,\\n\\n pub sequence: usize,\\n\\n pub maker_order_id: String,\\n\\n pub taker_order_id: String,\\n\\n pub time: String,\\n\\n pub product_id: String,\\n\\n #[serde(with = \\\"string_to_decimal\\\")]\\n\\n pub size: Decimal,\\n\\n #[serde(with = \\\"string_to_decimal\\\")]\\n\\n pub price: Decimal,\\n\\n pub side: super::OrderSide,\\n\\n pub taker_user_id: Option<String>,\\n\\n pub taker_profile_id: Option<String>,\\n\\n pub maker_user_id: Option<String>,\\n\\n pub maker_profile_id: Option<String>,\\n\\n pub user_id: Option<String>,\\n\\n #[serde(default)]\\n\\n pub profile_id: Option<String>,\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 98,\n \"score\": 34005.937378898816\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n pub fn sequence(&self) -> Option<&usize> {\\n\\n match self {\\n\\n Full::Received(Received::Limit { sequence, .. }) => Some(sequence),\\n\\n Full::Received(Received::Market { sequence, .. }) => Some(sequence),\\n\\n Full::Open(Open { sequence, .. }) => Some(sequence),\\n\\n Full::Done(Done::Limit { sequence, .. }) => sequence.as_ref(),\\n\\n Full::Done(Done::Market { sequence, .. }) => Some(sequence),\\n\\n Full::Match(Match { sequence, .. }) => Some(sequence),\\n\\n Full::Change(Change { sequence, .. }) => Some(sequence),\\n\\n Full::Activate(Activate { .. }) => None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[derive(Deserialize, Debug, Clone)]\\n\\n#[serde(tag = \\\"order_type\\\")]\\n\\n#[serde(rename_all = \\\"camelCase\\\")]\\n\",\n \"file_path\": \"src/coinbase/model/websocket.rs\",\n \"rank\": 99,\n \"score\": 34005.79113737625\n }\n]","isConversational":false}}},{"rowIdx":991,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/processes/poisson.rs"},"repo_name":{"kind":"string","value":"rasa200/markovian"},"commit":{"kind":"string","value":"8824ae58301e83f2b8f0278b3d321c2a4000331a"},"file_code":{"kind":"string","value":"\nuse num_traits::Float;\nuse rand_distr::{Exp1, Exp};\nuse crate::{State, StateIterator};\nuse core::fmt::Debug;\nuse num_traits::{sign::Unsigned, One, Zero};\nuse rand::Rng;\nuse rand_distr::Distribution;\n\nuse crate::errors::InvalidState;\n\nuse core::mem;\n\n#[derive(Debug, Clone)]\npub struct Poisson<N, T, R>\nwhere\n N: Float,\n Exp1: Distribution<N>, \n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n R: Rng,\n{\n state: T,\n exp: Exp<N>,\n rng: R,\n}\n\nimpl<N, T, R> Poisson<N, T, R>\nwhere\n N: Float,\n Exp1: Distribution<N>, \n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n R: Rng,\n{\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n #[inline]\n pub fn new(lambda: N, rng: R) -> Result<Self, rand_distr::ExpError> {\n Ok(Poisson {\n state: T::zero(),\n exp: Exp::new(lambda)?,\n rng,\n })\n }\n}\n\nimpl<N, T, R> State for Poisson<N, T, R>\nwhere\n N: Float,\n Exp1: Distribution<N>, \n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n R: Rng,\n{\n type Item = T;\n\n #[inline]\n fn state(&self) -> Option<&Self::Item> {\n Some(&self.state)\n }\n\n #[inline]\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\n Some(&mut self.state)\n }\n\n #[inline]\n fn set_state(\n &mut self,\n mut new_state: Self::Item,\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\n mem::swap(&mut self.state, &mut new_state);\n Ok(Some(new_state))\n }\n}\n\nimpl<N, T, R> Iterator for Poisson<N, T, R>\nwhere\n N: Float,\n Exp1: Distribution<N>, \n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n R: Rng,\n{\n type Item = (N, T);\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n #[inline]\n fn next(&mut self) -> Option<Self::Item> {\n let period = self.exp.sample(&mut self.rng);\n self.set_state(self.state.clone() + T::one()).unwrap();\n self.state().cloned().map(|state| (period, state))\n }\n}\n\nimpl<N, T, R> StateIterator for Poisson<N, T, R>\nwhere\n N: Float,\n Exp1: Distribution<N>, \n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n R: Rng,\n{\n #[inline]\n fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\n self.state().cloned().map(|state| (N::zero(), state))\n }\n}\n\nimpl<N, T, R> Distribution<(N, T)> for Poisson<N, T, R>\nwhere\n N: Float,\n Exp1: Distribution<N>, \n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n R: Rng,\n{\n \n #[inline]\n fn sample<R2>(&self, rng: &mut R2) -> (N, T)\n where\n R2: Rng + ?Sized,\n { \n (self.exp.sample(rng), self.state.clone() + T::one())\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n \n #[test]\n fn value_stability() {\n let rng = crate::tests::rng(3);\n let lambda = 1.;\n let expected = vec![(0.529274135874436, 1), (0.5369108748992898, 2), (0.3618522192460201, 3), (0.5717432176122981, 4)];\n let mc = Poisson::new(lambda, rng).unwrap();\n let sample: Vec<(f64, u64)> = mc.take(4).collect();\n\n assert_eq!(sample, expected);\n }\n}"},"prefix":{"kind":"string","value":"\nuse num_traits::Float;\nuse rand_distr::{Exp1, Exp};\nuse crate::{State, StateIterator};\nuse core::fmt::Debug;\nuse num_traits::{sign::Unsigned, One, Zero};\nuse rand::Rng;\nuse rand_distr::Distribution;\n\nuse crate::errors::InvalidState;\n\nuse core::mem;\n\n#[derive(Debug, Clone)]\npub struct Poisson<N, T, R>\nwhere\n N: Float,\n Exp1: Distribution<N>, \n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n R: Rng,\n{\n state: T,\n exp: Exp<N>,\n rng: R,\n}\n\nimpl<N, T, R> Poisson<N, T, R>\nwhere\n N: Float,\n Exp1: Distribution<N>, \n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n R: Rng,\n{\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n #[inline]\n pub fn new(lambda: N, rng: R) -> Result<Self, rand_distr::ExpError> {\n Ok(Poisson {\n state: T::zero(),\n exp: Exp::new(lambda)?,\n rng,\n })\n }\n}\n\nimpl<N, T, R> State for Poisson<N, T, R>\nwhere\n N: Float,\n Exp1: Distribution<N>, \n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n R: Rng,\n{\n type Item = T;\n\n #[inline]\n fn state(&self) -> Option<&Self::Item> {\n Some(&self.state)\n }\n\n #[inline]\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\n Some(&mut self.state)\n }\n\n #[inline]\n "},"suffix":{"kind":"string","value":"\n}\n\nimpl<N, T, R> Iterator for Poisson<N, T, R>\nwhere\n N: Float,\n Exp1: Distribution<N>, \n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n R: Rng,\n{\n type Item = (N, T);\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n #[inline]\n fn next(&mut self) -> Option<Self::Item> {\n let period = self.exp.sample(&mut self.rng);\n self.set_state(self.state.clone() + T::one()).unwrap();\n self.state().cloned().map(|state| (period, state))\n }\n}\n\nimpl<N, T, R> StateIterator for Poisson<N, T, R>\nwhere\n N: Float,\n Exp1: Distribution<N>, \n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n R: Rng,\n{\n #[inline]\n fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\n self.state().cloned().map(|state| (N::zero(), state))\n }\n}\n\nimpl<N, T, R> Distribution<(N, T)> for Poisson<N, T, R>\nwhere\n N: Float,\n Exp1: Distribution<N>, \n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n R: Rng,\n{\n \n #[inline]\n fn sample<R2>(&self, rng: &mut R2) -> (N, T)\n where\n R2: Rng + ?Sized,\n { \n (self.exp.sample(rng), self.state.clone() + T::one())\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n \n #[test]\n fn value_stability() {\n let rng = crate::tests::rng(3);\n let lambda = 1.;\n let expected = vec![(0.529274135874436, 1), (0.5369108748992898, 2), (0.3618522192460201, 3), (0.5717432176122981, 4)];\n let mc = Poisson::new(lambda, rng).unwrap();\n let sample: Vec<(f64, u64)> = mc.take(4).collect();\n\n assert_eq!(sample, expected);\n }\n}"},"middle":{"kind":"string","value":"fn set_state(\n &mut self,\n mut new_state: Self::Item,\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\n mem::swap(&mut self.state, &mut new_state);\n Ok(Some(new_state))\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"pub trait State {\n\n type Item: core::fmt::Debug;\n\n\n\n #[inline]\n\n fn state(&self) -> Option<&Self::Item> {\n\n None\n\n }\n\n\n\n #[inline]\n\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\n\n None\n\n }\n\n\n\n /// Changes the `state` of the struct.\n\n /// \n\n /// If changing is succesful, this method should return the old state as an `Option<Self::Item>`.\n\n /// \n\n /// # Remarks\n\n ///\n\n /// You might want to use [core::mem::swap](https://doc.rust-lang.org/core/mem/fn.swap.html).\n\n #[inline]\n\n fn set_state(\n\n &mut self,\n\n new_state: Self::Item,\n\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\n\n Err(InvalidState::new(new_state))\n\n }\n\n}\n","file_path":"src/traits/state.rs","rank":0,"score":82345.80420010671},{"content":"/// Iterator with an internal state. \n\n/// \n\n/// Internals states can be thought as the \"initial\" element of an iterator, see [trajectory].\n\n/// \n\n/// # Example\n\n/// \n\n/// Usual case: A struct that uses the same type for [Iterator] and [State] traits.\n\n/// ```\n\n/// # struct MyStateIterator;\n\n/// # impl Iterator for MyStateIterator {\n\n/// # type Item = f64;\n\n/// # fn next(&mut self) -> Option<Self::Item> {\n\n/// # None\n\n/// # }\n\n/// # }\n\n/// # impl markovian::State for MyStateIterator {\n\n/// # type Item = f64;\n\n/// # }\n\n/// # use markovian::State;\n\n/// impl markovian::StateIterator for MyStateIterator {\n\n/// #[inline]\n\n/// fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\n\n/// self.state().cloned()\n\n/// }\n\n/// }\n\n/// ```\n\n///\n\n/// [trajectory]: trait.StateIterator.html#method.trajectory\n\n/// [Iterator]: https://doc.rust-lang.org/nightly/core/iter/trait.Iterator.html\n\n/// [State]: trait.State.html\n\npub trait StateIterator: Iterator + State + Sized {\n\n /// # Remarks\n\n /// \n\n /// You should use ``#[inline]`` when implementing this method.\n\n fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item>;\n\n\n\n /// Returns a new iterator whose first element is the state (seen as an item of the Iterator) \n\n /// and then follows with the elements of the iterator. \n\n #[inline]\n\n fn trajectory(self) -> Chain<std::option::IntoIter<<Self as std::iter::Iterator>::Item>, Self> {\n\n self.state_as_item().into_iter().chain(self)\n\n }\n\n}\n","file_path":"src/traits/state_iterator.rs","rank":1,"score":71161.21718393208},{"content":"fn main() {\n\n // Monte Carlo\n\n let (times, values): (Vec<_>, Vec<_>) = Poisson::<f64, usize, _>::new(LAMBDA, thread_rng())\n\n .unwrap()\n\n .trajectory()\n\n .take(STEPS)\n\n .unzip();\n\n // Plotting\n\n (times.iter().cumsum::<f64>(), values).preexplore()\n\n .set_title(format!(\"Poisson process, lambda = {}\", LAMBDA))\n\n .set_xlabel(\"time\")\n\n .set_ylabel(\"state\")\n\n .set_style(\"_|\")\n\n .plot(\"poisson\")\n\n .unwrap();\n\n}","file_path":"examples/poisson/main.rs","rank":2,"score":35100.09885708801},{"content":"fn main() {\n\n // Monte Carlo\n\n let monte_carlo_approx: Vec<f64> = (0..TIME).map(|time| {\n\n // Simulate a sample from Branchng ´processes at a fixed time\n\n let simulations = sample_population(BIRTH, DEATH, time, SAMPLES);\n\n // Compute extinction probability for this time\n\n extinction_prob(simulations)\n\n }).collect();\n\n // Plotting\n\n monte_carlo_approx.preexplore()\n\n .set_title(\"Approximate extinction probability\")\n\n .set_xlabel(\"time\")\n\n .set_ylabel(\"extinction_probability\")\n\n .plot(\"extinction\")\n\n .unwrap();\n\n}\n\n\n","file_path":"examples/branching/main.rs","rank":3,"score":35100.09885708801},{"content":"fn main() {\n\n // Finite state-space Markov Chain\n\n\n\n let init_state: i32 = 0;\n\n\n\n let transition = |state: &i32| Raw::new(vec![(0.5, state + 1), (0.5, state - 1)]);\n\n\n\n let mut mc = MarkovChain::new(init_state, &transition, thread_rng());\n\n\n\n println!(\"{:?}\", mc.state());\n\n println!(\"{:?}\", mc.next());\n\n println!(\"{:?}\", mc.next());\n\n println!(\"{:?}\", mc.next());\n\n\n\n // Infinite state-space Markov Chain\n\n\n\n let init_state: i32 = 0;\n\n let transition2 = |state: &i32| {\n\n let v: Vec<(f64, i32)> = (1..)\n\n .map(move |s| ((2.0_f32).powf(-s as f32), state + s as i32))\n","file_path":"examples/markov_chain/main.rs","rank":4,"score":33836.28387820474},{"content":"/// Samples population starting from 1 until time iterations.\n\nfn sample_population(\n\n birth_prob: f64,\n\n death_prob: f64,\n\n iterations: usize,\n\n samples: usize,\n\n) -> Vec<u32> {\n\n (0..samples)\n\n .collect::<Vec<usize>>()\n\n .par_iter()\n\n .map(|_| {\n\n let init_state: u32 = 1;\n\n let density = raw_dist![\n\n (death_prob, 0),\n\n (birth_prob, 2),\n\n (1.0 - birth_prob - death_prob, 1)\n\n ];\n\n let mut branching_process = Branching::new(init_state, density, thread_rng());\n\n\n\n branching_process.nth(iterations).unwrap()\n\n })\n\n .collect()\n\n}\n","file_path":"examples/branching/main.rs","rank":5,"score":33836.28387820474},{"content":"fn main() {\n\n\n\n let state_index = 0;\n\n let transition_matrix = ndarray::array![\n\n [1, 2, 3],\n\n [1, 0, 0],\n\n [0, 1, 1],\n\n ];\n\n let state_space = vec!['a', 'b', 'c'];\n\n let rng = thread_rng();\n\n\n\n let mut mc = FiniteMarkovChain::from((state_index, transition_matrix, state_space, rng));\n\n\n\n println!(\"{:?}\", mc.state());\n\n println!(\"{:?}\", mc.next());\n\n println!(\"{:?}\", mc.next());\n\n println!(\"{:?}\", mc.next());\n\n}","file_path":"examples/finite_markov_chain/main.rs","rank":6,"score":32689.90554482297},{"content":"/// Abstraction over transition matrix.\n\n///\n\n/// # Remarks\n\n/// \n\n/// Output parameter `O` allows sampling more than only the next state,\n\n/// for example, continuous markov chains are able to sample both a new state\n\n/// and a time step.\n\npub trait Transition<T, O> {\n\n fn sample_from<R>(&self, state: &T, rng: &mut R) -> O\n\n where\n\n R: Rng + ?Sized;\n\n}\n\n\n\nimpl<T, O, F, D> Transition<T, O> for F\n\nwhere\n\n F: Fn(&T) -> D,\n\n D: Distribution<O>,\n\n{\n\n #[inline]\n\n fn sample_from<R>(&self, state: &T, rng: &mut R) -> O\n\n where\n\n R: Rng + ?Sized,\n\n {\n\n self(state).sample(rng)\n\n }\n\n}\n\n\n","file_path":"src/traits/transition.rs","rank":7,"score":32457.378215965866},{"content":"fn bench_brownian(c: &mut Criterion) {\n\n let mut group = c.benchmark_group(\"Brownian Motion\");\n\n for i in [100, 1000, 10000].iter() {\n\n group.bench_with_input(BenchmarkId::new(\"Markovian\", i), i, \n\n |b, i| b.iter(|| brownian_motion(*i)));\n\n group.bench_with_input(BenchmarkId::new(\"Direct\", i), i, \n\n |b, i| b.iter(|| direct_brownian_motion(*i)));\n\n }\n\n group.finish();\n\n}\n\n\n\ncriterion_group!(benches, bench_brownian);\n\ncriterion_main!(benches);","file_path":"benches/brownian_motion.rs","rank":8,"score":29041.276339446358},{"content":"/// }\n\n/// impl markovian::State for ArithmeticSequence {\n\n/// type Item = f64;\n\n/// #[inline]\n\n/// fn state(&self) -> Option<&Self::Item> {\n\n/// Some(&self.state)\n\n/// }\n\n/// \n\n/// #[inline]\n\n/// fn state_mut(&mut self) -> Option<&mut Self::Item> {\n\n/// Some(&mut self.state)\n\n/// }\n\n/// #[inline]\n\n/// fn set_state(\n\n/// &mut self,\n\n/// mut new_state: Self::Item,\n\n/// ) -> Result<Option<Self::Item>, markovian::errors::InvalidState<Self::Item>> {\n\n/// std::mem::swap(&mut self.state, &mut new_state); // Change places\n\n/// Ok(Some(new_state)) // Return the previous state value\n\n/// }\n\n/// }\n\n/// ```\n\n///\n\n/// [Arithmetic sequence]: https://en.wikipedia.org/wiki/Arithmetic_progression\n\n\n","file_path":"src/traits/state.rs","rank":9,"score":27480.17904023246},{"content":"use crate::errors::InvalidState;\n\n\n\n/// Public state.\n\n/// \n\n/// `State` should be implemented when it is absolutely clear what a `state` for your your struct means.\n\n/// \n\n/// # Examples\n\n/// \n\n/// [Arithmetic sequence].\n\n/// ```\n\n/// struct ArithmeticSequence {\n\n/// state: f64,\n\n/// step: f64,\n\n/// }\n\n/// impl Iterator for ArithmeticSequence {\n\n/// type Item = f64;\n\n/// fn next(&mut self) -> Option<Self::Item> {\n\n/// self.state += self.step;\n\n/// Some(self.state)\n\n/// }\n","file_path":"src/traits/state.rs","rank":10,"score":27477.64426357613},{"content":"// To bench\n\nfn brownian_motion(steps: usize) -> Vec<f64> {\n\n\tlet state = 0.;\n\n\tlet transition = |_: &f64| StandardNormal;\n\n\tlet rng = thread_rng();\n\n\n\n\tlet mc = markovian::MarkovChain::new(state, transition, rng);\n\n\n\n\tmc.take(steps).collect()\n\n}\n\n\n","file_path":"benches/brownian_motion.rs","rank":11,"score":26640.133444500578},{"content":"/// # }\n\n/// # use markovian::State;\n\n/// impl markovian::StateIterator for MyStateIterator {\n\n/// #[inline]\n\n/// fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\n\n/// self.state().cloned()\n\n/// }\n\n/// }\n\n/// ```\n\n///\n\n/// [trajectory]: trait.StateIterator.html#method.trajectory\n\n/// [Iterator]: https://doc.rust-lang.org/nightly/core/iter/trait.Iterator.html\n\n/// [State]: trait.State.html\n","file_path":"src/traits/state_iterator.rs","rank":12,"score":26074.44957546347},{"content":"use crate::State;\n\nuse core::iter::Chain;\n\n\n\n/// Iterator with an internal state. \n\n/// \n\n/// Internals states can be thought as the \"initial\" element of an iterator, see [trajectory].\n\n/// \n\n/// # Example\n\n/// \n\n/// Usual case: A struct that uses the same type for [Iterator] and [State] traits.\n\n/// ```\n\n/// # struct MyStateIterator;\n\n/// # impl Iterator for MyStateIterator {\n\n/// # type Item = f64;\n\n/// # fn next(&mut self) -> Option<Self::Item> {\n\n/// # None\n\n/// # }\n\n/// # }\n\n/// # impl markovian::State for MyStateIterator {\n\n/// # type Item = f64;\n","file_path":"src/traits/state_iterator.rs","rank":13,"score":26071.602762644663},{"content":"// To compare with\n\nfn direct_brownian_motion(steps: usize) -> Vec<f64> {\n\n\tlet mut rng = thread_rng();\n\n\t(0..steps).map(|_| rng.sample(StandardNormal)).collect()\n\n}\n\n\n\n\n","file_path":"benches/brownian_motion.rs","rank":14,"score":25831.096018243916},{"content":"/// Counts the fraction of the trayectories that are not extinct.\n\n/// Formally, it gives\n\n/// \\PP_1( X_{max_iterations} = 0),\n\n/// approximated by samples number of simuations.\n\nfn extinction_prob(population_samples: Vec<u32>) -> f64 {\n\n let samples = population_samples.len();\n\n population_samples\n\n .into_iter()\n\n .filter(|&x| x == 0_u32)\n\n .count() as f64\n\n / samples as f64\n\n}\n\n\n","file_path":"examples/branching/main.rs","rank":15,"score":25831.096018243916},{"content":" state,\n\n base_distribution,\n\n rng,\n\n }\n\n }\n\n}\n\n\n\nimpl<T, D, R> State for Branching<T, D, R>\n\nwhere\n\n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n\n D: Distribution<T>,\n\n R: Rng,\n\n{\n\n type Item = T;\n\n\n\n #[inline]\n\n fn state(&self) -> Option<&Self::Item> {\n\n Some(&self.state)\n\n }\n\n\n","file_path":"src/processes/branching.rs","rank":21,"score":27.289024351185947},{"content":" #[inline]\n\n fn next(&mut self) -> Option<Self::Item> {\n\n let mut count = T::one();\n\n let mut acc = T::zero();\n\n while count <= self.state {\n\n acc = acc + self.base_distribution.sample(&mut self.rng);\n\n count = count + T::one();\n\n }\n\n self.state = acc.clone();\n\n Some(acc)\n\n }\n\n}\n\n\n\nimpl<T, D, R> StateIterator for Branching<T, D, R>\n\nwhere\n\n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n\n D: Distribution<T>,\n\n R: Rng,\n\n{\n\n #[inline]\n","file_path":"src/processes/branching.rs","rank":22,"score":25.8351614490955},{"content":" fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\n\n self.state().cloned()\n\n }\n\n}\n\n\n\nimpl<T, D, R> Distribution<T> for Branching<T, D, R>\n\nwhere\n\n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n\n D: Distribution<T>,\n\n R: Rng,\n\n{\n\n /// Sample a possible next state. \n\n #[inline]\n\n fn sample<R2>(&self, rng: &mut R2) -> T \n\n where\n\n R2: Rng + ?Sized,\n\n { \n\n let mut count = T::one();\n\n let mut acc = T::zero();\n\n while count < self.state {\n","file_path":"src/processes/branching.rs","rank":24,"score":25.696356216124137},{"content":" #[inline]\n\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\n\n Some(&mut self.state)\n\n }\n\n\n\n #[inline]\n\n fn set_state(\n\n &mut self,\n\n mut new_state: Self::Item,\n\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\n\n mem::swap(&mut self.state, &mut new_state);\n\n Ok(Some(new_state))\n\n }\n\n}\n\n\n\nimpl<T, D, R> Iterator for Branching<T, D, R>\n\nwhere\n\n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n\n D: Distribution<T>,\n\n R: Rng,\n","file_path":"src/processes/branching.rs","rank":25,"score":25.485749663719147},{"content":"{\n\n type Item = (N, T);\n\n\n\n #[inline]\n\n fn next(&mut self) -> Option<Self::Item> {\n\n let (period, state) = self.transition.sample_from(&self.state, &mut self.rng);\n\n self.state = state;\n\n self.state().cloned().map(|state| (period, state))\n\n }\n\n}\n\n\n\nimpl<N, T, F, R> StateIterator for TimedMarkovChain<N, T, F, R>\n\nwhere\n\n T: Debug + Clone,\n\n F: Transition<T, (N, T)>,\n\n R: Rng,\n\n N: From<f64>,\n\n{\n\n #[inline]\n\n fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\n","file_path":"src/timed_markov_chain.rs","rank":26,"score":24.57538602481686},{"content":" #[inline]\n\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\n\n Some(&mut self.state)\n\n }\n\n\n\n #[inline]\n\n fn set_state(\n\n &mut self,\n\n mut new_state: Self::Item,\n\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\n\n mem::swap(&mut self.state, &mut new_state);\n\n Ok(Some(new_state))\n\n }\n\n}\n\n\n\nimpl<N, T, F, R> Iterator for TimedMarkovChain<N, T, F, R>\n\nwhere\n\n T: Debug + Clone,\n\n F: Transition<T, (N, T)>,\n\n R: Rng,\n","file_path":"src/timed_markov_chain.rs","rank":27,"score":23.24001220753382},{"content":" self.state_index = self.sample_index();\n\n let period = self.sample_clock();\n\n self.state().cloned().map(|x| (period, x))\n\n }\n\n}\n\n\n\nimpl<T, W, R> StateIterator for ContFiniteMarkovChain<T, W, R>\n\nwhere\n\n W: Float + AliasableWeight,\n\n Exp1: Distribution<W>,\n\n T: Debug + PartialEq + Clone,\n\n R: Rng,\n\n{\n\n #[inline]\n\n fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\n\n self.state().cloned().map(|x| (W::zero(), x))\n\n }\n\n}\n\n\n\nimpl<T, W, R> Distribution<(W, T)> for ContFiniteMarkovChain<T, W, R>\n","file_path":"src/continuous_finite_markov_chain.rs","rank":28,"score":23.177991550927583},{"content":" TimedMarkovChain {\n\n state,\n\n transition,\n\n rng,\n\n phantom: PhantomData,\n\n }\n\n }\n\n}\n\n\n\nimpl<N, T, F, R> State for TimedMarkovChain<N, T, F, R>\n\nwhere\n\n T: Debug + Clone,\n\n{\n\n type Item = T;\n\n\n\n #[inline]\n\n fn state(&self) -> Option<&Self::Item> {\n\n Some(&self.state)\n\n }\n\n\n","file_path":"src/timed_markov_chain.rs","rank":29,"score":23.092853387692447},{"content":" R: Rng,\n\n F: Transition<T, T>,\n\n{\n\n #[inline]\n\n pub fn new(state: T, transition: F, rng: R) -> Self {\n\n MarkovChain {\n\n state,\n\n transition,\n\n rng,\n\n }\n\n }\n\n}\n\n\n\nimpl<T, F, R> State for MarkovChain<T, F, R>\n\nwhere\n\n T: Debug + Clone,\n\n{\n\n type Item = T;\n\n\n\n #[inline]\n","file_path":"src/markov_chain.rs","rank":30,"score":22.77008418876804},{"content":" T: Debug + PartialEq + Clone,\n\n R: Rng + Debug + Clone,\n\n{\n\n type Item = T;\n\n\n\n #[inline]\n\n fn state(&self) -> Option<&Self::Item> {\n\n Some(&self.state_space[self.state_index])\n\n }\n\n\n\n #[inline]\n\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\n\n Some(&mut self.state_space[self.state_index])\n\n }\n\n\n\n #[inline]\n\n fn set_state(\n\n &mut self,\n\n new_state: Self::Item,\n\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":31,"score":22.558119908564514},{"content":" Some(mut state_index) => {\n\n mem::swap(&mut self.state_index, &mut state_index);\n\n Ok(Some(self.state_space[state_index].clone()))\n\n }\n\n None => Err(InvalidState::new(new_state)),\n\n }\n\n }\n\n}\n\n\n\nimpl<T, W, R> Iterator for ContFiniteMarkovChain<T, W, R>\n\nwhere\n\n W: Float + AliasableWeight,\n\n Exp1: Distribution<W>,\n\n T: Debug + PartialEq + Clone,\n\n R: Rng,\n\n{\n\n type Item = (W, T);\n\n\n\n #[inline]\n\n fn next(&mut self) -> Option<Self::Item> {\n","file_path":"src/continuous_finite_markov_chain.rs","rank":32,"score":21.66176547323422},{"content":"where\n\n T: Debug + Clone,\n\n F: Transition<T, T>,\n\n R: Rng,\n\n{\n\n type Item = T;\n\n\n\n #[inline]\n\n fn next(&mut self) -> Option<Self::Item> {\n\n self.state = self.transition.sample_from(&self.state, &mut self.rng);\n\n self.state().cloned()\n\n }\n\n}\n\n\n\nimpl<T, F, R> StateIterator for MarkovChain<T, F, R>\n\nwhere\n\n T: Debug + Clone,\n\n F: Transition<T, T>,\n\n R: Rng,\n\n{\n","file_path":"src/markov_chain.rs","rank":33,"score":21.583798039176965},{"content":"/// constitutes the second generation and the process repeats. \n\n/// The overall process is therefore characterized by the number of \n\n/// offsprings an individual has. \n\n/// The resulting process is a Markov Chain in NN.\n\n#[derive(Debug, Clone)]\n\npub struct Branching<T, D, R> \n\nwhere\n\n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n\n D: Distribution<T>,\n\n R: Rng,\n\n{\n\n state: T,\n\n base_distribution: D,\n\n rng: R,\n\n}\n\n\n\nimpl<T, D, R> Branching<T, D, R>\n\nwhere\n\n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\n\n D: Distribution<T>,\n","file_path":"src/processes/branching.rs","rank":34,"score":21.5718930116394},{"content":" fn next(&mut self) -> Option<Self::Item> {\n\n self.state_index = self.sample_index();\n\n self.state().cloned()\n\n }\n\n}\n\n\n\nimpl<T, W, R> StateIterator for FiniteMarkovChain<T, W, R>\n\nwhere\n\n W: AliasableWeight + Debug + Clone,\n\n Uniform<W>: Debug + Clone,\n\n T: Debug + PartialEq + Clone,\n\n R: Rng + Debug + Clone,\n\n{\n\n #[inline]\n\n fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\n\n self.state().cloned()\n\n }\n\n}\n\n\n\nimpl<T, W, R> Distribution<T> for FiniteMarkovChain<T, W, R>\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":35,"score":21.357302661505024},{"content":" #[inline]\n\n fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\n\n self.state().cloned()\n\n }\n\n}\n\n\n\nimpl<T, F, R> Distribution<T> for MarkovChain<T, F, R>\n\nwhere\n\n T: Debug + Clone,\n\n F: Transition<T, T>,\n\n R: Rng,\n\n{\n\n /// Sample a possible next state. \n\n #[inline]\n\n fn sample<R2>(&self, rng: &mut R2) -> T\n\n where\n\n R2: Rng + ?Sized,\n\n { \n\n self.transition.sample_from(&self.state, rng)\n\n }\n","file_path":"src/markov_chain.rs","rank":36,"score":20.640257439865145},{"content":"/// If your transition function `transition` could reuse of structs that implement\n\n/// the `Distribution<T>` trait in order to sample the next state, then, \n\n/// for the best performance possible, create your own struct that implements\n\n/// the `Transition<T, (N, T)>` trait.\n\n#[derive(Debug, Clone)]\n\npub struct TimedMarkovChain<N, T, F, R> {\n\n state: T,\n\n transition: F,\n\n rng: R,\n\n phantom: PhantomData<N>,\n\n}\n\n\n\nimpl<N, T, F, R> TimedMarkovChain<N, T, F, R>\n\nwhere\n\n R: Rng,\n\n F: Transition<T, (N, T)>,\n\n N: From<f64>,\n\n{\n\n #[inline]\n\n pub fn new(state: T, transition: F, rng: R) -> Self {\n","file_path":"src/timed_markov_chain.rs","rank":37,"score":20.43940426102349},{"content":" }\n\n }\n\n\n\n #[inline]\n\n fn sample_index(&mut self) -> usize {\n\n self.transition_matrix[self.state_index].sample(&mut self.rng)\n\n }\n\n\n\n #[inline]\n\n fn sample_clock(&mut self) -> W {\n\n let rate = self.transiton_clock[self.state_index];\n\n Exp::new(rate).unwrap().sample(&mut self.rng)\n\n }\n\n}\n\n\n\nimpl<T, W, R> State for ContFiniteMarkovChain<T, W, R>\n\nwhere\n\n W: Float + AliasableWeight,\n\n Exp1: Distribution<W>,\n\n T: Debug + PartialEq + Clone,\n","file_path":"src/continuous_finite_markov_chain.rs","rank":38,"score":19.551115613628234},{"content":"where\n\n W: Float + AliasableWeight,\n\n Exp1: Distribution<W>,\n\n T: Debug + PartialEq + Clone,\n\n R: Rng,\n\n{\n\n /// Sample a possible next state. \n\n #[inline]\n\n fn sample<R2>(&self, rng: &mut R2) -> (W, T) \n\n where\n\n R2: Rng + ?Sized,\n\n { \n\n let new_index = self.transition_matrix[self.state_index].sample(rng);\n\n let rate = self.transiton_clock[self.state_index];\n\n let step = Exp::new(rate).unwrap().sample(rng);\n\n\n\n (step, self.state_space[new_index].clone())\n\n }\n\n}","file_path":"src/continuous_finite_markov_chain.rs","rank":39,"score":19.45656340789994},{"content":" self.state().cloned().map(|state| (N::from(0.0), state))\n\n }\n\n}\n\n\n\nimpl<N, T, F, R> Distribution<(N, T)> for TimedMarkovChain<N, T, F, R>\n\nwhere\n\n T: Debug + Clone,\n\n F: Transition<T, (N, T)>,\n\n R: Rng,\n\n N: From<f64>,\n\n{\n\n /// Sample a possible next state. \n\n #[inline]\n\n fn sample<R2>(&self, rng: &mut R2) -> (N, T)\n\n where\n\n R2: Rng + ?Sized,\n\n { \n\n self.transition.sample_from(&self.state, rng)\n\n }\n\n}\n","file_path":"src/timed_markov_chain.rs","rank":40,"score":19.014096510317447},{"content":"// #[derive(Debug, Clone)]\n\npub struct ContFiniteMarkovChain<T, W, R>\n\nwhere\n\n W: Float + AliasableWeight,\n\n Exp1: Distribution<W>,\n\n R: Rng,\n\n{\n\n state_index: usize,\n\n transition_matrix: Vec<WeightedAliasIndex<W>>,\n\n transiton_clock: Vec<W>,\n\n state_space: Vec<T>,\n\n rng: R,\n\n}\n\n\n\nimpl<T, W, R> ContFiniteMarkovChain<T, W, R>\n\nwhere\n\n W: Float + AliasableWeight,\n\n Exp1: Distribution<W>,\n\n R: Rng,\n\n{\n","file_path":"src/continuous_finite_markov_chain.rs","rank":41,"score":18.698795139970084},{"content":"///\n\n/// [Distribution implementation]: struct.Raw.html#impl-Distribution<T>\n\n#[derive(Debug, Clone, PartialEq)]\n\npub struct Raw<I> {\n\n iter: I,\n\n}\n\n\n\nimpl<I> Raw<I> {\n\n #[inline]\n\n pub fn new(iter: I) -> Self {\n\n Raw { iter }\n\n }\n\n}\n\n\n\nimpl<P, T, I> Distribution<T> for Raw<I>\n\nwhere\n\n P: Zero + One + PartialOrd + Debug + Copy, \n\n f64: From<P>,\n\n I: IntoIterator<Item = (P, T)> + Clone,\n\n{\n","file_path":"src/distributions/raw.rs","rank":42,"score":18.685689947426813},{"content":" #[inline]\n\n fn sample<R>(&self, rng: &mut R) -> T\n\n where\n\n R: Rng + ?Sized,\n\n {\n\n let cum_goal: f64 = rng.gen(); // NOT CORRECT\n\n\n\n let mut acc: f64 = 0.0;\n\n let one = f64::from(P::one());\n\n\n\n for (prob, state) in self.iter.clone() {\n\n assert!(P::zero() <= prob, \"Probabilities can not be negative. Tried to use {:?}\", prob);\n\n assert!(one >= acc, \"Probabilities can not be more than one. Tried to use {:?}\", acc);\n\n \tacc += f64::from(prob);\n\n if acc >= cum_goal {\n\n return state;\n\n }\n\n }\n\n panic!(\"Sampling was not possible: probabilities did not cover all posiibilities. Check the type of your probabilities and all possibilities by rng.gen() there.\")\n\n }\n","file_path":"src/distributions/raw.rs","rank":44,"score":18.249262226785945},{"content":"// Traits\n\nuse crate::{State, StateIterator};\n\nuse core::fmt::Debug;\n\nuse rand::Rng;\n\nuse rand_distr::{weighted_alias::{WeightedAliasIndex, AliasableWeight}, Distribution};\n\nuse num_traits::float::Float;\n\n\n\n// Structs\n\nuse crate::errors::InvalidState;\n\nuse rand_distr::{Exp1, Exp};\n\n\n\n// Functions\n\nuse core::mem;\n\n\n\n/// Finite state Markov Chain in continuous time. \n\n/// \n\n/// # Costs\n\n/// \n\n/// Construction cost: O(n), n: size of the state space.\n\n/// Sample cost: O(1).\n","file_path":"src/continuous_finite_markov_chain.rs","rank":45,"score":17.85983782682678},{"content":" match self.state_space.iter().position(|s| *s == new_state) {\n\n Some(mut state_index) => {\n\n mem::swap(&mut self.state_index, &mut state_index);\n\n Ok(Some(self.state_space[state_index].clone()))\n\n }\n\n None => Err(InvalidState::new(new_state)),\n\n }\n\n }\n\n}\n\n\n\nimpl<T, W, R> Iterator for FiniteMarkovChain<T, W, R>\n\nwhere\n\n W: AliasableWeight + Debug + Clone,\n\n Uniform<W>: Debug + Clone,\n\n T: Debug + PartialEq + Clone,\n\n R: Rng + Debug + Clone,\n\n{\n\n type Item = T;\n\n\n\n #[inline]\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":46,"score":17.425327983967616},{"content":"\n\nuse core::marker::PhantomData;\n\nuse rand::Rng;\n\nuse rand_distr::Distribution;\n\n\n\n/// Concrete struct for the function of a `Distribution. \n\n/// \n\n/// # Examples\n\n/// \n\n/// The squared of a exponential.\n\n/// ```\n\n/// # use rand_distr::Exp1;\n\n/// # use markovian::distributions::Unary;\n\n/// let exp_squared = Unary::new(|x: f64| x.powi(2_i32), Exp1);\n\n/// ```\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Unary<S, T, F, D> \n\nwhere\n\n F: Fn(S) -> T,\n\n D: Distribution<S>,\n","file_path":"src/distributions/unary.rs","rank":47,"score":17.40771066704862},{"content":"impl<T, W, R> Into<(DiGraph<T, W>, petgraph::graph::NodeIndex)> for FiniteMarkovChain<T, W, R>\n\nwhere\n\n W: AliasableWeight + Debug + Clone,\n\n Uniform<W>: Debug + Clone,\n\n T: Debug + PartialEq + Clone,\n\n R: Rng + Debug + Clone,\n\n{\n\n /// Performs the conversion.\n\n ///\n\n /// # Examples\n\n ///\n\n /// An absorbing Markov Chain with one transient state and one absorbing state.\n\n /// ```\n\n /// # use ndarray::array;\n\n /// # use markovian::{FiniteMarkovChain, State};\n\n /// # use petgraph::graph::DiGraph;\n\n /// let mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\n\n /// let (graph, node) = mc.into();\n\n /// assert_eq!(graph[node], 0);\n\n /// assert_eq!(graph.neighbors(node).count(), 2);\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":48,"score":17.34793470474759},{"content":" R: Rng,\n\n{\n\n type Item = T;\n\n\n\n #[inline]\n\n fn state(&self) -> Option<&Self::Item> {\n\n Some(&self.state_space[self.state_index])\n\n }\n\n\n\n #[inline]\n\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\n\n Some(&mut self.state_space[self.state_index])\n\n }\n\n\n\n #[inline]\n\n fn set_state(\n\n &mut self,\n\n new_state: Self::Item,\n\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\n\n match self.state_space.iter().position(|s| *s == new_state) {\n","file_path":"src/continuous_finite_markov_chain.rs","rank":49,"score":17.318552934125087},{"content":" R: Rng,\n\n{\n\n /// Creates a new Branching process. \n\n /// \n\n /// # Examples\n\n /// \n\n /// Construction using density p(0) = 0.3, p(1) = 0.4, p(2) = 0.3. \n\n /// ```\n\n /// # #![allow(unused_mut)]\n\n /// # use markovian::prelude::*;\n\n /// # use rand::prelude::*;\n\n /// let init_state: u32 = 1;\n\n /// let density = raw_dist![(0.3, 0), (0.4, 1), (0.3, 2)];\n\n /// let rng = thread_rng();\n\n /// let mut branching_process = Branching::new(init_state, density, rng);\n\n /// ``` \n\n ///\n\n #[inline]\n\n pub fn new(state: T, base_distribution: D, rng: R) -> Self {\n\n Branching {\n","file_path":"src/processes/branching.rs","rank":50,"score":16.913070867266477},{"content":"use thiserror::Error;\n\n\n\n#[derive(Copy, Clone, Debug, Default, Eq, Hash, Ord, PartialEq, PartialOrd, Error)]\n\n#[error(\"the state {state:?} is not a valid assignation\")]\n\npub struct InvalidState<T: std::fmt::Debug> {\n\n state: T,\n\n}\n\n\n\nimpl<T: std::fmt::Debug> InvalidState<T> {\n\n\t#[inline]\n\n pub fn new(state: T) -> Self {\n\n InvalidState { state }\n\n }\n\n}\n","file_path":"src/errors.rs","rank":51,"score":16.834955059980857},{"content":"where\n\n W: AliasableWeight + Debug + Clone,\n\n Uniform<W>: Debug + Clone,\n\n T: Debug + PartialEq + Clone,\n\n R: Rng + Debug + Clone,\n\n{\n\n /// Sample a possible next state. \n\n #[inline]\n\n fn sample<R2>(&self, rng: &mut R2) -> T\n\n where\n\n R2: Rng + ?Sized,\n\n { \n\n let new_index = self.transition_matrix_variables[self.state_index].sample(rng);\n\n\n\n self.state_space[new_index].clone()\n\n }\n\n}\n\n\n\nimpl<W, R> From<(usize, Vec<Vec<W>>, R)> for FiniteMarkovChain<usize, W, R>\n\nwhere\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":52,"score":16.60596768179914},{"content":"// Traits\n\nuse crate::{State, StateIterator};\n\nuse core::fmt::Debug;\n\nuse num_traits::{sign::Unsigned, One, Zero};\n\nuse rand::Rng;\n\nuse rand_distr::Distribution;\n\n\n\n// Structs\n\nuse crate::errors::InvalidState;\n\n\n\n// Functions\n\nuse core::mem;\n\n\n\n/// Branching process in the natural numbers NN = {0, 1, 2, ...}.\n\n/// \n\n/// A Branching process is characterized by a density p over NN. It can be \n\n/// thought of the size of a population. \n\n/// In this population, each individual is identical to the rest and they are \n\n/// independent of each other. Moreover, at each time step, \n\n/// individuals have descendents and die. Their descendants \n","file_path":"src/processes/branching.rs","rank":53,"score":16.49695247888869},{"content":"pub struct FiniteMarkovChain<T, W, R>\n\nwhere\n\n W: AliasableWeight + Debug + Clone,\n\n Uniform<W>: Debug + Clone,\n\n T: Debug + PartialEq + Clone,\n\n R: Rng + Debug + Clone,\n\n{\n\n state_index: usize,\n\n transition_matrix: Vec<Vec<W>>,\n\n transition_matrix_variables: Vec<WeightedAliasIndex<W>>,\n\n state_space: Vec<T>,\n\n rng: R,\n\n}\n\n\n\nimpl<T, W, R> FiniteMarkovChain<T, W, R>\n\nwhere\n\n W: AliasableWeight + Debug + Clone,\n\n Uniform<W>: Debug + Clone,\n\n T: Debug + PartialEq + Clone,\n\n R: Rng + Debug + Clone,\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":54,"score":16.362995318213446},{"content":"///\n\n/// # Examples\n\n///\n\n/// Random walk in the integers.\n\n/// ```\n\n/// # use markovian::{MarkovChain, prelude::*};\n\n/// # use rand::prelude::*;\n\n/// let init_state: i32 = 0;\n\n/// let transition = |state: &i32| Raw::new(vec![(0.5, state + 1), (0.5, state - 1)]);\n\n/// MarkovChain::new(init_state, &transition, thread_rng());\n\n/// ```\n\n#[derive(Debug, Clone)]\n\npub struct MarkovChain<T, F, R> {\n\n state: T,\n\n transition: F,\n\n rng: R,\n\n}\n\n\n\nimpl<T, F, R> MarkovChain<T, F, R>\n\nwhere\n","file_path":"src/markov_chain.rs","rank":55,"score":16.314238615311154},{"content":" W: AliasableWeight + Debug + Clone,\n\n Uniform<W>: Debug + Clone,\n\n R: Rng + Debug + Clone,\n\n{\n\n\t/// Performs the conversion.\n\n\t///\n\n /// # Panics\n\n ///\n\n /// This method panics if: \n\n /// - Any vector of `transition_matrix` has more than u32::MAX columns.\n\n /// - For any entry w of any vector of `transition_matrix` v: \n\n /// w < 0 or w > max where max = W::MAX / v.len().\n\n /// - For any vector of `transition_matrix` the sum of weights is zero.\n\n fn from((state_index, transition_matrix, rng): (usize, Vec<Vec<W>>, R)) -> Self {\n\n let state_space: Vec<usize> = (0..transition_matrix.len()).collect();\n\n FiniteMarkovChain::new(state_index, transition_matrix, state_space, rng)\n\n }\n\n}\n\n\n\nimpl<T, W, R> From<(usize, ndarray::Array2<W>, Vec<T>, R)> for FiniteMarkovChain<T, W, R>\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":56,"score":15.955913506941426},{"content":"// Traits\n\nuse rand::Rng;\n\nuse rand_distr::Distribution;\n\n\n\n// Structs\n\nuse core::marker::PhantomData;\n\n\n\n/// Concrete struct for the function of two Distributions`. \n\n/// \n\n/// # Examples\n\n/// \n\n/// A Beta(2, 1) as the sum of two exponentials(1).\n\n/// ```\n\n/// # use rand_distr::Exp1;\n\n/// # use markovian::distributions::Binary;\n\n/// let beta = Binary::new(|x: f64, y: f64| x + y, Exp1, Exp1);\n\n/// ```\n\n#[derive(Debug, Copy, Clone)]\n\npub struct Binary<S1, S2, T, F, D1, D2> \n\nwhere\n","file_path":"src/distributions/binary.rs","rank":57,"score":15.911994370664381},{"content":"where\n\n W: AliasableWeight + Debug + Clone,\n\n Uniform<W>: Debug + Clone,\n\n T: Debug + PartialEq + Clone,\n\n R: Rng + Debug + Clone,\n\n{\n\n\t/// Performs the conversion.\n\n\t///\n\n /// # Panics\n\n ///\n\n /// This method panics if: \n\n /// - (In debug mode only) The dimensions of `state_space` and `transition_matrix` do not match.\n\n /// - `transition_matrix` has more than u32::MAX columns.\n\n /// - For any entry of `transition_matrix` w: \n\n /// w < 0 or w > max where max = W::MAX / transition_matrix.ncols().\n\n /// - For any row of `transition_matrix` the sum of weights is zero.\n\n\tfn from((state_index, transition_matrix, state_space, rng): (usize, ndarray::Array2<W>, Vec<T>, R)) -> Self {\n\n let transition_matrix: Vec<Vec<W>> = transition_matrix.genrows()\n\n .into_iter()\n\n .map(|weights| {\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":58,"score":15.756250344793155},{"content":" fn state(&self) -> Option<&Self::Item> {\n\n Some(&self.state)\n\n }\n\n\n\n #[inline]\n\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\n\n Some(&mut self.state)\n\n }\n\n\n\n #[inline]\n\n fn set_state(\n\n &mut self,\n\n mut new_state: Self::Item,\n\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\n\n mem::swap(&mut self.state, &mut new_state);\n\n Ok(Some(new_state))\n\n }\n\n}\n\n\n\nimpl<T, F, R> Iterator for MarkovChain<T, F, R>\n","file_path":"src/markov_chain.rs","rank":59,"score":15.724426462401727},{"content":"//! \n\n//! ## Continuous space\n\n//!\n\n//! Randomize the transition: return a random element together with a probability one\n\n//!\n\n//! ### Examples\n\n//! \n\n//! A random walk on the real line with variable step size. \n\n//! ```\n\n//! # use rand_distr::Exp;\n\n//! # use rand::prelude::*;\n\n//! # use markovian::prelude::*;\n\n//! let init_state: f64 = 0.0;\n\n//! struct MyTransition;\n\n//! impl markovian::Transition<f64, f64> for MyTransition {\n\n//! fn sample_from<R: ?Sized>(&self, state: &f64, rng: &mut R) -> f64\n\n//! where\n\n//! R: Rng\n\n//! {\n\n//! let step = Exp::new(2.0).unwrap().sample(rng);\n","file_path":"src/lib.rs","rank":61,"score":15.217197605821251},{"content":" /// w < 0 or w > max where max = W::MAX / transition_matrix.ncols().\n\n /// - For any row of `transition_matrix` the sum of weights is zero.\n\n ///\n\n /// # Example\n\n ///\n\n /// An absorbing Markov Chain with one transient state and one absorbing state.\n\n /// ```\n\n /// # use ndarray::array;\n\n /// # use markovian::FiniteMarkovChain;\n\n /// # use markovian::State;\n\n /// let mut mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\n\n /// assert_eq!(mc.state(), Some(&0));\n\n /// println!(\"At time {}, the state is {}\", 1_000, mc.nth(1_000).unwrap()); // Most likely 1\n\n /// ``` \n\n fn from((state_index, transition_matrix, rng): (usize, ndarray::Array2<W>, R)) -> Self {\n\n let state_space: Vec<usize> = (0..transition_matrix.nrows()).collect();\n\n FiniteMarkovChain::from((state_index, transition_matrix, state_space, rng))\n\n }\n\n}\n\n\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":62,"score":14.559517985639353},{"content":" ///\n\n /// There is one absorbing state: state `b`, which has index `1`.\n\n /// ```\n\n /// # use ndarray::array;\n\n /// # use markovian::{FiniteMarkovChain, State};\n\n /// let mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()))\n\n /// .set_state_space(vec!['a', 'b']);\n\n /// assert_eq!(mc.absorbing_states_indexes(), vec![1]);\n\n /// ```\n\n #[inline]\n\n pub fn absorbing_states_indexes(&self) -> Vec<usize> {\n\n let transition_matrix = &self.transition_matrix;\n\n \t(0..self.state_space.len())\n\n .filter(|&i| {\n\n let quantities_check = transition_matrix[i].iter()\n\n .enumerate()\n\n .map(|(j, w)| {\n\n if j == i {\n\n w > &W::ZERO\n\n } else {\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":63,"score":14.330856277317668},{"content":" weights.to_vec()\n\n })\n\n .collect();\n\n FiniteMarkovChain::new(state_index, transition_matrix, state_space, rng)\n\n }\n\n}\n\n\n\nimpl<W, R> From<(usize, ndarray::Array2<W>, R)> for FiniteMarkovChain<usize, W, R>\n\nwhere\n\n W: AliasableWeight + Debug + Clone,\n\n Uniform<W>: Debug + Clone,\n\n R: Rng + Debug + Clone,\n\n{\n\n\t/// Performs the conversion.\n\n\t///\n\n /// # Panics\n\n ///\n\n /// This method panics if: \n\n /// - `transition_matrix` has more than u32::MAX columns.\n\n /// - For any entry of `transition_matrix` w: \n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":64,"score":13.59787424625264},{"content":"}\n\n\n\nimpl<S1, S2, T, F, D1, D2> Distribution<T> for Binary<S1, S2, T, F, D1, D2>\n\nwhere\n\n F: Fn(S1, S2) -> T,\n\n D1: Distribution<S1>,\n\n D2: Distribution<S2>,\n\n{\n\n #[inline]\n\n fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> T {\n\n (self.func)(self.distr_1.sample(rng), self.distr_2.sample(rng))\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n\tuse super::*;\n\n\tuse rand_distr::Exp1;\n\n\n\n #[test]\n","file_path":"src/distributions/binary.rs","rank":65,"score":13.59430199185643},{"content":" /// assert!(mc.may_absorb());\n\n /// ``` \n\n #[inline]\n\n pub fn may_absorb(&self) -> bool {\n\n let set: std::collections::HashSet<_> = self.absorbing_states_indexes().into_iter().collect();\n\n let (graph, node) = self.clone().into();\n\n let mut bfs = petgraph::visit::Bfs::new(&graph, node);\n\n while let Some(other_node) = bfs.next(&graph) {\n\n if set.contains(&other_node.index()) {\n\n return true\n\n } \n\n }\n\n false\n\n }\n\n}\n\n\n\nimpl<T, W, R> State for FiniteMarkovChain<T, W, R>\n\nwhere\n\n W: AliasableWeight + Debug + Clone,\n\n Uniform<W>: Debug + Clone,\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":66,"score":13.535616709619688},{"content":" /// even if they are not recheable from the current state.\n\n ///\n\n /// # Panics\n\n ///\n\n /// In debug mode, if `new_state_space` is not as long as the current state space. \n\n ///\n\n /// # Examples\n\n ///\n\n /// Changing from numbers to letters.\n\n /// ```\n\n /// # use ndarray::array;\n\n /// # use markovian::{FiniteMarkovChain, State};\n\n /// let mc = FiniteMarkovChain::from((1, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\n\n /// assert_eq!(mc.state(), Some(&1));\n\n /// let mc = mc.set_state_space(vec!['a', 'b']);\n\n /// assert_eq!(mc.state(), Some(&'b'));\n\n /// ```\n\n #[inline]\n\n pub fn set_state_space<U>(self, new_state_space: Vec<U>) -> FiniteMarkovChain<U, W, R> \n\n where\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":67,"score":13.488384392443491},{"content":" #[inline]\n\n pub fn new(\n\n state_index: usize,\n\n transition_weights: Vec<Vec<W>>,\n\n state_space: Vec<T>,\n\n rng: R,\n\n ) -> Self {\n\n let transition_matrix: Vec<WeightedAliasIndex<W>> = transition_weights.clone()\n\n .into_iter()\n\n .map(|weights| WeightedAliasIndex::new(weights).unwrap())\n\n .collect();\n\n let transiton_clock: Vec<W> = transition_weights.into_iter()\n\n .map(|weights| weights.into_iter().sum::<W>())\n\n .collect();\n\n ContFiniteMarkovChain {\n\n state_index,\n\n transition_matrix,\n\n transiton_clock,\n\n state_space,\n\n rng,\n","file_path":"src/continuous_finite_markov_chain.rs","rank":68,"score":13.109169676751044},{"content":" D: Distribution<S>,\n\n{\n\n #[inline]\n\n fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> T {\n\n (self.func)(self.distr.sample(rng))\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n\tuse super::*;\n\n\tuse rand_distr::Exp1;\n\n\n\n #[test]\n\n fn use_cases() {\n\n let mut rng = crate::tests::rng(1);\n\n let expected = 0.5851203106605716 - 1.;\n\n let sample: f64 = Unary::new(|x: f64| x - 1., Exp1).sample(&mut rng);\n\n\n\n assert_eq!(sample, expected);\n\n\n\n let expected = 0.15721404552459717;\n\n let sample: f64 = Unary::new(|x:f64| x + 1., Unary::new(|x: f32| (x - 1.) as f64, Exp1)).sample(&mut rng);\n\n assert_eq!(sample, expected);\n\n }\n\n}\n","file_path":"src/distributions/unary.rs","rank":70,"score":12.798672466158056},{"content":"//! let init_state: u32 = 1;\n\n//! let base_distribution = raw_dist![(0.3, 0), (0.4, 1), (0.3, 2)];\n\n//! let rng = thread_rng();\n\n//! let mut branching_process = Branching::new(init_state, base_distribution, rng);\n\n//! ``` \n\n//! ## Continuous time\n\n//! \n\n//! Construction of a random walk in the integers, with expponential time for each transition.\n\n//! ```\n\n//! # #![allow(unused_mut)]\n\n//! # use rand::prelude::*;\n\n//! # use rand_distr::{Exp, Uniform};\n\n//! # use markovian::prelude::*;\n\n//! let init_state: i32 = 0;\n\n//! struct MyTransition;\n\n//! impl markovian::Transition<i32, (f64, i32)> for MyTransition {\n\n//! fn sample_from<R: ?Sized>(&self, state: &i32, rng: &mut R) -> (f64, i32)\n\n//! where\n\n//! R: Rng\n\n//! {\n","file_path":"src/lib.rs","rank":71,"score":12.705060775144755},{"content":"///\n\n/// # Warning\n\n///\n\n/// The user should make sure that the indexes resulting from random transitions \n\n/// correspond to a state in the state space. In other words, new indexes\n\n/// should always be less than the length of the state space. \n\n///\n\n/// # Examples\n\n///\n\n/// The easiest way is construct a finite Markov Chain is from a transition matrix. \n\n/// This has been abstracted by using `from`. For example,\n\n/// an absorbing Markov Chain with one transient state and one absorbing state.\n\n/// ```\n\n/// # use ndarray::array;\n\n/// # use markovian::{FiniteMarkovChain, State};\n\n/// let mut mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\n\n/// assert_eq!(mc.state(), Some(&0));\n\n/// println!(\"At time {}, the state is {}\", 1_000, mc.nth(1_000).unwrap()); // Most likely 1\n\n/// ```\n\n#[derive(Debug, Clone)]\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":72,"score":12.576474927706412},{"content":" /// # use ndarray::array;\n\n /// # use markovian::{FiniteMarkovChain, State};\n\n /// let mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()))\n\n /// .set_state_space(vec!['a', 'b']);\n\n /// assert_eq!(mc.absorbing_states(), vec![&'b']);\n\n /// ```\n\n #[inline]\n\n pub fn absorbing_states(&self) -> Vec<&T> {\n\n \tself.absorbing_states_indexes()\n\n \t\t.iter()\n\n \t\t.map(|&i| &self.state_space()[i])\n\n \t\t.collect()\n\n }\n\n\n\n /// Returns the indexes indexes of all absorbing state, if any.\n\n ///\n\n /// An absorbing state is a state such that, if the process starts there, \n\n /// it will allways be there, i.e. the probability of moving to itself is one.\n\n ///\n\n /// # Examples\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":73,"score":12.57260470476633},{"content":" /// The state space is the collection of all values the chain might ever take,\n\n /// even if they are not recheable from the current state.\n\n ///\n\n /// # Examples\n\n ///\n\n /// The state space can be more than one state, \n\n /// even if the Markov Chain is already absorbed. \n\n /// ```\n\n /// # use ndarray::array;\n\n /// # use markovian::{FiniteMarkovChain, State};\n\n /// let mc = FiniteMarkovChain::from((1, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\n\n /// assert_eq!(mc.state_space(), &vec![0, 1]);\n\n /// ```\n\n #[inline]\n\n pub fn state_space(&self) -> &Vec<T> {\n\n &self.state_space\n\n } \n\n\n\n /// Returns the size of the state space.\n\n ///\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":74,"score":12.49429872765829},{"content":" rng: R,\n\n ) -> Self {\n\n let transition_matrix_variables = transition_matrix.clone().into_iter()\n\n \t.map(|v| WeightedAliasIndex::new(v).unwrap())\n\n \t.collect();\n\n\n\n FiniteMarkovChain::new_raw(\n\n state_index,\n\n transition_matrix,\n\n transition_matrix_variables,\n\n state_space,\n\n rng\n\n )\n\n }\n\n\n\n #[inline]\n\n fn new_raw(\n\n state_index: usize,\n\n transition_matrix: Vec<Vec<W>>,\n\n transition_matrix_variables: Vec<WeightedAliasIndex<W>>, \n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":75,"score":12.306995357438103},{"content":" \tU: Debug + PartialEq + Clone,\n\n {\n\n FiniteMarkovChain::new_raw( \n\n\t\t self.state_index,\n\n\t\t self.transition_matrix,\n\n\t\t self.transition_matrix_variables,\n\n\t\t new_state_space,\n\n\t\t self.rng,\n\n )\n\n }\n\n\n\n /// Returns all absorbing state, if any.\n\n ///\n\n /// An absorbing state is a state such that, if the process starts there, \n\n /// it will allways be there, i.e. the probability of moving to itself is one.\n\n ///\n\n /// # Examples\n\n ///\n\n /// There is one absorbing state: state `b`.\n\n /// ```\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":76,"score":12.153202441410158},{"content":"### Good\n\n\n\nStruct P<T>: and from methods for different T: Copy + Clone + Debug + PartialOrd + Num\n\n\n\n- Pros\n\n\n\n - More general than closed01\n\n - Checked initialization in debug mode (use assert_debug!)\n\n- Implement any trait we want, e.g. [num_traits](https://docs.rs/num-traits/0.2.12/num_traits/index.html) and some [core::ops](https://doc.rust-lang.org/nightly/core/ops/index.html).\n\n - Accept unums or posits, e.g. [softposit](https://crates.io/crates/softposit) (best implementation of the best rivel to floating point!)\n\n - [Visualization](https://cse512-19s.github.io/FP-Well-Rounded/)\n\n - [Paper](http://www.johngustafson.net/pdfs/BeatingFloatingPoint.pdf)\n\n\n\n#### Rejected\n\n\n\n- [closed01](https://crates.io/crates/closed01): a new type of float with extra methods. \n\n - Pros:\n\n - Add\n\n - WrappingAdd\n\n - SaturingAdd\n\n - Cons:\n\n - Still only floats\n\n \n","file_path":"TODO.md","rank":77,"score":11.775125360920233},{"content":"// Traits\n\nuse rand_distr::Distribution;\n\nuse crate::traits::{State, StateIterator, Transition};\n\nuse core::fmt::Debug;\n\nuse rand::Rng;\n\n\n\n// Structs\n\nuse crate::errors::InvalidState;\n\nuse core::marker::PhantomData;\n\n\n\n// Functions\n\nuse core::mem;\n\n\n\n/// Markov Chain in continuous time, with arbitrary space.\n\n///\n\n/// Rust allows for more than only exponential time in the transitions, so \n\n/// does this crate. \n\n/// \n\n/// # Remarks\n\n/// \n","file_path":"src/timed_markov_chain.rs","rank":78,"score":11.752318339214323},{"content":"// Traits\n\nuse crate::{State, StateIterator};\n\nuse core::fmt::Debug;\n\nuse rand::Rng;\n\nuse rand_distr::{weighted_alias::{WeightedAliasIndex, AliasableWeight}, Uniform, Distribution};\n\n\n\n// Structs\n\nuse crate::errors::InvalidState;\n\nuse petgraph::graph::DiGraph;\n\n\n\n// Functions\n\nuse core::mem;\n\n\n\n/// Finite state Markov Chain in discrete time. \n\n/// \n\n/// # Costs\n\n/// \n\n/// **Construction**: O(n^2), where n is the size of the state space.\n\n/// \n\n/// **Sample**: O(1).\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":79,"score":11.713243377663002},{"content":"//! (1.0 - 1.0 / (path_stadistic.abs() + 1) as f64, right), \n\n//! (1.0 / (path_stadistic.abs() + 1) as f64, left)\n\n//! ]\n\n//! }\n\n//! };\n\n//! let rng = thread_rng();\n\n//! let mut mc = markovian::MarkovChain::new(init_state, transition, rng);\n\n//! \n\n//! // state has history\n\n//! mc.next();\n\n//! assert_eq!(mc.state().unwrap().len(), 2);\n\n//! ```\n\n//! \n\npub use self::continuous_finite_markov_chain::ContFiniteMarkovChain;\n\npub use self::finite_markov_chain::FiniteMarkovChain;\n\npub use self::markov_chain::MarkovChain;\n\npub use self::timed_markov_chain::TimedMarkovChain;\n\npub use self::traits::{State, StateIterator, Transition};\n\n\n\n/// Generating random trajectories from stochactic processes\n","file_path":"src/lib.rs","rank":80,"score":11.30647119918135},{"content":"// Traits\n\nuse rand_distr::Distribution;\n\nuse crate::traits::{State, StateIterator, Transition};\n\nuse core::fmt::Debug;\n\nuse rand::Rng;\n\n\n\n// Structs\n\nuse crate::errors::InvalidState;\n\n\n\n// Functions\n\nuse core::mem;\n\n\n\n/// Markov Chain in discrete time, with arbitrary space.\n\n///\n\n/// # Remarks\n\n/// \n\n/// If your transition function `transition` could reuse of structs that implement\n\n/// the `Distribution<T>` trait in order to sample the next state, then, \n\n/// for the best performance possible, create your own struct that implements\n\n/// the `Transition<T, T>` trait.\n","file_path":"src/markov_chain.rs","rank":81,"score":11.27169721570398},{"content":"//! let time = Exp::new(2.0).unwrap().sample(rng);\n\n//! let step = Uniform::from(0..=1).sample(rng) * 2 - 1;\n\n//! (time, state + step)\n\n//! }\n\n//! }\n\n//! let transition = MyTransition;\n\n//! let rng = thread_rng();\n\n//! let mut mc = markovian::TimedMarkovChain::new(init_state, transition, rng);\n\n//! ``` \n\n//!\n\n//! # Remarks\n\n//!\n\n//! All methods are `inline`, by design.\n\n//! \n\n//! Non-trivial ways to use the crate are described below, including time dependence, \n\n//! continuous space and non-markovian processes.\n\n//!\n\n//! ## Time dependence\n\n//!\n\n//! Include the time as part of the state of the process.\n","file_path":"src/lib.rs","rank":82,"score":10.927266439655487},{"content":"// Traits\n\nuse core::fmt::Debug;\n\nuse num_traits::{One, Zero};\n\nuse rand::Rng;\n\nuse rand_distr::Distribution;\n\n\n\n// use num_traits::Zero;\n\n\n\n/// Distribution over possibly infinte iterators. \n\n/// \n\n/// A random variable is represented by an iterator that yields values ``(P, T)``,\n\n/// where ``P`` represents the probability of the realization ``T``.\n\n/// See [Distribution implementation] for the trait constrains over ``P``.\n\n/// \n\n/// # Examples\n\n/// \n\n/// With help of the `raw_dist` macro, we construct a random variable that samples always a fixed value.\n\n/// ```\n\n/// # use markovian::prelude::*;\n\n/// # use rand::prelude::*;\n","file_path":"src/distributions/raw.rs","rank":83,"score":10.915609404524444},{"content":" ///\n\n /// Although the state the Markov Chain does not change, \n\n /// its random number generator does. That is why this method needs `&mut self`.\n\n ///\n\n /// # Examples\n\n ///\n\n /// From the current state, the next index has equal probability of being `0` or `1`.\n\n /// ```\n\n /// # use ndarray::array;\n\n /// # use markovian::{FiniteMarkovChain, State};\n\n /// let mut mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\n\n /// println!(\"The next index could be {}\", mc.sample_index()); // 50% 0 and 50% 1.\n\n /// ```\n\n #[inline]\n\n pub fn sample_index(&mut self) -> usize {\n\n self.transition_matrix_variables[self.state_index].sample(&mut self.rng)\n\n }\n\n\n\n /// Returns the state space of the Markov Chain.\n\n ///\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":84,"score":10.6287057713355},{"content":"# To do\n\n\n\nRe-factor to be only stochastic processes and not sub-stochastic ones.\n\n\n\n## Derive Macros\n\n\n\n- State\n\n - Needs to read where_clauses to write them again in the implementation of State trait\n\n - Needs to be given (input) the type of Item (...which is always `T`). \n\n - Nice error message!\n\n- StateIterator\n\n - ??\n\n\n\nOnce implemented, clean the code for all the structs. \n\n\n\n## FiniteMarkovChain\n\n\n\n- Construction\n\n - Checks of state_space!\n\n - What is the condition you want\n\n - state_space must be different elements\n\n - set_state_space\n\n - state_space must be different elements\n\n - From Vec<T>\n\n - From a sample, \n\n - Consider the initial state\n\n - Discover the state space\n\n - Count each transition\n\n - Construct the chain \n\n - Add to lib module documentation\n\n- Move from panicking to errors\n\n - Create errors\n\n\n\n## ContFiniteMarkovChain\n\n\n\n- The same\n\n- has_absorbing_state(&self) -> bool\n\n\n\n## Macros\n\n\n\n- Learn to do useful macros!\n\n\n\n## Organization\n\n\n\n- **Modules organization:** different algorithms for simulation\n\n - Exact\n\n - Fast\n\n - Sample speed\n\n - Accurate\n\n - epsilon-strong\n\n - Brownian motion\n\n\n\n## Jump processes\n\n\n\nIn a few cases, the marginal distributions of the increments have a simple form such as a **gamma distribution**, a **stable distribution**, or an **inverse Gaussian distribution** so that special methods for such distributions allow to generate discrete skeletons. \n\n\n\n- [x] Possion process\n\n- [ ] Levy process\n\n\n\n\n\n\n\n## Abstract probabilities\n\n\n\nNo longer use only f64 to represent probabilities\n\n\n\nRequirements:\n\n\n\n- Need to represent cummulative probabilities, to simulate raw_dist!\n\n\n\n### Options\n\n\n\n### Best\n\n\n\n`Unit` wrapper from `nalgebra`!\n\n\n\nhttps://docs.rs/nalgebra/0.26.2/nalgebra/base/struct.Unit.html\n\n\n\nIdea: `Distribution<[T; N]>` wrapper for vectors, with constant generics!\n\n\n\n- Implementation: prob-num crate!\n\n\n","file_path":"TODO.md","rank":85,"score":10.60432284534424},{"content":" /// The state space is the collection of all values the chain might ever take,\n\n /// even if they are not recheable from the current state.\n\n ///\n\n /// # Examples\n\n ///\n\n /// A Markov Chain with two states. \n\n /// ```\n\n /// # use ndarray::array;\n\n /// # use markovian::FiniteMarkovChain;\n\n /// let mc = FiniteMarkovChain::from((1, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\n\n /// assert_eq!(mc.nstates(), 2);\n\n /// ```\n\n #[inline]\n\n pub fn nstates(&self) -> usize {\n\n self.state_space().len()\n\n } \n\n\n\n /// Changes the state space of the Markov Chain.\n\n ///\n\n /// The state space is the collection of all values the chain might ever take,\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":86,"score":10.49427391955882},{"content":"pub use self::state::State;\n\npub use self::state_iterator::StateIterator;\n\npub use self::transition::Transition;\n\n\n\nmod state;\n\nmod state_iterator;\n\nmod transition;\n","file_path":"src/traits.rs","rank":87,"score":10.357390618001421},{"content":"{\n\n type Item = T;\n\n\n\n /// Changes the state of the Branching to a new state, chosen \n\n /// according to the distribution for offsprings, and returns the new state. \n\n /// \n\n /// # Examples\n\n /// \n\n /// ```\n\n /// # use rand::prelude::*;\n\n /// # use markovian::prelude::*;\n\n /// let init_state: u32 = 1;\n\n /// let density = raw_dist![(0.3, 0), (0.4, 1), (0.3, 2)];\n\n /// let rng = thread_rng();\n\n /// let mut branching_process = Branching::new(init_state, density, rng);\n\n ///\n\n /// // The next state is 0, 1 or 2. \n\n /// let new_state = branching_process.next();\n\n /// assert!( (new_state == Some(0)) || (new_state == Some(1)) || (new_state == Some(2)) );\n\n /// ```\n","file_path":"src/processes/branching.rs","rank":88,"score":10.227343491178656},{"content":"//!\n\n//! ### Examples\n\n//! \n\n//! A random walk on the integers that tends to move more to the right as time goes by. \n\n//! ```\n\n//! # #![allow(unused_mut)]\n\n//! # use rand::prelude::*;\n\n//! # use rand_distr::{Exp, Uniform};\n\n//! # use markovian::prelude::*;\n\n//! let init_state: (usize, i32) = (0, 0);\n\n//! let transition = |(time, state): &(usize, i32)| raw_dist![\n\n//! (0.6 - 1.0 / (time + 2) as f64, (time + 1, state + 1)),\n\n//! (0.4 + 1.0 / (time + 2) as f64, (time + 1, state - 1))\n\n//! ];\n\n//! let rng = thread_rng();\n\n//! let mut mc = markovian::MarkovChain::new(init_state, &transition, rng);\n\n//! \n\n//! // Take a sample of 10 elements \n\n//! mc.take(10).map(|(_, state)| state).collect::<Vec<i32>>();\n\n//! ```\n","file_path":"src/lib.rs","rank":89,"score":9.855801178412321},{"content":" /// from the current state.\n\n ///\n\n /// # Examples\n\n ///\n\n /// Checking the possibility of achieving a state from different initial states.\n\n /// ```\n\n /// # use ndarray::array;\n\n /// # use markovian::{FiniteMarkovChain, State};\n\n /// let mut mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()))\n\n /// .set_state_space(vec!['x', 'y']);\n\n /// assert!(mc.may_achieve('x').unwrap());\n\n /// assert!(mc.may_achieve('y').unwrap());\n\n /// mc.set_state('y');\n\n /// assert!(!mc.may_achieve('x').unwrap());\n\n /// assert!(mc.may_achieve('y').unwrap());\n\n /// ```\n\n #[inline]\n\n pub fn may_achieve(&self, query: T) -> Result<bool, InvalidState<T>> {\n\n match self.state_space.iter().position(|s| *s == query) {\n\n Some(state_index) => {\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":90,"score":9.748182746781236},{"content":"{\n\n /// Constructs a new `FiniteMarkovChain<T, W, R>`.\n\n /// \n\n /// # Panics\n\n /// \n\n /// # Panics\n\n ///\n\n /// This method panics if: \n\n /// - The`state_space` vector has repeated elements\n\n /// (defined by PartialEq).\n\n /// - The dimensions of `state_space` and `transition_matrix` do not match.\n\n /// - Any vector of `transition_matrix` has more than u32::MAX columns.\n\n /// - For any entry w of any vector of `transition_matrix` v: \n\n /// w < 0 or w > max where max = W::MAX / v.len().\n\n /// - For any vector of `transition_matrix` the sum of weights is zero.\n\n #[inline]\n\n pub fn new(\n\n state_index: usize,\n\n transition_matrix: Vec<Vec<W>>,\n\n state_space: Vec<T>,\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":91,"score":9.678872268072116},{"content":"//! state + step\n\n//! }\n\n//! }\n\n//! let transition = MyTransition;\n\n//! let rng = thread_rng();\n\n//! let mut mc = markovian::MarkovChain::new(init_state, transition, rng);\n\n//! mc.next();\n\n//! \n\n//! // current_state is positive \n\n//! assert!(mc.state().unwrap() > &0.0);\n\n//! ```\n\n//! \n\n//! ## Non markovian\n\n//!\n\n//! Include history in the state. For example, instead of `i32`, use `Vec<i32>`. \n\n//!\n\n//! ### Examples\n\n//! \n\n//! A random walk on the integers that is atracted to zero in a non markovian\n\n//! fashion. \n","file_path":"src/lib.rs","rank":92,"score":9.516512692551528},{"content":" acc = acc + self.base_distribution.sample(rng);\n\n count = count + T::one();\n\n }\n\n acc\n\n }\n\n}\n\n\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use crate::prelude::*;\n\n\n\n #[test]\n\n fn value_stability() {\n\n let expected = vec![2, 1, 2, 1, 1, 2, 4, 3, 2, 1, 1, 0];\n\n let init_state: u32 = 1;\n\n let density = raw_dist![(0.3, 0), (0.4, 1), (0.3, 2)];\n\n let rng = crate::tests::rng(1);\n\n let branching_process = Branching::new(init_state, density, rng);\n\n let sample: Vec<u32> = branching_process.take(12).collect();\n\n assert_eq!(sample, expected);\n\n }\n\n}","file_path":"src/processes/branching.rs","rank":93,"score":9.25210375592958},{"content":"//! Simulation of (sub-)stochastic processes.\n\n//!\n\n//! # Goal\n\n//!\n\n//! Serve as an extension of the [rand crate](https://crates.io/crates/rand) for sub-stochastic processes.\n\n//! \n\n//! # Examples\n\n//!\n\n//! ## Finite Markov Chains\n\n//!\n\n//! An absorbing Markov Chain with one transient state and one absorbing state.\n\n//! ```\n\n//! # use ndarray::array;\n\n//! # use markovian::State;\n\n//! let mut mc = markovian::FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\n\n//! assert_eq!(mc.state(), Some(&0));\n\n//! assert_eq!(mc.state_space(), &vec![0, 1]);\n\n//! println!(\"At time {}, the state is {}\", 1_000, mc.nth(1_000).unwrap()); // Most likely 1\n\n//! ``` \n\n//!\n","file_path":"src/lib.rs","rank":94,"score":9.241545738504666},{"content":" state_space: Vec<T>,\n\n rng: R,\n\n ) -> Self {\n\n let state_space_len_true: usize = state_space.iter()\n\n .map(|x| state_space.iter().filter(|&y| x == y).count())\n\n .sum();\n\n assert_eq!(state_space_len_true, state_space.len());\n\n assert_eq!(transition_matrix.len(), state_space.len());\n\n FiniteMarkovChain {\n\n state_index,\n\n transition_matrix,\n\n transition_matrix_variables,\n\n state_space,\n\n rng,\n\n }\n\n }\n\n\n\n /// Samples a possible index for the next state.\n\n ///\n\n /// # Remarks\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":95,"score":8.953311159089026},{"content":"/// let value = 0;\n\n/// let dis = raw_dist![(1, value)];\n\n///\n\n/// assert_eq!(value, dis.sample(&mut thread_rng()));\n\n/// ```\n\n/// \n\n/// # Panics\n\n/// \n\n/// Panics if probabilities: \n\n/// - Are strictly less than zero. \n\n/// - Sum up strictly more than one.\n\n/// \n\n/// # Costs\n\n/// \n\n/// Sample cost: O(iterator length).\n\n/// Construction cost: O(1).\n\n/// \n\n/// # Remarks\n\n/// \n\n/// This struct is meant to be used when one needs to sample once from an infinte iterator.\n","file_path":"src/distributions/raw.rs","rank":96,"score":8.90743876716201},{"content":"//! ## Discrete time\n\n//! \n\n//! Construction of a random walk in the integers.\n\n//! ```\n\n//! # #![allow(unused_mut)]\n\n//! # use markovian::prelude::*;\n\n//! # use rand::prelude::*;\n\n//! let init_state: i32 = 0;\n\n//! let transition = |state: &i32| raw_dist![(0.5, state + 1), (0.5, state - 1)];\n\n//! let rng = thread_rng();\n\n//! let mut mc = markovian::MarkovChain::new(init_state, transition, rng);\n\n//! ``` \n\n//! \n\n//! ## Branching process\n\n//!\n\n//! Construction using density p(0) = 0.3, p(1) = 0.4, p(2) = 0.3. \n\n//! ```\n\n//! # #![allow(unused_mut)]\n\n//! # use markovian::prelude::*;\n\n//! # use rand::prelude::*;\n","file_path":"src/lib.rs","rank":97,"score":8.719189377812281},{"content":" Ok(self.may_achieve_index(state_index))\n\n },\n\n None => Err(InvalidState::new(query)),\n\n }\n\n }\n\n\n\n /// Returns `true` if the Markov Chain contains a recheable absorbing state, \n\n /// from the current state.\n\n ///\n\n /// An absorbing state is a state such that, if the process starts there, \n\n /// it will allways be there, i.e. the probability of moving to itself is one.\n\n /// A reacheable state is a state that can be reached with positive probability.\n\n ///\n\n /// # Examples\n\n ///\n\n /// Checking the possibility of achieving a state from different initial states.\n\n /// ```\n\n /// # use ndarray::array;\n\n /// # use markovian::{FiniteMarkovChain, State};\n\n /// let mut mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\n","file_path":"src/finite_markov_chain/fast_sample.rs","rank":98,"score":8.678184054697157},{"content":"{\n\n func: F,\n\n distr: D,\n\n phantom: PhantomData<(S, T)>\n\n}\n\n\n\nimpl<S, T, F, D> Unary<S, T, F, D>\n\nwhere\n\n F: Fn(S) -> T,\n\n D: Distribution<S>,\n\n{\n\n #[inline]\n\n pub fn new(func: F, distr: D) -> Self {\n\n Unary { func, distr, phantom: PhantomData }\n\n }\n\n}\n\n\n\nimpl<S, T, F, D> Distribution<T> for Unary<S, T, F, D>\n\nwhere\n\n F: Fn(S) -> T,\n","file_path":"src/distributions/unary.rs","rank":99,"score":8.491335771571404}],"string":"[\n {\n \"content\": \"pub trait State {\\n\\n type Item: core::fmt::Debug;\\n\\n\\n\\n #[inline]\\n\\n fn state(&self) -> Option<&Self::Item> {\\n\\n None\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\\n\\n None\\n\\n }\\n\\n\\n\\n /// Changes the `state` of the struct.\\n\\n /// \\n\\n /// If changing is succesful, this method should return the old state as an `Option<Self::Item>`.\\n\\n /// \\n\\n /// # Remarks\\n\\n ///\\n\\n /// You might want to use [core::mem::swap](https://doc.rust-lang.org/core/mem/fn.swap.html).\\n\\n #[inline]\\n\\n fn set_state(\\n\\n &mut self,\\n\\n new_state: Self::Item,\\n\\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\\n\\n Err(InvalidState::new(new_state))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/traits/state.rs\",\n \"rank\": 0,\n \"score\": 82345.80420010671\n },\n {\n \"content\": \"/// Iterator with an internal state. \\n\\n/// \\n\\n/// Internals states can be thought as the \\\"initial\\\" element of an iterator, see [trajectory].\\n\\n/// \\n\\n/// # Example\\n\\n/// \\n\\n/// Usual case: A struct that uses the same type for [Iterator] and [State] traits.\\n\\n/// ```\\n\\n/// # struct MyStateIterator;\\n\\n/// # impl Iterator for MyStateIterator {\\n\\n/// # type Item = f64;\\n\\n/// # fn next(&mut self) -> Option<Self::Item> {\\n\\n/// # None\\n\\n/// # }\\n\\n/// # }\\n\\n/// # impl markovian::State for MyStateIterator {\\n\\n/// # type Item = f64;\\n\\n/// # }\\n\\n/// # use markovian::State;\\n\\n/// impl markovian::StateIterator for MyStateIterator {\\n\\n/// #[inline]\\n\\n/// fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\\n\\n/// self.state().cloned()\\n\\n/// }\\n\\n/// }\\n\\n/// ```\\n\\n///\\n\\n/// [trajectory]: trait.StateIterator.html#method.trajectory\\n\\n/// [Iterator]: https://doc.rust-lang.org/nightly/core/iter/trait.Iterator.html\\n\\n/// [State]: trait.State.html\\n\\npub trait StateIterator: Iterator + State + Sized {\\n\\n /// # Remarks\\n\\n /// \\n\\n /// You should use ``#[inline]`` when implementing this method.\\n\\n fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item>;\\n\\n\\n\\n /// Returns a new iterator whose first element is the state (seen as an item of the Iterator) \\n\\n /// and then follows with the elements of the iterator. \\n\\n #[inline]\\n\\n fn trajectory(self) -> Chain<std::option::IntoIter<<Self as std::iter::Iterator>::Item>, Self> {\\n\\n self.state_as_item().into_iter().chain(self)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/traits/state_iterator.rs\",\n \"rank\": 1,\n \"score\": 71161.21718393208\n },\n {\n \"content\": \"fn main() {\\n\\n // Monte Carlo\\n\\n let (times, values): (Vec<_>, Vec<_>) = Poisson::<f64, usize, _>::new(LAMBDA, thread_rng())\\n\\n .unwrap()\\n\\n .trajectory()\\n\\n .take(STEPS)\\n\\n .unzip();\\n\\n // Plotting\\n\\n (times.iter().cumsum::<f64>(), values).preexplore()\\n\\n .set_title(format!(\\\"Poisson process, lambda = {}\\\", LAMBDA))\\n\\n .set_xlabel(\\\"time\\\")\\n\\n .set_ylabel(\\\"state\\\")\\n\\n .set_style(\\\"_|\\\")\\n\\n .plot(\\\"poisson\\\")\\n\\n .unwrap();\\n\\n}\",\n \"file_path\": \"examples/poisson/main.rs\",\n \"rank\": 2,\n \"score\": 35100.09885708801\n },\n {\n \"content\": \"fn main() {\\n\\n // Monte Carlo\\n\\n let monte_carlo_approx: Vec<f64> = (0..TIME).map(|time| {\\n\\n // Simulate a sample from Branchng ´processes at a fixed time\\n\\n let simulations = sample_population(BIRTH, DEATH, time, SAMPLES);\\n\\n // Compute extinction probability for this time\\n\\n extinction_prob(simulations)\\n\\n }).collect();\\n\\n // Plotting\\n\\n monte_carlo_approx.preexplore()\\n\\n .set_title(\\\"Approximate extinction probability\\\")\\n\\n .set_xlabel(\\\"time\\\")\\n\\n .set_ylabel(\\\"extinction_probability\\\")\\n\\n .plot(\\\"extinction\\\")\\n\\n .unwrap();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/branching/main.rs\",\n \"rank\": 3,\n \"score\": 35100.09885708801\n },\n {\n \"content\": \"fn main() {\\n\\n // Finite state-space Markov Chain\\n\\n\\n\\n let init_state: i32 = 0;\\n\\n\\n\\n let transition = |state: &i32| Raw::new(vec![(0.5, state + 1), (0.5, state - 1)]);\\n\\n\\n\\n let mut mc = MarkovChain::new(init_state, &transition, thread_rng());\\n\\n\\n\\n println!(\\\"{:?}\\\", mc.state());\\n\\n println!(\\\"{:?}\\\", mc.next());\\n\\n println!(\\\"{:?}\\\", mc.next());\\n\\n println!(\\\"{:?}\\\", mc.next());\\n\\n\\n\\n // Infinite state-space Markov Chain\\n\\n\\n\\n let init_state: i32 = 0;\\n\\n let transition2 = |state: &i32| {\\n\\n let v: Vec<(f64, i32)> = (1..)\\n\\n .map(move |s| ((2.0_f32).powf(-s as f32), state + s as i32))\\n\",\n \"file_path\": \"examples/markov_chain/main.rs\",\n \"rank\": 4,\n \"score\": 33836.28387820474\n },\n {\n \"content\": \"/// Samples population starting from 1 until time iterations.\\n\\nfn sample_population(\\n\\n birth_prob: f64,\\n\\n death_prob: f64,\\n\\n iterations: usize,\\n\\n samples: usize,\\n\\n) -> Vec<u32> {\\n\\n (0..samples)\\n\\n .collect::<Vec<usize>>()\\n\\n .par_iter()\\n\\n .map(|_| {\\n\\n let init_state: u32 = 1;\\n\\n let density = raw_dist![\\n\\n (death_prob, 0),\\n\\n (birth_prob, 2),\\n\\n (1.0 - birth_prob - death_prob, 1)\\n\\n ];\\n\\n let mut branching_process = Branching::new(init_state, density, thread_rng());\\n\\n\\n\\n branching_process.nth(iterations).unwrap()\\n\\n })\\n\\n .collect()\\n\\n}\\n\",\n \"file_path\": \"examples/branching/main.rs\",\n \"rank\": 5,\n \"score\": 33836.28387820474\n },\n {\n \"content\": \"fn main() {\\n\\n\\n\\n let state_index = 0;\\n\\n let transition_matrix = ndarray::array![\\n\\n [1, 2, 3],\\n\\n [1, 0, 0],\\n\\n [0, 1, 1],\\n\\n ];\\n\\n let state_space = vec!['a', 'b', 'c'];\\n\\n let rng = thread_rng();\\n\\n\\n\\n let mut mc = FiniteMarkovChain::from((state_index, transition_matrix, state_space, rng));\\n\\n\\n\\n println!(\\\"{:?}\\\", mc.state());\\n\\n println!(\\\"{:?}\\\", mc.next());\\n\\n println!(\\\"{:?}\\\", mc.next());\\n\\n println!(\\\"{:?}\\\", mc.next());\\n\\n}\",\n \"file_path\": \"examples/finite_markov_chain/main.rs\",\n \"rank\": 6,\n \"score\": 32689.90554482297\n },\n {\n \"content\": \"/// Abstraction over transition matrix.\\n\\n///\\n\\n/// # Remarks\\n\\n/// \\n\\n/// Output parameter `O` allows sampling more than only the next state,\\n\\n/// for example, continuous markov chains are able to sample both a new state\\n\\n/// and a time step.\\n\\npub trait Transition<T, O> {\\n\\n fn sample_from<R>(&self, state: &T, rng: &mut R) -> O\\n\\n where\\n\\n R: Rng + ?Sized;\\n\\n}\\n\\n\\n\\nimpl<T, O, F, D> Transition<T, O> for F\\n\\nwhere\\n\\n F: Fn(&T) -> D,\\n\\n D: Distribution<O>,\\n\\n{\\n\\n #[inline]\\n\\n fn sample_from<R>(&self, state: &T, rng: &mut R) -> O\\n\\n where\\n\\n R: Rng + ?Sized,\\n\\n {\\n\\n self(state).sample(rng)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/traits/transition.rs\",\n \"rank\": 7,\n \"score\": 32457.378215965866\n },\n {\n \"content\": \"fn bench_brownian(c: &mut Criterion) {\\n\\n let mut group = c.benchmark_group(\\\"Brownian Motion\\\");\\n\\n for i in [100, 1000, 10000].iter() {\\n\\n group.bench_with_input(BenchmarkId::new(\\\"Markovian\\\", i), i, \\n\\n |b, i| b.iter(|| brownian_motion(*i)));\\n\\n group.bench_with_input(BenchmarkId::new(\\\"Direct\\\", i), i, \\n\\n |b, i| b.iter(|| direct_brownian_motion(*i)));\\n\\n }\\n\\n group.finish();\\n\\n}\\n\\n\\n\\ncriterion_group!(benches, bench_brownian);\\n\\ncriterion_main!(benches);\",\n \"file_path\": \"benches/brownian_motion.rs\",\n \"rank\": 8,\n \"score\": 29041.276339446358\n },\n {\n \"content\": \"/// }\\n\\n/// impl markovian::State for ArithmeticSequence {\\n\\n/// type Item = f64;\\n\\n/// #[inline]\\n\\n/// fn state(&self) -> Option<&Self::Item> {\\n\\n/// Some(&self.state)\\n\\n/// }\\n\\n/// \\n\\n/// #[inline]\\n\\n/// fn state_mut(&mut self) -> Option<&mut Self::Item> {\\n\\n/// Some(&mut self.state)\\n\\n/// }\\n\\n/// #[inline]\\n\\n/// fn set_state(\\n\\n/// &mut self,\\n\\n/// mut new_state: Self::Item,\\n\\n/// ) -> Result<Option<Self::Item>, markovian::errors::InvalidState<Self::Item>> {\\n\\n/// std::mem::swap(&mut self.state, &mut new_state); // Change places\\n\\n/// Ok(Some(new_state)) // Return the previous state value\\n\\n/// }\\n\\n/// }\\n\\n/// ```\\n\\n///\\n\\n/// [Arithmetic sequence]: https://en.wikipedia.org/wiki/Arithmetic_progression\\n\\n\\n\",\n \"file_path\": \"src/traits/state.rs\",\n \"rank\": 9,\n \"score\": 27480.17904023246\n },\n {\n \"content\": \"use crate::errors::InvalidState;\\n\\n\\n\\n/// Public state.\\n\\n/// \\n\\n/// `State` should be implemented when it is absolutely clear what a `state` for your your struct means.\\n\\n/// \\n\\n/// # Examples\\n\\n/// \\n\\n/// [Arithmetic sequence].\\n\\n/// ```\\n\\n/// struct ArithmeticSequence {\\n\\n/// state: f64,\\n\\n/// step: f64,\\n\\n/// }\\n\\n/// impl Iterator for ArithmeticSequence {\\n\\n/// type Item = f64;\\n\\n/// fn next(&mut self) -> Option<Self::Item> {\\n\\n/// self.state += self.step;\\n\\n/// Some(self.state)\\n\\n/// }\\n\",\n \"file_path\": \"src/traits/state.rs\",\n \"rank\": 10,\n \"score\": 27477.64426357613\n },\n {\n \"content\": \"// To bench\\n\\nfn brownian_motion(steps: usize) -> Vec<f64> {\\n\\n\\tlet state = 0.;\\n\\n\\tlet transition = |_: &f64| StandardNormal;\\n\\n\\tlet rng = thread_rng();\\n\\n\\n\\n\\tlet mc = markovian::MarkovChain::new(state, transition, rng);\\n\\n\\n\\n\\tmc.take(steps).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"benches/brownian_motion.rs\",\n \"rank\": 11,\n \"score\": 26640.133444500578\n },\n {\n \"content\": \"/// # }\\n\\n/// # use markovian::State;\\n\\n/// impl markovian::StateIterator for MyStateIterator {\\n\\n/// #[inline]\\n\\n/// fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\\n\\n/// self.state().cloned()\\n\\n/// }\\n\\n/// }\\n\\n/// ```\\n\\n///\\n\\n/// [trajectory]: trait.StateIterator.html#method.trajectory\\n\\n/// [Iterator]: https://doc.rust-lang.org/nightly/core/iter/trait.Iterator.html\\n\\n/// [State]: trait.State.html\\n\",\n \"file_path\": \"src/traits/state_iterator.rs\",\n \"rank\": 12,\n \"score\": 26074.44957546347\n },\n {\n \"content\": \"use crate::State;\\n\\nuse core::iter::Chain;\\n\\n\\n\\n/// Iterator with an internal state. \\n\\n/// \\n\\n/// Internals states can be thought as the \\\"initial\\\" element of an iterator, see [trajectory].\\n\\n/// \\n\\n/// # Example\\n\\n/// \\n\\n/// Usual case: A struct that uses the same type for [Iterator] and [State] traits.\\n\\n/// ```\\n\\n/// # struct MyStateIterator;\\n\\n/// # impl Iterator for MyStateIterator {\\n\\n/// # type Item = f64;\\n\\n/// # fn next(&mut self) -> Option<Self::Item> {\\n\\n/// # None\\n\\n/// # }\\n\\n/// # }\\n\\n/// # impl markovian::State for MyStateIterator {\\n\\n/// # type Item = f64;\\n\",\n \"file_path\": \"src/traits/state_iterator.rs\",\n \"rank\": 13,\n \"score\": 26071.602762644663\n },\n {\n \"content\": \"// To compare with\\n\\nfn direct_brownian_motion(steps: usize) -> Vec<f64> {\\n\\n\\tlet mut rng = thread_rng();\\n\\n\\t(0..steps).map(|_| rng.sample(StandardNormal)).collect()\\n\\n}\\n\\n\\n\\n\\n\",\n \"file_path\": \"benches/brownian_motion.rs\",\n \"rank\": 14,\n \"score\": 25831.096018243916\n },\n {\n \"content\": \"/// Counts the fraction of the trayectories that are not extinct.\\n\\n/// Formally, it gives\\n\\n/// \\\\PP_1( X_{max_iterations} = 0),\\n\\n/// approximated by samples number of simuations.\\n\\nfn extinction_prob(population_samples: Vec<u32>) -> f64 {\\n\\n let samples = population_samples.len();\\n\\n population_samples\\n\\n .into_iter()\\n\\n .filter(|&x| x == 0_u32)\\n\\n .count() as f64\\n\\n / samples as f64\\n\\n}\\n\\n\\n\",\n \"file_path\": \"examples/branching/main.rs\",\n \"rank\": 15,\n \"score\": 25831.096018243916\n },\n {\n \"content\": \" state,\\n\\n base_distribution,\\n\\n rng,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, D, R> State for Branching<T, D, R>\\n\\nwhere\\n\\n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\\n\\n D: Distribution<T>,\\n\\n R: Rng,\\n\\n{\\n\\n type Item = T;\\n\\n\\n\\n #[inline]\\n\\n fn state(&self) -> Option<&Self::Item> {\\n\\n Some(&self.state)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/processes/branching.rs\",\n \"rank\": 21,\n \"score\": 27.289024351185947\n },\n {\n \"content\": \" #[inline]\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n let mut count = T::one();\\n\\n let mut acc = T::zero();\\n\\n while count <= self.state {\\n\\n acc = acc + self.base_distribution.sample(&mut self.rng);\\n\\n count = count + T::one();\\n\\n }\\n\\n self.state = acc.clone();\\n\\n Some(acc)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, D, R> StateIterator for Branching<T, D, R>\\n\\nwhere\\n\\n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\\n\\n D: Distribution<T>,\\n\\n R: Rng,\\n\\n{\\n\\n #[inline]\\n\",\n \"file_path\": \"src/processes/branching.rs\",\n \"rank\": 22,\n \"score\": 25.8351614490955\n },\n {\n \"content\": \" fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\\n\\n self.state().cloned()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, D, R> Distribution<T> for Branching<T, D, R>\\n\\nwhere\\n\\n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\\n\\n D: Distribution<T>,\\n\\n R: Rng,\\n\\n{\\n\\n /// Sample a possible next state. \\n\\n #[inline]\\n\\n fn sample<R2>(&self, rng: &mut R2) -> T \\n\\n where\\n\\n R2: Rng + ?Sized,\\n\\n { \\n\\n let mut count = T::one();\\n\\n let mut acc = T::zero();\\n\\n while count < self.state {\\n\",\n \"file_path\": \"src/processes/branching.rs\",\n \"rank\": 24,\n \"score\": 25.696356216124137\n },\n {\n \"content\": \" #[inline]\\n\\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\\n\\n Some(&mut self.state)\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn set_state(\\n\\n &mut self,\\n\\n mut new_state: Self::Item,\\n\\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\\n\\n mem::swap(&mut self.state, &mut new_state);\\n\\n Ok(Some(new_state))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, D, R> Iterator for Branching<T, D, R>\\n\\nwhere\\n\\n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\\n\\n D: Distribution<T>,\\n\\n R: Rng,\\n\",\n \"file_path\": \"src/processes/branching.rs\",\n \"rank\": 25,\n \"score\": 25.485749663719147\n },\n {\n \"content\": \"{\\n\\n type Item = (N, T);\\n\\n\\n\\n #[inline]\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n let (period, state) = self.transition.sample_from(&self.state, &mut self.rng);\\n\\n self.state = state;\\n\\n self.state().cloned().map(|state| (period, state))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<N, T, F, R> StateIterator for TimedMarkovChain<N, T, F, R>\\n\\nwhere\\n\\n T: Debug + Clone,\\n\\n F: Transition<T, (N, T)>,\\n\\n R: Rng,\\n\\n N: From<f64>,\\n\\n{\\n\\n #[inline]\\n\\n fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\\n\",\n \"file_path\": \"src/timed_markov_chain.rs\",\n \"rank\": 26,\n \"score\": 24.57538602481686\n },\n {\n \"content\": \" #[inline]\\n\\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\\n\\n Some(&mut self.state)\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn set_state(\\n\\n &mut self,\\n\\n mut new_state: Self::Item,\\n\\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\\n\\n mem::swap(&mut self.state, &mut new_state);\\n\\n Ok(Some(new_state))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<N, T, F, R> Iterator for TimedMarkovChain<N, T, F, R>\\n\\nwhere\\n\\n T: Debug + Clone,\\n\\n F: Transition<T, (N, T)>,\\n\\n R: Rng,\\n\",\n \"file_path\": \"src/timed_markov_chain.rs\",\n \"rank\": 27,\n \"score\": 23.24001220753382\n },\n {\n \"content\": \" self.state_index = self.sample_index();\\n\\n let period = self.sample_clock();\\n\\n self.state().cloned().map(|x| (period, x))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, W, R> StateIterator for ContFiniteMarkovChain<T, W, R>\\n\\nwhere\\n\\n W: Float + AliasableWeight,\\n\\n Exp1: Distribution<W>,\\n\\n T: Debug + PartialEq + Clone,\\n\\n R: Rng,\\n\\n{\\n\\n #[inline]\\n\\n fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\\n\\n self.state().cloned().map(|x| (W::zero(), x))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, W, R> Distribution<(W, T)> for ContFiniteMarkovChain<T, W, R>\\n\",\n \"file_path\": \"src/continuous_finite_markov_chain.rs\",\n \"rank\": 28,\n \"score\": 23.177991550927583\n },\n {\n \"content\": \" TimedMarkovChain {\\n\\n state,\\n\\n transition,\\n\\n rng,\\n\\n phantom: PhantomData,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<N, T, F, R> State for TimedMarkovChain<N, T, F, R>\\n\\nwhere\\n\\n T: Debug + Clone,\\n\\n{\\n\\n type Item = T;\\n\\n\\n\\n #[inline]\\n\\n fn state(&self) -> Option<&Self::Item> {\\n\\n Some(&self.state)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"src/timed_markov_chain.rs\",\n \"rank\": 29,\n \"score\": 23.092853387692447\n },\n {\n \"content\": \" R: Rng,\\n\\n F: Transition<T, T>,\\n\\n{\\n\\n #[inline]\\n\\n pub fn new(state: T, transition: F, rng: R) -> Self {\\n\\n MarkovChain {\\n\\n state,\\n\\n transition,\\n\\n rng,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, F, R> State for MarkovChain<T, F, R>\\n\\nwhere\\n\\n T: Debug + Clone,\\n\\n{\\n\\n type Item = T;\\n\\n\\n\\n #[inline]\\n\",\n \"file_path\": \"src/markov_chain.rs\",\n \"rank\": 30,\n \"score\": 22.77008418876804\n },\n {\n \"content\": \" T: Debug + PartialEq + Clone,\\n\\n R: Rng + Debug + Clone,\\n\\n{\\n\\n type Item = T;\\n\\n\\n\\n #[inline]\\n\\n fn state(&self) -> Option<&Self::Item> {\\n\\n Some(&self.state_space[self.state_index])\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\\n\\n Some(&mut self.state_space[self.state_index])\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn set_state(\\n\\n &mut self,\\n\\n new_state: Self::Item,\\n\\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 31,\n \"score\": 22.558119908564514\n },\n {\n \"content\": \" Some(mut state_index) => {\\n\\n mem::swap(&mut self.state_index, &mut state_index);\\n\\n Ok(Some(self.state_space[state_index].clone()))\\n\\n }\\n\\n None => Err(InvalidState::new(new_state)),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, W, R> Iterator for ContFiniteMarkovChain<T, W, R>\\n\\nwhere\\n\\n W: Float + AliasableWeight,\\n\\n Exp1: Distribution<W>,\\n\\n T: Debug + PartialEq + Clone,\\n\\n R: Rng,\\n\\n{\\n\\n type Item = (W, T);\\n\\n\\n\\n #[inline]\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\",\n \"file_path\": \"src/continuous_finite_markov_chain.rs\",\n \"rank\": 32,\n \"score\": 21.66176547323422\n },\n {\n \"content\": \"where\\n\\n T: Debug + Clone,\\n\\n F: Transition<T, T>,\\n\\n R: Rng,\\n\\n{\\n\\n type Item = T;\\n\\n\\n\\n #[inline]\\n\\n fn next(&mut self) -> Option<Self::Item> {\\n\\n self.state = self.transition.sample_from(&self.state, &mut self.rng);\\n\\n self.state().cloned()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, F, R> StateIterator for MarkovChain<T, F, R>\\n\\nwhere\\n\\n T: Debug + Clone,\\n\\n F: Transition<T, T>,\\n\\n R: Rng,\\n\\n{\\n\",\n \"file_path\": \"src/markov_chain.rs\",\n \"rank\": 33,\n \"score\": 21.583798039176965\n },\n {\n \"content\": \"/// constitutes the second generation and the process repeats. \\n\\n/// The overall process is therefore characterized by the number of \\n\\n/// offsprings an individual has. \\n\\n/// The resulting process is a Markov Chain in NN.\\n\\n#[derive(Debug, Clone)]\\n\\npub struct Branching<T, D, R> \\n\\nwhere\\n\\n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\\n\\n D: Distribution<T>,\\n\\n R: Rng,\\n\\n{\\n\\n state: T,\\n\\n base_distribution: D,\\n\\n rng: R,\\n\\n}\\n\\n\\n\\nimpl<T, D, R> Branching<T, D, R>\\n\\nwhere\\n\\n T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,\\n\\n D: Distribution<T>,\\n\",\n \"file_path\": \"src/processes/branching.rs\",\n \"rank\": 34,\n \"score\": 21.5718930116394\n },\n {\n \"content\": \" fn next(&mut self) -> Option<Self::Item> {\\n\\n self.state_index = self.sample_index();\\n\\n self.state().cloned()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, W, R> StateIterator for FiniteMarkovChain<T, W, R>\\n\\nwhere\\n\\n W: AliasableWeight + Debug + Clone,\\n\\n Uniform<W>: Debug + Clone,\\n\\n T: Debug + PartialEq + Clone,\\n\\n R: Rng + Debug + Clone,\\n\\n{\\n\\n #[inline]\\n\\n fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\\n\\n self.state().cloned()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, W, R> Distribution<T> for FiniteMarkovChain<T, W, R>\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 35,\n \"score\": 21.357302661505024\n },\n {\n \"content\": \" #[inline]\\n\\n fn state_as_item(&self) -> Option<<Self as std::iter::Iterator>::Item> {\\n\\n self.state().cloned()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, F, R> Distribution<T> for MarkovChain<T, F, R>\\n\\nwhere\\n\\n T: Debug + Clone,\\n\\n F: Transition<T, T>,\\n\\n R: Rng,\\n\\n{\\n\\n /// Sample a possible next state. \\n\\n #[inline]\\n\\n fn sample<R2>(&self, rng: &mut R2) -> T\\n\\n where\\n\\n R2: Rng + ?Sized,\\n\\n { \\n\\n self.transition.sample_from(&self.state, rng)\\n\\n }\\n\",\n \"file_path\": \"src/markov_chain.rs\",\n \"rank\": 36,\n \"score\": 20.640257439865145\n },\n {\n \"content\": \"/// If your transition function `transition` could reuse of structs that implement\\n\\n/// the `Distribution<T>` trait in order to sample the next state, then, \\n\\n/// for the best performance possible, create your own struct that implements\\n\\n/// the `Transition<T, (N, T)>` trait.\\n\\n#[derive(Debug, Clone)]\\n\\npub struct TimedMarkovChain<N, T, F, R> {\\n\\n state: T,\\n\\n transition: F,\\n\\n rng: R,\\n\\n phantom: PhantomData<N>,\\n\\n}\\n\\n\\n\\nimpl<N, T, F, R> TimedMarkovChain<N, T, F, R>\\n\\nwhere\\n\\n R: Rng,\\n\\n F: Transition<T, (N, T)>,\\n\\n N: From<f64>,\\n\\n{\\n\\n #[inline]\\n\\n pub fn new(state: T, transition: F, rng: R) -> Self {\\n\",\n \"file_path\": \"src/timed_markov_chain.rs\",\n \"rank\": 37,\n \"score\": 20.43940426102349\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn sample_index(&mut self) -> usize {\\n\\n self.transition_matrix[self.state_index].sample(&mut self.rng)\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn sample_clock(&mut self) -> W {\\n\\n let rate = self.transiton_clock[self.state_index];\\n\\n Exp::new(rate).unwrap().sample(&mut self.rng)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, W, R> State for ContFiniteMarkovChain<T, W, R>\\n\\nwhere\\n\\n W: Float + AliasableWeight,\\n\\n Exp1: Distribution<W>,\\n\\n T: Debug + PartialEq + Clone,\\n\",\n \"file_path\": \"src/continuous_finite_markov_chain.rs\",\n \"rank\": 38,\n \"score\": 19.551115613628234\n },\n {\n \"content\": \"where\\n\\n W: Float + AliasableWeight,\\n\\n Exp1: Distribution<W>,\\n\\n T: Debug + PartialEq + Clone,\\n\\n R: Rng,\\n\\n{\\n\\n /// Sample a possible next state. \\n\\n #[inline]\\n\\n fn sample<R2>(&self, rng: &mut R2) -> (W, T) \\n\\n where\\n\\n R2: Rng + ?Sized,\\n\\n { \\n\\n let new_index = self.transition_matrix[self.state_index].sample(rng);\\n\\n let rate = self.transiton_clock[self.state_index];\\n\\n let step = Exp::new(rate).unwrap().sample(rng);\\n\\n\\n\\n (step, self.state_space[new_index].clone())\\n\\n }\\n\\n}\",\n \"file_path\": \"src/continuous_finite_markov_chain.rs\",\n \"rank\": 39,\n \"score\": 19.45656340789994\n },\n {\n \"content\": \" self.state().cloned().map(|state| (N::from(0.0), state))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<N, T, F, R> Distribution<(N, T)> for TimedMarkovChain<N, T, F, R>\\n\\nwhere\\n\\n T: Debug + Clone,\\n\\n F: Transition<T, (N, T)>,\\n\\n R: Rng,\\n\\n N: From<f64>,\\n\\n{\\n\\n /// Sample a possible next state. \\n\\n #[inline]\\n\\n fn sample<R2>(&self, rng: &mut R2) -> (N, T)\\n\\n where\\n\\n R2: Rng + ?Sized,\\n\\n { \\n\\n self.transition.sample_from(&self.state, rng)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/timed_markov_chain.rs\",\n \"rank\": 40,\n \"score\": 19.014096510317447\n },\n {\n \"content\": \"// #[derive(Debug, Clone)]\\n\\npub struct ContFiniteMarkovChain<T, W, R>\\n\\nwhere\\n\\n W: Float + AliasableWeight,\\n\\n Exp1: Distribution<W>,\\n\\n R: Rng,\\n\\n{\\n\\n state_index: usize,\\n\\n transition_matrix: Vec<WeightedAliasIndex<W>>,\\n\\n transiton_clock: Vec<W>,\\n\\n state_space: Vec<T>,\\n\\n rng: R,\\n\\n}\\n\\n\\n\\nimpl<T, W, R> ContFiniteMarkovChain<T, W, R>\\n\\nwhere\\n\\n W: Float + AliasableWeight,\\n\\n Exp1: Distribution<W>,\\n\\n R: Rng,\\n\\n{\\n\",\n \"file_path\": \"src/continuous_finite_markov_chain.rs\",\n \"rank\": 41,\n \"score\": 18.698795139970084\n },\n {\n \"content\": \"///\\n\\n/// [Distribution implementation]: struct.Raw.html#impl-Distribution<T>\\n\\n#[derive(Debug, Clone, PartialEq)]\\n\\npub struct Raw<I> {\\n\\n iter: I,\\n\\n}\\n\\n\\n\\nimpl<I> Raw<I> {\\n\\n #[inline]\\n\\n pub fn new(iter: I) -> Self {\\n\\n Raw { iter }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<P, T, I> Distribution<T> for Raw<I>\\n\\nwhere\\n\\n P: Zero + One + PartialOrd + Debug + Copy, \\n\\n f64: From<P>,\\n\\n I: IntoIterator<Item = (P, T)> + Clone,\\n\\n{\\n\",\n \"file_path\": \"src/distributions/raw.rs\",\n \"rank\": 42,\n \"score\": 18.685689947426813\n },\n {\n \"content\": \" #[inline]\\n\\n fn sample<R>(&self, rng: &mut R) -> T\\n\\n where\\n\\n R: Rng + ?Sized,\\n\\n {\\n\\n let cum_goal: f64 = rng.gen(); // NOT CORRECT\\n\\n\\n\\n let mut acc: f64 = 0.0;\\n\\n let one = f64::from(P::one());\\n\\n\\n\\n for (prob, state) in self.iter.clone() {\\n\\n assert!(P::zero() <= prob, \\\"Probabilities can not be negative. Tried to use {:?}\\\", prob);\\n\\n assert!(one >= acc, \\\"Probabilities can not be more than one. Tried to use {:?}\\\", acc);\\n\\n \\tacc += f64::from(prob);\\n\\n if acc >= cum_goal {\\n\\n return state;\\n\\n }\\n\\n }\\n\\n panic!(\\\"Sampling was not possible: probabilities did not cover all posiibilities. Check the type of your probabilities and all possibilities by rng.gen() there.\\\")\\n\\n }\\n\",\n \"file_path\": \"src/distributions/raw.rs\",\n \"rank\": 44,\n \"score\": 18.249262226785945\n },\n {\n \"content\": \"// Traits\\n\\nuse crate::{State, StateIterator};\\n\\nuse core::fmt::Debug;\\n\\nuse rand::Rng;\\n\\nuse rand_distr::{weighted_alias::{WeightedAliasIndex, AliasableWeight}, Distribution};\\n\\nuse num_traits::float::Float;\\n\\n\\n\\n// Structs\\n\\nuse crate::errors::InvalidState;\\n\\nuse rand_distr::{Exp1, Exp};\\n\\n\\n\\n// Functions\\n\\nuse core::mem;\\n\\n\\n\\n/// Finite state Markov Chain in continuous time. \\n\\n/// \\n\\n/// # Costs\\n\\n/// \\n\\n/// Construction cost: O(n), n: size of the state space.\\n\\n/// Sample cost: O(1).\\n\",\n \"file_path\": \"src/continuous_finite_markov_chain.rs\",\n \"rank\": 45,\n \"score\": 17.85983782682678\n },\n {\n \"content\": \" match self.state_space.iter().position(|s| *s == new_state) {\\n\\n Some(mut state_index) => {\\n\\n mem::swap(&mut self.state_index, &mut state_index);\\n\\n Ok(Some(self.state_space[state_index].clone()))\\n\\n }\\n\\n None => Err(InvalidState::new(new_state)),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, W, R> Iterator for FiniteMarkovChain<T, W, R>\\n\\nwhere\\n\\n W: AliasableWeight + Debug + Clone,\\n\\n Uniform<W>: Debug + Clone,\\n\\n T: Debug + PartialEq + Clone,\\n\\n R: Rng + Debug + Clone,\\n\\n{\\n\\n type Item = T;\\n\\n\\n\\n #[inline]\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 46,\n \"score\": 17.425327983967616\n },\n {\n \"content\": \"\\n\\nuse core::marker::PhantomData;\\n\\nuse rand::Rng;\\n\\nuse rand_distr::Distribution;\\n\\n\\n\\n/// Concrete struct for the function of a `Distribution. \\n\\n/// \\n\\n/// # Examples\\n\\n/// \\n\\n/// The squared of a exponential.\\n\\n/// ```\\n\\n/// # use rand_distr::Exp1;\\n\\n/// # use markovian::distributions::Unary;\\n\\n/// let exp_squared = Unary::new(|x: f64| x.powi(2_i32), Exp1);\\n\\n/// ```\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Unary<S, T, F, D> \\n\\nwhere\\n\\n F: Fn(S) -> T,\\n\\n D: Distribution<S>,\\n\",\n \"file_path\": \"src/distributions/unary.rs\",\n \"rank\": 47,\n \"score\": 17.40771066704862\n },\n {\n \"content\": \"impl<T, W, R> Into<(DiGraph<T, W>, petgraph::graph::NodeIndex)> for FiniteMarkovChain<T, W, R>\\n\\nwhere\\n\\n W: AliasableWeight + Debug + Clone,\\n\\n Uniform<W>: Debug + Clone,\\n\\n T: Debug + PartialEq + Clone,\\n\\n R: Rng + Debug + Clone,\\n\\n{\\n\\n /// Performs the conversion.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// An absorbing Markov Chain with one transient state and one absorbing state.\\n\\n /// ```\\n\\n /// # use ndarray::array;\\n\\n /// # use markovian::{FiniteMarkovChain, State};\\n\\n /// # use petgraph::graph::DiGraph;\\n\\n /// let mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\\n\\n /// let (graph, node) = mc.into();\\n\\n /// assert_eq!(graph[node], 0);\\n\\n /// assert_eq!(graph.neighbors(node).count(), 2);\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 48,\n \"score\": 17.34793470474759\n },\n {\n \"content\": \" R: Rng,\\n\\n{\\n\\n type Item = T;\\n\\n\\n\\n #[inline]\\n\\n fn state(&self) -> Option<&Self::Item> {\\n\\n Some(&self.state_space[self.state_index])\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\\n\\n Some(&mut self.state_space[self.state_index])\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn set_state(\\n\\n &mut self,\\n\\n new_state: Self::Item,\\n\\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\\n\\n match self.state_space.iter().position(|s| *s == new_state) {\\n\",\n \"file_path\": \"src/continuous_finite_markov_chain.rs\",\n \"rank\": 49,\n \"score\": 17.318552934125087\n },\n {\n \"content\": \" R: Rng,\\n\\n{\\n\\n /// Creates a new Branching process. \\n\\n /// \\n\\n /// # Examples\\n\\n /// \\n\\n /// Construction using density p(0) = 0.3, p(1) = 0.4, p(2) = 0.3. \\n\\n /// ```\\n\\n /// # #![allow(unused_mut)]\\n\\n /// # use markovian::prelude::*;\\n\\n /// # use rand::prelude::*;\\n\\n /// let init_state: u32 = 1;\\n\\n /// let density = raw_dist![(0.3, 0), (0.4, 1), (0.3, 2)];\\n\\n /// let rng = thread_rng();\\n\\n /// let mut branching_process = Branching::new(init_state, density, rng);\\n\\n /// ``` \\n\\n ///\\n\\n #[inline]\\n\\n pub fn new(state: T, base_distribution: D, rng: R) -> Self {\\n\\n Branching {\\n\",\n \"file_path\": \"src/processes/branching.rs\",\n \"rank\": 50,\n \"score\": 16.913070867266477\n },\n {\n \"content\": \"use thiserror::Error;\\n\\n\\n\\n#[derive(Copy, Clone, Debug, Default, Eq, Hash, Ord, PartialEq, PartialOrd, Error)]\\n\\n#[error(\\\"the state {state:?} is not a valid assignation\\\")]\\n\\npub struct InvalidState<T: std::fmt::Debug> {\\n\\n state: T,\\n\\n}\\n\\n\\n\\nimpl<T: std::fmt::Debug> InvalidState<T> {\\n\\n\\t#[inline]\\n\\n pub fn new(state: T) -> Self {\\n\\n InvalidState { state }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/errors.rs\",\n \"rank\": 51,\n \"score\": 16.834955059980857\n },\n {\n \"content\": \"where\\n\\n W: AliasableWeight + Debug + Clone,\\n\\n Uniform<W>: Debug + Clone,\\n\\n T: Debug + PartialEq + Clone,\\n\\n R: Rng + Debug + Clone,\\n\\n{\\n\\n /// Sample a possible next state. \\n\\n #[inline]\\n\\n fn sample<R2>(&self, rng: &mut R2) -> T\\n\\n where\\n\\n R2: Rng + ?Sized,\\n\\n { \\n\\n let new_index = self.transition_matrix_variables[self.state_index].sample(rng);\\n\\n\\n\\n self.state_space[new_index].clone()\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<W, R> From<(usize, Vec<Vec<W>>, R)> for FiniteMarkovChain<usize, W, R>\\n\\nwhere\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 52,\n \"score\": 16.60596768179914\n },\n {\n \"content\": \"// Traits\\n\\nuse crate::{State, StateIterator};\\n\\nuse core::fmt::Debug;\\n\\nuse num_traits::{sign::Unsigned, One, Zero};\\n\\nuse rand::Rng;\\n\\nuse rand_distr::Distribution;\\n\\n\\n\\n// Structs\\n\\nuse crate::errors::InvalidState;\\n\\n\\n\\n// Functions\\n\\nuse core::mem;\\n\\n\\n\\n/// Branching process in the natural numbers NN = {0, 1, 2, ...}.\\n\\n/// \\n\\n/// A Branching process is characterized by a density p over NN. It can be \\n\\n/// thought of the size of a population. \\n\\n/// In this population, each individual is identical to the rest and they are \\n\\n/// independent of each other. Moreover, at each time step, \\n\\n/// individuals have descendents and die. Their descendants \\n\",\n \"file_path\": \"src/processes/branching.rs\",\n \"rank\": 53,\n \"score\": 16.49695247888869\n },\n {\n \"content\": \"pub struct FiniteMarkovChain<T, W, R>\\n\\nwhere\\n\\n W: AliasableWeight + Debug + Clone,\\n\\n Uniform<W>: Debug + Clone,\\n\\n T: Debug + PartialEq + Clone,\\n\\n R: Rng + Debug + Clone,\\n\\n{\\n\\n state_index: usize,\\n\\n transition_matrix: Vec<Vec<W>>,\\n\\n transition_matrix_variables: Vec<WeightedAliasIndex<W>>,\\n\\n state_space: Vec<T>,\\n\\n rng: R,\\n\\n}\\n\\n\\n\\nimpl<T, W, R> FiniteMarkovChain<T, W, R>\\n\\nwhere\\n\\n W: AliasableWeight + Debug + Clone,\\n\\n Uniform<W>: Debug + Clone,\\n\\n T: Debug + PartialEq + Clone,\\n\\n R: Rng + Debug + Clone,\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 54,\n \"score\": 16.362995318213446\n },\n {\n \"content\": \"///\\n\\n/// # Examples\\n\\n///\\n\\n/// Random walk in the integers.\\n\\n/// ```\\n\\n/// # use markovian::{MarkovChain, prelude::*};\\n\\n/// # use rand::prelude::*;\\n\\n/// let init_state: i32 = 0;\\n\\n/// let transition = |state: &i32| Raw::new(vec![(0.5, state + 1), (0.5, state - 1)]);\\n\\n/// MarkovChain::new(init_state, &transition, thread_rng());\\n\\n/// ```\\n\\n#[derive(Debug, Clone)]\\n\\npub struct MarkovChain<T, F, R> {\\n\\n state: T,\\n\\n transition: F,\\n\\n rng: R,\\n\\n}\\n\\n\\n\\nimpl<T, F, R> MarkovChain<T, F, R>\\n\\nwhere\\n\",\n \"file_path\": \"src/markov_chain.rs\",\n \"rank\": 55,\n \"score\": 16.314238615311154\n },\n {\n \"content\": \" W: AliasableWeight + Debug + Clone,\\n\\n Uniform<W>: Debug + Clone,\\n\\n R: Rng + Debug + Clone,\\n\\n{\\n\\n\\t/// Performs the conversion.\\n\\n\\t///\\n\\n /// # Panics\\n\\n ///\\n\\n /// This method panics if: \\n\\n /// - Any vector of `transition_matrix` has more than u32::MAX columns.\\n\\n /// - For any entry w of any vector of `transition_matrix` v: \\n\\n /// w < 0 or w > max where max = W::MAX / v.len().\\n\\n /// - For any vector of `transition_matrix` the sum of weights is zero.\\n\\n fn from((state_index, transition_matrix, rng): (usize, Vec<Vec<W>>, R)) -> Self {\\n\\n let state_space: Vec<usize> = (0..transition_matrix.len()).collect();\\n\\n FiniteMarkovChain::new(state_index, transition_matrix, state_space, rng)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, W, R> From<(usize, ndarray::Array2<W>, Vec<T>, R)> for FiniteMarkovChain<T, W, R>\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 56,\n \"score\": 15.955913506941426\n },\n {\n \"content\": \"// Traits\\n\\nuse rand::Rng;\\n\\nuse rand_distr::Distribution;\\n\\n\\n\\n// Structs\\n\\nuse core::marker::PhantomData;\\n\\n\\n\\n/// Concrete struct for the function of two Distributions`. \\n\\n/// \\n\\n/// # Examples\\n\\n/// \\n\\n/// A Beta(2, 1) as the sum of two exponentials(1).\\n\\n/// ```\\n\\n/// # use rand_distr::Exp1;\\n\\n/// # use markovian::distributions::Binary;\\n\\n/// let beta = Binary::new(|x: f64, y: f64| x + y, Exp1, Exp1);\\n\\n/// ```\\n\\n#[derive(Debug, Copy, Clone)]\\n\\npub struct Binary<S1, S2, T, F, D1, D2> \\n\\nwhere\\n\",\n \"file_path\": \"src/distributions/binary.rs\",\n \"rank\": 57,\n \"score\": 15.911994370664381\n },\n {\n \"content\": \"where\\n\\n W: AliasableWeight + Debug + Clone,\\n\\n Uniform<W>: Debug + Clone,\\n\\n T: Debug + PartialEq + Clone,\\n\\n R: Rng + Debug + Clone,\\n\\n{\\n\\n\\t/// Performs the conversion.\\n\\n\\t///\\n\\n /// # Panics\\n\\n ///\\n\\n /// This method panics if: \\n\\n /// - (In debug mode only) The dimensions of `state_space` and `transition_matrix` do not match.\\n\\n /// - `transition_matrix` has more than u32::MAX columns.\\n\\n /// - For any entry of `transition_matrix` w: \\n\\n /// w < 0 or w > max where max = W::MAX / transition_matrix.ncols().\\n\\n /// - For any row of `transition_matrix` the sum of weights is zero.\\n\\n\\tfn from((state_index, transition_matrix, state_space, rng): (usize, ndarray::Array2<W>, Vec<T>, R)) -> Self {\\n\\n let transition_matrix: Vec<Vec<W>> = transition_matrix.genrows()\\n\\n .into_iter()\\n\\n .map(|weights| {\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 58,\n \"score\": 15.756250344793155\n },\n {\n \"content\": \" fn state(&self) -> Option<&Self::Item> {\\n\\n Some(&self.state)\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\\n\\n Some(&mut self.state)\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn set_state(\\n\\n &mut self,\\n\\n mut new_state: Self::Item,\\n\\n ) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {\\n\\n mem::swap(&mut self.state, &mut new_state);\\n\\n Ok(Some(new_state))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, F, R> Iterator for MarkovChain<T, F, R>\\n\",\n \"file_path\": \"src/markov_chain.rs\",\n \"rank\": 59,\n \"score\": 15.724426462401727\n },\n {\n \"content\": \"//! \\n\\n//! ## Continuous space\\n\\n//!\\n\\n//! Randomize the transition: return a random element together with a probability one\\n\\n//!\\n\\n//! ### Examples\\n\\n//! \\n\\n//! A random walk on the real line with variable step size. \\n\\n//! ```\\n\\n//! # use rand_distr::Exp;\\n\\n//! # use rand::prelude::*;\\n\\n//! # use markovian::prelude::*;\\n\\n//! let init_state: f64 = 0.0;\\n\\n//! struct MyTransition;\\n\\n//! impl markovian::Transition<f64, f64> for MyTransition {\\n\\n//! fn sample_from<R: ?Sized>(&self, state: &f64, rng: &mut R) -> f64\\n\\n//! where\\n\\n//! R: Rng\\n\\n//! {\\n\\n//! let step = Exp::new(2.0).unwrap().sample(rng);\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 61,\n \"score\": 15.217197605821251\n },\n {\n \"content\": \" /// w < 0 or w > max where max = W::MAX / transition_matrix.ncols().\\n\\n /// - For any row of `transition_matrix` the sum of weights is zero.\\n\\n ///\\n\\n /// # Example\\n\\n ///\\n\\n /// An absorbing Markov Chain with one transient state and one absorbing state.\\n\\n /// ```\\n\\n /// # use ndarray::array;\\n\\n /// # use markovian::FiniteMarkovChain;\\n\\n /// # use markovian::State;\\n\\n /// let mut mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\\n\\n /// assert_eq!(mc.state(), Some(&0));\\n\\n /// println!(\\\"At time {}, the state is {}\\\", 1_000, mc.nth(1_000).unwrap()); // Most likely 1\\n\\n /// ``` \\n\\n fn from((state_index, transition_matrix, rng): (usize, ndarray::Array2<W>, R)) -> Self {\\n\\n let state_space: Vec<usize> = (0..transition_matrix.nrows()).collect();\\n\\n FiniteMarkovChain::from((state_index, transition_matrix, state_space, rng))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 62,\n \"score\": 14.559517985639353\n },\n {\n \"content\": \" ///\\n\\n /// There is one absorbing state: state `b`, which has index `1`.\\n\\n /// ```\\n\\n /// # use ndarray::array;\\n\\n /// # use markovian::{FiniteMarkovChain, State};\\n\\n /// let mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()))\\n\\n /// .set_state_space(vec!['a', 'b']);\\n\\n /// assert_eq!(mc.absorbing_states_indexes(), vec![1]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn absorbing_states_indexes(&self) -> Vec<usize> {\\n\\n let transition_matrix = &self.transition_matrix;\\n\\n \\t(0..self.state_space.len())\\n\\n .filter(|&i| {\\n\\n let quantities_check = transition_matrix[i].iter()\\n\\n .enumerate()\\n\\n .map(|(j, w)| {\\n\\n if j == i {\\n\\n w > &W::ZERO\\n\\n } else {\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 63,\n \"score\": 14.330856277317668\n },\n {\n \"content\": \" weights.to_vec()\\n\\n })\\n\\n .collect();\\n\\n FiniteMarkovChain::new(state_index, transition_matrix, state_space, rng)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<W, R> From<(usize, ndarray::Array2<W>, R)> for FiniteMarkovChain<usize, W, R>\\n\\nwhere\\n\\n W: AliasableWeight + Debug + Clone,\\n\\n Uniform<W>: Debug + Clone,\\n\\n R: Rng + Debug + Clone,\\n\\n{\\n\\n\\t/// Performs the conversion.\\n\\n\\t///\\n\\n /// # Panics\\n\\n ///\\n\\n /// This method panics if: \\n\\n /// - `transition_matrix` has more than u32::MAX columns.\\n\\n /// - For any entry of `transition_matrix` w: \\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 64,\n \"score\": 13.59787424625264\n },\n {\n \"content\": \"}\\n\\n\\n\\nimpl<S1, S2, T, F, D1, D2> Distribution<T> for Binary<S1, S2, T, F, D1, D2>\\n\\nwhere\\n\\n F: Fn(S1, S2) -> T,\\n\\n D1: Distribution<S1>,\\n\\n D2: Distribution<S2>,\\n\\n{\\n\\n #[inline]\\n\\n fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> T {\\n\\n (self.func)(self.distr_1.sample(rng), self.distr_2.sample(rng))\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n\\tuse super::*;\\n\\n\\tuse rand_distr::Exp1;\\n\\n\\n\\n #[test]\\n\",\n \"file_path\": \"src/distributions/binary.rs\",\n \"rank\": 65,\n \"score\": 13.59430199185643\n },\n {\n \"content\": \" /// assert!(mc.may_absorb());\\n\\n /// ``` \\n\\n #[inline]\\n\\n pub fn may_absorb(&self) -> bool {\\n\\n let set: std::collections::HashSet<_> = self.absorbing_states_indexes().into_iter().collect();\\n\\n let (graph, node) = self.clone().into();\\n\\n let mut bfs = petgraph::visit::Bfs::new(&graph, node);\\n\\n while let Some(other_node) = bfs.next(&graph) {\\n\\n if set.contains(&other_node.index()) {\\n\\n return true\\n\\n } \\n\\n }\\n\\n false\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<T, W, R> State for FiniteMarkovChain<T, W, R>\\n\\nwhere\\n\\n W: AliasableWeight + Debug + Clone,\\n\\n Uniform<W>: Debug + Clone,\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 66,\n \"score\": 13.535616709619688\n },\n {\n \"content\": \" /// even if they are not recheable from the current state.\\n\\n ///\\n\\n /// # Panics\\n\\n ///\\n\\n /// In debug mode, if `new_state_space` is not as long as the current state space. \\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// Changing from numbers to letters.\\n\\n /// ```\\n\\n /// # use ndarray::array;\\n\\n /// # use markovian::{FiniteMarkovChain, State};\\n\\n /// let mc = FiniteMarkovChain::from((1, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\\n\\n /// assert_eq!(mc.state(), Some(&1));\\n\\n /// let mc = mc.set_state_space(vec!['a', 'b']);\\n\\n /// assert_eq!(mc.state(), Some(&'b'));\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn set_state_space<U>(self, new_state_space: Vec<U>) -> FiniteMarkovChain<U, W, R> \\n\\n where\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 67,\n \"score\": 13.488384392443491\n },\n {\n \"content\": \" #[inline]\\n\\n pub fn new(\\n\\n state_index: usize,\\n\\n transition_weights: Vec<Vec<W>>,\\n\\n state_space: Vec<T>,\\n\\n rng: R,\\n\\n ) -> Self {\\n\\n let transition_matrix: Vec<WeightedAliasIndex<W>> = transition_weights.clone()\\n\\n .into_iter()\\n\\n .map(|weights| WeightedAliasIndex::new(weights).unwrap())\\n\\n .collect();\\n\\n let transiton_clock: Vec<W> = transition_weights.into_iter()\\n\\n .map(|weights| weights.into_iter().sum::<W>())\\n\\n .collect();\\n\\n ContFiniteMarkovChain {\\n\\n state_index,\\n\\n transition_matrix,\\n\\n transiton_clock,\\n\\n state_space,\\n\\n rng,\\n\",\n \"file_path\": \"src/continuous_finite_markov_chain.rs\",\n \"rank\": 68,\n \"score\": 13.109169676751044\n },\n {\n \"content\": \" D: Distribution<S>,\\n\\n{\\n\\n #[inline]\\n\\n fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> T {\\n\\n (self.func)(self.distr.sample(rng))\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n\\tuse super::*;\\n\\n\\tuse rand_distr::Exp1;\\n\\n\\n\\n #[test]\\n\\n fn use_cases() {\\n\\n let mut rng = crate::tests::rng(1);\\n\\n let expected = 0.5851203106605716 - 1.;\\n\\n let sample: f64 = Unary::new(|x: f64| x - 1., Exp1).sample(&mut rng);\\n\\n\\n\\n assert_eq!(sample, expected);\\n\\n\\n\\n let expected = 0.15721404552459717;\\n\\n let sample: f64 = Unary::new(|x:f64| x + 1., Unary::new(|x: f32| (x - 1.) as f64, Exp1)).sample(&mut rng);\\n\\n assert_eq!(sample, expected);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"src/distributions/unary.rs\",\n \"rank\": 70,\n \"score\": 12.798672466158056\n },\n {\n \"content\": \"//! let init_state: u32 = 1;\\n\\n//! let base_distribution = raw_dist![(0.3, 0), (0.4, 1), (0.3, 2)];\\n\\n//! let rng = thread_rng();\\n\\n//! let mut branching_process = Branching::new(init_state, base_distribution, rng);\\n\\n//! ``` \\n\\n//! ## Continuous time\\n\\n//! \\n\\n//! Construction of a random walk in the integers, with expponential time for each transition.\\n\\n//! ```\\n\\n//! # #![allow(unused_mut)]\\n\\n//! # use rand::prelude::*;\\n\\n//! # use rand_distr::{Exp, Uniform};\\n\\n//! # use markovian::prelude::*;\\n\\n//! let init_state: i32 = 0;\\n\\n//! struct MyTransition;\\n\\n//! impl markovian::Transition<i32, (f64, i32)> for MyTransition {\\n\\n//! fn sample_from<R: ?Sized>(&self, state: &i32, rng: &mut R) -> (f64, i32)\\n\\n//! where\\n\\n//! R: Rng\\n\\n//! {\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 71,\n \"score\": 12.705060775144755\n },\n {\n \"content\": \"///\\n\\n/// # Warning\\n\\n///\\n\\n/// The user should make sure that the indexes resulting from random transitions \\n\\n/// correspond to a state in the state space. In other words, new indexes\\n\\n/// should always be less than the length of the state space. \\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// The easiest way is construct a finite Markov Chain is from a transition matrix. \\n\\n/// This has been abstracted by using `from`. For example,\\n\\n/// an absorbing Markov Chain with one transient state and one absorbing state.\\n\\n/// ```\\n\\n/// # use ndarray::array;\\n\\n/// # use markovian::{FiniteMarkovChain, State};\\n\\n/// let mut mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\\n\\n/// assert_eq!(mc.state(), Some(&0));\\n\\n/// println!(\\\"At time {}, the state is {}\\\", 1_000, mc.nth(1_000).unwrap()); // Most likely 1\\n\\n/// ```\\n\\n#[derive(Debug, Clone)]\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 72,\n \"score\": 12.576474927706412\n },\n {\n \"content\": \" /// # use ndarray::array;\\n\\n /// # use markovian::{FiniteMarkovChain, State};\\n\\n /// let mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()))\\n\\n /// .set_state_space(vec!['a', 'b']);\\n\\n /// assert_eq!(mc.absorbing_states(), vec![&'b']);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn absorbing_states(&self) -> Vec<&T> {\\n\\n \\tself.absorbing_states_indexes()\\n\\n \\t\\t.iter()\\n\\n \\t\\t.map(|&i| &self.state_space()[i])\\n\\n \\t\\t.collect()\\n\\n }\\n\\n\\n\\n /// Returns the indexes indexes of all absorbing state, if any.\\n\\n ///\\n\\n /// An absorbing state is a state such that, if the process starts there, \\n\\n /// it will allways be there, i.e. the probability of moving to itself is one.\\n\\n ///\\n\\n /// # Examples\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 73,\n \"score\": 12.57260470476633\n },\n {\n \"content\": \" /// The state space is the collection of all values the chain might ever take,\\n\\n /// even if they are not recheable from the current state.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// The state space can be more than one state, \\n\\n /// even if the Markov Chain is already absorbed. \\n\\n /// ```\\n\\n /// # use ndarray::array;\\n\\n /// # use markovian::{FiniteMarkovChain, State};\\n\\n /// let mc = FiniteMarkovChain::from((1, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\\n\\n /// assert_eq!(mc.state_space(), &vec![0, 1]);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn state_space(&self) -> &Vec<T> {\\n\\n &self.state_space\\n\\n } \\n\\n\\n\\n /// Returns the size of the state space.\\n\\n ///\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 74,\n \"score\": 12.49429872765829\n },\n {\n \"content\": \" rng: R,\\n\\n ) -> Self {\\n\\n let transition_matrix_variables = transition_matrix.clone().into_iter()\\n\\n \\t.map(|v| WeightedAliasIndex::new(v).unwrap())\\n\\n \\t.collect();\\n\\n\\n\\n FiniteMarkovChain::new_raw(\\n\\n state_index,\\n\\n transition_matrix,\\n\\n transition_matrix_variables,\\n\\n state_space,\\n\\n rng\\n\\n )\\n\\n }\\n\\n\\n\\n #[inline]\\n\\n fn new_raw(\\n\\n state_index: usize,\\n\\n transition_matrix: Vec<Vec<W>>,\\n\\n transition_matrix_variables: Vec<WeightedAliasIndex<W>>, \\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 75,\n \"score\": 12.306995357438103\n },\n {\n \"content\": \" \\tU: Debug + PartialEq + Clone,\\n\\n {\\n\\n FiniteMarkovChain::new_raw( \\n\\n\\t\\t self.state_index,\\n\\n\\t\\t self.transition_matrix,\\n\\n\\t\\t self.transition_matrix_variables,\\n\\n\\t\\t new_state_space,\\n\\n\\t\\t self.rng,\\n\\n )\\n\\n }\\n\\n\\n\\n /// Returns all absorbing state, if any.\\n\\n ///\\n\\n /// An absorbing state is a state such that, if the process starts there, \\n\\n /// it will allways be there, i.e. the probability of moving to itself is one.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// There is one absorbing state: state `b`.\\n\\n /// ```\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 76,\n \"score\": 12.153202441410158\n },\n {\n \"content\": \"### Good\\n\\n\\n\\nStruct P<T>: and from methods for different T: Copy + Clone + Debug + PartialOrd + Num\\n\\n\\n\\n- Pros\\n\\n\\n\\n - More general than closed01\\n\\n - Checked initialization in debug mode (use assert_debug!)\\n\\n- Implement any trait we want, e.g. [num_traits](https://docs.rs/num-traits/0.2.12/num_traits/index.html) and some [core::ops](https://doc.rust-lang.org/nightly/core/ops/index.html).\\n\\n - Accept unums or posits, e.g. [softposit](https://crates.io/crates/softposit) (best implementation of the best rivel to floating point!)\\n\\n - [Visualization](https://cse512-19s.github.io/FP-Well-Rounded/)\\n\\n - [Paper](http://www.johngustafson.net/pdfs/BeatingFloatingPoint.pdf)\\n\\n\\n\\n#### Rejected\\n\\n\\n\\n- [closed01](https://crates.io/crates/closed01): a new type of float with extra methods. \\n\\n - Pros:\\n\\n - Add\\n\\n - WrappingAdd\\n\\n - SaturingAdd\\n\\n - Cons:\\n\\n - Still only floats\\n\\n \\n\",\n \"file_path\": \"TODO.md\",\n \"rank\": 77,\n \"score\": 11.775125360920233\n },\n {\n \"content\": \"// Traits\\n\\nuse rand_distr::Distribution;\\n\\nuse crate::traits::{State, StateIterator, Transition};\\n\\nuse core::fmt::Debug;\\n\\nuse rand::Rng;\\n\\n\\n\\n// Structs\\n\\nuse crate::errors::InvalidState;\\n\\nuse core::marker::PhantomData;\\n\\n\\n\\n// Functions\\n\\nuse core::mem;\\n\\n\\n\\n/// Markov Chain in continuous time, with arbitrary space.\\n\\n///\\n\\n/// Rust allows for more than only exponential time in the transitions, so \\n\\n/// does this crate. \\n\\n/// \\n\\n/// # Remarks\\n\\n/// \\n\",\n \"file_path\": \"src/timed_markov_chain.rs\",\n \"rank\": 78,\n \"score\": 11.752318339214323\n },\n {\n \"content\": \"// Traits\\n\\nuse crate::{State, StateIterator};\\n\\nuse core::fmt::Debug;\\n\\nuse rand::Rng;\\n\\nuse rand_distr::{weighted_alias::{WeightedAliasIndex, AliasableWeight}, Uniform, Distribution};\\n\\n\\n\\n// Structs\\n\\nuse crate::errors::InvalidState;\\n\\nuse petgraph::graph::DiGraph;\\n\\n\\n\\n// Functions\\n\\nuse core::mem;\\n\\n\\n\\n/// Finite state Markov Chain in discrete time. \\n\\n/// \\n\\n/// # Costs\\n\\n/// \\n\\n/// **Construction**: O(n^2), where n is the size of the state space.\\n\\n/// \\n\\n/// **Sample**: O(1).\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 79,\n \"score\": 11.713243377663002\n },\n {\n \"content\": \"//! (1.0 - 1.0 / (path_stadistic.abs() + 1) as f64, right), \\n\\n//! (1.0 / (path_stadistic.abs() + 1) as f64, left)\\n\\n//! ]\\n\\n//! }\\n\\n//! };\\n\\n//! let rng = thread_rng();\\n\\n//! let mut mc = markovian::MarkovChain::new(init_state, transition, rng);\\n\\n//! \\n\\n//! // state has history\\n\\n//! mc.next();\\n\\n//! assert_eq!(mc.state().unwrap().len(), 2);\\n\\n//! ```\\n\\n//! \\n\\npub use self::continuous_finite_markov_chain::ContFiniteMarkovChain;\\n\\npub use self::finite_markov_chain::FiniteMarkovChain;\\n\\npub use self::markov_chain::MarkovChain;\\n\\npub use self::timed_markov_chain::TimedMarkovChain;\\n\\npub use self::traits::{State, StateIterator, Transition};\\n\\n\\n\\n/// Generating random trajectories from stochactic processes\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 80,\n \"score\": 11.30647119918135\n },\n {\n \"content\": \"// Traits\\n\\nuse rand_distr::Distribution;\\n\\nuse crate::traits::{State, StateIterator, Transition};\\n\\nuse core::fmt::Debug;\\n\\nuse rand::Rng;\\n\\n\\n\\n// Structs\\n\\nuse crate::errors::InvalidState;\\n\\n\\n\\n// Functions\\n\\nuse core::mem;\\n\\n\\n\\n/// Markov Chain in discrete time, with arbitrary space.\\n\\n///\\n\\n/// # Remarks\\n\\n/// \\n\\n/// If your transition function `transition` could reuse of structs that implement\\n\\n/// the `Distribution<T>` trait in order to sample the next state, then, \\n\\n/// for the best performance possible, create your own struct that implements\\n\\n/// the `Transition<T, T>` trait.\\n\",\n \"file_path\": \"src/markov_chain.rs\",\n \"rank\": 81,\n \"score\": 11.27169721570398\n },\n {\n \"content\": \"//! let time = Exp::new(2.0).unwrap().sample(rng);\\n\\n//! let step = Uniform::from(0..=1).sample(rng) * 2 - 1;\\n\\n//! (time, state + step)\\n\\n//! }\\n\\n//! }\\n\\n//! let transition = MyTransition;\\n\\n//! let rng = thread_rng();\\n\\n//! let mut mc = markovian::TimedMarkovChain::new(init_state, transition, rng);\\n\\n//! ``` \\n\\n//!\\n\\n//! # Remarks\\n\\n//!\\n\\n//! All methods are `inline`, by design.\\n\\n//! \\n\\n//! Non-trivial ways to use the crate are described below, including time dependence, \\n\\n//! continuous space and non-markovian processes.\\n\\n//!\\n\\n//! ## Time dependence\\n\\n//!\\n\\n//! Include the time as part of the state of the process.\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 82,\n \"score\": 10.927266439655487\n },\n {\n \"content\": \"// Traits\\n\\nuse core::fmt::Debug;\\n\\nuse num_traits::{One, Zero};\\n\\nuse rand::Rng;\\n\\nuse rand_distr::Distribution;\\n\\n\\n\\n// use num_traits::Zero;\\n\\n\\n\\n/// Distribution over possibly infinte iterators. \\n\\n/// \\n\\n/// A random variable is represented by an iterator that yields values ``(P, T)``,\\n\\n/// where ``P`` represents the probability of the realization ``T``.\\n\\n/// See [Distribution implementation] for the trait constrains over ``P``.\\n\\n/// \\n\\n/// # Examples\\n\\n/// \\n\\n/// With help of the `raw_dist` macro, we construct a random variable that samples always a fixed value.\\n\\n/// ```\\n\\n/// # use markovian::prelude::*;\\n\\n/// # use rand::prelude::*;\\n\",\n \"file_path\": \"src/distributions/raw.rs\",\n \"rank\": 83,\n \"score\": 10.915609404524444\n },\n {\n \"content\": \" ///\\n\\n /// Although the state the Markov Chain does not change, \\n\\n /// its random number generator does. That is why this method needs `&mut self`.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// From the current state, the next index has equal probability of being `0` or `1`.\\n\\n /// ```\\n\\n /// # use ndarray::array;\\n\\n /// # use markovian::{FiniteMarkovChain, State};\\n\\n /// let mut mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\\n\\n /// println!(\\\"The next index could be {}\\\", mc.sample_index()); // 50% 0 and 50% 1.\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn sample_index(&mut self) -> usize {\\n\\n self.transition_matrix_variables[self.state_index].sample(&mut self.rng)\\n\\n }\\n\\n\\n\\n /// Returns the state space of the Markov Chain.\\n\\n ///\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 84,\n \"score\": 10.6287057713355\n },\n {\n \"content\": \"# To do\\n\\n\\n\\nRe-factor to be only stochastic processes and not sub-stochastic ones.\\n\\n\\n\\n## Derive Macros\\n\\n\\n\\n- State\\n\\n - Needs to read where_clauses to write them again in the implementation of State trait\\n\\n - Needs to be given (input) the type of Item (...which is always `T`). \\n\\n - Nice error message!\\n\\n- StateIterator\\n\\n - ??\\n\\n\\n\\nOnce implemented, clean the code for all the structs. \\n\\n\\n\\n## FiniteMarkovChain\\n\\n\\n\\n- Construction\\n\\n - Checks of state_space!\\n\\n - What is the condition you want\\n\\n - state_space must be different elements\\n\\n - set_state_space\\n\\n - state_space must be different elements\\n\\n - From Vec<T>\\n\\n - From a sample, \\n\\n - Consider the initial state\\n\\n - Discover the state space\\n\\n - Count each transition\\n\\n - Construct the chain \\n\\n - Add to lib module documentation\\n\\n- Move from panicking to errors\\n\\n - Create errors\\n\\n\\n\\n## ContFiniteMarkovChain\\n\\n\\n\\n- The same\\n\\n- has_absorbing_state(&self) -> bool\\n\\n\\n\\n## Macros\\n\\n\\n\\n- Learn to do useful macros!\\n\\n\\n\\n## Organization\\n\\n\\n\\n- **Modules organization:** different algorithms for simulation\\n\\n - Exact\\n\\n - Fast\\n\\n - Sample speed\\n\\n - Accurate\\n\\n - epsilon-strong\\n\\n - Brownian motion\\n\\n\\n\\n## Jump processes\\n\\n\\n\\nIn a few cases, the marginal distributions of the increments have a simple form such as a **gamma distribution**, a **stable distribution**, or an **inverse Gaussian distribution** so that special methods for such distributions allow to generate discrete skeletons. \\n\\n\\n\\n- [x] Possion process\\n\\n- [ ] Levy process\\n\\n\\n\\n\\n\\n\\n\\n## Abstract probabilities\\n\\n\\n\\nNo longer use only f64 to represent probabilities\\n\\n\\n\\nRequirements:\\n\\n\\n\\n- Need to represent cummulative probabilities, to simulate raw_dist!\\n\\n\\n\\n### Options\\n\\n\\n\\n### Best\\n\\n\\n\\n`Unit` wrapper from `nalgebra`!\\n\\n\\n\\nhttps://docs.rs/nalgebra/0.26.2/nalgebra/base/struct.Unit.html\\n\\n\\n\\nIdea: `Distribution<[T; N]>` wrapper for vectors, with constant generics!\\n\\n\\n\\n- Implementation: prob-num crate!\\n\\n\\n\",\n \"file_path\": \"TODO.md\",\n \"rank\": 85,\n \"score\": 10.60432284534424\n },\n {\n \"content\": \" /// The state space is the collection of all values the chain might ever take,\\n\\n /// even if they are not recheable from the current state.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// A Markov Chain with two states. \\n\\n /// ```\\n\\n /// # use ndarray::array;\\n\\n /// # use markovian::FiniteMarkovChain;\\n\\n /// let mc = FiniteMarkovChain::from((1, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\\n\\n /// assert_eq!(mc.nstates(), 2);\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn nstates(&self) -> usize {\\n\\n self.state_space().len()\\n\\n } \\n\\n\\n\\n /// Changes the state space of the Markov Chain.\\n\\n ///\\n\\n /// The state space is the collection of all values the chain might ever take,\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 86,\n \"score\": 10.49427391955882\n },\n {\n \"content\": \"pub use self::state::State;\\n\\npub use self::state_iterator::StateIterator;\\n\\npub use self::transition::Transition;\\n\\n\\n\\nmod state;\\n\\nmod state_iterator;\\n\\nmod transition;\\n\",\n \"file_path\": \"src/traits.rs\",\n \"rank\": 87,\n \"score\": 10.357390618001421\n },\n {\n \"content\": \"{\\n\\n type Item = T;\\n\\n\\n\\n /// Changes the state of the Branching to a new state, chosen \\n\\n /// according to the distribution for offsprings, and returns the new state. \\n\\n /// \\n\\n /// # Examples\\n\\n /// \\n\\n /// ```\\n\\n /// # use rand::prelude::*;\\n\\n /// # use markovian::prelude::*;\\n\\n /// let init_state: u32 = 1;\\n\\n /// let density = raw_dist![(0.3, 0), (0.4, 1), (0.3, 2)];\\n\\n /// let rng = thread_rng();\\n\\n /// let mut branching_process = Branching::new(init_state, density, rng);\\n\\n ///\\n\\n /// // The next state is 0, 1 or 2. \\n\\n /// let new_state = branching_process.next();\\n\\n /// assert!( (new_state == Some(0)) || (new_state == Some(1)) || (new_state == Some(2)) );\\n\\n /// ```\\n\",\n \"file_path\": \"src/processes/branching.rs\",\n \"rank\": 88,\n \"score\": 10.227343491178656\n },\n {\n \"content\": \"//!\\n\\n//! ### Examples\\n\\n//! \\n\\n//! A random walk on the integers that tends to move more to the right as time goes by. \\n\\n//! ```\\n\\n//! # #![allow(unused_mut)]\\n\\n//! # use rand::prelude::*;\\n\\n//! # use rand_distr::{Exp, Uniform};\\n\\n//! # use markovian::prelude::*;\\n\\n//! let init_state: (usize, i32) = (0, 0);\\n\\n//! let transition = |(time, state): &(usize, i32)| raw_dist![\\n\\n//! (0.6 - 1.0 / (time + 2) as f64, (time + 1, state + 1)),\\n\\n//! (0.4 + 1.0 / (time + 2) as f64, (time + 1, state - 1))\\n\\n//! ];\\n\\n//! let rng = thread_rng();\\n\\n//! let mut mc = markovian::MarkovChain::new(init_state, &transition, rng);\\n\\n//! \\n\\n//! // Take a sample of 10 elements \\n\\n//! mc.take(10).map(|(_, state)| state).collect::<Vec<i32>>();\\n\\n//! ```\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 89,\n \"score\": 9.855801178412321\n },\n {\n \"content\": \" /// from the current state.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// Checking the possibility of achieving a state from different initial states.\\n\\n /// ```\\n\\n /// # use ndarray::array;\\n\\n /// # use markovian::{FiniteMarkovChain, State};\\n\\n /// let mut mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()))\\n\\n /// .set_state_space(vec!['x', 'y']);\\n\\n /// assert!(mc.may_achieve('x').unwrap());\\n\\n /// assert!(mc.may_achieve('y').unwrap());\\n\\n /// mc.set_state('y');\\n\\n /// assert!(!mc.may_achieve('x').unwrap());\\n\\n /// assert!(mc.may_achieve('y').unwrap());\\n\\n /// ```\\n\\n #[inline]\\n\\n pub fn may_achieve(&self, query: T) -> Result<bool, InvalidState<T>> {\\n\\n match self.state_space.iter().position(|s| *s == query) {\\n\\n Some(state_index) => {\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 90,\n \"score\": 9.748182746781236\n },\n {\n \"content\": \"{\\n\\n /// Constructs a new `FiniteMarkovChain<T, W, R>`.\\n\\n /// \\n\\n /// # Panics\\n\\n /// \\n\\n /// # Panics\\n\\n ///\\n\\n /// This method panics if: \\n\\n /// - The`state_space` vector has repeated elements\\n\\n /// (defined by PartialEq).\\n\\n /// - The dimensions of `state_space` and `transition_matrix` do not match.\\n\\n /// - Any vector of `transition_matrix` has more than u32::MAX columns.\\n\\n /// - For any entry w of any vector of `transition_matrix` v: \\n\\n /// w < 0 or w > max where max = W::MAX / v.len().\\n\\n /// - For any vector of `transition_matrix` the sum of weights is zero.\\n\\n #[inline]\\n\\n pub fn new(\\n\\n state_index: usize,\\n\\n transition_matrix: Vec<Vec<W>>,\\n\\n state_space: Vec<T>,\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 91,\n \"score\": 9.678872268072116\n },\n {\n \"content\": \"//! state + step\\n\\n//! }\\n\\n//! }\\n\\n//! let transition = MyTransition;\\n\\n//! let rng = thread_rng();\\n\\n//! let mut mc = markovian::MarkovChain::new(init_state, transition, rng);\\n\\n//! mc.next();\\n\\n//! \\n\\n//! // current_state is positive \\n\\n//! assert!(mc.state().unwrap() > &0.0);\\n\\n//! ```\\n\\n//! \\n\\n//! ## Non markovian\\n\\n//!\\n\\n//! Include history in the state. For example, instead of `i32`, use `Vec<i32>`. \\n\\n//!\\n\\n//! ### Examples\\n\\n//! \\n\\n//! A random walk on the integers that is atracted to zero in a non markovian\\n\\n//! fashion. \\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 92,\n \"score\": 9.516512692551528\n },\n {\n \"content\": \" acc = acc + self.base_distribution.sample(rng);\\n\\n count = count + T::one();\\n\\n }\\n\\n acc\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use crate::prelude::*;\\n\\n\\n\\n #[test]\\n\\n fn value_stability() {\\n\\n let expected = vec![2, 1, 2, 1, 1, 2, 4, 3, 2, 1, 1, 0];\\n\\n let init_state: u32 = 1;\\n\\n let density = raw_dist![(0.3, 0), (0.4, 1), (0.3, 2)];\\n\\n let rng = crate::tests::rng(1);\\n\\n let branching_process = Branching::new(init_state, density, rng);\\n\\n let sample: Vec<u32> = branching_process.take(12).collect();\\n\\n assert_eq!(sample, expected);\\n\\n }\\n\\n}\",\n \"file_path\": \"src/processes/branching.rs\",\n \"rank\": 93,\n \"score\": 9.25210375592958\n },\n {\n \"content\": \"//! Simulation of (sub-)stochastic processes.\\n\\n//!\\n\\n//! # Goal\\n\\n//!\\n\\n//! Serve as an extension of the [rand crate](https://crates.io/crates/rand) for sub-stochastic processes.\\n\\n//! \\n\\n//! # Examples\\n\\n//!\\n\\n//! ## Finite Markov Chains\\n\\n//!\\n\\n//! An absorbing Markov Chain with one transient state and one absorbing state.\\n\\n//! ```\\n\\n//! # use ndarray::array;\\n\\n//! # use markovian::State;\\n\\n//! let mut mc = markovian::FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\\n\\n//! assert_eq!(mc.state(), Some(&0));\\n\\n//! assert_eq!(mc.state_space(), &vec![0, 1]);\\n\\n//! println!(\\\"At time {}, the state is {}\\\", 1_000, mc.nth(1_000).unwrap()); // Most likely 1\\n\\n//! ``` \\n\\n//!\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 94,\n \"score\": 9.241545738504666\n },\n {\n \"content\": \" state_space: Vec<T>,\\n\\n rng: R,\\n\\n ) -> Self {\\n\\n let state_space_len_true: usize = state_space.iter()\\n\\n .map(|x| state_space.iter().filter(|&y| x == y).count())\\n\\n .sum();\\n\\n assert_eq!(state_space_len_true, state_space.len());\\n\\n assert_eq!(transition_matrix.len(), state_space.len());\\n\\n FiniteMarkovChain {\\n\\n state_index,\\n\\n transition_matrix,\\n\\n transition_matrix_variables,\\n\\n state_space,\\n\\n rng,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Samples a possible index for the next state.\\n\\n ///\\n\\n /// # Remarks\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 95,\n \"score\": 8.953311159089026\n },\n {\n \"content\": \"/// let value = 0;\\n\\n/// let dis = raw_dist![(1, value)];\\n\\n///\\n\\n/// assert_eq!(value, dis.sample(&mut thread_rng()));\\n\\n/// ```\\n\\n/// \\n\\n/// # Panics\\n\\n/// \\n\\n/// Panics if probabilities: \\n\\n/// - Are strictly less than zero. \\n\\n/// - Sum up strictly more than one.\\n\\n/// \\n\\n/// # Costs\\n\\n/// \\n\\n/// Sample cost: O(iterator length).\\n\\n/// Construction cost: O(1).\\n\\n/// \\n\\n/// # Remarks\\n\\n/// \\n\\n/// This struct is meant to be used when one needs to sample once from an infinte iterator.\\n\",\n \"file_path\": \"src/distributions/raw.rs\",\n \"rank\": 96,\n \"score\": 8.90743876716201\n },\n {\n \"content\": \"//! ## Discrete time\\n\\n//! \\n\\n//! Construction of a random walk in the integers.\\n\\n//! ```\\n\\n//! # #![allow(unused_mut)]\\n\\n//! # use markovian::prelude::*;\\n\\n//! # use rand::prelude::*;\\n\\n//! let init_state: i32 = 0;\\n\\n//! let transition = |state: &i32| raw_dist![(0.5, state + 1), (0.5, state - 1)];\\n\\n//! let rng = thread_rng();\\n\\n//! let mut mc = markovian::MarkovChain::new(init_state, transition, rng);\\n\\n//! ``` \\n\\n//! \\n\\n//! ## Branching process\\n\\n//!\\n\\n//! Construction using density p(0) = 0.3, p(1) = 0.4, p(2) = 0.3. \\n\\n//! ```\\n\\n//! # #![allow(unused_mut)]\\n\\n//! # use markovian::prelude::*;\\n\\n//! # use rand::prelude::*;\\n\",\n \"file_path\": \"src/lib.rs\",\n \"rank\": 97,\n \"score\": 8.719189377812281\n },\n {\n \"content\": \" Ok(self.may_achieve_index(state_index))\\n\\n },\\n\\n None => Err(InvalidState::new(query)),\\n\\n }\\n\\n }\\n\\n\\n\\n /// Returns `true` if the Markov Chain contains a recheable absorbing state, \\n\\n /// from the current state.\\n\\n ///\\n\\n /// An absorbing state is a state such that, if the process starts there, \\n\\n /// it will allways be there, i.e. the probability of moving to itself is one.\\n\\n /// A reacheable state is a state that can be reached with positive probability.\\n\\n ///\\n\\n /// # Examples\\n\\n ///\\n\\n /// Checking the possibility of achieving a state from different initial states.\\n\\n /// ```\\n\\n /// # use ndarray::array;\\n\\n /// # use markovian::{FiniteMarkovChain, State};\\n\\n /// let mut mc = FiniteMarkovChain::from((0, array![[0.5, 0.5], [0.0, 1.0]], rand::thread_rng()));\\n\",\n \"file_path\": \"src/finite_markov_chain/fast_sample.rs\",\n \"rank\": 98,\n \"score\": 8.678184054697157\n },\n {\n \"content\": \"{\\n\\n func: F,\\n\\n distr: D,\\n\\n phantom: PhantomData<(S, T)>\\n\\n}\\n\\n\\n\\nimpl<S, T, F, D> Unary<S, T, F, D>\\n\\nwhere\\n\\n F: Fn(S) -> T,\\n\\n D: Distribution<S>,\\n\\n{\\n\\n #[inline]\\n\\n pub fn new(func: F, distr: D) -> Self {\\n\\n Unary { func, distr, phantom: PhantomData }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<S, T, F, D> Distribution<T> for Unary<S, T, F, D>\\n\\nwhere\\n\\n F: Fn(S) -> T,\\n\",\n \"file_path\": \"src/distributions/unary.rs\",\n \"rank\": 99,\n \"score\": 8.491335771571404\n }\n]","isConversational":false}}},{"rowIdx":992,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/libinput.rs"},"repo_name":{"kind":"string","value":"harshadgavali/gnome-x11-gesture-daemon"},"commit":{"kind":"string","value":"3c5a56a5ca9cf151bcee05bb8bbc8af3309b5f12"},"file_code":{"kind":"string","value":"use std::{\n fs::{File, OpenOptions},\n os::unix::prelude::{AsRawFd, FromRawFd, IntoRawFd, OpenOptionsExt, RawFd},\n path::Path,\n sync::mpsc,\n};\n\nuse input::{\n event::{\n gesture::{GestureHoldEvent, GesturePinchEvent, GestureSwipeEvent},\n Event, GestureEvent,\n },\n ffi::{\n libinput_event_gesture_get_angle_delta, libinput_event_gesture_get_cancelled,\n libinput_event_gesture_get_dx_unaccelerated, libinput_event_gesture_get_dy_unaccelerated,\n libinput_event_gesture_get_finger_count, libinput_event_gesture_get_scale,\n libinput_event_gesture_get_time,\n },\n Libinput, LibinputInterface,\n};\nuse libc::{poll, pollfd};\nuse serde::{Deserialize, Serialize};\nuse zvariant::derive::Type;\n\n#[derive(Debug, Deserialize, Serialize, Type)]\npub struct CustomSwipeEvent {\n pub stage: String,\n pub fingers: i32,\n pub dx: f64,\n pub dy: f64,\n pub time: u32,\n}\n\n#[derive(Debug, Deserialize, Serialize, Type)]\npub struct CustomHoldEvent {\n pub stage: String,\n pub fingers: i32,\n pub time: u32,\n pub is_cancelled: bool,\n}\n\n#[derive(Debug, Deserialize, Serialize, Type)]\npub struct CustomPinchEvent {\n pub stage: String,\n pub fingers: i32,\n pub angle_delta: f64,\n pub scale: f64,\n pub time: u32,\n}\n\npub enum CustomGestureEvent {\n Swipe(CustomSwipeEvent),\n Hold(CustomHoldEvent),\n Pinch(CustomPinchEvent),\n}\n\nstruct Interface;\n\nimpl LibinputInterface for Interface {\n #[allow(clippy::bad_bit_mask)]\n fn open_restricted(&mut self, path: &Path, flags: i32) -> Result<RawFd, i32> {\n OpenOptions::new()\n .custom_flags(flags)\n .read((flags & libc::O_RDONLY != 0) | (flags & libc::O_RDWR != 0))\n .write((flags & libc::O_WRONLY != 0) | (flags & libc::O_RDWR != 0))\n .open(path)\n .map(|file| file.into_raw_fd())\n .map_err(|err| err.raw_os_error().unwrap())\n }\n fn close_restricted(&mut self, fd: RawFd) {\n unsafe {\n File::from_raw_fd(fd);\n }\n }\n}\n\npub fn handle_swipe(swipe: GestureSwipeEvent, transmitter: &mpsc::Sender<CustomGestureEvent>) {\n let stage = match &swipe {\n GestureSwipeEvent::Begin(_) => \"Begin\",\n GestureSwipeEvent::Update(_) => \"Update\",\n GestureSwipeEvent::End(_) => \"End\",\n _ => panic!(\"Unkown gesture event {:?}\", swipe),\n };\n\n let (fingers, dx, dy, time) = unsafe {\n let raw_gesture_event = input::AsRaw::as_raw_mut(&swipe);\n (\n libinput_event_gesture_get_finger_count(raw_gesture_event),\n libinput_event_gesture_get_dx_unaccelerated(raw_gesture_event),\n libinput_event_gesture_get_dy_unaccelerated(raw_gesture_event),\n libinput_event_gesture_get_time(raw_gesture_event),\n )\n };\n\n let swipe = CustomSwipeEvent {\n stage: stage.into(),\n fingers,\n dx,\n dy,\n time,\n };\n\n transmitter.send(CustomGestureEvent::Swipe(swipe)).unwrap();\n}\n\npub fn handle_hold(hold: GestureHoldEvent, transmitter: &mpsc::Sender<CustomGestureEvent>) {\n let stage = match &hold {\n GestureHoldEvent::Begin(_) => \"Begin\",\n GestureHoldEvent::End(_) => \"End\",\n _ => panic!(\"Unkown gesture event {:?}\", hold),\n };\n\n let (fingers, time, is_cancelled) = unsafe {\n let raw_gesture_event = input::AsRaw::as_raw_mut(&hold);\n (\n libinput_event_gesture_get_finger_count(raw_gesture_event),\n libinput_event_gesture_get_time(raw_gesture_event),\n \n matches!(hold, GestureHoldEvent::End(_))\n && libinput_event_gesture_get_cancelled(raw_gesture_event) != 0,\n )\n };\n\n \n if fingers < 3 {\n return;\n }\n\n let hold = CustomHoldEvent {\n stage: stage.into(),\n fingers,\n time,\n is_cancelled,\n };\n\n transmitter.send(CustomGestureEvent::Hold(hold)).unwrap();\n}\n\nfn handle_pinch(pinch: GesturePinchEvent, transmitter: &mpsc::Sender<CustomGestureEvent>) {\n let stage = match &pinch {\n GesturePinchEvent::Begin(_) => \"Begin\",\n GesturePinchEvent::Update(_) => \"Update\",\n GesturePinchEvent::End(_) => \"End\",\n _ => panic!(\"Unkown gesture event {:?}\", pinch),\n };\n\n let (fingers, angle_delta, scale, time) = unsafe {\n let raw_gesture_event = input::AsRaw::as_raw_mut(&pinch);\n (\n libinput_event_gesture_get_finger_count(raw_gesture_event),\n libinput_event_gesture_get_angle_delta(raw_gesture_event),\n libinput_event_gesture_get_scale(raw_gesture_event),\n libinput_event_gesture_get_time(raw_gesture_event),\n )\n };\n\n \n if fingers < 3 {\n return;\n }\n\n let pinch = CustomPinchEvent {\n stage: stage.into(),\n fingers,\n angle_delta,\n scale,\n time,\n };\n\n transmitter.send(CustomGestureEvent::Pinch(pinch)).unwrap();\n}\n\npub fn libinput_listener(transmitter: mpsc::Sender<CustomGestureEvent>) {\n let mut input = Libinput::new_with_udev(Interface);\n\n input.udev_assign_seat(\"seat0\").unwrap();\n\n const POLLIN: i16 = 1; \n\n let mut poll_fds = pollfd {\n fd: input.as_raw_fd(),\n events: POLLIN,\n revents: 0,\n };\n\n loop {\n unsafe {\n poll(&mut poll_fds, 1, -1);\n }\n\n input.dispatch().unwrap();\n loop {\n let event = input.next();\n if event.is_none() {\n break;\n }\n\n if let Event::Gesture(gesture_event) = event.unwrap() {\n match gesture_event {\n GestureEvent::Hold(hold) => handle_hold(hold, &transmitter),\n GestureEvent::Swipe(swipe) => handle_swipe(swipe, &transmitter),\n GestureEvent::Pinch(pinch) => handle_pinch(pinch, &transmitter),\n _ => {}\n }\n }\n }\n }\n}\n"},"prefix":{"kind":"string","value":"use std::{\n fs::{File, OpenOptions},\n os::unix::prelude::{AsRawFd, FromRawFd, IntoRawFd, OpenOptionsExt, RawFd},\n path::Path,\n sync::mpsc,\n};\n\nuse input::{\n event::{\n gesture::{GestureHoldEvent, GesturePinchEvent, GestureSwipeEvent},\n Event, GestureEvent,\n },\n ffi::{\n libinput_event_gesture_get_angle_delta, libinput_event_gesture_get_cancelled,\n libinput_event_gesture_get_dx_unaccelerated, libinput_event_gesture_get_dy_unaccelerated,\n libinput_event_gesture_get_finger_count, libinput_event_gesture_get_scale,\n libinput_event_gesture_get_time,\n },\n Libinput, LibinputInterface,\n};\nuse libc::{poll, pollfd};\nuse serde::{Deserialize, Serialize};\nuse zvariant::derive::Type;\n\n#[derive(Debug, Deserialize, Serialize, Type)]\npub struct CustomSwipeEvent {\n pub stage: String,\n pub fingers: i32,\n pub dx: f64,\n pub dy: f64,\n pub time: u32,\n}\n\n#[derive(Debug, Deserialize, Serialize, Type)]\npub struct CustomHoldEvent {\n pub stage: String,\n pub fingers: i32,\n pub time: u32,\n pub is_cancelled: bool,\n}\n\n#[derive(Debug, Deserialize, Serialize, Type)]\npub struct CustomPinchEvent {\n pub stage: String,\n pub fingers: i32,\n pub angle_delta: f64,\n pub scale: f64,\n pub time: u32,\n}\n\npub enum CustomGestureEvent {\n Swipe(CustomSwipeEvent),\n Hold(CustomHoldEvent),\n Pinch(CustomPinchEvent),\n}\n\nstruct Interface;\n\nimpl LibinputInterface for Interface {\n #[allow(clippy::bad_bit_mask)]\n "},"suffix":{"kind":"string","value":"\n fn close_restricted(&mut self, fd: RawFd) {\n unsafe {\n File::from_raw_fd(fd);\n }\n }\n}\n\npub fn handle_swipe(swipe: GestureSwipeEvent, transmitter: &mpsc::Sender<CustomGestureEvent>) {\n let stage = match &swipe {\n GestureSwipeEvent::Begin(_) => \"Begin\",\n GestureSwipeEvent::Update(_) => \"Update\",\n GestureSwipeEvent::End(_) => \"End\",\n _ => panic!(\"Unkown gesture event {:?}\", swipe),\n };\n\n let (fingers, dx, dy, time) = unsafe {\n let raw_gesture_event = input::AsRaw::as_raw_mut(&swipe);\n (\n libinput_event_gesture_get_finger_count(raw_gesture_event),\n libinput_event_gesture_get_dx_unaccelerated(raw_gesture_event),\n libinput_event_gesture_get_dy_unaccelerated(raw_gesture_event),\n libinput_event_gesture_get_time(raw_gesture_event),\n )\n };\n\n let swipe = CustomSwipeEvent {\n stage: stage.into(),\n fingers,\n dx,\n dy,\n time,\n };\n\n transmitter.send(CustomGestureEvent::Swipe(swipe)).unwrap();\n}\n\npub fn handle_hold(hold: GestureHoldEvent, transmitter: &mpsc::Sender<CustomGestureEvent>) {\n let stage = match &hold {\n GestureHoldEvent::Begin(_) => \"Begin\",\n GestureHoldEvent::End(_) => \"End\",\n _ => panic!(\"Unkown gesture event {:?}\", hold),\n };\n\n let (fingers, time, is_cancelled) = unsafe {\n let raw_gesture_event = input::AsRaw::as_raw_mut(&hold);\n (\n libinput_event_gesture_get_finger_count(raw_gesture_event),\n libinput_event_gesture_get_time(raw_gesture_event),\n \n matches!(hold, GestureHoldEvent::End(_))\n && libinput_event_gesture_get_cancelled(raw_gesture_event) != 0,\n )\n };\n\n \n if fingers < 3 {\n return;\n }\n\n let hold = CustomHoldEvent {\n stage: stage.into(),\n fingers,\n time,\n is_cancelled,\n };\n\n transmitter.send(CustomGestureEvent::Hold(hold)).unwrap();\n}\n\nfn handle_pinch(pinch: GesturePinchEvent, transmitter: &mpsc::Sender<CustomGestureEvent>) {\n let stage = match &pinch {\n GesturePinchEvent::Begin(_) => \"Begin\",\n GesturePinchEvent::Update(_) => \"Update\",\n GesturePinchEvent::End(_) => \"End\",\n _ => panic!(\"Unkown gesture event {:?}\", pinch),\n };\n\n let (fingers, angle_delta, scale, time) = unsafe {\n let raw_gesture_event = input::AsRaw::as_raw_mut(&pinch);\n (\n libinput_event_gesture_get_finger_count(raw_gesture_event),\n libinput_event_gesture_get_angle_delta(raw_gesture_event),\n libinput_event_gesture_get_scale(raw_gesture_event),\n libinput_event_gesture_get_time(raw_gesture_event),\n )\n };\n\n \n if fingers < 3 {\n return;\n }\n\n let pinch = CustomPinchEvent {\n stage: stage.into(),\n fingers,\n angle_delta,\n scale,\n time,\n };\n\n transmitter.send(CustomGestureEvent::Pinch(pinch)).unwrap();\n}\n\npub fn libinput_listener(transmitter: mpsc::Sender<CustomGestureEvent>) {\n let mut input = Libinput::new_with_udev(Interface);\n\n input.udev_assign_seat(\"seat0\").unwrap();\n\n const POLLIN: i16 = 1; \n\n let mut poll_fds = pollfd {\n fd: input.as_raw_fd(),\n events: POLLIN,\n revents: 0,\n };\n\n loop {\n unsafe {\n poll(&mut poll_fds, 1, -1);\n }\n\n input.dispatch().unwrap();\n loop {\n let event = input.next();\n if event.is_none() {\n break;\n }\n\n if let Event::Gesture(gesture_event) = event.unwrap() {\n match gesture_event {\n GestureEvent::Hold(hold) => handle_hold(hold, &transmitter),\n GestureEvent::Swipe(swipe) => handle_swipe(swipe, &transmitter),\n GestureEvent::Pinch(pinch) => handle_pinch(pinch, &transmitter),\n _ => {}\n }\n }\n }\n }\n}\n"},"middle":{"kind":"string","value":"fn open_restricted(&mut self, path: &Path, flags: i32) -> Result<RawFd, i32> {\n OpenOptions::new()\n .custom_flags(flags)\n .read((flags & libc::O_RDONLY != 0) | (flags & libc::O_RDWR != 0))\n .write((flags & libc::O_WRONLY != 0) | (flags & libc::O_RDWR != 0))\n .open(path)\n .map(|file| file.into_raw_fd())\n .map_err(|err| err.raw_os_error().unwrap())\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"struct Greeter {}\n\n\n\n#[dbus_interface(name = \"org.gestureImprovements.gestures\")]\n\nimpl Greeter {\n\n #[dbus_interface(signal)]\n\n fn touchpad_swipe(&self, event: &libinput::CustomSwipeEvent) -> zbus::Result<()>;\n\n\n\n #[dbus_interface(signal)]\n\n fn touchpad_hold(&self, event: &libinput::CustomHoldEvent) -> zbus::Result<()>;\n\n\n\n #[dbus_interface(signal)]\n\n fn touchpad_pinch(&self, event: &libinput::CustomPinchEvent) -> zbus::Result<()>;\n\n\n\n fn get_version(&mut self) -> String {\n\n const VERSION: Option<&'static str> = option_env!(\"CARGO_PKG_VERSION\");\n\n VERSION.unwrap_or(\"unknown\").into()\n\n }\n\n}\n\n\n","file_path":"src/main.rs","rank":4,"score":28434.426307474187},{"content":"fn display_info(arguments: Vec<String>) {\n\n const VERSION: Option<&'static str> = option_env!(\"CARGO_PKG_VERSION\");\n\n const COMMIT: Option<&'static str> = option_env!(\"GIT_HEAD_SHA\");\n\n\n\n match arguments[1].as_str() {\n\n \"--version\" => {\n\n println!(\"version: {}\", VERSION.unwrap_or(\"unknown\"));\n\n if let Some(commit) = COMMIT {\n\n println!(\"commit: {}\", commit)\n\n }\n\n }\n\n\n\n _ => {\n\n println!(\n\n \"Unknown argument: {:}\\n\\\n\n Supported arguments:\\n\\\n\n \\t--version\\tdisplay version information\\n\\\n\n \\nRun without arguments to start dbus service\",\n\n &arguments[1 .. arguments.len()].join(\" \")\n\n );\n\n }\n\n }\n\n}\n\n\n","file_path":"src/main.rs","rank":5,"score":23113.800157261874},{"content":"use std::os::unix::prelude::AsRawFd;\n\nuse std::sync::mpsc;\n\nuse std::thread;\n\nuse std::{convert::TryInto, time::Duration};\n\n\n\nuse libc::{poll, pollfd};\n\nuse zbus::{dbus_interface, fdo};\n\n\n\nmod libinput;\n","file_path":"src/main.rs","rank":13,"score":7.713994581484934},{"content":" let greeter = Greeter {};\n\n let path = &\"/org/gestureImprovements/gestures\".try_into().unwrap();\n\n object_server.at(path, greeter).unwrap();\n\n\n\n thread::spawn(|| {\n\n libinput::libinput_listener(transmitter);\n\n });\n\n\n\n // println!(\"starting loop\");\n\n\n\n let timeout = Duration::from_millis(1000);\n\n\n\n const POLLIN: i16 = 1; // available to read\n\n\n\n let mut poll_fds = pollfd {\n\n fd: connection.as_raw_fd(),\n\n events: POLLIN,\n\n revents: 0,\n\n };\n\n\n","file_path":"src/main.rs","rank":14,"score":2.849669425046422},{"content":" let starve_limit = 16;\n\n let mut msg_recv = starve_limit;\n\n\n\n loop {\n\n let msg = reciever.recv_timeout(timeout);\n\n\n\n match msg {\n\n Ok(msg) => {\n\n object_server\n\n .with(path, move |iface: &Greeter| match &msg {\n\n libinput::CustomGestureEvent::Hold(hold) => iface.touchpad_hold(hold),\n\n libinput::CustomGestureEvent::Swipe(swipe) => iface.touchpad_swipe(swipe),\n\n libinput::CustomGestureEvent::Pinch(pinch) => iface.touchpad_pinch(pinch),\n\n })\n\n .unwrap();\n\n msg_recv += 1;\n\n }\n\n\n\n Err(_) => {\n\n msg_recv = starve_limit;\n","file_path":"src/main.rs","rank":15,"score":2.191685016446732},{"content":"\n\n# Installation\n\n### User needs be in `input` group\n\n```\n\nsudo usermod -aG input $USER\n\n```\n\n* For Fedora Silverblue\n\n```\n\n# group 'input' needs to be in /etc/group first\n\ngrep -E '^input:' /usr/lib/group | sudo tee -a /etc/group\n\nsudo usermod -aG input $USER\n\n```\n\n\n\n### **From releases**\n\n- Download zip file from [releases](https://github.com/harshadgavali/gnome-x11-gesture-daemon/releases)\n\n- Extract zip file\n\n- Inside extracted folder, Run \n\n```\n\n# Without sudo/root\n\nsh install.sh # Reboot is needed after this\n\n\n\n# ** OR ** to restart daemon, without rebooting\n\nsh install.sh --restart\n\n\n\n```\n\n\n\n### Distributions\n\n\n\n* Arch Linux/Manjaro Linux - [gnome-x11-gesture-daemon](https://aur.archlinux.org/packages/gnome-x11-gesture-daemon) Thanks to @[yochananmarqos](https://github.com/yochananmarqos)\n\n```code\n\nyay -S gnome-x11-gesture-daemon\n\n```\n\n\n\n### Build from source\n\n\n\n#### Using docker/podman\n\n```\n\nmake build-docker && make install\n\n```\n\n\n\n#### Without docker/podman\n\n* First install build dependencies\n\n```\n\n# dnf/rpm based distributions\n\nsudo dnf install libinput-devel\n\n\n\n# apt/deb based distributions\n\nsudo apt install libinput-dev\n\n```\n\n* Then build and install\n\n```\n\nmake build && make install\n\n```\n\n\n\n### Troubleshooting\n\n- First make sure you've restarted your system after installing.\n\n\n\n- Run following command to check if service is running properly (It should be running on X11).\n\n```\n\nsystemctl --user status gesture_improvements_gesture_daemon.service\n\n```\n\n\n\n- Open issue on github, with output of the above command\n\n### Uninstallation\n\n```\n\n# Without sudo/root\n\nsh ./uninstall.sh\n\n```\n\n\n\n# Contributors\n\n[Swastik Dwivedi](https://github.com/drunckj)\n\n\n\n# Thanks\n\n[@Smithay](https://github.com/Smithay) for [rust bindings](https://crates.io/crates/input) for libinput\n\n\n\n[FreeDesktop/Dbus Project](https://gitlab.freedesktop.org/dbus/) for [Rust API](https://crates.io/crates/zbus) for D-Bus.\n","file_path":"README.md","rank":16,"score":2.0547560873802793}],"string":"[\n {\n \"content\": \"struct Greeter {}\\n\\n\\n\\n#[dbus_interface(name = \\\"org.gestureImprovements.gestures\\\")]\\n\\nimpl Greeter {\\n\\n #[dbus_interface(signal)]\\n\\n fn touchpad_swipe(&self, event: &libinput::CustomSwipeEvent) -> zbus::Result<()>;\\n\\n\\n\\n #[dbus_interface(signal)]\\n\\n fn touchpad_hold(&self, event: &libinput::CustomHoldEvent) -> zbus::Result<()>;\\n\\n\\n\\n #[dbus_interface(signal)]\\n\\n fn touchpad_pinch(&self, event: &libinput::CustomPinchEvent) -> zbus::Result<()>;\\n\\n\\n\\n fn get_version(&mut self) -> String {\\n\\n const VERSION: Option<&'static str> = option_env!(\\\"CARGO_PKG_VERSION\\\");\\n\\n VERSION.unwrap_or(\\\"unknown\\\").into()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 4,\n \"score\": 28434.426307474187\n },\n {\n \"content\": \"fn display_info(arguments: Vec<String>) {\\n\\n const VERSION: Option<&'static str> = option_env!(\\\"CARGO_PKG_VERSION\\\");\\n\\n const COMMIT: Option<&'static str> = option_env!(\\\"GIT_HEAD_SHA\\\");\\n\\n\\n\\n match arguments[1].as_str() {\\n\\n \\\"--version\\\" => {\\n\\n println!(\\\"version: {}\\\", VERSION.unwrap_or(\\\"unknown\\\"));\\n\\n if let Some(commit) = COMMIT {\\n\\n println!(\\\"commit: {}\\\", commit)\\n\\n }\\n\\n }\\n\\n\\n\\n _ => {\\n\\n println!(\\n\\n \\\"Unknown argument: {:}\\\\n\\\\\\n\\n Supported arguments:\\\\n\\\\\\n\\n \\\\t--version\\\\tdisplay version information\\\\n\\\\\\n\\n \\\\nRun without arguments to start dbus service\\\",\\n\\n &arguments[1 .. arguments.len()].join(\\\" \\\")\\n\\n );\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 5,\n \"score\": 23113.800157261874\n },\n {\n \"content\": \"use std::os::unix::prelude::AsRawFd;\\n\\nuse std::sync::mpsc;\\n\\nuse std::thread;\\n\\nuse std::{convert::TryInto, time::Duration};\\n\\n\\n\\nuse libc::{poll, pollfd};\\n\\nuse zbus::{dbus_interface, fdo};\\n\\n\\n\\nmod libinput;\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 13,\n \"score\": 7.713994581484934\n },\n {\n \"content\": \" let greeter = Greeter {};\\n\\n let path = &\\\"/org/gestureImprovements/gestures\\\".try_into().unwrap();\\n\\n object_server.at(path, greeter).unwrap();\\n\\n\\n\\n thread::spawn(|| {\\n\\n libinput::libinput_listener(transmitter);\\n\\n });\\n\\n\\n\\n // println!(\\\"starting loop\\\");\\n\\n\\n\\n let timeout = Duration::from_millis(1000);\\n\\n\\n\\n const POLLIN: i16 = 1; // available to read\\n\\n\\n\\n let mut poll_fds = pollfd {\\n\\n fd: connection.as_raw_fd(),\\n\\n events: POLLIN,\\n\\n revents: 0,\\n\\n };\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 14,\n \"score\": 2.849669425046422\n },\n {\n \"content\": \" let starve_limit = 16;\\n\\n let mut msg_recv = starve_limit;\\n\\n\\n\\n loop {\\n\\n let msg = reciever.recv_timeout(timeout);\\n\\n\\n\\n match msg {\\n\\n Ok(msg) => {\\n\\n object_server\\n\\n .with(path, move |iface: &Greeter| match &msg {\\n\\n libinput::CustomGestureEvent::Hold(hold) => iface.touchpad_hold(hold),\\n\\n libinput::CustomGestureEvent::Swipe(swipe) => iface.touchpad_swipe(swipe),\\n\\n libinput::CustomGestureEvent::Pinch(pinch) => iface.touchpad_pinch(pinch),\\n\\n })\\n\\n .unwrap();\\n\\n msg_recv += 1;\\n\\n }\\n\\n\\n\\n Err(_) => {\\n\\n msg_recv = starve_limit;\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 15,\n \"score\": 2.191685016446732\n },\n {\n \"content\": \"\\n\\n# Installation\\n\\n### User needs be in `input` group\\n\\n```\\n\\nsudo usermod -aG input $USER\\n\\n```\\n\\n* For Fedora Silverblue\\n\\n```\\n\\n# group 'input' needs to be in /etc/group first\\n\\ngrep -E '^input:' /usr/lib/group | sudo tee -a /etc/group\\n\\nsudo usermod -aG input $USER\\n\\n```\\n\\n\\n\\n### **From releases**\\n\\n- Download zip file from [releases](https://github.com/harshadgavali/gnome-x11-gesture-daemon/releases)\\n\\n- Extract zip file\\n\\n- Inside extracted folder, Run \\n\\n```\\n\\n# Without sudo/root\\n\\nsh install.sh # Reboot is needed after this\\n\\n\\n\\n# ** OR ** to restart daemon, without rebooting\\n\\nsh install.sh --restart\\n\\n\\n\\n```\\n\\n\\n\\n### Distributions\\n\\n\\n\\n* Arch Linux/Manjaro Linux - [gnome-x11-gesture-daemon](https://aur.archlinux.org/packages/gnome-x11-gesture-daemon) Thanks to @[yochananmarqos](https://github.com/yochananmarqos)\\n\\n```code\\n\\nyay -S gnome-x11-gesture-daemon\\n\\n```\\n\\n\\n\\n### Build from source\\n\\n\\n\\n#### Using docker/podman\\n\\n```\\n\\nmake build-docker && make install\\n\\n```\\n\\n\\n\\n#### Without docker/podman\\n\\n* First install build dependencies\\n\\n```\\n\\n# dnf/rpm based distributions\\n\\nsudo dnf install libinput-devel\\n\\n\\n\\n# apt/deb based distributions\\n\\nsudo apt install libinput-dev\\n\\n```\\n\\n* Then build and install\\n\\n```\\n\\nmake build && make install\\n\\n```\\n\\n\\n\\n### Troubleshooting\\n\\n- First make sure you've restarted your system after installing.\\n\\n\\n\\n- Run following command to check if service is running properly (It should be running on X11).\\n\\n```\\n\\nsystemctl --user status gesture_improvements_gesture_daemon.service\\n\\n```\\n\\n\\n\\n- Open issue on github, with output of the above command\\n\\n### Uninstallation\\n\\n```\\n\\n# Without sudo/root\\n\\nsh ./uninstall.sh\\n\\n```\\n\\n\\n\\n# Contributors\\n\\n[Swastik Dwivedi](https://github.com/drunckj)\\n\\n\\n\\n# Thanks\\n\\n[@Smithay](https://github.com/Smithay) for [rust bindings](https://crates.io/crates/input) for libinput\\n\\n\\n\\n[FreeDesktop/Dbus Project](https://gitlab.freedesktop.org/dbus/) for [Rust API](https://crates.io/crates/zbus) for D-Bus.\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 16,\n \"score\": 2.0547560873802793\n }\n]","isConversational":false}}},{"rowIdx":993,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/bvh.rs"},"repo_name":{"kind":"string","value":"q4x3/raytracer"},"commit":{"kind":"string","value":"7ebb6e1f505dae0985a972fab2d9237cbba3cbc9"},"file_code":{"kind":"string","value":"use crate::{\n aabb::AABB,\n hittable::{HitRecord, HitTable},\n ray::Ray,\n rtweekend::random_int,\n vec3::Point3,\n};\nuse std::{cmp::Ordering, sync::Arc};\n\n#[derive(Clone)]\npub struct BVHNode {\n left: Arc<dyn HitTable>,\n right: Arc<dyn HitTable>,\n bvhbox: AABB,\n}\n\nimpl BVHNode {\n pub fn new(\n objects: &mut Vec<Arc<dyn HitTable>>,\n start: usize,\n end: usize,\n time0: f64,\n time1: f64,\n ) -> Self {\n let axis = random_int(0, 3);\n let mut tmp: BVHNode;\n let comparator = if axis == 0 {\n box_x_compare\n } else if axis == 1 {\n box_y_compare\n } else {\n box_z_compare\n };\n let object_span = end - start;\n if object_span == 1 {\n tmp = BVHNode {\n left: objects[start].clone(),\n right: objects[start].clone(),\n bvhbox: AABB::new(Point3::zero(), Point3::zero()),\n };\n } else if object_span == 2 {\n if comparator(&objects[start], &objects[start + 1]) == Ordering::Less {\n tmp = BVHNode {\n left: objects[start].clone(),\n right: objects[start + 1].clone(),\n bvhbox: AABB::new(Point3::zero(), Point3::zero()),\n };\n } else {\n tmp = BVHNode {\n left: objects[start + 1].clone(),\n right: objects[start].clone(),\n bvhbox: AABB::new(Point3::zero(), Point3::zero()),\n };\n }\n } else {\n objects.as_mut_slice()[start..end].sort_by(comparator);\n let mid = start + object_span / 2;\n tmp = BVHNode {\n left: Arc::new(BVHNode::new(objects, start, mid, time0, time1)),\n right: Arc::new(BVHNode::new(objects, mid, end, time0, time1)),\n bvhbox: AABB::new(Point3::zero(), Point3::zero()),\n };\n }\n let mut box_left = AABB::new(Point3::zero(), Point3::zero());\n let mut box_right = AABB::new(Point3::zero(), Point3::zero());\n if !tmp.left.bounding_box(time0, time1, &mut box_left)\n || !tmp.right.bounding_box(time0, time1, &mut box_right)\n {\n println!(\"No bounding box in bvh_node constructor.\\n\");\n }\n tmp.bvhbox = AABB::surrounding_box(&box_left, &box_right);\n tmp\n }\n}\n\npub fn box_x_compare(a: &Arc<dyn HitTable>, b: &Arc<dyn HitTable>) -> Ordering {\n let mut box_a = AABB::new(Point3::zero(), Point3::zero());\n let mut box_b = AABB::new(Point3::zero(), Point3::zero());\n if !a.bounding_box(0.0, 0.0, &mut box_a) || !b.bounding_box(0.0, 0.0, &mut box_b) {\n println!(\"No bounding box in bvh_node constructor.\\n\");\n }\n if box_a._min.x < box_b._min.x {\n return Ordering::Less;\n } else if box_a._min.x > box_b._min.x {\n return Ordering::Greater;\n }\n Ordering::Equal\n}\n\npub fn box_y_compare(a: &Arc<dyn HitTable>, b: &Arc<dyn HitTable>) -> Ordering {\n let mut box_a = AABB::new(Point3::zero(), Point3::zero());\n let mut box_b = AABB::new(Point3::zero(), Point3::zero());\n if !a.bounding_box(0.0, 0.0, &mut box_a) || !b.bounding_box(0.0, 0.0, &mut box_b) {\n println!(\"No bounding box in bvh_node constructor.\\n\");\n }\n if box_a._min.y < box_b._min.y {\n return Ordering::Less;\n } else if box_a._min.y > box_b._min.y {\n return Ordering::Greater;\n }\n Ordering::Equal\n}\n\npub fn box_z_compare(a: &Arc<dyn HitTable>, b: &Arc<dyn HitTable>) -> Ordering {\n let mut box_a = AABB::new(Point3::zero(), Point3::zero());\n let mut box_b = AABB::new(Point3::zero(), Point3::zero());\n if !a.bounding_box(0.0, 0.0, &mut box_a) || !b.bounding_box(0.0, 0.0, &mut box_b) {\n println!(\"No bounding box in bvh_node constructor.\\n\");\n }\n if box_a._min.z < box_b._min.z {\n return Ordering::Less;\n } else if box_a._min.z > box_b._min.z {\n return Ordering::Greater;\n }\n Ordering::Equal\n}\n\nimpl HitTable for BVHNode {\n fn hit(&self, r: &Ray, t_min: f64, t_max: f64, rec: &mut HitRecord) -> bool {\n if !self.bvhbox.hit(r, t_min, t_max) {\n return false;\n }\n let hit_left = self.left.hit(r, t_min, t_max, rec);\n let hit_right = self\n .right\n .hit(r, t_min, if hit_left { rec.t } else { t_max }, rec);\n hit_left || hit_right\n }\n fn bounding_box(&self, _t0: f64, _t1: f64, output_box: &mut AABB) -> bool {\n *output_box = self.bvhbox.clone();\n true\n }\n fn distance(&self, _other_center: &Point3) -> f64 {\n 0.0\n }\n}\n"},"prefix":{"kind":"string","value":"use crate::{\n aabb::AABB,\n hittable::{HitRecord, HitTable},\n ray::Ray,\n rtweekend::random_int,\n vec3::Point3,\n};\nuse std::{cmp::Ordering, sync::Arc};\n\n#[derive(Clone)]\npub struct BVHNode {\n left: Arc<dyn HitTable>,\n right: Arc<dyn HitTable>,\n bvhbox: AABB,\n}\n\nimpl BVHNode {\n pub fn new(\n objects: &mut Vec<Arc<dyn HitTable>>,\n start: usize,\n end: usize,\n time0: f64,\n time1: f64,\n ) -> Self {\n let axis = random_int(0, 3);\n let mut tmp: BVHNode;\n let comparator = if axis == 0 {\n box_x_compare\n } else if axis == 1 {\n box_y_compare\n } else {\n box_z_compare\n };\n let object_span = end - start;\n if object_span == 1 {\n "},"suffix":{"kind":"string","value":"tor(&objects[start], &objects[start + 1]) == Ordering::Less {\n tmp = BVHNode {\n left: objects[start].clone(),\n right: objects[start + 1].clone(),\n bvhbox: AABB::new(Point3::zero(), Point3::zero()),\n };\n } else {\n tmp = BVHNode {\n left: objects[start + 1].clone(),\n right: objects[start].clone(),\n bvhbox: AABB::new(Point3::zero(), Point3::zero()),\n };\n }\n } else {\n objects.as_mut_slice()[start..end].sort_by(comparator);\n let mid = start + object_span / 2;\n tmp = BVHNode {\n left: Arc::new(BVHNode::new(objects, start, mid, time0, time1)),\n right: Arc::new(BVHNode::new(objects, mid, end, time0, time1)),\n bvhbox: AABB::new(Point3::zero(), Point3::zero()),\n };\n }\n let mut box_left = AABB::new(Point3::zero(), Point3::zero());\n let mut box_right = AABB::new(Point3::zero(), Point3::zero());\n if !tmp.left.bounding_box(time0, time1, &mut box_left)\n || !tmp.right.bounding_box(time0, time1, &mut box_right)\n {\n println!(\"No bounding box in bvh_node constructor.\\n\");\n }\n tmp.bvhbox = AABB::surrounding_box(&box_left, &box_right);\n tmp\n }\n}\n\npub fn box_x_compare(a: &Arc<dyn HitTable>, b: &Arc<dyn HitTable>) -> Ordering {\n let mut box_a = AABB::new(Point3::zero(), Point3::zero());\n let mut box_b = AABB::new(Point3::zero(), Point3::zero());\n if !a.bounding_box(0.0, 0.0, &mut box_a) || !b.bounding_box(0.0, 0.0, &mut box_b) {\n println!(\"No bounding box in bvh_node constructor.\\n\");\n }\n if box_a._min.x < box_b._min.x {\n return Ordering::Less;\n } else if box_a._min.x > box_b._min.x {\n return Ordering::Greater;\n }\n Ordering::Equal\n}\n\npub fn box_y_compare(a: &Arc<dyn HitTable>, b: &Arc<dyn HitTable>) -> Ordering {\n let mut box_a = AABB::new(Point3::zero(), Point3::zero());\n let mut box_b = AABB::new(Point3::zero(), Point3::zero());\n if !a.bounding_box(0.0, 0.0, &mut box_a) || !b.bounding_box(0.0, 0.0, &mut box_b) {\n println!(\"No bounding box in bvh_node constructor.\\n\");\n }\n if box_a._min.y < box_b._min.y {\n return Ordering::Less;\n } else if box_a._min.y > box_b._min.y {\n return Ordering::Greater;\n }\n Ordering::Equal\n}\n\npub fn box_z_compare(a: &Arc<dyn HitTable>, b: &Arc<dyn HitTable>) -> Ordering {\n let mut box_a = AABB::new(Point3::zero(), Point3::zero());\n let mut box_b = AABB::new(Point3::zero(), Point3::zero());\n if !a.bounding_box(0.0, 0.0, &mut box_a) || !b.bounding_box(0.0, 0.0, &mut box_b) {\n println!(\"No bounding box in bvh_node constructor.\\n\");\n }\n if box_a._min.z < box_b._min.z {\n return Ordering::Less;\n } else if box_a._min.z > box_b._min.z {\n return Ordering::Greater;\n }\n Ordering::Equal\n}\n\nimpl HitTable for BVHNode {\n fn hit(&self, r: &Ray, t_min: f64, t_max: f64, rec: &mut HitRecord) -> bool {\n if !self.bvhbox.hit(r, t_min, t_max) {\n return false;\n }\n let hit_left = self.left.hit(r, t_min, t_max, rec);\n let hit_right = self\n .right\n .hit(r, t_min, if hit_left { rec.t } else { t_max }, rec);\n hit_left || hit_right\n }\n fn bounding_box(&self, _t0: f64, _t1: f64, output_box: &mut AABB) -> bool {\n *output_box = self.bvhbox.clone();\n true\n }\n fn distance(&self, _other_center: &Point3) -> f64 {\n 0.0\n }\n}\n"},"middle":{"kind":"string","value":" tmp = BVHNode {\n left: objects[start].clone(),\n right: objects[start].clone(),\n bvhbox: AABB::new(Point3::zero(), Point3::zero()),\n };\n } else if object_span == 2 {\n if compara"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":994,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"devices/src/virtio/video/decoder/capability.rs"},"repo_name":{"kind":"string","value":"aosp-riscv/platform_external_crosvm"},"commit":{"kind":"string","value":"ff681b6a18eff76336a68058c11afdc287255615"},"file_code":{"kind":"string","value":"\n\nuse base::warn;\nuse std::collections::btree_map::Entry;\nuse std::collections::BTreeMap;\n\nuse crate::virtio::video::control::*;\nuse crate::virtio::video::format::*;\n\nfn from_pixel_format(\n fmt: &libvda::PixelFormat,\n mask: u64,\n width_range: FormatRange,\n height_range: FormatRange,\n) -> FormatDesc {\n let format = match fmt {\n libvda::PixelFormat::NV12 => Format::NV12,\n libvda::PixelFormat::YV12 => Format::YUV420,\n };\n\n let frame_formats = vec![FrameFormat {\n width: width_range,\n height: height_range,\n bitrates: Vec::new(),\n }];\n\n FormatDesc {\n mask,\n format,\n frame_formats,\n }\n}\n\npub struct Capability {\n pub in_fmts: Vec<FormatDesc>,\n pub out_fmts: Vec<FormatDesc>,\n\n \n profiles: BTreeMap<Format, Vec<Profile>>,\n levels: BTreeMap<Format, Vec<Level>>,\n}\n\nimpl Capability {\n pub fn new(caps: &libvda::decode::Capabilities) -> Self {\n \n \n let mask = !(u64::max_value() << caps.output_formats.len());\n\n let mut in_fmts = vec![];\n let mut profiles: BTreeMap<Format, Vec<Profile>> = Default::default();\n for fmt in caps.input_formats.iter() {\n match Profile::from_libvda_profile(fmt.profile) {\n Some(profile) => {\n let format = profile.to_format();\n in_fmts.push(FormatDesc {\n mask,\n format,\n frame_formats: vec![Default::default()],\n });\n match profiles.entry(format) {\n Entry::Occupied(mut e) => e.get_mut().push(profile),\n Entry::Vacant(e) => {\n e.insert(vec![profile]);\n }\n }\n }\n None => {\n warn!(\n \"No virtio-video equivalent for libvda profile, skipping: {:?}\",\n fmt.profile\n );\n }\n }\n }\n\n let levels: BTreeMap<Format, Vec<Level>> = if profiles.contains_key(&Format::H264) {\n \n vec![(Format::H264, vec![Level::H264_1_0])]\n .into_iter()\n .collect()\n } else {\n Default::default()\n };\n\n \n \n \n \n let min_width = caps.input_formats.iter().map(|fmt| fmt.min_width).max();\n let max_width = caps.input_formats.iter().map(|fmt| fmt.max_width).min();\n let min_height = caps.input_formats.iter().map(|fmt| fmt.min_height).max();\n let max_height = caps.input_formats.iter().map(|fmt| fmt.max_height).min();\n let width_range = FormatRange {\n min: min_width.unwrap_or(0),\n max: max_width.unwrap_or(0),\n step: 1,\n };\n let height_range = FormatRange {\n min: min_height.unwrap_or(0),\n max: max_height.unwrap_or(0),\n step: 1,\n };\n\n \n \n let mask = !(u64::max_value() << caps.input_formats.len());\n let out_fmts = caps\n .output_formats\n .iter()\n .map(|fmt| from_pixel_format(fmt, mask, width_range, height_range))\n .collect();\n\n Capability {\n in_fmts,\n out_fmts,\n profiles,\n levels,\n }\n }\n\n pub fn query_control(&self, t: &QueryCtrlType) -> Option<QueryCtrlResponse> {\n use QueryCtrlType::*;\n match *t {\n Profile(fmt) => {\n let profiles = self.profiles.get(&fmt)?;\n Some(QueryCtrlResponse::Profile(\n profiles.iter().copied().collect(),\n ))\n }\n Level(fmt) => {\n let levels = self.levels.get(&fmt)?;\n Some(QueryCtrlResponse::Level(levels.iter().copied().collect()))\n }\n }\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse base::warn;\nuse std::collections::btree_map::Entry;\nuse std::collections::BTreeMap;\n\nuse crate::virtio::video::control::*;\nuse crate::virtio::video::format::*;\n\nfn from_pixel_format(\n fmt: &libvda::PixelFormat,\n mask: u64,\n width_range: FormatRange,\n height_range: FormatRange,\n) -> FormatDesc {\n let format = match fmt {\n libvda::PixelFormat::NV12 => Format::NV12,\n libvda::PixelFormat::YV12 => Format::YUV420,\n };\n\n let frame_formats = vec![FrameFormat {\n width: width_range,\n height: height_range,\n bitrates: Vec::new(),\n }];\n\n FormatDesc {\n mask,\n format,\n frame_formats,\n }\n}\n\npub struct Capability {\n pub in_fmts: Vec<FormatDesc>,\n pub out_fmts: Vec<FormatDesc>,\n\n \n profiles: BTreeMap<Format, Vec<Profile>>,\n levels: BTreeMap<Format, Vec<Level>>,\n}\n\nimpl Capability {\n pub fn new(caps: &libvda::decode::Capabilities) -> Self {\n \n \n let mask = !(u64::max_value() << caps.output_formats.len());\n\n let mut in_fmts = vec![];\n let mut profiles: BTreeMap<Format, Vec<Profile>> = Default::default();\n for fmt in caps.input_formats.iter() {\n match Profile::from_libvda_profile(fmt.profile) {\n Some(profile) => {\n let format = profile.to_format();\n in_fmts.push(FormatDesc {\n mask,\n format,\n frame_formats: vec![Default::default()],\n });\n match profiles.entry(format) {\n Entry::Occupied(mut e) => e.get_mut().push(profile),\n Entry::Vacant(e) => {\n e.insert(vec![profile]);\n }\n }\n }\n None => {\n warn!(\n \"No virtio-video equivalent for libvda profile, skipping: {:?}\",\n fmt.profile\n );\n }\n }\n "},"suffix":{"kind":"string","value":"nge, height_range))\n .collect();\n\n Capability {\n in_fmts,\n out_fmts,\n profiles,\n levels,\n }\n }\n\n pub fn query_control(&self, t: &QueryCtrlType) -> Option<QueryCtrlResponse> {\n use QueryCtrlType::*;\n match *t {\n Profile(fmt) => {\n let profiles = self.profiles.get(&fmt)?;\n Some(QueryCtrlResponse::Profile(\n profiles.iter().copied().collect(),\n ))\n }\n Level(fmt) => {\n let levels = self.levels.get(&fmt)?;\n Some(QueryCtrlResponse::Level(levels.iter().copied().collect()))\n }\n }\n }\n}\n"},"middle":{"kind":"string","value":" }\n\n let levels: BTreeMap<Format, Vec<Level>> = if profiles.contains_key(&Format::H264) {\n \n vec![(Format::H264, vec![Level::H264_1_0])]\n .into_iter()\n .collect()\n } else {\n Default::default()\n };\n\n \n \n \n \n let min_width = caps.input_formats.iter().map(|fmt| fmt.min_width).max();\n let max_width = caps.input_formats.iter().map(|fmt| fmt.max_width).min();\n let min_height = caps.input_formats.iter().map(|fmt| fmt.min_height).max();\n let max_height = caps.input_formats.iter().map(|fmt| fmt.max_height).min();\n let width_range = FormatRange {\n min: min_width.unwrap_or(0),\n max: max_width.unwrap_or(0),\n step: 1,\n };\n let height_range = FormatRange {\n min: min_height.unwrap_or(0),\n max: max_height.unwrap_or(0),\n step: 1,\n };\n\n \n \n let mask = !(u64::max_value() << caps.input_formats.len());\n let out_fmts = caps\n .output_formats\n .iter()\n .map(|fmt| from_pixel_format(fmt, mask, width_ra"},"strategy":{"kind":"string","value":"random"},"context_items":{"kind":"list like","value":[{"content":"/// Returns a Vec of the valid memory addresses.\n\n/// These should be used to configure the GuestMemory structure for the platfrom.\n\npub fn arch_memory_regions(size: u64) -> Vec<(GuestAddress, u64)> {\n\n vec![(GuestAddress(AARCH64_PHYS_MEM_START), size)]\n\n}\n\n\n","file_path":"aarch64/src/lib.rs","rank":0,"score":321065.8048601196},{"content":"/// Helper function to wrap up a closure with fail handle. The fail handle will be triggered if the\n\n/// closure returns an error.\n\npub fn fallible_closure<E: std::fmt::Display, C: FnMut() -> Result<(), E> + 'static + Send>(\n\n fail_handle: Arc<dyn FailHandle>,\n\n mut callback: C,\n\n) -> impl FnMut() + 'static + Send {\n\n move || match callback() {\n\n Ok(()) => {}\n\n Err(e) => {\n\n error!(\"callback failed {}\", e);\n\n fail_handle.fail();\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n use std::sync::{Arc, Mutex};\n\n\n\n fn task(_: RingBufferStopCallback) {}\n\n\n","file_path":"devices/src/usb/xhci/ring_buffer_stop_cb.rs","rank":1,"score":315007.1257591103},{"content":"/// Does the same as push_fds, but using the RawDescriptorType\n\npub fn push_descriptors(descriptors: &mut Vec<RawDescriptor>) {\n\n push_fds(descriptors)\n\n}\n\n\n","file_path":"sys_util/src/syslog.rs","rank":2,"score":304844.5186512809},{"content":"/// Retrieves the file descriptors owned by the global syslogger.\n\n///\n\n/// Does nothing if syslog was never initialized. If their are any file descriptors, they will be\n\n/// pushed into `fds`.\n\n///\n\n/// Note that the `stderr` file descriptor is never added, as it is not owned by syslog.\n\npub fn push_fds(fds: &mut Vec<RawFd>) {\n\n let state = lock!();\n\n state.syslog.push_fds(fds);\n\n fds.extend(state.file.iter().map(|f| f.as_raw_fd()));\n\n}\n\n\n","file_path":"sys_util/src/syslog.rs","rank":3,"score":304838.06589525647},{"content":"/// Instantiates a VirtioInputConfig object with the default configuration for a trackpad. It\n\n/// supports touch, left button and right button events, as well as X and Y axis.\n\npub fn new_trackpad_config(width: u32, height: u32) -> VirtioInputConfig {\n\n VirtioInputConfig::new(\n\n virtio_input_device_ids::new(0, 0, 0, 0),\n\n b\"Crosvm Virtio Trackpad\".to_vec(),\n\n b\"virtio-trackpad\".to_vec(),\n\n virtio_input_bitmap::new([0u8; 128]),\n\n default_trackpad_events(),\n\n default_trackpad_absinfo(width, height),\n\n )\n\n}\n\n\n","file_path":"devices/src/virtio/input/defaults.rs","rank":4,"score":281455.6090706681},{"content":"/// Copy virtio device configuration data from a subslice of `src` to a subslice of `dst`.\n\n/// Unlike std::slice::copy_from_slice(), this function copies as much as possible within\n\n/// the common subset of the two slices, truncating the requested range instead of\n\n/// panicking if the slices do not match in size.\n\n///\n\n/// `dst_offset` and `src_offset` specify the starting indexes of the `dst` and `src`\n\n/// slices, respectively; if either index is out of bounds, this function is a no-op\n\n/// rather than panicking. This makes it safe to call with arbitrary user-controlled\n\n/// inputs.\n\npub fn copy_config(dst: &mut [u8], dst_offset: u64, src: &[u8], src_offset: u64) {\n\n if let Ok(dst_offset) = usize::try_from(dst_offset) {\n\n if let Ok(src_offset) = usize::try_from(src_offset) {\n\n if let Some(dst_slice) = dst.get_mut(dst_offset..) {\n\n if let Some(src_slice) = src.get(src_offset..) {\n\n let len = cmp::min(dst_slice.len(), src_slice.len());\n\n let dst_subslice = &mut dst_slice[0..len];\n\n let src_subslice = &src_slice[0..len];\n\n dst_subslice.copy_from_slice(src_subslice);\n\n }\n\n }\n\n }\n\n }\n\n}\n\n\n","file_path":"devices/src/virtio/mod.rs","rank":5,"score":279545.2904768888},{"content":"/// Instantiates a VirtioInputConfig object with the default configuration for a multitouch\n\n/// touchscreen.\n\npub fn new_multi_touch_config(width: u32, height: u32) -> VirtioInputConfig {\n\n VirtioInputConfig::new(\n\n virtio_input_device_ids::new(0, 0, 0, 0),\n\n b\"Crosvm Virtio Multitouch Touchscreen\".to_vec(),\n\n b\"virtio-touchscreen\".to_vec(),\n\n virtio_input_bitmap::from_bits(&[INPUT_PROP_DIRECT]),\n\n default_multitouchscreen_events(),\n\n default_multitouchscreen_absinfo(width, height, 10, 10),\n\n )\n\n}\n\n\n","file_path":"devices/src/virtio/input/defaults.rs","rank":6,"score":277807.93345490645},{"content":"/// Instantiates a VirtioInputConfig object with the default configuration for a touchscreen (no\n\n/// multitouch support).\n\npub fn new_single_touch_config(width: u32, height: u32) -> VirtioInputConfig {\n\n VirtioInputConfig::new(\n\n virtio_input_device_ids::new(0, 0, 0, 0),\n\n b\"Crosvm Virtio Touchscreen\".to_vec(),\n\n b\"virtio-touchscreen\".to_vec(),\n\n virtio_input_bitmap::from_bits(&[INPUT_PROP_DIRECT]),\n\n default_touchscreen_events(),\n\n default_touchscreen_absinfo(width, height),\n\n )\n\n}\n\n\n","file_path":"devices/src/virtio/input/defaults.rs","rank":7,"score":277807.93345490645},{"content":"// For the specified (Base, Len), returns (base, len) pair which could be\n\n// set into mtrr register. mtrr requires: the base-address alignment value can't be\n\n// less than its length\n\nfn get_mtrr_pairs(base: u64, len: u64) -> Vec<(u64, u64)> {\n\n let mut vecs = Vec::new();\n\n\n\n let mut remains = len;\n\n let mut new = base;\n\n while remains != 0 {\n\n let max = get_max_len(new, remains);\n\n vecs.push((new, max));\n\n remains -= max;\n\n new += max;\n\n }\n\n\n\n vecs\n\n}\n\n\n","file_path":"x86_64/src/regs.rs","rank":8,"score":266523.9820278699},{"content":"fn append_mtrr_entries(vpu: &dyn VcpuX86_64, pci_start: u64, entries: &mut Vec<Register>) {\n\n // Get VAR MTRR num from MSR_MTRRcap\n\n let mut msrs = vec![Register {\n\n id: crate::msr_index::MSR_MTRRcap,\n\n ..Default::default()\n\n }];\n\n if vpu.get_msrs(&mut msrs).is_err() {\n\n warn!(\"get msrs fail, guest with pass through device may be very slow\");\n\n return;\n\n }\n\n let var_num = msrs[0].value & VAR_MTRR_NUM_MASK;\n\n\n\n // Set pci_start .. 4G as UC\n\n // all others are set to default WB\n\n let pci_len = (1 << 32) - pci_start;\n\n let vecs = get_mtrr_pairs(pci_start, pci_len);\n\n if vecs.len() as u64 > var_num {\n\n warn!(\n\n \"mtrr fail for pci mmio, please check pci_start addr,\n\n guest with pass through device may be very slow\"\n","file_path":"x86_64/src/regs.rs","rank":9,"score":260584.29370246537},{"content":"// Reads the next u64 from the file.\n\nfn read_u64_from_file(mut f: &File) -> Result<u64> {\n\n let mut value = [0u8; 8];\n\n (&mut f)\n\n .read_exact(&mut value)\n\n .map_err(Error::ReadingHeader)?;\n\n Ok(u64::from_be_bytes(value))\n\n}\n\n\n\nimpl QcowHeader {\n\n /// Creates a QcowHeader from a reference to a file.\n\n pub fn new(f: &mut File) -> Result<QcowHeader> {\n\n f.seek(SeekFrom::Start(0)).map_err(Error::ReadingHeader)?;\n\n\n\n let magic = read_u32_from_file(f)?;\n\n if magic != QCOW_MAGIC {\n\n return Err(Error::InvalidMagic);\n\n }\n\n\n\n let mut header = QcowHeader {\n\n magic,\n","file_path":"disk/src/qcow/mod.rs","rank":10,"score":246513.91643149132},{"content":"/// Returns a Vec of the valid memory addresses.\n\n/// These should be used to configure the GuestMemory structure for the platform.\n\n/// For x86_64 all addresses are valid from the start of the kernel except a\n\n/// carve out at the end of 32bit address space.\n\nfn arch_memory_regions(size: u64, bios_size: Option<u64>) -> Vec<(GuestAddress, u64)> {\n\n let mem_end = GuestAddress(size);\n\n let first_addr_past_32bits = GuestAddress(FIRST_ADDR_PAST_32BITS);\n\n let end_32bit_gap_start = GuestAddress(END_ADDR_BEFORE_32BITS);\n\n\n\n let mut regions = Vec::new();\n\n if mem_end <= end_32bit_gap_start {\n\n regions.push((GuestAddress(0), size));\n\n if let Some(bios_size) = bios_size {\n\n regions.push((bios_start(bios_size), bios_size));\n\n }\n\n } else {\n\n regions.push((GuestAddress(0), end_32bit_gap_start.offset()));\n\n if let Some(bios_size) = bios_size {\n\n regions.push((bios_start(bios_size), bios_size));\n\n }\n\n regions.push((\n\n first_addr_past_32bits,\n\n mem_end.offset_from(end_32bit_gap_start),\n\n ));\n","file_path":"x86_64/src/lib.rs","rank":11,"score":244626.96961802477},{"content":"fn read_u64<T: Read>(readable: &mut T) -> u64 {\n\n let mut buf = [0u8; size_of::<u64>()];\n\n readable.read_exact(&mut buf[..]).unwrap();\n\n u64::from_le_bytes(buf)\n\n}\n","file_path":"fuzz/block_fuzzer.rs","rank":12,"score":241066.2587728423},{"content":"fn read_u64<T: Read>(readable: &mut T) -> u64 {\n\n let mut buf = [0u8; size_of::<u64>()];\n\n readable.read_exact(&mut buf[..]).unwrap();\n\n u64::from_le_bytes(buf)\n\n}\n","file_path":"fuzz/qcow_fuzzer.rs","rank":13,"score":241066.2587728423},{"content":"/// Drops all capabilities (permitted, inheritable, and effective) from the current process.\n\npub fn drop_capabilities() -> Result<()> {\n\n unsafe {\n\n // Safe because we do not actually manipulate any memory handled by libcap\n\n // and we check errors.\n\n let caps = cap_init();\n\n if caps.is_null() {\n\n return errno_result();\n\n }\n\n\n\n // Freshly initialized capabilities do not have any bits set, so applying them\n\n // will drop all capabilities from the process.\n\n // Safe because we will check the result and otherwise do not touch the memory.\n\n let ret = cap_set_proc(caps);\n\n // We need to free capabilities regardless of success of the operation above.\n\n cap_free(caps);\n\n // Now check if we managed to apply (drop) capabilities.\n\n if ret < 0 {\n\n return errno_result();\n\n }\n\n }\n\n Ok(())\n\n}\n","file_path":"sys_util/src/capabilities.rs","rank":15,"score":239129.78298568385},{"content":"/// Allows the use of any serde deserializer within a closure while providing access to the a set of\n\n/// descriptors for use in `deserialize_descriptor`.\n\n///\n\n/// This is the corresponding call to use deserialize after using `SerializeDescriptors`.\n\n///\n\n/// If `deserialize_with_descriptors` is called anywhere within the given closure, it return an\n\n/// error.\n\npub fn deserialize_with_descriptors<F, T, E>(\n\n f: F,\n\n descriptors: &mut Vec<Option<SafeDescriptor>>,\n\n) -> Result<T, E>\n\nwhere\n\n F: FnOnce() -> Result<T, E>,\n\n E: de::Error,\n\n{\n\n let swap_descriptors = std::mem::take(descriptors);\n\n set_descriptor_src(swap_descriptors).map_err(E::custom)?;\n\n\n\n // catch_unwind is used to ensure that set_descriptor_src is always balanced with a call to\n\n // take_descriptor_src afterwards.\n\n let res = catch_unwind(AssertUnwindSafe(f));\n\n\n\n // unwrap is used because set_descriptor_src is always called before this, so it should never\n\n // panic.\n\n *descriptors = take_descriptor_src().unwrap();\n\n\n\n match res {\n","file_path":"sys_util/src/descriptor_reflection.rs","rank":16,"score":237268.93405673082},{"content":"#[doc(hidden)]\n\n#[inline]\n\npub fn max<T: BitFieldSpecifier>() -> u64 {\n\n if T::FIELD_WIDTH < 64 {\n\n (1 << T::FIELD_WIDTH) - 1\n\n } else {\n\n u64::max_value()\n\n }\n\n}\n\n\n\n// Defines bit_field::BitField0 through bit_field::BitField64.\n\nbit_field_derive::define_bit_field_specifiers!();\n\n\n\nimpl BitFieldSpecifier for bool {\n\n const FIELD_WIDTH: u8 = 1;\n\n type SetterType = bool;\n\n type GetterType = bool;\n\n\n\n #[inline]\n\n fn from_u64(val: u64) -> Self::GetterType {\n\n val > 0\n\n }\n","file_path":"bit_field/src/lib.rs","rank":17,"score":237050.53350922512},{"content":"// Strips any `user.virtiofs.` prefix from `buf`. If buf contains one or more nul-bytes, each\n\n// nul-byte-separated slice is treated as a C string and the prefix is stripped from each one.\n\nfn strip_xattr_prefix(buf: &mut Vec<u8>) {\n\n fn next_cstr(b: &[u8], start: usize) -> Option<&[u8]> {\n\n if start >= b.len() {\n\n return None;\n\n }\n\n\n\n let end = b[start..]\n\n .iter()\n\n .position(|&c| c == b'\\0')\n\n .map(|p| start + p + 1)\n\n .unwrap_or(b.len());\n\n\n\n Some(&b[start..end])\n\n }\n\n\n\n let mut pos = 0;\n\n while let Some(name) = next_cstr(&buf, pos) {\n\n if !name.starts_with(USER_VIRTIOFS_XATTR) {\n\n pos += name.len();\n\n continue;\n","file_path":"devices/src/virtio/fs/passthrough.rs","rank":18,"score":234363.23688900663},{"content":"/// Fills `output` completely with random bytes from the specified `source`.\n\npub fn rand_bytes(mut output: &mut [u8], source: Source) -> Result<()> {\n\n if output.is_empty() {\n\n return Ok(());\n\n }\n\n\n\n loop {\n\n // Safe because output is mutable and the writes are limited by output.len().\n\n let bytes = handle_eintr_errno!(unsafe {\n\n libc::getrandom(\n\n output.as_mut_ptr() as *mut c_void,\n\n output.len(),\n\n source.to_getrandom_flags(),\n\n )\n\n });\n\n\n\n if bytes < 0 {\n\n return errno_result();\n\n }\n\n if bytes as usize == output.len() {\n\n return Ok(());\n\n }\n\n\n\n // Wait for more entropy and try again for the remaining bytes.\n\n sleep(POLL_INTERVAL);\n\n output = &mut output[bytes as usize..];\n\n }\n\n}\n\n\n","file_path":"sys_util/src/rand.rs","rank":19,"score":234297.16211588396},{"content":"fn convert_copy<R, W>(reader: &mut R, writer: &mut W, offset: u64, size: u64) -> Result<()>\n\nwhere\n\n R: Read + Seek,\n\n W: Write + Seek,\n\n{\n\n const CHUNK_SIZE: usize = 65536;\n\n let mut buf = [0; CHUNK_SIZE];\n\n let mut read_count = 0;\n\n reader\n\n .seek(SeekFrom::Start(offset))\n\n .map_err(Error::SeekingFile)?;\n\n writer\n\n .seek(SeekFrom::Start(offset))\n\n .map_err(Error::SeekingFile)?;\n\n loop {\n\n let this_count = min(CHUNK_SIZE as u64, size - read_count) as usize;\n\n let nread = reader\n\n .read(&mut buf[..this_count])\n\n .map_err(Error::ReadingData)?;\n\n writer.write(&buf[..nread]).map_err(Error::WritingData)?;\n\n read_count += nread as u64;\n\n if nread == 0 || read_count == size {\n\n break;\n\n }\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"disk/src/disk.rs","rank":20,"score":234174.32229302704},{"content":"/// Retrieves the signal mask of the current thread as a vector of c_ints.\n\npub fn get_blocked_signals() -> SignalResult<Vec<c_int>> {\n\n let mut mask = Vec::new();\n\n\n\n // Safe - return values are checked.\n\n unsafe {\n\n let mut old_sigset: sigset_t = mem::zeroed();\n\n let ret = pthread_sigmask(SIG_BLOCK, null(), &mut old_sigset as *mut sigset_t);\n\n if ret < 0 {\n\n return Err(Error::RetrieveSignalMask(ret));\n\n }\n\n\n\n for num in 0..=SIGRTMAX() {\n\n if sigismember(&old_sigset, num) > 0 {\n\n mask.push(num);\n\n }\n\n }\n\n }\n\n\n\n Ok(mask)\n\n}\n\n\n","file_path":"sys_util/src/signal.rs","rank":21,"score":233706.17294795119},{"content":"/// Enables real time thread priorities in the current thread up to `limit`.\n\npub fn set_rt_prio_limit(limit: u64) -> Result<()> {\n\n let rt_limit_arg = libc::rlimit {\n\n rlim_cur: limit as libc::rlim_t,\n\n rlim_max: limit as libc::rlim_t,\n\n };\n\n // Safe because the kernel doesn't modify memory that is accessible to the process here.\n\n let res = unsafe { libc::setrlimit(libc::RLIMIT_RTPRIO, &rt_limit_arg) };\n\n\n\n if res != 0 {\n\n errno_result()\n\n } else {\n\n Ok(())\n\n }\n\n}\n\n\n","file_path":"sys_util/src/priority.rs","rank":22,"score":233592.66616579602},{"content":"/// Returns the set of reserved base features common to all virtio devices.\n\npub fn base_features(protected_vm: ProtectionType) -> u64 {\n\n let mut features: u64 = 1 << VIRTIO_F_VERSION_1;\n\n\n\n if protected_vm == ProtectionType::Protected {\n\n features |= 1 << VIRTIO_F_ACCESS_PLATFORM;\n\n }\n\n\n\n features\n\n}\n","file_path":"devices/src/virtio/mod.rs","rank":23,"score":233592.66616579602},{"content":"fn set_features(vu: &mut Master, avail_features: u64, ack_features: u64) -> Result<u64> {\n\n let features = avail_features & ack_features;\n\n vu.set_features(features).map_err(Error::SetFeatures)?;\n\n Ok(features)\n\n}\n\n\n\npub struct VhostUserHandler {\n\n vu: Master,\n\n pub avail_features: u64,\n\n acked_features: u64,\n\n protocol_features: VhostUserProtocolFeatures,\n\n}\n\n\n\nimpl VhostUserHandler {\n\n /// Creates a `VhostUserHandler` instance with features and protocol features initialized.\n\n pub fn new(\n\n mut vu: Master,\n\n allow_features: u64,\n\n init_features: u64,\n\n allow_protocol_features: VhostUserProtocolFeatures,\n","file_path":"devices/src/virtio/vhost/user/handler.rs","rank":24,"score":233130.58169376486},{"content":"/// Parses a slice of valid frame formats and the desired resolution\n\n/// and returns the closest available resolution.\n\npub fn find_closest_resolution(\n\n frame_formats: &[FrameFormat],\n\n desired_width: u32,\n\n desired_height: u32,\n\n) -> (u32, u32) {\n\n for FrameFormat { width, height, .. } in frame_formats.iter() {\n\n if desired_width < width.min || desired_width > width.max {\n\n continue;\n\n }\n\n if desired_height < height.min || desired_height > height.max {\n\n continue;\n\n }\n\n let allowed_width = clamp_size(desired_width, width.min, width.step);\n\n let allowed_height = clamp_size(desired_height, height.min, height.step);\n\n return (allowed_width, allowed_height);\n\n }\n\n\n\n // Return the resolution with maximum surface if nothing better is found.\n\n match frame_formats\n\n .iter()\n","file_path":"devices/src/virtio/video/format.rs","rank":25,"score":226884.98740649916},{"content":"fn create_integer(v: usize, bytes: &mut Vec<u8>) {\n\n if v <= u8::max_value().into() {\n\n (v as u8).to_aml_bytes(bytes);\n\n } else if v <= u16::max_value().into() {\n\n (v as u16).to_aml_bytes(bytes);\n\n } else if v <= u32::max_value() as usize {\n\n (v as u32).to_aml_bytes(bytes);\n\n } else {\n\n (v as u64).to_aml_bytes(bytes);\n\n }\n\n}\n\n\n\npub type Usize = usize;\n\n\n\nimpl Aml for Usize {\n\n fn to_aml_bytes(&self, bytes: &mut Vec<u8>) {\n\n create_integer(*self, bytes);\n\n }\n\n}\n\n\n","file_path":"acpi_tables/src/aml.rs","rank":26,"score":226196.26416858245},{"content":"pub fn gdb_thread(mut gdbstub: GdbStub, port: u32) {\n\n let addr = format!(\"0.0.0.0:{}\", port);\n\n let listener = match TcpListener::bind(addr.clone()) {\n\n Ok(s) => s,\n\n Err(e) => {\n\n error!(\"Failed to create a TCP listener: {}\", e);\n\n return;\n\n }\n\n };\n\n info!(\"Waiting for a GDB connection on {:?}...\", addr);\n\n\n\n let (stream, addr) = match listener.accept() {\n\n Ok(v) => v,\n\n Err(e) => {\n\n error!(\"Failed to accept a connection from GDB: {}\", e);\n\n return;\n\n }\n\n };\n\n info!(\"GDB connected from {}\", addr);\n\n\n","file_path":"src/gdb.rs","rank":27,"score":225468.52568076248},{"content":"/// Configure base registers for x86\n\n///\n\n/// # Arguments\n\n///\n\n/// * `vcpu` - Structure for the vcpu that holds the vcpu fd.\n\n/// * `boot_ip` - Starting instruction pointer.\n\n/// * `boot_sp` - Starting stack pointer.\n\n/// * `boot_si` - Must point to zero page address per Linux ABI.\n\npub fn setup_regs(vcpu: &dyn VcpuX86_64, boot_ip: u64, boot_sp: u64, boot_si: u64) -> Result<()> {\n\n let regs = Regs {\n\n rflags: 0x0000000000000002u64,\n\n rip: boot_ip,\n\n rsp: boot_sp,\n\n rbp: boot_sp,\n\n rsi: boot_si,\n\n ..Default::default()\n\n };\n\n\n\n vcpu.set_regs(®s).map_err(Error::SettingRegistersIoctl)\n\n}\n\n\n\nconst X86_CR0_PE: u64 = 0x1;\n\nconst X86_CR0_PG: u64 = 0x80000000;\n\nconst X86_CR4_PAE: u64 = 0x20;\n\n\n\nconst EFER_LME: u64 = 0x100;\n\nconst EFER_LMA: u64 = 0x400;\n\n\n\nconst BOOT_GDT_OFFSET: u64 = 0x500;\n\nconst BOOT_IDT_OFFSET: u64 = 0x520;\n\n\n\nconst BOOT_GDT_MAX: usize = 4;\n\n\n","file_path":"x86_64/src/regs.rs","rank":28,"score":223437.60558572723},{"content":"pub fn canonical_image_requirements(\n\n info: ImageAllocationInfo,\n\n) -> RutabagaResult<ImageMemoryRequirements> {\n\n let mut image_requirements: ImageMemoryRequirements = Default::default();\n\n let mut size: u32 = 0;\n\n let layout = info.drm_format.planar_layout()?;\n\n for plane in 0..layout.num_planes {\n\n let plane_stride = stride_from_layout(&layout, info.width, plane)?;\n\n image_requirements.strides[plane] = plane_stride;\n\n if plane > 0 {\n\n image_requirements.offsets[plane] = size as u32;\n\n }\n\n\n\n let height = info.height;\n\n let vertical_subsampling = layout.vertical_subsampling[plane];\n\n let subsampled_height = checked_arithmetic!(height / vertical_subsampling)?;\n\n let plane_size = checked_arithmetic!(subsampled_height * plane_stride)?;\n\n size = checked_arithmetic!(size + plane_size)?;\n\n }\n\n\n","file_path":"rutabaga_gfx/src/rutabaga_gralloc/formats.rs","rank":29,"score":223046.34922273632},{"content":"/// Automatically build the hypervisor Segment struct for set_sregs from the kernel bit fields.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `entry` - The gdt entry.\n\n/// * `table_index` - Index of the entry in the gdt table.\n\npub fn segment_from_gdt(entry: u64, table_index: u8) -> Segment {\n\n Segment {\n\n base: get_base(entry),\n\n limit: get_limit(entry),\n\n selector: (table_index * 8) as u16,\n\n type_: get_type(entry),\n\n present: get_p(entry),\n\n dpl: get_dpl(entry),\n\n db: get_db(entry),\n\n s: get_s(entry),\n\n l: get_l(entry),\n\n g: get_g(entry),\n\n avl: get_avl(entry),\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n\n","file_path":"x86_64/src/gdt.rs","rank":30,"score":222048.44509525195},{"content":"/// Read raw bytes from stdin.\n\n///\n\n/// This will block depending on the underlying mode of stdin. This will ignore the usual lock\n\n/// around stdin that the stdlib usually uses. If other code is using stdin, it is undefined who\n\n/// will get the underlying bytes.\n\npub fn read_raw_stdin(out: &mut [u8]) -> Result<usize> {\n\n // Safe because reading from stdin shouldn't have any safety implications.\n\n unsafe { read_raw(STDIN_FILENO, out) }\n\n}\n\n\n\n/// Trait for file descriptors that are TTYs, according to `isatty(3)`.\n\n///\n\n/// This is marked unsafe because the implementation must promise that the returned RawFd is a valid\n\n/// fd and that the lifetime of the returned fd is at least that of the trait object.\n\npub unsafe trait Terminal {\n\n /// Gets the file descriptor of the TTY.\n\n fn tty_fd(&self) -> RawFd;\n\n\n\n /// Set this terminal's mode to canonical mode (`ICANON | ECHO | ISIG`).\n\n fn set_canon_mode(&self) -> Result<()> {\n\n modify_mode(self.tty_fd(), |t| t.c_lflag |= ICANON | ECHO | ISIG)\n\n }\n\n\n\n /// Set this terminal's mode to raw mode (`!(ICANON | ECHO | ISIG)`).\n\n fn set_raw_mode(&self) -> Result<()> {\n","file_path":"sys_util/src/terminal.rs","rank":31,"score":222017.61503767507},{"content":"/// Allocates a vector of length `len` filled with random bytes from the\n\n/// specified `source`.\n\npub fn rand_vec(len: usize, source: Source) -> Result<Vec<u8>> {\n\n let mut rand = Vec::with_capacity(len);\n\n if len == 0 {\n\n return Ok(rand);\n\n }\n\n\n\n // Safe because rand will either be initialized by getrandom or dropped.\n\n unsafe { rand.set_len(len) };\n\n rand_bytes(rand.as_mut_slice(), source)?;\n\n Ok(rand)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n const TEST_SIZE: usize = 64;\n\n\n\n #[test]\n\n fn randbytes_success() {\n","file_path":"sys_util/src/rand.rs","rank":32,"score":221935.66565564126},{"content":"/// The kernel API has many structs that resemble the following `Foo` structure:\n\n///\n\n/// ```ignore\n\n/// #[repr(C)]\n\n/// struct Foo {\n\n/// some_data: u32,\n\n/// entries: __IncompleteArrayField<__u32>,\n\n/// }\n\n/// ```\n\n///\n\n/// In order to allocate such a structure, `size_of::<Foo>()` would be too small because it would\n\n/// not include any space for `entries`. To make the allocation large enough while still being\n\n/// aligned for `Foo`, a `Vec<Foo>` is created. Only the first element of `Vec<Foo>` would actually\n\n/// be used as a `Foo`. The remaining memory in the `Vec<Foo>` is for `entries`, which must be\n\n/// contiguous with `Foo`. This function is used to make the `Vec<Foo>` with enough space for\n\n/// `count` entries.\n\npub fn vec_with_array_field<T: Default, F>(count: usize) -> Vec<T> {\n\n let element_space = count * size_of::<F>();\n\n let vec_size_bytes = size_of::<T>() + element_space;\n\n vec_with_size_in_bytes(vec_size_bytes)\n\n}\n\n\n\n/// The following code provides generic helpers for creating and accessing flexible array structs.\n\n/// A complete definition of flexible array structs is found in the ISO 9899 specification\n\n/// (http://www.iso-9899.info/n1570.html). A flexible array struct is of the form:\n\n///\n\n/// ```ignore\n\n/// #[repr(C)]\n\n/// struct T {\n\n/// some_data: u32,\n\n/// nent: u32,\n\n/// entries: __IncompleteArrayField<S>,\n\n/// }\n\n/// ```\n\n/// where:\n\n///\n\n/// - `T` is the flexible array struct type\n\n/// - `S` is the flexible array type\n\n/// - `nent` is the flexible array length\n\n/// - `entries` is the flexible array member\n\n///\n\n/// These structures are used by the kernel API.\n\n\n","file_path":"data_model/src/flexible_array.rs","rank":33,"score":216247.57540764406},{"content":"/// Add an e820 region to the e820 map.\n\n/// Returns Ok(()) if successful, or an error if there is no space left in the map.\n\nfn add_e820_entry(params: &mut boot_params, addr: u64, size: u64, mem_type: u32) -> Result<()> {\n\n if params.e820_entries >= params.e820_table.len() as u8 {\n\n return Err(Error::E820Configuration);\n\n }\n\n\n\n params.e820_table[params.e820_entries as usize].addr = addr;\n\n params.e820_table[params.e820_entries as usize].size = size;\n\n params.e820_table[params.e820_entries as usize].type_ = mem_type;\n\n params.e820_entries += 1;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"x86_64/src/lib.rs","rank":34,"score":216232.70447212565},{"content":"fn convert_reader_writer<R, W>(reader: &mut R, writer: &mut W, size: u64) -> Result<()>\n\nwhere\n\n R: Read + Seek + SeekHole,\n\n W: Write + Seek,\n\n{\n\n let mut offset = 0;\n\n while offset < size {\n\n // Find the next range of data.\n\n let next_data = match reader.seek_data(offset).map_err(Error::SeekingFile)? {\n\n Some(o) => o,\n\n None => {\n\n // No more data in the file.\n\n break;\n\n }\n\n };\n\n let next_hole = match reader.seek_hole(next_data).map_err(Error::SeekingFile)? {\n\n Some(o) => o,\n\n None => {\n\n // This should not happen - there should always be at least one hole\n\n // after any data.\n","file_path":"disk/src/disk.rs","rank":35,"score":215449.1125282151},{"content":"fn reply_error<W: Writer>(e: io::Error, unique: u64, mut w: W) -> Result<usize> {\n\n let header = OutHeader {\n\n len: size_of::<OutHeader>() as u32,\n\n error: -e.raw_os_error().unwrap_or(libc::EIO),\n\n unique,\n\n };\n\n\n\n w.write_all(header.as_slice())\n\n .map_err(Error::EncodeMessage)?;\n\n w.flush().map_err(Error::FlushMessage)?;\n\n\n\n Ok(header.len as usize)\n\n}\n\n\n","file_path":"fuse/src/server.rs","rank":36,"score":212609.80203569954},{"content":"/// Configure Model specific registers for x86\n\n///\n\n/// # Arguments\n\n///\n\n/// * `vcpu` - Structure for the vcpu that holds the vcpu fd.\n\npub fn setup_msrs(vcpu: &dyn VcpuX86_64, pci_start: u64) -> Result<()> {\n\n let msrs = create_msr_entries(vcpu, pci_start);\n\n vcpu.set_msrs(&msrs).map_err(Error::MsrIoctlFailed)\n\n}\n\n\n","file_path":"x86_64/src/regs.rs","rank":37,"score":210812.68001791625},{"content":"/// Creates a flattened device tree containing all of the parameters used\n\n/// by Android.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `fdt` - The DTB to modify. The top-most node should be open.\n\n/// * `android-fstab` - A text file of Android fstab entries to add to the DTB\n\npub fn create_android_fdt(fdt: &mut FdtWriter, fstab: File) -> Result<()> {\n\n let vecs = BufReader::new(fstab)\n\n .lines()\n\n .map(|l| parse_fstab_line(&l.map_err(Error::FdtIoError)?))\n\n .collect::<Result<Vec<Vec<String>>>>()?;\n\n let firmware_node = fdt.begin_node(\"firmware\")?;\n\n let android_node = fdt.begin_node(\"android\")?;\n\n fdt.property_string(\"compatible\", \"android,firmware\")?;\n\n\n\n let (dtprop, fstab): (_, Vec<_>) = vecs.into_iter().partition(|x| x[0] == \"#dt-vendor\");\n\n let vendor_node = fdt.begin_node(\"vendor\")?;\n\n for vec in dtprop {\n\n let content = std::fs::read_to_string(&vec[2]).map_err(Error::FdtIoError)?;\n\n fdt.property_string(&vec[1], &content)?;\n\n }\n\n fdt.end_node(vendor_node)?;\n\n let fstab_node = fdt.begin_node(\"fstab\")?;\n\n fdt.property_string(\"compatible\", \"android,fstab\")?;\n\n for vec in fstab {\n\n let partition = &vec[1][1..];\n","file_path":"arch/src/android.rs","rank":38,"score":210788.3694509086},{"content":"/// Constructor for a conventional segment GDT (or LDT) entry. Derived from the kernel's segment.h.\n\npub fn gdt_entry(flags: u16, base: u32, limit: u32) -> u64 {\n\n (((base as u64) & 0xff000000u64) << (56 - 24))\n\n | (((flags as u64) & 0x0000f0ffu64) << 40)\n\n | (((limit as u64) & 0x000f0000u64) << (48 - 16))\n\n | (((base as u64) & 0x00ffffffu64) << 16)\n\n | ((limit as u64) & 0x0000ffffu64)\n\n}\n\n\n","file_path":"x86_64/src/gdt.rs","rank":39,"score":209656.6932626657},{"content":"fn create_msr_entries(vcpu: &dyn VcpuX86_64, pci_start: u64) -> Vec<Register> {\n\n let mut entries = vec![\n\n Register {\n\n id: crate::msr_index::MSR_IA32_SYSENTER_CS,\n\n value: 0x0,\n\n },\n\n Register {\n\n id: crate::msr_index::MSR_IA32_SYSENTER_ESP,\n\n value: 0x0,\n\n },\n\n Register {\n\n id: crate::msr_index::MSR_IA32_SYSENTER_EIP,\n\n value: 0x0,\n\n },\n\n // x86_64 specific msrs, we only run on x86_64 not x86\n\n Register {\n\n id: crate::msr_index::MSR_STAR,\n\n value: 0x0,\n\n },\n\n Register {\n","file_path":"x86_64/src/regs.rs","rank":40,"score":208503.17999355646},{"content":"/// Terminates and reaps a child process. If the child process is a group leader, its children will\n\n/// be terminated and reaped as well. After the given timeout, the child process and any relevant\n\n/// children are killed (i.e. sent SIGKILL).\n\npub fn kill_tree(child: &mut Child, terminate_timeout: Duration) -> SignalResult<()> {\n\n let target = {\n\n let pid = child.id() as Pid;\n\n if getsid(Some(pid)).map_err(Error::GetSid)? == pid {\n\n -pid\n\n } else {\n\n pid\n\n }\n\n };\n\n\n\n // Safe because target is a child process (or group) and behavior of SIGTERM is defined.\n\n ok_if!(unsafe { kill(target, libc::SIGTERM) }, libc::ESRCH).map_err(Error::Kill)?;\n\n\n\n // Reap the direct child first in case it waits for its descendants, afterward reap any\n\n // remaining group members.\n\n let start = Instant::now();\n\n let mut child_running = true;\n\n loop {\n\n // Wait for the direct child to exit before reaping any process group members.\n\n if child_running {\n","file_path":"sys_util/src/signal.rs","rank":41,"score":207791.02853538995},{"content":"pub fn ungrab_evdev<T: AsRawDescriptor>(descriptor: &mut T) -> Result<()> {\n\n let ret = unsafe {\n\n // Safe because the kernel only reads the value of the ptr (doesn't dereference) and\n\n // we check the return value\n\n ioctl_with_ptr(\n\n &Descriptor(descriptor.as_raw_descriptor()),\n\n EVIOCGRAB(),\n\n null::<u32>(),\n\n )\n\n };\n\n if ret == 0 {\n\n Ok(())\n\n } else {\n\n Err(InputError::EvdevGrabError(errno()))\n\n }\n\n}\n","file_path":"devices/src/virtio/input/evdev.rs","rank":42,"score":207791.02853538995},{"content":"/// Grabs an event device (see EVIOCGGRAB ioctl for details). After this function succeeds the given\n\n/// descriptor has exclusive access to the device, effectively making it unusable for any other process in\n\n/// the host.\n\npub fn grab_evdev<T: AsRawDescriptor>(descriptor: &mut T) -> Result<()> {\n\n let val: u32 = 1;\n\n let ret = unsafe {\n\n // Safe because the kernel only read the value of the ptr and we check the return value\n\n ioctl_with_ref(\n\n &Descriptor(descriptor.as_raw_descriptor()),\n\n EVIOCGRAB(),\n\n &val,\n\n )\n\n };\n\n if ret == 0 {\n\n Ok(())\n\n } else {\n\n Err(InputError::EvdevGrabError(errno()))\n\n }\n\n}\n\n\n","file_path":"devices/src/virtio/input/evdev.rs","rank":43,"score":207791.02853538995},{"content":"fn create_serial_node(fdt: &mut FdtWriter, addr: u64, irq: u32) -> Result<()> {\n\n let serial_reg_prop = [addr, AARCH64_SERIAL_SIZE];\n\n let irq = [GIC_FDT_IRQ_TYPE_SPI, irq, IRQ_TYPE_EDGE_RISING];\n\n\n\n let serial_node = fdt.begin_node(&format!(\"U6_16550A@{:x}\", addr))?;\n\n fdt.property_string(\"compatible\", \"ns16550a\")?;\n\n fdt.property_array_u64(\"reg\", &serial_reg_prop)?;\n\n fdt.property_u32(\"clock-frequency\", AARCH64_SERIAL_SPEED)?;\n\n fdt.property_array_u32(\"interrupts\", &irq)?;\n\n fdt.end_node(serial_node)?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"aarch64/src/fdt.rs","rank":44,"score":204066.27282594267},{"content":"/// Gets the name of an event device (see EVIOCGNAME ioctl for details).\n\npub fn name<T: AsRawDescriptor>(descriptor: &T) -> Result<Vec<u8>> {\n\n let mut name = evdev_buffer::new();\n\n let len = unsafe {\n\n // Safe because the kernel won't write more than size of evdev_buffer and we check the\n\n // return value\n\n ioctl_with_mut_ref(\n\n &Descriptor(descriptor.as_raw_descriptor()),\n\n EVIOCGNAME(),\n\n &mut name,\n\n )\n\n };\n\n if len < 0 {\n\n return Err(InputError::EvdevNameError(errno()));\n\n }\n\n Ok(name.buffer[0..len as usize].to_vec())\n\n}\n\n\n","file_path":"devices/src/virtio/input/evdev.rs","rank":45,"score":203614.869958067},{"content":"#[derive(Debug, Copy, Clone)]\n\nstruct Range(u64, u64, bool);\n\n\n\nimpl Eq for Range {}\n\n\n\nimpl PartialEq for Range {\n\n fn eq(&self, other: &Range) -> bool {\n\n self.0 == other.0\n\n }\n\n}\n\n\n\nimpl Ord for Range {\n\n fn cmp(&self, other: &Range) -> cmp::Ordering {\n\n self.0.cmp(&other.0)\n\n }\n\n}\n\n\n\nimpl PartialOrd for Range {\n\n fn partial_cmp(&self, other: &Range) -> Option<cmp::Ordering> {\n\n self.0.partial_cmp(&other.0)\n\n }\n\n}\n\n\n\n// Wrapper types to make the kvm register structs DataInit\n","file_path":"src/plugin/vcpu.rs","rank":46,"score":202641.24398127839},{"content":"fn parse_remove_bits_attr(ast: &mut DeriveInput) -> Result<Option<u64>> {\n\n let mut width = None;\n\n let mut bits_idx = 0;\n\n\n\n for (i, attr) in ast.attrs.iter().enumerate() {\n\n if let Some(w) = try_parse_bits_attr(attr)? {\n\n bits_idx = i;\n\n width = Some(w.base10_parse()?);\n\n }\n\n }\n\n\n\n if width.is_some() {\n\n ast.attrs.remove(bits_idx);\n\n }\n\n\n\n Ok(width)\n\n}\n\n\n","file_path":"bit_field/bit_field_derive/bit_field_derive.rs","rank":47,"score":202498.3284784344},{"content":"fn create_gic_node(fdt: &mut FdtWriter, is_gicv3: bool, num_cpus: u64) -> Result<()> {\n\n let mut gic_reg_prop = [AARCH64_GIC_DIST_BASE, AARCH64_GIC_DIST_SIZE, 0, 0];\n\n\n\n let intc_node = fdt.begin_node(\"intc\")?;\n\n if is_gicv3 {\n\n fdt.property_string(\"compatible\", \"arm,gic-v3\")?;\n\n gic_reg_prop[2] = AARCH64_GIC_DIST_BASE - (AARCH64_GIC_REDIST_SIZE * num_cpus);\n\n gic_reg_prop[3] = AARCH64_GIC_REDIST_SIZE * num_cpus;\n\n } else {\n\n fdt.property_string(\"compatible\", \"arm,cortex-a15-gic\")?;\n\n gic_reg_prop[2] = AARCH64_GIC_CPUI_BASE;\n\n gic_reg_prop[3] = AARCH64_GIC_CPUI_SIZE;\n\n }\n\n fdt.property_u32(\"#interrupt-cells\", GIC_FDT_IRQ_NUM_CELLS)?;\n\n fdt.property_null(\"interrupt-controller\")?;\n\n fdt.property_array_u64(\"reg\", &gic_reg_prop)?;\n\n fdt.property_u32(\"phandle\", PHANDLE_GIC)?;\n\n fdt.property_u32(\"#address-cells\", 2)?;\n\n fdt.property_u32(\"#size-cells\", 2)?;\n\n fdt.end_node(intc_node)?;\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"aarch64/src/fdt.rs","rank":48,"score":201206.81017044964},{"content":"/// Gets the unique (serial) name of an event device (see EVIOCGUNIQ ioctl for details).\n\npub fn serial_name<T: AsRawDescriptor>(descriptor: &T) -> Result<Vec<u8>> {\n\n let mut uniq = evdev_buffer::new();\n\n let len = unsafe {\n\n // Safe because the kernel won't write more than size of evdev_buffer and we check the\n\n // return value\n\n ioctl_with_mut_ref(\n\n &Descriptor(descriptor.as_raw_descriptor()),\n\n EVIOCGUNIQ(),\n\n &mut uniq,\n\n )\n\n };\n\n if len < 0 {\n\n return Err(InputError::EvdevSerialError(errno()));\n\n }\n\n Ok(uniq.buffer[0..len as usize].to_vec())\n\n}\n\n\n","file_path":"devices/src/virtio/input/evdev.rs","rank":49,"score":200757.32154271586},{"content":"/// Configures LAPICs. LAPIC0 is set for external interrupts, LAPIC1 is set for NMI.\n\n///\n\n/// # Arguments\n\n/// * `vcpu_id` - The number of the VCPU to configure.\n\n/// * `irqchip` - The IrqChip for getting/setting LAPIC state.\n\npub fn set_lint(vcpu_id: usize, irqchip: &mut dyn IrqChipX86_64) -> Result<()> {\n\n let mut lapic = irqchip.get_lapic_state(vcpu_id).map_err(Error::GetLapic)?;\n\n\n\n for (reg, mode) in &[\n\n (APIC_LVT0_REGISTER, APIC_MODE_EXTINT),\n\n (APIC_LVT1_REGISTER, APIC_MODE_NMI),\n\n ] {\n\n lapic.regs[*reg] = set_apic_delivery_mode(lapic.regs[*reg], *mode);\n\n }\n\n\n\n irqchip\n\n .set_lapic_state(vcpu_id, &lapic)\n\n .map_err(Error::SetLapic)\n\n}\n","file_path":"x86_64/src/interrupts.rs","rank":50,"score":200643.055922371},{"content":"fn default_touchscreen_absinfo(width: u32, height: u32) -> BTreeMap<u16, virtio_input_absinfo> {\n\n let mut absinfo: BTreeMap<u16, virtio_input_absinfo> = BTreeMap::new();\n\n absinfo.insert(ABS_X, virtio_input_absinfo::new(0, width, 0, 0));\n\n absinfo.insert(ABS_Y, virtio_input_absinfo::new(0, height, 0, 0));\n\n absinfo\n\n}\n\n\n","file_path":"devices/src/virtio/input/defaults.rs","rank":51,"score":198039.20587855554},{"content":"fn default_trackpad_absinfo(width: u32, height: u32) -> BTreeMap<u16, virtio_input_absinfo> {\n\n let mut absinfo: BTreeMap<u16, virtio_input_absinfo> = BTreeMap::new();\n\n absinfo.insert(ABS_X, virtio_input_absinfo::new(0, width, 0, 0));\n\n absinfo.insert(ABS_Y, virtio_input_absinfo::new(0, height, 0, 0));\n\n absinfo\n\n}\n\n\n","file_path":"devices/src/virtio/input/defaults.rs","rank":52,"score":198039.20587855554},{"content":"/// Given a `reader` for a full set of descriptors as provided by the Linux kernel\n\n/// usbdevfs `descriptors` file, parse the descriptors into a tree data structure.\n\npub fn parse_usbfs_descriptors<R: Read>(mut reader: R) -> Result<DeviceDescriptorTree> {\n\n // Given a structure of length `struct_length`, of which `bytes_consumed` have\n\n // already been read, skip the remainder of the struct. If `bytes_consumed` is\n\n // more than `struct_length`, no additional bytes are skipped.\n\n fn skip<R: Read>(reader: R, bytes_consumed: usize, struct_length: u8) -> io::Result<u64> {\n\n let bytes_to_skip = u64::from(struct_length).saturating_sub(bytes_consumed as u64);\n\n io::copy(&mut reader.take(bytes_to_skip), &mut io::sink())\n\n }\n\n\n\n // Find the next descriptor of type T and return it.\n\n // Any other descriptors encountered while searching for the expected type are skipped.\n\n fn next_descriptor<R: Read, T: Descriptor + DataInit>(mut reader: R) -> Result<T> {\n\n let desc_type = T::descriptor_type() as u8;\n\n loop {\n\n let hdr = DescriptorHeader::from_reader(&mut reader).map_err(Error::DescriptorRead)?;\n\n if hdr.bDescriptorType == desc_type {\n\n if usize::from(hdr.bLength) < size_of::<DescriptorHeader>() + size_of::<T>() {\n\n return Err(Error::DescriptorParse);\n\n }\n\n\n","file_path":"usb_util/src/descriptor.rs","rank":53,"score":197911.58526136173},{"content":"// Ceiling of the division of `dividend`/`divisor`.\n\nfn div_round_up_u64(dividend: u64, divisor: u64) -> u64 {\n\n dividend / divisor + if dividend % divisor != 0 { 1 } else { 0 }\n\n}\n\n\n","file_path":"disk/src/qcow/mod.rs","rank":54,"score":197389.17364046088},{"content":"fn get_base(entry: u64) -> u64 {\n\n (((entry) & 0xFF00000000000000) >> 32)\n\n | (((entry) & 0x000000FF00000000) >> 16)\n\n | (((entry) & 0x00000000FFFF0000) >> 16)\n\n}\n\n\n","file_path":"x86_64/src/gdt.rs","rank":55,"score":196172.60574465265},{"content":"// Returns the max length which suitable for mtrr setting based on the\n\n// specified (base, len)\n\nfn get_max_len(base: u64, len: u64) -> u64 {\n\n let mut ret = get_power_of_two(len);\n\n\n\n while base % ret != 0 {\n\n ret >>= 1;\n\n }\n\n\n\n ret\n\n}\n\n\n","file_path":"x86_64/src/regs.rs","rank":56,"score":194875.5278234344},{"content":"/// Safe wrapper for `libc::lseek64()`\n\nfn lseek(file: &mut File, offset: i64, whence: i32) -> Result<Option<u64>> {\n\n // This is safe because we pass a known-good file descriptor.\n\n let res = unsafe { lseek64(file.as_raw_fd(), offset, whence) };\n\n\n\n if res < 0 {\n\n // Convert ENXIO into None; pass any other error as-is.\n\n let err = Error::last_os_error();\n\n if let Some(errno) = Error::raw_os_error(&err) {\n\n if errno == ENXIO {\n\n return Ok(None);\n\n }\n\n }\n\n Err(err)\n\n } else {\n\n Ok(Some(res as u64))\n\n }\n\n}\n\n\n\nimpl SeekHole for File {\n\n fn seek_hole(&mut self, offset: u64) -> Result<Option<u64>> {\n","file_path":"sys_util/src/seek_hole.rs","rank":57,"score":193817.4943852676},{"content":"// Returns the value of the highest bit in a 64-bit value. Equivalent to\n\n// 1 << HighBitSet(x)\n\nfn get_power_of_two(data: u64) -> u64 {\n\n 1 << (64 - data.leading_zeros() - 1)\n\n}\n\n\n","file_path":"x86_64/src/regs.rs","rank":58,"score":193708.88239374422},{"content":"fn reply_readdir<W: Writer>(len: usize, unique: u64, mut w: W) -> Result<usize> {\n\n let out = OutHeader {\n\n len: (size_of::<OutHeader>() + len) as u32,\n\n error: 0,\n\n unique,\n\n };\n\n\n\n w.write_all(out.as_slice()).map_err(Error::EncodeMessage)?;\n\n w.flush().map_err(Error::FlushMessage)?;\n\n Ok(out.len as usize)\n\n}\n\n\n","file_path":"fuse/src/server.rs","rank":59,"score":193490.37794821116},{"content":"/// Parses the given `args` against the list of know arguments `arg_list` and calls `f` with each\n\n/// present argument and value if required.\n\n///\n\n/// This function guarantees that only valid long argument names from `arg_list` are sent to the\n\n/// callback `f`. It is also guaranteed that if an arg requires a value (i.e.\n\n/// `arg.value.is_some()`), the value will be `Some` in the callbacks arguments. If the callback\n\n/// returns `Err`, this function will end parsing and return that `Err`.\n\n///\n\n/// See the [module level](index.html) example for a usage example.\n\npub fn set_arguments<I, R, F>(args: I, arg_list: &[Argument], mut f: F) -> Result<()>\n\nwhere\n\n I: Iterator<Item = R>,\n\n R: AsRef<str>,\n\n F: FnMut(&str, Option<&str>) -> Result<()>,\n\n{\n\n parse_arguments(args, |name, value| {\n\n let mut matches = None;\n\n for arg in arg_list {\n\n if let Some(short) = arg.short {\n\n if name.len() == 1 && name.starts_with(short) {\n\n if value.is_some() != arg.value.is_some() {\n\n return Err(Error::ExpectedValue(short.to_string()));\n\n }\n\n matches = Some(arg.long);\n\n }\n\n }\n\n if matches.is_none() && arg.long == name {\n\n if value.is_none() && arg.value_mode == ArgumentValueMode::Required {\n\n return Err(Error::ExpectedValue(arg.long.to_owned()));\n","file_path":"src/argument.rs","rank":60,"score":193094.76453077223},{"content":"fn create_pkg_length(data: &[u8], include_self: bool) -> Vec<u8> {\n\n let mut result = Vec::new();\n\n\n\n /* PkgLength is inclusive and includes the length bytes */\n\n let length_length = if data.len() < (2usize.pow(6) - 1) {\n\n 1\n\n } else if data.len() < (2usize.pow(12) - 2) {\n\n 2\n\n } else if data.len() < (2usize.pow(20) - 3) {\n\n 3\n\n } else {\n\n 4\n\n };\n\n\n\n let length = data.len() + if include_self { length_length } else { 0 };\n\n\n\n match length_length {\n\n 1 => result.push(length as u8),\n\n 2 => {\n\n result.push((1u8 << 6) | (length & 0xf) as u8);\n","file_path":"acpi_tables/src/aml.rs","rank":61,"score":186636.11096513082},{"content":"/// Sets up the cpuid entries for the given vcpu. Can fail if there are too many CPUs specified or\n\n/// if an ioctl returns an error.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `hypervisor` - `HypervisorX86_64` impl for getting supported CPU IDs.\n\n/// * `vcpu` - `VcpuX86_64` for setting CPU ID.\n\n/// * `vcpu_id` - The vcpu index of `vcpu`.\n\n/// * `nrcpus` - The number of vcpus being used by this VM.\n\npub fn setup_cpuid(\n\n hypervisor: &dyn HypervisorX86_64,\n\n irq_chip: &dyn IrqChipX86_64,\n\n vcpu: &dyn VcpuX86_64,\n\n vcpu_id: usize,\n\n nrcpus: usize,\n\n no_smt: bool,\n\n) -> Result<()> {\n\n let mut cpuid = hypervisor\n\n .get_supported_cpuid()\n\n .map_err(Error::GetSupportedCpusFailed)?;\n\n\n\n filter_cpuid(vcpu_id, nrcpus, &mut cpuid, irq_chip, no_smt);\n\n\n\n vcpu.set_cpuid(&cpuid)\n\n .map_err(Error::SetSupportedCpusFailed)\n\n}\n\n\n","file_path":"x86_64/src/cpuid.rs","rank":62,"score":186040.4758719863},{"content":"pub fn run_vcpus(\n\n kvm: &Kvm,\n\n vm: &Vm,\n\n plugin: &Process,\n\n vcpu_count: u32,\n\n kill_signaled: &Arc<AtomicBool>,\n\n exit_evt: &Event,\n\n vcpu_handles: &mut Vec<thread::JoinHandle<()>>,\n\n) -> Result<()> {\n\n let vcpu_thread_barrier = Arc::new(Barrier::new((vcpu_count) as usize));\n\n let use_kvm_signals = !kvm.check_extension(Cap::ImmediateExit);\n\n\n\n // If we need to force a vcpu to exit from a VM then a SIGRTMIN signal is sent\n\n // to that vcpu's thread. If KVM is running the VM then it'll return -EINTR.\n\n // An issue is what to do when KVM isn't running the VM (where we could be\n\n // in the kernel or in the app).\n\n //\n\n // If KVM supports \"immediate exit\" then we set a signal handler that will\n\n // set the |immediate_exit| flag that tells KVM to return -EINTR before running\n\n // the VM.\n","file_path":"src/plugin/mod.rs","rank":63,"score":186030.2127654347},{"content":"/// Performs setup of the MP table for the given `num_cpus`.\n\npub fn setup_mptable(\n\n mem: &GuestMemory,\n\n num_cpus: u8,\n\n pci_irqs: Vec<(PciAddress, u32, PciInterruptPin)>,\n\n) -> Result<()> {\n\n // Used to keep track of the next base pointer into the MP table.\n\n let mut base_mp = GuestAddress(MPTABLE_START);\n\n\n\n // Calculate ISA bus number in the system, report at least one PCI bus.\n\n let isa_bus_id = match pci_irqs.iter().max_by_key(|v| v.0.bus) {\n\n Some(pci_irq) => pci_irq.0.bus + 1,\n\n _ => 1,\n\n };\n\n let mp_size = compute_mp_size(num_cpus);\n\n\n\n // The checked_add here ensures the all of the following base_mp.unchecked_add's will be without\n\n // overflow.\n\n if let Some(end_mp) = base_mp.checked_add(mp_size as u64 - 1) {\n\n if !mem.address_in_range(end_mp) {\n\n return Err(Error::NotEnoughMemory);\n","file_path":"x86_64/src/mptable.rs","rank":64,"score":186030.2127654347},{"content":"/// Creates a flattened device tree containing all of the parameters for the\n\n/// kernel and loads it into the guest memory at the specified offset.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `fdt_max_size` - The amount of space reserved for the device tree\n\n/// * `guest_mem` - The guest memory object\n\n/// * `fdt_load_offset` - The offset into physical memory for the device tree\n\n/// * `android_fstab` - the File object for the android fstab\n\npub fn create_fdt(\n\n fdt_max_size: usize,\n\n guest_mem: &GuestMemory,\n\n fdt_load_offset: u64,\n\n android_fstab: File,\n\n) -> Result<usize, Error> {\n\n // Reserve space for the setup_data\n\n let fdt_data_size = fdt_max_size - mem::size_of::<setup_data>();\n\n\n\n let mut fdt = FdtWriter::new(&[]);\n\n\n\n // The whole thing is put into one giant node with some top level properties\n\n let root_node = fdt.begin_node(\"\")?;\n\n create_android_fdt(&mut fdt, android_fstab)?;\n\n fdt.end_node(root_node)?;\n\n\n\n let fdt_final = fdt.finish(fdt_data_size)?;\n\n\n\n assert_eq!(\n\n mem::size_of::<setup_data>(),\n","file_path":"x86_64/src/fdt.rs","rank":65,"score":186030.2127654347},{"content":"/// Safe wrapper for `fallocate()`.\n\npub fn fallocate(\n\n file: &dyn AsRawFd,\n\n mode: FallocateMode,\n\n keep_size: bool,\n\n offset: u64,\n\n len: u64,\n\n) -> Result<()> {\n\n let offset = if offset > libc::off64_t::max_value() as u64 {\n\n return Err(Error::new(libc::EINVAL));\n\n } else {\n\n offset as libc::off64_t\n\n };\n\n\n\n let len = if len > libc::off64_t::max_value() as u64 {\n\n return Err(Error::new(libc::EINVAL));\n\n } else {\n\n len as libc::off64_t\n\n };\n\n\n\n let mut mode = match mode {\n","file_path":"sys_util/src/lib.rs","rank":66,"score":186030.2127654347},{"content":"/// Creates a flattened device tree containing all of the parameters for the\n\n/// kernel and loads it into the guest memory at the specified offset.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `fdt_max_size` - The amount of space reserved for the device tree\n\n/// * `guest_mem` - The guest memory object\n\n/// * `pci_irqs` - List of PCI device address to PCI interrupt number and pin mappings\n\n/// * `num_cpus` - Number of virtual CPUs the guest will have\n\n/// * `fdt_load_offset` - The offset into physical memory for the device tree\n\n/// * `pci_device_base` - The offset into physical memory for PCI device memory\n\n/// * `pci_device_size` - The size of PCI device memory\n\n/// * `cmdline` - The kernel commandline\n\n/// * `initrd` - An optional tuple of initrd guest physical address and size\n\n/// * `android_fstab` - An optional file holding Android fstab entries\n\n/// * `is_gicv3` - True if gicv3, false if v2\n\n/// * `psci_version` - the current PSCI version\n\npub fn create_fdt(\n\n fdt_max_size: usize,\n\n guest_mem: &GuestMemory,\n\n pci_irqs: Vec<(PciAddress, u32, PciInterruptPin)>,\n\n num_cpus: u32,\n\n fdt_load_offset: u64,\n\n pci_device_base: u64,\n\n pci_device_size: u64,\n\n cmdline: &str,\n\n initrd: Option<(GuestAddress, usize)>,\n\n android_fstab: Option<File>,\n\n is_gicv3: bool,\n\n use_pmu: bool,\n\n psci_version: PsciVersion,\n\n) -> Result<()> {\n\n let mut fdt = FdtWriter::new(&[]);\n\n\n\n // The whole thing is put into one giant node with some top level properties\n\n let root_node = fdt.begin_node(\"\")?;\n\n fdt.property_u32(\"interrupt-parent\", PHANDLE_GIC)?;\n","file_path":"aarch64/src/fdt.rs","rank":67,"score":186030.2127654347},{"content":"// Implement setter and getter for all fields.\n\nfn get_fields_impl(fields: &[FieldSpec]) -> Vec<TokenStream> {\n\n let mut impls = Vec::new();\n\n // This vec keeps track of types before this field, used to generate the offset.\n\n let current_types = &mut vec![quote!(::bit_field::BitField0)];\n\n\n\n for spec in fields {\n\n let ty = spec.ty;\n\n let getter_ident = Ident::new(format!(\"get_{}\", spec.ident).as_str(), Span::call_site());\n\n let setter_ident = Ident::new(format!(\"set_{}\", spec.ident).as_str(), Span::call_site());\n\n\n\n // Optional #[bits = N] attribute to provide compile-time checked\n\n // documentation of how many bits some field covers.\n\n let check_expected_bits = spec.expected_bits.as_ref().map(|expected_bits| {\n\n // If expected_bits does not match the actual number of bits in the\n\n // bit field specifier, this will fail to compile with an error\n\n // pointing into the #[bits = N] attribute.\n\n let span = expected_bits.span();\n\n quote_spanned! {span=>\n\n #[allow(dead_code)]\n\n const EXPECTED_BITS: [(); #expected_bits] =\n","file_path":"bit_field/bit_field_derive/bit_field_derive.rs","rank":68,"score":185658.3115430874},{"content":"fn range_intersection(a: &Range<u64>, b: &Range<u64>) -> Range<u64> {\n\n Range {\n\n start: max(a.start, b.start),\n\n end: min(a.end, b.end),\n\n }\n\n}\n\n\n\n/// A magic string placed at the beginning of a composite disk file to identify it.\n\npub static CDISK_MAGIC: &str = \"composite_disk\\x1d\";\n\n/// The length of the CDISK_MAGIC string. Created explicitly as a static constant so that it is\n\n/// possible to create a character array of the same length.\n\npub const CDISK_MAGIC_LEN: usize = 15;\n\n\n\nimpl CompositeDiskFile {\n\n fn new(mut disks: Vec<ComponentDiskPart>) -> Result<CompositeDiskFile> {\n\n disks.sort_by(|d1, d2| d1.offset.cmp(&d2.offset));\n\n let contiguous_err = disks\n\n .windows(2)\n\n .map(|s| {\n\n if s[0].offset == s[1].offset {\n","file_path":"disk/src/composite.rs","rank":69,"score":185633.6038511344},{"content":"fn to_kvm_msrs(vec: &[Register]) -> Vec<kvm_msrs> {\n\n let vec: Vec<kvm_msr_entry> = vec\n\n .iter()\n\n .map(|e| kvm_msr_entry {\n\n index: e.id as u32,\n\n data: e.value,\n\n ..Default::default()\n\n })\n\n .collect();\n\n\n\n let mut msrs = vec_with_array_field::<kvm_msrs, kvm_msr_entry>(vec.len());\n\n unsafe {\n\n // Mapping the unsized array to a slice is unsafe because the length isn't known.\n\n // Providing the length used to create the struct guarantees the entire slice is valid.\n\n msrs[0]\n\n .entries\n\n .as_mut_slice(vec.len())\n\n .copy_from_slice(&vec);\n\n }\n\n msrs[0].nmsrs = vec.len() as u32;\n","file_path":"hypervisor/src/kvm/x86_64.rs","rank":70,"score":184810.06492336682},{"content":"/// Get the current monotonic time of host in nanoseconds\n\nfn get_monotonic_time() -> u64 {\n\n let mut time = libc::timespec {\n\n tv_sec: 0,\n\n tv_nsec: 0,\n\n };\n\n // Safe because time struct is local to this function and we check the returncode\n\n let ret = unsafe { libc::clock_gettime(libc::CLOCK_MONOTONIC, &mut time) };\n\n if ret != 0 {\n\n 0\n\n } else {\n\n time.tv_sec as u64 * 1_000_000_000u64 + time.tv_nsec as u64\n\n }\n\n}\n\n\n\nimpl PitCounter {\n\n fn new(\n\n counter_id: usize,\n\n interrupt_evt: Option<Event>,\n\n clock: Arc<Mutex<Clock>>,\n\n ) -> PitResult<PitCounter> {\n","file_path":"devices/src/pit.rs","rank":71,"score":183889.00264387048},{"content":"/// Creates a new virtio keyboard, which supports the same events as an en-us physical keyboard.\n\npub fn new_keyboard<T>(source: T, virtio_features: u64) -> Result<Input<SocketEventSource<T>>>\n\nwhere\n\n T: Read + Write + AsRawDescriptor,\n\n{\n\n Ok(Input {\n\n kill_evt: None,\n\n worker_thread: None,\n\n config: defaults::new_keyboard_config(),\n\n source: Some(SocketEventSource::new(source)),\n\n virtio_features,\n\n })\n\n}\n\n\n","file_path":"devices/src/virtio/input/mod.rs","rank":72,"score":183074.34319674212},{"content":"/// Creates a new virtio input device from an event device node\n\npub fn new_evdev<T>(source: T, virtio_features: u64) -> Result<Input<EvdevEventSource<T>>>\n\nwhere\n\n T: Read + Write + AsRawDescriptor,\n\n{\n\n Ok(Input {\n\n kill_evt: None,\n\n worker_thread: None,\n\n config: VirtioInputConfig::from_evdev(&source)?,\n\n source: Some(EvdevEventSource::new(source)),\n\n virtio_features,\n\n })\n\n}\n\n\n","file_path":"devices/src/virtio/input/mod.rs","rank":73,"score":183074.34319674212},{"content":"/// Creates a new virtio mouse which supports primary, secondary, wheel and REL events.\n\npub fn new_mouse<T>(source: T, virtio_features: u64) -> Result<Input<SocketEventSource<T>>>\n\nwhere\n\n T: Read + Write + AsRawDescriptor,\n\n{\n\n Ok(Input {\n\n kill_evt: None,\n\n worker_thread: None,\n\n config: defaults::new_mouse_config(),\n\n source: Some(SocketEventSource::new(source)),\n\n virtio_features,\n\n })\n\n}\n\n\n","file_path":"devices/src/virtio/input/mod.rs","rank":74,"score":183074.34319674212},{"content":"/// Creates a new virtio device for switches.\n\npub fn new_switches<T>(source: T, virtio_features: u64) -> Result<Input<SocketEventSource<T>>>\n\nwhere\n\n T: Read + Write + AsRawDescriptor,\n\n{\n\n Ok(Input {\n\n kill_evt: None,\n\n worker_thread: None,\n\n config: defaults::new_switches_config(),\n\n source: Some(SocketEventSource::new(source)),\n\n virtio_features,\n\n })\n\n}\n","file_path":"devices/src/virtio/input/mod.rs","rank":75,"score":183074.34319674212},{"content":"/// Create ACPI tables and return the RSDP.\n\n/// The basic tables DSDT/FACP/MADT/XSDT are constructed in this function.\n\n/// # Arguments\n\n///\n\n/// * `guest_mem` - The guest memory where the tables will be stored.\n\n/// * `num_cpus` - Used to construct the MADT.\n\n/// * `sci_irq` - Used to fill the FACP SCI_INTERRUPT field, which\n\n/// is going to be used by the ACPI drivers to register\n\n/// sci handler.\n\n/// * `acpi_dev_resource` - resouces needed by the ACPI devices for creating tables\n\npub fn create_acpi_tables(\n\n guest_mem: &GuestMemory,\n\n num_cpus: u8,\n\n sci_irq: u32,\n\n acpi_dev_resource: ACPIDevResource,\n\n) -> Option<GuestAddress> {\n\n // RSDP is at the HI RSDP WINDOW\n\n let rsdp_offset = GuestAddress(super::ACPI_HI_RSDP_WINDOW_BASE);\n\n let mut offset = rsdp_offset.checked_add(RSDP::len() as u64)?;\n\n let mut tables: Vec<u64> = Vec::new();\n\n let mut dsdt_offset: Option<GuestAddress> = None;\n\n\n\n // User supplied System Description Tables, e.g. SSDT.\n\n for sdt in acpi_dev_resource.sdts.iter() {\n\n guest_mem.write_at_addr(sdt.as_slice(), offset).ok()?;\n\n if sdt.is_signature(b\"DSDT\") {\n\n dsdt_offset = Some(offset);\n\n } else {\n\n tables.push(offset.0);\n\n }\n","file_path":"x86_64/src/acpi.rs","rank":76,"score":183032.3025147685},{"content":"/// Creates a root PCI device for use by this Vm.\n\npub fn generate_pci_root(\n\n mut devices: Vec<(Box<dyn PciDevice>, Option<Minijail>)>,\n\n irq_chip: &mut impl IrqChip,\n\n mmio_bus: &mut Bus,\n\n resources: &mut SystemAllocator,\n\n vm: &mut impl Vm,\n\n max_irqs: usize,\n\n) -> Result<\n\n (\n\n PciRoot,\n\n Vec<(PciAddress, u32, PciInterruptPin)>,\n\n BTreeMap<u32, String>,\n\n ),\n\n DeviceRegistrationError,\n\n> {\n\n let mut root = PciRoot::new();\n\n let mut pci_irqs = Vec::new();\n\n let mut pid_labels = BTreeMap::new();\n\n\n\n let mut irqs: Vec<Option<u32>> = vec![None; max_irqs];\n","file_path":"arch/src/lib.rs","rank":77,"score":183031.8734152952},{"content":"/// Adds goldfish battery\n\n/// return the platform needed resouces include its AML data, irq number\n\n///\n\n/// # Arguments\n\n///\n\n/// * `amls` - the vector to put the goldfish battery AML\n\n/// * `battery_jail` - used when sandbox is enabled\n\n/// * `mmio_bus` - bus to add the devices to\n\n/// * `irq_chip` - the IrqChip object for registering irq events\n\n/// * `irq_num` - assigned interrupt to use\n\n/// * `resources` - the SystemAllocator to allocate IO and MMIO for acpi\n\npub fn add_goldfish_battery(\n\n amls: &mut Vec<u8>,\n\n battery_jail: Option<Minijail>,\n\n mmio_bus: &mut Bus,\n\n irq_chip: &mut impl IrqChip,\n\n irq_num: u32,\n\n resources: &mut SystemAllocator,\n\n) -> Result<Tube, DeviceRegistrationError> {\n\n let alloc = resources.get_anon_alloc();\n\n let mmio_base = resources\n\n .mmio_allocator(MmioType::Low)\n\n .allocate_with_align(\n\n devices::bat::GOLDFISHBAT_MMIO_LEN,\n\n alloc,\n\n \"GoldfishBattery\".to_string(),\n\n devices::bat::GOLDFISHBAT_MMIO_LEN,\n\n )\n\n .map_err(DeviceRegistrationError::AllocateIoResource)?;\n\n\n\n let irq_evt = Event::new().map_err(DeviceRegistrationError::EventCreate)?;\n","file_path":"arch/src/lib.rs","rank":78,"score":183031.64842608123},{"content":"/// Add serial options to the provided `cmdline` based on `serial_parameters`.\n\n/// `serial_io_type` should be \"io\" if the platform uses x86-style I/O ports for serial devices\n\n/// or \"mmio\" if the serial ports are memory mapped.\n\npub fn get_serial_cmdline(\n\n cmdline: &mut kernel_cmdline::Cmdline,\n\n serial_parameters: &BTreeMap<(SerialHardware, u8), SerialParameters>,\n\n serial_io_type: &str,\n\n) -> GetSerialCmdlineResult<()> {\n\n match serial_parameters\n\n .iter()\n\n .filter(|(_, p)| p.console)\n\n .map(|(k, _)| k)\n\n .next()\n\n {\n\n Some((SerialHardware::Serial, num)) => {\n\n cmdline\n\n .insert(\"console\", &format!(\"ttyS{}\", num - 1))\n\n .map_err(GetSerialCmdlineError::KernelCmdline)?;\n\n }\n\n Some((SerialHardware::VirtioConsole, num)) => {\n\n cmdline\n\n .insert(\"console\", &format!(\"hvc{}\", num - 1))\n\n .map_err(GetSerialCmdlineError::KernelCmdline)?;\n","file_path":"arch/src/serial.rs","rank":79,"score":183031.0317843838},{"content":"pub fn do_modify_battery(\n\n socket_path: &Path,\n\n battery_type: &str,\n\n property: &str,\n\n target: &str,\n\n) -> DoModifyBatteryResult {\n\n let response = match battery_type.parse::<BatteryType>() {\n\n Ok(type_) => match BatControlCommand::new(property.to_string(), target.to_string()) {\n\n Ok(cmd) => {\n\n let request = VmRequest::BatCommand(type_, cmd);\n\n Ok(handle_request(&request, socket_path)?)\n\n }\n\n Err(e) => Err(ModifyBatError::BatControlErr(e)),\n\n },\n\n Err(e) => Err(ModifyBatError::BatControlErr(e)),\n\n };\n\n\n\n match response {\n\n Ok(response) => {\n\n println!(\"{}\", response);\n","file_path":"vm_control/src/client.rs","rank":80,"score":183025.42065927084},{"content":"/// The intent of our panic hook is to get panic info and a stacktrace into the syslog, even for\n\n/// jailed subprocesses. It will always abort on panic to ensure a minidump is generated.\n\n///\n\n/// Note that jailed processes will usually have a stacktrace of <unknown> because the backtrace\n\n/// routines attempt to open this binary and are unable to do so in a jail.\n\npub fn set_panic_hook() {\n\n let default_panic = panic::take_hook();\n\n panic::set_hook(Box::new(move |info| {\n\n log_panic_info(default_panic.as_ref(), info);\n\n // Abort to trigger the crash reporter so that a minidump is generated.\n\n abort();\n\n }));\n\n}\n","file_path":"src/panic_hook.rs","rank":81,"score":183025.42065927084},{"content":"pub fn do_usb_attach(\n\n socket_path: &Path,\n\n bus: u8,\n\n addr: u8,\n\n vid: u16,\n\n pid: u16,\n\n dev_path: &Path,\n\n) -> ModifyUsbResult<UsbControlResult> {\n\n let usb_file: File = if dev_path.parent() == Some(Path::new(\"/proc/self/fd\")) {\n\n // Special case '/proc/self/fd/*' paths. The FD is already open, just use it.\n\n // Safe because we will validate |raw_fd|.\n\n unsafe { File::from_raw_descriptor(raw_descriptor_from_path(&dev_path)?) }\n\n } else {\n\n OpenOptions::new()\n\n .read(true)\n\n .write(true)\n\n .open(&dev_path)\n\n .map_err(|_| ModifyUsbError::UsbControl(UsbControlResult::FailedToOpenDevice))?\n\n };\n\n\n","file_path":"vm_control/src/client.rs","rank":82,"score":183025.42065927084},{"content":"/// Writes the command line string to the given memory slice.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `guest_mem` - A u8 slice that will be partially overwritten by the command line.\n\n/// * `guest_addr` - The address in `guest_mem` at which to load the command line.\n\n/// * `cmdline` - The kernel command line.\n\npub fn load_cmdline(\n\n guest_mem: &GuestMemory,\n\n guest_addr: GuestAddress,\n\n cmdline: &CStr,\n\n) -> Result<()> {\n\n let len = cmdline.to_bytes().len();\n\n if len == 0 {\n\n return Ok(());\n\n }\n\n\n\n let end = guest_addr\n\n .checked_add(len as u64 + 1)\n\n .ok_or(Error::CommandLineOverflow)?; // Extra for null termination.\n\n if end > guest_mem.end_addr() {\n\n return Err(Error::CommandLineOverflow);\n\n }\n\n\n\n guest_mem\n\n .write_at_addr(cmdline.to_bytes_with_nul(), guest_addr)\n\n .map_err(|_| Error::CommandLineCopy)?;\n","file_path":"kernel_loader/src/lib.rs","rank":83,"score":183025.42065927084},{"content":"/// Creates a mmio memory region for pstore.\n\npub fn create_memory_region(\n\n vm: &mut impl Vm,\n\n resources: &mut SystemAllocator,\n\n pstore: &Pstore,\n\n) -> Result<RamoopsRegion> {\n\n let file = OpenOptions::new()\n\n .read(true)\n\n .write(true)\n\n .create(true)\n\n .open(&pstore.path)\n\n .map_err(Error::IoError)?;\n\n file.set_len(pstore.size as u64).map_err(Error::IoError)?;\n\n\n\n let address = resources\n\n .mmio_allocator(MmioType::High)\n\n .allocate(pstore.size as u64, Alloc::Pstore, \"pstore\".to_owned())\n\n .map_err(Error::ResourcesError)?;\n\n\n\n let memory_mapping = MemoryMappingBuilder::new(pstore.size as usize)\n\n .from_file(&file)\n","file_path":"arch/src/pstore.rs","rank":84,"score":183025.42065927084},{"content":"/// Adds serial devices to the provided bus based on the serial parameters given.\n\n///\n\n/// Only devices with hardware type `SerialHardware::Serial` are added by this function.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `io_bus` - Bus to add the devices to\n\n/// * `com_evt_1_3` - event for com1 and com3\n\n/// * `com_evt_1_4` - event for com2 and com4\n\n/// * `io_bus` - Bus to add the devices to\n\n/// * `serial_parameters` - definitions of serial parameter configurations.\n\n/// All four of the traditional PC-style serial ports (COM1-COM4) must be specified.\n\npub fn add_serial_devices(\n\n protected_vm: ProtectionType,\n\n io_bus: &mut Bus,\n\n com_evt_1_3: &Event,\n\n com_evt_2_4: &Event,\n\n serial_parameters: &BTreeMap<(SerialHardware, u8), SerialParameters>,\n\n serial_jail: Option<Minijail>,\n\n) -> Result<(), DeviceRegistrationError> {\n\n for x in 0..=3 {\n\n let com_evt = match x {\n\n 0 => com_evt_1_3,\n\n 1 => com_evt_2_4,\n\n 2 => com_evt_1_3,\n\n 3 => com_evt_2_4,\n\n _ => com_evt_1_3,\n\n };\n\n\n\n let param = serial_parameters\n\n .get(&(SerialHardware::Serial, x + 1))\n\n .ok_or(DeviceRegistrationError::MissingRequiredSerialDevice(x + 1))?;\n","file_path":"arch/src/serial.rs","rank":85,"score":183025.42065927084},{"content":"fn finish_ioctl<W: Writer>(unique: u64, res: io::Result<Vec<u8>>, w: W) -> Result<usize> {\n\n let (out, data) = match res {\n\n Ok(data) => {\n\n let out = IoctlOut {\n\n result: 0,\n\n ..Default::default()\n\n };\n\n (out, Some(data))\n\n }\n\n Err(e) => {\n\n let out = IoctlOut {\n\n result: -e.raw_os_error().unwrap_or(libc::EIO),\n\n ..Default::default()\n\n };\n\n (out, None)\n\n }\n\n };\n\n reply_ok(Some(out), data.as_ref().map(|d| &d[..]), unique, w)\n\n}\n\n\n","file_path":"fuse/src/server.rs","rank":86,"score":182420.48030831665},{"content":"/// Records a log message with the given details.\n\n///\n\n/// Note that this will fail silently if syslog was not initialized.\n\n///\n\n/// # Arguments\n\n/// * `pri` - The `Priority` (i.e. severity) of the log message.\n\n/// * `fac` - The `Facility` of the log message. Usually `Facility::User` should be used.\n\n/// * `file_line` - Optional tuple of the name of the file that generated the\n\n/// log and the line number within that file.\n\n/// * `args` - The log's message to record, in the form of `format_args!()` return value\n\n///\n\n/// # Examples\n\n///\n\n/// ```\n\n/// # use sys_util::syslog;\n\n/// # if let Err(e) = syslog::init() {\n\n/// # println!(\"failed to initiailize syslog: {}\", e);\n\n/// # return;\n\n/// # }\n\n/// syslog::log(syslog::Priority::Error,\n\n/// syslog::Facility::User,\n\n/// Some((file!(), line!())),\n\n/// format_args!(\"hello syslog\"));\n\n/// ```\n\npub fn log(pri: Priority, fac: Facility, file_line: Option<(&str, u32)>, args: fmt::Arguments) {\n\n let mut state = lock!();\n\n let mut buf = [0u8; 1024];\n\n\n\n state.syslog.log(\n\n state.proc_name.as_ref().map(|s| s.as_ref()),\n\n pri,\n\n fac,\n\n file_line,\n\n args,\n\n );\n\n\n\n let res = {\n\n let mut buf_cursor = Cursor::new(&mut buf[..]);\n\n if let Some((file_name, line)) = &file_line {\n\n write!(&mut buf_cursor, \"[{}:{}:{}] \", pri, file_name, line)\n\n } else {\n\n Ok(())\n\n }\n\n .and_then(|()| writeln!(&mut buf_cursor, \"{}\", args))\n","file_path":"sys_util/src/syslog.rs","rank":87,"score":182088.94402947137},{"content":"fn fdt_offset(mem_size: u64, has_bios: bool) -> u64 {\n\n // TODO(rammuthiah) make kernel and BIOS startup use FDT from the same location. ARCVM startup\n\n // currently expects the kernel at 0x80080000 and the FDT at the end of RAM for unknown reasons.\n\n // Root cause and figure out how to fold these code paths together.\n\n if has_bios {\n\n AARCH64_FDT_OFFSET_IN_BIOS_MODE\n\n } else {\n\n // Put fdt up near the top of memory\n\n // TODO(sonnyrao): will have to handle this differently if there's\n\n // > 4GB memory\n\n mem_size - AARCH64_FDT_MAX_SIZE - 0x10000\n\n }\n\n}\n\n\n\npub struct AArch64;\n\n\n\nimpl arch::LinuxArch for AArch64 {\n\n type Error = Error;\n\n\n\n fn guest_memory_layout(\n","file_path":"aarch64/src/lib.rs","rank":88,"score":180704.76411255443},{"content":"/// Construct a bmRequestType value for a control request.\n\npub fn control_request_type(\n\n type_: ControlRequestType,\n\n dir: ControlRequestDataPhaseTransferDirection,\n\n recipient: ControlRequestRecipient,\n\n) -> u8 {\n\n ((type_ as u8) << CONTROL_REQUEST_TYPE_OFFSET)\n\n | ((dir as u8) << DATA_PHASE_DIRECTION_OFFSET)\n\n | (recipient as u8)\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn control_request_types() {\n\n assert_eq!(\n\n control_request_type(\n\n ControlRequestType::Standard,\n\n ControlRequestDataPhaseTransferDirection::HostToDevice,\n","file_path":"usb_util/src/types.rs","rank":89,"score":180185.41019897864},{"content":"/// Add the default serial parameters for serial ports that have not already been specified.\n\n///\n\n/// This ensures that `serial_parameters` will contain parameters for each of the four PC-style\n\n/// serial ports (COM1-COM4).\n\n///\n\n/// It also sets the first `SerialHardware::Serial` to be the default console device if no other\n\n/// serial parameters exist with console=true and the first serial device has not already been\n\n/// configured explicitly.\n\npub fn set_default_serial_parameters(\n\n serial_parameters: &mut BTreeMap<(SerialHardware, u8), SerialParameters>,\n\n) {\n\n // If no console device exists and the first serial port has not been specified,\n\n // set the first serial port as a stdout+stdin console.\n\n let default_console = (SerialHardware::Serial, 1);\n\n if !serial_parameters.iter().any(|(_, p)| p.console) {\n\n serial_parameters\n\n .entry(default_console)\n\n .or_insert(SerialParameters {\n\n type_: SerialType::Stdout,\n\n hardware: SerialHardware::Serial,\n\n path: None,\n\n input: None,\n\n num: 1,\n\n console: true,\n\n earlycon: false,\n\n stdin: true,\n\n });\n\n }\n","file_path":"arch/src/serial.rs","rank":90,"score":180185.41019897864},{"content":"#[inline]\n\nfn usize_to_u64(val: usize) -> u64 {\n\n val.try_into().expect(\"`usize` doesn't fit inside a `u64`\")\n\n}\n\n\n\npub struct PendingOperation {\n\n waker_token: Option<WakerToken>,\n\n ex: Weak<RawExecutor>,\n\n submitted: bool,\n\n}\n\n\n\nimpl Future for PendingOperation {\n\n type Output = Result<u32>;\n\n\n\n fn poll(mut self: Pin<&mut Self>, cx: &mut Context) -> Poll<Self::Output> {\n\n let token = self\n\n .waker_token\n\n .as_ref()\n\n .expect(\"PendingOperation polled after returning Poll::Ready\");\n\n if let Some(ex) = self.ex.upgrade() {\n\n if let Some(result) = ex.get_result(token, cx) {\n","file_path":"cros_async/src/uring_executor.rs","rank":91,"score":178992.64154008956},{"content":"// Unwrap ast to get the named fields. We only care about field names and types:\n\n// \"myfield : BitField3\" -> (\"myfield\", Token(BitField3))\n\nfn get_struct_fields(fields: &FieldsNamed) -> Result<Vec<FieldSpec>> {\n\n let mut vec = Vec::new();\n\n\n\n for field in &fields.named {\n\n let ident = field\n\n .ident\n\n .as_ref()\n\n .expect(\"Fields::Named has named fields\");\n\n let ty = &field.ty;\n\n let expected_bits = parse_bits_attr(&field.attrs)?;\n\n vec.push(FieldSpec {\n\n ident,\n\n ty,\n\n expected_bits,\n\n });\n\n }\n\n\n\n Ok(vec)\n\n}\n\n\n","file_path":"bit_field/bit_field_derive/bit_field_derive.rs","rank":92,"score":178891.3579755898},{"content":"fn from_sample_format(format: SampleFormat) -> u8 {\n\n match format {\n\n SampleFormat::U8 => VIRTIO_SND_PCM_FMT_U8,\n\n SampleFormat::S16LE => VIRTIO_SND_PCM_FMT_U16,\n\n SampleFormat::S24LE => VIRTIO_SND_PCM_FMT_U24,\n\n SampleFormat::S32LE => VIRTIO_SND_PCM_FMT_U32,\n\n }\n\n}\n\n\n","file_path":"devices/src/virtio/snd/vios_backend/shm_streams.rs","rank":93,"score":178564.5976197162},{"content":"fn bitfield_enum_with_width_impl(\n\n ast: &DeriveInput,\n\n data: &DataEnum,\n\n width: u64,\n\n) -> Result<TokenStream> {\n\n if width > 64 {\n\n return Err(Error::new(\n\n Span::call_site(),\n\n \"max width of bitfield enum is 64\",\n\n ));\n\n }\n\n let bits = width as u8;\n\n let declare_discriminants = get_declare_discriminants_for_enum(bits, ast, data);\n\n\n\n let ident = &ast.ident;\n\n let type_name = ident.to_string();\n\n let variants = &data.variants;\n\n let match_discriminants = variants.iter().map(|variant| {\n\n let variant = &variant.ident;\n\n quote! {\n","file_path":"bit_field/bit_field_derive/bit_field_derive.rs","rank":94,"score":178031.0601430477},{"content":"/// Helper function to submit usb_transfer to device handle.\n\npub fn submit_transfer(\n\n fail_handle: Arc<dyn FailHandle>,\n\n job_queue: &Arc<AsyncJobQueue>,\n\n xhci_transfer: Arc<XhciTransfer>,\n\n device: &mut Device,\n\n usb_transfer: Transfer,\n\n) -> Result<()> {\n\n let transfer_status = {\n\n // We need to hold the lock to avoid race condition.\n\n // While we are trying to submit the transfer, another thread might want to cancel the same\n\n // transfer. Holding the lock here makes sure one of them is cancelled.\n\n let mut state = xhci_transfer.state().lock();\n\n match mem::replace(&mut *state, XhciTransferState::Cancelled) {\n\n XhciTransferState::Created => {\n\n match device.submit_transfer(usb_transfer) {\n\n Err(e) => {\n\n error!(\"fail to submit transfer {:?}\", e);\n\n *state = XhciTransferState::Completed;\n\n TransferStatus::NoDevice\n\n }\n","file_path":"devices/src/usb/host_backend/utils.rs","rank":95,"score":177496.98829326447},{"content":"/// Test utility function to create a descriptor chain in guest memory.\n\npub fn create_descriptor_chain(\n\n memory: &GuestMemory,\n\n descriptor_array_addr: GuestAddress,\n\n mut buffers_start_addr: GuestAddress,\n\n descriptors: Vec<(DescriptorType, u32)>,\n\n spaces_between_regions: u32,\n\n) -> Result<DescriptorChain> {\n\n let descriptors_len = descriptors.len();\n\n for (index, (type_, size)) in descriptors.into_iter().enumerate() {\n\n let mut flags = 0;\n\n if let DescriptorType::Writable = type_ {\n\n flags |= VIRTQ_DESC_F_WRITE;\n\n }\n\n if index + 1 < descriptors_len {\n\n flags |= VIRTQ_DESC_F_NEXT;\n\n }\n\n\n\n let index = index as u16;\n\n let desc = virtq_desc {\n\n addr: buffers_start_addr.offset().into(),\n","file_path":"devices/src/virtio/descriptor_utils.rs","rank":96,"score":177496.98829326447},{"content":"pub fn get_resource_info(\n\n tube: &Tube,\n\n request: ResourceRequest,\n\n) -> std::result::Result<ResourceInfo, ResourceBridgeError> {\n\n if let Err(e) = tube.send(&request) {\n\n return Err(ResourceBridgeError::SendFailure(request, e));\n\n }\n\n\n\n match tube.recv() {\n\n Ok(ResourceResponse::Resource(info)) => Ok(info),\n\n Ok(ResourceResponse::Invalid) => Err(ResourceBridgeError::InvalidResource(request)),\n\n Err(e) => Err(ResourceBridgeError::RecieveFailure(request, e)),\n\n }\n\n}\n","file_path":"devices/src/virtio/resource_bridge.rs","rank":97,"score":177496.98829326447},{"content":"/// Load an image from a file into guest memory.\n\n///\n\n/// # Arguments\n\n///\n\n/// * `guest_mem` - The memory to be used by the guest.\n\n/// * `guest_addr` - The starting address to load the image in the guest memory.\n\n/// * `max_size` - The amount of space in bytes available in the guest memory for the image.\n\n/// * `image` - The file containing the image to be loaded.\n\n///\n\n/// The size in bytes of the loaded image is returned.\n\npub fn load_image<F>(\n\n guest_mem: &GuestMemory,\n\n image: &mut F,\n\n guest_addr: GuestAddress,\n\n max_size: u64,\n\n) -> Result<usize, LoadImageError>\n\nwhere\n\n F: Read + Seek + AsRawDescriptor,\n\n{\n\n let size = image.seek(SeekFrom::End(0)).map_err(LoadImageError::Seek)?;\n\n\n\n if size > usize::max_value() as u64 || size > max_size {\n\n return Err(LoadImageError::ImageSizeTooLarge(size));\n\n }\n\n\n\n // This is safe due to the bounds check above.\n\n let size = size as usize;\n\n\n\n image\n\n .seek(SeekFrom::Start(0))\n\n .map_err(LoadImageError::Seek)?;\n\n\n\n guest_mem\n\n .read_to_memory(guest_addr, image, size)\n\n .map_err(LoadImageError::ReadToMemory)?;\n\n\n\n Ok(size)\n\n}\n\n\n","file_path":"arch/src/lib.rs","rank":98,"score":176831.00768807397},{"content":"#[inline(always)]\n\npub fn pagesize() -> usize {\n\n // Trivially safe\n\n unsafe { sysconf(_SC_PAGESIZE) as usize }\n\n}\n\n\n","file_path":"sys_util/src/lib.rs","rank":99,"score":176825.85628149443}],"string":"[\n {\n \"content\": \"/// Returns a Vec of the valid memory addresses.\\n\\n/// These should be used to configure the GuestMemory structure for the platfrom.\\n\\npub fn arch_memory_regions(size: u64) -> Vec<(GuestAddress, u64)> {\\n\\n vec![(GuestAddress(AARCH64_PHYS_MEM_START), size)]\\n\\n}\\n\\n\\n\",\n \"file_path\": \"aarch64/src/lib.rs\",\n \"rank\": 0,\n \"score\": 321065.8048601196\n },\n {\n \"content\": \"/// Helper function to wrap up a closure with fail handle. The fail handle will be triggered if the\\n\\n/// closure returns an error.\\n\\npub fn fallible_closure<E: std::fmt::Display, C: FnMut() -> Result<(), E> + 'static + Send>(\\n\\n fail_handle: Arc<dyn FailHandle>,\\n\\n mut callback: C,\\n\\n) -> impl FnMut() + 'static + Send {\\n\\n move || match callback() {\\n\\n Ok(()) => {}\\n\\n Err(e) => {\\n\\n error!(\\\"callback failed {}\\\", e);\\n\\n fail_handle.fail();\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n use std::sync::{Arc, Mutex};\\n\\n\\n\\n fn task(_: RingBufferStopCallback) {}\\n\\n\\n\",\n \"file_path\": \"devices/src/usb/xhci/ring_buffer_stop_cb.rs\",\n \"rank\": 1,\n \"score\": 315007.1257591103\n },\n {\n \"content\": \"/// Does the same as push_fds, but using the RawDescriptorType\\n\\npub fn push_descriptors(descriptors: &mut Vec<RawDescriptor>) {\\n\\n push_fds(descriptors)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sys_util/src/syslog.rs\",\n \"rank\": 2,\n \"score\": 304844.5186512809\n },\n {\n \"content\": \"/// Retrieves the file descriptors owned by the global syslogger.\\n\\n///\\n\\n/// Does nothing if syslog was never initialized. If their are any file descriptors, they will be\\n\\n/// pushed into `fds`.\\n\\n///\\n\\n/// Note that the `stderr` file descriptor is never added, as it is not owned by syslog.\\n\\npub fn push_fds(fds: &mut Vec<RawFd>) {\\n\\n let state = lock!();\\n\\n state.syslog.push_fds(fds);\\n\\n fds.extend(state.file.iter().map(|f| f.as_raw_fd()));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sys_util/src/syslog.rs\",\n \"rank\": 3,\n \"score\": 304838.06589525647\n },\n {\n \"content\": \"/// Instantiates a VirtioInputConfig object with the default configuration for a trackpad. It\\n\\n/// supports touch, left button and right button events, as well as X and Y axis.\\n\\npub fn new_trackpad_config(width: u32, height: u32) -> VirtioInputConfig {\\n\\n VirtioInputConfig::new(\\n\\n virtio_input_device_ids::new(0, 0, 0, 0),\\n\\n b\\\"Crosvm Virtio Trackpad\\\".to_vec(),\\n\\n b\\\"virtio-trackpad\\\".to_vec(),\\n\\n virtio_input_bitmap::new([0u8; 128]),\\n\\n default_trackpad_events(),\\n\\n default_trackpad_absinfo(width, height),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"devices/src/virtio/input/defaults.rs\",\n \"rank\": 4,\n \"score\": 281455.6090706681\n },\n {\n \"content\": \"/// Copy virtio device configuration data from a subslice of `src` to a subslice of `dst`.\\n\\n/// Unlike std::slice::copy_from_slice(), this function copies as much as possible within\\n\\n/// the common subset of the two slices, truncating the requested range instead of\\n\\n/// panicking if the slices do not match in size.\\n\\n///\\n\\n/// `dst_offset` and `src_offset` specify the starting indexes of the `dst` and `src`\\n\\n/// slices, respectively; if either index is out of bounds, this function is a no-op\\n\\n/// rather than panicking. This makes it safe to call with arbitrary user-controlled\\n\\n/// inputs.\\n\\npub fn copy_config(dst: &mut [u8], dst_offset: u64, src: &[u8], src_offset: u64) {\\n\\n if let Ok(dst_offset) = usize::try_from(dst_offset) {\\n\\n if let Ok(src_offset) = usize::try_from(src_offset) {\\n\\n if let Some(dst_slice) = dst.get_mut(dst_offset..) {\\n\\n if let Some(src_slice) = src.get(src_offset..) {\\n\\n let len = cmp::min(dst_slice.len(), src_slice.len());\\n\\n let dst_subslice = &mut dst_slice[0..len];\\n\\n let src_subslice = &src_slice[0..len];\\n\\n dst_subslice.copy_from_slice(src_subslice);\\n\\n }\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"devices/src/virtio/mod.rs\",\n \"rank\": 5,\n \"score\": 279545.2904768888\n },\n {\n \"content\": \"/// Instantiates a VirtioInputConfig object with the default configuration for a multitouch\\n\\n/// touchscreen.\\n\\npub fn new_multi_touch_config(width: u32, height: u32) -> VirtioInputConfig {\\n\\n VirtioInputConfig::new(\\n\\n virtio_input_device_ids::new(0, 0, 0, 0),\\n\\n b\\\"Crosvm Virtio Multitouch Touchscreen\\\".to_vec(),\\n\\n b\\\"virtio-touchscreen\\\".to_vec(),\\n\\n virtio_input_bitmap::from_bits(&[INPUT_PROP_DIRECT]),\\n\\n default_multitouchscreen_events(),\\n\\n default_multitouchscreen_absinfo(width, height, 10, 10),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"devices/src/virtio/input/defaults.rs\",\n \"rank\": 6,\n \"score\": 277807.93345490645\n },\n {\n \"content\": \"/// Instantiates a VirtioInputConfig object with the default configuration for a touchscreen (no\\n\\n/// multitouch support).\\n\\npub fn new_single_touch_config(width: u32, height: u32) -> VirtioInputConfig {\\n\\n VirtioInputConfig::new(\\n\\n virtio_input_device_ids::new(0, 0, 0, 0),\\n\\n b\\\"Crosvm Virtio Touchscreen\\\".to_vec(),\\n\\n b\\\"virtio-touchscreen\\\".to_vec(),\\n\\n virtio_input_bitmap::from_bits(&[INPUT_PROP_DIRECT]),\\n\\n default_touchscreen_events(),\\n\\n default_touchscreen_absinfo(width, height),\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"devices/src/virtio/input/defaults.rs\",\n \"rank\": 7,\n \"score\": 277807.93345490645\n },\n {\n \"content\": \"// For the specified (Base, Len), returns (base, len) pair which could be\\n\\n// set into mtrr register. mtrr requires: the base-address alignment value can't be\\n\\n// less than its length\\n\\nfn get_mtrr_pairs(base: u64, len: u64) -> Vec<(u64, u64)> {\\n\\n let mut vecs = Vec::new();\\n\\n\\n\\n let mut remains = len;\\n\\n let mut new = base;\\n\\n while remains != 0 {\\n\\n let max = get_max_len(new, remains);\\n\\n vecs.push((new, max));\\n\\n remains -= max;\\n\\n new += max;\\n\\n }\\n\\n\\n\\n vecs\\n\\n}\\n\\n\\n\",\n \"file_path\": \"x86_64/src/regs.rs\",\n \"rank\": 8,\n \"score\": 266523.9820278699\n },\n {\n \"content\": \"fn append_mtrr_entries(vpu: &dyn VcpuX86_64, pci_start: u64, entries: &mut Vec<Register>) {\\n\\n // Get VAR MTRR num from MSR_MTRRcap\\n\\n let mut msrs = vec![Register {\\n\\n id: crate::msr_index::MSR_MTRRcap,\\n\\n ..Default::default()\\n\\n }];\\n\\n if vpu.get_msrs(&mut msrs).is_err() {\\n\\n warn!(\\\"get msrs fail, guest with pass through device may be very slow\\\");\\n\\n return;\\n\\n }\\n\\n let var_num = msrs[0].value & VAR_MTRR_NUM_MASK;\\n\\n\\n\\n // Set pci_start .. 4G as UC\\n\\n // all others are set to default WB\\n\\n let pci_len = (1 << 32) - pci_start;\\n\\n let vecs = get_mtrr_pairs(pci_start, pci_len);\\n\\n if vecs.len() as u64 > var_num {\\n\\n warn!(\\n\\n \\\"mtrr fail for pci mmio, please check pci_start addr,\\n\\n guest with pass through device may be very slow\\\"\\n\",\n \"file_path\": \"x86_64/src/regs.rs\",\n \"rank\": 9,\n \"score\": 260584.29370246537\n },\n {\n \"content\": \"// Reads the next u64 from the file.\\n\\nfn read_u64_from_file(mut f: &File) -> Result<u64> {\\n\\n let mut value = [0u8; 8];\\n\\n (&mut f)\\n\\n .read_exact(&mut value)\\n\\n .map_err(Error::ReadingHeader)?;\\n\\n Ok(u64::from_be_bytes(value))\\n\\n}\\n\\n\\n\\nimpl QcowHeader {\\n\\n /// Creates a QcowHeader from a reference to a file.\\n\\n pub fn new(f: &mut File) -> Result<QcowHeader> {\\n\\n f.seek(SeekFrom::Start(0)).map_err(Error::ReadingHeader)?;\\n\\n\\n\\n let magic = read_u32_from_file(f)?;\\n\\n if magic != QCOW_MAGIC {\\n\\n return Err(Error::InvalidMagic);\\n\\n }\\n\\n\\n\\n let mut header = QcowHeader {\\n\\n magic,\\n\",\n \"file_path\": \"disk/src/qcow/mod.rs\",\n \"rank\": 10,\n \"score\": 246513.91643149132\n },\n {\n \"content\": \"/// Returns a Vec of the valid memory addresses.\\n\\n/// These should be used to configure the GuestMemory structure for the platform.\\n\\n/// For x86_64 all addresses are valid from the start of the kernel except a\\n\\n/// carve out at the end of 32bit address space.\\n\\nfn arch_memory_regions(size: u64, bios_size: Option<u64>) -> Vec<(GuestAddress, u64)> {\\n\\n let mem_end = GuestAddress(size);\\n\\n let first_addr_past_32bits = GuestAddress(FIRST_ADDR_PAST_32BITS);\\n\\n let end_32bit_gap_start = GuestAddress(END_ADDR_BEFORE_32BITS);\\n\\n\\n\\n let mut regions = Vec::new();\\n\\n if mem_end <= end_32bit_gap_start {\\n\\n regions.push((GuestAddress(0), size));\\n\\n if let Some(bios_size) = bios_size {\\n\\n regions.push((bios_start(bios_size), bios_size));\\n\\n }\\n\\n } else {\\n\\n regions.push((GuestAddress(0), end_32bit_gap_start.offset()));\\n\\n if let Some(bios_size) = bios_size {\\n\\n regions.push((bios_start(bios_size), bios_size));\\n\\n }\\n\\n regions.push((\\n\\n first_addr_past_32bits,\\n\\n mem_end.offset_from(end_32bit_gap_start),\\n\\n ));\\n\",\n \"file_path\": \"x86_64/src/lib.rs\",\n \"rank\": 11,\n \"score\": 244626.96961802477\n },\n {\n \"content\": \"fn read_u64<T: Read>(readable: &mut T) -> u64 {\\n\\n let mut buf = [0u8; size_of::<u64>()];\\n\\n readable.read_exact(&mut buf[..]).unwrap();\\n\\n u64::from_le_bytes(buf)\\n\\n}\\n\",\n \"file_path\": \"fuzz/block_fuzzer.rs\",\n \"rank\": 12,\n \"score\": 241066.2587728423\n },\n {\n \"content\": \"fn read_u64<T: Read>(readable: &mut T) -> u64 {\\n\\n let mut buf = [0u8; size_of::<u64>()];\\n\\n readable.read_exact(&mut buf[..]).unwrap();\\n\\n u64::from_le_bytes(buf)\\n\\n}\\n\",\n \"file_path\": \"fuzz/qcow_fuzzer.rs\",\n \"rank\": 13,\n \"score\": 241066.2587728423\n },\n {\n \"content\": \"/// Drops all capabilities (permitted, inheritable, and effective) from the current process.\\n\\npub fn drop_capabilities() -> Result<()> {\\n\\n unsafe {\\n\\n // Safe because we do not actually manipulate any memory handled by libcap\\n\\n // and we check errors.\\n\\n let caps = cap_init();\\n\\n if caps.is_null() {\\n\\n return errno_result();\\n\\n }\\n\\n\\n\\n // Freshly initialized capabilities do not have any bits set, so applying them\\n\\n // will drop all capabilities from the process.\\n\\n // Safe because we will check the result and otherwise do not touch the memory.\\n\\n let ret = cap_set_proc(caps);\\n\\n // We need to free capabilities regardless of success of the operation above.\\n\\n cap_free(caps);\\n\\n // Now check if we managed to apply (drop) capabilities.\\n\\n if ret < 0 {\\n\\n return errno_result();\\n\\n }\\n\\n }\\n\\n Ok(())\\n\\n}\\n\",\n \"file_path\": \"sys_util/src/capabilities.rs\",\n \"rank\": 15,\n \"score\": 239129.78298568385\n },\n {\n \"content\": \"/// Allows the use of any serde deserializer within a closure while providing access to the a set of\\n\\n/// descriptors for use in `deserialize_descriptor`.\\n\\n///\\n\\n/// This is the corresponding call to use deserialize after using `SerializeDescriptors`.\\n\\n///\\n\\n/// If `deserialize_with_descriptors` is called anywhere within the given closure, it return an\\n\\n/// error.\\n\\npub fn deserialize_with_descriptors<F, T, E>(\\n\\n f: F,\\n\\n descriptors: &mut Vec<Option<SafeDescriptor>>,\\n\\n) -> Result<T, E>\\n\\nwhere\\n\\n F: FnOnce() -> Result<T, E>,\\n\\n E: de::Error,\\n\\n{\\n\\n let swap_descriptors = std::mem::take(descriptors);\\n\\n set_descriptor_src(swap_descriptors).map_err(E::custom)?;\\n\\n\\n\\n // catch_unwind is used to ensure that set_descriptor_src is always balanced with a call to\\n\\n // take_descriptor_src afterwards.\\n\\n let res = catch_unwind(AssertUnwindSafe(f));\\n\\n\\n\\n // unwrap is used because set_descriptor_src is always called before this, so it should never\\n\\n // panic.\\n\\n *descriptors = take_descriptor_src().unwrap();\\n\\n\\n\\n match res {\\n\",\n \"file_path\": \"sys_util/src/descriptor_reflection.rs\",\n \"rank\": 16,\n \"score\": 237268.93405673082\n },\n {\n \"content\": \"#[doc(hidden)]\\n\\n#[inline]\\n\\npub fn max<T: BitFieldSpecifier>() -> u64 {\\n\\n if T::FIELD_WIDTH < 64 {\\n\\n (1 << T::FIELD_WIDTH) - 1\\n\\n } else {\\n\\n u64::max_value()\\n\\n }\\n\\n}\\n\\n\\n\\n// Defines bit_field::BitField0 through bit_field::BitField64.\\n\\nbit_field_derive::define_bit_field_specifiers!();\\n\\n\\n\\nimpl BitFieldSpecifier for bool {\\n\\n const FIELD_WIDTH: u8 = 1;\\n\\n type SetterType = bool;\\n\\n type GetterType = bool;\\n\\n\\n\\n #[inline]\\n\\n fn from_u64(val: u64) -> Self::GetterType {\\n\\n val > 0\\n\\n }\\n\",\n \"file_path\": \"bit_field/src/lib.rs\",\n \"rank\": 17,\n \"score\": 237050.53350922512\n },\n {\n \"content\": \"// Strips any `user.virtiofs.` prefix from `buf`. If buf contains one or more nul-bytes, each\\n\\n// nul-byte-separated slice is treated as a C string and the prefix is stripped from each one.\\n\\nfn strip_xattr_prefix(buf: &mut Vec<u8>) {\\n\\n fn next_cstr(b: &[u8], start: usize) -> Option<&[u8]> {\\n\\n if start >= b.len() {\\n\\n return None;\\n\\n }\\n\\n\\n\\n let end = b[start..]\\n\\n .iter()\\n\\n .position(|&c| c == b'\\\\0')\\n\\n .map(|p| start + p + 1)\\n\\n .unwrap_or(b.len());\\n\\n\\n\\n Some(&b[start..end])\\n\\n }\\n\\n\\n\\n let mut pos = 0;\\n\\n while let Some(name) = next_cstr(&buf, pos) {\\n\\n if !name.starts_with(USER_VIRTIOFS_XATTR) {\\n\\n pos += name.len();\\n\\n continue;\\n\",\n \"file_path\": \"devices/src/virtio/fs/passthrough.rs\",\n \"rank\": 18,\n \"score\": 234363.23688900663\n },\n {\n \"content\": \"/// Fills `output` completely with random bytes from the specified `source`.\\n\\npub fn rand_bytes(mut output: &mut [u8], source: Source) -> Result<()> {\\n\\n if output.is_empty() {\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n loop {\\n\\n // Safe because output is mutable and the writes are limited by output.len().\\n\\n let bytes = handle_eintr_errno!(unsafe {\\n\\n libc::getrandom(\\n\\n output.as_mut_ptr() as *mut c_void,\\n\\n output.len(),\\n\\n source.to_getrandom_flags(),\\n\\n )\\n\\n });\\n\\n\\n\\n if bytes < 0 {\\n\\n return errno_result();\\n\\n }\\n\\n if bytes as usize == output.len() {\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n // Wait for more entropy and try again for the remaining bytes.\\n\\n sleep(POLL_INTERVAL);\\n\\n output = &mut output[bytes as usize..];\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sys_util/src/rand.rs\",\n \"rank\": 19,\n \"score\": 234297.16211588396\n },\n {\n \"content\": \"fn convert_copy<R, W>(reader: &mut R, writer: &mut W, offset: u64, size: u64) -> Result<()>\\n\\nwhere\\n\\n R: Read + Seek,\\n\\n W: Write + Seek,\\n\\n{\\n\\n const CHUNK_SIZE: usize = 65536;\\n\\n let mut buf = [0; CHUNK_SIZE];\\n\\n let mut read_count = 0;\\n\\n reader\\n\\n .seek(SeekFrom::Start(offset))\\n\\n .map_err(Error::SeekingFile)?;\\n\\n writer\\n\\n .seek(SeekFrom::Start(offset))\\n\\n .map_err(Error::SeekingFile)?;\\n\\n loop {\\n\\n let this_count = min(CHUNK_SIZE as u64, size - read_count) as usize;\\n\\n let nread = reader\\n\\n .read(&mut buf[..this_count])\\n\\n .map_err(Error::ReadingData)?;\\n\\n writer.write(&buf[..nread]).map_err(Error::WritingData)?;\\n\\n read_count += nread as u64;\\n\\n if nread == 0 || read_count == size {\\n\\n break;\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"disk/src/disk.rs\",\n \"rank\": 20,\n \"score\": 234174.32229302704\n },\n {\n \"content\": \"/// Retrieves the signal mask of the current thread as a vector of c_ints.\\n\\npub fn get_blocked_signals() -> SignalResult<Vec<c_int>> {\\n\\n let mut mask = Vec::new();\\n\\n\\n\\n // Safe - return values are checked.\\n\\n unsafe {\\n\\n let mut old_sigset: sigset_t = mem::zeroed();\\n\\n let ret = pthread_sigmask(SIG_BLOCK, null(), &mut old_sigset as *mut sigset_t);\\n\\n if ret < 0 {\\n\\n return Err(Error::RetrieveSignalMask(ret));\\n\\n }\\n\\n\\n\\n for num in 0..=SIGRTMAX() {\\n\\n if sigismember(&old_sigset, num) > 0 {\\n\\n mask.push(num);\\n\\n }\\n\\n }\\n\\n }\\n\\n\\n\\n Ok(mask)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sys_util/src/signal.rs\",\n \"rank\": 21,\n \"score\": 233706.17294795119\n },\n {\n \"content\": \"/// Enables real time thread priorities in the current thread up to `limit`.\\n\\npub fn set_rt_prio_limit(limit: u64) -> Result<()> {\\n\\n let rt_limit_arg = libc::rlimit {\\n\\n rlim_cur: limit as libc::rlim_t,\\n\\n rlim_max: limit as libc::rlim_t,\\n\\n };\\n\\n // Safe because the kernel doesn't modify memory that is accessible to the process here.\\n\\n let res = unsafe { libc::setrlimit(libc::RLIMIT_RTPRIO, &rt_limit_arg) };\\n\\n\\n\\n if res != 0 {\\n\\n errno_result()\\n\\n } else {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sys_util/src/priority.rs\",\n \"rank\": 22,\n \"score\": 233592.66616579602\n },\n {\n \"content\": \"/// Returns the set of reserved base features common to all virtio devices.\\n\\npub fn base_features(protected_vm: ProtectionType) -> u64 {\\n\\n let mut features: u64 = 1 << VIRTIO_F_VERSION_1;\\n\\n\\n\\n if protected_vm == ProtectionType::Protected {\\n\\n features |= 1 << VIRTIO_F_ACCESS_PLATFORM;\\n\\n }\\n\\n\\n\\n features\\n\\n}\\n\",\n \"file_path\": \"devices/src/virtio/mod.rs\",\n \"rank\": 23,\n \"score\": 233592.66616579602\n },\n {\n \"content\": \"fn set_features(vu: &mut Master, avail_features: u64, ack_features: u64) -> Result<u64> {\\n\\n let features = avail_features & ack_features;\\n\\n vu.set_features(features).map_err(Error::SetFeatures)?;\\n\\n Ok(features)\\n\\n}\\n\\n\\n\\npub struct VhostUserHandler {\\n\\n vu: Master,\\n\\n pub avail_features: u64,\\n\\n acked_features: u64,\\n\\n protocol_features: VhostUserProtocolFeatures,\\n\\n}\\n\\n\\n\\nimpl VhostUserHandler {\\n\\n /// Creates a `VhostUserHandler` instance with features and protocol features initialized.\\n\\n pub fn new(\\n\\n mut vu: Master,\\n\\n allow_features: u64,\\n\\n init_features: u64,\\n\\n allow_protocol_features: VhostUserProtocolFeatures,\\n\",\n \"file_path\": \"devices/src/virtio/vhost/user/handler.rs\",\n \"rank\": 24,\n \"score\": 233130.58169376486\n },\n {\n \"content\": \"/// Parses a slice of valid frame formats and the desired resolution\\n\\n/// and returns the closest available resolution.\\n\\npub fn find_closest_resolution(\\n\\n frame_formats: &[FrameFormat],\\n\\n desired_width: u32,\\n\\n desired_height: u32,\\n\\n) -> (u32, u32) {\\n\\n for FrameFormat { width, height, .. } in frame_formats.iter() {\\n\\n if desired_width < width.min || desired_width > width.max {\\n\\n continue;\\n\\n }\\n\\n if desired_height < height.min || desired_height > height.max {\\n\\n continue;\\n\\n }\\n\\n let allowed_width = clamp_size(desired_width, width.min, width.step);\\n\\n let allowed_height = clamp_size(desired_height, height.min, height.step);\\n\\n return (allowed_width, allowed_height);\\n\\n }\\n\\n\\n\\n // Return the resolution with maximum surface if nothing better is found.\\n\\n match frame_formats\\n\\n .iter()\\n\",\n \"file_path\": \"devices/src/virtio/video/format.rs\",\n \"rank\": 25,\n \"score\": 226884.98740649916\n },\n {\n \"content\": \"fn create_integer(v: usize, bytes: &mut Vec<u8>) {\\n\\n if v <= u8::max_value().into() {\\n\\n (v as u8).to_aml_bytes(bytes);\\n\\n } else if v <= u16::max_value().into() {\\n\\n (v as u16).to_aml_bytes(bytes);\\n\\n } else if v <= u32::max_value() as usize {\\n\\n (v as u32).to_aml_bytes(bytes);\\n\\n } else {\\n\\n (v as u64).to_aml_bytes(bytes);\\n\\n }\\n\\n}\\n\\n\\n\\npub type Usize = usize;\\n\\n\\n\\nimpl Aml for Usize {\\n\\n fn to_aml_bytes(&self, bytes: &mut Vec<u8>) {\\n\\n create_integer(*self, bytes);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"acpi_tables/src/aml.rs\",\n \"rank\": 26,\n \"score\": 226196.26416858245\n },\n {\n \"content\": \"pub fn gdb_thread(mut gdbstub: GdbStub, port: u32) {\\n\\n let addr = format!(\\\"0.0.0.0:{}\\\", port);\\n\\n let listener = match TcpListener::bind(addr.clone()) {\\n\\n Ok(s) => s,\\n\\n Err(e) => {\\n\\n error!(\\\"Failed to create a TCP listener: {}\\\", e);\\n\\n return;\\n\\n }\\n\\n };\\n\\n info!(\\\"Waiting for a GDB connection on {:?}...\\\", addr);\\n\\n\\n\\n let (stream, addr) = match listener.accept() {\\n\\n Ok(v) => v,\\n\\n Err(e) => {\\n\\n error!(\\\"Failed to accept a connection from GDB: {}\\\", e);\\n\\n return;\\n\\n }\\n\\n };\\n\\n info!(\\\"GDB connected from {}\\\", addr);\\n\\n\\n\",\n \"file_path\": \"src/gdb.rs\",\n \"rank\": 27,\n \"score\": 225468.52568076248\n },\n {\n \"content\": \"/// Configure base registers for x86\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `vcpu` - Structure for the vcpu that holds the vcpu fd.\\n\\n/// * `boot_ip` - Starting instruction pointer.\\n\\n/// * `boot_sp` - Starting stack pointer.\\n\\n/// * `boot_si` - Must point to zero page address per Linux ABI.\\n\\npub fn setup_regs(vcpu: &dyn VcpuX86_64, boot_ip: u64, boot_sp: u64, boot_si: u64) -> Result<()> {\\n\\n let regs = Regs {\\n\\n rflags: 0x0000000000000002u64,\\n\\n rip: boot_ip,\\n\\n rsp: boot_sp,\\n\\n rbp: boot_sp,\\n\\n rsi: boot_si,\\n\\n ..Default::default()\\n\\n };\\n\\n\\n\\n vcpu.set_regs(®s).map_err(Error::SettingRegistersIoctl)\\n\\n}\\n\\n\\n\\nconst X86_CR0_PE: u64 = 0x1;\\n\\nconst X86_CR0_PG: u64 = 0x80000000;\\n\\nconst X86_CR4_PAE: u64 = 0x20;\\n\\n\\n\\nconst EFER_LME: u64 = 0x100;\\n\\nconst EFER_LMA: u64 = 0x400;\\n\\n\\n\\nconst BOOT_GDT_OFFSET: u64 = 0x500;\\n\\nconst BOOT_IDT_OFFSET: u64 = 0x520;\\n\\n\\n\\nconst BOOT_GDT_MAX: usize = 4;\\n\\n\\n\",\n \"file_path\": \"x86_64/src/regs.rs\",\n \"rank\": 28,\n \"score\": 223437.60558572723\n },\n {\n \"content\": \"pub fn canonical_image_requirements(\\n\\n info: ImageAllocationInfo,\\n\\n) -> RutabagaResult<ImageMemoryRequirements> {\\n\\n let mut image_requirements: ImageMemoryRequirements = Default::default();\\n\\n let mut size: u32 = 0;\\n\\n let layout = info.drm_format.planar_layout()?;\\n\\n for plane in 0..layout.num_planes {\\n\\n let plane_stride = stride_from_layout(&layout, info.width, plane)?;\\n\\n image_requirements.strides[plane] = plane_stride;\\n\\n if plane > 0 {\\n\\n image_requirements.offsets[plane] = size as u32;\\n\\n }\\n\\n\\n\\n let height = info.height;\\n\\n let vertical_subsampling = layout.vertical_subsampling[plane];\\n\\n let subsampled_height = checked_arithmetic!(height / vertical_subsampling)?;\\n\\n let plane_size = checked_arithmetic!(subsampled_height * plane_stride)?;\\n\\n size = checked_arithmetic!(size + plane_size)?;\\n\\n }\\n\\n\\n\",\n \"file_path\": \"rutabaga_gfx/src/rutabaga_gralloc/formats.rs\",\n \"rank\": 29,\n \"score\": 223046.34922273632\n },\n {\n \"content\": \"/// Automatically build the hypervisor Segment struct for set_sregs from the kernel bit fields.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `entry` - The gdt entry.\\n\\n/// * `table_index` - Index of the entry in the gdt table.\\n\\npub fn segment_from_gdt(entry: u64, table_index: u8) -> Segment {\\n\\n Segment {\\n\\n base: get_base(entry),\\n\\n limit: get_limit(entry),\\n\\n selector: (table_index * 8) as u16,\\n\\n type_: get_type(entry),\\n\\n present: get_p(entry),\\n\\n dpl: get_dpl(entry),\\n\\n db: get_db(entry),\\n\\n s: get_s(entry),\\n\\n l: get_l(entry),\\n\\n g: get_g(entry),\\n\\n avl: get_avl(entry),\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n\\n\",\n \"file_path\": \"x86_64/src/gdt.rs\",\n \"rank\": 30,\n \"score\": 222048.44509525195\n },\n {\n \"content\": \"/// Read raw bytes from stdin.\\n\\n///\\n\\n/// This will block depending on the underlying mode of stdin. This will ignore the usual lock\\n\\n/// around stdin that the stdlib usually uses. If other code is using stdin, it is undefined who\\n\\n/// will get the underlying bytes.\\n\\npub fn read_raw_stdin(out: &mut [u8]) -> Result<usize> {\\n\\n // Safe because reading from stdin shouldn't have any safety implications.\\n\\n unsafe { read_raw(STDIN_FILENO, out) }\\n\\n}\\n\\n\\n\\n/// Trait for file descriptors that are TTYs, according to `isatty(3)`.\\n\\n///\\n\\n/// This is marked unsafe because the implementation must promise that the returned RawFd is a valid\\n\\n/// fd and that the lifetime of the returned fd is at least that of the trait object.\\n\\npub unsafe trait Terminal {\\n\\n /// Gets the file descriptor of the TTY.\\n\\n fn tty_fd(&self) -> RawFd;\\n\\n\\n\\n /// Set this terminal's mode to canonical mode (`ICANON | ECHO | ISIG`).\\n\\n fn set_canon_mode(&self) -> Result<()> {\\n\\n modify_mode(self.tty_fd(), |t| t.c_lflag |= ICANON | ECHO | ISIG)\\n\\n }\\n\\n\\n\\n /// Set this terminal's mode to raw mode (`!(ICANON | ECHO | ISIG)`).\\n\\n fn set_raw_mode(&self) -> Result<()> {\\n\",\n \"file_path\": \"sys_util/src/terminal.rs\",\n \"rank\": 31,\n \"score\": 222017.61503767507\n },\n {\n \"content\": \"/// Allocates a vector of length `len` filled with random bytes from the\\n\\n/// specified `source`.\\n\\npub fn rand_vec(len: usize, source: Source) -> Result<Vec<u8>> {\\n\\n let mut rand = Vec::with_capacity(len);\\n\\n if len == 0 {\\n\\n return Ok(rand);\\n\\n }\\n\\n\\n\\n // Safe because rand will either be initialized by getrandom or dropped.\\n\\n unsafe { rand.set_len(len) };\\n\\n rand_bytes(rand.as_mut_slice(), source)?;\\n\\n Ok(rand)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n const TEST_SIZE: usize = 64;\\n\\n\\n\\n #[test]\\n\\n fn randbytes_success() {\\n\",\n \"file_path\": \"sys_util/src/rand.rs\",\n \"rank\": 32,\n \"score\": 221935.66565564126\n },\n {\n \"content\": \"/// The kernel API has many structs that resemble the following `Foo` structure:\\n\\n///\\n\\n/// ```ignore\\n\\n/// #[repr(C)]\\n\\n/// struct Foo {\\n\\n/// some_data: u32,\\n\\n/// entries: __IncompleteArrayField<__u32>,\\n\\n/// }\\n\\n/// ```\\n\\n///\\n\\n/// In order to allocate such a structure, `size_of::<Foo>()` would be too small because it would\\n\\n/// not include any space for `entries`. To make the allocation large enough while still being\\n\\n/// aligned for `Foo`, a `Vec<Foo>` is created. Only the first element of `Vec<Foo>` would actually\\n\\n/// be used as a `Foo`. The remaining memory in the `Vec<Foo>` is for `entries`, which must be\\n\\n/// contiguous with `Foo`. This function is used to make the `Vec<Foo>` with enough space for\\n\\n/// `count` entries.\\n\\npub fn vec_with_array_field<T: Default, F>(count: usize) -> Vec<T> {\\n\\n let element_space = count * size_of::<F>();\\n\\n let vec_size_bytes = size_of::<T>() + element_space;\\n\\n vec_with_size_in_bytes(vec_size_bytes)\\n\\n}\\n\\n\\n\\n/// The following code provides generic helpers for creating and accessing flexible array structs.\\n\\n/// A complete definition of flexible array structs is found in the ISO 9899 specification\\n\\n/// (http://www.iso-9899.info/n1570.html). A flexible array struct is of the form:\\n\\n///\\n\\n/// ```ignore\\n\\n/// #[repr(C)]\\n\\n/// struct T {\\n\\n/// some_data: u32,\\n\\n/// nent: u32,\\n\\n/// entries: __IncompleteArrayField<S>,\\n\\n/// }\\n\\n/// ```\\n\\n/// where:\\n\\n///\\n\\n/// - `T` is the flexible array struct type\\n\\n/// - `S` is the flexible array type\\n\\n/// - `nent` is the flexible array length\\n\\n/// - `entries` is the flexible array member\\n\\n///\\n\\n/// These structures are used by the kernel API.\\n\\n\\n\",\n \"file_path\": \"data_model/src/flexible_array.rs\",\n \"rank\": 33,\n \"score\": 216247.57540764406\n },\n {\n \"content\": \"/// Add an e820 region to the e820 map.\\n\\n/// Returns Ok(()) if successful, or an error if there is no space left in the map.\\n\\nfn add_e820_entry(params: &mut boot_params, addr: u64, size: u64, mem_type: u32) -> Result<()> {\\n\\n if params.e820_entries >= params.e820_table.len() as u8 {\\n\\n return Err(Error::E820Configuration);\\n\\n }\\n\\n\\n\\n params.e820_table[params.e820_entries as usize].addr = addr;\\n\\n params.e820_table[params.e820_entries as usize].size = size;\\n\\n params.e820_table[params.e820_entries as usize].type_ = mem_type;\\n\\n params.e820_entries += 1;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"x86_64/src/lib.rs\",\n \"rank\": 34,\n \"score\": 216232.70447212565\n },\n {\n \"content\": \"fn convert_reader_writer<R, W>(reader: &mut R, writer: &mut W, size: u64) -> Result<()>\\n\\nwhere\\n\\n R: Read + Seek + SeekHole,\\n\\n W: Write + Seek,\\n\\n{\\n\\n let mut offset = 0;\\n\\n while offset < size {\\n\\n // Find the next range of data.\\n\\n let next_data = match reader.seek_data(offset).map_err(Error::SeekingFile)? {\\n\\n Some(o) => o,\\n\\n None => {\\n\\n // No more data in the file.\\n\\n break;\\n\\n }\\n\\n };\\n\\n let next_hole = match reader.seek_hole(next_data).map_err(Error::SeekingFile)? {\\n\\n Some(o) => o,\\n\\n None => {\\n\\n // This should not happen - there should always be at least one hole\\n\\n // after any data.\\n\",\n \"file_path\": \"disk/src/disk.rs\",\n \"rank\": 35,\n \"score\": 215449.1125282151\n },\n {\n \"content\": \"fn reply_error<W: Writer>(e: io::Error, unique: u64, mut w: W) -> Result<usize> {\\n\\n let header = OutHeader {\\n\\n len: size_of::<OutHeader>() as u32,\\n\\n error: -e.raw_os_error().unwrap_or(libc::EIO),\\n\\n unique,\\n\\n };\\n\\n\\n\\n w.write_all(header.as_slice())\\n\\n .map_err(Error::EncodeMessage)?;\\n\\n w.flush().map_err(Error::FlushMessage)?;\\n\\n\\n\\n Ok(header.len as usize)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fuse/src/server.rs\",\n \"rank\": 36,\n \"score\": 212609.80203569954\n },\n {\n \"content\": \"/// Configure Model specific registers for x86\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `vcpu` - Structure for the vcpu that holds the vcpu fd.\\n\\npub fn setup_msrs(vcpu: &dyn VcpuX86_64, pci_start: u64) -> Result<()> {\\n\\n let msrs = create_msr_entries(vcpu, pci_start);\\n\\n vcpu.set_msrs(&msrs).map_err(Error::MsrIoctlFailed)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"x86_64/src/regs.rs\",\n \"rank\": 37,\n \"score\": 210812.68001791625\n },\n {\n \"content\": \"/// Creates a flattened device tree containing all of the parameters used\\n\\n/// by Android.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `fdt` - The DTB to modify. The top-most node should be open.\\n\\n/// * `android-fstab` - A text file of Android fstab entries to add to the DTB\\n\\npub fn create_android_fdt(fdt: &mut FdtWriter, fstab: File) -> Result<()> {\\n\\n let vecs = BufReader::new(fstab)\\n\\n .lines()\\n\\n .map(|l| parse_fstab_line(&l.map_err(Error::FdtIoError)?))\\n\\n .collect::<Result<Vec<Vec<String>>>>()?;\\n\\n let firmware_node = fdt.begin_node(\\\"firmware\\\")?;\\n\\n let android_node = fdt.begin_node(\\\"android\\\")?;\\n\\n fdt.property_string(\\\"compatible\\\", \\\"android,firmware\\\")?;\\n\\n\\n\\n let (dtprop, fstab): (_, Vec<_>) = vecs.into_iter().partition(|x| x[0] == \\\"#dt-vendor\\\");\\n\\n let vendor_node = fdt.begin_node(\\\"vendor\\\")?;\\n\\n for vec in dtprop {\\n\\n let content = std::fs::read_to_string(&vec[2]).map_err(Error::FdtIoError)?;\\n\\n fdt.property_string(&vec[1], &content)?;\\n\\n }\\n\\n fdt.end_node(vendor_node)?;\\n\\n let fstab_node = fdt.begin_node(\\\"fstab\\\")?;\\n\\n fdt.property_string(\\\"compatible\\\", \\\"android,fstab\\\")?;\\n\\n for vec in fstab {\\n\\n let partition = &vec[1][1..];\\n\",\n \"file_path\": \"arch/src/android.rs\",\n \"rank\": 38,\n \"score\": 210788.3694509086\n },\n {\n \"content\": \"/// Constructor for a conventional segment GDT (or LDT) entry. Derived from the kernel's segment.h.\\n\\npub fn gdt_entry(flags: u16, base: u32, limit: u32) -> u64 {\\n\\n (((base as u64) & 0xff000000u64) << (56 - 24))\\n\\n | (((flags as u64) & 0x0000f0ffu64) << 40)\\n\\n | (((limit as u64) & 0x000f0000u64) << (48 - 16))\\n\\n | (((base as u64) & 0x00ffffffu64) << 16)\\n\\n | ((limit as u64) & 0x0000ffffu64)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"x86_64/src/gdt.rs\",\n \"rank\": 39,\n \"score\": 209656.6932626657\n },\n {\n \"content\": \"fn create_msr_entries(vcpu: &dyn VcpuX86_64, pci_start: u64) -> Vec<Register> {\\n\\n let mut entries = vec![\\n\\n Register {\\n\\n id: crate::msr_index::MSR_IA32_SYSENTER_CS,\\n\\n value: 0x0,\\n\\n },\\n\\n Register {\\n\\n id: crate::msr_index::MSR_IA32_SYSENTER_ESP,\\n\\n value: 0x0,\\n\\n },\\n\\n Register {\\n\\n id: crate::msr_index::MSR_IA32_SYSENTER_EIP,\\n\\n value: 0x0,\\n\\n },\\n\\n // x86_64 specific msrs, we only run on x86_64 not x86\\n\\n Register {\\n\\n id: crate::msr_index::MSR_STAR,\\n\\n value: 0x0,\\n\\n },\\n\\n Register {\\n\",\n \"file_path\": \"x86_64/src/regs.rs\",\n \"rank\": 40,\n \"score\": 208503.17999355646\n },\n {\n \"content\": \"/// Terminates and reaps a child process. If the child process is a group leader, its children will\\n\\n/// be terminated and reaped as well. After the given timeout, the child process and any relevant\\n\\n/// children are killed (i.e. sent SIGKILL).\\n\\npub fn kill_tree(child: &mut Child, terminate_timeout: Duration) -> SignalResult<()> {\\n\\n let target = {\\n\\n let pid = child.id() as Pid;\\n\\n if getsid(Some(pid)).map_err(Error::GetSid)? == pid {\\n\\n -pid\\n\\n } else {\\n\\n pid\\n\\n }\\n\\n };\\n\\n\\n\\n // Safe because target is a child process (or group) and behavior of SIGTERM is defined.\\n\\n ok_if!(unsafe { kill(target, libc::SIGTERM) }, libc::ESRCH).map_err(Error::Kill)?;\\n\\n\\n\\n // Reap the direct child first in case it waits for its descendants, afterward reap any\\n\\n // remaining group members.\\n\\n let start = Instant::now();\\n\\n let mut child_running = true;\\n\\n loop {\\n\\n // Wait for the direct child to exit before reaping any process group members.\\n\\n if child_running {\\n\",\n \"file_path\": \"sys_util/src/signal.rs\",\n \"rank\": 41,\n \"score\": 207791.02853538995\n },\n {\n \"content\": \"pub fn ungrab_evdev<T: AsRawDescriptor>(descriptor: &mut T) -> Result<()> {\\n\\n let ret = unsafe {\\n\\n // Safe because the kernel only reads the value of the ptr (doesn't dereference) and\\n\\n // we check the return value\\n\\n ioctl_with_ptr(\\n\\n &Descriptor(descriptor.as_raw_descriptor()),\\n\\n EVIOCGRAB(),\\n\\n null::<u32>(),\\n\\n )\\n\\n };\\n\\n if ret == 0 {\\n\\n Ok(())\\n\\n } else {\\n\\n Err(InputError::EvdevGrabError(errno()))\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"devices/src/virtio/input/evdev.rs\",\n \"rank\": 42,\n \"score\": 207791.02853538995\n },\n {\n \"content\": \"/// Grabs an event device (see EVIOCGGRAB ioctl for details). After this function succeeds the given\\n\\n/// descriptor has exclusive access to the device, effectively making it unusable for any other process in\\n\\n/// the host.\\n\\npub fn grab_evdev<T: AsRawDescriptor>(descriptor: &mut T) -> Result<()> {\\n\\n let val: u32 = 1;\\n\\n let ret = unsafe {\\n\\n // Safe because the kernel only read the value of the ptr and we check the return value\\n\\n ioctl_with_ref(\\n\\n &Descriptor(descriptor.as_raw_descriptor()),\\n\\n EVIOCGRAB(),\\n\\n &val,\\n\\n )\\n\\n };\\n\\n if ret == 0 {\\n\\n Ok(())\\n\\n } else {\\n\\n Err(InputError::EvdevGrabError(errno()))\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"devices/src/virtio/input/evdev.rs\",\n \"rank\": 43,\n \"score\": 207791.02853538995\n },\n {\n \"content\": \"fn create_serial_node(fdt: &mut FdtWriter, addr: u64, irq: u32) -> Result<()> {\\n\\n let serial_reg_prop = [addr, AARCH64_SERIAL_SIZE];\\n\\n let irq = [GIC_FDT_IRQ_TYPE_SPI, irq, IRQ_TYPE_EDGE_RISING];\\n\\n\\n\\n let serial_node = fdt.begin_node(&format!(\\\"U6_16550A@{:x}\\\", addr))?;\\n\\n fdt.property_string(\\\"compatible\\\", \\\"ns16550a\\\")?;\\n\\n fdt.property_array_u64(\\\"reg\\\", &serial_reg_prop)?;\\n\\n fdt.property_u32(\\\"clock-frequency\\\", AARCH64_SERIAL_SPEED)?;\\n\\n fdt.property_array_u32(\\\"interrupts\\\", &irq)?;\\n\\n fdt.end_node(serial_node)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"aarch64/src/fdt.rs\",\n \"rank\": 44,\n \"score\": 204066.27282594267\n },\n {\n \"content\": \"/// Gets the name of an event device (see EVIOCGNAME ioctl for details).\\n\\npub fn name<T: AsRawDescriptor>(descriptor: &T) -> Result<Vec<u8>> {\\n\\n let mut name = evdev_buffer::new();\\n\\n let len = unsafe {\\n\\n // Safe because the kernel won't write more than size of evdev_buffer and we check the\\n\\n // return value\\n\\n ioctl_with_mut_ref(\\n\\n &Descriptor(descriptor.as_raw_descriptor()),\\n\\n EVIOCGNAME(),\\n\\n &mut name,\\n\\n )\\n\\n };\\n\\n if len < 0 {\\n\\n return Err(InputError::EvdevNameError(errno()));\\n\\n }\\n\\n Ok(name.buffer[0..len as usize].to_vec())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"devices/src/virtio/input/evdev.rs\",\n \"rank\": 45,\n \"score\": 203614.869958067\n },\n {\n \"content\": \"#[derive(Debug, Copy, Clone)]\\n\\nstruct Range(u64, u64, bool);\\n\\n\\n\\nimpl Eq for Range {}\\n\\n\\n\\nimpl PartialEq for Range {\\n\\n fn eq(&self, other: &Range) -> bool {\\n\\n self.0 == other.0\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Ord for Range {\\n\\n fn cmp(&self, other: &Range) -> cmp::Ordering {\\n\\n self.0.cmp(&other.0)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PartialOrd for Range {\\n\\n fn partial_cmp(&self, other: &Range) -> Option<cmp::Ordering> {\\n\\n self.0.partial_cmp(&other.0)\\n\\n }\\n\\n}\\n\\n\\n\\n// Wrapper types to make the kvm register structs DataInit\\n\",\n \"file_path\": \"src/plugin/vcpu.rs\",\n \"rank\": 46,\n \"score\": 202641.24398127839\n },\n {\n \"content\": \"fn parse_remove_bits_attr(ast: &mut DeriveInput) -> Result<Option<u64>> {\\n\\n let mut width = None;\\n\\n let mut bits_idx = 0;\\n\\n\\n\\n for (i, attr) in ast.attrs.iter().enumerate() {\\n\\n if let Some(w) = try_parse_bits_attr(attr)? {\\n\\n bits_idx = i;\\n\\n width = Some(w.base10_parse()?);\\n\\n }\\n\\n }\\n\\n\\n\\n if width.is_some() {\\n\\n ast.attrs.remove(bits_idx);\\n\\n }\\n\\n\\n\\n Ok(width)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bit_field/bit_field_derive/bit_field_derive.rs\",\n \"rank\": 47,\n \"score\": 202498.3284784344\n },\n {\n \"content\": \"fn create_gic_node(fdt: &mut FdtWriter, is_gicv3: bool, num_cpus: u64) -> Result<()> {\\n\\n let mut gic_reg_prop = [AARCH64_GIC_DIST_BASE, AARCH64_GIC_DIST_SIZE, 0, 0];\\n\\n\\n\\n let intc_node = fdt.begin_node(\\\"intc\\\")?;\\n\\n if is_gicv3 {\\n\\n fdt.property_string(\\\"compatible\\\", \\\"arm,gic-v3\\\")?;\\n\\n gic_reg_prop[2] = AARCH64_GIC_DIST_BASE - (AARCH64_GIC_REDIST_SIZE * num_cpus);\\n\\n gic_reg_prop[3] = AARCH64_GIC_REDIST_SIZE * num_cpus;\\n\\n } else {\\n\\n fdt.property_string(\\\"compatible\\\", \\\"arm,cortex-a15-gic\\\")?;\\n\\n gic_reg_prop[2] = AARCH64_GIC_CPUI_BASE;\\n\\n gic_reg_prop[3] = AARCH64_GIC_CPUI_SIZE;\\n\\n }\\n\\n fdt.property_u32(\\\"#interrupt-cells\\\", GIC_FDT_IRQ_NUM_CELLS)?;\\n\\n fdt.property_null(\\\"interrupt-controller\\\")?;\\n\\n fdt.property_array_u64(\\\"reg\\\", &gic_reg_prop)?;\\n\\n fdt.property_u32(\\\"phandle\\\", PHANDLE_GIC)?;\\n\\n fdt.property_u32(\\\"#address-cells\\\", 2)?;\\n\\n fdt.property_u32(\\\"#size-cells\\\", 2)?;\\n\\n fdt.end_node(intc_node)?;\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"aarch64/src/fdt.rs\",\n \"rank\": 48,\n \"score\": 201206.81017044964\n },\n {\n \"content\": \"/// Gets the unique (serial) name of an event device (see EVIOCGUNIQ ioctl for details).\\n\\npub fn serial_name<T: AsRawDescriptor>(descriptor: &T) -> Result<Vec<u8>> {\\n\\n let mut uniq = evdev_buffer::new();\\n\\n let len = unsafe {\\n\\n // Safe because the kernel won't write more than size of evdev_buffer and we check the\\n\\n // return value\\n\\n ioctl_with_mut_ref(\\n\\n &Descriptor(descriptor.as_raw_descriptor()),\\n\\n EVIOCGUNIQ(),\\n\\n &mut uniq,\\n\\n )\\n\\n };\\n\\n if len < 0 {\\n\\n return Err(InputError::EvdevSerialError(errno()));\\n\\n }\\n\\n Ok(uniq.buffer[0..len as usize].to_vec())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"devices/src/virtio/input/evdev.rs\",\n \"rank\": 49,\n \"score\": 200757.32154271586\n },\n {\n \"content\": \"/// Configures LAPICs. LAPIC0 is set for external interrupts, LAPIC1 is set for NMI.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `vcpu_id` - The number of the VCPU to configure.\\n\\n/// * `irqchip` - The IrqChip for getting/setting LAPIC state.\\n\\npub fn set_lint(vcpu_id: usize, irqchip: &mut dyn IrqChipX86_64) -> Result<()> {\\n\\n let mut lapic = irqchip.get_lapic_state(vcpu_id).map_err(Error::GetLapic)?;\\n\\n\\n\\n for (reg, mode) in &[\\n\\n (APIC_LVT0_REGISTER, APIC_MODE_EXTINT),\\n\\n (APIC_LVT1_REGISTER, APIC_MODE_NMI),\\n\\n ] {\\n\\n lapic.regs[*reg] = set_apic_delivery_mode(lapic.regs[*reg], *mode);\\n\\n }\\n\\n\\n\\n irqchip\\n\\n .set_lapic_state(vcpu_id, &lapic)\\n\\n .map_err(Error::SetLapic)\\n\\n}\\n\",\n \"file_path\": \"x86_64/src/interrupts.rs\",\n \"rank\": 50,\n \"score\": 200643.055922371\n },\n {\n \"content\": \"fn default_touchscreen_absinfo(width: u32, height: u32) -> BTreeMap<u16, virtio_input_absinfo> {\\n\\n let mut absinfo: BTreeMap<u16, virtio_input_absinfo> = BTreeMap::new();\\n\\n absinfo.insert(ABS_X, virtio_input_absinfo::new(0, width, 0, 0));\\n\\n absinfo.insert(ABS_Y, virtio_input_absinfo::new(0, height, 0, 0));\\n\\n absinfo\\n\\n}\\n\\n\\n\",\n \"file_path\": \"devices/src/virtio/input/defaults.rs\",\n \"rank\": 51,\n \"score\": 198039.20587855554\n },\n {\n \"content\": \"fn default_trackpad_absinfo(width: u32, height: u32) -> BTreeMap<u16, virtio_input_absinfo> {\\n\\n let mut absinfo: BTreeMap<u16, virtio_input_absinfo> = BTreeMap::new();\\n\\n absinfo.insert(ABS_X, virtio_input_absinfo::new(0, width, 0, 0));\\n\\n absinfo.insert(ABS_Y, virtio_input_absinfo::new(0, height, 0, 0));\\n\\n absinfo\\n\\n}\\n\\n\\n\",\n \"file_path\": \"devices/src/virtio/input/defaults.rs\",\n \"rank\": 52,\n \"score\": 198039.20587855554\n },\n {\n \"content\": \"/// Given a `reader` for a full set of descriptors as provided by the Linux kernel\\n\\n/// usbdevfs `descriptors` file, parse the descriptors into a tree data structure.\\n\\npub fn parse_usbfs_descriptors<R: Read>(mut reader: R) -> Result<DeviceDescriptorTree> {\\n\\n // Given a structure of length `struct_length`, of which `bytes_consumed` have\\n\\n // already been read, skip the remainder of the struct. If `bytes_consumed` is\\n\\n // more than `struct_length`, no additional bytes are skipped.\\n\\n fn skip<R: Read>(reader: R, bytes_consumed: usize, struct_length: u8) -> io::Result<u64> {\\n\\n let bytes_to_skip = u64::from(struct_length).saturating_sub(bytes_consumed as u64);\\n\\n io::copy(&mut reader.take(bytes_to_skip), &mut io::sink())\\n\\n }\\n\\n\\n\\n // Find the next descriptor of type T and return it.\\n\\n // Any other descriptors encountered while searching for the expected type are skipped.\\n\\n fn next_descriptor<R: Read, T: Descriptor + DataInit>(mut reader: R) -> Result<T> {\\n\\n let desc_type = T::descriptor_type() as u8;\\n\\n loop {\\n\\n let hdr = DescriptorHeader::from_reader(&mut reader).map_err(Error::DescriptorRead)?;\\n\\n if hdr.bDescriptorType == desc_type {\\n\\n if usize::from(hdr.bLength) < size_of::<DescriptorHeader>() + size_of::<T>() {\\n\\n return Err(Error::DescriptorParse);\\n\\n }\\n\\n\\n\",\n \"file_path\": \"usb_util/src/descriptor.rs\",\n \"rank\": 53,\n \"score\": 197911.58526136173\n },\n {\n \"content\": \"// Ceiling of the division of `dividend`/`divisor`.\\n\\nfn div_round_up_u64(dividend: u64, divisor: u64) -> u64 {\\n\\n dividend / divisor + if dividend % divisor != 0 { 1 } else { 0 }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"disk/src/qcow/mod.rs\",\n \"rank\": 54,\n \"score\": 197389.17364046088\n },\n {\n \"content\": \"fn get_base(entry: u64) -> u64 {\\n\\n (((entry) & 0xFF00000000000000) >> 32)\\n\\n | (((entry) & 0x000000FF00000000) >> 16)\\n\\n | (((entry) & 0x00000000FFFF0000) >> 16)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"x86_64/src/gdt.rs\",\n \"rank\": 55,\n \"score\": 196172.60574465265\n },\n {\n \"content\": \"// Returns the max length which suitable for mtrr setting based on the\\n\\n// specified (base, len)\\n\\nfn get_max_len(base: u64, len: u64) -> u64 {\\n\\n let mut ret = get_power_of_two(len);\\n\\n\\n\\n while base % ret != 0 {\\n\\n ret >>= 1;\\n\\n }\\n\\n\\n\\n ret\\n\\n}\\n\\n\\n\",\n \"file_path\": \"x86_64/src/regs.rs\",\n \"rank\": 56,\n \"score\": 194875.5278234344\n },\n {\n \"content\": \"/// Safe wrapper for `libc::lseek64()`\\n\\nfn lseek(file: &mut File, offset: i64, whence: i32) -> Result<Option<u64>> {\\n\\n // This is safe because we pass a known-good file descriptor.\\n\\n let res = unsafe { lseek64(file.as_raw_fd(), offset, whence) };\\n\\n\\n\\n if res < 0 {\\n\\n // Convert ENXIO into None; pass any other error as-is.\\n\\n let err = Error::last_os_error();\\n\\n if let Some(errno) = Error::raw_os_error(&err) {\\n\\n if errno == ENXIO {\\n\\n return Ok(None);\\n\\n }\\n\\n }\\n\\n Err(err)\\n\\n } else {\\n\\n Ok(Some(res as u64))\\n\\n }\\n\\n}\\n\\n\\n\\nimpl SeekHole for File {\\n\\n fn seek_hole(&mut self, offset: u64) -> Result<Option<u64>> {\\n\",\n \"file_path\": \"sys_util/src/seek_hole.rs\",\n \"rank\": 57,\n \"score\": 193817.4943852676\n },\n {\n \"content\": \"// Returns the value of the highest bit in a 64-bit value. Equivalent to\\n\\n// 1 << HighBitSet(x)\\n\\nfn get_power_of_two(data: u64) -> u64 {\\n\\n 1 << (64 - data.leading_zeros() - 1)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"x86_64/src/regs.rs\",\n \"rank\": 58,\n \"score\": 193708.88239374422\n },\n {\n \"content\": \"fn reply_readdir<W: Writer>(len: usize, unique: u64, mut w: W) -> Result<usize> {\\n\\n let out = OutHeader {\\n\\n len: (size_of::<OutHeader>() + len) as u32,\\n\\n error: 0,\\n\\n unique,\\n\\n };\\n\\n\\n\\n w.write_all(out.as_slice()).map_err(Error::EncodeMessage)?;\\n\\n w.flush().map_err(Error::FlushMessage)?;\\n\\n Ok(out.len as usize)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fuse/src/server.rs\",\n \"rank\": 59,\n \"score\": 193490.37794821116\n },\n {\n \"content\": \"/// Parses the given `args` against the list of know arguments `arg_list` and calls `f` with each\\n\\n/// present argument and value if required.\\n\\n///\\n\\n/// This function guarantees that only valid long argument names from `arg_list` are sent to the\\n\\n/// callback `f`. It is also guaranteed that if an arg requires a value (i.e.\\n\\n/// `arg.value.is_some()`), the value will be `Some` in the callbacks arguments. If the callback\\n\\n/// returns `Err`, this function will end parsing and return that `Err`.\\n\\n///\\n\\n/// See the [module level](index.html) example for a usage example.\\n\\npub fn set_arguments<I, R, F>(args: I, arg_list: &[Argument], mut f: F) -> Result<()>\\n\\nwhere\\n\\n I: Iterator<Item = R>,\\n\\n R: AsRef<str>,\\n\\n F: FnMut(&str, Option<&str>) -> Result<()>,\\n\\n{\\n\\n parse_arguments(args, |name, value| {\\n\\n let mut matches = None;\\n\\n for arg in arg_list {\\n\\n if let Some(short) = arg.short {\\n\\n if name.len() == 1 && name.starts_with(short) {\\n\\n if value.is_some() != arg.value.is_some() {\\n\\n return Err(Error::ExpectedValue(short.to_string()));\\n\\n }\\n\\n matches = Some(arg.long);\\n\\n }\\n\\n }\\n\\n if matches.is_none() && arg.long == name {\\n\\n if value.is_none() && arg.value_mode == ArgumentValueMode::Required {\\n\\n return Err(Error::ExpectedValue(arg.long.to_owned()));\\n\",\n \"file_path\": \"src/argument.rs\",\n \"rank\": 60,\n \"score\": 193094.76453077223\n },\n {\n \"content\": \"fn create_pkg_length(data: &[u8], include_self: bool) -> Vec<u8> {\\n\\n let mut result = Vec::new();\\n\\n\\n\\n /* PkgLength is inclusive and includes the length bytes */\\n\\n let length_length = if data.len() < (2usize.pow(6) - 1) {\\n\\n 1\\n\\n } else if data.len() < (2usize.pow(12) - 2) {\\n\\n 2\\n\\n } else if data.len() < (2usize.pow(20) - 3) {\\n\\n 3\\n\\n } else {\\n\\n 4\\n\\n };\\n\\n\\n\\n let length = data.len() + if include_self { length_length } else { 0 };\\n\\n\\n\\n match length_length {\\n\\n 1 => result.push(length as u8),\\n\\n 2 => {\\n\\n result.push((1u8 << 6) | (length & 0xf) as u8);\\n\",\n \"file_path\": \"acpi_tables/src/aml.rs\",\n \"rank\": 61,\n \"score\": 186636.11096513082\n },\n {\n \"content\": \"/// Sets up the cpuid entries for the given vcpu. Can fail if there are too many CPUs specified or\\n\\n/// if an ioctl returns an error.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `hypervisor` - `HypervisorX86_64` impl for getting supported CPU IDs.\\n\\n/// * `vcpu` - `VcpuX86_64` for setting CPU ID.\\n\\n/// * `vcpu_id` - The vcpu index of `vcpu`.\\n\\n/// * `nrcpus` - The number of vcpus being used by this VM.\\n\\npub fn setup_cpuid(\\n\\n hypervisor: &dyn HypervisorX86_64,\\n\\n irq_chip: &dyn IrqChipX86_64,\\n\\n vcpu: &dyn VcpuX86_64,\\n\\n vcpu_id: usize,\\n\\n nrcpus: usize,\\n\\n no_smt: bool,\\n\\n) -> Result<()> {\\n\\n let mut cpuid = hypervisor\\n\\n .get_supported_cpuid()\\n\\n .map_err(Error::GetSupportedCpusFailed)?;\\n\\n\\n\\n filter_cpuid(vcpu_id, nrcpus, &mut cpuid, irq_chip, no_smt);\\n\\n\\n\\n vcpu.set_cpuid(&cpuid)\\n\\n .map_err(Error::SetSupportedCpusFailed)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"x86_64/src/cpuid.rs\",\n \"rank\": 62,\n \"score\": 186040.4758719863\n },\n {\n \"content\": \"pub fn run_vcpus(\\n\\n kvm: &Kvm,\\n\\n vm: &Vm,\\n\\n plugin: &Process,\\n\\n vcpu_count: u32,\\n\\n kill_signaled: &Arc<AtomicBool>,\\n\\n exit_evt: &Event,\\n\\n vcpu_handles: &mut Vec<thread::JoinHandle<()>>,\\n\\n) -> Result<()> {\\n\\n let vcpu_thread_barrier = Arc::new(Barrier::new((vcpu_count) as usize));\\n\\n let use_kvm_signals = !kvm.check_extension(Cap::ImmediateExit);\\n\\n\\n\\n // If we need to force a vcpu to exit from a VM then a SIGRTMIN signal is sent\\n\\n // to that vcpu's thread. If KVM is running the VM then it'll return -EINTR.\\n\\n // An issue is what to do when KVM isn't running the VM (where we could be\\n\\n // in the kernel or in the app).\\n\\n //\\n\\n // If KVM supports \\\"immediate exit\\\" then we set a signal handler that will\\n\\n // set the |immediate_exit| flag that tells KVM to return -EINTR before running\\n\\n // the VM.\\n\",\n \"file_path\": \"src/plugin/mod.rs\",\n \"rank\": 63,\n \"score\": 186030.2127654347\n },\n {\n \"content\": \"/// Performs setup of the MP table for the given `num_cpus`.\\n\\npub fn setup_mptable(\\n\\n mem: &GuestMemory,\\n\\n num_cpus: u8,\\n\\n pci_irqs: Vec<(PciAddress, u32, PciInterruptPin)>,\\n\\n) -> Result<()> {\\n\\n // Used to keep track of the next base pointer into the MP table.\\n\\n let mut base_mp = GuestAddress(MPTABLE_START);\\n\\n\\n\\n // Calculate ISA bus number in the system, report at least one PCI bus.\\n\\n let isa_bus_id = match pci_irqs.iter().max_by_key(|v| v.0.bus) {\\n\\n Some(pci_irq) => pci_irq.0.bus + 1,\\n\\n _ => 1,\\n\\n };\\n\\n let mp_size = compute_mp_size(num_cpus);\\n\\n\\n\\n // The checked_add here ensures the all of the following base_mp.unchecked_add's will be without\\n\\n // overflow.\\n\\n if let Some(end_mp) = base_mp.checked_add(mp_size as u64 - 1) {\\n\\n if !mem.address_in_range(end_mp) {\\n\\n return Err(Error::NotEnoughMemory);\\n\",\n \"file_path\": \"x86_64/src/mptable.rs\",\n \"rank\": 64,\n \"score\": 186030.2127654347\n },\n {\n \"content\": \"/// Creates a flattened device tree containing all of the parameters for the\\n\\n/// kernel and loads it into the guest memory at the specified offset.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `fdt_max_size` - The amount of space reserved for the device tree\\n\\n/// * `guest_mem` - The guest memory object\\n\\n/// * `fdt_load_offset` - The offset into physical memory for the device tree\\n\\n/// * `android_fstab` - the File object for the android fstab\\n\\npub fn create_fdt(\\n\\n fdt_max_size: usize,\\n\\n guest_mem: &GuestMemory,\\n\\n fdt_load_offset: u64,\\n\\n android_fstab: File,\\n\\n) -> Result<usize, Error> {\\n\\n // Reserve space for the setup_data\\n\\n let fdt_data_size = fdt_max_size - mem::size_of::<setup_data>();\\n\\n\\n\\n let mut fdt = FdtWriter::new(&[]);\\n\\n\\n\\n // The whole thing is put into one giant node with some top level properties\\n\\n let root_node = fdt.begin_node(\\\"\\\")?;\\n\\n create_android_fdt(&mut fdt, android_fstab)?;\\n\\n fdt.end_node(root_node)?;\\n\\n\\n\\n let fdt_final = fdt.finish(fdt_data_size)?;\\n\\n\\n\\n assert_eq!(\\n\\n mem::size_of::<setup_data>(),\\n\",\n \"file_path\": \"x86_64/src/fdt.rs\",\n \"rank\": 65,\n \"score\": 186030.2127654347\n },\n {\n \"content\": \"/// Safe wrapper for `fallocate()`.\\n\\npub fn fallocate(\\n\\n file: &dyn AsRawFd,\\n\\n mode: FallocateMode,\\n\\n keep_size: bool,\\n\\n offset: u64,\\n\\n len: u64,\\n\\n) -> Result<()> {\\n\\n let offset = if offset > libc::off64_t::max_value() as u64 {\\n\\n return Err(Error::new(libc::EINVAL));\\n\\n } else {\\n\\n offset as libc::off64_t\\n\\n };\\n\\n\\n\\n let len = if len > libc::off64_t::max_value() as u64 {\\n\\n return Err(Error::new(libc::EINVAL));\\n\\n } else {\\n\\n len as libc::off64_t\\n\\n };\\n\\n\\n\\n let mut mode = match mode {\\n\",\n \"file_path\": \"sys_util/src/lib.rs\",\n \"rank\": 66,\n \"score\": 186030.2127654347\n },\n {\n \"content\": \"/// Creates a flattened device tree containing all of the parameters for the\\n\\n/// kernel and loads it into the guest memory at the specified offset.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `fdt_max_size` - The amount of space reserved for the device tree\\n\\n/// * `guest_mem` - The guest memory object\\n\\n/// * `pci_irqs` - List of PCI device address to PCI interrupt number and pin mappings\\n\\n/// * `num_cpus` - Number of virtual CPUs the guest will have\\n\\n/// * `fdt_load_offset` - The offset into physical memory for the device tree\\n\\n/// * `pci_device_base` - The offset into physical memory for PCI device memory\\n\\n/// * `pci_device_size` - The size of PCI device memory\\n\\n/// * `cmdline` - The kernel commandline\\n\\n/// * `initrd` - An optional tuple of initrd guest physical address and size\\n\\n/// * `android_fstab` - An optional file holding Android fstab entries\\n\\n/// * `is_gicv3` - True if gicv3, false if v2\\n\\n/// * `psci_version` - the current PSCI version\\n\\npub fn create_fdt(\\n\\n fdt_max_size: usize,\\n\\n guest_mem: &GuestMemory,\\n\\n pci_irqs: Vec<(PciAddress, u32, PciInterruptPin)>,\\n\\n num_cpus: u32,\\n\\n fdt_load_offset: u64,\\n\\n pci_device_base: u64,\\n\\n pci_device_size: u64,\\n\\n cmdline: &str,\\n\\n initrd: Option<(GuestAddress, usize)>,\\n\\n android_fstab: Option<File>,\\n\\n is_gicv3: bool,\\n\\n use_pmu: bool,\\n\\n psci_version: PsciVersion,\\n\\n) -> Result<()> {\\n\\n let mut fdt = FdtWriter::new(&[]);\\n\\n\\n\\n // The whole thing is put into one giant node with some top level properties\\n\\n let root_node = fdt.begin_node(\\\"\\\")?;\\n\\n fdt.property_u32(\\\"interrupt-parent\\\", PHANDLE_GIC)?;\\n\",\n \"file_path\": \"aarch64/src/fdt.rs\",\n \"rank\": 67,\n \"score\": 186030.2127654347\n },\n {\n \"content\": \"// Implement setter and getter for all fields.\\n\\nfn get_fields_impl(fields: &[FieldSpec]) -> Vec<TokenStream> {\\n\\n let mut impls = Vec::new();\\n\\n // This vec keeps track of types before this field, used to generate the offset.\\n\\n let current_types = &mut vec![quote!(::bit_field::BitField0)];\\n\\n\\n\\n for spec in fields {\\n\\n let ty = spec.ty;\\n\\n let getter_ident = Ident::new(format!(\\\"get_{}\\\", spec.ident).as_str(), Span::call_site());\\n\\n let setter_ident = Ident::new(format!(\\\"set_{}\\\", spec.ident).as_str(), Span::call_site());\\n\\n\\n\\n // Optional #[bits = N] attribute to provide compile-time checked\\n\\n // documentation of how many bits some field covers.\\n\\n let check_expected_bits = spec.expected_bits.as_ref().map(|expected_bits| {\\n\\n // If expected_bits does not match the actual number of bits in the\\n\\n // bit field specifier, this will fail to compile with an error\\n\\n // pointing into the #[bits = N] attribute.\\n\\n let span = expected_bits.span();\\n\\n quote_spanned! {span=>\\n\\n #[allow(dead_code)]\\n\\n const EXPECTED_BITS: [(); #expected_bits] =\\n\",\n \"file_path\": \"bit_field/bit_field_derive/bit_field_derive.rs\",\n \"rank\": 68,\n \"score\": 185658.3115430874\n },\n {\n \"content\": \"fn range_intersection(a: &Range<u64>, b: &Range<u64>) -> Range<u64> {\\n\\n Range {\\n\\n start: max(a.start, b.start),\\n\\n end: min(a.end, b.end),\\n\\n }\\n\\n}\\n\\n\\n\\n/// A magic string placed at the beginning of a composite disk file to identify it.\\n\\npub static CDISK_MAGIC: &str = \\\"composite_disk\\\\x1d\\\";\\n\\n/// The length of the CDISK_MAGIC string. Created explicitly as a static constant so that it is\\n\\n/// possible to create a character array of the same length.\\n\\npub const CDISK_MAGIC_LEN: usize = 15;\\n\\n\\n\\nimpl CompositeDiskFile {\\n\\n fn new(mut disks: Vec<ComponentDiskPart>) -> Result<CompositeDiskFile> {\\n\\n disks.sort_by(|d1, d2| d1.offset.cmp(&d2.offset));\\n\\n let contiguous_err = disks\\n\\n .windows(2)\\n\\n .map(|s| {\\n\\n if s[0].offset == s[1].offset {\\n\",\n \"file_path\": \"disk/src/composite.rs\",\n \"rank\": 69,\n \"score\": 185633.6038511344\n },\n {\n \"content\": \"fn to_kvm_msrs(vec: &[Register]) -> Vec<kvm_msrs> {\\n\\n let vec: Vec<kvm_msr_entry> = vec\\n\\n .iter()\\n\\n .map(|e| kvm_msr_entry {\\n\\n index: e.id as u32,\\n\\n data: e.value,\\n\\n ..Default::default()\\n\\n })\\n\\n .collect();\\n\\n\\n\\n let mut msrs = vec_with_array_field::<kvm_msrs, kvm_msr_entry>(vec.len());\\n\\n unsafe {\\n\\n // Mapping the unsized array to a slice is unsafe because the length isn't known.\\n\\n // Providing the length used to create the struct guarantees the entire slice is valid.\\n\\n msrs[0]\\n\\n .entries\\n\\n .as_mut_slice(vec.len())\\n\\n .copy_from_slice(&vec);\\n\\n }\\n\\n msrs[0].nmsrs = vec.len() as u32;\\n\",\n \"file_path\": \"hypervisor/src/kvm/x86_64.rs\",\n \"rank\": 70,\n \"score\": 184810.06492336682\n },\n {\n \"content\": \"/// Get the current monotonic time of host in nanoseconds\\n\\nfn get_monotonic_time() -> u64 {\\n\\n let mut time = libc::timespec {\\n\\n tv_sec: 0,\\n\\n tv_nsec: 0,\\n\\n };\\n\\n // Safe because time struct is local to this function and we check the returncode\\n\\n let ret = unsafe { libc::clock_gettime(libc::CLOCK_MONOTONIC, &mut time) };\\n\\n if ret != 0 {\\n\\n 0\\n\\n } else {\\n\\n time.tv_sec as u64 * 1_000_000_000u64 + time.tv_nsec as u64\\n\\n }\\n\\n}\\n\\n\\n\\nimpl PitCounter {\\n\\n fn new(\\n\\n counter_id: usize,\\n\\n interrupt_evt: Option<Event>,\\n\\n clock: Arc<Mutex<Clock>>,\\n\\n ) -> PitResult<PitCounter> {\\n\",\n \"file_path\": \"devices/src/pit.rs\",\n \"rank\": 71,\n \"score\": 183889.00264387048\n },\n {\n \"content\": \"/// Creates a new virtio keyboard, which supports the same events as an en-us physical keyboard.\\n\\npub fn new_keyboard<T>(source: T, virtio_features: u64) -> Result<Input<SocketEventSource<T>>>\\n\\nwhere\\n\\n T: Read + Write + AsRawDescriptor,\\n\\n{\\n\\n Ok(Input {\\n\\n kill_evt: None,\\n\\n worker_thread: None,\\n\\n config: defaults::new_keyboard_config(),\\n\\n source: Some(SocketEventSource::new(source)),\\n\\n virtio_features,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"devices/src/virtio/input/mod.rs\",\n \"rank\": 72,\n \"score\": 183074.34319674212\n },\n {\n \"content\": \"/// Creates a new virtio input device from an event device node\\n\\npub fn new_evdev<T>(source: T, virtio_features: u64) -> Result<Input<EvdevEventSource<T>>>\\n\\nwhere\\n\\n T: Read + Write + AsRawDescriptor,\\n\\n{\\n\\n Ok(Input {\\n\\n kill_evt: None,\\n\\n worker_thread: None,\\n\\n config: VirtioInputConfig::from_evdev(&source)?,\\n\\n source: Some(EvdevEventSource::new(source)),\\n\\n virtio_features,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"devices/src/virtio/input/mod.rs\",\n \"rank\": 73,\n \"score\": 183074.34319674212\n },\n {\n \"content\": \"/// Creates a new virtio mouse which supports primary, secondary, wheel and REL events.\\n\\npub fn new_mouse<T>(source: T, virtio_features: u64) -> Result<Input<SocketEventSource<T>>>\\n\\nwhere\\n\\n T: Read + Write + AsRawDescriptor,\\n\\n{\\n\\n Ok(Input {\\n\\n kill_evt: None,\\n\\n worker_thread: None,\\n\\n config: defaults::new_mouse_config(),\\n\\n source: Some(SocketEventSource::new(source)),\\n\\n virtio_features,\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"devices/src/virtio/input/mod.rs\",\n \"rank\": 74,\n \"score\": 183074.34319674212\n },\n {\n \"content\": \"/// Creates a new virtio device for switches.\\n\\npub fn new_switches<T>(source: T, virtio_features: u64) -> Result<Input<SocketEventSource<T>>>\\n\\nwhere\\n\\n T: Read + Write + AsRawDescriptor,\\n\\n{\\n\\n Ok(Input {\\n\\n kill_evt: None,\\n\\n worker_thread: None,\\n\\n config: defaults::new_switches_config(),\\n\\n source: Some(SocketEventSource::new(source)),\\n\\n virtio_features,\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"devices/src/virtio/input/mod.rs\",\n \"rank\": 75,\n \"score\": 183074.34319674212\n },\n {\n \"content\": \"/// Create ACPI tables and return the RSDP.\\n\\n/// The basic tables DSDT/FACP/MADT/XSDT are constructed in this function.\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `guest_mem` - The guest memory where the tables will be stored.\\n\\n/// * `num_cpus` - Used to construct the MADT.\\n\\n/// * `sci_irq` - Used to fill the FACP SCI_INTERRUPT field, which\\n\\n/// is going to be used by the ACPI drivers to register\\n\\n/// sci handler.\\n\\n/// * `acpi_dev_resource` - resouces needed by the ACPI devices for creating tables\\n\\npub fn create_acpi_tables(\\n\\n guest_mem: &GuestMemory,\\n\\n num_cpus: u8,\\n\\n sci_irq: u32,\\n\\n acpi_dev_resource: ACPIDevResource,\\n\\n) -> Option<GuestAddress> {\\n\\n // RSDP is at the HI RSDP WINDOW\\n\\n let rsdp_offset = GuestAddress(super::ACPI_HI_RSDP_WINDOW_BASE);\\n\\n let mut offset = rsdp_offset.checked_add(RSDP::len() as u64)?;\\n\\n let mut tables: Vec<u64> = Vec::new();\\n\\n let mut dsdt_offset: Option<GuestAddress> = None;\\n\\n\\n\\n // User supplied System Description Tables, e.g. SSDT.\\n\\n for sdt in acpi_dev_resource.sdts.iter() {\\n\\n guest_mem.write_at_addr(sdt.as_slice(), offset).ok()?;\\n\\n if sdt.is_signature(b\\\"DSDT\\\") {\\n\\n dsdt_offset = Some(offset);\\n\\n } else {\\n\\n tables.push(offset.0);\\n\\n }\\n\",\n \"file_path\": \"x86_64/src/acpi.rs\",\n \"rank\": 76,\n \"score\": 183032.3025147685\n },\n {\n \"content\": \"/// Creates a root PCI device for use by this Vm.\\n\\npub fn generate_pci_root(\\n\\n mut devices: Vec<(Box<dyn PciDevice>, Option<Minijail>)>,\\n\\n irq_chip: &mut impl IrqChip,\\n\\n mmio_bus: &mut Bus,\\n\\n resources: &mut SystemAllocator,\\n\\n vm: &mut impl Vm,\\n\\n max_irqs: usize,\\n\\n) -> Result<\\n\\n (\\n\\n PciRoot,\\n\\n Vec<(PciAddress, u32, PciInterruptPin)>,\\n\\n BTreeMap<u32, String>,\\n\\n ),\\n\\n DeviceRegistrationError,\\n\\n> {\\n\\n let mut root = PciRoot::new();\\n\\n let mut pci_irqs = Vec::new();\\n\\n let mut pid_labels = BTreeMap::new();\\n\\n\\n\\n let mut irqs: Vec<Option<u32>> = vec![None; max_irqs];\\n\",\n \"file_path\": \"arch/src/lib.rs\",\n \"rank\": 77,\n \"score\": 183031.8734152952\n },\n {\n \"content\": \"/// Adds goldfish battery\\n\\n/// return the platform needed resouces include its AML data, irq number\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `amls` - the vector to put the goldfish battery AML\\n\\n/// * `battery_jail` - used when sandbox is enabled\\n\\n/// * `mmio_bus` - bus to add the devices to\\n\\n/// * `irq_chip` - the IrqChip object for registering irq events\\n\\n/// * `irq_num` - assigned interrupt to use\\n\\n/// * `resources` - the SystemAllocator to allocate IO and MMIO for acpi\\n\\npub fn add_goldfish_battery(\\n\\n amls: &mut Vec<u8>,\\n\\n battery_jail: Option<Minijail>,\\n\\n mmio_bus: &mut Bus,\\n\\n irq_chip: &mut impl IrqChip,\\n\\n irq_num: u32,\\n\\n resources: &mut SystemAllocator,\\n\\n) -> Result<Tube, DeviceRegistrationError> {\\n\\n let alloc = resources.get_anon_alloc();\\n\\n let mmio_base = resources\\n\\n .mmio_allocator(MmioType::Low)\\n\\n .allocate_with_align(\\n\\n devices::bat::GOLDFISHBAT_MMIO_LEN,\\n\\n alloc,\\n\\n \\\"GoldfishBattery\\\".to_string(),\\n\\n devices::bat::GOLDFISHBAT_MMIO_LEN,\\n\\n )\\n\\n .map_err(DeviceRegistrationError::AllocateIoResource)?;\\n\\n\\n\\n let irq_evt = Event::new().map_err(DeviceRegistrationError::EventCreate)?;\\n\",\n \"file_path\": \"arch/src/lib.rs\",\n \"rank\": 78,\n \"score\": 183031.64842608123\n },\n {\n \"content\": \"/// Add serial options to the provided `cmdline` based on `serial_parameters`.\\n\\n/// `serial_io_type` should be \\\"io\\\" if the platform uses x86-style I/O ports for serial devices\\n\\n/// or \\\"mmio\\\" if the serial ports are memory mapped.\\n\\npub fn get_serial_cmdline(\\n\\n cmdline: &mut kernel_cmdline::Cmdline,\\n\\n serial_parameters: &BTreeMap<(SerialHardware, u8), SerialParameters>,\\n\\n serial_io_type: &str,\\n\\n) -> GetSerialCmdlineResult<()> {\\n\\n match serial_parameters\\n\\n .iter()\\n\\n .filter(|(_, p)| p.console)\\n\\n .map(|(k, _)| k)\\n\\n .next()\\n\\n {\\n\\n Some((SerialHardware::Serial, num)) => {\\n\\n cmdline\\n\\n .insert(\\\"console\\\", &format!(\\\"ttyS{}\\\", num - 1))\\n\\n .map_err(GetSerialCmdlineError::KernelCmdline)?;\\n\\n }\\n\\n Some((SerialHardware::VirtioConsole, num)) => {\\n\\n cmdline\\n\\n .insert(\\\"console\\\", &format!(\\\"hvc{}\\\", num - 1))\\n\\n .map_err(GetSerialCmdlineError::KernelCmdline)?;\\n\",\n \"file_path\": \"arch/src/serial.rs\",\n \"rank\": 79,\n \"score\": 183031.0317843838\n },\n {\n \"content\": \"pub fn do_modify_battery(\\n\\n socket_path: &Path,\\n\\n battery_type: &str,\\n\\n property: &str,\\n\\n target: &str,\\n\\n) -> DoModifyBatteryResult {\\n\\n let response = match battery_type.parse::<BatteryType>() {\\n\\n Ok(type_) => match BatControlCommand::new(property.to_string(), target.to_string()) {\\n\\n Ok(cmd) => {\\n\\n let request = VmRequest::BatCommand(type_, cmd);\\n\\n Ok(handle_request(&request, socket_path)?)\\n\\n }\\n\\n Err(e) => Err(ModifyBatError::BatControlErr(e)),\\n\\n },\\n\\n Err(e) => Err(ModifyBatError::BatControlErr(e)),\\n\\n };\\n\\n\\n\\n match response {\\n\\n Ok(response) => {\\n\\n println!(\\\"{}\\\", response);\\n\",\n \"file_path\": \"vm_control/src/client.rs\",\n \"rank\": 80,\n \"score\": 183025.42065927084\n },\n {\n \"content\": \"/// The intent of our panic hook is to get panic info and a stacktrace into the syslog, even for\\n\\n/// jailed subprocesses. It will always abort on panic to ensure a minidump is generated.\\n\\n///\\n\\n/// Note that jailed processes will usually have a stacktrace of <unknown> because the backtrace\\n\\n/// routines attempt to open this binary and are unable to do so in a jail.\\n\\npub fn set_panic_hook() {\\n\\n let default_panic = panic::take_hook();\\n\\n panic::set_hook(Box::new(move |info| {\\n\\n log_panic_info(default_panic.as_ref(), info);\\n\\n // Abort to trigger the crash reporter so that a minidump is generated.\\n\\n abort();\\n\\n }));\\n\\n}\\n\",\n \"file_path\": \"src/panic_hook.rs\",\n \"rank\": 81,\n \"score\": 183025.42065927084\n },\n {\n \"content\": \"pub fn do_usb_attach(\\n\\n socket_path: &Path,\\n\\n bus: u8,\\n\\n addr: u8,\\n\\n vid: u16,\\n\\n pid: u16,\\n\\n dev_path: &Path,\\n\\n) -> ModifyUsbResult<UsbControlResult> {\\n\\n let usb_file: File = if dev_path.parent() == Some(Path::new(\\\"/proc/self/fd\\\")) {\\n\\n // Special case '/proc/self/fd/*' paths. The FD is already open, just use it.\\n\\n // Safe because we will validate |raw_fd|.\\n\\n unsafe { File::from_raw_descriptor(raw_descriptor_from_path(&dev_path)?) }\\n\\n } else {\\n\\n OpenOptions::new()\\n\\n .read(true)\\n\\n .write(true)\\n\\n .open(&dev_path)\\n\\n .map_err(|_| ModifyUsbError::UsbControl(UsbControlResult::FailedToOpenDevice))?\\n\\n };\\n\\n\\n\",\n \"file_path\": \"vm_control/src/client.rs\",\n \"rank\": 82,\n \"score\": 183025.42065927084\n },\n {\n \"content\": \"/// Writes the command line string to the given memory slice.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `guest_mem` - A u8 slice that will be partially overwritten by the command line.\\n\\n/// * `guest_addr` - The address in `guest_mem` at which to load the command line.\\n\\n/// * `cmdline` - The kernel command line.\\n\\npub fn load_cmdline(\\n\\n guest_mem: &GuestMemory,\\n\\n guest_addr: GuestAddress,\\n\\n cmdline: &CStr,\\n\\n) -> Result<()> {\\n\\n let len = cmdline.to_bytes().len();\\n\\n if len == 0 {\\n\\n return Ok(());\\n\\n }\\n\\n\\n\\n let end = guest_addr\\n\\n .checked_add(len as u64 + 1)\\n\\n .ok_or(Error::CommandLineOverflow)?; // Extra for null termination.\\n\\n if end > guest_mem.end_addr() {\\n\\n return Err(Error::CommandLineOverflow);\\n\\n }\\n\\n\\n\\n guest_mem\\n\\n .write_at_addr(cmdline.to_bytes_with_nul(), guest_addr)\\n\\n .map_err(|_| Error::CommandLineCopy)?;\\n\",\n \"file_path\": \"kernel_loader/src/lib.rs\",\n \"rank\": 83,\n \"score\": 183025.42065927084\n },\n {\n \"content\": \"/// Creates a mmio memory region for pstore.\\n\\npub fn create_memory_region(\\n\\n vm: &mut impl Vm,\\n\\n resources: &mut SystemAllocator,\\n\\n pstore: &Pstore,\\n\\n) -> Result<RamoopsRegion> {\\n\\n let file = OpenOptions::new()\\n\\n .read(true)\\n\\n .write(true)\\n\\n .create(true)\\n\\n .open(&pstore.path)\\n\\n .map_err(Error::IoError)?;\\n\\n file.set_len(pstore.size as u64).map_err(Error::IoError)?;\\n\\n\\n\\n let address = resources\\n\\n .mmio_allocator(MmioType::High)\\n\\n .allocate(pstore.size as u64, Alloc::Pstore, \\\"pstore\\\".to_owned())\\n\\n .map_err(Error::ResourcesError)?;\\n\\n\\n\\n let memory_mapping = MemoryMappingBuilder::new(pstore.size as usize)\\n\\n .from_file(&file)\\n\",\n \"file_path\": \"arch/src/pstore.rs\",\n \"rank\": 84,\n \"score\": 183025.42065927084\n },\n {\n \"content\": \"/// Adds serial devices to the provided bus based on the serial parameters given.\\n\\n///\\n\\n/// Only devices with hardware type `SerialHardware::Serial` are added by this function.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `io_bus` - Bus to add the devices to\\n\\n/// * `com_evt_1_3` - event for com1 and com3\\n\\n/// * `com_evt_1_4` - event for com2 and com4\\n\\n/// * `io_bus` - Bus to add the devices to\\n\\n/// * `serial_parameters` - definitions of serial parameter configurations.\\n\\n/// All four of the traditional PC-style serial ports (COM1-COM4) must be specified.\\n\\npub fn add_serial_devices(\\n\\n protected_vm: ProtectionType,\\n\\n io_bus: &mut Bus,\\n\\n com_evt_1_3: &Event,\\n\\n com_evt_2_4: &Event,\\n\\n serial_parameters: &BTreeMap<(SerialHardware, u8), SerialParameters>,\\n\\n serial_jail: Option<Minijail>,\\n\\n) -> Result<(), DeviceRegistrationError> {\\n\\n for x in 0..=3 {\\n\\n let com_evt = match x {\\n\\n 0 => com_evt_1_3,\\n\\n 1 => com_evt_2_4,\\n\\n 2 => com_evt_1_3,\\n\\n 3 => com_evt_2_4,\\n\\n _ => com_evt_1_3,\\n\\n };\\n\\n\\n\\n let param = serial_parameters\\n\\n .get(&(SerialHardware::Serial, x + 1))\\n\\n .ok_or(DeviceRegistrationError::MissingRequiredSerialDevice(x + 1))?;\\n\",\n \"file_path\": \"arch/src/serial.rs\",\n \"rank\": 85,\n \"score\": 183025.42065927084\n },\n {\n \"content\": \"fn finish_ioctl<W: Writer>(unique: u64, res: io::Result<Vec<u8>>, w: W) -> Result<usize> {\\n\\n let (out, data) = match res {\\n\\n Ok(data) => {\\n\\n let out = IoctlOut {\\n\\n result: 0,\\n\\n ..Default::default()\\n\\n };\\n\\n (out, Some(data))\\n\\n }\\n\\n Err(e) => {\\n\\n let out = IoctlOut {\\n\\n result: -e.raw_os_error().unwrap_or(libc::EIO),\\n\\n ..Default::default()\\n\\n };\\n\\n (out, None)\\n\\n }\\n\\n };\\n\\n reply_ok(Some(out), data.as_ref().map(|d| &d[..]), unique, w)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"fuse/src/server.rs\",\n \"rank\": 86,\n \"score\": 182420.48030831665\n },\n {\n \"content\": \"/// Records a log message with the given details.\\n\\n///\\n\\n/// Note that this will fail silently if syslog was not initialized.\\n\\n///\\n\\n/// # Arguments\\n\\n/// * `pri` - The `Priority` (i.e. severity) of the log message.\\n\\n/// * `fac` - The `Facility` of the log message. Usually `Facility::User` should be used.\\n\\n/// * `file_line` - Optional tuple of the name of the file that generated the\\n\\n/// log and the line number within that file.\\n\\n/// * `args` - The log's message to record, in the form of `format_args!()` return value\\n\\n///\\n\\n/// # Examples\\n\\n///\\n\\n/// ```\\n\\n/// # use sys_util::syslog;\\n\\n/// # if let Err(e) = syslog::init() {\\n\\n/// # println!(\\\"failed to initiailize syslog: {}\\\", e);\\n\\n/// # return;\\n\\n/// # }\\n\\n/// syslog::log(syslog::Priority::Error,\\n\\n/// syslog::Facility::User,\\n\\n/// Some((file!(), line!())),\\n\\n/// format_args!(\\\"hello syslog\\\"));\\n\\n/// ```\\n\\npub fn log(pri: Priority, fac: Facility, file_line: Option<(&str, u32)>, args: fmt::Arguments) {\\n\\n let mut state = lock!();\\n\\n let mut buf = [0u8; 1024];\\n\\n\\n\\n state.syslog.log(\\n\\n state.proc_name.as_ref().map(|s| s.as_ref()),\\n\\n pri,\\n\\n fac,\\n\\n file_line,\\n\\n args,\\n\\n );\\n\\n\\n\\n let res = {\\n\\n let mut buf_cursor = Cursor::new(&mut buf[..]);\\n\\n if let Some((file_name, line)) = &file_line {\\n\\n write!(&mut buf_cursor, \\\"[{}:{}:{}] \\\", pri, file_name, line)\\n\\n } else {\\n\\n Ok(())\\n\\n }\\n\\n .and_then(|()| writeln!(&mut buf_cursor, \\\"{}\\\", args))\\n\",\n \"file_path\": \"sys_util/src/syslog.rs\",\n \"rank\": 87,\n \"score\": 182088.94402947137\n },\n {\n \"content\": \"fn fdt_offset(mem_size: u64, has_bios: bool) -> u64 {\\n\\n // TODO(rammuthiah) make kernel and BIOS startup use FDT from the same location. ARCVM startup\\n\\n // currently expects the kernel at 0x80080000 and the FDT at the end of RAM for unknown reasons.\\n\\n // Root cause and figure out how to fold these code paths together.\\n\\n if has_bios {\\n\\n AARCH64_FDT_OFFSET_IN_BIOS_MODE\\n\\n } else {\\n\\n // Put fdt up near the top of memory\\n\\n // TODO(sonnyrao): will have to handle this differently if there's\\n\\n // > 4GB memory\\n\\n mem_size - AARCH64_FDT_MAX_SIZE - 0x10000\\n\\n }\\n\\n}\\n\\n\\n\\npub struct AArch64;\\n\\n\\n\\nimpl arch::LinuxArch for AArch64 {\\n\\n type Error = Error;\\n\\n\\n\\n fn guest_memory_layout(\\n\",\n \"file_path\": \"aarch64/src/lib.rs\",\n \"rank\": 88,\n \"score\": 180704.76411255443\n },\n {\n \"content\": \"/// Construct a bmRequestType value for a control request.\\n\\npub fn control_request_type(\\n\\n type_: ControlRequestType,\\n\\n dir: ControlRequestDataPhaseTransferDirection,\\n\\n recipient: ControlRequestRecipient,\\n\\n) -> u8 {\\n\\n ((type_ as u8) << CONTROL_REQUEST_TYPE_OFFSET)\\n\\n | ((dir as u8) << DATA_PHASE_DIRECTION_OFFSET)\\n\\n | (recipient as u8)\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn control_request_types() {\\n\\n assert_eq!(\\n\\n control_request_type(\\n\\n ControlRequestType::Standard,\\n\\n ControlRequestDataPhaseTransferDirection::HostToDevice,\\n\",\n \"file_path\": \"usb_util/src/types.rs\",\n \"rank\": 89,\n \"score\": 180185.41019897864\n },\n {\n \"content\": \"/// Add the default serial parameters for serial ports that have not already been specified.\\n\\n///\\n\\n/// This ensures that `serial_parameters` will contain parameters for each of the four PC-style\\n\\n/// serial ports (COM1-COM4).\\n\\n///\\n\\n/// It also sets the first `SerialHardware::Serial` to be the default console device if no other\\n\\n/// serial parameters exist with console=true and the first serial device has not already been\\n\\n/// configured explicitly.\\n\\npub fn set_default_serial_parameters(\\n\\n serial_parameters: &mut BTreeMap<(SerialHardware, u8), SerialParameters>,\\n\\n) {\\n\\n // If no console device exists and the first serial port has not been specified,\\n\\n // set the first serial port as a stdout+stdin console.\\n\\n let default_console = (SerialHardware::Serial, 1);\\n\\n if !serial_parameters.iter().any(|(_, p)| p.console) {\\n\\n serial_parameters\\n\\n .entry(default_console)\\n\\n .or_insert(SerialParameters {\\n\\n type_: SerialType::Stdout,\\n\\n hardware: SerialHardware::Serial,\\n\\n path: None,\\n\\n input: None,\\n\\n num: 1,\\n\\n console: true,\\n\\n earlycon: false,\\n\\n stdin: true,\\n\\n });\\n\\n }\\n\",\n \"file_path\": \"arch/src/serial.rs\",\n \"rank\": 90,\n \"score\": 180185.41019897864\n },\n {\n \"content\": \"#[inline]\\n\\nfn usize_to_u64(val: usize) -> u64 {\\n\\n val.try_into().expect(\\\"`usize` doesn't fit inside a `u64`\\\")\\n\\n}\\n\\n\\n\\npub struct PendingOperation {\\n\\n waker_token: Option<WakerToken>,\\n\\n ex: Weak<RawExecutor>,\\n\\n submitted: bool,\\n\\n}\\n\\n\\n\\nimpl Future for PendingOperation {\\n\\n type Output = Result<u32>;\\n\\n\\n\\n fn poll(mut self: Pin<&mut Self>, cx: &mut Context) -> Poll<Self::Output> {\\n\\n let token = self\\n\\n .waker_token\\n\\n .as_ref()\\n\\n .expect(\\\"PendingOperation polled after returning Poll::Ready\\\");\\n\\n if let Some(ex) = self.ex.upgrade() {\\n\\n if let Some(result) = ex.get_result(token, cx) {\\n\",\n \"file_path\": \"cros_async/src/uring_executor.rs\",\n \"rank\": 91,\n \"score\": 178992.64154008956\n },\n {\n \"content\": \"// Unwrap ast to get the named fields. We only care about field names and types:\\n\\n// \\\"myfield : BitField3\\\" -> (\\\"myfield\\\", Token(BitField3))\\n\\nfn get_struct_fields(fields: &FieldsNamed) -> Result<Vec<FieldSpec>> {\\n\\n let mut vec = Vec::new();\\n\\n\\n\\n for field in &fields.named {\\n\\n let ident = field\\n\\n .ident\\n\\n .as_ref()\\n\\n .expect(\\\"Fields::Named has named fields\\\");\\n\\n let ty = &field.ty;\\n\\n let expected_bits = parse_bits_attr(&field.attrs)?;\\n\\n vec.push(FieldSpec {\\n\\n ident,\\n\\n ty,\\n\\n expected_bits,\\n\\n });\\n\\n }\\n\\n\\n\\n Ok(vec)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"bit_field/bit_field_derive/bit_field_derive.rs\",\n \"rank\": 92,\n \"score\": 178891.3579755898\n },\n {\n \"content\": \"fn from_sample_format(format: SampleFormat) -> u8 {\\n\\n match format {\\n\\n SampleFormat::U8 => VIRTIO_SND_PCM_FMT_U8,\\n\\n SampleFormat::S16LE => VIRTIO_SND_PCM_FMT_U16,\\n\\n SampleFormat::S24LE => VIRTIO_SND_PCM_FMT_U24,\\n\\n SampleFormat::S32LE => VIRTIO_SND_PCM_FMT_U32,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"devices/src/virtio/snd/vios_backend/shm_streams.rs\",\n \"rank\": 93,\n \"score\": 178564.5976197162\n },\n {\n \"content\": \"fn bitfield_enum_with_width_impl(\\n\\n ast: &DeriveInput,\\n\\n data: &DataEnum,\\n\\n width: u64,\\n\\n) -> Result<TokenStream> {\\n\\n if width > 64 {\\n\\n return Err(Error::new(\\n\\n Span::call_site(),\\n\\n \\\"max width of bitfield enum is 64\\\",\\n\\n ));\\n\\n }\\n\\n let bits = width as u8;\\n\\n let declare_discriminants = get_declare_discriminants_for_enum(bits, ast, data);\\n\\n\\n\\n let ident = &ast.ident;\\n\\n let type_name = ident.to_string();\\n\\n let variants = &data.variants;\\n\\n let match_discriminants = variants.iter().map(|variant| {\\n\\n let variant = &variant.ident;\\n\\n quote! {\\n\",\n \"file_path\": \"bit_field/bit_field_derive/bit_field_derive.rs\",\n \"rank\": 94,\n \"score\": 178031.0601430477\n },\n {\n \"content\": \"/// Helper function to submit usb_transfer to device handle.\\n\\npub fn submit_transfer(\\n\\n fail_handle: Arc<dyn FailHandle>,\\n\\n job_queue: &Arc<AsyncJobQueue>,\\n\\n xhci_transfer: Arc<XhciTransfer>,\\n\\n device: &mut Device,\\n\\n usb_transfer: Transfer,\\n\\n) -> Result<()> {\\n\\n let transfer_status = {\\n\\n // We need to hold the lock to avoid race condition.\\n\\n // While we are trying to submit the transfer, another thread might want to cancel the same\\n\\n // transfer. Holding the lock here makes sure one of them is cancelled.\\n\\n let mut state = xhci_transfer.state().lock();\\n\\n match mem::replace(&mut *state, XhciTransferState::Cancelled) {\\n\\n XhciTransferState::Created => {\\n\\n match device.submit_transfer(usb_transfer) {\\n\\n Err(e) => {\\n\\n error!(\\\"fail to submit transfer {:?}\\\", e);\\n\\n *state = XhciTransferState::Completed;\\n\\n TransferStatus::NoDevice\\n\\n }\\n\",\n \"file_path\": \"devices/src/usb/host_backend/utils.rs\",\n \"rank\": 95,\n \"score\": 177496.98829326447\n },\n {\n \"content\": \"/// Test utility function to create a descriptor chain in guest memory.\\n\\npub fn create_descriptor_chain(\\n\\n memory: &GuestMemory,\\n\\n descriptor_array_addr: GuestAddress,\\n\\n mut buffers_start_addr: GuestAddress,\\n\\n descriptors: Vec<(DescriptorType, u32)>,\\n\\n spaces_between_regions: u32,\\n\\n) -> Result<DescriptorChain> {\\n\\n let descriptors_len = descriptors.len();\\n\\n for (index, (type_, size)) in descriptors.into_iter().enumerate() {\\n\\n let mut flags = 0;\\n\\n if let DescriptorType::Writable = type_ {\\n\\n flags |= VIRTQ_DESC_F_WRITE;\\n\\n }\\n\\n if index + 1 < descriptors_len {\\n\\n flags |= VIRTQ_DESC_F_NEXT;\\n\\n }\\n\\n\\n\\n let index = index as u16;\\n\\n let desc = virtq_desc {\\n\\n addr: buffers_start_addr.offset().into(),\\n\",\n \"file_path\": \"devices/src/virtio/descriptor_utils.rs\",\n \"rank\": 96,\n \"score\": 177496.98829326447\n },\n {\n \"content\": \"pub fn get_resource_info(\\n\\n tube: &Tube,\\n\\n request: ResourceRequest,\\n\\n) -> std::result::Result<ResourceInfo, ResourceBridgeError> {\\n\\n if let Err(e) = tube.send(&request) {\\n\\n return Err(ResourceBridgeError::SendFailure(request, e));\\n\\n }\\n\\n\\n\\n match tube.recv() {\\n\\n Ok(ResourceResponse::Resource(info)) => Ok(info),\\n\\n Ok(ResourceResponse::Invalid) => Err(ResourceBridgeError::InvalidResource(request)),\\n\\n Err(e) => Err(ResourceBridgeError::RecieveFailure(request, e)),\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"devices/src/virtio/resource_bridge.rs\",\n \"rank\": 97,\n \"score\": 177496.98829326447\n },\n {\n \"content\": \"/// Load an image from a file into guest memory.\\n\\n///\\n\\n/// # Arguments\\n\\n///\\n\\n/// * `guest_mem` - The memory to be used by the guest.\\n\\n/// * `guest_addr` - The starting address to load the image in the guest memory.\\n\\n/// * `max_size` - The amount of space in bytes available in the guest memory for the image.\\n\\n/// * `image` - The file containing the image to be loaded.\\n\\n///\\n\\n/// The size in bytes of the loaded image is returned.\\n\\npub fn load_image<F>(\\n\\n guest_mem: &GuestMemory,\\n\\n image: &mut F,\\n\\n guest_addr: GuestAddress,\\n\\n max_size: u64,\\n\\n) -> Result<usize, LoadImageError>\\n\\nwhere\\n\\n F: Read + Seek + AsRawDescriptor,\\n\\n{\\n\\n let size = image.seek(SeekFrom::End(0)).map_err(LoadImageError::Seek)?;\\n\\n\\n\\n if size > usize::max_value() as u64 || size > max_size {\\n\\n return Err(LoadImageError::ImageSizeTooLarge(size));\\n\\n }\\n\\n\\n\\n // This is safe due to the bounds check above.\\n\\n let size = size as usize;\\n\\n\\n\\n image\\n\\n .seek(SeekFrom::Start(0))\\n\\n .map_err(LoadImageError::Seek)?;\\n\\n\\n\\n guest_mem\\n\\n .read_to_memory(guest_addr, image, size)\\n\\n .map_err(LoadImageError::ReadToMemory)?;\\n\\n\\n\\n Ok(size)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"arch/src/lib.rs\",\n \"rank\": 98,\n \"score\": 176831.00768807397\n },\n {\n \"content\": \"#[inline(always)]\\n\\npub fn pagesize() -> usize {\\n\\n // Trivially safe\\n\\n unsafe { sysconf(_SC_PAGESIZE) as usize }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"sys_util/src/lib.rs\",\n \"rank\": 99,\n \"score\": 176825.85628149443\n }\n]","isConversational":false}}},{"rowIdx":995,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/vec/tests.rs"},"repo_name":{"kind":"string","value":"interlockledger/rust-il2-utils"},"commit":{"kind":"string","value":"1c441c609fd71a25fb3a4644b6ed9052180443a6"},"file_code":{"kind":"string","value":"/*\n * BSD 3-Clause License\n *\n * Copyright (c) 2019-2020, InterlockLedger Network\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * * Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\nuse super::*;\n\n#[test]\nfn test_vecextensions_with_value() {\n for i in 0..32 {\n let sample: [u8; 32] = [i as u8; 32];\n let v: Vec<u8> = Vec::with_value(&sample);\n assert_eq!(v.as_slice(), &sample);\n }\n}\n\n#[test]\nfn test_vecextensions_set_capacity_to() {\n let mut v = Vec::<u8>::new();\n\n v.set_capacity_to(10);\n assert_eq!(v.len(), 0);\n assert!(v.capacity() >= 10);\n\n v.set_capacity_to(100);\n assert_eq!(v.len(), 0);\n assert!(v.capacity() >= 100);\n\n let sample: [u8; 4] = [1, 2, 3, 4];\n let mut v = Vec::<u8>::new();\n v.extend_from_slice(&sample);\n\n v.set_capacity_to(10);\n assert_eq!(v.as_slice(), &sample);\n assert!(v.capacity() >= 10);\n\n v.set_capacity_to(100);\n assert_eq!(v.as_slice(), &sample);\n assert!(v.capacity() >= 100);\n}\n\n#[test]\nfn test_vecextensions_set_capacity_to_secure() {\n let mut v = Vec::<u8>::new();\n\n v.set_capacity_to_secure(10);\n assert_eq!(v.len(), 0);\n assert!(v.capacity() >= 10);\n\n v.set_capacity_to_secure(100);\n assert_eq!(v.len(), 0);\n assert!(v.capacity() >= 100);\n\n let sample: [u8; 4] = [1, 2, 3, 4];\n let mut v = Vec::<u8>::new();\n v.extend_from_slice(&sample);\n\n v.set_capacity_to_secure(10);\n assert_eq!(v.as_slice(), &sample);\n assert!(v.capacity() >= 10);\n\n v.set_capacity_to_secure(100);\n assert_eq!(v.as_slice(), &sample);\n assert!(v.capacity() >= 100);\n}\n\n#[test]\nfn test_vecextensions_set_contents_from_slice() {\n let sample: [u8; 32] = [0xFA; 32];\n\n let mut v = Vec::<u8>::new();\n let old_capacity = v.capacity();\n v.set_contents_from_slice(&sample[0..0]);\n assert!(v.is_empty());\n assert_eq!(v.capacity(), old_capacity);\n\n let mut v = Vec::<u8>::new();\n let old_capacity = v.capacity();\n v.set_contents_from_slice(&sample);\n assert_eq!(v.as_slice(), &sample);\n assert!(old_capacity < v.capacity());\n\n let old_capacity = v.capacity();\n let sample: [u8; 16] = [0xBA; 16];\n v.set_contents_from_slice(&sample);\n assert_eq!(v.as_slice(), &sample);\n assert_eq!(v.capacity(), old_capacity);\n}\n\n#[test]\nfn test_vecextensions_set_contents_from_slice_secure() {\n let sample: [u8; 32] = [0xFA; 32];\n\n let mut v = Vec::<u8>::new();\n let old_capacity = v.capacity();\n v.set_contents_from_slice_secure(&sample[0..0]);\n assert!(v.is_empty());\n assert_eq!(v.capacity(), old_capacity);\n\n let mut v = Vec::<u8>::new();\n let old_capacity = v.capacity();\n v.set_contents_from_slice_secure(&sample);\n assert_eq!(v.as_slice(), &sample);\n assert!(old_capacity < v.capacity());\n\n let old_capacity = v.capacity();\n let sample: [u8; 16] = [0xBA; 16];\n v.set_contents_from_slice_secure(&sample);\n assert_eq!(v.as_slice(), &sample);\n assert_eq!(v.capacity(), old_capacity);\n}\n\n#[test]\nfn test_vecextensions_shrink_to_fit_secure() {\n let sample: [u8; 32] = [0xFA; 32];\n\n let mut v = Vec::<u8>::with_capacity(128);\n let old_capacity = v.capacity();\n v.shrink_to_fit_secure();\n assert!(v.capacity() < old_capacity);\n\n let mut v = Vec::<u8>::with_capacity(128);\n let old_capacity = v.capacity();\n v.set_contents_from_slice(&sample);\n v.shrink_to_fit_secure();\n assert!(v.capacity() < old_capacity);\n assert_eq!(v.as_slice(), &sample);\n}\n\n#[test]\nfn test_vecextensions_reserve_secure() {\n let sample: [u8; 32] = [0xFA; 32];\n\n let mut v = Vec::<u8>::new();\n let old_capacity = v.capacity();\n v.reserve_secure(10);\n assert!(v.capacity() > old_capacity);\n\n let mut v = Vec::<u8>::new();\n v.set_contents_from_slice(&sample);\n let old_capacity = v.capacity();\n v.reserve_secure(128);\n assert!(v.capacity() > old_capacity);\n assert_eq!(v.as_slice(), &sample);\n}\n\n#[test]\nfn test_vecextensions_extend_from_slice_secure() {\n let mut v = Vec::<u8>::new();\n let mut exp = Vec::<u8>::new();\n\n for i in 0..32 {\n let sample: [u8; 32] = [i as u8; 32];\n v.extend_from_slice_secure(&sample);\n exp.extend_from_slice(&sample);\n assert_eq!(v.as_slice(), exp.as_slice());\n }\n}\n"},"prefix":{"kind":"string","value":"/*\n * BSD 3-Clause License\n *\n * Copyright (c) 2019-2020, InterlockLedger Network\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * * Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\nuse super::*;\n\n#[test]\nfn test_vecextensions_with_value() {\n for i in 0..32 {\n let sample: [u8; 32] = [i as u8; 32];\n let v: Vec<u8> = Vec::with_value(&sample);\n assert_eq!(v.as_slice(), &sample);\n }\n}\n\n#[test]\nfn test_vecextensions_set_capacity_to() {\n let mut v = Vec::<u8>::new();\n\n v.set_capacity_to(10);\n assert_eq!(v.len(), 0);\n assert!(v.capacity() >= 10);\n\n v.set_capacity_to(100);\n assert_eq!(v.len(), 0);\n assert!(v.capacity() >= 100);\n\n let sample: [u8; 4] = [1, 2, 3, 4];\n let mut v = Vec::<u8>::new();\n v.extend_from_slice(&sample);\n\n v.set_capacity_to(10);\n assert_eq!(v.as_slice(), &sample);\n assert!(v.capacity() >= 10);\n\n v.set_capacity_to(100);\n assert_eq!(v.as_slice(), &sample);\n assert!(v.capacity() >= 100);\n}\n\n#[test]\n"},"suffix":{"kind":"string","value":"\n\n#[test]\nfn test_vecextensions_set_contents_from_slice() {\n let sample: [u8; 32] = [0xFA; 32];\n\n let mut v = Vec::<u8>::new();\n let old_capacity = v.capacity();\n v.set_contents_from_slice(&sample[0..0]);\n assert!(v.is_empty());\n assert_eq!(v.capacity(), old_capacity);\n\n let mut v = Vec::<u8>::new();\n let old_capacity = v.capacity();\n v.set_contents_from_slice(&sample);\n assert_eq!(v.as_slice(), &sample);\n assert!(old_capacity < v.capacity());\n\n let old_capacity = v.capacity();\n let sample: [u8; 16] = [0xBA; 16];\n v.set_contents_from_slice(&sample);\n assert_eq!(v.as_slice(), &sample);\n assert_eq!(v.capacity(), old_capacity);\n}\n\n#[test]\nfn test_vecextensions_set_contents_from_slice_secure() {\n let sample: [u8; 32] = [0xFA; 32];\n\n let mut v = Vec::<u8>::new();\n let old_capacity = v.capacity();\n v.set_contents_from_slice_secure(&sample[0..0]);\n assert!(v.is_empty());\n assert_eq!(v.capacity(), old_capacity);\n\n let mut v = Vec::<u8>::new();\n let old_capacity = v.capacity();\n v.set_contents_from_slice_secure(&sample);\n assert_eq!(v.as_slice(), &sample);\n assert!(old_capacity < v.capacity());\n\n let old_capacity = v.capacity();\n let sample: [u8; 16] = [0xBA; 16];\n v.set_contents_from_slice_secure(&sample);\n assert_eq!(v.as_slice(), &sample);\n assert_eq!(v.capacity(), old_capacity);\n}\n\n#[test]\nfn test_vecextensions_shrink_to_fit_secure() {\n let sample: [u8; 32] = [0xFA; 32];\n\n let mut v = Vec::<u8>::with_capacity(128);\n let old_capacity = v.capacity();\n v.shrink_to_fit_secure();\n assert!(v.capacity() < old_capacity);\n\n let mut v = Vec::<u8>::with_capacity(128);\n let old_capacity = v.capacity();\n v.set_contents_from_slice(&sample);\n v.shrink_to_fit_secure();\n assert!(v.capacity() < old_capacity);\n assert_eq!(v.as_slice(), &sample);\n}\n\n#[test]\nfn test_vecextensions_reserve_secure() {\n let sample: [u8; 32] = [0xFA; 32];\n\n let mut v = Vec::<u8>::new();\n let old_capacity = v.capacity();\n v.reserve_secure(10);\n assert!(v.capacity() > old_capacity);\n\n let mut v = Vec::<u8>::new();\n v.set_contents_from_slice(&sample);\n let old_capacity = v.capacity();\n v.reserve_secure(128);\n assert!(v.capacity() > old_capacity);\n assert_eq!(v.as_slice(), &sample);\n}\n\n#[test]\nfn test_vecextensions_extend_from_slice_secure() {\n let mut v = Vec::<u8>::new();\n let mut exp = Vec::<u8>::new();\n\n for i in 0..32 {\n let sample: [u8; 32] = [i as u8; 32];\n v.extend_from_slice_secure(&sample);\n exp.extend_from_slice(&sample);\n assert_eq!(v.as_slice(), exp.as_slice());\n }\n}\n"},"middle":{"kind":"string","value":"fn test_vecextensions_set_capacity_to_secure() {\n let mut v = Vec::<u8>::new();\n\n v.set_capacity_to_secure(10);\n assert_eq!(v.len(), 0);\n assert!(v.capacity() >= 10);\n\n v.set_capacity_to_secure(100);\n assert_eq!(v.len(), 0);\n assert!(v.capacity() >= 100);\n\n let sample: [u8; 4] = [1, 2, 3, 4];\n let mut v = Vec::<u8>::new();\n v.extend_from_slice(&sample);\n\n v.set_capacity_to_secure(10);\n assert_eq!(v.as_slice(), &sample);\n assert!(v.capacity() >= 10);\n\n v.set_capacity_to_secure(100);\n assert_eq!(v.as_slice(), &sample);\n assert!(v.capacity() >= 100);\n}"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[{"content":"#[test]\n\nfn test_defaultsharedfilelocknamebuilder_namebuilder_create_lock_file_name() {\n\n let b = DefaultSharedFileLockNameBuilder;\n\n\n\n let name = OsStr::new(\"file\");\n\n assert_eq!(b.create_lock_file_name(name), OsStr::new(\".file.lock~\"));\n\n\n\n let name = OsStr::new(\"z\");\n\n assert_eq!(b.create_lock_file_name(name), OsStr::new(\".z.lock~\"));\n\n}\n\n\n\n//=============================================================================\n\n// SharedFileReadLockGuard\n\n//-----------------------------------------------------------------------------\n","file_path":"src/fs/shared/tests.rs","rank":3,"score":91801.94253521915},{"content":"#[test]\n\nfn test_defaultprotectedvalue() {\n\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\n\n\n\n let p = DefaultProtectedValue::new(&exp);\n\n assert_ne!(p.secret.value(), &exp);\n\n assert_ne!(p.seed, 0);\n\n\n\n let v = p.get_secret();\n\n assert_eq!(v.value(), &exp);\n\n}\n\n\n\n//=============================================================================\n\n// ProtectedValue\n\n//-----------------------------------------------------------------------------\n","file_path":"src/mem/tests.rs","rank":4,"score":77921.59515923585},{"content":"#[test]\n\nfn test_simplecache_impl() {\n\n let c: SimpleCache<u64, u64> = SimpleCache::new(10);\n\n {\n\n let r = c.engine.read().unwrap();\n\n assert_eq!(r.len(), 0);\n\n }\n\n {\n\n let mut w = c.engine.write().unwrap();\n\n w.clear();\n\n }\n\n}\n\n\n","file_path":"src/cache/tests.rs","rank":5,"score":75977.97706417715},{"content":"#[test]\n\nfn test_nanoseconds_to_microseconds() {\n\n assert_eq!(nanoseconds_to_microseconds(12345), 12);\n\n assert_eq!(nanoseconds_to_microseconds(2345), 2);\n\n assert_eq!(nanoseconds_to_microseconds(345), 0);\n\n}\n","file_path":"src/time/tests.rs","rank":7,"score":75977.97706417715},{"content":"#[test]\n\nfn test_simplecacheentry_impl() {\n\n let v = Arc::new(10 as u64);\n\n\n\n let e = SimpleCacheEntry::new(&v, 10);\n\n assert_eq!(e.counter(), 10);\n\n\n\n let vr = e.get_value();\n\n assert_eq!(v, vr);\n\n assert!(!std::ptr::eq(&v, &vr));\n\n\n\n let mut e = SimpleCacheEntry::new(&v, 10);\n\n assert_eq!(e.counter(), 10);\n\n e.set_counter(1234);\n\n assert_eq!(e.counter(), 1234);\n\n}\n\n\n\n//=============================================================================\n\n// SimpleCacheEngine\n\n//-----------------------------------------------------------------------------\n","file_path":"src/cache/tests.rs","rank":8,"score":75977.97706417715},{"content":"#[test]\n\nfn test_bytemaskgenerator_new() {\n\n let g = ByteMaskGenerator::new(1234);\n\n assert_eq!(g.state, 1234)\n\n}\n\n\n","file_path":"src/mem/tests.rs","rank":9,"score":75977.97706417715},{"content":"#[test]\n\nfn test_bytemaskgenerator_next() {\n\n // Reference\n\n let mut g = ByteMaskGenerator::new(1234);\n\n assert_eq!(g.next(), 0x5b);\n\n assert_eq!(g.next(), 0x18);\n\n assert_eq!(g.next(), 0x2a);\n\n\n\n // Test stability\n\n let seed: u64 = random();\n\n let mut g1 = ByteMaskGenerator::new(seed);\n\n let mut g2 = ByteMaskGenerator::new(seed);\n\n for _ in 0..1000 {\n\n assert_eq!(g1.next(), g2.next());\n\n }\n\n}\n\n\n\n//=============================================================================\n\n// DefaultProtectedValue\n\n//-----------------------------------------------------------------------------\n","file_path":"src/mem/tests.rs","rank":10,"score":75977.97706417715},{"content":"#[cfg(target_os = \"linux\")]\n\n#[test]\n\nfn test_lock_supported() {\n\n assert!(lock_supported());\n\n}\n\n\n\n//=============================================================================\n\n// SecretBytes\n\n//-----------------------------------------------------------------------------\n","file_path":"src/mem/tests.rs","rank":11,"score":75977.72790489894},{"content":"#[test]\n\nfn test_defaultprotectedvalue_apply_mask() {\n\n let zero: [u8; 16] = [0; 16];\n\n let seed = 1234;\n\n let mut apply: [u8; 16] = [0; 16];\n\n\n\n DefaultProtectedValue::apply_mask(seed, &mut apply);\n\n assert_ne!(&zero, &apply);\n\n DefaultProtectedValue::apply_mask(seed, &mut apply);\n\n assert_eq!(&zero, &apply);\n\n}\n\n\n","file_path":"src/mem/tests.rs","rank":12,"score":74157.97607077617},{"content":"#[test]\n\nfn test_simplesliceserializer_impl() {\n\n let mut data: [u8; 4] = [0; 4];\n\n let mut v = SimpleSliceSerializer::new(&mut data);\n\n\n\n for i in 0..4 {\n\n v.offset = i;\n\n assert_eq!(v.offset(), i);\n\n assert_eq!(v.available(), 4 - i);\n\n assert_eq!(v.offset(), i);\n\n for r in 0..v.available() {\n\n v.can_write(r).unwrap();\n\n }\n\n assert!(matches!(\n\n v.can_write(v.available() + 1),\n\n Err(ErrorKind::UnableToWrite)\n\n ));\n\n }\n\n}\n\n\n","file_path":"src/simple_serialization/tests.rs","rank":13,"score":74157.97607077617},{"content":"#[test]\n\nfn test_secret_bytes_with_value() {\n\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\n\n\n\n // Locked\n\n let s = SecretBytes::with_value(&exp, true);\n\n assert_eq!(s.len(), s.len());\n\n assert_eq!(s.buffer_len(), s.len());\n\n assert_eq!(s.value(), &exp);\n\n if SecretBytes::lock_supported() {\n\n assert!(s.locked());\n\n } else {\n\n assert!(!s.locked());\n\n }\n\n\n\n // Unlocked\n\n let s = SecretBytes::with_value(&exp, false);\n\n assert_eq!(s.len(), s.len());\n\n assert_eq!(s.buffer_len(), s.len());\n\n assert_eq!(s.value(), &exp);\n\n assert!(!s.locked());\n\n}\n\n\n","file_path":"src/mem/tests.rs","rank":14,"score":74157.97607077617},{"content":"#[test]\n\nfn test_sharedfilewritelockguard_impl() {\n\n let test_dir = TestDirUtils::new(\"test_sharedfilewritelockguard_impl\").unwrap();\n\n let lock_file = test_dir.create_test_file(\"target.lock\", b\"1\").unwrap();\n\n let target_file = test_dir.create_test_file(\"target\", b\"2\").unwrap();\n\n\n\n let mut lock = fd_lock::RwLock::new(File::open(&lock_file).unwrap());\n\n let mut lock2 = fd_lock::RwLock::new(File::open(&lock_file).unwrap());\n\n let mut target = OpenOptions::new()\n\n .read(true)\n\n .write(true)\n\n .open(&target_file)\n\n .unwrap();\n\n {\n\n let mut rwlock = SharedFileWriteLockGuard {\n\n file: &mut target,\n\n _lock: lock.write().unwrap(),\n\n };\n\n // Cannot read nor write\n\n assert!(lock2.try_write().is_err());\n\n drop(lock2.try_read().is_err());\n","file_path":"src/fs/shared/tests.rs","rank":15,"score":74157.97607077617},{"content":"#[test]\n\nfn test_secret_bytes_clone() {\n\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\n\n // Locked\n\n let mut src = SecretBytes::with_value(&exp, true);\n\n let s = src.clone();\n\n assert_eq!(s.len(), s.len());\n\n assert_eq!(s.buffer_len(), s.len());\n\n assert_eq!(s.value(), &exp);\n\n if SecretBytes::lock_supported() {\n\n assert!(s.locked());\n\n } else {\n\n assert!(!s.locked());\n\n }\n\n\n\n // Locked alt len\n\n src.set_len(6);\n\n let s = src.clone();\n\n assert_eq!(s.len(), 6);\n\n assert_eq!(s.buffer_len(), exp.len());\n\n assert_eq!(s.value(), &exp[..6]);\n","file_path":"src/mem/tests.rs","rank":16,"score":74157.97607077617},{"content":"#[test]\n\nfn test_shared_directory() {\n\n let test_dir = TestDirUtils::new(\"test_shared_directory\").unwrap();\n\n test_dir.reset().unwrap();\n\n\n\n let mut shared1 = SharedDirectory::new(test_dir.test_dir()).unwrap();\n\n\n\n // Ensure that the lock file exists\n\n let lock_file = test_dir.get_test_file_path(SharedDirectory::DEFAULT_LOCK_FILE_NAME);\n\n let lock_file_path = Path::new(&lock_file);\n\n assert!(lock_file_path.is_file());\n\n\n\n let mut shared2 = SharedDirectory::new(test_dir.test_dir()).unwrap();\n\n\n\n // Test write lock from 1 and read from 2\n\n let lock1 = shared1.write().unwrap();\n\n assert!(shared2.try_read().is_err());\n\n drop(lock1);\n\n\n\n // Test read from 2 and write from 1\n\n let lock2 = shared2.read().unwrap();\n\n assert!(shared1.try_write().is_err());\n\n drop(lock2);\n\n\n\n // Write again fom 1\n\n let lock1 = shared1.write().unwrap();\n\n drop(lock1);\n\n}\n","file_path":"src/fs/shared/tests.rs","rank":17,"score":74157.97607077617},{"content":"#[test]\n\nfn test_secret_bytes_new() {\n\n // Locked\n\n let s = SecretBytes::new(16, true);\n\n let exp: [u8; 16] = [0; 16];\n\n assert_eq!(s.len(), s.len());\n\n assert_eq!(s.buffer_len(), s.len());\n\n assert_eq!(s.value(), &exp);\n\n if SecretBytes::lock_supported() {\n\n assert!(s.locked());\n\n } else {\n\n assert!(!s.locked());\n\n }\n\n\n\n // Unlocked\n\n let s = SecretBytes::new(16, false);\n\n let exp: [u8; 16] = [0; 16];\n\n assert_eq!(s.len(), s.len());\n\n assert_eq!(s.buffer_len(), s.len());\n\n assert_eq!(s.value(), &exp);\n\n assert!(!s.locked());\n\n}\n\n\n","file_path":"src/mem/tests.rs","rank":18,"score":74157.97607077617},{"content":"#[test]\n\nfn test_defaultsharedfilelocknamebuilder_impl() {\n\n assert_eq!(DefaultSharedFileLockNameBuilder::LOCK_FILE_PREFIX, \".\");\n\n assert_eq!(DefaultSharedFileLockNameBuilder::LOCK_FILE_SUFFIX, \".lock~\");\n\n}\n\n\n","file_path":"src/fs/shared/tests.rs","rank":19,"score":74157.97607077617},{"content":"#[test]\n\nfn test_sharedfile_impl() {\n\n let test_dir = TestDirUtils::new(\"test_sharedfile_impl\").unwrap();\n\n\n\n // This test ends up testing all constructors because\n\n // new() calls with_options(),\n\n // with_options() calls with_option_builder() and\n\n // with_option_builder() calls with_option_lock_file().\n\n //\n\n // Furthermore, it also tests read(), try_read(), write() and try_write() as\n\n // well in a concurrent scenario with at least to SharedFile instances\n\n // pointing to the same file.\n\n let dummy_content: &'static str = \"123456\";\n\n let test_file = test_dir.get_test_file_path(\"protected\");\n\n let test_file_path = Path::new(&test_file);\n\n let lock_file_builder = DefaultSharedFileLockNameBuilder;\n\n let test_file_lock = lock_file_builder\n\n .create_lock_file_path(test_file_path)\n\n .unwrap();\n\n let test_file_lock_path = Path::new(&test_file_lock);\n\n\n","file_path":"src/fs/shared/tests.rs","rank":20,"score":74157.97607077617},{"content":"#[test]\n\nfn test_simplecacheengine_simplecacheengine_insert() {\n\n let mut e: SimpleCacheEngine<u64, u64> = SimpleCacheEngine::new(10);\n\n\n\n // Adding 10 entries\n\n for key in 0..10 as u64 {\n\n assert_eq!(e.len(), key as usize);\n\n let value = Arc::new(key + 100);\n\n let curr_counter = e.counter;\n\n e.insert(key, &value);\n\n assert_eq!(e.len(), (key + 1) as usize);\n\n let entry = e.map.get(&key).unwrap();\n\n assert_eq!(entry.counter, curr_counter);\n\n assert_eq!(*entry.value, *value);\n\n }\n\n\n\n // Replacing entries\n\n for key in 0..10 as u64 {\n\n assert_eq!(e.len(), 10);\n\n let value = Arc::new(key + 1000);\n\n let curr_counter = e.counter;\n","file_path":"src/cache/tests.rs","rank":21,"score":74157.97607077617},{"content":"#[test]\n\nfn test_simpleslicedeserializer_impl() {\n\n let data: [u8; 4] = [0; 4];\n\n let mut v = SimpleSliceDeserializer::new(&data);\n\n\n\n for i in 0..4 {\n\n v.offset = i;\n\n assert_eq!(v.offset(), i);\n\n assert_eq!(v.avaliable(), 4 - i);\n\n for r in 0..v.avaliable() {\n\n v.can_read(r).unwrap();\n\n }\n\n assert!(matches!(\n\n v.can_read(v.avaliable() + 1),\n\n Err(ErrorKind::UnableToRead)\n\n ));\n\n }\n\n}\n\n\n","file_path":"src/simple_serialization/tests.rs","rank":22,"score":74157.97607077617},{"content":"#[test]\n\nfn test_error_conversion() {\n\n match translation() {\n\n Err(MyErrorkind::MyError) => (),\n\n Ok(()) => panic!(\"Error expected!\"),\n\n }\n\n}\n\n\n\n//=============================================================================\n\n// Samples\n\n//-----------------------------------------------------------------------------\n\nconst SAMPLE: &'static [u8; 50] = &[\n\n 0x36, 0x57, 0x2c, 0x7d, 0xe4, 0x48, 0xb2, 0x70, 0xc4, 0x87, 0x47, 0x46, 0xab, 0x46, 0x67, 0x5f,\n\n 0x43, 0xea, 0xee, 0xf6, 0xe5, 0x5a, 0xf7, 0x0e, 0x57, 0xb5, 0x60, 0xa6, 0x8f, 0x81, 0x66, 0x42,\n\n 0x11, 0x40, 0x49, 0x0f, 0xdb, 0x40, 0x09, 0x21, 0xFB, 0x54, 0x44, 0x2D, 0x18, 0x00, 0x03, 0x19,\n\n 0x26, 0x39,\n\n];\n\n\n\nconst SAMPLE00: &'static [u8; 3] = &[0x36, 0x57, 0x2c];\n\nconst SAMPLE01: u8 = 0x7d;\n\nconst SAMPLE02: u16 = 0xe448;\n","file_path":"src/simple_serialization/tests.rs","rank":23,"score":74157.97607077617},{"content":"#[test]\n\nfn test_simpledataserializer_vec() {\n\n let mut v = Vec::<u8>::new();\n\n\n\n v.write(SAMPLE00).unwrap();\n\n v.write_u8(SAMPLE01).unwrap();\n\n v.write_u16(SAMPLE02).unwrap();\n\n v.write_u32(SAMPLE03).unwrap();\n\n v.write_u64(SAMPLE04).unwrap();\n\n v.write_i8(SAMPLE05).unwrap();\n\n v.write_i16(SAMPLE06).unwrap();\n\n v.write_i32(SAMPLE07).unwrap();\n\n v.write_i64(SAMPLE08).unwrap();\n\n v.write_f32(SAMPLE09).unwrap();\n\n v.write_f64(SAMPLE10).unwrap();\n\n v.write_byte_array(SAMPLE11).unwrap();\n\n assert_eq!(v.as_slice(), SAMPLE);\n\n}\n\n\n\n//=============================================================================\n\n// SimpleSliceSerializer\n\n//-----------------------------------------------------------------------------\n","file_path":"src/simple_serialization/tests.rs","rank":24,"score":74157.97607077617},{"content":"#[test]\n\nfn test_simplecacheengine_impl_new() {\n\n let e: SimpleCacheEngine<u64, u64> = SimpleCacheEngine::new(10);\n\n assert_eq!(e.map.len(), 0);\n\n assert_eq!(e.max_size, 10);\n\n assert_eq!(e.counter, 0);\n\n}\n\n\n","file_path":"src/cache/tests.rs","rank":25,"score":74157.97607077617},{"content":"#[test]\n\nfn test_sharedfilereadlockguard_impl() {\n\n let test_dir = TestDirUtils::new(\"test_sharedfilereadlockguard_impl\").unwrap();\n\n let lock_file = test_dir.create_test_file(\"target.lock\", b\"1\").unwrap();\n\n let target_file = test_dir.create_test_file(\"target\", b\"2\").unwrap();\n\n\n\n let lock = fd_lock::RwLock::new(File::open(&lock_file).unwrap());\n\n let mut lock2 = fd_lock::RwLock::new(File::open(&lock_file).unwrap());\n\n let mut target = OpenOptions::new()\n\n .read(true)\n\n .write(true)\n\n .open(&target_file)\n\n .unwrap();\n\n {\n\n let mut rlock = SharedFileReadLockGuard {\n\n file: &mut target,\n\n _lock: lock.read().unwrap(),\n\n };\n\n // Cannot write\n\n assert!(lock2.try_write().is_err());\n\n // But can read\n","file_path":"src/fs/shared/tests.rs","rank":26,"score":74157.97607077617},{"content":"#[test]\n\nfn test_secret_bytes_len() {\n\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\n\n let mut s = SecretBytes::with_value(&exp, false);\n\n\n\n assert_eq!(s.len(), exp.len());\n\n assert_eq!(s.buffer_len(), exp.len());\n\n assert_eq!(s.value(), &exp);\n\n assert_eq!(s.mut_value(), &exp);\n\n assert_eq!(s.buffer(), &exp);\n\n assert_eq!(s.mut_buffer(), &exp);\n\n assert_eq!(s.value().as_ptr(), s.buffer().as_ptr());\n\n\n\n s.set_len(4);\n\n assert_eq!(s.len(), 4);\n\n assert_eq!(s.buffer_len(), exp.len());\n\n assert_eq!(s.value(), &exp[..4]);\n\n assert_eq!(s.mut_value(), &exp[..4]);\n\n assert_eq!(s.mut_buffer(), &exp);\n\n assert_eq!(s.value().as_ptr(), s.buffer().as_ptr());\n\n\n\n s.set_len(9);\n\n assert_eq!(s.len(), exp.len());\n\n assert_eq!(s.buffer_len(), exp.len());\n\n assert_eq!(s.value(), &exp);\n\n assert_eq!(s.mut_value(), &exp);\n\n assert_eq!(s.mut_buffer(), &exp);\n\n assert_eq!(s.value().as_ptr(), s.buffer().as_ptr());\n\n}\n\n\n","file_path":"src/mem/tests.rs","rank":27,"score":74157.97607077617},{"content":"#[test]\n\nfn test_create_protected_value() {\n\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\n\n let x = create_protected_value(&exp);\n\n let y = x.clone();\n\n\n\n let s1 = x.get_secret();\n\n let s2 = y.get_secret();\n\n assert_eq!(s1.value(), &exp);\n\n assert_eq!(s1.value(), s2.value());\n\n}\n","file_path":"src/mem/tests.rs","rank":28,"score":74157.97607077617},{"content":"#[test]\n\nfn test_simplecacheengine_simplecacheengine_get() {\n\n let mut e: SimpleCacheEngine<u64, u64> = SimpleCacheEngine::new(10);\n\n\n\n for key in 0..10 as u64 {\n\n let value = Arc::new(key + 100);\n\n let counter = e.next_counter();\n\n e.map.insert(key, SimpleCacheEntry::new(&value, counter));\n\n }\n\n\n\n // Test the recovery and the counter update at each\n\n for key in 0..10 as u64 {\n\n let old_counter = e.map.get(&key).unwrap().counter;\n\n let v = e.get(&key).unwrap();\n\n assert_eq!(*v, key + 100);\n\n let new_counter = e.map.get(&key).unwrap().counter;\n\n assert!(old_counter < new_counter);\n\n }\n\n\n\n // Ensure that the counter is always increased\n\n for key in 0..10 as u64 {\n","file_path":"src/cache/tests.rs","rank":29,"score":74157.97607077617},{"content":"#[test]\n\nfn test_simplecacheengine_simplecacheengine_clear() {\n\n let mut e: SimpleCacheEngine<u64, u64> = SimpleCacheEngine::new(10);\n\n\n\n for key in 0..10 as u64 {\n\n let value = Arc::new(key + 100);\n\n e.insert(key, &value);\n\n assert_eq!(e.len(), (key + 1) as usize);\n\n }\n\n assert!(!e.is_empty());\n\n e.clear();\n\n assert!(e.is_empty());\n\n}\n\n\n\n//=============================================================================\n\n// SimpleCache\n\n//-----------------------------------------------------------------------------\n","file_path":"src/cache/tests.rs","rank":30,"score":74157.97607077617},{"content":"#[cfg(target_os = \"linux\")]\n\n#[test]\n\nfn test_lock_unlock_mem() {\n\n let mut vec = Vec::<u8>::with_capacity(16);\n\n vec.resize(16, 0);\n\n\n\n assert!(lock_mem(vec.as_ptr(), vec.len()));\n\n assert!(unlock_mem(vec.as_ptr(), vec.len()));\n\n\n\n assert!(!lock_mem(vec.as_ptr(), 0));\n\n assert!(!unlock_mem(vec.as_ptr(), 0));\n\n}\n\n\n","file_path":"src/mem/tests.rs","rank":31,"score":74157.72691149797},{"content":"#[test]\n\nfn test_simplecache_valuecache_concurrent_clear() {\n\n let c: Arc<SimpleCache<u64, u64>> = Arc::new(SimpleCache::new(10));\n\n\n\n for key in 0..10 as u64 {\n\n let value = Arc::new(key + 1000);\n\n c.insert(key, &value);\n\n }\n\n\n\n let t1c = Arc::clone(&c);\n\n let t1 = std::thread::spawn(move || {\n\n t1c.clear();\n\n assert_eq!(t1c.len(), 0);\n\n assert!(t1c.is_empty());\n\n });\n\n let t2c = Arc::clone(&c);\n\n let t2 = std::thread::spawn(move || {\n\n t2c.clear();\n\n assert_eq!(t2c.len(), 0);\n\n assert!(t2c.is_empty());\n\n });\n\n t1.join().unwrap();\n\n t2.join().unwrap();\n\n\n\n assert_eq!(c.len(), 0);\n\n assert!(c.is_empty());\n\n}\n","file_path":"src/cache/tests.rs","rank":32,"score":72449.74060012537},{"content":"#[test]\n\nfn test_win32protectedvalue_new() {\n\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\n\n let p = Win32ProtectedValue::new(&exp);\n\n\n\n assert_eq!(p.protected_data.len(), exp.len());\n\n assert_eq!(\n\n p.protected_data.buffer_len(),\n\n Win32ProtectedValue::protected_size(exp.len())\n\n );\n\n assert_ne!(p.protected_data.value(), &exp);\n\n}\n\n\n","file_path":"src/mem/impl_win32/tests.rs","rank":33,"score":72449.74060012537},{"content":"#[test]\n\nfn test_simplesliceserializer_simpledataserializer_write() {\n\n let mut data: [u8; 50] = [0; 50];\n\n let mut v = SimpleSliceSerializer::new(&mut data);\n\n\n\n v.write(SAMPLE00).unwrap();\n\n v.write_u8(SAMPLE01).unwrap();\n\n v.write_u16(SAMPLE02).unwrap();\n\n v.write_u32(SAMPLE03).unwrap();\n\n v.write_u64(SAMPLE04).unwrap();\n\n v.write_i8(SAMPLE05).unwrap();\n\n v.write_i16(SAMPLE06).unwrap();\n\n v.write_i32(SAMPLE07).unwrap();\n\n v.write_i64(SAMPLE08).unwrap();\n\n v.write_f32(SAMPLE09).unwrap();\n\n v.write_f64(SAMPLE10).unwrap();\n\n v.write_byte_array(SAMPLE11).unwrap();\n\n assert_eq!(&data, SAMPLE);\n\n}\n\n\n","file_path":"src/simple_serialization/tests.rs","rank":35,"score":72449.74060012537},{"content":"#[test]\n\nfn test_simplecacheengine_impl_next_counter() {\n\n let mut e: SimpleCacheEngine<u64, u64> = SimpleCacheEngine::new(10);\n\n\n\n assert_eq!(e.counter, 0);\n\n assert_eq!(e.next_counter(), 0);\n\n assert_eq!(e.next_counter(), 1);\n\n assert_eq!(e.next_counter(), 2);\n\n assert_eq!(e.next_counter(), 3);\n\n}\n\n\n","file_path":"src/cache/tests.rs","rank":37,"score":72449.74060012537},{"content":"#[test]\n\nfn test_simplecacheengine_impl_remove_oldest() {\n\n let mut e: SimpleCacheEngine<u64, u64> = SimpleCacheEngine::new(10);\n\n\n\n for key in 0..10 as u64 {\n\n let value = Arc::new(key);\n\n e.map.insert(key, SimpleCacheEntry::new(&value, key));\n\n }\n\n for key in 0..10 as u64 {\n\n assert_eq!(e.len(), (10 - key) as usize);\n\n e.remove_oldest();\n\n assert_eq!(e.len(), (10 - key - 1) as usize);\n\n assert!(e.get(&key).is_none());\n\n }\n\n}\n\n\n","file_path":"src/cache/tests.rs","rank":38,"score":72449.74060012537},{"content":"#[test]\n\nfn test_sharedfile_default_options() {\n\n let options = SharedFile::default_options();\n\n let mut exp_options = OpenOptions::new();\n\n exp_options.read(true).write(true).create(true);\n\n // I'll compare the contents of both options using debug as it has\n\n // access to the internal fields. Furthermore, the debug strings should\n\n // be equal if the objects are instantiated in the same way. Furthermore,\n\n // I think it will\n\n assert_eq!(format!(\"{:?}\", options), format!(\"{:?}\", exp_options));\n\n}\n\n\n\n//=============================================================================\n\n// SharedDirectory\n\n//-----------------------------------------------------------------------------\n\n\n","file_path":"src/fs/shared/tests.rs","rank":40,"score":72449.74060012537},{"content":"#[test]\n\nfn test_simplecache_valuecache_concurrent_insert() {\n\n let c: Arc<SimpleCache<u64, u64>> = Arc::new(SimpleCache::new(10));\n\n\n\n let t1c = Arc::clone(&c);\n\n let t1 = std::thread::spawn(move || {\n\n for key in 0..8 as u64 {\n\n let value = Arc::new(key + 1000);\n\n t1c.insert(key, &value);\n\n }\n\n });\n\n let t2c = Arc::clone(&c);\n\n let t2 = std::thread::spawn(move || {\n\n for key in 2..10 as u64 {\n\n let value = Arc::new(key + 10000);\n\n t2c.insert(key, &value);\n\n }\n\n });\n\n t1.join().unwrap();\n\n t2.join().unwrap();\n\n\n\n // Test the result of the inserts\n\n for key in 0..10 as u64 {\n\n c.get(&key).unwrap();\n\n }\n\n}\n\n\n","file_path":"src/cache/tests.rs","rank":41,"score":72449.74060012537},{"content":"#[test]\n\nfn test_simplecache_valuecache_concurrent_get() {\n\n let c: Arc<SimpleCache<u64, u64>> = Arc::new(SimpleCache::new(10));\n\n\n\n for key in 0..10 as u64 {\n\n let value = Arc::new(key + 1000);\n\n c.insert(key, &value);\n\n }\n\n\n\n let t1c = Arc::clone(&c);\n\n let t1 = std::thread::spawn(move || {\n\n for key in 0..8 as u64 {\n\n t1c.get(&key).unwrap();\n\n }\n\n });\n\n let t2c = Arc::clone(&c);\n\n let t2 = std::thread::spawn(move || {\n\n for key in 2..10 as u64 {\n\n t2c.get(&key).unwrap();\n\n }\n\n });\n","file_path":"src/cache/tests.rs","rank":42,"score":72449.74060012537},{"content":"#[test]\n\nfn test_simpleslicedeserializer_simpledeserializer_read() {\n\n let mut v = SimpleSliceDeserializer::new(&*SAMPLE);\n\n\n\n let mut offs = 0;\n\n let size = 3;\n\n v.read(SAMPLE00.len()).unwrap();\n\n assert_eq!(SAMPLE00, v.data());\n\n offs += size;\n\n\n\n let size = 1;\n\n assert_eq!(v.read_u8().unwrap(), SAMPLE01);\n\n assert_eq!(&SAMPLE[offs..offs + size], v.data());\n\n offs += size;\n\n\n\n let size = 2;\n\n assert_eq!(v.read_u16().unwrap(), SAMPLE02);\n\n assert_eq!(&SAMPLE[offs..offs + size], v.data());\n\n offs += size;\n\n\n\n let size = 4;\n","file_path":"src/simple_serialization/tests.rs","rank":43,"score":72449.74060012537},{"content":"#[cfg(target_os = \"linux\")]\n\n#[test]\n\nfn test_lock_unlock_mem_core() {\n\n let mut vec = Vec::<u8>::with_capacity(16);\n\n vec.resize(16, 0);\n\n\n\n assert!(lock_mem_core(vec.as_ptr() as *const c_void, vec.len()));\n\n assert!(unlock_mem_core(vec.as_ptr() as *const c_void, vec.len()));\n\n}\n\n\n","file_path":"src/mem/tests.rs","rank":44,"score":72449.49144084717},{"content":"#[test]\n\nfn test_lock_supported_core() {\n\n assert!(lock_supported_core());\n\n}\n","file_path":"src/mem/impl_linux/tests.rs","rank":45,"score":70842.93094315293},{"content":"#[test]\n\nfn test_win32protectedvalue_get_secret() {\n\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\n\n let p = Win32ProtectedValue::new(&exp);\n\n\n\n let s = p.get_secret();\n\n assert_ne!(p.protected_data.value(), &exp);\n\n assert_eq!(s.value(), &exp);\n\n}\n","file_path":"src/mem/impl_win32/tests.rs","rank":46,"score":70842.93094315293},{"content":"#[test]\n\nfn test_win32protectedvalue_protected_size() {\n\n let block_size = CRYPTPROTECTMEMORY_BLOCK_SIZE as usize;\n\n for c in 0..8 {\n\n for i in (block_size * c)..(block_size * (c + 1)) {\n\n assert_eq!(Win32ProtectedValue::protected_size(i), block_size * (c + 1));\n\n }\n\n }\n\n}\n\n\n","file_path":"src/mem/impl_win32/tests.rs","rank":47,"score":70842.93094315293},{"content":"#[test]\n\nfn test_lock_supported_core() {\n\n assert!(!lock_supported_core());\n\n}\n","file_path":"src/mem/impl_default/tests.rs","rank":49,"score":70842.93094315293},{"content":"#[test]\n\nfn test_lock_supported_core() {\n\n assert!(lock_supported_core());\n\n}\n\n\n\n//=============================================================================\n\n// Win32ProtectedValue\n\n//-----------------------------------------------------------------------------\n","file_path":"src/mem/impl_win32/tests.rs","rank":50,"score":70842.93094315293},{"content":"#[test]\n\nfn test_sharedfilelocknamebuilder_get_lock_directory() {\n\n let f = DummySharedFileLockNameBuilder;\n\n\n\n let file = Path::new(\"name\");\n\n assert_eq!(f.get_lock_directory(&file), file.parent());\n\n\n\n let file = Path::new(\"/test/name\");\n\n assert_eq!(f.get_lock_directory(&file), file.parent());\n\n\n\n let file = Path::new(\"/\");\n\n assert_eq!(f.get_lock_directory(&file), None);\n\n}\n\n\n","file_path":"src/fs/shared/tests.rs","rank":51,"score":70842.93094315293},{"content":"#[test]\n\nfn test_simpleslicedeserializer_simpledeserializer_read_fail() {\n\n let s: [u8; 8] = [0, 3, 0, 0, 0, 0, 0, 0];\n\n\n\n let mut v = SimpleSliceDeserializer::new(&s[..2]);\n\n assert!(matches!(v.read(3), Err(ErrorKind::UnableToRead)));\n\n assert_eq!(v.offset, 0);\n\n assert_eq!(v.data_offset, 0);\n\n\n\n let mut v = SimpleSliceDeserializer::new(&s[..0]);\n\n assert!(matches!(v.read_u8(), Err(ErrorKind::UnableToRead)));\n\n assert_eq!(v.offset, 0);\n\n assert_eq!(v.data_offset, 0);\n\n assert!(matches!(v.read_i8(), Err(ErrorKind::UnableToRead)));\n\n assert_eq!(v.offset, 0);\n\n assert_eq!(v.data_offset, 0);\n\n\n\n let mut v = SimpleSliceDeserializer::new(&s[..1]);\n\n assert!(matches!(v.read_u16(), Err(ErrorKind::UnableToRead)));\n\n assert_eq!(v.offset, 0);\n\n assert_eq!(v.data_offset, 0);\n","file_path":"src/simple_serialization/tests.rs","rank":52,"score":70842.93094315293},{"content":"#[test]\n\nfn test_simplesliceserializer_simpledataserializer_write_fail() {\n\n let mut data: [u8; 2] = [0; 2];\n\n let mut v = SimpleSliceSerializer::new(&mut data);\n\n assert!(matches!(v.write(SAMPLE00), Err(ErrorKind::UnableToWrite)));\n\n\n\n let mut data: [u8; 0] = [];\n\n let mut v = SimpleSliceSerializer::new(&mut data);\n\n assert!(matches!(\n\n v.write_u8(SAMPLE01),\n\n Err(ErrorKind::UnableToWrite)\n\n ));\n\n assert!(matches!(\n\n v.write_i8(SAMPLE05),\n\n Err(ErrorKind::UnableToWrite)\n\n ));\n\n\n\n let mut data: [u8; 1] = [0];\n\n let mut v = SimpleSliceSerializer::new(&mut data);\n\n assert!(matches!(\n\n v.write_u16(SAMPLE02),\n","file_path":"src/simple_serialization/tests.rs","rank":53,"score":70842.93094315293},{"content":"#[test]\n\nfn test_lock_unlock_mem_core() {\n\n let mut v: Vec<u8> = Vec::with_capacity(16);\n\n v.resize(16, 0);\n\n assert!(lock_mem_core(v.as_ptr() as *const c_void, v.len()));\n\n assert!(unlock_mem_core(v.as_ptr() as *const c_void, v.len()));\n\n}\n\n\n","file_path":"src/mem/impl_linux/tests.rs","rank":54,"score":69328.48029130363},{"content":"#[test]\n\nfn test_lock_unlock_mem_core() {\n\n let mut v: Vec<u8> = Vec::with_capacity(16);\n\n v.resize(16, 0);\n\n assert!(lock_mem_core(v.as_ptr() as *const c_void, v.len()));\n\n assert!(unlock_mem_core(v.as_ptr() as *const c_void, v.len()));\n\n}\n\n\n","file_path":"src/mem/impl_win32/tests.rs","rank":55,"score":69328.48029130363},{"content":"#[test]\n\nfn test_sharedfilelocknamebuilder_create_lock_file_path() {\n\n let f = DummySharedFileLockNameBuilder;\n\n\n\n let file = Path::new(\"name\");\n\n assert_eq!(\n\n f.create_lock_file_path(&file).unwrap(),\n\n OsString::from(\"prefix.name.suffix\")\n\n );\n\n\n\n let file = Path::new(\"/test/name\");\n\n assert_eq!(\n\n f.create_lock_file_path(&file).unwrap(),\n\n OsString::from(\"/test/prefix.name.suffix\")\n\n );\n\n\n\n let file = Path::new(\"/name\");\n\n assert_eq!(\n\n f.create_lock_file_path(&file).unwrap(),\n\n OsString::from(\"/prefix.name.suffix\")\n\n );\n","file_path":"src/fs/shared/tests.rs","rank":56,"score":69328.48029130363},{"content":"#[test]\n\nfn test_lock_unlock_mem_core() {\n\n let mut v: Vec<u8> = Vec::with_capacity(16);\n\n v.resize(16, 0);\n\n assert!(!lock_mem_core(v.as_ptr() as *const c_void, v.len()));\n\n assert!(!unlock_mem_core(v.as_ptr() as *const c_void, v.len()));\n\n}\n\n\n","file_path":"src/mem/impl_default/tests.rs","rank":57,"score":69328.48029130363},{"content":"#[cfg(target_os = \"windows\")]\n\npub fn create_protected_value(value: &[u8]) -> Arc<dyn ProtectedValue> {\n\n Arc::new(impl_win32::Win32ProtectedValue::new(value))\n\n}\n","file_path":"src/mem/mod.rs","rank":58,"score":68841.24656441272},{"content":"fn translation() -> Result<()> {\n\n let mut buff: [u8; 0] = [];\n\n let mut serializer = SimpleSliceSerializer::new(&mut buff);\n\n serializer.write_u8(0)?;\n\n Ok(())\n\n}\n\n\n","file_path":"src/simple_serialization/tests.rs","rank":59,"score":66462.23515307916},{"content":"fn main() {\n\n build_windows();\n\n}\n","file_path":"build.rs","rank":60,"score":47355.10051263917},{"content":"//=============================================================================\n\n// SharedFileLockNameBuilder\n\n//-----------------------------------------------------------------------------\n\nstruct DummySharedFileLockNameBuilder;\n\n\n\nimpl SharedFileLockNameBuilder for DummySharedFileLockNameBuilder {\n\n fn create_lock_file_name(&self, file_name: &OsStr) -> OsString {\n\n let mut lock_file_name = OsString::from(\"prefix.\");\n\n lock_file_name.push(file_name);\n\n lock_file_name.push(\".suffix\");\n\n lock_file_name\n\n }\n\n}\n\n\n","file_path":"src/fs/shared/tests.rs","rank":61,"score":46866.509670422},{"content":"#[cfg(target_os = \"windows\")]\n\nfn build_windows() {\n\n windows::build! {\n\n Windows::Win32::System::Memory::{VirtualLock,VirtualUnlock},\n\n Windows::Win32::Security::{CryptProtectMemory,CryptUnprotectMemory,CRYPTPROTECTMEMORY_SAME_PROCESS,CRYPTPROTECTMEMORY_BLOCK_SIZE},\n\n };\n\n}\n\n\n","file_path":"build.rs","rank":62,"score":45977.88566165545},{"content":"#[cfg(not(target_os = \"windows\"))]\n\nfn build_windows() {}\n\n\n","file_path":"build.rs","rank":63,"score":45977.88566165545},{"content":"//=============================================================================\n\n// CacheEntry\n\n//-----------------------------------------------------------------------------\n\n/// This struct implements a SimpleCache entry. The value is shared by an\n\n/// [`Arc`] reference.\n\nstruct SimpleCacheEntry<V: Send + Sync> {\n\n value: Arc<V>,\n\n counter: u64,\n\n}\n\n\n\nimpl<V: Send + Sync> SimpleCacheEntry<V> {\n\n /// Creates a new [`SimpleCacheEntry`].\n\n ///\n\n /// Arguments:\n\n /// - `value`: The value;\n\n /// - `counter`: The current counter;\n\n ///\n\n pub fn new(value: &Arc<V>, counter: u64) -> Self {\n\n Self {\n\n value: Arc::clone(value),\n\n counter,\n\n }\n\n }\n\n\n\n /// Returns a new [`Arc`] that points to the value.\n","file_path":"src/cache/mod.rs","rank":64,"score":45546.70215923032},{"content":"#[inline]\n\npub fn get_timestamp() -> i64 {\n\n let now = chrono::Utc::now();\n\n nanoseconds_to_microseconds(now.timestamp_nanos())\n\n}\n","file_path":"src/time/mod.rs","rank":65,"score":38534.15920193519},{"content":"/// Determines if this platform supports memory locking or not.\n\n///\n\n/// Returns true if it is supported or false otherwise.\n\npub fn lock_supported() -> bool {\n\n lock_supported_core()\n\n}\n\n\n\n//=============================================================================\n\n// SecretBytes\n\n//-----------------------------------------------------------------------------\n\n/// This struct wraps a byte array that is guaranteed to have its contents\n\n/// shredded upon destruction.\n\n///\n\n/// It also allows the locking of the value in memory if required, preventing it\n\n/// from being moved into the disk.\n\n///\n\n/// This struct also implements a mechanism to set a logical length that differs\n\npub struct SecretBytes {\n\n value: Vec<u8>,\n\n locked: bool,\n\n len: usize,\n\n}\n\n\n","file_path":"src/mem/mod.rs","rank":66,"score":38534.15920193519},{"content":"#[inline]\n\npub fn lock_supported_core() -> bool {\n\n true\n\n}\n\n\n\n//=============================================================================\n\n// Win32ProtectedValue\n\n//-----------------------------------------------------------------------------\n\n/// This is the implementation of the [`ProtectedValue`] for Windows that uses\n\n/// `CryptProtectMemory()` and `CryptUnprotectMemory()` to protect the values\n\n/// against memory scans attacks.\n\npub struct Win32ProtectedValue {\n\n protected_data: SecretBytes,\n\n}\n\n\n\nimpl Win32ProtectedValue {\n\n /// Returns the size of the buffer required to store the protected value.\n\n ///\n\n /// Arguments:\n\n /// - `data_size`: The size of the value to be protected.\n\n ///\n","file_path":"src/mem/impl_win32/mod.rs","rank":67,"score":35969.363391401406},{"content":"#[inline]\n\npub fn lock_supported_core() -> bool {\n\n false\n\n}\n","file_path":"src/mem/impl_default/mod.rs","rank":68,"score":35969.363391401406},{"content":"#[inline]\n\npub fn lock_supported_core() -> bool {\n\n true\n\n}\n","file_path":"src/mem/impl_linux/mod.rs","rank":69,"score":35969.363391401406},{"content":"#[inline]\n\npub fn nanoseconds_to_microseconds(nanos: i64) -> i64 {\n\n nanos / 1000\n\n}\n\n\n\n/// Returns the current timestamp in microseconds in UNIX Time.\n","file_path":"src/time/mod.rs","rank":70,"score":34718.72596025624},{"content":"//=============================================================================\n\n// SimpleCacheEngine\n\n//-----------------------------------------------------------------------------\n\n/// This struct implements the SimpleCacheEngine. It is the core of the\n\n/// [`SimpleCache`] implementation.\n\n///\n\n/// When it reaches its maximum capacity it will drop the oldest unused entries.\n\n///\n\n/// This struct is not thread safe and must have its concurrency protected by\n\n/// an external [`RwLock`] or other synchronization primitive.\n\nstruct SimpleCacheEngine<K: Eq + Hash + Copy + Send + Sync, V: Send + Sync> {\n\n map: HashMap<K, SimpleCacheEntry<V>>,\n\n max_size: usize,\n\n counter: u64,\n\n}\n\n\n\nimpl<K: Eq + Hash + Copy + Send + Sync, V: Send + Sync> SimpleCacheEngine<K, V> {\n\n /// Creates a new `SimpleCacheEngine` with a given capacity.\n\n ///\n\n /// Arguments:\n\n /// - `max_size`: Maximum number of items in the cache;\n\n pub fn new(max_size: usize) -> Self {\n\n Self {\n\n map: HashMap::new(),\n\n max_size,\n\n counter: 0,\n\n }\n\n }\n\n\n\n /// Returns the next value of the internal counter.\n","file_path":"src/cache/mod.rs","rank":71,"score":34415.31830574942},{"content":"//=============================================================================\n\n// ValueCache\n\n//-----------------------------------------------------------------------------\n\n/// This trait is implemented by all value caches on this module. A value cache\n\n/// must be able to associate shared read-only values to a given key value.\n\n///\n\n/// It is up to the implementator of this trait to define how old values are\n\n/// prunned from the cache.\n\n///\n\n/// All methods of this trait are required to be thread safe.\n\npub trait ValueCache<K: Eq + Hash + Copy + Sync, V: Send + Sync>: Send {\n\n /// Gets the value from the cache if it exists.\n\n ///\n\n /// Arguments:\n\n /// - `key`: The key to be found;\n\n ///\n\n /// Returns:\n\n /// - `Some(v)`: The cached value. `v` is a new [`Arc`] that points to it.\n\n /// - `None`: IF the entry is not in the cache;\n\n fn get(&self, key: &K) -> Option<Arc<V>>;\n\n\n\n /// Inserts the value into the cache. Reinserting a new value with the\n\n /// same key will replace the existing value.\n\n ///\n\n /// Arguments:\n\n /// - `key`: The key;\n\n /// - `value`: A reference to an [`Arc`] that points to the value;\n\n fn insert(&self, key: K, value: &Arc<V>);\n\n\n\n /// Removes all entries from the cache.\n\n fn clear(&self);\n\n\n\n /// Returns the number of entries in the cache.\n\n fn len(&self) -> usize;\n\n\n\n /// Returns true if the cache is empty or false otherwise.\n\n fn is_empty(&self) -> bool;\n\n}\n\n\n","file_path":"src/cache/mod.rs","rank":72,"score":33711.53099864077},{"content":"//=============================================================================\n\n// CacheEngine\n\n//-----------------------------------------------------------------------------\n\n/// This trait is implemented by all value caches on this module. A value cache\n\n/// must be able to associate shared read-only values to a given key value.\n\n///\n\n/// It is up to the implementator of this trait to define how old values are\n\n/// prunned from the cache.\n\n///\n\n/// All methods of this trait are required to be thread safe.\n\npub trait CacheEngine<K: Eq + Hash + Copy + Sync, V: Send + Sync>: Sync {\n\n /// Gets the value from the cache if it exists.\n\n ///\n\n /// Arguments:\n\n /// - `key`: The key to be found;\n\n ///\n\n /// Returns:\n\n /// - `Some(v)`: The cached value. `v` is a new [`Arc`] that points to it.\n\n /// - `None`: IF the entry is not in the cache;\n\n fn get(&mut self, key: &K) -> Option<Arc<V>>;\n\n\n\n /// Inserts the value into the cache.\n\n ///\n\n /// Arguments:\n\n /// - `key`: The key;\n\n /// - `value`: A reference to an [`Arc`] that points to the value;\n\n fn insert(&mut self, key: K, value: &Arc<V>);\n\n\n\n /// Removes all entries from the cache.\n\n fn clear(&mut self);\n\n\n\n /// Returns the number of entries in the cache.\n\n fn len(&self) -> usize;\n\n\n\n /// Returns true if the cache is empty or false otherwise.\n\n fn is_empty(&self) -> bool;\n\n}\n\n\n","file_path":"src/cache/mod.rs","rank":73,"score":33711.53099864077},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n */\n\nuse super::*;\n\n\n\n#[test]\n","file_path":"src/time/tests.rs","rank":74,"score":29093.122205208856},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n */\n\nuse super::*;\n\n\n\n//=============================================================================\n\n// CacheEntry\n\n//-----------------------------------------------------------------------------\n\n#[test]\n","file_path":"src/cache/tests.rs","rank":76,"score":29091.665238564718},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n */\n\nuse super::*;\n\n\n\n#[cfg(target_os = \"linux\")]\n\n#[test]\n","file_path":"src/mem/tests.rs","rank":77,"score":29090.25209472095},{"content":"/*\n\n * BSD 3-Clause License\n\n *\n\n * Copyright (c) 2019-2020, InterlockLedger Network\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright notice, this\n\n * list of conditions and the following disclaimer.\n\n *\n\n * * Redistributions in binary form must reproduce the above copyright notice,\n\n * this list of conditions and the following disclaimer in the documentation\n\n * and/or other materials provided with the distribution.\n\n *\n\n * * Neither the name of the copyright holder nor the names of its\n\n * contributors may be used to endorse or promote products derived from\n\n * this software without specific prior written permission.\n\n *\n","file_path":"src/cache/tests.rs","rank":78,"score":29081.108822865375},{"content":"/*\n\n * BSD 3-Clause License\n\n *\n\n * Copyright (c) 2019-2020, InterlockLedger Network\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright notice, this\n\n * list of conditions and the following disclaimer.\n\n *\n\n * * Redistributions in binary form must reproduce the above copyright notice,\n\n * this list of conditions and the following disclaimer in the documentation\n\n * and/or other materials provided with the distribution.\n\n *\n\n * * Neither the name of the copyright holder nor the names of its\n\n * contributors may be used to endorse or promote products derived from\n\n * this software without specific prior written permission.\n\n *\n","file_path":"src/mem/tests.rs","rank":79,"score":29081.108822865375},{"content":"/*\n\n * BSD 3-Clause License\n\n *\n\n * Copyright (c) 2019-2020, InterlockLedger Network\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright notice, this\n\n * list of conditions and the following disclaimer.\n\n *\n\n * * Redistributions in binary form must reproduce the above copyright notice,\n\n * this list of conditions and the following disclaimer in the documentation\n\n * and/or other materials provided with the distribution.\n\n *\n\n * * Neither the name of the copyright holder nor the names of its\n\n * contributors may be used to endorse or promote products derived from\n\n * this software without specific prior written permission.\n\n *\n","file_path":"src/time/tests.rs","rank":80,"score":29081.108822865375},{"content":" t1.join().unwrap();\n\n t2.join().unwrap();\n\n\n\n // Test the counters\n\n for key in 0..10 as u64 {\n\n let counter = c.engine.read().unwrap().map.get(&key).unwrap().counter;\n\n print!(\"{:?} \", counter);\n\n assert!(counter >= 10);\n\n }\n\n}\n\n\n","file_path":"src/cache/tests.rs","rank":82,"score":28998.177276340324},{"content":" if SecretBytes::lock_supported() {\n\n assert!(s.locked());\n\n } else {\n\n assert!(!s.locked());\n\n }\n\n\n\n // Unlocked\n\n let mut src = SecretBytes::with_value(&exp, false);\n\n let s = src.clone();\n\n assert_eq!(s.len(), s.len());\n\n assert_eq!(s.buffer_len(), s.len());\n\n assert_eq!(s.value(), &exp);\n\n assert!(!s.locked());\n\n\n\n // Unlocked alt len\n\n src.set_len(6);\n\n let s = src.clone();\n\n assert_eq!(s.len(), 6);\n\n assert_eq!(s.buffer_len(), exp.len());\n\n assert_eq!(s.value(), &exp[..6]);\n\n assert!(!s.locked());\n\n}\n\n\n\n//=============================================================================\n\n// ByteMaskGenerator\n\n//-----------------------------------------------------------------------------\n","file_path":"src/mem/tests.rs","rank":83,"score":28997.39651761819},{"content":" let old_counter = e.map.get(&key).unwrap().counter;\n\n let v = e.get(&key).unwrap();\n\n assert_eq!(*v, key + 100);\n\n let new_counter = e.map.get(&key).unwrap().counter;\n\n assert!(old_counter < new_counter);\n\n }\n\n\n\n let key = 10 as u64;\n\n assert!(e.get(&key).is_none());\n\n}\n\n\n","file_path":"src/cache/tests.rs","rank":84,"score":28995.50817209922},{"content":" e.insert(key, &value);\n\n assert_eq!(e.len(), 10);\n\n let entry = e.map.get(&key).unwrap();\n\n assert_eq!(entry.counter, curr_counter);\n\n assert_eq!(*entry.value, *value);\n\n }\n\n\n\n // Adding 10 new entries\n\n for key in 10..20 as u64 {\n\n assert_eq!(e.len(), 10);\n\n let value = Arc::new(key + 1000);\n\n let curr_counter = e.counter;\n\n e.insert(key, &value);\n\n assert_eq!(e.len(), 10);\n\n let entry = e.map.get(&key).unwrap();\n\n assert_eq!(entry.counter, curr_counter);\n\n assert_eq!(*entry.value, *value);\n\n\n\n // The older key will always be the one with the smallest key\n\n let removed = key - 10;\n\n assert!(e.map.get(&removed).is_none());\n\n }\n\n}\n\n\n","file_path":"src/cache/tests.rs","rank":85,"score":28995.50817209922},{"content":"#[allow(clippy::not_unsafe_ptr_arg_deref)]\n\n#[inline]\n\npub fn unlock_mem_core(ptr: *const c_void, size: usize) -> bool {\n\n unsafe { matches!(munlock(ptr, size), 0) }\n\n}\n\n\n","file_path":"src/mem/impl_linux/mod.rs","rank":86,"score":28532.872796558266},{"content":"#[inline]\n\npub fn lock_mem_core(ptr: *const c_void, size: usize) -> bool {\n\n unsafe { VirtualLock(ptr as *mut c_void, size).as_bool() }\n\n}\n\n\n","file_path":"src/mem/impl_win32/mod.rs","rank":87,"score":28532.872796558266},{"content":"#[inline]\n\npub fn unlock_mem_core(ptr: *const c_void, size: usize) -> bool {\n\n unsafe { VirtualUnlock(ptr as *mut c_void, size).as_bool() }\n\n}\n\n\n","file_path":"src/mem/impl_win32/mod.rs","rank":88,"score":28532.872796558266},{"content":"#[allow(clippy::not_unsafe_ptr_arg_deref)]\n\n#[inline]\n\npub fn lock_mem_core(ptr: *const c_void, size: usize) -> bool {\n\n unsafe { matches!(mlock(ptr, size), 0) }\n\n}\n\n\n","file_path":"src/mem/impl_linux/mod.rs","rank":89,"score":28532.872796558266},{"content":"#[inline]\n\npub fn unlock_mem_core(ptr: *const c_void, size: usize) -> bool {\n\n false\n\n}\n\n\n","file_path":"src/mem/impl_default/mod.rs","rank":90,"score":28532.872796558266},{"content":"#[inline]\n\npub fn lock_mem_core(ptr: *const c_void, size: usize) -> bool {\n\n false\n\n}\n\n\n","file_path":"src/mem/impl_default/mod.rs","rank":91,"score":28532.872796558266},{"content":"/// Try to lock the memory segment into memory, preventing it from\n\n/// being moved to the disk. All calls to this function must be\n\n/// followed by a call to [`unlock_mem()`].\n\n///\n\n/// Use this method with extreme care because it interferes with tne\n\n/// OS ability to manage virtual memory.\n\n///\n\n/// Arguments:\n\n/// - `ptr`: The pointer to the memory segment;\n\n/// - `size`: The size of the ptr in units;\n\n///\n\n/// Retunrs true on success or false otherwise.\n\npub fn lock_mem<T: Sized>(ptr: *const T, size: usize) -> bool {\n\n if size > 0 {\n\n lock_mem_core(ptr as *const c_void, size * size_of::<T>())\n\n } else {\n\n false\n\n }\n\n}\n\n\n","file_path":"src/mem/mod.rs","rank":92,"score":28109.679748089016},{"content":"/// Unlocks the memory segment. It reverts the effects of [`lock_mem()`].\n\n///\n\n/// Arguments:\n\n/// - `ptr`: The pointer to the memory segment;\n\n/// - `size`: The size of the ptr in units;\n\n///\n\n/// Retunrs true on success or false otherwise.\n\npub fn unlock_mem<T: Sized>(ptr: *const T, size: usize) -> bool {\n\n if size > 0 {\n\n unlock_mem_core(ptr as *const c_void, size * size_of::<T>())\n\n } else {\n\n false\n\n }\n\n}\n\n\n","file_path":"src/mem/mod.rs","rank":93,"score":28102.775910877022},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n */\n\nuse super::*;\n\n\n\n//=============================================================================\n\n// Test error remaping\n\n//-----------------------------------------------------------------------------\n\n#[derive(Debug)]\n","file_path":"src/simple_serialization/tests.rs","rank":94,"score":27866.80674614714},{"content":"/*\n\n * BSD 3-Clause License\n\n *\n\n * Copyright (c) 2019-2020, InterlockLedger Network\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright notice, this\n\n * list of conditions and the following disclaimer.\n\n *\n\n * * Redistributions in binary form must reproduce the above copyright notice,\n\n * this list of conditions and the following disclaimer in the documentation\n\n * and/or other materials provided with the distribution.\n\n *\n\n * * Neither the name of the copyright holder nor the names of its\n\n * contributors may be used to endorse or promote products derived from\n\n * this software without specific prior written permission.\n\n *\n","file_path":"src/fs/shared/tests.rs","rank":95,"score":27855.868771941066},{"content":"/*\n\n * BSD 3-Clause License\n\n *\n\n * Copyright (c) 2019-2020, InterlockLedger Network\n\n * All rights reserved.\n\n *\n\n * Redistribution and use in source and binary forms, with or without\n\n * modification, are permitted provided that the following conditions are met:\n\n *\n\n * * Redistributions of source code must retain the above copyright notice, this\n\n * list of conditions and the following disclaimer.\n\n *\n\n * * Redistributions in binary form must reproduce the above copyright notice,\n\n * this list of conditions and the following disclaimer in the documentation\n\n * and/or other materials provided with the distribution.\n\n *\n\n * * Neither the name of the copyright holder nor the names of its\n\n * contributors may be used to endorse or promote products derived from\n\n * this software without specific prior written permission.\n\n *\n","file_path":"src/simple_serialization/tests.rs","rank":96,"score":27855.868771941066},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n */\n\nuse super::*;\n\nuse il2_test_utils::testdir::TestDirUtils;\n\nuse std::ffi::{OsStr, OsString};\n\nuse std::fs::{File, OpenOptions};\n\nuse std::path::Path;\n\n\n\n//=============================================================================\n\n// SharedFileLockNameBuilder\n\n//-----------------------------------------------------------------------------\n","file_path":"src/fs/shared/tests.rs","rank":97,"score":27853.57658273543},{"content":" ));\n\n\n\n let mut data: [u8; 7] = [0; 7];\n\n let mut v = SimpleSliceSerializer::new(&mut data);\n\n assert!(matches!(\n\n v.write_u64(SAMPLE04),\n\n Err(ErrorKind::UnableToWrite)\n\n ));\n\n assert!(matches!(\n\n v.write_i64(SAMPLE08),\n\n Err(ErrorKind::UnableToWrite)\n\n ));\n\n assert!(matches!(\n\n v.write_f64(SAMPLE10),\n\n Err(ErrorKind::UnableToWrite)\n\n ));\n\n\n\n let mut data: [u8; 4] = [0; 4];\n\n let mut v = SimpleSliceSerializer::new(&mut data);\n\n assert!(matches!(\n\n v.write_byte_array(SAMPLE11),\n\n Err(ErrorKind::UnableToWrite)\n\n ));\n\n}\n\n\n\n//=============================================================================\n\n// SimpleSliceDeserializer\n\n//-----------------------------------------------------------------------------\n","file_path":"src/simple_serialization/tests.rs","rank":98,"score":27780.49655505263},{"content":" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n */\n\nuse super::*;\n\n\n\n#[test]\n","file_path":"src/mem/impl_win32/tests.rs","rank":99,"score":97.6140331096365}],"string":"[\n {\n \"content\": \"#[test]\\n\\nfn test_defaultsharedfilelocknamebuilder_namebuilder_create_lock_file_name() {\\n\\n let b = DefaultSharedFileLockNameBuilder;\\n\\n\\n\\n let name = OsStr::new(\\\"file\\\");\\n\\n assert_eq!(b.create_lock_file_name(name), OsStr::new(\\\".file.lock~\\\"));\\n\\n\\n\\n let name = OsStr::new(\\\"z\\\");\\n\\n assert_eq!(b.create_lock_file_name(name), OsStr::new(\\\".z.lock~\\\"));\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// SharedFileReadLockGuard\\n\\n//-----------------------------------------------------------------------------\\n\",\n \"file_path\": \"src/fs/shared/tests.rs\",\n \"rank\": 3,\n \"score\": 91801.94253521915\n },\n {\n \"content\": \"#[test]\\n\\nfn test_defaultprotectedvalue() {\\n\\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\\n\\n\\n\\n let p = DefaultProtectedValue::new(&exp);\\n\\n assert_ne!(p.secret.value(), &exp);\\n\\n assert_ne!(p.seed, 0);\\n\\n\\n\\n let v = p.get_secret();\\n\\n assert_eq!(v.value(), &exp);\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// ProtectedValue\\n\\n//-----------------------------------------------------------------------------\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 4,\n \"score\": 77921.59515923585\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplecache_impl() {\\n\\n let c: SimpleCache<u64, u64> = SimpleCache::new(10);\\n\\n {\\n\\n let r = c.engine.read().unwrap();\\n\\n assert_eq!(r.len(), 0);\\n\\n }\\n\\n {\\n\\n let mut w = c.engine.write().unwrap();\\n\\n w.clear();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 5,\n \"score\": 75977.97706417715\n },\n {\n \"content\": \"#[test]\\n\\nfn test_nanoseconds_to_microseconds() {\\n\\n assert_eq!(nanoseconds_to_microseconds(12345), 12);\\n\\n assert_eq!(nanoseconds_to_microseconds(2345), 2);\\n\\n assert_eq!(nanoseconds_to_microseconds(345), 0);\\n\\n}\\n\",\n \"file_path\": \"src/time/tests.rs\",\n \"rank\": 7,\n \"score\": 75977.97706417715\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplecacheentry_impl() {\\n\\n let v = Arc::new(10 as u64);\\n\\n\\n\\n let e = SimpleCacheEntry::new(&v, 10);\\n\\n assert_eq!(e.counter(), 10);\\n\\n\\n\\n let vr = e.get_value();\\n\\n assert_eq!(v, vr);\\n\\n assert!(!std::ptr::eq(&v, &vr));\\n\\n\\n\\n let mut e = SimpleCacheEntry::new(&v, 10);\\n\\n assert_eq!(e.counter(), 10);\\n\\n e.set_counter(1234);\\n\\n assert_eq!(e.counter(), 1234);\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// SimpleCacheEngine\\n\\n//-----------------------------------------------------------------------------\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 8,\n \"score\": 75977.97706417715\n },\n {\n \"content\": \"#[test]\\n\\nfn test_bytemaskgenerator_new() {\\n\\n let g = ByteMaskGenerator::new(1234);\\n\\n assert_eq!(g.state, 1234)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 9,\n \"score\": 75977.97706417715\n },\n {\n \"content\": \"#[test]\\n\\nfn test_bytemaskgenerator_next() {\\n\\n // Reference\\n\\n let mut g = ByteMaskGenerator::new(1234);\\n\\n assert_eq!(g.next(), 0x5b);\\n\\n assert_eq!(g.next(), 0x18);\\n\\n assert_eq!(g.next(), 0x2a);\\n\\n\\n\\n // Test stability\\n\\n let seed: u64 = random();\\n\\n let mut g1 = ByteMaskGenerator::new(seed);\\n\\n let mut g2 = ByteMaskGenerator::new(seed);\\n\\n for _ in 0..1000 {\\n\\n assert_eq!(g1.next(), g2.next());\\n\\n }\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// DefaultProtectedValue\\n\\n//-----------------------------------------------------------------------------\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 10,\n \"score\": 75977.97706417715\n },\n {\n \"content\": \"#[cfg(target_os = \\\"linux\\\")]\\n\\n#[test]\\n\\nfn test_lock_supported() {\\n\\n assert!(lock_supported());\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// SecretBytes\\n\\n//-----------------------------------------------------------------------------\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 11,\n \"score\": 75977.72790489894\n },\n {\n \"content\": \"#[test]\\n\\nfn test_defaultprotectedvalue_apply_mask() {\\n\\n let zero: [u8; 16] = [0; 16];\\n\\n let seed = 1234;\\n\\n let mut apply: [u8; 16] = [0; 16];\\n\\n\\n\\n DefaultProtectedValue::apply_mask(seed, &mut apply);\\n\\n assert_ne!(&zero, &apply);\\n\\n DefaultProtectedValue::apply_mask(seed, &mut apply);\\n\\n assert_eq!(&zero, &apply);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 12,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplesliceserializer_impl() {\\n\\n let mut data: [u8; 4] = [0; 4];\\n\\n let mut v = SimpleSliceSerializer::new(&mut data);\\n\\n\\n\\n for i in 0..4 {\\n\\n v.offset = i;\\n\\n assert_eq!(v.offset(), i);\\n\\n assert_eq!(v.available(), 4 - i);\\n\\n assert_eq!(v.offset(), i);\\n\\n for r in 0..v.available() {\\n\\n v.can_write(r).unwrap();\\n\\n }\\n\\n assert!(matches!(\\n\\n v.can_write(v.available() + 1),\\n\\n Err(ErrorKind::UnableToWrite)\\n\\n ));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/simple_serialization/tests.rs\",\n \"rank\": 13,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_secret_bytes_with_value() {\\n\\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\\n\\n\\n\\n // Locked\\n\\n let s = SecretBytes::with_value(&exp, true);\\n\\n assert_eq!(s.len(), s.len());\\n\\n assert_eq!(s.buffer_len(), s.len());\\n\\n assert_eq!(s.value(), &exp);\\n\\n if SecretBytes::lock_supported() {\\n\\n assert!(s.locked());\\n\\n } else {\\n\\n assert!(!s.locked());\\n\\n }\\n\\n\\n\\n // Unlocked\\n\\n let s = SecretBytes::with_value(&exp, false);\\n\\n assert_eq!(s.len(), s.len());\\n\\n assert_eq!(s.buffer_len(), s.len());\\n\\n assert_eq!(s.value(), &exp);\\n\\n assert!(!s.locked());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 14,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_sharedfilewritelockguard_impl() {\\n\\n let test_dir = TestDirUtils::new(\\\"test_sharedfilewritelockguard_impl\\\").unwrap();\\n\\n let lock_file = test_dir.create_test_file(\\\"target.lock\\\", b\\\"1\\\").unwrap();\\n\\n let target_file = test_dir.create_test_file(\\\"target\\\", b\\\"2\\\").unwrap();\\n\\n\\n\\n let mut lock = fd_lock::RwLock::new(File::open(&lock_file).unwrap());\\n\\n let mut lock2 = fd_lock::RwLock::new(File::open(&lock_file).unwrap());\\n\\n let mut target = OpenOptions::new()\\n\\n .read(true)\\n\\n .write(true)\\n\\n .open(&target_file)\\n\\n .unwrap();\\n\\n {\\n\\n let mut rwlock = SharedFileWriteLockGuard {\\n\\n file: &mut target,\\n\\n _lock: lock.write().unwrap(),\\n\\n };\\n\\n // Cannot read nor write\\n\\n assert!(lock2.try_write().is_err());\\n\\n drop(lock2.try_read().is_err());\\n\",\n \"file_path\": \"src/fs/shared/tests.rs\",\n \"rank\": 15,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_secret_bytes_clone() {\\n\\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\\n\\n // Locked\\n\\n let mut src = SecretBytes::with_value(&exp, true);\\n\\n let s = src.clone();\\n\\n assert_eq!(s.len(), s.len());\\n\\n assert_eq!(s.buffer_len(), s.len());\\n\\n assert_eq!(s.value(), &exp);\\n\\n if SecretBytes::lock_supported() {\\n\\n assert!(s.locked());\\n\\n } else {\\n\\n assert!(!s.locked());\\n\\n }\\n\\n\\n\\n // Locked alt len\\n\\n src.set_len(6);\\n\\n let s = src.clone();\\n\\n assert_eq!(s.len(), 6);\\n\\n assert_eq!(s.buffer_len(), exp.len());\\n\\n assert_eq!(s.value(), &exp[..6]);\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 16,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_shared_directory() {\\n\\n let test_dir = TestDirUtils::new(\\\"test_shared_directory\\\").unwrap();\\n\\n test_dir.reset().unwrap();\\n\\n\\n\\n let mut shared1 = SharedDirectory::new(test_dir.test_dir()).unwrap();\\n\\n\\n\\n // Ensure that the lock file exists\\n\\n let lock_file = test_dir.get_test_file_path(SharedDirectory::DEFAULT_LOCK_FILE_NAME);\\n\\n let lock_file_path = Path::new(&lock_file);\\n\\n assert!(lock_file_path.is_file());\\n\\n\\n\\n let mut shared2 = SharedDirectory::new(test_dir.test_dir()).unwrap();\\n\\n\\n\\n // Test write lock from 1 and read from 2\\n\\n let lock1 = shared1.write().unwrap();\\n\\n assert!(shared2.try_read().is_err());\\n\\n drop(lock1);\\n\\n\\n\\n // Test read from 2 and write from 1\\n\\n let lock2 = shared2.read().unwrap();\\n\\n assert!(shared1.try_write().is_err());\\n\\n drop(lock2);\\n\\n\\n\\n // Write again fom 1\\n\\n let lock1 = shared1.write().unwrap();\\n\\n drop(lock1);\\n\\n}\\n\",\n \"file_path\": \"src/fs/shared/tests.rs\",\n \"rank\": 17,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_secret_bytes_new() {\\n\\n // Locked\\n\\n let s = SecretBytes::new(16, true);\\n\\n let exp: [u8; 16] = [0; 16];\\n\\n assert_eq!(s.len(), s.len());\\n\\n assert_eq!(s.buffer_len(), s.len());\\n\\n assert_eq!(s.value(), &exp);\\n\\n if SecretBytes::lock_supported() {\\n\\n assert!(s.locked());\\n\\n } else {\\n\\n assert!(!s.locked());\\n\\n }\\n\\n\\n\\n // Unlocked\\n\\n let s = SecretBytes::new(16, false);\\n\\n let exp: [u8; 16] = [0; 16];\\n\\n assert_eq!(s.len(), s.len());\\n\\n assert_eq!(s.buffer_len(), s.len());\\n\\n assert_eq!(s.value(), &exp);\\n\\n assert!(!s.locked());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 18,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_defaultsharedfilelocknamebuilder_impl() {\\n\\n assert_eq!(DefaultSharedFileLockNameBuilder::LOCK_FILE_PREFIX, \\\".\\\");\\n\\n assert_eq!(DefaultSharedFileLockNameBuilder::LOCK_FILE_SUFFIX, \\\".lock~\\\");\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/fs/shared/tests.rs\",\n \"rank\": 19,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_sharedfile_impl() {\\n\\n let test_dir = TestDirUtils::new(\\\"test_sharedfile_impl\\\").unwrap();\\n\\n\\n\\n // This test ends up testing all constructors because\\n\\n // new() calls with_options(),\\n\\n // with_options() calls with_option_builder() and\\n\\n // with_option_builder() calls with_option_lock_file().\\n\\n //\\n\\n // Furthermore, it also tests read(), try_read(), write() and try_write() as\\n\\n // well in a concurrent scenario with at least to SharedFile instances\\n\\n // pointing to the same file.\\n\\n let dummy_content: &'static str = \\\"123456\\\";\\n\\n let test_file = test_dir.get_test_file_path(\\\"protected\\\");\\n\\n let test_file_path = Path::new(&test_file);\\n\\n let lock_file_builder = DefaultSharedFileLockNameBuilder;\\n\\n let test_file_lock = lock_file_builder\\n\\n .create_lock_file_path(test_file_path)\\n\\n .unwrap();\\n\\n let test_file_lock_path = Path::new(&test_file_lock);\\n\\n\\n\",\n \"file_path\": \"src/fs/shared/tests.rs\",\n \"rank\": 20,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplecacheengine_simplecacheengine_insert() {\\n\\n let mut e: SimpleCacheEngine<u64, u64> = SimpleCacheEngine::new(10);\\n\\n\\n\\n // Adding 10 entries\\n\\n for key in 0..10 as u64 {\\n\\n assert_eq!(e.len(), key as usize);\\n\\n let value = Arc::new(key + 100);\\n\\n let curr_counter = e.counter;\\n\\n e.insert(key, &value);\\n\\n assert_eq!(e.len(), (key + 1) as usize);\\n\\n let entry = e.map.get(&key).unwrap();\\n\\n assert_eq!(entry.counter, curr_counter);\\n\\n assert_eq!(*entry.value, *value);\\n\\n }\\n\\n\\n\\n // Replacing entries\\n\\n for key in 0..10 as u64 {\\n\\n assert_eq!(e.len(), 10);\\n\\n let value = Arc::new(key + 1000);\\n\\n let curr_counter = e.counter;\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 21,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simpleslicedeserializer_impl() {\\n\\n let data: [u8; 4] = [0; 4];\\n\\n let mut v = SimpleSliceDeserializer::new(&data);\\n\\n\\n\\n for i in 0..4 {\\n\\n v.offset = i;\\n\\n assert_eq!(v.offset(), i);\\n\\n assert_eq!(v.avaliable(), 4 - i);\\n\\n for r in 0..v.avaliable() {\\n\\n v.can_read(r).unwrap();\\n\\n }\\n\\n assert!(matches!(\\n\\n v.can_read(v.avaliable() + 1),\\n\\n Err(ErrorKind::UnableToRead)\\n\\n ));\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/simple_serialization/tests.rs\",\n \"rank\": 22,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_error_conversion() {\\n\\n match translation() {\\n\\n Err(MyErrorkind::MyError) => (),\\n\\n Ok(()) => panic!(\\\"Error expected!\\\"),\\n\\n }\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// Samples\\n\\n//-----------------------------------------------------------------------------\\n\\nconst SAMPLE: &'static [u8; 50] = &[\\n\\n 0x36, 0x57, 0x2c, 0x7d, 0xe4, 0x48, 0xb2, 0x70, 0xc4, 0x87, 0x47, 0x46, 0xab, 0x46, 0x67, 0x5f,\\n\\n 0x43, 0xea, 0xee, 0xf6, 0xe5, 0x5a, 0xf7, 0x0e, 0x57, 0xb5, 0x60, 0xa6, 0x8f, 0x81, 0x66, 0x42,\\n\\n 0x11, 0x40, 0x49, 0x0f, 0xdb, 0x40, 0x09, 0x21, 0xFB, 0x54, 0x44, 0x2D, 0x18, 0x00, 0x03, 0x19,\\n\\n 0x26, 0x39,\\n\\n];\\n\\n\\n\\nconst SAMPLE00: &'static [u8; 3] = &[0x36, 0x57, 0x2c];\\n\\nconst SAMPLE01: u8 = 0x7d;\\n\\nconst SAMPLE02: u16 = 0xe448;\\n\",\n \"file_path\": \"src/simple_serialization/tests.rs\",\n \"rank\": 23,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simpledataserializer_vec() {\\n\\n let mut v = Vec::<u8>::new();\\n\\n\\n\\n v.write(SAMPLE00).unwrap();\\n\\n v.write_u8(SAMPLE01).unwrap();\\n\\n v.write_u16(SAMPLE02).unwrap();\\n\\n v.write_u32(SAMPLE03).unwrap();\\n\\n v.write_u64(SAMPLE04).unwrap();\\n\\n v.write_i8(SAMPLE05).unwrap();\\n\\n v.write_i16(SAMPLE06).unwrap();\\n\\n v.write_i32(SAMPLE07).unwrap();\\n\\n v.write_i64(SAMPLE08).unwrap();\\n\\n v.write_f32(SAMPLE09).unwrap();\\n\\n v.write_f64(SAMPLE10).unwrap();\\n\\n v.write_byte_array(SAMPLE11).unwrap();\\n\\n assert_eq!(v.as_slice(), SAMPLE);\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// SimpleSliceSerializer\\n\\n//-----------------------------------------------------------------------------\\n\",\n \"file_path\": \"src/simple_serialization/tests.rs\",\n \"rank\": 24,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplecacheengine_impl_new() {\\n\\n let e: SimpleCacheEngine<u64, u64> = SimpleCacheEngine::new(10);\\n\\n assert_eq!(e.map.len(), 0);\\n\\n assert_eq!(e.max_size, 10);\\n\\n assert_eq!(e.counter, 0);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 25,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_sharedfilereadlockguard_impl() {\\n\\n let test_dir = TestDirUtils::new(\\\"test_sharedfilereadlockguard_impl\\\").unwrap();\\n\\n let lock_file = test_dir.create_test_file(\\\"target.lock\\\", b\\\"1\\\").unwrap();\\n\\n let target_file = test_dir.create_test_file(\\\"target\\\", b\\\"2\\\").unwrap();\\n\\n\\n\\n let lock = fd_lock::RwLock::new(File::open(&lock_file).unwrap());\\n\\n let mut lock2 = fd_lock::RwLock::new(File::open(&lock_file).unwrap());\\n\\n let mut target = OpenOptions::new()\\n\\n .read(true)\\n\\n .write(true)\\n\\n .open(&target_file)\\n\\n .unwrap();\\n\\n {\\n\\n let mut rlock = SharedFileReadLockGuard {\\n\\n file: &mut target,\\n\\n _lock: lock.read().unwrap(),\\n\\n };\\n\\n // Cannot write\\n\\n assert!(lock2.try_write().is_err());\\n\\n // But can read\\n\",\n \"file_path\": \"src/fs/shared/tests.rs\",\n \"rank\": 26,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_secret_bytes_len() {\\n\\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\\n\\n let mut s = SecretBytes::with_value(&exp, false);\\n\\n\\n\\n assert_eq!(s.len(), exp.len());\\n\\n assert_eq!(s.buffer_len(), exp.len());\\n\\n assert_eq!(s.value(), &exp);\\n\\n assert_eq!(s.mut_value(), &exp);\\n\\n assert_eq!(s.buffer(), &exp);\\n\\n assert_eq!(s.mut_buffer(), &exp);\\n\\n assert_eq!(s.value().as_ptr(), s.buffer().as_ptr());\\n\\n\\n\\n s.set_len(4);\\n\\n assert_eq!(s.len(), 4);\\n\\n assert_eq!(s.buffer_len(), exp.len());\\n\\n assert_eq!(s.value(), &exp[..4]);\\n\\n assert_eq!(s.mut_value(), &exp[..4]);\\n\\n assert_eq!(s.mut_buffer(), &exp);\\n\\n assert_eq!(s.value().as_ptr(), s.buffer().as_ptr());\\n\\n\\n\\n s.set_len(9);\\n\\n assert_eq!(s.len(), exp.len());\\n\\n assert_eq!(s.buffer_len(), exp.len());\\n\\n assert_eq!(s.value(), &exp);\\n\\n assert_eq!(s.mut_value(), &exp);\\n\\n assert_eq!(s.mut_buffer(), &exp);\\n\\n assert_eq!(s.value().as_ptr(), s.buffer().as_ptr());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 27,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_create_protected_value() {\\n\\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\\n\\n let x = create_protected_value(&exp);\\n\\n let y = x.clone();\\n\\n\\n\\n let s1 = x.get_secret();\\n\\n let s2 = y.get_secret();\\n\\n assert_eq!(s1.value(), &exp);\\n\\n assert_eq!(s1.value(), s2.value());\\n\\n}\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 28,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplecacheengine_simplecacheengine_get() {\\n\\n let mut e: SimpleCacheEngine<u64, u64> = SimpleCacheEngine::new(10);\\n\\n\\n\\n for key in 0..10 as u64 {\\n\\n let value = Arc::new(key + 100);\\n\\n let counter = e.next_counter();\\n\\n e.map.insert(key, SimpleCacheEntry::new(&value, counter));\\n\\n }\\n\\n\\n\\n // Test the recovery and the counter update at each\\n\\n for key in 0..10 as u64 {\\n\\n let old_counter = e.map.get(&key).unwrap().counter;\\n\\n let v = e.get(&key).unwrap();\\n\\n assert_eq!(*v, key + 100);\\n\\n let new_counter = e.map.get(&key).unwrap().counter;\\n\\n assert!(old_counter < new_counter);\\n\\n }\\n\\n\\n\\n // Ensure that the counter is always increased\\n\\n for key in 0..10 as u64 {\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 29,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplecacheengine_simplecacheengine_clear() {\\n\\n let mut e: SimpleCacheEngine<u64, u64> = SimpleCacheEngine::new(10);\\n\\n\\n\\n for key in 0..10 as u64 {\\n\\n let value = Arc::new(key + 100);\\n\\n e.insert(key, &value);\\n\\n assert_eq!(e.len(), (key + 1) as usize);\\n\\n }\\n\\n assert!(!e.is_empty());\\n\\n e.clear();\\n\\n assert!(e.is_empty());\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// SimpleCache\\n\\n//-----------------------------------------------------------------------------\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 30,\n \"score\": 74157.97607077617\n },\n {\n \"content\": \"#[cfg(target_os = \\\"linux\\\")]\\n\\n#[test]\\n\\nfn test_lock_unlock_mem() {\\n\\n let mut vec = Vec::<u8>::with_capacity(16);\\n\\n vec.resize(16, 0);\\n\\n\\n\\n assert!(lock_mem(vec.as_ptr(), vec.len()));\\n\\n assert!(unlock_mem(vec.as_ptr(), vec.len()));\\n\\n\\n\\n assert!(!lock_mem(vec.as_ptr(), 0));\\n\\n assert!(!unlock_mem(vec.as_ptr(), 0));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 31,\n \"score\": 74157.72691149797\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplecache_valuecache_concurrent_clear() {\\n\\n let c: Arc<SimpleCache<u64, u64>> = Arc::new(SimpleCache::new(10));\\n\\n\\n\\n for key in 0..10 as u64 {\\n\\n let value = Arc::new(key + 1000);\\n\\n c.insert(key, &value);\\n\\n }\\n\\n\\n\\n let t1c = Arc::clone(&c);\\n\\n let t1 = std::thread::spawn(move || {\\n\\n t1c.clear();\\n\\n assert_eq!(t1c.len(), 0);\\n\\n assert!(t1c.is_empty());\\n\\n });\\n\\n let t2c = Arc::clone(&c);\\n\\n let t2 = std::thread::spawn(move || {\\n\\n t2c.clear();\\n\\n assert_eq!(t2c.len(), 0);\\n\\n assert!(t2c.is_empty());\\n\\n });\\n\\n t1.join().unwrap();\\n\\n t2.join().unwrap();\\n\\n\\n\\n assert_eq!(c.len(), 0);\\n\\n assert!(c.is_empty());\\n\\n}\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 32,\n \"score\": 72449.74060012537\n },\n {\n \"content\": \"#[test]\\n\\nfn test_win32protectedvalue_new() {\\n\\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\\n\\n let p = Win32ProtectedValue::new(&exp);\\n\\n\\n\\n assert_eq!(p.protected_data.len(), exp.len());\\n\\n assert_eq!(\\n\\n p.protected_data.buffer_len(),\\n\\n Win32ProtectedValue::protected_size(exp.len())\\n\\n );\\n\\n assert_ne!(p.protected_data.value(), &exp);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/impl_win32/tests.rs\",\n \"rank\": 33,\n \"score\": 72449.74060012537\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplesliceserializer_simpledataserializer_write() {\\n\\n let mut data: [u8; 50] = [0; 50];\\n\\n let mut v = SimpleSliceSerializer::new(&mut data);\\n\\n\\n\\n v.write(SAMPLE00).unwrap();\\n\\n v.write_u8(SAMPLE01).unwrap();\\n\\n v.write_u16(SAMPLE02).unwrap();\\n\\n v.write_u32(SAMPLE03).unwrap();\\n\\n v.write_u64(SAMPLE04).unwrap();\\n\\n v.write_i8(SAMPLE05).unwrap();\\n\\n v.write_i16(SAMPLE06).unwrap();\\n\\n v.write_i32(SAMPLE07).unwrap();\\n\\n v.write_i64(SAMPLE08).unwrap();\\n\\n v.write_f32(SAMPLE09).unwrap();\\n\\n v.write_f64(SAMPLE10).unwrap();\\n\\n v.write_byte_array(SAMPLE11).unwrap();\\n\\n assert_eq!(&data, SAMPLE);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/simple_serialization/tests.rs\",\n \"rank\": 35,\n \"score\": 72449.74060012537\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplecacheengine_impl_next_counter() {\\n\\n let mut e: SimpleCacheEngine<u64, u64> = SimpleCacheEngine::new(10);\\n\\n\\n\\n assert_eq!(e.counter, 0);\\n\\n assert_eq!(e.next_counter(), 0);\\n\\n assert_eq!(e.next_counter(), 1);\\n\\n assert_eq!(e.next_counter(), 2);\\n\\n assert_eq!(e.next_counter(), 3);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 37,\n \"score\": 72449.74060012537\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplecacheengine_impl_remove_oldest() {\\n\\n let mut e: SimpleCacheEngine<u64, u64> = SimpleCacheEngine::new(10);\\n\\n\\n\\n for key in 0..10 as u64 {\\n\\n let value = Arc::new(key);\\n\\n e.map.insert(key, SimpleCacheEntry::new(&value, key));\\n\\n }\\n\\n for key in 0..10 as u64 {\\n\\n assert_eq!(e.len(), (10 - key) as usize);\\n\\n e.remove_oldest();\\n\\n assert_eq!(e.len(), (10 - key - 1) as usize);\\n\\n assert!(e.get(&key).is_none());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 38,\n \"score\": 72449.74060012537\n },\n {\n \"content\": \"#[test]\\n\\nfn test_sharedfile_default_options() {\\n\\n let options = SharedFile::default_options();\\n\\n let mut exp_options = OpenOptions::new();\\n\\n exp_options.read(true).write(true).create(true);\\n\\n // I'll compare the contents of both options using debug as it has\\n\\n // access to the internal fields. Furthermore, the debug strings should\\n\\n // be equal if the objects are instantiated in the same way. Furthermore,\\n\\n // I think it will\\n\\n assert_eq!(format!(\\\"{:?}\\\", options), format!(\\\"{:?}\\\", exp_options));\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// SharedDirectory\\n\\n//-----------------------------------------------------------------------------\\n\\n\\n\",\n \"file_path\": \"src/fs/shared/tests.rs\",\n \"rank\": 40,\n \"score\": 72449.74060012537\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplecache_valuecache_concurrent_insert() {\\n\\n let c: Arc<SimpleCache<u64, u64>> = Arc::new(SimpleCache::new(10));\\n\\n\\n\\n let t1c = Arc::clone(&c);\\n\\n let t1 = std::thread::spawn(move || {\\n\\n for key in 0..8 as u64 {\\n\\n let value = Arc::new(key + 1000);\\n\\n t1c.insert(key, &value);\\n\\n }\\n\\n });\\n\\n let t2c = Arc::clone(&c);\\n\\n let t2 = std::thread::spawn(move || {\\n\\n for key in 2..10 as u64 {\\n\\n let value = Arc::new(key + 10000);\\n\\n t2c.insert(key, &value);\\n\\n }\\n\\n });\\n\\n t1.join().unwrap();\\n\\n t2.join().unwrap();\\n\\n\\n\\n // Test the result of the inserts\\n\\n for key in 0..10 as u64 {\\n\\n c.get(&key).unwrap();\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 41,\n \"score\": 72449.74060012537\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplecache_valuecache_concurrent_get() {\\n\\n let c: Arc<SimpleCache<u64, u64>> = Arc::new(SimpleCache::new(10));\\n\\n\\n\\n for key in 0..10 as u64 {\\n\\n let value = Arc::new(key + 1000);\\n\\n c.insert(key, &value);\\n\\n }\\n\\n\\n\\n let t1c = Arc::clone(&c);\\n\\n let t1 = std::thread::spawn(move || {\\n\\n for key in 0..8 as u64 {\\n\\n t1c.get(&key).unwrap();\\n\\n }\\n\\n });\\n\\n let t2c = Arc::clone(&c);\\n\\n let t2 = std::thread::spawn(move || {\\n\\n for key in 2..10 as u64 {\\n\\n t2c.get(&key).unwrap();\\n\\n }\\n\\n });\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 42,\n \"score\": 72449.74060012537\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simpleslicedeserializer_simpledeserializer_read() {\\n\\n let mut v = SimpleSliceDeserializer::new(&*SAMPLE);\\n\\n\\n\\n let mut offs = 0;\\n\\n let size = 3;\\n\\n v.read(SAMPLE00.len()).unwrap();\\n\\n assert_eq!(SAMPLE00, v.data());\\n\\n offs += size;\\n\\n\\n\\n let size = 1;\\n\\n assert_eq!(v.read_u8().unwrap(), SAMPLE01);\\n\\n assert_eq!(&SAMPLE[offs..offs + size], v.data());\\n\\n offs += size;\\n\\n\\n\\n let size = 2;\\n\\n assert_eq!(v.read_u16().unwrap(), SAMPLE02);\\n\\n assert_eq!(&SAMPLE[offs..offs + size], v.data());\\n\\n offs += size;\\n\\n\\n\\n let size = 4;\\n\",\n \"file_path\": \"src/simple_serialization/tests.rs\",\n \"rank\": 43,\n \"score\": 72449.74060012537\n },\n {\n \"content\": \"#[cfg(target_os = \\\"linux\\\")]\\n\\n#[test]\\n\\nfn test_lock_unlock_mem_core() {\\n\\n let mut vec = Vec::<u8>::with_capacity(16);\\n\\n vec.resize(16, 0);\\n\\n\\n\\n assert!(lock_mem_core(vec.as_ptr() as *const c_void, vec.len()));\\n\\n assert!(unlock_mem_core(vec.as_ptr() as *const c_void, vec.len()));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 44,\n \"score\": 72449.49144084717\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lock_supported_core() {\\n\\n assert!(lock_supported_core());\\n\\n}\\n\",\n \"file_path\": \"src/mem/impl_linux/tests.rs\",\n \"rank\": 45,\n \"score\": 70842.93094315293\n },\n {\n \"content\": \"#[test]\\n\\nfn test_win32protectedvalue_get_secret() {\\n\\n let exp: [u8; 8] = [1, 2, 3, 4, 5, 6, 7, 8];\\n\\n let p = Win32ProtectedValue::new(&exp);\\n\\n\\n\\n let s = p.get_secret();\\n\\n assert_ne!(p.protected_data.value(), &exp);\\n\\n assert_eq!(s.value(), &exp);\\n\\n}\\n\",\n \"file_path\": \"src/mem/impl_win32/tests.rs\",\n \"rank\": 46,\n \"score\": 70842.93094315293\n },\n {\n \"content\": \"#[test]\\n\\nfn test_win32protectedvalue_protected_size() {\\n\\n let block_size = CRYPTPROTECTMEMORY_BLOCK_SIZE as usize;\\n\\n for c in 0..8 {\\n\\n for i in (block_size * c)..(block_size * (c + 1)) {\\n\\n assert_eq!(Win32ProtectedValue::protected_size(i), block_size * (c + 1));\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/impl_win32/tests.rs\",\n \"rank\": 47,\n \"score\": 70842.93094315293\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lock_supported_core() {\\n\\n assert!(!lock_supported_core());\\n\\n}\\n\",\n \"file_path\": \"src/mem/impl_default/tests.rs\",\n \"rank\": 49,\n \"score\": 70842.93094315293\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lock_supported_core() {\\n\\n assert!(lock_supported_core());\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// Win32ProtectedValue\\n\\n//-----------------------------------------------------------------------------\\n\",\n \"file_path\": \"src/mem/impl_win32/tests.rs\",\n \"rank\": 50,\n \"score\": 70842.93094315293\n },\n {\n \"content\": \"#[test]\\n\\nfn test_sharedfilelocknamebuilder_get_lock_directory() {\\n\\n let f = DummySharedFileLockNameBuilder;\\n\\n\\n\\n let file = Path::new(\\\"name\\\");\\n\\n assert_eq!(f.get_lock_directory(&file), file.parent());\\n\\n\\n\\n let file = Path::new(\\\"/test/name\\\");\\n\\n assert_eq!(f.get_lock_directory(&file), file.parent());\\n\\n\\n\\n let file = Path::new(\\\"/\\\");\\n\\n assert_eq!(f.get_lock_directory(&file), None);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/fs/shared/tests.rs\",\n \"rank\": 51,\n \"score\": 70842.93094315293\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simpleslicedeserializer_simpledeserializer_read_fail() {\\n\\n let s: [u8; 8] = [0, 3, 0, 0, 0, 0, 0, 0];\\n\\n\\n\\n let mut v = SimpleSliceDeserializer::new(&s[..2]);\\n\\n assert!(matches!(v.read(3), Err(ErrorKind::UnableToRead)));\\n\\n assert_eq!(v.offset, 0);\\n\\n assert_eq!(v.data_offset, 0);\\n\\n\\n\\n let mut v = SimpleSliceDeserializer::new(&s[..0]);\\n\\n assert!(matches!(v.read_u8(), Err(ErrorKind::UnableToRead)));\\n\\n assert_eq!(v.offset, 0);\\n\\n assert_eq!(v.data_offset, 0);\\n\\n assert!(matches!(v.read_i8(), Err(ErrorKind::UnableToRead)));\\n\\n assert_eq!(v.offset, 0);\\n\\n assert_eq!(v.data_offset, 0);\\n\\n\\n\\n let mut v = SimpleSliceDeserializer::new(&s[..1]);\\n\\n assert!(matches!(v.read_u16(), Err(ErrorKind::UnableToRead)));\\n\\n assert_eq!(v.offset, 0);\\n\\n assert_eq!(v.data_offset, 0);\\n\",\n \"file_path\": \"src/simple_serialization/tests.rs\",\n \"rank\": 52,\n \"score\": 70842.93094315293\n },\n {\n \"content\": \"#[test]\\n\\nfn test_simplesliceserializer_simpledataserializer_write_fail() {\\n\\n let mut data: [u8; 2] = [0; 2];\\n\\n let mut v = SimpleSliceSerializer::new(&mut data);\\n\\n assert!(matches!(v.write(SAMPLE00), Err(ErrorKind::UnableToWrite)));\\n\\n\\n\\n let mut data: [u8; 0] = [];\\n\\n let mut v = SimpleSliceSerializer::new(&mut data);\\n\\n assert!(matches!(\\n\\n v.write_u8(SAMPLE01),\\n\\n Err(ErrorKind::UnableToWrite)\\n\\n ));\\n\\n assert!(matches!(\\n\\n v.write_i8(SAMPLE05),\\n\\n Err(ErrorKind::UnableToWrite)\\n\\n ));\\n\\n\\n\\n let mut data: [u8; 1] = [0];\\n\\n let mut v = SimpleSliceSerializer::new(&mut data);\\n\\n assert!(matches!(\\n\\n v.write_u16(SAMPLE02),\\n\",\n \"file_path\": \"src/simple_serialization/tests.rs\",\n \"rank\": 53,\n \"score\": 70842.93094315293\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lock_unlock_mem_core() {\\n\\n let mut v: Vec<u8> = Vec::with_capacity(16);\\n\\n v.resize(16, 0);\\n\\n assert!(lock_mem_core(v.as_ptr() as *const c_void, v.len()));\\n\\n assert!(unlock_mem_core(v.as_ptr() as *const c_void, v.len()));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/impl_linux/tests.rs\",\n \"rank\": 54,\n \"score\": 69328.48029130363\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lock_unlock_mem_core() {\\n\\n let mut v: Vec<u8> = Vec::with_capacity(16);\\n\\n v.resize(16, 0);\\n\\n assert!(lock_mem_core(v.as_ptr() as *const c_void, v.len()));\\n\\n assert!(unlock_mem_core(v.as_ptr() as *const c_void, v.len()));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/impl_win32/tests.rs\",\n \"rank\": 55,\n \"score\": 69328.48029130363\n },\n {\n \"content\": \"#[test]\\n\\nfn test_sharedfilelocknamebuilder_create_lock_file_path() {\\n\\n let f = DummySharedFileLockNameBuilder;\\n\\n\\n\\n let file = Path::new(\\\"name\\\");\\n\\n assert_eq!(\\n\\n f.create_lock_file_path(&file).unwrap(),\\n\\n OsString::from(\\\"prefix.name.suffix\\\")\\n\\n );\\n\\n\\n\\n let file = Path::new(\\\"/test/name\\\");\\n\\n assert_eq!(\\n\\n f.create_lock_file_path(&file).unwrap(),\\n\\n OsString::from(\\\"/test/prefix.name.suffix\\\")\\n\\n );\\n\\n\\n\\n let file = Path::new(\\\"/name\\\");\\n\\n assert_eq!(\\n\\n f.create_lock_file_path(&file).unwrap(),\\n\\n OsString::from(\\\"/prefix.name.suffix\\\")\\n\\n );\\n\",\n \"file_path\": \"src/fs/shared/tests.rs\",\n \"rank\": 56,\n \"score\": 69328.48029130363\n },\n {\n \"content\": \"#[test]\\n\\nfn test_lock_unlock_mem_core() {\\n\\n let mut v: Vec<u8> = Vec::with_capacity(16);\\n\\n v.resize(16, 0);\\n\\n assert!(!lock_mem_core(v.as_ptr() as *const c_void, v.len()));\\n\\n assert!(!unlock_mem_core(v.as_ptr() as *const c_void, v.len()));\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/impl_default/tests.rs\",\n \"rank\": 57,\n \"score\": 69328.48029130363\n },\n {\n \"content\": \"#[cfg(target_os = \\\"windows\\\")]\\n\\npub fn create_protected_value(value: &[u8]) -> Arc<dyn ProtectedValue> {\\n\\n Arc::new(impl_win32::Win32ProtectedValue::new(value))\\n\\n}\\n\",\n \"file_path\": \"src/mem/mod.rs\",\n \"rank\": 58,\n \"score\": 68841.24656441272\n },\n {\n \"content\": \"fn translation() -> Result<()> {\\n\\n let mut buff: [u8; 0] = [];\\n\\n let mut serializer = SimpleSliceSerializer::new(&mut buff);\\n\\n serializer.write_u8(0)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/simple_serialization/tests.rs\",\n \"rank\": 59,\n \"score\": 66462.23515307916\n },\n {\n \"content\": \"fn main() {\\n\\n build_windows();\\n\\n}\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 60,\n \"score\": 47355.10051263917\n },\n {\n \"content\": \"//=============================================================================\\n\\n// SharedFileLockNameBuilder\\n\\n//-----------------------------------------------------------------------------\\n\\nstruct DummySharedFileLockNameBuilder;\\n\\n\\n\\nimpl SharedFileLockNameBuilder for DummySharedFileLockNameBuilder {\\n\\n fn create_lock_file_name(&self, file_name: &OsStr) -> OsString {\\n\\n let mut lock_file_name = OsString::from(\\\"prefix.\\\");\\n\\n lock_file_name.push(file_name);\\n\\n lock_file_name.push(\\\".suffix\\\");\\n\\n lock_file_name\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/fs/shared/tests.rs\",\n \"rank\": 61,\n \"score\": 46866.509670422\n },\n {\n \"content\": \"#[cfg(target_os = \\\"windows\\\")]\\n\\nfn build_windows() {\\n\\n windows::build! {\\n\\n Windows::Win32::System::Memory::{VirtualLock,VirtualUnlock},\\n\\n Windows::Win32::Security::{CryptProtectMemory,CryptUnprotectMemory,CRYPTPROTECTMEMORY_SAME_PROCESS,CRYPTPROTECTMEMORY_BLOCK_SIZE},\\n\\n };\\n\\n}\\n\\n\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 62,\n \"score\": 45977.88566165545\n },\n {\n \"content\": \"#[cfg(not(target_os = \\\"windows\\\"))]\\n\\nfn build_windows() {}\\n\\n\\n\",\n \"file_path\": \"build.rs\",\n \"rank\": 63,\n \"score\": 45977.88566165545\n },\n {\n \"content\": \"//=============================================================================\\n\\n// CacheEntry\\n\\n//-----------------------------------------------------------------------------\\n\\n/// This struct implements a SimpleCache entry. The value is shared by an\\n\\n/// [`Arc`] reference.\\n\\nstruct SimpleCacheEntry<V: Send + Sync> {\\n\\n value: Arc<V>,\\n\\n counter: u64,\\n\\n}\\n\\n\\n\\nimpl<V: Send + Sync> SimpleCacheEntry<V> {\\n\\n /// Creates a new [`SimpleCacheEntry`].\\n\\n ///\\n\\n /// Arguments:\\n\\n /// - `value`: The value;\\n\\n /// - `counter`: The current counter;\\n\\n ///\\n\\n pub fn new(value: &Arc<V>, counter: u64) -> Self {\\n\\n Self {\\n\\n value: Arc::clone(value),\\n\\n counter,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Returns a new [`Arc`] that points to the value.\\n\",\n \"file_path\": \"src/cache/mod.rs\",\n \"rank\": 64,\n \"score\": 45546.70215923032\n },\n {\n \"content\": \"#[inline]\\n\\npub fn get_timestamp() -> i64 {\\n\\n let now = chrono::Utc::now();\\n\\n nanoseconds_to_microseconds(now.timestamp_nanos())\\n\\n}\\n\",\n \"file_path\": \"src/time/mod.rs\",\n \"rank\": 65,\n \"score\": 38534.15920193519\n },\n {\n \"content\": \"/// Determines if this platform supports memory locking or not.\\n\\n///\\n\\n/// Returns true if it is supported or false otherwise.\\n\\npub fn lock_supported() -> bool {\\n\\n lock_supported_core()\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// SecretBytes\\n\\n//-----------------------------------------------------------------------------\\n\\n/// This struct wraps a byte array that is guaranteed to have its contents\\n\\n/// shredded upon destruction.\\n\\n///\\n\\n/// It also allows the locking of the value in memory if required, preventing it\\n\\n/// from being moved into the disk.\\n\\n///\\n\\n/// This struct also implements a mechanism to set a logical length that differs\\n\\npub struct SecretBytes {\\n\\n value: Vec<u8>,\\n\\n locked: bool,\\n\\n len: usize,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/mod.rs\",\n \"rank\": 66,\n \"score\": 38534.15920193519\n },\n {\n \"content\": \"#[inline]\\n\\npub fn lock_supported_core() -> bool {\\n\\n true\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// Win32ProtectedValue\\n\\n//-----------------------------------------------------------------------------\\n\\n/// This is the implementation of the [`ProtectedValue`] for Windows that uses\\n\\n/// `CryptProtectMemory()` and `CryptUnprotectMemory()` to protect the values\\n\\n/// against memory scans attacks.\\n\\npub struct Win32ProtectedValue {\\n\\n protected_data: SecretBytes,\\n\\n}\\n\\n\\n\\nimpl Win32ProtectedValue {\\n\\n /// Returns the size of the buffer required to store the protected value.\\n\\n ///\\n\\n /// Arguments:\\n\\n /// - `data_size`: The size of the value to be protected.\\n\\n ///\\n\",\n \"file_path\": \"src/mem/impl_win32/mod.rs\",\n \"rank\": 67,\n \"score\": 35969.363391401406\n },\n {\n \"content\": \"#[inline]\\n\\npub fn lock_supported_core() -> bool {\\n\\n false\\n\\n}\\n\",\n \"file_path\": \"src/mem/impl_default/mod.rs\",\n \"rank\": 68,\n \"score\": 35969.363391401406\n },\n {\n \"content\": \"#[inline]\\n\\npub fn lock_supported_core() -> bool {\\n\\n true\\n\\n}\\n\",\n \"file_path\": \"src/mem/impl_linux/mod.rs\",\n \"rank\": 69,\n \"score\": 35969.363391401406\n },\n {\n \"content\": \"#[inline]\\n\\npub fn nanoseconds_to_microseconds(nanos: i64) -> i64 {\\n\\n nanos / 1000\\n\\n}\\n\\n\\n\\n/// Returns the current timestamp in microseconds in UNIX Time.\\n\",\n \"file_path\": \"src/time/mod.rs\",\n \"rank\": 70,\n \"score\": 34718.72596025624\n },\n {\n \"content\": \"//=============================================================================\\n\\n// SimpleCacheEngine\\n\\n//-----------------------------------------------------------------------------\\n\\n/// This struct implements the SimpleCacheEngine. It is the core of the\\n\\n/// [`SimpleCache`] implementation.\\n\\n///\\n\\n/// When it reaches its maximum capacity it will drop the oldest unused entries.\\n\\n///\\n\\n/// This struct is not thread safe and must have its concurrency protected by\\n\\n/// an external [`RwLock`] or other synchronization primitive.\\n\\nstruct SimpleCacheEngine<K: Eq + Hash + Copy + Send + Sync, V: Send + Sync> {\\n\\n map: HashMap<K, SimpleCacheEntry<V>>,\\n\\n max_size: usize,\\n\\n counter: u64,\\n\\n}\\n\\n\\n\\nimpl<K: Eq + Hash + Copy + Send + Sync, V: Send + Sync> SimpleCacheEngine<K, V> {\\n\\n /// Creates a new `SimpleCacheEngine` with a given capacity.\\n\\n ///\\n\\n /// Arguments:\\n\\n /// - `max_size`: Maximum number of items in the cache;\\n\\n pub fn new(max_size: usize) -> Self {\\n\\n Self {\\n\\n map: HashMap::new(),\\n\\n max_size,\\n\\n counter: 0,\\n\\n }\\n\\n }\\n\\n\\n\\n /// Returns the next value of the internal counter.\\n\",\n \"file_path\": \"src/cache/mod.rs\",\n \"rank\": 71,\n \"score\": 34415.31830574942\n },\n {\n \"content\": \"//=============================================================================\\n\\n// ValueCache\\n\\n//-----------------------------------------------------------------------------\\n\\n/// This trait is implemented by all value caches on this module. A value cache\\n\\n/// must be able to associate shared read-only values to a given key value.\\n\\n///\\n\\n/// It is up to the implementator of this trait to define how old values are\\n\\n/// prunned from the cache.\\n\\n///\\n\\n/// All methods of this trait are required to be thread safe.\\n\\npub trait ValueCache<K: Eq + Hash + Copy + Sync, V: Send + Sync>: Send {\\n\\n /// Gets the value from the cache if it exists.\\n\\n ///\\n\\n /// Arguments:\\n\\n /// - `key`: The key to be found;\\n\\n ///\\n\\n /// Returns:\\n\\n /// - `Some(v)`: The cached value. `v` is a new [`Arc`] that points to it.\\n\\n /// - `None`: IF the entry is not in the cache;\\n\\n fn get(&self, key: &K) -> Option<Arc<V>>;\\n\\n\\n\\n /// Inserts the value into the cache. Reinserting a new value with the\\n\\n /// same key will replace the existing value.\\n\\n ///\\n\\n /// Arguments:\\n\\n /// - `key`: The key;\\n\\n /// - `value`: A reference to an [`Arc`] that points to the value;\\n\\n fn insert(&self, key: K, value: &Arc<V>);\\n\\n\\n\\n /// Removes all entries from the cache.\\n\\n fn clear(&self);\\n\\n\\n\\n /// Returns the number of entries in the cache.\\n\\n fn len(&self) -> usize;\\n\\n\\n\\n /// Returns true if the cache is empty or false otherwise.\\n\\n fn is_empty(&self) -> bool;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cache/mod.rs\",\n \"rank\": 72,\n \"score\": 33711.53099864077\n },\n {\n \"content\": \"//=============================================================================\\n\\n// CacheEngine\\n\\n//-----------------------------------------------------------------------------\\n\\n/// This trait is implemented by all value caches on this module. A value cache\\n\\n/// must be able to associate shared read-only values to a given key value.\\n\\n///\\n\\n/// It is up to the implementator of this trait to define how old values are\\n\\n/// prunned from the cache.\\n\\n///\\n\\n/// All methods of this trait are required to be thread safe.\\n\\npub trait CacheEngine<K: Eq + Hash + Copy + Sync, V: Send + Sync>: Sync {\\n\\n /// Gets the value from the cache if it exists.\\n\\n ///\\n\\n /// Arguments:\\n\\n /// - `key`: The key to be found;\\n\\n ///\\n\\n /// Returns:\\n\\n /// - `Some(v)`: The cached value. `v` is a new [`Arc`] that points to it.\\n\\n /// - `None`: IF the entry is not in the cache;\\n\\n fn get(&mut self, key: &K) -> Option<Arc<V>>;\\n\\n\\n\\n /// Inserts the value into the cache.\\n\\n ///\\n\\n /// Arguments:\\n\\n /// - `key`: The key;\\n\\n /// - `value`: A reference to an [`Arc`] that points to the value;\\n\\n fn insert(&mut self, key: K, value: &Arc<V>);\\n\\n\\n\\n /// Removes all entries from the cache.\\n\\n fn clear(&mut self);\\n\\n\\n\\n /// Returns the number of entries in the cache.\\n\\n fn len(&self) -> usize;\\n\\n\\n\\n /// Returns true if the cache is empty or false otherwise.\\n\\n fn is_empty(&self) -> bool;\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cache/mod.rs\",\n \"rank\": 73,\n \"score\": 33711.53099864077\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\\n\\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n */\\n\\nuse super::*;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"src/time/tests.rs\",\n \"rank\": 74,\n \"score\": 29093.122205208856\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\\n\\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n */\\n\\nuse super::*;\\n\\n\\n\\n//=============================================================================\\n\\n// CacheEntry\\n\\n//-----------------------------------------------------------------------------\\n\\n#[test]\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 76,\n \"score\": 29091.665238564718\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\\n\\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n */\\n\\nuse super::*;\\n\\n\\n\\n#[cfg(target_os = \\\"linux\\\")]\\n\\n#[test]\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 77,\n \"score\": 29090.25209472095\n },\n {\n \"content\": \"/*\\n\\n * BSD 3-Clause License\\n\\n *\\n\\n * Copyright (c) 2019-2020, InterlockLedger Network\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright notice, this\\n\\n * list of conditions and the following disclaimer.\\n\\n *\\n\\n * * Redistributions in binary form must reproduce the above copyright notice,\\n\\n * this list of conditions and the following disclaimer in the documentation\\n\\n * and/or other materials provided with the distribution.\\n\\n *\\n\\n * * Neither the name of the copyright holder nor the names of its\\n\\n * contributors may be used to endorse or promote products derived from\\n\\n * this software without specific prior written permission.\\n\\n *\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 78,\n \"score\": 29081.108822865375\n },\n {\n \"content\": \"/*\\n\\n * BSD 3-Clause License\\n\\n *\\n\\n * Copyright (c) 2019-2020, InterlockLedger Network\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright notice, this\\n\\n * list of conditions and the following disclaimer.\\n\\n *\\n\\n * * Redistributions in binary form must reproduce the above copyright notice,\\n\\n * this list of conditions and the following disclaimer in the documentation\\n\\n * and/or other materials provided with the distribution.\\n\\n *\\n\\n * * Neither the name of the copyright holder nor the names of its\\n\\n * contributors may be used to endorse or promote products derived from\\n\\n * this software without specific prior written permission.\\n\\n *\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 79,\n \"score\": 29081.108822865375\n },\n {\n \"content\": \"/*\\n\\n * BSD 3-Clause License\\n\\n *\\n\\n * Copyright (c) 2019-2020, InterlockLedger Network\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright notice, this\\n\\n * list of conditions and the following disclaimer.\\n\\n *\\n\\n * * Redistributions in binary form must reproduce the above copyright notice,\\n\\n * this list of conditions and the following disclaimer in the documentation\\n\\n * and/or other materials provided with the distribution.\\n\\n *\\n\\n * * Neither the name of the copyright holder nor the names of its\\n\\n * contributors may be used to endorse or promote products derived from\\n\\n * this software without specific prior written permission.\\n\\n *\\n\",\n \"file_path\": \"src/time/tests.rs\",\n \"rank\": 80,\n \"score\": 29081.108822865375\n },\n {\n \"content\": \" t1.join().unwrap();\\n\\n t2.join().unwrap();\\n\\n\\n\\n // Test the counters\\n\\n for key in 0..10 as u64 {\\n\\n let counter = c.engine.read().unwrap().map.get(&key).unwrap().counter;\\n\\n print!(\\\"{:?} \\\", counter);\\n\\n assert!(counter >= 10);\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 82,\n \"score\": 28998.177276340324\n },\n {\n \"content\": \" if SecretBytes::lock_supported() {\\n\\n assert!(s.locked());\\n\\n } else {\\n\\n assert!(!s.locked());\\n\\n }\\n\\n\\n\\n // Unlocked\\n\\n let mut src = SecretBytes::with_value(&exp, false);\\n\\n let s = src.clone();\\n\\n assert_eq!(s.len(), s.len());\\n\\n assert_eq!(s.buffer_len(), s.len());\\n\\n assert_eq!(s.value(), &exp);\\n\\n assert!(!s.locked());\\n\\n\\n\\n // Unlocked alt len\\n\\n src.set_len(6);\\n\\n let s = src.clone();\\n\\n assert_eq!(s.len(), 6);\\n\\n assert_eq!(s.buffer_len(), exp.len());\\n\\n assert_eq!(s.value(), &exp[..6]);\\n\\n assert!(!s.locked());\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// ByteMaskGenerator\\n\\n//-----------------------------------------------------------------------------\\n\",\n \"file_path\": \"src/mem/tests.rs\",\n \"rank\": 83,\n \"score\": 28997.39651761819\n },\n {\n \"content\": \" let old_counter = e.map.get(&key).unwrap().counter;\\n\\n let v = e.get(&key).unwrap();\\n\\n assert_eq!(*v, key + 100);\\n\\n let new_counter = e.map.get(&key).unwrap().counter;\\n\\n assert!(old_counter < new_counter);\\n\\n }\\n\\n\\n\\n let key = 10 as u64;\\n\\n assert!(e.get(&key).is_none());\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 84,\n \"score\": 28995.50817209922\n },\n {\n \"content\": \" e.insert(key, &value);\\n\\n assert_eq!(e.len(), 10);\\n\\n let entry = e.map.get(&key).unwrap();\\n\\n assert_eq!(entry.counter, curr_counter);\\n\\n assert_eq!(*entry.value, *value);\\n\\n }\\n\\n\\n\\n // Adding 10 new entries\\n\\n for key in 10..20 as u64 {\\n\\n assert_eq!(e.len(), 10);\\n\\n let value = Arc::new(key + 1000);\\n\\n let curr_counter = e.counter;\\n\\n e.insert(key, &value);\\n\\n assert_eq!(e.len(), 10);\\n\\n let entry = e.map.get(&key).unwrap();\\n\\n assert_eq!(entry.counter, curr_counter);\\n\\n assert_eq!(*entry.value, *value);\\n\\n\\n\\n // The older key will always be the one with the smallest key\\n\\n let removed = key - 10;\\n\\n assert!(e.map.get(&removed).is_none());\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cache/tests.rs\",\n \"rank\": 85,\n \"score\": 28995.50817209922\n },\n {\n \"content\": \"#[allow(clippy::not_unsafe_ptr_arg_deref)]\\n\\n#[inline]\\n\\npub fn unlock_mem_core(ptr: *const c_void, size: usize) -> bool {\\n\\n unsafe { matches!(munlock(ptr, size), 0) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/impl_linux/mod.rs\",\n \"rank\": 86,\n \"score\": 28532.872796558266\n },\n {\n \"content\": \"#[inline]\\n\\npub fn lock_mem_core(ptr: *const c_void, size: usize) -> bool {\\n\\n unsafe { VirtualLock(ptr as *mut c_void, size).as_bool() }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/impl_win32/mod.rs\",\n \"rank\": 87,\n \"score\": 28532.872796558266\n },\n {\n \"content\": \"#[inline]\\n\\npub fn unlock_mem_core(ptr: *const c_void, size: usize) -> bool {\\n\\n unsafe { VirtualUnlock(ptr as *mut c_void, size).as_bool() }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/impl_win32/mod.rs\",\n \"rank\": 88,\n \"score\": 28532.872796558266\n },\n {\n \"content\": \"#[allow(clippy::not_unsafe_ptr_arg_deref)]\\n\\n#[inline]\\n\\npub fn lock_mem_core(ptr: *const c_void, size: usize) -> bool {\\n\\n unsafe { matches!(mlock(ptr, size), 0) }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/impl_linux/mod.rs\",\n \"rank\": 89,\n \"score\": 28532.872796558266\n },\n {\n \"content\": \"#[inline]\\n\\npub fn unlock_mem_core(ptr: *const c_void, size: usize) -> bool {\\n\\n false\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/impl_default/mod.rs\",\n \"rank\": 90,\n \"score\": 28532.872796558266\n },\n {\n \"content\": \"#[inline]\\n\\npub fn lock_mem_core(ptr: *const c_void, size: usize) -> bool {\\n\\n false\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/impl_default/mod.rs\",\n \"rank\": 91,\n \"score\": 28532.872796558266\n },\n {\n \"content\": \"/// Try to lock the memory segment into memory, preventing it from\\n\\n/// being moved to the disk. All calls to this function must be\\n\\n/// followed by a call to [`unlock_mem()`].\\n\\n///\\n\\n/// Use this method with extreme care because it interferes with tne\\n\\n/// OS ability to manage virtual memory.\\n\\n///\\n\\n/// Arguments:\\n\\n/// - `ptr`: The pointer to the memory segment;\\n\\n/// - `size`: The size of the ptr in units;\\n\\n///\\n\\n/// Retunrs true on success or false otherwise.\\n\\npub fn lock_mem<T: Sized>(ptr: *const T, size: usize) -> bool {\\n\\n if size > 0 {\\n\\n lock_mem_core(ptr as *const c_void, size * size_of::<T>())\\n\\n } else {\\n\\n false\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/mod.rs\",\n \"rank\": 92,\n \"score\": 28109.679748089016\n },\n {\n \"content\": \"/// Unlocks the memory segment. It reverts the effects of [`lock_mem()`].\\n\\n///\\n\\n/// Arguments:\\n\\n/// - `ptr`: The pointer to the memory segment;\\n\\n/// - `size`: The size of the ptr in units;\\n\\n///\\n\\n/// Retunrs true on success or false otherwise.\\n\\npub fn unlock_mem<T: Sized>(ptr: *const T, size: usize) -> bool {\\n\\n if size > 0 {\\n\\n unlock_mem_core(ptr as *const c_void, size * size_of::<T>())\\n\\n } else {\\n\\n false\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/mem/mod.rs\",\n \"rank\": 93,\n \"score\": 28102.775910877022\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\\n\\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n */\\n\\nuse super::*;\\n\\n\\n\\n//=============================================================================\\n\\n// Test error remaping\\n\\n//-----------------------------------------------------------------------------\\n\\n#[derive(Debug)]\\n\",\n \"file_path\": \"src/simple_serialization/tests.rs\",\n \"rank\": 94,\n \"score\": 27866.80674614714\n },\n {\n \"content\": \"/*\\n\\n * BSD 3-Clause License\\n\\n *\\n\\n * Copyright (c) 2019-2020, InterlockLedger Network\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright notice, this\\n\\n * list of conditions and the following disclaimer.\\n\\n *\\n\\n * * Redistributions in binary form must reproduce the above copyright notice,\\n\\n * this list of conditions and the following disclaimer in the documentation\\n\\n * and/or other materials provided with the distribution.\\n\\n *\\n\\n * * Neither the name of the copyright holder nor the names of its\\n\\n * contributors may be used to endorse or promote products derived from\\n\\n * this software without specific prior written permission.\\n\\n *\\n\",\n \"file_path\": \"src/fs/shared/tests.rs\",\n \"rank\": 95,\n \"score\": 27855.868771941066\n },\n {\n \"content\": \"/*\\n\\n * BSD 3-Clause License\\n\\n *\\n\\n * Copyright (c) 2019-2020, InterlockLedger Network\\n\\n * All rights reserved.\\n\\n *\\n\\n * Redistribution and use in source and binary forms, with or without\\n\\n * modification, are permitted provided that the following conditions are met:\\n\\n *\\n\\n * * Redistributions of source code must retain the above copyright notice, this\\n\\n * list of conditions and the following disclaimer.\\n\\n *\\n\\n * * Redistributions in binary form must reproduce the above copyright notice,\\n\\n * this list of conditions and the following disclaimer in the documentation\\n\\n * and/or other materials provided with the distribution.\\n\\n *\\n\\n * * Neither the name of the copyright holder nor the names of its\\n\\n * contributors may be used to endorse or promote products derived from\\n\\n * this software without specific prior written permission.\\n\\n *\\n\",\n \"file_path\": \"src/simple_serialization/tests.rs\",\n \"rank\": 96,\n \"score\": 27855.868771941066\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\\n\\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n */\\n\\nuse super::*;\\n\\nuse il2_test_utils::testdir::TestDirUtils;\\n\\nuse std::ffi::{OsStr, OsString};\\n\\nuse std::fs::{File, OpenOptions};\\n\\nuse std::path::Path;\\n\\n\\n\\n//=============================================================================\\n\\n// SharedFileLockNameBuilder\\n\\n//-----------------------------------------------------------------------------\\n\",\n \"file_path\": \"src/fs/shared/tests.rs\",\n \"rank\": 97,\n \"score\": 27853.57658273543\n },\n {\n \"content\": \" ));\\n\\n\\n\\n let mut data: [u8; 7] = [0; 7];\\n\\n let mut v = SimpleSliceSerializer::new(&mut data);\\n\\n assert!(matches!(\\n\\n v.write_u64(SAMPLE04),\\n\\n Err(ErrorKind::UnableToWrite)\\n\\n ));\\n\\n assert!(matches!(\\n\\n v.write_i64(SAMPLE08),\\n\\n Err(ErrorKind::UnableToWrite)\\n\\n ));\\n\\n assert!(matches!(\\n\\n v.write_f64(SAMPLE10),\\n\\n Err(ErrorKind::UnableToWrite)\\n\\n ));\\n\\n\\n\\n let mut data: [u8; 4] = [0; 4];\\n\\n let mut v = SimpleSliceSerializer::new(&mut data);\\n\\n assert!(matches!(\\n\\n v.write_byte_array(SAMPLE11),\\n\\n Err(ErrorKind::UnableToWrite)\\n\\n ));\\n\\n}\\n\\n\\n\\n//=============================================================================\\n\\n// SimpleSliceDeserializer\\n\\n//-----------------------------------------------------------------------------\\n\",\n \"file_path\": \"src/simple_serialization/tests.rs\",\n \"rank\": 98,\n \"score\": 27780.49655505263\n },\n {\n \"content\": \" * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \\\"AS IS\\\"\\n\\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\\n\\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\\n\\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\\n\\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\\n\\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\\n\\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\\n\\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\\n\\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\\n\\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\\n\\n */\\n\\nuse super::*;\\n\\n\\n\\n#[test]\\n\",\n \"file_path\": \"src/mem/impl_win32/tests.rs\",\n \"rank\": 99,\n \"score\": 97.6140331096365\n }\n]","isConversational":false}}},{"rowIdx":996,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/lib.rs"},"repo_name":{"kind":"string","value":"arthurhenrique/rusti-cal"},"commit":{"kind":"string","value":"5d481a8afb72827f70712caf8f7d88ddad20847a"},"file_code":{"kind":"string","value":"mod locale;\n\nconst REFORM_YEAR: u32 = 1099;\nconst MONTHS: usize = 12;\nconst WEEKDAYS: u32 = 7;\n\nconst COLUMN: usize = 3;\nconst ROWS: usize = 4;\nconst ROW_SIZE: usize = 7;\n\nstatic TOKEN: &str = \"\\n\";\n\nfn is_leap_year(year: u32) -> bool {\n if year <= REFORM_YEAR {\n return year % 4 == 0;\n }\n (year % 4 == 0) ^ (year % 100 == 0) ^ (year % 400 == 0)\n}\n\nfn days_by_year(mut year: u32) -> u32 {\n let mut count: u32 = 0;\n\n while year > 1 {\n year -= 1;\n if is_leap_year(year) {\n count += 366\n } else {\n count += 365\n }\n }\n count\n}\n\nfn days_by_month(year: u32) -> Vec<u32> {\n let mut feb_day: u32 = 28;\n\n if is_leap_year(year) {\n feb_day = 29;\n }\n vec![0, 31, feb_day, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n}\n\nfn days_by_date(\n day: u32,\n month: usize,\n year: u32,\n months_memoized: Vec<u32>,\n year_memoized: u32,\n) -> u32 {\n let mut count = 0;\n\n count += day;\n if month > 1 {\n count += months_memoized[month - 1]\n }\n if year > 1 {\n count += year_memoized\n }\n count\n}\n\nfn get_days_accumulated_by_month(year: u32) -> (Vec<u32>, Vec<u32>) {\n let mut count = 0;\n let mut accum = Vec::new();\n let days: Vec<u32> = days_by_month(year);\n\n (0..MONTHS + 1).for_each(|i| {\n count += days[i];\n accum.push(count);\n });\n (accum, days)\n}\n\nfn first_day_printable(day_year: u32, starting_day: u32) -> String {\n let mut spaces: String = \"\".to_string();\n let mut printable = format!(\"\");\n\n if (day_year - starting_day) % WEEKDAYS == 0 {\n printable.push_str(\" \");\n }\n for i in 2..WEEKDAYS {\n spaces += &\" \".to_string();\n if (day_year - starting_day) % WEEKDAYS == i {\n printable.push_str(spaces.as_str());\n break;\n }\n }\n printable\n}\n\nfn remain_day_printable(day: u32, day_year: u32, starting_day: u32) -> String {\n let base = if ((day_year - starting_day) % WEEKDAYS) == 0 {\n format!(\"{:3}{}\", day, TOKEN)\n } else {\n String::default()\n };\n\n let complement = (1..WEEKDAYS)\n .find_map(|i| ((day_year - starting_day) % WEEKDAYS == i).then(|| format!(\"{:3}\", day)))\n .unwrap_or_default();\n\n format!(\"{}{}\", base, complement)\n}\n\nfn body_printable(\n year: u32,\n month: usize,\n days: u32,\n months_memoized: Vec<u32>,\n year_memoized: u32,\n starting_day: u32,\n) -> Vec<String> {\n let mut result = Vec::<String>::new();\n let mut result_days = format!(\"\");\n\n \n (1..days + 1).for_each(|day| {\n if day == 1 {\n let first_day = days_by_date(1, month, year, months_memoized.clone(), year_memoized);\n result_days.push_str(&first_day_printable(first_day, starting_day))\n }\n let day_year = days_by_date(day, month, year, months_memoized.clone(), year_memoized);\n result_days.push_str(&remain_day_printable(day, day_year, starting_day))\n });\n\n \n result_days\n .split(TOKEN)\n .collect::<Vec<&str>>()\n .into_iter()\n .for_each(|i| result.push(i.to_string()));\n\n \n \n let len = result.len();\n if len <= 6 {\n let spaces = 21 - result[len - 1].len();\n if result[len - 1].len() < 20 {\n for _i in 0..spaces {\n result[len - 1] += \" \"\n }\n }\n result.push(\" \".to_string())\n }\n result\n}\n\nfn month_printable(\n year: u32,\n month: usize,\n days: u32,\n months_memoized: Vec<u32>,\n year_memoized: u32,\n starting_day: u32,\n month_names: Vec<String>,\n week_names: Vec<String>,\n) -> Vec<String> {\n let mut result = Vec::<String>::new();\n let body = body_printable(\n year,\n month,\n days,\n months_memoized,\n year_memoized,\n starting_day,\n );\n let month_name = &month_names[month - 1];\n result.push(format!(\" {:^20}\", month_name));\n let header = circular_week_name(week_names, starting_day as usize);\n result.push(header);\n\n body.into_iter().for_each(|item| {\n result.push(item);\n });\n result\n}\n\nfn circular_week_name(week_name: Vec<String>, idx: usize) -> String {\n let mut s = \" \".to_string();\n let mut i = idx;\n\n while i < ROW_SIZE + idx {\n if i == (ROW_SIZE - 1) + idx {\n s.push_str(week_name[i % ROW_SIZE].as_str());\n } else {\n s.push_str(&format!(\"{} \", week_name[i % ROW_SIZE]));\n }\n i += 1\n }\n s.to_string()\n}\n\npub fn calendar(year: u32, locale_str: &str, starting_day: u32) -> Vec<Vec<Vec<String>>> {\n let mut rows: Vec<Vec<Vec<String>>> = vec![vec![vec![String::from(\"\")]; COLUMN]; ROWS];\n let mut row_counter = 0;\n let mut column_counter = 0;\n let (months_memoized, months) = get_days_accumulated_by_month(year);\n let year_memoized = days_by_year(year);\n let locale_info = locale::LocaleInfo::new(locale_str);\n\n (1..MONTHS + 1).for_each(|month| {\n rows[row_counter][column_counter] = month_printable(\n year,\n month,\n months[month],\n months_memoized.clone(),\n year_memoized,\n starting_day,\n locale_info.month_names(),\n locale_info.week_day_names(),\n );\n column_counter = month % COLUMN;\n if column_counter == 0 {\n row_counter += 1;\n }\n });\n rows\n}\n\npub fn display(year: u32, locale_str: &str, starting_day: u32) {\n let rows = calendar(year, locale_str, starting_day);\n println!(\" {:^63}\", year);\n for row in rows {\n for i in 0..8 {\n for j in 0..3 {\n print!(\"{} \", &row[j][i]);\n }\n println!();\n }\n }\n}\n\n#[test]\nfn test_circular_week_name() {\n let locale_str = \"en_US\";\n let locale_info = locale::LocaleInfo::new(locale_str);\n let week_name = locale_info.week_day_names();\n assert_eq!(circular_week_name(week_name, 0), \" Su Mo Tu We Th Fr Sa\");\n}\n\n#[test]\nfn test_circular_week_name_pt_br() {\n let locale_str = \"pt_BR\";\n let locale_info = locale::LocaleInfo::new(locale_str);\n let week_name = locale_info.week_day_names();\n assert_eq!(circular_week_name(week_name, 0), \" Do Se Te Qu Qu Se Sá\");\n}\n"},"prefix":{"kind":"string","value":"mod locale;\n\nconst REFORM_YEAR: u32 = 1099;\nconst MONTHS: usize = 12;\nconst WEEKDAYS: u32 = 7;\n\nconst COLUMN: usize = 3;\nconst ROWS: usize = 4;\nconst ROW_SIZE: usize = 7;\n\nstatic TOKEN: &str = \"\\n\";\n\nfn is_leap_year(year: u32) -> bool {\n if year <= REFORM_YEAR {\n return year % 4 == 0;\n }\n (year % 4 == 0) ^ (year % 100 == 0) ^ (year % 400 == 0)\n}\n\nfn days_by_year(mut year: u32) -> u32 {\n let mut count: u32 = 0;\n\n while year > 1 {\n year -= 1;\n if is_leap_year(year) {\n count += 366\n } else {\n count += 365\n }\n }\n count\n}\n\nfn days_by_month(year: u32) -> Vec<u32> {\n let mut feb_day: u32 = 28;\n\n if is_leap_year(year) {\n feb_day = 29;\n }\n vec![0, 31, feb_day, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n}\n\nfn days_by_date(\n day: u32,\n month: usize,\n year: u32,\n months_memoized: Vec<u32>,\n year_memoized: u32,\n) -> u32 {\n let mut count = 0;\n\n count += day;\n if month > 1 {\n count += months_memoized[month - 1]\n }\n if year > 1 {\n count += year_memoized\n }\n count\n}\n\nfn get_days_accumulated_by_month(year: u32) -> (Vec<u32>, Vec<u32>) {\n let mut count = 0;\n let mut accum = Vec::new();\n let days: Vec<u32> = days_by_month(year);\n\n (0..MONTHS + 1).for_each(|i| {\n count += days[i];\n accum.push(count);\n });\n (accum, days)\n}\n\nfn first_day_printable(day_year: u32, starting_day: u32) -> String {\n let mut spaces: String = \"\".to_string();\n let mut printable = format!(\"\");\n\n if (day_year - starting_day) % WEEKDAYS == 0 {\n printable.push_str(\" \");\n }\n for i in 2..WEEKDAYS {\n spaces += &\" \".to_string();\n if (day_year - starting_day) % WEEKDAYS == i {\n printable.push_str(spaces.as_str());\n break;\n }\n }\n printable\n}\n\nfn remain_day_printable(day: u32, day_year: u32, starting_day: u32) -> String {\n let base = if ((day_year - starting_day) % WEEKDAYS) == 0 {\n format!(\"{:3}{}\", day, TOKEN)\n } else {\n String::default()\n };\n\n let complement = (1..WEEKDAYS)\n .find_map(|i| ((day_year - starting_day) % WEEKDAYS == i).then(|| format!(\"{:3}\", day)))\n .unwrap_or_default();\n\n format!(\"{}{}\", base, complement)\n}\n\nfn body_printable(\n year: u32,\n month: usize,\n days: u32,\n months_memoized: Vec<u32>,\n year_memoized: u32,\n starting_day: u32,\n) -> Vec<String> {\n let mut result = Vec::<String>::new();\n let mut result_days = format!(\"\");\n\n \n (1..days + 1).for_each(|day| {\n "},"suffix":{"kind":"string","value":"\n let day_year = days_by_date(day, month, year, months_memoized.clone(), year_memoized);\n result_days.push_str(&remain_day_printable(day, day_year, starting_day))\n });\n\n \n result_days\n .split(TOKEN)\n .collect::<Vec<&str>>()\n .into_iter()\n .for_each(|i| result.push(i.to_string()));\n\n \n \n let len = result.len();\n if len <= 6 {\n let spaces = 21 - result[len - 1].len();\n if result[len - 1].len() < 20 {\n for _i in 0..spaces {\n result[len - 1] += \" \"\n }\n }\n result.push(\" \".to_string())\n }\n result\n}\n\nfn month_printable(\n year: u32,\n month: usize,\n days: u32,\n months_memoized: Vec<u32>,\n year_memoized: u32,\n starting_day: u32,\n month_names: Vec<String>,\n week_names: Vec<String>,\n) -> Vec<String> {\n let mut result = Vec::<String>::new();\n let body = body_printable(\n year,\n month,\n days,\n months_memoized,\n year_memoized,\n starting_day,\n );\n let month_name = &month_names[month - 1];\n result.push(format!(\" {:^20}\", month_name));\n let header = circular_week_name(week_names, starting_day as usize);\n result.push(header);\n\n body.into_iter().for_each(|item| {\n result.push(item);\n });\n result\n}\n\nfn circular_week_name(week_name: Vec<String>, idx: usize) -> String {\n let mut s = \" \".to_string();\n let mut i = idx;\n\n while i < ROW_SIZE + idx {\n if i == (ROW_SIZE - 1) + idx {\n s.push_str(week_name[i % ROW_SIZE].as_str());\n } else {\n s.push_str(&format!(\"{} \", week_name[i % ROW_SIZE]));\n }\n i += 1\n }\n s.to_string()\n}\n\npub fn calendar(year: u32, locale_str: &str, starting_day: u32) -> Vec<Vec<Vec<String>>> {\n let mut rows: Vec<Vec<Vec<String>>> = vec![vec![vec![String::from(\"\")]; COLUMN]; ROWS];\n let mut row_counter = 0;\n let mut column_counter = 0;\n let (months_memoized, months) = get_days_accumulated_by_month(year);\n let year_memoized = days_by_year(year);\n let locale_info = locale::LocaleInfo::new(locale_str);\n\n (1..MONTHS + 1).for_each(|month| {\n rows[row_counter][column_counter] = month_printable(\n year,\n month,\n months[month],\n months_memoized.clone(),\n year_memoized,\n starting_day,\n locale_info.month_names(),\n locale_info.week_day_names(),\n );\n column_counter = month % COLUMN;\n if column_counter == 0 {\n row_counter += 1;\n }\n });\n rows\n}\n\npub fn display(year: u32, locale_str: &str, starting_day: u32) {\n let rows = calendar(year, locale_str, starting_day);\n println!(\" {:^63}\", year);\n for row in rows {\n for i in 0..8 {\n for j in 0..3 {\n print!(\"{} \", &row[j][i]);\n }\n println!();\n }\n }\n}\n\n#[test]\nfn test_circular_week_name() {\n let locale_str = \"en_US\";\n let locale_info = locale::LocaleInfo::new(locale_str);\n let week_name = locale_info.week_day_names();\n assert_eq!(circular_week_name(week_name, 0), \" Su Mo Tu We Th Fr Sa\");\n}\n\n#[test]\nfn test_circular_week_name_pt_br() {\n let locale_str = \"pt_BR\";\n let locale_info = locale::LocaleInfo::new(locale_str);\n let week_name = locale_info.week_day_names();\n assert_eq!(circular_week_name(week_name, 0), \" Do Se Te Qu Qu Se Sá\");\n}\n"},"middle":{"kind":"string","value":"if day == 1 {\n let first_day = days_by_date(1, month, year, months_memoized.clone(), year_memoized);\n result_days.push_str(&first_day_printable(first_day, starting_day))\n }"},"strategy":{"kind":"string","value":"if_condition"},"context_items":{"kind":"list like","value":[{"content":"fn to_titlecase(str: &str) -> String {\n\n str.chars()\n\n .enumerate()\n\n .map(|(pos, c)| {\n\n if pos == 0 {\n\n c.to_uppercase().to_string()\n\n } else {\n\n c.to_string()\n\n }\n\n })\n\n .collect()\n\n}\n\n\n","file_path":"src/locale.rs","rank":7,"score":100154.44718854193},{"content":"fn locale() -> String {\n\n let locale = Locale::user_default();\n\n locale\n\n .tags()\n\n .next()\n\n .map(|(_, x)| x.to_string().replace(\"-\", \"_\"))\n\n .unwrap_or_default()\n\n}\n\n\n","file_path":"src/main.rs","rank":9,"score":67101.15217022695},{"content":"fn default_year() -> u32 {\n\n let now = Local::now();\n\n let (_, year) = now.year_ce();\n\n year\n\n}\n\n\n","file_path":"src/main.rs","rank":10,"score":63893.529313676656},{"content":"#[test]\n\nfn parse_invalid_locale() {\n\n assert_eq!(LocaleInfo::new(\" \").locale, Locale::POSIX);\n\n assert_eq!(LocaleInfo::new(\"bogus\").locale, Locale::POSIX);\n\n}\n\n\n","file_path":"src/locale.rs","rank":13,"score":38307.62080071853},{"content":"#[test]\n\nfn parse_default_locale() {\n\n let res = LocaleInfo::new(\"\");\n\n assert_eq!(res.locale, Locale::POSIX);\n\n\n\n let months = res.month_names();\n\n assert_eq!(months[0], \"January\");\n\n assert_eq!(months[1], \"February\");\n\n assert_eq!(months[2], \"March\");\n\n assert_eq!(months[3], \"April\");\n\n assert_eq!(months[4], \"May\");\n\n assert_eq!(months[5], \"June\");\n\n assert_eq!(months[6], \"July\");\n\n assert_eq!(months[7], \"August\");\n\n assert_eq!(months[8], \"September\");\n\n assert_eq!(months[9], \"October\");\n\n assert_eq!(months[10], \"November\");\n\n assert_eq!(months[11], \"December\");\n\n\n\n let days = res.week_day_names();\n\n assert_eq!(days, [\"Su\", \"Mo\", \"Tu\", \"We\", \"Th\", \"Fr\", \"Sa\"]);\n\n}\n\n\n","file_path":"src/locale.rs","rank":14,"score":38307.62080071853},{"content":"#[test]\n\nfn parse_english_locale() {\n\n let res = LocaleInfo::new(\"en_AU\");\n\n assert_eq!(res.locale, Locale::en_AU);\n\n\n\n let months = res.month_names();\n\n assert_eq!(months[0], \"January\");\n\n assert_eq!(months[1], \"February\");\n\n assert_eq!(months[2], \"March\");\n\n assert_eq!(months[3], \"April\");\n\n assert_eq!(months[4], \"May\");\n\n assert_eq!(months[5], \"June\");\n\n assert_eq!(months[6], \"July\");\n\n assert_eq!(months[7], \"August\");\n\n assert_eq!(months[8], \"September\");\n\n assert_eq!(months[9], \"October\");\n\n assert_eq!(months[10], \"November\");\n\n assert_eq!(months[11], \"December\");\n\n\n\n let days = res.week_day_names();\n\n assert_eq!(days, [\"Su\", \"Mo\", \"Tu\", \"We\", \"Th\", \"Fr\", \"Sa\"]);\n\n}\n\n\n","file_path":"src/locale.rs","rank":15,"score":38307.62080071853},{"content":"#[test]\n\nfn parse_non_english_locale() {\n\n let res = LocaleInfo::new(\"hu_HU\");\n\n assert_eq!(res.locale, Locale::hu_HU);\n\n\n\n let months = res.month_names();\n\n assert_eq!(months[0], \"Január\");\n\n assert_eq!(months[1], \"Február\");\n\n assert_eq!(months[2], \"Március\");\n\n assert_eq!(months[3], \"Április\");\n\n assert_eq!(months[4], \"Május\");\n\n assert_eq!(months[5], \"Június\");\n\n assert_eq!(months[6], \"Július\");\n\n assert_eq!(months[7], \"Augusztus\");\n\n assert_eq!(months[8], \"Szeptember\");\n\n assert_eq!(months[9], \"Október\");\n\n assert_eq!(months[10], \"November\");\n\n assert_eq!(months[11], \"December\");\n\n\n\n let days = res.week_day_names();\n\n assert_eq!(days, [\"V \", \"H \", \"K \", \"Sz\", \"Cs\", \"P \", \"Sz\"]);\n\n}\n\n\n","file_path":"src/locale.rs","rank":16,"score":37158.88821328625},{"content":"#[test]\n\nfn test_titlecase() {\n\n assert_eq!(to_titlecase(\"January\"), \"January\");\n\n assert_eq!(to_titlecase(\"április\"), \"Április\");\n\n}\n","file_path":"src/locale.rs","rank":19,"score":34619.61667531515},{"content":"fn main() {\n\n let arg = argh::from_env::<WithPositional>();\n\n display(arg.year, &locale(), arg.starting_day);\n\n}\n","file_path":"src/main.rs","rank":20,"score":18898.567709755673},{"content":"use pure_rust_locales::Locale;\n\nuse std::convert::TryInto;\n\n\n\n#[derive(Debug, PartialEq)]\n\npub struct LocaleInfo {\n\n locale: Locale,\n\n}\n\n\n\nimpl LocaleInfo {\n\n pub fn new(locale_str: &str) -> LocaleInfo {\n\n let locale: Locale = match locale_str.try_into() {\n\n Ok(l) => l,\n\n _ => \"POSIX\".try_into().unwrap(),\n\n };\n\n LocaleInfo { locale }\n\n }\n\n\n\n pub fn month_names(&self) -> Vec<String> {\n\n let months = pure_rust_locales::locale_match!(self.locale => LC_TIME::MON);\n\n months.iter().map(|month| to_titlecase(month)).collect()\n","file_path":"src/locale.rs","rank":21,"score":18185.302635944496},{"content":" }\n\n\n\n pub fn week_day_names(&self) -> Vec<String> {\n\n let abbreviated_days = pure_rust_locales::locale_match!(self.locale => LC_TIME::ABDAY);\n\n abbreviated_days\n\n .iter()\n\n .map(|day| to_titlecase(day))\n\n .map(|day| match day.chars().count() {\n\n 1 => format!(\"{} \", day),\n\n _ => day.chars().take(2).collect(),\n\n })\n\n .collect()\n\n }\n\n}\n\n\n","file_path":"src/locale.rs","rank":22,"score":18185.094785249745},{"content":"<p align=\"center\">\n\n <img src=\"https://user-images.githubusercontent.com/3329711/116007073-5c9f4380-a5e4-11eb-9d79-aa0aab50c14d.png\">\n\n</p>\n\n\n\n⚡️ Lightning-fast and minimal calendar command line. It's similar to `cal`.\n\nWritten in Rust 🦀\n\n\n\n## How Can Install?\n\n\n\n```sh\n\n$ cargo install rusti-cal\n\n```\n\n\n\n## Usage\n\n\n\n```sh\n\n$ rusti-cal <year>\n\n```\n\n\n\n## Hands On\n\n\n\n\n\n\n\n## Optional Usage\n\n\n\n+ Start Week With Sunday (Default)\n\n\n\n```sh\n\n$ rusti-cal <year> --starting-day 0\n\n```\n\n\n\n+ Start Week With Mondays\n\n\n\n```sh\n\n$ rusti-cal <year> --starting-day 1\n\n```\n\n\n\n+ Start Week With Tuesday\n\n\n\n```sh\n\n$ rusti-cal <year> --starting-day 2\n\n```\n\n\n\n+ Start Week With Wednesday\n\n\n\n```sh\n\n$ rusti-cal <year> --starting-day 3\n\n```\n\n\n\n+ Start Week With Thursday\n\n\n\n```sh\n\n$ rusti-cal <year> --starting-day 4\n\n```\n\n\n\n+ Start Week With Friday\n\n\n\n```sh\n\n$ rusti-cal <year> --starting-day 5\n\n```\n\n\n\n+ Start Week With Saturday\n\n\n\n```sh\n\n$ rusti-cal <year> --starting-day 6\n\n```\n\n\n\n## Locale based names\n\n\n\nThe current locale can be overwritten with the `LANG` environment variable to display the calendar in another language.\n\n\n\n```sh\n\n$ LANG=fr_FR rusti-cal <year>\n\n```\n","file_path":"README.md","rank":27,"score":3.2558384584354045},{"content":"use argh::FromArgs;\n\nuse chrono::prelude::*;\n\nuse locale_config::Locale;\n\n\n\nuse rusti_cal::display;\n\n\n\n#[derive(FromArgs, PartialEq, Debug)]\n\n/// A command with positional arguments.\n","file_path":"src/main.rs","rank":28,"score":1.300276991206209}],"string":"[\n {\n \"content\": \"fn to_titlecase(str: &str) -> String {\\n\\n str.chars()\\n\\n .enumerate()\\n\\n .map(|(pos, c)| {\\n\\n if pos == 0 {\\n\\n c.to_uppercase().to_string()\\n\\n } else {\\n\\n c.to_string()\\n\\n }\\n\\n })\\n\\n .collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/locale.rs\",\n \"rank\": 7,\n \"score\": 100154.44718854193\n },\n {\n \"content\": \"fn locale() -> String {\\n\\n let locale = Locale::user_default();\\n\\n locale\\n\\n .tags()\\n\\n .next()\\n\\n .map(|(_, x)| x.to_string().replace(\\\"-\\\", \\\"_\\\"))\\n\\n .unwrap_or_default()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 9,\n \"score\": 67101.15217022695\n },\n {\n \"content\": \"fn default_year() -> u32 {\\n\\n let now = Local::now();\\n\\n let (_, year) = now.year_ce();\\n\\n year\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 10,\n \"score\": 63893.529313676656\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_invalid_locale() {\\n\\n assert_eq!(LocaleInfo::new(\\\" \\\").locale, Locale::POSIX);\\n\\n assert_eq!(LocaleInfo::new(\\\"bogus\\\").locale, Locale::POSIX);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/locale.rs\",\n \"rank\": 13,\n \"score\": 38307.62080071853\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_default_locale() {\\n\\n let res = LocaleInfo::new(\\\"\\\");\\n\\n assert_eq!(res.locale, Locale::POSIX);\\n\\n\\n\\n let months = res.month_names();\\n\\n assert_eq!(months[0], \\\"January\\\");\\n\\n assert_eq!(months[1], \\\"February\\\");\\n\\n assert_eq!(months[2], \\\"March\\\");\\n\\n assert_eq!(months[3], \\\"April\\\");\\n\\n assert_eq!(months[4], \\\"May\\\");\\n\\n assert_eq!(months[5], \\\"June\\\");\\n\\n assert_eq!(months[6], \\\"July\\\");\\n\\n assert_eq!(months[7], \\\"August\\\");\\n\\n assert_eq!(months[8], \\\"September\\\");\\n\\n assert_eq!(months[9], \\\"October\\\");\\n\\n assert_eq!(months[10], \\\"November\\\");\\n\\n assert_eq!(months[11], \\\"December\\\");\\n\\n\\n\\n let days = res.week_day_names();\\n\\n assert_eq!(days, [\\\"Su\\\", \\\"Mo\\\", \\\"Tu\\\", \\\"We\\\", \\\"Th\\\", \\\"Fr\\\", \\\"Sa\\\"]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/locale.rs\",\n \"rank\": 14,\n \"score\": 38307.62080071853\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_english_locale() {\\n\\n let res = LocaleInfo::new(\\\"en_AU\\\");\\n\\n assert_eq!(res.locale, Locale::en_AU);\\n\\n\\n\\n let months = res.month_names();\\n\\n assert_eq!(months[0], \\\"January\\\");\\n\\n assert_eq!(months[1], \\\"February\\\");\\n\\n assert_eq!(months[2], \\\"March\\\");\\n\\n assert_eq!(months[3], \\\"April\\\");\\n\\n assert_eq!(months[4], \\\"May\\\");\\n\\n assert_eq!(months[5], \\\"June\\\");\\n\\n assert_eq!(months[6], \\\"July\\\");\\n\\n assert_eq!(months[7], \\\"August\\\");\\n\\n assert_eq!(months[8], \\\"September\\\");\\n\\n assert_eq!(months[9], \\\"October\\\");\\n\\n assert_eq!(months[10], \\\"November\\\");\\n\\n assert_eq!(months[11], \\\"December\\\");\\n\\n\\n\\n let days = res.week_day_names();\\n\\n assert_eq!(days, [\\\"Su\\\", \\\"Mo\\\", \\\"Tu\\\", \\\"We\\\", \\\"Th\\\", \\\"Fr\\\", \\\"Sa\\\"]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/locale.rs\",\n \"rank\": 15,\n \"score\": 38307.62080071853\n },\n {\n \"content\": \"#[test]\\n\\nfn parse_non_english_locale() {\\n\\n let res = LocaleInfo::new(\\\"hu_HU\\\");\\n\\n assert_eq!(res.locale, Locale::hu_HU);\\n\\n\\n\\n let months = res.month_names();\\n\\n assert_eq!(months[0], \\\"Január\\\");\\n\\n assert_eq!(months[1], \\\"Február\\\");\\n\\n assert_eq!(months[2], \\\"Március\\\");\\n\\n assert_eq!(months[3], \\\"Április\\\");\\n\\n assert_eq!(months[4], \\\"Május\\\");\\n\\n assert_eq!(months[5], \\\"Június\\\");\\n\\n assert_eq!(months[6], \\\"Július\\\");\\n\\n assert_eq!(months[7], \\\"Augusztus\\\");\\n\\n assert_eq!(months[8], \\\"Szeptember\\\");\\n\\n assert_eq!(months[9], \\\"Október\\\");\\n\\n assert_eq!(months[10], \\\"November\\\");\\n\\n assert_eq!(months[11], \\\"December\\\");\\n\\n\\n\\n let days = res.week_day_names();\\n\\n assert_eq!(days, [\\\"V \\\", \\\"H \\\", \\\"K \\\", \\\"Sz\\\", \\\"Cs\\\", \\\"P \\\", \\\"Sz\\\"]);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/locale.rs\",\n \"rank\": 16,\n \"score\": 37158.88821328625\n },\n {\n \"content\": \"#[test]\\n\\nfn test_titlecase() {\\n\\n assert_eq!(to_titlecase(\\\"January\\\"), \\\"January\\\");\\n\\n assert_eq!(to_titlecase(\\\"április\\\"), \\\"Április\\\");\\n\\n}\\n\",\n \"file_path\": \"src/locale.rs\",\n \"rank\": 19,\n \"score\": 34619.61667531515\n },\n {\n \"content\": \"fn main() {\\n\\n let arg = argh::from_env::<WithPositional>();\\n\\n display(arg.year, &locale(), arg.starting_day);\\n\\n}\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 20,\n \"score\": 18898.567709755673\n },\n {\n \"content\": \"use pure_rust_locales::Locale;\\n\\nuse std::convert::TryInto;\\n\\n\\n\\n#[derive(Debug, PartialEq)]\\n\\npub struct LocaleInfo {\\n\\n locale: Locale,\\n\\n}\\n\\n\\n\\nimpl LocaleInfo {\\n\\n pub fn new(locale_str: &str) -> LocaleInfo {\\n\\n let locale: Locale = match locale_str.try_into() {\\n\\n Ok(l) => l,\\n\\n _ => \\\"POSIX\\\".try_into().unwrap(),\\n\\n };\\n\\n LocaleInfo { locale }\\n\\n }\\n\\n\\n\\n pub fn month_names(&self) -> Vec<String> {\\n\\n let months = pure_rust_locales::locale_match!(self.locale => LC_TIME::MON);\\n\\n months.iter().map(|month| to_titlecase(month)).collect()\\n\",\n \"file_path\": \"src/locale.rs\",\n \"rank\": 21,\n \"score\": 18185.302635944496\n },\n {\n \"content\": \" }\\n\\n\\n\\n pub fn week_day_names(&self) -> Vec<String> {\\n\\n let abbreviated_days = pure_rust_locales::locale_match!(self.locale => LC_TIME::ABDAY);\\n\\n abbreviated_days\\n\\n .iter()\\n\\n .map(|day| to_titlecase(day))\\n\\n .map(|day| match day.chars().count() {\\n\\n 1 => format!(\\\"{} \\\", day),\\n\\n _ => day.chars().take(2).collect(),\\n\\n })\\n\\n .collect()\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/locale.rs\",\n \"rank\": 22,\n \"score\": 18185.094785249745\n },\n {\n \"content\": \"<p align=\\\"center\\\">\\n\\n <img src=\\\"https://user-images.githubusercontent.com/3329711/116007073-5c9f4380-a5e4-11eb-9d79-aa0aab50c14d.png\\\">\\n\\n</p>\\n\\n\\n\\n⚡️ Lightning-fast and minimal calendar command line. It's similar to `cal`.\\n\\nWritten in Rust 🦀\\n\\n\\n\\n## How Can Install?\\n\\n\\n\\n```sh\\n\\n$ cargo install rusti-cal\\n\\n```\\n\\n\\n\\n## Usage\\n\\n\\n\\n```sh\\n\\n$ rusti-cal <year>\\n\\n```\\n\\n\\n\\n## Hands On\\n\\n\\n\\n\\n\\n\\n\\n## Optional Usage\\n\\n\\n\\n+ Start Week With Sunday (Default)\\n\\n\\n\\n```sh\\n\\n$ rusti-cal <year> --starting-day 0\\n\\n```\\n\\n\\n\\n+ Start Week With Mondays\\n\\n\\n\\n```sh\\n\\n$ rusti-cal <year> --starting-day 1\\n\\n```\\n\\n\\n\\n+ Start Week With Tuesday\\n\\n\\n\\n```sh\\n\\n$ rusti-cal <year> --starting-day 2\\n\\n```\\n\\n\\n\\n+ Start Week With Wednesday\\n\\n\\n\\n```sh\\n\\n$ rusti-cal <year> --starting-day 3\\n\\n```\\n\\n\\n\\n+ Start Week With Thursday\\n\\n\\n\\n```sh\\n\\n$ rusti-cal <year> --starting-day 4\\n\\n```\\n\\n\\n\\n+ Start Week With Friday\\n\\n\\n\\n```sh\\n\\n$ rusti-cal <year> --starting-day 5\\n\\n```\\n\\n\\n\\n+ Start Week With Saturday\\n\\n\\n\\n```sh\\n\\n$ rusti-cal <year> --starting-day 6\\n\\n```\\n\\n\\n\\n## Locale based names\\n\\n\\n\\nThe current locale can be overwritten with the `LANG` environment variable to display the calendar in another language.\\n\\n\\n\\n```sh\\n\\n$ LANG=fr_FR rusti-cal <year>\\n\\n```\\n\",\n \"file_path\": \"README.md\",\n \"rank\": 27,\n \"score\": 3.2558384584354045\n },\n {\n \"content\": \"use argh::FromArgs;\\n\\nuse chrono::prelude::*;\\n\\nuse locale_config::Locale;\\n\\n\\n\\nuse rusti_cal::display;\\n\\n\\n\\n#[derive(FromArgs, PartialEq, Debug)]\\n\\n/// A command with positional arguments.\\n\",\n \"file_path\": \"src/main.rs\",\n \"rank\": 28,\n \"score\": 1.300276991206209\n }\n]","isConversational":false}}},{"rowIdx":997,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"rust/game/src/schemas.rs"},"repo_name":{"kind":"string","value":"sisso/test-unity3d-rust"},"commit":{"kind":"string","value":"883ad1eba80a6fad2b566c170a8597dc2a7600ad"},"file_code":{"kind":"string","value":"mod packages_generated;\nmod requests_generated;\nmod responses_generated;\n\npub use requests_generated::ffi_requests;\npub use responses_generated::ffi_responses;\n\nuse crate::{Error, GameEvent, Request, Result};\nuse flatbuffers::FlatBufferBuilder;\n\npub type RawMsg = [u8];\npub type RawMsgBuffer = Vec<u8>;\npub type PackageKind = u16;\n\npub fn parse_game_requests(kind: PackageKind, requests: &RawMsg) -> Result<Vec<Request>> {\n if kind != packages_generated::ffi_packages::PackageKind::Request as u16 {\n eprintln!(\"receive unknown kind {:?}\", kind);\n return Err(Error::Unknown(format!(\"Unknown kind {}\", kind)));\n }\n\n let root = flatbuffers::get_root::<ffi_requests::Requests>(requests);\n\n let total_requests = root.total_messages() as usize;\n let mut index: Vec<Option<Request>> = Vec::with_capacity(total_requests);\n for i in 0..total_requests {\n index.push(None);\n }\n\n for package in root.empty_packages().unwrap_or_default().iter() {\n match package.kind() {\n ffi_requests::RequestKind::StartGame => {\n index[package.ordering() as usize] = Some(Request::StartGame)\n }\n ffi_requests::RequestKind::GameStatus => {\n index[package.ordering() as usize] = Some(Request::GameStatus)\n }\n ffi_requests::RequestKind::GetAll => {\n index[package.ordering() as usize] = Some(Request::GetAll)\n }\n other => return Err(Error::Unknown(format!(\"Invalid kind {:?}\", other))),\n }\n }\n\n let result: Vec<_> = index.into_iter().flatten().collect();\n\n if result.len() != total_requests {\n Err(format!(\"invalid result {:?}\", result).into())\n } else {\n Ok(result)\n }\n}\n\npub fn serialize_game_events(\n game_responses: Vec<GameEvent>,\n) -> Result<(PackageKind, RawMsgBuffer)> {\n \n let mut fb = FlatBufferBuilder::new();\n\n macro_rules! create_vector {\n ($field:expr) => {\n if $field.is_empty() {\n None\n } else {\n Some(fb.create_vector($field.as_ref()))\n }\n };\n }\n\n let mut total = 0u32;\n let mut empty_packages = vec![];\n let mut create_packages = vec![];\n let mut pos_packages = vec![];\n \n\n let total_game_responses = game_responses.len();\n for responses in game_responses {\n let ordering = total;\n total += 1;\n\n match responses {\n GameEvent::CreateObj { id, x, y } => {\n create_packages.push(ffi_responses::CreatePackage::new(\n ffi_responses::ResponseKind::CreateObj,\n ordering,\n id,\n ffi_responses::PrefabKind::Player,\n x,\n y,\n ));\n }\n GameEvent::MoveObj { obj_id, x, y } => {\n pos_packages.push(ffi_responses::PosPackage::new(\n ffi_responses::ResponseKind::MoveObj,\n ordering,\n obj_id,\n x,\n y,\n ));\n }\n GameEvent::GameStarted => empty_packages.push(ffi_responses::EmptyPackage::new(\n ffi_responses::ResponseKind::GameStarted,\n ordering,\n )),\n GameEvent::GameStatusRunning => empty_packages.push(ffi_responses::EmptyPackage::new(\n ffi_responses::ResponseKind::GameStatusRunning,\n ordering,\n )),\n GameEvent::GameStatusIdle => empty_packages.push(ffi_responses::EmptyPackage::new(\n ffi_responses::ResponseKind::GameStatusIdle,\n ordering,\n )),\n GameEvent::FullStateResponse => empty_packages.push(ffi_responses::EmptyPackage::new(\n ffi_responses::ResponseKind::FullStateResponse,\n ordering,\n )),\n }\n }\n\n if total != total_game_responses as u32 {\n return Err(format!(\n \"invalid response count {:?}, expected {:?}\",\n total, total_game_responses\n )\n .into());\n }\n\n let args = ffi_responses::ResponsesArgs {\n total_messages: total,\n empty_packages: create_vector!(empty_packages),\n create_packages: create_vector!(create_packages),\n pos_packages: create_vector!(pos_packages),\n string_packages: None,\n };\n\n let out = ffi_responses::Responses::create(&mut fb, &args);\n fb.finish_minimal(out);\n\n \n Ok((\n packages_generated::ffi_packages::PackageKind::Response as u16,\n fb.finished_data().to_vec(),\n ))\n}\n"},"prefix":{"kind":"string","value":"mod packages_generated;\nmod requests_generated;\nmod responses_generated;\n\npub use requests_generated::ffi_requests;\npub use responses_generated::ffi_responses;\n\nuse crate::{Error, GameEvent, Request, Result};\nuse flatbuffers::FlatBufferBuilder;\n\npub type RawMsg = [u8];\npub type RawMsgBuffer = Vec<u8>;\npub type PackageKind = u16;\n\npub fn parse_game_requests(kind: PackageKind, requests: &RawMsg) -> Result<Vec<Request>> {\n if kind != packages_generated::ffi_packages::PackageKind::Request as u16 {\n eprintln!(\"receive unknown kind {:?}\", kind);\n return Err(Error::Unknown(format!(\"Unknown kind {}\", kind)));\n }\n\n let root = flatbuffers::get_root::<ffi_requests::Requests>(requests);\n\n let total_requests = root.total_messages() as usize;\n let mut index: Vec<Option<Request>> = Vec::with_capacity(total_requests);\n for i in 0..total_requests {\n index.push(None);\n }\n\n for package in root.empty_packages().unwrap_or_default().iter() {\n match package.kind() {\n ffi_requests::RequestKind::StartGame => {\n index[package.ordering() as usize] = Some(Request::StartGame)\n }\n ffi_requests::RequestKind::GameStatus => {\n index[package.ordering() as usize] = Some(Request::GameStatus)\n }\n ffi_requests::RequestKind::GetAll => {\n index[package.ordering() as usize] = Some(Request::GetAll)\n }\n other => return Err(Error::Unknown(format!(\"Invalid kind {:?}\", other))),\n }\n }\n\n let result: Vec<_> = index.into_iter().flatten().collect();\n\n if result.len() != total_requests {\n Err(format!(\"invalid result {:?}\", result).into())\n } else {\n Ok(result)\n }\n}\n\npub fn serialize_game_events(\n game_responses: Vec<GameEvent>,\n) -> Result<(PackageKind, RawMsgBuffer)> {\n \n let mut fb = FlatBufferBuilder::new();\n\n macro_rules! create_vector {\n ($field:expr) => {\n if $field.is_empty() {\n None\n } else {\n Some(fb.create_vector($field.as_ref()))\n }\n };\n }\n\n let mut total = 0u32;\n let mut empty_packages = vec![];\n let mut create_packages = vec![];\n let mut pos_packages = vec![];\n \n\n let total_game_responses = game_responses.len();\n for responses in game_responses {\n let ordering = total;\n total += 1;\n\n match responses {\n GameEvent::CreateObj { id, x, y } => {\n create_packages.push(ffi_responses::CreatePackage::new(\n ffi_responses::ResponseKind::CreateObj,\n ordering,\n id,\n ffi_responses::PrefabKind::Player,\n x,\n y,\n ));\n }\n GameEvent::MoveObj { obj_id, x, y } => {\n pos_packages.push(ffi_responses::PosPackage::new(\n ffi_responses::ResponseKind::MoveObj,\n orderin"},"suffix":{"kind":"string","value":"\n"},"middle":{"kind":"string","value":"g,\n obj_id,\n x,\n y,\n ));\n }\n GameEvent::GameStarted => empty_packages.push(ffi_responses::EmptyPackage::new(\n ffi_responses::ResponseKind::GameStarted,\n ordering,\n )),\n GameEvent::GameStatusRunning => empty_packages.push(ffi_responses::EmptyPackage::new(\n ffi_responses::ResponseKind::GameStatusRunning,\n ordering,\n )),\n GameEvent::GameStatusIdle => empty_packages.push(ffi_responses::EmptyPackage::new(\n ffi_responses::ResponseKind::GameStatusIdle,\n ordering,\n )),\n GameEvent::FullStateResponse => empty_packages.push(ffi_responses::EmptyPackage::new(\n ffi_responses::ResponseKind::FullStateResponse,\n ordering,\n )),\n }\n }\n\n if total != total_game_responses as u32 {\n return Err(format!(\n \"invalid response count {:?}, expected {:?}\",\n total, total_game_responses\n )\n .into());\n }\n\n let args = ffi_responses::ResponsesArgs {\n total_messages: total,\n empty_packages: create_vector!(empty_packages),\n create_packages: create_vector!(create_packages),\n pos_packages: create_vector!(pos_packages),\n string_packages: None,\n };\n\n let out = ffi_responses::Responses::create(&mut fb, &args);\n fb.finish_minimal(out);\n\n \n Ok((\n packages_generated::ffi_packages::PackageKind::Response as u16,\n fb.finished_data().to_vec(),\n ))\n}"},"strategy":{"kind":"string","value":"function_block-function_prefixed"},"context_items":{"kind":"list like","value":[{"content":"pub fn enum_name_package_kind(e: PackageKind) -> &'static str {\n\n let index = e as u16;\n\n ENUM_NAMES_PACKAGE_KIND[index as usize]\n\n}\n\n\n\n} // pub mod FfiPackages\n\n\n","file_path":"rust/game/src/schemas/packages_generated.rs","rank":1,"score":163941.63861508263},{"content":"pub fn enum_name_request_kind(e: RequestKind) -> &'static str {\n\n let index = e as u16;\n\n ENUM_NAMES_REQUEST_KIND[index as usize]\n\n}\n\n\n\n// struct EmptyPackage, aligned to 4\n\n#[repr(C, align(4))]\n\n#[derive(Clone, Copy, Debug, PartialEq)]\n\npub struct EmptyPackage {\n\n kind_: RequestKind,\n\n padding0__: u16,\n\n ordering_: u32,\n\n} // pub struct EmptyPackage\n\nimpl flatbuffers::SafeSliceAccess for EmptyPackage {}\n\nimpl<'a> flatbuffers::Follow<'a> for EmptyPackage {\n\n type Inner = &'a EmptyPackage;\n\n #[inline]\n\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\n\n <&'a EmptyPackage>::follow(buf, loc)\n\n }\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":2,"score":152919.33198183024},{"content":"/// Parse a network compact format into a game event\n\npub fn parse(package: Package) -> GameEvent {\n\n unimplemented!()\n\n}","file_path":"rust/game/src/packages/package_serialization.rs","rank":3,"score":124837.53468320234},{"content":"/// Serialize a game event to be transfer in network compact format\n\npub fn serialize(e: GameEvent) -> Package {\n\n unimplemented!()\n\n}\n\n\n","file_path":"rust/game/src/packages/package_serialization.rs","rank":4,"score":123954.36781722636},{"content":"pub fn to_cstr(value: &str) -> *mut c_char {\n\n CString::new(value).unwrap().into_raw()\n\n}\n\n\n","file_path":"rust/ffi/src/ffi/ffi_utils.rs","rank":5,"score":117322.43628223336},{"content":"pub fn enum_name_response_kind(e: ResponseKind) -> &'static str {\n\n let index = e as u16;\n\n ENUM_NAMES_RESPONSE_KIND[index as usize]\n\n}\n\n\n\n#[allow(non_camel_case_types)]\n\n#[repr(u16)]\n\n#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]\n\npub enum PrefabKind {\n\n Player = 0,\n\n Monster = 1,\n\n\n\n}\n\n\n\nconst ENUM_MIN_PREFAB_KIND: u16 = 0;\n\nconst ENUM_MAX_PREFAB_KIND: u16 = 1;\n\n\n\nimpl<'a> flatbuffers::Follow<'a> for PrefabKind {\n\n type Inner = Self;\n\n #[inline]\n","file_path":"rust/game/src/schemas/responses_generated.rs","rank":6,"score":109765.53355969212},{"content":"pub fn enum_name_prefab_kind(e: PrefabKind) -> &'static str {\n\n let index = e as u16;\n\n ENUM_NAMES_PREFAB_KIND[index as usize]\n\n}\n\n\n\n// struct EmptyPackage, aligned to 4\n\n#[repr(C, align(4))]\n\n#[derive(Clone, Copy, Debug, PartialEq)]\n\npub struct EmptyPackage {\n\n kind_: ResponseKind,\n\n padding0__: u16,\n\n ordering_: u32,\n\n} // pub struct EmptyPackage\n\nimpl flatbuffers::SafeSliceAccess for EmptyPackage {}\n\nimpl<'a> flatbuffers::Follow<'a> for EmptyPackage {\n\n type Inner = &'a EmptyPackage;\n\n #[inline]\n\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\n\n <&'a EmptyPackage>::follow(buf, loc)\n\n }\n","file_path":"rust/game/src/schemas/responses_generated.rs","rank":7,"score":109765.53355969212},{"content":"pub trait Server {\n\n fn run(&mut self) -> ServerChanges;\n\n fn output(&mut self, connection_id: ConnectionId, msg: RawMsgBuffer);\n\n fn disconnect(&mut self, connection_id: ConnectionId);\n\n}\n","file_path":"rust/server/src/server/mod.rs","rank":9,"score":81513.1432681536},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiRequests\n\n{\n\n\n\npublic enum RequestKind : ushort\n\n{\n\n GameStatus = 0,\n\n StartGame = 1,\n\n GetAll = 2,\n\n SetInputAxis = 3,\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiRequests/RequestKind.cs","rank":10,"score":76076.36074986146},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiPackages\n\n{\n\n\n\npublic enum PackageKind : ushort\n\n{\n\n Request = 0,\n\n Response = 1,\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiPackages/PackageKind.cs","rank":11,"score":75887.23186513952},{"content":"pub fn from_cstr(ptr: *const c_char) -> String {\n\n let c_str = unsafe {\n\n assert!(!ptr.is_null());\n\n CStr::from_ptr(ptr)\n\n };\n\n\n\n c_str.to_str().unwrap().to_string()\n\n}\n\n\n","file_path":"rust/ffi/src/ffi/ffi_utils.rs","rank":12,"score":75865.36003698647},{"content":"#[test]\n\nfn test_flatbuffer_non_root_element() {\n\n let bytes: [u8; 2] = [0, 0];\n\n let kind = flatbuffers::follow_cast_ref::<ResponseKind>(&bytes, 0);\n\n assert_eq!(*kind, ResponseKind::GameStarted);\n\n}\n\n\n","file_path":"rust/ffi/tests/serialization_tests.rs","rank":13,"score":74518.39637520509},{"content":"pub mod package_buffer;\n\npub mod package_serialization;","file_path":"rust/game/src/packages/mod.rs","rank":14,"score":72429.62635820305},{"content":"pub fn to_slice<'a, T>(buffer: *const T, length: u32) -> &'a [T] {\n\n unsafe { std::slice::from_raw_parts(buffer, length as usize) }\n\n}\n","file_path":"rust/ffi/src/ffi/ffi_utils.rs","rank":15,"score":67190.45485962286},{"content":"\n\n public static Offset<FfiResponses.IdPackage> CreateIdPackage(FlatBufferBuilder builder, FfiResponses.ResponseKind Kind, uint Ordering, uint Id) {\n\n builder.Prep(4, 12);\n\n builder.PutUint(Id);\n\n builder.PutUint(Ordering);\n\n builder.Pad(2);\n\n builder.PutUshort((ushort)Kind);\n\n return new Offset<FfiResponses.IdPackage>(builder.Offset);\n\n }\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/IdPackage.cs","rank":16,"score":66416.48877202293},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiResponses\n\n{\n\n\n\nusing global::System;\n\nusing global::FlatBuffers;\n\n\n\npublic struct IdPackage : IFlatbufferObject\n\n{\n\n private Struct __p;\n\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\n\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\n\n public IdPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\n\n\n\n public FfiResponses.ResponseKind Kind { get { return (FfiResponses.ResponseKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\n\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\n\n public uint Id { get { return __p.bb.GetUint(__p.bb_pos + 8); } }\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/IdPackage.cs","rank":17,"score":66415.04464750536},{"content":" public float Y { get { return __p.bb.GetFloat(__p.bb_pos + 12); } }\n\n\n\n public static Offset<FfiRequests.V2Package> CreateV2Package(FlatBufferBuilder builder, FfiRequests.RequestKind Kind, uint Ordering, float X, float Y) {\n\n builder.Prep(4, 16);\n\n builder.PutFloat(Y);\n\n builder.PutFloat(X);\n\n builder.PutUint(Ordering);\n\n builder.Pad(2);\n\n builder.PutUshort((ushort)Kind);\n\n return new Offset<FfiRequests.V2Package>(builder.Offset);\n\n }\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiRequests/V2Package.cs","rank":18,"score":66015.63161542267},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiRequests\n\n{\n\n\n\nusing global::System;\n\nusing global::FlatBuffers;\n\n\n\npublic struct V2Package : IFlatbufferObject\n\n{\n\n private Struct __p;\n\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\n\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\n\n public V2Package __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\n\n\n\n public FfiRequests.RequestKind Kind { get { return (FfiRequests.RequestKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\n\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\n\n public float X { get { return __p.bb.GetFloat(__p.bb_pos + 8); } }\n","file_path":"unity3d/Assets/src/Domain/FfiRequests/V2Package.cs","rank":19,"score":66014.77622053897},{"content":" public static Offset<FfiRequests.EmptyPackage> CreateEmptyPackage(FlatBufferBuilder builder, FfiRequests.RequestKind Kind, uint Ordering) {\n\n builder.Prep(4, 8);\n\n builder.PutUint(Ordering);\n\n builder.Pad(2);\n\n builder.PutUshort((ushort)Kind);\n\n return new Offset<FfiRequests.EmptyPackage>(builder.Offset);\n\n }\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiRequests/EmptyPackage.cs","rank":20,"score":66013.74708031293},{"content":" public FfiRequests.RequestKind Kind { get { int o = __p.__offset(4); return o != 0 ? (FfiRequests.RequestKind)__p.bb.GetUshort(o + __p.bb_pos) : FfiRequests.RequestKind.GameStatus; } }\n\n public uint Ordering { get { int o = __p.__offset(6); return o != 0 ? __p.bb.GetUint(o + __p.bb_pos) : (uint)0; } }\n\n public string Buffer { get { int o = __p.__offset(8); return o != 0 ? __p.__string(o + __p.bb_pos) : null; } }\n\n#if ENABLE_SPAN_T\n\n public Span<byte> GetBufferBytes() { return __p.__vector_as_span<byte>(8, 1); }\n\n#else\n\n public ArraySegment<byte>? GetBufferBytes() { return __p.__vector_as_arraysegment(8); }\n\n#endif\n\n public byte[] GetBufferArray() { return __p.__vector_as_array<byte>(8); }\n\n\n\n public static Offset<FfiRequests.StringPackage> CreateStringPackage(FlatBufferBuilder builder,\n\n FfiRequests.RequestKind kind = FfiRequests.RequestKind.GameStatus,\n\n uint ordering = 0,\n\n StringOffset bufferOffset = default(StringOffset)) {\n\n builder.StartTable(3);\n\n StringPackage.AddBuffer(builder, bufferOffset);\n\n StringPackage.AddOrdering(builder, ordering);\n\n StringPackage.AddKind(builder, kind);\n\n return StringPackage.EndStringPackage(builder);\n\n }\n","file_path":"unity3d/Assets/src/Domain/FfiRequests/StringPackage.cs","rank":21,"score":66013.47012008145},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiRequests\n\n{\n\n\n\nusing global::System;\n\nusing global::FlatBuffers;\n\n\n\npublic struct EmptyPackage : IFlatbufferObject\n\n{\n\n private Struct __p;\n\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\n\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\n\n public EmptyPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\n\n\n\n public FfiRequests.RequestKind Kind { get { return (FfiRequests.RequestKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\n\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\n\n\n","file_path":"unity3d/Assets/src/Domain/FfiRequests/EmptyPackage.cs","rank":22,"score":66013.31383442078},{"content":"\n\n public static void StartStringPackage(FlatBufferBuilder builder) { builder.StartTable(3); }\n\n public static void AddKind(FlatBufferBuilder builder, FfiRequests.RequestKind kind) { builder.AddUshort(0, (ushort)kind, 0); }\n\n public static void AddOrdering(FlatBufferBuilder builder, uint ordering) { builder.AddUint(1, ordering, 0); }\n\n public static void AddBuffer(FlatBufferBuilder builder, StringOffset bufferOffset) { builder.AddOffset(2, bufferOffset.Value, 0); }\n\n public static Offset<FfiRequests.StringPackage> EndStringPackage(FlatBufferBuilder builder) {\n\n int o = builder.EndTable();\n\n return new Offset<FfiRequests.StringPackage>(o);\n\n }\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiRequests/StringPackage.cs","rank":23,"score":66012.09369218833},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiRequests\n\n{\n\n\n\nusing global::System;\n\nusing global::FlatBuffers;\n\n\n\npublic struct StringPackage : IFlatbufferObject\n\n{\n\n private Table __p;\n\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\n\n public static void ValidateVersion() { FlatBufferConstants.FLATBUFFERS_1_11_1(); }\n\n public static StringPackage GetRootAsStringPackage(ByteBuffer _bb) { return GetRootAsStringPackage(_bb, new StringPackage()); }\n\n public static StringPackage GetRootAsStringPackage(ByteBuffer _bb, StringPackage obj) { return (obj.__assign(_bb.GetInt(_bb.Position) + _bb.Position, _bb)); }\n\n public void __init(int _i, ByteBuffer _bb) { __p = new Table(_i, _bb); }\n\n public StringPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\n\n\n","file_path":"unity3d/Assets/src/Domain/FfiRequests/StringPackage.cs","rank":24,"score":66009.52686480348},{"content":"fn main() {\n\n env_logger::init();\n\n compile_dotnet();\n\n}\n\n\n","file_path":"rust/ffi-flap/build.rs","rank":25,"score":47748.9102518749},{"content":"fn main() {\n\n let port = 3333;\n\n let mut server = server::server_socket::SocketServer::new(port);\n\n let mut tick: u64 = 0;\n\n let mut game = Game::new();\n\n let mut users = HashMap::new();\n\n\n\n loop {\n\n let changes = server.run();\n\n\n\n for connection_id in changes.connects {\n\n println!(\"{:?} connects\", connection_id);\n\n let user_id = game.connect();\n\n users.insert(connection_id, user_id);\n\n }\n\n\n\n for connection_id in changes.disconnects {\n\n println!(\"{:?} disconnects\", connection_id);\n\n users.remove(&connection_id);\n\n }\n","file_path":"rust/server/src/main.rs","rank":26,"score":47748.9102518749},{"content":"fn compile_dotnet() {\n\n fn flapigen_expand(from: &Path, out: &Path) {\n\n println!(\"Run flapigen_expand\");\n\n let config = DotNetConfig::new(\"ffi_domain_2\".to_owned(), \"generated_dotnet\".into());\n\n let mut swig_gen = flapigen::Generator::new(LanguageConfig::DotNetConfig(config));\n\n swig_gen = swig_gen.rustfmt_bindings(true);\n\n swig_gen.expand(\"ffi_domain_2\", from, out);\n\n }\n\n\n\n let now = Instant::now();\n\n\n\n let out_dir = env::var(\"OUT_DIR\").unwrap();\n\n flapigen_expand(\n\n Path::new(\"src/glue.rs.in\"),\n\n &Path::new(&out_dir).join(\"glue.rs\"),\n\n );\n\n let expand_time = now.elapsed();\n\n println!(\n\n \"flapigen expand time: {}\",\n\n expand_time.as_secs() as f64 + (expand_time.subsec_nanos() as f64) / 1_000_000_000.\n\n );\n\n println!(\"cargo:rerun-if-changed=src/glue.rs.in\");\n\n println!(\"cargo:rerun-if-changed=src/lib.rs\");\n\n println!(\"cargo:rerun-if-changed=build.rs\");\n\n}\n","file_path":"rust/ffi-flap/build.rs","rank":27,"score":46647.41313701664},{"content":"fn main() {\n\n let mut ffi_context = FfiContext::new(Some(\"localhost:3333\"));\n\n\n\n loop {\n\n match ffi_context.take() {\n\n Ok(Some((kind, bytes))) => {\n\n let bytes_b64 = base64::encode(bytes);\n\n println!(\"receive {:?}: {:?}\", kind, bytes_b64);\n\n }\n\n\n\n Ok(None) => {\n\n println!(\"receive none\");\n\n }\n\n\n\n Err(e) => {\n\n eprintln!(\"receive error {:?}\", e);\n\n }\n\n }\n\n\n\n std::thread::sleep(Duration::from_millis(90));\n\n }\n\n}\n","file_path":"rust/ffi/examples/ffi_context_connect_test.rs","rank":28,"score":44633.00047228331},{"content":"use std::env::current_exe;\n\n\n\n/// Kind and the bytes that represent a single message\n\npub type Package = (u16, Vec<u8>);\n\n/// Bytes that represent one. multiples or partial messages\n\npub type RawBytes = Vec<u8>;\n\n\n\n/// This class buffer incoming RawBytes and chunk into Package\n\n#[derive(Debug)]\n\npub struct PackageBuffer {\n\n kind: Option<u16>,\n\n size: Option<usize>,\n\n buffer: Vec<u8>,\n\n}\n\n\n\nimpl PackageBuffer {\n\n pub fn new() -> Self {\n\n PackageBuffer {\n\n kind: None,\n\n size: None,\n","file_path":"rust/game/src/packages/package_buffer.rs","rank":29,"score":44146.06713978771},{"content":"\n\n pub fn encode_len(len: usize) -> RawBytes {\n\n (len as u32).to_be_bytes().to_vec()\n\n }\n\n\n\n pub fn encode_kind(kind: u16) -> RawBytes {\n\n kind.to_be_bytes().to_vec()\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n use rand::rngs::StdRng;\n\n use rand::{Rng, SeedableRng};\n\n\n\n #[test]\n\n fn test_protocol() {\n\n let mut package_buffer = PackageBuffer::new();\n\n\n","file_path":"rust/game/src/packages/package_buffer.rs","rank":30,"score":44142.86132795151},{"content":" }\n\n\n\n fn get_frame(&mut self) -> Option<Package> {\n\n let kind = match self.kind {\n\n None if self.buffer.len() >= 2 => {\n\n let bytes = [self.buffer[0], self.buffer[1]];\n\n\n\n self.buffer.drain(0..2);\n\n\n\n let kind = u16::from_be_bytes(bytes);\n\n\n\n self.kind = Some(kind);\n\n kind\n\n }\n\n None => return None,\n\n Some(kind) => kind,\n\n };\n\n\n\n let size = match self.size {\n\n None if self.buffer.len() >= 4 => {\n","file_path":"rust/game/src/packages/package_buffer.rs","rank":31,"score":44136.78158048089},{"content":" buffer: vec![],\n\n }\n\n }\n\n\n\n pub fn push(&mut self, bytes: RawBytes) -> Vec<Package> {\n\n // println!(\"push {:?}\", bytes);\n\n self.buffer.extend(bytes);\n\n // println!(\"self {:?}\", self);\n\n self.get_frame_to_buffer(vec![])\n\n }\n\n\n\n fn get_frame_to_buffer(&mut self, mut buffer: Vec<Package>) -> Vec<Package> {\n\n match self.get_frame() {\n\n Some(frame) => {\n\n buffer.push(frame);\n\n self.get_frame_to_buffer(buffer)\n\n }\n\n\n\n None => buffer,\n\n }\n","file_path":"rust/game/src/packages/package_buffer.rs","rank":32,"score":44135.13654274512},{"content":" // println!(\"check buffer {:?}/{:?}\", self.buffer.len(), size);\n\n\n\n if self.buffer.len() >= size {\n\n let bytes = self.buffer[0..size].to_vec();\n\n self.buffer.drain(0..size);\n\n self.kind = None;\n\n self.size = None;\n\n Some((kind, bytes))\n\n } else {\n\n return None;\n\n }\n\n }\n\n\n\n pub fn pack((kind, frame): Package) -> RawBytes {\n\n let mut raw_bytes = vec![];\n\n raw_bytes.extend(PackageBuffer::encode_kind(kind));\n\n raw_bytes.extend(PackageBuffer::encode_len(frame.len()));\n\n raw_bytes.extend(frame);\n\n raw_bytes\n\n }\n","file_path":"rust/game/src/packages/package_buffer.rs","rank":33,"score":44134.44820615755},{"content":" value if value.len() == 1 => {\n\n let messages = msg_1.to_vec();\n\n assert_eq!(value[0].0, 38);\n\n assert_eq!(value[0].1, messages);\n\n }\n\n other => {\n\n panic!(\"unexpected result {:?}\", other);\n\n }\n\n }\n\n\n\n let msg_2_kind_len_plus_msg: [u8; 10] = [0, 3, 0, 0, 0, 4, 9, 8, 7, 6];\n\n\n\n match package_buffer.push(msg_2_kind_len_plus_msg.to_vec()) {\n\n value if value.len() == 1 => {\n\n assert_eq!(value[0].0, 3);\n\n assert_eq!(value[0].1, vec![9, 8, 7, 6]);\n\n }\n\n other => {\n\n panic!(\"unexpected result {:?}\", other);\n\n }\n","file_path":"rust/game/src/packages/package_buffer.rs","rank":34,"score":44130.93643155433},{"content":" let msg_1: [u8; 16] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15];\n\n let msg_1_kind_bytes = PackageBuffer::encode_kind(38);\n\n let msg_1_len_bytes = PackageBuffer::encode_len(msg_1.len());\n\n\n\n assert!(package_buffer\n\n .push(msg_1_kind_bytes[0..1].to_vec())\n\n .is_empty());\n\n assert!(package_buffer\n\n .push(msg_1_kind_bytes[1..2].to_vec())\n\n .is_empty());\n\n assert!(package_buffer\n\n .push(msg_1_len_bytes[0..1].to_vec())\n\n .is_empty());\n\n assert!(package_buffer\n\n .push(msg_1_len_bytes[1..4].to_vec())\n\n .is_empty());\n\n assert!(package_buffer.push(msg_1[0..9].to_vec()).is_empty());\n\n assert!(package_buffer.push(msg_1[9..13].to_vec()).is_empty());\n\n\n\n match package_buffer.push(msg_1[13..].to_vec()) {\n","file_path":"rust/game/src/packages/package_buffer.rs","rank":35,"score":44130.42862388772},{"content":" }\n\n }\n\n\n\n #[test]\n\n fn test_protocol_upload() {\n\n let mut pack_buffer = PackageBuffer::new();\n\n\n\n let mut buffer = vec![];\n\n\n\n let expected_frames = vec![\n\n (32, vec![0, 1, 2, 3]),\n\n (32, vec![4, 5, 6]),\n\n (32, vec![7, 8, 9, 10, 11]),\n\n (32, vec![12]),\n\n ];\n\n\n\n for frame in &expected_frames {\n\n buffer.extend(PackageBuffer::pack(frame.clone()));\n\n }\n\n\n","file_path":"rust/game/src/packages/package_buffer.rs","rank":36,"score":44127.07307989335},{"content":"use crate::GameEvent;\n\nuse crate::packages::package_buffer::Package;\n\n\n\n/// Serialize a game event to be transfer in network compact format\n","file_path":"rust/game/src/packages/package_serialization.rs","rank":37,"score":44121.988179877095},{"content":" let mut rng = rand::thread_rng();\n\n let mut current = 0;\n\n let mut frames = vec![];\n\n\n\n while current < buffer.len() {\n\n let next = (current + rng.gen_range(1, buffer.len())).min(buffer.len());\n\n let bytes = buffer[current..next].to_vec();\n\n current = next;\n\n frames.extend(pack_buffer.push(bytes));\n\n }\n\n\n\n assert_eq!(frames, expected_frames);\n\n }\n\n}\n","file_path":"rust/game/src/packages/package_buffer.rs","rank":38,"score":44121.95531935203},{"content":" let bytes = [\n\n self.buffer[0],\n\n self.buffer[1],\n\n self.buffer[2],\n\n self.buffer[3],\n\n ];\n\n\n\n self.buffer.drain(0..4);\n\n\n\n let size = u32::from_be_bytes(bytes) as usize;\n\n\n\n // println!(\"set size {:?}\", size);\n\n\n\n self.size = Some(size);\n\n size\n\n }\n\n None => return None,\n\n Some(size) => size,\n\n };\n\n\n","file_path":"rust/game/src/packages/package_buffer.rs","rank":39,"score":44121.58659484597},{"content":"#[test]\n\nfn test_flatbuffer_schema_serialization() {\n\n let bytes = {\n\n let mut bd = FlatBufferBuilder::new();\n\n\n\n let v = bd.create_vector(&[PosPackage::new(ResponseKind::MoveObj, 0, 1, 0.2, 3.0)]);\n\n\n\n let package = Responses::create(\n\n &mut bd,\n\n &ResponsesArgs {\n\n total_messages: 1,\n\n empty_packages: None,\n\n create_packages: None,\n\n pos_packages: Some(v),\n\n string_packages: None,\n\n },\n\n );\n\n\n\n bd.finish_minimal(package);\n\n bd.finished_data().to_vec()\n\n };\n","file_path":"rust/ffi/tests/serialization_tests.rs","rank":40,"score":43709.62146658143},{"content":" public uint TotalMessages { get { int o = __p.__offset(4); return o != 0 ? __p.bb.GetUint(o + __p.bb_pos) : (uint)0; } }\n\n public FfiRequests.EmptyPackage? EmptyPackages(int j) { int o = __p.__offset(6); return o != 0 ? (FfiRequests.EmptyPackage?)(new FfiRequests.EmptyPackage()).__assign(__p.__vector(o) + j * 8, __p.bb) : null; }\n\n public int EmptyPackagesLength { get { int o = __p.__offset(6); return o != 0 ? __p.__vector_len(o) : 0; } }\n\n public FfiRequests.V2Package? V2Packages(int j) { int o = __p.__offset(8); return o != 0 ? (FfiRequests.V2Package?)(new FfiRequests.V2Package()).__assign(__p.__vector(o) + j * 16, __p.bb) : null; }\n\n public int V2PackagesLength { get { int o = __p.__offset(8); return o != 0 ? __p.__vector_len(o) : 0; } }\n\n\n\n public static Offset<FfiRequests.Requests> CreateRequests(FlatBufferBuilder builder,\n\n uint total_messages = 0,\n\n VectorOffset empty_packagesOffset = default(VectorOffset),\n\n VectorOffset v2_packagesOffset = default(VectorOffset)) {\n\n builder.StartTable(3);\n\n Requests.AddV2Packages(builder, v2_packagesOffset);\n\n Requests.AddEmptyPackages(builder, empty_packagesOffset);\n\n Requests.AddTotalMessages(builder, total_messages);\n\n return Requests.EndRequests(builder);\n\n }\n\n\n\n public static void StartRequests(FlatBufferBuilder builder) { builder.StartTable(3); }\n\n public static void AddTotalMessages(FlatBufferBuilder builder, uint totalMessages) { builder.AddUint(0, totalMessages, 0); }\n\n public static void AddEmptyPackages(FlatBufferBuilder builder, VectorOffset emptyPackagesOffset) { builder.AddOffset(1, emptyPackagesOffset.Value, 0); }\n","file_path":"unity3d/Assets/src/Domain/FfiRequests/Requests.cs","rank":41,"score":43496.28986246056},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiRequests\n\n{\n\n\n\nusing global::System;\n\nusing global::FlatBuffers;\n\n\n\npublic struct Requests : IFlatbufferObject\n\n{\n\n private Table __p;\n\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\n\n public static void ValidateVersion() { FlatBufferConstants.FLATBUFFERS_1_11_1(); }\n\n public static Requests GetRootAsRequests(ByteBuffer _bb) { return GetRootAsRequests(_bb, new Requests()); }\n\n public static Requests GetRootAsRequests(ByteBuffer _bb, Requests obj) { return (obj.__assign(_bb.GetInt(_bb.Position) + _bb.Position, _bb)); }\n\n public void __init(int _i, ByteBuffer _bb) { __p = new Table(_i, _bb); }\n\n public Requests __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\n\n\n","file_path":"unity3d/Assets/src/Domain/FfiRequests/Requests.cs","rank":42,"score":43494.315151355615},{"content":" public static void StartEmptyPackagesVector(FlatBufferBuilder builder, int numElems) { builder.StartVector(8, numElems, 4); }\n\n public static void AddV2Packages(FlatBufferBuilder builder, VectorOffset v2PackagesOffset) { builder.AddOffset(2, v2PackagesOffset.Value, 0); }\n\n public static void StartV2PackagesVector(FlatBufferBuilder builder, int numElems) { builder.StartVector(16, numElems, 4); }\n\n public static Offset<FfiRequests.Requests> EndRequests(FlatBufferBuilder builder) {\n\n int o = builder.EndTable();\n\n return new Offset<FfiRequests.Requests>(o);\n\n }\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiRequests/Requests.cs","rank":43,"score":43491.55375281253},{"content":"\n\n FfiContext { mode }\n\n }\n\n\n\n pub fn push(&mut self, package_kind: PackageKind, bytes: &RawMsg) -> Result<()> {\n\n match &mut self.mode {\n\n RunMode::Embedded { game } => {\n\n let requests = game::schemas::parse_game_requests(package_kind, bytes)?;\n\n debug!(\"ffi receive requests: {:?}\", requests);\n\n game.handle_requests(requests)\n\n }\n\n\n\n RunMode::Server { client } => Err(Error::Unknown(\"Not implemented\".to_string())),\n\n }\n\n }\n\n\n\n // TODO: receive a closure?\n\n pub fn take(&mut self) -> Result<Option<(PackageKind, RawMsgBuffer)>> {\n\n match &mut self.mode {\n\n RunMode::Embedded { game } => {\n","file_path":"rust/ffi/src/ffi/mod.rs","rank":44,"score":36442.02922156021},{"content":"pub mod ffi_utils;\n\n\n\nuse crate::client::Client;\n\nuse crate::game::GameEvent::CreateObj;\n\nuse crate::game::{Game, GameEvent, Result, UserId};\n\nuse flatbuffers::FlatBufferBuilder;\n\nuse game::packages::package_buffer::Package;\n\nuse game::schemas::{ffi_requests, ffi_responses, PackageKind, RawMsg, RawMsgBuffer};\n\nuse game::Error;\n\n\n\n#[derive(Debug)]\n","file_path":"rust/ffi/src/ffi/mod.rs","rank":45,"score":36437.29486541909},{"content":"\n\n pub fn take(&mut self) -> Option<Vec<u8>> {\n\n if self.input_buffer.is_empty() {\n\n None\n\n } else {\n\n Some(std::mem::replace(&mut self.input_buffer, Vec::new()))\n\n }\n\n }\n\n\n\n pub fn close(&mut self) -> std::io::Result<()> {\n\n self.stream.shutdown(Shutdown::Both)\n\n }\n\n}\n\n\n","file_path":"rust/game/src/client/mod.rs","rank":46,"score":36436.43870525202},{"content":"\n\n Ok(())\n\n }\n\n\n\n pub fn take_responses(&mut self) -> Result<Option<(u16, RawMsgBuffer)>> {\n\n self.check_connection()?;\n\n\n\n match &mut self.state {\n\n State::Connected {\n\n buffer,\n\n socket,\n\n queue,\n\n } => match socket.tick() {\n\n Ok(()) => {\n\n if let Some(vec) = socket.take() {\n\n let packages = buffer.push(vec);\n\n queue.extend(packages);\n\n }\n\n\n\n if queue.is_empty() {\n","file_path":"rust/ffi/src/client/mod.rs","rank":47,"score":36434.56916896375},{"content":" let mut buffer = Vec::with_capacity(1024);\n\n for _ in 0..1024 {\n\n buffer.push(0);\n\n }\n\n\n\n Ok(SocketClient {\n\n stream,\n\n output_buffer: vec![],\n\n input_buffer: vec![],\n\n tmp_input_buffer: buffer,\n\n })\n\n }\n\n\n\n pub fn push(&mut self, bytes: Vec<u8>) {\n\n self.output_buffer.extend(bytes);\n\n }\n\n\n\n /// returns ErrorKind::BrokenPipe if connection fail\n\n pub fn tick(&mut self) -> std::io::Result<()> {\n\n if !self.output_buffer.is_empty() {\n","file_path":"rust/game/src/client/mod.rs","rank":48,"score":36434.27664643963},{"content":"use std::net::{TcpStream, Shutdown};\n\nuse std::io::{Write, Read, Error, ErrorKind};\n\n\n\n/// Read and write from a socket in non blocking mode with buffers\n\n#[derive(Debug)]\n\npub struct SocketClient {\n\n stream: TcpStream,\n\n /// bytes to be send\n\n output_buffer: Vec<u8>,\n\n /// bytes to be taken\n\n input_buffer: Vec<u8>,\n\n /// buffer to read bytes\n\n tmp_input_buffer: Vec<u8>,\n\n}\n\n\n\nimpl SocketClient {\n\n pub fn connect(address: &str) -> std::io::Result<Self> {\n\n let mut stream = TcpStream::connect(address)?;\n\n stream.set_nonblocking(true)?;\n\n\n","file_path":"rust/game/src/client/mod.rs","rank":49,"score":36434.22560726563},{"content":"use game::schemas::RawMsgBuffer;\n\n\n\npub mod server_socket;\n\n\n\npub type ConnectionId = u32;\n\n\n\n/// From the server to the connection\n\n#[derive(Debug, Clone)]\n\npub struct ServerOutput {\n\n pub connection_id: ConnectionId,\n\n pub msg: RawMsgBuffer,\n\n}\n\n\n\n/// From the connection into the server\n\n#[derive(Debug, Clone)]\n\npub struct ServerInput {\n\n pub connection_id: ConnectionId,\n\n pub msg: RawMsgBuffer,\n\n}\n\n\n\n#[derive(Debug, Clone)]\n\npub struct ServerChanges {\n\n pub connects: Vec<ConnectionId>,\n\n pub disconnects: Vec<ConnectionId>,\n\n pub inputs: Vec<ServerInput>,\n\n}\n\n\n","file_path":"rust/server/src/server/mod.rs","rank":50,"score":36431.886835153535},{"content":" }\n\n }\n\n\n\n fn check_connection(&mut self) -> Result<()> {\n\n match self.state {\n\n State::NotConnected => {\n\n // println!(\"connecting\");\n\n // TODO: this looks bad, what if connection hangout?\n\n let socket = SocketClient::connect(&self.address)?;\n\n\n\n self.state = State::Connected {\n\n buffer: PackageBuffer::new(),\n\n socket,\n\n queue: vec![],\n\n };\n\n\n\n // println!(\"connected\");\n\n }\n\n _ => {}\n\n }\n","file_path":"rust/ffi/src/client/mod.rs","rank":51,"score":36429.06663106404},{"content":"use game::client::SocketClient;\n\nuse game::packages::package_buffer::PackageBuffer;\n\nuse game::{schemas::RawMsgBuffer, Error, Result};\n\nuse logs::*;\n\nuse std::io::ErrorKind;\n\n\n\n#[derive(Debug)]\n","file_path":"rust/ffi/src/client/mod.rs","rank":52,"score":36428.388477906155},{"content":" let size = self.stream.write(&self.output_buffer)?;\n\n self.output_buffer.drain(0..size);\n\n self.stream.flush()?;\n\n }\n\n\n\n match self.stream.read(&mut self.tmp_input_buffer) {\n\n Ok(size) if size == 0 => {\n\n // println!(\"empty response!\");\n\n // Ok(())\n\n Err(Error::from(ErrorKind::BrokenPipe))\n\n },\n\n Ok(size) => {\n\n self.input_buffer.extend_from_slice(&self.tmp_input_buffer[0..size]);\n\n Ok(())\n\n },\n\n Err(ref err) if err.kind() == std::io::ErrorKind::WouldBlock => Ok(()),\n\n Err(e) =>\n\n Err(e),\n\n }\n\n }\n","file_path":"rust/game/src/client/mod.rs","rank":53,"score":36422.74029125544},{"content":" Ok(None)\n\n } else {\n\n Ok(Some(queue.remove(0)))\n\n }\n\n }\n\n\n\n Err(e) if e.kind() == std::io::ErrorKind::BrokenPipe => {\n\n info!(\"switching to not connected\");\n\n self.state = State::NotConnected;\n\n Err(Error::Disconnect)\n\n }\n\n\n\n Err(e) => Err(e.into()),\n\n },\n\n State::NotConnected => {\n\n // TODO: should we do something?\n\n Err(Error::Disconnect)\n\n }\n\n }\n\n }\n\n}\n","file_path":"rust/ffi/src/client/mod.rs","rank":54,"score":36420.94202763655},{"content":" let game_responses = game.take()?;\n\n debug!(\"ffi returning responses: {:?}\", game_responses);\n\n game::schemas::serialize_game_events(game_responses).map(Option::from)\n\n }\n\n\n\n RunMode::Server { client } => client.take_responses(),\n\n }\n\n }\n\n}\n\n\n\n#[cfg(test)]\n\nmod test {\n\n use super::*;\n\n}\n","file_path":"rust/ffi/src/ffi/mod.rs","rank":55,"score":36420.01239743199},{"content":"#[derive(Debug)]\n\nenum State {\n\n NotConnected,\n\n Connected {\n\n buffer: PackageBuffer,\n\n socket: SocketClient,\n\n queue: Vec<(u16, RawMsgBuffer)>,\n\n },\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct Client {\n\n address: String,\n\n state: State,\n\n}\n\n\n\nimpl Client {\n\n pub fn new(address: &str) -> Self {\n\n Client {\n\n address: address.to_string(),\n\n state: State::NotConnected,\n","file_path":"rust/ffi/src/client/mod.rs","rank":56,"score":35311.995307442034},{"content":" #[inline]\n\n fn default() -> Self {\n\n StringPackageArgs {\n\n kind: RequestKind::GameStatus,\n\n ordering: 0,\n\n buffer: None,\n\n }\n\n }\n\n}\n\npub struct StringPackageBuilder<'a: 'b, 'b> {\n\n fbb_: &'b mut flatbuffers::FlatBufferBuilder<'a>,\n\n start_: flatbuffers::WIPOffset<flatbuffers::TableUnfinishedWIPOffset>,\n\n}\n\nimpl<'a: 'b, 'b> StringPackageBuilder<'a, 'b> {\n\n #[inline]\n\n pub fn add_kind(&mut self, kind: RequestKind) {\n\n self.fbb_.push_slot::<RequestKind>(StringPackage::VT_KIND, kind, RequestKind::GameStatus);\n\n }\n\n #[inline]\n\n pub fn add_ordering(&mut self, ordering: u32) {\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":57,"score":35101.73074803082},{"content":"\n\n #[inline]\n\n fn push(&self, dst: &mut [u8], _rest: &[u8]) {\n\n let src = unsafe {\n\n ::std::slice::from_raw_parts(*self as *const EmptyPackage as *const u8, Self::size())\n\n };\n\n dst.copy_from_slice(src);\n\n }\n\n}\n\n\n\n\n\nimpl EmptyPackage {\n\n pub fn new<'a>(_kind: RequestKind, _ordering: u32) -> Self {\n\n EmptyPackage {\n\n kind_: _kind.to_little_endian(),\n\n ordering_: _ordering.to_little_endian(),\n\n\n\n padding0__: 0,\n\n }\n\n }\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":58,"score":35100.01205688346},{"content":" #[inline]\n\n fn default() -> Self {\n\n RequestsArgs {\n\n total_messages: 0,\n\n empty_packages: None,\n\n v2_packages: None,\n\n }\n\n }\n\n}\n\npub struct RequestsBuilder<'a: 'b, 'b> {\n\n fbb_: &'b mut flatbuffers::FlatBufferBuilder<'a>,\n\n start_: flatbuffers::WIPOffset<flatbuffers::TableUnfinishedWIPOffset>,\n\n}\n\nimpl<'a: 'b, 'b> RequestsBuilder<'a, 'b> {\n\n #[inline]\n\n pub fn add_total_messages(&mut self, total_messages: u32) {\n\n self.fbb_.push_slot::<u32>(Requests::VT_TOTAL_MESSAGES, total_messages, 0);\n\n }\n\n #[inline]\n\n pub fn add_empty_packages(&mut self, empty_packages: flatbuffers::WIPOffset<flatbuffers::Vector<'b , EmptyPackage>>) {\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":59,"score":35098.6494809947},{"content":" #[inline]\n\n pub fn kind(&self) -> RequestKind {\n\n self._tab.get::<RequestKind>(StringPackage::VT_KIND, Some(RequestKind::GameStatus)).unwrap()\n\n }\n\n #[inline]\n\n pub fn ordering(&self) -> u32 {\n\n self._tab.get::<u32>(StringPackage::VT_ORDERING, Some(0)).unwrap()\n\n }\n\n #[inline]\n\n pub fn buffer(&self) -> Option<&'a str> {\n\n self._tab.get::<flatbuffers::ForwardsUOffset<&str>>(StringPackage::VT_BUFFER, None)\n\n }\n\n}\n\n\n\npub struct StringPackageArgs<'a> {\n\n pub kind: RequestKind,\n\n pub ordering: u32,\n\n pub buffer: Option<flatbuffers::WIPOffset<&'a str>>,\n\n}\n\nimpl<'a> Default for StringPackageArgs<'a> {\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":60,"score":35098.611468318755},{"content":" pub fn kind<'a>(&'a self) -> RequestKind {\n\n self.kind_.from_little_endian()\n\n }\n\n pub fn ordering<'a>(&'a self) -> u32 {\n\n self.ordering_.from_little_endian()\n\n }\n\n}\n\n\n\n// struct V2Package, aligned to 4\n\n#[repr(C, align(4))]\n\n#[derive(Clone, Copy, Debug, PartialEq)]\n\npub struct V2Package {\n\n kind_: RequestKind,\n\n padding0__: u16,\n\n ordering_: u32,\n\n x_: f32,\n\n y_: f32,\n\n} // pub struct V2Package\n\nimpl flatbuffers::SafeSliceAccess for V2Package {}\n\nimpl<'a> flatbuffers::Follow<'a> for V2Package {\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":61,"score":35098.47346906887},{"content":" dst.copy_from_slice(src);\n\n }\n\n}\n\nimpl<'b> flatbuffers::Push for &'b V2Package {\n\n type Output = V2Package;\n\n\n\n #[inline]\n\n fn push(&self, dst: &mut [u8], _rest: &[u8]) {\n\n let src = unsafe {\n\n ::std::slice::from_raw_parts(*self as *const V2Package as *const u8, Self::size())\n\n };\n\n dst.copy_from_slice(src);\n\n }\n\n}\n\n\n\n\n\nimpl V2Package {\n\n pub fn new<'a>(_kind: RequestKind, _ordering: u32, _x: f32, _y: f32) -> Self {\n\n V2Package {\n\n kind_: _kind.to_little_endian(),\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":62,"score":35097.720167688654},{"content":"\n\nimpl flatbuffers::EndianScalar for RequestKind {\n\n #[inline]\n\n fn to_little_endian(self) -> Self {\n\n let n = u16::to_le(self as u16);\n\n let p = &n as *const u16 as *const RequestKind;\n\n unsafe { *p }\n\n }\n\n #[inline]\n\n fn from_little_endian(self) -> Self {\n\n let n = u16::from_le(self as u16);\n\n let p = &n as *const u16 as *const RequestKind;\n\n unsafe { *p }\n\n }\n\n}\n\n\n\nimpl flatbuffers::Push for RequestKind {\n\n type Output = RequestKind;\n\n #[inline]\n\n fn push(&self, dst: &mut [u8], _rest: &[u8]) {\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":63,"score":35095.82010161195},{"content":"#[repr(u16)]\n\n#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]\n\npub enum RequestKind {\n\n GameStatus = 0,\n\n StartGame = 1,\n\n GetAll = 2,\n\n SetInputAxis = 3,\n\n\n\n}\n\n\n\nconst ENUM_MIN_REQUEST_KIND: u16 = 0;\n\nconst ENUM_MAX_REQUEST_KIND: u16 = 3;\n\n\n\nimpl<'a> flatbuffers::Follow<'a> for RequestKind {\n\n type Inner = Self;\n\n #[inline]\n\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\n\n flatbuffers::read_scalar_at::<Self>(buf, loc)\n\n }\n\n}\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":64,"score":35094.94725763536},{"content":" pub fn init_from_table(table: flatbuffers::Table<'a>) -> Self {\n\n Requests {\n\n _tab: table,\n\n }\n\n }\n\n #[allow(unused_mut)]\n\n pub fn create<'bldr: 'args, 'args: 'mut_bldr, 'mut_bldr>(\n\n _fbb: &'mut_bldr mut flatbuffers::FlatBufferBuilder<'bldr>,\n\n args: &'args RequestsArgs<'args>) -> flatbuffers::WIPOffset<Requests<'bldr>> {\n\n let mut builder = RequestsBuilder::new(_fbb);\n\n if let Some(x) = args.v2_packages { builder.add_v2_packages(x); }\n\n if let Some(x) = args.empty_packages { builder.add_empty_packages(x); }\n\n builder.add_total_messages(args.total_messages);\n\n builder.finish()\n\n }\n\n\n\n pub const VT_TOTAL_MESSAGES: flatbuffers::VOffsetT = 4;\n\n pub const VT_EMPTY_PACKAGES: flatbuffers::VOffsetT = 6;\n\n pub const VT_V2_PACKAGES: flatbuffers::VOffsetT = 8;\n\n\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":65,"score":35094.75502066149},{"content":" #[inline]\n\n pub fn total_messages(&self) -> u32 {\n\n self._tab.get::<u32>(Requests::VT_TOTAL_MESSAGES, Some(0)).unwrap()\n\n }\n\n #[inline]\n\n pub fn empty_packages(&self) -> Option<&'a [EmptyPackage]> {\n\n self._tab.get::<flatbuffers::ForwardsUOffset<flatbuffers::Vector<EmptyPackage>>>(Requests::VT_EMPTY_PACKAGES, None).map(|v| v.safe_slice() )\n\n }\n\n #[inline]\n\n pub fn v2_packages(&self) -> Option<&'a [V2Package]> {\n\n self._tab.get::<flatbuffers::ForwardsUOffset<flatbuffers::Vector<V2Package>>>(Requests::VT_V2_PACKAGES, None).map(|v| v.safe_slice() )\n\n }\n\n}\n\n\n\npub struct RequestsArgs<'a> {\n\n pub total_messages: u32,\n\n pub empty_packages: Option<flatbuffers::WIPOffset<flatbuffers::Vector<'a , EmptyPackage>>>,\n\n pub v2_packages: Option<flatbuffers::WIPOffset<flatbuffers::Vector<'a , V2Package>>>,\n\n}\n\nimpl<'a> Default for RequestsArgs<'a> {\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":66,"score":35094.52689646119},{"content":" pub fn init_from_table(table: flatbuffers::Table<'a>) -> Self {\n\n StringPackage {\n\n _tab: table,\n\n }\n\n }\n\n #[allow(unused_mut)]\n\n pub fn create<'bldr: 'args, 'args: 'mut_bldr, 'mut_bldr>(\n\n _fbb: &'mut_bldr mut flatbuffers::FlatBufferBuilder<'bldr>,\n\n args: &'args StringPackageArgs<'args>) -> flatbuffers::WIPOffset<StringPackage<'bldr>> {\n\n let mut builder = StringPackageBuilder::new(_fbb);\n\n if let Some(x) = args.buffer { builder.add_buffer(x); }\n\n builder.add_ordering(args.ordering);\n\n builder.add_kind(args.kind);\n\n builder.finish()\n\n }\n\n\n\n pub const VT_KIND: flatbuffers::VOffsetT = 4;\n\n pub const VT_ORDERING: flatbuffers::VOffsetT = 6;\n\n pub const VT_BUFFER: flatbuffers::VOffsetT = 8;\n\n\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":67,"score":35094.00141163153},{"content":"// automatically generated by the FlatBuffers compiler, do not modify\n\n\n\n\n\n\n\nuse std::mem;\n\nuse std::cmp::Ordering;\n\n\n\nextern crate flatbuffers;\n\nuse self::flatbuffers::EndianScalar;\n\n\n\n#[allow(unused_imports, dead_code)]\n\npub mod ffi_requests {\n\n\n\n use std::mem;\n\n use std::cmp::Ordering;\n\n\n\n extern crate flatbuffers;\n\n use self::flatbuffers::EndianScalar;\n\n\n\n#[allow(non_camel_case_types)]\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":68,"score":35093.823654782194},{"content":" self.fbb_.push_slot_always::<flatbuffers::WIPOffset<_>>(Requests::VT_EMPTY_PACKAGES, empty_packages);\n\n }\n\n #[inline]\n\n pub fn add_v2_packages(&mut self, v2_packages: flatbuffers::WIPOffset<flatbuffers::Vector<'b , V2Package>>) {\n\n self.fbb_.push_slot_always::<flatbuffers::WIPOffset<_>>(Requests::VT_V2_PACKAGES, v2_packages);\n\n }\n\n #[inline]\n\n pub fn new(_fbb: &'b mut flatbuffers::FlatBufferBuilder<'a>) -> RequestsBuilder<'a, 'b> {\n\n let start = _fbb.start_table();\n\n RequestsBuilder {\n\n fbb_: _fbb,\n\n start_: start,\n\n }\n\n }\n\n #[inline]\n\n pub fn finish(self) -> flatbuffers::WIPOffset<Requests<'a>> {\n\n let o = self.fbb_.end_table(self.start_);\n\n flatbuffers::WIPOffset::new(o.value())\n\n }\n\n}\n\n\n\n} // pub mod FfiRequests\n\n\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":69,"score":35092.85837642679},{"content":" ordering_: _ordering.to_little_endian(),\n\n x_: _x.to_little_endian(),\n\n y_: _y.to_little_endian(),\n\n\n\n padding0__: 0,\n\n }\n\n }\n\n pub fn kind<'a>(&'a self) -> RequestKind {\n\n self.kind_.from_little_endian()\n\n }\n\n pub fn ordering<'a>(&'a self) -> u32 {\n\n self.ordering_.from_little_endian()\n\n }\n\n pub fn x<'a>(&'a self) -> f32 {\n\n self.x_.from_little_endian()\n\n }\n\n pub fn y<'a>(&'a self) -> f32 {\n\n self.y_.from_little_endian()\n\n }\n\n}\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":70,"score":35092.02553884247},{"content":" type Inner = &'a V2Package;\n\n #[inline]\n\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\n\n <&'a V2Package>::follow(buf, loc)\n\n }\n\n}\n\nimpl<'a> flatbuffers::Follow<'a> for &'a V2Package {\n\n type Inner = &'a V2Package;\n\n #[inline]\n\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\n\n flatbuffers::follow_cast_ref::<V2Package>(buf, loc)\n\n }\n\n}\n\nimpl<'b> flatbuffers::Push for V2Package {\n\n type Output = V2Package;\n\n #[inline]\n\n fn push(&self, dst: &mut [u8], _rest: &[u8]) {\n\n let src = unsafe {\n\n ::std::slice::from_raw_parts(self as *const V2Package as *const u8, Self::size())\n\n };\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":71,"score":35089.72170000095},{"content":"\n\npub enum RequestsOffset {}\n\n#[derive(Copy, Clone, Debug, PartialEq)]\n\n\n\npub struct Requests<'a> {\n\n pub _tab: flatbuffers::Table<'a>,\n\n}\n\n\n\nimpl<'a> flatbuffers::Follow<'a> for Requests<'a> {\n\n type Inner = Requests<'a>;\n\n #[inline]\n\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\n\n Self {\n\n _tab: flatbuffers::Table { buf: buf, loc: loc },\n\n }\n\n }\n\n}\n\n\n\nimpl<'a> Requests<'a> {\n\n #[inline]\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":72,"score":35089.69373568154},{"content":" self.fbb_.push_slot::<u32>(StringPackage::VT_ORDERING, ordering, 0);\n\n }\n\n #[inline]\n\n pub fn add_buffer(&mut self, buffer: flatbuffers::WIPOffset<&'b str>) {\n\n self.fbb_.push_slot_always::<flatbuffers::WIPOffset<_>>(StringPackage::VT_BUFFER, buffer);\n\n }\n\n #[inline]\n\n pub fn new(_fbb: &'b mut flatbuffers::FlatBufferBuilder<'a>) -> StringPackageBuilder<'a, 'b> {\n\n let start = _fbb.start_table();\n\n StringPackageBuilder {\n\n fbb_: _fbb,\n\n start_: start,\n\n }\n\n }\n\n #[inline]\n\n pub fn finish(self) -> flatbuffers::WIPOffset<StringPackage<'a>> {\n\n let o = self.fbb_.end_table(self.start_);\n\n flatbuffers::WIPOffset::new(o.value())\n\n }\n\n}\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":73,"score":35089.24789624167},{"content":"\n\npub enum StringPackageOffset {}\n\n#[derive(Copy, Clone, Debug, PartialEq)]\n\n\n\npub struct StringPackage<'a> {\n\n pub _tab: flatbuffers::Table<'a>,\n\n}\n\n\n\nimpl<'a> flatbuffers::Follow<'a> for StringPackage<'a> {\n\n type Inner = StringPackage<'a>;\n\n #[inline]\n\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\n\n Self {\n\n _tab: flatbuffers::Table { buf: buf, loc: loc },\n\n }\n\n }\n\n}\n\n\n\nimpl<'a> StringPackage<'a> {\n\n #[inline]\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":74,"score":35089.12654285833},{"content":"}\n\nimpl<'a> flatbuffers::Follow<'a> for &'a EmptyPackage {\n\n type Inner = &'a EmptyPackage;\n\n #[inline]\n\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\n\n flatbuffers::follow_cast_ref::<EmptyPackage>(buf, loc)\n\n }\n\n}\n\nimpl<'b> flatbuffers::Push for EmptyPackage {\n\n type Output = EmptyPackage;\n\n #[inline]\n\n fn push(&self, dst: &mut [u8], _rest: &[u8]) {\n\n let src = unsafe {\n\n ::std::slice::from_raw_parts(self as *const EmptyPackage as *const u8, Self::size())\n\n };\n\n dst.copy_from_slice(src);\n\n }\n\n}\n\nimpl<'b> flatbuffers::Push for &'b EmptyPackage {\n\n type Output = EmptyPackage;\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":75,"score":35088.6812615257},{"content":" flatbuffers::emplace_scalar::<RequestKind>(dst, *self);\n\n }\n\n}\n\n\n\n#[allow(non_camel_case_types)]\n\nconst ENUM_VALUES_REQUEST_KIND:[RequestKind; 4] = [\n\n RequestKind::GameStatus,\n\n RequestKind::StartGame,\n\n RequestKind::GetAll,\n\n RequestKind::SetInputAxis\n\n];\n\n\n\n#[allow(non_camel_case_types)]\n\nconst ENUM_NAMES_REQUEST_KIND:[&'static str; 4] = [\n\n \"GameStatus\",\n\n \"StartGame\",\n\n \"GetAll\",\n\n \"SetInputAxis\"\n\n];\n\n\n","file_path":"rust/game/src/schemas/requests_generated.rs","rank":76,"score":35088.515835323306},{"content":"#[repr(u16)]\n\n#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]\n\npub enum PackageKind {\n\n Request = 0,\n\n Response = 1,\n\n\n\n}\n\n\n\nconst ENUM_MIN_PACKAGE_KIND: u16 = 0;\n\nconst ENUM_MAX_PACKAGE_KIND: u16 = 1;\n\n\n\nimpl<'a> flatbuffers::Follow<'a> for PackageKind {\n\n type Inner = Self;\n\n #[inline]\n\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\n\n flatbuffers::read_scalar_at::<Self>(buf, loc)\n\n }\n\n}\n\n\n\nimpl flatbuffers::EndianScalar for PackageKind {\n","file_path":"rust/game/src/schemas/packages_generated.rs","rank":77,"score":34939.15094552958},{"content":" #[inline]\n\n fn to_little_endian(self) -> Self {\n\n let n = u16::to_le(self as u16);\n\n let p = &n as *const u16 as *const PackageKind;\n\n unsafe { *p }\n\n }\n\n #[inline]\n\n fn from_little_endian(self) -> Self {\n\n let n = u16::from_le(self as u16);\n\n let p = &n as *const u16 as *const PackageKind;\n\n unsafe { *p }\n\n }\n\n}\n\n\n\nimpl flatbuffers::Push for PackageKind {\n\n type Output = PackageKind;\n\n #[inline]\n\n fn push(&self, dst: &mut [u8], _rest: &[u8]) {\n\n flatbuffers::emplace_scalar::<PackageKind>(dst, *self);\n\n }\n","file_path":"rust/game/src/schemas/packages_generated.rs","rank":78,"score":34937.09298221613},{"content":"// automatically generated by the FlatBuffers compiler, do not modify\n\n\n\n\n\n\n\nuse std::mem;\n\nuse std::cmp::Ordering;\n\n\n\nextern crate flatbuffers;\n\nuse self::flatbuffers::EndianScalar;\n\n\n\n#[allow(unused_imports, dead_code)]\n\npub mod ffi_packages {\n\n\n\n use std::mem;\n\n use std::cmp::Ordering;\n\n\n\n extern crate flatbuffers;\n\n use self::flatbuffers::EndianScalar;\n\n\n\n#[allow(non_camel_case_types)]\n","file_path":"rust/game/src/schemas/packages_generated.rs","rank":79,"score":34935.15400911133},{"content":"}\n\n\n\n#[allow(non_camel_case_types)]\n\nconst ENUM_VALUES_PACKAGE_KIND:[PackageKind; 2] = [\n\n PackageKind::Request,\n\n PackageKind::Response\n\n];\n\n\n\n#[allow(non_camel_case_types)]\n\nconst ENUM_NAMES_PACKAGE_KIND:[&'static str; 2] = [\n\n \"Request\",\n\n \"Response\"\n\n];\n\n\n","file_path":"rust/game/src/schemas/packages_generated.rs","rank":80,"score":34934.30335381882},{"content":"#[derive(Debug)]\n\nenum RunMode {\n\n Embedded { game: Game },\n\n Server { client: Client },\n\n}\n\n\n\n#[derive(Debug)]\n\npub struct FfiContext {\n\n mode: RunMode,\n\n}\n\n\n\nimpl<'a> FfiContext {\n\n pub fn new(address: Option<&str>) -> Self {\n\n let mode = match address {\n\n Some(address) => {\n\n // TODO: should not throw errors here\n\n let client = Client::new(address);\n\n RunMode::Server { client }\n\n }\n\n None => RunMode::Embedded { game: Game::new() },\n\n };\n","file_path":"rust/ffi/src/ffi/mod.rs","rank":81,"score":34274.80289391954},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiResponses\n\n{\n\n\n\npublic enum ResponseKind : ushort\n\n{\n\n GameStarted = 0,\n\n GameStatusIdle = 1,\n\n GameStatusRunning = 2,\n\n FullStateResponse = 3,\n\n CreateObj = 4,\n\n MoveObj = 5,\n\n InvalidRequest = 6,\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/ResponseKind.cs","rank":82,"score":33392.39779630207},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiResponses\n\n{\n\n\n\npublic enum PrefabKind : ushort\n\n{\n\n Player = 0,\n\n Monster = 1,\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/PrefabKind.cs","rank":83,"score":33389.929647574034},{"content":" public float X { get { return __p.bb.GetFloat(__p.bb_pos + 12); } }\n\n public float Y { get { return __p.bb.GetFloat(__p.bb_pos + 16); } }\n\n\n\n public static Offset<FfiResponses.PosPackage> CreatePosPackage(FlatBufferBuilder builder, FfiResponses.ResponseKind Kind, uint Ordering, uint Id, float X, float Y) {\n\n builder.Prep(4, 20);\n\n builder.PutFloat(Y);\n\n builder.PutFloat(X);\n\n builder.PutUint(Id);\n\n builder.PutUint(Ordering);\n\n builder.Pad(2);\n\n builder.PutUshort((ushort)Kind);\n\n return new Offset<FfiResponses.PosPackage>(builder.Offset);\n\n }\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/PosPackage.cs","rank":84,"score":32940.83791046629},{"content":" public FfiResponses.PrefabKind Prefab { get { return (FfiResponses.PrefabKind)__p.bb.GetUshort(__p.bb_pos + 12); } }\n\n public float X { get { return __p.bb.GetFloat(__p.bb_pos + 16); } }\n\n public float Y { get { return __p.bb.GetFloat(__p.bb_pos + 20); } }\n\n\n\n public static Offset<FfiResponses.CreatePackage> CreateCreatePackage(FlatBufferBuilder builder, FfiResponses.ResponseKind Kind, uint Ordering, uint Id, FfiResponses.PrefabKind Prefab, float X, float Y) {\n\n builder.Prep(4, 24);\n\n builder.PutFloat(Y);\n\n builder.PutFloat(X);\n\n builder.Pad(2);\n\n builder.PutUshort((ushort)Prefab);\n\n builder.PutUint(Id);\n\n builder.PutUint(Ordering);\n\n builder.Pad(2);\n\n builder.PutUshort((ushort)Kind);\n\n return new Offset<FfiResponses.CreatePackage>(builder.Offset);\n\n }\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/CreatePackage.cs","rank":85,"score":32939.85494798735},{"content":" public float Y { get { return __p.bb.GetFloat(__p.bb_pos + 12); } }\n\n\n\n public static Offset<FfiResponses.V2Package> CreateV2Package(FlatBufferBuilder builder, FfiResponses.ResponseKind Kind, uint Ordering, float X, float Y) {\n\n builder.Prep(4, 16);\n\n builder.PutFloat(Y);\n\n builder.PutFloat(X);\n\n builder.PutUint(Ordering);\n\n builder.Pad(2);\n\n builder.PutUshort((ushort)Kind);\n\n return new Offset<FfiResponses.V2Package>(builder.Offset);\n\n }\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/V2Package.cs","rank":86,"score":32938.08355810393},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiResponses\n\n{\n\n\n\nusing global::System;\n\nusing global::FlatBuffers;\n\n\n\npublic struct V2Package : IFlatbufferObject\n\n{\n\n private Struct __p;\n\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\n\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\n\n public V2Package __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\n\n\n\n public FfiResponses.ResponseKind Kind { get { return (FfiResponses.ResponseKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\n\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\n\n public float X { get { return __p.bb.GetFloat(__p.bb_pos + 8); } }\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/V2Package.cs","rank":87,"score":32937.2290919761},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiResponses\n\n{\n\n\n\nusing global::System;\n\nusing global::FlatBuffers;\n\n\n\npublic struct CreatePackage : IFlatbufferObject\n\n{\n\n private Struct __p;\n\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\n\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\n\n public CreatePackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\n\n\n\n public FfiResponses.ResponseKind Kind { get { return (FfiResponses.ResponseKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\n\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\n\n public uint Id { get { return __p.bb.GetUint(__p.bb_pos + 8); } }\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/CreatePackage.cs","rank":88,"score":32937.19944663026},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiResponses\n\n{\n\n\n\nusing global::System;\n\nusing global::FlatBuffers;\n\n\n\npublic struct PosPackage : IFlatbufferObject\n\n{\n\n private Struct __p;\n\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\n\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\n\n public PosPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\n\n\n\n public FfiResponses.ResponseKind Kind { get { return (FfiResponses.ResponseKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\n\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\n\n public uint Id { get { return __p.bb.GetUint(__p.bb_pos + 8); } }\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/PosPackage.cs","rank":89,"score":32937.19944663026},{"content":" public static Offset<FfiResponses.EmptyPackage> CreateEmptyPackage(FlatBufferBuilder builder, FfiResponses.ResponseKind Kind, uint Ordering) {\n\n builder.Prep(4, 8);\n\n builder.PutUint(Ordering);\n\n builder.Pad(2);\n\n builder.PutUshort((ushort)Kind);\n\n return new Offset<FfiResponses.EmptyPackage>(builder.Offset);\n\n }\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/EmptyPackage.cs","rank":90,"score":32935.859201637504},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiResponses\n\n{\n\n\n\nusing global::System;\n\nusing global::FlatBuffers;\n\n\n\npublic struct EmptyPackage : IFlatbufferObject\n\n{\n\n private Struct __p;\n\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\n\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\n\n public EmptyPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\n\n\n\n public FfiResponses.ResponseKind Kind { get { return (FfiResponses.ResponseKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\n\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\n\n\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/EmptyPackage.cs","rank":91,"score":32935.66358132974},{"content":" public FfiResponses.ResponseKind Kind { get { int o = __p.__offset(4); return o != 0 ? (FfiResponses.ResponseKind)__p.bb.GetUshort(o + __p.bb_pos) : FfiResponses.ResponseKind.GameStarted; } }\n\n public uint Ordering { get { int o = __p.__offset(6); return o != 0 ? __p.bb.GetUint(o + __p.bb_pos) : (uint)0; } }\n\n public string Buffer { get { int o = __p.__offset(8); return o != 0 ? __p.__string(o + __p.bb_pos) : null; } }\n\n#if ENABLE_SPAN_T\n\n public Span<byte> GetBufferBytes() { return __p.__vector_as_span<byte>(8, 1); }\n\n#else\n\n public ArraySegment<byte>? GetBufferBytes() { return __p.__vector_as_arraysegment(8); }\n\n#endif\n\n public byte[] GetBufferArray() { return __p.__vector_as_array<byte>(8); }\n\n\n\n public static Offset<FfiResponses.StringPackage> CreateStringPackage(FlatBufferBuilder builder,\n\n FfiResponses.ResponseKind kind = FfiResponses.ResponseKind.GameStarted,\n\n uint ordering = 0,\n\n StringOffset bufferOffset = default(StringOffset)) {\n\n builder.StartTable(3);\n\n StringPackage.AddBuffer(builder, bufferOffset);\n\n StringPackage.AddOrdering(builder, ordering);\n\n StringPackage.AddKind(builder, kind);\n\n return StringPackage.EndStringPackage(builder);\n\n }\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/StringPackage.cs","rank":92,"score":32935.52495913092},{"content":" public FfiResponses.ResponseKind Kind { get { int o = __p.__offset(4); return o != 0 ? (FfiResponses.ResponseKind)__p.bb.GetUshort(o + __p.bb_pos) : FfiResponses.ResponseKind.GameStarted; } }\n\n public uint Ordering { get { int o = __p.__offset(6); return o != 0 ? __p.bb.GetUint(o + __p.bb_pos) : (uint)0; } }\n\n public sbyte Buffer(int j) { int o = __p.__offset(8); return o != 0 ? __p.bb.GetSbyte(__p.__vector(o) + j * 1) : (sbyte)0; }\n\n public int BufferLength { get { int o = __p.__offset(8); return o != 0 ? __p.__vector_len(o) : 0; } }\n\n#if ENABLE_SPAN_T\n\n public Span<sbyte> GetBufferBytes() { return __p.__vector_as_span<sbyte>(8, 1); }\n\n#else\n\n public ArraySegment<byte>? GetBufferBytes() { return __p.__vector_as_arraysegment(8); }\n\n#endif\n\n public sbyte[] GetBufferArray() { return __p.__vector_as_array<sbyte>(8); }\n\n\n\n public static Offset<FfiResponses.BytesPackage> CreateBytesPackage(FlatBufferBuilder builder,\n\n FfiResponses.ResponseKind kind = FfiResponses.ResponseKind.GameStarted,\n\n uint ordering = 0,\n\n VectorOffset bufferOffset = default(VectorOffset)) {\n\n builder.StartTable(3);\n\n BytesPackage.AddBuffer(builder, bufferOffset);\n\n BytesPackage.AddOrdering(builder, ordering);\n\n BytesPackage.AddKind(builder, kind);\n\n return BytesPackage.EndBytesPackage(builder);\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/BytesPackage.cs","rank":93,"score":32935.29820189554},{"content":"\n\n public static void StartStringPackage(FlatBufferBuilder builder) { builder.StartTable(3); }\n\n public static void AddKind(FlatBufferBuilder builder, FfiResponses.ResponseKind kind) { builder.AddUshort(0, (ushort)kind, 0); }\n\n public static void AddOrdering(FlatBufferBuilder builder, uint ordering) { builder.AddUint(1, ordering, 0); }\n\n public static void AddBuffer(FlatBufferBuilder builder, StringOffset bufferOffset) { builder.AddOffset(2, bufferOffset.Value, 0); }\n\n public static Offset<FfiResponses.StringPackage> EndStringPackage(FlatBufferBuilder builder) {\n\n int o = builder.EndTable();\n\n return new Offset<FfiResponses.StringPackage>(o);\n\n }\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/StringPackage.cs","rank":94,"score":32934.89275667841},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiResponses\n\n{\n\n\n\nusing global::System;\n\nusing global::FlatBuffers;\n\n\n\npublic struct StringPackage : IFlatbufferObject\n\n{\n\n private Table __p;\n\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\n\n public static void ValidateVersion() { FlatBufferConstants.FLATBUFFERS_1_11_1(); }\n\n public static StringPackage GetRootAsStringPackage(ByteBuffer _bb) { return GetRootAsStringPackage(_bb, new StringPackage()); }\n\n public static StringPackage GetRootAsStringPackage(ByteBuffer _bb, StringPackage obj) { return (obj.__assign(_bb.GetInt(_bb.Position) + _bb.Position, _bb)); }\n\n public void __init(int _i, ByteBuffer _bb) { __p = new Table(_i, _bb); }\n\n public StringPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\n\n\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/StringPackage.cs","rank":95,"score":32934.459439830585},{"content":"// <auto-generated>\n\n// automatically generated by the FlatBuffers compiler, do not modify\n\n// </auto-generated>\n\n\n\nnamespace FfiResponses\n\n{\n\n\n\nusing global::System;\n\nusing global::FlatBuffers;\n\n\n\npublic struct BytesPackage : IFlatbufferObject\n\n{\n\n private Table __p;\n\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\n\n public static void ValidateVersion() { FlatBufferConstants.FLATBUFFERS_1_11_1(); }\n\n public static BytesPackage GetRootAsBytesPackage(ByteBuffer _bb) { return GetRootAsBytesPackage(_bb, new BytesPackage()); }\n\n public static BytesPackage GetRootAsBytesPackage(ByteBuffer _bb, BytesPackage obj) { return (obj.__assign(_bb.GetInt(_bb.Position) + _bb.Position, _bb)); }\n\n public void __init(int _i, ByteBuffer _bb) { __p = new Table(_i, _bb); }\n\n public BytesPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\n\n\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/BytesPackage.cs","rank":96,"score":32934.459439830585},{"content":" }\n\n\n\n public static void StartBytesPackage(FlatBufferBuilder builder) { builder.StartTable(3); }\n\n public static void AddKind(FlatBufferBuilder builder, FfiResponses.ResponseKind kind) { builder.AddUshort(0, (ushort)kind, 0); }\n\n public static void AddOrdering(FlatBufferBuilder builder, uint ordering) { builder.AddUint(1, ordering, 0); }\n\n public static void AddBuffer(FlatBufferBuilder builder, VectorOffset bufferOffset) { builder.AddOffset(2, bufferOffset.Value, 0); }\n\n public static VectorOffset CreateBufferVector(FlatBufferBuilder builder, sbyte[] data) { builder.StartVector(1, data.Length, 1); for (int i = data.Length - 1; i >= 0; i--) builder.AddSbyte(data[i]); return builder.EndVector(); }\n\n public static VectorOffset CreateBufferVectorBlock(FlatBufferBuilder builder, sbyte[] data) { builder.StartVector(1, data.Length, 1); builder.Add(data); return builder.EndVector(); }\n\n public static void StartBufferVector(FlatBufferBuilder builder, int numElems) { builder.StartVector(1, numElems, 1); }\n\n public static Offset<FfiResponses.BytesPackage> EndBytesPackage(FlatBufferBuilder builder) {\n\n int o = builder.EndTable();\n\n return new Offset<FfiResponses.BytesPackage>(o);\n\n }\n\n};\n\n\n\n\n\n}\n","file_path":"unity3d/Assets/src/Domain/FfiResponses/BytesPackage.cs","rank":97,"score":32932.70171991856}],"string":"[\n {\n \"content\": \"pub fn enum_name_package_kind(e: PackageKind) -> &'static str {\\n\\n let index = e as u16;\\n\\n ENUM_NAMES_PACKAGE_KIND[index as usize]\\n\\n}\\n\\n\\n\\n} // pub mod FfiPackages\\n\\n\\n\",\n \"file_path\": \"rust/game/src/schemas/packages_generated.rs\",\n \"rank\": 1,\n \"score\": 163941.63861508263\n },\n {\n \"content\": \"pub fn enum_name_request_kind(e: RequestKind) -> &'static str {\\n\\n let index = e as u16;\\n\\n ENUM_NAMES_REQUEST_KIND[index as usize]\\n\\n}\\n\\n\\n\\n// struct EmptyPackage, aligned to 4\\n\\n#[repr(C, align(4))]\\n\\n#[derive(Clone, Copy, Debug, PartialEq)]\\n\\npub struct EmptyPackage {\\n\\n kind_: RequestKind,\\n\\n padding0__: u16,\\n\\n ordering_: u32,\\n\\n} // pub struct EmptyPackage\\n\\nimpl flatbuffers::SafeSliceAccess for EmptyPackage {}\\n\\nimpl<'a> flatbuffers::Follow<'a> for EmptyPackage {\\n\\n type Inner = &'a EmptyPackage;\\n\\n #[inline]\\n\\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\\n\\n <&'a EmptyPackage>::follow(buf, loc)\\n\\n }\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 2,\n \"score\": 152919.33198183024\n },\n {\n \"content\": \"/// Parse a network compact format into a game event\\n\\npub fn parse(package: Package) -> GameEvent {\\n\\n unimplemented!()\\n\\n}\",\n \"file_path\": \"rust/game/src/packages/package_serialization.rs\",\n \"rank\": 3,\n \"score\": 124837.53468320234\n },\n {\n \"content\": \"/// Serialize a game event to be transfer in network compact format\\n\\npub fn serialize(e: GameEvent) -> Package {\\n\\n unimplemented!()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/game/src/packages/package_serialization.rs\",\n \"rank\": 4,\n \"score\": 123954.36781722636\n },\n {\n \"content\": \"pub fn to_cstr(value: &str) -> *mut c_char {\\n\\n CString::new(value).unwrap().into_raw()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/ffi/src/ffi/ffi_utils.rs\",\n \"rank\": 5,\n \"score\": 117322.43628223336\n },\n {\n \"content\": \"pub fn enum_name_response_kind(e: ResponseKind) -> &'static str {\\n\\n let index = e as u16;\\n\\n ENUM_NAMES_RESPONSE_KIND[index as usize]\\n\\n}\\n\\n\\n\\n#[allow(non_camel_case_types)]\\n\\n#[repr(u16)]\\n\\n#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]\\n\\npub enum PrefabKind {\\n\\n Player = 0,\\n\\n Monster = 1,\\n\\n\\n\\n}\\n\\n\\n\\nconst ENUM_MIN_PREFAB_KIND: u16 = 0;\\n\\nconst ENUM_MAX_PREFAB_KIND: u16 = 1;\\n\\n\\n\\nimpl<'a> flatbuffers::Follow<'a> for PrefabKind {\\n\\n type Inner = Self;\\n\\n #[inline]\\n\",\n \"file_path\": \"rust/game/src/schemas/responses_generated.rs\",\n \"rank\": 6,\n \"score\": 109765.53355969212\n },\n {\n \"content\": \"pub fn enum_name_prefab_kind(e: PrefabKind) -> &'static str {\\n\\n let index = e as u16;\\n\\n ENUM_NAMES_PREFAB_KIND[index as usize]\\n\\n}\\n\\n\\n\\n// struct EmptyPackage, aligned to 4\\n\\n#[repr(C, align(4))]\\n\\n#[derive(Clone, Copy, Debug, PartialEq)]\\n\\npub struct EmptyPackage {\\n\\n kind_: ResponseKind,\\n\\n padding0__: u16,\\n\\n ordering_: u32,\\n\\n} // pub struct EmptyPackage\\n\\nimpl flatbuffers::SafeSliceAccess for EmptyPackage {}\\n\\nimpl<'a> flatbuffers::Follow<'a> for EmptyPackage {\\n\\n type Inner = &'a EmptyPackage;\\n\\n #[inline]\\n\\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\\n\\n <&'a EmptyPackage>::follow(buf, loc)\\n\\n }\\n\",\n \"file_path\": \"rust/game/src/schemas/responses_generated.rs\",\n \"rank\": 7,\n \"score\": 109765.53355969212\n },\n {\n \"content\": \"pub trait Server {\\n\\n fn run(&mut self) -> ServerChanges;\\n\\n fn output(&mut self, connection_id: ConnectionId, msg: RawMsgBuffer);\\n\\n fn disconnect(&mut self, connection_id: ConnectionId);\\n\\n}\\n\",\n \"file_path\": \"rust/server/src/server/mod.rs\",\n \"rank\": 9,\n \"score\": 81513.1432681536\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiRequests\\n\\n{\\n\\n\\n\\npublic enum RequestKind : ushort\\n\\n{\\n\\n GameStatus = 0,\\n\\n StartGame = 1,\\n\\n GetAll = 2,\\n\\n SetInputAxis = 3,\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiRequests/RequestKind.cs\",\n \"rank\": 10,\n \"score\": 76076.36074986146\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiPackages\\n\\n{\\n\\n\\n\\npublic enum PackageKind : ushort\\n\\n{\\n\\n Request = 0,\\n\\n Response = 1,\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiPackages/PackageKind.cs\",\n \"rank\": 11,\n \"score\": 75887.23186513952\n },\n {\n \"content\": \"pub fn from_cstr(ptr: *const c_char) -> String {\\n\\n let c_str = unsafe {\\n\\n assert!(!ptr.is_null());\\n\\n CStr::from_ptr(ptr)\\n\\n };\\n\\n\\n\\n c_str.to_str().unwrap().to_string()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/ffi/src/ffi/ffi_utils.rs\",\n \"rank\": 12,\n \"score\": 75865.36003698647\n },\n {\n \"content\": \"#[test]\\n\\nfn test_flatbuffer_non_root_element() {\\n\\n let bytes: [u8; 2] = [0, 0];\\n\\n let kind = flatbuffers::follow_cast_ref::<ResponseKind>(&bytes, 0);\\n\\n assert_eq!(*kind, ResponseKind::GameStarted);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/ffi/tests/serialization_tests.rs\",\n \"rank\": 13,\n \"score\": 74518.39637520509\n },\n {\n \"content\": \"pub mod package_buffer;\\n\\npub mod package_serialization;\",\n \"file_path\": \"rust/game/src/packages/mod.rs\",\n \"rank\": 14,\n \"score\": 72429.62635820305\n },\n {\n \"content\": \"pub fn to_slice<'a, T>(buffer: *const T, length: u32) -> &'a [T] {\\n\\n unsafe { std::slice::from_raw_parts(buffer, length as usize) }\\n\\n}\\n\",\n \"file_path\": \"rust/ffi/src/ffi/ffi_utils.rs\",\n \"rank\": 15,\n \"score\": 67190.45485962286\n },\n {\n \"content\": \"\\n\\n public static Offset<FfiResponses.IdPackage> CreateIdPackage(FlatBufferBuilder builder, FfiResponses.ResponseKind Kind, uint Ordering, uint Id) {\\n\\n builder.Prep(4, 12);\\n\\n builder.PutUint(Id);\\n\\n builder.PutUint(Ordering);\\n\\n builder.Pad(2);\\n\\n builder.PutUshort((ushort)Kind);\\n\\n return new Offset<FfiResponses.IdPackage>(builder.Offset);\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/IdPackage.cs\",\n \"rank\": 16,\n \"score\": 66416.48877202293\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiResponses\\n\\n{\\n\\n\\n\\nusing global::System;\\n\\nusing global::FlatBuffers;\\n\\n\\n\\npublic struct IdPackage : IFlatbufferObject\\n\\n{\\n\\n private Struct __p;\\n\\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\\n\\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\\n\\n public IdPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\\n\\n\\n\\n public FfiResponses.ResponseKind Kind { get { return (FfiResponses.ResponseKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\\n\\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\\n\\n public uint Id { get { return __p.bb.GetUint(__p.bb_pos + 8); } }\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/IdPackage.cs\",\n \"rank\": 17,\n \"score\": 66415.04464750536\n },\n {\n \"content\": \" public float Y { get { return __p.bb.GetFloat(__p.bb_pos + 12); } }\\n\\n\\n\\n public static Offset<FfiRequests.V2Package> CreateV2Package(FlatBufferBuilder builder, FfiRequests.RequestKind Kind, uint Ordering, float X, float Y) {\\n\\n builder.Prep(4, 16);\\n\\n builder.PutFloat(Y);\\n\\n builder.PutFloat(X);\\n\\n builder.PutUint(Ordering);\\n\\n builder.Pad(2);\\n\\n builder.PutUshort((ushort)Kind);\\n\\n return new Offset<FfiRequests.V2Package>(builder.Offset);\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiRequests/V2Package.cs\",\n \"rank\": 18,\n \"score\": 66015.63161542267\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiRequests\\n\\n{\\n\\n\\n\\nusing global::System;\\n\\nusing global::FlatBuffers;\\n\\n\\n\\npublic struct V2Package : IFlatbufferObject\\n\\n{\\n\\n private Struct __p;\\n\\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\\n\\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\\n\\n public V2Package __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\\n\\n\\n\\n public FfiRequests.RequestKind Kind { get { return (FfiRequests.RequestKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\\n\\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\\n\\n public float X { get { return __p.bb.GetFloat(__p.bb_pos + 8); } }\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiRequests/V2Package.cs\",\n \"rank\": 19,\n \"score\": 66014.77622053897\n },\n {\n \"content\": \" public static Offset<FfiRequests.EmptyPackage> CreateEmptyPackage(FlatBufferBuilder builder, FfiRequests.RequestKind Kind, uint Ordering) {\\n\\n builder.Prep(4, 8);\\n\\n builder.PutUint(Ordering);\\n\\n builder.Pad(2);\\n\\n builder.PutUshort((ushort)Kind);\\n\\n return new Offset<FfiRequests.EmptyPackage>(builder.Offset);\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiRequests/EmptyPackage.cs\",\n \"rank\": 20,\n \"score\": 66013.74708031293\n },\n {\n \"content\": \" public FfiRequests.RequestKind Kind { get { int o = __p.__offset(4); return o != 0 ? (FfiRequests.RequestKind)__p.bb.GetUshort(o + __p.bb_pos) : FfiRequests.RequestKind.GameStatus; } }\\n\\n public uint Ordering { get { int o = __p.__offset(6); return o != 0 ? __p.bb.GetUint(o + __p.bb_pos) : (uint)0; } }\\n\\n public string Buffer { get { int o = __p.__offset(8); return o != 0 ? __p.__string(o + __p.bb_pos) : null; } }\\n\\n#if ENABLE_SPAN_T\\n\\n public Span<byte> GetBufferBytes() { return __p.__vector_as_span<byte>(8, 1); }\\n\\n#else\\n\\n public ArraySegment<byte>? GetBufferBytes() { return __p.__vector_as_arraysegment(8); }\\n\\n#endif\\n\\n public byte[] GetBufferArray() { return __p.__vector_as_array<byte>(8); }\\n\\n\\n\\n public static Offset<FfiRequests.StringPackage> CreateStringPackage(FlatBufferBuilder builder,\\n\\n FfiRequests.RequestKind kind = FfiRequests.RequestKind.GameStatus,\\n\\n uint ordering = 0,\\n\\n StringOffset bufferOffset = default(StringOffset)) {\\n\\n builder.StartTable(3);\\n\\n StringPackage.AddBuffer(builder, bufferOffset);\\n\\n StringPackage.AddOrdering(builder, ordering);\\n\\n StringPackage.AddKind(builder, kind);\\n\\n return StringPackage.EndStringPackage(builder);\\n\\n }\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiRequests/StringPackage.cs\",\n \"rank\": 21,\n \"score\": 66013.47012008145\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiRequests\\n\\n{\\n\\n\\n\\nusing global::System;\\n\\nusing global::FlatBuffers;\\n\\n\\n\\npublic struct EmptyPackage : IFlatbufferObject\\n\\n{\\n\\n private Struct __p;\\n\\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\\n\\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\\n\\n public EmptyPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\\n\\n\\n\\n public FfiRequests.RequestKind Kind { get { return (FfiRequests.RequestKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\\n\\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\\n\\n\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiRequests/EmptyPackage.cs\",\n \"rank\": 22,\n \"score\": 66013.31383442078\n },\n {\n \"content\": \"\\n\\n public static void StartStringPackage(FlatBufferBuilder builder) { builder.StartTable(3); }\\n\\n public static void AddKind(FlatBufferBuilder builder, FfiRequests.RequestKind kind) { builder.AddUshort(0, (ushort)kind, 0); }\\n\\n public static void AddOrdering(FlatBufferBuilder builder, uint ordering) { builder.AddUint(1, ordering, 0); }\\n\\n public static void AddBuffer(FlatBufferBuilder builder, StringOffset bufferOffset) { builder.AddOffset(2, bufferOffset.Value, 0); }\\n\\n public static Offset<FfiRequests.StringPackage> EndStringPackage(FlatBufferBuilder builder) {\\n\\n int o = builder.EndTable();\\n\\n return new Offset<FfiRequests.StringPackage>(o);\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiRequests/StringPackage.cs\",\n \"rank\": 23,\n \"score\": 66012.09369218833\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiRequests\\n\\n{\\n\\n\\n\\nusing global::System;\\n\\nusing global::FlatBuffers;\\n\\n\\n\\npublic struct StringPackage : IFlatbufferObject\\n\\n{\\n\\n private Table __p;\\n\\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\\n\\n public static void ValidateVersion() { FlatBufferConstants.FLATBUFFERS_1_11_1(); }\\n\\n public static StringPackage GetRootAsStringPackage(ByteBuffer _bb) { return GetRootAsStringPackage(_bb, new StringPackage()); }\\n\\n public static StringPackage GetRootAsStringPackage(ByteBuffer _bb, StringPackage obj) { return (obj.__assign(_bb.GetInt(_bb.Position) + _bb.Position, _bb)); }\\n\\n public void __init(int _i, ByteBuffer _bb) { __p = new Table(_i, _bb); }\\n\\n public StringPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\\n\\n\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiRequests/StringPackage.cs\",\n \"rank\": 24,\n \"score\": 66009.52686480348\n },\n {\n \"content\": \"fn main() {\\n\\n env_logger::init();\\n\\n compile_dotnet();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/ffi-flap/build.rs\",\n \"rank\": 25,\n \"score\": 47748.9102518749\n },\n {\n \"content\": \"fn main() {\\n\\n let port = 3333;\\n\\n let mut server = server::server_socket::SocketServer::new(port);\\n\\n let mut tick: u64 = 0;\\n\\n let mut game = Game::new();\\n\\n let mut users = HashMap::new();\\n\\n\\n\\n loop {\\n\\n let changes = server.run();\\n\\n\\n\\n for connection_id in changes.connects {\\n\\n println!(\\\"{:?} connects\\\", connection_id);\\n\\n let user_id = game.connect();\\n\\n users.insert(connection_id, user_id);\\n\\n }\\n\\n\\n\\n for connection_id in changes.disconnects {\\n\\n println!(\\\"{:?} disconnects\\\", connection_id);\\n\\n users.remove(&connection_id);\\n\\n }\\n\",\n \"file_path\": \"rust/server/src/main.rs\",\n \"rank\": 26,\n \"score\": 47748.9102518749\n },\n {\n \"content\": \"fn compile_dotnet() {\\n\\n fn flapigen_expand(from: &Path, out: &Path) {\\n\\n println!(\\\"Run flapigen_expand\\\");\\n\\n let config = DotNetConfig::new(\\\"ffi_domain_2\\\".to_owned(), \\\"generated_dotnet\\\".into());\\n\\n let mut swig_gen = flapigen::Generator::new(LanguageConfig::DotNetConfig(config));\\n\\n swig_gen = swig_gen.rustfmt_bindings(true);\\n\\n swig_gen.expand(\\\"ffi_domain_2\\\", from, out);\\n\\n }\\n\\n\\n\\n let now = Instant::now();\\n\\n\\n\\n let out_dir = env::var(\\\"OUT_DIR\\\").unwrap();\\n\\n flapigen_expand(\\n\\n Path::new(\\\"src/glue.rs.in\\\"),\\n\\n &Path::new(&out_dir).join(\\\"glue.rs\\\"),\\n\\n );\\n\\n let expand_time = now.elapsed();\\n\\n println!(\\n\\n \\\"flapigen expand time: {}\\\",\\n\\n expand_time.as_secs() as f64 + (expand_time.subsec_nanos() as f64) / 1_000_000_000.\\n\\n );\\n\\n println!(\\\"cargo:rerun-if-changed=src/glue.rs.in\\\");\\n\\n println!(\\\"cargo:rerun-if-changed=src/lib.rs\\\");\\n\\n println!(\\\"cargo:rerun-if-changed=build.rs\\\");\\n\\n}\\n\",\n \"file_path\": \"rust/ffi-flap/build.rs\",\n \"rank\": 27,\n \"score\": 46647.41313701664\n },\n {\n \"content\": \"fn main() {\\n\\n let mut ffi_context = FfiContext::new(Some(\\\"localhost:3333\\\"));\\n\\n\\n\\n loop {\\n\\n match ffi_context.take() {\\n\\n Ok(Some((kind, bytes))) => {\\n\\n let bytes_b64 = base64::encode(bytes);\\n\\n println!(\\\"receive {:?}: {:?}\\\", kind, bytes_b64);\\n\\n }\\n\\n\\n\\n Ok(None) => {\\n\\n println!(\\\"receive none\\\");\\n\\n }\\n\\n\\n\\n Err(e) => {\\n\\n eprintln!(\\\"receive error {:?}\\\", e);\\n\\n }\\n\\n }\\n\\n\\n\\n std::thread::sleep(Duration::from_millis(90));\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"rust/ffi/examples/ffi_context_connect_test.rs\",\n \"rank\": 28,\n \"score\": 44633.00047228331\n },\n {\n \"content\": \"use std::env::current_exe;\\n\\n\\n\\n/// Kind and the bytes that represent a single message\\n\\npub type Package = (u16, Vec<u8>);\\n\\n/// Bytes that represent one. multiples or partial messages\\n\\npub type RawBytes = Vec<u8>;\\n\\n\\n\\n/// This class buffer incoming RawBytes and chunk into Package\\n\\n#[derive(Debug)]\\n\\npub struct PackageBuffer {\\n\\n kind: Option<u16>,\\n\\n size: Option<usize>,\\n\\n buffer: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl PackageBuffer {\\n\\n pub fn new() -> Self {\\n\\n PackageBuffer {\\n\\n kind: None,\\n\\n size: None,\\n\",\n \"file_path\": \"rust/game/src/packages/package_buffer.rs\",\n \"rank\": 29,\n \"score\": 44146.06713978771\n },\n {\n \"content\": \"\\n\\n pub fn encode_len(len: usize) -> RawBytes {\\n\\n (len as u32).to_be_bytes().to_vec()\\n\\n }\\n\\n\\n\\n pub fn encode_kind(kind: u16) -> RawBytes {\\n\\n kind.to_be_bytes().to_vec()\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n use rand::rngs::StdRng;\\n\\n use rand::{Rng, SeedableRng};\\n\\n\\n\\n #[test]\\n\\n fn test_protocol() {\\n\\n let mut package_buffer = PackageBuffer::new();\\n\\n\\n\",\n \"file_path\": \"rust/game/src/packages/package_buffer.rs\",\n \"rank\": 30,\n \"score\": 44142.86132795151\n },\n {\n \"content\": \" }\\n\\n\\n\\n fn get_frame(&mut self) -> Option<Package> {\\n\\n let kind = match self.kind {\\n\\n None if self.buffer.len() >= 2 => {\\n\\n let bytes = [self.buffer[0], self.buffer[1]];\\n\\n\\n\\n self.buffer.drain(0..2);\\n\\n\\n\\n let kind = u16::from_be_bytes(bytes);\\n\\n\\n\\n self.kind = Some(kind);\\n\\n kind\\n\\n }\\n\\n None => return None,\\n\\n Some(kind) => kind,\\n\\n };\\n\\n\\n\\n let size = match self.size {\\n\\n None if self.buffer.len() >= 4 => {\\n\",\n \"file_path\": \"rust/game/src/packages/package_buffer.rs\",\n \"rank\": 31,\n \"score\": 44136.78158048089\n },\n {\n \"content\": \" buffer: vec![],\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn push(&mut self, bytes: RawBytes) -> Vec<Package> {\\n\\n // println!(\\\"push {:?}\\\", bytes);\\n\\n self.buffer.extend(bytes);\\n\\n // println!(\\\"self {:?}\\\", self);\\n\\n self.get_frame_to_buffer(vec![])\\n\\n }\\n\\n\\n\\n fn get_frame_to_buffer(&mut self, mut buffer: Vec<Package>) -> Vec<Package> {\\n\\n match self.get_frame() {\\n\\n Some(frame) => {\\n\\n buffer.push(frame);\\n\\n self.get_frame_to_buffer(buffer)\\n\\n }\\n\\n\\n\\n None => buffer,\\n\\n }\\n\",\n \"file_path\": \"rust/game/src/packages/package_buffer.rs\",\n \"rank\": 32,\n \"score\": 44135.13654274512\n },\n {\n \"content\": \" // println!(\\\"check buffer {:?}/{:?}\\\", self.buffer.len(), size);\\n\\n\\n\\n if self.buffer.len() >= size {\\n\\n let bytes = self.buffer[0..size].to_vec();\\n\\n self.buffer.drain(0..size);\\n\\n self.kind = None;\\n\\n self.size = None;\\n\\n Some((kind, bytes))\\n\\n } else {\\n\\n return None;\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn pack((kind, frame): Package) -> RawBytes {\\n\\n let mut raw_bytes = vec![];\\n\\n raw_bytes.extend(PackageBuffer::encode_kind(kind));\\n\\n raw_bytes.extend(PackageBuffer::encode_len(frame.len()));\\n\\n raw_bytes.extend(frame);\\n\\n raw_bytes\\n\\n }\\n\",\n \"file_path\": \"rust/game/src/packages/package_buffer.rs\",\n \"rank\": 33,\n \"score\": 44134.44820615755\n },\n {\n \"content\": \" value if value.len() == 1 => {\\n\\n let messages = msg_1.to_vec();\\n\\n assert_eq!(value[0].0, 38);\\n\\n assert_eq!(value[0].1, messages);\\n\\n }\\n\\n other => {\\n\\n panic!(\\\"unexpected result {:?}\\\", other);\\n\\n }\\n\\n }\\n\\n\\n\\n let msg_2_kind_len_plus_msg: [u8; 10] = [0, 3, 0, 0, 0, 4, 9, 8, 7, 6];\\n\\n\\n\\n match package_buffer.push(msg_2_kind_len_plus_msg.to_vec()) {\\n\\n value if value.len() == 1 => {\\n\\n assert_eq!(value[0].0, 3);\\n\\n assert_eq!(value[0].1, vec![9, 8, 7, 6]);\\n\\n }\\n\\n other => {\\n\\n panic!(\\\"unexpected result {:?}\\\", other);\\n\\n }\\n\",\n \"file_path\": \"rust/game/src/packages/package_buffer.rs\",\n \"rank\": 34,\n \"score\": 44130.93643155433\n },\n {\n \"content\": \" let msg_1: [u8; 16] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15];\\n\\n let msg_1_kind_bytes = PackageBuffer::encode_kind(38);\\n\\n let msg_1_len_bytes = PackageBuffer::encode_len(msg_1.len());\\n\\n\\n\\n assert!(package_buffer\\n\\n .push(msg_1_kind_bytes[0..1].to_vec())\\n\\n .is_empty());\\n\\n assert!(package_buffer\\n\\n .push(msg_1_kind_bytes[1..2].to_vec())\\n\\n .is_empty());\\n\\n assert!(package_buffer\\n\\n .push(msg_1_len_bytes[0..1].to_vec())\\n\\n .is_empty());\\n\\n assert!(package_buffer\\n\\n .push(msg_1_len_bytes[1..4].to_vec())\\n\\n .is_empty());\\n\\n assert!(package_buffer.push(msg_1[0..9].to_vec()).is_empty());\\n\\n assert!(package_buffer.push(msg_1[9..13].to_vec()).is_empty());\\n\\n\\n\\n match package_buffer.push(msg_1[13..].to_vec()) {\\n\",\n \"file_path\": \"rust/game/src/packages/package_buffer.rs\",\n \"rank\": 35,\n \"score\": 44130.42862388772\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n #[test]\\n\\n fn test_protocol_upload() {\\n\\n let mut pack_buffer = PackageBuffer::new();\\n\\n\\n\\n let mut buffer = vec![];\\n\\n\\n\\n let expected_frames = vec![\\n\\n (32, vec![0, 1, 2, 3]),\\n\\n (32, vec![4, 5, 6]),\\n\\n (32, vec![7, 8, 9, 10, 11]),\\n\\n (32, vec![12]),\\n\\n ];\\n\\n\\n\\n for frame in &expected_frames {\\n\\n buffer.extend(PackageBuffer::pack(frame.clone()));\\n\\n }\\n\\n\\n\",\n \"file_path\": \"rust/game/src/packages/package_buffer.rs\",\n \"rank\": 36,\n \"score\": 44127.07307989335\n },\n {\n \"content\": \"use crate::GameEvent;\\n\\nuse crate::packages::package_buffer::Package;\\n\\n\\n\\n/// Serialize a game event to be transfer in network compact format\\n\",\n \"file_path\": \"rust/game/src/packages/package_serialization.rs\",\n \"rank\": 37,\n \"score\": 44121.988179877095\n },\n {\n \"content\": \" let mut rng = rand::thread_rng();\\n\\n let mut current = 0;\\n\\n let mut frames = vec![];\\n\\n\\n\\n while current < buffer.len() {\\n\\n let next = (current + rng.gen_range(1, buffer.len())).min(buffer.len());\\n\\n let bytes = buffer[current..next].to_vec();\\n\\n current = next;\\n\\n frames.extend(pack_buffer.push(bytes));\\n\\n }\\n\\n\\n\\n assert_eq!(frames, expected_frames);\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"rust/game/src/packages/package_buffer.rs\",\n \"rank\": 38,\n \"score\": 44121.95531935203\n },\n {\n \"content\": \" let bytes = [\\n\\n self.buffer[0],\\n\\n self.buffer[1],\\n\\n self.buffer[2],\\n\\n self.buffer[3],\\n\\n ];\\n\\n\\n\\n self.buffer.drain(0..4);\\n\\n\\n\\n let size = u32::from_be_bytes(bytes) as usize;\\n\\n\\n\\n // println!(\\\"set size {:?}\\\", size);\\n\\n\\n\\n self.size = Some(size);\\n\\n size\\n\\n }\\n\\n None => return None,\\n\\n Some(size) => size,\\n\\n };\\n\\n\\n\",\n \"file_path\": \"rust/game/src/packages/package_buffer.rs\",\n \"rank\": 39,\n \"score\": 44121.58659484597\n },\n {\n \"content\": \"#[test]\\n\\nfn test_flatbuffer_schema_serialization() {\\n\\n let bytes = {\\n\\n let mut bd = FlatBufferBuilder::new();\\n\\n\\n\\n let v = bd.create_vector(&[PosPackage::new(ResponseKind::MoveObj, 0, 1, 0.2, 3.0)]);\\n\\n\\n\\n let package = Responses::create(\\n\\n &mut bd,\\n\\n &ResponsesArgs {\\n\\n total_messages: 1,\\n\\n empty_packages: None,\\n\\n create_packages: None,\\n\\n pos_packages: Some(v),\\n\\n string_packages: None,\\n\\n },\\n\\n );\\n\\n\\n\\n bd.finish_minimal(package);\\n\\n bd.finished_data().to_vec()\\n\\n };\\n\",\n \"file_path\": \"rust/ffi/tests/serialization_tests.rs\",\n \"rank\": 40,\n \"score\": 43709.62146658143\n },\n {\n \"content\": \" public uint TotalMessages { get { int o = __p.__offset(4); return o != 0 ? __p.bb.GetUint(o + __p.bb_pos) : (uint)0; } }\\n\\n public FfiRequests.EmptyPackage? EmptyPackages(int j) { int o = __p.__offset(6); return o != 0 ? (FfiRequests.EmptyPackage?)(new FfiRequests.EmptyPackage()).__assign(__p.__vector(o) + j * 8, __p.bb) : null; }\\n\\n public int EmptyPackagesLength { get { int o = __p.__offset(6); return o != 0 ? __p.__vector_len(o) : 0; } }\\n\\n public FfiRequests.V2Package? V2Packages(int j) { int o = __p.__offset(8); return o != 0 ? (FfiRequests.V2Package?)(new FfiRequests.V2Package()).__assign(__p.__vector(o) + j * 16, __p.bb) : null; }\\n\\n public int V2PackagesLength { get { int o = __p.__offset(8); return o != 0 ? __p.__vector_len(o) : 0; } }\\n\\n\\n\\n public static Offset<FfiRequests.Requests> CreateRequests(FlatBufferBuilder builder,\\n\\n uint total_messages = 0,\\n\\n VectorOffset empty_packagesOffset = default(VectorOffset),\\n\\n VectorOffset v2_packagesOffset = default(VectorOffset)) {\\n\\n builder.StartTable(3);\\n\\n Requests.AddV2Packages(builder, v2_packagesOffset);\\n\\n Requests.AddEmptyPackages(builder, empty_packagesOffset);\\n\\n Requests.AddTotalMessages(builder, total_messages);\\n\\n return Requests.EndRequests(builder);\\n\\n }\\n\\n\\n\\n public static void StartRequests(FlatBufferBuilder builder) { builder.StartTable(3); }\\n\\n public static void AddTotalMessages(FlatBufferBuilder builder, uint totalMessages) { builder.AddUint(0, totalMessages, 0); }\\n\\n public static void AddEmptyPackages(FlatBufferBuilder builder, VectorOffset emptyPackagesOffset) { builder.AddOffset(1, emptyPackagesOffset.Value, 0); }\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiRequests/Requests.cs\",\n \"rank\": 41,\n \"score\": 43496.28986246056\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiRequests\\n\\n{\\n\\n\\n\\nusing global::System;\\n\\nusing global::FlatBuffers;\\n\\n\\n\\npublic struct Requests : IFlatbufferObject\\n\\n{\\n\\n private Table __p;\\n\\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\\n\\n public static void ValidateVersion() { FlatBufferConstants.FLATBUFFERS_1_11_1(); }\\n\\n public static Requests GetRootAsRequests(ByteBuffer _bb) { return GetRootAsRequests(_bb, new Requests()); }\\n\\n public static Requests GetRootAsRequests(ByteBuffer _bb, Requests obj) { return (obj.__assign(_bb.GetInt(_bb.Position) + _bb.Position, _bb)); }\\n\\n public void __init(int _i, ByteBuffer _bb) { __p = new Table(_i, _bb); }\\n\\n public Requests __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\\n\\n\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiRequests/Requests.cs\",\n \"rank\": 42,\n \"score\": 43494.315151355615\n },\n {\n \"content\": \" public static void StartEmptyPackagesVector(FlatBufferBuilder builder, int numElems) { builder.StartVector(8, numElems, 4); }\\n\\n public static void AddV2Packages(FlatBufferBuilder builder, VectorOffset v2PackagesOffset) { builder.AddOffset(2, v2PackagesOffset.Value, 0); }\\n\\n public static void StartV2PackagesVector(FlatBufferBuilder builder, int numElems) { builder.StartVector(16, numElems, 4); }\\n\\n public static Offset<FfiRequests.Requests> EndRequests(FlatBufferBuilder builder) {\\n\\n int o = builder.EndTable();\\n\\n return new Offset<FfiRequests.Requests>(o);\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiRequests/Requests.cs\",\n \"rank\": 43,\n \"score\": 43491.55375281253\n },\n {\n \"content\": \"\\n\\n FfiContext { mode }\\n\\n }\\n\\n\\n\\n pub fn push(&mut self, package_kind: PackageKind, bytes: &RawMsg) -> Result<()> {\\n\\n match &mut self.mode {\\n\\n RunMode::Embedded { game } => {\\n\\n let requests = game::schemas::parse_game_requests(package_kind, bytes)?;\\n\\n debug!(\\\"ffi receive requests: {:?}\\\", requests);\\n\\n game.handle_requests(requests)\\n\\n }\\n\\n\\n\\n RunMode::Server { client } => Err(Error::Unknown(\\\"Not implemented\\\".to_string())),\\n\\n }\\n\\n }\\n\\n\\n\\n // TODO: receive a closure?\\n\\n pub fn take(&mut self) -> Result<Option<(PackageKind, RawMsgBuffer)>> {\\n\\n match &mut self.mode {\\n\\n RunMode::Embedded { game } => {\\n\",\n \"file_path\": \"rust/ffi/src/ffi/mod.rs\",\n \"rank\": 44,\n \"score\": 36442.02922156021\n },\n {\n \"content\": \"pub mod ffi_utils;\\n\\n\\n\\nuse crate::client::Client;\\n\\nuse crate::game::GameEvent::CreateObj;\\n\\nuse crate::game::{Game, GameEvent, Result, UserId};\\n\\nuse flatbuffers::FlatBufferBuilder;\\n\\nuse game::packages::package_buffer::Package;\\n\\nuse game::schemas::{ffi_requests, ffi_responses, PackageKind, RawMsg, RawMsgBuffer};\\n\\nuse game::Error;\\n\\n\\n\\n#[derive(Debug)]\\n\",\n \"file_path\": \"rust/ffi/src/ffi/mod.rs\",\n \"rank\": 45,\n \"score\": 36437.29486541909\n },\n {\n \"content\": \"\\n\\n pub fn take(&mut self) -> Option<Vec<u8>> {\\n\\n if self.input_buffer.is_empty() {\\n\\n None\\n\\n } else {\\n\\n Some(std::mem::replace(&mut self.input_buffer, Vec::new()))\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn close(&mut self) -> std::io::Result<()> {\\n\\n self.stream.shutdown(Shutdown::Both)\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/game/src/client/mod.rs\",\n \"rank\": 46,\n \"score\": 36436.43870525202\n },\n {\n \"content\": \"\\n\\n Ok(())\\n\\n }\\n\\n\\n\\n pub fn take_responses(&mut self) -> Result<Option<(u16, RawMsgBuffer)>> {\\n\\n self.check_connection()?;\\n\\n\\n\\n match &mut self.state {\\n\\n State::Connected {\\n\\n buffer,\\n\\n socket,\\n\\n queue,\\n\\n } => match socket.tick() {\\n\\n Ok(()) => {\\n\\n if let Some(vec) = socket.take() {\\n\\n let packages = buffer.push(vec);\\n\\n queue.extend(packages);\\n\\n }\\n\\n\\n\\n if queue.is_empty() {\\n\",\n \"file_path\": \"rust/ffi/src/client/mod.rs\",\n \"rank\": 47,\n \"score\": 36434.56916896375\n },\n {\n \"content\": \" let mut buffer = Vec::with_capacity(1024);\\n\\n for _ in 0..1024 {\\n\\n buffer.push(0);\\n\\n }\\n\\n\\n\\n Ok(SocketClient {\\n\\n stream,\\n\\n output_buffer: vec![],\\n\\n input_buffer: vec![],\\n\\n tmp_input_buffer: buffer,\\n\\n })\\n\\n }\\n\\n\\n\\n pub fn push(&mut self, bytes: Vec<u8>) {\\n\\n self.output_buffer.extend(bytes);\\n\\n }\\n\\n\\n\\n /// returns ErrorKind::BrokenPipe if connection fail\\n\\n pub fn tick(&mut self) -> std::io::Result<()> {\\n\\n if !self.output_buffer.is_empty() {\\n\",\n \"file_path\": \"rust/game/src/client/mod.rs\",\n \"rank\": 48,\n \"score\": 36434.27664643963\n },\n {\n \"content\": \"use std::net::{TcpStream, Shutdown};\\n\\nuse std::io::{Write, Read, Error, ErrorKind};\\n\\n\\n\\n/// Read and write from a socket in non blocking mode with buffers\\n\\n#[derive(Debug)]\\n\\npub struct SocketClient {\\n\\n stream: TcpStream,\\n\\n /// bytes to be send\\n\\n output_buffer: Vec<u8>,\\n\\n /// bytes to be taken\\n\\n input_buffer: Vec<u8>,\\n\\n /// buffer to read bytes\\n\\n tmp_input_buffer: Vec<u8>,\\n\\n}\\n\\n\\n\\nimpl SocketClient {\\n\\n pub fn connect(address: &str) -> std::io::Result<Self> {\\n\\n let mut stream = TcpStream::connect(address)?;\\n\\n stream.set_nonblocking(true)?;\\n\\n\\n\",\n \"file_path\": \"rust/game/src/client/mod.rs\",\n \"rank\": 49,\n \"score\": 36434.22560726563\n },\n {\n \"content\": \"use game::schemas::RawMsgBuffer;\\n\\n\\n\\npub mod server_socket;\\n\\n\\n\\npub type ConnectionId = u32;\\n\\n\\n\\n/// From the server to the connection\\n\\n#[derive(Debug, Clone)]\\n\\npub struct ServerOutput {\\n\\n pub connection_id: ConnectionId,\\n\\n pub msg: RawMsgBuffer,\\n\\n}\\n\\n\\n\\n/// From the connection into the server\\n\\n#[derive(Debug, Clone)]\\n\\npub struct ServerInput {\\n\\n pub connection_id: ConnectionId,\\n\\n pub msg: RawMsgBuffer,\\n\\n}\\n\\n\\n\\n#[derive(Debug, Clone)]\\n\\npub struct ServerChanges {\\n\\n pub connects: Vec<ConnectionId>,\\n\\n pub disconnects: Vec<ConnectionId>,\\n\\n pub inputs: Vec<ServerInput>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"rust/server/src/server/mod.rs\",\n \"rank\": 50,\n \"score\": 36431.886835153535\n },\n {\n \"content\": \" }\\n\\n }\\n\\n\\n\\n fn check_connection(&mut self) -> Result<()> {\\n\\n match self.state {\\n\\n State::NotConnected => {\\n\\n // println!(\\\"connecting\\\");\\n\\n // TODO: this looks bad, what if connection hangout?\\n\\n let socket = SocketClient::connect(&self.address)?;\\n\\n\\n\\n self.state = State::Connected {\\n\\n buffer: PackageBuffer::new(),\\n\\n socket,\\n\\n queue: vec![],\\n\\n };\\n\\n\\n\\n // println!(\\\"connected\\\");\\n\\n }\\n\\n _ => {}\\n\\n }\\n\",\n \"file_path\": \"rust/ffi/src/client/mod.rs\",\n \"rank\": 51,\n \"score\": 36429.06663106404\n },\n {\n \"content\": \"use game::client::SocketClient;\\n\\nuse game::packages::package_buffer::PackageBuffer;\\n\\nuse game::{schemas::RawMsgBuffer, Error, Result};\\n\\nuse logs::*;\\n\\nuse std::io::ErrorKind;\\n\\n\\n\\n#[derive(Debug)]\\n\",\n \"file_path\": \"rust/ffi/src/client/mod.rs\",\n \"rank\": 52,\n \"score\": 36428.388477906155\n },\n {\n \"content\": \" let size = self.stream.write(&self.output_buffer)?;\\n\\n self.output_buffer.drain(0..size);\\n\\n self.stream.flush()?;\\n\\n }\\n\\n\\n\\n match self.stream.read(&mut self.tmp_input_buffer) {\\n\\n Ok(size) if size == 0 => {\\n\\n // println!(\\\"empty response!\\\");\\n\\n // Ok(())\\n\\n Err(Error::from(ErrorKind::BrokenPipe))\\n\\n },\\n\\n Ok(size) => {\\n\\n self.input_buffer.extend_from_slice(&self.tmp_input_buffer[0..size]);\\n\\n Ok(())\\n\\n },\\n\\n Err(ref err) if err.kind() == std::io::ErrorKind::WouldBlock => Ok(()),\\n\\n Err(e) =>\\n\\n Err(e),\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"rust/game/src/client/mod.rs\",\n \"rank\": 53,\n \"score\": 36422.74029125544\n },\n {\n \"content\": \" Ok(None)\\n\\n } else {\\n\\n Ok(Some(queue.remove(0)))\\n\\n }\\n\\n }\\n\\n\\n\\n Err(e) if e.kind() == std::io::ErrorKind::BrokenPipe => {\\n\\n info!(\\\"switching to not connected\\\");\\n\\n self.state = State::NotConnected;\\n\\n Err(Error::Disconnect)\\n\\n }\\n\\n\\n\\n Err(e) => Err(e.into()),\\n\\n },\\n\\n State::NotConnected => {\\n\\n // TODO: should we do something?\\n\\n Err(Error::Disconnect)\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"rust/ffi/src/client/mod.rs\",\n \"rank\": 54,\n \"score\": 36420.94202763655\n },\n {\n \"content\": \" let game_responses = game.take()?;\\n\\n debug!(\\\"ffi returning responses: {:?}\\\", game_responses);\\n\\n game::schemas::serialize_game_events(game_responses).map(Option::from)\\n\\n }\\n\\n\\n\\n RunMode::Server { client } => client.take_responses(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod test {\\n\\n use super::*;\\n\\n}\\n\",\n \"file_path\": \"rust/ffi/src/ffi/mod.rs\",\n \"rank\": 55,\n \"score\": 36420.01239743199\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum State {\\n\\n NotConnected,\\n\\n Connected {\\n\\n buffer: PackageBuffer,\\n\\n socket: SocketClient,\\n\\n queue: Vec<(u16, RawMsgBuffer)>,\\n\\n },\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct Client {\\n\\n address: String,\\n\\n state: State,\\n\\n}\\n\\n\\n\\nimpl Client {\\n\\n pub fn new(address: &str) -> Self {\\n\\n Client {\\n\\n address: address.to_string(),\\n\\n state: State::NotConnected,\\n\",\n \"file_path\": \"rust/ffi/src/client/mod.rs\",\n \"rank\": 56,\n \"score\": 35311.995307442034\n },\n {\n \"content\": \" #[inline]\\n\\n fn default() -> Self {\\n\\n StringPackageArgs {\\n\\n kind: RequestKind::GameStatus,\\n\\n ordering: 0,\\n\\n buffer: None,\\n\\n }\\n\\n }\\n\\n}\\n\\npub struct StringPackageBuilder<'a: 'b, 'b> {\\n\\n fbb_: &'b mut flatbuffers::FlatBufferBuilder<'a>,\\n\\n start_: flatbuffers::WIPOffset<flatbuffers::TableUnfinishedWIPOffset>,\\n\\n}\\n\\nimpl<'a: 'b, 'b> StringPackageBuilder<'a, 'b> {\\n\\n #[inline]\\n\\n pub fn add_kind(&mut self, kind: RequestKind) {\\n\\n self.fbb_.push_slot::<RequestKind>(StringPackage::VT_KIND, kind, RequestKind::GameStatus);\\n\\n }\\n\\n #[inline]\\n\\n pub fn add_ordering(&mut self, ordering: u32) {\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 57,\n \"score\": 35101.73074803082\n },\n {\n \"content\": \"\\n\\n #[inline]\\n\\n fn push(&self, dst: &mut [u8], _rest: &[u8]) {\\n\\n let src = unsafe {\\n\\n ::std::slice::from_raw_parts(*self as *const EmptyPackage as *const u8, Self::size())\\n\\n };\\n\\n dst.copy_from_slice(src);\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\nimpl EmptyPackage {\\n\\n pub fn new<'a>(_kind: RequestKind, _ordering: u32) -> Self {\\n\\n EmptyPackage {\\n\\n kind_: _kind.to_little_endian(),\\n\\n ordering_: _ordering.to_little_endian(),\\n\\n\\n\\n padding0__: 0,\\n\\n }\\n\\n }\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 58,\n \"score\": 35100.01205688346\n },\n {\n \"content\": \" #[inline]\\n\\n fn default() -> Self {\\n\\n RequestsArgs {\\n\\n total_messages: 0,\\n\\n empty_packages: None,\\n\\n v2_packages: None,\\n\\n }\\n\\n }\\n\\n}\\n\\npub struct RequestsBuilder<'a: 'b, 'b> {\\n\\n fbb_: &'b mut flatbuffers::FlatBufferBuilder<'a>,\\n\\n start_: flatbuffers::WIPOffset<flatbuffers::TableUnfinishedWIPOffset>,\\n\\n}\\n\\nimpl<'a: 'b, 'b> RequestsBuilder<'a, 'b> {\\n\\n #[inline]\\n\\n pub fn add_total_messages(&mut self, total_messages: u32) {\\n\\n self.fbb_.push_slot::<u32>(Requests::VT_TOTAL_MESSAGES, total_messages, 0);\\n\\n }\\n\\n #[inline]\\n\\n pub fn add_empty_packages(&mut self, empty_packages: flatbuffers::WIPOffset<flatbuffers::Vector<'b , EmptyPackage>>) {\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 59,\n \"score\": 35098.6494809947\n },\n {\n \"content\": \" #[inline]\\n\\n pub fn kind(&self) -> RequestKind {\\n\\n self._tab.get::<RequestKind>(StringPackage::VT_KIND, Some(RequestKind::GameStatus)).unwrap()\\n\\n }\\n\\n #[inline]\\n\\n pub fn ordering(&self) -> u32 {\\n\\n self._tab.get::<u32>(StringPackage::VT_ORDERING, Some(0)).unwrap()\\n\\n }\\n\\n #[inline]\\n\\n pub fn buffer(&self) -> Option<&'a str> {\\n\\n self._tab.get::<flatbuffers::ForwardsUOffset<&str>>(StringPackage::VT_BUFFER, None)\\n\\n }\\n\\n}\\n\\n\\n\\npub struct StringPackageArgs<'a> {\\n\\n pub kind: RequestKind,\\n\\n pub ordering: u32,\\n\\n pub buffer: Option<flatbuffers::WIPOffset<&'a str>>,\\n\\n}\\n\\nimpl<'a> Default for StringPackageArgs<'a> {\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 60,\n \"score\": 35098.611468318755\n },\n {\n \"content\": \" pub fn kind<'a>(&'a self) -> RequestKind {\\n\\n self.kind_.from_little_endian()\\n\\n }\\n\\n pub fn ordering<'a>(&'a self) -> u32 {\\n\\n self.ordering_.from_little_endian()\\n\\n }\\n\\n}\\n\\n\\n\\n// struct V2Package, aligned to 4\\n\\n#[repr(C, align(4))]\\n\\n#[derive(Clone, Copy, Debug, PartialEq)]\\n\\npub struct V2Package {\\n\\n kind_: RequestKind,\\n\\n padding0__: u16,\\n\\n ordering_: u32,\\n\\n x_: f32,\\n\\n y_: f32,\\n\\n} // pub struct V2Package\\n\\nimpl flatbuffers::SafeSliceAccess for V2Package {}\\n\\nimpl<'a> flatbuffers::Follow<'a> for V2Package {\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 61,\n \"score\": 35098.47346906887\n },\n {\n \"content\": \" dst.copy_from_slice(src);\\n\\n }\\n\\n}\\n\\nimpl<'b> flatbuffers::Push for &'b V2Package {\\n\\n type Output = V2Package;\\n\\n\\n\\n #[inline]\\n\\n fn push(&self, dst: &mut [u8], _rest: &[u8]) {\\n\\n let src = unsafe {\\n\\n ::std::slice::from_raw_parts(*self as *const V2Package as *const u8, Self::size())\\n\\n };\\n\\n dst.copy_from_slice(src);\\n\\n }\\n\\n}\\n\\n\\n\\n\\n\\nimpl V2Package {\\n\\n pub fn new<'a>(_kind: RequestKind, _ordering: u32, _x: f32, _y: f32) -> Self {\\n\\n V2Package {\\n\\n kind_: _kind.to_little_endian(),\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 62,\n \"score\": 35097.720167688654\n },\n {\n \"content\": \"\\n\\nimpl flatbuffers::EndianScalar for RequestKind {\\n\\n #[inline]\\n\\n fn to_little_endian(self) -> Self {\\n\\n let n = u16::to_le(self as u16);\\n\\n let p = &n as *const u16 as *const RequestKind;\\n\\n unsafe { *p }\\n\\n }\\n\\n #[inline]\\n\\n fn from_little_endian(self) -> Self {\\n\\n let n = u16::from_le(self as u16);\\n\\n let p = &n as *const u16 as *const RequestKind;\\n\\n unsafe { *p }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl flatbuffers::Push for RequestKind {\\n\\n type Output = RequestKind;\\n\\n #[inline]\\n\\n fn push(&self, dst: &mut [u8], _rest: &[u8]) {\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 63,\n \"score\": 35095.82010161195\n },\n {\n \"content\": \"#[repr(u16)]\\n\\n#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]\\n\\npub enum RequestKind {\\n\\n GameStatus = 0,\\n\\n StartGame = 1,\\n\\n GetAll = 2,\\n\\n SetInputAxis = 3,\\n\\n\\n\\n}\\n\\n\\n\\nconst ENUM_MIN_REQUEST_KIND: u16 = 0;\\n\\nconst ENUM_MAX_REQUEST_KIND: u16 = 3;\\n\\n\\n\\nimpl<'a> flatbuffers::Follow<'a> for RequestKind {\\n\\n type Inner = Self;\\n\\n #[inline]\\n\\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\\n\\n flatbuffers::read_scalar_at::<Self>(buf, loc)\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 64,\n \"score\": 35094.94725763536\n },\n {\n \"content\": \" pub fn init_from_table(table: flatbuffers::Table<'a>) -> Self {\\n\\n Requests {\\n\\n _tab: table,\\n\\n }\\n\\n }\\n\\n #[allow(unused_mut)]\\n\\n pub fn create<'bldr: 'args, 'args: 'mut_bldr, 'mut_bldr>(\\n\\n _fbb: &'mut_bldr mut flatbuffers::FlatBufferBuilder<'bldr>,\\n\\n args: &'args RequestsArgs<'args>) -> flatbuffers::WIPOffset<Requests<'bldr>> {\\n\\n let mut builder = RequestsBuilder::new(_fbb);\\n\\n if let Some(x) = args.v2_packages { builder.add_v2_packages(x); }\\n\\n if let Some(x) = args.empty_packages { builder.add_empty_packages(x); }\\n\\n builder.add_total_messages(args.total_messages);\\n\\n builder.finish()\\n\\n }\\n\\n\\n\\n pub const VT_TOTAL_MESSAGES: flatbuffers::VOffsetT = 4;\\n\\n pub const VT_EMPTY_PACKAGES: flatbuffers::VOffsetT = 6;\\n\\n pub const VT_V2_PACKAGES: flatbuffers::VOffsetT = 8;\\n\\n\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 65,\n \"score\": 35094.75502066149\n },\n {\n \"content\": \" #[inline]\\n\\n pub fn total_messages(&self) -> u32 {\\n\\n self._tab.get::<u32>(Requests::VT_TOTAL_MESSAGES, Some(0)).unwrap()\\n\\n }\\n\\n #[inline]\\n\\n pub fn empty_packages(&self) -> Option<&'a [EmptyPackage]> {\\n\\n self._tab.get::<flatbuffers::ForwardsUOffset<flatbuffers::Vector<EmptyPackage>>>(Requests::VT_EMPTY_PACKAGES, None).map(|v| v.safe_slice() )\\n\\n }\\n\\n #[inline]\\n\\n pub fn v2_packages(&self) -> Option<&'a [V2Package]> {\\n\\n self._tab.get::<flatbuffers::ForwardsUOffset<flatbuffers::Vector<V2Package>>>(Requests::VT_V2_PACKAGES, None).map(|v| v.safe_slice() )\\n\\n }\\n\\n}\\n\\n\\n\\npub struct RequestsArgs<'a> {\\n\\n pub total_messages: u32,\\n\\n pub empty_packages: Option<flatbuffers::WIPOffset<flatbuffers::Vector<'a , EmptyPackage>>>,\\n\\n pub v2_packages: Option<flatbuffers::WIPOffset<flatbuffers::Vector<'a , V2Package>>>,\\n\\n}\\n\\nimpl<'a> Default for RequestsArgs<'a> {\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 66,\n \"score\": 35094.52689646119\n },\n {\n \"content\": \" pub fn init_from_table(table: flatbuffers::Table<'a>) -> Self {\\n\\n StringPackage {\\n\\n _tab: table,\\n\\n }\\n\\n }\\n\\n #[allow(unused_mut)]\\n\\n pub fn create<'bldr: 'args, 'args: 'mut_bldr, 'mut_bldr>(\\n\\n _fbb: &'mut_bldr mut flatbuffers::FlatBufferBuilder<'bldr>,\\n\\n args: &'args StringPackageArgs<'args>) -> flatbuffers::WIPOffset<StringPackage<'bldr>> {\\n\\n let mut builder = StringPackageBuilder::new(_fbb);\\n\\n if let Some(x) = args.buffer { builder.add_buffer(x); }\\n\\n builder.add_ordering(args.ordering);\\n\\n builder.add_kind(args.kind);\\n\\n builder.finish()\\n\\n }\\n\\n\\n\\n pub const VT_KIND: flatbuffers::VOffsetT = 4;\\n\\n pub const VT_ORDERING: flatbuffers::VOffsetT = 6;\\n\\n pub const VT_BUFFER: flatbuffers::VOffsetT = 8;\\n\\n\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 67,\n \"score\": 35094.00141163153\n },\n {\n \"content\": \"// automatically generated by the FlatBuffers compiler, do not modify\\n\\n\\n\\n\\n\\n\\n\\nuse std::mem;\\n\\nuse std::cmp::Ordering;\\n\\n\\n\\nextern crate flatbuffers;\\n\\nuse self::flatbuffers::EndianScalar;\\n\\n\\n\\n#[allow(unused_imports, dead_code)]\\n\\npub mod ffi_requests {\\n\\n\\n\\n use std::mem;\\n\\n use std::cmp::Ordering;\\n\\n\\n\\n extern crate flatbuffers;\\n\\n use self::flatbuffers::EndianScalar;\\n\\n\\n\\n#[allow(non_camel_case_types)]\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 68,\n \"score\": 35093.823654782194\n },\n {\n \"content\": \" self.fbb_.push_slot_always::<flatbuffers::WIPOffset<_>>(Requests::VT_EMPTY_PACKAGES, empty_packages);\\n\\n }\\n\\n #[inline]\\n\\n pub fn add_v2_packages(&mut self, v2_packages: flatbuffers::WIPOffset<flatbuffers::Vector<'b , V2Package>>) {\\n\\n self.fbb_.push_slot_always::<flatbuffers::WIPOffset<_>>(Requests::VT_V2_PACKAGES, v2_packages);\\n\\n }\\n\\n #[inline]\\n\\n pub fn new(_fbb: &'b mut flatbuffers::FlatBufferBuilder<'a>) -> RequestsBuilder<'a, 'b> {\\n\\n let start = _fbb.start_table();\\n\\n RequestsBuilder {\\n\\n fbb_: _fbb,\\n\\n start_: start,\\n\\n }\\n\\n }\\n\\n #[inline]\\n\\n pub fn finish(self) -> flatbuffers::WIPOffset<Requests<'a>> {\\n\\n let o = self.fbb_.end_table(self.start_);\\n\\n flatbuffers::WIPOffset::new(o.value())\\n\\n }\\n\\n}\\n\\n\\n\\n} // pub mod FfiRequests\\n\\n\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 69,\n \"score\": 35092.85837642679\n },\n {\n \"content\": \" ordering_: _ordering.to_little_endian(),\\n\\n x_: _x.to_little_endian(),\\n\\n y_: _y.to_little_endian(),\\n\\n\\n\\n padding0__: 0,\\n\\n }\\n\\n }\\n\\n pub fn kind<'a>(&'a self) -> RequestKind {\\n\\n self.kind_.from_little_endian()\\n\\n }\\n\\n pub fn ordering<'a>(&'a self) -> u32 {\\n\\n self.ordering_.from_little_endian()\\n\\n }\\n\\n pub fn x<'a>(&'a self) -> f32 {\\n\\n self.x_.from_little_endian()\\n\\n }\\n\\n pub fn y<'a>(&'a self) -> f32 {\\n\\n self.y_.from_little_endian()\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 70,\n \"score\": 35092.02553884247\n },\n {\n \"content\": \" type Inner = &'a V2Package;\\n\\n #[inline]\\n\\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\\n\\n <&'a V2Package>::follow(buf, loc)\\n\\n }\\n\\n}\\n\\nimpl<'a> flatbuffers::Follow<'a> for &'a V2Package {\\n\\n type Inner = &'a V2Package;\\n\\n #[inline]\\n\\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\\n\\n flatbuffers::follow_cast_ref::<V2Package>(buf, loc)\\n\\n }\\n\\n}\\n\\nimpl<'b> flatbuffers::Push for V2Package {\\n\\n type Output = V2Package;\\n\\n #[inline]\\n\\n fn push(&self, dst: &mut [u8], _rest: &[u8]) {\\n\\n let src = unsafe {\\n\\n ::std::slice::from_raw_parts(self as *const V2Package as *const u8, Self::size())\\n\\n };\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 71,\n \"score\": 35089.72170000095\n },\n {\n \"content\": \"\\n\\npub enum RequestsOffset {}\\n\\n#[derive(Copy, Clone, Debug, PartialEq)]\\n\\n\\n\\npub struct Requests<'a> {\\n\\n pub _tab: flatbuffers::Table<'a>,\\n\\n}\\n\\n\\n\\nimpl<'a> flatbuffers::Follow<'a> for Requests<'a> {\\n\\n type Inner = Requests<'a>;\\n\\n #[inline]\\n\\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\\n\\n Self {\\n\\n _tab: flatbuffers::Table { buf: buf, loc: loc },\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> Requests<'a> {\\n\\n #[inline]\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 72,\n \"score\": 35089.69373568154\n },\n {\n \"content\": \" self.fbb_.push_slot::<u32>(StringPackage::VT_ORDERING, ordering, 0);\\n\\n }\\n\\n #[inline]\\n\\n pub fn add_buffer(&mut self, buffer: flatbuffers::WIPOffset<&'b str>) {\\n\\n self.fbb_.push_slot_always::<flatbuffers::WIPOffset<_>>(StringPackage::VT_BUFFER, buffer);\\n\\n }\\n\\n #[inline]\\n\\n pub fn new(_fbb: &'b mut flatbuffers::FlatBufferBuilder<'a>) -> StringPackageBuilder<'a, 'b> {\\n\\n let start = _fbb.start_table();\\n\\n StringPackageBuilder {\\n\\n fbb_: _fbb,\\n\\n start_: start,\\n\\n }\\n\\n }\\n\\n #[inline]\\n\\n pub fn finish(self) -> flatbuffers::WIPOffset<StringPackage<'a>> {\\n\\n let o = self.fbb_.end_table(self.start_);\\n\\n flatbuffers::WIPOffset::new(o.value())\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 73,\n \"score\": 35089.24789624167\n },\n {\n \"content\": \"\\n\\npub enum StringPackageOffset {}\\n\\n#[derive(Copy, Clone, Debug, PartialEq)]\\n\\n\\n\\npub struct StringPackage<'a> {\\n\\n pub _tab: flatbuffers::Table<'a>,\\n\\n}\\n\\n\\n\\nimpl<'a> flatbuffers::Follow<'a> for StringPackage<'a> {\\n\\n type Inner = StringPackage<'a>;\\n\\n #[inline]\\n\\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\\n\\n Self {\\n\\n _tab: flatbuffers::Table { buf: buf, loc: loc },\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl<'a> StringPackage<'a> {\\n\\n #[inline]\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 74,\n \"score\": 35089.12654285833\n },\n {\n \"content\": \"}\\n\\nimpl<'a> flatbuffers::Follow<'a> for &'a EmptyPackage {\\n\\n type Inner = &'a EmptyPackage;\\n\\n #[inline]\\n\\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\\n\\n flatbuffers::follow_cast_ref::<EmptyPackage>(buf, loc)\\n\\n }\\n\\n}\\n\\nimpl<'b> flatbuffers::Push for EmptyPackage {\\n\\n type Output = EmptyPackage;\\n\\n #[inline]\\n\\n fn push(&self, dst: &mut [u8], _rest: &[u8]) {\\n\\n let src = unsafe {\\n\\n ::std::slice::from_raw_parts(self as *const EmptyPackage as *const u8, Self::size())\\n\\n };\\n\\n dst.copy_from_slice(src);\\n\\n }\\n\\n}\\n\\nimpl<'b> flatbuffers::Push for &'b EmptyPackage {\\n\\n type Output = EmptyPackage;\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 75,\n \"score\": 35088.6812615257\n },\n {\n \"content\": \" flatbuffers::emplace_scalar::<RequestKind>(dst, *self);\\n\\n }\\n\\n}\\n\\n\\n\\n#[allow(non_camel_case_types)]\\n\\nconst ENUM_VALUES_REQUEST_KIND:[RequestKind; 4] = [\\n\\n RequestKind::GameStatus,\\n\\n RequestKind::StartGame,\\n\\n RequestKind::GetAll,\\n\\n RequestKind::SetInputAxis\\n\\n];\\n\\n\\n\\n#[allow(non_camel_case_types)]\\n\\nconst ENUM_NAMES_REQUEST_KIND:[&'static str; 4] = [\\n\\n \\\"GameStatus\\\",\\n\\n \\\"StartGame\\\",\\n\\n \\\"GetAll\\\",\\n\\n \\\"SetInputAxis\\\"\\n\\n];\\n\\n\\n\",\n \"file_path\": \"rust/game/src/schemas/requests_generated.rs\",\n \"rank\": 76,\n \"score\": 35088.515835323306\n },\n {\n \"content\": \"#[repr(u16)]\\n\\n#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]\\n\\npub enum PackageKind {\\n\\n Request = 0,\\n\\n Response = 1,\\n\\n\\n\\n}\\n\\n\\n\\nconst ENUM_MIN_PACKAGE_KIND: u16 = 0;\\n\\nconst ENUM_MAX_PACKAGE_KIND: u16 = 1;\\n\\n\\n\\nimpl<'a> flatbuffers::Follow<'a> for PackageKind {\\n\\n type Inner = Self;\\n\\n #[inline]\\n\\n fn follow(buf: &'a [u8], loc: usize) -> Self::Inner {\\n\\n flatbuffers::read_scalar_at::<Self>(buf, loc)\\n\\n }\\n\\n}\\n\\n\\n\\nimpl flatbuffers::EndianScalar for PackageKind {\\n\",\n \"file_path\": \"rust/game/src/schemas/packages_generated.rs\",\n \"rank\": 77,\n \"score\": 34939.15094552958\n },\n {\n \"content\": \" #[inline]\\n\\n fn to_little_endian(self) -> Self {\\n\\n let n = u16::to_le(self as u16);\\n\\n let p = &n as *const u16 as *const PackageKind;\\n\\n unsafe { *p }\\n\\n }\\n\\n #[inline]\\n\\n fn from_little_endian(self) -> Self {\\n\\n let n = u16::from_le(self as u16);\\n\\n let p = &n as *const u16 as *const PackageKind;\\n\\n unsafe { *p }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl flatbuffers::Push for PackageKind {\\n\\n type Output = PackageKind;\\n\\n #[inline]\\n\\n fn push(&self, dst: &mut [u8], _rest: &[u8]) {\\n\\n flatbuffers::emplace_scalar::<PackageKind>(dst, *self);\\n\\n }\\n\",\n \"file_path\": \"rust/game/src/schemas/packages_generated.rs\",\n \"rank\": 78,\n \"score\": 34937.09298221613\n },\n {\n \"content\": \"// automatically generated by the FlatBuffers compiler, do not modify\\n\\n\\n\\n\\n\\n\\n\\nuse std::mem;\\n\\nuse std::cmp::Ordering;\\n\\n\\n\\nextern crate flatbuffers;\\n\\nuse self::flatbuffers::EndianScalar;\\n\\n\\n\\n#[allow(unused_imports, dead_code)]\\n\\npub mod ffi_packages {\\n\\n\\n\\n use std::mem;\\n\\n use std::cmp::Ordering;\\n\\n\\n\\n extern crate flatbuffers;\\n\\n use self::flatbuffers::EndianScalar;\\n\\n\\n\\n#[allow(non_camel_case_types)]\\n\",\n \"file_path\": \"rust/game/src/schemas/packages_generated.rs\",\n \"rank\": 79,\n \"score\": 34935.15400911133\n },\n {\n \"content\": \"}\\n\\n\\n\\n#[allow(non_camel_case_types)]\\n\\nconst ENUM_VALUES_PACKAGE_KIND:[PackageKind; 2] = [\\n\\n PackageKind::Request,\\n\\n PackageKind::Response\\n\\n];\\n\\n\\n\\n#[allow(non_camel_case_types)]\\n\\nconst ENUM_NAMES_PACKAGE_KIND:[&'static str; 2] = [\\n\\n \\\"Request\\\",\\n\\n \\\"Response\\\"\\n\\n];\\n\\n\\n\",\n \"file_path\": \"rust/game/src/schemas/packages_generated.rs\",\n \"rank\": 80,\n \"score\": 34934.30335381882\n },\n {\n \"content\": \"#[derive(Debug)]\\n\\nenum RunMode {\\n\\n Embedded { game: Game },\\n\\n Server { client: Client },\\n\\n}\\n\\n\\n\\n#[derive(Debug)]\\n\\npub struct FfiContext {\\n\\n mode: RunMode,\\n\\n}\\n\\n\\n\\nimpl<'a> FfiContext {\\n\\n pub fn new(address: Option<&str>) -> Self {\\n\\n let mode = match address {\\n\\n Some(address) => {\\n\\n // TODO: should not throw errors here\\n\\n let client = Client::new(address);\\n\\n RunMode::Server { client }\\n\\n }\\n\\n None => RunMode::Embedded { game: Game::new() },\\n\\n };\\n\",\n \"file_path\": \"rust/ffi/src/ffi/mod.rs\",\n \"rank\": 81,\n \"score\": 34274.80289391954\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiResponses\\n\\n{\\n\\n\\n\\npublic enum ResponseKind : ushort\\n\\n{\\n\\n GameStarted = 0,\\n\\n GameStatusIdle = 1,\\n\\n GameStatusRunning = 2,\\n\\n FullStateResponse = 3,\\n\\n CreateObj = 4,\\n\\n MoveObj = 5,\\n\\n InvalidRequest = 6,\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/ResponseKind.cs\",\n \"rank\": 82,\n \"score\": 33392.39779630207\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiResponses\\n\\n{\\n\\n\\n\\npublic enum PrefabKind : ushort\\n\\n{\\n\\n Player = 0,\\n\\n Monster = 1,\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/PrefabKind.cs\",\n \"rank\": 83,\n \"score\": 33389.929647574034\n },\n {\n \"content\": \" public float X { get { return __p.bb.GetFloat(__p.bb_pos + 12); } }\\n\\n public float Y { get { return __p.bb.GetFloat(__p.bb_pos + 16); } }\\n\\n\\n\\n public static Offset<FfiResponses.PosPackage> CreatePosPackage(FlatBufferBuilder builder, FfiResponses.ResponseKind Kind, uint Ordering, uint Id, float X, float Y) {\\n\\n builder.Prep(4, 20);\\n\\n builder.PutFloat(Y);\\n\\n builder.PutFloat(X);\\n\\n builder.PutUint(Id);\\n\\n builder.PutUint(Ordering);\\n\\n builder.Pad(2);\\n\\n builder.PutUshort((ushort)Kind);\\n\\n return new Offset<FfiResponses.PosPackage>(builder.Offset);\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/PosPackage.cs\",\n \"rank\": 84,\n \"score\": 32940.83791046629\n },\n {\n \"content\": \" public FfiResponses.PrefabKind Prefab { get { return (FfiResponses.PrefabKind)__p.bb.GetUshort(__p.bb_pos + 12); } }\\n\\n public float X { get { return __p.bb.GetFloat(__p.bb_pos + 16); } }\\n\\n public float Y { get { return __p.bb.GetFloat(__p.bb_pos + 20); } }\\n\\n\\n\\n public static Offset<FfiResponses.CreatePackage> CreateCreatePackage(FlatBufferBuilder builder, FfiResponses.ResponseKind Kind, uint Ordering, uint Id, FfiResponses.PrefabKind Prefab, float X, float Y) {\\n\\n builder.Prep(4, 24);\\n\\n builder.PutFloat(Y);\\n\\n builder.PutFloat(X);\\n\\n builder.Pad(2);\\n\\n builder.PutUshort((ushort)Prefab);\\n\\n builder.PutUint(Id);\\n\\n builder.PutUint(Ordering);\\n\\n builder.Pad(2);\\n\\n builder.PutUshort((ushort)Kind);\\n\\n return new Offset<FfiResponses.CreatePackage>(builder.Offset);\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/CreatePackage.cs\",\n \"rank\": 85,\n \"score\": 32939.85494798735\n },\n {\n \"content\": \" public float Y { get { return __p.bb.GetFloat(__p.bb_pos + 12); } }\\n\\n\\n\\n public static Offset<FfiResponses.V2Package> CreateV2Package(FlatBufferBuilder builder, FfiResponses.ResponseKind Kind, uint Ordering, float X, float Y) {\\n\\n builder.Prep(4, 16);\\n\\n builder.PutFloat(Y);\\n\\n builder.PutFloat(X);\\n\\n builder.PutUint(Ordering);\\n\\n builder.Pad(2);\\n\\n builder.PutUshort((ushort)Kind);\\n\\n return new Offset<FfiResponses.V2Package>(builder.Offset);\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/V2Package.cs\",\n \"rank\": 86,\n \"score\": 32938.08355810393\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiResponses\\n\\n{\\n\\n\\n\\nusing global::System;\\n\\nusing global::FlatBuffers;\\n\\n\\n\\npublic struct V2Package : IFlatbufferObject\\n\\n{\\n\\n private Struct __p;\\n\\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\\n\\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\\n\\n public V2Package __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\\n\\n\\n\\n public FfiResponses.ResponseKind Kind { get { return (FfiResponses.ResponseKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\\n\\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\\n\\n public float X { get { return __p.bb.GetFloat(__p.bb_pos + 8); } }\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/V2Package.cs\",\n \"rank\": 87,\n \"score\": 32937.2290919761\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiResponses\\n\\n{\\n\\n\\n\\nusing global::System;\\n\\nusing global::FlatBuffers;\\n\\n\\n\\npublic struct CreatePackage : IFlatbufferObject\\n\\n{\\n\\n private Struct __p;\\n\\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\\n\\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\\n\\n public CreatePackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\\n\\n\\n\\n public FfiResponses.ResponseKind Kind { get { return (FfiResponses.ResponseKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\\n\\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\\n\\n public uint Id { get { return __p.bb.GetUint(__p.bb_pos + 8); } }\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/CreatePackage.cs\",\n \"rank\": 88,\n \"score\": 32937.19944663026\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiResponses\\n\\n{\\n\\n\\n\\nusing global::System;\\n\\nusing global::FlatBuffers;\\n\\n\\n\\npublic struct PosPackage : IFlatbufferObject\\n\\n{\\n\\n private Struct __p;\\n\\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\\n\\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\\n\\n public PosPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\\n\\n\\n\\n public FfiResponses.ResponseKind Kind { get { return (FfiResponses.ResponseKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\\n\\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\\n\\n public uint Id { get { return __p.bb.GetUint(__p.bb_pos + 8); } }\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/PosPackage.cs\",\n \"rank\": 89,\n \"score\": 32937.19944663026\n },\n {\n \"content\": \" public static Offset<FfiResponses.EmptyPackage> CreateEmptyPackage(FlatBufferBuilder builder, FfiResponses.ResponseKind Kind, uint Ordering) {\\n\\n builder.Prep(4, 8);\\n\\n builder.PutUint(Ordering);\\n\\n builder.Pad(2);\\n\\n builder.PutUshort((ushort)Kind);\\n\\n return new Offset<FfiResponses.EmptyPackage>(builder.Offset);\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/EmptyPackage.cs\",\n \"rank\": 90,\n \"score\": 32935.859201637504\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiResponses\\n\\n{\\n\\n\\n\\nusing global::System;\\n\\nusing global::FlatBuffers;\\n\\n\\n\\npublic struct EmptyPackage : IFlatbufferObject\\n\\n{\\n\\n private Struct __p;\\n\\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\\n\\n public void __init(int _i, ByteBuffer _bb) { __p = new Struct(_i, _bb); }\\n\\n public EmptyPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\\n\\n\\n\\n public FfiResponses.ResponseKind Kind { get { return (FfiResponses.ResponseKind)__p.bb.GetUshort(__p.bb_pos + 0); } }\\n\\n public uint Ordering { get { return __p.bb.GetUint(__p.bb_pos + 4); } }\\n\\n\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/EmptyPackage.cs\",\n \"rank\": 91,\n \"score\": 32935.66358132974\n },\n {\n \"content\": \" public FfiResponses.ResponseKind Kind { get { int o = __p.__offset(4); return o != 0 ? (FfiResponses.ResponseKind)__p.bb.GetUshort(o + __p.bb_pos) : FfiResponses.ResponseKind.GameStarted; } }\\n\\n public uint Ordering { get { int o = __p.__offset(6); return o != 0 ? __p.bb.GetUint(o + __p.bb_pos) : (uint)0; } }\\n\\n public string Buffer { get { int o = __p.__offset(8); return o != 0 ? __p.__string(o + __p.bb_pos) : null; } }\\n\\n#if ENABLE_SPAN_T\\n\\n public Span<byte> GetBufferBytes() { return __p.__vector_as_span<byte>(8, 1); }\\n\\n#else\\n\\n public ArraySegment<byte>? GetBufferBytes() { return __p.__vector_as_arraysegment(8); }\\n\\n#endif\\n\\n public byte[] GetBufferArray() { return __p.__vector_as_array<byte>(8); }\\n\\n\\n\\n public static Offset<FfiResponses.StringPackage> CreateStringPackage(FlatBufferBuilder builder,\\n\\n FfiResponses.ResponseKind kind = FfiResponses.ResponseKind.GameStarted,\\n\\n uint ordering = 0,\\n\\n StringOffset bufferOffset = default(StringOffset)) {\\n\\n builder.StartTable(3);\\n\\n StringPackage.AddBuffer(builder, bufferOffset);\\n\\n StringPackage.AddOrdering(builder, ordering);\\n\\n StringPackage.AddKind(builder, kind);\\n\\n return StringPackage.EndStringPackage(builder);\\n\\n }\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/StringPackage.cs\",\n \"rank\": 92,\n \"score\": 32935.52495913092\n },\n {\n \"content\": \" public FfiResponses.ResponseKind Kind { get { int o = __p.__offset(4); return o != 0 ? (FfiResponses.ResponseKind)__p.bb.GetUshort(o + __p.bb_pos) : FfiResponses.ResponseKind.GameStarted; } }\\n\\n public uint Ordering { get { int o = __p.__offset(6); return o != 0 ? __p.bb.GetUint(o + __p.bb_pos) : (uint)0; } }\\n\\n public sbyte Buffer(int j) { int o = __p.__offset(8); return o != 0 ? __p.bb.GetSbyte(__p.__vector(o) + j * 1) : (sbyte)0; }\\n\\n public int BufferLength { get { int o = __p.__offset(8); return o != 0 ? __p.__vector_len(o) : 0; } }\\n\\n#if ENABLE_SPAN_T\\n\\n public Span<sbyte> GetBufferBytes() { return __p.__vector_as_span<sbyte>(8, 1); }\\n\\n#else\\n\\n public ArraySegment<byte>? GetBufferBytes() { return __p.__vector_as_arraysegment(8); }\\n\\n#endif\\n\\n public sbyte[] GetBufferArray() { return __p.__vector_as_array<sbyte>(8); }\\n\\n\\n\\n public static Offset<FfiResponses.BytesPackage> CreateBytesPackage(FlatBufferBuilder builder,\\n\\n FfiResponses.ResponseKind kind = FfiResponses.ResponseKind.GameStarted,\\n\\n uint ordering = 0,\\n\\n VectorOffset bufferOffset = default(VectorOffset)) {\\n\\n builder.StartTable(3);\\n\\n BytesPackage.AddBuffer(builder, bufferOffset);\\n\\n BytesPackage.AddOrdering(builder, ordering);\\n\\n BytesPackage.AddKind(builder, kind);\\n\\n return BytesPackage.EndBytesPackage(builder);\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/BytesPackage.cs\",\n \"rank\": 93,\n \"score\": 32935.29820189554\n },\n {\n \"content\": \"\\n\\n public static void StartStringPackage(FlatBufferBuilder builder) { builder.StartTable(3); }\\n\\n public static void AddKind(FlatBufferBuilder builder, FfiResponses.ResponseKind kind) { builder.AddUshort(0, (ushort)kind, 0); }\\n\\n public static void AddOrdering(FlatBufferBuilder builder, uint ordering) { builder.AddUint(1, ordering, 0); }\\n\\n public static void AddBuffer(FlatBufferBuilder builder, StringOffset bufferOffset) { builder.AddOffset(2, bufferOffset.Value, 0); }\\n\\n public static Offset<FfiResponses.StringPackage> EndStringPackage(FlatBufferBuilder builder) {\\n\\n int o = builder.EndTable();\\n\\n return new Offset<FfiResponses.StringPackage>(o);\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/StringPackage.cs\",\n \"rank\": 94,\n \"score\": 32934.89275667841\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiResponses\\n\\n{\\n\\n\\n\\nusing global::System;\\n\\nusing global::FlatBuffers;\\n\\n\\n\\npublic struct StringPackage : IFlatbufferObject\\n\\n{\\n\\n private Table __p;\\n\\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\\n\\n public static void ValidateVersion() { FlatBufferConstants.FLATBUFFERS_1_11_1(); }\\n\\n public static StringPackage GetRootAsStringPackage(ByteBuffer _bb) { return GetRootAsStringPackage(_bb, new StringPackage()); }\\n\\n public static StringPackage GetRootAsStringPackage(ByteBuffer _bb, StringPackage obj) { return (obj.__assign(_bb.GetInt(_bb.Position) + _bb.Position, _bb)); }\\n\\n public void __init(int _i, ByteBuffer _bb) { __p = new Table(_i, _bb); }\\n\\n public StringPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\\n\\n\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/StringPackage.cs\",\n \"rank\": 95,\n \"score\": 32934.459439830585\n },\n {\n \"content\": \"// <auto-generated>\\n\\n// automatically generated by the FlatBuffers compiler, do not modify\\n\\n// </auto-generated>\\n\\n\\n\\nnamespace FfiResponses\\n\\n{\\n\\n\\n\\nusing global::System;\\n\\nusing global::FlatBuffers;\\n\\n\\n\\npublic struct BytesPackage : IFlatbufferObject\\n\\n{\\n\\n private Table __p;\\n\\n public ByteBuffer ByteBuffer { get { return __p.bb; } }\\n\\n public static void ValidateVersion() { FlatBufferConstants.FLATBUFFERS_1_11_1(); }\\n\\n public static BytesPackage GetRootAsBytesPackage(ByteBuffer _bb) { return GetRootAsBytesPackage(_bb, new BytesPackage()); }\\n\\n public static BytesPackage GetRootAsBytesPackage(ByteBuffer _bb, BytesPackage obj) { return (obj.__assign(_bb.GetInt(_bb.Position) + _bb.Position, _bb)); }\\n\\n public void __init(int _i, ByteBuffer _bb) { __p = new Table(_i, _bb); }\\n\\n public BytesPackage __assign(int _i, ByteBuffer _bb) { __init(_i, _bb); return this; }\\n\\n\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/BytesPackage.cs\",\n \"rank\": 96,\n \"score\": 32934.459439830585\n },\n {\n \"content\": \" }\\n\\n\\n\\n public static void StartBytesPackage(FlatBufferBuilder builder) { builder.StartTable(3); }\\n\\n public static void AddKind(FlatBufferBuilder builder, FfiResponses.ResponseKind kind) { builder.AddUshort(0, (ushort)kind, 0); }\\n\\n public static void AddOrdering(FlatBufferBuilder builder, uint ordering) { builder.AddUint(1, ordering, 0); }\\n\\n public static void AddBuffer(FlatBufferBuilder builder, VectorOffset bufferOffset) { builder.AddOffset(2, bufferOffset.Value, 0); }\\n\\n public static VectorOffset CreateBufferVector(FlatBufferBuilder builder, sbyte[] data) { builder.StartVector(1, data.Length, 1); for (int i = data.Length - 1; i >= 0; i--) builder.AddSbyte(data[i]); return builder.EndVector(); }\\n\\n public static VectorOffset CreateBufferVectorBlock(FlatBufferBuilder builder, sbyte[] data) { builder.StartVector(1, data.Length, 1); builder.Add(data); return builder.EndVector(); }\\n\\n public static void StartBufferVector(FlatBufferBuilder builder, int numElems) { builder.StartVector(1, numElems, 1); }\\n\\n public static Offset<FfiResponses.BytesPackage> EndBytesPackage(FlatBufferBuilder builder) {\\n\\n int o = builder.EndTable();\\n\\n return new Offset<FfiResponses.BytesPackage>(o);\\n\\n }\\n\\n};\\n\\n\\n\\n\\n\\n}\\n\",\n \"file_path\": \"unity3d/Assets/src/Domain/FfiResponses/BytesPackage.cs\",\n \"rank\": 97,\n \"score\": 32932.70171991856\n }\n]","isConversational":false}}},{"rowIdx":998,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"src/handlers/theme.rs"},"repo_name":{"kind":"string","value":"cmarincia/miette"},"commit":{"kind":"string","value":"714334098a92c77fb6b962e627defab7e16b540d"},"file_code":{"kind":"string","value":"use atty::Stream;\nuse owo_colors::Style;\n\n/**\nTheme used by [`GraphicalReportHandler`](crate::GraphicalReportHandler) to\nrender fancy [`Diagnostic`](crate::Diagnostic) reports.\n\nA theme consists of two things: the set of characters to be used for drawing,\nand the\n[`owo_colors::Style`](https://docs.rs/owo-colors/latest/owo_colors/struct.Style.html)s to be used to paint various items.\n\nYou can create your own custom graphical theme using this type, or you can use\none of the predefined ones using the methods below.\n*/\n#[derive(Debug, Clone)]\npub struct GraphicalTheme {\n \n pub characters: ThemeCharacters,\n \n pub styles: ThemeStyles,\n}\n\nimpl GraphicalTheme {\n \n pub fn ascii() -> Self {\n Self {\n characters: ThemeCharacters::ascii(),\n styles: ThemeStyles::ansi(),\n }\n }\n\n \n \n pub fn unicode() -> Self {\n Self {\n characters: ThemeCharacters::unicode(),\n styles: ThemeStyles::rgb(),\n }\n }\n\n \n \n pub fn unicode_nocolor() -> Self {\n Self {\n characters: ThemeCharacters::unicode(),\n styles: ThemeStyles::none(),\n }\n }\n\n \n \n \n \n \n pub fn none() -> Self {\n Self {\n characters: ThemeCharacters::ascii(),\n styles: ThemeStyles::none(),\n }\n }\n}\n\nimpl Default for GraphicalTheme {\n fn default() -> Self {\n match std::env::var(\"NO_COLOR\") {\n _ if !atty::is(Stream::Stdout) || !atty::is(Stream::Stderr) => Self::ascii(),\n Ok(string) if string != \"0\" => Self::unicode_nocolor(),\n _ => Self::unicode(),\n }\n }\n}\n\n/**\nStyles for various parts of graphical rendering for the [crate::GraphicalReportHandler].\n*/\n#[derive(Debug, Clone)]\npub struct ThemeStyles {\n \n pub error: Style,\n \n pub warning: Style,\n \n pub advice: Style,\n \n pub help: Style,\n \n pub link: Style,\n \n pub linum: Style,\n \n \n pub highlights: Vec<Style>,\n}\n\nfn style() -> Style {\n Style::new()\n}\n\nimpl ThemeStyles {\n \n \n pub fn rgb() -> Self {\n Self {\n error: style().fg_rgb::<255, 30, 30>(),\n warning: style().fg_rgb::<244, 191, 117>(),\n advice: style().fg_rgb::<106, 159, 181>(),\n help: style().fg_rgb::<106, 159, 181>(),\n link: style().fg_rgb::<92, 157, 255>().underline().bold(),\n linum: style().dimmed(),\n highlights: vec![\n style().fg_rgb::<246, 87, 248>(),\n style().fg_rgb::<30, 201, 212>(),\n style().fg_rgb::<145, 246, 111>(),\n ],\n }\n }\n\n \n pub fn ansi() -> Self {\n Self {\n error: style().red(),\n warning: style().yellow(),\n advice: style().cyan(),\n help: style().cyan(),\n link: style().cyan().underline().bold(),\n linum: style().dimmed(),\n highlights: vec![\n style().red().bold(),\n style().yellow().bold(),\n style().cyan().bold(),\n ],\n }\n }\n\n \n pub fn none() -> Self {\n Self {\n error: style(),\n warning: style(),\n advice: style(),\n help: style(),\n link: style(),\n linum: style(),\n highlights: vec![style()],\n }\n }\n}\n\n#[allow(missing_docs)]\n#[derive(Debug, Clone, Eq, PartialEq)]\npub struct ThemeCharacters {\n pub hbar: char,\n pub vbar: char,\n pub xbar: char,\n pub vbar_break: char,\n\n pub uarrow: char,\n pub rarrow: char,\n\n pub ltop: char,\n pub mtop: char,\n pub rtop: char,\n pub lbot: char,\n pub rbot: char,\n pub mbot: char,\n\n pub lbox: char,\n pub rbox: char,\n\n pub lcross: char,\n pub rcross: char,\n\n pub underbar: char,\n pub underline: char,\n\n pub error: String,\n pub warning: String,\n pub advice: String,\n}\n\nimpl ThemeCharacters {\n \n pub fn unicode() -> Self {\n Self {\n hbar: '─',\n vbar: '│',\n xbar: '┼',\n vbar_break: '·',\n uarrow: '▲',\n rarrow: '▶',\n ltop: '╭',\n mtop: '┬',\n rtop: '╮',\n lbot: '╰',\n mbot: '┴',\n rbot: '╯',\n lbox: '[',\n rbox: ']',\n lcross: '├',\n rcross: '┤',\n underbar: '┬',\n underline: '─',\n error: \"×\".into(),\n warning: \"⚠\".into(),\n advice: \"☞\".into(),\n }\n }\n\n \n pub fn emoji() -> Self {\n Self {\n hbar: '─',\n vbar: '│',\n xbar: '┼',\n vbar_break: '·',\n uarrow: '▲',\n rarrow: '▶',\n ltop: '╭',\n mtop: '┬',\n rtop: '╮',\n lbot: '╰',\n mbot: '┴',\n rbot: '╯',\n lbox: '[',\n rbox: ']',\n lcross: '├',\n rcross: '┤',\n underbar: '┬',\n underline: '─',\n error: \"💥\".into(),\n warning: \"⚠️\".into(),\n advice: \"💡\".into(),\n }\n }\n \n pub fn ascii() -> Self {\n Self {\n hbar: '-',\n vbar: '|',\n xbar: '+',\n vbar_break: ':',\n uarrow: '^',\n rarrow: '>',\n ltop: ',',\n mtop: 'v',\n rtop: '.',\n lbot: '`',\n mbot: '^',\n rbot: '\\'',\n lbox: '[',\n rbox: ']',\n lcross: '|',\n rcross: '|',\n underbar: '|',\n underline: '^',\n error: \"x\".into(),\n warning: \"!\".into(),\n advice: \">\".into(),\n }\n }\n}\n"},"prefix":{"kind":"string","value":"use atty::Stream;\nuse owo_colors::Style;\n\n/**\nTheme used by [`GraphicalReportHandler`](crate::GraphicalReportHandler) to\nrender fancy [`Diagnostic`](crate::Diagnostic) reports.\n\nA theme consists of two things: the set of characters to be used for drawing,\nand the\n[`owo_colors::Style`](https://docs.rs/owo-colors/latest/owo_colors/struct.Style.html)s to be used to paint various items.\n\nYou can create your own custom graphical theme using this type, or you can use\none of the predefined ones using the methods below.\n*/\n#[derive(Debug, Clone)]\npub struct GraphicalTheme {\n \n pub characters: ThemeCharacters,\n \n pub styles: ThemeStyles,\n}\n\nimpl GraphicalTheme {\n \n pub fn ascii() -> Self {\n Self {\n characters: ThemeCharacters::ascii(),\n styles: ThemeStyles::ansi(),\n }\n }\n\n \n \n "},"suffix":{"kind":"string","value":"\n\n \n \n pub fn unicode_nocolor() -> Self {\n Self {\n characters: ThemeCharacters::unicode(),\n styles: ThemeStyles::none(),\n }\n }\n\n \n \n \n \n \n pub fn none() -> Self {\n Self {\n characters: ThemeCharacters::ascii(),\n styles: ThemeStyles::none(),\n }\n }\n}\n\nimpl Default for GraphicalTheme {\n fn default() -> Self {\n match std::env::var(\"NO_COLOR\") {\n _ if !atty::is(Stream::Stdout) || !atty::is(Stream::Stderr) => Self::ascii(),\n Ok(string) if string != \"0\" => Self::unicode_nocolor(),\n _ => Self::unicode(),\n }\n }\n}\n\n/**\nStyles for various parts of graphical rendering for the [crate::GraphicalReportHandler].\n*/\n#[derive(Debug, Clone)]\npub struct ThemeStyles {\n \n pub error: Style,\n \n pub warning: Style,\n \n pub advice: Style,\n \n pub help: Style,\n \n pub link: Style,\n \n pub linum: Style,\n \n \n pub highlights: Vec<Style>,\n}\n\nfn style() -> Style {\n Style::new()\n}\n\nimpl ThemeStyles {\n \n \n pub fn rgb() -> Self {\n Self {\n error: style().fg_rgb::<255, 30, 30>(),\n warning: style().fg_rgb::<244, 191, 117>(),\n advice: style().fg_rgb::<106, 159, 181>(),\n help: style().fg_rgb::<106, 159, 181>(),\n link: style().fg_rgb::<92, 157, 255>().underline().bold(),\n linum: style().dimmed(),\n highlights: vec![\n style().fg_rgb::<246, 87, 248>(),\n style().fg_rgb::<30, 201, 212>(),\n style().fg_rgb::<145, 246, 111>(),\n ],\n }\n }\n\n \n pub fn ansi() -> Self {\n Self {\n error: style().red(),\n warning: style().yellow(),\n advice: style().cyan(),\n help: style().cyan(),\n link: style().cyan().underline().bold(),\n linum: style().dimmed(),\n highlights: vec![\n style().red().bold(),\n style().yellow().bold(),\n style().cyan().bold(),\n ],\n }\n }\n\n \n pub fn none() -> Self {\n Self {\n error: style(),\n warning: style(),\n advice: style(),\n help: style(),\n link: style(),\n linum: style(),\n highlights: vec![style()],\n }\n }\n}\n\n#[allow(missing_docs)]\n#[derive(Debug, Clone, Eq, PartialEq)]\npub struct ThemeCharacters {\n pub hbar: char,\n pub vbar: char,\n pub xbar: char,\n pub vbar_break: char,\n\n pub uarrow: char,\n pub rarrow: char,\n\n pub ltop: char,\n pub mtop: char,\n pub rtop: char,\n pub lbot: char,\n pub rbot: char,\n pub mbot: char,\n\n pub lbox: char,\n pub rbox: char,\n\n pub lcross: char,\n pub rcross: char,\n\n pub underbar: char,\n pub underline: char,\n\n pub error: String,\n pub warning: String,\n pub advice: String,\n}\n\nimpl ThemeCharacters {\n \n pub fn unicode() -> Self {\n Self {\n hbar: '─',\n vbar: '│',\n xbar: '┼',\n vbar_break: '·',\n uarrow: '▲',\n rarrow: '▶',\n ltop: '╭',\n mtop: '┬',\n rtop: '╮',\n lbot: '╰',\n mbot: '┴',\n rbot: '╯',\n lbox: '[',\n rbox: ']',\n lcross: '├',\n rcross: '┤',\n underbar: '┬',\n underline: '─',\n error: \"×\".into(),\n warning: \"⚠\".into(),\n advice: \"☞\".into(),\n }\n }\n\n \n pub fn emoji() -> Self {\n Self {\n hbar: '─',\n vbar: '│',\n xbar: '┼',\n vbar_break: '·',\n uarrow: '▲',\n rarrow: '▶',\n ltop: '╭',\n mtop: '┬',\n rtop: '╮',\n lbot: '╰',\n mbot: '┴',\n rbot: '╯',\n lbox: '[',\n rbox: ']',\n lcross: '├',\n rcross: '┤',\n underbar: '┬',\n underline: '─',\n error: \"💥\".into(),\n warning: \"⚠️\".into(),\n advice: \"💡\".into(),\n }\n }\n \n pub fn ascii() -> Self {\n Self {\n hbar: '-',\n vbar: '|',\n xbar: '+',\n vbar_break: ':',\n uarrow: '^',\n rarrow: '>',\n ltop: ',',\n mtop: 'v',\n rtop: '.',\n lbot: '`',\n mbot: '^',\n rbot: '\\'',\n lbox: '[',\n rbox: ']',\n lcross: '|',\n rcross: '|',\n underbar: '|',\n underline: '^',\n error: \"x\".into(),\n warning: \"!\".into(),\n advice: \">\".into(),\n }\n }\n}\n"},"middle":{"kind":"string","value":"pub fn unicode() -> Self {\n Self {\n characters: ThemeCharacters::unicode(),\n styles: ThemeStyles::rgb(),\n }\n }"},"strategy":{"kind":"string","value":"function_block-full_function"},"context_items":{"kind":"list like","value":[],"string":"[]","isConversational":false}}},{"rowIdx":999,"cells":{"lang":{"kind":"string","value":"Rust"},"file_path":{"kind":"string","value":"cranelift-codegen/src/topo_order.rs"},"repo_name":{"kind":"string","value":"jgouly/cranelift-1"},"commit":{"kind":"string","value":"470372f0b55cd51199466669cb87d9e038a3f459"},"file_code":{"kind":"string","value":"\n\nuse crate::dominator_tree::DominatorTree;\nuse crate::entity::EntitySet;\nuse crate::ir::{Block, Layout};\nuse alloc::vec::Vec;\n\npub struct TopoOrder {\n \n preferred: Vec<Block>,\n\n \n next: usize,\n\n \n visited: EntitySet<Block>,\n\n \n stack: Vec<Block>,\n}\n\nimpl TopoOrder {\n \n pub fn new() -> Self {\n Self {\n preferred: Vec::new(),\n next: 0,\n visited: EntitySet::new(),\n stack: Vec::new(),\n }\n }\n\n \n pub fn clear(&mut self) {\n self.preferred.clear();\n self.next = 0;\n self.visited.clear();\n self.stack.clear();\n }\n\n \n \n pub fn reset<Blocks>(&mut self, preferred: Blocks)\n where\n Blocks: IntoIterator<Item = Block>,\n {\n self.preferred.clear();\n self.preferred.extend(preferred);\n self.next = 0;\n self.visited.clear();\n self.stack.clear();\n }\n\n \n \n \n \n \n \n pub fn next(&mut self, layout: &Layout, domtree: &DominatorTree) -> Option<Block> {\n self.visited.resize(layout.block_capacity());\n \n \n while self.stack.is_empty() {\n match self.preferred.get(self.next).cloned() {\n None => return None,\n Some(mut block) => {\n \n self.next += 1;\n \n while self.visited.insert(block) {\n self.stack.push(block);\n match domtree.idom(block) {\n Some(idom) => {\n block = layout.inst_block(idom).expect(\"idom not in layout\")\n }\n None => break,\n }\n }\n }\n }\n }\n self.stack.pop()\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use crate::cursor::{Cursor, FuncCursor};\n use crate::dominator_tree::DominatorTree;\n use crate::flowgraph::ControlFlowGraph;\n use crate::ir::{Function, InstBuilder};\n use core::iter;\n\n #[test]\n fn empty() {\n let func = Function::new();\n let cfg = ControlFlowGraph::with_function(&func);\n let domtree = DominatorTree::with_function(&func, &cfg);\n let mut topo = TopoOrder::new();\n\n assert_eq!(topo.next(&func.layout, &domtree), None);\n topo.reset(func.layout.blocks());\n assert_eq!(topo.next(&func.layout, &domtree), None);\n }\n\n #[test]\n fn simple() {\n let mut func = Function::new();\n let block0 = func.dfg.make_block();\n let block1 = func.dfg.make_block();\n\n {\n let mut cur = FuncCursor::new(&mut func);\n\n cur.insert_block(block0);\n cur.ins().jump(block1, &[]);\n cur.insert_block(block1);\n cur.ins().jump(block1, &[]);\n }\n\n let cfg = ControlFlowGraph::with_function(&func);\n let domtree = DominatorTree::with_function(&func, &cfg);\n let mut topo = TopoOrder::new();\n\n topo.reset(iter::once(block1));\n assert_eq!(topo.next(&func.layout, &domtree), Some(block0));\n assert_eq!(topo.next(&func.layout, &domtree), Some(block1));\n assert_eq!(topo.next(&func.layout, &domtree), None);\n }\n}\n"},"prefix":{"kind":"string","value":"\n\nuse crate::dominator_tree::DominatorTree;\nuse crate::entity::EntitySet;\nuse crate::ir::{Block, Layout};\nuse alloc::vec::Vec;\n\npub struct TopoOrder {\n \n preferred: Vec<Block>,\n\n \n next: usize,\n\n \n visited: EntitySet<Block>,\n\n \n stack: Vec<Block>,\n}\n\nimpl TopoOrder {\n \n pub fn new() -> Self {\n Self {\n preferred: Vec::new(),\n next: 0,\n visited: EntitySet::new(),\n stack: Vec::new(),\n }\n }\n\n \n pub fn clear(&mut self) {\n self.preferred.clear();\n self.next = 0;\n self.visited.clear();\n self.stack.clear();\n }\n\n \n \n pub fn reset<Blocks>(&mut self, preferred: Blocks)\n where\n Blocks: IntoIterator<Item = Block>,\n {\n self.preferred.clear();\n self.preferred.extend(preferred);\n self.next = 0;\n self.visited.clear();\n self.stack.clear();\n }\n\n \n \n \n \n \n \n pub fn next(&mut self, layout: &Layout, domtree: &DominatorTree) -> Option<Block> {\n self.visited.resize(layout.block_capacity());\n \n \n while self.stack.is_empty() {\n match self.preferred.ge"},"suffix":{"kind":"string","value":" }\n }\n }\n self.stack.pop()\n }\n}\n\n#[cfg(test)]\nmod tests {\n use super::*;\n use crate::cursor::{Cursor, FuncCursor};\n use crate::dominator_tree::DominatorTree;\n use crate::flowgraph::ControlFlowGraph;\n use crate::ir::{Function, InstBuilder};\n use core::iter;\n\n #[test]\n fn empty() {\n let func = Function::new();\n let cfg = ControlFlowGraph::with_function(&func);\n let domtree = DominatorTree::with_function(&func, &cfg);\n let mut topo = TopoOrder::new();\n\n assert_eq!(topo.next(&func.layout, &domtree), None);\n topo.reset(func.layout.blocks());\n assert_eq!(topo.next(&func.layout, &domtree), None);\n }\n\n #[test]\n fn simple() {\n let mut func = Function::new();\n let block0 = func.dfg.make_block();\n let block1 = func.dfg.make_block();\n\n {\n let mut cur = FuncCursor::new(&mut func);\n\n cur.insert_block(block0);\n cur.ins().jump(block1, &[]);\n cur.insert_block(block1);\n cur.ins().jump(block1, &[]);\n }\n\n let cfg = ControlFlowGraph::with_function(&func);\n let domtree = DominatorTree::with_function(&func, &cfg);\n let mut topo = TopoOrder::new();\n\n topo.reset(iter::once(block1));\n assert_eq!(topo.next(&func.layout, &domtree), Some(block0));\n assert_eq!(topo.next(&func.layout, &domtree), Some(block1));\n assert_eq!(topo.next(&func.layout, &domtree), None);\n }\n}\n"},"middle":{"kind":"string","value":"t(self.next).cloned() {\n None => return None,\n Some(mut block) => {\n \n self.next += 1;\n \n while self.visited.insert(block) {\n self.stack.push(block);\n match domtree.idom(block) {\n Some(idom) => {\n block = layout.inst_block(idom).expect(\"idom not in layout\")\n }\n None => break,\n }\n }\n "},"strategy":{"kind":"string","value":"function_block-random_span"},"context_items":{"kind":"list like","value":[{"content":"/// Compute the stack frame layout.\n\n///\n\n/// Determine the total size of this stack frame and assign offsets to all `Spill` and `Explicit`\n\n/// stack slots.\n\n///\n\n/// The total frame size will be a multiple of `alignment` which must be a power of two, unless the\n\n/// function doesn't perform any call.\n\n///\n\n/// Returns the total stack frame size which is also saved in `frame.frame_size`.\n\n///\n\n/// If the stack frame is too big, returns an `ImplLimitExceeded` error.\n\npub fn layout_stack(\n\n frame: &mut StackSlots,\n\n is_leaf: bool,\n\n alignment: StackSize,\n\n) -> CodegenResult<StackSize> {\n\n // Each object and the whole stack frame must fit in 2 GB such that any relative offset within\n\n // the frame fits in a `StackOffset`.\n\n let max_size = StackOffset::max_value() as StackSize;\n\n debug_assert!(alignment.is_power_of_two() && alignment <= max_size);\n\n\n\n // We assume a stack that grows toward lower addresses as implemented by modern ISAs. The\n\n // stack layout from high to low addresses will be:\n\n //\n\n // 1. incoming arguments.\n\n // 2. spills + explicits + struct returns.\n\n // 3. outgoing arguments.\n\n //\n\n // The incoming arguments can have both positive and negative offsets. A negative offset\n\n // incoming arguments is usually the x86 return address pushed by the call instruction, but\n\n // it can also be fixed stack slots pushed by an externally generated prologue.\n","file_path":"cranelift-codegen/src/stack_layout.rs","rank":0,"score":302749.1217709638},{"content":"/// A helper to extract all the `Type` listings of each variable in `params`\n\n/// for only parameters the return true for `is_wasm`, typically paired with\n\n/// `is_wasm_return` or `is_wasm_parameter`.\n\npub fn wasm_param_types(params: &[ir::AbiParam], is_wasm: impl Fn(usize) -> bool) -> Vec<Type> {\n\n let mut ret = Vec::with_capacity(params.len());\n\n for (i, param) in params.iter().enumerate() {\n\n if is_wasm(i) {\n\n ret.push(param.value_type);\n\n }\n\n }\n\n ret\n\n}\n","file_path":"cranelift-wasm/src/code_translator.rs","rank":1,"score":246916.54000008677},{"content":"/// Translating Block parameters into serializable parameters.\n\npub fn populate_params(func: &Function, block: Block) -> Vec<String> {\n\n let mut ser_vec: Vec<String> = Vec::new();\n\n let parameters = func.dfg.block_params(block);\n\n for param in parameters {\n\n ser_vec.push(param.to_string());\n\n }\n\n ser_vec\n\n}\n\n\n\n/// Serializable Data Flow Graph.\n\n#[derive(Deserialize, Serialize, Debug)]\n\npub struct SerDataFlowGraph {\n\n blocks: Vec<SerBlock>,\n\n}\n\n\n","file_path":"cranelift-serde/src/serde_clif_json.rs","rank":2,"score":237649.1780876085},{"content":"pub fn populate_inst(func: &Function, block: Block) -> Vec<SerInst> {\n\n let mut ser_vec: Vec<SerInst> = Vec::new();\n\n let ret_iter = func.layout.block_insts(block);\n\n for inst in ret_iter {\n\n let ser_inst: SerInst = SerInst::new(inst, &func);\n\n ser_vec.push(ser_inst);\n\n }\n\n ser_vec\n\n}\n\n\n","file_path":"cranelift-serde/src/serde_clif_json.rs","rank":3,"score":235020.27437304385},{"content":"pub fn split_block_params(func: &mut ir::Function, cfg: &ControlFlowGraph, block: Block) {\n\n let pos = &mut FuncCursor::new(func).at_top(block);\n\n let block_params = pos.func.dfg.block_params(block);\n\n\n\n // Add further splittable types here.\n\n fn type_requires_splitting(ty: Type) -> bool {\n\n ty == ir::types::I128\n\n }\n\n\n\n // A shortcut. If none of the param types require splitting, exit now. This helps because\n\n // the loop below necessarily has to copy the block params into a new vector, so it's better to\n\n // avoid doing so when possible.\n\n if !block_params\n\n .iter()\n\n .any(|block_param| type_requires_splitting(pos.func.dfg.value_type(*block_param)))\n\n {\n\n return;\n\n }\n\n\n\n let mut repairs = Vec::new();\n","file_path":"cranelift-codegen/src/legalizer/split.rs","rank":4,"score":227969.6591488701},{"content":"/// Write out the basic block header, outdented:\n\n///\n\n/// block1:\n\n/// block1(v1: i32):\n\n/// block10(v4: f64, v5: b1):\n\n///\n\npub fn write_block_header(\n\n w: &mut dyn Write,\n\n func: &Function,\n\n isa: Option<&dyn TargetIsa>,\n\n block: Block,\n\n indent: usize,\n\n) -> fmt::Result {\n\n // The `indent` is the instruction indentation. block headers are 4 spaces out from that.\n\n write!(w, \"{1:0$}{2}\", indent - 4, \"\", block)?;\n\n\n\n let regs = isa.map(TargetIsa::register_info);\n\n let regs = regs.as_ref();\n\n\n\n let mut args = func.dfg.block_params(block).iter().cloned();\n\n match args.next() {\n\n None => return writeln!(w, \":\"),\n\n Some(arg) => {\n\n write!(w, \"(\")?;\n\n write_arg(w, func, regs, arg)?;\n\n }\n\n }\n\n // Remaining arguments.\n\n for arg in args {\n\n write!(w, \", \")?;\n\n write_arg(w, func, regs, arg)?;\n\n }\n\n writeln!(w, \"):\")\n\n}\n\n\n","file_path":"cranelift-codegen/src/write.rs","rank":5,"score":226036.1325406057},{"content":"/// Get a reference to the stack-pointer register.\n\npub fn stack_reg() -> Reg {\n\n // XSP (stack) and XZR (zero) are logically different registers which have\n\n // the same hardware encoding, and whose meaning, in real arm64\n\n // instructions, is context-dependent. For convenience of\n\n // universe-construction and for correct printing, we make them be two\n\n // different real registers.\n\n Reg::new_real(\n\n RegClass::I64,\n\n /* enc = */ 31,\n\n /* index = */ SP_REG_INDEX,\n\n )\n\n}\n\n\n","file_path":"cranelift-codegen/src/isa/arm64/inst/regs.rs","rank":6,"score":210233.71025992994},{"content":"/// Serialize all parts of the Cranelift Block data structure, this includes name, parameters, and\n\n/// instructions.\n\npub fn populate_blocks(func: &Function) -> Vec<SerBlock> {\n\n let mut block_vec: Vec<SerBlock> = Vec::new();\n\n for block in func.layout.blocks() {\n\n let mut ser_block: SerBlock = SerBlock::new(block.to_string());\n\n ser_block.params = populate_params(&func, block);\n\n ser_block.insts = populate_inst(&func, block);\n\n block_vec.push(ser_block);\n\n }\n\n block_vec\n\n}\n\n\n\n/// Serializable Cranelift IR data flow graph, including all blocks.\n\nimpl SerDataFlowGraph {\n\n pub fn create_new(func: &Function) -> Self {\n\n Self {\n\n blocks: populate_blocks(func),\n\n }\n\n }\n\n\n\n pub fn new(func: &Function) -> Self {\n","file_path":"cranelift-serde/src/serde_clif_json.rs","rank":7,"score":203621.91842774942},{"content":"/// A primitive hash function for matching opcodes.\n\npub fn simple_hash(s: &str) -> usize {\n\n let mut h: u32 = 5381;\n\n for c in s.chars() {\n\n h = (h ^ c as u32).wrapping_add(h.rotate_right(6));\n\n }\n\n h as usize\n\n}\n\n\n\n/// Compute an open addressed, quadratically probed hash table containing\n\n/// `items`. The returned table is a list containing the elements of the\n\n/// iterable `items` and `None` in unused slots.\n","file_path":"cranelift-codegen/shared/src/constant_hash.rs","rank":8,"score":201823.80120253225},{"content":"/// Get a writable reference to the stack-pointer register.\n\npub fn writable_stack_reg() -> Writable<Reg> {\n\n Writable::from_reg(stack_reg())\n\n}\n\n\n","file_path":"cranelift-codegen/src/isa/arm64/inst/regs.rs","rank":9,"score":199446.6745903882},{"content":"/// Create a `Block` with the given Wasm parameters.\n\npub fn block_with_params<PE: TargetEnvironment + ?Sized>(\n\n builder: &mut FunctionBuilder,\n\n params: &[wasmparser::Type],\n\n environ: &PE,\n\n) -> WasmResult<ir::Block> {\n\n let block = builder.create_block();\n\n for ty in params.iter() {\n\n match ty {\n\n wasmparser::Type::I32 => {\n\n builder.append_block_param(block, ir::types::I32);\n\n }\n\n wasmparser::Type::I64 => {\n\n builder.append_block_param(block, ir::types::I64);\n\n }\n\n wasmparser::Type::F32 => {\n\n builder.append_block_param(block, ir::types::F32);\n\n }\n\n wasmparser::Type::F64 => {\n\n builder.append_block_param(block, ir::types::F64);\n\n }\n","file_path":"cranelift-wasm/src/translation_utils.rs","rank":10,"score":198579.57189888047},{"content":"#[derive(Clone, Debug, Default)]\n\nstruct BlockNode {\n\n prev: PackedOption<Block>,\n\n next: PackedOption<Block>,\n\n first_inst: PackedOption<Inst>,\n\n last_inst: PackedOption<Inst>,\n\n seq: SequenceNumber,\n\n}\n\n\n\n/// Iterate over blocks in layout order. See `Layout::blocks()`.\n\npub struct Blocks<'f> {\n\n layout: &'f Layout,\n\n next: Option<Block>,\n\n}\n\n\n\nimpl<'f> Iterator for Blocks<'f> {\n\n type Item = Block;\n\n\n\n fn next(&mut self) -> Option<Block> {\n\n match self.next {\n\n Some(block) => {\n","file_path":"cranelift-codegen/src/ir/layout.rs","rank":11,"score":198215.78918559712},{"content":"/// Look for a directive in a comment string.\n\n/// The directive is of the form \"foo:\" and should follow the leading `;` in the comment:\n\n///\n\n/// ; dominates: block3 block4\n\n///\n\n/// Return the comment text following the directive.\n\npub fn match_directive<'a>(comment: &'a str, directive: &str) -> Option<&'a str> {\n\n assert!(\n\n directive.ends_with(':'),\n\n \"Directive must include trailing colon\"\n\n );\n\n let text = comment.trim_start_matches(';').trim_start();\n\n if text.starts_with(directive) {\n\n Some(text[directive.len()..].trim())\n\n } else {\n\n None\n\n }\n\n}\n\n\n","file_path":"cranelift-filetests/src/match_directive.rs","rank":12,"score":190534.11070548624},{"content":"pub fn run(\n\n files: Vec<String>,\n\n flag_verbose: bool,\n\n flag_just_decode: bool,\n\n flag_check_translation: bool,\n\n flag_print: bool,\n\n flag_print_disasm: bool,\n\n flag_set: &[String],\n\n flag_triple: &str,\n\n flag_print_size: bool,\n\n flag_report_times: bool,\n\n flag_calc_value_ranges: bool,\n\n) -> Result<(), String> {\n\n let parsed = parse_sets_and_triple(flag_set, flag_triple)?;\n\n\n\n for filename in files {\n\n let path = Path::new(&filename);\n\n let name = String::from(path.as_os_str().to_string_lossy());\n\n handle_module(\n\n flag_verbose,\n","file_path":"src/wasm.rs","rank":13,"score":187995.71640973928},{"content":"pub fn run(\n\n filename: &str,\n\n flag_set: &[String],\n\n flag_isa: &str,\n\n verbose: bool,\n\n) -> Result<(), String> {\n\n let parsed = parse_sets_and_triple(flag_set, flag_isa)?;\n\n let fisa = parsed.as_fisa();\n\n\n\n let path = Path::new(&filename).to_path_buf();\n\n\n\n let buffer = read_to_string(&path).map_err(|e| format!(\"{}: {}\", filename, e))?;\n\n let test_file =\n\n parse_test(&buffer, ParseOptions::default()).map_err(|e| format!(\"{}: {}\", filename, e))?;\n\n\n\n // If we have an isa from the command-line, use that. Otherwise if the\n\n // file contains a unique isa, use that.\n\n let isa = if let Some(isa) = fisa.isa {\n\n isa\n\n } else if let Some(isa) = test_file.isa_spec.unique_isa() {\n","file_path":"src/bugpoint.rs","rank":14,"score":187995.71640973928},{"content":"pub fn print_all(\n\n isa: &dyn TargetIsa,\n\n mem: &[u8],\n\n code_size: u32,\n\n rodata_size: u32,\n\n relocs: &PrintRelocs,\n\n traps: &PrintTraps,\n\n stackmaps: &PrintStackmaps,\n\n) -> Result<(), String> {\n\n print_bytes(&mem);\n\n print_disassembly(isa, &mem[0..code_size as usize])?;\n\n print_readonly_data(&mem[code_size as usize..(code_size + rodata_size) as usize]);\n\n println!(\"\\n{}\\n{}\\n{}\", &relocs.text, &traps.text, &stackmaps.text);\n\n Ok(())\n\n}\n\n\n","file_path":"src/disasm.rs","rank":15,"score":187995.71640973928},{"content":"pub fn run(\n\n files: Vec<String>,\n\n flag_print: bool,\n\n flag_disasm: bool,\n\n flag_report_times: bool,\n\n flag_set: &[String],\n\n flag_isa: &str,\n\n) -> Result<(), String> {\n\n let parsed = parse_sets_and_triple(flag_set, flag_isa)?;\n\n\n\n for filename in files {\n\n let path = Path::new(&filename);\n\n let name = String::from(path.as_os_str().to_string_lossy());\n\n handle_module(\n\n flag_print,\n\n flag_disasm,\n\n flag_report_times,\n\n &path.to_path_buf(),\n\n &name,\n\n parsed.as_fisa(),\n\n )?;\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"src/compile.rs","rank":16,"score":187995.71640973928},{"content":"fn block_count(func: &Function) -> usize {\n\n func.layout.blocks().count()\n\n}\n\n\n","file_path":"src/bugpoint.rs","rank":17,"score":183912.41023529577},{"content":"/// Compute the final block order.\n\npub fn compute_final_block_order<I: VCodeInst>(vcode: &VCode<I>) -> Vec<BlockIndex> {\n\n let mut rpo = BlockRPO::new(vcode);\n\n rpo.visit(vcode, vcode.entry());\n\n rpo.rpo()\n\n}\n","file_path":"cranelift-codegen/src/machinst/blockorder.rs","rank":18,"score":182378.01332788263},{"content":"/// Parse \"set\" and \"triple\" commands.\n\npub fn parse_sets_and_triple(\n\n flag_set: &[String],\n\n flag_triple: &str,\n\n) -> Result<OwnedFlagsOrIsa, String> {\n\n let mut flag_builder = settings::builder();\n\n parse_options(\n\n flag_set.iter().map(|x| x.as_str()),\n\n &mut flag_builder,\n\n Location { line_number: 0 },\n\n )\n\n .map_err(|err| err.to_string())?;\n\n\n\n let mut words = flag_triple.trim().split_whitespace();\n\n // Look for `target foo`.\n\n if let Some(triple_name) = words.next() {\n\n let triple = match Triple::from_str(triple_name) {\n\n Ok(triple) => triple,\n\n Err(parse_error) => return Err(parse_error.to_string()),\n\n };\n\n let builder_or_backend = isa::lookup(triple).map_err(|err| match err {\n","file_path":"src/utils.rs","rank":19,"score":181956.30055495835},{"content":"/// Performs the LICM pass by detecting loops within the CFG and moving\n\n/// loop-invariant instructions out of them.\n\n/// Changes the CFG and domtree in-place during the operation.\n\npub fn do_licm(\n\n isa: &dyn TargetIsa,\n\n func: &mut Function,\n\n cfg: &mut ControlFlowGraph,\n\n domtree: &mut DominatorTree,\n\n loop_analysis: &mut LoopAnalysis,\n\n) {\n\n let _tt = timing::licm();\n\n debug_assert!(cfg.is_valid());\n\n debug_assert!(domtree.is_valid());\n\n debug_assert!(loop_analysis.is_valid());\n\n\n\n for lp in loop_analysis.loops() {\n\n // For each loop that we want to optimize we determine the set of loop-invariant\n\n // instructions\n\n let invariant_insts = remove_loop_invariant_instructions(lp, func, cfg, loop_analysis);\n\n // Then we create the loop's pre-header and fill it with the invariant instructions\n\n // Then we remove the invariant instructions from the loop body\n\n if !invariant_insts.is_empty() {\n\n // If the loop has a natural pre-header we use it, otherwise we create it.\n","file_path":"cranelift-codegen/src/licm.rs","rank":20,"score":181956.30055495835},{"content":"#[allow(clippy::float_arithmetic)]\n\npub fn generate_table<'cont, T, I: iter::Iterator<Item = &'cont T>, H: Fn(&T) -> usize>(\n\n items: I,\n\n num_items: usize,\n\n hash_function: H,\n\n) -> Vec<Option<&'cont T>> {\n\n let size = (1.20 * num_items as f64) as usize;\n\n\n\n // Probing code's stop condition relies on the table having one vacant entry at least.\n\n let size = if size.is_power_of_two() {\n\n size * 2\n\n } else {\n\n size.next_power_of_two()\n\n };\n\n\n\n let mut table = vec![None; size];\n\n\n\n for i in items {\n\n let mut h = hash_function(&i) % size;\n\n let mut s = 0;\n\n while table[h].is_some() {\n","file_path":"cranelift-codegen/shared/src/constant_hash.rs","rank":21,"score":179922.71730366038},{"content":"/// Write `func` to `w` as equivalent text.\n\n/// Use `isa` to emit ISA-dependent annotations.\n\npub fn write_function(\n\n w: &mut dyn Write,\n\n func: &Function,\n\n annotations: &DisplayFunctionAnnotations,\n\n) -> fmt::Result {\n\n decorate_function(&mut PlainWriter, w, func, annotations)\n\n}\n\n\n","file_path":"cranelift-codegen/src/write.rs","rank":22,"score":179185.69972773295},{"content":"/// Split `value` into halves using the `vsplit` semantics. Do this by reusing existing values if\n\n/// possible.\n\npub fn vsplit(\n\n func: &mut ir::Function,\n\n cfg: &ControlFlowGraph,\n\n pos: CursorPosition,\n\n srcloc: ir::SourceLoc,\n\n value: Value,\n\n) -> (Value, Value) {\n\n split_any(func, cfg, pos, srcloc, value, Opcode::Vconcat)\n\n}\n\n\n","file_path":"cranelift-codegen/src/legalizer/split.rs","rank":23,"score":179185.69972773295},{"content":"/// Split `value` into two values using the `isplit` semantics. Do this by reusing existing values\n\n/// if possible.\n\npub fn isplit(\n\n func: &mut ir::Function,\n\n cfg: &ControlFlowGraph,\n\n pos: CursorPosition,\n\n srcloc: ir::SourceLoc,\n\n value: Value,\n\n) -> (Value, Value) {\n\n split_any(func, cfg, pos, srcloc, value, Opcode::Iconcat)\n\n}\n\n\n","file_path":"cranelift-codegen/src/legalizer/split.rs","rank":24,"score":179185.64159186982},{"content":"/// Used for 'pass' subcommand.\n\n/// Commands are interpreted as test and executed.\n\n///\n\n/// Directories are scanned recursively for test cases ending in `.clif`.\n\n///\n\npub fn run_passes(\n\n verbose: bool,\n\n report_times: bool,\n\n passes: &[String],\n\n target: &str,\n\n file: &str,\n\n) -> TestResult {\n\n let mut runner = TestRunner::new(verbose, /* report_times */ false);\n\n\n\n let path = Path::new(file);\n\n if path == Path::new(\"-\") || path.is_file() {\n\n runner.push_test(path);\n\n } else {\n\n runner.push_dir(path);\n\n }\n\n\n\n let result = runner.run_passes(passes, target);\n\n if report_times {\n\n println!(\"{}\", timing::take_current());\n\n }\n\n result\n\n}\n\n\n","file_path":"cranelift-filetests/src/lib.rs","rank":25,"score":179185.47398238117},{"content":"/// Write the operands of `inst` to `w` with a prepended space.\n\npub fn write_operands(\n\n w: &mut dyn Write,\n\n dfg: &DataFlowGraph,\n\n isa: Option<&dyn TargetIsa>,\n\n inst: Inst,\n\n) -> fmt::Result {\n\n let pool = &dfg.value_lists;\n\n use crate::ir::instructions::InstructionData::*;\n\n match dfg[inst] {\n\n Unary { arg, .. } => write!(w, \" {}\", arg),\n\n UnaryImm { imm, .. } => write!(w, \" {}\", imm),\n\n UnaryIeee32 { imm, .. } => write!(w, \" {}\", imm),\n\n UnaryIeee64 { imm, .. } => write!(w, \" {}\", imm),\n\n UnaryBool { imm, .. } => write!(w, \" {}\", imm),\n\n UnaryGlobalValue { global_value, .. } => write!(w, \" {}\", global_value),\n\n Binary { args, .. } => write!(w, \" {}, {}\", args[0], args[1]),\n\n BinaryImm { arg, imm, .. } => write!(w, \" {}, {}\", arg, imm),\n\n Ternary { args, .. } => write!(w, \" {}, {}, {}\", args[0], args[1], args[2]),\n\n MultiAry { ref args, .. } => {\n\n if args.is_empty() {\n","file_path":"cranelift-codegen/src/write.rs","rank":26,"score":179179.908153885},{"content":"/// A helper for bitcasting a sequence of values (e.g. function arguments). If a value is a\n\n/// vector type that does not match its expected type, this will modify the value in place to point\n\n/// to the result of a `raw_bitcast`. This conversion is necessary to translate Wasm code that\n\n/// uses `V128` as function parameters (or implicitly in block parameters) and still use specific\n\n/// CLIF types (e.g. `I32X4`) in the function body.\n\npub fn bitcast_arguments(\n\n arguments: &mut [Value],\n\n expected_types: &[Type],\n\n builder: &mut FunctionBuilder,\n\n) {\n\n assert_eq!(arguments.len(), expected_types.len());\n\n for (i, t) in expected_types.iter().enumerate() {\n\n if t.is_vector() {\n\n assert!(\n\n builder.func.dfg.value_type(arguments[i]).is_vector(),\n\n \"unexpected type mismatch: expected {}, argument {} was actually of type {}\",\n\n t,\n\n arguments[i],\n\n builder.func.dfg.value_type(arguments[i])\n\n );\n\n arguments[i] = optionally_bitcast_vector(arguments[i], *t, builder)\n\n }\n\n }\n\n}\n\n\n","file_path":"cranelift-wasm/src/code_translator.rs","rank":27,"score":176563.43805850425},{"content":"/// Verify value locations for `func`.\n\n///\n\n/// After register allocation, every value must be assigned to a location - either a register or a\n\n/// stack slot. These locations must be compatible with the constraints described by the\n\n/// instruction encoding recipes.\n\n///\n\n/// Values can be temporarily diverted to a different location by using the `regmove`, `regspill`,\n\n/// and `regfill` instructions, but only inside an block.\n\n///\n\n/// If a liveness analysis is provided, it is used to verify that there are no active register\n\n/// diversions across control flow edges.\n\npub fn verify_locations(\n\n isa: &dyn isa::TargetIsa,\n\n func: &ir::Function,\n\n cfg: &ControlFlowGraph,\n\n liveness: Option<&Liveness>,\n\n errors: &mut VerifierErrors,\n\n) -> VerifierStepResult<()> {\n\n let _tt = timing::verify_locations();\n\n let verifier = LocationVerifier {\n\n isa,\n\n func,\n\n reginfo: isa.register_info(),\n\n encinfo: isa.encoding_info(),\n\n cfg,\n\n liveness,\n\n };\n\n verifier.check_constraints(errors)?;\n\n Ok(())\n\n}\n\n\n","file_path":"cranelift-codegen/src/verifier/locations.rs","rank":28,"score":176562.8294117054},{"content":"/// Verify liveness information for `func`.\n\n///\n\n/// The provided control flow graph is assumed to be sound.\n\n///\n\n/// - All values in the program must have a live range.\n\n/// - The live range def point must match where the value is defined.\n\n/// - The live range must reach all uses.\n\n/// - When a live range is live-in to an block, it must be live at all the predecessors.\n\n/// - The live range affinity must be compatible with encoding constraints.\n\n///\n\n/// We don't verify that live ranges are minimal. This would require recomputing live ranges for\n\n/// all values.\n\npub fn verify_liveness(\n\n isa: &dyn TargetIsa,\n\n func: &Function,\n\n cfg: &ControlFlowGraph,\n\n liveness: &Liveness,\n\n errors: &mut VerifierErrors,\n\n) -> VerifierStepResult<()> {\n\n let _tt = timing::verify_liveness();\n\n let verifier = LivenessVerifier {\n\n isa,\n\n func,\n\n cfg,\n\n liveness,\n\n };\n\n verifier.check_blocks(errors)?;\n\n verifier.check_insts(errors)?;\n\n Ok(())\n\n}\n\n\n","file_path":"cranelift-codegen/src/verifier/liveness.rs","rank":29,"score":176561.02754522604},{"content":"// The emit_stackmaps() function analyzes each instruction to retrieve the liveness of\n\n// the defs and operands by traversing a function's blocks in layout order.\n\npub fn emit_stackmaps(\n\n func: &mut Function,\n\n domtree: &DominatorTree,\n\n liveness: &Liveness,\n\n tracker: &mut LiveValueTracker,\n\n isa: &dyn TargetIsa,\n\n) {\n\n let mut curr = func.layout.entry_block();\n\n\n\n while let Some(block) = curr {\n\n tracker.block_top(block, &func.dfg, liveness, &func.layout, domtree);\n\n tracker.drop_dead_params();\n\n let mut pos = FuncCursor::new(func);\n\n\n\n // From the top of the block, step through the instructions.\n\n pos.goto_top(block);\n\n\n\n while let Some(inst) = pos.next_inst() {\n\n if let InstructionData::Trap {\n\n code: TrapCode::Interrupt,\n","file_path":"cranelift-codegen/src/regalloc/safepoint.rs","rank":30,"score":176560.08333939995},{"content":"/// Relax branches and compute the final layout of block headers in `func`.\n\n///\n\n/// Fill in the `func.offsets` table so the function is ready for binary emission.\n\npub fn relax_branches(\n\n func: &mut Function,\n\n _cfg: &mut ControlFlowGraph,\n\n _domtree: &mut DominatorTree,\n\n isa: &dyn TargetIsa,\n\n) -> CodegenResult<CodeInfo> {\n\n let _tt = timing::relax_branches();\n\n\n\n let encinfo = isa.encoding_info();\n\n\n\n // Clear all offsets so we can recognize blocks that haven't been visited yet.\n\n func.offsets.clear();\n\n func.offsets.resize(func.dfg.num_blocks());\n\n\n\n // Start by removing redundant jumps.\n\n fold_redundant_jumps(func, _cfg, _domtree);\n\n\n\n // Convert jumps to fallthrough instructions where possible.\n\n fallthroughs(func);\n\n\n","file_path":"cranelift-codegen/src/binemit/relaxation.rs","rank":31,"score":176559.8667794984},{"content":"/// Verify conventional SSA form for `func`.\n\n///\n\n/// Conventional SSA form is represented in Cranelift with the help of virtual registers:\n\n///\n\n/// - Two values are said to be *PHI-related* if one is an block argument and the other is passed as\n\n/// a branch argument in a location that matches the first value.\n\n/// - PHI-related values must belong to the same virtual register.\n\n/// - Two values in the same virtual register must not have overlapping live ranges.\n\n///\n\n/// Additionally, we verify this property of virtual registers:\n\n///\n\n/// - The values in a virtual register are topologically ordered w.r.t. dominance.\n\n///\n\n/// We don't verify that virtual registers are minimal. Minimal CSSA is not required.\n\npub fn verify_cssa(\n\n func: &Function,\n\n cfg: &ControlFlowGraph,\n\n domtree: &DominatorTree,\n\n liveness: &Liveness,\n\n virtregs: &VirtRegs,\n\n errors: &mut VerifierErrors,\n\n) -> VerifierStepResult<()> {\n\n let _tt = timing::verify_cssa();\n\n\n\n let mut preorder = DominatorTreePreorder::new();\n\n preorder.compute(domtree, &func.layout);\n\n\n\n let verifier = CssaVerifier {\n\n func,\n\n cfg,\n\n domtree,\n\n virtregs,\n\n liveness,\n\n preorder,\n\n };\n\n verifier.check_virtregs(errors)?;\n\n verifier.check_cssa(errors)?;\n\n Ok(())\n\n}\n\n\n","file_path":"cranelift-codegen/src/verifier/cssa.rs","rank":32,"score":176556.4206361621},{"content":"/// Returns the base size of the Recipe, assuming it's fixed. This is the default for most\n\n/// encodings; others can be variable and longer than this base size, depending on the registers\n\n/// they're using and use a different function, specific per platform.\n\npub fn base_size(\n\n sizing: &RecipeSizing,\n\n _: Encoding,\n\n _: Inst,\n\n _: &RegDiversions,\n\n _: &Function,\n\n) -> u8 {\n\n sizing.base_size\n\n}\n\n\n\n/// Code size information for an encoding recipe.\n\n///\n\n/// Encoding recipes may have runtime-determined instruction size.\n\npub struct RecipeSizing {\n\n /// Minimum size in bytes of instructions encoded with this recipe.\n\n pub base_size: u8,\n\n\n\n /// Method computing the instruction's real size, given inputs and outputs.\n\n pub compute_size: SizeCalculatorFn,\n\n\n","file_path":"cranelift-codegen/src/isa/encoding.rs","rank":33,"score":176555.0735199579},{"content":"/// Verify that CPU flags are used correctly.\n\n///\n\n/// The value types `iflags` and `fflags` represent CPU flags which usually live in a\n\n/// special-purpose register, so they can't be used as freely as other value types that can live in\n\n/// any register.\n\n///\n\n/// We verify the following conditions:\n\n///\n\n/// - At most one flags value can be live at a time.\n\n/// - A flags value can not be live across an instruction that clobbers the flags.\n\n///\n\n///\n\npub fn verify_flags(\n\n func: &ir::Function,\n\n cfg: &ControlFlowGraph,\n\n isa: Option<&dyn isa::TargetIsa>,\n\n errors: &mut VerifierErrors,\n\n) -> VerifierStepResult<()> {\n\n let _tt = timing::verify_flags();\n\n if isa.is_none() || isa.unwrap().get_mach_backend().is_none() {\n\n let mut verifier = FlagsVerifier {\n\n func,\n\n cfg,\n\n encinfo: isa.map(|isa| isa.encoding_info()),\n\n livein: SecondaryMap::new(),\n\n };\n\n verifier.check(errors)\n\n } else {\n\n Ok(())\n\n }\n\n}\n\n\n","file_path":"cranelift-codegen/src/verifier/flags.rs","rank":34,"score":176554.50139139063},{"content":"pub fn run(\n\n isa: &dyn TargetIsa,\n\n func: &mut Function,\n\n cfg: &mut ControlFlowGraph,\n\n domtree: &mut DominatorTree,\n\n topo: &mut TopoOrder,\n\n) {\n\n let mut ctx = Context {\n\n has_new_blocks: false,\n\n cur: EncCursor::new(func, isa),\n\n domtree,\n\n topo,\n\n cfg,\n\n };\n\n ctx.run()\n\n}\n\n\n","file_path":"cranelift-codegen/src/regalloc/branch_splitting.rs","rank":35,"score":176548.75494350726},{"content":"/// Expand a `call` instruction. This lowers it to a `call_indirect`, which\n\n/// is only done if the ABI doesn't support direct calls.\n\npub fn expand_call(\n\n inst: ir::Inst,\n\n func: &mut ir::Function,\n\n _cfg: &mut ControlFlowGraph,\n\n isa: &dyn TargetIsa,\n\n) {\n\n // Unpack the instruction.\n\n let (func_ref, old_args) = match func.dfg[inst] {\n\n ir::InstructionData::Call {\n\n opcode,\n\n ref args,\n\n func_ref,\n\n } => {\n\n debug_assert_eq!(opcode, ir::Opcode::Call);\n\n (func_ref, args.clone())\n\n }\n\n _ => panic!(\"Wanted call: {}\", func.dfg.display_inst(inst, None)),\n\n };\n\n\n\n let ptr_ty = isa.pointer_type();\n","file_path":"cranelift-codegen/src/legalizer/call.rs","rank":36,"score":176548.75494350726},{"content":"/// Insert ABI conversion code before and after the call instruction at `pos`.\n\n///\n\n/// Instructions inserted before the call will compute the appropriate ABI values for the\n\n/// callee's new ABI-legalized signature. The function call arguments are rewritten in place to\n\n/// match the new signature.\n\n///\n\n/// Instructions will be inserted after the call to convert returned ABI values back to the\n\n/// original return values. The call's result values will be adapted to match the new signature.\n\n///\n\n/// Returns `true` if any instructions were inserted.\n\npub fn handle_call_abi(\n\n isa: &dyn TargetIsa,\n\n mut inst: Inst,\n\n func: &mut Function,\n\n cfg: &ControlFlowGraph,\n\n) -> bool {\n\n let pos = &mut FuncCursor::new(func).at_inst(inst);\n\n pos.use_srcloc(inst);\n\n\n\n // Start by checking if the argument types already match the signature.\n\n let sig_ref = match check_call_signature(&pos.func.dfg, inst) {\n\n Ok(_) => return spill_call_arguments(pos),\n\n Err(s) => s,\n\n };\n\n\n\n let sig = &pos.func.dfg.signatures[sig_ref];\n\n let old_sig = &pos.func.dfg.old_signatures[sig_ref];\n\n\n\n if sig.uses_struct_return_param()\n\n && old_sig\n","file_path":"cranelift-codegen/src/legalizer/boundary.rs","rank":37,"score":174063.4244174118},{"content":"/// Get a function reference for the probestack function in `func`.\n\n///\n\n/// If there is an existing reference, use it, otherwise make a new one.\n\npub fn get_probestack_funcref(\n\n func: &mut Function,\n\n reg_type: Type,\n\n arg_reg: RegUnit,\n\n isa: &dyn TargetIsa,\n\n) -> FuncRef {\n\n find_funcref(LibCall::Probestack, func)\n\n .unwrap_or_else(|| make_funcref_for_probestack(func, reg_type, arg_reg, isa))\n\n}\n\n\n","file_path":"cranelift-codegen/src/ir/libcall.rs","rank":38,"score":174062.94889930714},{"content":"/// Eliminate unreachable code.\n\n///\n\n/// This pass deletes whole blocks that can't be reached from the entry block. It does not delete\n\n/// individual instructions whose results are unused.\n\n///\n\n/// The reachability analysis is performed by the dominator tree analysis.\n\npub fn eliminate_unreachable_code(\n\n func: &mut ir::Function,\n\n cfg: &mut ControlFlowGraph,\n\n domtree: &DominatorTree,\n\n) {\n\n let _tt = timing::unreachable_code();\n\n let mut pos = FuncCursor::new(func);\n\n while let Some(block) = pos.next_block() {\n\n if domtree.is_reachable(block) {\n\n continue;\n\n }\n\n\n\n debug!(\"Eliminating unreachable {}\", block);\n\n // Move the cursor out of the way and make sure the next lop iteration goes to the right\n\n // block.\n\n pos.prev_block();\n\n\n\n // Remove all instructions from `block`.\n\n while let Some(inst) = pos.func.layout.first_inst(block) {\n\n debug!(\" - {}\", pos.func.dfg.display_inst(inst, None));\n","file_path":"cranelift-codegen/src/unreachable_code.rs","rank":39,"score":174058.15369404017},{"content":"/// Parses the Table section of the wasm module.\n\npub fn parse_table_section(\n\n tables: TableSectionReader,\n\n environ: &mut dyn ModuleEnvironment,\n\n) -> WasmResult<()> {\n\n environ.reserve_tables(tables.get_count())?;\n\n\n\n for entry in tables {\n\n let table = entry?;\n\n environ.declare_table(Table {\n\n ty: match tabletype_to_type(table.element_type, environ)? {\n\n Some(t) => TableElementType::Val(t),\n\n None => TableElementType::Func,\n\n },\n\n minimum: table.limits.initial,\n\n maximum: table.limits.maximum,\n\n })?;\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"cranelift-wasm/src/sections_translator.rs","rank":40,"score":174051.73474603065},{"content":"/// Expand a `global_value` instruction according to the definition of the global value.\n\npub fn expand_global_value(\n\n inst: ir::Inst,\n\n func: &mut ir::Function,\n\n _cfg: &mut ControlFlowGraph,\n\n isa: &dyn TargetIsa,\n\n) {\n\n // Unpack the instruction.\n\n let gv = match func.dfg[inst] {\n\n ir::InstructionData::UnaryGlobalValue {\n\n opcode,\n\n global_value,\n\n } => {\n\n debug_assert_eq!(opcode, ir::Opcode::GlobalValue);\n\n global_value\n\n }\n\n _ => panic!(\"Wanted global_value: {}\", func.dfg.display_inst(inst, None)),\n\n };\n\n\n\n match func.global_values[gv] {\n\n ir::GlobalValueData::VMContext => vmctx_addr(inst, func),\n","file_path":"cranelift-codegen/src/legalizer/globalvalue.rs","rank":41,"score":174051.73474603065},{"content":"/// Legalize `sig`.\n\npub fn legalize_signature(\n\n sig: &mut Cow<ir::Signature>,\n\n triple: &Triple,\n\n _current: bool,\n\n shared_flags: &shared_settings::Flags,\n\n isa_flags: &isa_settings::Flags,\n\n) {\n\n let bits;\n\n let mut args;\n\n\n\n match triple.pointer_width().unwrap() {\n\n PointerWidth::U16 => panic!(),\n\n PointerWidth::U32 => {\n\n bits = 32;\n\n args = Args::new(bits, &[], 0, sig.call_conv, shared_flags, isa_flags);\n\n }\n\n PointerWidth::U64 => {\n\n bits = 64;\n\n args = if sig.call_conv.extends_windows_fastcall() {\n\n Args::new(\n","file_path":"cranelift-codegen/src/isa/x86/abi.rs","rank":42,"score":174051.73474603065},{"content":"/// Get the parameter and result types for the given Wasm blocktype.\n\npub fn blocktype_params_results(\n\n module_translation_state: &ModuleTranslationState,\n\n ty_or_ft: wasmparser::TypeOrFuncType,\n\n) -> WasmResult<(&[wasmparser::Type], &[wasmparser::Type])> {\n\n Ok(match ty_or_ft {\n\n wasmparser::TypeOrFuncType::Type(ty) => match ty {\n\n wasmparser::Type::I32 => (&[], &[wasmparser::Type::I32]),\n\n wasmparser::Type::I64 => (&[], &[wasmparser::Type::I64]),\n\n wasmparser::Type::F32 => (&[], &[wasmparser::Type::F32]),\n\n wasmparser::Type::F64 => (&[], &[wasmparser::Type::F64]),\n\n wasmparser::Type::V128 => (&[], &[wasmparser::Type::V128]),\n\n wasmparser::Type::AnyRef => (&[], &[wasmparser::Type::AnyRef]),\n\n wasmparser::Type::AnyFunc => (&[], &[wasmparser::Type::AnyFunc]),\n\n wasmparser::Type::NullRef => (&[], &[wasmparser::Type::NullRef]),\n\n wasmparser::Type::EmptyBlockType => (&[], &[]),\n\n ty => return Err(wasm_unsupported!(\"blocktype_params_results: type {:?}\", ty)),\n\n },\n\n wasmparser::TypeOrFuncType::FuncType(ty_index) => {\n\n let sig_idx = SignatureIndex::from_u32(ty_index);\n\n let (ref params, ref returns) = module_translation_state.wasm_types[sig_idx];\n\n (&*params, &*returns)\n\n }\n\n })\n\n}\n\n\n","file_path":"cranelift-wasm/src/translation_utils.rs","rank":43,"score":174051.73474603065},{"content":"/// Parses the Type section of the wasm module.\n\npub fn parse_type_section(\n\n types: TypeSectionReader,\n\n module_translation_state: &mut ModuleTranslationState,\n\n environ: &mut dyn ModuleEnvironment,\n\n) -> WasmResult<()> {\n\n let count = types.get_count();\n\n module_translation_state.wasm_types.reserve(count as usize);\n\n environ.reserve_signatures(count)?;\n\n\n\n for entry in types {\n\n match entry? {\n\n FuncType {\n\n form: wasmparser::Type::Func,\n\n params,\n\n returns,\n\n } => {\n\n let mut sig =\n\n Signature::new(ModuleEnvironment::target_config(environ).default_call_conv);\n\n sig.params.extend(params.iter().map(|ty| {\n\n let cret_arg: ir::Type = type_to_type(*ty, environ)\n","file_path":"cranelift-wasm/src/sections_translator.rs","rank":44,"score":174051.73474603065},{"content":"/// Parses the Global section of the wasm module.\n\npub fn parse_global_section(\n\n globals: GlobalSectionReader,\n\n environ: &mut dyn ModuleEnvironment,\n\n) -> WasmResult<()> {\n\n environ.reserve_globals(globals.get_count())?;\n\n\n\n for entry in globals {\n\n let wasmparser::Global {\n\n ty: GlobalType {\n\n content_type,\n\n mutable,\n\n },\n\n init_expr,\n\n } = entry?;\n\n let mut init_expr_reader = init_expr.get_binary_reader();\n\n let initializer = match init_expr_reader.read_operator()? {\n\n Operator::I32Const { value } => GlobalInit::I32Const(value),\n\n Operator::I64Const { value } => GlobalInit::I64Const(value),\n\n Operator::F32Const { value } => GlobalInit::F32Const(value.bits()),\n\n Operator::F64Const { value } => GlobalInit::F64Const(value.bits()),\n","file_path":"cranelift-wasm/src/sections_translator.rs","rank":45,"score":174051.73474603065},{"content":"/// Expand a `table_addr` instruction according to the definition of the table.\n\npub fn expand_table_addr(\n\n inst: ir::Inst,\n\n func: &mut ir::Function,\n\n _cfg: &mut ControlFlowGraph,\n\n _isa: &dyn TargetIsa,\n\n) {\n\n // Unpack the instruction.\n\n let (table, index, element_offset) = match func.dfg[inst] {\n\n ir::InstructionData::TableAddr {\n\n opcode,\n\n table,\n\n arg,\n\n offset,\n\n } => {\n\n debug_assert_eq!(opcode, ir::Opcode::TableAddr);\n\n (table, arg, offset)\n\n }\n\n _ => panic!(\"Wanted table_addr: {}\", func.dfg.display_inst(inst, None)),\n\n };\n\n\n\n dynamic_addr(inst, table, index, element_offset, func);\n\n}\n\n\n","file_path":"cranelift-codegen/src/legalizer/table.rs","rank":46,"score":174051.73474603065},{"content":"/// Some SIMD operations only operate on I8X16 in CLIF; this will convert them to that type by\n\n/// adding a raw_bitcast if necessary.\n\npub fn optionally_bitcast_vector(\n\n value: Value,\n\n needed_type: Type,\n\n builder: &mut FunctionBuilder,\n\n) -> Value {\n\n if builder.func.dfg.value_type(value) != needed_type {\n\n builder.ins().raw_bitcast(needed_type, value)\n\n } else {\n\n value\n\n }\n\n}\n\n\n","file_path":"cranelift-wasm/src/code_translator.rs","rank":47,"score":174051.73474603065},{"content":"/// Legalize `sig` for RISC-V.\n\npub fn legalize_signature(\n\n sig: &mut Cow<ir::Signature>,\n\n triple: &Triple,\n\n isa_flags: &settings::Flags,\n\n current: bool,\n\n) {\n\n let bits = triple.pointer_width().unwrap().bits();\n\n\n\n let mut args = Args::new(bits, isa_flags.enable_e());\n\n if let Some(new_params) = legalize_args(&sig.params, &mut args) {\n\n sig.to_mut().params = new_params;\n\n }\n\n\n\n let mut rets = Args::new(bits, isa_flags.enable_e());\n\n if let Some(new_returns) = legalize_args(&sig.returns, &mut rets) {\n\n sig.to_mut().returns = new_returns;\n\n }\n\n\n\n if current {\n\n let ptr = Type::int(u16::from(bits)).unwrap();\n","file_path":"cranelift-codegen/src/isa/riscv/abi.rs","rank":48,"score":174051.73474603065},{"content":"pub fn i_Shift_R(\n\n is64: bool,\n\n kind: ShiftKind,\n\n nBits: u8, // 1 .. #bits-in-type - 1, or 0 to mean \"%cl\"\n\n wdst: Writable<Reg>,\n\n) -> Inst {\n\n let dst = wdst.to_reg();\n\n debug_assert!(nBits < if is64 { 64 } else { 32 });\n\n debug_assert!(dst.get_class() == RegClass::I64);\n\n Inst::Shift_R {\n\n is64,\n\n kind,\n\n nBits,\n\n dst,\n\n }\n\n}\n\n\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":49,"score":174051.73474603065},{"content":"/// Parses the Function section of the wasm module.\n\npub fn parse_function_section(\n\n functions: FunctionSectionReader,\n\n environ: &mut dyn ModuleEnvironment,\n\n) -> WasmResult<()> {\n\n let num_functions = functions.get_count();\n\n if num_functions == std::u32::MAX {\n\n // We reserve `u32::MAX` for our own use in cranelift-entity.\n\n return Err(WasmError::ImplLimitExceeded);\n\n }\n\n\n\n environ.reserve_func_types(num_functions)?;\n\n\n\n for entry in functions {\n\n let sigindex = entry?;\n\n environ.declare_func_type(SignatureIndex::from_u32(sigindex))?;\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"cranelift-wasm/src/sections_translator.rs","rank":50,"score":174051.73474603065},{"content":"/// Expand a `heap_addr` instruction according to the definition of the heap.\n\npub fn expand_heap_addr(\n\n inst: ir::Inst,\n\n func: &mut ir::Function,\n\n cfg: &mut ControlFlowGraph,\n\n isa: &dyn TargetIsa,\n\n) {\n\n // Unpack the instruction.\n\n let (heap, offset, access_size) = match func.dfg[inst] {\n\n ir::InstructionData::HeapAddr {\n\n opcode,\n\n heap,\n\n arg,\n\n imm,\n\n } => {\n\n debug_assert_eq!(opcode, ir::Opcode::HeapAddr);\n\n (heap, arg, imm.into())\n\n }\n\n _ => panic!(\"Wanted heap_addr: {}\", func.dfg.display_inst(inst, None)),\n\n };\n\n\n","file_path":"cranelift-codegen/src/legalizer/heap.rs","rank":51,"score":174051.73474603065},{"content":"/// Parses the Memory section of the wasm module.\n\npub fn parse_memory_section(\n\n memories: MemorySectionReader,\n\n environ: &mut dyn ModuleEnvironment,\n\n) -> WasmResult<()> {\n\n environ.reserve_memories(memories.get_count())?;\n\n\n\n for entry in memories {\n\n let memory = entry?;\n\n environ.declare_memory(Memory {\n\n minimum: memory.limits.initial,\n\n maximum: memory.limits.maximum,\n\n shared: memory.shared,\n\n })?;\n\n }\n\n\n\n Ok(())\n\n}\n\n\n","file_path":"cranelift-wasm/src/sections_translator.rs","rank":52,"score":174051.73474603065},{"content":"/// Rearrange the elements of the mutable slice `s` such that elements where `p(t)` is true precede\n\n/// the elements where `p(t)` is false.\n\n///\n\n/// The order of elements is not preserved, unless the slice is already partitioned.\n\n///\n\n/// Returns the number of elements where `p(t)` is true.\n\npub fn partition_slice<T, F>(s: &mut [T], mut p: F) -> usize\n\nwhere\n\n F: FnMut(&T) -> bool,\n\n{\n\n // The iterator works like a deque which we can pop from both ends.\n\n let mut i = s.iter_mut();\n\n\n\n // Number of elements for which the predicate is known to be true.\n\n let mut pos = 0;\n\n\n\n loop {\n\n // Find the first element for which the predicate fails.\n\n let head = loop {\n\n match i.next() {\n\n Some(head) => {\n\n if !p(&head) {\n\n break head;\n\n }\n\n }\n\n None => return pos,\n","file_path":"cranelift-codegen/src/partition_slice.rs","rank":53,"score":173088.6357418144},{"content":"fn block_ranges(indices: &[InstIx], len: usize) -> Vec<(usize, usize)> {\n\n let v = indices\n\n .iter()\n\n .map(|iix| iix.get() as usize)\n\n .chain(iter::once(len))\n\n .collect::<Vec<usize>>();\n\n v.windows(2).map(|p| (p[0], p[1])).collect()\n\n}\n\n\n","file_path":"cranelift-codegen/src/machinst/vcode.rs","rank":54,"score":172975.11310737938},{"content":"pub fn i_Cmp_RMI_R(\n\n size: u8, // 1, 2, 4 or 8\n\n src: RMI,\n\n dst: Reg,\n\n) -> Inst {\n\n debug_assert!(size == 8 || size == 4 || size == 2 || size == 1);\n\n debug_assert!(dst.get_class() == RegClass::I64);\n\n Inst::Cmp_RMI_R { size, src, dst }\n\n}\n\n\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":55,"score":171678.84559699075},{"content":"pub fn i_Mov_R_M(\n\n size: u8, // 1, 2, 4 or 8\n\n src: Reg,\n\n addr: Addr,\n\n) -> Inst {\n\n debug_assert!(size == 8 || size == 4 || size == 2 || size == 1);\n\n debug_assert!(src.get_class() == RegClass::I64);\n\n Inst::Mov_R_M { size, src, addr }\n\n}\n\n\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":56,"score":171678.84559699075},{"content":"#[cfg(feature = \"unwind\")]\n\npub fn emit_unwind_info(\n\n func: &ir::Function,\n\n isa: &dyn TargetIsa,\n\n kind: FrameUnwindKind,\n\n sink: &mut dyn FrameUnwindSink,\n\n) {\n\n match kind {\n\n FrameUnwindKind::Fastcall => {\n\n // Assumption: RBP is being used as the frame pointer\n\n // In the future, Windows fastcall codegen should usually omit the frame pointer\n\n if let Some(info) = UnwindInfo::try_from_func(func, isa, Some(RU::rbp.into())) {\n\n info.emit(sink);\n\n }\n\n }\n\n FrameUnwindKind::Libunwind => {\n\n if func.frame_layout.is_some() {\n\n emit_fde(func, isa, sink);\n\n }\n\n }\n\n }\n\n}\n","file_path":"cranelift-codegen/src/isa/x86/abi.rs","rank":57,"score":171678.84559699075},{"content":"/// Parse an iterator of command line options and apply them to `config`.\n\npub fn parse_options<'a, I>(\n\n iter: I,\n\n config: &mut dyn Configurable,\n\n loc: Location,\n\n) -> ParseResult<()>\n\nwhere\n\n I: Iterator<Item = &'a str>,\n\n{\n\n for opt in iter.map(TestOption::new) {\n\n match opt {\n\n TestOption::Flag(name) => match config.enable(name) {\n\n Ok(_) => {}\n\n Err(SetError::BadName(name)) => return err!(loc, \"unknown flag '{}'\", name),\n\n Err(_) => return err!(loc, \"not a boolean flag: '{}'\", opt),\n\n },\n\n TestOption::Value(name, value) => match config.set(name, value) {\n\n Ok(_) => {}\n\n Err(SetError::BadName(name)) => return err!(loc, \"unknown setting '{}'\", name),\n\n Err(SetError::BadType) => return err!(loc, \"invalid setting type: '{}'\", opt),\n\n Err(SetError::BadValue(expected)) => {\n","file_path":"cranelift-reader/src/isaspec.rs","rank":58,"score":169639.33755543776},{"content":"pub fn print_bytes(mem: &[u8]) {\n\n print!(\".byte \");\n\n let mut first = true;\n\n for byte in mem.iter() {\n\n if first {\n\n first = false;\n\n } else {\n\n print!(\", \");\n\n }\n\n print!(\"{}\", byte);\n\n }\n\n println!();\n\n}\n\n\n","file_path":"src/disasm.rs","rank":59,"score":169639.33755543776},{"content":"/// Pretty-print a verifier error.\n\npub fn pretty_verifier_error<'a>(\n\n func: &ir::Function,\n\n isa: Option<&dyn TargetIsa>,\n\n func_w: Option<Box<dyn FuncWriter + 'a>>,\n\n errors: VerifierErrors,\n\n) -> String {\n\n let mut errors = errors.0;\n\n let mut w = String::new();\n\n let num_errors = errors.len();\n\n\n\n decorate_function(\n\n &mut PrettyVerifierError(func_w.unwrap_or_else(|| Box::new(PlainWriter)), &mut errors),\n\n &mut w,\n\n func,\n\n &isa.into(),\n\n )\n\n .unwrap();\n\n\n\n writeln!(\n\n w,\n\n \"\\n; {} verifier error{} detected (see above). Compilation aborted.\",\n\n num_errors,\n\n if num_errors == 1 { \"\" } else { \"s\" }\n\n )\n\n .unwrap();\n\n\n\n w\n\n}\n\n\n","file_path":"cranelift-codegen/src/print_errors.rs","rank":60,"score":168973.17190016102},{"content":"pub fn i_Ret() -> Inst {\n\n Inst::Ret {}\n\n}\n\n\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":61,"score":168973.17190016102},{"content":"/// Translate a sequence of bytes forming a valid Wasm binary into a list of valid Cranelift IR\n\n/// [`Function`](cranelift_codegen::ir::Function).\n\npub fn translate_module<'data>(\n\n data: &'data [u8],\n\n environ: &mut dyn ModuleEnvironment<'data>,\n\n) -> WasmResult<ModuleTranslationState> {\n\n let _tt = timing::wasm_translate_module();\n\n let mut reader = ModuleReader::new(data)?;\n\n let mut module_translation_state = ModuleTranslationState::new();\n\n\n\n while !reader.eof() {\n\n let section = reader.read()?;\n\n match section.content()? {\n\n SectionContent::Type(types) => {\n\n parse_type_section(types, &mut module_translation_state, environ)?;\n\n }\n\n\n\n SectionContent::Import(imports) => {\n\n parse_import_section(imports, environ)?;\n\n }\n\n\n\n SectionContent::Function(functions) => {\n","file_path":"cranelift-wasm/src/module_translator.rs","rank":62,"score":168973.17190016102},{"content":"#[allow(dead_code)]\n\npub fn has_length_of(value_list: &ir::ValueList, num: usize, func: &ir::Function) -> bool {\n\n value_list.len(&func.dfg.value_lists) == num\n\n}\n\n\n\n#[cfg(test)]\n\nmod tests {\n\n use super::*;\n\n\n\n #[test]\n\n fn cvt_u32() {\n\n let x1 = 0u32;\n\n let x2 = 1u32;\n\n let x3 = 0xffff_fff0u32;\n\n\n\n assert!(is_signed_int(x1, 1, 0));\n\n assert!(is_signed_int(x1, 2, 1));\n\n assert!(is_signed_int(x2, 2, 0));\n\n assert!(!is_signed_int(x2, 2, 1));\n\n\n\n // `u32` doesn't sign-extend when converted to `i64`.\n","file_path":"cranelift-codegen/src/predicates.rs","rank":63,"score":167811.15635274095},{"content":"pub fn print_readonly_data(mem: &[u8]) {\n\n if mem.is_empty() {\n\n return;\n\n }\n\n\n\n println!(\"\\nFollowed by {} bytes of read-only data:\", mem.len());\n\n\n\n for (i, byte) in mem.iter().enumerate() {\n\n if i % 16 == 0 {\n\n if i != 0 {\n\n println!();\n\n }\n\n print!(\"{:4}: \", i);\n\n }\n\n if i % 4 == 0 {\n\n print!(\" \");\n\n }\n\n print!(\"{:02x} \", byte);\n\n }\n\n println!();\n\n}\n","file_path":"src/disasm.rs","rank":64,"score":167008.18434506003},{"content":"/// Parses the Name section of the wasm module.\n\npub fn parse_name_section<'data>(\n\n mut names: NameSectionReader<'data>,\n\n environ: &mut dyn ModuleEnvironment<'data>,\n\n) -> WasmResult<()> {\n\n while let Ok(subsection) = names.read() {\n\n match subsection {\n\n wasmparser::Name::Function(function_subsection) => {\n\n if let Some(function_names) = function_subsection\n\n .get_map()\n\n .ok()\n\n .and_then(parse_function_name_subsection)\n\n {\n\n for (index, name) in function_names {\n\n environ.declare_func_name(index, name)?;\n\n }\n\n }\n\n return Ok(());\n\n }\n\n wasmparser::Name::Local(_) | wasmparser::Name::Module(_) => {}\n\n };\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"cranelift-wasm/src/sections_translator.rs","rank":65,"score":166600.2827511211},{"content":"/// Parses the Data section of the wasm module.\n\npub fn parse_data_section<'data>(\n\n data: DataSectionReader<'data>,\n\n environ: &mut dyn ModuleEnvironment<'data>,\n\n) -> WasmResult<()> {\n\n environ.reserve_data_initializers(data.get_count())?;\n\n\n\n for (index, entry) in data.into_iter().enumerate() {\n\n let Data { kind, data } = entry?;\n\n match kind {\n\n DataKind::Active {\n\n memory_index,\n\n init_expr,\n\n } => {\n\n let mut init_expr_reader = init_expr.get_binary_reader();\n\n let (base, offset) = match init_expr_reader.read_operator()? {\n\n Operator::I32Const { value } => (None, value as u32 as usize),\n\n Operator::GlobalGet { global_index } => {\n\n (Some(GlobalIndex::from_u32(global_index)), 0)\n\n }\n\n ref s => {\n","file_path":"cranelift-wasm/src/sections_translator.rs","rank":66,"score":166600.2827511211},{"content":"pub fn reg_RDI() -> Reg {\n\n info_RDI().0.to_reg()\n\n}\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":67,"score":166600.2827511211},{"content":"pub fn reg_RBP() -> Reg {\n\n info_RBP().0.to_reg()\n\n}\n\n\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":68,"score":166600.2827511211},{"content":"pub fn reg_RSI() -> Reg {\n\n info_RSI().0.to_reg()\n\n}\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":69,"score":166600.2827511211},{"content":"pub fn reg_R8() -> Reg {\n\n info_R8().0.to_reg()\n\n}\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":70,"score":166600.2827511211},{"content":"pub fn reg_RDX() -> Reg {\n\n info_RDX().0.to_reg()\n\n}\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":71,"score":166600.2827511211},{"content":"/// Parses the Import section of the wasm module.\n\npub fn parse_import_section<'data>(\n\n imports: ImportSectionReader<'data>,\n\n environ: &mut dyn ModuleEnvironment<'data>,\n\n) -> WasmResult<()> {\n\n environ.reserve_imports(imports.get_count())?;\n\n\n\n for entry in imports {\n\n let import = entry?;\n\n let module_name = import.module;\n\n let field_name = import.field;\n\n\n\n match import.ty {\n\n ImportSectionEntryType::Function(sig) => {\n\n environ.declare_func_import(\n\n SignatureIndex::from_u32(sig),\n\n module_name,\n\n field_name,\n\n )?;\n\n }\n\n ImportSectionEntryType::Memory(MemoryType {\n","file_path":"cranelift-wasm/src/sections_translator.rs","rank":72,"score":166600.2827511211},{"content":"/// Parses the Element section of the wasm module.\n\npub fn parse_element_section<'data>(\n\n elements: ElementSectionReader<'data>,\n\n environ: &mut dyn ModuleEnvironment,\n\n) -> WasmResult<()> {\n\n environ.reserve_table_elements(elements.get_count())?;\n\n\n\n for (index, entry) in elements.into_iter().enumerate() {\n\n let Element { kind, items, ty } = entry?;\n\n if ty != Type::AnyFunc {\n\n return Err(wasm_unsupported!(\n\n \"unsupported table element type: {:?}\",\n\n ty\n\n ));\n\n }\n\n let segments = read_elems(&items)?;\n\n match kind {\n\n ElementKind::Active {\n\n table_index,\n\n init_expr,\n\n } => {\n","file_path":"cranelift-wasm/src/sections_translator.rs","rank":73,"score":166600.2827511211},{"content":"/// Parses the Export section of the wasm module.\n\npub fn parse_export_section<'data>(\n\n exports: ExportSectionReader<'data>,\n\n environ: &mut dyn ModuleEnvironment<'data>,\n\n) -> WasmResult<()> {\n\n environ.reserve_exports(exports.get_count())?;\n\n\n\n for entry in exports {\n\n let Export {\n\n field,\n\n ref kind,\n\n index,\n\n } = entry?;\n\n\n\n // The input has already been validated, so we should be able to\n\n // assume valid UTF-8 and use `from_utf8_unchecked` if performance\n\n // becomes a concern here.\n\n let index = index as usize;\n\n match *kind {\n\n ExternalKind::Function => environ.declare_func_export(FuncIndex::new(index), field)?,\n\n ExternalKind::Table => environ.declare_table_export(TableIndex::new(index), field)?,\n","file_path":"cranelift-wasm/src/sections_translator.rs","rank":74,"score":166600.2827511211},{"content":"pub fn reg_RCX() -> Reg {\n\n info_RCX().0.to_reg()\n\n}\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":75,"score":166600.2827511211},{"content":"// For external consumption. It's probably important that LLVM optimises\n\n// these into a 32-bit constant. That will require sprinkling a bunch of\n\n// inline-always pragmas around the place.\n\npub fn reg_RAX() -> Reg {\n\n info_RAX().0.to_reg()\n\n}\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":76,"score":166600.2827511211},{"content":"/// Parses the Code section of the wasm module.\n\npub fn parse_code_section<'data>(\n\n code: CodeSectionReader<'data>,\n\n module_translation_state: &ModuleTranslationState,\n\n environ: &mut dyn ModuleEnvironment<'data>,\n\n) -> WasmResult<()> {\n\n for body in code {\n\n let mut reader = body?.get_binary_reader();\n\n let size = reader.bytes_remaining();\n\n let offset = reader.original_position();\n\n environ.define_function_body(module_translation_state, reader.read_bytes(size)?, offset)?;\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"cranelift-wasm/src/sections_translator.rs","rank":77,"score":166600.2827511211},{"content":"pub fn reg_RSP() -> Reg {\n\n info_RSP().0.to_reg()\n\n}\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":78,"score":166600.2827511211},{"content":"pub fn reg_R9() -> Reg {\n\n info_R9().0.to_reg()\n\n}\n\n\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":79,"score":166600.2827511211},{"content":"/// Get a reference to the \"spill temp\" register. This register is used to\n\n/// compute the address of a spill slot when a direct offset addressing mode from\n\n/// FP is not sufficient (+/- 2^11 words). We exclude this register from regalloc\n\n/// and reserve it for this purpose for simplicity; otherwise we need a\n\n/// multi-stage analysis where we first determine how many spill slots we have,\n\n/// then perhaps remove the reg from the pool and recompute regalloc.\n\npub fn spilltmp_reg() -> Reg {\n\n xreg(15)\n\n}\n\n\n","file_path":"cranelift-codegen/src/isa/arm64/inst/regs.rs","rank":80,"score":164346.93372815652},{"content":"/// Builds ranges and location for specified value labels.\n\n/// The labels specified at DataFlowGraph's values_labels collection.\n\npub fn build_value_labels_ranges<T>(\n\n func: &Function,\n\n regalloc: &Context,\n\n isa: &dyn TargetIsa,\n\n) -> ValueLabelsRanges\n\nwhere\n\n T: From<SourceLoc> + Deref<Target = SourceLoc> + Ord + Copy,\n\n{\n\n let values_labels = build_value_labels_index::<T>(func);\n\n\n\n let mut blocks = func.layout.blocks().collect::<Vec<_>>();\n\n blocks.sort_by_key(|block| func.offsets[*block]); // Ensure inst offsets always increase\n\n let encinfo = isa.encoding_info();\n\n let values_locations = &func.locations;\n\n let liveness_ranges = regalloc.liveness().ranges();\n\n\n\n let mut ranges = HashMap::new();\n\n let mut add_range = |label, range: (u32, u32), loc: ValueLoc| {\n\n if range.0 >= range.1 || !loc.is_assigned() {\n\n return;\n","file_path":"cranelift-codegen/src/value_label.rs","rank":81,"score":164342.49299691487},{"content":"/// Get a reference to the frame pointer (x29).\n\npub fn fp_reg() -> Reg {\n\n xreg(29)\n\n}\n\n\n","file_path":"cranelift-codegen/src/isa/arm64/inst/regs.rs","rank":82,"score":164342.49299691487},{"content":"/// Get a reference to the zero-register.\n\npub fn zero_reg() -> Reg {\n\n // This should be the same as what xreg(31) returns, except that\n\n // we use the special index into the register index space.\n\n Reg::new_real(\n\n RegClass::I64,\n\n /* enc = */ 31,\n\n /* index = */ ZERO_REG_INDEX,\n\n )\n\n}\n\n\n","file_path":"cranelift-codegen/src/isa/arm64/inst/regs.rs","rank":83,"score":164342.49299691487},{"content":"/// Get a reference to the link register (x30).\n\npub fn link_reg() -> Reg {\n\n xreg(30)\n\n}\n\n\n","file_path":"cranelift-codegen/src/isa/arm64/inst/regs.rs","rank":84,"score":164342.49299691487},{"content":"/// Default names for `ir::LibCall`s. A function by this name is imported into the object as\n\n/// part of the translation of a `ir::ExternalName::LibCall` variant.\n\npub fn default_libcall_names() -> Box<dyn Fn(ir::LibCall) -> String> {\n\n Box::new(move |libcall| match libcall {\n\n ir::LibCall::Probestack => \"__cranelift_probestack\".to_owned(),\n\n ir::LibCall::CeilF32 => \"ceilf\".to_owned(),\n\n ir::LibCall::CeilF64 => \"ceil\".to_owned(),\n\n ir::LibCall::FloorF32 => \"floorf\".to_owned(),\n\n ir::LibCall::FloorF64 => \"floor\".to_owned(),\n\n ir::LibCall::TruncF32 => \"truncf\".to_owned(),\n\n ir::LibCall::TruncF64 => \"trunc\".to_owned(),\n\n ir::LibCall::NearestF32 => \"nearbyintf\".to_owned(),\n\n ir::LibCall::NearestF64 => \"nearbyint\".to_owned(),\n\n ir::LibCall::Memcpy => \"memcpy\".to_owned(),\n\n ir::LibCall::Memset => \"memset\".to_owned(),\n\n ir::LibCall::Memmove => \"memmove\".to_owned(),\n\n })\n\n}\n","file_path":"cranelift-module/src/backend.rs","rank":85,"score":163140.18853516545},{"content":"pub fn run(files: &[String]) -> CommandResult {\n\n for (i, f) in files.iter().enumerate() {\n\n if i != 0 {\n\n println!();\n\n }\n\n cat_one(f)?\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"src/cat.rs","rank":86,"score":163056.8792318223},{"content":"/// Compile the given function down to VCode with allocated registers, ready\n\n/// for binary emission.\n\npub fn compile<B: LowerBackend>(\n\n f: &mut Function,\n\n b: &B,\n\n abi: Box<dyn ABIBody<B::MInst>>,\n\n) -> VCode<B::MInst>\n\nwhere\n\n B::MInst: ShowWithRRU,\n\n{\n\n // This lowers the CL IR.\n\n let mut vcode = Lower::new(f, abi).lower(b);\n\n\n\n let universe = &B::MInst::reg_universe();\n\n\n\n debug!(\"vcode from lowering: \\n{}\", vcode.show_rru(Some(universe)));\n\n\n\n // Perform register allocation.\n\n let result = allocate_registers(&mut vcode, RegAllocAlgorithm::Backtracking, universe)\n\n .expect(\"register allocation\");\n\n\n\n // Reorder vcode into final order and copy out final instruction sequence\n","file_path":"cranelift-codegen/src/machinst/compile.rs","rank":87,"score":162138.27499854352},{"content":"/// Writes `func` to `w` as text.\n\n/// write_function_plain is passed as 'closure' to print instructions as text.\n\n/// pretty_function_error is passed as 'closure' to add error decoration.\n\npub fn decorate_function<FW: FuncWriter>(\n\n func_w: &mut FW,\n\n w: &mut dyn Write,\n\n func: &Function,\n\n annotations: &DisplayFunctionAnnotations,\n\n) -> fmt::Result {\n\n let regs = annotations.isa.map(TargetIsa::register_info);\n\n let regs = regs.as_ref();\n\n\n\n write!(w, \"function \")?;\n\n write_spec(w, func, regs)?;\n\n writeln!(w, \" {{\")?;\n\n let aliases = alias_map(func);\n\n let mut any = func_w.write_preamble(w, func, regs)?;\n\n for block in &func.layout {\n\n if any {\n\n writeln!(w)?;\n\n }\n\n decorate_block(func_w, w, func, &aliases, annotations, block)?;\n\n any = true;\n\n }\n\n writeln!(w, \"}}\")\n\n}\n\n\n\n//----------------------------------------------------------------------\n\n//\n\n// Function spec.\n\n\n","file_path":"cranelift-codegen/src/write.rs","rank":88,"score":162138.27499854352},{"content":"#[allow(dead_code)]\n\npub fn is_all_zeroes(x: &ConstantData) -> bool {\n\n x.iter().all(|&f| f == 0)\n\n}\n\n\n\n/// Check that a constant contains all ones.\n","file_path":"cranelift-codegen/src/predicates.rs","rank":89,"score":160559.8590343457},{"content":"#[allow(dead_code)]\n\npub fn is_all_ones(x: &ConstantData) -> bool {\n\n x.iter().all(|&f| f == 0xff)\n\n}\n\n\n\n/// Check that `x` is the same as `y`.\n","file_path":"cranelift-codegen/src/predicates.rs","rank":90,"score":160559.8590343457},{"content":"pub fn run(files: &[String]) -> CommandResult {\n\n for (i, f) in files.iter().enumerate() {\n\n if i != 0 {\n\n println!();\n\n }\n\n print_cfg(f)?\n\n }\n\n Ok(())\n\n}\n\n\n","file_path":"src/print_cfg.rs","rank":91,"score":160559.8590343457},{"content":"/// Create the register universe for X64.\n\npub fn create_reg_universe() -> RealRegUniverse {\n\n let mut regs = Vec::<(RealReg, String)>::new();\n\n let mut allocable_by_class = [None; NUM_REG_CLASSES];\n\n\n\n // Integer regs\n\n let mut base = regs.len();\n\n // Callee-saved, in the ELF x86_64 ABI\n\n regs.push(info_R12());\n\n regs.push(info_R13());\n\n regs.push(info_R14());\n\n regs.push(info_R15());\n\n regs.push(info_RBX());\n\n // Caller-saved, in the ELF x86_64 ABI\n\n regs.push(info_RSI());\n\n regs.push(info_RDI());\n\n regs.push(info_RAX());\n\n regs.push(info_RCX());\n\n regs.push(info_RDX());\n\n regs.push(info_R8());\n\n regs.push(info_R9());\n","file_path":"cranelift-codegen/src/isa/x64/inst.rs","rank":92,"score":160140.26328467875},{"content":"/// Create the register universe for ARM64.\n\npub fn create_reg_universe() -> RealRegUniverse {\n\n let mut regs = vec![];\n\n let mut allocable_by_class = [None; NUM_REG_CLASSES];\n\n\n\n // Numbering Scheme: we put V-regs first, then X-regs. The X-regs\n\n // exclude several registers: x18 (globally reserved for platform-specific\n\n // purposes), x29 (frame pointer), x30 (link register), x31 (stack pointer\n\n // or zero register, depending on context).\n\n\n\n let v_reg_base = 0u8; // in contiguous real-register index space\n\n let v_reg_count = 32;\n\n for i in 0u8..v_reg_count {\n\n let reg = Reg::new_real(\n\n RegClass::V128,\n\n /* enc = */ i,\n\n /* index = */ v_reg_base + i,\n\n )\n\n .to_real_reg();\n\n let name = format!(\"v{}\", i);\n\n regs.push((reg, name));\n","file_path":"cranelift-codegen/src/isa/arm64/inst/regs.rs","rank":93,"score":158181.654860693},{"content":"/// Try to remove an block.\n\nstruct RemoveBlock {\n\n block: Block,\n\n}\n\n\n\nimpl RemoveBlock {\n\n fn new(func: &Function) -> Self {\n\n Self {\n\n block: func.layout.entry_block().unwrap(),\n\n }\n\n }\n\n}\n\n\n\nimpl Mutator for RemoveBlock {\n\n fn name(&self) -> &'static str {\n\n \"remove block\"\n\n }\n\n\n\n fn mutation_count(&self, func: &Function) -> usize {\n\n block_count(func)\n\n }\n","file_path":"src/bugpoint.rs","rank":94,"score":156347.55293510697},{"content":"struct MergeBlocks {\n\n block: Block,\n\n prev_block: Option<Block>,\n\n}\n\n\n\nimpl MergeBlocks {\n\n fn new(func: &Function) -> Self {\n\n Self {\n\n block: func.layout.entry_block().unwrap(),\n\n prev_block: None,\n\n }\n\n }\n\n}\n\n\n\nimpl Mutator for MergeBlocks {\n\n fn name(&self) -> &'static str {\n\n \"merge blocks\"\n\n }\n\n\n\n fn mutation_count(&self, func: &Function) -> usize {\n","file_path":"src/bugpoint.rs","rank":95,"score":156341.2548777114},{"content":"struct BlockHeaderSSABlockData {\n\n // The predecessors of the Block header block, with the block and branch instruction.\n\n predecessors: PredBlockSmallVec,\n\n // A block header block is sealed if all of its predecessors have been declared.\n\n sealed: bool,\n\n // The block which this block is part of.\n\n block: Block,\n\n // List of current Block arguments for which an earlier def has not been found yet.\n\n undef_variables: Vec<(Variable, Value)>,\n\n}\n\n\n\n/// A opaque reference to a basic block.\n\n#[derive(Copy, Clone, PartialEq, Eq, Debug)]\n\npub struct SSABlock(u32);\n\nimpl EntityRef for SSABlock {\n\n fn new(index: usize) -> Self {\n\n debug_assert!(index < (u32::MAX as usize));\n\n Self(index as u32)\n\n }\n\n\n","file_path":"cranelift-frontend/src/ssa.rs","rank":96,"score":156123.54870152034},{"content":"pub fn magic_u32(d: u32) -> MU32 {\n\n debug_assert_ne!(d, 0);\n\n debug_assert_ne!(d, 1); // d==1 generates out of range shifts.\n\n\n\n let mut do_add: bool = false;\n\n let mut p: i32 = 31;\n\n let nc: u32 = 0xFFFFFFFFu32 - u32::wrapping_neg(d) % d;\n\n let mut q1: u32 = 0x80000000u32 / nc;\n\n let mut r1: u32 = 0x80000000u32 - q1 * nc;\n\n let mut q2: u32 = 0x7FFFFFFFu32 / d;\n\n let mut r2: u32 = 0x7FFFFFFFu32 - q2 * d;\n\n loop {\n\n p = p + 1;\n\n if r1 >= nc - r1 {\n\n q1 = u32::wrapping_add(u32::wrapping_mul(2, q1), 1);\n\n r1 = u32::wrapping_sub(u32::wrapping_mul(2, r1), nc);\n\n } else {\n\n q1 = u32::wrapping_mul(2, q1);\n\n r1 = 2 * r1;\n\n }\n","file_path":"cranelift-codegen/src/divconst_magic_numbers.rs","rank":97,"score":155929.18013109954},{"content":"/// Convert the string `s` to CamelCase.\n\npub fn camel_case(s: &str) -> String {\n\n let mut output_chars = String::with_capacity(s.len());\n\n\n\n let mut capitalize = true;\n\n for curr_char in s.chars() {\n\n if curr_char == '_' {\n\n capitalize = true;\n\n } else {\n\n if capitalize {\n\n output_chars.extend(curr_char.to_uppercase());\n\n } else {\n\n output_chars.push(curr_char);\n\n }\n\n capitalize = false;\n\n }\n\n }\n\n\n\n output_chars\n\n}\n\n\n","file_path":"cranelift-codegen/meta/src/cdsl/mod.rs","rank":98,"score":155929.18013109954},{"content":"pub fn magic_u64(d: u64) -> MU64 {\n\n debug_assert_ne!(d, 0);\n\n debug_assert_ne!(d, 1); // d==1 generates out of range shifts.\n\n\n\n let mut do_add: bool = false;\n\n let mut p: i32 = 63;\n\n let nc: u64 = 0xFFFFFFFFFFFFFFFFu64 - u64::wrapping_neg(d) % d;\n\n let mut q1: u64 = 0x8000000000000000u64 / nc;\n\n let mut r1: u64 = 0x8000000000000000u64 - q1 * nc;\n\n let mut q2: u64 = 0x7FFFFFFFFFFFFFFFu64 / d;\n\n let mut r2: u64 = 0x7FFFFFFFFFFFFFFFu64 - q2 * d;\n\n loop {\n\n p = p + 1;\n\n if r1 >= nc - r1 {\n\n q1 = u64::wrapping_add(u64::wrapping_mul(2, q1), 1);\n\n r1 = u64::wrapping_sub(u64::wrapping_mul(2, r1), nc);\n\n } else {\n\n q1 = u64::wrapping_mul(2, q1);\n\n r1 = 2 * r1;\n\n }\n","file_path":"cranelift-codegen/src/divconst_magic_numbers.rs","rank":99,"score":155929.18013109954}],"string":"[\n {\n \"content\": \"/// Compute the stack frame layout.\\n\\n///\\n\\n/// Determine the total size of this stack frame and assign offsets to all `Spill` and `Explicit`\\n\\n/// stack slots.\\n\\n///\\n\\n/// The total frame size will be a multiple of `alignment` which must be a power of two, unless the\\n\\n/// function doesn't perform any call.\\n\\n///\\n\\n/// Returns the total stack frame size which is also saved in `frame.frame_size`.\\n\\n///\\n\\n/// If the stack frame is too big, returns an `ImplLimitExceeded` error.\\n\\npub fn layout_stack(\\n\\n frame: &mut StackSlots,\\n\\n is_leaf: bool,\\n\\n alignment: StackSize,\\n\\n) -> CodegenResult<StackSize> {\\n\\n // Each object and the whole stack frame must fit in 2 GB such that any relative offset within\\n\\n // the frame fits in a `StackOffset`.\\n\\n let max_size = StackOffset::max_value() as StackSize;\\n\\n debug_assert!(alignment.is_power_of_two() && alignment <= max_size);\\n\\n\\n\\n // We assume a stack that grows toward lower addresses as implemented by modern ISAs. The\\n\\n // stack layout from high to low addresses will be:\\n\\n //\\n\\n // 1. incoming arguments.\\n\\n // 2. spills + explicits + struct returns.\\n\\n // 3. outgoing arguments.\\n\\n //\\n\\n // The incoming arguments can have both positive and negative offsets. A negative offset\\n\\n // incoming arguments is usually the x86 return address pushed by the call instruction, but\\n\\n // it can also be fixed stack slots pushed by an externally generated prologue.\\n\",\n \"file_path\": \"cranelift-codegen/src/stack_layout.rs\",\n \"rank\": 0,\n \"score\": 302749.1217709638\n },\n {\n \"content\": \"/// A helper to extract all the `Type` listings of each variable in `params`\\n\\n/// for only parameters the return true for `is_wasm`, typically paired with\\n\\n/// `is_wasm_return` or `is_wasm_parameter`.\\n\\npub fn wasm_param_types(params: &[ir::AbiParam], is_wasm: impl Fn(usize) -> bool) -> Vec<Type> {\\n\\n let mut ret = Vec::with_capacity(params.len());\\n\\n for (i, param) in params.iter().enumerate() {\\n\\n if is_wasm(i) {\\n\\n ret.push(param.value_type);\\n\\n }\\n\\n }\\n\\n ret\\n\\n}\\n\",\n \"file_path\": \"cranelift-wasm/src/code_translator.rs\",\n \"rank\": 1,\n \"score\": 246916.54000008677\n },\n {\n \"content\": \"/// Translating Block parameters into serializable parameters.\\n\\npub fn populate_params(func: &Function, block: Block) -> Vec<String> {\\n\\n let mut ser_vec: Vec<String> = Vec::new();\\n\\n let parameters = func.dfg.block_params(block);\\n\\n for param in parameters {\\n\\n ser_vec.push(param.to_string());\\n\\n }\\n\\n ser_vec\\n\\n}\\n\\n\\n\\n/// Serializable Data Flow Graph.\\n\\n#[derive(Deserialize, Serialize, Debug)]\\n\\npub struct SerDataFlowGraph {\\n\\n blocks: Vec<SerBlock>,\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-serde/src/serde_clif_json.rs\",\n \"rank\": 2,\n \"score\": 237649.1780876085\n },\n {\n \"content\": \"pub fn populate_inst(func: &Function, block: Block) -> Vec<SerInst> {\\n\\n let mut ser_vec: Vec<SerInst> = Vec::new();\\n\\n let ret_iter = func.layout.block_insts(block);\\n\\n for inst in ret_iter {\\n\\n let ser_inst: SerInst = SerInst::new(inst, &func);\\n\\n ser_vec.push(ser_inst);\\n\\n }\\n\\n ser_vec\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-serde/src/serde_clif_json.rs\",\n \"rank\": 3,\n \"score\": 235020.27437304385\n },\n {\n \"content\": \"pub fn split_block_params(func: &mut ir::Function, cfg: &ControlFlowGraph, block: Block) {\\n\\n let pos = &mut FuncCursor::new(func).at_top(block);\\n\\n let block_params = pos.func.dfg.block_params(block);\\n\\n\\n\\n // Add further splittable types here.\\n\\n fn type_requires_splitting(ty: Type) -> bool {\\n\\n ty == ir::types::I128\\n\\n }\\n\\n\\n\\n // A shortcut. If none of the param types require splitting, exit now. This helps because\\n\\n // the loop below necessarily has to copy the block params into a new vector, so it's better to\\n\\n // avoid doing so when possible.\\n\\n if !block_params\\n\\n .iter()\\n\\n .any(|block_param| type_requires_splitting(pos.func.dfg.value_type(*block_param)))\\n\\n {\\n\\n return;\\n\\n }\\n\\n\\n\\n let mut repairs = Vec::new();\\n\",\n \"file_path\": \"cranelift-codegen/src/legalizer/split.rs\",\n \"rank\": 4,\n \"score\": 227969.6591488701\n },\n {\n \"content\": \"/// Write out the basic block header, outdented:\\n\\n///\\n\\n/// block1:\\n\\n/// block1(v1: i32):\\n\\n/// block10(v4: f64, v5: b1):\\n\\n///\\n\\npub fn write_block_header(\\n\\n w: &mut dyn Write,\\n\\n func: &Function,\\n\\n isa: Option<&dyn TargetIsa>,\\n\\n block: Block,\\n\\n indent: usize,\\n\\n) -> fmt::Result {\\n\\n // The `indent` is the instruction indentation. block headers are 4 spaces out from that.\\n\\n write!(w, \\\"{1:0$}{2}\\\", indent - 4, \\\"\\\", block)?;\\n\\n\\n\\n let regs = isa.map(TargetIsa::register_info);\\n\\n let regs = regs.as_ref();\\n\\n\\n\\n let mut args = func.dfg.block_params(block).iter().cloned();\\n\\n match args.next() {\\n\\n None => return writeln!(w, \\\":\\\"),\\n\\n Some(arg) => {\\n\\n write!(w, \\\"(\\\")?;\\n\\n write_arg(w, func, regs, arg)?;\\n\\n }\\n\\n }\\n\\n // Remaining arguments.\\n\\n for arg in args {\\n\\n write!(w, \\\", \\\")?;\\n\\n write_arg(w, func, regs, arg)?;\\n\\n }\\n\\n writeln!(w, \\\"):\\\")\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/write.rs\",\n \"rank\": 5,\n \"score\": 226036.1325406057\n },\n {\n \"content\": \"/// Get a reference to the stack-pointer register.\\n\\npub fn stack_reg() -> Reg {\\n\\n // XSP (stack) and XZR (zero) are logically different registers which have\\n\\n // the same hardware encoding, and whose meaning, in real arm64\\n\\n // instructions, is context-dependent. For convenience of\\n\\n // universe-construction and for correct printing, we make them be two\\n\\n // different real registers.\\n\\n Reg::new_real(\\n\\n RegClass::I64,\\n\\n /* enc = */ 31,\\n\\n /* index = */ SP_REG_INDEX,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/arm64/inst/regs.rs\",\n \"rank\": 6,\n \"score\": 210233.71025992994\n },\n {\n \"content\": \"/// Serialize all parts of the Cranelift Block data structure, this includes name, parameters, and\\n\\n/// instructions.\\n\\npub fn populate_blocks(func: &Function) -> Vec<SerBlock> {\\n\\n let mut block_vec: Vec<SerBlock> = Vec::new();\\n\\n for block in func.layout.blocks() {\\n\\n let mut ser_block: SerBlock = SerBlock::new(block.to_string());\\n\\n ser_block.params = populate_params(&func, block);\\n\\n ser_block.insts = populate_inst(&func, block);\\n\\n block_vec.push(ser_block);\\n\\n }\\n\\n block_vec\\n\\n}\\n\\n\\n\\n/// Serializable Cranelift IR data flow graph, including all blocks.\\n\\nimpl SerDataFlowGraph {\\n\\n pub fn create_new(func: &Function) -> Self {\\n\\n Self {\\n\\n blocks: populate_blocks(func),\\n\\n }\\n\\n }\\n\\n\\n\\n pub fn new(func: &Function) -> Self {\\n\",\n \"file_path\": \"cranelift-serde/src/serde_clif_json.rs\",\n \"rank\": 7,\n \"score\": 203621.91842774942\n },\n {\n \"content\": \"/// A primitive hash function for matching opcodes.\\n\\npub fn simple_hash(s: &str) -> usize {\\n\\n let mut h: u32 = 5381;\\n\\n for c in s.chars() {\\n\\n h = (h ^ c as u32).wrapping_add(h.rotate_right(6));\\n\\n }\\n\\n h as usize\\n\\n}\\n\\n\\n\\n/// Compute an open addressed, quadratically probed hash table containing\\n\\n/// `items`. The returned table is a list containing the elements of the\\n\\n/// iterable `items` and `None` in unused slots.\\n\",\n \"file_path\": \"cranelift-codegen/shared/src/constant_hash.rs\",\n \"rank\": 8,\n \"score\": 201823.80120253225\n },\n {\n \"content\": \"/// Get a writable reference to the stack-pointer register.\\n\\npub fn writable_stack_reg() -> Writable<Reg> {\\n\\n Writable::from_reg(stack_reg())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/arm64/inst/regs.rs\",\n \"rank\": 9,\n \"score\": 199446.6745903882\n },\n {\n \"content\": \"/// Create a `Block` with the given Wasm parameters.\\n\\npub fn block_with_params<PE: TargetEnvironment + ?Sized>(\\n\\n builder: &mut FunctionBuilder,\\n\\n params: &[wasmparser::Type],\\n\\n environ: &PE,\\n\\n) -> WasmResult<ir::Block> {\\n\\n let block = builder.create_block();\\n\\n for ty in params.iter() {\\n\\n match ty {\\n\\n wasmparser::Type::I32 => {\\n\\n builder.append_block_param(block, ir::types::I32);\\n\\n }\\n\\n wasmparser::Type::I64 => {\\n\\n builder.append_block_param(block, ir::types::I64);\\n\\n }\\n\\n wasmparser::Type::F32 => {\\n\\n builder.append_block_param(block, ir::types::F32);\\n\\n }\\n\\n wasmparser::Type::F64 => {\\n\\n builder.append_block_param(block, ir::types::F64);\\n\\n }\\n\",\n \"file_path\": \"cranelift-wasm/src/translation_utils.rs\",\n \"rank\": 10,\n \"score\": 198579.57189888047\n },\n {\n \"content\": \"#[derive(Clone, Debug, Default)]\\n\\nstruct BlockNode {\\n\\n prev: PackedOption<Block>,\\n\\n next: PackedOption<Block>,\\n\\n first_inst: PackedOption<Inst>,\\n\\n last_inst: PackedOption<Inst>,\\n\\n seq: SequenceNumber,\\n\\n}\\n\\n\\n\\n/// Iterate over blocks in layout order. See `Layout::blocks()`.\\n\\npub struct Blocks<'f> {\\n\\n layout: &'f Layout,\\n\\n next: Option<Block>,\\n\\n}\\n\\n\\n\\nimpl<'f> Iterator for Blocks<'f> {\\n\\n type Item = Block;\\n\\n\\n\\n fn next(&mut self) -> Option<Block> {\\n\\n match self.next {\\n\\n Some(block) => {\\n\",\n \"file_path\": \"cranelift-codegen/src/ir/layout.rs\",\n \"rank\": 11,\n \"score\": 198215.78918559712\n },\n {\n \"content\": \"/// Look for a directive in a comment string.\\n\\n/// The directive is of the form \\\"foo:\\\" and should follow the leading `;` in the comment:\\n\\n///\\n\\n/// ; dominates: block3 block4\\n\\n///\\n\\n/// Return the comment text following the directive.\\n\\npub fn match_directive<'a>(comment: &'a str, directive: &str) -> Option<&'a str> {\\n\\n assert!(\\n\\n directive.ends_with(':'),\\n\\n \\\"Directive must include trailing colon\\\"\\n\\n );\\n\\n let text = comment.trim_start_matches(';').trim_start();\\n\\n if text.starts_with(directive) {\\n\\n Some(text[directive.len()..].trim())\\n\\n } else {\\n\\n None\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-filetests/src/match_directive.rs\",\n \"rank\": 12,\n \"score\": 190534.11070548624\n },\n {\n \"content\": \"pub fn run(\\n\\n files: Vec<String>,\\n\\n flag_verbose: bool,\\n\\n flag_just_decode: bool,\\n\\n flag_check_translation: bool,\\n\\n flag_print: bool,\\n\\n flag_print_disasm: bool,\\n\\n flag_set: &[String],\\n\\n flag_triple: &str,\\n\\n flag_print_size: bool,\\n\\n flag_report_times: bool,\\n\\n flag_calc_value_ranges: bool,\\n\\n) -> Result<(), String> {\\n\\n let parsed = parse_sets_and_triple(flag_set, flag_triple)?;\\n\\n\\n\\n for filename in files {\\n\\n let path = Path::new(&filename);\\n\\n let name = String::from(path.as_os_str().to_string_lossy());\\n\\n handle_module(\\n\\n flag_verbose,\\n\",\n \"file_path\": \"src/wasm.rs\",\n \"rank\": 13,\n \"score\": 187995.71640973928\n },\n {\n \"content\": \"pub fn run(\\n\\n filename: &str,\\n\\n flag_set: &[String],\\n\\n flag_isa: &str,\\n\\n verbose: bool,\\n\\n) -> Result<(), String> {\\n\\n let parsed = parse_sets_and_triple(flag_set, flag_isa)?;\\n\\n let fisa = parsed.as_fisa();\\n\\n\\n\\n let path = Path::new(&filename).to_path_buf();\\n\\n\\n\\n let buffer = read_to_string(&path).map_err(|e| format!(\\\"{}: {}\\\", filename, e))?;\\n\\n let test_file =\\n\\n parse_test(&buffer, ParseOptions::default()).map_err(|e| format!(\\\"{}: {}\\\", filename, e))?;\\n\\n\\n\\n // If we have an isa from the command-line, use that. Otherwise if the\\n\\n // file contains a unique isa, use that.\\n\\n let isa = if let Some(isa) = fisa.isa {\\n\\n isa\\n\\n } else if let Some(isa) = test_file.isa_spec.unique_isa() {\\n\",\n \"file_path\": \"src/bugpoint.rs\",\n \"rank\": 14,\n \"score\": 187995.71640973928\n },\n {\n \"content\": \"pub fn print_all(\\n\\n isa: &dyn TargetIsa,\\n\\n mem: &[u8],\\n\\n code_size: u32,\\n\\n rodata_size: u32,\\n\\n relocs: &PrintRelocs,\\n\\n traps: &PrintTraps,\\n\\n stackmaps: &PrintStackmaps,\\n\\n) -> Result<(), String> {\\n\\n print_bytes(&mem);\\n\\n print_disassembly(isa, &mem[0..code_size as usize])?;\\n\\n print_readonly_data(&mem[code_size as usize..(code_size + rodata_size) as usize]);\\n\\n println!(\\\"\\\\n{}\\\\n{}\\\\n{}\\\", &relocs.text, &traps.text, &stackmaps.text);\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/disasm.rs\",\n \"rank\": 15,\n \"score\": 187995.71640973928\n },\n {\n \"content\": \"pub fn run(\\n\\n files: Vec<String>,\\n\\n flag_print: bool,\\n\\n flag_disasm: bool,\\n\\n flag_report_times: bool,\\n\\n flag_set: &[String],\\n\\n flag_isa: &str,\\n\\n) -> Result<(), String> {\\n\\n let parsed = parse_sets_and_triple(flag_set, flag_isa)?;\\n\\n\\n\\n for filename in files {\\n\\n let path = Path::new(&filename);\\n\\n let name = String::from(path.as_os_str().to_string_lossy());\\n\\n handle_module(\\n\\n flag_print,\\n\\n flag_disasm,\\n\\n flag_report_times,\\n\\n &path.to_path_buf(),\\n\\n &name,\\n\\n parsed.as_fisa(),\\n\\n )?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/compile.rs\",\n \"rank\": 16,\n \"score\": 187995.71640973928\n },\n {\n \"content\": \"fn block_count(func: &Function) -> usize {\\n\\n func.layout.blocks().count()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/bugpoint.rs\",\n \"rank\": 17,\n \"score\": 183912.41023529577\n },\n {\n \"content\": \"/// Compute the final block order.\\n\\npub fn compute_final_block_order<I: VCodeInst>(vcode: &VCode<I>) -> Vec<BlockIndex> {\\n\\n let mut rpo = BlockRPO::new(vcode);\\n\\n rpo.visit(vcode, vcode.entry());\\n\\n rpo.rpo()\\n\\n}\\n\",\n \"file_path\": \"cranelift-codegen/src/machinst/blockorder.rs\",\n \"rank\": 18,\n \"score\": 182378.01332788263\n },\n {\n \"content\": \"/// Parse \\\"set\\\" and \\\"triple\\\" commands.\\n\\npub fn parse_sets_and_triple(\\n\\n flag_set: &[String],\\n\\n flag_triple: &str,\\n\\n) -> Result<OwnedFlagsOrIsa, String> {\\n\\n let mut flag_builder = settings::builder();\\n\\n parse_options(\\n\\n flag_set.iter().map(|x| x.as_str()),\\n\\n &mut flag_builder,\\n\\n Location { line_number: 0 },\\n\\n )\\n\\n .map_err(|err| err.to_string())?;\\n\\n\\n\\n let mut words = flag_triple.trim().split_whitespace();\\n\\n // Look for `target foo`.\\n\\n if let Some(triple_name) = words.next() {\\n\\n let triple = match Triple::from_str(triple_name) {\\n\\n Ok(triple) => triple,\\n\\n Err(parse_error) => return Err(parse_error.to_string()),\\n\\n };\\n\\n let builder_or_backend = isa::lookup(triple).map_err(|err| match err {\\n\",\n \"file_path\": \"src/utils.rs\",\n \"rank\": 19,\n \"score\": 181956.30055495835\n },\n {\n \"content\": \"/// Performs the LICM pass by detecting loops within the CFG and moving\\n\\n/// loop-invariant instructions out of them.\\n\\n/// Changes the CFG and domtree in-place during the operation.\\n\\npub fn do_licm(\\n\\n isa: &dyn TargetIsa,\\n\\n func: &mut Function,\\n\\n cfg: &mut ControlFlowGraph,\\n\\n domtree: &mut DominatorTree,\\n\\n loop_analysis: &mut LoopAnalysis,\\n\\n) {\\n\\n let _tt = timing::licm();\\n\\n debug_assert!(cfg.is_valid());\\n\\n debug_assert!(domtree.is_valid());\\n\\n debug_assert!(loop_analysis.is_valid());\\n\\n\\n\\n for lp in loop_analysis.loops() {\\n\\n // For each loop that we want to optimize we determine the set of loop-invariant\\n\\n // instructions\\n\\n let invariant_insts = remove_loop_invariant_instructions(lp, func, cfg, loop_analysis);\\n\\n // Then we create the loop's pre-header and fill it with the invariant instructions\\n\\n // Then we remove the invariant instructions from the loop body\\n\\n if !invariant_insts.is_empty() {\\n\\n // If the loop has a natural pre-header we use it, otherwise we create it.\\n\",\n \"file_path\": \"cranelift-codegen/src/licm.rs\",\n \"rank\": 20,\n \"score\": 181956.30055495835\n },\n {\n \"content\": \"#[allow(clippy::float_arithmetic)]\\n\\npub fn generate_table<'cont, T, I: iter::Iterator<Item = &'cont T>, H: Fn(&T) -> usize>(\\n\\n items: I,\\n\\n num_items: usize,\\n\\n hash_function: H,\\n\\n) -> Vec<Option<&'cont T>> {\\n\\n let size = (1.20 * num_items as f64) as usize;\\n\\n\\n\\n // Probing code's stop condition relies on the table having one vacant entry at least.\\n\\n let size = if size.is_power_of_two() {\\n\\n size * 2\\n\\n } else {\\n\\n size.next_power_of_two()\\n\\n };\\n\\n\\n\\n let mut table = vec![None; size];\\n\\n\\n\\n for i in items {\\n\\n let mut h = hash_function(&i) % size;\\n\\n let mut s = 0;\\n\\n while table[h].is_some() {\\n\",\n \"file_path\": \"cranelift-codegen/shared/src/constant_hash.rs\",\n \"rank\": 21,\n \"score\": 179922.71730366038\n },\n {\n \"content\": \"/// Write `func` to `w` as equivalent text.\\n\\n/// Use `isa` to emit ISA-dependent annotations.\\n\\npub fn write_function(\\n\\n w: &mut dyn Write,\\n\\n func: &Function,\\n\\n annotations: &DisplayFunctionAnnotations,\\n\\n) -> fmt::Result {\\n\\n decorate_function(&mut PlainWriter, w, func, annotations)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/write.rs\",\n \"rank\": 22,\n \"score\": 179185.69972773295\n },\n {\n \"content\": \"/// Split `value` into halves using the `vsplit` semantics. Do this by reusing existing values if\\n\\n/// possible.\\n\\npub fn vsplit(\\n\\n func: &mut ir::Function,\\n\\n cfg: &ControlFlowGraph,\\n\\n pos: CursorPosition,\\n\\n srcloc: ir::SourceLoc,\\n\\n value: Value,\\n\\n) -> (Value, Value) {\\n\\n split_any(func, cfg, pos, srcloc, value, Opcode::Vconcat)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/legalizer/split.rs\",\n \"rank\": 23,\n \"score\": 179185.69972773295\n },\n {\n \"content\": \"/// Split `value` into two values using the `isplit` semantics. Do this by reusing existing values\\n\\n/// if possible.\\n\\npub fn isplit(\\n\\n func: &mut ir::Function,\\n\\n cfg: &ControlFlowGraph,\\n\\n pos: CursorPosition,\\n\\n srcloc: ir::SourceLoc,\\n\\n value: Value,\\n\\n) -> (Value, Value) {\\n\\n split_any(func, cfg, pos, srcloc, value, Opcode::Iconcat)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/legalizer/split.rs\",\n \"rank\": 24,\n \"score\": 179185.64159186982\n },\n {\n \"content\": \"/// Used for 'pass' subcommand.\\n\\n/// Commands are interpreted as test and executed.\\n\\n///\\n\\n/// Directories are scanned recursively for test cases ending in `.clif`.\\n\\n///\\n\\npub fn run_passes(\\n\\n verbose: bool,\\n\\n report_times: bool,\\n\\n passes: &[String],\\n\\n target: &str,\\n\\n file: &str,\\n\\n) -> TestResult {\\n\\n let mut runner = TestRunner::new(verbose, /* report_times */ false);\\n\\n\\n\\n let path = Path::new(file);\\n\\n if path == Path::new(\\\"-\\\") || path.is_file() {\\n\\n runner.push_test(path);\\n\\n } else {\\n\\n runner.push_dir(path);\\n\\n }\\n\\n\\n\\n let result = runner.run_passes(passes, target);\\n\\n if report_times {\\n\\n println!(\\\"{}\\\", timing::take_current());\\n\\n }\\n\\n result\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-filetests/src/lib.rs\",\n \"rank\": 25,\n \"score\": 179185.47398238117\n },\n {\n \"content\": \"/// Write the operands of `inst` to `w` with a prepended space.\\n\\npub fn write_operands(\\n\\n w: &mut dyn Write,\\n\\n dfg: &DataFlowGraph,\\n\\n isa: Option<&dyn TargetIsa>,\\n\\n inst: Inst,\\n\\n) -> fmt::Result {\\n\\n let pool = &dfg.value_lists;\\n\\n use crate::ir::instructions::InstructionData::*;\\n\\n match dfg[inst] {\\n\\n Unary { arg, .. } => write!(w, \\\" {}\\\", arg),\\n\\n UnaryImm { imm, .. } => write!(w, \\\" {}\\\", imm),\\n\\n UnaryIeee32 { imm, .. } => write!(w, \\\" {}\\\", imm),\\n\\n UnaryIeee64 { imm, .. } => write!(w, \\\" {}\\\", imm),\\n\\n UnaryBool { imm, .. } => write!(w, \\\" {}\\\", imm),\\n\\n UnaryGlobalValue { global_value, .. } => write!(w, \\\" {}\\\", global_value),\\n\\n Binary { args, .. } => write!(w, \\\" {}, {}\\\", args[0], args[1]),\\n\\n BinaryImm { arg, imm, .. } => write!(w, \\\" {}, {}\\\", arg, imm),\\n\\n Ternary { args, .. } => write!(w, \\\" {}, {}, {}\\\", args[0], args[1], args[2]),\\n\\n MultiAry { ref args, .. } => {\\n\\n if args.is_empty() {\\n\",\n \"file_path\": \"cranelift-codegen/src/write.rs\",\n \"rank\": 26,\n \"score\": 179179.908153885\n },\n {\n \"content\": \"/// A helper for bitcasting a sequence of values (e.g. function arguments). If a value is a\\n\\n/// vector type that does not match its expected type, this will modify the value in place to point\\n\\n/// to the result of a `raw_bitcast`. This conversion is necessary to translate Wasm code that\\n\\n/// uses `V128` as function parameters (or implicitly in block parameters) and still use specific\\n\\n/// CLIF types (e.g. `I32X4`) in the function body.\\n\\npub fn bitcast_arguments(\\n\\n arguments: &mut [Value],\\n\\n expected_types: &[Type],\\n\\n builder: &mut FunctionBuilder,\\n\\n) {\\n\\n assert_eq!(arguments.len(), expected_types.len());\\n\\n for (i, t) in expected_types.iter().enumerate() {\\n\\n if t.is_vector() {\\n\\n assert!(\\n\\n builder.func.dfg.value_type(arguments[i]).is_vector(),\\n\\n \\\"unexpected type mismatch: expected {}, argument {} was actually of type {}\\\",\\n\\n t,\\n\\n arguments[i],\\n\\n builder.func.dfg.value_type(arguments[i])\\n\\n );\\n\\n arguments[i] = optionally_bitcast_vector(arguments[i], *t, builder)\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-wasm/src/code_translator.rs\",\n \"rank\": 27,\n \"score\": 176563.43805850425\n },\n {\n \"content\": \"/// Verify value locations for `func`.\\n\\n///\\n\\n/// After register allocation, every value must be assigned to a location - either a register or a\\n\\n/// stack slot. These locations must be compatible with the constraints described by the\\n\\n/// instruction encoding recipes.\\n\\n///\\n\\n/// Values can be temporarily diverted to a different location by using the `regmove`, `regspill`,\\n\\n/// and `regfill` instructions, but only inside an block.\\n\\n///\\n\\n/// If a liveness analysis is provided, it is used to verify that there are no active register\\n\\n/// diversions across control flow edges.\\n\\npub fn verify_locations(\\n\\n isa: &dyn isa::TargetIsa,\\n\\n func: &ir::Function,\\n\\n cfg: &ControlFlowGraph,\\n\\n liveness: Option<&Liveness>,\\n\\n errors: &mut VerifierErrors,\\n\\n) -> VerifierStepResult<()> {\\n\\n let _tt = timing::verify_locations();\\n\\n let verifier = LocationVerifier {\\n\\n isa,\\n\\n func,\\n\\n reginfo: isa.register_info(),\\n\\n encinfo: isa.encoding_info(),\\n\\n cfg,\\n\\n liveness,\\n\\n };\\n\\n verifier.check_constraints(errors)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/verifier/locations.rs\",\n \"rank\": 28,\n \"score\": 176562.8294117054\n },\n {\n \"content\": \"/// Verify liveness information for `func`.\\n\\n///\\n\\n/// The provided control flow graph is assumed to be sound.\\n\\n///\\n\\n/// - All values in the program must have a live range.\\n\\n/// - The live range def point must match where the value is defined.\\n\\n/// - The live range must reach all uses.\\n\\n/// - When a live range is live-in to an block, it must be live at all the predecessors.\\n\\n/// - The live range affinity must be compatible with encoding constraints.\\n\\n///\\n\\n/// We don't verify that live ranges are minimal. This would require recomputing live ranges for\\n\\n/// all values.\\n\\npub fn verify_liveness(\\n\\n isa: &dyn TargetIsa,\\n\\n func: &Function,\\n\\n cfg: &ControlFlowGraph,\\n\\n liveness: &Liveness,\\n\\n errors: &mut VerifierErrors,\\n\\n) -> VerifierStepResult<()> {\\n\\n let _tt = timing::verify_liveness();\\n\\n let verifier = LivenessVerifier {\\n\\n isa,\\n\\n func,\\n\\n cfg,\\n\\n liveness,\\n\\n };\\n\\n verifier.check_blocks(errors)?;\\n\\n verifier.check_insts(errors)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/verifier/liveness.rs\",\n \"rank\": 29,\n \"score\": 176561.02754522604\n },\n {\n \"content\": \"// The emit_stackmaps() function analyzes each instruction to retrieve the liveness of\\n\\n// the defs and operands by traversing a function's blocks in layout order.\\n\\npub fn emit_stackmaps(\\n\\n func: &mut Function,\\n\\n domtree: &DominatorTree,\\n\\n liveness: &Liveness,\\n\\n tracker: &mut LiveValueTracker,\\n\\n isa: &dyn TargetIsa,\\n\\n) {\\n\\n let mut curr = func.layout.entry_block();\\n\\n\\n\\n while let Some(block) = curr {\\n\\n tracker.block_top(block, &func.dfg, liveness, &func.layout, domtree);\\n\\n tracker.drop_dead_params();\\n\\n let mut pos = FuncCursor::new(func);\\n\\n\\n\\n // From the top of the block, step through the instructions.\\n\\n pos.goto_top(block);\\n\\n\\n\\n while let Some(inst) = pos.next_inst() {\\n\\n if let InstructionData::Trap {\\n\\n code: TrapCode::Interrupt,\\n\",\n \"file_path\": \"cranelift-codegen/src/regalloc/safepoint.rs\",\n \"rank\": 30,\n \"score\": 176560.08333939995\n },\n {\n \"content\": \"/// Relax branches and compute the final layout of block headers in `func`.\\n\\n///\\n\\n/// Fill in the `func.offsets` table so the function is ready for binary emission.\\n\\npub fn relax_branches(\\n\\n func: &mut Function,\\n\\n _cfg: &mut ControlFlowGraph,\\n\\n _domtree: &mut DominatorTree,\\n\\n isa: &dyn TargetIsa,\\n\\n) -> CodegenResult<CodeInfo> {\\n\\n let _tt = timing::relax_branches();\\n\\n\\n\\n let encinfo = isa.encoding_info();\\n\\n\\n\\n // Clear all offsets so we can recognize blocks that haven't been visited yet.\\n\\n func.offsets.clear();\\n\\n func.offsets.resize(func.dfg.num_blocks());\\n\\n\\n\\n // Start by removing redundant jumps.\\n\\n fold_redundant_jumps(func, _cfg, _domtree);\\n\\n\\n\\n // Convert jumps to fallthrough instructions where possible.\\n\\n fallthroughs(func);\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/binemit/relaxation.rs\",\n \"rank\": 31,\n \"score\": 176559.8667794984\n },\n {\n \"content\": \"/// Verify conventional SSA form for `func`.\\n\\n///\\n\\n/// Conventional SSA form is represented in Cranelift with the help of virtual registers:\\n\\n///\\n\\n/// - Two values are said to be *PHI-related* if one is an block argument and the other is passed as\\n\\n/// a branch argument in a location that matches the first value.\\n\\n/// - PHI-related values must belong to the same virtual register.\\n\\n/// - Two values in the same virtual register must not have overlapping live ranges.\\n\\n///\\n\\n/// Additionally, we verify this property of virtual registers:\\n\\n///\\n\\n/// - The values in a virtual register are topologically ordered w.r.t. dominance.\\n\\n///\\n\\n/// We don't verify that virtual registers are minimal. Minimal CSSA is not required.\\n\\npub fn verify_cssa(\\n\\n func: &Function,\\n\\n cfg: &ControlFlowGraph,\\n\\n domtree: &DominatorTree,\\n\\n liveness: &Liveness,\\n\\n virtregs: &VirtRegs,\\n\\n errors: &mut VerifierErrors,\\n\\n) -> VerifierStepResult<()> {\\n\\n let _tt = timing::verify_cssa();\\n\\n\\n\\n let mut preorder = DominatorTreePreorder::new();\\n\\n preorder.compute(domtree, &func.layout);\\n\\n\\n\\n let verifier = CssaVerifier {\\n\\n func,\\n\\n cfg,\\n\\n domtree,\\n\\n virtregs,\\n\\n liveness,\\n\\n preorder,\\n\\n };\\n\\n verifier.check_virtregs(errors)?;\\n\\n verifier.check_cssa(errors)?;\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/verifier/cssa.rs\",\n \"rank\": 32,\n \"score\": 176556.4206361621\n },\n {\n \"content\": \"/// Returns the base size of the Recipe, assuming it's fixed. This is the default for most\\n\\n/// encodings; others can be variable and longer than this base size, depending on the registers\\n\\n/// they're using and use a different function, specific per platform.\\n\\npub fn base_size(\\n\\n sizing: &RecipeSizing,\\n\\n _: Encoding,\\n\\n _: Inst,\\n\\n _: &RegDiversions,\\n\\n _: &Function,\\n\\n) -> u8 {\\n\\n sizing.base_size\\n\\n}\\n\\n\\n\\n/// Code size information for an encoding recipe.\\n\\n///\\n\\n/// Encoding recipes may have runtime-determined instruction size.\\n\\npub struct RecipeSizing {\\n\\n /// Minimum size in bytes of instructions encoded with this recipe.\\n\\n pub base_size: u8,\\n\\n\\n\\n /// Method computing the instruction's real size, given inputs and outputs.\\n\\n pub compute_size: SizeCalculatorFn,\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/encoding.rs\",\n \"rank\": 33,\n \"score\": 176555.0735199579\n },\n {\n \"content\": \"/// Verify that CPU flags are used correctly.\\n\\n///\\n\\n/// The value types `iflags` and `fflags` represent CPU flags which usually live in a\\n\\n/// special-purpose register, so they can't be used as freely as other value types that can live in\\n\\n/// any register.\\n\\n///\\n\\n/// We verify the following conditions:\\n\\n///\\n\\n/// - At most one flags value can be live at a time.\\n\\n/// - A flags value can not be live across an instruction that clobbers the flags.\\n\\n///\\n\\n///\\n\\npub fn verify_flags(\\n\\n func: &ir::Function,\\n\\n cfg: &ControlFlowGraph,\\n\\n isa: Option<&dyn isa::TargetIsa>,\\n\\n errors: &mut VerifierErrors,\\n\\n) -> VerifierStepResult<()> {\\n\\n let _tt = timing::verify_flags();\\n\\n if isa.is_none() || isa.unwrap().get_mach_backend().is_none() {\\n\\n let mut verifier = FlagsVerifier {\\n\\n func,\\n\\n cfg,\\n\\n encinfo: isa.map(|isa| isa.encoding_info()),\\n\\n livein: SecondaryMap::new(),\\n\\n };\\n\\n verifier.check(errors)\\n\\n } else {\\n\\n Ok(())\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/verifier/flags.rs\",\n \"rank\": 34,\n \"score\": 176554.50139139063\n },\n {\n \"content\": \"pub fn run(\\n\\n isa: &dyn TargetIsa,\\n\\n func: &mut Function,\\n\\n cfg: &mut ControlFlowGraph,\\n\\n domtree: &mut DominatorTree,\\n\\n topo: &mut TopoOrder,\\n\\n) {\\n\\n let mut ctx = Context {\\n\\n has_new_blocks: false,\\n\\n cur: EncCursor::new(func, isa),\\n\\n domtree,\\n\\n topo,\\n\\n cfg,\\n\\n };\\n\\n ctx.run()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/regalloc/branch_splitting.rs\",\n \"rank\": 35,\n \"score\": 176548.75494350726\n },\n {\n \"content\": \"/// Expand a `call` instruction. This lowers it to a `call_indirect`, which\\n\\n/// is only done if the ABI doesn't support direct calls.\\n\\npub fn expand_call(\\n\\n inst: ir::Inst,\\n\\n func: &mut ir::Function,\\n\\n _cfg: &mut ControlFlowGraph,\\n\\n isa: &dyn TargetIsa,\\n\\n) {\\n\\n // Unpack the instruction.\\n\\n let (func_ref, old_args) = match func.dfg[inst] {\\n\\n ir::InstructionData::Call {\\n\\n opcode,\\n\\n ref args,\\n\\n func_ref,\\n\\n } => {\\n\\n debug_assert_eq!(opcode, ir::Opcode::Call);\\n\\n (func_ref, args.clone())\\n\\n }\\n\\n _ => panic!(\\\"Wanted call: {}\\\", func.dfg.display_inst(inst, None)),\\n\\n };\\n\\n\\n\\n let ptr_ty = isa.pointer_type();\\n\",\n \"file_path\": \"cranelift-codegen/src/legalizer/call.rs\",\n \"rank\": 36,\n \"score\": 176548.75494350726\n },\n {\n \"content\": \"/// Insert ABI conversion code before and after the call instruction at `pos`.\\n\\n///\\n\\n/// Instructions inserted before the call will compute the appropriate ABI values for the\\n\\n/// callee's new ABI-legalized signature. The function call arguments are rewritten in place to\\n\\n/// match the new signature.\\n\\n///\\n\\n/// Instructions will be inserted after the call to convert returned ABI values back to the\\n\\n/// original return values. The call's result values will be adapted to match the new signature.\\n\\n///\\n\\n/// Returns `true` if any instructions were inserted.\\n\\npub fn handle_call_abi(\\n\\n isa: &dyn TargetIsa,\\n\\n mut inst: Inst,\\n\\n func: &mut Function,\\n\\n cfg: &ControlFlowGraph,\\n\\n) -> bool {\\n\\n let pos = &mut FuncCursor::new(func).at_inst(inst);\\n\\n pos.use_srcloc(inst);\\n\\n\\n\\n // Start by checking if the argument types already match the signature.\\n\\n let sig_ref = match check_call_signature(&pos.func.dfg, inst) {\\n\\n Ok(_) => return spill_call_arguments(pos),\\n\\n Err(s) => s,\\n\\n };\\n\\n\\n\\n let sig = &pos.func.dfg.signatures[sig_ref];\\n\\n let old_sig = &pos.func.dfg.old_signatures[sig_ref];\\n\\n\\n\\n if sig.uses_struct_return_param()\\n\\n && old_sig\\n\",\n \"file_path\": \"cranelift-codegen/src/legalizer/boundary.rs\",\n \"rank\": 37,\n \"score\": 174063.4244174118\n },\n {\n \"content\": \"/// Get a function reference for the probestack function in `func`.\\n\\n///\\n\\n/// If there is an existing reference, use it, otherwise make a new one.\\n\\npub fn get_probestack_funcref(\\n\\n func: &mut Function,\\n\\n reg_type: Type,\\n\\n arg_reg: RegUnit,\\n\\n isa: &dyn TargetIsa,\\n\\n) -> FuncRef {\\n\\n find_funcref(LibCall::Probestack, func)\\n\\n .unwrap_or_else(|| make_funcref_for_probestack(func, reg_type, arg_reg, isa))\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/ir/libcall.rs\",\n \"rank\": 38,\n \"score\": 174062.94889930714\n },\n {\n \"content\": \"/// Eliminate unreachable code.\\n\\n///\\n\\n/// This pass deletes whole blocks that can't be reached from the entry block. It does not delete\\n\\n/// individual instructions whose results are unused.\\n\\n///\\n\\n/// The reachability analysis is performed by the dominator tree analysis.\\n\\npub fn eliminate_unreachable_code(\\n\\n func: &mut ir::Function,\\n\\n cfg: &mut ControlFlowGraph,\\n\\n domtree: &DominatorTree,\\n\\n) {\\n\\n let _tt = timing::unreachable_code();\\n\\n let mut pos = FuncCursor::new(func);\\n\\n while let Some(block) = pos.next_block() {\\n\\n if domtree.is_reachable(block) {\\n\\n continue;\\n\\n }\\n\\n\\n\\n debug!(\\\"Eliminating unreachable {}\\\", block);\\n\\n // Move the cursor out of the way and make sure the next lop iteration goes to the right\\n\\n // block.\\n\\n pos.prev_block();\\n\\n\\n\\n // Remove all instructions from `block`.\\n\\n while let Some(inst) = pos.func.layout.first_inst(block) {\\n\\n debug!(\\\" - {}\\\", pos.func.dfg.display_inst(inst, None));\\n\",\n \"file_path\": \"cranelift-codegen/src/unreachable_code.rs\",\n \"rank\": 39,\n \"score\": 174058.15369404017\n },\n {\n \"content\": \"/// Parses the Table section of the wasm module.\\n\\npub fn parse_table_section(\\n\\n tables: TableSectionReader,\\n\\n environ: &mut dyn ModuleEnvironment,\\n\\n) -> WasmResult<()> {\\n\\n environ.reserve_tables(tables.get_count())?;\\n\\n\\n\\n for entry in tables {\\n\\n let table = entry?;\\n\\n environ.declare_table(Table {\\n\\n ty: match tabletype_to_type(table.element_type, environ)? {\\n\\n Some(t) => TableElementType::Val(t),\\n\\n None => TableElementType::Func,\\n\\n },\\n\\n minimum: table.limits.initial,\\n\\n maximum: table.limits.maximum,\\n\\n })?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-wasm/src/sections_translator.rs\",\n \"rank\": 40,\n \"score\": 174051.73474603065\n },\n {\n \"content\": \"/// Expand a `global_value` instruction according to the definition of the global value.\\n\\npub fn expand_global_value(\\n\\n inst: ir::Inst,\\n\\n func: &mut ir::Function,\\n\\n _cfg: &mut ControlFlowGraph,\\n\\n isa: &dyn TargetIsa,\\n\\n) {\\n\\n // Unpack the instruction.\\n\\n let gv = match func.dfg[inst] {\\n\\n ir::InstructionData::UnaryGlobalValue {\\n\\n opcode,\\n\\n global_value,\\n\\n } => {\\n\\n debug_assert_eq!(opcode, ir::Opcode::GlobalValue);\\n\\n global_value\\n\\n }\\n\\n _ => panic!(\\\"Wanted global_value: {}\\\", func.dfg.display_inst(inst, None)),\\n\\n };\\n\\n\\n\\n match func.global_values[gv] {\\n\\n ir::GlobalValueData::VMContext => vmctx_addr(inst, func),\\n\",\n \"file_path\": \"cranelift-codegen/src/legalizer/globalvalue.rs\",\n \"rank\": 41,\n \"score\": 174051.73474603065\n },\n {\n \"content\": \"/// Legalize `sig`.\\n\\npub fn legalize_signature(\\n\\n sig: &mut Cow<ir::Signature>,\\n\\n triple: &Triple,\\n\\n _current: bool,\\n\\n shared_flags: &shared_settings::Flags,\\n\\n isa_flags: &isa_settings::Flags,\\n\\n) {\\n\\n let bits;\\n\\n let mut args;\\n\\n\\n\\n match triple.pointer_width().unwrap() {\\n\\n PointerWidth::U16 => panic!(),\\n\\n PointerWidth::U32 => {\\n\\n bits = 32;\\n\\n args = Args::new(bits, &[], 0, sig.call_conv, shared_flags, isa_flags);\\n\\n }\\n\\n PointerWidth::U64 => {\\n\\n bits = 64;\\n\\n args = if sig.call_conv.extends_windows_fastcall() {\\n\\n Args::new(\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x86/abi.rs\",\n \"rank\": 42,\n \"score\": 174051.73474603065\n },\n {\n \"content\": \"/// Get the parameter and result types for the given Wasm blocktype.\\n\\npub fn blocktype_params_results(\\n\\n module_translation_state: &ModuleTranslationState,\\n\\n ty_or_ft: wasmparser::TypeOrFuncType,\\n\\n) -> WasmResult<(&[wasmparser::Type], &[wasmparser::Type])> {\\n\\n Ok(match ty_or_ft {\\n\\n wasmparser::TypeOrFuncType::Type(ty) => match ty {\\n\\n wasmparser::Type::I32 => (&[], &[wasmparser::Type::I32]),\\n\\n wasmparser::Type::I64 => (&[], &[wasmparser::Type::I64]),\\n\\n wasmparser::Type::F32 => (&[], &[wasmparser::Type::F32]),\\n\\n wasmparser::Type::F64 => (&[], &[wasmparser::Type::F64]),\\n\\n wasmparser::Type::V128 => (&[], &[wasmparser::Type::V128]),\\n\\n wasmparser::Type::AnyRef => (&[], &[wasmparser::Type::AnyRef]),\\n\\n wasmparser::Type::AnyFunc => (&[], &[wasmparser::Type::AnyFunc]),\\n\\n wasmparser::Type::NullRef => (&[], &[wasmparser::Type::NullRef]),\\n\\n wasmparser::Type::EmptyBlockType => (&[], &[]),\\n\\n ty => return Err(wasm_unsupported!(\\\"blocktype_params_results: type {:?}\\\", ty)),\\n\\n },\\n\\n wasmparser::TypeOrFuncType::FuncType(ty_index) => {\\n\\n let sig_idx = SignatureIndex::from_u32(ty_index);\\n\\n let (ref params, ref returns) = module_translation_state.wasm_types[sig_idx];\\n\\n (&*params, &*returns)\\n\\n }\\n\\n })\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-wasm/src/translation_utils.rs\",\n \"rank\": 43,\n \"score\": 174051.73474603065\n },\n {\n \"content\": \"/// Parses the Type section of the wasm module.\\n\\npub fn parse_type_section(\\n\\n types: TypeSectionReader,\\n\\n module_translation_state: &mut ModuleTranslationState,\\n\\n environ: &mut dyn ModuleEnvironment,\\n\\n) -> WasmResult<()> {\\n\\n let count = types.get_count();\\n\\n module_translation_state.wasm_types.reserve(count as usize);\\n\\n environ.reserve_signatures(count)?;\\n\\n\\n\\n for entry in types {\\n\\n match entry? {\\n\\n FuncType {\\n\\n form: wasmparser::Type::Func,\\n\\n params,\\n\\n returns,\\n\\n } => {\\n\\n let mut sig =\\n\\n Signature::new(ModuleEnvironment::target_config(environ).default_call_conv);\\n\\n sig.params.extend(params.iter().map(|ty| {\\n\\n let cret_arg: ir::Type = type_to_type(*ty, environ)\\n\",\n \"file_path\": \"cranelift-wasm/src/sections_translator.rs\",\n \"rank\": 44,\n \"score\": 174051.73474603065\n },\n {\n \"content\": \"/// Parses the Global section of the wasm module.\\n\\npub fn parse_global_section(\\n\\n globals: GlobalSectionReader,\\n\\n environ: &mut dyn ModuleEnvironment,\\n\\n) -> WasmResult<()> {\\n\\n environ.reserve_globals(globals.get_count())?;\\n\\n\\n\\n for entry in globals {\\n\\n let wasmparser::Global {\\n\\n ty: GlobalType {\\n\\n content_type,\\n\\n mutable,\\n\\n },\\n\\n init_expr,\\n\\n } = entry?;\\n\\n let mut init_expr_reader = init_expr.get_binary_reader();\\n\\n let initializer = match init_expr_reader.read_operator()? {\\n\\n Operator::I32Const { value } => GlobalInit::I32Const(value),\\n\\n Operator::I64Const { value } => GlobalInit::I64Const(value),\\n\\n Operator::F32Const { value } => GlobalInit::F32Const(value.bits()),\\n\\n Operator::F64Const { value } => GlobalInit::F64Const(value.bits()),\\n\",\n \"file_path\": \"cranelift-wasm/src/sections_translator.rs\",\n \"rank\": 45,\n \"score\": 174051.73474603065\n },\n {\n \"content\": \"/// Expand a `table_addr` instruction according to the definition of the table.\\n\\npub fn expand_table_addr(\\n\\n inst: ir::Inst,\\n\\n func: &mut ir::Function,\\n\\n _cfg: &mut ControlFlowGraph,\\n\\n _isa: &dyn TargetIsa,\\n\\n) {\\n\\n // Unpack the instruction.\\n\\n let (table, index, element_offset) = match func.dfg[inst] {\\n\\n ir::InstructionData::TableAddr {\\n\\n opcode,\\n\\n table,\\n\\n arg,\\n\\n offset,\\n\\n } => {\\n\\n debug_assert_eq!(opcode, ir::Opcode::TableAddr);\\n\\n (table, arg, offset)\\n\\n }\\n\\n _ => panic!(\\\"Wanted table_addr: {}\\\", func.dfg.display_inst(inst, None)),\\n\\n };\\n\\n\\n\\n dynamic_addr(inst, table, index, element_offset, func);\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/legalizer/table.rs\",\n \"rank\": 46,\n \"score\": 174051.73474603065\n },\n {\n \"content\": \"/// Some SIMD operations only operate on I8X16 in CLIF; this will convert them to that type by\\n\\n/// adding a raw_bitcast if necessary.\\n\\npub fn optionally_bitcast_vector(\\n\\n value: Value,\\n\\n needed_type: Type,\\n\\n builder: &mut FunctionBuilder,\\n\\n) -> Value {\\n\\n if builder.func.dfg.value_type(value) != needed_type {\\n\\n builder.ins().raw_bitcast(needed_type, value)\\n\\n } else {\\n\\n value\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-wasm/src/code_translator.rs\",\n \"rank\": 47,\n \"score\": 174051.73474603065\n },\n {\n \"content\": \"/// Legalize `sig` for RISC-V.\\n\\npub fn legalize_signature(\\n\\n sig: &mut Cow<ir::Signature>,\\n\\n triple: &Triple,\\n\\n isa_flags: &settings::Flags,\\n\\n current: bool,\\n\\n) {\\n\\n let bits = triple.pointer_width().unwrap().bits();\\n\\n\\n\\n let mut args = Args::new(bits, isa_flags.enable_e());\\n\\n if let Some(new_params) = legalize_args(&sig.params, &mut args) {\\n\\n sig.to_mut().params = new_params;\\n\\n }\\n\\n\\n\\n let mut rets = Args::new(bits, isa_flags.enable_e());\\n\\n if let Some(new_returns) = legalize_args(&sig.returns, &mut rets) {\\n\\n sig.to_mut().returns = new_returns;\\n\\n }\\n\\n\\n\\n if current {\\n\\n let ptr = Type::int(u16::from(bits)).unwrap();\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/riscv/abi.rs\",\n \"rank\": 48,\n \"score\": 174051.73474603065\n },\n {\n \"content\": \"pub fn i_Shift_R(\\n\\n is64: bool,\\n\\n kind: ShiftKind,\\n\\n nBits: u8, // 1 .. #bits-in-type - 1, or 0 to mean \\\"%cl\\\"\\n\\n wdst: Writable<Reg>,\\n\\n) -> Inst {\\n\\n let dst = wdst.to_reg();\\n\\n debug_assert!(nBits < if is64 { 64 } else { 32 });\\n\\n debug_assert!(dst.get_class() == RegClass::I64);\\n\\n Inst::Shift_R {\\n\\n is64,\\n\\n kind,\\n\\n nBits,\\n\\n dst,\\n\\n }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 49,\n \"score\": 174051.73474603065\n },\n {\n \"content\": \"/// Parses the Function section of the wasm module.\\n\\npub fn parse_function_section(\\n\\n functions: FunctionSectionReader,\\n\\n environ: &mut dyn ModuleEnvironment,\\n\\n) -> WasmResult<()> {\\n\\n let num_functions = functions.get_count();\\n\\n if num_functions == std::u32::MAX {\\n\\n // We reserve `u32::MAX` for our own use in cranelift-entity.\\n\\n return Err(WasmError::ImplLimitExceeded);\\n\\n }\\n\\n\\n\\n environ.reserve_func_types(num_functions)?;\\n\\n\\n\\n for entry in functions {\\n\\n let sigindex = entry?;\\n\\n environ.declare_func_type(SignatureIndex::from_u32(sigindex))?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-wasm/src/sections_translator.rs\",\n \"rank\": 50,\n \"score\": 174051.73474603065\n },\n {\n \"content\": \"/// Expand a `heap_addr` instruction according to the definition of the heap.\\n\\npub fn expand_heap_addr(\\n\\n inst: ir::Inst,\\n\\n func: &mut ir::Function,\\n\\n cfg: &mut ControlFlowGraph,\\n\\n isa: &dyn TargetIsa,\\n\\n) {\\n\\n // Unpack the instruction.\\n\\n let (heap, offset, access_size) = match func.dfg[inst] {\\n\\n ir::InstructionData::HeapAddr {\\n\\n opcode,\\n\\n heap,\\n\\n arg,\\n\\n imm,\\n\\n } => {\\n\\n debug_assert_eq!(opcode, ir::Opcode::HeapAddr);\\n\\n (heap, arg, imm.into())\\n\\n }\\n\\n _ => panic!(\\\"Wanted heap_addr: {}\\\", func.dfg.display_inst(inst, None)),\\n\\n };\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/legalizer/heap.rs\",\n \"rank\": 51,\n \"score\": 174051.73474603065\n },\n {\n \"content\": \"/// Parses the Memory section of the wasm module.\\n\\npub fn parse_memory_section(\\n\\n memories: MemorySectionReader,\\n\\n environ: &mut dyn ModuleEnvironment,\\n\\n) -> WasmResult<()> {\\n\\n environ.reserve_memories(memories.get_count())?;\\n\\n\\n\\n for entry in memories {\\n\\n let memory = entry?;\\n\\n environ.declare_memory(Memory {\\n\\n minimum: memory.limits.initial,\\n\\n maximum: memory.limits.maximum,\\n\\n shared: memory.shared,\\n\\n })?;\\n\\n }\\n\\n\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-wasm/src/sections_translator.rs\",\n \"rank\": 52,\n \"score\": 174051.73474603065\n },\n {\n \"content\": \"/// Rearrange the elements of the mutable slice `s` such that elements where `p(t)` is true precede\\n\\n/// the elements where `p(t)` is false.\\n\\n///\\n\\n/// The order of elements is not preserved, unless the slice is already partitioned.\\n\\n///\\n\\n/// Returns the number of elements where `p(t)` is true.\\n\\npub fn partition_slice<T, F>(s: &mut [T], mut p: F) -> usize\\n\\nwhere\\n\\n F: FnMut(&T) -> bool,\\n\\n{\\n\\n // The iterator works like a deque which we can pop from both ends.\\n\\n let mut i = s.iter_mut();\\n\\n\\n\\n // Number of elements for which the predicate is known to be true.\\n\\n let mut pos = 0;\\n\\n\\n\\n loop {\\n\\n // Find the first element for which the predicate fails.\\n\\n let head = loop {\\n\\n match i.next() {\\n\\n Some(head) => {\\n\\n if !p(&head) {\\n\\n break head;\\n\\n }\\n\\n }\\n\\n None => return pos,\\n\",\n \"file_path\": \"cranelift-codegen/src/partition_slice.rs\",\n \"rank\": 53,\n \"score\": 173088.6357418144\n },\n {\n \"content\": \"fn block_ranges(indices: &[InstIx], len: usize) -> Vec<(usize, usize)> {\\n\\n let v = indices\\n\\n .iter()\\n\\n .map(|iix| iix.get() as usize)\\n\\n .chain(iter::once(len))\\n\\n .collect::<Vec<usize>>();\\n\\n v.windows(2).map(|p| (p[0], p[1])).collect()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/machinst/vcode.rs\",\n \"rank\": 54,\n \"score\": 172975.11310737938\n },\n {\n \"content\": \"pub fn i_Cmp_RMI_R(\\n\\n size: u8, // 1, 2, 4 or 8\\n\\n src: RMI,\\n\\n dst: Reg,\\n\\n) -> Inst {\\n\\n debug_assert!(size == 8 || size == 4 || size == 2 || size == 1);\\n\\n debug_assert!(dst.get_class() == RegClass::I64);\\n\\n Inst::Cmp_RMI_R { size, src, dst }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 55,\n \"score\": 171678.84559699075\n },\n {\n \"content\": \"pub fn i_Mov_R_M(\\n\\n size: u8, // 1, 2, 4 or 8\\n\\n src: Reg,\\n\\n addr: Addr,\\n\\n) -> Inst {\\n\\n debug_assert!(size == 8 || size == 4 || size == 2 || size == 1);\\n\\n debug_assert!(src.get_class() == RegClass::I64);\\n\\n Inst::Mov_R_M { size, src, addr }\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 56,\n \"score\": 171678.84559699075\n },\n {\n \"content\": \"#[cfg(feature = \\\"unwind\\\")]\\n\\npub fn emit_unwind_info(\\n\\n func: &ir::Function,\\n\\n isa: &dyn TargetIsa,\\n\\n kind: FrameUnwindKind,\\n\\n sink: &mut dyn FrameUnwindSink,\\n\\n) {\\n\\n match kind {\\n\\n FrameUnwindKind::Fastcall => {\\n\\n // Assumption: RBP is being used as the frame pointer\\n\\n // In the future, Windows fastcall codegen should usually omit the frame pointer\\n\\n if let Some(info) = UnwindInfo::try_from_func(func, isa, Some(RU::rbp.into())) {\\n\\n info.emit(sink);\\n\\n }\\n\\n }\\n\\n FrameUnwindKind::Libunwind => {\\n\\n if func.frame_layout.is_some() {\\n\\n emit_fde(func, isa, sink);\\n\\n }\\n\\n }\\n\\n }\\n\\n}\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x86/abi.rs\",\n \"rank\": 57,\n \"score\": 171678.84559699075\n },\n {\n \"content\": \"/// Parse an iterator of command line options and apply them to `config`.\\n\\npub fn parse_options<'a, I>(\\n\\n iter: I,\\n\\n config: &mut dyn Configurable,\\n\\n loc: Location,\\n\\n) -> ParseResult<()>\\n\\nwhere\\n\\n I: Iterator<Item = &'a str>,\\n\\n{\\n\\n for opt in iter.map(TestOption::new) {\\n\\n match opt {\\n\\n TestOption::Flag(name) => match config.enable(name) {\\n\\n Ok(_) => {}\\n\\n Err(SetError::BadName(name)) => return err!(loc, \\\"unknown flag '{}'\\\", name),\\n\\n Err(_) => return err!(loc, \\\"not a boolean flag: '{}'\\\", opt),\\n\\n },\\n\\n TestOption::Value(name, value) => match config.set(name, value) {\\n\\n Ok(_) => {}\\n\\n Err(SetError::BadName(name)) => return err!(loc, \\\"unknown setting '{}'\\\", name),\\n\\n Err(SetError::BadType) => return err!(loc, \\\"invalid setting type: '{}'\\\", opt),\\n\\n Err(SetError::BadValue(expected)) => {\\n\",\n \"file_path\": \"cranelift-reader/src/isaspec.rs\",\n \"rank\": 58,\n \"score\": 169639.33755543776\n },\n {\n \"content\": \"pub fn print_bytes(mem: &[u8]) {\\n\\n print!(\\\".byte \\\");\\n\\n let mut first = true;\\n\\n for byte in mem.iter() {\\n\\n if first {\\n\\n first = false;\\n\\n } else {\\n\\n print!(\\\", \\\");\\n\\n }\\n\\n print!(\\\"{}\\\", byte);\\n\\n }\\n\\n println!();\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/disasm.rs\",\n \"rank\": 59,\n \"score\": 169639.33755543776\n },\n {\n \"content\": \"/// Pretty-print a verifier error.\\n\\npub fn pretty_verifier_error<'a>(\\n\\n func: &ir::Function,\\n\\n isa: Option<&dyn TargetIsa>,\\n\\n func_w: Option<Box<dyn FuncWriter + 'a>>,\\n\\n errors: VerifierErrors,\\n\\n) -> String {\\n\\n let mut errors = errors.0;\\n\\n let mut w = String::new();\\n\\n let num_errors = errors.len();\\n\\n\\n\\n decorate_function(\\n\\n &mut PrettyVerifierError(func_w.unwrap_or_else(|| Box::new(PlainWriter)), &mut errors),\\n\\n &mut w,\\n\\n func,\\n\\n &isa.into(),\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n writeln!(\\n\\n w,\\n\\n \\\"\\\\n; {} verifier error{} detected (see above). Compilation aborted.\\\",\\n\\n num_errors,\\n\\n if num_errors == 1 { \\\"\\\" } else { \\\"s\\\" }\\n\\n )\\n\\n .unwrap();\\n\\n\\n\\n w\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/print_errors.rs\",\n \"rank\": 60,\n \"score\": 168973.17190016102\n },\n {\n \"content\": \"pub fn i_Ret() -> Inst {\\n\\n Inst::Ret {}\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 61,\n \"score\": 168973.17190016102\n },\n {\n \"content\": \"/// Translate a sequence of bytes forming a valid Wasm binary into a list of valid Cranelift IR\\n\\n/// [`Function`](cranelift_codegen::ir::Function).\\n\\npub fn translate_module<'data>(\\n\\n data: &'data [u8],\\n\\n environ: &mut dyn ModuleEnvironment<'data>,\\n\\n) -> WasmResult<ModuleTranslationState> {\\n\\n let _tt = timing::wasm_translate_module();\\n\\n let mut reader = ModuleReader::new(data)?;\\n\\n let mut module_translation_state = ModuleTranslationState::new();\\n\\n\\n\\n while !reader.eof() {\\n\\n let section = reader.read()?;\\n\\n match section.content()? {\\n\\n SectionContent::Type(types) => {\\n\\n parse_type_section(types, &mut module_translation_state, environ)?;\\n\\n }\\n\\n\\n\\n SectionContent::Import(imports) => {\\n\\n parse_import_section(imports, environ)?;\\n\\n }\\n\\n\\n\\n SectionContent::Function(functions) => {\\n\",\n \"file_path\": \"cranelift-wasm/src/module_translator.rs\",\n \"rank\": 62,\n \"score\": 168973.17190016102\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn has_length_of(value_list: &ir::ValueList, num: usize, func: &ir::Function) -> bool {\\n\\n value_list.len(&func.dfg.value_lists) == num\\n\\n}\\n\\n\\n\\n#[cfg(test)]\\n\\nmod tests {\\n\\n use super::*;\\n\\n\\n\\n #[test]\\n\\n fn cvt_u32() {\\n\\n let x1 = 0u32;\\n\\n let x2 = 1u32;\\n\\n let x3 = 0xffff_fff0u32;\\n\\n\\n\\n assert!(is_signed_int(x1, 1, 0));\\n\\n assert!(is_signed_int(x1, 2, 1));\\n\\n assert!(is_signed_int(x2, 2, 0));\\n\\n assert!(!is_signed_int(x2, 2, 1));\\n\\n\\n\\n // `u32` doesn't sign-extend when converted to `i64`.\\n\",\n \"file_path\": \"cranelift-codegen/src/predicates.rs\",\n \"rank\": 63,\n \"score\": 167811.15635274095\n },\n {\n \"content\": \"pub fn print_readonly_data(mem: &[u8]) {\\n\\n if mem.is_empty() {\\n\\n return;\\n\\n }\\n\\n\\n\\n println!(\\\"\\\\nFollowed by {} bytes of read-only data:\\\", mem.len());\\n\\n\\n\\n for (i, byte) in mem.iter().enumerate() {\\n\\n if i % 16 == 0 {\\n\\n if i != 0 {\\n\\n println!();\\n\\n }\\n\\n print!(\\\"{:4}: \\\", i);\\n\\n }\\n\\n if i % 4 == 0 {\\n\\n print!(\\\" \\\");\\n\\n }\\n\\n print!(\\\"{:02x} \\\", byte);\\n\\n }\\n\\n println!();\\n\\n}\\n\",\n \"file_path\": \"src/disasm.rs\",\n \"rank\": 64,\n \"score\": 167008.18434506003\n },\n {\n \"content\": \"/// Parses the Name section of the wasm module.\\n\\npub fn parse_name_section<'data>(\\n\\n mut names: NameSectionReader<'data>,\\n\\n environ: &mut dyn ModuleEnvironment<'data>,\\n\\n) -> WasmResult<()> {\\n\\n while let Ok(subsection) = names.read() {\\n\\n match subsection {\\n\\n wasmparser::Name::Function(function_subsection) => {\\n\\n if let Some(function_names) = function_subsection\\n\\n .get_map()\\n\\n .ok()\\n\\n .and_then(parse_function_name_subsection)\\n\\n {\\n\\n for (index, name) in function_names {\\n\\n environ.declare_func_name(index, name)?;\\n\\n }\\n\\n }\\n\\n return Ok(());\\n\\n }\\n\\n wasmparser::Name::Local(_) | wasmparser::Name::Module(_) => {}\\n\\n };\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-wasm/src/sections_translator.rs\",\n \"rank\": 65,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"/// Parses the Data section of the wasm module.\\n\\npub fn parse_data_section<'data>(\\n\\n data: DataSectionReader<'data>,\\n\\n environ: &mut dyn ModuleEnvironment<'data>,\\n\\n) -> WasmResult<()> {\\n\\n environ.reserve_data_initializers(data.get_count())?;\\n\\n\\n\\n for (index, entry) in data.into_iter().enumerate() {\\n\\n let Data { kind, data } = entry?;\\n\\n match kind {\\n\\n DataKind::Active {\\n\\n memory_index,\\n\\n init_expr,\\n\\n } => {\\n\\n let mut init_expr_reader = init_expr.get_binary_reader();\\n\\n let (base, offset) = match init_expr_reader.read_operator()? {\\n\\n Operator::I32Const { value } => (None, value as u32 as usize),\\n\\n Operator::GlobalGet { global_index } => {\\n\\n (Some(GlobalIndex::from_u32(global_index)), 0)\\n\\n }\\n\\n ref s => {\\n\",\n \"file_path\": \"cranelift-wasm/src/sections_translator.rs\",\n \"rank\": 66,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"pub fn reg_RDI() -> Reg {\\n\\n info_RDI().0.to_reg()\\n\\n}\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 67,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"pub fn reg_RBP() -> Reg {\\n\\n info_RBP().0.to_reg()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 68,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"pub fn reg_RSI() -> Reg {\\n\\n info_RSI().0.to_reg()\\n\\n}\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 69,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"pub fn reg_R8() -> Reg {\\n\\n info_R8().0.to_reg()\\n\\n}\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 70,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"pub fn reg_RDX() -> Reg {\\n\\n info_RDX().0.to_reg()\\n\\n}\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 71,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"/// Parses the Import section of the wasm module.\\n\\npub fn parse_import_section<'data>(\\n\\n imports: ImportSectionReader<'data>,\\n\\n environ: &mut dyn ModuleEnvironment<'data>,\\n\\n) -> WasmResult<()> {\\n\\n environ.reserve_imports(imports.get_count())?;\\n\\n\\n\\n for entry in imports {\\n\\n let import = entry?;\\n\\n let module_name = import.module;\\n\\n let field_name = import.field;\\n\\n\\n\\n match import.ty {\\n\\n ImportSectionEntryType::Function(sig) => {\\n\\n environ.declare_func_import(\\n\\n SignatureIndex::from_u32(sig),\\n\\n module_name,\\n\\n field_name,\\n\\n )?;\\n\\n }\\n\\n ImportSectionEntryType::Memory(MemoryType {\\n\",\n \"file_path\": \"cranelift-wasm/src/sections_translator.rs\",\n \"rank\": 72,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"/// Parses the Element section of the wasm module.\\n\\npub fn parse_element_section<'data>(\\n\\n elements: ElementSectionReader<'data>,\\n\\n environ: &mut dyn ModuleEnvironment,\\n\\n) -> WasmResult<()> {\\n\\n environ.reserve_table_elements(elements.get_count())?;\\n\\n\\n\\n for (index, entry) in elements.into_iter().enumerate() {\\n\\n let Element { kind, items, ty } = entry?;\\n\\n if ty != Type::AnyFunc {\\n\\n return Err(wasm_unsupported!(\\n\\n \\\"unsupported table element type: {:?}\\\",\\n\\n ty\\n\\n ));\\n\\n }\\n\\n let segments = read_elems(&items)?;\\n\\n match kind {\\n\\n ElementKind::Active {\\n\\n table_index,\\n\\n init_expr,\\n\\n } => {\\n\",\n \"file_path\": \"cranelift-wasm/src/sections_translator.rs\",\n \"rank\": 73,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"/// Parses the Export section of the wasm module.\\n\\npub fn parse_export_section<'data>(\\n\\n exports: ExportSectionReader<'data>,\\n\\n environ: &mut dyn ModuleEnvironment<'data>,\\n\\n) -> WasmResult<()> {\\n\\n environ.reserve_exports(exports.get_count())?;\\n\\n\\n\\n for entry in exports {\\n\\n let Export {\\n\\n field,\\n\\n ref kind,\\n\\n index,\\n\\n } = entry?;\\n\\n\\n\\n // The input has already been validated, so we should be able to\\n\\n // assume valid UTF-8 and use `from_utf8_unchecked` if performance\\n\\n // becomes a concern here.\\n\\n let index = index as usize;\\n\\n match *kind {\\n\\n ExternalKind::Function => environ.declare_func_export(FuncIndex::new(index), field)?,\\n\\n ExternalKind::Table => environ.declare_table_export(TableIndex::new(index), field)?,\\n\",\n \"file_path\": \"cranelift-wasm/src/sections_translator.rs\",\n \"rank\": 74,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"pub fn reg_RCX() -> Reg {\\n\\n info_RCX().0.to_reg()\\n\\n}\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 75,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"// For external consumption. It's probably important that LLVM optimises\\n\\n// these into a 32-bit constant. That will require sprinkling a bunch of\\n\\n// inline-always pragmas around the place.\\n\\npub fn reg_RAX() -> Reg {\\n\\n info_RAX().0.to_reg()\\n\\n}\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 76,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"/// Parses the Code section of the wasm module.\\n\\npub fn parse_code_section<'data>(\\n\\n code: CodeSectionReader<'data>,\\n\\n module_translation_state: &ModuleTranslationState,\\n\\n environ: &mut dyn ModuleEnvironment<'data>,\\n\\n) -> WasmResult<()> {\\n\\n for body in code {\\n\\n let mut reader = body?.get_binary_reader();\\n\\n let size = reader.bytes_remaining();\\n\\n let offset = reader.original_position();\\n\\n environ.define_function_body(module_translation_state, reader.read_bytes(size)?, offset)?;\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-wasm/src/sections_translator.rs\",\n \"rank\": 77,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"pub fn reg_RSP() -> Reg {\\n\\n info_RSP().0.to_reg()\\n\\n}\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 78,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"pub fn reg_R9() -> Reg {\\n\\n info_R9().0.to_reg()\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 79,\n \"score\": 166600.2827511211\n },\n {\n \"content\": \"/// Get a reference to the \\\"spill temp\\\" register. This register is used to\\n\\n/// compute the address of a spill slot when a direct offset addressing mode from\\n\\n/// FP is not sufficient (+/- 2^11 words). We exclude this register from regalloc\\n\\n/// and reserve it for this purpose for simplicity; otherwise we need a\\n\\n/// multi-stage analysis where we first determine how many spill slots we have,\\n\\n/// then perhaps remove the reg from the pool and recompute regalloc.\\n\\npub fn spilltmp_reg() -> Reg {\\n\\n xreg(15)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/arm64/inst/regs.rs\",\n \"rank\": 80,\n \"score\": 164346.93372815652\n },\n {\n \"content\": \"/// Builds ranges and location for specified value labels.\\n\\n/// The labels specified at DataFlowGraph's values_labels collection.\\n\\npub fn build_value_labels_ranges<T>(\\n\\n func: &Function,\\n\\n regalloc: &Context,\\n\\n isa: &dyn TargetIsa,\\n\\n) -> ValueLabelsRanges\\n\\nwhere\\n\\n T: From<SourceLoc> + Deref<Target = SourceLoc> + Ord + Copy,\\n\\n{\\n\\n let values_labels = build_value_labels_index::<T>(func);\\n\\n\\n\\n let mut blocks = func.layout.blocks().collect::<Vec<_>>();\\n\\n blocks.sort_by_key(|block| func.offsets[*block]); // Ensure inst offsets always increase\\n\\n let encinfo = isa.encoding_info();\\n\\n let values_locations = &func.locations;\\n\\n let liveness_ranges = regalloc.liveness().ranges();\\n\\n\\n\\n let mut ranges = HashMap::new();\\n\\n let mut add_range = |label, range: (u32, u32), loc: ValueLoc| {\\n\\n if range.0 >= range.1 || !loc.is_assigned() {\\n\\n return;\\n\",\n \"file_path\": \"cranelift-codegen/src/value_label.rs\",\n \"rank\": 81,\n \"score\": 164342.49299691487\n },\n {\n \"content\": \"/// Get a reference to the frame pointer (x29).\\n\\npub fn fp_reg() -> Reg {\\n\\n xreg(29)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/arm64/inst/regs.rs\",\n \"rank\": 82,\n \"score\": 164342.49299691487\n },\n {\n \"content\": \"/// Get a reference to the zero-register.\\n\\npub fn zero_reg() -> Reg {\\n\\n // This should be the same as what xreg(31) returns, except that\\n\\n // we use the special index into the register index space.\\n\\n Reg::new_real(\\n\\n RegClass::I64,\\n\\n /* enc = */ 31,\\n\\n /* index = */ ZERO_REG_INDEX,\\n\\n )\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/arm64/inst/regs.rs\",\n \"rank\": 83,\n \"score\": 164342.49299691487\n },\n {\n \"content\": \"/// Get a reference to the link register (x30).\\n\\npub fn link_reg() -> Reg {\\n\\n xreg(30)\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/arm64/inst/regs.rs\",\n \"rank\": 84,\n \"score\": 164342.49299691487\n },\n {\n \"content\": \"/// Default names for `ir::LibCall`s. A function by this name is imported into the object as\\n\\n/// part of the translation of a `ir::ExternalName::LibCall` variant.\\n\\npub fn default_libcall_names() -> Box<dyn Fn(ir::LibCall) -> String> {\\n\\n Box::new(move |libcall| match libcall {\\n\\n ir::LibCall::Probestack => \\\"__cranelift_probestack\\\".to_owned(),\\n\\n ir::LibCall::CeilF32 => \\\"ceilf\\\".to_owned(),\\n\\n ir::LibCall::CeilF64 => \\\"ceil\\\".to_owned(),\\n\\n ir::LibCall::FloorF32 => \\\"floorf\\\".to_owned(),\\n\\n ir::LibCall::FloorF64 => \\\"floor\\\".to_owned(),\\n\\n ir::LibCall::TruncF32 => \\\"truncf\\\".to_owned(),\\n\\n ir::LibCall::TruncF64 => \\\"trunc\\\".to_owned(),\\n\\n ir::LibCall::NearestF32 => \\\"nearbyintf\\\".to_owned(),\\n\\n ir::LibCall::NearestF64 => \\\"nearbyint\\\".to_owned(),\\n\\n ir::LibCall::Memcpy => \\\"memcpy\\\".to_owned(),\\n\\n ir::LibCall::Memset => \\\"memset\\\".to_owned(),\\n\\n ir::LibCall::Memmove => \\\"memmove\\\".to_owned(),\\n\\n })\\n\\n}\\n\",\n \"file_path\": \"cranelift-module/src/backend.rs\",\n \"rank\": 85,\n \"score\": 163140.18853516545\n },\n {\n \"content\": \"pub fn run(files: &[String]) -> CommandResult {\\n\\n for (i, f) in files.iter().enumerate() {\\n\\n if i != 0 {\\n\\n println!();\\n\\n }\\n\\n cat_one(f)?\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/cat.rs\",\n \"rank\": 86,\n \"score\": 163056.8792318223\n },\n {\n \"content\": \"/// Compile the given function down to VCode with allocated registers, ready\\n\\n/// for binary emission.\\n\\npub fn compile<B: LowerBackend>(\\n\\n f: &mut Function,\\n\\n b: &B,\\n\\n abi: Box<dyn ABIBody<B::MInst>>,\\n\\n) -> VCode<B::MInst>\\n\\nwhere\\n\\n B::MInst: ShowWithRRU,\\n\\n{\\n\\n // This lowers the CL IR.\\n\\n let mut vcode = Lower::new(f, abi).lower(b);\\n\\n\\n\\n let universe = &B::MInst::reg_universe();\\n\\n\\n\\n debug!(\\\"vcode from lowering: \\\\n{}\\\", vcode.show_rru(Some(universe)));\\n\\n\\n\\n // Perform register allocation.\\n\\n let result = allocate_registers(&mut vcode, RegAllocAlgorithm::Backtracking, universe)\\n\\n .expect(\\\"register allocation\\\");\\n\\n\\n\\n // Reorder vcode into final order and copy out final instruction sequence\\n\",\n \"file_path\": \"cranelift-codegen/src/machinst/compile.rs\",\n \"rank\": 87,\n \"score\": 162138.27499854352\n },\n {\n \"content\": \"/// Writes `func` to `w` as text.\\n\\n/// write_function_plain is passed as 'closure' to print instructions as text.\\n\\n/// pretty_function_error is passed as 'closure' to add error decoration.\\n\\npub fn decorate_function<FW: FuncWriter>(\\n\\n func_w: &mut FW,\\n\\n w: &mut dyn Write,\\n\\n func: &Function,\\n\\n annotations: &DisplayFunctionAnnotations,\\n\\n) -> fmt::Result {\\n\\n let regs = annotations.isa.map(TargetIsa::register_info);\\n\\n let regs = regs.as_ref();\\n\\n\\n\\n write!(w, \\\"function \\\")?;\\n\\n write_spec(w, func, regs)?;\\n\\n writeln!(w, \\\" {{\\\")?;\\n\\n let aliases = alias_map(func);\\n\\n let mut any = func_w.write_preamble(w, func, regs)?;\\n\\n for block in &func.layout {\\n\\n if any {\\n\\n writeln!(w)?;\\n\\n }\\n\\n decorate_block(func_w, w, func, &aliases, annotations, block)?;\\n\\n any = true;\\n\\n }\\n\\n writeln!(w, \\\"}}\\\")\\n\\n}\\n\\n\\n\\n//----------------------------------------------------------------------\\n\\n//\\n\\n// Function spec.\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/src/write.rs\",\n \"rank\": 88,\n \"score\": 162138.27499854352\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn is_all_zeroes(x: &ConstantData) -> bool {\\n\\n x.iter().all(|&f| f == 0)\\n\\n}\\n\\n\\n\\n/// Check that a constant contains all ones.\\n\",\n \"file_path\": \"cranelift-codegen/src/predicates.rs\",\n \"rank\": 89,\n \"score\": 160559.8590343457\n },\n {\n \"content\": \"#[allow(dead_code)]\\n\\npub fn is_all_ones(x: &ConstantData) -> bool {\\n\\n x.iter().all(|&f| f == 0xff)\\n\\n}\\n\\n\\n\\n/// Check that `x` is the same as `y`.\\n\",\n \"file_path\": \"cranelift-codegen/src/predicates.rs\",\n \"rank\": 90,\n \"score\": 160559.8590343457\n },\n {\n \"content\": \"pub fn run(files: &[String]) -> CommandResult {\\n\\n for (i, f) in files.iter().enumerate() {\\n\\n if i != 0 {\\n\\n println!();\\n\\n }\\n\\n print_cfg(f)?\\n\\n }\\n\\n Ok(())\\n\\n}\\n\\n\\n\",\n \"file_path\": \"src/print_cfg.rs\",\n \"rank\": 91,\n \"score\": 160559.8590343457\n },\n {\n \"content\": \"/// Create the register universe for X64.\\n\\npub fn create_reg_universe() -> RealRegUniverse {\\n\\n let mut regs = Vec::<(RealReg, String)>::new();\\n\\n let mut allocable_by_class = [None; NUM_REG_CLASSES];\\n\\n\\n\\n // Integer regs\\n\\n let mut base = regs.len();\\n\\n // Callee-saved, in the ELF x86_64 ABI\\n\\n regs.push(info_R12());\\n\\n regs.push(info_R13());\\n\\n regs.push(info_R14());\\n\\n regs.push(info_R15());\\n\\n regs.push(info_RBX());\\n\\n // Caller-saved, in the ELF x86_64 ABI\\n\\n regs.push(info_RSI());\\n\\n regs.push(info_RDI());\\n\\n regs.push(info_RAX());\\n\\n regs.push(info_RCX());\\n\\n regs.push(info_RDX());\\n\\n regs.push(info_R8());\\n\\n regs.push(info_R9());\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/x64/inst.rs\",\n \"rank\": 92,\n \"score\": 160140.26328467875\n },\n {\n \"content\": \"/// Create the register universe for ARM64.\\n\\npub fn create_reg_universe() -> RealRegUniverse {\\n\\n let mut regs = vec![];\\n\\n let mut allocable_by_class = [None; NUM_REG_CLASSES];\\n\\n\\n\\n // Numbering Scheme: we put V-regs first, then X-regs. The X-regs\\n\\n // exclude several registers: x18 (globally reserved for platform-specific\\n\\n // purposes), x29 (frame pointer), x30 (link register), x31 (stack pointer\\n\\n // or zero register, depending on context).\\n\\n\\n\\n let v_reg_base = 0u8; // in contiguous real-register index space\\n\\n let v_reg_count = 32;\\n\\n for i in 0u8..v_reg_count {\\n\\n let reg = Reg::new_real(\\n\\n RegClass::V128,\\n\\n /* enc = */ i,\\n\\n /* index = */ v_reg_base + i,\\n\\n )\\n\\n .to_real_reg();\\n\\n let name = format!(\\\"v{}\\\", i);\\n\\n regs.push((reg, name));\\n\",\n \"file_path\": \"cranelift-codegen/src/isa/arm64/inst/regs.rs\",\n \"rank\": 93,\n \"score\": 158181.654860693\n },\n {\n \"content\": \"/// Try to remove an block.\\n\\nstruct RemoveBlock {\\n\\n block: Block,\\n\\n}\\n\\n\\n\\nimpl RemoveBlock {\\n\\n fn new(func: &Function) -> Self {\\n\\n Self {\\n\\n block: func.layout.entry_block().unwrap(),\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Mutator for RemoveBlock {\\n\\n fn name(&self) -> &'static str {\\n\\n \\\"remove block\\\"\\n\\n }\\n\\n\\n\\n fn mutation_count(&self, func: &Function) -> usize {\\n\\n block_count(func)\\n\\n }\\n\",\n \"file_path\": \"src/bugpoint.rs\",\n \"rank\": 94,\n \"score\": 156347.55293510697\n },\n {\n \"content\": \"struct MergeBlocks {\\n\\n block: Block,\\n\\n prev_block: Option<Block>,\\n\\n}\\n\\n\\n\\nimpl MergeBlocks {\\n\\n fn new(func: &Function) -> Self {\\n\\n Self {\\n\\n block: func.layout.entry_block().unwrap(),\\n\\n prev_block: None,\\n\\n }\\n\\n }\\n\\n}\\n\\n\\n\\nimpl Mutator for MergeBlocks {\\n\\n fn name(&self) -> &'static str {\\n\\n \\\"merge blocks\\\"\\n\\n }\\n\\n\\n\\n fn mutation_count(&self, func: &Function) -> usize {\\n\",\n \"file_path\": \"src/bugpoint.rs\",\n \"rank\": 95,\n \"score\": 156341.2548777114\n },\n {\n \"content\": \"struct BlockHeaderSSABlockData {\\n\\n // The predecessors of the Block header block, with the block and branch instruction.\\n\\n predecessors: PredBlockSmallVec,\\n\\n // A block header block is sealed if all of its predecessors have been declared.\\n\\n sealed: bool,\\n\\n // The block which this block is part of.\\n\\n block: Block,\\n\\n // List of current Block arguments for which an earlier def has not been found yet.\\n\\n undef_variables: Vec<(Variable, Value)>,\\n\\n}\\n\\n\\n\\n/// A opaque reference to a basic block.\\n\\n#[derive(Copy, Clone, PartialEq, Eq, Debug)]\\n\\npub struct SSABlock(u32);\\n\\nimpl EntityRef for SSABlock {\\n\\n fn new(index: usize) -> Self {\\n\\n debug_assert!(index < (u32::MAX as usize));\\n\\n Self(index as u32)\\n\\n }\\n\\n\\n\",\n \"file_path\": \"cranelift-frontend/src/ssa.rs\",\n \"rank\": 96,\n \"score\": 156123.54870152034\n },\n {\n \"content\": \"pub fn magic_u32(d: u32) -> MU32 {\\n\\n debug_assert_ne!(d, 0);\\n\\n debug_assert_ne!(d, 1); // d==1 generates out of range shifts.\\n\\n\\n\\n let mut do_add: bool = false;\\n\\n let mut p: i32 = 31;\\n\\n let nc: u32 = 0xFFFFFFFFu32 - u32::wrapping_neg(d) % d;\\n\\n let mut q1: u32 = 0x80000000u32 / nc;\\n\\n let mut r1: u32 = 0x80000000u32 - q1 * nc;\\n\\n let mut q2: u32 = 0x7FFFFFFFu32 / d;\\n\\n let mut r2: u32 = 0x7FFFFFFFu32 - q2 * d;\\n\\n loop {\\n\\n p = p + 1;\\n\\n if r1 >= nc - r1 {\\n\\n q1 = u32::wrapping_add(u32::wrapping_mul(2, q1), 1);\\n\\n r1 = u32::wrapping_sub(u32::wrapping_mul(2, r1), nc);\\n\\n } else {\\n\\n q1 = u32::wrapping_mul(2, q1);\\n\\n r1 = 2 * r1;\\n\\n }\\n\",\n \"file_path\": \"cranelift-codegen/src/divconst_magic_numbers.rs\",\n \"rank\": 97,\n \"score\": 155929.18013109954\n },\n {\n \"content\": \"/// Convert the string `s` to CamelCase.\\n\\npub fn camel_case(s: &str) -> String {\\n\\n let mut output_chars = String::with_capacity(s.len());\\n\\n\\n\\n let mut capitalize = true;\\n\\n for curr_char in s.chars() {\\n\\n if curr_char == '_' {\\n\\n capitalize = true;\\n\\n } else {\\n\\n if capitalize {\\n\\n output_chars.extend(curr_char.to_uppercase());\\n\\n } else {\\n\\n output_chars.push(curr_char);\\n\\n }\\n\\n capitalize = false;\\n\\n }\\n\\n }\\n\\n\\n\\n output_chars\\n\\n}\\n\\n\\n\",\n \"file_path\": \"cranelift-codegen/meta/src/cdsl/mod.rs\",\n \"rank\": 98,\n \"score\": 155929.18013109954\n },\n {\n \"content\": \"pub fn magic_u64(d: u64) -> MU64 {\\n\\n debug_assert_ne!(d, 0);\\n\\n debug_assert_ne!(d, 1); // d==1 generates out of range shifts.\\n\\n\\n\\n let mut do_add: bool = false;\\n\\n let mut p: i32 = 63;\\n\\n let nc: u64 = 0xFFFFFFFFFFFFFFFFu64 - u64::wrapping_neg(d) % d;\\n\\n let mut q1: u64 = 0x8000000000000000u64 / nc;\\n\\n let mut r1: u64 = 0x8000000000000000u64 - q1 * nc;\\n\\n let mut q2: u64 = 0x7FFFFFFFFFFFFFFFu64 / d;\\n\\n let mut r2: u64 = 0x7FFFFFFFFFFFFFFFu64 - q2 * d;\\n\\n loop {\\n\\n p = p + 1;\\n\\n if r1 >= nc - r1 {\\n\\n q1 = u64::wrapping_add(u64::wrapping_mul(2, q1), 1);\\n\\n r1 = u64::wrapping_sub(u64::wrapping_mul(2, r1), nc);\\n\\n } else {\\n\\n q1 = u64::wrapping_mul(2, q1);\\n\\n r1 = 2 * r1;\\n\\n }\\n\",\n \"file_path\": \"cranelift-codegen/src/divconst_magic_numbers.rs\",\n \"rank\": 99,\n \"score\": 155929.18013109954\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":9,"numItemsPerPage":100,"numTotalItems":13489,"offset":900,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTQ0NDE4Nywic3ViIjoiL2RhdGFzZXRzL3NvdXJjZWdyYXBoL2NvbnRleHQtYXdhcmUtZmltLWNvZGUtY29tcGxldGlvbnMiLCJleHAiOjE3Nzk0NDc3ODcsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.RbLSyMeIAUebJ0gjm-YhxzLq4p_h9SOgP6MY_E9tI5W6_ZBd8E2fC86gqTboo8NS9KsS4pNNg2uGVO2M9Ja3Aw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":13489,"numBytesParquet":605686331}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
lang stringclasses 3
values | file_path stringlengths 5 150 | repo_name stringlengths 6 110 | commit stringlengths 40 40 | file_code stringlengths 1.52k 18.9k | prefix stringlengths 82 16.5k | suffix stringlengths 0 15.1k | middle stringlengths 121 8.18k | strategy stringclasses 8
values | context_items listlengths 0 100 |
|---|---|---|---|---|---|---|---|---|---|
Rust | game_plugin/src/actions.rs | NiklasEi/ld49 | 1fc925339de6d0aa64983d31186cf1ba932c595c | use crate::GameState;
use bevy::prelude::*;
pub struct ActionsPlugin;
impl Plugin for ActionsPlugin {
fn build(&self, app: &mut AppBuilder) {
app.init_resource::<Actions>().add_system_set(
SystemSet::on_update(GameState::InLevel).with_system(set_movement_actions.system()),
);
}
}
... | use crate::GameState;
use bevy::prelude::*;
pub struct ActionsPlugin;
impl Plugin for ActionsPlugin {
fn build(&self, app: &mut AppBuilder) {
app.init_resource::<Actions>().add_system_set(
SystemSet::on_update(GameState::InLevel).with_system(set_movement_actions.system()),
);
}
}
... | actions.head_balance = Some(head_balance);
} else {
actions.head_balance = None;
}
actions.jump = GameControl::Jump.just_pressed(&keyboard_input);
actions.restart = GameControl::Restart.just_pressed(&keyboard_input);
}
enum GameControl {
BalanceForward,
BalanceBackward,
Padd... | = actions.head_balance.unwrap_or(0.);
if GameControl::BalanceForward.just_released(&keyboard_input)
|| GameControl::BalanceBackward.just_released(&keyboard_input)
{
if GameControl::BalanceForward.pressed(&keyboard_input) {
head_balance = 1.;
} else if ... | function_block-random_span | [
{
"content": "fn jump(\n\n actions: Res<Actions>,\n\n mut wheel_query: Query<\n\n (Entity, &mut RigidBodyVelocity, &Transform),\n\n (With<Wheel>, Without<Body>),\n\n >,\n\n mut jump_block: ResMut<JumpBlock>,\n\n mut body_query: Query<&Transform, (With<Body>, Without<Wheel>)>,\n\n ... |
Rust | src/librustc_incremental/persist/dirty_clean.rs | killerswan/rust | e703b33e3e03d1078c8825e1f64ecfb45884f5cb |
use super::directory::RetracedDefIdDirectory;
use super::load::DirtyNodes;
use rustc::dep_graph::{DepGraphQuery, DepNode};
use rustc::hir;
use rustc::hir::def_id::DefId;
use rustc::hir::itemlikevisit::ItemLikeVisitor;
use rustc::hir::intravisit;
use rustc::ich::{Fingerprint, ATTR_DIRTY, ATTR_CLEAN, ATTR_DIRTY_METADAT... |
use super::directory::RetracedDefIdDirectory;
use super::load::DirtyNodes;
use rustc::dep_graph::{DepGraphQuery, DepNode};
use rustc::hir;
use rustc::hir::def_id::DefId;
use rustc::hir::itemlikevisit::ItemLikeVisitor;
use rustc::hir::intravisit;
use rustc::ich::{Fingerprint, ATTR_DIRTY, ATTR_CLEAN, ATTR_DIRTY_METADAT... |
}
pub struct FindAllAttrs<'a, 'tcx:'a> {
tcx: TyCtxt<'a, 'tcx, 'tcx>,
attr_names: Vec<&'static str>,
found_attrs: Vec<&'tcx Attribute>,
}
impl<'a, 'tcx> FindAllAttrs<'a, 'tcx> {
fn is_active_attr(&mut self, attr: &Attribute) -> bool {
for attr_name in &self.attr_names {
if attr.c... | if let Some(value) = item.value_str() {
value
} else {
let msg = if let Some(name) = item.name() {
format!("associated value expected for `{}`", name)
} else {
"expected an associated value".to_string()
};
tcx.sess.span_fatal(item.span, &msg);
} | if_condition | [] |
Rust | src/graphics/camera.rs | fossegutten/tetra | ebdccc242680786482a8622dbb3f76f1fc0ab00c | use super::Rectangle;
use crate::input;
use crate::math::{Mat4, Vec2, Vec3};
use crate::window;
use crate::Context;
#[derive(Debug, Clone)]
pub struct Camera {
pub position: Vec2<f32>,
pub rotation: f32,
pub zoom: f32,
... | use super::Rectangle;
use crate::input;
use crate::math::{Mat4, Vec2, Vec3};
use crate::window;
use crate::Context;
#[derive(Debug, Clone)]
pub struct Camera {
pub position: Vec2<f32>,
pub rotation: f32,
pub zoom: f32,
... | = camera.unproject(proj_zoomed);
assert_eq!(proj_zoomed, Vec2::new(-16.0, -48.0));
assert_eq!(unproj_zoomed, Vec2::zero());
camera.rotation = std::f32::consts::FRAC_PI_2;
let proj_rotated = camera.project(Vec2::zero());
let unproj_rotated = camera.unproject(proj_rotated);
... | () > f32::EPSILON {
let mut top_left = Vec2::new(-half_viewport_width, -half_viewport_height);
let mut bottom_left = Vec2::new(-half_viewport_width, half_viewport_height);
top_left.rotate_z(self.rotation);
bottom_left.rotate_z(self.rotation);
... | random | [
{
"content": "/// Sets the transform matrix.\n\n///\n\n/// This can be used to apply global transformations to subsequent draw calls.\n\npub fn set_transform_matrix(ctx: &mut Context, matrix: Mat4<f32>) {\n\n flush(ctx);\n\n\n\n ctx.graphics.transform_matrix = matrix;\n\n}\n\n\n",
"file_path": "src/gr... |
Rust | src/rtl/tree.rs | GuillaumeDIDIER/C-teel | 4e46a6623dc3ce669e7525cff7069dbdeaa4043b | use common::ops;
pub use parse::ast::Ident;
use std::collections::{HashMap, HashSet};
use std::fmt::Display;
use std::fmt;
use common::register::Register;
use common::label::Label;
use common::label::LabelAllocator;
use common::register::RegisterAllocator;
#[derive(Debug)]
pub enum Instruction {
Const(i64, Regist... | use common::ops;
pub use parse::ast::Ident;
use std::collections::{HashMap, HashSet};
use std::fmt::Display;
use std::fmt;
use common::register::Register;
use common::label::Label;
use common::label::LabelAllocator;
use common::register::RegisterAllocator;
#[derive(Debug)]
pub enum Instruction {
Const(i64, Regist... | ruct FuncDefinition {
pub name: Ident,
pub formals: Vec<Register>,
pub result: Register,
pub locals: HashSet<Register>,
pub entry: Label,
pub exit: Label,
pub body: HashMap<Label, Instruction>,
pub label_allocator: LabelAllocator,
pub register_allocator: RegisterAllocator,
}
impl Fu... | goto {}", label)
},
Instruction::Branch(ref branch_op, ref label1, ref label2) => {
write!(f, "{} --> {}, {}", branch_op, label1, label2)
},
}
}
}
#[derive(Debug)]
pub st | random | [
{
"content": "pub fn convert_char(ch: &str) -> Option<i64> {\n\n if ch.len() == 1 {\n\n if let Some(c) = ch.chars().next() {\n\n Some(c as i64)\n\n } else {\n\n None\n\n }\n\n } else if ch.len() == 2 {\n\n match ch {\n\n \"\\\\\\\\\" => Some(92)... |
Rust | verification/src/header_verifier.rs | liyaspawn/ckb | 59a40454fd46bf3640df68591001f9d6b6491049 | use crate::{
BlockVersionError, EpochError, NumberError, PowError, TimestampError, UnknownParentError,
ALLOWED_FUTURE_BLOCKTIME,
};
use ckb_chain_spec::consensus::Consensus;
use ckb_error::Error;
use ckb_pow::PowEngine;
use ckb_traits::HeaderProvider;
use ckb_types::core::{HeaderView, Version};
use ckb_verifica... | use crate::{
BlockVersionError, EpochError, NumberError, PowError, TimestampError, UnknownParentError,
ALLOWED_FUTURE_BLOCKTIME,
};
use ckb_chain_spec::consensus::Consensus;
use ckb_error::Error;
use ckb_pow::PowEngine;
use ckb_traits::HeaderProvider;
use ckb_types::core::{HeaderView, Version};
use ckb_verifica... | }
.into());
}
let max = self.now + ALLOWED_FUTURE_BLOCKTIME;
if self.header.timestamp() > max {
return Err(TimestampError::BlockTimeTooNew {
max,
actual: self.header.timestamp(),
}
.into());
}
Ok((... | onsensus.block_version()).verify()?;
PowVerifier::new(header, self.consensus.pow_engine().as_ref()).verify()?;
let parent = self
.data_loader
.get_header(&header.parent_hash())
.ok_or_else(|| UnknownParentError {
parent_hash: header.parent_has... | random | [] |
Rust | cli/ops/os.rs | justgeek/deno | 34ec3b225425cecdccf754fbc87f4a8f3728890d |
use super::dispatch_json::{Deserialize, JsonOp, Value};
use crate::op_error::OpError;
use crate::state::State;
use deno_core::CoreIsolate;
use deno_core::ZeroCopyBuf;
use std::collections::HashMap;
use std::env;
use std::io::{Error, ErrorKind};
use url::Url;
pub fn init(i: &mut CoreIsolate, s: &State) {
i.register_... |
use super::dispatch_json::{Deserialize, JsonOp, Value};
use crate::op_error::OpError;
use crate::state::State;
use deno_core::CoreIsolate;
use deno_core::ZeroCopyBuf;
use std::collections::HashMap;
use std::env;
use std::io::{Error, ErrorKind};
use url::Url;
|
#[derive(Deserialize)]
struct GetDirArgs {
kind: std::string::String,
}
fn op_get_dir(
state: &State,
args: Value,
_zero_copy: Option<ZeroCopyBuf>,
) -> Result<JsonOp, OpError> {
state.check_unstable("Deno.dir");
state.check_env()?;
let args: GetDirArgs = serde_json::from_value(args)?;
let path = ma... | pub fn init(i: &mut CoreIsolate, s: &State) {
i.register_op("op_exit", s.stateful_json_op(op_exit));
i.register_op("op_env", s.stateful_json_op(op_env));
i.register_op("op_exec_path", s.stateful_json_op(op_exec_path));
i.register_op("op_set_env", s.stateful_json_op(op_set_env));
i.register_op("op_get_env", s.... | function_block-full_function | [
{
"content": "export function getRandomValues<\n\n T extends\n\n | Int8Array\n\n | Uint8Array\n\n | Uint8ClampedArray\n\n | Int16Array\n\n | Uint16Array\n\n | Int32Array\n\n | Uint32Array\n\n>(typedArray: T): T {\n\n assert(typedArray !== null, \"Input must not be null\");\n\n assert(typ... |
Rust | src/metadata/media_info.rs | fengalin/media-toc-player | 8fb6580419ec530329c131116c726bb176348956 | use gettextrs::gettext;
use gst::Tag;
use lazy_static::lazy_static;
use std::{
collections::HashMap,
fmt,
path::{Path, PathBuf},
sync::Arc,
};
use super::{Duration, MediaContent};
#[derive(Debug)]
pub struct SelectStreamError(Arc<str>);
impl SelectStreamError {
fn new(id: &Arc<str>) -> Self {
... | use gettextrs::gettext;
use gst::Tag;
use lazy_static::lazy_static;
use std::{
collections::HashMap,
fmt,
path::{Path, PathBuf},
sync::Arc,
};
use super::{Duration, MediaContent};
#[derive(Debug)]
pub struct SelectStreamError(Arc<str>);
impl SelectStreamError {
fn new(id: &Arc<str>) -> Self {
... |
}
pub fn is_video_selected(&self) -> bool {
self.cur_video_id.is_some()
}
pub fn selected_audio(&self) -> Option<&Stream> {
self.cur_audio_id
.as_ref()
.and_then(|stream_id| self.audio.get(stream_id))
}
pub fn selected_video(&self) -> Option<&Stream> {... | match type_ {
gst::StreamType::AUDIO => &self.audio,
gst::StreamType::VIDEO => &self.video,
gst::StreamType::TEXT => &self.text,
other => unimplemented!("{:?}", other),
} | if_condition | [
{
"content": "fn parse_to<T: std::str::FromStr>(i: &str) -> IResult<&str, T> {\n\n let (i, res) = digit1(i)?;\n\n\n\n res.parse::<T>()\n\n .map(move |value| (i, value))\n\n .map_err(move |_| Err::Error((i, ErrorKind::ParseTo)))\n\n}\n",
"file_path": "src/metadata/mod.rs",
"rank": 2,
... |
Rust | src/dat/civilization.rs | vtabbott/djin | 9b63973941a9f6efc327f18085c00838e02e80b7 | use crate::dat::common::DeString;
use crate::dat::unit::Task;
use crate::dat::ResourceUsage;
const RESOURCE_STORAGE_SIZE: usize = 3;
const GRAPHIC_DISPLACEMENT_SIZE: usize = 3;
const BUILDING_ANNEXES_SIZE: usize = 4;
#[derive(Protocol, Debug, Clone, PartialEq)]
pub struct Civilizations {
pub size: u16,
... | use crate::dat::common::DeString;
use crate::dat::unit::Task;
use crate::dat::ResourceUsage;
const RESOURCE_STORAGE_SIZE: usize = 3;
const GRAPHIC_DISPLACEMENT_SIZE: usize = 3;
const BUILDING_ANNEXES_SIZE: usize = 4;
#[derive(Protocol, Debug, Clone, PartialEq)]
pub struct Civilizations {
pub size: u16,
... |
Creatable = 70,
Building = 80,
AoeTrees = 90,
}
#[derive(Protocol, Debug, Clone, PartialEq)]
pub struct DeadFish {
pub walking_graphic: i16,
pub running_graphic: i16,
pub rotation_speed: f32,
pub old_size_class: u8,
pub tracking_unit: i16,
pub tracking_... | pacity: i16,
pub resource_decay: f32,
pub blast_defense_level: u8,
pub combat_level: u8,
pub interaction_mode: u8,
pub minimap_mode: u8,
pub interface_kind: u8,
pub multiple_attribute_mode: f32,
pub minimap_color: u8,
pub language_dll_help: i32,
pub language_dll_hot_key... | random | [
{
"content": "\n\n#[derive(Protocol, Debug, Clone, PartialEq)]\n\npub struct Task {\n\n pub task_type: i16,\n\n pub id: i16,\n\n pub is_default: u8,\n\n pub action_type: i16,\n\n pub class_id: i16,\n\n pub unit_id: i16,\n\n pub terrain_id: i16,\n\n pub resource_in: i16,\n\n pub resour... |
Rust | src/memfd.rs | lucab/memfd-rs | 40e00f1b7a6fad816ab1394ce4cc1910c478d32a | use std::os::unix::io::{AsRawFd, FromRawFd, IntoRawFd, RawFd};
use std::{ffi, fs, os::raw};
use crate::{nr, sealing};
#[cfg(any(target_os = "android", target_os="linux"))]
unsafe fn memfd_create(name: *const raw::c_char, flags: raw::c_uint) -> raw::c_int {
libc::syscall(libc::SYS_memfd_create, name, flags) as raw:... | use std::os::unix::io::{AsRawFd, FromRawFd, IntoRawFd, RawFd};
use std::{ffi, fs, os::raw};
use crate::{nr, sealing};
#[cfg(any(target_os = "android", target_os="linux"))]
unsafe fn memfd_create(name: *const raw::c_char, flags: raw::c_uint) -> raw::c_int {
libc::syscall(libc::SYS_memfd_create, name, flags) as raw:... |
pub fn create<T: AsRef<str>>(&self, name: T) -> Result<Memfd, crate::Error> {
let flags = self.bitflags();
unsafe {
let cname =
ffi::CString::new(name.as_ref()).map_err(crate::Error::NameCStri... | if let Some(ref hugetlb) = self.hugetlb {
bits |= hugetlb.bitflags();
bits |= nr::MFD_HUGETLB;
}
bits
} | function_block-function_prefix_line | [
{
"content": "/// Check if the close-on-exec flag is set for the memfd.\n\npub fn get_close_on_exec(memfd: &memfd::Memfd) -> std::io::Result<bool> {\n\n // SAFETY: The syscall called has no soundness implications (i.e. does not mess with\n\n // process memory in weird ways, checks its arguments for correc... |
Rust | src/maps/perf_map_poller.rs | redcanaryco/oxidebpf | 2ec84a57cf99504a484378908d295d863ff27c32 | use std::{
collections::HashMap,
fmt::{self, Formatter},
sync::{Arc, Condvar, Mutex},
thread,
time::Duration,
};
use crossbeam_channel::{Sender, TrySendError};
use mio::{unix::SourceFd, Events, Interest, Poll, Token};
use nix::errno::Errno;
use slog::crit;
use crate::{
maps::{PerCpu, PerfEvent... | use std::{
collections::HashMap,
fmt::{self, Formatter},
sync::{Arc, Condvar, Mutex},
thread,
time::Duration,
};
use crossbeam_channel::{Sender, TrySendError};
use mio::{unix::SourceFd, Events, Interest, Poll, Token};
use nix::errno::Errno;
use slog::crit;
use crate::{
maps::{PerCpu, PerfEvent... |
}
pub enum InitError {
Creation(std::io::Error),
Registration(std::io::Error),
ReadySignal(String),
}
impl fmt::Display for InitError {
fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
match self {
InitError::Creation(e) => write!(f, "error creating poller: {}", e),
... | fn poll_once(
&mut self,
events: &mut Events,
tx: &Sender<PerfChannelMessage>,
) -> Result<(), RunError> {
if let Err(e) = self.poll.poll(events, Some(Duration::from_millis(100))) {
match nix::errno::Errno::from_i32(nix::errno::errno()) {
Errno::EINTR => r... | function_block-full_function | [
{
"content": "/// Return the current memlock limit.\n\npub fn get_memlock_limit() -> Result<usize, OxidebpfError> {\n\n // use getrlimit() syscall\n\n unsafe {\n\n let mut rlim = libc::rlimit {\n\n rlim_cur: 0,\n\n rlim_max: 0,\n\n };\n\n\n\n let ret = libc::getr... |
Rust | src/travis.rs | pietroalbini/travis-migrate | 078cb2acfa7b685ecd2b7d9cf3d982cb7a82944f | use failure::{bail, Error};
use log::{debug, info};
use reqwest::{
header::{HeaderName, AUTHORIZATION, USER_AGENT},
Client, Method, RequestBuilder,
};
use std::process::Command;
#[derive(serde_derive::Deserialize)]
struct PaginationLink {
#[serde(rename = "@href")]
href: String,
}
#[derive(serde_deriv... | use failure::{bail, Error};
use log::{debug, info};
use reqwest::{
header::{HeaderName, AUTHORIZATION, USER_AGENT},
Client, Method, RequestBuilder,
};
use std::process::Command;
#[derive(serde_derive::Deserialize)]
struct PaginationLink {
#[serde(rename = "@href")]
href: String,
}
#[derive(serde_deriv... |
pub(crate) fn start_migration(&self, repo: &str) -> Result<(), Error> {
let _ = self
.build_request(
Method::POST,
&format!("repo/{}/migrate", self.repo_name(repo)),
)
.send()?
.error_for_status()?;
Ok(())
}
p... | pub(crate) fn repos_to_migrate(&self, login: &str) -> Result<Vec<Repository>, Error> {
let mut repos = Vec::new();
self.paginated(&Method::GET, &format!("owner/{}/repos", login), |req| {
let mut resp: Repositories = req
.form(&[("active_on_org", "true")])
.sen... | function_block-full_function | [
{
"content": "fn app() -> Result<(), Error> {\n\n let args = CLI::from_args();\n\n\n\n match args {\n\n CLI::List { account } => {\n\n let travis_com = TravisCI::new(\"com\", std::env::var(\"TRAVIS_TOKEN_COM\").ok())?;\n\n let repos = travis_com.repos_to_migrate(&account)?;\n\... |
Rust | ton_client/src/crypto/boxes/encryption_box/aes.rs | markgenuine/TON-SDK | 2b49c8270a34eab1a66e2eac7764b69568e7d324 | /*
* Copyright 2018-2021 TON Labs LTD.
*
* Licensed under the SOFTWARE EVALUATION License (the "License"); you may not use
* this file except in compliance with the License.
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,... | /*
* Copyright 2018-2021 TON Labs LTD.
*
* Licensed under the SOFTWARE EVALUATION License (the "License"); you may not use
* this file except in compliance with the License.
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,... | Aes128, Aes192, Aes256, BlockCipher, BlockDecrypt, BlockEncrypt, NewBlockCipher};
use block_modes::{BlockMode, Cbc};
use crate::crypto::Error;
use crate::encoding::{base64_decode, hex_decode};
use crate::error::ClientResult;
use super::{CipherMode, EncryptionBox, EncryptionBoxInfo};
#[derive(Serialize, Deseri... | T WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific TON DEV software governing permissions and
* limitations under the License.
*/
use aes::{ | random | [] |
Rust | tezos/api/src/environment.rs | Kyras/tezedge | 98bc9991765682d077347575781afb451d147492 |
use std::collections::HashMap;
use std::str::FromStr;
use enum_iterator::IntoEnumIterator;
use serde::{Deserialize, Serialize};
use lazy_static::lazy_static;
use crate::ffi::{GenesisChain, ProtocolOverrides};
lazy_static! {
pub static ref TEZOS_ENV: HashMap<TezosEnvironment, TezosEnvironmentConfiguration> = i... |
use std::collections::HashMap;
use std::str::FromStr;
use enum_iterator::IntoEnumIterator;
use serde::{Deserialize, Serialize};
use lazy_static::lazy_static;
use crate::ffi::{GenesisChain, ProtocolOverrides};
lazy_static! {
pub static ref TEZOS_ENV: HashMap<TezosEnvironment, TezosEnvironmentConfiguration> = i... |
}
fn init() -> HashMap<TezosEnvironment, TezosEnvironmentConfiguration> {
let mut env: HashMap<TezosEnvironment, TezosEnvironmentConfiguration> = HashMap::new();
env.insert(TezosEnvironment::Alphanet, TezosEnvironmentConfiguration {
genesis: GenesisChain {
time: "2018-11-30T15:30:56Z".to_... | fn from_str(s: &str) -> Result<Self, Self::Err> {
match s.to_ascii_lowercase().as_str() {
"alphanet" => Ok(TezosEnvironment::Alphanet),
"babylonnet" | "babylon" => Ok(TezosEnvironment::Babylonnet),
"mainnet" => Ok(TezosEnvironment::Mainnet),
"zeronet" => Ok(TezosE... | function_block-full_function | [
{
"content": "type OperationHash = Hash;\n",
"file_path": "tezos/interop_callback/src/callback.rs",
"rank": 0,
"score": 165307.25237255346
},
{
"content": "type ContextHash = Hash;\n",
"file_path": "tezos/interop_callback/src/callback.rs",
"rank": 1,
"score": 165307.25237255346
... |
Rust | miniz_oxide/src/inflate/mod.rs | MichaelMcDonnell/miniz_oxide | b6ca295deaecd549c504873481ceb4e2a65a1933 |
use crate::alloc::boxed::Box;
use crate::alloc::vec;
use crate::alloc::vec::Vec;
use ::core::cmp::min;
use ::core::usize;
pub mod core;
mod output_buffer;
pub mod stream;
use self::core::*;
const TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS: i32 = -4;
const TINFL_STATUS_BAD_PARAM: i32 = -3;
const TINFL_STATUS_ADLER32_M... |
use crate::alloc::boxed::Box;
use crate::alloc::vec;
use crate::alloc::vec::Vec;
use ::core::cmp::min;
use ::core::usize;
pub mod core;
mod output_buffer;
pub mod stream;
use self::core::*;
const TINFL_STATUS_FAILED_CANNOT_MAKE_PROGRESS: i32 = -4;
const TINFL_STATUS_BAD_PARAM: i32 = -3;
const TINFL_STATUS_ADLER32_M... |
pub fn decompress_slice_iter_to_slice<'out, 'inp>(
out: &'out mut [u8],
it: impl Iterator<Item = &'inp [u8]>,
zlib_header: bool,
ignore_adler32: bool,
) -> Result<usize, TINFLStatus> {
use self::core::inflate_flags::*;
let mut it = it.peekable();
let r = &mut DecompressorOxide::new();
... | fn decompress_to_vec_inner(
input: &[u8],
flags: u32,
max_output_size: usize,
) -> Result<Vec<u8>, TINFLStatus> {
let flags = flags | inflate_flags::TINFL_FLAG_USING_NON_WRAPPING_OUTPUT_BUF;
let mut ret: Vec<u8> = vec![0; min(input.len().saturating_mul(2), max_output_size)];
let mut decomp = Bo... | function_block-full_function | [
{
"content": "/// Compress the input data to a vector, using the specified compression level (0-10).\n\npub fn compress_to_vec(input: &[u8], level: u8) -> Vec<u8> {\n\n compress_to_vec_inner(input, level, 0, 0)\n\n}\n\n\n",
"file_path": "miniz_oxide/src/deflate/mod.rs",
"rank": 0,
"score": 212970... |
Rust | lib/src/config.rs | phylum-dev/cli | 724395d036bc56c69acd69c0f59ea1308350a2c1 | use chrono::{DateTime, Local};
use reqwest::Url;
use serde::{Deserialize, Serialize};
use std::env;
use std::error::Error;
use std::fs;
use std::path::PathBuf;
use crate::types::*;
#[derive(Debug, Serialize, Deserialize)]
pub struct ConnectionInfo {
pub uri: String,
}
#[derive(Debug, Serialize, Deserialize)]
pub... | use chrono::{DateTime, Local};
use reqwest::Url;
use serde::{Deserialize, Serialize};
use std::env;
use std::error::Error;
use std::fs;
use std::path::PathBuf;
use crate::types::*;
#[derive(Debug, Serialize, Deserialize)]
pub struct ConnectionInfo {
pub uri: String,
}
#[derive(Debug, Serialize, Deserialize)]
pub... |
pub fn get_current_project() -> Option<ProjectConfig> {
find_project_conf(".").and_then(|s| {
log::info!("Found project configuration file at {}", s);
parse_config(&s).ok()
})
}
#[cfg(test)]
mod tests {
use super::*;
use std::env::temp_dir;
fn write_test_config() {
let co... | mpts = 0;
const MAX_DEPTH: u8 = 32;
loop {
let search_path = path.join(PROJ_CONF_FILE);
if search_path.is_file() {
return Some(search_path.to_string_lossy().to_string());
}
if attempts > MAX_DEPTH {
return None;
}
path.push("..");
... | function_block-function_prefixed | [
{
"content": "/// Produces the path to a temporary file on disk.\n\nfn tmp_path(filename: &str) -> Option<String> {\n\n let tmp_loc = env::temp_dir();\n\n let path = Path::new(&tmp_loc);\n\n let tmp_path = path.join(filename);\n\n match tmp_path.into_os_string().into_string() {\n\n Ok(x) => S... |
Rust | src/main.rs | advion/cartunes | 83b085318b314a332d877e83c3841050b0c7699c |
#![cfg_attr(not(any(test, debug_assertions)), windows_subsystem = "windows")]
#![deny(clippy::all)]
use crate::framework::{ConfigHandler, Framework, UserEvent};
use crate::gpu::{Error as GpuError, Gpu};
use crate::gui::{Error as GuiError, Gui};
use crate::setup::Setups;
use log::error;
use std::collections::VecDeque... |
#![cfg_attr(not(any(test, debug_assertions)), windows_subsystem = "windows")]
#![deny(clippy::all)]
use crate::framework::{ConfigHandler, Framework, UserEvent};
use crate::gpu::{Error as GpuError, Gpu};
use crate::gui::{Error as GuiError, Gui};
use crate::setup::Setups;
use log::error;
use std::collections::VecDeque... |
fn main() -> Result<(), Error> {
#[cfg(any(debug_assertions, not(windows)))]
env_logger::init();
let (event_loop, window, mut gpu, mut framework) = create_window()?;
let mut input = WinitInputHelper::new();
let mut keep_config = ConfigHandler::Replace;
event_loop.run(move |event, _, control_... | et framework = Framework::new(
window_size,
scale_factor,
theme,
gui,
&gpu,
event_loop.create_proxy(),
);
(gpu, framework)
};
Ok((event_loop, window, gpu, framework))
} | function_block-function_prefixed | [
{
"content": "/// Configure the theme based on system settings.\n\nfn update_theme(theme: &mut Option<Theme>, ctx: &egui::CtxRef) {\n\n if let Some(theme) = theme.take() {\n\n // Set the style\n\n ctx.set_style(create_style(theme));\n\n }\n\n}\n\n\n\npub(crate) fn cache_path() -> PathBuf {\n... |
Rust | src/ser.rs | sisyphe-re/libnar | 9ffada39937be91518eaf7fbc27dc0002e95a3db | use std::fs::{self, File};
use std::io::{self, Error, ErrorKind, Read, Write};
use std::os::unix::fs::MetadataExt;
use std::path::Path;
use crate::{NIX_VERSION_MAGIC, PAD_LEN};
pub fn to_vec<P: AsRef<Path>>(path: P) -> io::Result<Vec<u8>> {
let mut buffer = Vec::new();
to_writer(&mut buffer, path)?;
Ok(bu... | use std::fs::{self, File};
use std::io::{self, Error, ErrorKind, Read, Write};
use std::os::unix::fs::MetadataExt;
use std::path::Path;
use crate::{NIX_VERSION_MAGIC, PAD_LEN};
pub fn to_vec<P: AsRef<Path>>(path: P) -> io::Result<Vec<u8>> {
let mut buffer = Vec::new();
to_writer(&mut buffer, path)?;
Ok(bu... |
#[test]
fn pads_non_multiple_of_eight() {
let mut buffer = Vec::new();
let length = 5u64;
let data = vec![1u8; length as usize];
write_padded(&mut buffer, &data[..]).unwrap();
let written_data_len = size_of::<u64>() as u64 + length + 3;
assert_eq!(buffer.len() ... | write_padded(&mut buffer, &data[..]).unwrap();
let written_data_len = size_of::<u64>() as u64 + length;
assert_eq!(buffer.len() as u64, written_data_len);
let header_bytes = length.to_le_bytes();
assert_eq!(&buffer[..size_of::<u64>()], header_bytes);
let data_bytes = [1u8; 16]... | function_block-function_prefix_line | [
{
"content": "#[test]\n\nfn serializes_regular_file() {\n\n let dir = tempfile::tempdir().unwrap();\n\n let mut file = File::create(dir.path().join(\"file.txt\")).unwrap();\n\n writeln!(file, \"lorem ipsum dolor sic amet\").unwrap();\n\n\n\n let expected: Vec<u8> = std::iter::empty()\n\n .cha... |
Rust | src/sys/pkg/testing/blobfs-ramdisk/src/lib.rs | dahlia-os/fuchsia-pine64-pinephone | 57aace6f0b0bd75306426c98ab9eb3ff4524a61d |
#![deny(missing_docs)]
use {
anyhow::{format_err, Context as _, Error},
fdio::{SpawnAction, SpawnOptions},
fidl::endpoints::{ClientEnd, ServerEnd},
fidl_fuchsia_io::{
DirectoryAdminMarker, DirectoryAdminProxy, DirectoryMarker, DirectoryProxy, NodeProxy,
},
fuchsia_component::server::S... |
#![deny(missing_docs)]
use {
anyhow::{format_err, Context as _, Error},
fdio::{SpawnAction, SpawnOptions},
fidl::endpoints::{ClientEnd, ServerEnd},
fidl_fuchsia_io::{
DirectoryAdminMarker, DirectoryAdminProxy, DirectoryMarker, DirectoryProxy, NodeProxy,
},
fuchsia_component::server::S... | ;
let block_device_handle_id = HandleInfo::new(HandleType::User0, 1);
let fs_root_handle_id = HandleInfo::new(HandleType::User0, 0);
let block_handle = ramdisk.clone_channel().context("cloning ramdisk channel")?;
let (proxy, blobfs_server_end) = fidl::endpoints::create_proxy:... | match self.ramdisk {
Some(ramdisk) => ramdisk,
None => {
let ramdisk = Ramdisk::start().context("creating backing ramdisk for blobfs")?;
mkblobfs(&ramdisk)?;
ramdisk
}
} | if_condition | [] |
Rust | src/lib.rs | andreyk0/st7920 | c7db218fddbc48d2054924be326cbbbefac1a1ea |
#![no_std]
use num_derive::ToPrimitive;
use num_traits::ToPrimitive;
use embedded_hal::blocking::delay::DelayUs;
use embedded_hal::blocking::spi;
use embedded_hal::digital::v2::OutputPin;
#[derive(Debug)]
pub enum Error<CommError, PinError> {
Comm(CommError),
Pin(PinError),
}
#[derive(ToPrimitive)]
enum In... |
#![no_std]
use num_derive::ToPrimitive;
use num_traits::ToPrimitive;
use embedded_hal::blocking::delay::DelayUs;
use embedded_hal::blocking::spi;
use embedded_hal::digital::v2::OutputPin;
#[derive(Debug)]
pub enum Error<CommError, PinError> {
Comm(CommError),
Pin(PinError),
}
#[derive(ToPrimitive)]
enum In... | t_high().map_err(Error::Pin)?;
delay.delay_us(40 * 1000);
Ok(())
}
fn write_command(&mut self, command: Instruction) -> Result<(), Error<SPIError, PinError>> {
self.write_command_param(command, 0)
}
fn write_command_param(
&mut self,
command: Instruction,
... | yn DelayUs<u32>) -> Result<(), Error<SPIError, PinError>> {
self.enable_cs(delay)?;
self.hard_reset(delay)?;
self.write_command(Instruction::BasicFunction)?;
delay.delay_us(200);
self.write_command(Instruction::DisplayOnCursorOff)?;
delay.delay_us(100);
self.write... | random | [
{
"content": "fn main() {\n\n // Put the linker script somewhere the linker can find it\n\n let out = &PathBuf::from(env::var_os(\"OUT_DIR\").unwrap());\n\n File::create(out.join(\"memory.x\"))\n\n .unwrap()\n\n .write_all(include_bytes!(\"memory.x\"))\n\n .unwrap();\n\n println... |
Rust | src/connectivity/network/testing/netemul/runner/helpers/netstack_cfg/src/main.rs | EnderNightLord-ChromeBook/fuchsia-pine64-pinephone | 05e2c059b57b6217089090a0315971d1735ecf57 |
use {
anyhow::{format_err, Context as _, Error},
fidl_fuchsia_net,
fidl_fuchsia_net_stack::StackMarker,
fidl_fuchsia_net_stack_ext::FidlReturn,
fidl_fuchsia_netemul_network::{EndpointManagerMarker, NetworkContextMarker},
fidl_fuchsia_netstack::{InterfaceConfig, NetstackMarker},
fuchsia_asy... |
use {
anyhow::{format_err, Context as _, Error},
fidl_fuchsia_net,
fidl_fuchsia_net_stack::StackMarker,
fidl_fuchsia_net_stack_ext::FidlReturn,
fidl_fuchsia_netemul_network::{EndpointManagerMarker, NetworkContextMarker},
fidl_fuchsia_netstack::{InterfaceConfig, NetstackMarker},
fuchsia_asy... | _net_interfaces_ext::wait_interface_with_id(
fidl_fuchsia_net_interfaces_ext::event_stream_from_state(&interface_state)?,
&mut fidl_fuchsia_net_interfaces_ext::InterfaceState::Unknown(nicid.into()),
|properties| {
if !opt.skip_up_check && !properties.online.unwrap_or(false) {
... | => fidl_fuchsia_net_ext::IpAddress(
std::net::IpAddr::V4(std::net::Ipv4Addr::UNSPECIFIED),
),
fidl_fuchsia_net::IpAddress::Ipv6(..) => fidl_fuchsia_net_ext::IpAddress(
std::net::IpAddr::V6(std::net::Ipv6Addr::UNSPECIFIED),
),
}
.into()... | random | [] |
Rust | game/src/sandbox/minimap.rs | balbok0/abstreet | 3af15fefdb2772c83864c08724318418da8190a9 | use abstutil::prettyprint_usize;
use map_gui::tools::{MinimapControls, Navigator};
use widgetry::{
ControlState, EventCtx, GfxCtx, HorizontalAlignment, Image, Key, Line, Panel, ScreenDims, Text,
VerticalAlignment, Widget,
};
use crate::app::App;
use crate::app::Transition;
use crate::common::Warping;
use crate... | use abstutil::prettyprint_usize;
use map_gui::tools::{MinimapControls, Navigator};
use widgetry::{
ControlState, EventCtx, GfxCtx, HorizontalAlignment, Image, Key, Line, Panel, ScreenDims, Text,
VerticalAlignment, Widget,
};
use crate::app::App;
use crate::app::Transition;
use crate::common::Warping;
use crate... |
let counts = app.primary.sim.num_commuters_vehicles();
let pedestrian_details = {
let tooltip = Text::from_multiline(vec![
Line("Pedestrians"),
Line(format!(
"Walking commuters: {}",
prettyprint_usize(counts.walking_commuters)
))
... | widgetry/icons/checkbox_no_border_unchecked.svg"
))
.color(RewriteColor::Change(Color::BLACK, color.alpha(0.3)));
let mut row = GeomBatchStack::horizontal(vec![
checkbox.build_batch(ctx).expect("invalid svg").0,
icon_batch.clone(),
]);
... | function_block-function_prefix_line | [
{
"content": "fn make_btn(ctx: &EventCtx, label: &str, tooltip: &str, is_persisten_split: bool) -> Button {\n\n // If we want to make Dropdown configurable, pass in or expose its button builder?\n\n let builder = if is_persisten_split {\n\n // Quick hacks to make PersistentSplit's dropdown look a l... |
Rust | crates/sipmsg/src/headers/header.rs | armatusmiles/sipcore | 7e0bd478d47a53082467bb231655b6f3f5733cb2 | use crate::{
common::{bnfcore::*, errorparse::SipParseError, nom_wrappers::from_utf8_nom, take_sws_token},
headers::{
parsers::ExtensionParser,
traits::{HeaderValueParserFn, SipHeaderParser},
GenericParams, SipRFCHeader, SipUri,
},
};
use alloc::collections::{BTreeMap, VecDeque};
use... | use crate::{
common::{bnfcore::*, errorparse::SipParseError, nom_wrappers::from_utf8_nom, take_sws_token},
headers::{
parsers::ExtensionParser,
traits::{HeaderValueParserFn, SipHeaderParser},
GenericParams, SipRFCHeader, SipUri,
},
};
use alloc::collections::{BTreeMap, VecDeque};
use... | nput[0] != b';' {
return Ok((input, None));
}
let (input, parameters) = GenericParams::parse(input)?;
Ok((input, Some(parameters)))
}
pub fn parse(
input: &'a [u8],
) -> nom::IResult<&[u8], (Option<SipRFCHeader>, VecDeque<Header<'a>>), SipParseError> {
le... | in,
Realm,
Nonce,
DigestUri,
Dresponse,
Algorithm,
Cnonce,
Opaque,
Stale,
QopValue,
NonceCount,
Number,
Method,
ID,
Host,
Port,
Star,
DisplayName,
Seconds,
Comment,
Major,
Minor,
TimveVal,
Delay,
ProtocolName,
Pr... | random | [
{
"content": "pub fn take(input: &[u8]) -> nom::IResult<&[u8], HeaderValue, SipParseError> {\n\n let (inp, res_val) = take_while1(is_digit)(input)?;\n\n let (_, hdr_val) = HeaderValue::new(res_val, HeaderValueType::Digit, None, None)?;\n\n Ok((inp, hdr_val))\n\n}\n",
"file_path": "crates/sipmsg/src... |
Rust | src/peripherals.rs | tstellanova/px4flow_bsp | 751151cb0c826148013b0709e7a246a9d9ca774d | /*
Copyright (c) 2020 Todd Stellanova
LICENSE: BSD3 (see LICENSE file)
*/
use p_hal::stm32 as pac;
use stm32f4xx_hal as p_hal;
use pac::{DCMI, RCC};
use embedded_hal::blocking::delay::{DelayMs, DelayUs};
use embedded_hal::digital::v2::{OutputPin, ToggleableOutputPin};
use embedded_hal::timer::CountDown;
use embedded... | /*
Copyright (c) 2020 Todd Stellanova
LICENSE: BSD3 (see LICENSE file)
*/
use p_hal::stm32 as pac;
use stm32f4xx_hal as p_hal;
use pac::{DCMI, RCC};
use embedded_hal::blocking::delay::{DelayMs, DelayUs};
use embedded_hal::digital::v2::{OutputPin, ToggleableOutputPin};
use embedded_hal::timer::CountDown;
use embedded... |
pub type I2c1Port = p_hal::i2c::I2c<
pac::I2C1,
(
p_hal::gpio::gpiob::PB8<p_hal::gpio::AlternateOD<p_hal::gpio::AF4>>,
p_hal::gpio::gpiob::PB9<p_hal::gpio::AlternateOD<p_hal::gpio::AF4>>,
),
>;
pub type I2c2Port = p_hal::i2c::I2c<
pac::I2C2,
(
p_hal::gpio::gpiob::PB10<p_ha... | h),
gpioe
.pe5
.into_pull_up_input()
.into_alternate_af13()
.internal_pull_up(true)
.set_speed(Speed::VeryHigh),
gpioe
.pe6
.into_pull_up_input()
.into_alternate_af13()
.internal_pull_up(true)
... | function_block-function_prefixed | [
{
"content": "fn main() {\n\n use std::env;\n\n use std::fs::File;\n\n use std::io::Write;\n\n use std::path::PathBuf;\n\n let memfile_bytes = include_bytes!(\"stm32f407_memory.x\");\n\n\n\n //stm32f427\n\n // Put the linker script somewhere the linker can find it\n\n let out = &PathBuf:... |
Rust | weld/tests/dictionary_tests.rs | winding-lines/weld | beebaacabd11327dea2e51071b708de238c84386 |
use fnv;
use std::collections::hash_map::Entry;
mod common;
use crate::common::*;
#[repr(C)]
struct I32KeyValArgs {
x: WeldVec<i32>,
y: WeldVec<i32>,
}
#[test]
fn simple_for_dictmerger_loop() {
let code = "|x:vec[i32], y:vec[i32]| tovec(result(for(zip(x,y), dictmerger[i32,i32,+],
|b,i,... |
use fnv;
use std::collections::hash_map::Entry;
mod common;
use crate::common::*;
#[repr(C)]
struct I32KeyValArgs {
x: WeldVec<i32>,
y: WeldVec<i32>,
}
#[test]
fn simple_for_dictmerger_loop() {
let code = "|x:vec[i32], y:vec[i32]| tovec(result(for(zip(x,y), dictmerger[i32,i32,+],
|b,i,... | = ret_value.data() as *const bool;
let result = unsafe { (*data).clone() };
let output = false;
assert_eq!(output, result);
}
| clone());
let data = ret_value.data() as *const bool;
let result = unsafe { (*data).clone() };
let output = true;
assert_eq!(output, result);
let ref conf = default_conf();
let ret_value = compile_and_run(code_false, conf, input_data.clone());
let data | function_block-random_span | [] |
Rust | day22/src/main.rs | ajtribick/AdventOfCode2020 | a633a31ff0d456b587dd7602a30c9d841417f3a0 | use std::{
collections::VecDeque,
error::Error,
fs::File,
io::{BufRead, BufReader},
path::{Path, PathBuf},
};
use ahash::AHashSet;
#[derive(Debug, Clone, Copy)]
pub enum Player {
Player1,
Player2,
}
#[derive(Debug, Clone)]
pub struct Game {
player1: VecDeque<u64>,
player2: VecDequ... | use std::{
collections::VecDeque,
error::Error,
fs::File,
io::{BufRead, BufReader},
path::{Path, PathBuf},
};
use ahash::AHashSet;
#[derive(Debug, Clone, Copy)]
pub enum Player {
Player1,
Player2,
}
#[derive(Debug, Clone)]
pub struct Game {
player1: VecDeque<u64>,
player2: VecDequ... | er.unwrap()
} else if card1 > card2 {
Player::Player1
} else {
Player::Player2
};
match winner {
Player::Player1 => {
self.player1.push_back(card1);
self.player1.push_back(card2);
... | rn;
}
let card1 = self.player1.pop_front().unwrap();
let card2 = self.player2.pop_front().unwrap();
let winner = if self.player1.len() as u64 >= card1 && self.player2.len() as u64 >= card2
{
let mut sub_game = Self::new(
s... | random | [
{
"content": "fn part2(lines: impl Iterator<Item = impl AsRef<str>> + Clone) {\n\n let result = SLOPES\n\n .iter()\n\n .map(|&(right_step, down_step)| count_trees(lines.clone(), right_step, down_step))\n\n .product::<u32>();\n\n println!(\"Part 2: product is {}\", result);\n\n}\n\n\n"... |
Rust | jvmkill/src/heap/types.rs | cloudfoundry/jvmkill | d1d7f104f94227e3c97166b633ec3ddb8e6c39fe | /*
* Copyright 2015-2019 the original author or authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by ap... | /*
* Copyright 2015-2019 the original author or authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by ap... | unsafe { classes.offset(1) }))
.times(1)
.in_sequence(&mut seq)
.return_const((String::from("bravo-type"), String::from("bravo-generic")));
jvmti
.expect_set_tag()
.withf_st(move |&a_class, &a_tag| {
ptr::eq(a_class, unsafe { classes.... | seq)
.return_const((String::from("alpha-type"), String::from("alpha-generic")));
jvmti
.expect_set_tag()
.withf_st(move |&a_class, &a_tag| {
ptr::eq(a_class, unsafe { classes.offset(1) })
&& a_tag == 1
})
.times(1)... | function_block-random_span | [
{
"content": "#[test]\n\nfn time_10_count_2() {\n\n let r = Runner {\n\n class: \"org.cloudfoundry.jvmkill.ThreadExhaustion\",\n\n arguments: \"=time=10,count=2,printHeapHistogram=0,printMemoryUsage=0\",\n\n std_out: vec!(),\n\n std_err: vec!(\n\n \"Resource Exhausted! ... |
Rust | src/round.rs | xoac/chrono | 37fb8005f196e9e67629d28c0ae84a3b9d31926a |
use oldtime::Duration;
use std::ops::{Add, Sub};
use Timelike;
pub trait SubsecRound {
fn round_subsecs(self, digits: u16) -> Self;
fn trunc_subsecs(self, digits: u16) -> Self;
}
impl<T> SubsecRound for... |
use oldtime::Duration;
use std::ops::{Add, Sub};
use Timelike;
pub trait SubsecRound {
fn round_subsecs(self, digits: u16) -> Self;
fn trunc_subsecs(self, digits: u16) -> Self;
}
impl<T> SubsecRound for... |
#[cfg(test)]
mod tests {
use super::SubsecRound;
use offset::{FixedOffset, TimeZone, Utc};
use Timelike;
#[test]
fn test_round() {
let pst = FixedOffset::east(8 * 60 * 60);
let dt = pst.ymd(2018, 1, 11).and_hms_nano(10, 5, 13, 084_660_684);
assert_eq!(dt.round_subsecs(10)... | 0 => 1_000_000_000,
1 => 100_000_000,
2 => 10_000_000,
3 => 1_000_000,
4 => 100_000,
5 => 10_000,
6 => 1_000,
7 => 100,
8 => 10,
_ => 1,
}
} | function_block-function_prefix_line | [
{
"content": "pub fn cycle_to_yo(cycle: u32) -> (u32, u32) {\n\n let (mut year_mod_400, mut ordinal0) = div_rem(cycle, 365);\n\n let delta = u32::from(YEAR_DELTAS[year_mod_400 as usize]);\n\n if ordinal0 < delta {\n\n year_mod_400 -= 1;\n\n ordinal0 += 365 - u32::from(YEAR_DELTAS[year_mod... |
Rust | src/reader.rs | sayantangkhan/oxyscheme | 742da72abbd719bf66898e46bd3913191f3d00fb |
use crate::lexer::*;
use crate::parser::{parse_datum, Datum};
use crate::*;
use anyhow::Result;
use std::{
fs::File,
io::{BufRead, BufReader, Lines},
iter::{Enumerate, Peekable},
path::PathBuf,
};
pub struct FileLexer {
file: File,
}
impl FileLexer {
pub fn new(filename: &str) -> Result<... |
use crate::lexer::*;
use crate::parser::{parse_datum, Datum};
use crate::*;
use anyhow::Result;
use std::{
fs::File,
io::{BufRead, BufReader, Lines},
iter::{Enumerate, Peekable},
path::PathBuf,
};
pub struct FileLexer {
file: File,
}
impl FileLexer {
pub fn new(filename: &str) -> Result<... | )
}
}
}
}
pub struct DatumIterator<I>
where
I: Iterator<Item = Result<TokenWithPosition, CompilerError>>,
{
token_stream: Peekable<I>,
encountered_error: bool,
}
impl<I> DatumIterator<I>
where
I: Iterator<Item = Result<TokenWithPosition, CompilerError>>,
{
pub fn new(t... | Err(CompilerError::LexError(
String::from(&self.input_string[self.cursor_position..]),
self.line_number,
self.cursor_position,
)) | call_expression | [
{
"content": "/// Parses a single `Datum` from the token stream\n\npub fn parse_datum<I>(token_stream: &mut Peekable<I>) -> Result<Datum, CompilerError>\n\nwhere\n\n I: Iterator<Item = Result<TokenWithPosition, CompilerError>>,\n\n{\n\n match token_stream.peek() {\n\n Some(Ok(TokenWithPosition {\n\... |
Rust | src/storage/assembler.rs | ProgVal/smoltcp | 1bde6e7ec45684019f191714c158e2f496eb49d0 | use core::fmt;
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
struct Contig {
hole_size: usize,
data_size: usize
}
impl fmt::Display for Contig {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
if self.has_hole() { write!(f, "({})", self.hole_size)?; }
if self.has_hole() && self.has_d... | use core::fmt;
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
struct Contig {
hole_size: usize,
data_size: usize
}
impl fmt::Display for Contig {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
if self.has_hole() { write!(f, "({})", self.hole_size)?; }
if self.has_hole() && self.has_d... |
if offset >= contig.total_size() {
offset = offset.saturating_sub(contig.total_size());
} else {
size = (offset + size).saturating_sub(contig.total_size());
offset = 0;
}
}
debug_assert!(size == 0);
... | if offset <= contig.hole_size && offset + size >= contig.hole_size {
self.contigs[index].shrink_hole_to(offset);
index += 1;
} else if offset + size >= contig.hole_size {
index += 1;
} else if offs... | if_condition | [
{
"content": "pub fn parse_middleware_options<D>(matches: &mut Matches, device: D, loopback: bool)\n\n -> FaultInjector<EthernetTracer<PcapWriter<D, Rc<PcapSink>>>>\n\n where D: for<'a> Device<'a>\n\n{\n\n let drop_chance = matches.opt_str(\"drop-chance\").map(|s| u8::from_str(&s).unwrap())\n\... |
Rust | src/serde/mod.rs | soenkehahn/time | 1860b1482e96e3973fbad634739eb21c5bc0190d |
pub mod timestamp;
use serde::de::Error as _;
#[cfg(feature = "serde-human-readable")]
use serde::ser::Error as _;
use serde::{Deserialize, Deserializer, Serialize, Serializer};
use crate::error::ComponentRange;
#[cfg(feature = "serde-human-readable")]
use crate::{
error,
format_description::{modifier, Comp... |
pub mod timestamp;
use serde::de::Error as _;
#[cfg(feature = "serde-human-readable")]
use serde::ser::Error as _;
use serde::{Deserialize, Deserializer, Serialize, Serializer};
use crate::error::ComponentRange;
#[cfg(feature = "serde-human-readable")]
use crate::{
error,
format_description::{modifier, Comp... | eturn serializer.serialize_str(&match self.format(&UTC_OFFSET_FORMAT) {
Ok(s) => s,
Err(_) => return Err(S::Error::custom("failed formatting `UtcOffset`")),
});
}
(
self.whole_hours(),
self.minutes_past_hour(),
self.seconds... | eserializer<'a>>(deserializer: D) -> Result<Self, D::Error> {
#[cfg(feature = "serde-human-readable")]
if deserializer.is_human_readable() {
return Self::parse(<&str>::deserialize(deserializer)?, &TIME_FORMAT)
.map_err(error::Parse::to_invalid_serde_value::<D>);
}
... | random | [
{
"content": "/// Deserialize an `OffsetDateTime` from its Unix timestamp\n\npub fn deserialize<'a, D: Deserializer<'a>>(deserializer: D) -> Result<OffsetDateTime, D::Error> {\n\n i64::deserialize(deserializer).and_then(|timestamp| {\n\n OffsetDateTime::from_unix_timestamp(timestamp)\n\n .m... |
Rust | crates/kitsune_p2p/direct/src/types/kdhash.rs | mhuesch/holochain | 8cade151329117c40e47533449a2f842187c373a |
use crate::*;
use futures::future::{BoxFuture, FutureExt};
use kitsune_p2p::*;
pub use kitsune_p2p_direct_api::KdHash;
pub trait KdHashExt: Sized {
fn to_kitsune_space(&self) -> Arc<KitsuneSpace>;
fn from_kitsune_space(space: &KitsuneSpace) -> Self;
fn to_kitsune_agent(&self) -> Arc<Kit... |
use crate::*;
use futures::future::{BoxFuture, FutureExt};
use kitsune_p2p::*;
pub use kitsune_p2p_direct_api::KdHash;
pub trait KdHashExt: Sized {
fn to_kitsune_space(&self) -> Arc<KitsuneSpace>;
fn from_kitsune_space(space: &KitsuneSpace) -> Self;
fn to_kitsune_agent(&self) -> Arc<Kit... | out)
}
| signature: Arc<[u8; 64]>,
) -> BoxFuture<'static, bool>;
fn from_data(data: &[u8]) -> BoxFuture<'static, KdResult<Self>>;
fn from_coerced_pubkey(data: [u8; 32]) -> BoxFuture<'static, KdResult<Self>>;
}
impl KdHashExt for KdHash {
fn to_kitsune_space(&self) -> Arc<KitsuneSpace> {
... | random | [
{
"content": "/// internal REPR for holo hash\n\npub fn holo_hash_encode(data: &[u8]) -> String {\n\n format!(\"u{}\", base64::encode_config(data, base64::URL_SAFE_NO_PAD),)\n\n}\n\n\n",
"file_path": "crates/holo_hash/src/encode.rs",
"rank": 1,
"score": 254914.76057821707
},
{
"content": ... |
Rust | src/theorem.rs | MDeiml/attomath | 4aac4dad3cd776dd2cb1602aa930c04c315d5186 | use std::{cmp::Ordering, num::Wrapping};
use crate::{
dvr::DVR,
error::ProofError,
expression::{
is_operator, ChainSubstitution, ShiftSubstitution, Substitution, VariableSubstitution,
WholeSubstitution,
},
statement::OwnedStatement,
types::*,
};
#[derive(PartialEq, Eq, PartialO... | use std::{cmp::Ordering, num::Wrapping};
use crate::{
dvr::DVR,
error::ProofError,
expression::{
is_operator, ChainSubstitution, ShiftSubstitution, Substitution, VariableSubstitution,
WholeSubstitution,
},
statement::OwnedStatement,
types::*,
};
#[derive(PartialEq, Eq, PartialO... |
pub fn substitute<S: Substitution>(&self, substitution: &S) -> Result<Self, ProofError> {
self.substitute_skip_assumption(substitution, None)
}
fn substitute_skip_assumption<S: Substitution>(
&self,
substitution: &S,
skip_assumption: Opti... | assumptions
.iter()
.map(|st| st.expression.variables())
.flatten(),
)
.filter(|symb| !is_operator(*symb))
.max()
.unwrap_or(-1)
} | function_block-function_prefixed | [
{
"content": "/// Tests whether the given identifier is an operator.\n\n///\n\n/// Operators occupy the range `(Identifier::MIN ..= -1)`.\n\n/// The special value `Identifier::MIN` is also an operator.\n\n///\n\n/// # Example\n\n/// ```\n\n/// use attomath::{expression::is_operator, Identifier};\n\n///\n\n/// a... |
Rust | libpf-rs/src/filter.rs | kckeiks/pf-rs | 608fb83a3b583eb03af63a61d90d7dba0d70d296 | use std::fs::File;
use std::io::Write;
use std::path::Path;
use anyhow::Result;
use tempfile::tempdir;
use crate::bpf::{BPFLink, BPFObj};
use crate::bpfcode::{
DEFINES, EVAL_BOTH_IPVER, EVAL_NOOP, EVAL_ONLY_IP4, EVAL_ONLY_IP6, INCLUDE_HEADERS,
IP4RULES_MAPS, IP4_EVAL_FUNCS, IP6RULES_MAPS, IP6_EVAL_FUNCS, PARS... | use std::fs::File;
use std::io::Write;
use std::path::Path;
use anyhow::Result;
use tempfile::tempdir;
use crate::bpf::{BPFLink, BPFObj};
use crate::bpfcode::{
DEFINES, EVAL_BOTH_IPVER, EVAL_NOOP, EVAL_ONLY_IP4, EVAL_ONLY_IP6, INCLUDE_HEADERS,
IP4RULES_MAPS, IP4_EVAL_FUNCS, IP6RULES_MAPS, IP6_EVAL_FUNCS, PARS... | .map_err(|e| Error::Internal(e.to_string()))?;
}
let link = bpf_obj
.attach_prog(ifindex)
.map_err(|e| Error::Internal(e.to_string()))?;
Ok(link)
}
pub fn generate_src(self) -> Result<()> {
let filename = "pfdebug";
let ... | .update_map("ipv4_rules", &index, &initial_value, 0)
.map_err(|e| Error::Internal(e.to_string()))?;
}
for (i, rule) in self.ipv6_rules.into_iter().enumerate() {
let initial_value =
bincode2::serialize(&rule).map_err(|e| Error::Internal(e.to_st... | random | [
{
"content": "pub fn load_filter(rules: Vec<Rule>, ifindex: i32) -> Result<BPFLink> {\n\n let mut f = Filter::new();\n\n for r in rules.into_iter() {\n\n f.add_rule(r);\n\n }\n\n Ok(f.load_on(ifindex)?)\n\n}\n\n\n",
"file_path": "pf-rs/src/main.rs",
"rank": 0,
"score": 148013.1963... |
Rust | src/bin/wasmtime.rs | erights/wasmtime | a5823896b70aab5f7675c5ff7651e37324c88262 |
#![deny(
missing_docs,
trivial_numeric_casts,
unused_extern_crates,
unstable_features
)]
#![warn(unused_import_braces)]
#![cfg_attr(feature = "clippy", plugin(clippy(conf_file = "../clippy.toml")))]
#![cfg_attr(
feature = "cargo-clippy",
allow(clippy::new_without_default, clippy::new_without_d... |
#![deny(
missing_docs,
trivial_numeric_casts,
unused_extern_crates,
unstable_features
)]
#![warn(unused_import_braces)]
#![cfg_attr(feature = "clippy", plugin(clippy(conf_file = "../clippy.toml")))]
#![cfg_attr(
feature = "cargo-clippy",
allow(clippy::new_without_default, clippy::new_without_d... |
let mut flag_builder = settings::builder();
let mut features: Features = Default::default();
flag_builder.enable("avoid_div_traps")?;
let debug_info = args.flag_g;
if cfg!(debug_assertions) {
flag_builder.enable("enable_verifier")?;
}
if args.flag_enabl... | if !errors.is_empty() {
eprintln!("Cache initialization failed. Errors:");
for e in errors {
eprintln!("-> {}", e);
}
exit(1);
} | if_condition | [
{
"content": "fn write_stats_file(path: &Path, stats: &ModuleCacheStatistics) -> bool {\n\n toml::to_string_pretty(&stats)\n\n .map_err(|err| {\n\n warn!(\n\n \"Failed to serialize stats file, path: {}, err: {}\",\n\n path.display(),\n\n err\n\n ... |
Rust | src/io/read/take.rs | mvucenovic/async-std | 98c79f4ff90e92de0ebec103709c9c41badc3dbd | use std::cmp;
use std::pin::Pin;
use crate::io::{self, BufRead, Read};
use crate::task::{Context, Poll};
#[derive(Debug)]
pub struct Take<T> {
pub(crate) inner: T,
pub(crate) limit: u64,
}
impl<T> Take<T> {
... | use std::cmp;
use std::pin::Pin;
use crate::io::{self, BufRead, Read};
use crate::task::{Context, Poll};
#[derive(Debug)]
pub struct Take<T> {
pub(crate) inner: T,
pub(crate) limit: u64,
}
impl<T> Take<T> {
... |
impl<T: BufRead + Unpin> BufRead for Take<T> {
fn poll_fill_buf(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<io::Result<&[u8]>> {
let Self { inner, limit } = unsafe { self.get_unchecked_mut() };
let inner = unsafe { Pin::new_unchecked(inner) };
if *limit == 0 {
return P... | pub fn take_read_internal<R: Read + ?Sized>(
mut rd: Pin<&mut R>,
cx: &mut Context<'_>,
buf: &mut [u8],
limit: &mut u64,
) -> Poll<io::Result<usize>> {
if *limit == 0 {
return Poll::Ready(Ok(0));
}
let max = cmp::min(buf.len() as u64, *limit) as usize;
match futures_core::... | function_block-full_function | [
{
"content": "pub fn read_line_internal<R: BufRead + ?Sized>(\n\n reader: Pin<&mut R>,\n\n cx: &mut Context<'_>,\n\n buf: &mut String,\n\n bytes: &mut Vec<u8>,\n\n read: &mut usize,\n\n) -> Poll<io::Result<usize>> {\n\n let ret = futures_core::ready!(read_until_internal(reader, cx, b'\\n', byt... |
Rust | src/simulation.rs | Phraeyll/rballistics-flat | 451ec376bd22f98059d5dd22c05896d9b458133d |
use crate::{
consts::{FRAC_PI_2, PI},
error::{Error, Result},
my_quantity,
projectiles::ProjectileImpl,
units::{
celsius, fahrenheit, foot_per_second, grain, inch, inch_of_mercury, kelvin, kilogram,
meter, meter_per_second, meter_per_second_squared, mile_per_hour, pascal, radian, se... |
use crate::{
consts::{FRAC_PI_2, PI},
error::{Error, Result},
my_quantity,
projectiles::ProjectileImpl,
units::{
celsius, fahrenheit, foot_per_second, grain, inch, inch_of_mercury, kelvin, kilogram,
meter, meter_per_second, meter_per_second_squared, mile_per_hour, pascal, radian, se... |
pub fn set_wind_angle(mut self, value: Angle) -> Result<Self> {
let min = Angle::new::<radian>(-2.0 * PI);
let max = Angle::new::<radian>(2.0 * PI);
if value >= min && value <= max {
self.builder.wind.yaw = value;
Ok(self)
} else {
Err(Error::OutO... | lt<Self> {
if value.is_sign_positive() {
self.builder.wind.velocity = value;
Ok(self)
} else {
Err(Error::PositiveExpected(value.get::<meter_per_second>()))
}
} | function_block-function_prefixed | [
{
"content": "pub fn table() -> NumericMap {\n\n float_btree_map![\n\n 0.00 => 0.1710,\n\n 0.05 => 0.1719,\n\n 0.10 => 0.1727,\n\n 0.15 => 0.1732,\n\n 0.20 => 0.1734,\n\n 0.25 => 0.1730,\n\n 0.30 => 0.1718,\n\n 0.35 => 0.1696,\n\n 0.40 =... |
Rust | src/stream.rs | jws121295/dansible | 4c32335b048560352135480ab0216ff5be6bd8fa | use byteorder::{BigEndian, ByteOrder, ReadBytesExt};
use std::collections::HashMap;
use std::collections::hash_map::Entry;
use std::io::{Cursor, Seek, SeekFrom};
use session::{Session, PacketHandler};
pub enum Response<H, S = H> {
Continue(H),
Spawn(S),
Close,
}
impl <H: Handler + 'static> Response<H> {
... | use byteorder::{BigEndian, ByteOrder, ReadBytesExt};
use std::collections::HashMap;
use std::collections::hash_map::Entry;
use std::io::{Cursor, Seek, SeekFrom};
use session::{Session, PacketHandler};
pub enum Response<H, S = H> {
Continue(H),
Spawn(S),
Close,
}
impl <H: Handler + 'static> Response<H> {
... |
}
impl PacketHandler for StreamManager {
fn handle(&mut self, cmd: u8, data: Vec<u8>, session: &Session) {
let id: ChannelId = BigEndian::read_u16(&data[0..2]);
let spawn = if let Entry::Occupied(mut entry) = self.channels.entry(id) {
if let Some(channel) = entry.get_mut().take() {
... | pub fn create(&mut self, handler: Box<Handler>, session: &Session) {
let channel_id = self.next_id;
self.next_id += 1;
trace!("allocated stream {}", channel_id);
match handler.box_on_create(channel_id, session) {
Response::Continue(handler) => {
self.channel... | function_block-full_function | [
{
"content": "pub trait Handler : Sized + Send + 'static {\n\n fn on_header(self, header_id: u8, header_data: &[u8], session: &Session) -> Response<Self>;\n\n fn on_data(self, offset: usize, data: &[u8], session: &Session) -> Response<Self>;\n\n fn on_eof(self, session: &Session) -> Response<Self>;\n\n... |
Rust | butane/tests/common/pg.rs | DimmKG/butane | fcf9dcddb3e55f827daa9f54a6f276a9fce84903 | use butane::db::{Backend, Connection, ConnectionSpec};
use once_cell::sync::Lazy;
use std::io::{BufRead, BufReader, Read, Write};
use std::path::PathBuf;
use std::process::{ChildStderr, Command, Stdio};
use uuid_for_test::Uuid;
pub fn pg_connection() -> (Connection, PgSetupData) {
let backend = butane::db::get_bac... | use butane::db::{Backend, Connection, ConnectionSpec};
use once_cell::sync::Lazy;
use std::io::{BufRead, BufReader, Read, Write};
use std::path::PathBuf;
use std::process::{ChildStderr, Command, Stdio};
use uuid_for_test::Uuid;
pub fn pg_connection() -> (Connection, PgSetupData) {
let backend = butane::db::get_bac... |
}
eprintln!("createdtmp server!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!");
PgServerState {
dir,
sockdir,
proc,
stderr,
}
}
static TMP_SERVER: Lazy<PgServerState> = Lazy::new(|| create_tmp_server());
pub fn pg_setup() -> PgSetupData {
eprintln!("pg_setup");
... | if proc.try_wait().unwrap().is_some() {
buf.clear();
stderr.read_to_string(&mut buf).unwrap();
eprint!("{}", buf);
panic!("postgres process died");
} | if_condition | [
{
"content": "pub fn sql_order(order: &[Order], w: &mut impl Write) {\n\n write!(w, \" ORDER BY \").unwrap();\n\n order.iter().fold(\"\", |sep, o| {\n\n let sql_dir = match o.direction {\n\n OrderDirection::Ascending => \"ASC\",\n\n OrderDirection::Descending => \"DESC\",\n\n ... |
Rust | pretend/examples/responses.rs | orzogc/pretend | 75824a5638b38e93bb9fe4cf35d2a59faf1053cc | use pretend::{pretend, Json, JsonResult, Pretend, Response, Result, Url};
use pretend_reqwest::Client;
use serde::Deserialize;
#[derive(Clone, Debug, Deserialize)]
struct Contributor {
login: String,
}
type Contributors = Vec<Contributor>;
#[derive(Clone, Debug, Deserialize)]
struct GithubError {
message: St... | use pretend::{pretend, Json, JsonResult, Pretend, Response, Result, Url};
use pretend_reqwest::Client;
use serde::Deserialize;
#[derive(Clone, Debug, Deserialize)]
struct Contributor {
login: String,
}
type Contributors = Vec<Contributor>;
#[derive(Clone, Debug, Deserialize)]
struct GithubError {
message: St... | d.json_result_response("pretend").await.unwrap();
println!("HTTP {}, {:?}", result.status(), result.body());
let result = pretend.string("non-existing").await;
assert!(result.is_err());
let result = pretend.bytes("non-existing").await;
assert!(result.is_err());
let result = pretend... | function_block-function_prefixed | [
{
"content": "fn create_pretend() -> impl HttpBin {\n\n let url = Url::parse(\"https://httpbin.org\").unwrap();\n\n Pretend::for_client(Client::default()).with_url(url)\n\n}\n\n\n\n#[tokio::main]\n\nasync fn main() {\n\n let pretend = create_pretend();\n\n\n\n let result = pretend.post_string_ref(\"... | |
Rust | src/state.rs | virome/amethyst | f6cbdfe6e5c38838190e59a35b6e6d35115af0cb |
use amethyst_input::is_close_requested;
use ecs::prelude::World;
use {GameData, StateEvent};
pub struct StateData<'a, T>
where
T: 'a,
{
pub world: &'a mut World,
pub data: &'a mut T,
}
impl<'a, T> StateData<'a, T>
where
T: 'a,
{
pub fn new(world: &'a mut World, data: &'a mut T) ->... |
use amethyst_input::is_close_requested;
use ecs::prelude::World;
use {GameData, StateEvent};
pub struct StateData<'a, T>
where
T: 'a,
{
pub world: &'a mut World,
pub data: &'a mut T,
}
impl<'a, T> StateData<'a, T>
where
T: 'a,
{
pub fn new(world: &'a mut World, data: &'a mut T) ->... |
pub fn update(&mut self, data: StateData<T>) {
let StateData { world, data } = data;
if self.running {
let trans = match self.state_stack.last_mut() {
Some(state) => state.update(StateData { world, data }),
None => Trans::None,
};
... | pub fn fixed_update(&mut self, data: StateData<T>) {
let StateData { world, data } = data;
if self.running {
let trans = match self.state_stack.last_mut() {
Some(state) => state.fixed_update(StateData { world, data }),
None => Trans::None,
};
... | function_block-full_function | [
{
"content": "/// Master trait used to define animation sampling on a component\n\npub trait AnimationSampling: Send + Sync + 'static + for<'b> ApplyData<'b> {\n\n /// The interpolation primitive\n\n type Primitive: InterpolationPrimitive + Clone + Copy + Send + Sync + 'static;\n\n /// An independent g... |
Rust | src/scene/mesh/vertex.rs | jackos/Fyrox | 4b293733bda8e1a0a774aaf82554ac8930afdd8b |
use crate::core::visitor::{Visit, VisitResult, Visitor};
use crate::{
core::algebra::{Vector2, Vector3, Vector4},
scene::mesh::buffer::{
VertexAttributeDataType, VertexAttributeDescriptor, VertexAttributeUsage,
},
};
use std::hash::{Hash, Hasher};
#[derive(Copy, Clone, Debug, Default)]
#[repr(C)]... |
use crate::core::visitor::{Visit, VisitResult, Visitor};
use crate::{
core::algebra::{Vector2, Vector3, Vector4},
scene::mesh::buffer::{
VertexAttributeDataType, VertexAttributeDescriptor, VertexAttributeUsage,
},
};
use std::hash::{Hash, Hasher};
#[derive(Copy, Clone, Debug, Default)]
#[repr(C)]... | visitor)?;
self.bone_indices[1].visit("BoneIndex1", visitor)?;
self.bone_indices[2].visit("BoneIndex2", visitor)?;
self.bone_indices[3].visit("BoneIndex3", visitor)?;
visitor.leave_region()
}
}
impl OldVertex {
pub fn layout() -> &'static [VertexAttributeDescriptor] {
... | [1].visit("Weight1", visitor)?;
self.bone_weights[2].visit("Weight2", visitor)?;
self.bone_weights[3].visit("Weight3", visitor)?;
self.bone_indices[0].visit("BoneIndex0", | function_block-random_span | [
{
"content": "/// Performs hashing of a sized value by interpreting it as raw memory.\n\npub fn hash_as_bytes<T: Sized, H: Hasher>(value: &T, hasher: &mut H) {\n\n hasher.write(value_as_u8_slice(value))\n\n}\n",
"file_path": "src/utils/mod.rs",
"rank": 0,
"score": 527698.0130796023
},
{
"... |
Rust | flare-agent/src/profile/tree.rs | kylixs/flare-profiler | dd27371476b1326a50b1d753a5a6e9bc4cf7c67b |
use std::collections::HashMap;
use std::rc::*;
use std::borrow::Cow;
use std::sync::atomic::{AtomicUsize, Ordering};
use std::sync::Mutex;
use std::sync::RwLock;
use std::sync::Arc;
use time::Duration;
use thread::*;
use log::{debug, info, warn};
use native::{JavaLong, JavaMethod};
use std::collections... |
use std::collections::HashMap;
use std::rc::*;
use std::borrow::Cow;
use std::sync::atomic::{AtomicUsize, Ordering};
use std::sync::Mutex;
use std::sync::RwLock;
use std::sync::Arc;
use time::Duration;
use thread::*;
use log::{debug, info, warn};
use native::{JavaLong, JavaMethod};
use std::collections... |
pub fn reset_top_call_stack_node(&mut self) {
self.top_call_stack_node = self.root_node;
}
pub fn begin_call(&mut self, method_id: &JavaMethod) -> bool {
let topNode = self.get_top_node();
match topNode.find_child(method_id) {
Some(child_id) => {
... | r) -> CallStackTree {
CallStackTree {
nodes: vec![TreeNode::newRootNode(thread_name)],
root_node: NodeId { index: 0 },
top_call_stack_node: NodeId { index: 0 },
total_duration: 0,
thread_id: thread_id
}
} | function_block-function_prefixed | [
{
"content": "fn get_stack_traces(jvmenv: &Box<Environment>, thread_info_map: &mut HashMap<JavaLong, ThreadInfo>, update_cpu_time: bool) -> Result<Vec<JavaStackTrace>, NativeError> {\n\n let mut stack_traces = vec![];\n\n match jvmenv.get_all_threads() {\n\n Err(e) => {\n\n println!(\"ge... |
Rust | src/arch/intel/interrupt/x2apic/local_apic.rs | VenmoTools/libarch | 589bd07a2fdcd3dfc16adbbb8f6c5d720fd3cb0c | use bit_field::BitField;
use crate::arch::intel::chips::flags::LocalAPICFlags;
use crate::arch::intel::interrupt::ApicInfo;
use crate::arch::intel::interrupt::x2apic::consts::*;
use crate::arch::intel::interrupt::x2apic::register::{IpiAllShorthand, IpiDeliveryMode, IpiDestMode, LocalApicRegisters, TimerDivide, TimerM... | use bit_field::BitField;
use crate::arch::intel::chips::flags::LocalAPICFlags;
use crate::arch::intel::interrupt::ApicInfo;
use crate::arch::intel::interrupt::x2apic::consts::*;
use crate::arch::intel::interrupt::x2apic::register::{IpiAllShorthand, IpiDeliveryMode, IpiDestMode, LocalApicRegisters, TimerDivide, TimerM... |
pub unsafe fn send_sipi(&mut self, vector: u8, dest: u32) {
let mut icr_val = self.format_icr(vector, IpiDeliveryMode::StartUp);
icr_val.set_bits(ICR_DESTINATION, u64::from(dest));
self.regs.write_icr(icr_val);
}
pub unsafe fn send_sipi_all(&mut self, vector: u8) {
... | let mut icr_val = self.format_icr(0, IpiDeliveryMode::NonMaskable);
icr_val.set_bits(ICR_DEST_SHORTHAND, who.into());
self.regs.write_icr(icr_val);
} | function_block-function_prefix_line | [
{
"content": "// Gets the upper segment selector for `irq`\n\npub fn hi(irq: u8) -> u32 {\n\n lo(irq) + 1\n\n}\n\n\n\n\n\nimpl IrqMode {\n\n pub(super) fn as_u32(self) -> u32 {\n\n self as u32\n\n }\n\n}\n\n\n\n/// The IOAPIC structure.\n\n#[derive(Debug)]\n\npub struct IoApic {\n\n regs: IoA... |
Rust | src/server/mod.rs | Twixes/metrobaza | edc5bfa8080b91fffdf13276ec2f79d340582963 | use crate::config;
use crate::constructs::components::Validatable;
use crate::executor::{ExecutorPayload, QueryResult};
use crate::sql::parse_statement;
use hyper::service::{make_service_fn, service_fn};
use hyper::{Body, Method, Request, Response, Server, StatusCode};
use serde::{ser::SerializeMap, Serialize, Serializ... | use crate::config;
use crate::constructs::components::Validatable;
use crate::executor::{ExecutorPayload, QueryResult};
use crate::sql::parse_statement;
use hyper::service::{make_service_fn, service_fn};
use hyper::{Body, Method, Request, Response, Server, StatusCode};
use serde::{ser::SerializeMap, Serialize, Serializ... | )
.with_graceful_shutdown(shutdown_signal());
info!("👂 Server listening on {}...", tcp_listen_address);
if let Err(e) = server.await {
error!("‼️ Encountered server error: {}", e);
} else {
debug!("⏹ Server no longer listening");
}
}
| make_service_fn(move |_conn| {
let executor_tx = executor_tx.clone();
async move {
Ok::<_, convert::Infallible>(service_fn(move |req| echo(executor_tx.clone(), req)))
}
}) | call_expression | [
{
"content": "pub fn parse_statement(input: &str) -> Result<Statement, SyntaxError> {\n\n let tokens = tokenize_statement(input);\n\n let ExpectOk {\n\n rest,\n\n outcome: found_token_first,\n\n ..\n\n } = expect_next_token(\n\n &tokens,\n\n &format!(\"{} or {}\", Key... |
Rust | crates/core/src/config/mod.rs | seank-com/ajour | b4f29e4b7526a91b03e7e73388dc2f5966950968 | use crate::catalog;
use crate::error::FilesystemError;
use crate::repository::CompressionFormat;
use glob::MatchOptions;
use serde::{Deserialize, Serialize};
use std::collections::HashMap;
use std::fmt::{self, Display, Formatter};
use std::fs::create_dir_all;
use std::path::{Path, PathBuf};
mod addons;
mod wow;
use c... | use crate::catalog;
use crate::error::FilesystemError;
use crate::repository::CompressionFormat;
use glob::MatchOptions;
use serde::{Deserialize, Serialize};
use std::collections::HashMap;
use std::fmt::{self, Display, Formatter};
use std::fs::create_dir_all;
use std::path::{Path, PathBuf};
mod addons;
mod wow;
use c... |
}
#[derive(Debug, Clone, Copy, PartialEq, Eq, Deserialize, Serialize, Hash, PartialOrd, Ord)]
pub enum Language {
Czech,
Norwegian,
English,
Danish,
German,
French,
Hungarian,
Portuguese,
Russian,
Slovak,
Swedish,
Spanish,
Turkish,
Ukrainian,
}
impl std::fmt::D... | fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
let s = match self {
SelfUpdateChannel::Stable => "Stable",
SelfUpdateChannel::Beta => "Beta",
};
write!(f, "{}", s)
} | function_block-full_function | [
{
"content": "pub fn path_add(path: PathBuf, flavor: Option<Flavor>) -> Result<()> {\n\n task::block_on(async {\n\n log::debug!(\"Adding {:?} from {:?} to known directories\", flavor, &path);\n\n let mut config = load_config().await?;\n\n config.add_wow_directories(path, flavor);\n\n ... |
Rust | src/parsers/apache2/mod.rs | u-siem/usiem-apache-httpd | c19d21c8fe0bacb86ff6eebf9c4e0e708e7d8714 | use chrono::prelude::{TimeZone, Utc};
use std::borrow::Cow;
use usiem::components::common::LogParsingError;
use usiem::events::common::{HttpMethod, WebProtocol};
use usiem::events::field::{SiemField, SiemIp};
use usiem::events::webserver::{WebServerEvent, WebServerOutcome};
use usiem::events::{SiemEvent, SiemLog};
pub... | use chrono::prelude::{TimeZone, Utc};
use std::borrow::Cow;
use usiem::components::common::LogParsingError;
use usiem::events::common::{HttpMethod, WebProtocol};
use usiem::events::field::{SiemField, SiemIp};
use usiem::events::webserver::{WebServerEvent, WebServerOutcome};
use usiem::events::{SiemEvent, SiemLog};
pub... |
pub fn extract_http_content<'a>(
message: &'a str,
) -> Result<(&'a str, &'a str, &'a str), &'static str> {
let mut splited = message.split(' ');
let method = match splited.next() {
Some(mt) => mt,
None => return Err("No method"),
};
let url = match splited.next() {
Some(mt... | let proto = match version.find('/') {
Some(p) => &version[..p],
None => version,
};
match proto {
"HTTP" => WebProtocol::HTTP,
"WS" => WebProtocol::WS,
"WSS" => WebProtocol::WSS,
"FTP" => WebProtocol::FTP,
_ => WebProtocol::UNKNOWN(proto.to_uppercase()),
... | function_block-function_prefix_line | [
{
"content": "/// Always use JSON format. Easy ato process and with more information.\n\npub fn parse_log_json(mut log: SiemLog) -> Result<SiemLog, LogParsingError> {\n\n let mod_log = match log.event() {\n\n SiemEvent::Unknown => {\n\n //Check JSON and extract\n\n let log_line =... |
Rust | src/http/ctr.rs | zaksabeast/libctr-rs | 556cf4857866db512ae415fd33f17131178ab465 | use super::{
get_httpc_service_raw_handle, httpc_add_post_data_ascii, httpc_add_request_header_field,
httpc_begin_request, httpc_create_context, httpc_initialize_connection_session,
httpc_receive_data_with_timeout, httpc_set_proxy_default, httpc_set_socket_buffer_size,
DefaultRootCert, HttpContextHandle... | use super::{
get_httpc_service_raw_handle, httpc_add_post_data_ascii, httpc_add_request_header_field,
httpc_begin_request, httpc_create_context, httpc_initialize_connection_session,
httpc_receive_data_with_timeout, httpc_set_proxy_default, httpc_set_socket_buffer_size,
DefaultRootCert, HttpContextHandle... |
pub fn set_client_cert_default(&self) -> CtrResult<()> {
let mut command = ThreadCommandBuilder::new(0x28u16);
unsafe { command.push(self.context_handle.get_raw()) };
command.push(0x40u32);
let mut parser = command.build().send_sync_request(&self.session_handle)?;
... | pub fn add_default_cert(&self, cert: DefaultRootCert) -> CtrResult<()> {
let mut command = ThreadCommandBuilder::new(0x25u16);
unsafe { command.push(self.context_handle.get_raw()) };
command.push(cert);
let mut parser = command.build().send_sync_request(&self.session_handle)?;
... | function_block-full_function | [
{
"content": "#[cfg_attr(not(target_os = \"horizon\"), mocktopus::macros::mockable)]\n\npub fn get_service_handle_direct(_name: &str) -> CtrResult<Handle> {\n\n Ok(0.into())\n\n}\n",
"file_path": "src/srv/mock.rs",
"rank": 0,
"score": 195878.7015791129
},
{
"content": "pub fn get_service_... |
Rust | vendor/aho-corasick/src/packed/pattern.rs | 47565647456/evtx | fbb2a713d335f5208bb6675f4f158babd6f2f389 | use std::cmp;
use std::fmt;
use std::mem;
use std::u16;
use std::usize;
use crate::packed::api::MatchKind;
pub type PatternID = u16;
#[derive(Clone, Debug)]
pub struct Patterns {
kind: MatchKind,
by_id: Vec<Vec<u8>>,
order: Vec<PatternID>,
... | use std::cmp;
use std::fmt;
use std::mem;
use std::u16;
use std::usize;
use crate::packed::api::MatchKind;
pub type PatternID = u16;
#[derive(Clone, Debug)]
pub struct Patterns {
kind: MatchKind,
by_id: Vec<Vec<u8>>,
order: Vec<PatternID>,
... | unreachable!(),
}
}
pub fn len(&self) -> usize {
self.by_id.len()
}
pub fn is_empty(&self) -> bool {
self.len() == 0
}
pub fn heap_bytes(&self) -> usize {
self.order.len() * mem::size_of::<PatternID>()
+ self.by_id.len(... | est => {
let (order, by_id) = (&mut self.order, &mut self.by_id);
order.sort_by(|&id1, &id2| {
by_id[id1 as usize]
.len()
.cmp(&by_id[id2 as usize].len())
.reverse()
});
... | function_block-random_span | [
{
"content": "#[inline]\n\npub fn checksum_ieee(data: &[u8]) -> u32 {\n\n let mut hasher = Hasher::new();\n\n hasher.update(data);\n\n hasher.finalize()\n\n}\n\n\n\n// Rust runs the tests concurrently, so unless we synchronize logging access\n\n// it will crash when attempting to run `cargo test` with ... |
Rust | examples/compute/main.rs | hasenbanck/asche | a205c4364b9e425d3bd6b1b73e12c949a51e1e18 | use erupt::vk;
use asche::{CommandBufferSemaphore, QueueConfiguration, Queues};
fn main() -> Result<(), asche::AscheError> {
let event_loop = winit::event_loop::EventLoop::new();
let window = winit::window::WindowBuilder::new()
.with_title("asche - compute example")
.with_inner_size(winit... | use erupt::vk;
use asche::{CommandBufferSemaphore, QueueConfiguration, Queues};
fn main() -> Result<(), asche::AscheError> {
let event_loop = winit::event_loop::EventLoop::new();
let window = winit::window::WindowBuilder::new()
.with_title("asche - compute example")
.with_inner_size(winit... | t app = Application::new(device, compute_queues.pop().unwrap())?;
app.compute()?;
Ok(())
}
#[derive(Debug, Clone, Copy, Hash, Eq, PartialEq)]
pub enum Lifetime {
Buffer,
}
impl asche::Lifetime for Lifetime {}
struct Application {
device: asche::Device<Lifetime>,
compute_queue: asche::ComputeQueu... | let instance = asche::Instance::new(
&window,
asche::InstanceConfiguration {
app_name: "compute example",
app_version: asche::Version {
major: 1,
minor: 0,
patch: 0,
},
engine_name: "engine example",
... | function_block-random_span | [
{
"content": "fn main() -> Result<()> {\n\n let event_loop = winit::event_loop::EventLoop::new();\n\n let window = winit::window::WindowBuilder::new()\n\n .with_title(\"asche - raytracing example\")\n\n .with_inner_size(winit::dpi::PhysicalSize::new(1920, 1080))\n\n .build(&event_loop... |
Rust | src/cargo/lib.rs | jakerr/cargo | f0762dfc1340c24ad87fa59027d5308c96867393 | #![crate_name="cargo"]
#![crate_type="rlib"]
#![feature(macro_rules, phase)]
#![feature(default_type_params)]
#![deny(bad_style, unused)]
extern crate libc;
extern crate regex;
extern crate serialize;
extern crate term;
extern crate time;
#[phase(plugin)] extern crate regex_macros;
#[phase(plugin, link)] extern crate... | #![crate_name="cargo"]
#![crate_type="rlib"]
#![feature(macro_rules, phase)]
#![feature(default_type_params)]
#![deny(bad_style, unused)]
extern crate libc;
extern crate regex;
extern crate serialize;
extern crate term;
extern crate time;
#[phase(plugin)] extern crate regex_macros;
#[phase(plugin, link)] extern crate... |
pub fn shell(verbose: bool) -> MultiShell<'static> {
let tty = stderr_raw().isatty();
let stderr = box stderr() as Box<Writer>;
let config = ShellConfig { color: true, verbose: verbose, tty: tty };
let err = Shell::create(stderr, config);
let tty = stdout_raw().isatty();
let stdout = box std... | l) {
match result {
Err(e) => handle_error(e, shell),
Ok(encodable) => {
encodable.map(|encodable| {
let encoded = json::encode(&encodable);
println!("{}", encoded);
});
}
}
} | function_block-function_prefixed | [
{
"content": "pub fn upload_login(shell: &mut MultiShell, token: String) -> CargoResult<()> {\n\n let config = try!(Config::new(shell, None, None));\n\n let UploadConfig { host, token: _ } = try!(upload_configuration());\n\n let mut map = HashMap::new();\n\n let p = os::getcwd();\n\n match host {... |
Rust | kernel/net/tcp_socket.rs | castarco/kerla | 52b15dbfcbf537bdad5b982d4d5cae3a9c7ae743 | use crate::{
arch::SpinLock,
fs::{
inode::{FileLike, PollStatus},
opened_file::OpenOptions,
},
net::{socket::SockAddr, RecvFromFlags},
user_buffer::UserBuffer,
user_buffer::{UserBufReader, UserBufWriter, UserBufferMut},
};
use crate::{
arch::SpinLockGuard,
result::{Errno,... | use crate::{
arch::SpinLock,
fs::{
inode::{FileLike, PollStatus},
opened_file::OpenOptions,
},
net::{socket::SockAddr, RecvFromFlags},
user_buffer::UserBuffer,
user_buffer::{UserBufReader, UserBufWriter, UserBufferMut},
};
use crate::{
arch::SpinLockGuard,
result::{Errno,... |
fn getpeername(&self) -> Result<SockAddr> {
let endpoint = SOCKETS
.lock()
.get::<smoltcp::socket::TcpSocket>(self.handle)
.remote_endpoint();
if endpoint.addr.is_unspecified() {
return Err(Errno::ENOTCONN.into());
}
Ok(endpoint.int... | fn getsockname(&self) -> Result<SockAddr> {
let endpoint = SOCKETS
.lock()
.get::<smoltcp::socket::TcpSocket>(self.handle)
.local_endpoint();
if endpoint.addr.is_unspecified() {
return Err(Errno::ENOTCONN.into());
}
Ok(endpoint.into())
... | function_block-full_function | [
{
"content": "pub fn read_secure_random(buf: UserBufferMut<'_>) -> Result<usize> {\n\n // TODO: Implement arch-agnostic CRNG which does not fully depends on RDRAND.\n\n\n\n UserBufWriter::from(buf).write_with(|slice| {\n\n let valid = unsafe { rdrand_slice(slice) };\n\n if valid {\n\n ... |
Rust | dao_factory/lib.rs | RainbowcityFoundation/RainbowDAO-Protocol-Ink-milestone_2 | 82757d337bea22dcb8e08b4759c47ec02d67a140 | #![cfg_attr(not(feature = "std"), no_std)]
#![feature(const_fn_trait_bound)]
extern crate alloc;
use ink_lang as ink;
#[allow(unused_imports)]
#[ink::contract]
mod dao_factory {
use alloc::string::String;
use ink_prelude::vec::Vec;
use ink_prelude::collections::BTreeMap;
use ink_storage::{
... | #![cfg_attr(not(feature = "std"), no_std)]
#![feature(const_fn_trait_bound)]
extern crate alloc;
use ink_lang as ink;
#[allow(unused_imports)]
#[ink::contract]
mod dao_factory {
use alloc::string::String;
use ink_prelude::vec::Vec;
use ink_prelude::collections::BTreeMap;
use ink_storage::{
... | shMap::new(),
instance_map_by_owner: StorageHashMap::new(),
}
}
#[ink(message)]
pub fn init_factory (&mut self, template_code_hash: Hash, version:u128) -> bool
{
let salt = version.to_le_bytes();
le... | erive(Debug)]
pub struct DAOInstance {
id: u64,
owner: AccountId,
size: u64,
name: String,
logo: String,
desc: String,
dao_manager: DAOManager,
dao_manager_addr: AccountId,
}
#[ink(storage)]
pu... | random | [
{
"content": "/// Returns a new dynamic storage allocation.\n\npub fn alloc() -> DynamicAllocation {\n\n init::on_instance(DynamicAllocator::alloc)\n\n}\n\n\n",
"file_path": "ink/crates/storage/src/alloc/mod.rs",
"rank": 0,
"score": 228000.94545688984
},
{
"content": "/// Implemented by t... |
Rust | src/wallet/state/log.rs | SebastienGllmt/cardano-cli | 2470fe2dcb036226ade6f8c80a56d0610a623767 | use storage_units::{append, utils::{serialize, lock::{self, Lock}}};
use std::{path::{PathBuf}, fmt, result, io::{self, Read, Write}, error};
use cardano::{block::{BlockDate, HeaderHash, types::EpochSlotId}};
use super::{ptr::{StatePtr}, utxo::{UTxO}};
use serde;
use serde_yaml;
#[derive(Debug)]
pub enum Error {
... | use storage_units::{append, utils::{serialize, lock::{self, Lock}}};
use std::{path::{PathBuf}, fmt, result, io::{self, Read, Write}, error};
use cardano::{block::{BlockDate, HeaderHash, types::EpochSlotId}};
use super::{ptr::{StatePtr}, utxo::{UTxO}};
use serde;
use serde_yaml;
#[derive(Debug)]
pub enum Error {
... | :utils::read_u32(&mut reader)?;
let b = serialize::utils::read_u64(&mut reader)?;
debug_assert!(b == 0u64);
t
};
match t {
1 => Ok(Log::Checkpoint(ptr)),
2 => {
let utxo = serde_yaml::from_slice(reader).map_err(|e|
... | Error::LogFormatError(format!("log format error: {:?}", e))
})?;
},
Log::SpentFund(_, utxo) => {
serialize::utils::write_u32(&mut writer, 3)?;
serialize::utils::write_u64(&mut writer, 0)?;
serde_yaml::to_writer(&mut writer, utxo).ma... | random | [
{
"content": "pub fn decrypt(password: &Password, data: &[u8]) -> Option<Vec<u8>> {\n\n let mut reader = data;\n\n let mut salt = [0;SALT_SIZE];\n\n let mut nonce = [0;NONCE_SIZE];\n\n let mut key = [0;KEY_SIZE];\n\n let len = data.len() - TAG_SIZE - SALT_SIZE - NONCE_SIZE;\n\n let mut b... |
Rust | src/librustc/middle/typeck/check/writeback.rs | ehsanul/rust | 7156ded5bcf6831a6da22688d08f71985fdc81df |
use middle::pat_util;
use middle::ty;
use middle::typeck::astconv::AstConv;
use middle::typeck::check::FnCtxt;
use middle::typeck::infer::{force_all, resolve_all, resolve_region};
use middle::typeck::infer::resolve_type;
use middle::typeck::infer;
use middle::typeck::{MethodCall, MethodCallee};
use middle::typeck::{v... |
use middle::pat_util;
use middle::ty;
use middle::typeck::astconv::AstConv;
use middle::typeck::check::FnCtxt;
use middle::typeck::infer::{force_all, resolve_all, resolve_region};
use middle::typeck::infer::resolve_type;
use middle::typeck::infer;
use middle::typeck::{MethodCall, MethodCallee};
use middle::typeck::{v... | {
Err(e) => {
tcx.sess.span_err(
sp,
format!("cannot resolve bound for closure: \
{}",
infer:... | resolve_region(fcx.infcx(),
r,
resolve_all | force_all) | call_expression | [
{
"content": "pub fn type_is_region_ptr(fcx: @FnCtxt, sp: Span, typ: ty::t) -> bool {\n\n let typ_s = structurally_resolved_type(fcx, sp, typ);\n\n return ty::type_is_region_ptr(typ_s);\n\n}\n\n\n",
"file_path": "src/librustc/middle/typeck/check/mod.rs",
"rank": 0,
"score": 681692.0685702388
... |
Rust | src/unixuser.rs | giganteous/webdav-server-rs | 3fa3e9f63f9894d4658c9c1923f416f60acf8712 | use std;
use std::ffi::{CStr, OsStr};
use std::io;
use std::os::unix::ffi::OsStrExt;
use std::path::{Path, PathBuf};
use tokio::task::block_in_place;
#[derive(Debug)]
pub struct User {
pub name: String,
pub passwd: String,
pub gecos: String,
pub uid: u32,
pub gid: u32,
pub groups: Vec... | use std;
use std::ffi::{CStr, OsStr};
use std::io;
use std::os::unix::ffi::OsStrExt;
use std::path::{Path, PathBuf};
use tokio::task::block_in_place;
#[derive(Debug)]
pub struct User {
pub name: String,
pub passwd: String,
pub gecos: String,
pub uid: u32,
pub gid: u32,
pub groups: Vec... |
impl User {
pub fn by_name(name: &str, with_groups: bool) -> Result<User, io::Error> {
let mut buf = [0u8; 1024];
let mut pwd: libc::passwd = unsafe { std::mem::zeroed() };
let mut result: *mut libc::passwd = std::ptr::null_mut();
let cname = match std::ffi::CString::new(name) {
... | l);
User {
name: cs_name.to_string_lossy().into_owned(),
passwd: cs_passwd.to_string_lossy().into_owned(),
gecos: cs_gecos.to_string_lossy().into_owned(),
dir: cs_dir.to_path_buf(),
shell: cs_shell.to_path_buf(),
uid: pwd.pw_uid,
gid: pwd.pw... | function_block-function_prefixed | [] |
Rust | tests/get_write_configurations_util/mod.rs | jakehamtexas/constance_rs | b923d35865c5d88eb7791efccf67f2b0e0b8d8e4 | use std::collections::HashMap;
pub mod dotnet_object_like_enum_buffer;
pub mod dotnet_object_like_enum_with_description_buffer;
pub mod dotnet_simple_enum_buffer;
pub mod dotnet_simple_enum_with_description_buffer;
pub mod dotnet_string_enum_buffer;
pub mod dotnet_string_enum_with_description_buffer;
pub mod rust_simpl... | use std::collections::HashMap;
pub mod dotnet_object_like_enum_buffer;
pub mod dotnet_object_like_enum_with_description_buffer;
pub mod dotnet_simple_enum_buffer;
pub mod dotnet_simple_enum_with_description_buffer;
pub mod dotnet_string_enum_buffer;
pub mod dotnet_string_enum_with_description_buffer;
pub mod rust_simpl... |
pub fn get_table_constants_for_object_like_with_description_buffer_test() -> Vec<TableConstant> {
let mut map = HashMap::new();
map.insert(
ValueWithDescription {
value: "test1".to_string(),
description: Some("description1".to_string()),
},
vec![
(
... | Column {
name: "second".to_string(),
data_type: NUMBER_TYPE.to_string(),
},
"1".to_string(),
),
],
);
map.insert(
ValueWithDescription {
value: "test2".to_string(),
description: None,
... | function_block-function_prefix_line | [
{
"content": "fn get_constructor_for_object_like(class_name: &str, columns: &Vec<&Column>) -> String {\n\n let constructor_first_line = format!(\"private {}(\", pascal_case(class_name));\n\n let args = columns\n\n .iter()\n\n .map(|Column { data_type, name }| {\n\n format!(\n\n ... |
Rust | src/sinks/util/tcp.rs | parampavar/vector | 83bd797ff6a05fb3246a2442a701db3a85e323b5 | use std::{
io::ErrorKind,
net::SocketAddr,
pin::Pin,
task::{Context, Poll},
time::Duration,
};
use async_trait::async_trait;
use bytes::{Bytes, BytesMut};
use futures::{stream::BoxStream, task::noop_waker_ref, SinkExt, StreamExt};
use serde::{Deserialize, Serialize};
use snafu::{ResultExt, Snafu};
... | use std::{
io::ErrorKind,
net::SocketAddr,
pin::Pin,
task::{Context, Poll},
time::Duration,
};
use async_trait::async_trait;
use bytes::{Bytes, BytesMut};
use futures::{stream::BoxStream, task::noop_waker_ref, SinkExt, StreamExt};
use serde::{Deserialize, Serialize};
use snafu::{ResultExt, Snafu};
... |
}
maybe_tls
})
}
async fn connect_backoff(&self) -> MaybeTlsStream<TcpStream> {
let mut backoff = Self::fresh_backoff();
loop {
match self.connect().await {
Ok(socket) => {
emit!(TcpSocketConnectionEst... | if let Err(error) = maybe_tls.set_send_buffer_bytes(send_buffer_bytes) {
warn!(message = "Failed configuring send buffer size on TCP socket.", %error);
} | if_condition | [
{
"content": "pub trait TcpSource: Clone + Send + Sync + 'static\n\nwhere\n\n <<Self as TcpSource>::Decoder as tokio_util::codec::Decoder>::Item: std::marker::Send,\n\n{\n\n // Should be default: `std::io::Error`.\n\n // Right now this is unstable: https://github.com/rust-lang/rust/issues/29661\n\n ... |
Rust | delsum-lib/src/fletcher/mod.rs | 8051Enthusiast/delsum | 5605cd8343cb8ba3133eea31610968cd3c6444d4 |
mod rev;
use crate::bitnum::{BitNum, Modnum};
use crate::checksum::{CheckBuilderErr, Digest, LinearCheck};
use crate::endian::{Endian, WordSpec};
use crate::keyval::KeyValIter;
use num_traits::{One, Zero};
pub use rev::reverse_fletcher;
#[cfg(feature = "parallel")]
pub use rev::reverse_fletcher_para;
use std::fmt::Di... |
mod rev;
use crate::bitnum::{BitNum, Modnum};
use crate::checksum::{CheckBuilderErr, Digest, LinearCheck};
use crate::endian::{Endian, WordSpec};
use crate::keyval::KeyValIter;
use num_traits::{One, Zero};
pub use rev::reverse_fletcher;
#[cfg(feature = "parallel")]
pub use rev::reverse_fletcher_para;
use std::fmt::Di... | ;
let fletch_op = match current_key.as_str() {
"width" => usize::from_str(¤t_val).ok().map(|x| fletch.width(x)),
"module" => Sum::from_hex(¤t_val).ok().map(|x| fletch.module(x)),
"init" => Sum::from_hex(¤t_val).ok().map(|x| fletch.init(x)),
... | match x {
Err(key) => return Err(CheckBuilderErr::MalformedString(key)),
Ok(s) => s,
} | if_condition | [
{
"content": "fn glue_sum(mut s1: u64, mut s2: u64, width: usize, swap: bool) -> u128 {\n\n if swap {\n\n std::mem::swap(&mut s1, &mut s2);\n\n }\n\n (s1 as u128) | ((s2 as u128) << (width / 2))\n\n}\n\n\n",
"file_path": "delsum-lib/src/fletcher/rev.rs",
"rank": 0,
"score": 242015.56... |
Rust | src/r3_port_riscv/src/timer/cfg.rs | yvt/r3 | cafe6078fa8a649a6e1c5969c625c2a127a91027 |
use r3::kernel::InterruptNum;
#[macro_export]
macro_rules! use_timer {
(unsafe impl PortTimer for $ty:ty) => {
const _: () = {
use $crate::r3::{
kernel::{cfg::CfgBuilder, PortTimer, UTicks},
utils::Init,
};
use $crate::r3_portkit::tickles... |
use r3::kernel::InterruptNum;
#[macro_export]
macro_rules! use_timer {
(unsafe impl PortTimer for $ty:ty) => {
const _: () = {
use $crate::r3::{
kernel::{cfg::CfgBuilder, PortTimer, UTicks},
utils::Init,
};
use $crate::r3_portkit::tickles... |
const RESET_MTIME: bool = true;
const FREQUENCY: u64;
const FREQUENCY_DENOMINATOR: u64 = 1;
const HEADROOM: u32 = min128(
Self::FREQUENCY as u128 * 60 / Self::FREQUENCY_DENOMINATOR as u128,
0x40000000,
) as u32;
... | UTicks) {
unsafe { timer::imp::pend_tick_after::<Self>(tick_count_delta) }
}
}
impl Timer for $ty {
unsafe fn init() {
unsafe { timer::imp::init::<Self>() }
}
}
... | random | [
{
"content": "#[cfg(not(arm))]\n\nfn interrupt_free<R>(_: impl FnOnce() -> R) -> R {\n\n unreachable!();\n\n}\n\n\n",
"file_path": "src/arm_semihosting/src/export.rs",
"rank": 0,
"score": 194965.27888413682
},
{
"content": "#[cfg(not(target_arch = \"arm\"))]\n\nfn interrupt_free<T>(_: imp... |
Rust | rain_server/src/governor/tasks/instance.rs | baajur/rain | 477948554150760164c6fe48eac27bcf06c7933b | use chrono::{DateTime, Utc};
use futures::Future;
use rain_core::{comm::*, errors::*};
use error_chain::bail;
use governor::graph::{ExecutorRef, TaskRef, TaskState};
use governor::rpc::executor::data_output_from_spec;
use governor::state::State;
use governor::tasks;
pub struct TaskInstance {
task_ref: TaskRef,
... | use chrono::{DateTime, Utc};
use futures::Future;
use rain_core::{comm::*, errors::*};
use error_chain::bail;
use governor::graph::{ExecutorRef, TaskRef, TaskState};
use governor::rpc::executor::data_output_from_spec;
use governor::state::State;
use governor::tasks;
pub struct TaskInstance {
task_ref: TaskRef,
... | terminated", task.spec.id);
task.set_failed("Task terminated by server".into());
}
Err((e, _)) => {
task.set_failed(e.description().to_string());
}
};
O... | or_ref: ExecutorRef) -> Self {
KillOnDrop {
executor_ref: Some(executor_ref),
}
}
pub fn deactive(&mut self) -> ExecutorRef {
::std::mem::replace(&mut self.executor_ref, None).unwrap()
}
}
impl Drop for KillOnDrop {
fn drop(&mut self) {
if let Some(ref sw) =... | random | [] |
Rust | src/lua_tables.rs | perdumonocle/pm_rlua | eb09eba488249f47aaba4709a49108526f939a22 | use std::marker::PhantomData;
use libc;
use td_clua::{self, lua_State};
use LuaGuard;
use LuaPush;
use LuaRead;
pub struct LuaTable {
table: *mut lua_State,
pop: i32,
index: i32,
}
impl LuaRead for LuaTable {
fn lua_read_with_pop(lua: *mut lua_State, index: i32, pop: i32) -> Option<LuaTable> {
... | use std::marker::PhantomData;
use libc;
use td_clua::{self, lua_State};
use LuaGuard;
use LuaPush;
use LuaRead;
pub struct LuaTable {
table: *mut lua_State,
pop: i32,
index: i32,
}
impl LuaRead for LuaTable {
fn lua_read_with_pop(lua: *mut lua_State, index: i32, pop: i32) -> Option<LuaTable> {
... |
}
}
pub struct LuaTableIterator<'t, K, V> {
table: &'t mut LuaTable,
finished: bool,
marker: PhantomData<(K, V)>,
}
impl LuaTable {
pub fn into_inner(self) -> *mut lua_State {
self.table
}
pub fn iter<K, V>(&mut self) -> LuaTableIterator<K, V> {
unsafe { td_clu... | if self.pop != 0 {
unsafe {
td_clua::lua_pop(self.table, self.pop);
};
self.pop = 0;
} | if_condition | [
{
"content": "///\n\npub fn read_userdata<'t, T>(lua: *mut td_clua::lua_State, index: i32) -> Option<&'t mut T>\n\nwhere\n\n T: 'static + Any,\n\n{\n\n unsafe {\n\n let expected_typeid = format!(\"{:?}\", TypeId::of::<T>());\n\n let data_ptr = td_clua::lua_touserdata(lua, index);\n\n ... |
Rust | tokens/src/tests_events.rs | ajuna-network/open-runtime-module-library | 070457de18d26d2daed6abdfa57d8a951a525605 |
#![cfg(test)]
use super::*;
use frame_support::assert_ok;
use mock::{Event, *};
#[test]
fn pallet_multicurrency_deposit_events() {
ExtBuilder::default()
.balances(vec![(ALICE, DOT, 100), (BOB, DOT, 100)])
.build()
.execute_with(|| {
assert_ok!(<Tokens as MultiCurrency<AccountId>>::transfer(DOT, &ALICE, &B... |
#![cfg(test)]
use super::*;
use frame_support::assert_ok;
use mock::{Event, *};
#[test]
fn pallet_multicurrency_deposit_events() {
ExtBuilder::default()
.balances(vec![(ALICE, DOT, 100), (BOB, DOT, 100)])
.build()
.execute_with(|| {
assert_ok!(<Tokens as MultiCurrency<AccountId>>::transfer(DOT, &ALICE, &B... | ]
fn pallet_fungibles_unbalanced_deposit_events() {
ExtBuilder::default()
.balances(vec![(ALICE, DOT, 100)])
.build()
.execute_with(|| {
assert_ok!(<Tokens as MultiReservableCurrency<AccountId>>::reserve(DOT, &ALICE, 50));
assert_ok!(<Tokens as fungibles::Unbalanced<AccountId>>::set_balance(
DOT, &ALIC... | ed_deposit_events() {
ExtBuilder::default()
.balances(vec![(ALICE, DOT, 100), (BOB, DOT, 100)])
.build()
.execute_with(|| {
assert_ok!(<Tokens as MultiCurrencyExtended<AccountId>>::update_balance(
DOT, &ALICE, 500
));
System::assert_last_event(Event::Tokens(crate::Event::Deposited {
currency_id:... | random | [
{
"content": "fn concrete_fungible(amount: u128) -> MultiAsset {\n\n\t(MOCK_CONCRETE_FUNGIBLE_ID, amount).into()\n\n}\n\n\n",
"file_path": "unknown-tokens/src/tests.rs",
"rank": 0,
"score": 182153.9216231135
},
{
"content": "fn abstract_fungible(amount: u128) -> MultiAsset {\n\n\t(mock_abstr... |
Rust | alvr/common/src/audio.rs | zarik5/ALVR | 7ed89fc8525647d058fa812af8be88f23f8a17a0 | use crate::*;
#[cfg(windows)]
use std::ptr;
#[cfg(windows)]
use widestring::*;
#[cfg(windows)]
use winapi::{
shared::{winerror::*, wtypes::VT_LPWSTR},
um::{
combaseapi::*, coml2api::STGM_READ,
functiondiscoverykeys_devpkey::PKEY_Device_FriendlyName, mmdeviceapi::*,
objbase::CoInitialize... | use crate::*;
#[cfg(windows)]
use std::ptr;
#[cfg(windows)]
use widestring::*;
#[cfg(windows)]
use winapi::{
shared::{winerror::*, wtypes::VT_LPWSTR},
um::{
combaseapi::*, coml2api::STGM_READ,
functiondiscoverykeys_devpkey::PKEY_Device_FriendlyName, mmdeviceapi::*,
objbase::CoInitialize... | let hr = mm_device_collection.GetCount(&count);
if FAILED(hr) {
return trace_str!("IMMDeviceCollection::GetCount failed: hr = 0x{:08x}", hr);
}
debug!("Active render endpoints found: {}", count);
debug!("DefaultDevice:{} ID:{}", default_name, default_id);
for i in 0... | function_block-function_prefix_line | [
{
"content": "#[cfg(windows)]\n\npub fn get_windows_device_id(device: &AudioDevice) -> StrResult<String> {\n\n unsafe {\n\n let mm_device = get_windows_device(device)?;\n\n\n\n let mut id_str_ptr = ptr::null_mut();\n\n mm_device.GetId(&mut id_str_ptr);\n\n let id_str = trace_err!(... | |
Rust | tests/tests.rs | zhiburt/bumpalo | 38054c706cda77a07a07c3eda27bbeb6ee93a706 | use bumpalo::Bump;
use std::alloc::Layout;
use std::mem;
use std::usize;
#[test]
fn can_iterate_over_allocated_things() {
let mut bump = Bump::new();
const MAX: u64 = 131_072;
let mut chunk_ends = vec![];
let mut last = None;
for i in 0..MAX {
let this = bump.alloc(i);
assert_eq!... | use bumpalo::Bump;
use std::alloc::Layout;
use std::mem;
use std::usize;
#[test]
fn can_iterate_over_allocated_things() {
let mut bump = Bump::new();
const MAX: u64 = 131_072;
let mut chunk_ends = vec![];
let mut last = None;
for i in 0..MAX {
let this = bump.alloc(i);
assert_eq!... | ().copied()
});
assert!(pushed_values.eq(iter.clone()));
}
}
#[test]
fn with_capacity_test() {
with_capacity_helper(0u8..255);
with_capacity_helper(0u16..10000);
with_capacity_helper(0u32..10000);
with_capacity_helper(0u64..10000);
with_capacity_helper(0u128..10000);
}
#[test]
... | ign(size, align) {
Err(e) => {
eprintln!("Layout::from_size_align errored: {}", e);
return;
}
Ok(l) => l,
};
bump.alloc_layout(layout);
}
#[test]
fn force_new_chunk_fits_well() {
let b = Bump::new();
b.alloc_layout(Layout::from_si... | random | [
{
"content": "fn size_align<T>() -> (usize, usize) {\n\n (mem::size_of::<T>(), mem::align_of::<T>())\n\n}\n\n\n\n/// The `AllocErr` error indicates an allocation failure\n\n/// that may be due to resource exhaustion or to\n\n/// something wrong when combining the given input arguments with this\n\n/// alloca... |
Rust | artichoke-backend/src/convert/fixnum.rs | Talljoe/artichoke | 36ed5eba078a9fbf3cb4d5c8f7407d0a773d2d6e | use std::convert::TryFrom;
use crate::convert::{BoxIntoRubyError, UnboxRubyError};
use crate::core::{Convert, TryConvert};
use crate::exception::Exception;
use crate::sys;
use crate::types::{Int, Ruby, Rust};
use crate::value::Value;
use crate::Artichoke;
impl Convert<u8, Value> for Artichoke {
#[inline]
fn c... | use std::convert::TryFrom;
use crate::convert::{BoxIntoRubyError, UnboxRubyError};
use crate::core::{Convert, TryConvert};
use crate::exception::Exception;
use crate::sys;
use crate::types::{Int, Ruby, Rust};
use crate::value::Value;
use crate::Artichoke;
impl Convert<u8, Value> for Artichoke {
#[inline]
fn c... |
}
| fn fixnum_to_usize() {
let interp = crate::interpreter().unwrap();
let value = Convert::<_, Value>::convert(&interp, 100);
let value = value.try_into::<usize>(&interp).unwrap();
assert_eq!(100, value);
let value = Convert::<_, Value>::convert(&interp, -100);
let value = v... | function_block-full_function | [
{
"content": "#[cfg(feature = \"core-math-extra\")]\n\npub fn frexp(interp: &mut Artichoke, value: Value) -> Result<(Fp, Int), Exception> {\n\n let value = value_to_float(interp, value)?;\n\n let (fraction, exponent) = libm::frexp(value);\n\n Ok((fraction, exponent.into()))\n\n}\n\n\n",
"file_path"... |
Rust | garnet/bin/odu/src/file_target.rs | opensource-assist/fuschia | 66646c55b3d0b36aae90a4b6706b87f1a6261935 |
use {
crate::common_operations::pwrite,
crate::io_packet::{IoPacket, IoPacketType, TimeInterval},
crate::operations::{OperationType, PipelineStages},
crate::target::{Error, Target, TargetOps, TargetType},
log::debug,
log::error,
std::{
fs::{File, OpenOptions},
ops::Range,
... |
use {
crate::common_operations::pwrite,
crate::io_packet::{IoPacket, IoPacketType, TimeInterval},
crate::operations::{OperationType, PipelineStages},
crate::target::{Error, Target, TargetOps, TargetType},
log::debug,
log::error,
std::{
fs::{File, OpenOptions},
ops::Range,
... | tionType::Write | OperationType::Exit => true,
_ => {
error!("verify for unsupported operation");
process::abort();
}
}
}
fn start_instant(&self) -> Instant {
self.start_instant
}
}
#[cfg(test)]
mod tests {
use {
crate::f... | seed: u64,
io_offset_range: Range<u64>,
target: TargetType,
) -> IoPacketType {
Box::new(FileIoPacket::new(operation_type, seq, seed, io_offset_range, target))
}
fn id(&self) -> u64 {
self.target_unique_id
}
fn supported_ops() -> &'static TargetOps
where
... | random | [] |
Rust | src/raytracer/ray.rs | infinityb/rust-raytracer | 4177c241c4630b822a308d982894134f0751d7d2 | use std::f64::INFINITY;
use raytracer::Intersection;
use scene::Scene;
use vec3::Vec3;
#[cfg(test)]
use geometry::prim::Prim;
#[cfg(test)]
use geometry::prims::Sphere;
#[cfg(test)]
use light::light::Light;
#[cfg(test)]
use material::materials::FlatMaterial;
pub struct Ray {
pub origin: Vec3,
pub direction: Ve... | use std::f64::INFINITY;
use raytracer::Intersection;
use scene::Scene;
use vec3::Vec3;
#[cfg(test)]
use geometry::prim::Prim;
#[cfg(test)]
use geometry::prims::Sphere;
#[cfg(test)]
use light::light::Light;
#[cfg(test)]
use material::materials::FlatMaterial;
pub struct Ray {
pub origin: Vec3,
pub direction: Ve... | fn it_gets_the_nearest_hit() {
let lights: Vec<Box<Light+Send+Sync>> = Vec::new();
let mut prims: Vec<Box<Prim+Send+Sync>> = Vec::new();
let mat = FlatMaterial { color: Vec3::one() };
let sphere_top = Sphere {
center: Vec3::zero(),
radius: 1.0,
material: Box::new(mat.clone()),
... | function_block-full_function | [
{
"content": "pub fn get_scene() -> Scene {\n\n let mut lights: Vec<Box<Light+Send+Sync>> = Vec::new();\n\n lights.push(Box::new(SphereLight { position: Vec3 { x: 8.0, y: 8.0, z: 0.0 }, color: Vec3 { x: 1.0, y: 0.8, z: 0.4}, radius: 0.5 }));\n\n lights.push(Box::new(SphereLight { position: Vec3 { x: 8.... | |
Rust | relm4-examples/examples/grid_factory.rs | Hofer-Julian/relm4 | bc8ea3f027a801126f767e93a3b04e20df4ca714 | use gtk::prelude::{BoxExt, ButtonExt, GtkWindowExt};
use relm4::factory::{Factory, FactoryPrototype, FactoryVec, GridPosition};
use relm4::Sender;
use relm4::*;
struct AppWidgets {
main: gtk::ApplicationWindow,
gen_grid: gtk::Grid,
}
#[derive(Debug)]
enum AppMsg {
Add,
Remove,
Clicked(usize),
}
s... | use gtk::prelude::{BoxExt, ButtonExt, GtkWindowExt};
use relm4::factory::{Factory, FactoryPrototype, FactoryVec, GridPosition};
use relm4::Sender;
use relm4::*;
struct AppWidgets {
main: gtk::ApplicationWindow,
gen_grid: gtk::Grid,
}
#[derive(Debug)]
enum AppMsg {
Add,
Remove,
Clicked(usize),
}
s... |
fn view(&mut self, model: &AppModel, sender: Sender<AppMsg>) {
model.data.generate(&self.gen_grid, sender);
}
fn root_widget(&self) -> gtk::ApplicationWindow {
self.main.clone()
}
}
impl AppUpdate for AppModel {
fn update(&mut self, msg: AppMsg, _components: &(), _sender: Sender<... | margin_top(5)
.margin_start(5)
.margin_bottom(5)
.row_spacing(5)
.column_spacing(5)
.column_homogeneous(true)
.build();
let add = gtk::Button::with_label("Add");
let remove = gtk::Button::with_label("Remove");
main_box.app... | function_block-function_prefix_line | [
{
"content": "fn main() {\n\n let model = AppModel {\n\n mode: AppMode::View,\n\n };\n\n let relm = RelmApp::new(model);\n\n relm.run();\n\n}\n",
"file_path": "relm4-examples/examples/components.rs",
"rank": 0,
"score": 212890.8310617418
},
{
"content": "fn main() {\n\n ... |
Rust | src/elem/wrap/ymerge_wrap.rs | dbeck/minions_rs | b731c8c5c0e6f52013cb56f20a76ecccfe94dc7f | use lossyq::spsc::{Sender};
use super::super::super::{Task, Message, ChannelWrapper, ChannelId, SenderName,
ReceiverChannelId, SenderChannelId, ChannelPosition
};
use super::super::connectable::{ConnectableY};
use super::super::identified_input::{IdentifiedInput};
use super::super::counter::{OutputCounter, InputCount... | use lossyq::spsc::{Sender};
use super::super::super::{Task, Message, ChannelWrapper, ChannelId, SenderName,
ReceiverChannelId, SenderChannelId, ChannelPosition
};
use super::super::connectable::{ConnectableY};
use super::super::identified_input::{IdentifiedInput};
use super::super::counter::{OutputCounter, InputCount... |
} else {
match &self.input_b_rx {
&ChannelWrapper::ConnectedReceiver(ref _channel_id, ref receiver, ref _sender_name) => {
receiver.seqno()
},
_ => 0
}
}
}
}
impl<InputValueA: Send, InputErrorA: Send,
InputValueB: Send, InputErrorB: Send,
OutputValue: ... | match &self.input_a_rx {
&ChannelWrapper::ConnectedReceiver(ref _channel_id, ref receiver, ref _sender_name) => {
receiver.seqno()
},
_ => 0
} | if_condition | [
{
"content": "pub fn new<InputValueA: Send, InputErrorA: Send,\n\n InputValueB: Send, InputErrorB: Send,\n\n OutputValue: Send, OutputError: Send>(\n\n name : &str,\n\n output_q_size : usize,\n\n ymerge : Box<YMerge<InputValueA=InputValueA, InputErrorA=Input... |
Rust | src/level1.rs | DGriffin91/Bevy-BakedGI-Demo | b919d7fe6e4b6a472e2a41ff25d94c1c40966ce9 | use bevy::prelude::*;
use crate::custom_material::{
CustomMaterial, MaterialProperties, MaterialSetProp, MaterialTexture,
};
use crate::emissive_material::EmissiveMaterial;
pub fn setup_room(
commands: &mut Commands,
custom_materials: &mut Assets<CustomMaterial>,
emissive_materials: &mut Assets<Emissi... | use bevy::prelude::*;
use crate::custom_material::{
CustomMaterial, MaterialProperties, MaterialSetProp, MaterialTexture,
};
use crate::emissive_material::EmissiveMaterial;
pub fn setup_room(
commands: &mut Commands,
custom_materials: &mut Assets<CustomMaterial>,
emissive_materials: &mut Assets<Emissi... |
let objects_lightmap = MaterialTexture::new(
asset_server,
"textures/scene1/objects_lightmap.jpg",
"objects_lightmap",
);
let building_objects = asset_server.load("models/scene1/building.glb#Mesh0/Primitive0");
let material_properties = MaterialProperties {
lightm... | let reflection_texture = MaterialTexture::new(
asset_server,
"textures/scene1/reflection.jpg",
"reflection_texture",
); | assignment_statement | [
{
"content": "fn player(commands: &mut Commands) {\n\n commands.spawn_bundle(UnrealCameraBundle::new(\n\n UnrealCameraController::default(),\n\n PerspectiveCameraBundle::default(),\n\n Vec3::new(-30.0, 3.0, -3.0),\n\n Vec3::new(0.0, 3.0, -3.0),\n\n ));\n\n}\n\n\n",
"file_pa... |
Rust | diesel/src/pg/expression/array_comparison.rs | robertmaloney/diesel | 332ba12617ff05e5077fc1879caf83fe2e7fd8ff | use std::marker::PhantomData;
use backend::*;
use expression::{AsExpression, Expression, SelectableExpression, NonAggregate};
use pg::{Pg, PgQueryBuilder};
use query_builder::*;
use query_builder::debug::DebugQueryBuilder;
use result::QueryResult;
use types::{Array, HasSqlType};
pub fn any<ST, T>(vals: T) -> Any<T::E... | use std::marker::PhantomData;
use backend::*;
use expression::{AsExpression, Expression, SelectableExpression, NonAggregate};
use pg::{Pg, PgQueryBuilder};
use query_builder::*;
use query_builder::debug::DebugQueryBuilder;
use result::QueryResult;
use types::{Array, HasSqlType};
pub fn any<ST, T>(vals: T) -> Any<T::E... | QS>,
{
}
impl<Expr, ST> NonAggregate for Any<Expr, ST> where
Expr: NonAggregate,
Any<Expr, ST>: Expression,
{
}
#[doc(hidden)]
#[derive(Debug, Copy, Clone)]
pub struct All<Expr, ST> {
expr: Expr,
_marker: PhantomData<ST>,
}
impl<Expr, ST> All<Expr, ST> {
fn new(expr: Expr) -> Self {
All {... | impl_query_id!(Any<Expr, ST>);
impl<Expr, ST, QS> SelectableExpression<QS> for Any<Expr, ST> where
Pg: HasSqlType<ST>,
Any<Expr, ST>: Expression,
Expr: SelectableExpression< | random | [
{
"content": "pub trait ArrayExpressionMethods<ST>: Expression<SqlType=Array<ST>> + Sized {\n\n /// Compares two arrays for common elements, using the `&&` operator in\n\n /// the final SQL\n\n ///\n\n /// # Example\n\n ///\n\n /// ```rust\n\n /// # #[macro_use] extern crate diesel;\n\n ... |
Rust | components/zcash_address/src/kind/unified/f4jumble.rs | MixinNetwork/librustzcash | 9be36f3e54127fc2e6a30a70625eddfb12367d40 | use blake2b_simd::{Params as Blake2bParams, OUTBYTES};
use std::cmp::min;
use std::ops::RangeInclusive;
#[cfg(test)]
mod test_vectors;
const VALID_LENGTH: RangeInclusive<usize> = 48..=16448;
macro_rules! H_PERS {
( $i:expr ) => {
[
85, 65, 95, 70, 52, 74, 117, 109, 98, 108, 101, 95, 72, 95, $... | use blake2b_simd::{Params as Blake2bParams, OUTBYTES};
use std::cmp::min;
use std::ops::RangeInclusive;
#[cfg(test)]
mod test_vectors;
const VALID_LENGTH: RangeInclusive<usize> = 48..=16448;
macro_rules! H_PERS {
( $i:expr ) => {
[
85, 65, 95, 70, 52, 74, 117, 109, 98, 108, 101, 95, 72, 95, $... |
#[cfg(test)]
mod tests {
use proptest::collection::vec;
use proptest::prelude::*;
use super::{f4jumble, f4jumble_inv, test_vectors::test_vectors, VALID_LENGTH};
#[test]
fn h_pers() {
assert_eq!(&H_PERS!(7), b"UA_F4Jumble_H_\x07\x00");
}
#[test]
fn g_pers() {
assert_e... | pub fn f4jumble_inv(c: &[u8]) -> Option<Vec<u8>> {
if VALID_LENGTH.contains(&c.len()) {
let hashes = Hashes::new(c.len());
let (c, d) = c.split_at(hashes.l_l);
let y = xor(c, &hashes.h(1, d));
let x = xor(d, &hashes.g(1, &y));
let mut a = xor(&y, &hashes.h(0, &x));
l... | function_block-full_function | [
{
"content": "/// Compute a parent node in the Sapling commitment tree given its two children.\n\npub fn merkle_hash(depth: usize, lhs: &[u8; 32], rhs: &[u8; 32]) -> [u8; 32] {\n\n let lhs = {\n\n let mut tmp = [false; 256];\n\n for (a, b) in tmp.iter_mut().zip(lhs.as_bits::<Lsb0>()) {\n\n ... |
Rust | src/peer.rs | ckampfe/manix | fd1e5cf309b125dca6a17bf3fe67c8eff0a8d17d | use crate::peer_protocol;
use crate::{signals, Begin, Index, InfoHash, Length, PeerId};
use futures_util::sink::SinkExt;
use futures_util::StreamExt;
use std::convert::TryInto;
use tokio::time::{Interval, MissedTickBehavior};
use tracing::{debug, error, info, instrument};
#[derive(Debug)]
pub(crate) struct PeerOptions... | use crate::peer_protocol;
use crate::{signals, Begin, Index, InfoHash, Length, PeerId};
use futures_util::sink::SinkExt;
use futures_util::StreamExt;
use std::convert::TryInto;
use tokio::time::{Interval, MissedTickBehavior};
use tracing::{debug, error, info, instrument};
#[derive(Debug)]
pub(crate) struct PeerOptions... |
#[instrument(skip(self))]
async fn send_request(
&mut self,
index: Index,
begin: Begin,
length: Length,
) -> Result<(), std::io::Error> {
self.send_message(peer_protocol::Message::Request {
index,
begin,
length,
})
... | ol::Bitfield,
) -> Result<(), std::io::Error> {
self.send_message(peer_protocol::Message::Bitfield { bitfield })
.await
} | function_block-function_prefixed | [
{
"content": "fn info_hash(bencode: &nom_bencode::Bencode) -> InfoHash {\n\n match bencode {\n\n nom_bencode::Bencode::Dictionary(d) => {\n\n let info = d.get(&b\"info\".to_vec()).unwrap();\n\n let encoded = info.encode();\n\n InfoHash(hash(&encoded))\n\n }\n\n ... |
Rust | src/coords.rs | mabruzzo/nmea0183 | fd1a2d8a62cbcb6f3a9aeecabae88f7b81e850eb |
use core::convert::TryFrom;
#[derive(Debug, PartialEq, Clone)]
pub enum Hemisphere {
North,
South,
East,
West,
}
#[derive(Debug, PartialEq, Clone)]
pub struct Latitude {
pub degrees: u8,
pub minutes: u8,
pub seconds: f32,
pub hemisphere: Hemisph... |
use core::convert::TryFrom;
#[derive(Debug, PartialEq, Clone)]
pub enum Hemisphere {
North,
South,
East,
West,
}
#[derive(Debug, PartialEq, Clone)]
pub struct Latitude {
pub degrees: u8,
pub minutes: u8,
pub seconds: f32,
pub hemisphere: Hemisph... |
}
#[derive(Debug, PartialEq, Clone)]
pub struct Course {
pub degrees: f32,
}
impl From<f32> for Course {
fn from(value: f32) -> Self {
Course { degrees: value }
}
}
impl Course {
pub(crate) fn parse(input: Option<&str>) -> Result<Option<Self>, &'static str> {
match input {
... | parse::<f32>()
.map_err(|_| "Wrong speed field format")
.and_then(|knots| Ok(Some(Speed { knots }))),
_ => Ok(None),
}
} | function_block-function_prefix_line | [
{
"content": "fn from_ascii(bytes: &[u8]) -> Result<&str, &'static str> {\n\n if bytes.iter().all(|b| *b < 128) {\n\n Ok(unsafe { core::str::from_utf8_unchecked(bytes) })\n\n } else {\n\n Err(\"Not an ascii!\")\n\n }\n\n}\n\n\n",
"file_path": "src/lib.rs",
"rank": 0,
"score": ... |
Rust | src/channel/bolt/keyset.rs | LNP-WG/lnp-core | f8a24a0a61ae7a1c0a87020fde3caf90320e2c6d |
use std::collections::BTreeMap;
use amplify::DumbDefault;
#[cfg(feature = "serde")]
use amplify::ToYamlString;
use bitcoin::util::bip32::{ChildNumber, ExtendedPrivKey, KeySource};
use p2p::legacy::{AcceptChannel, ChannelType, OpenChannel};
use secp256k1::{PublicKey, Secp256k1};
use wallet::hd::HardenedIndex;
use wal... |
use std::collections::BTreeMap;
use amplify::DumbDefault;
#[cfg(feature = "serde")]
use amplify::ToYamlString;
use bitcoin::util::bip32::{ChildNumber, ExtendedPrivKey, KeySource};
use p2p::legacy::{AcceptChannel, ChannelType, OpenChannel};
use secp256k1::{PublicKey, Secp256k1};
use wallet::hd::HardenedIndex;
use wal... |
}
impl DumbDefault for RemoteKeyset {
fn dumb_default() -> Self {
Self {
funding_pubkey: dumb_pubkey!(),
revocation_basepoint: dumb_pubkey!(),
payment_basepoint: dumb_pubkey!(),
delayed_payment_basepoint: dumb_pubkey!(),
htlc_basepoint: dumb_pubk... | revocation_basepoint: DumbDefault::dumb_default(),
payment_basepoint: DumbDefault::dumb_default(),
delayed_payment_basepoint: DumbDefault::dumb_default(),
htlc_basepoint: DumbDefault::dumb_default(),
first_per_commitment_point: DumbDefault::dumb_default(),
shu... | function_block-function_prefix_line | [
{
"content": "fn lnp_out_channel_funding_key() -> ProprietaryKey {\n\n ProprietaryKey {\n\n prefix: PSBT_LNP_PROPRIETARY_PREFIX.to_vec(),\n\n subtype: PSBT_OUT_LNP_CHANNEL_FUNDING,\n\n key: vec![],\n\n }\n\n}\n\n\n",
"file_path": "src/channel/funding.rs",
"rank": 0,
"score... |
Rust | keymanager-lib/src/policy.rs | keks/oasis-core | 37479c75e5f94ffc03222cba6edd0624c1280d25 |
use std::{
collections::{HashMap, HashSet},
sync::RwLock,
};
use anyhow::Result;
use lazy_static::lazy_static;
use sgx_isa::Keypolicy;
use tiny_keccak::sha3_256;
use oasis_core_keymanager_api_common::*;
use oasis_core_runtime::{
common::{
cbor,
runtime::RuntimeId,
sgx::{
... |
use std::{
collections::{HashMap, HashSet},
sync::RwLock,
};
use anyhow::Result;
use lazy_static::lazy_static;
use sgx_isa::Keypolicy;
use tiny_keccak::sha3_256;
use oasis_core_keymanager_api_common::*;
use oasis_core_runtime::{
common::{
cbor,
runtime::RuntimeId,
sgx::{
... | te_enclave: &EnclaveIdentity, req: &RequestIds) -> bool {
let may_query = match self.may_query.get(&req.runtime_id) {
Some(may_query) => may_query,
None => return false,
};
may_query.contains(remote_enclave)
}
fn may_replicate_master_secret(&self, remote_enclave:... | let untrusted_policy: SignedPolicySGX = cbor::from_slice(&raw)?;
let policy = untrusted_policy.verify()?;
let mut cached_policy = Self::default();
cached_policy.checksum = sha3_256(&raw).to_vec();
cached_policy.serial = policy.serial;
cached_policy.runtime_id = policy.id;
... | random | [
{
"content": "/// Unseal a previously sealed secret to the enclave.\n\n///\n\n/// The `context` field is a domain separation tag.\n\n///\n\n/// # Panics\n\n///\n\n/// All parsing and authentication errors of the ciphertext are fatal and\n\n/// will result in a panic.\n\npub fn unseal(key_policy: Keypolicy, cont... |
Rust | core_nodes/src/abc.rs | alec-deason/virtual_modular | 77857488c4b573522807430855c83bfc3d588647 | use generic_array::{arr, typenum::*};
use std::collections::HashMap;
use virtual_modular_graph::{Node, Ports, BLOCK_SIZE};
#[derive(Clone, Debug)]
pub struct ABCSequence {
line: Vec<abc_parser::datatypes::MusicSymbol>,
key: HashMap<char, abc_parser::datatypes::Accidental>,
idx: usize,
clock: u32,
s... | use generic_array::{arr, typenum::*};
use std::collections::HashMap;
use virtual_modular_graph::{Node, Ports, BLOCK_SIZE};
#[derive(Clone, Debug)]
pub struct ABCSequence {
line: Vec<abc_parser::datatypes::MusicSymbol>,
key: HashMap<char, abc_parser::datatypes::Accidental>,
idx: usize,
clock: u32,
s... |
}
impl Node for ABCSequence {
type Input = U1;
type Output = U4;
#[inline]
fn process(&mut self, input: Ports<Self::Input>) -> Ports<Self::Output> {
let trigger = input[0];
let mut r_freq = [0.0f32; BLOCK_SIZE];
let mut r_gate = [0.0f32; BLOCK_SIZE];
let mut r_eoc = [0... | fn duration(&self, idx: usize) -> u32 {
match self.line[idx] {
abc_parser::datatypes::MusicSymbol::Rest(abc_parser::datatypes::Rest::Note(
_length,
)) => {
unimplemented!()
}
abc_parser::datatypes::MusicSymbol::Note { length, .. } =... | function_block-full_function | [
{
"content": "fn make_euclidian_rhythm(pulses: u32, len: u32, steps: &mut Vec<bool>) {\n\n steps.resize(len as usize, false);\n\n steps.fill(false);\n\n let mut bucket = 0;\n\n for step in steps.iter_mut() {\n\n bucket += pulses;\n\n if bucket >= len {\n\n bucket -= len;\n\n... |
Rust | imgui/src/widget/tab.rs | eiz/imgui-rs | 1ef9393f3253e4318e50219cd3c93fc98beeb578 |
use crate::sys;
use crate::Ui;
use bitflags::bitflags;
use std::ptr;
bitflags! {
#[repr(transparent)]
pub struct TabBarFlags: u32 {
const REORDERABLE = sys::ImGuiTabBarFlags_Reorderable;
const AUTO_SELECT_NEW_TABS = sys::ImGuiTabBarFlags_AutoSelectNewTabs;
const TAB_LIST_POPUP_BUTTON ... |
use crate::sys;
use crate::Ui;
use bitflags::bitflags;
use std::ptr;
bitflags! {
#[repr(transparent)]
pub struct TabBarFlags: u32 {
const REORDERABLE = sys::ImGuiTabBarFlags_Reorderable;
const AUTO_SELECT_NEW_TABS = sys::ImGuiTabBarFlags_AutoSelectNewTabs;
const TAB_LIST_POPUP_BUTTON ... |
if should_render {
Some(TabItemToken::new(self))
} else {
None
}
}
}
| let should_render = unsafe {
sys::igBeginTabItem(
self.scratch_txt(label),
opened.map(|x| x as *mut bool).unwrap_or(ptr::null_mut()),
flags.bits() as i32,
)
}; | assignment_statement | [
{
"content": "fn show_test_window(ui: &Ui, state: &mut State, opened: &mut bool) {\n\n if state.show_app_main_menu_bar {\n\n show_example_app_main_menu_bar(ui, state)\n\n }\n\n if state.show_app_auto_resize {\n\n show_example_app_auto_resize(\n\n ui,\n\n &mut state.a... |
Rust | bolero-generator/src/uniform.rs | zhassan-aws/bolero | 04a73b946da7241c188816524aaaec60d60658a3 | use crate::{bounded::BoundExt, driver::DriverMode};
use core::ops::{Bound, RangeBounds};
pub trait Uniform: Sized {
fn sample<F: FillBytes>(fill: &mut F, min: Bound<&Self>, max: Bound<&Self>) -> Option<Self>;
}
pub trait FillBytes {
fn mode(&self) -> DriverMode;
fn fill_bytes(&mut self, bytes: &mut [u8]) ... | use crate::{bounded::BoundExt, driver::DriverMode};
use core::ops::{Bound, RangeBounds};
pub trait Uniform: Sized {
fn sample<F: FillBytes>(fill: &mut F, min: Bound<&Self>, max: Bound<&Self>) -> Option<Self>;
}
pub trait FillBytes {
fn mode(&self) -> DriverMode;
fn fill_bytes(&mut self, bytes: &mut [u8]) ... |
const START: u32 = 0xD800;
const LEN: u32 = 0xE000 - START;
fn map_to_u32(c: &char) -> u32 {
match *c as u32 {
c if c >= START => c - LEN,
c => c,
}
}
let lower = BoundExt::map(min, map_to_u32);
let upper = match... | if fill.mode() == DriverMode::Direct {
let value = u32::sample(fill, Bound::Unbounded, Bound::Unbounded)?;
return char::from_u32(value);
} | if_condition | [
{
"content": "pub trait BoundedValue<B = Self>: Sized {\n\n fn gen_bounded<D: Driver>(driver: &mut D, min: Bound<&B>, max: Bound<&B>) -> Option<Self>;\n\n\n\n fn mutate_bounded<D: Driver>(\n\n &mut self,\n\n driver: &mut D,\n\n min: Bound<&B>,\n\n max: Bound<&B>,\n\n ) -> Op... |
Rust | alacritty/src/main.rs | vitaly-zdanevich/alacritty | 6b208a6958a32594cf1248f5336f8a8f79d17fe3 |
#![warn(rust_2018_idioms, future_incompatible)]
#![deny(clippy::all, clippy::if_not_else, clippy::enum_glob_use, clippy::wrong_pub_self_convention)]
#![cfg_attr(feature = "cargo-clippy", deny(warnings))]
#![cfg_attr(all(test, feature = "bench"), feature(test))]
#![windows_subsystem = "windows"]
#[cfg(not(any(featur... |
#![warn(rust_2018_idioms, future_incompatible)]
#![deny(clippy::all, clippy::if_not_else, clippy::enum_glob_use, clippy::wrong_pub_self_convention)]
#![cfg_attr(feature = "cargo-clippy", deny(warnings))]
#![cfg_attr(all(test, feature = "bench"), feature(test))]
#![windows_subsystem = "windows"]
#[cfg(not(any(featur... | fn log_config_path(config: &Config) {
let mut msg = String::from("Configuration files loaded from:");
for path in &config.ui_config.config_paths {
msg.push_str(&format!("\n {:?}", path.display()));
}
info!("{}", msg);
} | function_block-full_function | [
{
"content": "#[cfg(not(all(feature = \"winpty\", target_env = \"msvc\")))]\n\npub fn new<C>(config: &Config<C>, size: &SizeInfo, window_id: Option<usize>) -> Pty {\n\n conpty::new(config, size, window_id).expect(\"Failed to create ConPTY backend\")\n\n}\n\n\n",
"file_path": "alacritty_terminal/src/tty/w... | |
Rust | src/engine.rs | 0ncorhynchus/mictyris | 5f8bffe0fb6833048bac9d240050b92f5acd9a0d | mod auxiliary;
pub mod procedure;
mod storage;
use self::auxiliary::*;
use self::procedure::*;
use self::storage::*;
use crate::lexer::Identifier;
use crate::parser::{Datum, Formals, ListDatum, Lit};
use crate::pass::*;
use std::fmt;
use std::rc::Rc;
use Value::*;
#[derive(Clone, Debug, PartialEq)]
pub enum Value {
... | mod auxiliary;
pub mod procedure;
mod storage;
use self::auxiliary::*;
use self::procedure::*;
use self::storage::*;
use crate::lexer::Identifier;
use crate::parser::{Datum, Formals, ListDatum, Lit};
use crate::pass::*;
use std::fmt;
use std::rc::Rc;
use Value::*;
#[derive(Clone, Debug, PartialEq)]
pub enum Value {
... | pub fn write(value: Value) -> CommCont {
fn fmt(store: &Store, value: &Value) -> String {
match value {
Symbol(ident) => format!("{}", ident),
Character(c) => format!("#\\{}", c),
Number(n) => format!("{}", n),
Pair(loc1, loc2, _) => format!(
"... | function_block-full_function | [
{
"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",
... | |
Rust | src/network.rs | Aloxaf/mcfly | 0f50f2deeed7c8ec75d41711369c2fc927006a4e | #![allow(clippy::unreadable_literal)]
use crate::node::Node;
use crate::training_sample_generator::TrainingSampleGenerator;
use crate::history::Features;
use rand::Rng;
#[derive(Debug, Copy, Clone)]
pub struct Network {
pub final_bias: f64,
pub final_weights: [f64; 3],
pub final_sum: f64,
pub final_out... | #![allow(clippy::unreadable_literal)]
use crate::node::Node;
use crate::training_sample_generator::TrainingSampleGenerator;
use crate::history::Features;
use rand::Rng;
#[derive(Debug, Copy, Clone)]
pub struct Network {
pub final_bias: f64,
pub final_weights: [f64; 3],
pub final_sum: f64,
pub final_out... |
pub fn dot(&self, features: &Features) -> f64 {
let mut network_output = self.final_bias;
for (node, output_weight) in self.hidden_nodes.iter().zip(self.final_weights.iter()) {
let node_output = node.output(features);
network_output += node_output * output_weight;
}... | f.final_sum += self.hidden_node_outputs[i] * self.final_weights[i];
}
self.final_output = self.final_sum.tanh();
} | function_block-function_prefixed | [
{
"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_... |
Rust | src/node_state/leader/follower.rs | yuezato/raftlog | 12315643c559118dbe9c20625ff9e3c415bf9bb3 | use futures::{Async, Future};
use std::collections::BTreeMap;
use std::mem;
use trackable::error::ErrorKindExt;
use super::super::Common;
use crate::cluster::ClusterConfig;
use crate::log::{Log, LogIndex};
use crate::message::{AppendEntriesReply, SequenceNumber};
use crate::node::NodeId;
use crate::{ErrorKind, Io, Res... | use futures::{Async, Future};
use std::collections::BTreeMap;
use std::mem;
use trackable::error::ErrorKindExt;
use super::super::Common;
use crate::cluster::ClusterConfig;
use crate::log::{Log, LogIndex};
use crate::message::{AppendEntriesReply, SequenceNumber};
use crate::node::NodeId;
use crate::{ErrorKind, Io, Res... |
if reply.header.seq_no <= follower.obsolete_seq_no {
return Ok(());
}
follower.obsolete_seq_no = self.last_broadcast_seq_no;
if common.log().tail().index <= follower.log_tail {
return Ok(());
}
... | let follower = track!(self
.followers
.get_mut(&reply.header.sender)
.ok_or_else(|| ErrorKind::InconsistentState.error()))?; | assignment_statement | [
{
"content": "struct InstallSnapshot<IO: Io> {\n\n future: IO::SaveLog,\n\n summary: SnapshotSummary,\n\n}\n\nimpl<IO: Io> InstallSnapshot<IO> {\n\n pub fn new(common: &mut Common<IO>, prefix: LogPrefix) -> Self {\n\n let summary = SnapshotSummary {\n\n tail: prefix.tail,\n\n ... |
Rust | state/api/src/chain_state.rs | xielong/starcoin | 14faf39ea7231d6a24780a87f847584824e7ff18 |
use anyhow::{ensure, format_err, Result};
use merkle_tree::{blob::Blob, proof::SparseMerkleProof, RawKey};
use serde::de::DeserializeOwned;
use serde::{Deserialize, Serialize};
use starcoin_crypto::HashValue;
use starcoin_types::state_set::AccountStateSet;
use starcoin_types::write_set::WriteSet;
use starcoin_types::... |
use anyhow::{ensure, format_err, Result};
use merkle_tree::{blob::Blob, proof::SparseMerkleProof, RawKey};
use serde::de::DeserializeOwned;
use serde::{Deserialize, Serialize};
use starcoin_crypto::HashValue;
use starcoin_types::state_set::AccountStateSet;
use starcoin_types::write_set::WriteSet;
use starcoin_types::... |
pub fn get_balance(&self, address: &AccountAddress) -> Result<Option<u128>> {
self.reader.get_balance(*address)
}
pub fn get_balance_by_type(
&self,
address: &AccountAddress,
type_tag: TypeTag,
) -> Result<Option<u128>> {
self.reader.get_balance_by_type(*a... | pub fn get_on_chain_config<C>(&self) -> Result<Option<C>>
where
C: OnChainConfig,
{
self.reader.get_on_chain_config()
} | function_block-full_function | [
{
"content": "pub fn access_path_for_module_upgrade_strategy(address: AccountAddress) -> AccessPath {\n\n AccessPath::resource_access_path(address, ModuleUpgradeStrategy::struct_tag())\n\n}\n\n\n\n#[derive(Debug, Serialize, Deserialize)]\n\npub struct TwoPhaseUpgradeV2Resource {\n\n config: TwoPhaseUpgrad... |
Rust | multi-skill/src/systems/true_skill/normal.rs | kiwec/Elo-MMR | bf64ea75e8c0dbb946d379b9bee1753e604b388a | use super::float::{erfc, Float, MyFloat, PI, TWO, ZERO};
use overload::overload;
use std::ops;
#[derive(Clone, Debug)]
pub struct Gaussian {
pub mu: MyFloat,
pub sigma: MyFloat,
}
pub const G_ZERO: Gaussian = Gaussian {
mu: ZERO,
sigma: ZERO,
};
pub const G_ONE: Gaussian = Gaussian {
mu: ZERO,
... | use super::float::{erfc, Float, MyFloat, PI, TWO, ZERO};
use overload::overload;
use std::ops;
#[derive(Clone, Debug)]
pub struct Gaussian {
pub mu: MyFloat,
pub sigma: MyFloat,
}
pub const G_ZERO: Gaussian = Gaussian {
mu: ZERO,
sigma: ZERO,
};
pub const G_ONE: Gaussian = Gaussian {
mu: ZERO,
... |
impl Gaussian {
pub fn leq_eps(&self, eps: MyFloat) -> Gaussian {
assert!(eps >= ZERO);
assert!(!self.sigma.is_infinite());
let alpha = moment0(self.mu, self.sigma, -eps) - moment0(self.mu, self.sigma, eps);
const FLOAT_CMP_EPS: f64 = 1e-8;
let (mu, sigma) = if alpha < FL... | mu.powi(2) * moment0(ZERO, sigma, t - mu)
+ TWO * mu * moment1(ZERO, sigma, t - mu)
+ (sigma / TWO).powi(2)
* (TWO * gauss_exponent(mu, sigma, t) * (t - mu)
+ sigma * PI.sqrt() * erfc((t - mu) / sigma))
} | function_block-function_prefix_line | [] |
Rust | runtime/src/account_info.rs | luma-team/solana | b02c412d5b5c1902bd5b3616f427ffc0c9925cef |
use crate::{
accounts_db::{AppendVecId, CACHE_VIRTUAL_OFFSET},
accounts_index::{IsCached, ZeroLamport},
append_vec::ALIGN_BOUNDARY_OFFSET,
};
pub type Offset = usize;
pub type StoredSize = u32;
#[derive(Debug)]
pub enum StorageLocation {
AppendVec(AppendVecId, Offset),
Cached,
}
impl StorageLo... |
use crate::{
accounts_db::{AppendVecId, CACHE_VIRTUAL_OFFSET},
accounts_index::{IsCached, ZeroLamport},
append_vec::ALIGN_BOUNDARY_OFFSET,
};
pub type Offset = usize;
pub type StoredSize = u32;
#[derive(Debug)]
pub enum StorageLocation {
AppendVec(AppendVecId, Offset),
Cached,
}
impl StorageLo... |
}
| RTUAL_STORAGE_ID;
let info = AccountInfo::new(StorageLocation::Cached, 0, 0);
assert!(!info.matches_storage_location(id, offset));
} | function_block-function_prefixed | [
{
"content": "pub fn is_sysvar_id(id: &Pubkey) -> bool {\n\n ALL_IDS.iter().any(|key| key == id)\n\n}\n\n\n\n/// Declares an ID that implements [`SysvarId`].\n\n#[macro_export]\n\nmacro_rules! declare_sysvar_id(\n\n ($name:expr, $type:ty) => (\n\n $crate::declare_id!($name);\n\n\n\n impl $cr... |
Rust | egui/src/grid.rs | katyo/egui | 02db9ee5835a522ddf04308f259025388abf0185 | use crate::*;
#[derive(Clone, Debug, Default, PartialEq)]
#[cfg_attr(feature = "persistence", derive(serde::Deserialize, serde::Serialize))]
pub(crate) struct State {
col_widths: Vec<f32>,
row_heights: Vec<f32>,
}
impl State {
fn set_min_col_width(&mut self, col: usize, width: f32) {
self.col_widt... | use crate::*;
#[derive(Clone, Debug, Default, PartialEq)]
#[cfg_attr(feature = "persistence", derive(serde::Deserialize, serde::Serialize))]
pub(crate) struct State {
col_widths: Vec<f32>,
row_heights: Vec<f32>,
}
impl State {
fn set_min_col_width(&mut self, col: usize, width: f32) {
self.col_widt... |
pub(crate) fn save(&self) {
if self.curr_state != self.prev_state {
self.ctx
.memory()
.id_data
.insert(self.id, self.curr_state.clone());
self.ctx.request_repaint();
}
}
}
#[must_use = "You should call .show()"]
pub stru... | Rgba::from_white_alpha(0.0075)
} else {
Rgba::from_black_alpha(0.075)
};
painter.rect_filled(rect, 2.0, color);
}
}
} | function_block-function_prefix_line | [
{
"content": "pub fn show_tooltip_under(ctx: &CtxRef, id: Id, rect: &Rect, add_contents: impl FnOnce(&mut Ui)) {\n\n show_tooltip_at(\n\n ctx,\n\n id,\n\n Some(rect.left_bottom() + vec2(-2.0, 4.0)),\n\n add_contents,\n\n )\n\n}\n\n\n",
"file_path": "egui/src/containers/popu... |
Rust | crates/regex/src/re_set.rs | CryZe/libtww | 0b8de9f451e7d8afda7a14d618bd3a7784b1d679 |
macro_rules! define_set {
($name:ident, $exec_build:expr, $text_ty:ty, $as_bytes:expr) => {
pub mod $name {
use libtww::std::fmt;
use libtww::std::iter;
use libtww::std::slice;
use libtww::std::vec;
use error::Error;
use exec::{Exec,... |
macro_rules! define_set {
($name:ident, $exec_build:expr, $text_ty:ty, $as_bytes:expr) => {
pub mod $name {
use libtww::std::fmt;
use libtww::std::iter;
use libtww::std::slice;
use libtww::std::vec;
use error::Error;
use exec::{Exec,... | dedIterator for SetMatchesIter<'a> {
fn next_back(&mut self) -> Option<usize> {
loop {
match self.0.next_back() {
None => return None,
Some((_, &false)) => {}
Some((i, &true)) => return Some(i),
}
}
}
}
#[doc(hidden)]
impl ... | <usize> {
loop {
match self.0.next() {
None => return None,
Some((_, false)) => {}
Some((i, true)) => return Some(i),
}
}
}
}
impl DoubleEndedIterator for SetMatchesIntoIter {
fn next_back(&mut self) -> Option<usize> {
... | random | [
{
"content": "/// Tests if the given regular expression matches somewhere in the text given.\n\n///\n\n/// If there was a problem compiling the regular expression, an error is\n\n/// returned.\n\n///\n\n/// To find submatches, split or replace text, you'll need to compile an\n\n/// expression first.\n\npub fn i... |
Rust | src/passes/mod.rs | Kixiron/cranial-coitus | 2f0b158709b23f23a4d84045846829b250779f31 | mod add_sub_loop;
mod associative_ops;
mod canonicalize;
mod const_folding;
mod copy_cell;
mod dataflow;
mod dce;
mod eliminate_const_gamma;
mod equality;
mod expr_dedup;
mod fold_arithmetic;
mod fuse_io;
mod licm;
mod mem2reg;
mod move_cell;
mod scan_loops;
mod square_cell;
mod symbolic_eval;
mod unobserved_store;
mod... | mod add_sub_loop;
mod associative_ops;
mod canonicalize;
mod const_folding;
mod copy_cell;
mod dataflow;
mod dce;
mod eliminate_const_gamma;
mod equality;
mod expr_dedup;
mod fold_arithmetic;
mod fuse_io;
mod licm;
mod mem2reg;
mod move_cell;
mod scan_loops;
mod square_cell;
mod symbolic_eval;
mod unobserved_store;
mod... |
fn visit_graph_inner(
&mut self,
graph: &mut Rvsdg,
stack: &mut VecDeque<NodeId>,
visited: &mut HashSet<NodeId>,
buffer: &mut Vec<NodeId>,
) -> bool {
visited.clear();
buffer.clear();
for n... | fn visit_graph(&mut self, graph: &mut Rvsdg) -> bool {
let (mut stack, mut visited, mut buffer) = VISIT_GRAPH_CACHE
.with(|buffers| buffers.borrow_mut().pop())
.unwrap_or_else(|| {
(
VecDeque::with_capacity(graph.node_len() / 2),
... | function_block-full_function | [
{
"content": "pub fn stdout_output() -> impl FnMut(u8) + 'static {\n\n move |byte| {\n\n // FIXME: Lock once, move into closure\n\n let stdout_handle = io::stdout();\n\n let mut stdout = stdout_handle.lock();\n\n\n\n tracing::trace!(\n\n \"wrote output value {byte}, hex... |
Rust | garnet/bin/setui/src/tests/media_buttons_agent_tests.rs | allansrc/fuchsia | a2c235b33fc4305044d496354a08775f30cdcf37 |
use crate::agent::media_buttons;
use crate::agent::Invocation;
use crate::agent::Lifespan;
use crate::agent::{Context, Payload};
use crate::event::{self, Event};
use crate::input::{MediaButtons, VolumeGain};
use crate::message::base::{Audience, MessengerType};
use crate::message::MessageHubUtil;
use crate::service;
u... |
use crate::agent::media_buttons;
use crate::agent::Invocation;
use crate::agent::Lifespan;
use crate::agent::{Context, Payload};
use crate::event::{self, Event};
use crate::input::{MediaButtons, VolumeGain};
use crate::message::base::{Audience, MessengerType};
use crate::message::MessageHubUtil;
use crate::service;
u... |
assert!(
matches!(completion_result, Some(Ok(()))),
"Did not receive a completion event from the invocation message"
);
fake_services
.input_device_registry
.lock()
.await
.send_media_button_event(MediaButtonsEvent {
volume: Some(1),
... | if let Ok((Payload::Complete(result), _)) = reply_receptor.next_of::<Payload>().await {
completion_result = Some(result);
} | if_condition | [] |
Rust | src/reconnectable_ws.rs | hermanodecastro/openlimits | af7b4d59c6a874c662bbc5ace9271bcb1956a8c5 | use crate::errors::OpenLimitsError;
use crate::exchange_ws::{CallbackHandle, ExchangeWs, OpenLimitsWs, Subscriptions};
use crate::model::websocket::{Subscription, WebSocketResponse};
use crate::shared::Result;
use futures::stream::BoxStream;
use std::sync::Arc;
use std::thread::sleep;
use tokio::sync::mpsc::{unbounded_... | use crate::errors::OpenLimitsError;
use crate::exchange_ws::{CallbackHandle, ExchangeWs, OpenLimitsWs, Subscriptions};
use crate::model::websocket::{Subscription, WebSocketResponse};
use crate::shared::Result;
use futures::stream::BoxStream;
use std::sync::Arc;
use std::thread::sleep;
use tokio::sync::mpsc::{unbounded_... |
pub async fn create_stream_specific(
&self,
subscriptions: Subscriptions<E::Subscription>,
) -> Result<BoxStream<'static, Result<E::Response>>> {
self.websocket
.lock()
.await
.create_stream_specific(subscriptions)
.await
}
pub a... | callback(message)
})
});
if futures_util::future::join_all(subscriptions)
.await
.iter()
.all(|subscript... | function_block-function_prefix_line | [
{
"content": "#[async_trait]\n\npub trait ExchangeWs: Send + Sync + Sized {\n\n type InitParams: Clone + Send + Sync + 'static;\n\n type Subscription: From<Subscription> + Send + Sync + Sized + Clone;\n\n type Response: TryInto<WebSocketResponse<Self::Response>, Error = OpenLimitsError>\n\n + Se... |
Rust | src/processes/poisson.rs | rasa200/markovian | 8824ae58301e83f2b8f0278b3d321c2a4000331a |
use num_traits::Float;
use rand_distr::{Exp1, Exp};
use crate::{State, StateIterator};
use core::fmt::Debug;
use num_traits::{sign::Unsigned, One, Zero};
use rand::Rng;
use rand_distr::Distribution;
use crate::errors::InvalidState;
use core::mem;
#[derive(Debug, Clone)]
pub struct Poisson<N, T, R>
where
N: Floa... |
use num_traits::Float;
use rand_distr::{Exp1, Exp};
use crate::{State, StateIterator};
use core::fmt::Debug;
use num_traits::{sign::Unsigned, One, Zero};
use rand::Rng;
use rand_distr::Distribution;
use crate::errors::InvalidState;
use core::mem;
#[derive(Debug, Clone)]
pub struct Poisson<N, T, R>
where
N: Floa... |
}
impl<N, T, R> Iterator for Poisson<N, T, R>
where
N: Float,
Exp1: Distribution<N>,
T: Debug + PartialEq + Clone + One + Zero + PartialOrd + Unsigned,
R: Rng,
{
type Item = (N, T);
#[inl... | fn set_state(
&mut self,
mut new_state: Self::Item,
) -> Result<Option<Self::Item>, InvalidState<Self::Item>> {
mem::swap(&mut self.state, &mut new_state);
Ok(Some(new_state))
} | function_block-full_function | [
{
"content": "pub trait State {\n\n type Item: core::fmt::Debug;\n\n\n\n #[inline]\n\n fn state(&self) -> Option<&Self::Item> {\n\n None\n\n }\n\n\n\n #[inline]\n\n fn state_mut(&mut self) -> Option<&mut Self::Item> {\n\n None\n\n }\n\n\n\n /// Changes the `state` of the st... |
Rust | src/libinput.rs | harshadgavali/gnome-x11-gesture-daemon | 3c5a56a5ca9cf151bcee05bb8bbc8af3309b5f12 | use std::{
fs::{File, OpenOptions},
os::unix::prelude::{AsRawFd, FromRawFd, IntoRawFd, OpenOptionsExt, RawFd},
path::Path,
sync::mpsc,
};
use input::{
event::{
gesture::{GestureHoldEvent, GesturePinchEvent, GestureSwipeEvent},
Event, GestureEvent,
},
ffi::{
libinput_... | use std::{
fs::{File, OpenOptions},
os::unix::prelude::{AsRawFd, FromRawFd, IntoRawFd, OpenOptionsExt, RawFd},
path::Path,
sync::mpsc,
};
use input::{
event::{
gesture::{GestureHoldEvent, GesturePinchEvent, GestureSwipeEvent},
Event, GestureEvent,
},
ffi::{
libinput_... |
fn close_restricted(&mut self, fd: RawFd) {
unsafe {
File::from_raw_fd(fd);
}
}
}
pub fn handle_swipe(swipe: GestureSwipeEvent, transmitter: &mpsc::Sender<CustomGestureEvent>) {
let stage = match &swipe {
GestureSwipeEvent::Begin(_) => "Begin",
GestureSwipeEvent... | fn open_restricted(&mut self, path: &Path, flags: i32) -> Result<RawFd, i32> {
OpenOptions::new()
.custom_flags(flags)
.read((flags & libc::O_RDONLY != 0) | (flags & libc::O_RDWR != 0))
.write((flags & libc::O_WRONLY != 0) | (flags & libc::O_RDWR != 0))
.open(path... | function_block-full_function | [
{
"content": "struct Greeter {}\n\n\n\n#[dbus_interface(name = \"org.gestureImprovements.gestures\")]\n\nimpl Greeter {\n\n #[dbus_interface(signal)]\n\n fn touchpad_swipe(&self, event: &libinput::CustomSwipeEvent) -> zbus::Result<()>;\n\n\n\n #[dbus_interface(signal)]\n\n fn touchpad_hold(&self, ev... |
Rust | src/bvh.rs | q4x3/raytracer | 7ebb6e1f505dae0985a972fab2d9237cbba3cbc9 | use crate::{
aabb::AABB,
hittable::{HitRecord, HitTable},
ray::Ray,
rtweekend::random_int,
vec3::Point3,
};
use std::{cmp::Ordering, sync::Arc};
#[derive(Clone)]
pub struct BVHNode {
left: Arc<dyn HitTable>,
right: Arc<dyn HitTable>,
bvhbox: AABB,
}
impl BVHNode {
pub fn new(
... | use crate::{
aabb::AABB,
hittable::{HitRecord, HitTable},
ray::Ray,
rtweekend::random_int,
vec3::Point3,
};
use std::{cmp::Ordering, sync::Arc};
#[derive(Clone)]
pub struct BVHNode {
left: Arc<dyn HitTable>,
right: Arc<dyn HitTable>,
bvhbox: AABB,
}
impl BVHNode {
pub fn new(
... | tor(&objects[start], &objects[start + 1]) == Ordering::Less {
tmp = BVHNode {
left: objects[start].clone(),
right: objects[start + 1].clone(),
bvhbox: AABB::new(Point3::zero(), Point3::zero()),
};
} else {
... | tmp = BVHNode {
left: objects[start].clone(),
right: objects[start].clone(),
bvhbox: AABB::new(Point3::zero(), Point3::zero()),
};
} else if object_span == 2 {
if compara | random | [] |
Rust | devices/src/virtio/video/decoder/capability.rs | aosp-riscv/platform_external_crosvm | ff681b6a18eff76336a68058c11afdc287255615 |
use base::warn;
use std::collections::btree_map::Entry;
use std::collections::BTreeMap;
use crate::virtio::video::control::*;
use crate::virtio::video::format::*;
fn from_pixel_format(
fmt: &libvda::PixelFormat,
mask: u64,
width_range: FormatRange,
height_range: FormatRange,
) -> FormatDesc {
le... |
use base::warn;
use std::collections::btree_map::Entry;
use std::collections::BTreeMap;
use crate::virtio::video::control::*;
use crate::virtio::video::format::*;
fn from_pixel_format(
fmt: &libvda::PixelFormat,
mask: u64,
width_range: FormatRange,
height_range: FormatRange,
) -> FormatDesc {
le... | nge, height_range))
.collect();
Capability {
in_fmts,
out_fmts,
profiles,
levels,
}
}
pub fn query_control(&self, t: &QueryCtrlType) -> Option<QueryCtrlResponse> {
use QueryCtrlType::*;
match *t {
Profile(f... | }
let levels: BTreeMap<Format, Vec<Level>> = if profiles.contains_key(&Format::H264) {
vec![(Format::H264, vec![Level::H264_1_0])]
.into_iter()
.collect()
} else {
Default::default()
};
... | random | [
{
"content": "/// Returns a Vec of the valid memory addresses.\n\n/// These should be used to configure the GuestMemory structure for the platfrom.\n\npub fn arch_memory_regions(size: u64) -> Vec<(GuestAddress, u64)> {\n\n vec![(GuestAddress(AARCH64_PHYS_MEM_START), size)]\n\n}\n\n\n",
"file_path": "aarc... |
Rust | src/vec/tests.rs | interlockledger/rust-il2-utils | 1c441c609fd71a25fb3a4644b6ed9052180443a6 | /*
* BSD 3-Clause License
*
* Copyright (c) 2019-2020, InterlockLedger Network
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above c... | /*
* BSD 3-Clause License
*
* Copyright (c) 2019-2020, InterlockLedger Network
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above c... |
#[test]
fn test_vecextensions_set_contents_from_slice() {
let sample: [u8; 32] = [0xFA; 32];
let mut v = Vec::<u8>::new();
let old_capacity = v.capacity();
v.set_contents_from_slice(&sample[0..0]);
assert!(v.is_empty());
assert_eq!(v.capacity(), old_capacity);
let mut v = Vec::<u8>::new(... | fn test_vecextensions_set_capacity_to_secure() {
let mut v = Vec::<u8>::new();
v.set_capacity_to_secure(10);
assert_eq!(v.len(), 0);
assert!(v.capacity() >= 10);
v.set_capacity_to_secure(100);
assert_eq!(v.len(), 0);
assert!(v.capacity() >= 100);
let sample: [u8; 4] = [1, 2, 3, 4];
... | function_block-full_function | [
{
"content": "#[test]\n\nfn test_defaultsharedfilelocknamebuilder_namebuilder_create_lock_file_name() {\n\n let b = DefaultSharedFileLockNameBuilder;\n\n\n\n let name = OsStr::new(\"file\");\n\n assert_eq!(b.create_lock_file_name(name), OsStr::new(\".file.lock~\"));\n\n\n\n let name = OsStr::new(\"z... |
Rust | src/lib.rs | arthurhenrique/rusti-cal | 5d481a8afb72827f70712caf8f7d88ddad20847a | mod locale;
const REFORM_YEAR: u32 = 1099;
const MONTHS: usize = 12;
const WEEKDAYS: u32 = 7;
const COLUMN: usize = 3;
const ROWS: usize = 4;
const ROW_SIZE: usize = 7;
static TOKEN: &str = "\n";
fn is_leap_year(year: u32) -> bool {
if year <= REFORM_YEAR {
return year % 4 == 0;
}
(year % 4 == 0... | mod locale;
const REFORM_YEAR: u32 = 1099;
const MONTHS: usize = 12;
const WEEKDAYS: u32 = 7;
const COLUMN: usize = 3;
const ROWS: usize = 4;
const ROW_SIZE: usize = 7;
static TOKEN: &str = "\n";
fn is_leap_year(year: u32) -> bool {
if year <= REFORM_YEAR {
return year % 4 == 0;
}
(year % 4 == 0... |
let day_year = days_by_date(day, month, year, months_memoized.clone(), year_memoized);
result_days.push_str(&remain_day_printable(day, day_year, starting_day))
});
result_days
.split(TOKEN)
.collect::<Vec<&str>>()
.into_iter()
.for_each(|i| result.push(i.to... | if day == 1 {
let first_day = days_by_date(1, month, year, months_memoized.clone(), year_memoized);
result_days.push_str(&first_day_printable(first_day, starting_day))
} | if_condition | [
{
"content": "fn to_titlecase(str: &str) -> String {\n\n str.chars()\n\n .enumerate()\n\n .map(|(pos, c)| {\n\n if pos == 0 {\n\n c.to_uppercase().to_string()\n\n } else {\n\n c.to_string()\n\n }\n\n })\n\n .collect()\... |
Rust | rust/game/src/schemas.rs | sisso/test-unity3d-rust | 883ad1eba80a6fad2b566c170a8597dc2a7600ad | mod packages_generated;
mod requests_generated;
mod responses_generated;
pub use requests_generated::ffi_requests;
pub use responses_generated::ffi_responses;
use crate::{Error, GameEvent, Request, Result};
use flatbuffers::FlatBufferBuilder;
pub type RawMsg = [u8];
pub type RawMsgBuffer = Vec<u8>;
pub type PackageK... | mod packages_generated;
mod requests_generated;
mod responses_generated;
pub use requests_generated::ffi_requests;
pub use responses_generated::ffi_responses;
use crate::{Error, GameEvent, Request, Result};
use flatbuffers::FlatBufferBuilder;
pub type RawMsg = [u8];
pub type RawMsgBuffer = Vec<u8>;
pub type PackageK... | g,
obj_id,
x,
y,
));
}
GameEvent::GameStarted => empty_packages.push(ffi_responses::EmptyPackage::new(
ffi_responses::ResponseKind::GameStarted,
ordering,
)),
GameE... | function_block-function_prefixed | [
{
"content": "pub fn enum_name_package_kind(e: PackageKind) -> &'static str {\n\n let index = e as u16;\n\n ENUM_NAMES_PACKAGE_KIND[index as usize]\n\n}\n\n\n\n} // pub mod FfiPackages\n\n\n",
"file_path": "rust/game/src/schemas/packages_generated.rs",
"rank": 1,
"score": 163941.63861508263
},
... | |
Rust | src/handlers/theme.rs | cmarincia/miette | 714334098a92c77fb6b962e627defab7e16b540d | use atty::Stream;
use owo_colors::Style;
/**
Theme used by [`GraphicalReportHandler`](crate::GraphicalReportHandler) to
render fancy [`Diagnostic`](crate::Diagnostic) reports.
A theme consists of two things: the set of characters to be used for drawing,
and the
[`owo_colors::Style`](https://docs.rs/owo-colors/latest/... | use atty::Stream;
use owo_colors::Style;
/**
Theme used by [`GraphicalReportHandler`](crate::GraphicalReportHandler) to
render fancy [`Diagnostic`](crate::Diagnostic) reports.
A theme consists of two things: the set of characters to be used for drawing,
and the
[`owo_colors::Style`](https://docs.rs/owo-colors/latest/... |
pub fn unicode_nocolor() -> Self {
Self {
characters: ThemeCharacters::unicode(),
styles: ThemeStyles::none(),
}
}
pub fn none() -> Self {
Self {
characters: ThemeCharacters::ascii(),
styles: ThemeS... | pub fn unicode() -> Self {
Self {
characters: ThemeCharacters::unicode(),
styles: ThemeStyles::rgb(),
}
} | function_block-full_function | [] |
Rust | cranelift-codegen/src/topo_order.rs | jgouly/cranelift-1 | 470372f0b55cd51199466669cb87d9e038a3f459 |
use crate::dominator_tree::DominatorTree;
use crate::entity::EntitySet;
use crate::ir::{Block, Layout};
use alloc::vec::Vec;
pub struct TopoOrder {
preferred: Vec<Block>,
next: usize,
visited: EntitySet<Block>,
stack: Vec<Block>,
}
impl TopoOrder {
pub fn new() -> Sel... |
use crate::dominator_tree::DominatorTree;
use crate::entity::EntitySet;
use crate::ir::{Block, Layout};
use alloc::vec::Vec;
pub struct TopoOrder {
preferred: Vec<Block>,
next: usize,
visited: EntitySet<Block>,
stack: Vec<Block>,
}
impl TopoOrder {
pub fn new() -> Sel... | }
}
}
self.stack.pop()
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::cursor::{Cursor, FuncCursor};
use crate::dominator_tree::DominatorTree;
use crate::flowgraph::ControlFlowGraph;
use crate::ir::{Function, InstBuilder};
use core::iter;
... | t(self.next).cloned() {
None => return None,
Some(mut block) => {
self.next += 1;
while self.visited.insert(block) {
self.stack.push(block);
match domtree.ido... | function_block-random_span | [
{
"content": "/// Compute the stack frame layout.\n\n///\n\n/// Determine the total size of this stack frame and assign offsets to all `Spill` and `Explicit`\n\n/// stack slots.\n\n///\n\n/// The total frame size will be a multiple of `alignment` which must be a power of two, unless the\n\n/// function doesn't ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.