diff options
| author | Mattias Andrée <maandree@operamail.com> | 2014-01-24 18:34:46 +0100 |
|---|---|---|
| committer | Mattias Andrée <maandree@operamail.com> | 2014-01-24 18:34:46 +0100 |
| commit | 8917515cd721c7d8385641bcbfeefb49846577c1 (patch) | |
| tree | c733cff97ded9d4a3ac198e406c3e64c5b8f7da7 /src/datastructures | |
| parent | code reduction (diff) | |
| download | algorithms-and-data-structures-8917515cd721c7d8385641bcbfeefb49846577c1.tar.gz algorithms-and-data-structures-8917515cd721c7d8385641bcbfeefb49846577c1.tar.bz2 algorithms-and-data-structures-8917515cd721c7d8385641bcbfeefb49846577c1.tar.xz | |
typo
Signed-off-by: Mattias Andrée <maandree@operamail.com>
Diffstat (limited to '')
| -rw-r--r-- | src/datastructures/linkedlists/template | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/datastructures/linkedlists/template b/src/datastructures/linkedlists/template index 2be7d1e..48f642a 100644 --- a/src/datastructures/linkedlists/template +++ b/src/datastructures/linkedlists/template @@ -230,7 +230,7 @@ public class £{name}<T> */ { £>new node null - this.edge = mode; + this.edge = node; £>if (( with_xor )); then £(xor this.edge) = £{mirror}; £>else |