rgantt

public static <A> Node<A> reverse(final Node<A> head) {
  Node<A> curr;
  Node<A> previous = null;
  while (head != null) {
    curr = head.next;
    head.next = previous;
    previous = head;
    head = curr;
  }
  return previous;

rgantt

package com.ryangantt.scala

import scala.collection.mutable.Queue
import scala.collection.mutable.ArrayBuffer

abstract class Element[+T]
case class Node[T](val left: Element[T], val right: Element[T], val value: Leaf[T]) extends Element[T]
case class Leaf[T](val value: T) extends Element[T]
case object Sentinel extends Element

rgantt

all: atdgen stock_price

stock_price:
        corebuild -pkg core_extended,netclient,yojson,atdgen stock_price.native 

atdgen:
        atdgen -j yfinance.atd
        atdgen -t yfinance.atd

clean:

rgantt

package com.ryangantt.monad;

/**
 * Implementation of the identity monad
 */
public class Identity<T> {
    public T value;
    
    public T getValue() {
        return value;

rgantt

public interface Monoid<T> {
  public T apply(T a, T b);
}

public class StringMonoid implements Monoid<String> {
  public static final String IDENTITY = StringUtils.EMPTY_STRING;

  public String apply(String a, String b) {
    return a + b;
  }

rgantt

/**
 * FP fanservice
 */
  
private interface Predicate<T> {
    public boolean evaluate(final T item);
}
  
protected <T> Collection<T> filter(final Collection<T> collection, final Predicate<T> predicate) {
    final Collection<T> filtered = new ArrayList<T>();

rgantt

package com.ryangantt.util;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Deque;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;

rgantt

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

rgantt

<?php
/**
 * ============
 * Defect: can alias-override class constructor, but only when using legacy constructor naming convention
 * ============
 */
trait SomeTrait {
	private function constructor() {
		echo "this is abuse\n";
	}

rgantt

<?php
/** inside of a method */

$that = $this;
return $this->argmax( $candidates, function ( $w ) use ( $that ) {
	$that->nwords[ $w ];
});