XVilka

THIS GIST WAS MOVED TO TERMSTANDARD/COLORS REPOSITORY.

PLEASE ASK YOUR QUESTIONS OR ADD ANY SUGGESTIONS AS A REPOSITORY ISSUES OR PULL REQUESTS INSTEAD!

ayende

using System;
using System.Collections.Generic;
using System.Linq;

namespace Voron.Util
{
	/// <summary>
	/// A list that can be used by readers as a true immutable read-only list 
	/// and that supports relatively efficient "append to the end" and "remove 
	/// from the front" operations, by sharing the underlying array whenever 

Daniel15

public abstract class ConfigurationElementCollection<TKey, TElement> 
	: ConfigurationElementCollection, 
	IList<TElement>, IDictionary<TKey, TElement>
	where TElement : ConfigurationElement, new()
{
	protected override ConfigurationElement CreateNewElement()
	{
		return new TElement();
	}

badboy

Original link: http://www.concentric.net/~Ttwang/tech/inthash.htm
Taken from: http://web.archive.org/web/20071223173210/http://www.concentric.net/~Ttwang/tech/inthash.htm
Reformatted using pandoc

Integer Hash Function

Thomas Wang, Jan 1997

last update Mar 2007

henrik

1. Your class can be no longer than 100 lines of code.
2. Your methods can be no longer than five lines of code.
3. You can pass no more than four parameters and you can’t just make it one big hash.
4. When a call comes into your Rails controller, you can only instantiate one object to do whatever it is that needs to be done. And your view can only know about one instance variable.

You can break these rules if you can talk your pair into agreeing with you.

seanparsons

case class ListFoldRightBenchmark() extends SimpleScalaBenchmark {
  import scala.collection.mutable.ArrayStack

  @Param(Array("0", "1", "2", "3", "5", "10", "100", "500", "1000", "2000"))
  val length: Int = 0

  var list: List[Int] = _

  override def setUp() {
    // set up all your benchmark data here

Coneko

#import <pthread.h>
#import <mach/thread_act.h>

// These two functions are declared in mach/thread_policy.h, but are commented out.
// They are documented here: https://developer.apple.com/library/mac/#releasenotes/Performance/RN-AffinityAPI/_index.html
kern_return_t	thread_policy_set(
					thread_t			thread,
					thread_policy_flavor_t		flavor,
					thread_policy_t			policy_info,
					mach_msg_type_number_t		count);

jboner

Latency Comparison Numbers (~2012)
----------------------------------
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        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD

axefrog

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;

namespace SuffixTreeAlgorithm
{
	public class SuffixTree
	{

rygorous

// float->half variants.
// by Fabian "ryg" Giesen.
//
// I hereby place this code in the public domain, as per the terms of the
// CC0 license:
//
//   https://creativecommons.org/publicdomain/zero/1.0/
//
// float_to_half_full: This is basically the ISPC stdlib code, except
// I preserve the sign of NaNs (any good reason not to?)