KGS/Game/Tree.pm

package KGS::Game::Tree;

use KGS::Constants;

# _should_ be unified, but the two types are slightly different
# (this really looks like a grown, as opposed to designed, protocol)
# despite the claim of "innovation" etc...
my %marker_type = (
   triangle => MARK_TRIANGLE,
   square   => MARK_SQUARE,
   circle   => MARK_CIRCLE,
   small_b  => MARK_SMALL_B,
   small_w  => MARK_SMALL_W,
);

# exclusion masks... the bit on the left excludes (removes) the ones on the right
my %exclude_type = (
   &MARK_TRIANGLE => MARK_SQUARE | MARK_TRIANGLE | MARK_CIRCLE | MARK_LABEL,
   &MARK_SQUARE   => MARK_SQUARE | MARK_TRIANGLE | MARK_CIRCLE | MARK_LABEL,
   &MARK_CIRCLE   => MARK_SQUARE | MARK_TRIANGLE | MARK_CIRCLE | MARK_LABEL,
   &MARK_LABEL    => MARK_SQUARE | MARK_TRIANGLE | MARK_CIRCLE | MARK_LABEL,
   &MARK_SMALL_B  => MARK_SMALL_B | MARK_SMALL_W | MARK_B | MARK_W | MARK_MOVE,
   &MARK_SMALL_W  => MARK_SMALL_B | MARK_SMALL_W | MARK_B | MARK_W | MARK_MOVE,
   &MARK_GRAY_B   =>                               MARK_B | MARK_W | MARK_MOVE | MARK_GRAY_B | MARK_GRAY_W,
   &MARK_GRAY_W   =>                               MARK_B | MARK_W | MARK_MOVE | MARK_GRAY_B | MARK_GRAY_W,
   &MARK_B        => MARK_SMALL_B | MARK_SMALL_W | MARK_B | MARK_W | MARK_MOVE | MARK_GRAY_B | MARK_GRAY_W,
   &MARK_W        => MARK_SMALL_B | MARK_SMALL_W | MARK_B | MARK_W | MARK_MOVE | MARK_GRAY_B | MARK_GRAY_W,
);

sub init_tree {
   my ($self) = @_;
   $self->{tree} = [ {
      id   => 0,
      move => 0,
   } ];
}

sub update_tree {
   my ($self, $tree) = @_;

   my $node = $self->{curnode};

   my $up_tree;
   my $up_move;

   for (@$tree)  {
      my ($type, @arg) = @$_;
      if ($type eq "add_child") {
         $up_tree = 1;
         $node = $self->{tree}[$arg[0] + 1]
            or die "FATAL: referencing nonexistent node $arg[0]+1!";

         my $new = {
            id     => scalar @{$self->{tree}},
            parent => $node->{id},
            move   => $node->{move} + 1,
         };

         push @{$self->{tree}}, $new;
         push @{$node->{children}}, $new->{id};

         $node = $new;

      } elsif (my $bit = $marker_type{$type}) {
         $up_tree = 1;
         my $ref = $node->{"$arg[1],$arg[2]"} ||= [];

         $ref->[0] &= ~$exclude_type{$bit};
         $ref->[0] |= $bit if $arg[0] != 2;
         $ref->[1] |= $exclude_type{$bit};

      } elsif ($type eq "label") {
         $up_tree = 1;
         my $ref = $node->{"$arg[1],$arg[2]"} ||= [];

         $ref->[0] &= ~$exclude_type{&MARK_LABEL};
         undef $ref->[2];

         if (length $arg[0]) {
            $ref->[0] |= MARK_LABEL;
            $ref->[1] |= $exclude_type{&MARK_LABEL};
            $ref->[2] = $arg[0];
         }

      } elsif ($type eq "move" or $type eq "addstone" or $type eq "gray") {
         $up_tree = 1;

         if ($arg[1] < 255) {
            my $ref = $node->{"$arg[1],$arg[2]"} ||= [];

            my $bit = $arg[0] == 0 ? $bit | ($type eq "gray" ? MARK_GRAY_B : MARK_B)
                    : $arg[0] == 1 ? $bit | ($type eq "gray" ? MARK_GRAY_W : MARK_W)
                                   : 0;

            $ref->[0] &= ~$exclude_type{$bit};
            $ref->[0] |= $bit | ($type eq "move" ? MARK_MOVE : 0);
            $ref->[1] |= $exclude_type{$bit};

            $up_move = 0 if $self->{loaded} & $type eq "move";
         } else {
            warn "PLEASE REPORT: pass coordinates but type is $type" if $type ne "move";#d#

            $node->{pass} = 1;

            $up_move = 1 if $self->{loaded};
         }

      } elsif ($type eq "comment") {
         $self->event_update_comments ($node, $arg[0], !exists $node->{comment});

         $node->{comment} .= $arg[0];

      } elsif ($type eq "player") {
         $node->{player}[$arg[0]] = $arg[1];

      } elsif ($type eq "rank") {
         $node->{rank}[$arg[0]] = $arg[1];

      } elsif ($type eq "set_timer") {
         $node->{timer}[$arg[0]] = [$arg[1], $arg[2]];

      } elsif ($type eq "more") {
         # server probably exceeded some packet size => request more moves
         # why this is not automatic escapes me, but there could be a very
         # good reason for this (bandwidth problems?)
         $self->{more} = 1;
         $self->msg(get_tree => channel => $self->{channel}, node => @{$self->{tree}} - 1);

      } elsif ($type eq "done") {
         $self->{loaded} = 1;
         # nop

      } else {
         $node->{$type} = $arg[0]; # rules, date etc..
      }
   }

   $self->event_update_tree if $up_tree;
   $self->event_move ($up_move) if defined $up_move;

   $self->{curnode} = $node;
}

sub get_path {
   my ($self) = @_;

   my @nodes;

   my $node = $self->{curnode};

   for(;;) {
      push @nodes, $node;
      last unless $node->{parent};
      $node = $self->{tree}[$node->{parent}];
   }

   [reverse @nodes];
}

sub set_node {
   my ($self, $node) = @_;

   $self->{curnode} = $self->{tree}[$node + 1]
      or die "set_node to undefined tree node $node+1";
}

sub event_move            { }
sub event_update_tree     { }
sub event_update_comments { }

1;

Revision:	1.12
Committed:	Mon Jun 2 12:44:54 2003 UTC (23 years, 4 months ago) by pcg
Branch:	MAIN
Changes since 1.11:	+13 -2 lines
Log Message:	* empty log message *
#	User	Rev	Content
1	pcg	1.1	package KGS::Game::Tree;
2
3			use KGS::Constants;
4
5			# _should_ be unified, but the two types are slightly different
6			# (this really looks like a grown, as opposed to designed, protocol)
7	pcg	1.6	# despite the claim of "innovation" etc...
8	pcg	1.1	my %marker_type = (
9			triangle => MARK_TRIANGLE,
10			square => MARK_SQUARE,
11			circle => MARK_CIRCLE,
12			small_b => MARK_SMALL_B,
13			small_w => MARK_SMALL_W,
14			);
15
16			# exclusion masks... the bit on the left excludes (removes) the ones on the right
17			my %exclude_type = (
18			&MARK_TRIANGLE => MARK_SQUARE \| MARK_TRIANGLE \| MARK_CIRCLE \| MARK_LABEL,
19			&MARK_SQUARE => MARK_SQUARE \| MARK_TRIANGLE \| MARK_CIRCLE \| MARK_LABEL,
20			&MARK_CIRCLE => MARK_SQUARE \| MARK_TRIANGLE \| MARK_CIRCLE \| MARK_LABEL,
21			&MARK_LABEL => MARK_SQUARE \| MARK_TRIANGLE \| MARK_CIRCLE \| MARK_LABEL,
22			&MARK_SMALL_B => MARK_SMALL_B \| MARK_SMALL_W \| MARK_B \| MARK_W \| MARK_MOVE,
23			&MARK_SMALL_W => MARK_SMALL_B \| MARK_SMALL_W \| MARK_B \| MARK_W \| MARK_MOVE,
24	pcg	1.3	&MARK_GRAY_B => MARK_B \| MARK_W \| MARK_MOVE \| MARK_GRAY_B \| MARK_GRAY_W,
25			&MARK_GRAY_W => MARK_B \| MARK_W \| MARK_MOVE \| MARK_GRAY_B \| MARK_GRAY_W,
26			&MARK_B => MARK_SMALL_B \| MARK_SMALL_W \| MARK_B \| MARK_W \| MARK_MOVE \| MARK_GRAY_B \| MARK_GRAY_W,
27			&MARK_W => MARK_SMALL_B \| MARK_SMALL_W \| MARK_B \| MARK_W \| MARK_MOVE \| MARK_GRAY_B \| MARK_GRAY_W,
28	pcg	1.1	);
29
30			sub init_tree {
31			my ($self) = @_;
32	pcg	1.11	$self->{tree} = [ {
33			id => 0,
34			move => 0,
35			} ];
36	pcg	1.1	}
37
38			sub update_tree {
39	pcg	1.10	my ($self, $tree) = @_;
40	pcg	1.1
41			my $node = $self->{curnode};
42
43	pcg	1.12	my $up_tree;
44			my $up_move;
45
46	pcg	1.1	for (@$tree) {
47			my ($type, @arg) = @$_;
48			if ($type eq "add_child") {
49	pcg	1.12	$up_tree = 1;
50	pcg	1.1	$node = $self->{tree}[$arg[0] + 1]
51	pcg	1.3	or die "FATAL: referencing nonexistent node $arg[0]+1!";
52	pcg	1.1
53	pcg	1.11	my $new = {
54			id => scalar @{$self->{tree}},
55			parent => $node->{id},
56			move => $node->{move} + 1,
57			};
58	pcg	1.1
59			push @{$self->{tree}}, $new;
60			push @{$node->{children}}, $new->{id};
61
62			$node = $new;
63
64			} elsif (my $bit = $marker_type{$type}) {
65	pcg	1.12	$up_tree = 1;
66	pcg	1.4	my $ref = $node->{"$arg[1],$arg[2]"} \|\|= [];
67	pcg	1.1
68	pcg	1.4	$ref->[0] &= ~$exclude_type{$bit};
69			$ref->[0] \|= $bit if $arg[0] != 2;
70			$ref->[1] \|= $exclude_type{$bit};
71	pcg	1.1
72			} elsif ($type eq "label") {
73	pcg	1.12	$up_tree = 1;
74	pcg	1.4	my $ref = $node->{"$arg[1],$arg[2]"} \|\|= [];
75	pcg	1.1
76	pcg	1.4	$ref->[0] &= ~$exclude_type{&MARK_LABEL};
77			undef $ref->[2];
78	pcg	1.1
79			if (length $arg[0]) {
80	pcg	1.4	$ref->[0] \|= MARK_LABEL;
81			$ref->[1] \|= $exclude_type{&MARK_LABEL};
82			$ref->[2] = $arg[0];
83	pcg	1.1	}
84
85	pcg	1.3	} elsif ($type eq "move" or $type eq "addstone" or $type eq "gray") {
86	pcg	1.12	$up_tree = 1;
87
88	pcg	1.7	if ($arg[1] < 255) {
89			my $ref = $node->{"$arg[1],$arg[2]"} \|\|= [];
90	pcg	1.4
91	pcg	1.7	my $bit = $arg[0] == 0 ? $bit \| ($type eq "gray" ? MARK_GRAY_B : MARK_B)
92			: $arg[0] == 1 ? $bit \| ($type eq "gray" ? MARK_GRAY_W : MARK_W)
93			: 0;
94	pcg	1.3
95	pcg	1.7	$ref->[0] &= ~$exclude_type{$bit};
96			$ref->[0] \|= $bit \| ($type eq "move" ? MARK_MOVE : 0);
97			$ref->[1] \|= $exclude_type{$bit};
98	pcg	1.1
99	pcg	1.12	$up_move = 0 if $self->{loaded} & $type eq "move";
100	pcg	1.7	} else {
101	pcg	1.10	warn "PLEASE REPORT: pass coordinates but type is $type" if $type ne "move";#d#
102	pcg	1.7
103			$node->{pass} = 1;
104
105	pcg	1.12	$up_move = 1 if $self->{loaded};
106	pcg	1.7	}
107	pcg	1.6
108	pcg	1.1	} elsif ($type eq "comment") {
109	pcg	1.11	$self->event_update_comments ($node, $arg[0], !exists $node->{comment});
110
111	pcg	1.3	$node->{comment} .= $arg[0];
112
113			} elsif ($type eq "player") {
114			$node->{player}[$arg[0]] = $arg[1];
115	pcg	1.1
116	pcg	1.9	} elsif ($type eq "rank") {
117			$node->{rank}[$arg[0]] = $arg[1];
118
119	pcg	1.8	} elsif ($type eq "set_timer") {
120	pcg	1.10	$node->{timer}[$arg[0]] = [$arg[1], $arg[2]];
121	pcg	1.3
122			} elsif ($type eq "more") {
123	pcg	1.11	# server probably exceeded some packet size => request more moves
124			# why this is not automatic escapes me, but there could be a very
125			# good reason for this (bandwidth problems?)
126	pcg	1.3	$self->{more} = 1;
127			$self->msg(get_tree => channel => $self->{channel}, node => @{$self->{tree}} - 1);
128
129			} elsif ($type eq "done") {
130			$self->{loaded} = 1;
131			# nop
132	pcg	1.2
133	pcg	1.1	} else {
134	pcg	1.9	$node->{$type} = $arg[0]; # rules, date etc..
135	pcg	1.1	}
136			}
137	pcg	1.12
138			$self->event_update_tree if $up_tree;
139			$self->event_move ($up_move) if defined $up_move;
140	pcg	1.1
141			$self->{curnode} = $node;
142			}
143
144			sub get_path {
145			my ($self) = @_;
146
147			my @nodes;
148
149			my $node = $self->{curnode};
150
151			for(;;) {
152			push @nodes, $node;
153			last unless $node->{parent};
154			$node = $self->{tree}[$node->{parent}];
155			}
156
157			[reverse @nodes];
158			}
159
160			sub set_node {
161			my ($self, $node) = @_;
162
163			$self->{curnode} = $self->{tree}[$node + 1]
164			or die "set_node to undefined tree node $node+1";
165			}
166
167	pcg	1.11	sub event_move { }
168			sub event_update_tree { }
169			sub event_update_comments { }
170	pcg	1.5
171	pcg	1.1	1;
172