Home
last modified time | relevance | path

Searched refs:_count (Results 1 – 25 of 2746) sorted by relevance

12345678910>>...110

/dports/cad/stepcode/stepcode-0.8/src/cldai/
H A DsdaiEntity_extent_set.cc50 _count = 0; in SDAI_Entity_extent__set()
86 ++_count; in Insert()
104 ++_count; in Append()
110 --_count; in Remove()
134 _count = ( ( _count > index + 1 ) ? _count : ( index + 1 ) ); in operator []()
150 _count = 0; in Clear()
160 _count = 0;
193 ++_count;
210 ++_count;
233 _count = ( ( _count > index + 1 ) ? _count : ( index + 1 ) );
[all …]
H A DsdaiModel_contents_list.cc42 _count = 0; in SDAI_Model_contents__list()
68 if( index < _count ) { in Insert()
78 ++_count; in Insert()
83 int index = _count; in Append()
86 if( index < _count ) { in Append()
96 ++_count; in Append()
102 --_count; in Remove()
128 _count = ( ( _count > index + 1 ) ? _count : ( index + 1 ) ); in operator []()
134 return _count; in Count()
139 return _count; in is_empty()
[all …]
H A DsdaiDaObject.cc84 _count = 0; in SDAI_DAObject__set()
110 if( index < _count ) { in Insert()
120 ++_count; in Insert()
125 int index = _count; in Append()
128 if( index < _count ) { in Append()
138 ++_count; in Append()
144 --_count; in Remove()
169 _count = ( ( _count > index + 1 ) ? _count : ( index + 1 ) ); in operator []()
175 return _count; in Count()
180 return _count; in is_empty()
[all …]
H A DsdaiApplication_instance_set.cc47 _count = 0; in SDAI_Application_instance__set()
70 if( index < _count ) { in Insert()
71 Check( _count + 1 ); in Insert()
80 ++_count; in Insert()
84 int index = _count; in Append()
87 if( index < _count ) { in Append()
97 ++_count; in Append()
102 --_count; in Remove()
127 _count = ( ( _count > index + 1 ) ? _count : ( index + 1 ) ); in operator []()
133 return _count; in Count()
[all …]
/dports/net/pear-Horde_Kolab_Server/Horde_Kolab_Server-2.0.5/lib/Horde/Kolab/Server/Decorator/
H A DCount.php52 private $_count = array(); variable in Horde_Kolab_Server_Decorator_Count
140 $this->_count['read'] = 1;
142 $this->_count['read']++;
182 $this->_count['find'] = 1;
184 $this->_count['find']++;
227 $this->_count['save'] = 1;
229 $this->_count['save']++;
250 $this->_count['add'] = 1;
252 $this->_count['add']++;
271 $this->_count['delete']++;
[all …]
/dports/net/libzmq4/zeromq-4.3.4/src/
H A Dtrie.cpp46 if (_count == 1) { in ~trie_t()
49 } else if (_count > 1) { in ~trie_t()
69 if (!_count) { in add()
71 _count = 1; in add()
109 if (_count == 1) { in add()
137 if (!_count || c < _min || c >= _min + _count) in rm()
152 if (_count == 1) { in rm()
155 _count = 0; in rm()
202 _count = _count - (new_min - _min); in rm()
300 if (_count == 0) in apply_helper()
[all …]
H A Dgeneric_mtrie_impl.hpp50 _count (0), in generic_mtrie_t()
59 if (_count == 1) { in ~generic_mtrie_t()
62 } else if (_count > 1) { in ~generic_mtrie_t()
81 if (!it->_count) { in add()
83 it->_count = 1; in add()
121 if (it->_count == 1) { in add()
205 switch (it.node->_count) { in rm()
265 switch (it.node->_count) { in rm()
452 it.node->_count == 1 in rm()
566 if (current->_count == 0) in match()
[all …]
/dports/net/py-pyzmq/pyzmq-22.3.0/bundled/zeromq/src/
H A Dtrie.cpp46 if (_count == 1) { in ~trie_t()
49 } else if (_count > 1) { in ~trie_t()
69 if (!_count) { in add()
71 _count = 1; in add()
109 if (_count == 1) { in add()
137 if (!_count || c < _min || c >= _min + _count) in rm()
152 if (_count == 1) { in rm()
155 _count = 0; in rm()
202 _count = _count - (new_min - _min); in rm()
300 if (_count == 0) in apply_helper()
[all …]
H A Dgeneric_mtrie_impl.hpp50 _count (0), in generic_mtrie_t()
59 if (_count == 1) { in ~generic_mtrie_t()
62 } else if (_count > 1) { in ~generic_mtrie_t()
81 if (!it->_count) { in add()
83 it->_count = 1; in add()
121 if (it->_count == 1) { in add()
205 switch (it.node->_count) { in rm()
265 switch (it.node->_count) { in rm()
452 it.node->_count == 1 in rm()
566 if (current->_count == 0) in match()
[all …]
/dports/devel/poco/poco-1.10.1-all/Foundation/testsuite/src/
H A DBasicEventTest.cpp321 p->_count++; in onStaticVoid()
326 _count++; in onVoid()
331 _count++; in onSimpleNoSender()
337 _count++; in onSimple()
344 p->_count++; in onStaticSimple()
367 _count++; in onConstSimple()
372 _count++; in onComplex()
377 _count++; in onComplex2()
382 _count++; in onConstComplex()
387 _count++; in onConst2Complex()
[all …]
H A DFIFOEventTest.cpp41 assertTrue (_count == 0); in testNoDelegate()
348 _count++; in onVoid()
353 _count++; in onSimple()
358 _count+=100; in onSimpleOther()
363 _count++; in onConstSimple()
368 _count++; in onComplex()
373 _count++; in onComplex2()
378 _count++; in onConstComplex()
383 _count++; in onConst2Complex()
394 return _count; in getCount()
[all …]
H A DPriorityEventTest.cpp407 p->_count++; in onStaticVoid()
411 _count++; in onVoid()
417 p->_count++; in onStaticSimple()
435 _count++; in onSimpleNoSender()
441 _count++; in onSimple()
451 _count++; in onConstSimple()
456 _count++; in onComplex()
461 _count++; in onComplex2()
466 _count++; in onConstComplex()
471 _count++; in onConst2Complex()
[all …]
/dports/deskutils/coolreader/coolreader-cr3.2.55/crengine/include/
H A Dlvarray.h32 int _count; variable
46 _size = _count = v._count; in LVArray()
69 _size = _count = v._count;
123 _count = 0; in clear()
128 _count = 0; in reset()
151 _count = count; in trim()
166 _count -= count; in erase()
187 _count += count; in append()
193 reserve( _count + list._count ); in add()
196 _count += list._count; in add()
[all …]
H A Dlvptrvec.h31 int _count; variable
70 if (_count<=index) in set()
85 _count = 0; in clear()
95 _count = 0; in clear()
119 _count -= count; in erase()
133 _count--; in remove()
147 if ( _count<=0 ) in last()
153 if ( _count<=0 ) in first()
169 _count--; in remove()
178 pos = _count; in insert()
[all …]
/dports/devel/kcachegrind/kcachegrind-21.12.3/libcore/
H A Dcostitem.cpp127 _count = 0; in ProfileCostArray()
136 _count = 0; in ProfileCostArray()
148 _count = 0; in clear()
260 if (i > _count) _count = i; in addCost()
313 if (i > _count) _count = i; in addCost()
369 if (i > _count) _count = i; in maxCost()
418 if (item->_count < _count) { in addCost()
427 _count = item->_count; in addCost()
455 if (item->_count < _count) { in maxCost()
464 _count = item->_count; in maxCost()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/rx/Rx/NET/Source/System.Reactive.Linq/Reactive/Linq/Observable/
H A DAverage.cs27 private long _count; field in System.Reactive.Linq.ObservableImpl.AverageDouble._
33 _count = 0L; in _()
43 _count++; in OnNext()
61 if (_count > 0) in OnCompleted()
101 _count = 0L; in _()
169 _count = 0L; in _()
237 _count = 0L; in _()
305 _count = 0L; in _()
373 _count = 0L; in _()
444 _count = 0L; in _()
[all …]
/dports/math/givaro/givaro-4.1.1/src/kernel/memory/
H A Dgivpointer.h28 mutable int* _count; variable
31 : _data( data ), _count(0) in RefCountPtr()
33 _count = GivaroMM<int>::allocate(1); in RefCountPtr()
34 *_count = 1; in RefCountPtr()
37 : _data( ptr._data), _count(ptr._count) in RefCountPtr()
39 if (_count !=0) *_count += 1; in RefCountPtr()
43 if (--*_count ==0) { in ~RefCountPtr()
45 GivaroMM<int>::desallocate(_count); in ~RefCountPtr()
51 if (--*_count ==0) {
55 _data = ptr._data; _count = ptr._count;
[all …]
/dports/www/trafficserver/trafficserver-9.1.1/src/tscore/unit_tests/
H A Dtest_IntrusivePtr.cc31 Thing() { ++_count; } in Thing()
49 Item() { ++_count; } in Item()
50 ~Item() { --_count; } in ~Item()
58 int Thing::_count{0};
59 int Item::_count{0};
67 REQUIRE(Thing::_count == 1);
69 REQUIRE(Thing::_count == 0);
73 REQUIRE(Thing::_count == 1);
78 REQUIRE(Thing::_count == 2);
81 REQUIRE(Thing::_count == 1);
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Private.Xml/src/System/Xml/Xsl/QIL/
H A DQilList.cs19 private int _count; field in System.Xml.Xsl.Qil.QilList
52 if (_count > 0)
94 get { return _count; }
120 if (index < 0 || index > _count) in Insert()
123 if (_count == _members.Length) in Insert()
130 if (index < _count) in Insert()
133 _count++; in Insert()
142 if (index < 0 || index >= _count) in RemoveAt()
145 _count--; in RemoveAt()
146 if (index < _count) in RemoveAt()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/Common/src/System/Collections/Generic/
H A DArrayBuilder.cs43 public int Count => _count;
69 if (_count == Capacity) in Add()
82 Debug.Assert(_count > 0); in First()
91 Debug.Assert(_count > 0); in Last()
92 return _array[_count - 1]; in Last()
103 if (_count == 0) in ToArray()
111 if (_count < result.Length) in ToArray()
115 result = new T[_count]; in ToArray()
121 _count = -1; in ToArray()
140 _array[_count++] = item; in UncheckedAdd()
[all …]
/dports/cad/stepcode/stepcode-0.8/src/clstepcore/
H A DExpDict.cc28 _count = 0; in Explicit_item_id__set()
61 ++_count; in Insert()
78 ++_count; in Append()
100 _count = ( ( _count > index + 1 ) ? _count : ( index + 1 ) ); in operator []()
150 ++_count; in Insert()
167 ++_count; in Append()
189 _count = ( ( _count > index + 1 ) ? _count : ( index + 1 ) ); in operator []()
278 _count = ( ( _count > index + 1 ) ? _count : ( index + 1 ) ); in operator []()
1147 _count = ( ( _count > index + 1 ) ? _count : ( index + 1 ) ); in operator []()
1256 _count = ( ( _count > index + 1 ) ? _count : ( index + 1 ) ); in operator []()
[all …]
/dports/cad/stepcode/stepcode-0.8/src/clutils/
H A Dgennodearray.cc40 _count = 0; in GenNodeArray()
52 Insert( gn, _count ); in Append()
56 return Insert( gn, _count ); in Insert()
79 if( index < _count ) { in Insert()
80 Check( _count + 1 ); in Insert()
89 ++_count; in Insert()
96 --_count; in Remove()
99 _buf[_count] = 0; in Remove()
105 for( i = 0 ; i < _count; i++ ) { in ClearEntries()
108 _count = 0; in ClearEntries()
[all …]
/dports/cad/opentimer/OpenTimer-18d28ff/ot/taskflow/utility/
H A Dbackoff.hpp94 relax_cpu(_count); in backoff()
95 _count = _count << 1; in backoff()
104 relax_cpu(_count); in bounded_pause()
106 _count = _count << 1; in bounded_pause()
114 _count = 1; in reset()
119 int _count {1}; member in tf::ExponentialBackoff
131 if(_count <= 16) { in backoff()
132 relax_cpu(_count); in backoff()
133 ++_count; in backoff()
141 _count = 1; in reset()
[all …]
/dports/security/beecrypt/beecrypt-4.2.1/include/beecrypt/c++/util/
H A DArrayList.h46 jint _count; variable
54 _count++; in fastInsert()
61 _table[--_count] = 0; in fastRemove()
70 _count = 0; in _table()
76 ArrayList(const ArrayList& copy) : _table(copy._table), _count(copy._count) in ArrayList()
86 ensureCapacity(_count+1); in add()
96 ensureCapacity(_count+1); in add()
137 _count = 0; in clear()
183 return _count == 0; in isEmpty()
214 return _count; in size()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corert/src/Common/src/System/Collections/Generic/
H A DArrayBuilder.cs15 private int _count; field
21 if (_count != _items.Length) in ToArray()
22 Array.Resize(ref _items, _count); in ToArray()
30 _items[_count++] = item; in Add()
46 EnsureCapacity(_count + length); in Append()
48 _count += length; in Append()
57 _count += newItems.Count; in Append()
63 EnsureCapacity(_count + numItems); in ZeroExtend()
64 _count += numItems; in ZeroExtend()
80 return _count;
[all …]

12345678910>>...110