1 |
It
cannot
because
that
information
is
not
stored
in
memory
and
storing
it
in
memory
could
eventually
consume
a
[b]ton[/b]
of
memory.
You'd
have
to
store
the
coordinates
of
the
ping
and
who
wrote
it.
This
means
you'd
have
a
table
entry
on
every
ping,
which
hashing
tables
is
already
pretty
slow.
You'd
be
looking
at
around
100kb
or
so
of
memory
per
label.
Erasing
labels
would
also
mean
knowing
when
a
point
is
erased
(
which
has
no
callin
currently)
and
that
would
mean
shifting
the
table,
which
would
be
rather
slow
for
large
table
sizes.
In
addition,
this
would
open
up
a
new
avenue
of
griefing
games
via
deliberately
spamming
tons
of
labels
over
a
long
period
of
time.
|
1 |
It
cannot
because
that
information
is
not
stored
in
memory
and
storing
it
in
memory
could
eventually
consume
a
[b]ton[/b]
of
memory.
You'd
have
to
store
the
coordinates
of
the
ping
and
who
wrote
it.
This
means
you'd
have
a
table
entry
on
every
ping,
which
hashing
tables
is
already
pretty
slow.
You'd
be
looking
at
around
20-100kb
or
so
of
memory
per
label
which
adds
up
fast
(
consider
all
the
no
label
pings
people
like
to
spam)
.
Erasing
labels
would
also
mean
knowing
when
a
point
is
erased
(
which
has
no
callin
currently)
and
that
would
mean
shifting
the
table,
which
would
be
rather
slow
for
large
table
sizes.
In
addition,
this
would
open
up
a
new
avenue
of
griefing
games
via
deliberately
spamming
tons
of
labels
over
a
long
period
of
time.
|