Skip to content

Instantly share code, notes, and snippets.

import asyncio
import threading
import time
from contextlib import contextmanager
from typing import List, Dict
from binance import AsyncClient, BinanceSocketManager, DepthCacheManager
from binance.depthcache import DepthCache
import asyncio
from binance import AsyncClient, BinanceSocketManager
from binance.depthcache import DepthCache, DepthCacheManager
from psutil import Process
caches_sum_length = {}
cache_10_bids = {}
cache_10_asks = {}
cache_num_of_zeros = {}
import string
import sqlite3
import time
import sqlalchemy
import os.path
from binance_trade_bot.database import Database, LogScout
from binance_trade_bot.logger import Logger
from binance_trade_bot.config import Config
import sys
@idkravitz
idkravitz / Cargo.toml
Created February 14, 2020 04:09
String concatenations of non negative numbers in Rust.
[package]
name = "rustconcat"
version = "0.1.0"
authors = ["Dmitry Kravtsov <idkravitz@gmail.com>"]
edition = "2018"
# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
[lib]
name="rustconcat"
0eNrlnd9unDey7d9F19Hg438y2NjPsO8PBoZidzzCliVvWcqZnEHe/bRkd6stsYq/1ZlgA8nNDGKbq4tkFb9iVa3ivy5+unncfb6/vn24+PFfF9fv726/XPz4f/518eX64+3VzdOfPfz6eXfx48X1w+7TxQ8Xt1efnv7r9vH9ze7q/vJ+d/X+4e7+4rcfLq5vP+z+efFj+O2Hyehfru8fHvd/cgT4+i8u+8nI+Nvff7jY3T5cP1zvvgrx/B+/vrt9/PTT7n4PfRz9+frz7vLh7vLj/d3j7Yc96ue7L/thd7dPP7mHumz7f/vr/v/TXpyLD9f3u/df/7Y+SfcKNr4I9XB3u7v8v1c3NzPI7Qg5AUkiSJyBZAZShwdSIEj3QCoEaR5IgyDVA+l8049ArzY9TmAHlK14soVNEK5wjQwBSpdd6aBi1+SiQM2u0UWhqh1cFKrbrpUFqNzFNbPQ+N4fkYBihg6lc+03DEG6LpyVG5TOPRgi1O/ingwR6ndxbThC/S6urUWo38W1tQj1u7i2Fql+u7YW4eldXFuLUJuza2sRntbZtYkknNa5c4tNUJuzaxMpCtI1brEJ6nd2bS1B/c6urSWo39m1tQT1O7u2lqB+Z9fWEtVv19YS1W/fe4Rnc3JtLUNtTq6tZXg2J9cmcuI2kRq32Ay1Obk2kYsgXeUWm6F+J9fWMtTv5NpahvqdXFvLUL+Ta2uF6rdra4Xqt2trBep39K9q8GyOrq0VqM3RtbUCz+bo2kSp3CaicF0rUJujaxNFuExG4b5WoH5H19Yq1O/o2lqF+h1dW6tUv11bq1S/XVurUL+Da2sV6nfw4yLwbA6urVWozcG1tQrP5uDaRBVuiqFwi21Qm4NrE02I+R2RgMU2qN/BtbUG9Tu4ttaofru21qh+u7bWoH67ptageruW1qB2+xFIGuZzI5A05uGC0EuiC6LcEbmpdqjGri30/J1szvBp/LxT98OVgZ7OLgjTXteMOlNeXw6mu+6CjG2xKdHbk8F01lWLwVU

Алгол 60

procedure Absmax(a) Size:(n, m) Result:(y) Subscripts:(i, k);
    value n, m; array a; integer n, m, i, k; real y;
comment Наибольший элемент матрицы a, размера n на m 
 передаётся в виде результата в y, а его индексы — в параметры i и k;
begin integer p, q;
    y := 0; i := k := 1;
    for p:=1 step 1 until n do

for q:=1 step 1 until m do

@idkravitz
idkravitz / a.hs
Last active December 18, 2015 21:48
Задача A. В ожидании Нового года
import System.IO
type Timestamp = (Integer, Integer)
timeBeforeNewYear :: Timestamp -> Timestamp
timeBeforeNewYear (h, m)
| m == 0 = (24 - h, m)
| otherwise = (23 - h, 60 - m)
strToTimestamp :: String -> Timestamp
@idkravitz
idkravitz / gist:4250291
Created December 10, 2012 12:30
Decomposition aproach to solve projection problem
% X - source matrix
% splitFunc - function handler for some matrix decomposition method, accepts X and initial vector,
% which formed as convex combinations of vectors from X
function z = SimProPart(X, splitFunc)
do % TODO: find a better a way to force non empty decomposition
V = rand(1, columns(X));
V = V / norm(V);
[X1, X2] = splitFunc(X, sum(X * diag(V), 2));
until (columns(X1) > 0 && columns(X2) > 0)
@idkravitz
idkravitz / Sort.as
Created June 16, 2012 13:19
Hello Qsort on ActionScript
package
{
/**
* ...
* @author idkravitz
*/
public class Sort
{
public static function qsort(array:Array):Array
{
@idkravitz
idkravitz / lab3.py
Created November 27, 2011 09:09
lab3 in progress
#!/usr/bin/env python3
import sys
import numpy
import numpy.linalg
from math import sqrt, sin, cos, pi, floor, ceil
import matplotlib.pyplot
from tkinter import *
from tkinter.messagebox import showerror