This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import bibtexparser | |
with open('references.bib') as bibtex_file: | |
bib = bibtexparser.bparser.BibTexParser(common_strings=True).parse_file(bibtex_file) | |
# First, rename | |
# Remove duplicates | |
bib.entries = list(bib.entries_dict.values()) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class n_3(object): | |
def n_3(e_4:bool, n_3:str, o_5:str, j_0:object): | |
for x_12 in (-[(m_7), (None), (e_4), (g_13), (t_14)].y_15(([(t_11)])) and 310): | |
return | |
def b_33(a_34:object, u_35:str, o_5:object, f_36:str, q_17:bool, j_24:str, x_23:int, c_37:int, j_27:object): | |
def n_39(n_39:int, d_21:str, v_40:bool, j_27:bool, b_19:object, b_41:bool, d_42:bool, r_43:object): | |
(c_80) | |
pass |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
for a in -[].b : | |
0 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class j_0(object): | |
j_0:object = 513 | |
m_1:int = True | |
t_2:int = "Udr" | |
m_1:str = None | |
class n_3(object): | |
n_3:int = False | |
j_0:str = False | |
m_1:object = False | |
j_0:str = 793 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include "stdlib.h" | |
#include "stdio.h" | |
#include "archive.h" | |
#include "archive_entry.h" | |
int main(int argc, char** argv) { | |
struct archive *a; | |
struct archive_entry *entry; | |
int r; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* Copyright (C) 2013 Rohan Padhye | |
* | |
* This library is free software: you can redistribute it and/or modify | |
* it under the terms of the GNU Lesser General Public License as | |
* published by the Free Software Foundation, either version 2.1 of the | |
* License, or (at your option) any later version. | |
* | |
* This library is distributed in the hope that it will be useful, | |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var express = require('express'); | |
var app = express(); | |
var router = express.Router(); | |
var M = 1000; // Size of path array | |
var N = 1000; // Size of middleware array | |
function fnNext(req, res, next) { | |
next(); | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var d3_hierarchy = require("d3-hierarchy"); | |
var tile = d3_hierarchy.treemapBinary; | |
var M = 1000; // number of children | |
var N = 1000; // number of iterations for perf test | |
// Util: measure time | |
function timeit(name, f, N) { | |
console.time(name); |