Files
ent/examples/o2orecur
Ariel Mashraki 939c7cff1a entc/gen: reduce the usage of DISTINCT in queries (#3305)
Most queries are not graph traversals but rather regular table scans,
in which case the DISTINCT clause is not needed as duplicates cannot be
returned (unless query was modified by the user).
2023-02-06 22:40:50 +02:00
..
2019-12-09 09:05:05 +02:00

Linked-List O2O Relation Example

An example for a O2O recursive relation between linked-list nodes.
Each node in the list can have only of next. If a node A points (using next) to a node B, B can get its pointer using prev.

Generate Assets

go generate ./...

Run Example

go test