| (1 << 29));

  /**
   * Returns {@code true} if {@code n} is a <a
   * href="http://mathworld.wolfram.com/PrimeNumber.html">prime number</a>: an integer <i>greater
   * than one</i> that cannot be factored into a product of <i>smaller</i> positive integers.
   * Returns {@code false} if {@code n} is zero, one, or a composite number (one which <i>can</i> be

    //     ends up at a[d], which in turn ends up at a[2d], and so on until we get back to a[0].
    //     (All indices taken mod n.) If d and n are mutually prime, all elements will have been
    //     moved at that point. Otherwise, we can rotate the cycle a[1], a[1 + d], a[1 + 2d], etc,
    //     then a[2] etc, and so on until we have rotated all elements. There are gcd(d, n) cycles

    hashFunctions[0] = Murmur3_128HashFunction.GOOD_FAST_HASH_128;
    int seed = GOOD_FAST_HASH_SEED;
    for (int i = 1; i < hashFunctionsNeeded; i++) {
      seed += 1500450271; // a prime; shouldn't matter
      hashFunctions[i] = murmur3_128(seed);
    }
    return new ConcatenatedHashFunction(hashFunctions);
  }

  /**

2030..2032    ; valid                  ;      ; NV8    # 1.1  PER MILLE SIGN..PRIME
2033          ; mapped                 ; 2032 2032     # 1.1  DOUBLE PRIME
2034          ; mapped                 ; 2032 2032 2032 #1.1  TRIPLE PRIME
2035          ; valid                  ;      ; NV8    # 1.1  REVERSED PRIME
2036          ; mapped                 ; 2035 2035     # 1.1  REVERSED DOUBLE PRIME

// https://www.iana.org/domains/root/db/praxi.html
praxi

// press : Radix Technologies Inc.
// https://www.iana.org/domains/root/db/press.html
press

// prime : Amazon Registry Services, Inc.
// https://www.iana.org/domains/root/db/prime.html
prime

// prod : Charleston Road Registry Inc.
// https://www.iana.org/domains/root/db/prod.html
prod

// productions : Binky Moon, LLC

praxi
prd.fr
prd.km
prd.mg
prequalifyme.today
prerelease.replit.dev
press
press.aero
press.cy
press.ma
press.se
presse.km
presse.ml
preview.csb.app
pri.ee
prime
primetel.cloud
principe.st
priv.at
priv.hu
priv.instances.scw.cloud
priv.me
priv.no
priv.pl
privatizehealthinsurance.net
pro
pro.az
pro.br
pro.cy
pro.ec

    public void test_evaluate_withSpecialCharacters() {
        String template = "Price: $${price} (with ${discount}% off)";
        Map<String, Object> paramMap = new HashMap<>();
        paramMap.put("price", "100");
        paramMap.put("discount", "20");

        Object result = scriptEngine.evaluate(template, paramMap);
        assertEquals("Price: $100 (with 20% off)", result);
    }

noi
noştri
nostru
nu
ori
oricând
oricare
oricât
orice
oricînd
oricine
oricît
oricum
oriunde
până
pe
pentru
peste
pînă
poate
pot
prea
prima
primul
prin
printr
sa
să
săi
sale
sau
său
se
şi
sînt
sîntem
sînteţi
spre
sub
sunt
suntem
sunteţi
ta
tăi
tale
tău
te
ţi

praxi
prd.fr
prd.km
prd.mg
prequalifyme.today
prerelease.replit.dev
press
press.aero
press.cy
press.ma
press.se
presse.km
presse.ml
preview.csb.app
pri.ee
prime
primetel.cloud
principe.st
priv.at
priv.hu
priv.instances.scw.cloud
priv.me
priv.no
priv.pl
privatizehealthinsurance.net
pro
pro.az
pro.br
pro.cy
pro.ec

man
mane
manęs
manimi
mano
manyje
mes
metu
mudu
mudvi
mudviejų
mudviem
mudviese
mumis
mums
mumyse
mus
mūsų
nei
nes
net
nors
nuo
o
pat
per
po
prie
prieš
sau
save
savęs
savimi
savo
savyje
su
tačiau
tada
tai
taip
tas
tau
tave
tavęs
tavimi
tavyje
ten
to
todėl
tu
tuo
už