mjtb49

import copy

def lcg(seed):
    return (seed*1103515245+12345) % 2**31

def invlcg(seed):
    return ((seed-12345)*1857678181) % 2**31

def getCeils(list):
    newlist = []

mjtb49

/**
 * An example of the method for the specific case of finding patterns of mushroom islands. Some things,
 * like the layerseed will be hardcoded which should eventually be computed dynamically
 * depending on which layer and nextInt call the user wishes to target.
 */

public class MushroomCondition {

    final static long SHROOM_LAYER_SEED = -7479281634960481323L; //must be computed for each layer, maybe a LUT?
    final static long EPSILON = (1L << 32);

mjtb49

import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;

public class NextLongEquivalentFinder {
    //{0, 107048004364969} offsets
    //{{-33441*2/(32768*2), 46603/65536}, {17549*2/(32768*2), 39761/65536}}/65536 will be our inverse matrix

mjtb49

/**
 * An example to show basic functionality of KaptainWutax's libraries
 * and common usage patterns.
 */

import kaptainwutax.biomeutils.source.OverworldBiomeSource;
import kaptainwutax.featureutils.structure.Village;
import kaptainwutax.seedutils.mc.ChunkRand;
import kaptainwutax.seedutils.mc.MCVersion;
import kaptainwutax.seedutils.mc.pos.CPos;

mjtb49

import kaptainwutax.biomeutils.source.NetherBiomeSource;
import kaptainwutax.featureutils.structure.NetherFossil;
import kaptainwutax.seedutils.mc.MCVersion;
import java.util.Random;

public class NetherFossils {
    static final NetherFossil FOSSIL = new NetherFossil(MCVersion.v1_16_1);

    public static void printSomeFossilSeeds(int some) {
        Random r = new Random();

mjtb49

import java.util.*;

public class AdditionUnderXOR {

    static final int SS = 1000000;

    enum Ore {

        COAL(60005),
        IRON(60006),

mjtb49

import java.util.Random;
import java.util.UUID;

public class UUIDBonker {

    public static UUID randomUuid(Random random) {
        //fabric mappings seem to call m and l the other way round. This disagrees with UUID constructor.
        long m = random.nextLong() & -61441L | 16384L;
        long l = random.nextLong() & 4611686018427387903L | Long.MIN_VALUE;
        return new UUID(m,l);

mjtb49

import random


class GF2Poly:
    def __init__(self, c):
        self.c = c

    def __add__(self, other):
        return GF2Poly(other.c ^ self.c)

mjtb49

import com.google.common.base.Charsets;
import com.google.common.hash.HashFunction;
import com.google.common.hash.Hashing;
import com.google.common.primitives.Longs;

import java.util.Random;

public class LootTableRNG {

    private static final HashFunction MD5 = Hashing.md5();

mjtb49

import math

import sympy
import sympy as sp
import random


class LCG:
    def __init__(self, a, b, m):
        self.a = a % m