I hereby claim:
- I am prydt on github.
- I am prydt (https://keybase.io/prydt) on keybase.
- I have a public key ASCSjjm4oA9Jaa7YqDfAPj7AIed7AoklaAQ1EOY2soBUWQo
To claim this, I am signing this object:
use vstd::prelude::*; | |
// My first real practice with refinement. | |
// Have a spec data structure, an implementation, | |
// and a way of converting from impl to spec. | |
// | |
// the technique is to prove that all the impl functions | |
// take you to the same spec states as the spec functions do. | |
verus!{ |
from enum import Enum, auto | |
class Relations(Enum): | |
PARENT = auto() | |
ANCESTOR = auto() | |
class Vars(Enum): | |
X = auto() |
[Unit] | |
Description=Powertop tunings | |
[Service] | |
Type=oneshot | |
ExecStart=/usr/bin/powertop --auto-tune | |
[Install] | |
WantedBy=multi-user.target |
# | |
# a script to return averages of hoplite output layers in CSVs -- Pranoy | |
# | |
import csv | |
import glob | |
import numpy as np | |
averages_list = [] |
I hereby claim:
To claim this, I am signing this object:
// | |
// this file was originally used for cs50 pset4 | |
// | |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <stdbool.h> | |
#include <stdint.h> | |
#include <string.h> |
package prydt.source | |
/** | |
* A HashTable | |
* Created by PryDt 6/14/2017. | |
*/ | |
// a key-value pair | |
data class HashPair<Key, T>(val key: Key, val item: T) |
package prydt.source // just a package, m8 | |
/** | |
* Created by PryDt on 6/13/2017. | |
*/ | |
// basic node on list | |
data class Node<T>(var key: T?, var next: Node<T>?) | |
// the list class |