superbobry

Хочу ещё раз на примере декоратора trace пояснить, какие типы декораторов используются на практике и как они работают.

Декораторы без аргументов

Общая структура декоратора и пример использования:

def trace(func):
 def inner(*args, **kwargs):

superbobry

1. General Background and Overview

• Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
• Models and Issues in Data Stream Systems
• Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
• Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
• [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep

superbobry

(* Chapter 2: BST *)

type 'a tree = Empty | Node of 'a tree * 'a * 'a tree

module Set : sig
  val empty  : 'a tree
  val member : 'a tree -> 'a -> bool
  val insert : 'a tree -> 'a -> 'a tree
end = struct

superbobry

TDF

TDF is a binary format developed by the IGV team at Broad Institute.

Overview

Concepts

superbobry

# Python 2
>>> b = bytearray(8)
>>> v = memoryview(b)
>>> v[0] = 42
Traceback (most recent call last):
  File "<stdin>", line 1, in <module>
TypeError: 'int' does not have the buffer interface
>>> b
bytearray(b'\x00\x00\x00\x00\x00\x00\x00\x00')

superbobry

import time

from matplotlib import pyplot as plt


def timed(f, args, *, n_iter=100):
    acc = float("inf")
    for i in range(n_iter):
        t0 = time.perf_counter()
        f(*args)

superbobry

open StdLabels

type 'a tree = Node of ('a * 'a tree list)

let rec make ~f init =
  let (label, forest) = f init in
  Node (label, (List.map ~f:(make ~f) forest))

and draw ~f (Node (label, forest)) =
  let rec inner = function