HomeSort by relevance Sort by last modified time
    Searched refs:field_count (Results 1 - 25 of 95) sorted by null

1 2 3 4

  /external/protobuf/src/google/protobuf/compiler/javamicro/
javamicro_message.cc 75 new const FieldDescriptor*[descriptor->field_count()];
76 for (int i = 0; i < descriptor->field_count(); i++) {
79 sort(fields, fields + descriptor->field_count(),
117 for (int i = 0; i < type->field_count(); i++) {
208 for (int i = 0; i < descriptor_->field_count(); i++) {
239 if (descriptor_->field_count() > 0) {
252 for (int i = 0; i < descriptor_->field_count(); i++) {
275 for (int i = 0; i < descriptor_->field_count(); i++) {
327 for (int i = 0; i < descriptor_->field_count(); i++) {
387 for (int i = 0; i < descriptor_->field_count(); i++)
    [all...]
javamicro_field.cc 52 new scoped_ptr<FieldGenerator>[descriptor->field_count()]),
57 for (int i = 0; i < descriptor->field_count(); i++) {
  /external/protobuf/src/google/protobuf/compiler/javanano/
javanano_message.cc 76 new const FieldDescriptor*[descriptor->field_count()];
77 for (int i = 0; i < descriptor->field_count(); i++) {
80 sort(fields, fields + descriptor->field_count(),
171 for (int i = 0; i < descriptor_->field_count(); i++) {
212 if (descriptor_->field_count() > 0 || params_.store_unknown_fields()) {
225 for (int i = 0; i < descriptor_->field_count(); i++) {
255 for (int i = 0; i < descriptor_->field_count(); i++) {
320 for (int i = 0; i < descriptor_->field_count(); i++) {
380 for (int i = 0; i < descriptor_->field_count(); i++) {
javanano_field.cc 52 new scoped_ptr<FieldGenerator>[descriptor->field_count()]),
57 for (int i = 0; i < descriptor->field_count(); i++) {
  /external/chromium_org/third_party/protobuf/src/google/protobuf/
reflection_ops_unittest.cc 146 ASSERT_EQ(2, message1.unknown_fields().field_count());
220 EXPECT_EQ(0, message.unknown_fields().field_count());
237 EXPECT_EQ(1, message.unknown_fields().field_count());
239 .unknown_fields().field_count());
241 .unknown_fields().field_count());
247 EXPECT_EQ(0, message.unknown_fields().field_count());
249 .unknown_fields().field_count());
251 .unknown_fields().field_count());
268 EXPECT_EQ(1, message.unknown_fields().field_count());
271 .unknown_fields().field_count());
    [all...]
unknown_field_set_unittest.cc 69 for (int i = 0; i < unknown_fields_->field_count(); i++) {
84 for (int i = 0; i < unknown_fields_->field_count(); i++) {
120 ASSERT_LT(pos, unknown_fields_->field_count());
124 ASSERT_LT(pos, unknown_fields_->field_count());
129 EXPECT_EQ(unknown_fields_->field_count(), pos);
169 ASSERT_EQ(1, field->group().field_count());
260 EXPECT_GT(empty_message_.unknown_fields().field_count(), 0);
261 EXPECT_GT(other_message.unknown_fields().field_count(), 0);
273 EXPECT_GT(empty_message_.unknown_fields().field_count(), 0);
276 EXPECT_GT(empty_message_.unknown_fields().field_count(), 0)
    [all...]
dynamic_message.cc 262 for (int i = 0; i < descriptor->field_count(); i++) {
342 for (int i = 0; i < descriptor->field_count(); i++) {
410 for (int i = 0; i < descriptor->field_count(); i++) {
508 int* offsets = new int[type->field_count()];
520 DivideRoundingUp(type->field_count(), bitsizeof(uint32));
535 for (int i = 0; i < type->field_count(); i++) {
unknown_field_set.h 104 inline int field_count() const;
105 // Get a field in the set, where 0 <= index < field_count(). The fields
109 // 0 <= index < field_count(). The fields appear in the order in which
236 inline int UnknownFieldSet::field_count() const { function in class:google::protobuf::UnknownFieldSet
  /external/protobuf/src/google/protobuf/
reflection_ops_unittest.cc 146 ASSERT_EQ(2, message1.unknown_fields().field_count());
220 EXPECT_EQ(0, message.unknown_fields().field_count());
237 EXPECT_EQ(1, message.unknown_fields().field_count());
239 .unknown_fields().field_count());
241 .unknown_fields().field_count());
247 EXPECT_EQ(0, message.unknown_fields().field_count());
249 .unknown_fields().field_count());
251 .unknown_fields().field_count());
268 EXPECT_EQ(1, message.unknown_fields().field_count());
271 .unknown_fields().field_count());
    [all...]
unknown_field_set_unittest.cc 71 for (int i = 0; i < unknown_fields_->field_count(); i++) {
86 for (int i = 0; i < unknown_fields_->field_count(); i++) {
120 ASSERT_LT(pos, unknown_fields_->field_count());
124 ASSERT_LT(pos, unknown_fields_->field_count());
129 EXPECT_EQ(unknown_fields_->field_count(), pos);
169 ASSERT_EQ(1, field->group().field_count());
260 EXPECT_GT(empty_message_.unknown_fields().field_count(), 0);
261 EXPECT_GT(other_message.unknown_fields().field_count(), 0);
273 EXPECT_GT(empty_message_.unknown_fields().field_count(), 0);
276 EXPECT_GT(empty_message_.unknown_fields().field_count(), 0)
    [all...]
dynamic_message.cc 242 for (int i = 0; i < descriptor->field_count(); i++) {
322 for (int i = 0; i < descriptor->field_count(); i++) {
389 for (int i = 0; i < descriptor->field_count(); i++) {
487 int* offsets = new int[type->field_count()];
499 DivideRoundingUp(type->field_count(), bitsizeof(uint32));
514 for (int i = 0; i < type->field_count(); i++) {
unknown_field_set.h 89 inline int field_count() const;
90 // Get a field in the set, where 0 <= index < field_count(). The fields
94 // 0 <= index < field_count(). The fields appear in the order in which
199 inline int UnknownFieldSet::field_count() const { function in class:google::protobuf::UnknownFieldSet
  /external/chromium_org/third_party/protobuf/src/google/protobuf/compiler/cpp/
cpp_message.cc 90 new const FieldDescriptor*[descriptor->field_count()];
91 for (int i = 0; i < descriptor->field_count(); i++) {
94 sort(fields, fields + descriptor->field_count(),
135 for (int i = 0; i < type->field_count(); i++) {
355 for (int i = 0; i < descriptor_->field_count(); i++) {
392 for (int i = 0; i < descriptor_->field_count(); i++) {
457 vars["field_count"] = SimpleItoa(descriptor_->field_count());
619 for (int i = 0; i < descriptor_->field_count(); i++) {
654 for (int i = 0; i < descriptor_->field_count(); i++)
    [all...]
cpp_field.cc 88 field_generators_(new scoped_ptr<FieldGenerator>[descriptor->field_count()]) {
90 for (int i = 0; i < descriptor->field_count(); i++) {
  /external/protobuf/src/google/protobuf/compiler/cpp/
cpp_message.cc 88 new const FieldDescriptor*[descriptor->field_count()];
89 for (int i = 0; i < descriptor->field_count(); i++) {
92 sort(fields, fields + descriptor->field_count(),
126 for (int i = 0; i < type->field_count(); i++) {
214 for (int i = 0; i < descriptor_->field_count(); i++) {
251 for (int i = 0; i < descriptor_->field_count(); i++) {
305 vars["field_count"] = SimpleItoa(descriptor_->field_count());
466 for (int i = 0; i < descriptor_->field_count(); i++) {
488 if (descriptor_->field_count() > 0)
    [all...]
cpp_field.cc 86 new scoped_ptr<FieldGenerator>[descriptor->field_count()]) {
88 for (int i = 0; i < descriptor->field_count(); i++) {
  /external/chromium_org/third_party/protobuf/src/google/protobuf/compiler/java/
java_message.cc 89 new const FieldDescriptor*[descriptor->field_count()];
90 for (int i = 0; i < descriptor->field_count(); i++) {
93 sort(fields, fields + descriptor->field_count(),
131 for (int i = 0; i < type->field_count(); i++) {
236 for (int i = 0; i < descriptor_->field_count(); i++) {
286 for (int i = 0; i < descriptor_->field_count(); i++) {
414 for (int i = 0; i < descriptor_->field_count(); i++) {
425 for (int i = 0; i < descriptor_->field_count(); i++) {
438 for (int i = 0; i < descriptor_->field_count(); i++) {
529 i < descriptor_->field_count() || j < sorted_extensions.size()
    [all...]
java_field.cc 63 new scoped_ptr<FieldGenerator>[descriptor->field_count()]),
71 for (int i = 0; i < descriptor->field_count(); i++) {
  /external/protobuf/src/google/protobuf/compiler/java/
java_message.cc 83 new const FieldDescriptor*[descriptor->field_count()];
84 for (int i = 0; i < descriptor->field_count(); i++) {
87 sort(fields, fields + descriptor->field_count(),
125 for (int i = 0; i < type->field_count(); i++) {
230 for (int i = 0; i < descriptor_->field_count(); i++) {
343 for (int i = 0; i < descriptor_->field_count(); i++) {
356 for (int i = 0; i < descriptor_->field_count(); i++) {
437 i < descriptor_->field_count() || j < sorted_extensions.size();
439 if (i == descriptor_->field_count()) {
472 for (int i = 0; i < descriptor_->field_count(); i++)
    [all...]
java_field.cc 62 new scoped_ptr<FieldGenerator>[descriptor->field_count()]),
67 for (int i = 0; i < descriptor->field_count(); i++) {
  /external/chromium/chrome/browser/autofill/
form_structure_unittest.cc 75 EXPECT_EQ(3U, form_structure.field_count());
263 ASSERT_EQ(9U, form_structure->field_count());
365 ASSERT_EQ(10U, form_structure->field_count());
451 ASSERT_EQ(7U, form_structure->field_count());
535 ASSERT_EQ(9U, form_structure->field_count());
603 ASSERT_EQ(6U, form_structure->field_count());
673 ASSERT_EQ(7U, form_structure->field_count());
    [all...]
form_structure.cc 98 for (size_t index = 0; index < field_count(); index++) {
316 if (field_count() < kRequiredFillableFields)
331 for (size_t i = 0; i < cached_form.field_count(); ++i) {
358 for (size_t i = 0; i < field_count(); ++i) {
470 int num_fields = static_cast<int>(field_count());
480 size_t FormStructure::field_count() const { function in class:FormStructure
537 if (!field_count()) // Nothing to add.
545 if (field_count() > kMaxFieldsOnTheForm)
549 for (size_t index = 0; index < field_count(); ++index) {
585 for (size_t i = 0; i < field_count(); ++i)
    [all...]
form_structure.h 98 size_t field_count() const;
  /external/chromium_org/components/autofill/core/browser/
form_structure_unittest.cc 96 EXPECT_EQ(4U, form_structure->field_count());
100 EXPECT_EQ(4U, form_structure->field_count());
391 ASSERT_EQ(8U, form_structure->field_count());
442 ASSERT_EQ(3U, form_structure->field_count());
483 ASSERT_EQ(3U, form_structure->field_count());
524 ASSERT_EQ(3U, form_structure->field_count());
538 ASSERT_EQ(3U, form_structure->field_count());
552 ASSERT_EQ(3U, form_structure->field_count());
612 ASSERT_EQ(9U, form_structure.field_count());
656 ASSERT_EQ(6U, form_structure.field_count());
    [all...]
autofill_manager.cc 120 DCHECK_EQ(form_structure.field_count(), form.fields.size());
121 for (size_t i = 0; i < form_structure.field_count(); ++i) {
149 for (size_t i = 0; i < submitted_form->field_count(); ++i) {
173 for (size_t i = 0; i < form_structure.field_count(); ++i) {
537 DCHECK_EQ(form_structure->field_count(), form.fields.size());
538 for (size_t i = 0; i < form_structure->field_count(); ++i) {
    [all...]

Completed in 543 milliseconds

1 2 3 4