Różnice między wybraną wersją a wersją aktualną.
| — |
pl:prolog:pllib:binary_dictionary [2019/06/27 15:50] (aktualna) |
||
|---|---|---|---|
| Linia 1: | Linia 1: | ||
| + | ====== Binary dictionary ====== | ||
| + | {{tag>trees}} | ||
| + | ===== Description ===== | ||
| + | Dictionary lookup in a binary tree | ||
| + | |||
| + | **Source**: The Art of Prolog | ||
| + | ===== Download ===== | ||
| + | Program source code: {{binary_dictionary.pl}} | ||
| + | ===== Listing ===== | ||
| + | <code prolog> | ||
| + | /* | ||
| + | lookup(Key,Dictionary,Value) :- | ||
| + | Dictionary contains the value indexed under Key. | ||
| + | Dictionary is represented as an ordered binary tree. | ||
| + | |||
| + | */ | ||
| + | |||
| + | lookup(Key,dict(Key,X,Left,Right),Value) :- | ||
| + | !, X = Value. | ||
| + | lookup(Key,dict(Key1,X,Left,Right),Value) :- | ||
| + | Key < Key1 , lookup(Key,Left,Value). | ||
| + | lookup(Key,dict(Key1,X,Left,Right),Value) :- | ||
| + | Key > Key1, lookup(Key,Right,Value). | ||
| + | |||
| + | % Program 15.9: Dictionary lookup in a binary tree | ||
| + | </code> | ||
| + | ===== Comments ===== | ||
