duarten

import java.util.ArrayList;
import java.util.UUID;
import java.util.concurrent.TimeUnit;

import org.openjdk.jmh.annotations.Benchmark;
import org.openjdk.jmh.annotations.BenchmarkMode;
import org.openjdk.jmh.annotations.Fork;
import org.openjdk.jmh.annotations.Level;
import org.openjdk.jmh.annotations.Measurement;
import org.openjdk.jmh.annotations.Mode;

duarten

import java.util.HashMap;
import java.util.UUID;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.TimeUnit;

import scala.collection.concurrent.TrieMap;

import org.openjdk.jmh.annotations.*;

@BenchmarkMode(Mode.AverageTime)

duarten

Rich Hickey on becoming a better developer

Rich Hickey • 3 years ago

Sorry, I have to disagree with the entire premise here.

A wide variety of experiences might lead to well-roundedness, but not to greatness, nor even goodness. By constantly switching from one thing to another you are always reaching above your comfort zone, yes, but doing so by resetting your skill and knowledge level to zero.

Mastery comes from a combination of at least several of the following:

duarten

#include <jvmti.h>
#include <cstdlib>
#include <cstring>

using namespace std;

typedef struct {
  jvmtiEnv *jvmti;
} GlobalAgentData;

duarten

package org.openjdk;

import org.openjdk.jmh.annotations.Benchmark;
import org.openjdk.jmh.annotations.BenchmarkMode;
import org.openjdk.jmh.annotations.CompilerControl;
import org.openjdk.jmh.annotations.Fork;
import org.openjdk.jmh.annotations.Measurement;
import org.openjdk.jmh.annotations.Mode;
import org.openjdk.jmh.annotations.OutputTimeUnit;
import org.openjdk.jmh.annotations.Param;

duarten

Latency Comparison Numbers
--------------------------
L1 cache reference                            0.5 ns
Branch mispredict                             5   ns
L2 cache reference                            7   ns             14x L1 cache
Mutex lock/unlock                            25   ns
Main memory reference                       100   ns             20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy              3,000   ns
Send 1K bytes over 1 Gbps network        10,000   ns    0.01 ms
Read 4K randomly from SSD*              150,000   ns    0.15 ms

duarten

	.equ START_OFFSET, 0x7c00		
	.equ STACK_TOP, START_OFFSET - 22

	.equ VAR_BASE, START_OFFSET - 22
	.equ DISK_ADDRESS_PACKET_OFFSET, 0
	.equ PACKET_SIZE_OFFSET, 0
	.equ SECTORS_TO_TRANSFER_OFFSET, 2		
	.equ TRANSFER_BUFFER_ADDR_OFFSET, 4		
	.equ TRANSFER_BUFFER_SEG_OFFSET, 6		
	.equ STARTING_SECTOR_OFFSET, 8			

duarten

#include <iostream>
#include <functional>

template<typename T>
class lazy_value {
    union {
        std::function<T()> _f;
        mutable T _value;
    };
    mutable T& (*_thunk)(const lazy_value&);

duarten

#include <x86intrin.h>
#include <iostream>
#include <limits>
#include <array>

constexpr int segment_size_shift = 18; // 256K
constexpr size_t segment_size = 1 << segment_size_shift;
using size_type = uint32_t;

constexpr size_type initial_buckets_shift = 4;

duarten

#include <iostream>
#include <vector>

template<typename T>
struct my_traits {
    void m();
};

template<>
struct my_traits<int> {