nlinker

#!/bin/bash
#
# pyTorch install script for NVIDIA Jetson TX1/TX2,
# from a fresh flashing of JetPack 2.3.1 / JetPack 3.0 / JetPack 3.1
#
# for the full source, see jetson-reinforcement repo:
#   https://github.com/dusty-nv/jetson-reinforcement/blob/master/CMakePreBuild.sh
#
# note:  pyTorch documentation calls for use of Anaconda,
#        however Anaconda isn't available for aarch64.

nlinker

// https://users.rust-lang.org/t/predictable-random-numbers/17593

extern crate rand;

use std::collections::HashMap;
use rand::Rng;
use rand::IsaacRng;

#[derive(Debug, Clone)]
struct Value(Vec<u8>);

nlinker

import subprocess
from lib.common.dominoUtil import running_on_local
from lib.config import PROJECT_PATH
import time
import psutil
import os
import numpy as np

def _recommended_threads():
    return psutil.cpu_count()-2

nlinker

use std::marker::PhantomData;
use std::cell::Cell;

pub struct Game<'g> {
    // Putting the lifetime 'g into a PhantomData<Cell<&'g ()>> instead of a
    // PhantomData<&'g ()> makes 'g invariant instead of covariant.
    // I don't know if that's necessary here, but better be safe than sorry.
    // See https://doc.rust-lang.org/nomicon/subtyping.html for more info.
    phantom: PhantomData<Cell<&'g ()>>,
}

nlinker

#![feature(optin_builtin_traits)]

mod userspace {
    use unit::Unit;
    use session::{Ai, DataTrait, Session};
    
    #[derive(Debug)]
    struct MyAi<'a> {
        units: Vec<&'a mut Unit>
    }

nlinker

Edit: This list is now maintained in the rust-anthology repo.

• Introduction
  • Understanding Over Guesswork
  • An Alternative Introduction to Rust
  • Rust and CSV Parsing
• Ownership
  • Where Rust Really Shines
  • Rust Means Never Having to Close a Socket
• The Problem with Single-threaded Shared Mutability

nlinker

#![feature(optin_builtin_traits)]

mod userspace {
    use unit::Unit;
    use session::{Ai, DataTrait, Session};
    
    #[derive(Debug)]
    struct MyAi();
    
    #[derive(Debug)]

nlinker

{-# OPTIONS -Wall -Werror #-}

{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE TemplateHaskell #-}

import Control.Applicative ((<|>))
import Control.Monad       (void)
import Test.QuickCheck
import Text.Show.Functions ()

nlinker

# Update to 4.9 kernel do not delete the old kernel as it will be your failsafe if something happens to this one

# Install KabyLake graphics patches
cd /tmp;
wget https://01.org/sites/default/files/downloads/intelr-graphics-linux/kbldmcver101.tar.bz2;
tar xjvf kbldmcver101.tar.bz2; cd kbl_dmc_ver1_01/; sudo ./install.sh

cd /tmp;
wget https://01.org/sites/default/files/downloads/intelr-graphics-linux/kblgucver914.tar.gz;
tar xvzf kblgucver914.tar.gz; cd firmware/kbl/guc/kbl_guc_ver/; sudo ./install.sh

nlinker

Interpreting Free Monads of Functor Sums
========================================

This text deals with a way to compose certain kinds of monads, thereby mixing
their capabilities. It is a literate Haskell file, so let's begin with a
bunch of noise.

> {-# LANGUAGE MultiParamTypeClasses #-}
> {-# LANGUAGE FlexibleInstances #-}
> {-# LANGUAGE FlexibleContexts #-}