|
|
1.1 root 1: /* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
2: *
3: * ***** BEGIN LICENSE BLOCK *****
4: * Version: MPL 1.1/GPL 2.0/LGPL 2.1
5: *
6: * The contents of this file are subject to the Mozilla Public License Version
7: * 1.1 (the "License"); you may not use this file except in compliance with
8: * the License. You may obtain a copy of the License at
9: * http://www.mozilla.org/MPL/
10: *
11: * Software distributed under the License is distributed on an "AS IS" basis,
12: * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
13: * for the specific language governing rights and limitations under the
14: * License.
15: *
16: * The Original Code is Mozilla Communicator client code, released
17: * March 31, 1998.
18: *
19: * The Initial Developer of the Original Code is
20: * Netscape Communications Corporation.
21: * Portions created by the Initial Developer are Copyright (C) 1998
22: * the Initial Developer. All Rights Reserved.
23: *
24: * Contributor(s):
25: *
26: * Alternatively, the contents of this file may be used under the terms of
27: * either of the GNU General Public License Version 2 or later (the "GPL"),
28: * or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
29: * in which case the provisions of the GPL or the LGPL are applicable instead
30: * of those above. If you wish to allow use of your version of this file only
31: * under the terms of either the GPL or the LGPL, and not to allow others to
32: * use your version of this file under the terms of the MPL, indicate your
33: * decision by deleting the provisions above and replace them with the notice
34: * and other provisions required by the GPL or the LGPL. If you do not delete
35: * the provisions above, a recipient may use your version of this file under
36: * the terms of any one of the MPL, the GPL or the LGPL.
37: *
38: * ***** END LICENSE BLOCK ***** */
39:
40: #ifndef jsarray_h___
41: #define jsarray_h___
42: /*
43: * JS Array interface.
44: */
45: #include "jsprvtd.h"
46: #include "jspubtd.h"
47:
48: JS_BEGIN_EXTERN_C
49:
1.1.1.2 ! root 50: /* Generous sanity-bound on length (in elements) of array initialiser. */
! 51: #define ARRAY_INIT_LIMIT JS_BIT(24)
! 52:
! 53: extern JSBool
! 54: js_IdIsIndex(jsval id, jsuint *indexp);
! 55:
1.1 root 56: extern JSClass js_ArrayClass;
57:
58: extern JSObject *
59: js_InitArrayClass(JSContext *cx, JSObject *obj);
60:
61: extern JSObject *
62: js_NewArrayObject(JSContext *cx, jsuint length, jsval *vector);
63:
64: extern JSBool
65: js_GetLengthProperty(JSContext *cx, JSObject *obj, jsuint *lengthp);
66:
67: extern JSBool
68: js_SetLengthProperty(JSContext *cx, JSObject *obj, jsuint length);
69:
70: extern JSBool
71: js_HasLengthProperty(JSContext *cx, JSObject *obj, jsuint *lengthp);
72:
73: /*
1.1.1.2 ! root 74: * Test whether an object is "array-like". Currently this means whether obj
! 75: * is an Array or an arguments object. We would like an API, and probably a
! 76: * way in the language, to bless other objects as array-like: having indexed
! 77: * properties, and a 'length' property of uint32 value equal to one more than
! 78: * the greatest index.
! 79: */
! 80: extern JSBool
! 81: js_IsArrayLike(JSContext *cx, JSObject *obj, JSBool *answerp, jsuint *lengthp);
! 82:
! 83: /*
1.1 root 84: * JS-specific heap sort function.
85: */
1.1.1.2 ! root 86: typedef JSBool (*JSComparator)(void *arg, const void *a, const void *b,
! 87: int *result);
1.1 root 88:
89: extern JSBool
1.1.1.2 ! root 90: js_HeapSort(void *vec, size_t nel, void *pivot, size_t elsize,
! 91: JSComparator cmp, void *arg);
1.1 root 92:
93: JS_END_EXTERN_C
94:
95: #endif /* jsarray_h___ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.