nitely

import sre_compile
import re


class Scanner:

    def __init__(self, rules, flags=0):
        self.scanner = sre_compile.compile(
            '(%s)' % '|'.join('(%s)' % pattern for pattern in rules),
            flags)

nitely

/*

var myProto = function(myArg) {
  this.myArg = myArg;
};

myProto.prototype.myMethod = function() {};

myProto.myStaticMethod = function() {};

nitely

# LICENSE: MIT

import collections


RIGHT, LEFT = range(2)

Op = collections.namedtuple('Op', [
    'precedence',
    'associativity'])

nitely

# -*- coding: utf-8 -*-

"""
COPYRIGHT: esteban castro borsani @ nitely
LICENSE: MIT
"""

import collections

nitely

# missing imports here: GRAPHEME_BREAK_INDEXES, GRAPHEME_BREAK_TYPES, BLOCK_SIZE

def get_grapheme_type(ch):
    block_offset = GRAPHEME_BREAK_INDEXES[ch // block_size]  # floor
    return GRAPHEME_BREAK_TYPES[block_offset][ch % block_size]

def test():
    with open('./GraphemeBreakProperty.txt', 'r', encoding='utf-8') as fh:
        data = list(parse(fh))
        for cp, tcp in data:

nitely

Fredrik Lundh's unicodenames

From: "Fredrik Lundh" [email protected] Date: Sun, 16 Jul 2000 20:40:46 +0200

The unicodenames database consists of two parts: a name database which maps character codes to names, and a code database, mapping names to codes.

• The Name Database (getname)

nitely

import streams
import unicode
import nimbench

iterator runes*(s: Stream): Rune =
  ## reads runes from a stream. Raises `EIO` if
  ## an error occurred.
  var buff = newString(4)
  var rune: Rune
  var n = 0

nitely

iterator runes*(s: Stream, buffSize=64000): Rune =
  ## reads runes from a stream. Resuming is not supported.
  ## It must be ran until completion, otherwise it
  ## may've consumed more than what was yielded. Make it a
  ## closure and pass it around when that behaviour is needed. Raises
  ## `EIO` if an error occurred.
  var
    buff = newString(buffSize)
    rune: Rune
    n = 0

nitely

# -*- coding: utf-8 -*-

# Copyright (c) 2017 by Esteban Castro Borsani.
# Released under MIT license

from .elements import (
    Header,
    Quote,
    HRule,
    UListItem,

nitely

#[
--- Day 1: Inverse Captcha ---

The night before Christmas, one of Santa's Elves calls you in a panic. "The printer's broken! We can't print the Naughty or Nice List!" By the time you make it to sub-basement 17, there are only a few minutes until midnight. "We have a big problem," she says; "there must be almost fifty bugs in this system, but nothing else can print The List. Stand in this square, quick! There's no time to explain; if you can convince them to pay you in stars, you'll be able to--" She pulls a lever and the world goes blurry.

When your eyes can focus again, everything seems a lot more pixelated than before. She must have sent you inside the computer! You check the system clock: 25 milliseconds until midnight. With that much time, you should be able to collect all fifty stars by December 25th.

Collect stars by solving puzzles. Two puzzles will be made available on each day millisecond in the advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants one s