%PDF- <> %âãÏÓ endobj 2 0 obj <> endobj 3 0 obj <>/ExtGState<>/ProcSet[/PDF/Text/ImageB/ImageC/ImageI] >>/Annots[ 28 0 R 29 0 R] /MediaBox[ 0 0 595.5 842.25] /Contents 4 0 R/Group<>/Tabs/S>> endobj ºaâÚÎΞ-ÌE1ÍØÄ÷{òò2ÿ ÛÖ^ÔÀá TÎ{¦?§®¥kuµùÕ5sLOšuY>endobj 2 0 obj<>endobj 2 0 obj<>endobj 2 0 obj<>endobj 2 0 obj<> endobj 2 0 obj<>endobj 2 0 obj<>es 3 0 R>> endobj 2 0 obj<> ox[ 0.000000 0.000000 609.600000 935.600000]/Fi endobj 3 0 obj<> endobj 7 1 obj<>/ProcSet[/PDF/Text/ImageB/ImageC/ImageI]>>/Subtype/Form>> stream
// Copyright 2010 the V8 project authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #include "src/utils/bit-vector.h" #include "src/base/bits.h" #include "src/utils/utils.h" namespace v8 { namespace internal { #ifdef DEBUG void BitVector::Print() const { bool first = true; PrintF("{"); for (int i = 0; i < length(); i++) { if (Contains(i)) { if (!first) PrintF(","); first = false; PrintF("%d", i); } } PrintF("}\n"); } #endif int BitVector::Count() const { if (is_inline()) return base::bits::CountPopulation(data_.inline_); int count = 0; for (int i = 0; i < data_length_; i++) { count += base::bits::CountPopulation(data_.ptr_[i]); } return count; } } // namespace internal } // namespace v8