Exemplo n.º 1
0
from been_well import main
from getFromDill import returnXList
from storeADill import storeXList
import copy
if __name__ == "__main__":
    r = returnXList("rockstar")
    # r = returnXList("rock")
    f = copy.copy(r)
    r0 = [x for x in r.keys() if not r[x]]
    for y in r0:
        main(y)
        f.update({y: True})
        storeXList(f, "rockstar")
# need for failsafe.
Exemplo n.º 2
0
    # print(k)
    # all shit.
    k = list(filter(lambda x: x in [True, False], k))
    # k=list(filter(lambda x: type(x) is bool,k))
    # all shit.
    k = list(map(int, k))
    k = sum(k)
    return k > v
    # what the heck?


# def sumOne(a):
#     if type(a)==dict:
#         return
# # get all values?
r = returnXList("trench")
# r0 = [x for x in r.keys()][0]
r = {x: virtual(r[x], 0) for x in r.keys()}
p = [x for x in r.keys() if r[x] == False]
storeXList(p, "invisible_0")
# it would be great measurement if used to all unicode chars.
# ok! now use it to do our task!
# r1 = r[r0]
# # print(r1)
# r1 = (1, 2, 3, 4, {"json": [1, 2, 3, 4, [2, 2, 3, 4, [3, 2, 3, 4]]], "nothing":(1, 2, 3, 4, (2, 2, 3, 4))}, (2, 2, 3, 4))
# really strange.
# ca we just preserve the path?
# xrange not defined. modify it!
# ak(pywalk.walk(node))?
# iterator?
# what if we have the list?
Exemplo n.º 3
0
def getlower(a, b):
    return [x for x in a if b.lower() in x.lower()]


def juicy(a, b):
    return [x for x in a if set(b.lower()).issubset(set(x.lower()))]


def positive(a, x, c):
    if c:
        return getlower(a, x)
    else:
        return juicy(a, x)


r = returnXList("shredded_realcode")
while True:
    try:
        c = input("mode: N/S - normal/set\n")
        assert type(c) == str and c in ["N", "S"]
        if c == "N":
            c = False
            break
        c = True
        break
    except Exception as err:
        print("wrong mode!")
        continue
a = input("query:\n")
for x in r.keys():
    i = positive(r[x], a, c)
Exemplo n.º 4
0
from dbM import initial
from getFromDill import returnXList
import re


def xygen(x, y):
    x0 = re.findall(r'^[^_]+', x)[0]
    y0 = re.findall(r'[^/]+$', y)[0]
    return (x0, y0, y)


r = returnXList("rock")
# print(r)
f = []
for x in r.keys():
    for y in r[x]:
        z = xygen(x, y)
        # print(z)
        f.append(z)
initial("projects", f)
print("DONE!")
Exemplo n.º 5
0
def getlower(a, b):
    return [x for x in a if b.lower() in x.lower()]


def juicy(a, b):
    return [x for x in a if set(b.lower()).issubset(set(x.lower()))]


def positive(a, x, c):
    if c:
        return getlower(a, x)
    else:
        return juicy(a, x)


r = returnXList("shredded_keywords_pypi")
while True:
    try:
        c = input("mode: N/S - normal/set\n")
        assert type(c) == str and c in ["N", "S"]
        if c == "N":
            c = False
            break
        c = True
        break
    except Exception as err:
        print("wrong mode!")
        continue
a = input("query:\n")
for x in r.keys():
    i = positive(r[x], a, c)
Exemplo n.º 6
0
from getFromDill import returnXList
import random


def choice(s):
    rng = random.SystemRandom()
    return rng.choice(s)


f = returnXList("within")
print(choice(f))
Exemplo n.º 7
0
    # type theory is all about law works.
    # trust me. just some lawyers' theory, easy to learn.
    b = ""
    c = []
    for x in a:
        if x not in x0:
            b += x
        else:
            if b != "":
                c.append(b)
                b = ""
    if b != "":
        c.append(b)
        b = ""
    return c


r = returnXList("invisible_0")
f = ""
with open("trench.log", "r") as f0:
    f = f0.read()
f = scanner(f, r)
# with open("trencher.log","w+") as f0:
#     # f=f0.read()
#     for x in f:
#         f0.write(x+"\n")
storeXList({x: False for x in f}, "rockstar")
# immortal internet?
# now, get to it!
# there are non-english word inside.