suyash

#include <arpa/inet.h>
#include <stdio.h>
#include <string.h>
#include <sys/socket.h>
#include <unistd.h>

int main() {
	const char* server_name = "localhost";
	const int server_port = 8877;

suyash

#include <arpa/inet.h>
#include <stdio.h>
#include <string.h>
#include <sys/socket.h>
#include <unistd.h>

int main() {
	const char* server_name = "localhost";
	const int server_port = 8877;

suyash

[package]
name = "min-char-rnn-rs"
version = "0.1.0"
authors = ["Suyash <suyash93@protonmail.com>"]
edition = "2018"

[dependencies]
rulinalg = "0.4.2"
rand = "0.6.4"
indicatif = "0.11.0"

suyash

identical mmap programs in C and go

suyash

//! Knuth-Morris-Pratt implementation
//!
//! See Chapter 17 in Blandy + Orendorff

/// computes the KMP longest prefix-suffix function
pub fn kmp<T: AsRef<[u8]>>(pattern: T) -> Vec<usize> {
    let pattern = pattern.as_ref();
    let n = pattern.len();
    let mut ans = vec![0; n + 1];

suyash

//! Generic Segment Tree implemented for custom comparator and min functions.
//!
//! See Chapters 15, 16 in Blandy and Orendorff

/// Segment Tree allows for querying information over ranges in a continuous data stream.
pub struct SegmentTree<T, Comparator, Minimum> {
    tree: Vec<T>,
    n: usize,
    f: Comparator,
    d: Minimum,

suyash

import { Store } from 'express-session';
import JFS from 'jfs';

export default class JFSStore extends Store {
    constructor(location) {
        super();

        this.db = new JFS(location || 'data');
    }

suyash

suyash

suyash