| # 1. Comprehensions: add one to each item | |
| xs_input = [1, 2, 3] | |
| xs_output = for x <- xs_input, into: [], do: x + 1 | |
| # => [2, 3, 4] | |
| # 1. Map: add one to each item | |
| xs_input = [1, 2, 3] | |
| xs_output = Enum.map(xs_input, & &1 + 1) | |
| # => [2, 3, 4] |
| SD = argo_graphql_service_document:from_string( | |
| "type Query {\n" | |
| " hero: Character\n" | |
| "}\n" | |
| "interface Character { id: ID! }\n" | |
| "type Droid implements Character {\n" | |
| " id: ID!\n" | |
| " properties: DroidProperties!\n" | |
| "}\n" | |
| "type DroidProperties {\n" |
| % Setup | |
| tab = ets:new(tab, [set, named_table, public]), | |
| true = ets:insert(tab, {foo, 0}). | |
| % Slow: O(N) operation | |
| Key = foo, | |
| Threshold = 100, | |
| NewVal = 101, | |
| MatchSpec = ets:fun2ms(fun({K, V}) | |
| when K =:= Key |
| rebar3 proper --module=prop_find_broken_maps --numtests 10000 --max_shrinks 250 --constraint_tries 1000 --start_size 33 | |
| ===> Verifying dependencies... | |
| make: Nothing to be done for `all'. | |
| ===> Analyzing applications... | |
| ===> Compiling erldist_filter | |
| =ERROR REPORT==== 14-Oct-2022::14:59:33.585605 === | |
| Module rebar3_proper_prv must be purged before deleting | |
| ===> Testing prop_find_broken_maps:prop_find_broken_maps() |
| .PHONY: all clean watch | |
| CURDIR := $(shell pwd) | |
| BASEDIR := $(abspath $(CURDIR)) | |
| SRCDIR := $(abspath $(BASEDIR)/src/) | |
| core_find = $(if $(wildcard $1),$(shell find $(1:%/=%) -type f -name $(subst *,\*,$2))) | |
| SOURCE_MMD := $(sort $(foreach pat,*.mmd,$(call core_find,$(SRCDIR)/,$(pat)))) | |
| OUTPUT_MMD_SVG = $(addsuffix .svg, $(basename $(SOURCE_MMD))) |
I have Erlang/OTP cloned into ~/local/otp and I have my PATH setup with ~/local/otp-install/bin at the front, so I can quickly test out full installs locally.
You can change the INTERESTING_TARGETS variable to point to whatever other flavors you're interested in building.
You may need to set ERL_TOP to pwd:
| #include <inttypes.h> | |
| #include <stdint.h> | |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <string.h> | |
| #include <unistd.h> | |
| int | |
| main(void) | |
| { |
| -module(dsu). | |
| -export([ | |
| new/0, | |
| find/2, | |
| insert/2, | |
| union/3, | |
| groups/1 | |
| ]). |
| -module(ed25519ph). | |
| -export([start/0]). | |
| -export([ | |
| prehash/1, | |
| prehash_init/0, | |
| prehash_update/2, | |
| prehash_final/1, | |
| sign/3, |
| N = 8000, | |
| Terms = [{{a, list_to_atom(integer_to_list(I))}, I} || I <- lists:seq(1, N)], | |
| Add = fun Add([]) -> ok; Add([{K, V} | T]) -> persistent_term:put(K, V), Add(T) end, | |
| Len = fun() -> length(persistent_term:get()) end, | |
| Random = fun() -> PTerms = [{X, Y} || {{a, X}, Y} <- persistent_term:get()], lists:nth(rand:uniform(length(PTerms)), PTerms) end, | |
| DelRandom = fun() -> Key = element(1, Random()), persistent_term:erase({a, Key}), Key end, | |
| EraserFun = fun() -> Eraser = fun Eraser() -> receive _ -> Eraser() after 1 -> DelRandom(), Eraser() end end, Eraser() end, | |
| WriterFun = fun() -> Writer = fun Writer() -> receive _ -> Writer() after 1 -> Add(Terms), Writer() end end, Writer() end, | |
| ReportFun = fun() -> Report = fun Report() -> io:format("there are ~w persistent terms~n", [Len()]), receive _ -> Report() after 1000 -> Report() end end, Report() end, | |
| Add(Terms), |