View Linux library
#/bin/sh
LD_LIBRARY_PATH=/usr/local/bosque
export LD_LIBRARY_PATH
exec /usr/local/bosque/app.binary \$@
EOL
View ec_line.php
<?php
function parse_ec($linea) {
if ( preg_match("/\[EC:([\d\. ]*)\]/", $linea, $matches) ) {
$content = $matches[1];
return explode(' ', $content);
} else return [];
}
View all_files.php
<?php
$files = glob("*.txt");
foreach ( $files as $file ) {
system("php arbitrary.php $file.out $file dan dan kokoro hikareteku");
}
View matrix_ptr_of_ptr.cpp
#include <cstdio>
#include <stdlib.h>
int main() {
int size = 3;
int** matrix = (int **)malloc(sizeof(int*) * size);
for ( int i = 0 ; i < size ; i ++ ) {
View recursivity.php
<?php
$nodo = [
'm1',
'ec1',
'tax1',
'tax2',
'd1',
'd2',
'ec2'
];
View contar.php
<?php
$m = ['hola', 'chao', 'hola'];
$m = [
['beta', 2],
['beta', 4],
['gamma', 3],
['gamma', 7],
['delta', 11]
View seq.php
<?php
//$seq = 'ACTGTC----GATGTAC----GTACGTGACTG-------TACG-TAC-GTAGCTAGTC';
$seq = 'ACC';
$largo = strlen($seq);
$pos_0 = $seq[0];
$concat = 'AB' . 'C';
View primes.php
<?php
function es_divisible($numero, $divisor) {
$resto = $numero % $divisor;
if ( $resto == 0 ) return true;
else return false;
}
function es_par($numero) {
View pass_function.php
<?php
function search($min, $max, $criteria) {
for ( $i = $min; $i < $max; $i++ ) {
if ( $criteria($i) ) {
return true;
}
}
return false;
}
View join_fasta.php
<?php
$f = fopen('/home/edwin/hola.fasta', 'r');
echo ">hola.fasta\n";
while ( $line = fgets($f) ) {
if ( $line[0] == '>') continue;
if ( empty(trim($line)) ) continue;
echo trim($line);