spamegg spamegg1

Understanding Comparative Benchmarks

I'm going to do something that I don't normally do, which is to say I'm going to talk about comparative benchmarks. In general, I try to confine performance discussion to absolute metrics as much as possible, or comparisons to other well-defined neutral reference points. This is precisely why Cats Effect's readme mentions a comparison to a fixed thread pool, rather doing comparisons with other asynchronous runtimes like Akka or ZIO. Comparisons in general devolve very quickly into emotional marketing.

But, just once, today we're going to talk about the emotional marketing. In particular, we're going to look at Cats Effect 3 and ZIO 2. Now, for context, as of this writing ZIO 2 has released their first milestone; they have not released a final 2.0 version. This implies straight off the bat that we're comparing apples to oranges a bit, since Cats Effect 3 has been out and in production for months. However, there has been a post going around which cites various compar

Instructions for installing zsh plugins, for a variety of plugin managers

Antibody:

⚠️ Deprecated. Official recommendation is to use Antidote instead

Add <owner>/<repo> to your plugins file. If you use static loading, run the update command.
Antidote: Add <owner>/<repo> to your plugins file. If you generate your static plugins file manually, run the bundle command.

Advent of Code 2018

my answers in Python (see also Haskell branch and Kotlin branch)

Scala with Style (by Martin Odersky)

This is a summary of the guidelines presented by Martin Odersky during his talk Scala with Style.

Swift Concurrency Manifesto

Author: Chris Lattner

Chinese Translation by Jason Yu

	bin/

	# Scala/SBT specific
	project/
	target/
	build/

	# Scala-Cli build folder
	.scala-build/

	import shapeless._, shapeless.ops.hlist._, shapeless.labelled.FieldType

	trait Op[A] extends DepFn1[A]

	trait LowPriority {
	implicit def identity[A]: Op.Aux[A, A] = Op.createInstance(i => i)
	}

	object Op extends LowPriority {
	type Aux[A, OUT0] = Op[A] { type Out = OUT0 }

	/*
	* Solution of Josephus Problem using Bitwise Operation
	* Shifting the most-significant set bit of n to the
	* least significant bit will return the safe position.
	*
	* ====================== EXPLANATION ======================
	*
	* n (41) the number of people standing in the circle
	* n = 101001
	*

	#![allow(unused_imports)]
	extern crate regex;
	#[macro_use]
	extern crate lazy_static;
	extern crate itertools;
	extern crate pbr;
	extern crate colored;
	use std::collections::VecDeque;
	use itertools::Itertools;
	use pbr::ProgressBar;

	package fpmax

	import scala.util.Try
	import scala.io.StdIn.readLine

	object App0 {
	def main: Unit = {
	println("What is your name?")

	val name = readLine()