use std::mem::size_of; | |
type TigerInt = i32; | |
type Label = usize; | |
type Temp = usize; | |
#[derive(Debug)] | |
pub enum IrExp { | |
Const(TigerInt), | |
Name(Label), |
The ubuntu snap version doesn't have the latest lensfun data files. For reasons, it seems to have hard coded the lensfun data files, and also for reasons, the snap seems to be mounted as read-only file system, so you can't just copy the lensfun files there.
lensfun needs to be updated using lensfun-update-data
. If you type it in cli it would suggest what pkg to install to get it on ubuntu.
trying to compile darktable myself. checking out the source turns out to take forever.
deb
sed -e '/^#\sdeb-src /s/^# *//;t;d' "/etc/apt/sources.list" \
| sudo tee /etc/apt/sources.list.d/darktable-sources-tmp.list > /dev/null \
type Frame* = concept x, type T | |
T.newFrame is T | |
type Arch = enum | |
x86 | |
mips | |
proc translateExp[T : Frame]() = | |
discard T.newFrame() |
This is to tweak the gnome UI that come out of box on 22.4.
It's a whole bunch of tweaks, without which the touchpad and keyboard are useless.
This is intended to emulate the feel of a mac laptop, with most of the keyboard bindings and trackpad behavior!
Sadly if gnome just stops working for...no reason after an update, for instance mouse works before login but completely stops moving/responding, even though all the drivers exist and all mice are detected, then it's probably something messed up in your gnome setting.
(dominic: this list of papers was originally recommended to me by Brain Noguchi @bnoguchi, and was a great start to understanding distributed systems)
Here's a selection of papers that I think you would find helpful and interesting:
The seminal paper about event ordering and concurrency. The important result is that events in a distributed system define a partially ordered set. The connection to what we're working on is fundamental, as this defines how to detect concurrent updates. Moreover, the chosen algorithm to turn the partially ordered set into a totally ordered set defines the conflict resolution algorithm.
http://research.microsoft.com/en-us/um/people/lamport/pubs/time-clocks.pdf
Context: I was asked for a list of interesting reading relating to "distributed databases, behavior under partitions and failures, failure detection." Here's what I came up with in about an hour.
For textbooks, "Introduction to Reliable and Secure Distributed Programming" is a superb introduction to distributed computing from a formal perspective; it's really not about "programming" or "engineering" but about distributed system fundamentals like consensus, distributed registers, and broadcast. Used in Berkeley's Distributed Computing course (and HT to @lalithsuresh) Book Site
Notes from courses like Lorenzo Alvisi's Distributed Computing class can be great.
There are a bunch of classics on causality, [Paxos](ht