Mercurial > pidgin
view src/mediastreamer/mscopy.h @ 12360:3153661f4d5c
[gaim-migrate @ 14664]
Faceprint is concerned about 2 things:
1)some of the random colors are very close together.
as best we can tell, there are two ways to fix this
1a) for each proposed color, iterate the entire list of selected
colors, looking to ensure that it is not too close to any of them.
this is an O(n^2) operation, with n >= 220 (the current number of
colors we look for)
1b) iterate the entire set of possible colors, skipping ahead by some
guess (rather than iterating by 1). this is an O(n^3) operation,
where n is 65535/(whatever we skip ahead by). This is not only a
more expensive operation, but because of the nature of the color
list, it is not _necessarily_ going to yield more predictable
results, skipping ahead 5 (or any other number) does not necessarily
guarantee that you've skipped 5 very similar colors.
2) as you can see, either solution to #1 is potentially a resource hog.
#1a is a random delay, #1b is inherently expensive. How often #1a will
exceed the bound #1b, if ever, is unknown.
rather than doing either of these, we settled on a middle course: a .h
file has been created containing a set of colors. currently the set we
were previously hard coded to. Gaim will search that list for usable
colors and start randomly looking only if that list does not contain
sufficient usable colors. ideally this list would be generated to have
colors that are known to be a "safe" distance appart, that is colors that
you can tell appart. and Ideally it would have a (small) multiple of the
number of colors we are searching for. This should ensure that IF we go
to randomly searching, we need do so only for a few colors.
Right now I have no good way to generate a "safe" list of colors though.
committer: Tailor Script <tailor@pidgin.im>
author | Luke Schierer <lschiere@pidgin.im> |
---|---|
date | Mon, 05 Dec 2005 21:46:47 +0000 |
parents | e67993da8a22 |
children |
line wrap: on
line source
/* The mediastreamer library aims at providing modular media processing and I/O for linphone, but also for any telephony application. Copyright (C) 2001 Simon MORLAT simon.morlat@linphone.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #ifndef MSCOPY_H #define MSCOPY_H #include "msfilter.h" /*this is the class that implements a copy filter*/ #define MSCOPY_MAX_INPUTS 1 /* max output per filter*/ #define MSCOPY_DEF_GRAN 64 /* the default granularity*/ typedef struct _MSCopy { /* the MSCopy derivates from MSFilter, so the MSFilter object MUST be the first of the MSCopy object in order to the object mechanism to work*/ MSFilter filter; MSFifo *f_inputs[MSCOPY_MAX_INPUTS]; MSFifo *f_outputs[MSCOPY_MAX_INPUTS]; } MSCopy; typedef struct _MSCopyClass { /* the MSCopy derivates from MSFilter, so the MSFilter class MUST be the first of the MSCopy class in order to the class mechanism to work*/ MSFilterClass parent_class; } MSCopyClass; /* PUBLIC */ #define MS_COPY(filter) ((MSCopy*)(filter)) #define MS_COPY_CLASS(klass) ((MSCopyClass*)(klass)) MSFilter * ms_copy_new(void); /* FOR INTERNAL USE*/ void ms_copy_init(MSCopy *r); void ms_copy_class_init(MSCopyClass *klass); void ms_copy_destroy( MSCopy *obj); void ms_copy_process(MSCopy *r); #endif