Transforms the data of a given Spreadsheet Sheet to JSON.
- The frozen rows are taken as keys for the JSON.
- The data taken for the values is only that after the frozen rows
exportJSON(Spreadsheet)
- transforms the data in the given sheet to JSON.
import shutil | |
import tempfile | |
from collections import defaultdict | |
import hypothesis.strategies as st | |
from hypothesis.database import DirectoryBasedExampleDatabase | |
from hypothesis.stateful import Bundle, RuleBasedStateMachine, rule | |
from hypothesis import settings | |
from hypothesis import Phase | |
from hypothesis import Verbosity |
package something; | |
import java.io.IOException; | |
/** | |
* Utility class for executing shell commands. | |
*/ | |
public final class Shell { | |
@SafeVarargs |
package qses.tea; | |
/** | |
* Implementation of the Tiny Encryption Algorithm (TEA). | |
* The Tiny Encryption Algorithm is one of the fastest and most efficient | |
* cryptographic algorithms in existence. It was developed by David Wheeler and | |
* Roger Needham at the Computer Laboratory of Cambridge University. | |
* | |
* See http://www.cl.cam.ac.uk/ftp/users/djw3/tea.ps | |
* |
DROP PROCEDURE IF EXISTS string_split; | |
DELIMITER $ | |
CREATE PROCEDURE string_split | |
(IN string TEXT, IN sep CHAR(1), OUT num INT) | |
BEGIN | |
DECLARE pos INT; | |
DECLARE aux TEXT; | |
DECLARE str text; |
/** | |
* Eduardo R. B. Marques. | |
* | |
* Basic pthread_barrier_XXX functionality (not part of the standard Pthreads library). | |
* | |
* Note: no error checking for now. | |
*/ | |
typedef struct { | |
unsigned size; // threads that should join barrier |
import heapq | |
import time | |
import os | |
class EDFQueue(object): | |
def __init__(self): | |
self.heap = [] | |
def count(self): | |
return len(self.heap) |
import random | |
class PoissonProcess(object): | |
def __init__(self, rate, seed=None): | |
self.prng = random.Random(seed) | |
self.rate = rate | |
def timeTillNextEvent(self): | |
return self.prng.expovariate(self.rate) |
*.aux | |
*.toc | |
*.out | |
*.bbl | |
*.blg | |
*.log | |
*.synctex.gz |
% Reference: "A perfect smoother", PHC Eilers - Analytical chemistry, 2003 | |
% This is the simplest formulation - check Eilers' article for an alternative implementation making use of sparse matrixes. | |
function z = whittakerSmoother(y,lambda) | |
m = length(y); | |
I = eye(m); | |
D = diff(I); | |
z = (I + lambda * D' * D)\y; | |
end | |
% Test |