wholesome unicode font generation


well i randomly read about unicode having 137 000 individual characters, that is quite a lot.

I hardly doubt there are much / any font supporting the whole 137 000 symbols. Tho if we gether together 1 font which supports all or mesh together multiple fonts to get the full 137 000 symbols we can call it base font. We can than generate wholesome font from any partial one. The base font should be probly un-beveled (or hairlined or skeletoned) – getting only the inner „bezzier“ curve for each symbol.

Then you take comics sans and convert every character to svg or some vector representation. Compare each of its defined symbols with your wholesome base font. Then you can scribble together a snippet generating „font-transformation-function“ or you take „some“ NN and learn it to do the same faster. Then apply the „font-trans-fun“ to every symbol undefined in original comics sans and voila, you have wholesome comics sans with definition for every unicode char.


Python indents


If you hate strict python indentation, just compare usage and readability of xml which has no strict indentation and yaml which has some.


alternative to alternativeto.com

# Who is using alternativeto?

– Just users who are trying to **find alternative to some program they know**.
– They want to use this site to find out new program to try.
– Aaand they want to know if it’s used by anyone – now anyone is simple anonymous group of everyone who is using alternativeto.

# Who can be also using alternativeto?

Celý příspěvek

3d printer slic3r update to reflect plastic vapor smoothering

jaktoze jeste nikdo nevymyslel filtr na 3d modely, ktery by byl nauceny jak aceton smyva detaily, a model by upravil tak aby mel hrany prehranene (veci vystupky) a detaily taky prehnane, misto pahorkatin vrchoviny, misto kulatych tecek boule, proste tak aby se po aplikaci acetonovych par model vyhladil tak aby mel puvodni detaily pred filtraci..
tady ciha Nobelovka

Sort nested dict in python – OrderedDict

Nested ordered dict sort. If you need to sort your dict or OrderedDict, this snippet may come helpfull.

from collections import OrderedDict
def ordered_dict(od, reverse=False, sort_key=None):
    """Sort nested ordered dict recursively.

    - sort by dict key case insensitively:
        sort_key = lambda (k, v): k.lower()
    if not isinstance(od, OrderedDict):
        od = OrderedDict(od)

    res = OrderedDict()
    for k, v in sorted(od.items(), reverse=reverse, key=sort_key):
        if isinstance(v, dict):
            res[k] = ordered_dict(v)
            res[k] = v
    return res

# show-off
a = {chr(i+ord('a')+(i%2)*(ord('A')-ord('a'))): i for i in reversed(range(0,26))}
print(ordered_dict(a, reverse=True, sort_key=lambda (k,v): k.lower()))