class of finite structures	Fraïssé limit	ACP	FLP	FLP/0
sets	(ℕ, =)	✅	✅	✅
total orders	(ℚ, ≤)	✅	✅	✅
partial orders	(ℙ, ⊑)
equivalence relations	(⨆∞ K∞, E)	✅	✅	✅
graphs	(Rado graph, E)	✅	✅	✅
△-free graphs	(Henson graph, E)	✅	✅	✅
ordered graphs	(ordered Rado graph, ≤, E)	✅	✅	✅
tournaments	(…, →)	✅	✅	✅
3-hypergraphs	(…, E3)		🤔
𓉴-free 3-hypergraphs	(…, E3)
meet-trees	(𝕋, ∧, ≤)	✅
vector spaces over F2	F2 ⊕ F2 ⊕ F2 ⊕ F2 ⊕ ⋯	✅	❌ over F2	✅
symplectic spaces over F2	(F2 ⊕ F2) ⊕ (F2 ⊕ F2) ⊕ ⋯		❌ over F2	✅
Boolean algebras	clopens of 2ℕ		❌ over F2
free amalgamation class, over a binary vocabulary, expanded with all total orders		✅	<= ✅ =>	✅
	ω-well structured & ordered or: AZ enumerations of $\text{𝔸}^d$	✅
	oligomorphically approximated e.g. smoothly approximated			✅