# it is obv. not necessary to install bliss or nauty system-wide (compiling polymake against them didn't work in my tests)
emerge -av dev-libs/stb dev-perl/App-perlbrew sci-libs/{cddlib,lrslib,soplex} sci-mathematics/{flint,normaliz,singular}
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
const ostag = @import("builtin").os.tag; | |
const std = @import("std"); | |
const testing = std.testing; | |
const Allocator = std.mem.Allocator; | |
fn findExt(name: []const u8) usize { | |
var start: usize = 0; | |
// search for last segment after "." | |
while (std.mem.indexOfPos(u8, name, start, ".")) |delim_start| { | |
start = delim_start + 1; |
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
#!/usr/bin/env python3 | |
import html.parser | |
import requests | |
known = ["/", "/faq.html", "//alternativlos.org/", "impressum.html"] | |
class OnlyLinks(html.parser.HTMLParser): | |
def handle_starttag(self, tag, attrs): | |
if tag == 'li': |
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
interface HiProfunctor (0 p : (0 xt : Type) -> (xt -> Type) -> Type) where | |
dimap : (a, b : Type) -> (c : b -> Type) -> (d : (a -> Type)) | |
-> (ab : (a -> b)) -> ((y : a) -> c (ab y) -> d y) | |
-> p b c -> p a d | |
data DepFun : (0 xt : Type) -> (xt -> Type) -> Type where | |
DF : (0 xt : Type) -> (yt : xt -> Type) -> ((x : xt) -> yt x) -> DepFun xt yt | |
HiProfunctor DepFun where | |
dimap a b c d ab acd (DF _ _ bc) = DF a d (\av : a => acd av (bc (ab av))) |
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
//! Abstract Syntax Tree for yanais source code | |
const std = @import("std"); | |
const assert = std.debug.assert; | |
const testing = std.testing; | |
const Allocator = std.mem.Allocator; | |
nodes: NodeList.Slice, | |
extra_data: []const u8, |
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
(* | |
what language features do we want? | |
* free tagged unions | |
* dependent types | |
*) | |
mod Example { | |
pub tag True; |
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
const std = @import("std"); | |
const Allocator = std.mem.Allocator; | |
pub fn BasicBlock(comptime Stmt: type, comptime Cond: type) type { | |
return struct { | |
// entry points | |
labels: std.ArrayList([]const u8), | |
entp_cnt: usize, | |
// exit points |
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
{ buildPythonPackage | |
, lib | |
, pytestCheckHook | |
, runCommandNoCC | |
, xorg | |
}: | |
pvl: | |
let |
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
let nixOp = nixBlti.nixOp; | |
let nixBltiRT = nixBlti.initRtDep(nixRt); | |
let nixInScope = nixBlti.mkScopeWith(); | |
return async (nixBound) => { | |
nixBound = await nixBound; | |
let nix__lib = nixOp._lambdaA2chk(nixBound, "lib"); | |
return (async (nixInScope) => | |
(async (nixInScope) => | |
(async (nixInScope) => | |
nixBlti.PLazy.from(async () => { |
If we want to distribute a build across several build nodes, and want to avoid a "single point of failure", what needs to be considered?
- distribute the build across several build nodes, because some packages take extremely long to build
NewerOlder