pczarn

stable-vec-0.3.2/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
paillier-0.2.0/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
contest-algorithms-0.1.2/README.md:- [Basic graph representations](src/graph/mod.rs): adjacency lists, minimum spanning tree, Euler path, disjoint set union 
gdpr_consent-0.4.0/LICENSE-APACHE:      "Legal Entity" shall mean the union of the acting entity and all
partitions-0.2.4/LICENSE.txt:"Legal Entity" shall mean the union of the acting entity and all
partitions-0.2.4/Cargo.toml:description = "A disjoint-sets/union-find implementation that allows for efficient iteration over elements of a set."
partitions-0.2.4/Cargo.toml:keywords = ["union-find", "disjoint-sets"]
bitarray-set-0.4.1/LICENSE-APACHE:   "Legal Entity" shall mean the union of the acting entity and all
partitions-0.2.4/README.md:A [disjoint-sets/union-find] implementation of a vector partitioned in sets that
partitions-0.2.4/README.md:[`union`] metho

pczarn

clang -Wall -fPIC -c ctest1.c ctest2.c
clang -shared -Wl,-soname,libctest.so.1.0 -o libctest.so.1.0 *.o
clang -fPIC prog.c -Wl,-rpath,. libctest.so.1.0 -o prog1
./prog1 > result1
clang prog.c ctest*.c -o prog2
./prog2 > result2

pczarn

use crate::Response;

use nom::IResult;
use nom::character::complete::{char, anychar};
use nom::bytes::complete::take;
use nom::bytes::complete::take_until;
use nom::bytes::complete::take_till;
use nom::multi::many_till;
use nom::combinator::eof;
use nom::sequence::pair;

pczarn

/target
callgrind.out.*