This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#![allow(dead_code, unused_variables)] | |
struct PrimeList { | |
primes: Vec<i64>, | |
} | |
/// Basically the same as | |
/// self.primes.iter().cloned().chain(self) on a PrimeList | |
struct PrimeIter<'a> { | |
primes: &'a mut PrimeList, |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//#![allow(dead_code)] | |
use std::iter::FromIterator; | |
// Example of linked lists -- Comes from stackoverflow | |
enum List { Nil, Cons{value: i32, next: Box<List>}} | |
fn main() { | |
let v = vec![1, 5, 3, 8, 12, 56, 1230, 2, 1]; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
--let attempt2bitmap (x,y,n) = ((9*x+n)*9^4, (9*y+n)*9^2, 9*x+y) | |
--let allAttempts = [bit row .|. bit col .|. bit pos | x <- [0..8], y <- [0..8], n <- [0..8], let (row, col, pos) = attempt2bitmap (x,y,n)] :: [Integer] | |
--let attempt2bitmap x y n = bit (9*x + n) .|. bit (9*y + n + 9^2) .|. bit (9*boxOf x y + n + n^4) .|. bit (9*x + y + 9^6) :: Integer | |
let attempt2bitnr x y n = [9*x + n, 9*y + n, 9*boxOf x y + n, 9*x + y] :: [Int] | |
let attempt2bitmap x y n = sum [ bit $ a + 9^2*i | (i,a) <- zip [0..] $ attempt2bitnr x y n] :: Integer | |
let matrix2bitmaps rows = [ attempt2bitmap x y (n-1) | (x, row) <- zip [0..] rows, (y, n) <- zip [0..] row, n /= 0] | |
let mapMatIdx f rows = [ f x y (n-1) | (x, row) <- zip [0..] rows, (y, n) <- zip [0..] row, n /= 0] | |
let matrix2tuples = mapMatIdx (,,) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// #![allow(dead_code)] | |
// #![allow(unused_variables)] | |
// #![allow(unused_mut)] | |
#![feature(question_mark)] | |
use std::sync::Mutex; | |
use std::sync::Arc; | |
use std::collections::VecDeque; | |
use std::thread; | |
use std::ops::Deref; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#![allow(dead_code)] | |
#![allow(unused_variables)] | |
#![allow(unused_mut)] | |
struct Asdf(i32, Option<Gc<Asdf>>); | |
struct Gc<T>(*const T); | |
impl<T> Drop for Gc<T> { | |
fn drop(&mut self) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#![allow(dead_code)] | |
#![allow(unused_variables)] | |
#![allow(unused_mut)] | |
struct Asdf(i32, Option<Gc<Asdf>>); | |
struct Gc<T>(*const T); | |
impl<T> Drop for Gc<T> { | |
fn drop(&mut self) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// ==UserScript== | |
// @name BlockBlockAdBlock | |
// @namespace http://github.com/anka-213 | |
// @version 0.1.1 | |
// @description Block the BlockAdBlock script | |
// @author Andreas Källberg | |
// @match http://blockadblock.com/* | |
// @grant none | |
// @run-at document-start | |
// ==/UserScript== |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
macro_rules! defer { | |
($x:expr) => { | |
let _x = { | |
struct Deferred<F: Fn()>(F); | |
impl<F: Fn()> Drop for Deferred<F> { | |
fn drop(&mut self) { | |
self.0(); | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//#![feature(question_mark)] | |
use std::ops::Deref; | |
use std::ops::DerefMut; | |
#[derive(Debug, Default)] | |
struct ReuseBuf { | |
inner: Vec<u32>, | |
used: bool | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#![feature(unboxed_closures)] | |
#![feature(fn_traits)] | |
#[derive(Clone)] | |
struct Pr { | |
pat: i32 //, mat: Matcher<'a,'a> | |
} | |
type MState = i32; |