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};

   for (@$tree)  {
      my ($type, @arg) = @$_;
      if ($type eq "add_child") {
         $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}) {
         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") {
         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") {
         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};

            $self->event_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;

            $self->event_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->{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.11
Committed:	Sun Jun 1 16:51:39 2003 UTC (23 years, 5 months ago) by pcg
Branch:	MAIN
Changes since 1.10:	+17 -4 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			for (@$tree) {
44			my ($type, @arg) = @$_;
45			if ($type eq "add_child") {
46			$node = $self->{tree}[$arg[0] + 1]
47	pcg	1.3	or die "FATAL: referencing nonexistent node $arg[0]+1!";
48	pcg	1.1
49	pcg	1.11	my $new = {
50			id => scalar @{$self->{tree}},
51			parent => $node->{id},
52			move => $node->{move} + 1,
53			};
54	pcg	1.1
55			push @{$self->{tree}}, $new;
56			push @{$node->{children}}, $new->{id};
57
58			$node = $new;
59
60			} elsif (my $bit = $marker_type{$type}) {
61	pcg	1.4	my $ref = $node->{"$arg[1],$arg[2]"} \|\|= [];
62	pcg	1.1
63	pcg	1.4	$ref->[0] &= ~$exclude_type{$bit};
64			$ref->[0] \|= $bit if $arg[0] != 2;
65			$ref->[1] \|= $exclude_type{$bit};
66	pcg	1.1
67			} elsif ($type eq "label") {
68	pcg	1.4	my $ref = $node->{"$arg[1],$arg[2]"} \|\|= [];
69	pcg	1.1
70	pcg	1.4	$ref->[0] &= ~$exclude_type{&MARK_LABEL};
71			undef $ref->[2];
72	pcg	1.1
73			if (length $arg[0]) {
74	pcg	1.4	$ref->[0] \|= MARK_LABEL;
75			$ref->[1] \|= $exclude_type{&MARK_LABEL};
76			$ref->[2] = $arg[0];
77	pcg	1.1	}
78
79	pcg	1.3	} elsif ($type eq "move" or $type eq "addstone" or $type eq "gray") {
80	pcg	1.7	if ($arg[1] < 255) {
81			my $ref = $node->{"$arg[1],$arg[2]"} \|\|= [];
82	pcg	1.4
83	pcg	1.7	my $bit = $arg[0] == 0 ? $bit \| ($type eq "gray" ? MARK_GRAY_B : MARK_B)
84			: $arg[0] == 1 ? $bit \| ($type eq "gray" ? MARK_GRAY_W : MARK_W)
85			: 0;
86	pcg	1.3
87	pcg	1.7	$ref->[0] &= ~$exclude_type{$bit};
88			$ref->[0] \|= $bit \| ($type eq "move" ? MARK_MOVE : 0);
89			$ref->[1] \|= $exclude_type{$bit};
90	pcg	1.1
91	pcg	1.7	$self->event_move (0) if $self->{loaded} & $type eq "move";
92			} else {
93	pcg	1.10	warn "PLEASE REPORT: pass coordinates but type is $type" if $type ne "move";#d#
94	pcg	1.7
95			$node->{pass} = 1;
96
97			$self->event_move (1) if $self->{loaded};
98			}
99	pcg	1.6
100	pcg	1.1	} elsif ($type eq "comment") {
101	pcg	1.11	$self->event_update_comments ($node, $arg[0], !exists $node->{comment});
102
103	pcg	1.3	$node->{comment} .= $arg[0];
104
105			} elsif ($type eq "player") {
106			$node->{player}[$arg[0]] = $arg[1];
107	pcg	1.1
108	pcg	1.9	} elsif ($type eq "rank") {
109			$node->{rank}[$arg[0]] = $arg[1];
110
111	pcg	1.8	} elsif ($type eq "set_timer") {
112	pcg	1.10	$node->{timer}[$arg[0]] = [$arg[1], $arg[2]];
113	pcg	1.3
114			} elsif ($type eq "more") {
115	pcg	1.11	# server probably exceeded some packet size => request more moves
116			# why this is not automatic escapes me, but there could be a very
117			# good reason for this (bandwidth problems?)
118	pcg	1.3	$self->{more} = 1;
119			$self->msg(get_tree => channel => $self->{channel}, node => @{$self->{tree}} - 1);
120
121			} elsif ($type eq "done") {
122			$self->{loaded} = 1;
123			# nop
124	pcg	1.2
125	pcg	1.1	} else {
126	pcg	1.9	$node->{$type} = $arg[0]; # rules, date etc..
127	pcg	1.1	}
128			}
129
130			$self->{curnode} = $node;
131			}
132
133			sub get_path {
134			my ($self) = @_;
135
136			my @nodes;
137
138			my $node = $self->{curnode};
139
140			for(;;) {
141			push @nodes, $node;
142			last unless $node->{parent};
143			$node = $self->{tree}[$node->{parent}];
144			}
145
146			[reverse @nodes];
147			}
148
149			sub set_node {
150			my ($self, $node) = @_;
151
152			$self->{curnode} = $self->{tree}[$node + 1]
153			or die "set_node to undefined tree node $node+1";
154			}
155
156	pcg	1.11	sub event_move { }
157			sub event_update_tree { }
158			sub event_update_comments { }
159	pcg	1.5
160	pcg	1.1	1;
161