Moritz Mœller virtualritz

"Scar Tissues Make Relationships Wear Out"

04/26/2103. From a lecture by Professor John Ousterhout at Stanford, class CS142.

This is my most touchy-feely thought for the weekend. Here’s the basic idea: It’s really hard to build relationships that last for a long time. If you haven’t discovered this, you will discover this sooner or later. And it's hard both for personal relationships and for business relationships. And to me, it's pretty amazing that two people can stay married for 25 years without killing each other.

[Laughter]

> But honestly, most professional relationships don't last anywhere near that long. The best bands always seem to break up after 2 or 3 years. And business partnerships fall apart, and there's all these problems in these relationships that just don't last. So, why is that? Well, in my view, it’s relationships don't fail because there some single catastrophic event to destroy them, although often there is a single catastrophic event around the the end of the relation

1944 Simple Sabotage Field Manual, by Strategic Services

https://www.cia.gov/news-information/featured-story-archive/2012-featured-story-archive/CleanedUOSSSimpleSabotage_sm.pdf

Title: Simple Sabotage Field Manual Author: Strategic Services Office of Strategic Services

If you are getting this in gdb on macOS while trying to run a program:

Unable to find Mach task port for process-id 57573: (os/kern) failure (0x5).
 (please check gdb is codesigned - see taskgated(8))

Open Keychain Access
In menu, open Keychain Access > Certificate Assistant > Create a certificate
Give it a name (e.g. gdbc)

	# To use this, you will want to change the location of the saved data
	# at least and possibly the functions called below (at the end of the file).

	# You first need to install the Python Shapely library for manipulating polygons:

	# http://trac.gispython.org/lab/wiki/Shapely

	from math import pi, sin, cos, atan2
	import shapely.geometry
	import sys, copy

	# ----------------------------------------------------------------------------------
	# r u s t f m t - C O N F I G
	# ==================================================================================
	#
	# Version: 0.7.1
	# Author : Robbepop <[email protected]>
	#
	# A predefined .rustfmt.toml file with all configuration options and their
	# associated description, possible values and default values for use in other
	# projects.

	/// Computes the greatest common divisor of two integers using Euclid's algorithm
	/// (https://en.wikipedia.org/wiki/Euclidean_algorithm).
	///
	/// # Example
	///
	/// ```rust
	/// assert_eq!(gcd(3, 5), 1);
	///
	/// assert_eq!(gcd(2 * 3 * 5 * 11 * 17, 3 * 7 * 11 * 13 * 19), 3 * 11);
	/// ```

	// Author: Victor I. Afolabi
	//
	// Exploring Iterator Traits in Rust to implement Flatten functionality of 2D-iterators.
	//

	pub trait IteratorExt: Iterator {
	fn flatten_ext(self) -> Flatten<Self>
	where
	Self: Sized + std::fmt::Debug,
	Self::Item: IntoIterator,

	// Author: Victor I. Afolabi
	// Implementing the Fibonacci series using Rust's Iterator

	#[derive(Debug, PartialEq, PartialOrd)]
	pub struct Fib {
	current: usize,
	next: usize,
	}

	impl Fib {

	//
	// Author: Jonathan Blow
	// Version: 1
	// Date: 31 August, 2018
	//
	// This code is released under the MIT license, which you can find at
	//
	// https://opensource.org/licenses/MIT
	//
	//