danielSanchezQ

use const_str;

pub trait Foo {
    const ID: &'static str;
}

struct A;
struct B;

impl Foo for A {

danielSanchezQ

use std::fs;
use std::io;
use std::io::BufReader;
use std::path::{Path, PathBuf};

use bincode::Options;

type PersistentFragmentLog = String;

struct FileFragments {

danielSanchezQ

#ifndef _MEM_LICKER_
#define	_MEM_LICKER_

#include <unordered_map>
#include <iostream>
#include <string>

using namespace std;
using ptr		= void*;
struct PtrData

danielSanchezQ

Keybase proof

I hereby claim:

• I am danielsanchezq on github.
• I am netwave (https://keybase.io/netwave) on keybase.
• I have a public key ASBVfZvvkvmyQlUIyK7jDaQsE8e9lIqAhHqjASkaZoIF2Qo

To claim this, I am signing this object:

danielSanchezQ

#ifndef _MEM_LICKER_
#define	_MEM_LICKER_

#include <unordered_map>
#include <iostream>
#include <string>

using namespace std;
using ptr		= void*;
struct PtrData

danielSanchezQ

trait Functor <A, B, C, F> where F : Fn(&A) -> B {
    fn fmap(&self, f: F) ->  C;
}

enum List<T> {
    Nil,
    List(T,  Box<List<T>>)
}

impl<A, B, F> Functor<A, B, List<B>, F> for List<A> 

danielSanchezQ

#! /user/bin/python3
from collections import defaultdict
from itertools import groupby
import operator

class Operation(object):
    TAPE    = []
    RECORD  = defaultdict(lambda: 0)
    RESULTS = {}
    OPERATIONS = {

danielSanchezQ

import maya.cmds as cmds
import itertools as it

def transpose(m, size=4):
   return list(it.chain.from_iterable(map(
       lambda x: m[x:len(m):size],
       xrange(size)
   )))
 
class TransformationsPlayground(object):

danielSanchezQ

from itertools import *

vietNums = {
    0   : u"",
    1   : u"một",
    2   : u"hai",
    3   : u"ba",
    4   : u"bốn",
    5   : u"năm",
    6   : u"sáu",

danielSanchezQ

// bInarytree.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
#include <algorithm>

class BinaryTree
{
private: