int i;
for(i=0; i<c.numEntries; i++)
{
matchChannel = 0;
for(n=0; n<numChannels; n++)
{
if((c.cb[i]->learnLow[n] <= *(p+n)) &&
找到这个频道的条目
(*(p+n) <= c.cb[i]->learnHigh[n]))
{
matchChannel++;
}
}
if(matchChannel == numChannels)
{
c.cb[i]->t_last_update = c.t;
for(n=0; n<numChannels; n++){
if(c.cb[i]->max[n] < *(p+n))
