Łukasz Jan Niemier hauleth
⌨️
hauleth
/ fizzbuzz.erl
Last active
April 8, 2024 16:02
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
| -module(fizzbuzz). | |
| -export([main/0]). | |
| main() -> | |
| Types = [ | |
| {3, "Fizz"}, | |
| {5, "Buzz"} | |
| ], | |
| io:put_chars(run(100, Types)). |
hauleth
/ flake.lock
Last active
March 1, 2024 09:32
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
| { | |
| "nodes": { | |
| "devenv": { | |
| "inputs": { | |
| "flake-compat": "flake-compat", | |
| "nix": "nix", | |
| "nixpkgs": [ | |
| "nixpkgs" | |
| ], | |
| "poetry2nix": "poetry2nix", |
hauleth
/ clean_url.ex
Created
February 22, 2024 16:04
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
| defmodule Langusta.Site.CleanURL do | |
| defmodule Entry do | |
| defstruct [ | |
| :url_pattern, | |
| rules: [], | |
| raw_rules: [], | |
| exceptions: [], | |
| redirections: [] | |
| ] |
hauleth
/ mail-server.nix
Last active
January 17, 2024 14:57
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
| {config, pkgs, ...}: let | |
| domain = "hauleth.dev"; | |
| mail-domain = "mail.${domain}"; | |
| sieve-data = let | |
| stalwart-mail = config.services.stalwart-mail.package; | |
| in pkgs.stdenvNoCC.mkDerivation { | |
| pname = "stalwart-mail-sieve-data"; | |
| inherit (stalwart-mail) version src; | |
| dontBuild = true; |
hauleth
/ flake.lock
Created
January 12, 2024 14:38
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
| { | |
| "nodes": { | |
| "flake-utils": { | |
| "inputs": { | |
| "systems": "systems" | |
| }, | |
| "locked": { | |
| "lastModified": 1694529238, | |
| "narHash": "sha256-zsNZZGTGnMOf9YpHKJqMSsa0dXbfmxeoJ7xHlrt+xmY=", | |
| "owner": "numtide", |
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 Type = std.builtin.Type; | |
| pub fn Templates(comptime entries: anytype) type { | |
| const type_info = @typeInfo(@TypeOf(entries)).Struct; | |
| var enum_fields: [type_info.fields.len]Type.EnumField = undefined; | |
| for (type_info.fields, 0..) |field, idx| { |
hauleth
/ mix_man.ex
Created
November 11, 2023 00:36
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
| defmodule Mix.Tasks.Man do | |
| @moduledoc """ | |
| Print documentation for given Elixir term. | |
| """ | |
| @shortdoc "Show manual for term" | |
| use Mix.Task | |
| require IEx.Helpers |
hauleth
/ flake.lock
Created
February 16, 2023 10:53
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
| { | |
| "nodes": { | |
| "devenv": { | |
| "inputs": { | |
| "flake-compat": "flake-compat", | |
| "nix": "nix", | |
| "nixpkgs": "nixpkgs", | |
| "pre-commit-hooks": "pre-commit-hooks" | |
| }, | |
| "locked": { |
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
| all: test |
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
| defmodule BellmanFord2 do | |
| @moduledoc """ | |
| The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single | |
| source vertex to all of the other vertices in a weighted digraph. | |
| It is capable of handling graphs in which some of the edge weights are negative numbers | |
| Time complexity: O(VLogV) | |
| """ | |
| @type distance :: %{Graph.vertex_id() => integer} |
NewerOlder