OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2006 Apple Computer, Inc. | 2 * Copyright (C) 2006 Apple Computer, Inc. |
3 * Copyright (C) 2006 Samuel Weinig <sam.weinig@gmail.com> | 3 * Copyright (C) 2006 Samuel Weinig <sam.weinig@gmail.com> |
4 * | 4 * |
5 * This library is free software; you can redistribute it and/or | 5 * This library is free software; you can redistribute it and/or |
6 * modify it under the terms of the GNU Library General Public | 6 * modify it under the terms of the GNU Library General Public |
7 * License as published by the Free Software Foundation; either | 7 * License as published by the Free Software Foundation; either |
8 * version 2 of the License, or (at your option) any later version. | 8 * version 2 of the License, or (at your option) any later version. |
9 * | 9 * |
10 * This library is distributed in the hope that it will be useful, | 10 * This library is distributed in the hope that it will be useful, |
(...skipping 20 matching lines...) Expand all Loading... |
31 readonly attribute long endOffset; | 31 readonly attribute long endOffset; |
32 readonly attribute boolean collapsed; | 32 readonly attribute boolean collapsed; |
33 readonly attribute Node commonAncestorContainer; | 33 readonly attribute Node commonAncestorContainer; |
34 | 34 |
35 [RaisesException] void setStart(Node refNode, long offset); | 35 [RaisesException] void setStart(Node refNode, long offset); |
36 [RaisesException] void setEnd(Node refNode, long offset); | 36 [RaisesException] void setEnd(Node refNode, long offset); |
37 [RaisesException] void setStartBefore(Node refNode); | 37 [RaisesException] void setStartBefore(Node refNode); |
38 [RaisesException] void setStartAfter(Node refNode); | 38 [RaisesException] void setStartAfter(Node refNode); |
39 [RaisesException] void setEndBefore(Node refNode); | 39 [RaisesException] void setEndBefore(Node refNode); |
40 [RaisesException] void setEndAfter(Node refNode); | 40 [RaisesException] void setEndAfter(Node refNode); |
41 void collapse([Default=Undefined] optional boolean toStart); | 41 void collapse(optional boolean toStart = false); |
42 [RaisesException] void selectNode(Node refNode); | 42 [RaisesException] void selectNode(Node refNode); |
43 [RaisesException] void selectNodeContents(Node refNode); | 43 [RaisesException] void selectNodeContents(Node refNode); |
44 | 44 |
45 // CompareHow | 45 // CompareHow |
46 const unsigned short START_TO_START = 0; | 46 const unsigned short START_TO_START = 0; |
47 const unsigned short START_TO_END = 1; | 47 const unsigned short START_TO_END = 1; |
48 const unsigned short END_TO_END = 2; | 48 const unsigned short END_TO_END = 2; |
49 const unsigned short END_TO_START = 3; | 49 const unsigned short END_TO_START = 3; |
50 | 50 |
51 [RaisesException] short compareBoundaryPoints(CompareHow how, Range sourceRa
nge); | 51 [RaisesException] short compareBoundaryPoints(CompareHow how, Range sourceRa
nge); |
(...skipping 28 matching lines...) Expand all Loading... |
80 // CompareResults | 80 // CompareResults |
81 const unsigned short NODE_BEFORE = 0; | 81 const unsigned short NODE_BEFORE = 0; |
82 const unsigned short NODE_AFTER = 1; | 82 const unsigned short NODE_AFTER = 1; |
83 const unsigned short NODE_BEFORE_AND_AFTER = 2; | 83 const unsigned short NODE_BEFORE_AND_AFTER = 2; |
84 const unsigned short NODE_INSIDE = 3; | 84 const unsigned short NODE_INSIDE = 3; |
85 | 85 |
86 [RaisesException, MeasureAs=RangeCompareNode] short compareNode([Default=Und
efined] optional Node refNode); | 86 [RaisesException, MeasureAs=RangeCompareNode] short compareNode([Default=Und
efined] optional Node refNode); |
87 | 87 |
88 [RaisesException, MeasureAs=RangeExpand] void expand([Default=Undefined] opt
ional DOMString unit); | 88 [RaisesException, MeasureAs=RangeExpand] void expand([Default=Undefined] opt
ional DOMString unit); |
89 }; | 89 }; |
OLD | NEW |