Skip to content

Instantly share code, notes, and snippets.

View zhangmingkai4315's full-sized avatar
😀
I may be slow to respond.

Mike zhangmingkai4315

😀
I may be slow to respond.
View GitHub Profile
import argparse
import random
import math
import queue
import time
import logging
import threading
import dns.resolver
import datetime
package slider
import "time"
type Window struct {
start int64
count int64
}
func (window *Window) Start() time.Time{
from selectors import DefaultSelector, EVENT_READ, EVENT_WRITE
import socket
import time
selector = DefaultSelector()
jobs = 0
class Future:
def __init__(self):
self.callback = None
// An algorithm that randomly chooses an item from this stream such that
// each item is equally likely to be selected.
// AKA : Reservoir Sampling
package main
import (
"math"
"math/rand"
"sync"
@zhangmingkai4315
zhangmingkai4315 / echo.go
Last active October 28, 2020 00:07
打印显示路径以及post的数据
package main
import (
"encoding/json"
"flag"
"fmt"
"log"
"net/http"
)
from multiprocessing import Process
import threading
import queue
import time
import dns.resolver
from queue import Queue
TERM_SIGNAL = "TERM"
ServerListFile = "./example.txt"
MaxWorker = 10
# -*- coding: utf-8 -*-
pattern = "acabacacd"
text = "acaacabacabacacda"
def create_prefix_table(p):
size = len(p)
table = [0]*size
import time
from threading import Thread
from queue import Queue
# class style generator
class Ticker():
def __init__(self, second):
self.sleep = second
def __iter__(self):
import argparse
import random
import math
import queue
import time
import logging
import threading
import dns.resolver
import datetime
class Queue:
def __init__(self):
self.queue = []
def enqueue(self, item):
self.queue.append(item)
def dequeue(self):
if self.size() < 1:
return None