nielsutrecht

{
    "kind": "Listing",
    "data": {
        "modhash": "ktve0h61g983ea8a06d93d647897c6b1091b00331882f45a35",
        "children": [
            {
                "kind": "t3",
                "data": {
                    "domain": "i.imgur.com",
                    "banned_by": null,

nielsutrecht

public class Helper {
      public static BitSet generatePrimes(final int maxNum) {
        final BitSet set = new BitSet(maxNum+1);
        set.clear(0, 1);
        set.set(2, maxNum, true);
        for (int i = 2; i < maxNum; i++) {
            boolean isPrime = true;
            for (int j = 0; j < (int) Math.sqrt(i); j++) {
                if (!set.get(j)) {
                    continue;

nielsutrecht

package monster;

import java.io.File;
import java.io.IOException;
import java.util.Arrays;
import java.util.List;

import org.codehaus.jackson.map.ObjectMapper;
import org.codehaus.jackson.map.SerializationConfig;

nielsutrecht

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.net.URL;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.stream.Collectors;

import static java.lang.Integer.compare;

nielsutrecht

package misc;

import org.openjdk.jmh.annotations.*;
import org.openjdk.jmh.runner.Runner;
import org.openjdk.jmh.runner.RunnerException;
import org.openjdk.jmh.runner.options.Options;
import org.openjdk.jmh.runner.options.OptionsBuilder;

import java.util.Arrays;
import java.util.HashSet;

nielsutrecht

package droptable;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Locale;

public class DropTable {
    private List<DropChance> table;
    private boolean sorted;

nielsutrecht

package thread;

import java.util.Arrays;
import java.util.List;
import java.util.Random;
import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;

/**
 * Example that shows communications between threads through blocking queues. There are 4 worker threads and one printer

nielsutrecht

    import java.util.BitSet;

    public class EratosthenesSieve {
        private BitSet primes = null;

        public void init(int maxNum) {
            final long start = System.currentTimeMillis();
            primes = new BitSet(maxNum+1);

            primes.clear(0, 1);

nielsutrecht

package crypt;

import javax.xml.bind.DatatypeConverter;
import java.util.*;

public class SubstCrypto {
    private static char[] createKey(long seed) {
        char[] key = new char[256];

        for(int i = 0;i < key.length;i++) {

nielsutrecht

import org.junit.Assert;
import org.junit.Before;
import org.junit.Test;

import static junit.framework.TestCase.assertEquals;
import static junit.framework.TestCase.fail;

public class UnitTestExample {
    private UnitUnderTest unit;
    @Before