Searched refs:_size (Results 1 – 18 of 18) sorted by relevance
23 private int _size; field in DotZLib.CircularBuffer34 _size = 0; in CircularBuffer()37 public int Size { get { return _size; } }47 _size += trueCount; in Put()57 ++_size; in Put()68 _size -= trueCount; in Get()78 --_size; in Get()
22 _size = 0; in WLNonFileByteStream()58 _size = data_size; in Open()148 return _size; in GetSize()
43 int _size; variable
85 #define ALLOC(_ptr,_size) \ argument86 ( (_ptr) = _hb_alloc( _size, &error ), error != 0 )
11 NSSize _size; field
149 this._size = applicationCaches.size;170 var totalSizeString = Number.bytesToString(this._size);
739 if (!this._size) {740 this._size = 0;742 this._size += this.children[i].size;744 return this._size;
254 uint16_t _size; member
564 ht->pio._size, ht->pio._count, vcpu->iobuf); in hax_vcpu_hax_exec()
25 $\vert \vert a \vert \vert$ & {\tt mp\_unsigned\_bin\_size(\&a)} & $res$ = 1 if $a$ prime to $t$ ro…
514 Another less common initializer is mp\_init\_size() which allows the user to initialize an mp\_int …518 \index{mp\_init\_size}1716 \index{mp\_radix\_size}1736 \index{mp\_unsigned\_bin\_size}
252 _size = [[Object alloc] init];
70 size += hinfo._size;
2379 vg_assert(di->sec##_size == shdr->sh_size); \ in ML_()2393 di->sec##_debug_svma + di->sec##_size - 1); \ in ML_()
2671 OUTPUT->NAME##_count_ = INPUT.NAME##_size(); \2672 AllocateArray(INPUT.NAME##_size(), &OUTPUT->NAME##s_); \2673 for (int i = 0; i < INPUT.NAME##_size(); i++) { \
4004 … is an active PRNG state and \textit{wprng} the index to the descriptor. \textit{group\_size} and 4005 \textit{modulus\_size} control the difficulty of forging a signature. Both parameters are in bytes…4006 \textit{group\_size} the more difficult a forgery becomes upto a limit. The value of $group\_size$…4007 $15 < group\_size < 1024$ and $modulus\_size - group\_size < 512$. Suggested values for the pairs …4012 \hline \textbf{Bits of Security} & \textbf{group\_size} & \textbf{modulus\_size} \\4033 \item $q$ a small prime of magnitude $256^{group\_size}$. 4034 …\item $p = qr + 1$ a large prime of magnitude $256^{modulus\_size}$ where $r$ is a random even int…
1872 buffer##_size *= 2; \1873 tmp = (xmlChar *) xmlRealloc(buffer, buffer##_size * sizeof(xmlChar)); \
2595 buffer##_size *= 2; \2596 buffer##_size += n; \2598 xmlRealloc(buffer, buffer##_size * sizeof(xmlChar)); \