Searched refs:elements (Results 1 - 25 of 1033) sorted by path

1234567891011>>

/external/ImageMagick/MagickCore/
H A Dlinked-list.c37 % storing and retrieving large numbers of data elements. It is loosely based
73 elements;
121 if (list_info->elements == list_info->capacity)
131 if (list_info->elements == 0)
136 list_info->elements++;
153 % ClearLinkedList() clears all the elements from the linked-list.
192 list_info->elements=0;
279 if (list_info->elements == 0)
358 return(list_info->elements);
401 if (index >= list_info->elements)
71 elements; member in struct:_LinkedListInfo
[all...]
H A Dmatrix.c87 *elements;
246 matrix_info->elements=AcquireMagickMemory((size_t)
248 if (matrix_info->elements == NULL)
251 matrix_info->elements=MapBlob(-1,IOMode,0,(size_t)
254 if (matrix_info->elements == (unsigned short *) NULL)
259 if (matrix_info->elements == (unsigned short *) NULL)
279 matrix_info->elements=(void *) MapBlob(matrix_info->file,IOMode,0,
281 if (matrix_info->elements != NULL)
387 matrix_info->elements=RelinquishMagickMemory(matrix_info->elements);
85 *elements; member in struct:_MatrixInfo
[all...]
/external/ImageMagick/www/api/
H A Ddrawing-wand.php1067 <dd>address to place number of elements in dash array </dd>
2356 <p>DrawPushDefs() indicates that commands up to a terminating DrawPopDefs() command create named elements (e.g. clip-paths, textures, etc.) which may safely be processed earlier for the sake of efficiency.</p>
3164 <dd>number of elements in dash array </dd>
H A Denhance.php233 <p>ContrastImage() enhances the intensity differences between the lighter and darker elements of the image. Set sharpen to a MagickTrue to increase the image contrast otherwise the contrast is reduced.</p>
H A Dmagick-image.php1205 <p>MagickContrastImage() enhances the intensity differences between the lighter and darker elements of the image. Set sharpen to a value other than 0 to increase the image contrast otherwise the contrast is reduced.</p>
H A Dmemory.php75 <dd>the number of quantum elements to allocate. </dd>
123 <dd>the number of quantum elements to allocate. </dd>
149 <dd>the number of quantum elements to allocate. </dd>
385 <dd>the number of quantum elements to allocate. </dd>
H A Dmodule.php262 <dd>a pointer to an integer describing the number of elements in the argument vector. </dd>
H A Dmogrify.php87 <dd>Specifies a pointer to an integer describing the number of elements in the argument vector. </dd>
/external/aac/libAACdec/src/
H A Daacdecoder.cpp112 The basic bitstream deformatter function CChannelElement_Decode() for CPE elements and SCE elements are called.
113 Except for the stereo processing (2.1) which is only used for CPE elements, the function calls for CPE or SCE
119 <h3>2.1 Stereo processing for CPE elements</h3>
551 Fill elements containing an extension_payload() with an extension_type of EXT_SBR_DATA
869 el = CProgramConfig_GetElementTable(&asc->m_progrConfigElement, self->elements, (8), &self->chMapIndex);
871 self->elements[el] = ID_NONE;
910 FDKmemcpy(self->elements, elementsTab[asc->m_channelConfiguration-1], sizeof(MP4_ELEMENT_ID)*FDKmin(7,(8)));
912 self->elements[el] = ID_NONE;
1159 self->elements[e
[all...]
H A Daacdecoder.h180 MP4_ELEMENT_ID elements[(8)]; /*!< Table where the element Id's are listed */ member in struct:AAC_DECODER_INSTANCE
181 UCHAR elTags[(8)]; /*!< Table where the elements id Tags are listed */
293 /* Initialization of stream-info elements */
301 elements are not supported. The transport layer might signal, that the
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/
H A DLayoutManager.java66 for(Widget w : elements()) {
89 for (Widget widget : elements()) {
257 for (Widget widget : elements()) {
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/util/
H A DListOrganizer.java109 public List<ElementType> elements() { method in class:ListOrganizer
H A DZHash.java24 * mutable ordering (z indexing) of elements.
141 public List<KeyType> elements() { method in class:ZHash
150 return elements();
H A DZIndexable.java23 * be moved up and down in the queue relative to other elements in the hash or absolutely to the front or back of the queue.
32 * Move above all other elements
58 * Move beneath all other elements
79 public List<ElementType> elements(); method in interface:ZIndexable
83 * Add beneath all other elements
89 * Add above all other elements
H A DZLinkedList.java64 public List<Type> elements() { method in class:ZLinkedList
65 return organizer.elements();
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/xy/
H A DLineAndPointRenderer.java203 for (RectRegion r : RectRegion.regionsWithin(formatter.getRegions().elements(), minX, maxX, minY, maxY)) {
H A DXYGraphWidget.java247 for (RectRegion r : axisValueLabelRegions.elements()) {
257 for (RectRegion r : axisValueLabelRegions.elements()) {
267 for (RectRegion r : axisValueLabelRegions.elements()) {
300 * zhash.elements()) { if (r.contains(val)) { return
H A DXYSeriesRenderer.java43 for (RectRegion region : regionIndexer.elements()) {
/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
H A DRewriteRuleElementStream.as30 /** A generic list of elements tracked in an alternative to be used in
35 * Once you start next()ing, do not try to add more elements. It will
45 * which bumps it to 1 meaning no more elements.
49 /** Track single elements w/o creating a list. Upon 2nd add, alloc list */
53 protected var elements:Array;
78 this.elements = element as Array;
88 * not consumed any of its elements. Elements themselves are untouched.
102 if ( elements!=null ) { // if in list, just add
103 elements.push(el);
106 if ( singleElement == null ) { // no elements ye
[all...]
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h118 /** How many elements currently exist in the table.
182 /** Hash table that is storing the list elements
237 /** Array of pointers to vector elements
239 pANTLR3_VECTOR_ELEMENT elements; member in struct:ANTLR3_VECTOR_struct
246 * is too much overhead to malloc the space for elements so
248 * few elements internally. It means we must copy them when
261 /** Total number of entries in elements at any point in time
H A Dantlr3rewritestreams.h42 /// A generic list of elements tracked in an alternative to be used in
52 /// Once you start next()ing, do not try to add more elements. It will
66 /// which bumps it to 1 meaning no more elements.
70 /// Track single elements w/o creating a list. Upon 2nd add, alloc list
76 pANTLR3_VECTOR elements; member in struct:ANTLR3_REWRITE_RULE_ELEMENT_STREAM_struct
106 /// not consumed any of its elements. Elements themselves are untouched.
114 /// Return the next element in the stream. If out of elements, throw
115 /// an exception unless size()==1. If size is 1, then return elements[0].
148 /// Number of elements available in the stream
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3basetree.c219 /// Add all elements of the supplied list as children of this node
450 ANTLR3_FREE(newChildren->elements);
451 newChildren->elements = NULL;
H A Dantlr3collections.c402 /* Now we can free the elements and the entry in order
426 /* Now we can free the elements and the entry in order
793 /* There was one more bucket, see if it has any elements in it
1095 vector->elements = (pANTLR3_VECTOR_ELEMENT)ANTLR3_MALLOC((size_t)(sizeof(ANTLR3_VECTOR_ELEMENT) * initialSize));
1099 vector->elements = vector->internal;
1102 if (vector->elements == NULL)
1146 if (vector->elements[entry].freeptr != NULL)
1148 vector->elements[entry].freeptr(vector->elements[entry].element);
1150 vector->elements[entr
[all...]

Completed in 461 milliseconds

1234567891011>>