邓云升 dengyunsheng250

C9 Lectures

2010: Introductory STL (10 parts)
- microsoft/nurikabe: I open-sourced and slightly modernized my Nurikabe puzzle solver.
2011: Advanced STL (6 parts)
2012-2013: Core C++ (10 parts)

BoostCon (now known as C++Now)

2009: I am not aware of recordings for my talks "C++0x Support in Visual Studio 2010" and "The Parallel Patterns Library in Visual Studio 2010". You aren't missing anything, though.
2010: "Data Structure Visualizers in Visual Studio 2010" is irrelevant as the old visualizer machinery has been completely replaced by something much better (and documented).
2012: Regex In C++11 And Boost

At the beginning of 2030, I found this essay in my archives. From what I know today, I think it was very insightful at the moment of writing. And I feel it should be published because it can teach us, Rust developers, how to prevent that sad story from happening again.

What killed Haskell, could kill Rust, too

What killed Haskell, could kill Rust, too. Why would I even mention Haskell in this context? Well, Haskell and Rust are deeply related. Not because Rust is Haskell without HKTs. (Some of you know what that means, and the rest of you will wonder for a very long time). Much of the style of Rust is similar in many ways to the style of Haskell. In some sense Rust is a reincarnation of Haskell, with a little bit of C-ish like syntax, a very small amount.

Is Haskell dead?

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs

	# -----------------------------------------------------------------------------
	# AI-powered Git Commit Function
	# Copy paste this gist into your ~/.bashrc or ~/.zshrc to gain the `gcm` command. It:
	# 1) gets the current staged changed diff
	# 2) sends them to an LLM to write the git commit message
	# 3) allows you to easily accept, edit, regenerate, cancel
	# But - just read and edit the code however you like
	# the `llm` CLI util is awesome, can get it here: https://llm.datasette.io/en/stable/

	gcm() {

	package main

	import (
	"bufio"
	"errors"
	"fmt"
	"io"
	"log/slog"
	"net"
	"os"

	package cache

	import (
	"sync"
	"time"
	)

	// Cache is a basic in-memory key-value cache implementation.
	type Cache[K comparable, V any] struct {
	items map[K]V // The map storing key-value pairs.

	package main

	import (
	"encoding/xml"
	"flag"
	"fmt"
	"go-apps/pkg/flagx"
	"go-apps/pkg/util"
	"io"
	"log"

	import math
	import uuid


	class BTree:
	def __init__(self, order=3):
	self.root = BTreeNode(order)

	def insert(self, toinsert):
	all_elements = self.list()

	#![feature(ip_addr, raw)]

	extern crate pnet;

	use std::net::{IpAddr, Ipv4Addr};
	use pnet::transport::TransportChannelType::Layer4;
	use pnet::transport::TransportProtocol::Ipv4;
	use pnet::transport::transport_channel;
	use pnet::packet::ip::IpNextHeaderProtocols;
	use pnet::packet::Packet;