janeczku

#cloud-config

# Set the hostname for this machine (takes precedence over hostname assigned by DHCP lease).
hostname: myhost
# Authorize SSH keys for the `rancher` sudoer user
ssh_authorized_keys:
  - ssh-rsa AAA...ZZZ example1@rancher
  

bradtraversy

#! /bin/bash

# ECHO COMMAND
# echo Hello World!

# VARIABLES
# Uppercase by convention
# Letters, numbers, underscores
NAME="Bob"
# echo "My name is $NAME"

adrientetar

"""
A simple btree implementation in Python.

Python 3.3+
"""


class Node:

    __slots__ = ['left', 'right', 'value']

KdotJPG

/**
 * K.jpg's OpenSimplex 2, smooth variant ("SuperSimplex")
 *
 * More language ports, as well as legacy 2014 OpenSimplex, can be found here:
 * https://github.com/KdotJPG/OpenSimplex2
 */

public class OpenSimplex2S {

    private static final long PRIME_X = 0x5205402B9270C86FL;

mmarcon

package es.cloudey.pagespeed.util;

import java.util.HashMap;
import java.util.Map;

import android.os.Bundle;
import android.os.Parcelable;

public class CollectionUtils {
    public static Bundle toBundle(Map<String, ? extends Parcelable> input) {

sumanth232

/* By the author :
   I'd recommend reading the paper "Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications" by Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, and Kunsoo Park.

It shows how to find the length of the longest common prefixes between consecutive suffixes in lineal time, in around 10 lines of code (really, see code in edit).

I also wanted to share my implementation of Manber & Myers algorithm which is also on edit. I got Accepted on SUBST1 with it. */

// Begins Suffix Arrays implementation
// O(n log n) - Manber and Myers algorithm
// Refer to "Suffix arrays: A new method for on-line string searches",