statistics.cc (11320:42ecb523c64a) | statistics.cc (11321:02e930db812d) |
---|---|
1/* 2 * Copyright (c) 2003-2005 The Regents of The University of Michigan 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; --- 350 unchanged lines hidden (view full) --- 359 assert(size() == b_size); 360 assert(min_bucket == hs->min_bucket); 361 362 sum += hs->sum; 363 logs += hs->logs; 364 squares += hs->squares; 365 samples += hs->samples; 366 | 1/* 2 * Copyright (c) 2003-2005 The Regents of The University of Michigan 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; --- 350 unchanged lines hidden (view full) --- 359 assert(size() == b_size); 360 assert(min_bucket == hs->min_bucket); 361 362 sum += hs->sum; 363 logs += hs->logs; 364 squares += hs->squares; 365 samples += hs->samples; 366 |
367 while(bucket_size > hs->bucket_size) | 367 while (bucket_size > hs->bucket_size) |
368 hs->grow_up(); | 368 hs->grow_up(); |
369 while(bucket_size < hs->bucket_size) | 369 while (bucket_size < hs->bucket_size) |
370 grow_up(); 371 372 for (uint32_t i = 0; i < b_size; i++) 373 cvec[i] += hs->cvec[i]; 374} 375 376Formula::Formula() 377{ --- 166 unchanged lines hidden --- | 370 grow_up(); 371 372 for (uint32_t i = 0; i < b_size; i++) 373 cvec[i] += hs->cvec[i]; 374} 375 376Formula::Formula() 377{ --- 166 unchanged lines hidden --- |