>>> import string
>>> string.ascii_letters
'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'
>>> string.ascii_lowercase
'abcdefghijklmnopqrstuvwxyz'
>>> string.ascii_uppercase
'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
>>> string.digits
'0123456789'
>>> string.hexdigits
'0123456789abcdefABCDEF'
>>> string.octdigits
'01234567'
>>> string.printable
'0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ!"#$%&\'()*+,-./:;<=>?@[\\]^_`{|}~ \t\n\r\x0b\x0c'
>>> string.punctuation
'!"#$%&\'()*+,-./:;<=>?@[\\]^_`{|}~'

import StringLib from '../../../../../../stdlib/primitive/String/static';

import static_props from 'blah.js'
class String {
     static scope = static_props
}

import String from 'string.js';
export default new Map([
    ["alphabet", new String("abcdefisdfalj")]
]);

"asdf".valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf().valueOf()

"abcdefghijklmnopqrstuvwxyz"

1, 2, 4, 6, 8, 10, 12, 16, 18, 20, 22, 24, 28, 30, 32, 36, 40, 42, 44, 46, 48, 52, 54, 56, 58, 60, 64, 66, 70, 72, 78, 80, 82, 84, 88, 92, 96, 100, 102, 104, 106, 108, 110, 112, 116, 120, 126, 128, 130, 132, 136, 138, 140, 144, 148, 150, 156, 160, 162, 164, 166, 168, 172, 176, 178, 180, 184, 190, 192, 196, 198, 200, 204, 208, 210, 212, 216, 220, 222, 224, 226, 228, 232, 238, 240, 250, 252, 256, 260, 262, 264, 268, 270, 272, 276, 280, 282, 288, 292, 294, 296, 300

1,2,3,4,5,6,8,10,12,13,15,16,18,20,21 (by hand)

for(int j=0;j<26;j++)if(p.equals(l[j])&&j<13){p=l[j+13];break;}else if(p.equals(l[j])&&j>=13){p=l[j-13];break;}return p;}

for(int j=0;j<26;j++)if(p.equals(l[j]))return l[25-j];return"";}

"True","true","Yes","yes","Yeah","yeah","0","1","nope","Nope","no","No","false","False"

String s(String p){String[]l={"True","true","Yes","yes","Yeah","yeah","0","1","nope","Nope","no","No","false","False"};for(int j=0;j<14;j++)if(p.matches(l[j]))return p.replace(l[j],l[13-j]);return "";}