Nick Kapliev nkapliev

🎯

Focusing

nkapliev / avito.ru browser protection =)

Created February 4, 2016 07:36

	(function(x/**/) {
	(function(f){
	(function a(){
	try {
	function b(i) {
	if(
	(''+(i/i)).length !== 1 \|\|
	i % 20 === 0
	) {
	(function(){}).constructor('debugger')();

nkapliev / gist:6b3a07c19a1e8a0059eb

Created February 4, 2016 07:39 — forked from anonymous/gist:06e0bd519490c8f03404

	# habraproxy.py — это простейший http-прокси-сервер, запускаемый локально (порт на ваше
	# усмотрение), который показывает содержимое страниц Хабра. С одним исключением: после
	# каждого слова из шести букв должен стоять значок «™». Примерно так:
	#
	# http://habrahabr.ru/company/yandex/blog/258673/
	# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
	# Сейчас на фоне уязвимости Logjam все в индустрии в очередной раз обсуждают проблемы и
	# особенности TLS. Я хочу воспользоваться этой возможностью, чтобы поговорить об одной из
	# них, а именно — о настройке ciphersiutes.
	#

nkapliev / getCharsWidth.html

Last active February 16, 2017 06:35

How to compute chars width? 2 ways: DOM & Canvas

	<!DOCTYPE html>
	<html>
	<head lang="en">
	<meta charset="UTF-8">
	<title></title>
	</head>
	<body>

	<script>
	var getTextWidthDOM = function(text, fontStyle) {

nkapliev / fibonacci_with_accumulator.hs

Created February 25, 2016 09:17

	fibonacci :: Integer -> Integer
	fibonacci 0 = 0
	fibonacci 1 = 1
	fibonacci (-1) = 1
	fibonacci (-2) = (-1)
	fibonacci n \| n > 0 = helper (fibonacci 0) (fibonacci 1) (n - 2)
	\| n < 0 = helper (fibonacci (-1)) (fibonacci (-2)) (n + 3)

	helper :: Integer -> Integer -> Integer -> Integer
	helper a b n \| n == 0 && a > b = a - b

nkapliev / integration.hs

Created February 26, 2016 13:44

	integration :: (Double -> Double) -> Double -> Double -> Double
	integration f a b \| a == b = 0
	\| otherwise = coeff * dx * ((f begin + f end) / 2 + helper (begin + dx) 0 (numberOfSteps - 1))
	where
	begin = min a b
	end = max a b
	numberOfSteps = 1000
	coeff = if end == a then (-1) else 1
	dx = (end - begin) / numberOfSteps
	helper x sum n \| n == 0 = sum

nkapliev / unix group rename

Created April 11, 2016 09:09

for f in aaa*; do mv $f $(echo $f | sed 's/^aaa/bbb/g'); done

nkapliev / range.js

Created April 18, 2016 14:41

js range

Array.apply(null, {length: N}).map(Number.call, Number)

nkapliev / getftree.sh

Created June 28, 2016 16:12

Amazing fractal tree on bash

	# @see https://www.hackerrank.com/challenges/fractal-trees-all
	# Creating a Fractal Tree from Y-shaped branches
	#
	# This challenge involves the construction of trees, in the form of ASCII Art.
	#
	# We have to deal with real world constraints, so we cannot keep repeating the pattern infinitely.
	# So, we will provide you a number of iterations, and you need to generate the ASCII version
	# of the Fractal Tree for only those many iterations (or, levels of recursion). A few samples are provided below.
	#
	# Input Format

nkapliev / gcd.js

Last active September 9, 2016 10:46

Greatest common divisor in Javascript @see: https://en.wikipedia.org/wiki/Binary_GCD_algorithm

nkapliev / polish_calculator.cpp

Created September 9, 2016 10:23

Polish notation calculator on C++. @see https://en.wikipedia.org/wiki/Polish_notation