duplicates = multiple editions
A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen
A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen
/** Extra rules by IBBoard to get nicer GTK3 header bars **/ | |
/* Also requires https://gist.github.com/Dvad/9210763 */ | |
.header-bar .button, .header-bar .button:last-child { | |
background-image: linear-gradient(to bottom, | |
shade(@theme_bg_dark_color, 1.40), | |
shade(@theme_bg_dark_color, 1.10)); | |
color: @theme_text_dark_color; | |
box-shadow: inset 0px 4px alpha(#000, 0.02), | |
inset 0px 3px alpha(#000, 0.02), |
#!/usr/bin/python | |
import socket, ssl, select, time, re | |
from thread import start_new_thread | |
from struct import pack | |
TYPE_ENUM = 0 | |
TYPE_STRING = 2 | |
TYPE_BYTES = TYPE_STRING | |
def clean(s): |
<!DOCTYPE html> | |
<html lang="en"> | |
<head> | |
<meta charset="UTF-8"> | |
<title>Mathology</title> | |
<style> | |
body { | |
font-family: Arial, Helvetica, sans-serif; | |
} |
~ # /tmp/zramtest3.sh test6 /tmp/ffmpeg-1\:2.6.1-1-x86_64.pkg.tar | |
zram test6 Sat Apr 4 09:50:06 GMT 2015 | |
comp_algorithm [lzo] lz4 snappy | |
real 0m 0.20s 0.20s 0.24s avg: 0.214s | |
real 0m 1.45s 1.42s 1.42s avg: 1.430s | |
compr_data_size 30504972 30504968 30504947 30504962 | |
comp_algorithm lzo [lz4] snappy |
<?php | |
/** | |
* Convert from Mozilla's LZ4 format to LZ4 v1.3 | |
* | |
* @link https://searchfox.org/mozilla-central/source/toolkit/components/lz4/lz4.js | |
* @link https://lz4.software.informer.com/1.3/ | |
* | |
* @param string $input File content in Mozilla's LZ4 format | |
* @return string File content converted to LZ4 v1.3 |
/* | |
* The following is an implementation of the finite field GF(2^8) as bit vectors of length 8, where the nth bit represents the | |
* coefficient of the nth power of the generator in each element, and the generator satisfies the minimal polynomial | |
* x^8 + x^4 + x ^3 + x^2 + 1 in the prime field Z_2, in which addition is equivalent to XOR and multiplication to AND. | |
* The elements of GF(2^8) thus represent polynomials of degree < 8 in the generator x. Addition in this field is simply | |
* bitwise XOR, but multiplication requires the elimination of powers of x <= 8. | |
*/ | |
#include <stdio.h> | |
#include <stdint.h> |
#!/usr/bin/env python3 | |
import aeidon, sys, time | |
if len(sys.argv) < 2: | |
print("Usage: {} SUBTITLE_FILE...".format(__file__)) | |
raise SystemExit(1) | |
for fname in sys.argv[1:]: | |
print("{}:".format(fname)) | |
project = aeidon.Project() | |
project.open_main(fname, "utf_8") | |
before = len(project.subtitles) |
telegram-scripts.js
into JS consoleshowContacts()
to get the list of contacts with idssaveChat(userId)
where userId
is the id from step 3Process can take a while, check console for progress. Occasionall FLOOD_WAIT
errors are expected. Once done, browser will download the JSON file.