ࡱ> b d O P Q R S T U V W X Y Z [ \ ] ^ _ ` a K bjbjR@R@  0*0*l4444d"NNN0Q Z| "ORdd3$ژژژ6D\_[T.LONONONONONONO$_R TrOc"rO44ژژ!O4ژژZNLO <h0 ژFd a",N40O0O!EU!EU04444 Edition 3 Final ECMAScript Language Specification  DATE \@ "d MMMM yyyy" \* MERGEFORMAT 18 January 2000 Brief History This ECMA Standard is based on several originating technologies, the most well known being JavaScript (Netscape) and JScript (Microsoft). The language was invented by Brendan Eich at Netscape and first appeared in that companys Navigator 2.0 browser. It has appeared in all subsequent browsers from Netscape and in all browsers from Microsoft starting with Internet Explorer 3.0. The development of this Standard started in November 1996. The first edition of this ECMA Standard was adopted by the ECMA General Assembly of June 1997. That ECMA Standard was submitted to ISO/IEC JTC 1 for adoption under the fast-track procedure, and approved as international standard ISO/IEC 16262, in April 1998. The ECMA General Assembly of June 1998 approved the second edition of ECMA-262 to keep it fully aligned with ISO/IEC 16262. Changes between the first and the second edition are editorial in nature. The current document defines the third edition of the Standard and includes powerful regular expressions, better string handling, new control statements, try/catch exception handling, tighter definition of errors, formatting for numeric output and minor changes in anticipation of forthcoming internationalisation facilities and future language growth. Work on the language is not complete. The technical committee is working on significant enhancements, including mechanisms for scripts to be created and used across the Internet, and tighter coordination with other standards bodies such as groups within the World Wide Web Consortium and the Wireless Application Protocol Forum. This Standard has been adopted as 3rd Edition of ECMA-262 by the ECMA General Assembly in December, 1999. The following people have contributed to the work leading to ECMA 262: Mike Ang Christine Begle Norris Boyd Carl Cargill Andrew Clinick Donna Converse Mike Cowlishaw Chris Dollin Jeff Dyer Brendan Eich Chris Espinosa Gary Fisher Richard Gabriel Michael Gardner Bill Gibbons Richard Gillam Waldemar Horwat Shon Katzenberg Cedric Krumbein Mike Ksar Roger Lawrence Steve Leach Clayton Lewis Drew Lytle Bob Mathis Karl Matzke Mike McCabe Tom McFarland Anh Nguyen Brent Noorda Andy Palay Dave Raggett Gary Robinson Sam Ruby Dario Russi David Singer Randy Solton Guy Steele Michael Turyn Herman Venter George Wilingmyre Scott Wiltamuth Rok Yu Table of contents  TOC \o "1-3" 1 Scope  PAGEREF _Toc472818713 \h 1 2 Conformance  PAGEREF _Toc472818714 \h 1 3 Normative References  PAGEREF _Toc472818715 \h 1 4 Overview  PAGEREF _Toc472818716 \h 3 4.1 Web Scripting  PAGEREF _Toc472818717 \h 3 4.2 Language Overview  PAGEREF _Toc472818718 \h 3 4.2.1 Objects  PAGEREF _Toc472818719 \h 4 4.3 Definitions  PAGEREF _Toc472818720 \h 5 4.3.1 Type  PAGEREF _Toc472818721 \h 5 4.3.2 Primitive Value  PAGEREF _Toc472818722 \h 5 4.3.3 Object  PAGEREF _Toc472818723 \h 5 4.3.4 Constructor  PAGEREF _Toc472818724 \h 5 4.3.5 Prototype  PAGEREF _Toc472818725 \h 5 4.3.6 Native Object  PAGEREF _Toc472818726 \h 6 4.3.7 Built-in Object  PAGEREF _Toc472818727 \h 6 4.3.8 Host Object  PAGEREF _Toc472818728 \h 6 4.3.9 Undefined Value  PAGEREF _Toc472818729 \h 6 4.3.10 Undefined Type  PAGEREF _Toc472818730 \h 6 4.3.11 Null Value  PAGEREF _Toc472818731 \h 6 4.3.12 Null Type  PAGEREF _Toc472818732 \h 6 4.3.13 Boolean Value  PAGEREF _Toc472818733 \h 6 4.3.14 Boolean Type  PAGEREF _Toc472818734 \h 6 4.3.15 Boolean Object  PAGEREF _Toc472818735 \h 6 4.3.16 String Value  PAGEREF _Toc472818736 \h 6 4.3.17 String Type  PAGEREF _Toc472818737 \h 6 4.3.18 String Object  PAGEREF _Toc472818738 \h 7 4.3.19 Number Value  PAGEREF _Toc472818739 \h 7 4.3.20 Number Type  PAGEREF _Toc472818740 \h 7 4.3.21 Number Object  PAGEREF _Toc472818741 \h 7 4.3.22 Infinity  PAGEREF _Toc472818742 \h 7 4.3.23 NaN  PAGEREF _Toc472818743 \h 7 5 Notational Conventions  PAGEREF _Toc472818744 \h 9 5.1 Syntactic and Lexical Grammars  PAGEREF _Toc472818745 \h 9 5.1.1 Context-Free Grammars  PAGEREF _Toc472818746 \h 9 5.1.2 The Lexical and RegExp Grammars  PAGEREF _Toc472818747 \h 9 5.1.3 The Numeric String Grammar  PAGEREF _Toc472818748 \h 9 5.1.4 The Syntactic Grammar  PAGEREF _Toc472818749 \h 9 5.1.5 Grammar Notation  PAGEREF _Toc472818750 \h 10 5.2 Algorithm Conventions  PAGEREF _Toc472818751 \h 12 6 Source Text  PAGEREF _Toc472818752 \h 15 7 Lexical Conventions  PAGEREF _Toc472818753 \h 17 7.1 Unicode Format-Control Characters  PAGEREF _Toc472818754 \h 17 7.2 White Space  PAGEREF _Toc472818755 \h 17 7.3 Line Terminators  PAGEREF _Toc472818756 \h 18 7.4 Comments  PAGEREF _Toc472818757 \h 18 7.5 Tokens  PAGEREF _Toc472818758 \h 19 7.5.1 Reserved Words  PAGEREF _Toc472818759 \h 19 7.5.2 Keywords  PAGEREF _Toc472818760 \h 19 7.5.3 Future Reserved Words  PAGEREF _Toc472818761 \h 20 7.6 Identifiers  PAGEREF _Toc472818762 \h 20 7.7 Punctuators  PAGEREF _Toc472818763 \h 21 7.8 Literals  PAGEREF _Toc472818764 \h 21 7.8.1 Null Literals  PAGEREF _Toc472818765 \h 21 7.8.2 Boolean Literals  PAGEREF _Toc472818766 \h 22 7.8.3 Numeric Literals  PAGEREF _Toc472818767 \h 22 7.8.4 String Literals  PAGEREF _Toc472818768 \h 24 7.8.5 Regular Expression Literals  PAGEREF _Toc472818769 \h 26 7.9 Automatic Semicolon Insertion  PAGEREF _Toc472818770 \h 26 7.9.1 Rules of Automatic Semicolon Insertion  PAGEREF _Toc472818771 \h 27 7.9.2 Examples of Automatic Semicolon Insertion  PAGEREF _Toc472818772 \h 27 8 Types  PAGEREF _Toc472818773 \h 31 8.1 The Undefined Type  PAGEREF _Toc472818774 \h 31 8.2 The Null Type  PAGEREF _Toc472818775 \h 31 8.3 The Boolean Type  PAGEREF _Toc472818776 \h 31 8.4 The String Type  PAGEREF _Toc472818777 \h 31 8.5 The Number Type  PAGEREF _Toc472818778 \h 31 8.6 The Object Type  PAGEREF _Toc472818779 \h 32 8.6.1 Property Attributes  PAGEREF _Toc472818780 \h 32 8.6.2 Internal Properties and Methods  PAGEREF _Toc472818781 \h 33 8.7 The Reference Type  PAGEREF _Toc472818782 \h 35 8.7.1 GetValue (V)  PAGEREF _Toc472818783 \h 36 8.7.2 PutValue (V, W)  PAGEREF _Toc472818784 \h 36 8.8 The List Type  PAGEREF _Toc472818785 \h 36 8.9 The Completion Type  PAGEREF _Toc472818786 \h 36 9 Type Conversion  PAGEREF _Toc472818787 \h 37 9.1 ToPrimitive  PAGEREF _Toc472818788 \h 37 9.2 ToBoolean  PAGEREF _Toc472818789 \h 37 9.3 ToNumber  PAGEREF _Toc472818790 \h 37 9.3.1 ToNumber Applied to the String Type  PAGEREF _Toc472818791 \h 38 9.4 ToInteger  PAGEREF _Toc472818792 \h 40 9.5 ToInt32: (Signed 32 Bit Integer)  PAGEREF _Toc472818793 \h 40 9.6 ToUint32: (Unsigned 32 Bit Integer)  PAGEREF _Toc472818794 \h 41 9.7 ToUint16: (Unsigned 16 Bit Integer)  PAGEREF _Toc472818795 \h 41 9.8 ToString  PAGEREF _Toc472818796 \h 41 9.8.1 ToString Applied to the Number Type  PAGEREF _Toc472818797 \h 42 9.9 ToObject  PAGEREF _Toc472818798 \h 43 10 Execution Contexts  PAGEREF _Toc472818799 \h 45 10.1 Definitions  PAGEREF _Toc472818800 \h 45 10.1.1 Function Objects  PAGEREF _Toc472818801 \h 45 10.1.2 Types of Executable Code  PAGEREF _Toc472818802 \h 45 10.1.3 Variable Instantiation  PAGEREF _Toc472818803 \h 45 10.1.4 Scope Chain and Identifier Resolution  PAGEREF _Toc472818804 \h 46 10.1.5 Global Object  PAGEREF _Toc472818805 \h 46 10.1.6 Activation Object  PAGEREF _Toc472818806 \h 46 10.1.7 This  PAGEREF _Toc472818807 \h 47 10.1.8 Arguments Object  PAGEREF _Toc472818808 \h 47 10.2 Entering An Execution Context  PAGEREF _Toc472818809 \h 47 10.2.1 Global Code  PAGEREF _Toc472818810 \h 47 10.2.2 Eval Code  PAGEREF _Toc472818811 \h 47 10.2.3 Function Code  PAGEREF _Toc472818812 \h 47 11 Expressions  PAGEREF _Toc472818813 \h 49 11.1 Primary Expressions  PAGEREF _Toc472818814 \h 49 11.1.1 The this Keyword  PAGEREF _Toc472818815 \h 49 11.1.2 Identifier Reference  PAGEREF _Toc472818816 \h 49 11.1.3 Literal Reference  PAGEREF _Toc472818817 \h 49 11.1.4 Array Initialiser  PAGEREF _Toc472818818 \h 49 11.1.5 Object Initialiser  PAGEREF _Toc472818819 \h 50 11.1.6 The Grouping Operator  PAGEREF _Toc472818820 \h 51 11.2 Left-Hand-Side Expressions  PAGEREF _Toc472818821 \h 51 11.2.1 Property Accessors  PAGEREF _Toc472818822 \h 52 11.2.2 The new Operator  PAGEREF _Toc472818823 \h 53 11.2.3 Function Calls  PAGEREF _Toc472818824 \h 53 11.2.4 Argument Lists  PAGEREF _Toc472818825 \h 53 11.2.5 Function Expressions  PAGEREF _Toc472818826 \h 54 11.3 Postfix Expressions  PAGEREF _Toc472818827 \h 54 11.3.1 Postfix Increment Operator  PAGEREF _Toc472818828 \h 54 11.3.2 Postfix Decrement Operator  PAGEREF _Toc472818829 \h 54 11.4 Unary Operators  PAGEREF _Toc472818830 \h 54 11.4.1 The delete Operator  PAGEREF _Toc472818831 \h 55 11.4.2 The void Operator  PAGEREF _Toc472818832 \h 55 11.4.3 The typeof Operator  PAGEREF _Toc472818833 \h 55 11.4.4 Prefix Increment Operator  PAGEREF _Toc472818834 \h 55 11.4.5 Prefix Decrement Operator  PAGEREF _Toc472818835 \h 56 11.4.6 Unary + Operator  PAGEREF _Toc472818836 \h 56 11.4.7 Unary - Operator  PAGEREF _Toc472818837 \h 56 11.4.8 Bitwise NOT Operator ( ~ )  PAGEREF _Toc472818838 \h 56 11.4.9 Logical NOT Operator ( ! )  PAGEREF _Toc472818839 \h 56 11.5 Multiplicative Operators  PAGEREF _Toc472818840 \h 57 11.5.1 Applying the * Operator  PAGEREF _Toc472818841 \h 57 11.5.2 Applying the / Operator  PAGEREF _Toc472818842 \h 57 11.5.3 Applying the % Operator  PAGEREF _Toc472818843 \h 58 11.6 Additive Operators  PAGEREF _Toc472818844 \h 58 11.6.1 The Addition operator ( + )  PAGEREF _Toc472818845 \h 58 11.6.2 The Subtraction Operator ( - )  PAGEREF _Toc472818846 \h 59 11.6.3 Applying the Additive Operators ( +,- ) to Numbers  PAGEREF _Toc472818847 \h 59 11.7 Bitwise Shift Operators  PAGEREF _Toc472818848 \h 59 11.7.1 The Left Shift Operator ( << )  PAGEREF _Toc472818849 \h 60 11.7.2 The Signed Right Shift Operator ( >> )  PAGEREF _Toc472818850 \h 60 11.7.3 The Unsigned Right Shift Operator ( >>> )  PAGEREF _Toc472818851 \h 60 11.8 Relational Operators  PAGEREF _Toc472818852 \h 60 11.8.1 The Less-than Operator ( < )  PAGEREF _Toc472818853 \h 61 11.8.2 The Greater-than Operator ( > )  PAGEREF _Toc472818854 \h 61 11.8.3 The Less-than-or-equal Operator ( <= )  PAGEREF _Toc472818855 \h 61 11.8.4 The Greater-than-or-equal Operator ( >= )  PAGEREF _Toc472818856 \h 61 11.8.5 The Abstract Relational Comparison Algorithm  PAGEREF _Toc472818857 \h 62 11.8.6 The instanceof operator  PAGEREF _Toc472818858 \h 62 11.8.7 The in operator  PAGEREF _Toc472818859 \h 62 11.9 Equality Operators  PAGEREF _Toc472818860 \h 63 11.9.1 The Equals Operator ( == )  PAGEREF _Toc472818861 \h 63 11.9.2 The Does-not-equals Operator ( != )  PAGEREF _Toc472818862 \h 63 11.9.3 The Abstract Equality Comparison Algorithm  PAGEREF _Toc472818863 \h 63 11.9.4 The Strict Equals Operator ( === )  PAGEREF _Toc472818864 \h 64 11.9.5 The Strict Does-not-equal Operator ( !== )  PAGEREF _Toc472818865 \h 64 11.9.6 The Strict Equality Comparison Algorithm  PAGEREF _Toc472818866 \h 65 11.10 Binary Bitwise Operators  PAGEREF _Toc472818867 \h 65 11.11 Binary Logical Operators  PAGEREF _Toc472818868 \h 66 11.12 Conditional Operator ( ?: )  PAGEREF _Toc472818869 \h 66 11.13 Assignment Operators  PAGEREF _Toc472818870 \h 67 11.13.1 Simple Assignment ( = )  PAGEREF _Toc472818871 \h 67 11.13.2 Compound Assignment ( op= )  PAGEREF _Toc472818872 \h 68 11.14 Comma Operator ( , )  PAGEREF _Toc472818873 \h 68 12 Statements  PAGEREF _Toc472818874 \h 69 12.1 Block  PAGEREF _Toc472818875 \h 69 12.2 Variable statement  PAGEREF _Toc472818876 \h 70 12.3 Empty Statement  PAGEREF _Toc472818877 \h 71 12.4 Expression Statement  PAGEREF _Toc472818878 \h 71 12.5 The if Statement  PAGEREF _Toc472818879 \h 71 12.6 Iteration Statements  PAGEREF _Toc472818880 \h 72 12.6.1 The do-while Statement  PAGEREF _Toc472818881 \h 72 12.6.2 The while statement  PAGEREF _Toc472818882 \h 72 12.6.3 The for Statement  PAGEREF _Toc472818883 \h 73 12.6.4 The for-in Statement  PAGEREF _Toc472818884 \h 73 12.7 The continue Statement  PAGEREF _Toc472818885 \h 74 12.8 The break Statement  PAGEREF _Toc472818886 \h 75 12.9 The return Statement  PAGEREF _Toc472818887 \h 75 12.10 The with Statement  PAGEREF _Toc472818888 \h 75 12.11 The switch Statement  PAGEREF _Toc472818889 \h 76 12.12 Labelled Statements  PAGEREF _Toc472818890 \h 77 12.13 The throw statement  PAGEREF _Toc472818891 \h 77 12.14 The try statement  PAGEREF _Toc472818892 \h 77 13 Function Definition  PAGEREF _Toc472818893 \h 79 13.1 Definitions  PAGEREF _Toc472818894 \h 79 13.1.1 Equated Grammar Productions  PAGEREF _Toc472818895 \h 80 13.1.2 Joined Objects  PAGEREF _Toc472818896 \h 80 13.2 Creating Function Objects  PAGEREF _Toc472818897 \h 80 13.2.1 [[Call]]  PAGEREF _Toc472818898 \h 81 13.2.2 [[Construct]]  PAGEREF _Toc472818899 \h 81 14 Program  PAGEREF _Toc472818900 \h 83 15 Native ECMAScript Objects  PAGEREF _Toc472818901 \h 85 15.1 The Global Object  PAGEREF _Toc472818902 \h 85 15.1.1 Value Properties of the Global Object  PAGEREF _Toc472818903 \h 86 15.1.2 Function Properties of the Global Object  PAGEREF _Toc472818904 \h 86 15.1.3 URI Handling Function Properties  PAGEREF _Toc472818905 \h 87 15.1.4 Constructor Properties of the Global Object  PAGEREF _Toc472818906 \h 91 15.1.5 Other Properties of the Global Object  PAGEREF _Toc472818907 \h 92 15.2 Object Objects  PAGEREF _Toc472818908 \h 92 15.2.1 The Object Constructor Called as a Function  PAGEREF _Toc472818909 \h 92 15.2.2 The Object Constructor  PAGEREF _Toc472818910 \h 92 15.2.3 Properties of the Object Constructor  PAGEREF _Toc472818911 \h 93 15.2.4 Properties of the Object Prototype Object  PAGEREF _Toc472818912 \h 93 15.2.5 Properties of Object Instances  PAGEREF _Toc472818913 \h 94 15.3 Function Objects  PAGEREF _Toc472818914 \h 94 15.3.1 The Function Constructor Called as a Function  PAGEREF _Toc472818915 \h 94 15.3.2 The Function Constructor  PAGEREF _Toc472818916 \h 94 15.3.3 Properties of the Function Constructor  PAGEREF _Toc472818917 \h 95 15.3.4 Properties of the Function Prototype Object  PAGEREF _Toc472818918 \h 95 15.3.5 Properties of Function Instances  PAGEREF _Toc472818919 \h 96 15.4 Array Objects  PAGEREF _Toc472818920 \h 96 15.4.1 The Array Constructor Called as a Function  PAGEREF _Toc472818921 \h 97 15.4.2 The Array Constructor  PAGEREF _Toc472818922 \h 97 15.4.3 Properties of the Array Constructor  PAGEREF _Toc472818923 \h 97 15.4.4 Properties of the Array Prototype Object  PAGEREF _Toc472818924 \h 98 15.4.5 Properties of Array Instances  PAGEREF _Toc472818925 \h 105 15.5 String Objects  PAGEREF _Toc472818926 \h 106 15.5.1 The String Constructor Called as a Function  PAGEREF _Toc472818927 \h 106 15.5.2 The String Constructor  PAGEREF _Toc472818928 \h 106 15.5.3 Properties of the String Constructor  PAGEREF _Toc472818929 \h 106 15.5.4 Properties of the String Prototype Object  PAGEREF _Toc472818930 \h 107 15.5.5 Properties of String Instances  PAGEREF _Toc472818931 \h 114 15.6 Boolean Objects  PAGEREF _Toc472818932 \h 114 15.6.1 The Boolean Constructor Called as a Function  PAGEREF _Toc472818933 \h 114 15.6.2 The Boolean Constructor  PAGEREF _Toc472818934 \h 114 15.6.3 Properties of the Boolean Constructor  PAGEREF _Toc472818935 \h 114 15.6.4 Properties of the Boolean Prototype Object  PAGEREF _Toc472818936 \h 114 15.6.5 Properties of Boolean Instances  PAGEREF _Toc472818937 \h 115 15.7 Number Objects  PAGEREF _Toc472818938 \h 115 15.7.1 The Number Constructor Called as a Function  PAGEREF _Toc472818939 \h 115 15.7.2 The Number Constructor  PAGEREF _Toc472818940 \h 115 15.7.3 Properties of the Number Constructor  PAGEREF _Toc472818941 \h 115 15.7.4 Properties of the Number Prototype Object  PAGEREF _Toc472818942 \h 116 15.7.5 Properties of Number Instances  PAGEREF _Toc472818943 \h 119 15.8 The Math Object  PAGEREF _Toc472818944 \h 119 15.8.1 Value Properties of the Math Object  PAGEREF _Toc472818945 \h 119 15.8.2 Function Properties of the Math Object  PAGEREF _Toc472818946 \h 120 15.9 Date Objects  PAGEREF _Toc472818947 \h 125 15.9.1 Overview of Date Objects and Definitions of Internal Operators  PAGEREF _Toc472818948 \h 125 15.9.2 The Date Constructor Called as a Function  PAGEREF _Toc472818949 \h 129 15.9.3 The Date Constructor  PAGEREF _Toc472818950 \h 129 15.9.4 Properties of the Date Constructor  PAGEREF _Toc472818951 \h 130 15.9.5 Properties of the Date Prototype Object  PAGEREF _Toc472818952 \h 131 15.9.6 Properties of Date Instances  PAGEREF _Toc472818953 \h 137 15.10 RegExp (Regular Expression) Objects  PAGEREF _Toc472818954 \h 137 15.10.1 Patterns  PAGEREF _Toc472818955 \h 137 15.10.2 Pattern Semantics  PAGEREF _Toc472818956 \h 139 15.10.3 The RegExp Constructor Called as a Function  PAGEREF _Toc472818957 \h 151 15.10.4 The RegExp Constructor  PAGEREF _Toc472818958 \h 151 15.10.5 Properties of the RegExp Constructor  PAGEREF _Toc472818959 \h 151 15.10.6 Properties of the RegExp Prototype Object  PAGEREF _Toc472818960 \h 152 15.10.7 Properties of RegExp Instances  PAGEREF _Toc472818961 \h 153 15.11 Error Objects  PAGEREF _Toc472818962 \h 153 15.11.1 The Error Constructor Called as a Function  PAGEREF _Toc472818963 \h 153 15.11.2 The Error Constructor  PAGEREF _Toc472818964 \h 153 15.11.3 Properties of the Error Constructor  PAGEREF _Toc472818965 \h 154 15.11.4 Properties of the Error Prototype Object  PAGEREF _Toc472818966 \h 154 15.11.5 Properties of Error Instances  PAGEREF _Toc472818967 \h 154 15.11.6 Native Error Types Used in This Standard  PAGEREF _Toc472818968 \h 154 15.11.7 NativeError Object Structure  PAGEREF _Toc472818969 \h 155 16 Errors  PAGEREF _Toc472818970 \h 157 A Grammar Summary  PAGEREF _Toc472818971 \h 159 A.1 Lexical Grammar  PAGEREF _Toc472818972 \h 159 A.2 Number Conversions  PAGEREF _Toc472818973 \h 164 A.3 Expressions  PAGEREF _Toc472818974 \h 165 A.4 Statements  PAGEREF _Toc472818975 \h 169 A.5 Functions and Programs  PAGEREF _Toc472818976 \h 171 A.6 Universal Resource Identifier Character Classes  PAGEREF _Toc472818977 \h 171 A.7 Regular Expressions  PAGEREF _Toc472818978 \h 172 B Compatibility  PAGEREF _Toc472818979 \h 175 B.1 Additional Syntax  PAGEREF _Toc472818980 \h 175 B.1.1 Numeric Literals  PAGEREF _Toc472818981 \h 175 B.1.2 String Literals  PAGEREF _Toc472818982 \h 175 B.2 Additional Properties  PAGEREF _Toc472818983 \h 176 B.2.1 escape (string)  PAGEREF _Toc472818984 \h 176 B.2.2 unescape (string)  PAGEREF _Toc472818985 \h 177 B.2.3 String.prototype.substr (start, length)  PAGEREF _Toc472818986 \h 177 B.2.4 Date.prototype.getYear ( )  PAGEREF _Toc472818987 \h 178 B.2.5 Date.prototype.setYear (year)  PAGEREF _Toc472818988 \h 178 B.2.6 Date.prototype.toGMTString ( )  PAGEREF _Toc472818989 \h 178  Scope This Standard defines the ECMAScript scripting language. Conformance A conforming implementation of ECMAScript must provide and support all the types, values, objects, properties, functions, and program syntax and semantics described in this specification. A conforming implementation of this International standard shall interpret characters in conformance with the Unicode Standard, Version 2.1 or later, and ISO/IEC 10646-1 with either UCS-2 or UTF-16 as the adopted encoding form, implementation level 3. If the adopted ISO/IEC 10646-1 subset is not otherwise specified, it is presumed to be the BMP subset, collection 300. If the adopted encoding form is not otherwise specified, it presumed to be the UTF-16 encoding form. A conforming implementation of ECMAScript is permitted to provide additional types, values, objects, properties, and functions beyond those described in this specification. In particular, a conforming implementation of ECMAScript is permitted to provide properties not described in this specification, and values for those properties, for objects that are described in this specification. A conforming implementation of ECMAScript is permitted to support program and regular expression syntax not described in this specification. In particular, a conforming implementation of ECMAScript is permitted to support program syntax that makes use of the future reserved words listed in section  REF _Ref378325359 \r \h 7.5.3 of this specification. Normative References ISO/IEC 9899:1996 Programming Languages C, including amendment 1 and technical corrigenda 1 and 2. ISO/IEC 10646-1:1993 Information Technology -- Universal Multiple-Octet Coded Character Set (UCS) plus its amendments and corrigenda. Unicode Inc. (1996), The Unicode Standard(, Version 2.0. ISBN: 0-201-48345-9, Addison-Wesley Publishing Co., Menlo Park, California. Unicode Inc. (1998), Unicode Technical Report #8: The Unicode Standard(, Version 2.1. Unicode Inc. (1998), Unicode Technical Report #15: Unicode Normalization Forms. ANSI/IEEE Std 754-1985: IEEE Standard for Binary Floating-Point Arithmetic. Institute of Electrical and Electronic Engineers, New York (1985). Overview This section contains a non-normative overview of the ECMAScript language. ECMAScript is an object-oriented programming language for performing computations and manipulating computational objects within a host environment. ECMAScript as defined here is not intended to be computationally self-sufficient; indeed, there are no provisions in this specification for input of external data or output of computed results. Instead, it is expected that the computational environment of an ECMAScript program will provide not only the objects and other facilities described in this specification but also certain environment-specific host objects, whose description and behaviour are beyond the scope of this specification except to indicate that they may provide certain properties that can be accessed and certain functions that can be called from an ECMAScript program. A scripting language is a programming language that is used to manipulate, customise, and automate the facilities of an existing system. In such systems, useful functionality is already available through a user interface, and the scripting language is a mechanism for exposing that functionality to program control. In this way, the existing system is said to provide a host environment of objects and facilities, which completes the capabilities of the scripting language. A scripting language is intended for use by both professional and non-professional programmers. To accommodate non-professional programmers, some aspects of the language may be somewhat less strict. ECMAScript was originally designed to be a Web scripting language, providing a mechanism to enliven Web pages in browsers and to perform server computation as part of a Web-based client-server architecture. ECMAScript can provide core scripting capabilities for a variety of host environments, and therefore the core scripting language is specified in this document apart from any particular host environment. Some of the facilities of ECMAScript are similar to those used in other programming languages; in particular Java( and Self, as described in: Gosling, James, Bill Joy and Guy Steele. The Java( Language Specification. Addison Wesley Publishing Co., 1996. Ungar, David, and Smith, Randall B. Self: The Power of Simplicity. OOPSLA '87 Conference Proceedings, pp. 227241, Orlando, FL, October 1987. Web Scripting A web browser provides an ECMAScript host environment for client-side computation including, for instance, objects that represent windows, menus, pop-ups, dialog boxes, text areas, anchors, frames, history, cookies, and input/output. Further, the host environment provides a means to attach scripting code to events such as change of focus, page and image loading, unloading, error and abort, selection, form submission, and mouse actions. Scripting code appears within the HTML and the displayed page is a combination of user interface elements and fixed and computed text and images. The scripting code is reactive to user interaction and there is no need for a main program. A web server provides a different host environment for server-side computation including objects representing requests, clients, and files; and mechanisms to lock and share data. By using browser-side and server-side scripting together, it is possible to distribute computation between the client and server while providing a customised user interface for a Web-based application. Each Web browser and server that supports ECMAScript supplies its own host environment, completing the ECMAScript execution environment. Language Overview The following is an informal overview of ECMAScriptnot all parts of the language are described. This overview is not part of the standard proper. ECMAScript is object-based: basic language and host facilities are provided by objects, and an ECMAScript program is a cluster of communicating objects. An ECMAScript object is an unordered collection of properties each with zero or more attributes that determine how each property can be usedfor example, when the ReadOnly attribute for a property is set to true, any attempt by executed ECMAScript code to change the value of the property has no effect. Properties are containers that hold other objects, primitive values, or methods. A primitive value is a member of one of the following built-in types: Undefined, Null, Boolean, Number, and String; an object is a member of the remaining built-in type Object; and a method is a function associated with an object via a property. ECMAScript defines a collection of built-in objects that round out the definition of ECMAScript entities. These built-in objects include the Global object, the Object object, the Function object, the Array object, the String object, the Boolean object, the Number object, the Math object, the Date object, the RegExp object and the Error objects Error, EvalError, RangeError, ReferenceError, SyntaxError, TypeError and URIError. ECMAScript also defines a set of built-in operators that may not be, strictly speaking, functions or methods. ECMAScript operators include various unary operations, multiplicative operators, additive operators, bitwise shift operators, relational operators, equality operators, binary bitwise operators, binary logical operators, assignment operators, and the comma operator. ECMAScript syntax intentionally resembles Java syntax. ECMAScript syntax is relaxed to enable it to serve as an easy-to-use scripting language. For example, a variable is not required to have its type declared nor are types associated with properties, and defined functions are not required to have their declarations appear textually before calls to them. Objects ECMAScript does not contain proper classes such as those in C++, Smalltalk, or Java, but rather, supports constructors which create objects by executing code that allocates storage for the objects and initialises all or part of them by assigning initial values to their properties. All constructors are objects, but not all objects are constructors. Each constructor has a Prototype property that is used to implement prototype-based inheritance and shared properties. Objects are created by using constructors in new expressions; for example, new String("A String") creates a new String object. Invoking a constructor without using new has consequences that depend on the constructor. For example, String("A String") produces a primitive string, not an object. ECMAScript supports prototype-based inheritance. Every constructor has an associated prototype, and every object created by that constructor has an implicit reference to the prototype (called the objects prototype) associated with its constructor. Furthermore, a prototype may have a non-null implicit reference to its prototype, and so on; this is called the prototype chain. When a reference is made to a property in an object, that reference is to the property of that name in the first object in the prototype chain that contains a property of that name. In other words, first the object mentioned directly is examined for such a property; if that object contains the named property, that is the property to which the reference refers; if that object does not contain the named property, the prototype for that object is examined next; and so on. In a class-based object-oriented language, in general, state is carried by instances, methods are carried by classes, and inheritance is only of structure and behaviour. In ECMAScript, the state and methods are carried by objects, and structure, behaviour, and state are all inherited. All objects that do not directly contain a particular property that their prototype contains share that property and its value. The following diagram illustrates this:  CF is a constructor (and also an object). Five objects have been created by using new expressions: cf1, cf2, cf3, cf4, and cf5. Each of these objects contains properties named q1 and q2. The dashed lines represent the implicit prototype relationship; so, for example, cf3s prototype is CFp. The constructor, CF, has two properties itself, named P1 and P2, which are not visible to CFp, cf1, cf2, cf3, cf4, or cf5. The property named CFP1 in CFp is shared by cf1, cf2, cf3, cf4, and cf5 (but not by cf), as are any properties found in CFps implicit prototype chain that are not named q1, q2, or CFP1. Notice that there is no implicit prototype link between CF and CFp. Unlike class-based object languages, properties can be added to objects dynamically by assigning values to them. That is, constructors are not required to name or assign values to all or any of the constructed objects properties. In the above diagram, one could add a new shared property for cf1, cf2, cf3, cf4, and cf5 by assigning a new value to the property in CFp. Definitions The following are informal definitions of key terms associated with ECMAScript. Type A type is a set of data values. Primitive Value A primitive value is a member of one of the types Undefined, Null, Boolean, Number, or String. A primitive value is a datum that is represented directly at the lowest level of the language implementation. Object An object is a member of the type Object. It is an unordered collection of properties each of which contains a primitive value, object, or function. A function stored in a property of an object is called a method. Constructor A constructor is a Function object that creates and initialises objects. Each constructor has an associated prototype object that is used to implement inheritance and shared properties. Prototype A prototype is an object used to implement structure, state, and behaviour inheritance in ECMAScript. When a constructor creates an object, that object implicitly references the constructors associated prototype for the purpose of resolving property references. The constructors associated prototype can be referenced by the program expression constructor.prototype, and properties added to an objects prototype are shared, through inheritance, by all objects sharing the prototype. Native Object A native object is any object supplied by an ECMAScript implementation independent of the host environment. Standard native objects are defined in this specification. Some native objects are built-in; others may be constructed during the course of execution of an ECMAScript program. Built-in Object A built-in object is any object supplied by an ECMAScript implementation, independent of the host environment, which is present at the start of the execution of an ECMAScript program. Standard built-in objects are defined in this specification, and an ECMAScript implementation may specify and define others. Every built-in object is a native object. Host Object A host object is any object supplied by the host environment to complete the execution environment of ECMAScript. Any object that is not native is a host object. Undefined Value The undefined value is a primitive value used when a variable has not been assigned a value. Undefined Type The type Undefined has exactly one value, called undefined. Null Value The null value is a primitive value that represents the null, empty, or non-existent reference. Null Type The type Null has exactly one value, called null. Boolean Value A boolean value is a member of the type Boolean and is one of two unique values, true and false. Boolean Type The type Boolean represents a logical entity and consists of exactly two unique values. One is called true and the other is called false. Boolean Object A Boolean object is a member of the type Object and is an instance of the built-in Boolean object. That is, a Boolean object is created by using the Boolean constructor in a new expression, supplying a boolean as an argument. The resulting object has an implicit (unnamed) property that is the boolean. A Boolean object can be coerced to a boolean value. String Value A string value is a member of the type String and is a finite ordered sequence of zero or more 16-bit unsigned integer values. NOTE Although each value usually represents a single 16-bit unit of UTF-16 text, the language does not place any restrictions or requirements on the values except that they be 16-bit unsigned integers. String Type The type String is the set of all string values. String Object A String object is a member of the type Object and is an instance of the built-in String object. That is, a String object is created by using the String constructor in a new expression, supplying a string as an argument. The resulting object has an implicit (unnamed) property that is the string. A String object can be coerced to a string value by calling the String constructor as a function (section  REF _Ref424531760 \r \h 15.5.1). Number Value A number value is a member of the type Number and is a direct representation of a number. Number Type The type Number is a set of values representing numbers. In ECMAScript, the set of values represents the double-precision 64-bit format IEEE 754 values including the special Not-a-Number (NaN) values, positive infinity, and negative infinity. Number Object A Number object is a member of the type Object and is an instance of the built-in Number object. That is, a Number object is created by using the Number constructor in a new expression, supplying a number as an argument. The resulting object has an implicit (unnamed) property that is the number. A Number object can be coerced to a number value by calling the Number constructor as a function (section  REF _Ref424531823 \r \h 15.7.1). Infinity The primitive value Infinity represents the positive infinite number value. This value is a member of the Number type. NaN The primitive value NaN represents the set of IEEE Standard Not-a-Number values. This value is a member of the Number type. Notational Conventions Syntactic and Lexical Grammars This section describes the context-free grammars used in this specification to define the lexical and syntactic structure of an ECMAScript program. Context-Free Grammars A context-free grammar consists of a number of productions. Each production has an abstract symbol called a nonterminal as its left-hand side, and a sequence of zero or more nonterminal and terminal symbols as its right-hand side. For each grammar, the terminal symbols are drawn from a specified alphabet. Starting from a sentence consisting of a single distinguished nonterminal, called the goal symbol, a given context-free grammar specifies a language, namely, the (perhaps infinite) set of possible sequences of terminal symbols that can result from repeatedly replacing any nonterminal in the sequence with a right-hand side of a production for which the nonterminal is the left-hand side. The Lexical and RegExp Grammars A lexical grammar for ECMAScript is given in section  REF _Ref463686584 \r \h 7. This grammar has as its terminal symbols the characters of the Unicode character set. It defines a set of productions, starting from the goal symbol InputElementDiv or InputElementRegExp, that describe how sequences of Unicode characters are translated into a sequence of input elements. Input elements other than white space and comments form the terminal symbols for the syntactic grammar for ECMAScript and are called ECMAScript tokens. These tokens are the reserved words, identifiers, literals, and punctuators of the ECMAScript language. Moreover, line terminators, although not considered to be tokens, also become part of the stream of input elements and guide the process of automatic semicolon insertion (section  REF _Ref424530589 \r \h 7.8.5). Simple white space and single-line comments are discarded and do not appear in the stream of input elements for the syntactic grammar. A MultiLineComment (that is, a comment of the form /**/ regardless of whether it spans more than one line) is likewise simply discarded if it contains no line terminator; but if a MultiLineComment contains one or more line terminators, then it is replaced by a single line terminator, which becomes part of the stream of input elements for the syntactic grammar. A RegExp grammar for ECMAScript is given in section  REF _Ref404565288 \r \h 15.10. This grammar also has as its terminal symbols the characters of the Unicode character set. It defines a set of productions, starting from the goal symbol Pattern, that describe how sequences of Unicode characters are translated into regular expression patterns. Productions of the lexical and RegExp grammars are distinguished by having two colons :: as separating punctuation. The lexical and RegExp grammars share some productions. The Numeric String Grammar A second grammar is used for translating strings into numeric values. This grammar is similar to the part of the lexical grammar having to do with numeric literals and has as its terminal symbols the characters of the Unicode character set. This grammar appears in section  REF _Ref456028389 \r \h 9.3.1. Productions of the numeric string grammar are distinguished by having three colons ::: as punctuation. The Syntactic Grammar The syntactic grammar for ECMAScript is given in sections  REF _Ref457744587 \r 11,  REF _Ref457437637 \r 12,  REF _Ref457101484 \r 13 and  REF _Ref457437688 \r 14. This grammar has ECMAScript tokens defined by the lexical grammar as its terminal symbols (section  REF _Ref424530657 \r \h 5.1.2). It defines a set of productions, starting from the goal symbol Program, that describe how sequences of tokens can form syntactically correct ECMAScript programs. When a stream of Unicode characters is to be parsed as an ECMAScript program, it is first converted to a stream of input elements by repeated application of the lexical grammar; this stream of input elements is then parsed by a single application of the syntax grammar. The program is syntactically in error if the tokens in the stream of input elements cannot be parsed as a single instance of the goal nonterminal Program, with no tokens left over. Productions of the syntactic grammar are distinguished by having just one colon : as punctuation. The syntactic grammar as presented in sections  REF _Ref457744587 \r 11,  REF _Ref457437637 \r 12,  REF _Ref457101484 \r 13 and  REF _Ref457437688 \r 14 is actually not a complete account of which token sequences are accepted as correct ECMAScript programs. Certain additional token sequences are also accepted, namely, those that would be described by the grammar if only semicolons were added to the sequence in certain places (such as before line terminator characters). Furthermore, certain token sequences that are described by the grammar are not considered acceptable if a terminator character appears in certain awkward places. Grammar Notation Terminal symbols of the lexical and string grammars, and some of the terminal symbols of the syntactic grammar, are shown in fixed width font, both in the productions of the grammars and throughout this specification whenever the text directly refers to such a terminal symbol. These are to appear in a program exactly as written. All nonterminal characters specified in this way are to be understood as the appropriate Unicode character from the ASCII range, as opposed to any similar-looking characters from other Unicode ranges. Nonterminal symbols are shown in italic type. The definition of a nonterminal is introduced by the name of the nonterminal being defined followed by one or more colons. (The number of colons indicates to which grammar the production belongs.) One or more alternative right-hand sides for the nonterminal then follow on succeeding lines. For example, the syntactic definition: WithStatement : with ( Expression ) Statement states that the nonterminal WithStatement represents the token with, followed by a left parenthesis token, followed by an Expression, followed by a right parenthesis token, followed by a Statement. The occurrences of Expression and Statement are themselves nonterminals. As another example, the syntactic definition: ArgumentList : AssignmentExpression ArgumentList , AssignmentExpression states that an ArgumentList may represent either a single AssignmentExpression or an ArgumentList, followed by a comma, followed by an AssignmentExpression. This definition of ArgumentList is recursive, that is, it is defined in terms of itself. The result is that an ArgumentList may contain any positive number of arguments, separated by commas, where each argument expression is an AssignmentExpression. Such recursive definitions of nonterminals are common. The subscripted suffix opt, which may appear after a terminal or nonterminal, indicates an optional symbol. The alternative containing the optional symbol actually specifies two right-hand sides, one that omits the optional element and one that includes it. This means that: VariableDeclaration : Identifier Initialiseropt is a convenient abbreviation for: VariableDeclaration : Identifier Identifier Initialiser and that: IterationStatement : for ( ExpressionNoInopt ; Expressionopt ; Expressionopt ) Statement is a convenient abbreviation for: IterationStatement : for ( ; Expressionopt ; Expressionopt ) Statement for ( ExpressionNoIn ; Expressionopt ; Expressionopt ) Statement which in turn is an abbreviation for: IterationStatement : for ( ; ; Expressionopt ) Statement for ( ; Expression ; Expressionopt ) Statement for ( ExpressionNoIn ; ; Expressionopt ) Statement for ( ExpressionNoIn ; Expression ; Expressionopt ) Statement which in turn is an abbreviation for: IterationStatement : for ( ; ; ) Statement for ( ; ; Expression ) Statement for ( ; Expression ; ) Statement for ( ; Expression ; Expression ) Statement for ( ExpressionNoIn ; ; ) Statement for ( ExpressionNoIn ; ; Expression ) Statement for ( ExpressionNoIn ; Expression ; ) Statement for ( ExpressionNoIn ; Expression ; Expression ) Statement so the nonterminal IterationStatement actually has eight alternative right-hand sides. If the phrase [empty] appears as the right-hand side of a production, it indicates that the production's right-hand side contains no terminals or nonterminals. If the phrase [lookahead ( set] appears in the right-hand side of a production, it indicates that the production may not be used if the immediately following input terminal is a member of the given set. The set can be written as a list of terminals enclosed in curly braces. For convenience, the set can also be written as a nonterminal, in which case it represents the set of all terminals to which that nonterminal could expand. For example, given the definitions DecimalDigit :: one of 0 1 2 3 4 5 6 7 8 9 DecimalDigits :: DecimalDigit DecimalDigits DecimalDigit the definition LookaheadExample :: n [lookahead ( {1, 3, 5, 7, 9}] DecimalDigits DecimalDigit [lookahead ( DecimalDigit ] matches either the letter n followed by one or more decimal digits the first of which is even, or a decimal digit not followed by another decimal digit. If the phrase [no LineTerminator here] appears in the right-hand side of a production of the syntactic grammar, it indicates that the production is a restricted production: it may not be used if a LineTerminator occurs in the input stream at the indicated position. For example, the production: ReturnStatement : return [no LineTerminator here] Expressionopt ; indicates that the production may not be used if a LineTerminator occurs in the program between the return token and the Expression. Unless the presence of a LineTerminator is forbidden by a restricted production, any number of occurrences of LineTerminator may appear between any two consecutive tokens in the stream of input elements without affecting the syntactic acceptability of the program. When the words one of follow the colon(s) in a grammar definition, they signify that each of the terminal symbols on the following line or lines is an alternative definition. For example, the lexical grammar for ECMAScript contains the production: NonZeroDigit :: one of 1 2 3 4 5 6 7 8 9 which is merely a convenient abbreviation for: NonZeroDigit :: one of 1 2 3 4 5 6 7 8 9 When an alternative in a production of the lexical grammar or the numeric string grammar appears to be a multi-character token, it represents the sequence of characters that would make up such a token. The right-hand side of a production may specify that certain expansions are not permitted by using the phrase but not and then indicating the expansions to be excluded. For example, the production: Identifier :: IdentifierName but not ReservedWord means that the nonterminal Identifier may be replaced by any sequence of characters that could replace IdentifierName provided that the same sequence of characters could not replace ReservedWord. Finally, a few nonterminal symbols are described by a descriptive phrase in roman type in cases where it would be impractical to list all the alternatives: SourceCharacter :: any Unicode character Algorithm Conventions The specification often uses a numbered list to specify steps in an algorithm. These algorithms are used to clarify semantics. In practice, there may be more efficient algorithms available to implement a given feature. When an algorithm is to produce a value as a result, the directive return x is used to indicate that the result of the algorithm is the value of x and that the algorithm should terminate. The notation Result(n) is used as shorthand for the result of step n. Type(x) is used as shorthand for the type of x. Mathematical operations such as addition, subtraction, negation, multiplication, division, and the mathematical functions defined later in this section should always be understood as computing exact mathematical results on mathematical real numbers, which do not include infinities and do not include a negative zero that is distinguished from positive zero. Algorithms in this standard that model floating-point arithmetic include explicit steps, where necessary, to handle infinities and signed zero and to perform rounding. If a mathematical operation or function is applied to a floating-point number, it should be understood as being applied to the exact mathematical value represented by that floating-point number; such a floating-point number must be finite, and if it is +0 or (0 then the corresponding mathematical value is simply 0. The mathematical function abs(x) yields the absolute value of x, which is (x if x is negative (less than zero) and otherwise is x itself. The mathematical function sign(x) yields 1 if x is positive and (1 if x is negative. The sign function is not used in this standard for cases when x is zero. The notation x modulo y (y must be finite and nonzero) computes a value k of the same sign as y (or zero) such that abs(k) < abs(y) and x(k = q ( y for some integer q. The mathematical function floor(x) yields the largest integer (closest to positive infinity) that is not larger than x. NOTE floor(x) = x((x modulo 1). If an algorithm is defined to throw an exception, execution of the algorithm is terminated and no result is returned. The calling algorithms are also terminated, until an algorithm step is reached that explicitly deals with the exception, using terminology such as If an exception was thrown. Once such an algorithm step has been encountered the exception is no longer considered to have occurred. Source Text ECMAScript source text is represented as a sequence of characters in the Unicode character encoding, version 2.1 or later, using the UTF-16 transformation format. The text is expected to have been normalised to Unicode Normalised Form C (canonical composition), as described in Unicode Technical Report #15. Conforming ECMAScript implementations are not required to perform any normalisation of text, or behave as though they were performing normalisation of text, themselves. SourceCharacter :: any Unicode character ECMAScript source text can contain any of the Unicode characters. All Unicode white space characters are treated as white space, and all Unicode line/paragraph separators are treated as line separators. Non-Latin Unicode characters are allowed in identifiers, string literals, regular expression literals and comments. Throughout the rest of this document, the phrase code point and the word character will be used to refer to a 16-bit unsigned value used to represent a single 16-bit unit of UTF-16 text. The phrase Unicode character will be used to refer to the abstract linguistic or typographical unit represented by a single Unicode scalar value (which may be longer than 16 bits and thus may be represented by more than one code point). This only refers to entities represented by single Unicode scalar values: the components of a combining character sequence are still individual Unicode characters, even though a user might think of the whole sequence as a single character. In string literals, regular expression literals and identifiers, any character (code point) may also be expressed as a Unicode escape sequence consisting of six characters, namely \u plus four hexadecimal digits. Within a comment, such an escape sequence is effectively ignored as part of the comment. Within a string literal or regular expression literal, the Unicode escape sequence contributes one character to the value of the literal. Within an identifier, the escape sequence contributes one character to the identifier. NOTE Although this document sometimes refers to a transformation between a character within a string and the 16-bit unsigned integer that is the UTF-16 encoding of that character, there is actually no transformation because a character within a string is actually represented using that 16-bit unsigned value. NOTE ECMAScript differs from the Java programming language in the behaviour of Unicode escape sequences. In a Java program, if the Unicode escape sequence \u000A, for example, occurs within a single-line comment, it is interpreted as a line terminator (Unicode character 000A is line feed) and therefore the next character is not part of the comment. Similarly, if the Unicode escape sequence \u000A occurs within a string literal in a Java program, it is likewise interpreted as a line terminator, which is not allowed within a string literalone must write \n instead of \u000A to cause a line feed to be part of the string value of a string literal. In an ECMAScript program, a Unicode escape sequence occurring within a comment is never interpreted and therefore cannot contribute to termination of the comment. Similarly, a Unicode escape sequence occurring within a string literal in an ECMAScript program always contributes a character to the string value of the literal and is never interpreted as a line terminator or as a quote mark that might terminate the string literal. Lexical Conventions The source text of an ECMAScript program is first converted into a sequence of input elements, which are either tokens, line terminators, comments, or white space. The source text is scanned from left to right, repeatedly taking the longest possible sequence of characters as the next input element. There are two goal symbols for the lexical grammar. The InputElementDiv symbol is used in those syntactic grammar contexts where a division (/) or division-assignment (/=) operator is permitted. The InputElementRegExp symbol is used in other syntactic grammar contexts. Note that contexts exist in the syntactic grammar where both a division and a RegularExpressionLiteral are permitted by the syntactic grammar; however, since the lexical grammar uses the InputElementDiv goal symbol in such cases, the opening slash is not recognised as starting a regular expression literal in such a context. As a workaround, one may enclose the regular expression literal in parentheses. Syntax InputElementDiv :: WhiteSpace LineTerminator Comment Token DivPunctuator InputElementRegExp :: WhiteSpace LineTerminator Comment Token RegularExpressionLiteral Unicode Format-Control Characters The Unicode format-control characters (i.e., the characters in category Cf in the Unicode Character Database such as left-to-right mark or right-to-left mark) are control codes used to control the formatting of a range of text in the absence of higher-level protocols for this (such as mark-up languages). It is useful to allow these in source text to facilitate editing and display. The format control characters can occur anywhere in the source text of an ECMAScript program. These characters are removed from the source text before applying the lexical grammar. Since these characters are removed before processing string and regular expression literals, one must use a. Unicode escape sequence (see section  REF _Ref451679320 \r \h 7.6) to include a Unicode format-control character inside a string or regular expression literal. White Space White space characters are used to improve source text readability and to separate tokens (indivisible lexical units) from each other, but are otherwise insignificant. White space may occur between any two tokens, and may occur within strings (where they are considered significant characters forming part of the literal string value), but cannot appear within any other kind of token. The following characters are considered to be white space: Code Point ValueNameFormal Name\u0009Tab\u000BVertical Tab\u000CForm Feed\u0020Space\u00A0No-break spaceOther category ZsAny other Unicode space separatorSyntax WhiteSpace :: Line Terminators Like white space characters, line terminator characters are used to improve source text readability and to separate tokens (indivisible lexical units) from each other. However, unlike white space characters, line terminators have some influence over the behaviour of the syntactic grammar. In general, line terminators may occur between any two tokens, but there are a few places where they are forbidden by the syntactic grammar. A line terminator cannot occur within any token, not even a string. Line terminators also affect the process of automatic semicolon insertion (section  REF _Ref424535009 \r \h 7.8.5). The following characters are considered to be line terminators: Code Point ValueNameFormal Name\u000ALine Feed\u000DCarriage Return \u2028Line separator\u2029Paragraph separatorSyntax LineTerminator :: Comments Description Comments can be either single or multi-line. Multi-line comments cannot nest. Because a single-line comment can contain any character except a LineTerminator character, and because of the general rule that a token is always as long as possible, a single-line comment always consists of all characters from the // marker to the end of the line. However, the LineTerminator at the end of the line is not considered to be part of the single-line comment; it is recognised separately by the lexical grammar and becomes part of the stream of input elements for the syntactic grammar. This point is very important, because it implies that the presence or absence of single-line comments does not affect the process of automatic semicolon insertion (section  REF _Ref463859562 \r \h 7.9). Comments behave like white space and are discarded except that, if a MultiLineComment contains a line terminator character, then the entire comment is considered to be a LineTerminator for purposes of parsing by the syntactic grammar. Syntax Comment :: MultiLineComment SingleLineComment MultiLineComment :: /* MultiLineCommentCharsopt */ MultiLineCommentChars :: MultiLineNotAsteriskChar MultiLineCommentCharsopt * PostAsteriskCommentCharsopt PostAsteriskCommentChars :: MultiLineNotForwardSlashOrAsteriskChar MultiLineCommentCharsopt * PostAsteriskCommentCharsopt MultiLineNotAsteriskChar :: SourceCharacter but not asterisk * MultiLineNotForwardSlashOrAsteriskChar :: SourceCharacter but not forward-slash / or asterisk * SingleLineComment :: // SingleLineCommentCharsopt SingleLineCommentChars :: SingleLineCommentChar SingleLineCommentCharsopt SingleLineCommentChar :: SourceCharacter but not LineTerminator Tokens Syntax Token :: ReservedWord Identifier Punctuator NumericLiteral StringLiteral Reserved Words Description Reserved words cannot be used as identifiers. Syntax ReservedWord :: Keyword FutureReservedWord NullLiteral BooleanLiteral Keywords The following tokens are ECMAScript keywords and may not be used as identifiers in ECMAScript programs. Syntax Keyword :: one of breakelsenewvarcasefinallyreturnvoidcatchforswitchwhilecontinuefunctionthiswithdefaultifthrowdeleteintrydoinstanceoftypeof Future Reserved Words The following words are used as keywords in proposed extensions and are therefore reserved to allow for the possibility of future adoption of those extensions. Syntax FutureReservedWord :: one of abstractenumintshortbooleanexportinterfacestaticbyteextendslongsupercharfinalnativesynchronizedclassfloatpackagethrowsconstgotoprivatetransientdebuggerimplementsprotectedvolatiledoubleimportpublic Identifiers Description Identifiers are interpreted according to the grammar given in Section 5.16 of the upcoming version 3.0 of the Unicode standard, with some small modifications. This grammar is based on both normative and informative character categories specified by the Unicode standard. The characters in the specified categories in version 2.1 of the Unicode standard must be treated as in those categories by all conforming ECMAScript implementations; however, conforming ECMAScript implementations may allow additional legal identifier characters based on the category assignment from later versions of Unicode. This standard specifies one departure from the grammar given in the Unicode standard: The dollar sign ($) and the underscore (_) are permitted anywhere in an identifier. The dollar sign is intended for use only in mechanically generated code. Unicode escape sequences are also permitted in identifiers, where they contribute a single character to the identifier, as computed by the CV of the UnicodeEscapeSequence (see section  REF _Ref440437891 \r \h  \* MERGEFORMAT 7.8.4). The \ preceding the UnicodeEscapeSequence does not contribute a character to the identifier. A UnicodeEscapeSequence cannot be used to put a character into an identifier that would otherwise be illegal. In other words, if a \ UnicodeEscapeSequence sequence were replaced by its UnicodeEscapeSequence's CV, the result must still be a valid Identifier that has the exact same sequence of characters as the original Identifier. Two identifiers that are canonically equivalent according to the Unicode standard are not equal unless they are represented by the exact same sequence of code points (in other words, conforming ECMAScript implementations are only required to do bitwise comparison on identifiers). The intent is that the incoming source text has been converted to normalised form C before it reaches the compiler. Syntax Identifier :: IdentifierName but not ReservedWord IdentifierName :: IdentifierStart IdentifierName IdentifierPart IdentifierStart :: UnicodeLetter $ _ \ UnicodeEscapeSequence IdentifierPart :: IdentifierStart UnicodeCombiningMark UnicodeDigit UnicodeConnectorPunctuation \ UnicodeEscapeSequence UnicodeLetter any character in the Unicode categories Uppercase letter (Lu), Lowercase letter (Ll), Titlecase letter (Lt), Modifier letter (Lm), Other letter (Lo), or Letter number (Nl). UnicodeCombiningMark any character in the Unicode categories Non-spacing mark (Mn) or Combining spacing mark (Mc) UnicodeDigit any character in the Unicode category Decimal number (Nd) UnicodeConnectorPunctuation any character in the Unicode category Connector punctuation (Pc) UnicodeEscapeSequence see section  REF _Ref440437891 \r \h 7.8.4. HexDigit :: one of 0 1 2 3 4 5 6 7 8 9 a b c d e f A B C D E F Punctuators Syntax Punctuator :: one of {}()[].;,<><=>===!====!==+-*%++--<<>>>>>&|^!~&&||?:=+=-=*=%=<<=>>=>>>=&=|=^=DivPunctuator :: one of //=Literals Syntax Literal :: NullLiteral BooleanLiteral NumericLiteral StringLiteral Null Literals Syntax NullLiteral :: null Semantics The value of the null literal null is the sole value of the Null type, namely null. Boolean Literals Syntax BooleanLiteral :: true false Semantics The value of the Boolean literal true is a value of the Boolean type, namely true. The value of the Boolean literal false is a value of the Boolean type, namely false. Numeric Literals Syntax NumericLiteral :: DecimalLiteral HexIntegerLiteral DecimalLiteral :: DecimalIntegerLiteral . DecimalDigitsopt ExponentPartopt . DecimalDigits ExponentPartopt DecimalIntegerLiteral ExponentPartopt DecimalIntegerLiteral :: 0 NonZeroDigit DecimalDigitsopt DecimalDigits :: DecimalDigit DecimalDigits DecimalDigit DecimalDigit :: one of 0 1 2 3 4 5 6 7 8 9 NonZeroDigit :: one of 1 2 3 4 5 6 7 8 9 ExponentPart :: ExponentIndicator SignedInteger ExponentIndicator :: one of e E SignedInteger :: DecimalDigits + DecimalDigits - DecimalDigits HexIntegerLiteral :: 0x HexDigit 0X HexDigit HexIntegerLiteral HexDigit The source character immediately following a NumericLiteral must not be an IdentifierStart or DecimalDigit. NOTE For example: 3in is an error and not the two input elements 3 and in. Semantics A numeric literal stands for a value of the Number type. This value is determined in two steps: first, a mathematical value (MV) is derived from the literal; second, this mathematical value is rounded as described below. The MV of NumericLiteral :: DecimalLiteral is the MV of DecimalLiteral. The MV of NumericLiteral :: HexIntegerLiteral is the MV of HexIntegerLiteral. The MV of DecimalLiteral :: DecimalIntegerLiteral . is the MV of DecimalIntegerLiteral. The MV of DecimalLiteral :: DecimalIntegerLiteral . DecimalDigits is the MV of DecimalIntegerLiteral plus (the MV of DecimalDigits times 10n), where n is the number of characters in DecimalDigits. The MV of DecimalLiteral :: DecimalIntegerLiteral . ExponentPart is the MV of DecimalIntegerLiteral times 10e, where e is the MV of ExponentPart. The MV of DecimalLiteral :: DecimalIntegerLiteral . DecimalDigits ExponentPart is (the MV of DecimalIntegerLiteral plus (the MV of DecimalDigits times 10n)) times 10e, where n is the number of characters in DecimalDigits and e is the MV of ExponentPart. The MV of DecimalLiteral ::. DecimalDigits is the MV of DecimalDigits times 10n, where n is the number of characters in DecimalDigits. The MV of DecimalLiteral ::. DecimalDigits ExponentPart is the MV of DecimalDigits times 10en, where n is the number of characters in DecimalDigits and e is the MV of ExponentPart. The MV of DecimalLiteral :: DecimalIntegerLiteral is the MV of DecimalIntegerLiteral. The MV of DecimalLiteral :: DecimalIntegerLiteral ExponentPart is the MV of DecimalIntegerLiteral times 10e, where e is the MV of ExponentPart. The MV of DecimalIntegerLiteral :: 0 is 0. The MV of DecimalIntegerLiteral :: NonZeroDigit DecimalDigits is (the MV of NonZeroDigit times 10n) plus the MV of DecimalDigits, where n is the number of characters in DecimalDigits. The MV of DecimalDigits :: DecimalDigit is the MV of DecimalDigit. The MV of DecimalDigits :: DecimalDigits DecimalDigit is (the MV of DecimalDigits times 10) plus the MV of DecimalDigit. The MV of ExponentPart :: ExponentIndicator SignedInteger is the MV of SignedInteger. The MV of SignedInteger :: DecimalDigits is the MV of DecimalDigits. The MV of SignedInteger :: + DecimalDigits is the MV of DecimalDigits. The MV of SignedInteger :: - DecimalDigits is the negative of the MV of DecimalDigits. The MV of DecimalDigit :: 0 or of HexDigit :: 0 is 0. The MV of DecimalDigit :: 1 or of NonZeroDigit :: 1 or of HexDigit :: 1 is 1. The MV of DecimalDigit :: 2 or of NonZeroDigit :: 2 or of HexDigit :: 2 is 2. The MV of DecimalDigit :: 3 or of NonZeroDigit :: 3 or of HexDigit :: 3 is 3. The MV of DecimalDigit :: 4 or of NonZeroDigit :: 4 or of HexDigit :: 4 is 4. The MV of DecimalDigit :: 5 or of NonZeroDigit :: 5 or of HexDigit :: 5 is 5. The MV of DecimalDigit :: 6 or of NonZeroDigit :: 6 or of HexDigit :: 6 is 6. The MV of DecimalDigit :: 7 or of NonZeroDigit :: 7 or of HexDigit :: 7 is 7. The MV of DecimalDigit :: 8 or of NonZeroDigit :: 8 or of HexDigit :: 8 is 8. The MV of DecimalDigit :: 9 or of NonZeroDigit :: 9 or of HexDigit :: 9 is 9. The MV of HexDigit :: a or of HexDigit :: A is 10. The MV of HexDigit :: b or of HexDigit :: B is 11. The MV of HexDigit :: c or of HexDigit :: C is 12. The MV of HexDigit :: d or of HexDigit :: D is 13. The MV of HexDigit :: e or of HexDigit :: E is 14. The MV of HexDigit :: f or of HexDigit :: F is 15. The MV of HexIntegerLiteral :: 0x HexDigit is the MV of HexDigit. The MV of HexIntegerLiteral :: 0X HexDigit is the MV of HexDigit. The MV of HexIntegerLiteral :: HexIntegerLiteral HexDigit is (the MV of HexIntegerLiteral times 16) plus the MV of HexDigit. Once the exact MV for a numeric literal has been determined, it is then rounded to a value of the Number type. If the MV is 0, then the rounded value is +0; otherwise, the rounded value must be the number value for the MV (in the sense defined in section  REF _Ref424530687 \r \h 8.5), unless the literal is a DecimalLiteral and the literal has more than 20 significant digits, in which case the number value may be either the number value for the MV of a literal produced by replacing each significant digit after the 20th with a 0 digit or the number value for the MV of a literal produced by replacing each significant digit after the 20th with a 0 digit and then incrementing the literal at the 20th significant digit position. A digit is significant if it is not part of an ExponentPart and it is not 0; or there is a nonzero digit to its left and there is a nonzero digit, not in the ExponentPart, to its right. String Literals A string literal is zero or more characters enclosed in single or double quotes. Each character may be represented by an escape sequence. Syntax StringLiteral :: " DoubleStringCharactersopt " ' SingleStringCharactersopt ' DoubleStringCharacters :: DoubleStringCharacter DoubleStringCharactersopt SingleStringCharacters :: SingleStringCharacter SingleStringCharactersopt DoubleStringCharacter :: SourceCharacter but not double-quote " or backslash \ or LineTerminator \ EscapeSequence SingleStringCharacter :: SourceCharacter but not single-quote ' or backslash \ or LineTerminator \ EscapeSequence EscapeSequence :: CharacterEscapeSequence 0 [lookahead ( DecimalDigit] HexEscapeSequence UnicodeEscapeSequence CharacterEscapeSequence :: SingleEscapeCharacter NonEscapeCharacter SingleEscapeCharacter :: one of ' " \ b f n r t v NonEscapeCharacter :: SourceCharacter but not EscapeCharacter or LineTerminator EscapeCharacter :: SingleEscapeCharacter DecimalDigit x u HexEscapeSequence :: x HexDigit HexDigit UnicodeEscapeSequence :: u HexDigit HexDigit HexDigit HexDigit The definitions of the nonterminal HexDigit is given in section  REF _Ref424530746 \r \h 7.8.3. SourceCharacter is described in sections  REF _Ref424530757 \r \h 2 and  REF _Ref459647164 \r \h 6. A string literal stands for a value of the String type. The string value (SV) of the literal is described in terms of character values (CV) contributed by the various parts of the string literal. As part of this process, some characters within the string literal are interpreted as having a mathematical value (MV), as described below or in section  REF _Ref424530811 \r \h 7.8.3. The SV of StringLiteral :: "" is the empty character sequence. The SV of StringLiteral :: '' is the empty character sequence. The SV of StringLiteral :: " DoubleStringCharacters " is the SV of DoubleStringCharacters. The SV of StringLiteral :: ' SingleStringCharacters ' is the SV of SingleStringCharacters. The SV of DoubleStringCharacters :: DoubleStringCharacter is a sequence of one character, the CV of DoubleStringCharacter. The SV of DoubleStringCharacters :: DoubleStringCharacter DoubleStringCharacters is a sequence of the CV of DoubleStringCharacter followed by all the characters in the SV of DoubleStringCharacters in order. The SV of SingleStringCharacters :: SingleStringCharacter is a sequence of one character, the CV of SingleStringCharacter. The SV of SingleStringCharacters :: SingleStringCharacter SingleStringCharacters is a sequence of the CV of SingleStringCharacter followed by all the characters in the SV of SingleStringCharacters in order. The CV of DoubleStringCharacter :: SourceCharacter but not double-quote " or backslash \ or LineTerminator is the SourceCharacter character itself. The CV of DoubleStringCharacter :: \ EscapeSequence is the CV of the EscapeSequence. The CV of SingleStringCharacter :: SourceCharacter but not single-quote ' or backslash \ or LineTerminator is the SourceCharacter character itself. The CV of SingleStringCharacter :: \ EscapeSequence is the CV of the EscapeSequence. The CV of EscapeSequence :: CharacterEscapeSequence is the CV of the CharacterEscapeSequence. The CV of EscapeSequence :: 0 [lookahead ( DecimalDigit]is a character (Unicode value 0000). The CV of EscapeSequence :: HexEscapeSequence is the CV of the HexEscapeSequence. The CV of EscapeSequence :: UnicodeEscapeSequence is the CV of the UnicodeEscapeSequence. The CV of CharacterEscapeSequence :: SingleEscapeCharacter is the character whose code point value is determined by the SingleEscapeCharacter according to the following table: Escape SequenceCode Point ValueNameSymbol\b\u0008backspace\t\u0009horizontal tab\n\u000Aline feed (new line)\v\u000Bvertical tab\f\u000Cform feed\r\u000Dcarriage return\"\u0022double quote"\'\u0027single quote'\\\u005Cbackslash\ The CV of CharacterEscapeSequence :: NonEscapeCharacter is the CV of the NonEscapeCharacter. The CV of NonEscapeCharacter :: SourceCharacter but not EscapeCharacter or LineTerminator is the SourceCharacter character itself. The CV of HexEscapeSequence :: x HexDigit HexDigit is the character whose code point value is (16 times the MV of the first HexDigit) plus the MV of the second HexDigit. The CV of UnicodeEscapeSequence :: u HexDigit HexDigit HexDigit HexDigit is the character whose code point value is (4096 (that is, 163) times the MV of the first HexDigit) plus (256 (that is, 162) times the MV of the second HexDigit) plus (16 times the MV of the third HexDigit) plus the MV of the fourth HexDigit. NOTE A LineTerminator character cannot appear in a string literal, even if preceded by a backslash \. The correct way to cause a line terminator character to be part of the string value of a string literal is to use an escape sequence such as \n or \u000A. Regular Expression Literals A regular expression literal is an input element that is converted to a RegExp object (section  REF _Ref404565288 \r \h 15.10) when it is scanned. The object is created before evaluation of the containing program or function begins. Evaluation of the literal produces a reference to that object; it does not create a new object. Two regular expression literals in a program evaluate to regular expression objects that never compare as === to each other even if the two literals' contents are identical. A RegExp object may also be created at runtime by new RegExp (section  REF _Ref457201072 \r \h 15.10.4) or calling the RegExp constructor as a function (section  REF _Ref456002819 \r \h 15.10.3). The productions below describe the syntax for a regular expression literal and are used by the input element scanner to find the end of the regular expression literal. The strings of characters comprising the RegularExpressionBody and the RegularExpressionFlags are passed uninterpreted to the regular expression constructor, which interprets them according to its own, more stringent grammar. An implementation may extend the regular expression constructor's grammar, but it should not extend the RegularExpressionBody and RegularExpressionFlags productions or the productions used by these productions. Syntax RegularExpressionLiteral :: / RegularExpressionBody / RegularExpressionFlags RegularExpressionBody :: RegularExpressionFirstChar RegularExpressionChars RegularExpressionChars :: [empty] RegularExpressionChars RegularExpressionChar RegularExpressionFirstChar :: NonTerminator but not * or \ or / BackslashSequence RegularExpressionChar :: NonTerminator but not \ or / BackslashSequence BackslashSequence :: \ NonTerminator NonTerminator :: SourceCharacter but not LineTerminator RegularExpressionFlags :: [empty] RegularExpressionFlags IdentifierPart NOTE Regular expression literals may not be empty; instead of representing an empty regular expression literal, the characters // start a single-line comment. To specify an empty regular expression, use /(?:)/. Semantics A regular expression literal stands for a value of the Object type. This value is determined in two steps: first, the characters comprising the regular expression's RegularExpressionBody and RegularExpressionFlags production expansions are collected uninterpreted into two strings Pattern and Flags, respectively. Then the new RegExp constructor is called with two arguments Pattern and Flags and the result becomes the value of the RegularExpressionLiteral. If the call to new RegExp generates an error, an implementation may, at its discretion, either report the error immediately while scanning the program, or it may defer the error until the regular expression literal is evaluated in the course of program execution. Automatic Semicolon Insertion Certain ECMAScript statements (empty statement, variable statement, expression statement, do-while statement, continue statement, break statement, return statement, and throw statement) must be terminated with semicolons. Such semicolons may always appear explicitly in the source text. For convenience, however, such semicolons may be omitted from the source text in certain situations. These situations are described by saying that semicolons are automatically inserted into the source code token stream in those situations. Rules of Automatic Semicolon Insertion When, as the program is parsed from left to right, a token (called the offending token) is encountered that is not allowed by any production of the grammar, then a semicolon is automatically inserted before the offending token if one or more of the following conditions is true: The offending token is separated from the previous token by at least one LineTerminator. The offending token is }. When, as the program is parsed from left to right, the end of the input stream of tokens is encountered and the parser is unable to parse the input token stream as a single complete ECMAScript Program, then a semicolon is automatically inserted at the end of the input stream. When, as the program is parsed from left to right, a token is encountered that is allowed by some production of the grammar, but the production is a restricted production and the token would be the first token for a terminal or nonterminal immediately following the annotation [no LineTerminator here] within the restricted production (and therefore such a token is called a restricted token), and the restricted token is separated from the previous token by at least one LineTerminator, then a semicolon is automatically inserted before the restricted token. However, there is an additional overriding condition on the preceding rules: a semicolon is never inserted automatically if the semicolon would then be parsed as an empty statement or if that semicolon would become one of the two semicolons in the header of a for statement (section  REF _Ref432004090 \r \h 12.6.3). NOTE These are the only restricted productions in the grammar: PostfixExpression : LeftHandSideExpression [no LineTerminator here] ++ LeftHandSideExpression [no LineTerminator here] -- ContinueStatement : continue [no LineTerminator here] Identifieropt ; BreakStatement : break [no LineTerminator here] Identifieropt ; ReturnStatement : return [no LineTerminator here] Expressionopt ; ThrowStatement : throw [no LineTerminator here] Expression ; The practical effect of these restricted productions is as follows: When a ++ or -- token is encountered where the parser would treat it as a postfix operator, and at least one LineTerminator occurred between the preceding token and the ++ or -- token, then a semicolon is automatically inserted before the ++ or -- token. When a continue, break, return, or throw token is encountered and a LineTerminator is encountered before the next token, a semicolon is automatically inserted after the continue, break, return, or throw token. The resulting practical advice to ECMAScript programmers is: A postfix ++ or -- operator should appear on the same line as its operand. An Expression in a return or throw statement should start on the same line as the return or throw token. A label in a break or continue statement should be on the same line as the break or continue token. Examples of Automatic Semicolon Insertion The source { 1 2 } 3 is not a valid sentence in the ECMAScript grammar, even with the automatic semicolon insertion rules. In contrast, the source { 1 2 } 3 is also not a valid ECMAScript sentence, but is transformed by automatic semicolon insertion into the following: { 1 ;2 ;} 3; which is a valid ECMAScript sentence. The source for (a; b ) is not a valid ECMAScript sentence and is not altered by automatic semicolon insertion because the semicolon is needed for the header of a for statement. Automatic semicolon insertion never inserts one of the two semicolons in the header of a for statement. The source return a + b is transformed by automatic semicolon insertion into the following: return; a + b; NOTE The expression a + b is not treated as a value to be returned by the return statement, because a LineTerminator separates it from the token return. The source a = b ++c is transformed by automatic semicolon insertion into the following: a = b; ++c; NOTE The token ++ is not treated as a postfix operator applying to the variable b, because a LineTerminator occurs between b and ++. The source if (a > b) else c = d is not a valid ECMAScript sentence and is not altered by automatic semicolon insertion before the else token, even though no production of the grammar applies at that point, because an automatically inserted semicolon would then be parsed as an empty statement. The source a = b + c (d + e).print() is not transformed by automatic semicolon insertion, because the parenthesised expression that begins the second line can be interpreted as an argument list for a function call: a = b + c(d + e).print() In the circumstance that an assignment statement must begin with a left parenthesis, it is a good idea for the programmer to provide an explicit semicolon at the end of the preceding statement rather than to rely on automatic semicolon insertion. Types A value is an entity that takes on one of nine types. There are nine types (Undefined, Null, Boolean, String, Number, Object, Reference, List, and Completion). Values of type Reference, List, and Completion are used only as intermediate results of expression evaluation and cannot be stored as properties of objects. The Undefined Type The Undefined type has exactly one value, called undefined. Any variable that has not been assigned a value has the value undefined. The Null Type The Null type has exactly one value, called null. The Boolean Type The Boolean type represents a logical entity having two values, called true and false. The String Type The String type is the set of all finite ordered sequences of zero or more 16-bit unsigned integer values (elements). The String type is generally used to represent textual data in a running ECMAScript program, in which case each element in the string is treated as a code point value (see section  REF _Ref459624386 \r \h 6). Each element is regarded as occupying a position within the sequence. These positions are indexed with nonnegative integers. The first element (if any) is at position 0, the next element (if any) at position 1, and so on. The length of a string is the number of elements (i.e., 16-bit values) within it. The empty string has length zero and therefore contains no elements. When a string contains actual textual data, each element is considered to be a single UTF-16 unit. Whether or not this is the actual storage format of a String, the characters within a String are numbered as though they were represented using UTF-16. All operations on Strings (except as otherwise stated) treat them as sequences of undifferentiated 16-bit unsigned integers; they do not ensure the resulting string is in normalised form, nor do they ensure language-sensitive results. NOTE The rationale behind these decisions was to keep the implementation of Strings as simple and high-performing as possible. The intent is that textual data coming into the execution environment from outside (e.g., user input, text read from a file or received over the network, etc.) be converted to Unicode Normalised Form C before the running program sees it. Usually this would occur at the same time incoming text is converted from its original character encoding to Unicode (and would impose no additional overhead). Since it is recommended that ECMAScript source code be in Normalised Form C, string literals are guaranteed to be normalised (if source text is guaranteed to be normalised), as long as they do not contain any Unicode escape sequences. The Number Type The Number type has exactly 18437736874454810627 (that is, 264(253+3) values, representing the double-precision 64-bit format IEEE 754 values as specified in the IEEE Standard for Binary Floating-Point Arithmetic, except that the 9007199254740990 (that is, 253(2) distinct Not-a-Number values of the IEEE Standard are represented in ECMAScript as a single special NaN value. (Note that the NaN value is produced by the program expression NaN, assuming that the globally defined variable NaN has not been altered by program execution.) In some implementations, external code might be able to detect a difference between various Non-a-Number values, but such behaviour is implementation-dependent; to ECMAScript code, all NaN values are indistinguishable from each other. There are two other special values, called positive Infinity and negative Infinity. For brevity, these values are also referred to for expository purposes by the symbols +( and ((, respectively. (Note that these two infinite number values are produced by the program expressions +Infinity (or simply Infinity) and -Infinity, assuming that the globally defined variable Infinity has not been altered by program execution.) The other 18437736874454810624 (that is, 264(253) values are called the finite numbers. Half of these are positive numbers and half are negative numbers; for every finite positive number there is a corresponding negative number having the same magnitude. Note that there is both a positive zero and a negative zero. For brevity, these values are also referred to for expository purposes by the symbols +0 and (0, respectively. (Note that these two zero number values are produced by the program expressions +0 (or simply 0) and -0.) The 18437736874454810622 (that is, 264(253(2) finite nonzero values are of two kinds: 18428729675200069632 (that is, 264(254) of them are normalised, having the form s ( m ( 2e where s is +1 or (1, m is a positive integer less than 253 but not less than 252, and e is an integer ranging from (1074 to 971, inclusive. The remaining 9007199254740990 (that is, 253(2) values are denormalised, having the form s ( m ( 2e where s is +1 or (1, m is a positive integer less than 252, and e is (1074. Note that all the positive and negative integers whose magnitude is no greater than 253 are representable in the Number type (indeed, the integer 0 has two representations, +0 and -0). A finite number has an odd significand if it is nonzero and the integer m used to express it (in one of the two forms shown above) is odd. Otherwise, it has an even significand. In this specification, the phrase the number value for x where x represents an exact nonzero real mathematical quantity (which might even be an irrational number such as () means a number value chosen in the following manner. Consider the set of all finite values of the Number type, with (0 removed and with two additional values added to it that are not representable in the Number type, namely 21024 (which is +1 ( 253 ( 2971) and (21024 (which is (1 ( 253 ( 2971). Choose the member of this set that is closest in value to x. If two values of the set are equally close, then the one with an even significand is chosen; for this purpose, the two extra values 21024 and (21024 are considered to have even significands. Finally, if 21024 was chosen, replace it with +(; if (21024 was chosen, replace it with ((; if +0 was chosen, replace it with (0 if and only if x is less than zero; any other chosen value is used unchanged. The result is the number value for x. (This procedure corresponds exactly to the behaviour of the IEEE 754 round to nearest mode.) Some ECMAScript operators deal only with integers in the range (231 through 231(1, inclusive, or in the range 0 through 232(1, inclusive. These operators accept any value of the Number type but first convert each such value to one of 232 integer values. See the descriptions of the ToInt32 and ToUint32 operators in sections  REF _Ref424667409 \r \h 9.5 and  REF _Ref424532763 \r \h 9.6, respectively. The Object Type An Object is an unordered collection of properties. Each property consists of a name, a value and a set of attributes. Property Attributes A property can have zero or more attributes from the following set: AttributeDescriptionReadOnlyThe property is a read-only property. Attempts by ECMAScript code to write to the property will be ignored. (Note, however, that in some cases the value of a property with the ReadOnly attribute may change over time because of actions taken by the host environment; therefore ReadOnly does not mean constant and unchanging!)DontEnumThe property is not to be enumerated by a for-in enumeration (section  REF _Ref424667453 \r \h 12.6.4).DontDeleteAttempts to delete the property will be ignored. See the description of the delete operator in section  REF _Ref424531014 \r \h 11.4.1.InternalInternal properties have no name and are not directly accessible via the property accessor operators. How these properties are accessed is implementation specific. How and when some of these properties are used is specified by the language specification.Internal Properties and Methods Internal properties and methods are not part of the language. They are defined by this specification purely for expository purposes. An implementation of ECMAScript must behave as if it produced and operated upon internal properties in the manner described here. For the purposes of this document, the names of internal properties are enclosed in double square brackets [[ ]]. When an algorithm uses an internal property of an object and the object does not implement the indicated internal property, a TypeError exception is thrown. There are two types of access for normal (non-internal) properties: get and put, corresponding to retrieval and assignment, respectively. Native ECMAScript objects have an internal property called [[Prototype]]. The value of this property is either null or an object and is used for implementing inheritance. Properties of the [[Prototype]] object are visible as properties of the child object for the purposes of get access, but not for put access. The following table summarises the internal properties used by this specification. The description indicates their behaviour for native ECMAScript objects. Host objects may implement these internal methods with any implementation-dependent behaviour, or it may be that a host object implements only some internal methods and not others. PropertyParametersDescription[[Prototype]]noneThe prototype of this object.[[Class]]noneA string value indicating the kind of this object.[[Value]]noneInternal state information associated with this object.[[Get]](PropertyName)Returns the value of the property.[[Put]](PropertyName, Value)Sets the specified property to Value.[[CanPut]](PropertyName)Returns a boolean value indicating whether a [[Put]] operation with PropertyName will succeed.[[HasProperty]](PropertyName)Returns a boolean value indicating whether the object already has a member with the given name.[[Delete]](PropertyName)Removes the specified property from the object.[[DefaultValue]](Hint)Returns a default value for the object, which should be a primitive value (not an object or reference).[[Construct]]a list of argument values provided by the callerConstructs an object. Invoked via the new operator. Objects that implement this internal method are called constructors.[[Call]]a list of argument values provided by the callerExecutes code associated with the object. Invoked via a function call expression. Objects that implement this internal method are called functions.[[HasInstance]](Value)Returns a boolean value indicating whether Value delegates behaviour to this object. Of the native ECMAScript objects, only Function objects implement [[HasInstance]].[[Scope]]noneA scope chain that defines the environment in which a Function object is executed.[[Match]](String, Index)Tests for a regular expression match and returns a MatchResult value (see section  REF _Ref455931278 \r \h 15.10.2.1). Every object (including host objects) must implement the [[Prototype]] and [[Class]] properties and the [[Get]], [[Put]], [[CanPut]], [[HasProperty]], [[Delete]], and [[DefaultValue]] methods. (Note, however, that the [[DefaultValue]] method may, for some objects, simply throw a TypeError exception.) The value of the [[Prototype]] property must be either an object or null, and every [[Prototype]] chain must have finite length (that is, starting from any object, recursively accessing the [[Prototype]] property must eventually lead to a null value). Whether or not a native object can have a host object as its [[Prototype]] depends on the implementation. The value of the [[Class]] property is defined by this specification for every kind of built-in object. The value of the [[Class]] property of a host object may be any value, even a value used by a built-in object for its [[Class]] property. The value of a [[Class]] property is used internally to distinguish different kinds of built-in objects. Note that this specification does not provide any means for a program to access that value except through Object.prototype.toString (see section  REF _Ref455974300 \r \h 15.2.4.2). For native objects the [[Get]], [[Put]], [[CanPut]], [[HasProperty]], [[Delete]] and [[DefaultValue]] methods behave as described in described in sections  REF _Ref424531086 \r \h 8.6.2.1,  REF _Ref424668494 \r \h 8.6.2.2,  REF _Ref424531112 \r \h 8.6.2.3,  REF _Ref424667502 \r \h 8.6.2.4,  REF _Ref424667512 \r \h 8.6.2.5 and  REF _Ref424667579 \r \h 8.6.2.6, respectively, except that Array objects have a slightly different implementation of the [[Put]] method (section  REF _Ref424531062 \r \h 15.4.5.1). Host objects may implement these methods in any manner unless specified otherwise; for example, one possibility is that [[Get]] and [[Put]] for a particular host object indeed fetch and store property values but [[HasProperty]] always generates false. In the following algorithm descriptions, assume O is a native ECMAScript object and P is a string. [[Get]] (P) When the [[Get]] method of O is called with property name P, the following steps are taken: If O doesnt have a property with name P, go to step 4. Get the value of the property. Return Result(2). If the [[Prototype]] of O is null, return undefined. Call the [[Get]] method of [[Prototype]] with property name P. Return Result(5). [[Put]] (P, V) When the [[Put]] method of O is called with property P and value V, the following steps are taken: Call the [[CanPut]] method of O with name P. If Result(1) is false, return. If O doesnt have a property with name P, go to step 6. Set the value of the property to V. The attributes of the property are not changed. Return. Create a property with name P, set its value to V and give it empty attributes. Return. Note, however, that if O is an Array object, it has a more elaborate [[Put]] method (section  REF _Ref424531062 \r \h 15.4.5.1). [[CanPut]] (P) The [[CanPut]] method is used only by the [[Put]] method. When the [[CanPut]] method of O is called with property P, the following steps are taken: If O doesnt have a property with name P, go to step 4. If the property has the ReadOnly attribute, return false. Return true. If the [[Prototype]] of O is null, return true. Call the [[CanPut]] method of [[Prototype]] of O with property name P. Return Result(5). [[HasProperty]] (P) When the [[HasProperty]] method of O is called with property name P, the following steps are taken: If O has a property with name P, return true. If the [[Prototype]] of O is null, return false. Call the [[HasProperty]] method of [[Prototype]] with property name P. Return Result(3). [[Delete]] (P) When the [[Delete]] method of O is called with property name P, the following steps are taken: If O doesnt have a property with name P, return true. If the property has the DontDelete attribute, return false. Remove the property with name P from O. Return true. [[DefaultValue]] (hint) When the [[DefaultValue]] method of O is called with hint String, the following steps are taken: Call the [[Get]] method of object O with argument "toString". If Result(1) is not an object, go to step 5. Call the [[Call]] method of Result(1), with O as the this value and an empty argument list. If Result(3) is a primitive value, return Result(3). Call the [[Get]] method of object O with argument "valueOf". If Result(5) is not an object, go to step 9. Call the [[Call]] method of Result(5), with O as the this value and an empty argument list. If Result(7) is a primitive value, return Result(7). Throw a TypeError exception. When the [[DefaultValue]] method of O is called with hint Number, the following steps are taken: Call the [[Get]] method of object O with argument "valueOf". If Result(1) is not an object, go to step 5. Call the [[Call]] method of Result(1), with O as the this value and an empty argument list. If Result(3) is a primitive value, return Result(3). Call the [[Get]] method of object O with argument "toString". If Result(5) is not an object, go to step 9. Call the [[Call]] method of Result(5), with O as the this value and an empty argument list. If Result(7) is a primitive value, return Result(7). Throw a TypeError exception. When the [[DefaultValue]] method of O is called with no hint, then it behaves as if the hint were Number, unless O is a Date object (section  REF _Ref424532846 \r \h 15.9), in which case it behaves as if the hint were String. The above specification of [[DefaultValue]] for native objects can return only primitive values. If a host object implements its own [[DefaultValue]] method, it must ensure that its [[DefaultValue]] method can return only primitive values. The Reference Type The internal Reference type is not a language data type. It is defined by this specification purely for expository purposes. An implementation of ECMAScript must behave as if it produced and operated upon references in the manner described here. However, a value of type Reference is used only as an intermediate result of expression evaluation and cannot be stored as the value of a variable or property. The Reference type is used to explain the behaviour of such operators as delete, typeof, and the assignment operators. For example, the left-hand operand of an assignment is expected to produce a reference. The behaviour of assignment could, instead, be explained entirely in terms of a case analysis on the syntactic form of the left-hand operand of an assignment operator, but for one difficulty: function calls are permitted to return references. This possibility is admitted purely for the sake of host objects. No built-in ECMAScript function defined by this specification returns a reference and there is no provision for a user-defined function to return a reference. (Another reason not to use a syntactic case analysis is that it would be lengthy and awkward, affecting many parts of the specification.) Another use of the Reference type is to explain the determination of the this value for a function call. A Reference is a reference to a property of an object. A Reference consists of two components, the base object and the property name. The following abstract operations are used in this specification to access the components of references: GetBase(V). Returns the base object component of the reference V. GetPropertyName(V). Returns the property name component of the reference V. The following abstract operations are used in this specification to operate on references: GetValue (V) If Type(V) is not Reference, return V. Call GetBase(V). If Result(2) is null, throw a ReferenceError exception. Call the [[Get]] method of Result(2), passing GetPropertyName(V) for the property name. Return Result(4). PutValue (V, W) If Type(V) is not Reference, throw a ReferenceError exception. Call GetBase(V). If Result(2) is null, go to step 6. Call the [[Put]] method of Result(2), passing GetPropertyName(V) for the property name and W for the value. Return. Call the [[Put]] method for the global object, passing GetPropertyName(V) for the property name and W for the value. Return. The List Type The internal List type is not a language data type. It is defined by this specification purely for expository purposes. An implementation of ECMAScript must behave as if it produced and operated upon List values in the manner described here. However, a value of the List type is used only as an intermediate result of expression evaluation and cannot be stored as the value of a variable or property. The List type is used to explain the evaluation of argument lists (section  REF _Ref424531183 \r \h 11.2.4) in new expressions and in function calls. Values of the List type are simply ordered sequences of values. These sequences may be of any length. The Completion Type The internal Completion type is not a language data type. It is defined by this specification purely for expository purposes. An implementation of ECMAScript must behave as if it produced and operated upon Completion values in the manner described here. However, a value of the Completion type is used only as an intermediate result of statement evaluation and cannot be stored as the value of a variable or property. The Completion type is used to explain the behaviour of statements (break, continue, return and throw) that perform nonlocal transfers of control. Values of the Completion type are triples of the form (type, value, target), where type is one of normal, break, continue, return, or throw, value is any ECMAScript value or empty, and target is any ECMAScript identifier or empty. The term abrupt completion refers to any completion with a type other than normal. Type Conversion The ECMAScript runtime system performs automatic type conversion as needed. To clarify the semantics of certain constructs it is useful to define a set of conversion operators. These operators are not a part of the language; they are defined here to aid the specification of the semantics of the language. The conversion operators are polymorphic; that is, they can accept a value of any standard type, but not of type Reference, List, or Completion (the internal types). ToPrimitive The operator ToPrimitive takes a Value argument and an optional argument PreferredType. The operator ToPrimitive converts its value argument to a non-Object type. If an object is capable of converting to more than one primitive type, it may use the optional hint PreferredType to favour that type. Conversion occurs according to the following table: Input TypeResultUndefinedThe result equals the input argument (no conversion).NullThe result equals the input argument (no conversion).BooleanThe result equals the input argument (no conversion).NumberThe result equals the input argument (no conversion).StringThe result equals the input argument (no conversion).ObjectReturn a default value for the Object. The default value of an object is retrieved by calling the internal [[DefaultValue]] method of the object, passing the optional hint PreferredType. The behaviour of the [[DefaultValue]] method is defined by this specification for all native ECMAScript objects (section  REF _Ref424667579 \r \h 8.6.2.6). ToBoolean The operator ToBoolean converts its argument to a value of type Boolean according to the following table: Input TypeResultUndefinedfalseNullfalseBooleanThe result equals the input argument (no conversion).NumberThe result is false if the argument is +0, (0, or NaN; otherwise the result is true. StringThe result is false if the argument is the empty string (its length is zero); otherwise the result is true.Objecttrue ToNumber The operator ToNumber converts its argument to a value of type Number according to the following table: Input TypeResultUndefinedNaNNull+0BooleanThe result is 1 if the argument is true. The result is +0 if the argument is false.NumberThe result equals the input argument (no conversion).StringSee grammar and note below.ObjectApply the following steps: Call ToPrimitive(input argument, hint Number). Call ToNumber(Result(1)). Return Result(2). ToNumber Applied to the String Type ToNumber applied to strings applies the following grammar to the input string. If the grammar cannot interpret the string as an expansion of StringNumericLiteral, then the result of ToNumber is NaN. StringNumericLiteral ::: StrWhiteSpaceopt StrWhiteSpaceopt StrNumericLiteral StrWhiteSpaceopt StrWhiteSpace ::: StrWhiteSpaceChar StrWhiteSpaceopt StrWhiteSpaceChar ::: StrNumericLiteral ::: StrDecimalLiteral HexIntegerLiteral StrDecimalLiteral ::: StrUnsignedDecimalLiteral + StrUnsignedDecimalLiteral - StrUnsignedDecimalLiteral StrUnsignedDecimalLiteral ::: Infinity DecimalDigits . DecimalDigitsopt ExponentPartopt . DecimalDigits ExponentPartopt DecimalDigits ExponentPartopt DecimalDigits ::: DecimalDigit DecimalDigits DecimalDigit DecimalDigit ::: one of 0 1 2 3 4 5 6 7 8 9 ExponentPart ::: ExponentIndicator SignedInteger ExponentIndicator ::: one of e E SignedInteger ::: DecimalDigits + DecimalDigits - DecimalDigits HexIntegerLiteral ::: 0x HexDigit 0X HexDigit HexIntegerLiteral HexDigit HexDigit ::: one of 0 1 2 3 4 5 6 7 8 9 a b c d e f A B C D E F Some differences should be noted between the syntax of a StringNumericLiteral and a NumericLiteral (section  REF _Ref424531213 \r \h 7.8.3): A StringNumericLiteral may be preceded and/or followed by white space and/or line terminators. A StringNumericLiteral that is decimal may have any number of leading 0 digits. A StringNumericLiteral that is decimal may be preceded by + or - to indicate its sign. A StringNumericLiteral that is empty or contains only white space is converted to +0. The conversion of a string to a number value is similar overall to the determination of the number value for a numeric literal (section  REF _Ref424531238 \r \h 7.8.3), but some of the details are different, so the process for converting a string numeric literal to a value of Number type is given here in full. This value is determined in two steps: first, a mathematical value (MV) is derived from the string numeric literal; second, this mathematical value is rounded as described below. The MV of StringNumericLiteral ::: [empty] is 0. The MV of StringNumericLiteral ::: StrWhiteSpace is 0. The MV of StringNumericLiteral ::: StrWhiteSpaceopt StrNumericLiteral StrWhiteSpaceopt is the MV of StrNumericLiteral, no matter whether white space is present or not. The MV of StrNumericLiteral ::: StrDecimalLiteral is the MV of StrDecimalLiteral. The MV of StrNumericLiteral ::: HexIntegerLiteral is the MV of HexIntegerLiteral. The MV of StrDecimalLiteral ::: StrUnsignedDecimalLiteral is the MV of StrUnsignedDecimalLiteral. The MV of StrDecimalLiteral::: + StrUnsignedDecimalLiteral is the MV of StrUnsignedDecimalLiteral. The MV of StrDecimalLiteral::: - StrUnsignedDecimalLiteral is the negative of the MV of StrUnsignedDecimalLiteral. (Note that if the MV of StrUnsignedDecimalLiteral is 0, the negative of this MV is also 0. The rounding rule described below handles the conversion of this sign less mathematical zero to a floating-point +0 or (0 as appropriate.) The MV of StrUnsignedDecimalLiteral::: Infinity is 1010000 (a value so large that it will round to +(). The MV of StrUnsignedDecimalLiteral::: DecimalDigits. is the MV of DecimalDigits. The MV of StrUnsignedDecimalLiteral::: DecimalDigits. DecimalDigits is the MV of the first DecimalDigits plus (the MV of the second DecimalDigits times 10(n), where n is the number of characters in the second DecimalDigits. The MV of StrUnsignedDecimalLiteral::: DecimalDigits. ExponentPart is the MV of DecimalDigits times 10e, where e is the MV of ExponentPart. The MV of StrUnsignedDecimalLiteral::: DecimalDigits. DecimalDigits ExponentPart is (the MV of the first DecimalDigits plus (the MV of the second DecimalDigits times 10(n)) times 10e, where n is the number of characters in the second DecimalDigits and e is the MV of ExponentPart. The MV of StrUnsignedDecimalLiteral:::. DecimalDigits is the MV of DecimalDigits times 10(n, where n is the number of characters in DecimalDigits. The MV of StrUnsignedDecimalLiteral:::. DecimalDigits ExponentPart is the MV of DecimalDigits times 10e(n, where n is the number of characters in DecimalDigits and e is the MV of ExponentPart. The MV of StrUnsignedDecimalLiteral::: DecimalDigits is the MV of DecimalDigits. The MV of StrUnsignedDecimalLiteral::: DecimalDigits ExponentPart is the MV of DecimalDigits times 10e, where e is the MV of ExponentPart. The MV of DecimalDigits ::: DecimalDigit is the MV of DecimalDigit. The MV of DecimalDigits ::: DecimalDigits DecimalDigit is (the MV of DecimalDigits times 10) plus the MV of DecimalDigit. The MV of ExponentPart ::: ExponentIndicator SignedInteger is the MV of SignedInteger. The MV of SignedInteger ::: DecimalDigits is the MV of DecimalDigits. The MV of SignedInteger ::: + DecimalDigits is the MV of DecimalDigits. The MV of SignedInteger ::: - DecimalDigits is the negative of the MV of DecimalDigits. The MV of DecimalDigit ::: 0 or of HexDigit ::: 0 is 0. The MV of DecimalDigit ::: 1 or of HexDigit ::: 1 is 1. The MV of DecimalDigit ::: 2 or of HexDigit ::: 2 is 2. The MV of DecimalDigit ::: 3 or of HexDigit ::: 3 is 3. The MV of DecimalDigit ::: 4 or of HexDigit ::: 4 is 4. The MV of DecimalDigit ::: 5 or of HexDigit ::: 5 is 5. The MV of DecimalDigit ::: 6 or of HexDigit ::: 6 is 6. The MV of DecimalDigit ::: 7 or of HexDigit ::: 7 is 7. The MV of DecimalDigit ::: 8 or of HexDigit ::: 8 is 8. The MV of DecimalDigit ::: 9 or of HexDigit ::: 9 is 9. The MV of HexDigit ::: a or of HexDigit ::: A is 10. The MV of HexDigit ::: b or of HexDigit ::: B is 11. The MV of HexDigit ::: c or of HexDigit ::: C is 12. The MV of HexDigit ::: d or of HexDigit ::: D is 13. The MV of HexDigit ::: e or of HexDigit ::: E is 14. The MV of HexDigit ::: f or of HexDigit ::: F is 15. The MV of HexIntegerLiteral ::: 0x HexDigit is the MV of HexDigit. The MV of HexIntegerLiteral ::: 0X HexDigit is the MV of HexDigit. The MV of HexIntegerLiteral ::: HexIntegerLiteral HexDigit is (the MV of HexIntegerLiteral times 16) plus the MV of HexDigit. Once the exact MV for a string numeric literal has been determined, it is then rounded to a value of the Number type. If the MV is 0, then the rounded value is +0 unless the first non white space character in the string numeric literal is -, in which case the rounded value is (0. Otherwise, the rounded value must be the number value for the MV (in the sense defined in section  REF _Ref424531262 \r \h 8.5), unless the literal includes a StrUnsignedDecimalLiteral and the literal has more than 20 significant digits, in which case the number value may be either the number value for the MV of a literal produced by replacing each significant digit after the 20th with a 0 digit or the number value for the MV of a literal produced by replacing each significant digit after the 20th with a 0 digit and then incrementing the literal at the 20th digit position. A digit is significant if it is not part of an ExponentPart and it is not 0; or there is a nonzero digit to its left and there is a nonzero digit, not in the ExponentPart, to its right. ToInteger The operator ToInteger converts its argument to an integral numeric value. This operator functions as follows: Call ToNumber on the input argument. If Result(1) is NaN, return +0. If Result(1) is +0, (0, +(, or ((, return Result(1). Compute sign(Result(1)) * floor(abs(Result(1))). Return Result(4). ToInt32: (Signed 32 Bit Integer) The operator ToInt32 converts its argument to one of 232 integer values in the range (231 through 231(1, inclusive. This operator functions as follows: Call ToNumber on the input argument. If Result(1) is NaN, +0, (0, +(, or ((, return +0. Compute sign(Result(1)) * floor(abs(Result(1))). Compute Result(3) modulo 232; that is, a finite integer value k of Number type with positive sign and less than 232 in magnitude such the mathematical difference of Result(3) and k is mathematically an integer multiple of 232. If Result(4) is greater than or equal to 231, return Result(4)( 232, otherwise return Result(4). NOTE Given the above definition of ToInt32: The ToInt32 operation is idempotent: if applied to a result that it produced, the second application leaves that value unchanged. ToInt32(ToUint32(x)) is equal to ToInt32(x) for all values of x. (It is to preserve this latter property that +( and (( are mapped to +0.) ToInt32 maps (0 to +0. ToUint32: (Unsigned 32 Bit Integer) The operator ToUint32 converts its argument to one of 232 integer values in the range 0 through 232(1, inclusive. This operator functions as follows: Call ToNumber on the input argument. If Result(1) is NaN, +0, (0, +(, or ((, return +0. Compute sign(Result(1)) * floor(abs(Result(1))). Compute Result(3) modulo 232; that is, a finite integer value k of Number type with positive sign and less than 232 in magnitude such the mathematical difference of Result(3) and k is mathematically an integer multiple of 232. Return Result(4). NOTE Given the above definition of ToUInt32: Step 5 is the only difference between ToUint32 and ToInt32. The ToUint32 operation is idempotent: if applied to a result that it produced, the second application leaves that value unchanged. ToUint32(ToInt32(x)) is equal to ToUint32(x) for all values of x. (It is to preserve this latter property that +( and (( are mapped to +0.) ToUint32 maps (0 to +0. ToUint16: (Unsigned 16 Bit Integer) The operator ToUint16 converts its argument to one of 216 integer values in the range 0 through 216(1, inclusive. This operator functions as follows: Call ToNumber on the input argument. If Result(1) is NaN, +0, (0, +(, or ((, return +0. Compute sign(Result(1)) * floor(abs(Result(1))). Compute Result(3) modulo 216; that is, a finite integer value k of Number type with positive sign and less than 216 in magnitude such the mathematical difference of Result(3) and k is mathematically an integer multiple of 216. Return Result(4). NOTE Given the above definition of ToUint16: The substitution of 216 for 232 in step 4 is the only difference between ToUint32 and ToUint16. ToUint16 maps (0 to +0. ToString The operator ToString converts its argument to a value of type String according to the following table: Input TypeResultUndefined"undefined"Null"null"BooleanIf the argument is true, then the result is "true". If the argument is false, then the result is "false".NumberSee note below.StringReturn the input argument (no conversion)ObjectApply the following steps: Call ToPrimitive(input argument, hint String). Call ToString(Result(1)). Return Result(2). ToString Applied to the Number Type The operator ToString converts a number m to string format as follows: If m is NaN, return the string "NaN". If m is +0 or (0, return the string "0". If m is less than zero, return the string concatenation of the string "-" and ToString((m). If m is infinity, return the string "Infinity". Otherwise, let n, k, and s be integers such that k ( 1, 10k(1 ( s < 10k, the number value for s ( 10n(k is m, and k is as small as possible. Note that k is the number of digits in the decimal representation of s, that s is not divisible by 10, and that the least significant digit of s is not necessarily uniquely determined by these criteria. If k ( n ( 21, return the string consisting of the k digits of the decimal representation of s (in order, with no leading zeroes), followed by n(k occurrences of the character 0. If 0 < n ( 21, return the string consisting of the most significant n digits of the decimal representation of s, followed by a decimal point ., followed by the remaining k(n digits of the decimal representation of s. If (6 < n ( 0, return the string consisting of the character 0, followed by a decimal point ., followed by (n occurrences of the character 0, followed by the k digits of the decimal representation of s. Otherwise, if k = 1, return the string consisting of the single digit of s, followed by lowercase character e, followed by a plus sign + or minus sign ( according to whether n(1 is positive or negative, followed by the decimal representation of the integer abs(n(1) (with no leading zeros). Return the string consisting of the most significant digit of the decimal representation of s, followed by a decimal point ., followed by the remaining k(1 digits of the decimal representation of s, followed by the lowercase character e, followed by a plus sign + or minus sign ( according to whether n(1 is positive or negative, followed by the decimal representation of the integer abs(n(1) (with no leading zeros). NOTE The following observations may be useful as guidelines for implementations, but are not part of the normative requirements of this standard. If x is any number value other than (0, then ToNumber(ToString(x)) is exactly the same number value as x. The least significant digit of s is not always uniquely determined by the requirements listed in step 5. For implementations that provide more accurate conversions than required by the rules above, it is recommended that the following alternative version of step 5 be used as a guideline: Otherwise, let n, k, and s be integers such that k ( 1, 10k(1 ( s < 10k, the number value for s ( 10n(k is m, and k is as small as possible. If there are multiple possibilities for s, choose the value of s for which s ( 10n(k is closest in value to m. If there are two such possible values of s, choose the one that is even. Note that k is the number of digits in the decimal representation of s and that s is not divisible by 10. Implementors of ECMAScript may find useful the paper and code written by David M. Gay for binary-to-decimal conversion of floating-point numbers: Gay, David M. Correctly Rounded Binary-Decimal and Decimal-Binary Conversions. Numerical Analysis Manuscript 90-10. AT&T Bell Laboratories (Murray Hill, New Jersey). November 30, 1990. Available as http://cm.bell-labs.com/cm/cs/doc/90/4-10.ps.gz. Associated code available as http://cm.bell-labs.com/netlib/fp/dtoa.c.gz and as http://cm.bell-labs.com/netlib/fp/g_fmt.c.gz and may also be found at the various netlib mirror sites. ToObject The operator ToObject converts its argument to a value of type Object according to the following table: Input TypeResultUndefinedThrow a TypeError exception.NullThrow a TypeError exception.BooleanCreate a new Boolean object whose [[value]] property is set to the value of the boolean. See section  REF _Ref424531301 \r \h 15.6 for a description of Boolean objects.NumberCreate a new Number object whose [[value]] property is set to the value of the number. See section  REF _Ref424531326 \r \h 15.7 for a description of Number objects.StringCreate a new String object whose [[value]] property is set to the value of the string. See section  REF _Ref424531349 \r \h 15.5 for a description of String objects.ObjectThe result is the input argument (no conversion). Execution Contexts When control is transferred to ECMAScript executable code, control is entering an execution context. Active execution contexts logically form a stack. The top execution context on this logical stack is the running execution context. Definitions Function Objects There are two types of Function objects: Program functions are defined in source text by a FunctionDeclaration or created dynamically either by using a FunctionExpression or by using the built-in Function object as a constructor. Internal functions are built-in objects of the language, such as parseInt and Math.exp. An implementation may also provide implementation-dependent internal functions that are not described in this specification. These functions do not contain executable code defined by the ECMAScript grammar, so they are excluded from this discussion of execution contexts. Types of Executable Code There are three types of ECMAScript executable code: Global code is source text that is treated as an ECMAScript Program. The global code of a particular Program does not include any source text that is parsed as part of a FunctionBody. Eval code is the source text supplied to the built-in eval function. More precisely, if the parameter to the built-in eval function is a string, it is treated as an ECMAScript Program. The eval code for a particular invocation of eval is the global code portion of the string parameter. Function code is source text that is parsed as part of a FunctionBody. The function code of a particular FunctionBody does not include any source text that is parsed as part of a nested FunctionBody. Function code also denotes the source text supplied when using the built-in Function object as a constructor. More precisely, the last parameter provided to the Function constructor is converted to a string and treated as the FunctionBody. If more than one parameter is provided to the Function constructor, all parameters except the last one are converted to strings and concatenated together, separated by commas. The resulting string is interpreted as the FormalParameterList for the FunctionBody defined by the last parameter. The function code for a particular instantiation of a Function does not include any source text that is parsed as part of a nested FunctionBody. Variable Instantiation Every execution context has associated with it a variable object. Variables and functions declared in the source text are added as properties of the variable object. For function code, parameters are added as properties of the variable object. Which object is used as the variable object and what attributes are used for the properties depends on the type of code, but the remainder of the behaviour is generic. On entering an execution context, the properties are bound to the variable object in the following order: For function code: for each formal parameter, as defined in the FormalParameterList, create a property of the variable object whose name is the Identifier and whose attributes are determined by the type of code. The values of the parameters are supplied by the caller as arguments to [[Call]]. If the caller supplies fewer parameter values than there are formal parameters, the extra formal parameters have value undefined. If two or more formal parameters share the same name, hence the same property, the corresponding property is given the value that was supplied for the last parameter with this name. If the value of this last parameter was not supplied by the caller, the value of the corresponding property is undefined. For each FunctionDeclaration in the code, in source text order, create a property of the variable object whose name is the Identifier in the FunctionDeclaration, whose value is the result returned by creating a Function object as described in section  REF _Ref457101484 \r \* MERGEFORMAT 13, and whose attributes are determined by the type of code. If the variable object already has a property with this name, replace its value and attributes. Semantically, this step must follow the creation of FormalParameterList properties. For each VariableDeclaration or VariableDeclarationNoIn in the code, create a property of the variable object whose name is the Identifier in the VariableDeclaration or VariableDeclarationNoIn, whose value is undefined and whose attributes are determined by the type of code. If there is already a property of the variable object with the name of a declared variable, the value of the property and its attributes are not changed. Semantically, this step must follow the creation of the FormalParameterList and FunctionDeclaration properties. In particular, if a declared variable has the same name as a declared function or formal parameter, the variable declaration does not disturb the existing property. Scope Chain and Identifier Resolution Every execution context has associated with it a scope chain. A scope chain is a list of objects that are searched when evaluating an Identifier. When control enters an execution context, a scope chain is created and populated with an initial set of objects, depending on the type of code. During execution within an execution context, the scope chain of the execution context is affected only by with statements (section  REF _Ref458336610 \r \h 12.10) and catch clauses (section  REF _Ref458336613 \r \h 12.14). During execution, the syntactic production PrimaryExpression : Identifier is evaluated using the following algorithm: Get the next object in the scope chain. If there isn't one, go to step 5. Call the [[HasProperty]] method of Result(1), passing the Identifier as the property. If Result(2) is true, return a value of type Reference whose base object is Result(1) and whose property name is the Identifier. Go to step 1. Return a value of type Reference whose base object is null and whose property name is the Identifier. The result of evaluating an identifier is always a value of type Reference with its member name component equal to the identifier string. Global Object There is a unique global object (section  REF _Ref457031693 \r \h 15.1), which is created before control enters any execution context. Initially the global object has the following properties: Built-in objects such as Math, String, Date, parseInt, etc. These have attributes { DontEnum }. Additional host defined properties. This may include a property whose value is the global object itself; for example, in the HTML document object model the window property of the global object is the global object itself. As control enters execution contexts, and as ECMAScript code is executed, additional properties may be added to the global object and the initial properties may be changed. Activation Object When control enters an execution context for function code, an object called the activation object is created and associated with the execution context. The activation object is initialised with a property with name arguments and attributes { DontDelete }. The initial value of this property is the arguments object described below. The activation object is then used as the variable object for the purposes of variable instantiation. The activation object is purely a specification mechanism. It is impossible for an ECMAScript program to access the activation object. It can access members of the activation object, but not the activation object itself. When the call operation is applied to a Reference value whose base object is an activation object, null is used as the this value of the call. This There is a this value associated with every active execution context. The this value depends on the caller and the type of code being executed and is determined when control enters the execution context. The this value associated with an execution context is immutable. Arguments Object When control enters an execution context for function code, an arguments object is created and initialised as follows: The value of the internal [[Prototype]] property of the arguments object is the original Object prototype object, the one that is the initial value of Object.prototype (section  REF _Ref424531384 \r \h  \* MERGEFORMAT 15.2.3.1). A property is created with name callee and property attributes { DontEnum }. The initial value of this property is the Function object being executed. This allows anonymous functions to be recursive. A property is created with name length and property attributes { DontEnum }. The initial value of this property is the number of actual parameter values supplied by the caller. For each non-negative integer, arg, less than the value of the length property, a property is created with name ToString(arg) and property attributes { DontEnum }. The initial value of this property is the value of the corresponding actual parameter supplied by the caller. The first actual parameter value corresponds to arg = 0, the second to arg = 1, and so on. In the case when arg is less than the number of formal parameters for the Function object, this property shares its value with the corresponding property of the activation object. This means that changing this property changes the corresponding property of the activation object and vice versa. Entering An Execution Context Every function and constructor call enters a new execution context, even if a function is calling itself recursively. Every return exits an execution context. A thrown exception, if not caught, may also exit one or more execution contexts. When control enters an execution context, the scope chain is created and initialised, variable instantiation is performed, and the this value is determined. The initialisation of the scope chain, variable instantiation, and the determination of the this value depend on the type of code being entered. Global Code The scope chain is created and initialised to contain the global object and no others. Variable instantiation is performed using the global object as the variable object and using property attributes { DontDelete }. The this value is the global object. Eval Code When control enters an execution context for eval code, the previous active execution context, referred to as the calling context, is used to determine the scope chain, the variable object, and the this value. If there is no calling context, then initialising the scope chain, variable instantiation, and determination of the this value are performed just as for global code. The scope chain is initialised to contain the same objects, in the same order, as the calling context's scope chain. This includes objects added to the calling context's scope chain by with statements and catch clauses. Variable instantiation is performed using the calling context's variable object and using empty property attributes. The this value is the same as the this value of the calling context. Function Code The scope chain is initialised to contain the activation object followed by the objects in the scope chain stored in the [[Scope]] property of the Function object. Variable instantiation is performed using the activation object as the variable object and using property attributes { DontDelete }. The caller provides the this value. If the this value provided by the caller is not an object (including the case where it is null), then the this value is the global object. Expressions Primary Expressions Syntax PrimaryExpression : this Identifier Literal ArrayLiteral ObjectLiteral ( Expression ) The this Keyword The this keyword evaluates to the this value of the execution context. Identifier Reference An Identifier is evaluated using the scoping rules stated in section  REF _Ref424532979 \r \h 10.1.4. The result of evaluating an Identifier is always a value of type Reference. Literal Reference A Literal is evaluated as described in section  REF _Ref431982634 \r \h 7.8. Array Initialiser An array initialiser is an expression describing the initialisation of an Array object, written in a form of a literal. It is a list of zero or more expressions, each of which represents an array element, enclosed in square brackets. The elements need not be literals; they are evaluated each time the array initialiser is evaluated. Array elements may be elided at the beginning, middle or end of the element list. Whenever a comma in the element list is not preceded by an AssignmentExpression (i.e., a comma at the beginning or after another comma), the missing array element contributes to the length of the Array and increases the index of subsequent elements. Elided array elements are not defined. Syntax ArrayLiteral : [ Elisionopt ] [ ElementList ] [ ElementList , Elisionopt ] ElementList : Elisionopt AssignmentExpression ElementList , Elisionopt AssignmentExpression Elision : , Elision , Semantics The production ArrayLiteral : [ Elisionopt ] is evaluated as follows: Create a new array as if by the expression new Array(). Evaluate Elision; if not present, use the numeric value zero. Call the [[Put]] method of Result(1) with arguments "length" and Result(2). Return Result(1). The production ArrayLiteral : [ ElementList ] is evaluated as follows: Evaluate ElementList. Return Result(1). The production ArrayLiteral : [ ElementList , Elisionopt ] is evaluated as follows: Evaluate ElementList. Evaluate Elision; if not present, use the numeric value zero. Call the [[Get]] method of Result(1) with argument "length". Call the [[Put]] method of Result(1) with arguments "length" and (Result(2)+Result(3)). Return Result(1). The production ElementList : Elisionopt AssignmentExpression is evaluated as follows: Create a new array as if by the expression new Array(). Evaluate Elision; if not present, use the numeric value zero. Evaluate AssignmentExpression. Call GetValue(Result(3)). Call the [[Put]] method of Result(1) with arguments Result(2) and Result(4). Return Result(1) The production ElementList : ElementList , Elisionopt AssignmentExpression is evaluated as follows: Evaluate ElementList. Evaluate Elision; if not present, use the numeric value zero. Evaluate AssignmentExpression. Call GetValue(Result(3)). Call the [[Get]] method of Result(1) with argument "length". Call the [[Put]] method of Result(1) with arguments (Result(2)+Result(5)) and Result(4). Return Result(1) The production Elision : , is evaluated as follows: Return the numeric value 1. The production Elision : Elision , is evaluated as follows: Evaluate Elision. Return (Result(1)+1). Object Initialiser An object initialiser is an expression describing the initialisation of an Object, written in a form resembling a literal. It is a list of zero or more pairs of property names and associated values, enclosed in curly braces. The values need not be literals; they are evaluated each time the object initialiser is evaluated. Syntax ObjectLiteral : { } { PropertyNameAndValueList } PropertyNameAndValueList : PropertyName : AssignmentExpression PropertyNameAndValueList , PropertyName : AssignmentExpression PropertyName : Identifier StringLiteral NumericLiteral Semantics The production ObjectLiteral : { } is evaluated as follows: Create a new object as if by the expression new Object(). Return Result(1). The production ObjectLiteral : { PropertyNameAndValueList } is evaluated as follows: Evaluate PropertyNameAndValueList. Return Result(1); The production PropertyNameAndValueList : PropertyName : AssignmentExpression is evaluated as follows: Create a new object as if by the expression new Object(). Evaluate PropertyName. Evaluate AssignmentExpression. Call GetValue(Result(3)). Call the [[Put]] method of Result(1) with arguments Result(2) and Result(4). Return Result(1). The production PropertyNameAndValueList : PropertyNameAndValueList , PropertyName : AssignmentExpression is evaluated as follows: Evaluate PropertyNameAndValueList. Evaluate PropertyName. Evaluate AssignmentExpression. Call GetValue(Result(3)). Call the [[Put]] method of Result(1) with arguments Result(2) and Result(4). Return Result(1). The production PropertyName : Identifier is evaluated as follows: Form a string literal containing the same sequence of characters as the Identifier. Return Result(1). The production PropertyName : StringLiteral is evaluated as follows: Return the value of the StringLiteral. The production PropertyName : NumericLiteral is evaluated as follows: Form the value of the NumericLiteral. Return ToString(Result(1)). The Grouping Operator The production PrimaryExpression : ( Expression ) is evaluated as follows: Evaluate Expression. This may be of type Reference. Return Result(1). NOTE This algorithm does not apply GetValue to Result(1). The principal motivation for this is so that operators such as delete and typeof may be applied to parenthesised expressions. Left-Hand-Side Expressions Syntax MemberExpression : PrimaryExpression FunctionExpression MemberExpression [ Expression ] MemberExpression . Identifier new MemberExpression Arguments NewExpression : MemberExpression new NewExpression CallExpression : MemberExpression Arguments CallExpression Arguments CallExpression [ Expression ] CallExpression . Identifier Arguments : ( ) ( ArgumentList ) ArgumentList : AssignmentExpression ArgumentList , AssignmentExpression LeftHandSideExpression : NewExpression CallExpression Property Accessors Properties are accessed by name, using either the dot notation: MemberExpression . Identifier CallExpression . Identifier or the bracket notation: MemberExpression [ Expression ] CallExpression [ Expression ] The dot notation is explained by the following syntactic conversion: MemberExpression . Identifier is identical in its behaviour to MemberExpression [ ] and similarly CallExpression . Identifier is identical in its behaviour to CallExpression [ ] where is a string literal containing the same sequence of characters as the Identifier. The production MemberExpression : MemberExpression [ Expression ] is evaluated as follows: Evaluate MemberExpression. Call GetValue(Result(1)). Evaluate Expression. Call GetValue(Result(3)). Call ToObject(Result(2)). Call ToString(Result(4)). Return a value of type Reference whose base object is Result(5) and whose property name is Result(6). The production CallExpression : CallExpression [ Expression ] is evaluated in exactly the same manner, except that the contained CallExpression is evaluated in step 1. The new Operator The production NewExpression : new NewExpression is evaluated as follows: Evaluate NewExpression. Call GetValue(Result(1)). If Type(Result(2)) is not Object, throw a TypeError exception. If Result(2) does not implement the internal [[Construct]] method, throw a TypeError exception. Call the [[Construct]] method on Result(2), providing no arguments (that is, an empty list of arguments). Return Result(5). The production MemberExpression : new MemberExpression Arguments is evaluated as follows: Evaluate MemberExpression. Call GetValue(Result(1)). Evaluate Arguments, producing an internal list of argument values (section  REF _Ref424531447 \r \h 11.2.4). If Type(Result(2)) is not Object, throw a TypeError exception. If Result(2) does not implement the internal [[Construct]] method, throw a TypeError exception. Call the [[Construct]] method on Result(2), providing the list Result(3) as the argument values. Return Result(6). Function Calls The production CallExpression : MemberExpression Arguments is evaluated as follows: Evaluate MemberExpression. Evaluate Arguments, producing an internal list of argument values (section  REF _Ref424531464 \r \h 11.2.4). Call GetValue(Result(1)). If Type(Result(3)) is not Object, throw a TypeError exception. If Result(3) does not implement the internal [[Call]] method, throw a TypeError exception. If Type(Result(1)) is Reference, Result(6) is GetBase(Result(1)). Otherwise, Result(6) is null. If Result(6) is an activation object, Result(7) is null. Otherwise, Result(7) is the same as Result(6). Call the [[Call]] method on Result(3), providing Result(7) as the this value and providing the list Result(2) as the argument values. Return Result(8). The production CallExpression : CallExpression Arguments is evaluated in exactly the same manner, except that the contained CallExpression is evaluated in step 1. NOTE Result(8) will never be of type Reference if Result(3) is a native ECMAScript object. Whether calling a host object can return a value of type Reference is implementation-dependent. Argument Lists The evaluation of an argument list produces an internal list of values (section  REF _Ref424667800 \r \h 8.8). The production Arguments : ( ) is evaluated as follows: Return an empty internal list of values. The production Arguments : ( ArgumentList ) is evaluated as follows: Evaluate ArgumentList. Return Result(1). The production ArgumentList : AssignmentExpression is evaluated as follows: Evaluate AssignmentExpression. Call GetValue(Result(1)). Return an internal list whose sole item is Result(2). The production ArgumentList : ArgumentList , AssignmentExpression is evaluated as follows: Evaluate ArgumentList. Evaluate AssignmentExpression. Call GetValue(Result(2)). Return an internal list whose length is one greater than the length of Result(1) and whose items are the items of Result(1), in order, followed at the end by Result(3), which is the last item of the new list. 11.2.5 Function Expressions The production MemberExpression : FunctionExpression is evaluated as follows: Evaluate FunctionExpression. Return Result(1). Postfix Expressions Syntax PostfixExpression : LeftHandSideExpression LeftHandSideExpression [no LineTerminator here] ++ LeftHandSideExpression [no LineTerminator here] -- Postfix Increment Operator The production PostfixExpression : LeftHandSideExpression [no LineTerminator here] ++ is evaluated as follows: Evaluate LeftHandSideExpression. Call GetValue(Result(1)). Call ToNumber(Result(2)). Add the value 1 to Result(3), using the same rules as for the + operator (section  REF _Ref424667869 \r \h 11.6.3). Call PutValue(Result(1), Result(4)). Return Result(3). Postfix Decrement Operator The production PostfixExpression : LeftHandSideExpression [no LineTerminator here] -- is evaluated as follows: Evaluate LeftHandSideExpression. Call GetValue(Result(1)). Call ToNumber(Result(2)). Subtract the value 1 from Result(3), using the same rules as for the - operator (section  REF _Ref424667882 \r \h 11.6.3). Call PutValue(Result(1), Result(4)). Return Result(3). Unary Operators Syntax UnaryExpression : PostfixExpression delete UnaryExpression void UnaryExpression typeof UnaryExpression ++ UnaryExpression -- UnaryExpression + UnaryExpression - UnaryExpression ~ UnaryExpression ! UnaryExpression The delete Operator The production UnaryExpression : delete UnaryExpression is evaluated as follows: Evaluate UnaryExpression. If Type(Result(1)) is not Reference, return true. Call GetBase(Result(1)). Call GetPropertyName(Result(1)). Call the [[Delete]] method on Result(3), providing Result(4) as the property name to delete. Return Result(5). The void Operator The production UnaryExpression : void UnaryExpression is evaluated as follows: Evaluate UnaryExpression. Call GetValue(Result(1)). Return undefined. The typeof Operator The production UnaryExpression : typeof UnaryExpression is evaluated as follows: Evaluate UnaryExpression. If Type(Result(1)) is not Reference, go to step 4. If GetBase(Result(1)) is null, return "undefined". Call GetValue(Result(1)). Return a string determined by Type(Result(4)) according to the following table: TypeResultUndefined"undefined"Null"object"Boolean"boolean"Number"number"String"string"Object (native and doesnt implement [[Call]])"object"Object (native and implements [[Call]])"function"Object (host)Implementation-dependentPrefix Increment Operator The production UnaryExpression : ++ UnaryExpression is evaluated as follows: Evaluate UnaryExpression. Call GetValue(Result(1)). Call ToNumber(Result(2)). Add the value 1 to Result(3), using the same rules as for the + operator (section  REF _Ref424667915 \r \h 11.6.3). Call PutValue(Result(1), Result(4)). Return Result(4). Prefix Decrement Operator The production UnaryExpression : -- UnaryExpression is evaluated as follows: Evaluate UnaryExpression. Call GetValue(Result(1)). Call ToNumber(Result(2)). Subtract the value 1 from Result(3), using the same rules as for the - operator (section  REF _Ref424667925 \r \h 11.6.3). Call PutValue(Result(1), Result(4)). Return Result(4). Unary + Operator The unary + operator converts its operand to Number type. The production UnaryExpression : + UnaryExpression is evaluated as follows: Evaluate UnaryExpression. Call GetValue(Result(1)). Call ToNumber(Result(2)). Return Result(3). Unary - Operator The unary - operator converts its operand to Number type and then negates it. Note that negating +0 produces (0, and negating (0 produces +0. The production UnaryExpression : - UnaryExpression is evaluated as follows: Evaluate UnaryExpression. Call GetValue(Result(1)). Call ToNumber(Result(2)). If Result(3) is NaN, return NaN. Negate Result(3); that is, compute a number with the same magnitude but opposite sign. Return Result(5). Bitwise NOT Operator ( ~ ) The production UnaryExpression : ~ UnaryExpression is evaluated as follows: Evaluate UnaryExpression. Call GetValue(Result(1)). Call ToInt32(Result(2)). Apply bitwise complement to Result(3). The result is a signed 32-bit integer. Return Result(4). Logical NOT Operator ( ! ) The production UnaryExpression : ! UnaryExpression is evaluated as follows: Evaluate UnaryExpression. Call GetValue(Result(1)). Call ToBoolean(Result(2)). If Result(3) is true, return false. Return true. Multiplicative Operators Syntax MultiplicativeExpression : UnaryExpression MultiplicativeExpression * UnaryExpression MultiplicativeExpression / UnaryExpression MultiplicativeExpression % UnaryExpression Semantics The production MultiplicativeExpression : MultiplicativeExpression @ UnaryExpression, where @ stands for one of the operators in the above definitions, is evaluated as follows: Evaluate MultiplicativeExpression. Call GetValue(Result(1)). Evaluate UnaryExpression. Call GetValue(Result(3)). Call ToNumber(Result(2)). Call ToNumber(Result(4)). Apply the specified operation (*, /, or %) to Result(5) and Result(6). See the notes below (sections  REF _Ref424667968 \r \h 11.5.1,  REF _Ref424535329 \r \h 11.5.2,  REF _Ref424535339 \r \h 11.5.3). Return Result(7). Applying the * Operator The * operator performs multiplication, producing the product of its operands. Multiplication is commutative. Multiplication is not always associative in ECMAScript, because of finite precision. The result of a floating-point multiplication is governed by the rules of IEEE 754 double-precision arithmetic: If either operand is NaN, the result is NaN. The sign of the result is positive if both operands have the same sign, negative if the operands have different signs. Multiplication of an infinity by a zero results in NaN. Multiplication of an infinity by an infinity results in an infinity. The sign is determined by the rule already stated above. Multiplication of an infinity by a finite non-zero value results in a signed infinity. The sign is determined by the rule already stated above. In the remaining cases, where neither an infinity or NaN is involved, the product is computed and rounded to the nearest representable value using IEEE 754 round-to-nearest mode. If the magnitude is too large to represent, the result is then an infinity of appropriate sign. If the magnitude is too small to represent, the result is then a zero of appropriate sign. The ECMAScript language requires support of gradual underflow as defined by IEEE 754. Applying the / Operator The / operator performs division, producing the quotient of its operands. The left operand is the dividend and the right operand is the divisor. ECMAScript does not perform integer division. The operands and result of all division operations are double-precision floating-point numbers. The result of division is determined by the specification of IEEE 754 arithmetic: If either operand is NaN, the result is NaN. The sign of the result is positive if both operands have the same sign, negative if the operands have different signs. Division of an infinity by an infinity results in NaN. Division of an infinity by a zero results in an infinity. The sign is determined by the rule already stated above. Division of an infinity by a non-zero finite value results in a signed infinity. The sign is determined by the rule already stated above. Division of a finite value by an infinity results in zero. The sign is determined by the rule already stated above. Division of a zero by a zero results in NaN; division of zero by any other finite value results in zero, with the sign determined by the rule already stated above. Division of a non-zero finite value by a zero results in a signed infinity. The sign is determined by the rule already stated above. In the remaining cases, where neither an infinity, nor a zero, nor NaN is involved, the quotient is computed and rounded to the nearest representable value using IEEE 754 round-to-nearest mode. If the magnitude is too large to represent, the operation overflows; the result is then an infinity of appropriate sign. If the magnitude is too small to represent, the operation underflows and the result is a zero of the appropriate sign. The ECMAScript language requires support of gradual underflow as defined by IEEE 754. Applying the % Operator The % operator yields the remainder of its operands from an implied division; the left operand is the dividend and the right operand is the divisor. NOTE In C and C++, the remainder operator accepts only integral operands; in ECMAScript, it also accepts floating-point operands. The result of a floating-point remainder operation as computed by the % operator is not the same as the remainder operation defined by IEEE 754. The IEEE 754 remainder operation computes the remainder from a rounding division, not a truncating division, and so its behaviour is not analogous to that of the usual integer remainder operator. Instead the ECMAScript language defines % on floating-point operations to behave in a manner analogous to that of the Java integer remainder operator; this may be compared with the C library function fmod. The result of a ECMAScript floating-point remainder operation is determined by the rules of IEEE arithmetic: If either operand is NaN, the result is NaN. The sign of the result equals the sign of the dividend. If the dividend is an infinity, or the divisor is a zero, or both, the result is NaN. If the dividend is finite and the divisor is an infinity, the result equals the dividend. If the dividend is a zero and the divisor is finite, the result is the same as the dividend. In the remaining cases, where neither an infinity, nor a zero, nor NaN is involved, the floating-point remainder r from a dividend n and a divisor d is defined by the mathematical relation r = n ( (d * q) where q is an integer that is negative only if n/d is negative and positive only if n/d is positive, and whose magnitude is as large as possible without exceeding the magnitude of the true mathematical quotient of n and d. Additive Operators Syntax AdditiveExpression : MultiplicativeExpression AdditiveExpression + MultiplicativeExpression AdditiveExpression - MultiplicativeExpression The Addition operator ( + ) The addition operator either performs string concatenation or numeric addition. The production AdditiveExpression : AdditiveExpression + MultiplicativeExpression is evaluated as follows: Evaluate AdditiveExpression. Call GetValue(Result(1)). Evaluate MultiplicativeExpression. Call GetValue(Result(3)). Call ToPrimitive(Result(2)). Call ToPrimitive(Result(4)). If Type(Result(5)) is String or Type(Result(6)) is String, go to step 12. (Note that this step differs from step 3 in the comparison algorithm for the relational operators, by using or instead of and.) Call ToNumber(Result(5)). Call ToNumber(Result(6)). Apply the addition operation to Result(8) and Result(9). See the note below (section  REF _Ref424668007 \r \h 11.6.3). Return Result(10). Call ToString(Result(5)). Call ToString(Result(6)). Concatenate Result(12) followed by Result(13). Return Result(14). NOTE No hint is provided in the calls to ToPrimitive in steps 5 and 6. All native ECMAScript objects except Date objects handle the absence of a hint as if the hint Number were given; Date objects handle the absence of a hint as if the hint String were given. Host objects may handle the absence of a hint in some other manner. The Subtraction Operator ( - ) The production AdditiveExpression : AdditiveExpression - MultiplicativeExpression is evaluated as follows: Evaluate AdditiveExpression. Call GetValue(Result(1)). Evaluate MultiplicativeExpression. Call GetValue(Result(3)). Call ToNumber(Result(2)). Call ToNumber(Result(4)). Apply the subtraction operation to Result(5) and Result(6). See the note below (section  REF _Ref424668017 \r \h 11.6.3). Return Result(7). Applying the Additive Operators ( +,- ) to Numbers The + operator performs addition when applied to two operands of numeric type, producing the sum of the operands. The - operator performs subtraction, producing the difference of two numeric operands. Addition is a commutative operation, but not always associative. The result of an addition is determined using the rules of IEEE 754 double-precision arithmetic: If either operand is NaN, the result is NaN. The sum of two infinities of opposite sign is NaN. The sum of two infinities of the same sign is the infinity of that sign. The sum of an infinity and a finite value is equal to the infinite operand. The sum of two negative zeros is (0. The sum of two positive zeros, or of two zeros of opposite sign, is +0. The sum of a zero and a nonzero finite value is equal to the nonzero operand. The sum of two nonzero finite values of the same magnitude and opposite sign is +0. In the remaining cases, where neither an infinity, nor a zero, nor NaN is involved, and the operands have the same sign or have different magnitudes, the sum is computed and rounded to the nearest representable value using IEEE 754 round-to-nearest mode. If the magnitude is too large to represent, the operation overflows and the result is then an infinity of appropriate sign. The ECMAScript language requires support of gradual underflow as defined by IEEE 754. The - operator performs subtraction when applied to two operands of numeric type, producing the difference of its operands; the left operand is the minuend and the right operand is the subtrahend. Given numeric operands a and b, it is always the case that ab produces the same result as a+(b). Bitwise Shift Operators Syntax ShiftExpression : AdditiveExpression ShiftExpression << AdditiveExpression ShiftExpression >> AdditiveExpression ShiftExpression >>> AdditiveExpression The Left Shift Operator ( << ) Performs a bitwise left shift operation on the left operand by the amount specified by the right operand. The production ShiftExpression : ShiftExpression << AdditiveExpression is evaluated as follows: Evaluate ShiftExpression. Call GetValue(Result(1)). Evaluate AdditiveExpression. Call GetValue(Result(3)). Call ToInt32(Result(2)). Call ToUint32(Result(4)). Mask out all but the least significant 5 bits of Result(6), that is, compute Result(6) & 0x1F. Left shift Result(5) by Result(7) bits. The result is a signed 32 bit integer. Return Result(8). The Signed Right Shift Operator ( >> ) Performs a sign-filling bitwise right shift operation on the left operand by the amount specified by the right operand. The production ShiftExpression : ShiftExpression >> AdditiveExpression is evaluated as follows: Evaluate ShiftExpression. Call GetValue(Result(1)). Evaluate AdditiveExpression. Call GetValue(Result(3)). Call ToInt32(Result(2)). Call ToUint32(Result(4)). Mask out all but the least significant 5 bits of Result(6), that is, compute Result(6) & 0x1F. Perform sign-extending right shift of Result(5) by Result(7) bits. The most significant bit is propagated. The result is a signed 32 bit integer. Return Result(8). The Unsigned Right Shift Operator ( >>> ) Performs a zero-filling bitwise right shift operation on the left operand by the amount specified by the right operand. The production ShiftExpression : ShiftExpression >>> AdditiveExpression is evaluated as follows: Evaluate ShiftExpression. Call GetValue(Result(1)). Evaluate AdditiveExpression. Call GetValue(Result(3)). Call ToUint32(Result(2)). Call ToUint32(Result(4)). Mask out all but the least significant 5 bits of Result(6), that is, compute Result(6) & 0x1F. Perform zero-filling right shift of Result(5) by Result(7) bits. Vacated bits are filled with zero. The result is an unsigned 32 bit integer. Return Result(8). Relational Operators Syntax RelationalExpression : ShiftExpression RelationalExpression < ShiftExpression RelationalExpression > ShiftExpression RelationalExpression <= ShiftExpression RelationalExpression >= ShiftExpression RelationalExpression instanceof ShiftExpression RelationalExpression in ShiftExpression RelationalExpressionNoIn : ShiftExpression RelationalExpressionNoIn < ShiftExpression RelationalExpressionNoIn > ShiftExpression RelationalExpressionNoIn <= ShiftExpression RelationalExpressionNoIn >= ShiftExpression RelationalExpressionNoIn instanceof ShiftExpression NOTE: The NoIn variants are needed to avoid confusing the in operator in a relational expression with the in operator in a for statement. Semantics The result of evaluating a relational operator is always of type Boolean, reflecting whether the relationship named by the operator holds between its two operands. The RelationalExpressionNoIn productions are evaluated in the same manner as the RelationalExpression productions except that the contained RelationalExpressionNoIn is evaluated instead of the contained RelationalExpression. The Less-than Operator ( < ) The production RelationalExpression : RelationalExpression < ShiftExpression is evaluated as follows: Evaluate RelationalExpression. Call GetValue(Result(1)). Evaluate ShiftExpression. Call GetValue(Result(3)). Perform the comparison Result(2) < Result(4). (Section  REF _Ref424668059 \r \h 11.8.5.) If Result(5) is undefined, return false. Otherwise, return Result(5). The Greater-than Operator ( > ) The production RelationalExpression : RelationalExpression > ShiftExpression is evaluated as follows: Evaluate RelationalExpression. Call GetValue(Result(1)). Evaluate ShiftExpression. Call GetValue(Result(3)). Perform the comparison Result(4) < Result(2). (Section  REF _Ref424668059 \r \h 11.8.5.) If Result(5) is undefined, return false. Otherwise, return Result(5). The Less-than-or-equal Operator ( <= ) The production RelationalExpression : RelationalExpression <= ShiftExpression is evaluated as follows: Evaluate RelationalExpression. Call GetValue(Result(1)). Evaluate ShiftExpression. Call GetValue(Result(3)). Perform the comparison Result(4) < Result(2). (Section  REF _Ref424668059 \r \h 11.8.5.) If Result(5) is true or undefined, return false. Otherwise, return true. The Greater-than-or-equal Operator ( >= ) The production RelationalExpression : RelationalExpression >= ShiftExpression is evaluated as follows: Evaluate RelationalExpression. Call GetValue(Result(1)). Evaluate ShiftExpression. Call GetValue(Result(3)). Perform the comparison Result(2) < Result(4). (Section  REF _Ref424668059 \r \h 11.8.5.) If Result(5) is true or undefined, return false. Otherwise, return true. The Abstract Relational Comparison Algorithm The comparison x < y, where x and y are values, produces true, false, or undefined (which indicates that at least one operand is NaN). Such a comparison is performed as follows: Call ToPrimitive(x, hint Number). Call ToPrimitive(y, hint Number). If Type(Result(1)) is String and Type(Result(2)) is String, go to step 16. (Note that this step differs from step 7 in the algorithm for the addition operator + in using and instead of or.) Call ToNumber(Result(1)). Call ToNumber(Result(2)). If Result(4) is NaN, return undefined. If Result(5) is NaN, return undefined. If Result(4) and Result(5) are the same number value, return false. If Result(4) is +0 and Result(5) is (0, return false. If Result(4) is (0 and Result(5) is +0, return false. If Result(4) is +(, return false. If Result(5) is +(, return true. If Result(5) is ((, return false. If Result(4) is ((, return true. If the mathematical value of Result(4) is less than the mathematical value of Result(5)note that these mathematical values are both finite and not both zeroreturn true. Otherwise, return false. If Result(2) is a prefix of Result(1), return false. (A string value p is a prefix of string value q if q can be the result of concatenating p and some other string r. Note that any string is a prefix of itself, because r may be the empty string.) If Result(1) is a prefix of Result(2), return true. Let k be the smallest nonnegative integer such that the character at position k within Result(1) is different from the character at position k within Result(2). (There must be such a k, for neither string is a prefix of the other.) Let m be the integer that is the code point value for the character at position k within Result(1). Let n be the integer that is the code point value for the character at position k within Result(2). If m < n, return true. Otherwise, return false. NOTE The comparison of strings uses a simple lexicographic ordering on sequences of code point value values. There is no attempt to use the more complex, semantically oriented definitions of character or string equality and collating order defined in the Unicode specification. Therefore strings that are canonically equal according to the Unicode standard could test as unequal. In effect this algorithm assumes that both strings are already in normalised form. The instanceof operator The production RelationalExpression: RelationalExpression instanceof ShiftExpression is evaluated as follows: Evaluate RelationalExpression. Call GetValue(Result(1)). Evaluate ShiftExpression. Call GetValue(Result(3)). If Result(4) is not an object, throw a TypeError exception. If Result(4) does not have a [[HasInstance]] method, throw a TypeError exception. Call the [[HasInstance]] method of Result(4) with parameter Result(2). Return Result(7). The in operator The production RelationalExpression : RelationalExpression in ShiftExpression is evaluated as follows: Evaluate RelationalExpression. Call GetValue(Result(1)). Evaluate ShiftExpression. Call GetValue(Result(3)). If Result(4) is not an object, throw a TypeError exception. Call ToString(Result(2)). Call the [[HasProperty]] method of Result(4) with parameter Result(6). Return Result(7). Equality Operators Syntax EqualityExpression : RelationalExpression EqualityExpression == RelationalExpression EqualityExpression != RelationalExpression EqualityExpression === RelationalExpression EqualityExpression !== RelationalExpression EqualityExpressionNoIn : RelationalExpressionNoIn EqualityExpressionNoIn == RelationalExpressionNoIn EqualityExpressionNoIn != RelationalExpressionNoIn EqualityExpressionNoIn === RelationalExpressionNoIn EqualityExpressionNoIn !== RelationalExpressionNoIn Semantics The result of evaluating an equality operator is always of type Boolean, reflecting whether the relationship named by the operator holds between its two operands. The EqualityExpressionNoIn productions are evaluated in the same manner as the EqualityExpression productions except that the contained EqualityExpressionNoIn and RelationalExpressionNoIn are evaluated instead of the contained EqualityExpression and RelationalExpression, respectively. The Equals Operator ( == ) The production EqualityExpression : EqualityExpression == RelationalExpression is evaluated as follows: Evaluate EqualityExpression. Call GetValue(Result(1)). Evaluate RelationalExpression. Call GetValue(Result(3)). Perform the comparison Result(4) == Result(2). (Section  REF _Ref424668141 \r \h 11.9.3.) Return Result(5). The Does-not-equals Operator ( != ) The production EqualityExpression : EqualityExpression != RelationalExpression is evaluated as follows: Evaluate EqualityExpression. Call GetValue(Result(1)). Evaluate RelationalExpression. Call GetValue(Result(3)). Perform the comparison Result(4) == Result(2). (Section  REF _Ref424668141 \r \h 11.9.3.) If Result(5) is true, return false. Otherwise, return true. The Abstract Equality Comparison Algorithm The comparison x == y, where x and y are values, produces true or false. Such a comparison is performed as follows: If Type(x) is different from Type(y), go to step 14. If Type(x) is Undefined, return true. If Type(x) is Null, return true. If Type(x) is not Number, go to step 11. If x is NaN, return false. If y is NaN, return false. If x is the same number value as y, return true. If x is +0 and y is (0, return true. If x is (0 and y is +0, return true. Return false. If Type(x) is String, then return true if x and y are exactly the same sequence of characters (same length and same characters in corresponding positions). Otherwise, return false. If Type(x) is Boolean, return true if x and y are both true or both false. Otherwise, return false. Return true if x and y refer to the same object or if they refer to objects joined to each other (section  REF _Ref463875961 \r \h 13.1.2). Otherwise, return false. If x is null and y is undefined, return true. If x is undefined and y is null, return true. If Type(x) is Number and Type(y) is String, return the result of the comparison x == ToNumber(y). If Type(x) is String and Type(y) is Number, return the result of the comparison ToNumber(x) == y. If Type(x) is Boolean, return the result of the comparison ToNumber(x) == y. If Type(y) is Boolean, return the result of the comparison x == ToNumber(y). If Type(x) is either String or Number and Type(y) is Object, return the result of the comparison x == ToPrimitive(y). If Type(x) is Object and Type(y) is either String or Number, return the result of the comparison ToPrimitive(x) == y. Return false. NOTE Given the above definition of equality: String comparison can be forced by: "" + a == "" + b. Numeric comparison can be forced by: a - 0 == b - 0. Boolean comparison can be forced by: !a == !b. The equality operators maintain the following invariants: A != B is equivalent to !(A == B). A == B is equivalent to B == A, except in the order of evaluation of A and B. The equality operator is not always transitive. For example, there might be two distinct String objects, each representing the same string value; each String object would be considered equal to the string value by the == operator, but the two String objects would not be equal to each other. Comparison of strings uses a simple equality test on sequences of code point value values. There is no attempt to use the more complex, semantically oriented definitions of character or string equality and collating order defined in the Unicode 2.0 specification. Therefore strings that are canonically equal according to the Unicode standard could test as unequal. In effect this algorithm assumes that both strings are already in normalised form. The Strict Equals Operator ( === ) The production EqualityExpression : EqualityExpression === RelationalExpression is evaluated as follows: Evaluate EqualityExpression. Call GetValue(Result(1)). Evaluate RelationalExpression. Call GetValue(Result(3)). Perform the comparison Result(4) === Result(2). (See below.) Return Result(5). The Strict Does-not-equal Operator ( !== ) The production EqualityExpression : EqualityExpression !== RelationalExpression is evaluated as follows: Evaluate EqualityExpression. Call GetValue(Result(1)). Evaluate RelationalExpression. Call GetValue(Result(3)). Perform the comparison Result(4) === Result(2). (See below.) If Result(5) is true, return false. Otherwise, return true. The Strict Equality Comparison Algorithm The comparison x === y, where x and y are values, produces true or false. Such a comparison is performed as follows: If Type(x) is different from Type(y), return false. If Type(x) is Undefined, return true. If Type(x) is Null, return true. If Type(x) is not Number, go to step 11. If x is NaN, return false. If y is NaN, return false. If x is the same number value as y, return true. If x is +0 and y is (0, return true. If x is (0 and y is +0, return true. Return false. If Type(x) is String, then return true if x and y are exactly the same sequence of characters (same length and same characters in corresponding positions); otherwise, return false. If Type(x) is Boolean, return true if x and y are both true or both false; otherwise, return false. Return true if x and y refer to the same object or if they refer to objects joined to each other (section  REF _Ref463875961 \r \h 13.1.2). Otherwise, return false. Binary Bitwise Operators Syntax BitwiseANDExpression : EqualityExpression BitwiseANDExpression & EqualityExpression BitwiseANDExpressionNoIn : EqualityExpressionNoIn BitwiseANDExpressionNoIn & EqualityExpressionNoIn BitwiseXORExpression : BitwiseANDExpression BitwiseXORExpression ^ BitwiseANDExpression BitwiseXORExpressionNoIn : BitwiseANDExpressionNoIn BitwiseXORExpressionNoIn ^ BitwiseANDExpressionNoIn BitwiseORExpression : BitwiseXORExpression BitwiseORExpression | BitwiseXORExpression BitwiseORExpressionNoIn : BitwiseXORExpressionNoIn BitwiseORExpressionNoIn | BitwiseXORExpressionNoIn Semantics The production A : A @ B, where @ is one of the bitwise operators in the productions above, is evaluated as follows: Evaluate A. Call GetValue(Result(1)). Evaluate B. Call GetValue(Result(3)). Call ToInt32(Result(2)). Call ToInt32(Result(4)). Apply the bitwise operator @ to Result(5) and Result(6). The result is a signed 32 bit integer. Return Result(7). Binary Logical Operators Syntax LogicalANDExpression : BitwiseORExpression LogicalANDExpression && BitwiseORExpression LogicalANDExpressionNoIn : BitwiseORExpressionNoIn LogicalANDExpressionNoIn && BitwiseORExpressionNoIn LogicalORExpression : LogicalANDExpression LogicalORExpression || LogicalANDExpression LogicalORExpressionNoIn : LogicalANDExpressionNoIn LogicalORExpressionNoIn || LogicalANDExpressionNoIn Semantics The production LogicalANDExpression : LogicalANDExpression && BitwiseORExpression is evaluated as follows: Evaluate LogicalANDExpression. Call GetValue(Result(1)). Call ToBoolean(Result(2)). If Result(3) is false, return Result(2). Evaluate BitwiseORExpression. Call GetValue(Result(5)). Return Result(6). The production LogicalORExpression : LogicalORExpression || LogicalANDExpression is evaluated as follows: Evaluate LogicalORExpression. Call GetValue(Result(1)). Call ToBoolean(Result(2)). If Result(3) is true, return Result(2). Evaluate LogicalANDExpression. Call GetValue(Result(5)). Return Result(6). The LogicalANDExpressionNoIn and LogicalORExpressionNoIn productions are evaluated in the same manner as the LogicalANDExpression and LogicalORExpression productions except that the contained LogicalANDExpressionNoIn, BitwiseORExpressionNoIn and LogicalORExpressionNoIn are evaluated instead of the contained LogicalANDExpression, BitwiseORExpression and LogicalORExpression, respectively. NOTE The value produced by a && or || operator is not necessarily of type Boolean. The value produced will always be the value of one of the two operand expressions. Conditional Operator ( ?: ) Syntax ConditionalExpression : LogicalORExpression LogicalORExpression ? AssignmentExpression : AssignmentExpression ConditionalExpressionNoIn : LogicalORExpressionNoIn LogicalORExpressionNoIn ? AssignmentExpression : AssignmentExpressionNoIn Semantics The production ConditionalExpression : LogicalORExpression ? AssignmentExpression : AssignmentExpression is evaluated as follows: Evaluate LogicalORExpression. Call GetValue(Result(1)). Call ToBoolean(Result(2)). If Result(3) is false, go to step 8. Evaluate the first AssignmentExpression. Call GetValue(Result(5)). Return Result(6). Evaluate the second AssignmentExpression. Call GetValue(Result(8)). Return Result(9). The ConditionalExpressionNoIn production is evaluated in the same manner as the ConditionalExpression production except that the contained LogicalORExpressionNoIn, AssignmentExpression and AssignmentExpressionNoIn are evaluated instead of the contained LogicalORExpression, first AssignmentExpression and second AssignmentExpression, respectively. NOTE The grammar for a ConditionalExpression in ECMAScript is a little bit different from that in C and Java, which each allow the second subexpression to be an Expression but restrict the third expression to be a ConditionalExpression. The motivation for this difference in ECMAScript is to allow an assignment expression to be governed by either arm of a conditional and to eliminate the confusing and fairly useless case of a comma expression as the centre expression. Assignment Operators Syntax AssignmentExpression : ConditionalExpression LeftHandSideExpression AssignmentOperator AssignmentExpression AssignmentExpressionNoIn : ConditionalExpressionNoIn LeftHandSideExpression AssignmentOperator AssignmentExpressionNoIn AssignmentOperator : one of =*=/=%=+=-=<<=>>=>>>=&=^=|= Semantics The AssignmentExpressionNoIn productions are evaluated in the same manner as the AssignmentExpression productions except that the contained ConditionalExpressionNoIn and AssignmentExpressionNoIn are evaluated instead of the contained ConditionalExpression and AssignmentExpression, respectively. Simple Assignment ( = ) The production AssignmentExpression : LeftHandSideExpression = AssignmentExpression is evaluated as follows: Evaluate LeftHandSideExpression. Evaluate AssignmentExpression. Call GetValue(Result(2)). Call PutValue(Result(1), Result(3)). Return Result(3). Compound Assignment ( op= ) The production AssignmentExpression : LeftHandSideExpression @ = AssignmentExpression, where @ represents one of the operators indicated above, is evaluated as follows: Evaluate LeftHandSideExpression. Call GetValue(Result(1)). Evaluate AssignmentExpression. Call GetValue(Result(3)). Apply operator @ to Result(2) and Result(4). Call PutValue(Result(1), Result(5)). Return Result(5). Comma Operator ( , ) Syntax Expression : AssignmentExpression Expression , AssignmentExpression ExpressionNoIn : AssignmentExpressionNoIn ExpressionNoIn , AssignmentExpressionNoIn Semantics The production Expression : Expression , AssignmentExpression is evaluated as follows: Evaluate Expression. Call GetValue(Result(1)). Evaluate AssignmentExpression. Call GetValue(Result(3)). Return Result(4). The ExpressionNoIn production is evaluated in the same manner as the Expression production except that the contained ExpressionNoIn and AssignmentExpressionNoIn are evaluated instead of the contained Expression and AssignmentExpression, respectively. Statements Syntax Statement : Block VariableStatement EmptyStatement ExpressionStatement IfStatement IterationStatement ContinueStatement BreakStatement ReturnStatement WithStatement LabelledStatement SwitchStatement ThrowStatement TryStatement Semantics A Statement can be part of a LabelledStatement, which itself can be part of a LabelledStatement, and so on. The labels introduced this way are collectively referred to as the current label set when describing the semantics of individual statements. A LabelledStatement has no semantic meaning other than the introduction of a label to a label set. The label set of an IterationStatement or a SwitchStatement initially contains the single element empty. The label set of any other statement is initially empty. Block Syntax Block : { StatementListopt } StatementList : Statement StatementList Statement Semantics The production Block : { } is evaluated as follows: Return (normal, empty, empty). The production Block : { StatementList }is evaluated as follows: Evaluate StatementList. Return Result(1). The production StatementList : Statement is evaluated as follows: Evaluate Statement. If an exception was thrown, return (throw, V, empty) where V is the exception. (Execution now proceeds as if no exception were thrown.) Return Result(1). The production StatementList : StatementList Statement is evaluated as follows: Evaluate StatementList. If Result(1) is an abrupt completion, return Result(1). Evaluate Statement. If an exception was thrown, return (throw, V, empty) where V is the exception. (Execution now proceeds as if no exception were thrown.) If Result(3).value is empty, let V = Result(1).value, otherwise let V = Result(3).value. Return (Result(3).type, V, Result(3).target). Variable statement Syntax VariableStatement : var VariableDeclarationList ; VariableDeclarationList : VariableDeclaration VariableDeclarationList , VariableDeclaration VariableDeclarationListNoIn : VariableDeclarationNoIn VariableDeclarationListNoIn , VariableDeclarationNoIn VariableDeclaration : Identifier Initialiseropt VariableDeclarationNoIn : Identifier InitialiserNoInopt Initialiser : = AssignmentExpression InitialiserNoIn : = AssignmentExpressionNoIn Description If the variable statement occurs inside a FunctionDeclaration, the variables are defined with function-local scope in that function, as described in section  REF _Ref449943314 \r \h 10.1.3. Otherwise, they are defined with global scope (that is, they are created as members of the global object, as described in section  REF _Ref449943314 \r \h 10.1.3) using property attributes { DontDelete }. Variables are created when the execution scope is entered. A Block does not define a new execution scope. Only Program and FunctionDeclaration produce a new scope. Variables are initialised to undefined when created. A variable with an Initialiser is assigned the value of its AssignmentExpression when the VariableStatement is executed, not when the variable is created. Semantics The production VariableStatement : var VariableDeclarationList ; is evaluated as follows: Evaluate VariableDeclarationList. Return (normal, empty, empty). The production VariableDeclarationList :VariableDeclaration is evaluated as follows: Evaluate VariableDeclaration. The production VariableDeclarationList : VariableDeclarationList , VariableDeclaration is evaluated as follows: Evaluate VariableDeclarationList. Evaluate VariableDeclaration. The production VariableDeclaration : Identifier is evaluated as follows: Return a string value containing the same sequence of characters as in the Identifier. The production VariableDeclaration : Identifier Initialiser is evaluated as follows: Evaluate Identifier as described in section  REF _Ref424531495 \r \h 11.1.2. Evaluate Initialiser. Call GetValue(Result(2)). Call PutValue(Result(1), Result(3)). Return a string value containing the same sequence of characters as in the Identifier. The production Initialiser : = AssignmentExpression is evaluated as follows: Evaluate AssignmentExpression. Return Result(1). The VariableDeclarationListNoIn, VariableDeclarationNoIn and InitialiserNoIn productions are evaluated in the same manner as the VariableDeclarationList, VariableDeclaration and Initialiser productions except that the contained VariableDeclarationListNoIn, VariableDeclarationNoIn, InitialiserNoIn and AssignmentExpressionNoIn are evaluated instead of the contained VariableDeclarationList, VariableDeclaration, Initialiser and AssignmentExpression, respectively. Empty Statement Syntax EmptyStatement : ; Semantics The production EmptyStatement : ; is evaluated as follows: Return (normal, empty, empty). Expression Statement Syntax ExpressionStatement : [lookahead ( {{, function}] Expression ; Note that an ExpressionStatement cannot start with an opening curly brace because that might make it ambiguous with a Block. Also, an ExpressionStatement cannot start with the function keyword because that might make it ambiguous with a FunctionDeclaration. Semantics The production ExpressionStatement : [lookahead ( {{, function}] Expression; is evaluated as follows: Evaluate Expression. Call GetValue(Result(1)). Return (normal, Result(2), empty). The if Statement Syntax IfStatement : if ( Expression ) Statement else Statement if ( Expression ) Statement Each else for which the choice of associated if is ambiguous shall be associated with the nearest possible if that would otherwise have no corresponding else. Semantics The production IfStatement : if ( Expression ) Statement else Statement is evaluated as follows: Evaluate Expression. Call GetValue(Result(1)). Call ToBoolean(Result(2)). If Result(3) is false, go to step 7. Evaluate the first Statement. Return Result(5). Evaluate the second Statement. Return Result(7). The production IfStatement : if ( Expression ) Statement is evaluated as follows: Evaluate Expression. Call GetValue(Result(1)). Call ToBoolean(Result(2)). If Result(3) is false, return (normal, empty, empty). Evaluate Statement. Return Result(5). Iteration Statements An iteration statement consists of a header (which consists of a keyword and a parenthesised control construct) and a body (which consists of a Statement). Syntax IterationStatement : do Statement while ( Expression ); while ( Expression ) Statement for (ExpressionNoInopt; Expressionopt ; Expressionopt ) Statement for ( var VariableDeclarationListNoIn; Expressionopt ; Expressionopt ) Statement for ( LeftHandSideExpression in Expression ) Statement for ( var VariableDeclarationNoIn in Expression ) Statement The do-while Statement The production do Statement while ( Expression ); is evaluated as follows: Let V = empty. Evaluate Statement. If Result(2).value is not empty, let V = Result(2).value. If Result(2).type is continue and Result(2).target is in the current label set, go to step 7. If Result(2).type is break and Result(2).target is in the current label set, return (normal, V, empty). If Result(2) is an abrupt completion, return Result(2). Evaluate Expression. Call GetValue(Result(7)). Call ToBoolean(Result(8)). If Result(9) is true, go to step 2. Return (normal, V, empty); The while statement The production IterationStatement : while ( Expression ) Statement is evaluated as follows: Let V = empty. Evaluate Expression. Call GetValue(Result(2)). Call ToBoolean(Result(3)). If Result(4) is false, return (normal, V, empty). Evaluate Statement. If Result(6).value is not empty, let V = Result(6).value. If Result(6).type is continue and Result(6).target is in the current label set, go to 2. If Result(6).type is break and Result(6).target is in the current label set, return (normal, V, empty). If Result(6) is an abrupt completion, return Result(6). Go to step 2. The for Statement The production IterationStatement : for (ExpressionNoInopt ; Expressionopt ; Expressionopt) Statement is evaluated as follows: If the first Expression is not present, go to step 4. Evaluate ExpressionNoIn. Call GetValue(Result(2)). (This value is not used.) Let V = empty. If the first Expression is not present, go to step 10. Evaluate the first Expression. Call GetValue(Result(6)). Call ToBoolean(Result(7)). If Result(8) is false, go to step 19. Evaluate Statement. If Result(10).value is not empty, let V = Result(10).value If Result(10).type is break and Result(10).target is in the current label set, go to step 19. If Result(10).type is continue and Result(10).target is in the current label set, go to step 15. If Result(10) is an abrupt completion, return Result(10). If the second Expression is not present, go to step 5. Evaluate the second Expression. Call GetValue(Result(16). (This value is not used.) Go to step 5. Return (normal, V, empty). The production IterationStatement : for ( var VariableDeclarationListNoIn ; Expressionopt ; Expressionopt ) Statement is evaluated as follows: Evaluate VariableDeclarationListNoIn. Let V = empty. If the first Expression is not present, go to step 8. Evaluate the first Expression. Call GetValue(Result(4)). Call ToBoolean(Result(5)). If Result(6) is false, go to step 14. Evaluate Statement. If Result(8).value is not empty, let V = Result(8).value. If Result(8).type is break and Result(8).target is in the current label set, go to step 17. If Result(8).type is continue and Result(8).target is in the current label set, go to step 13. If Result(8) is an abrupt completion, return Result(8). If the second Expression is not present, go to step 3. Evaluate the second Expression. Call GetValue(Result(14)). (This value is not used.) Go to step 3. Return (normal, V, empty). The for-in Statement The production IterationStatement : for ( LeftHandSideExpression in Expression ) Statement is evaluated as follows: Evaluate the Expression. Call GetValue(Result(1)). Call ToObject(Result(2)). Let V = empty. Get the name of the next property of Result(3) that doesnt have the DontEnum attribute. If there is no such property, go to step 14. Evaluate the LeftHandSideExpression ( it may be evaluated repeatedly). Call PutValue(Result(6), Result(5)). Evaluate Statement. If Result(8).value is not empty, let V = Result(8).value. If Result(8).type is break and Result(8).target is in the current label set, go to step 14. If Result(8).type is continue and Result(8).target is in the current label set, go to step 5. If Result(8) is an abrupt completion, return Result(8). Go to step 5. Return (normal, V, empty). The production IterationStatement : for ( var VariableDeclarationNoIn in Expression ) Statement is evaluated as follows: Evaluate VariableDeclarationNoIn. Evaluate Expression. Call GetValue(Result(2)). Call ToObject(Result(3)). Let V = empty. Get the name of the next property of Result(4) that doesnt have the DontEnum attribute. If there is no such property, go to step 15. Evaluate Result(1) as if it were an Identifier; see  REF _Ref424535502 \r \h 11.1.2 (yes, it may be evaluated repeatedly). Call PutValue(Result(7), Result(6)). Evaluate Statement. If Result(9).value is not empty, let V = Result(9).value. If Result(9).type is break and Result(9).target is in the current label set, go to step 15. If Result(9).type is continue and Result(9).target is in the current label set, go to step 6. If Result(8) is an abrupt completion, return Result(8). Go to step 6. Return (normal, V, empty). The mechanics of enumerating the properties (step 5 in the first algorithm, step 6 in the second) is implementation dependent. The order of enumeration is defined by the object. Properties of the object being enumerated may be deleted during enumeration. If a property that has not yet been visited during enumeration is deleted, then it will not be visited. If new properties are added to the object being enumerated during enumeration, the newly added properties are not guaranteed to be visited in the active enumeration. Enumerating the properties of an object includes enumerating properties of its prototype, and the prototype of the prototype, and so on, recursively; but a property of a prototype is not enumerated if it is shadowed because some previous object in the prototype chain has a property with the same name. The continue Statement Syntax ContinueStatement : continue [no LineTerminator here] Identifieropt ; Semantics A program is considered syntactically incorrect if either of the following are true: The program contains a continue statement without the optional Identifier, which is not nested, directly or indirectly (but not crossing function boundaries), within an IterationStatement. The program contains a continue statement with the optional Identifier, where Identifier does not appear in the label set of an enclosing (but not crossing function boundaries) IterationStatement. A ContinueStatement without an Identifier is evaluated as follows: Return (continue, empty, empty). A ContinueStatement with the optional Identifier is evaluated as follows: Return (continue, empty, Identifier). The break Statement Syntax BreakStatement : break [no LineTerminator here] Identifieropt ; Semantics A program is considered syntactically incorrect if either of the following are true: The program contains a break statement without the optional Identifier, which is not nested, directly or indirectly (but not crossing function boundaries), within an IterationStatement or a SwitchStatement. The program contains a break statement with the optional Identifier, where Identifier does not appear in the label set of an enclosing (but not crossing function boundaries) Statement. A BreakStatement without an Identifier is evaluated as follows: Return (break, empty, empty). A BreakStatement with an Identifier is evaluated as follows: Return (break, empty, Identifier). The return Statement Syntax ReturnStatement : return [no LineTerminator here] Expressionopt ; Semantics An ECMAScript program is considered syntactically incorrect if it contains a return statement that is not within a FunctionBody. A return statement causes a function to cease execution and return a value to the caller. If Expression is omitted, the return value is undefined. Otherwise, the return value is the value of Expression. The production ReturnStatement : return [no LineTerminator here] Expressionopt ; is evaluated as: If the Expression is not present, return (return, undefined, empty). Evaluate Expression. Call GetValue(Result(2)). Return (return, Result(3), empty). The with Statement Syntax WithStatement : with ( Expression ) Statement Description The with statement adds a computed object to the front of the scope chain of the current execution context, then executes a statement with this augmented scope chain, then restores the scope chain. Semantics The production WithStatement : with ( Expression ) Statement is evaluated as follows: Evaluate Expression. Call GetValue(Result(1)). Call ToObject(Result(2)). Add Result(3) to the front of the scope chain. Evaluate Statement using the augmented scope chain from step 4. Let C be Result(5). If an exception was thrown in step 5, let C be (throw, V, empty), where V is the exception. (Execution now proceeds as if no exception were thrown.) Remove Result(3) from the front of the scope chain. Return C. NOTE No matter how control leaves the embedded Statement, whether normally or by some form of abrupt completion or exception, the scope chain is always restored to its former state. The switch Statement Syntax SwitchStatement : switch ( Expression ) CaseBlock CaseBlock : { CaseClausesopt } { CaseClausesopt DefaultClause CaseClausesopt } CaseClauses : CaseClause CaseClauses CaseClause CaseClause : case Expression : StatementListopt DefaultClause : default : StatementListopt Semantics The production SwitchStatement : switch ( Expression ) CaseBlock is evaluated as follows: Evaluate Expression. Call GetValue(Result(1)). Evaluate CaseBlock, passing it Result(2) as a parameter. If Result(3).type is break and Result(3).target is in the current label set, return (normal, Result(3).value, empty). Return Result(3). The production CaseBlock : { CaseClauses DefaultClause CaseClauses } is given an input parameter, input, and is evaluated as follows: Let A be the list of CaseClause items in the first CaseClauses, in source text order. For the next CaseClause in A, evaluate CaseClause. If there is no such CaseClause, go to step 7. If input is not equal to Result(2), as defined by the !== operator, go to step 2. Evaluate the StatementList of this CaseClause. If Result(4) is an abrupt completion then return Result(4). Go to step 13. Let B be the list of CaseClause items in the second CaseClauses, in source text order. For the next CaseClause in B, evaluate CaseClause. If there is no such CaseClause, go to step 15. If input is not equal to Result(8), as defined by the !== operator, go to step 8. Evaluate the StatementList of this CaseClause. If Result(10) is an abrupt completion then return Result(10) Go to step 18. For the next CaseClause in A, evaluate the StatementList of this CaseClause. If there is no such CaseClause, go to step 15. If Result(13) is an abrupt completion then return Result(13). Execute the StatementList of DefaultClause. If Result(15) is an abrupt completion then return Result(15) Let B be the list of CaseClause items in the second CaseClauses, in source text order. For the next CaseClause in B, evaluate the StatementList of this CaseClause. If there is no such CaseClause, return (normal, empty, empty). If Result(18) is an abrupt completion then return Result(18). Go to step 18. The production CaseClause : case Expression : StatementListopt is evaluated as follows: Evaluate Expression. Call GetValue(Result(1)). Return Result(2). NOTE Evaluating CaseClause does not execute the associated StatementList. It simply evaluates the Expression and returns the value, which the CaseBlock algorithm uses to determine which StatementList to start executing. Labelled Statements Syntax LabelledStatement : Identifier : Statement Semantics A Statement may be prefixed by a label. Labelled statements are only used in conjunction with labelled break and continue statements. ECMAScript has no goto statement. An ECMAScript program is considered syntactically incorrect if it contains a LabelledStatement that is enclosed by a LabelledStatement with the same Identifier as label. This does not apply to labels appearing within the body of a FunctionDeclaration that is nested, directly or indirectly, within a labelled statement. The production Identifier : Statement is evaluated by adding Identifier to the label set of Statement and then evaluating Statement. If the LabelledStatement itself has a non-empty label set, these labels are also added to the label set of Statement before evaluating it. If the result of evaluating Statement is (break, V, L) where L is equal to Identifier, the production results in (normal, V, empty). Prior to the evaluation of a LabelledStatement, the contained Statement is regarded as possessing an empty label set, except if it is an IterationStatement or a SwitchStatement, in which case it is regarded as possessing a label set consisting of the single element, empty. The throw statement Syntax ThrowStatement : throw [no LineTerminator here] Expression ; Semantics The production ThrowStatement : throw [no LineTerminator here] Expression ; is evaluated as: Evaluate Expression. Call GetValue(Result(1)). Return (throw, Result(2), empty). The try statement Syntax TryStatement : try Block Catch try Block Finally try Block Catch Finally Catch : catch (Identifier ) Block Finally : finally Block Description The try statement encloses a block of code in which an exceptional condition can occur, such as a runtime error or a throw statement. The catch clause provides the exception-handling code. When a catch clause catches an exception, its Identifier is bound to that exception. Semantics The production TryStatement : try Block Catch is evaluated as follows: Evaluate Block. If Result(1).type is not throw, return Result(1). Evaluate Catch with parameter Result(1). Return Result(3). The production TryStatement : try Block Finally is evaluated as follows: Evaluate Block. Evaluate Finally. If Result(2) .type is normal, return Result(1). Return Result(2). The production TryStatement : try Block Catch Finally is evaluated as follows: Evaluate Block. Let C = Result(1). If Result(1).type is not throw, go to step 6. Evaluate Catch with parameter Result(1). If Result(4).type is not normal, Let C = Result(4). Evaluate Finally. If Result(6).type is normal, return C. Return Result(6). The production Catch : catch (Identifier ) Block is evaluated as follows: Let C be the parameter that has been passed to this production. Create a new object as if by the expression new Object(). Create a property in the object Result(2). The property's name is Identifier, value is C.value, and attributes are { DontDelete }. Add Result(2) to the front of the scope chain. Evaluate Block. Remove Result(2) from the front of the scope chain. Return Result(5). The production Finally : finally Block is evaluated as follows: Evaluate Block. Return Result(1). Function Definition Syntax FunctionDeclaration : function Identifier ( FormalParameterListopt ) { FunctionBody } FunctionExpression : function Identifieropt ( FormalParameterListopt ) { FunctionBody } FormalParameterList : Identifier FormalParameterList , Identifier FunctionBody : SourceElements Semantics The production FunctionDeclaration : function Identifier ( FormalParameterListopt ) { FunctionBody } is processed for function declarations as follows: Create a new Function object as specified in section  REF _Ref449943299 \r \h 13.2 with parameters specified by FormalParameterList, and body specified by FunctionBody. Pass in the scope chain of the running execution context as the Scope. Create a property of the current variable object (as specified in section  REF _Ref449943314 \r \h 10.1.3) with name Identifier and value Result(1). The production FunctionExpression : function ( FormalParameterListopt ) { FunctionBody } is evaluated as follows: Create a new Function object as specified in section  REF _Ref449943299 \r \h 13.2 with parameters specified by FormalParameterListopt and body specified by FunctionBody. Pass in the scope chain of the running execution context as the Scope. Return Result(2). The production FunctionExpression : function Identifier ( FormalParameterListopt ) { FunctionBody } is evaluated as follows: Create a new object as if by the expression new Object(). Add Result(1) to the front of the scope chain. Create a new Function object as specified in section  REF _Ref449943299 \r \h 13.2 with parameters specified by FormalParameterListopt and body specified by FunctionBody. Pass in the scope chain of the running execution context as the Scope. Create a property in the object Result(1). The property's name is Identifier, value is Result(3), and attributes are { DontDelete, ReadOnly }. Remove Result(1) from the front of the scope chain. Return Result(3). NOTE The Identifier in a FunctionExpression can be referenced from inside the FunctionExpression's FunctionBody to allow the function to call itself recursively. However, unlike in a FunctionDeclaration, the Identifier in a FunctionExpression cannot be referenced from and does not affect the scope enclosing the FunctionExpression. The production FunctionBody : SourceElements is evaluated as follows: Process SourceElements for function declarations. Evaluate SourceElements. Return Result(2). Definitions A couple of definitions are needed to describe the process of creating function objects: Equated Grammar Productions Two uses of the FunctionBody grammar production are defined to be equated when one of the following is true: Both uses obtained their FunctionBody from the same location in the source text of the same ECMAScript program. This source text consists of global code and any contained function codes according to the definitions in section  REF _Ref458336277 \r \h 10.1.2. Both uses obtained their FunctionBody from the same location in the source text of the same call to eval (section  REF _Ref449966832 \r \h 15.1.2.1). This source text consists of eval code and any contained function codes according to the definitions in section  REF _Ref458336277 \r \h 10.1.2. NOTE Two uses of FunctionBody obtained from a call to the Function constructor (sections  REF _Ref424531728 \r \h 15.3.1 and  REF _Ref424531741 \r \h 15.3.2) are never equated. Also, two uses of FunctionBody obtained from two different calls to eval are never equated, even if those two calls to eval were passed the same argument. Joined Objects When two or more Function objects are joined, they have the following special behaviours: Any time a non-internal property of an object O is created or set, the corresponding property is immediately also created or set with the same value and attributes in all objects joined with O. Any time a non-internal property of an object O is deleted, the corresponding property is immediately also deleted in all objects joined with O. If objects O and P are joined, they compare as == and === to each other. Joining is transitive and symmetric, so that if objects O and P are joined and objects P and Q are joined, then objects O and Q are also automatically joined. NOTE Two or more objects joined to each other are effectively indistinguishable except that they may have different internal properties. The only such internal property that may differ in this specification is [[Scope]]. Joined objects are used as a tool for precise specification technique in this standard. They are not meant to be used as a guideline to how Function objects are implemented in practice. Rather, in practice an implementation may detect when the differences in the [[Scope]] properties of two or more joined Function objects are not externally observable and in those cases reuse the same Function object rather than making a set of joined Function objects. This is a legal optimisation because this standard only specifies observable behaviour of ECMAScript programs. Creating Function Objects Given an optional parameter list specified by FormalParameterList, a body specified by FunctionBody, and a scope chain specified by Scope, a Function object is constructed as follows: If there already exists an object E that was created by an earlier call to this section's algorithm, and if that call to this section's algorithm was given a FunctionBody that is equated to the FunctionBody given now, then go to step 13. (If there is more than one object E satisfying these criteria, choose one at the implementation's discretion.) Create a new native ECMAScript object and let F be that object. Set the [[Class]] property of F to "Function". Set the [[Prototype]] property of F to the original Function prototype object as specified in section  REF _Ref424535839 \r \h  \* MERGEFORMAT 15.3.3.1. Set the [[Call]] property of F as described in section  REF _Ref463865954 \r \h 13.2.1. Set the [[Construct]] property of F as described in section  REF _Ref463865905 \r \h 13.2.2. Set the [[Scope]] property of F to a new scope chain (section  REF _Ref424532979 \r \h 10.1.4) that contains the same objects as Scope. Set the length property of F to the number of formal properties specified in FormalParameterList. If no parameters are specified, set the length property of F to 0. This property is given attributes as specified in section  REF _Ref449944243 \r \h  \* MERGEFORMAT 15.3.5.1. Create a new object as would be constructed by the expression new Object(). Set the constructor property of Result(9) to F. This property is given attributes { DontEnum }. Set the prototype property of F to Result(9). This property is given attributes as specified in section  REF _Ref449944260 \r \h  \* MERGEFORMAT 15.3.5.2. Return F. At the implementation's discretion, go to either step 2 or step 14. Create a new native ECMAScript object joined to E and let F be that object. Copy all non-internal properties and their attributes from E to F so that all non-internal properties are identical in E and F. Set the [[Class]] property of F to "Function". Set the [[Prototype]] property of F to the original Function prototype object as specified in section  REF _Ref424535839 \r \h  \* MERGEFORMAT 15.3.3.1. Set the [[Call]] property of F as described in section  REF _Ref463865954 \r \h 13.2.1. Set the [[Construct]] property of F as described in section  REF _Ref463865905 \r \h 13.2.2. Set the [[Scope]] property of F to a new scope chain (section  REF _Ref424532979 \r \h 10.1.4) that contains the same objects as Scope. Return F. NOTE A prototype property is automatically created for every function, to allow for the possibility that the function will be used as a constructor. Step 1 allows an implementation to optimise the common case of a function A that has a nested function B where B is not dependent on A. In this case the implementation is allowed to reuse the same object for B instead of creating a new one every time A is called. Step 13 makes this optimisation optional; an implementation that chooses not to implement it will go to step 2. For example, in the code function A() { function B(x) {return x*x;} return B; } function C() { return eval("(function (x) {return x*x;})"); } var b1 = A(); var b2 = A(); function b3(x) {return x*x;} function b4(x) {return x*x;} var b5 = C(); var b6 = C(); an implementation is allowed, but not required, to join b1 and b2. In fact, it may make b1 and b2 the same object because there is no way to detect the difference between their [[Scope]] properties. On the other hand, an implementation must not join b3 and b4 because their source codes are not equated (section  REF _Ref463878604 \r \h 13.1.1). Also, an implementation must not join b5 and b6 because they were produced by two different calls to eval and therefore their source codes are not equated. In practice it's likely to be productive to join two Function objects only in the cases where an implementation can prove that the differences between their [[Scope]] properties are not observable, so one object can be reused. By following this policy, an implementation will only encounter the vacuous case of an object being joined with itself. [[Call]] When the [[Call]] property for a Function object F is called, the following steps are taken: Establish a new execution context using F's FormalParameterList, the passed arguments list, and the this value as described in Section  REF _Ref457703968 \r \h 10.2.3. Evaluate F's FunctionBody. Exit the execution context established in step 1, restoring the previous execution context. If Result(2).type is throw then throw Result(2).value. If Result(2).type is return then return Result(2).value. (Result(2).type must be normal.) Return undefined. [[Construct]] When the [[Construct]] property for a Function object F is called, the following steps are taken: Create a new native ECMAScript object. Set the [[Class]] property of Result(1) to "Object". Get the value of the prototype property of the F. If Result(3) is an object, set the [[Prototype]] property of Result(1) to Result(3). If Result(3) is not an object, set the [[Prototype]] property of Result(1) to the original Object prototype object as described in section  REF _Ref424531384 \r \h  \* MERGEFORMAT 15.2.3.1. Invoke the [[Call]] property of F, providing Result(1) as the this value and providing the argument list passed into [[Construct]] as the argument values. If Type(Result(6)) is Object then return Result(6). Return Result(1). Program Syntax Program : SourceElements SourceElements : SourceElement SourceElements SourceElement SourceElement : Statement FunctionDeclaration Semantics The production Program : SourceElements is evaluated as follows: Process SourceElements for function declarations. Evaluate SourceElements. Return Result(2). The production SourceElements : SourceElement is processed for function declarations as follows: Process SourceElement for function declarations. The production SourceElements : SourceElement is evaluated as follows: Evaluate SourceElement. Return Result(1). The production SourceElements : SourceElements SourceElement is processed for function declarations as follows: Process SourceElements for function declarations. Process SourceElement for function declarations. The production SourceElements : SourceElements SourceElement is evaluated as follows: Evaluate SourceElements. If Result(1) is an abrupt completion, return Result(1) Evaluate SourceElement. Return Result(3). The production SourceElement : Statement is processed for function declarations by taking no action. The production SourceElement : Statement is evaluated as follows: Evaluate Statement. Return Result(1). The production SourceElement : FunctionDeclaration is processed for function declarations as follows: Process FunctionDeclaration for function declarations (see section  REF _Ref457101484 \r \h 13). The production SourceElement : FunctionDeclaration is evaluated as follows: Return (normal, empty, empty). Native ECMAScript Objects There are certain built-in objects available whenever an ECMAScript program begins execution. One, the global object, is in the scope chain of the executing program. Others are accessible as initial properties of the global object. Unless specified otherwise, the [[Class]] property of a built-in object is "Function" if that built-in object has a [[Call]] property, or "Object" if that built-in object does not have a [[Call]] property. Many built-in objects are functions: they can be invoked with arguments. Some of them furthermore are constructors: they are functions intended for use with the new operator. For each built-in function, this specification describes the arguments required by that function and properties of the Function object. For each built-in constructor, this specification furthermore describes properties of the prototype object of that constructor and properties of specific object instances returned by a new expression that invokes that constructor. Unless otherwise specified in the description of a particular function, if a function or constructor described in this section is given fewer arguments than the function is specified to require, the function or constructor shall behave exactly as if it had been given sufficient additional arguments, each such argument being the undefined value. Unless otherwise specified in the description of a particular function, if a function or constructor described in this section is given more arguments than the function is specified to allow, the behaviour of the function or constructor is undefined. In particular, an implementation is permitted (but not required) to throw a TypeError exception in this case. NOTE Implementations that add additional capabilities to the set of built-in functions are encouraged to do so by adding new functions rather than adding new parameters to existing functions. Every built-in function and every built-in constructor has the Function prototype object, which is the initial value of the expression Function.prototype (section  REF _Ref424534066 \r \h 15.3.2.1), as the value of its internal [[Prototype]] property. Every built-in prototype object has the Object prototype object, which is the initial value of the expression Object.prototype (section  REF _Ref424531384 \r \h 15.2.3.1), as the value of its internal [[Prototype]] property, except the Object prototype object itself. None of the built-in functions described in this section shall implement the internal [[Construct]] method unless otherwise specified in the description of a particular function. None of the built-in functions described in this section shall initially have a prototype property unless otherwise specified in the description of a particular function. Every built-in Function object described in this sectionwhether as a constructor, an ordinary function, or bothhas a length property whose value is an integer. Unless otherwise specified, this value is equal to the largest number of named arguments shown in the section headings for the function description, including optional parameters. NOTE For example, the Function object that is the initial value of the slice property of the String prototype object is described under the section heading String.prototype.slice (start , end) which shows the two named arguments start and end; therefore the value of the length property of that Function object is 2. In every case, the length property of a built-in Function object described in this section has the attributes {ReadOnly, DontDelete, DontEnum } (and no others). Every other property described in this section has the attribute { DontEnum } (and no others) unless otherwise specified. The Global Object The global object does not have a [[Construct]] property; it is not possible to use the global object as a constructor with the new operator. The global object does not have a [[Call]] property; it is not possible to invoke the global object as a function. The values of the [[Prototype]] and [[Class]] properties of the global object are implementation-dependent. Value Properties of the Global Object NaN The initial value of NaN is NaN (section  REF _Ref424530687 \r \h 8.5). This property has the attributes { DontEnum, DontDelete}. Infinity The initial value of Infinity is +( (section  REF _Ref424530687 \r \h 8.5). This property has the attributes { DontEnum, DontDelete}. undefined The initial value of undefined is undefined (section  REF _Ref449763253 \r \h 8.1). This property has the attributes { DontEnum, DontDelete}. Function Properties of the Global Object eval (x) When the eval function is called with one argument x, the following steps are taken: If x is not a string value, return x. Parse x as a Program. If the parse fails, throw a SyntaxError exception (but see also section  REF _Ref458400834 \r \h 16). Evaluate the program from step 2. If Result(3).type is normal and its completion value is a value V, then return the value V. If Result(3).type is normal and its completion value is empty, then return the value undefined. Result(3).type must be throw. Throw Result(3).value as an exception. If value of the eval property is used in any way other than a direct call (that is, other than by the explicit use of its name as an Identifier which is the MemberExpression in a CallExpression), or if the eval property is assigned to, an EvalError exception may be thrown. parseInt (string , radix) The parseInt function produces an integer value dictated by interpretation of the contents of the string argument according to the specified radix. Leading whitespace in the string is ignored. If radix is undefined or 0, it is assumed to be 10 except when the number begins with the character pairs 0x or 0X, in which case a radix of 16 is assumed. Any radix-16 number may also optionally begin with the character pairs 0x or 0X. When the parseInt function is called, the following steps are taken: Call ToString(string). Let S be a newly created substring of Result(1) consisting of the first character that is not a StrWhiteSpaceChar and all characters following that character. (In other words, remove leading white space.) Let sign be 1. If S is not empty and the first character of S is a minus sign -, let sign be (1. If S is not empty and the first character of S is a plus sign + or a minus sign -, then remove the first character from S. Let R = ToInt32(radix). If R = 0, go to step 11. If R < 2 or R > 36, then return NaN. If R = 16, go to step 13. Go to step 14. Let R = 10. If the length of S is at least 1 and the first character of S is 0, then at the implementation's discretion either let R = 8 or leave R unchanged. If the length of S is at least 2 and the first two characters of S are either 0x or 0X, then remove the first two characters from S and let R = 16. If S contains any character that is not a radix-R digit, then let Z be the substring of S consisting of all characters before the first such character; otherwise, let Z be S. If Z is empty, return NaN. Compute the mathematical integer value that is represented by Z in radix-R notation, using the letters A-Z and a-z for digits with values 10 through 35. (However, if R is 10 and Z contains more than 20 significant digits, every significant digit after the 20th may be replaced by a 0 digit, at the option of the implementation; and if R is not 2, 4, 8, 10, 16, or 32, then Result(16) may be an implementation-dependent approximation to the mathematical integer value that is represented by Z in radix-R notation.) Compute the number value for Result(16). Return sign ( Result(17). NOTE parseInt may interpret only a leading portion of the string as an integer value; it ignores any characters that cannot be interpreted as part of the notation of an integer, and no indication is given that any such characters were ignored. When radix is 0 or undefined and the string's number begins with a 0 digit not followed by an x or X, then the implementation may, at its discretion, interpret the number either as being octal or as being decimal. Implementations are encouraged to interpret numbers in this case as being decimal. parseFloat (string) The parseFloat function produces a number value dictated by interpretation of the contents of the string argument as a decimal literal. When the parseFloat function is called, the following steps are taken: Call ToString(string). Compute a substring of Result(1) consisting of the leftmost character that is not a StrWhiteSpaceChar and all characters to the right of that character.(In other words, remove leading white space.) If neither Result(2) nor any prefix of Result(2) satisfies the syntax of a StrDecimalLiteral (see  REF _Ref456028389 \r \h 9.3.1), return NaN. Compute the longest prefix of Result(2), which might be Result(2) itself, which satisfies the syntax of a StrDecimalLiteral. Return the number value for the MV of Result(4). NOTE parseFloat may interpret only a leading portion of the string as a number value; it ignores any characters that cannot be interpreted as part of the notation of an decimal literal, and no indication is given that any such characters were ignored. isNaN (number) Applies ToNumber to its argument, then returns true if the result is NaN, and otherwise returns false. isFinite (number) Applies ToNumber to its argument, then returns false if the result is NaN, +(, or ((, and otherwise returns true. URI Handling Function Properties Uniform Resource Identifiers, or URIs, are strings that identify resources (e.g. web pages or files) and transport protocols by which to access them (e.g. HTTP or FTP) on the Internet. The ECMAScript language itself does not provide any support for using URIs except for functions that encode and decode URIs as described in sections  REF _Ref456003675 \r \h 15.1.3.1,  REF _Ref456003678 \r \h 15.1.3.2,  REF _Ref456003682 \r \h 15.1.3.3 and  REF _Ref456003685 \r \h 15.1.3.4. NOTE Many implementations of ECMAScript provide additional functions and methods that manipulate web pages; these functions are beyond the scope of this standard. A URI is composed of a sequence of components separated by component separators. The general form is: Scheme : First / Second ; Third ? Fourth where the italicised names represent components and the :, /, ; and ? are reserved characters used as separators. The encodeURI and decodeURI functions are intended to work with complete URIs; they assume that any reserved characters in the URI are intended to have special meaning and so are not encoded. The encodeURIComponent and decodeURIComponent functions are intended to work with the individual component parts of a URI; they assume that any reserved characters represent text and so must be encoded so that they are not interpreted as reserved characters when the component is part of a complete URI. The following lexical grammar specifies the form of encoded URIs. uri ::: uriCharactersopt uriCharacters ::: uriCharacter uriCharactersopt uriCharacter ::: uriReserved uriUnescaped uriEscaped uriReserved ::: one of ; / ? : @ & = + $ , uriUnescaped ::: uriAlpha DecimalDigit uriMark uriEscaped ::: % HexDigit HexDigit uriAlpha ::: one of a b c d e f g h i j k l m n o p q r s t u v w x y z A B C D E F G H I J K L M N O P Q R S T U V W X Y Z uriMark ::: one of - _ . ! ~ * ' ( ) When a character to be included in a URI is not listed above or is not intended to have the special meaning sometimes given to the reserved characters, that character must be encoded. The character is first transformed into a sequence of octets using the UTF-8 transformation, with surrogate pairs first transformed from their UCS-2 to UCS-4 encodings. (Note that for code points in the range [0,127] this results in a single octet with the same value.) The resulting sequence of octets is then transformed into a string with each octet represented by an escape sequence of the form %xx. The encoding and escaping process is described by the hidden function Encode taking two string arguments string and unescapedSet. This function is defined for expository purpose only. Compute the number of characters in string. Let R be the empty string. Let k be 0. If k equals Result(1), return R. Let C be the character at position k within string. If C is not in unescapedSet, go to step 9. Let S be a string containing only the character C. Go to step 24. If the code point value of C is not less than 0xDC00 and not greater than 0xDFFF, throw a URIError exception. If the code point value of C is less than 0xD800 or greater than 0xDBFF, let V be the code point value of C and go to step 16. Increase k by 1. If k equals Result(1), throw a URIError exception. Get the code point value of the character at position k within string. If Result(13) is less than 0xDC00 or greater than 0xDFFF, throw a URIError exception. Let V be (((the code point value of C) 0xD800) * 0x400 + (Result(13) 0xDC00) + 0x10000). Let Octets be the array of octets resulting by applying the UTF-8 transformation to V, and let L be the array size. Let j be 0. Get the value at position j within Octets. Let S be a string containing three characters %XY where XY are two uppercase hexadecimal digits encoding the value of Result(18). Let R be a new string value computed by concatenating the previous value of R and S. Increase j by 1. If j is equal to L, go to step 25. Go to step 18. Let R be a new string value computed by concatenating the previous value of R and S. Increase k by 1. Go to step 4. The unescaping and decoding process is described by the hidden function Decode taking two string arguments string and reservedSet. This function is defined for expository purpose only. Compute the number of characters in string. Let R be the empty string. Let k be 0. If k equals Result(1), return R. Let C be the character at position k within string. If C is not %, go to step 40. Let start be k. If k + 2 is greater than or equal to Result(1), throw a URIError exception. If the characters at position (k+1) and (k + 2) within string do not represent hexadecimal digits, throw a URIError exception. Let B be the 8-bit value represented by the two hexadecimal digits at position (k + 1) and (k + 2). Increment k by 2. If the most significant bit in B is 0, let C be the character with code point value B and go to step 37. Let n be the smallest non-negative number such that (B << n) & 0x80 is equal to 0. If n equals 1 or n is greater than 4, throw a URIError exception. Let Octets be an array of 8-bit integers of size n. Put B into Octets at position 0. If k + (3 * (n 1)) is greater than or equal to Result(1), throw a URIError exception. Let j be 1. If j equals n, go to step 29. Increment k by 1. If the character at position k is not %, throw a URIError exception. If the characters at position (k +1) and (k + 2) within string do not represent hexadecimal digits, throw a URIError exception. Let B be the 8-bit value represented by the two hexadecimal digits at position (k + 1) and (k + 2). If the two most significant bits in B are not 10, throw a URIError exception. Increment k by 2. Put B into Octets at position j. Increment j by 1. Go to step 19. Let V be the value obtained by applying the UTF-8 transformation to Octets, that is, from an array of octets into a 32-bit value. If V is less than 0x10000, go to step 36. If V is greater than 0x10FFFF, throw a URIError exception. Let L be (((V 0x10000) & 0x3FF) + 0xDC00). Let H be ((((V 0x10000) >> 10) & 0x3FF) + 0xD800). Let S be the string containing the two characters with code point values H and L. Go to step 41. Let C be the character with code point value V. If C is not in reservedSet, go to step 40. Let S be the substring of string from position start to position k included. Go to step 41. Let S be the string containing only the character C. Let R be a new string value computed by concatenating the previous value of R and S. Increase k by 1. Go to step 4. NOTE The syntax of Uniform Resource Identifiers is given in RFC2396. NOTE A formal description and implementation of UTF-8 is given in the Unicode Standard, Version 2.0, Appendix A. In UTF-8, characters are encoded using sequences of 1 to 6 octets. The only octet of a "sequence" of one has the higher-order bit set to 0, the remaining 7 bits being used to encode the character value. In a sequence of n octets, n>1, the initial octet has the n higher-order bits set to 1, followed by a bit set to 0. The remaining bits of that octet contain bits from the value of the character to be encoded. The following octets all have the higher-order bit set to 1 and the following bit set to 0, leaving 6 bits in each to contain bits from the character to be encoded. The possible UTF-8 encodings of ECMAScript characters are: Code Point ValueRepresentation1st Octet2nd Octet3rd Octet4th Octet0x0000 - 0x007F00000000 0zzzzzzz0zzzzzzz0x0080 - 0x07FF00000yyy yyzzzzzz110yyyyy10zzzzzz0x0800 - 0xD7FFxxxxyyyy yyzzzzzz1110xxxx10yyyyyy10zzzzzz0xD800 - 0xDBFF followed by 0xDC00 0xDFFF110110vv vvwwwwxx followed by 110111yy yyzzzzzz 11110uuu 10uuwwww 10xxyyyy 10zzzzzz0xD800 - 0xDBFF not followed by 0xDC00 0xDFFF causes URIError0xDC00 0xDFFFcauses URIError0xE000 - 0xFFFFxxxxyyyy yyzzzzzz1110xxxx10yyyyyy10zzzzzz Where uuuuu = vvvv + 1 to account for the addition of 0x10000 as in section 3.7, Surrogates of the Unicode Standard version 2.0. The range of code point values 0xD800-0xDFFF is used to encode surrogate pairs; the above transformation combines a UCS-2 surrogate pair into a UCS-4 representation and encodes the resulting 21-bit value in UTF-8. Decoding reconstructs the surrogate pair. decodeURI (encodedURI) The decodeURI function computes a new version of a URI in which each escape sequence and UTF-8 encoding of the sort that might be introduced by the encodeURI function is replaced with the character that it represents. Escape sequences that could not have been introduced by encodeURI are not replaced. When the decodeURI function is called with one argument encodedURI, the following steps are taken: Call ToString(encodedURI). Let reservedURISet be a string containing one instance of each character valid in uriReserved plus #. Call Decode(Result(1), reservedURISet) Return Result(3). NOTE The character # is not decoded from escape sequences even though it is not a reserved URI character. decodeURIComponent (encodedURIComponent) The decodeURIComponent function computes a new version of a URI in which each escape sequence and UTF-8 encoding of the sort that might be introduced by the encodeURIComponent function is replaced with the character that it represents. When the decodeURIComponent function is called with one argument encodedURIComponent, the following steps are taken: Call ToString(encodedURIComponent). Let reservedURIComponentSet be the empty string. Call Decode(Result(1), reservedURIComponentSet) Return Result(3). encodeURI (uri) The encodeURI function computes a new version of a URI in which each instance of certain characters is replaced by one, two or three escape sequences representing the UTF-8 encoding of the character. When the encodeURI function is called with one argument uri, the following steps are taken: Call ToString(uri). Let unescapedURISet be a string containing one instance of each character valid in uriReserved and uriUnescaped plus #. Call Encode(Result(1), unescapedURISet) Return Result(3). NOTE The character # is not encoded to an escape sequence even though it is not a reserved or unescaped URI character. encodeURIComponent (uriComponent) The encodeURIComponent function computes a new version of a URI in which each instance of certain characters is replaced by one, two or three escape sequences representing the UTF-8 encoding of the character. When the encodeURIComponent function is called with one argument uriComponent, the following steps are taken: Call ToString(uriComponent). Let unescapedURIComponentSet be a string containing one instance of each character valid in uriUnescaped. Call Encode(Result(1), unescapedURIComponentSet) Return Result(3). Constructor Properties of the Global Object Object ( . . . ) See sections  REF _Ref424531694 \r \h 15.2.1 and  REF _Ref449968361 \r \h 15.2.2. Function ( . . . ) See sections  REF _Ref424531728 \r \h 15.3.1 and  REF _Ref424531741 \r \h 15.3.2. Array ( . . . ) See sections  REF _Ref424531647 \r \h 15.4.1 and  REF _Ref424531663 \r \h 15.4.2. String ( . . . ) See sections  REF _Ref424531760 \r \h 15.5.1 and  REF _Ref424531774 \r \h 15.5.2. Boolean ( . . . ) See sections  REF _Ref424531794 \r \h 15.6.1 and  REF _Ref424531804 \r \h 15.6.2. Number ( . . . ) See sections  REF _Ref424531823 \r \h 15.7.1 and  REF _Ref424531834 \r \h 15.7.2. Date ( . . . ) See section  REF _Ref424531852 \r \h 15.9.2. RegExp ( . . . ) See sections  REF _Ref456002819 \r \h 15.10.3 and  REF _Ref456002880 \r \h 15.10.4. Error ( . . . ) See sections  REF _Ref464292699 \r \h 15.11.1 and  REF _Ref464292724 \r \h 15.11.2. EvalError ( . . . ) See section  REF _Ref464292837 \r \h 15.11.6.1. RangeError ( . . . ) See section  REF _Ref457211232 \r \h 15.11.6.2. ReferenceError ( . . . ) See section  REF _Ref457211236 \r \h 15.11.6.3. SyntaxError ( . . . ) See section  REF _Ref463849711 \r \h 15.11.6.4. TypeError ( . . . ) See section  REF _Ref457211245 \r \h 15.11.6.5. URIError ( . . . ) See section  REF _Ref457211250 \r \h 15.11.6.6. Other Properties of the Global Object Math See section  REF _Ref424531937 \r \h 15.8. Object Objects The Object Constructor Called as a Function When Object is called as a function rather than as a constructor, it performs a type conversion. Object ( [ value ] ) When the Object function is called with no arguments or with one argument value, the following steps are taken: If value is null, undefined or not supplied, create and return a new Object object exactly if the object constructor had been called with the same arguments (section  REF _Ref424531574 \r \h 15.2.2.1). Return ToObject(value). The Object Constructor When Object is called as part of a new expression, it is a constructor that may create an object. new Object ( [ value ] ) When the Object constructor is called with no arguments or with one argument value, the following steps are taken: If value is not supplied, go to step 8. If the type of value is not Object, go to step 5. If the value is a native ECMAScript object, do not create a new object but simply return value. If the value is a host object, then actions are taken and a result is returned in an implementation-dependent manner that may depend on the host object. If the type of value is String, return ToObject(value). If the type of value is Boolean, return ToObject(value). If the type of value is Number, return ToObject(value). (The argument value was not supplied or its type was Null or Undefined.) Create a new native ECMAScript object. The [[Prototype]] property of the newly constructed object is set to the Object prototype object. The [[Class]] property of the newly constructed object is set to "Object". The newly constructed object has no [[Value]] property. Return the newly created native object. Properties of the Object Constructor The value of the internal [[Prototype]] property of the Object constructor is the Function prototype object. Besides the internal properties and the length property (whose value is 1), the Object constructor has the following properties: Object.prototype The initial value of Object.prototype is the Object prototype object (section  REF _Ref424534029 \r \h 15.2.4). This property has the attributes { DontEnum, DontDelete, ReadOnly }. Properties of the Object Prototype Object The value of the internal [[Prototype]] property of the Object prototype object is null and the value of the internal [[Class]] property is "Object". Object.prototype.constructor The initial value of Object.prototype.constructor is the built-in Object constructor. Object.prototype.toString ( ) When the toString method is called, the following steps are taken: Get the [[Class]] property of this object. Compute a string value by concatenating the three strings "[object ", Result(1), and "]". Return Result(2). Object.prototype.toLocaleString ( ) This function returns the result of calling toString(). NOTE This function is provided to give all Objects a generic toLocaleString interface, even though not all may use it. Currently, Array, Number, and Date provide their own locale-sensitive toLocaleString methods. NOTE The first parameter to this function is likely to be used in a future version of this standard; it is recommended that implementations do not use this parameter position for anything else. Object.prototype.valueOf ( ) The valueOf method returns its this value. If the object is the result of calling the Object constructor with a host object (section  REF _Ref424531574 \r \h 15.2.2.1), it is implementation-defined whether valueOf returns its this value or another value such as the host object originally passed to the constructor. Object.prototype.hasOwnProperty (V) When the hasOwnProperty method is called with argument V, the following steps are taken: Let O be this object. Call ToString(V). If O doesnt have a property with the name given by Result(2), return false. Return true. NOTE Unlike [[HasProperty]] (section  REF _Ref424667502 \r \h 8.6.2.4), this method does not consider objects in the prototype chain. Object.prototype.isPrototypeOf (V) When the isPrototypeOf method is called with argument V, the following steps are taken: Let O be this object. If V is not an object, return false. Let V be the value of the [[Prototype]] property of V. if V is null, return false If O and V refer to the same object or if they refer to objects joined to each other (section  REF _Ref463875961 \r \h 13.1.2), return true. Go to step 3. Object.prototype.propertyIsEnumerable (V) When the propertyIsEnumerable method is called with argument V, the following steps are taken: Let O be this object. Call ToString(V). If O doesnt have a property with the name given by Result(2), return false. If the property has the DontEnum attribute, return false. Return true. NOTE This method does not consider objects in the prototype chain. Properties of Object Instances Object instances have no special properties beyond those inherited from the Object prototype object. Function Objects The Function Constructor Called as a Function When Function is called as a function rather than as a constructor, it creates and initialises a new Function object. Thus the function call Function() is equivalent to the object creation expression new Function() with the same arguments. Function (p1, p2, , pn, body) When the Function function is called with some arguments p1, p2, , pn, body (where n might be 0, that is, there are no p arguments, and where body might also not be provided), the following steps are taken: Create and return a new Function object as if the function constructor had been called with the same arguments (section  REF _Ref424534066 \r \h 15.3.2.1). The Function Constructor When Function is called as part of a new expression, it is a constructor: it initialises the newly created object. new Function (p1, p2, , pn, body) The last argument specifies the body (executable code) of a function; any preceding arguments specify formal parameters. When the Function constructor is called with some arguments p1, p2, , pn, body (where n might be 0, that is, there are no p arguments, and where body might also not be provided), the following steps are taken: Let P be the empty string. If no arguments were given, let body be the empty string and go to step 13. If one argument was given, let body be that argument and go to step 13. Let Result(4) be the first argument. Let P be ToString(Result(4)). Let k be 2. If k equals the number of arguments, let body be the kth argument and go to step 13. Let Result(8) be the kth argument. Call ToString(Result(8)). Let P be the result of concatenating the previous value of P, the string "," (a comma), and Result(9). Increase k by 1. Go to step 7. Call ToString(body). If P is not parsable as a FormalParameterListopt then throw a SyntaxError exception. If body is not parsable as FunctionBody then throw a SyntaxError exception. Create a new Function object as specified in section  REF _Ref449943299 \r \h 13.2 with parameters specified by parsing P as a FormalParameterListopt and body specified by parsing body as a FunctionBody. Pass in a scope chain consisting of the global object as the Scope parameter. Return Result(16). A prototype property is automatically created for every function, to provide for the possibility that the function will be used as a constructor. NOTE It is permissible but not necessary to have one argument for each formal parameter to be specified. For example, all three of the following expressions produce the same result: new Function("a", "b", "c", "return a+b+c") new Function("a, b, c", "return a+b+c") new Function("a,b", "c", "return a+b+c") Properties of the Function Constructor The value of the internal [[Prototype]] property of the Function constructor is the Function prototype object (section  REF _Ref424534100 \r \h 15.3.4). Besides the internal properties and the length property (whose value is 1), the Function constructor has the following properties: Function.prototype The initial value of Function.prototype is the Function prototype object (section  REF _Ref424534100 \r \h 15.3.4). This property has the attributes { DontEnum, DontDelete, ReadOnly }. Properties of the Function Prototype Object The Function prototype object is itself a Function object (its [[Class]] is "Function") that, when invoked, accepts any arguments and returns undefined. The value of the internal [[Prototype]] property of the Function prototype object is the Object prototype object (section  REF _Ref424534066 \r \h 15.3.2.1). It is a function with an empty body; if it is invoked, it merely returns undefined. The Function prototype object does not have a valueOf property of its own; however, it inherits the valueOf property from the Object prototype Object. Function.prototype.constructor The initial value of Function.prototype.constructor is the built-in Function constructor. Function.prototype.toString ( ) An implementation-dependent representation of the function is returned. This representation has the syntax of a FunctionDeclaration. Note in particular that the use and placement of white space, line terminators, and semicolons within the representation string is implementation-dependent. The toString function is not generic; it throws a TypeError exception if its this value is not a Function object. Therefore, it cannot be transferred to other kinds of objects for use as a method. Function.prototype.apply (thisArg, argArray) The apply method takes two arguments, thisArg and argArray, and performs a function call using the [[Call]] property of the object. If the object does not have a [[Call]] property, a TypeError exception is thrown. If thisArg is null or undefined, the called function is passed the global object as the this value. Otherwise, the called function is passed ToObject(thisArg) as the this value. If argArray is null or undefined, the called function is passed no arguments. Otherwise, if argArray is neither an array nor an arguments object (see section  REF _Ref449940080 \r \h  \* MERGEFORMAT 10.1.8), a TypeError exception is thrown. If argArray is either an array or an arguments object, the function is passed the (ToUint32(argArray.length)) arguments argArray[0], argArray[1], , argArray[ToUint32(argArray.length)1]. The length property of the apply method is 2. Function.prototype.call (thisArg [ , arg1 [ , arg2, ] ] ) The call method takes one or more arguments, thisArg and (optionally) arg1, arg2 etc, and performs a function call using the [[Call]] property of the object. If the object does not have a [[Call]] property, a TypeError exception is thrown. The called function is passed arg1, arg2, etc. as the arguments. If thisArg is null or undefined, the called function is passed the global object as the this value. Otherwise, the called function is passed ToObject(thisArg) as the this value. The length property of the call method is 1. Properties of Function Instances In addition to the required internal properties, every function instance has a [[Call]] property, a [[Construct]] property and a [[Scope]] property (see sections  REF _Ref440438264 \r \h 8.6.2 and  REF _Ref449943299 \r \h 13.2). The value of the [[Class]] property is "Function". length The value of the length property is usually an integer that indicates the typical number of arguments expected by the function. However, the language permits the function to be invoked with some other number of arguments. The behaviour of a function when invoked on a number of arguments other than the number specified by its length property depends on the function. This property has the attributes {DontDelete, ReadOnly, DontEnum}. prototype The value of the prototype property is used to initialise the internal [[Prototype]] property of a newly created object before the Function object is invoked as a constructor for that newly created object. This property has the attribute {DontDelete }. [[HasInstance]] (V) Assume F is a Function object. When the [[HasInstance]] method of F is called with value V, the following steps are taken: If V is not an object, return false. Call the [[Get]] method of F with property name "prototype". Let O be Result(2). If O is not an object, throw a TypeError exception. Let V be the value of the [[Prototype]] property of V. If V is null, return false. If O and V refer to the same object or if they refer to objects joined to each other (section  REF _Ref463875961 \r \h 13.1.2), return true. Go to step 5. Array Objects Array objects give special treatment to a certain class of property names. A property name P (in the form of a string value) is an array index if and only if ToString(ToUint32(P)) is equal to P and ToUint32(P) is not equal to 232(1. Every Array object has a length property whose value is always a nonnegative integer less than 232. The value of the length property is numerically greater than the name of every property whose name is an array index; whenever a property of an Array object is created or changed, other properties are adjusted as necessary to maintain this invariant. Specifically, whenever a property is added whose name is an array index, the length property is changed, if necessary, to be one more than the numeric value of that array index; and whenever the length property is changed, every property whose name is an array index whose value is not smaller than the new length is automatically deleted. This constraint applies only to properties of the Array object itself and is unaffected by length or array index properties that may be inherited from its prototype. The Array Constructor Called as a Function When Array is called as a function rather than as a constructor, it creates and initialises a new Array object. Thus the function call Array() is equivalent to the object creation expression newArray() with the same arguments. Array ( [ item1 [ , item2 [ , ] ] ] ) When the Array function is called the following steps are taken: Create and return a new Array object exactly as if the array constructor had been called with the same arguments (section  REF _Ref424531663 \r \h 15.4.2). The Array Constructor When Array is called as part of a new expression, it is a constructor: it initialises the newly created object. new Array ( [ item0 [ , item1 [ , ] ] ] ) This description applies if and only if the Array constructor is given no arguments or at least two arguments. The [[Prototype]] property of the newly constructed object is set to the original Array prototype object, the one that is the initial value of Array.prototype (section  REF _Ref424534154 \r \h 15.4.3.1). The [[Class]] property of the newly constructed object is set to "Array". The length property of the newly constructed object is set to the number of arguments. The 0 property of the newly constructed object is set to item0 (if supplied); the 1 property of the newly constructed object is set to item1 (if supplied); and, in general, for as many arguments as there are, the k property of the newly constructed object is set to argument k, where the first argument is considered to be argument number 0. new Array (len) The [[Prototype]] property of the newly constructed object is set to the original Array prototype object, the one that is the initial value of Array.prototype (section  REF _Ref424534154 \r \h 15.4.3.1). The [[Class]] property of the newly constructed object is set to "Array". If the argument len is a Number and ToUint32(len) is equal to len, then the length property of the newly constructed object is set to ToUint32(len). If the argument len is a Number and ToUint32(len) is not equal to len, a RangeError exception is thrown. If the argument len is not a Number, then the length property of the newly constructed object is set to 1 and the 0 property of the newly constructed object is set to len. Properties of the Array Constructor The value of the internal [[Prototype]] property of the Array constructor is the Function prototype object (section  REF _Ref424534100 \r \h 15.3.4). Besides the internal properties and the length property (whose value is 1), the Array constructor has the following properties: Array.prototype The initial value of Array.prototype is the Array prototype object (section  REF _Ref424534233 \r \h 15.4.4). This property has the attributes { DontEnum, DontDelete, ReadOnly }. Properties of the Array Prototype Object The value of the internal [[Prototype]] property of the Array prototype object is the Object prototype object (section  REF _Ref424531384 \r \h 15.2.3.1). The Array prototype object is itself an array; its [[Class]] is "Array", and it has a length property (whose initial value is +0) and the special internal [[Put]] method described in section  REF _Ref424531062 \r \h  \* MERGEFORMAT 15.4.5.1. In following descriptions of functions that are properties of the Array prototype object, the phrase this object refers to the object that is the this value for the invocation of the function. It is permitted for the this to be an object for which the value of the internal [[Class]] property is not "Array". NOTE The Array prototype object does not have a valueOf property of its own; however, it inherits the valueOf property from the Object prototype Object. Array.prototype.constructor The initial value of Array.prototype.constructor is the built-in Array constructor. Array.prototype.toString ( ) The result of calling this function is the same as if the built-in join method were invoked for this object with no argument. The toString function is not generic; it throws a TypeError exception if its this value is not an Array object. Therefore, it cannot be transferred to other kinds of objects for use as a method. Array.prototype.toLocaleString ( ) The elements of the array are converted to strings using their toLocaleString methods, and these strings are then concatenated, separated by occurrences of a separator string that has been derived in an implementation-defined locale-specific way. The result of calling this function is intended to be analogous to the result of toString, except that the result of this function is intended to be locale-specific. The result is calculated as follows: Call the [[Get]] method of this object with argument "length". Call ToUint32(Result(1)). Let separator be the list-separator string appropriate for the host environments current locale (this is derived in an implementation-defined way). Call ToString(separator). If Result(2) is zero, return the empty string. Call the [[Get]] method of this object with argument "0". If Result(6) is undefined or null, use the empty string; otherwise, call ToObject(Result(6)).toLocaleString(). Let R be Result(7). Let k be 1. If k equals Result(2), return R. Let S be a string value produced by concatenating R and Result(4). Call the [[Get]] method of this object with argument ToString(k). If Result(12) is undefined or null, use the empty string; otherwise, call ToObject(Result(12)).toLocaleString(). Let R be a string value produced by concatenating S and Result(13). Increase k by 1. Go to step 10. The toLocaleString function is not generic; it throws a TypeError exception if its this value is not an Array object. Therefore, it cannot be transferred to other kinds of objects for use as a method. NOTE The first parameter to this function is likely to be used in a future version of this standard; it is recommended that implementations do not use this parameter position for anything else. Array.prototype.concat ( [ item1 [ , item2 [ , ] ] ] ) When the concat method is called with zero or more arguments item1, item2, etc., it returns an array containing the array elements of the object followed by the array elements of each argument in order. The following steps are taken: Let A be a new array created as if by the expression new Array(). Let n be 0. Let E be this object. If E is not an Array object, go to step 16. Let k be 0. Call the [[Get]] method of E with argument "length". If k equals Result(6) go to step 19. Call ToString(k). If E has a property named by Result(8), go to step 10, but if E has no property named by Result(8), go to step 13. Call ToString(n). Call the [[Get]] method of E with argument Result(8). Call the [[Put]] method of A with arguments Result(10) and Result(11). Increase n by 1. Increase k by 1. Go to step 7. Call ToString(n). Call the [[Put]] method of A with arguments Result(16) and E. Increase n by 1. Get the next argument in the argument list; if there are no more arguments, go to step 22. Let E be Result(19). Go to step 4. Call the [[Put]] method of A with arguments "length" and n. Return A. The length property of the concat method is 1. NOTE The concat function is intentionally generic; it does not require that its this value be an Array object. Therefore it can be transferred to other kinds of objects for use as a method. Whether the concat function can be applied successfully to a host object is implementation-dependent. Array.prototype.join (separator) The elements of the array are converted to strings, and these strings are then concatenated, separated by occurrences of the separator. If no separator is provided, a single comma is used as the separator. The join method takes one argument, separator, and performs the following steps: Call the [[Get]] method of this object with argument "length". Call ToUint32(Result(1)). If separator is undefined, let separator be the single-character string ",". Call ToString(separator). If Result(2) is zero, return the empty string. Call the [[Get]] method of this object with argument "0". If Result(6) is undefined or null, use the empty string; otherwise, call ToString(Result(6)). Let R be Result(7). Let k be 1. If k equals Result(2), return R. Let S be a string value produced by concatenating R and Result(4). Call the [[Get]] method of this object with argument ToString(k). If Result(12) is undefined or null, use the empty string; otherwise, call ToString(Result(12)). Let R be a string value produced by concatenating S and Result(13). Increase k by 1. Go to step 10. The length property of the join method is 1. NOTE The join function is intentionally generic; it does not require that its this value be an Array object. Therefore, it can be transferred to other kinds of objects for use as a method. Whether the join function can be applied successfully to a host object is implementation-dependent. Array.prototype.pop ( ) The last element of the array is removed from the array and returned. Call the [[Get]] method of this object with argument "length". Call ToUint32(Result(1)). If Result(2) is not zero, go to step 6. Call the [[Put]] method of this object with arguments "length" and Result(2). Return undefined. Call ToString(Result(2)1). Call the [[Get]] method of this object with argument Result(6). Call the [[Delete]] method of this object with argument Result(6). Call the [[Put]] method of this object with arguments "length" and (Result(2)1). Return Result(7). NOTE The pop function is intentionally generic; it does not require that its this value be an Array object. Therefore it can be transferred to other kinds of objects for use as a method. Whether the pop function can be applied successfully to a host object is implementation-dependent. Array.prototype.push ( [ item1 [ , item2 [ , ] ] ] ) The arguments are appended to the end of the array, in the order in which they appear. The new length of the array is returned as the result of the call. When the push method is called with zero or more arguments item1, item2, etc., the following steps are taken: Call the [[Get]] method of this object with argument "length". Let n be the result of calling ToUint32(Result(1)). Get the next argument in the argument list; if there are no more arguments, go to step 7. Call the [[Put]] method of this object with arguments ToString(n) and Result(3). Increase n by 1. Go to step 3. Call the [[Put]] method of this object with arguments "length" and n. Return n. The length property of the push method is 1. NOTE The push function is intentionally generic; it does not require that its this value be an Array object. Therefore it can be transferred to other kinds of objects for use as a method. Whether the push function can be applied successfully to a host object is implementation-dependent. Array.prototype.reverse ( ) The elements of the array are rearranged so as to reverse their order. The object is returned as the result of the call. Call the [[Get]] method of this object with argument "length". Call ToUint32(Result(1)). Compute floor(Result(2)/2). Let k be 0. If k equals Result(3), return this object. Compute Result(2)(k(1. Call ToString(k). Call ToString(Result(6)). Call the [[Get]] method of this object with argument Result(7). Call the [[Get]] method of this object with argument Result(8). If this object does not have a property named by Result(8), go to step 19. If this object does not have a property named by Result(7), go to step 16. Call the [[Put]] method of this object with arguments Result(7) and Result(10). Call the [[Put]] method of this object with arguments Result(8) and Result(9). Go to step 25. Call the [[Put]] method of this object with arguments Result(7) and Result(10). Call the [[Delete]] method on this object, providing Result(8) as the name of the property to delete. Go to step 25. If this object does not have a property named by Result(7), go to step 23. Call the [[Delete]] method on this object, providing Result(7) as the name of the property to delete.. Call the [[Put]] method of this object with arguments Result(8) and Result(9). Go to step 25. Call the [[Delete]] method on this object, providing Result(7) as the name of the property to delete. Call the [[Delete]] method on this object, providing Result(8) as the name of the property to delete. Increase k by 1. Go to step 5. NOTE The reverse function is intentionally generic; it does not require that its this value be an Array object. Therefore, it can be transferred to other kinds of objects for use as a method. Whether the reverse function can be applied successfully to a host object is implementation-dependent. Array.prototype.shift ( ) The first element of the array is removed from the array and returned. Call the [[Get]] method of this object with argument "length". Call ToUint32(Result(1)). If Result(2) is not zero, go to step 6. Call the [[Put]] method of this object with arguments "length" and Result(2). Return undefined. Call the [[Get]] method of this object with argument 0. Let k be 1. If k equals Result(2), go to step 18. Call ToString(k). Call ToString(k1). If this object has a property named by Result(9), go to step 12; but if this object has no property named by Result(9), then go to step 15. Call the [[Get]] method of this object with argument Result(9). Call the [[Put]] method of this object with arguments Result(10) and Result(12). Go to step 16. Call the [[Delete]] method of this object with argument Result(10). Increase k by 1. Go to step 8. Call the [[Delete]] method of this object with argument ToString(Result(2)1). Call the [[Put]] method of this object with arguments "length" and (Result(2)1). Return Result(6). NOTE The shift function is intentionally generic; it does not require that its this value be an Array object. Therefore it can be transferred to other kinds of objects for use as a method. Whether the shift function can be applied successfully to a host object is implementation-dependent. Array.prototype.slice (start, end) The slice method takes two arguments, start and end, and returns an array containing the elements of the array from element start up to, but not including, element end (or through the end of the array if end is undefined). If start is negative, it is treated as (length+start) where length is the length of the array. If end is negative, it is treated as (length+end) where length is the length of the array. The following steps are taken: Let A be a new array created as if by the expression new Array(). Call the [[Get]] method of this object with argument "length". Call ToUint32(Result(2)). Call ToInteger(start). If Result(4) is negative, use max((Result(3)+Result(4)),0); else use min(Result(4),Result(3)). Let k be Result(5). If end is undefined, use Result(3); else use ToInteger(end). If Result(7) is negative, use max((Result(3)+Result(7)),0); else use min(Result(7),Result(3)). Let n be 0. If k is greater than or equal to Result(8), go to step 19. Call ToString(k). If this object has a property named by Result(11), go to step 13; but if this object has no property named by Result(11), then go to step 16. Call ToString(n). Call the [[Get]] method of this object with argument Result(11). Call the [[Put]] method of A with arguments Result(13) and Result(14). Increase k by 1. Increase n by 1. Go to step 10. Call the [[Put]] method of A with arguments "length" and n. Return A. The length property of the slice method is 2. NOTE The slice function is intentionally generic; it does not require that its this value be an Array object. Therefore it can be transferred to other kinds of objects for use as a method. Whether the slice function can be applied successfully to a host object is implementation-dependent. Array.prototype.sort (comparefn) The elements of this array are sorted. The sort is not necessarily stable (that is, elements that compare equal do not necessarily remain in their original order). If comparefn is not undefined, it should be a function that accepts two arguments x and y and returns a negative value if x < y, zero if x = y, or a positive value if x > y. If comparefn is not undefined and is not a consistent comparison function for the elements of this array (see below), the behaviour of sort is implementation-defined. Let len be ToUint32(this.length). If there exist integers i and j and an object P such that all of the conditions below are satisfied then the behaviour of sort is implementation-defined: 0 ( i < len 0 ( j < len this does not have a property with name ToString(i) P is obtained by following one or more [[Prototype]] properties starting at this P has a property with name ToString(j) Otherwise the following steps are taken. Call the [[Get]] method of this object with argument "length". Call ToUint32(Result(1)). Perform an implementation-dependent sequence of calls to the [[Get]] , [[Put]], and [[Delete]] methods of this object and to SortCompare (described below), where the first argument for each call to [[Get]], [[Put]], or [[Delete]] is a nonnegative integer less than Result(2) and where the arguments for calls to SortCompare are results of previous calls to the [[Get]] method. Return this object. The returned object must have the following two properties. There must be some mathematical permutation ( of the nonnegative integers less than Result(2), such that for every nonnegative integer j less than Result(2), if property old[j] existed, then new[((j)] is exactly the same value as old[j],. but if property old[j] did not exist, then new[((j)] does not exist. Then for all nonnegative integers j and k, each less than Result(2), if SortCompare(j,k) < 0 (see SortCompare below), then ((j) < ((k). Here the notation old[j] is used to refer to the hypothetical result of calling the [[Get]] method of this object with argument j before this function is executed, and the notation new[j] to refer to the hypothetical result of calling the [[Get]] method of this object with argument j after this function has been executed. A function comparefn is a consistent comparison function for a set of values S if all of the requirements below are met for all values a, b, and c (possibly the same value) in the set S: The notation aCFb means comparefn(a,b)>0. Calling comparefn(a,b) always returns the same value v when given a specific pair of values a and b as its two arguments. Furthermore, v has type Number, and v is not NaN. Note that this implies that exactly one of aCFb will be true for a given pair of a and b. a=CFa (reflexivity) If a=CFb, then b=CFa (symmetry) If a=CFb and b=CFc, then a=CFc (transitivity of =CF) If aCFb and b>CFc, then a>CFc (transitivity of >CF) NOTE The above conditions are necessary and sufficient to ensure that comparefn divides the set S into equivalence classes and that these equivalence classes are totally ordered. When the SortCompare operator is called with two arguments j and k, the following steps are taken: Call ToString(j). Call ToString(k). If this object does not have a property named by Result(1), and this object does not have a property named by Result(2), return +0. If this object does not have a property named by Result(1), return 1. If this object does not have a property named by Result(2), return 1. Call the [[Get]] method of this object with argument Result(1). Call the [[Get]] method of this object with argument Result(2). Let x be Result(6). Let y be Result(7). If x and y are both undefined, return +0. If x is undefined, return 1. If y is undefined, return (1. If the argument comparefn is undefined, go to step 16. Call comparefn with arguments x and y. Return Result(14). Call ToString(x). Call ToString(y). If Result(16) < Result(17), return (1. If Result(16) > Result(17), return 1. Return +0. NOTE Because non-existent property values always compare greater than undefined property values, and undefined always compares greater than any other value, undefined property values always sort to the end of the result, followed by non-existent property values. NOTE The sort function is intentionally generic; it does not require that its this value be an Array object. Therefore, it can be transferred to other kinds of objects for use as a method. Whether the sort function can be applied successfully to a host object is implementation-dependent. Array.prototype.splice (start, deleteCount [ , item1 [ , item2 [ , ] ] ] ) When the splice method is called with two or more arguments start, deleteCount and (optionally) item1, item2, etc., the deleteCount elements of the array starting at array index start are replaced by the arguments item1, item2, etc. The following steps are taken: Let A be a new array created as if by the expression new Array(). Call the [[Get]] method of this object with argument "length". Call ToUint32(Result(2)). Call ToInteger(start). If Result(4) is negative, use max((Result(3)+Result(4)),0); else use min(Result(4),Result(3)). Compute min(max(ToInteger(deleteCount),0),Result(3)Result(5)). Let k be 0. If k equals Result(6), go to step 16. Call ToString(Result(5)+k). If this object has a property named by Result(9), go to step 11; but if this object has no property named by Result(9), then go to step 14. Call ToString(k). Call the [[Get]] method of this object with argument Result(9). Call the [[Put]] method of A with arguments Result(11) and Result(12). Increment k by 1. Go to step 8. Call the [[Put]] method of A with arguments "length" and Result(6). Compute the number of additional arguments item1, item2, etc. If Result(17) is equal to Result(6), go to step 48. If Result(17) is greater than Result(6), go to step 37. Let k be Result(5). If k is equal to (Result(3)Result(6)), go to step 31. Call ToString(k+Result(6)). Call ToString(k+Result(17)). If this object has a property named by Result(22), go to step 25; but if this object has no property named by Result(22), then go to step 28. Call the [[Get]] method of this object with argument Result(22). Call the [[Put]] method of this object with arguments Result(23) and Result(25). Go to step 29. Call the [[Delete]] method of this object with argument Result(23). Increase k by 1. Go to step 21. Let k be Result(3). If k is equal to (Result(3)Result(6)+Result(17)), go to step 48. Call ToString(k1). Call the [[Delete]] method of this object with argument Result(33). Decrease k by 1. Go to step 32. Let k be (Result(3)Result(6)). If k is equal to Result(5), go to step 48. Call ToString(k+Result(6)1). Call ToString(k+Result(17)1) If this object has a property named by Result(39), go to step 42; but if this object has no property named by Result(39), then go to step 45. Call the [[Get]] method of this object with argument Result(39). Call the [[Put]] method of this object with arguments Result(40) and Result(42). Go to step 46. Call the [[Delete]] method of this object with argument Result(40). Decrease k by 1. Go to step 38. Let k be Result(5). Get the next argument in the part of the argument list that starts with item1; if there are no more arguments, go to step 53. Call the [[Put]] method of this object with arguments ToString(k) and Result(49). Increase k by 1. Go to step 49. Call the [[Put]] method of this object with arguments "length" and (Result(3)Result(6)+Result(17)). Return A. The length property of the splice method is 2. NOTE The splice function is intentionally generic; it does not require that its this value be an Array object. Therefore it can be transferred to other kinds of objects for use as a method. Whether the splice function can be applied successfully to a host object is implementation-dependent. Array.prototype.unshift ( [ item1 [ , item2 [ , ] ] ] ) The arguments are prepended to the start of the array, such that their order within the array is the same as the order in which they appear in the argument list. When the unshift method is called with zero or more arguments item1, item2, etc., the following steps are taken: Call the [[Get]] method of this object with argument "length". Call ToUint32(Result(1)). Compute the number of arguments. Let k be Result(2). If k is zero, go to step 15. Call ToString(k1). Call ToString(k+Result(3)1). If this object has a property named by Result(6), go to step 9; but if this object has no property named by Result(6), then go to step 12. Call the [[Get]] method of this object with argument Result(6). Call the [[Put]] method of this object with arguments Result(7) and Result(9). Go to step 13. Call the [[Delete]] method of this object with argument Result(7). Decrease k by 1. Go to step 5. Let k be 0. Get the next argument in the part of the argument list that starts with item1; if there are no more arguments, go to step 21. Call ToString(k). Call the [[Put]] method of this object with arguments Result(17) and Result(16). Increase k by 1. Go to step 16. Call the [[Put]] method of this object with arguments "length" and (Result(2)+Result(3)). Return (Result(2)+Result(3)). The length property of the unshift method is 1. NOTE The unshift function is intentionally generic; it does not require that its this value be an Array object. Therefore it can be transferred to other kinds of objects for use as a method. Whether the unshift function can be applied successfully to a host object is implementation-dependent. Properties of Array Instances Array instances inherit properties from the Array prototype object and also have the following properties. [[Put]] (P, V) Array objects use a variation of the [[Put]] method used for other native ECMAScript objects (section  REF _Ref424668494 \r \h 8.6.2.2). Assume A is an Array object and P is a string. When the [[Put]] method of A is called with property P and value V, the following steps are taken: Call the [[CanPut]] method of A with name P. If Result(1) is false, return. If A doesnt have a property with name P, go to step 7. If P is "length", go to step 12. Set the value of property P of A to V. Go to step 8. Create a property with name P, set its value to V and give it empty attributes. If P is not an array index, return. If ToUint32(P) is less than the value of the length property of A, then return. Change (or set) the value of the length property of A to ToUint32(P)+1. Return. Compute ToUint32(V). If Result(12) is not equal to ToNumber(V), throw a RangeError exception. For every integer k that is less than the value of the length property of A but not less than Result(12), if A itself has a property (not an inherited property) named ToString(k), then delete that property. Set the value of property P of A to Result(12). Return. length The length property of this Array object is always numerically greater than the name of every property whose name is an array index. The length property has the attributes { DontEnum, DontDelete }. String Objects The String Constructor Called as a Function When String is called as a function rather than as a constructor, it performs a type conversion. String ( [ value ] ) Returns a string value (not a String object) computed by ToString(value). If value is not supplied, the empty string "" is returned. The String Constructor When String is called as part of a new expression, it is a constructor: it initialises the newly created object. new String ( [ value ] ) The [[Prototype]] property of the newly constructed object is set to the original String prototype object, the one that is the initial value of String.prototype (section  REF _Ref424534397 \r \h 15.5.3.1). The [[Class]] property of the newly constructed object is set to "String". The [[Value]] property of the newly constructed object is set to ToString(value), or to the empty string if value is not supplied. Properties of the String Constructor The value of the internal [[Prototype]] property of the String constructor is the Function prototype object (section  REF _Ref424534100 \r \h 15.3.4). Besides the internal properties and the length property (whose value is 1), the String constructor has the following properties: String.prototype The initial value of String.prototype is the String prototype object (section  REF _Ref457704247 \r 15.5.4). This property has the attributes { DontEnum, DontDelete, ReadOnly }. String.fromCharCode ( [ char0 [ , char1 [ , ] ] ] ) Returns a string value containing as many characters as the number of arguments. Each argument specifies one character of the resulting string, with the first argument specifying the first character, and so on, from left to right. An argument is converted to a character by applying the operation ToUint16 (section  REF _Ref424532099 \r \h 9.7) and regarding the resulting 16-bit integer as the code point value of a character. If no arguments are supplied, the result is the empty string. The length property of the fromCharCode function is 1. Properties of the String Prototype Object The String prototype object is itself a String object (its [[Class]] is "String") whose value is an empty string. The value of the internal [[Prototype]] property of the String prototype object is the Object prototype object (section  REF _Ref424531384 \r \h 15.2.3.1). String.prototype.constructor The initial value of String.prototype.constructor is the built-in String constructor. String.prototype.toString ( ) Returns this string value. (Note that, for a String object, the toString method happens to return the same thing as the valueOf method.) The toString function is not generic; it throws a TypeError exception if its this value is not a String object. Therefore, it cannot be transferred to other kinds of objects for use as a method. String.prototype.valueOf ( ) Returns this string value. The valueOf function is not generic; it throws a TypeError exception if its this value is not a String object. Therefore, it cannot be transferred to other kinds of objects for use as a method. String.prototype.charAt (pos) Returns a string containing the character at position pos in the string resulting from converting this object to a string. If there is no character at that position, the result is the empty string. The result is a string value, not a String object. If pos is a value of Number type that is an integer, then the result of x.charAt(pos) is equal to the result of x.substring(pos, pos+1). When the charAt method is called with one argument pos, the following steps are taken: Call ToString, giving it the this value as its argument. Call ToInteger(pos). Compute the number of characters in Result(1). If Result(2) is less than 0 or is not less than Result(3), return the empty string. Return a string of length 1, containing one character from Result(1), namely the character at position Result(2), where the first (leftmost) character in Result(1) is considered to be at position 0, the next one at position 1, and so on. NOTE The charAt function is intentionally generic; it does not require that its this value be a String object. Therefore, it can be transferred to other kinds of objects for use as a method. String.prototype.charCodeAt (pos) Returns a number (a nonnegative integer less than 216) representing the code point value of the character at position pos in the string resulting from converting this object to a string. If there is no character at that position, the result is NaN. When the charCodeAt method is called with one argument pos, the following steps are taken: Call ToString, giving it the this value as its argument. Call ToInteger(pos). Compute the number of characters in Result(1). If Result(2) is less than 0 or is not less than Result(3), return NaN. Return a value of Number type, whose value is the code point value of the character at position Result(2) in the string Result(1), where the first (leftmost) character in Result(1) is considered to be at position 0, the next one at position 1, and so on. NOTE The charCodeAt function is intentionally generic; it does not require that its this value be a String object. Therefore it can be transferred to other kinds of objects for use as a method. String.prototype.concat ( [ string1 [ , string2 [ , ] ] ] ) When the concat method is called with zero or more arguments string1, string2, etc., it returns a string consisting of the characters of this object (converted to a string) followed by the characters of each of string1, string2, etc. (where each argument is converted to a string). The result is a string value, not a String object. The following steps are taken: Call ToString, giving it the this value as its argument. Let R be Result(1). Get the next argument in the argument list; if there are no more arguments, go to step 7. Call ToString(Result(3)). Let R be the string value consisting of the characters in the previous value of R followed by the characters Result(4). Go to step 3. Return R. The length property of the concat method is 1. NOTE The concat function is intentionally generic; it does not require that its this value be a String object. Therefore it can be transferred to other kinds of objects for use as a method. String.prototype.indexOf (searchString, position) If searchString appears as a substring of the result of converting this object to a string, at one or more positions that are greater than or equal to position, then the index of the smallest such position is returned; otherwise, -1 is returned. If position is undefined, 0 is assumed, so as to search all of the string. The indexOf method takes two arguments, searchString and position, and performs the following steps: Call ToString, giving it the this value as its argument. Call ToString(searchString). Call ToInteger(position). (If position is undefined, this step produces the value 0). Compute the number of characters in Result(1). Compute min(max(Result(3), 0), Result(4)). Compute the number of characters in the string that is Result(2). Compute the smallest possible integer k not smaller than Result(5) such that k+Result(6) is not greater than Result(4), and for all nonnegative integers j less than Result(6), the character at position k+j of Result(1) is the same as the character at position j of Result(2); but if there is no such integer k, then compute the value -1. Return Result(7). The length property of the indexOf method is 1. NOTE The indexOf function is intentionally generic; it does not require that its this value be a String object. Therefore, it can be transferred to other kinds of objects for use as a method. String.prototype.lastIndexOf (searchString, position) If searchString appears as a substring of the result of converting this object to a string at one or more positions that are smaller than or equal to position, then the index of the greatest such position is returned; otherwise, -1 is returned. If position is undefined, the length of the string value is assumed, so as to search all of the string. The lastIndexOf method takes two arguments, searchString and position, and performs the following steps: Call ToString, giving it the this value as its argument. Call ToString(searchString). Call ToNumber(position). (If position is undefined, this step produces the value NaN). If Result(3) is NaN, use +(; otherwise, call ToInteger(Result(3)). Compute the number of characters in Result(1). Compute min(max(Result(4), 0), Result(5)). Compute the number of characters in the string that is Result(2). Compute the largest possible nonnegative integer k not larger than Result(6) such that k+Result(7) is not greater than Result(5), and for all nonnegative integers j less than Result(7), the character at position k+j of Result(1) is the same as the character at position j of Result(2); but if there is no such integer k, then compute the value -1. Return Result(8). The length property of the lastIndexOf method is 1. NOTE The lastIndexOf function is intentionally generic; it does not require that its this value be a String object. Therefore, it can be transferred to other kinds of objects for use as a method. String.prototype.localeCompare (that) When the localeCompare method is called with one argument that, it returns a number other than NaN that represents the result of a locale-sensitive string comparison of this object (converted to a string) with that (converted to a string). The two strings are compared in an implementation-defined fashion. The result is intended to order strings in the sort order specified by the system default locale, and will be negative, zero, or positive, depending on whether this comes before that in the sort order, the strings are equal, or this comes after that in the sort order, respectively. The localeCompare method, if considered as a function of two arguments this and that, is a consistent comparison function (as defined in section  REF _Ref440446657 \r \h  \* MERGEFORMAT 15.4.4.11) on the set of all strings. Furthermore, localeCompare returns 0 or 0 when comparing two strings that are considered canonically equivalent by the Unicode standard. The actual return values are left implementation-defined to permit implementers to encode additional information in the result value, but the function is required to define a total ordering on all strings and to return 0 when comparing two strings that are considered canonically equivalent by the Unicode standard. NOTE The localeCompare method itself is not directly suitable as an argument to Array.prototype.sort because the latter requires a function of two arguments. NOTE This function is intended to rely on whatever language-sensitive comparison functionality is available to the ECMAScript environment from the host environment, and to compare according to the rules of the host environments current locale. It is strongly recommended that this function treat strings that are canonically equivalent according to the Unicode standard as identical (in other words, compare the strings as if they had both been converted to Normalised Form C or D first). It is also recommended that this function not honour Unicode compatibility equivalences or decompositions. If no language-sensitive comparison at all is available from the host environment, this function may perform a bitwise comparison. NOTE The localeCompare function is intentionally generic; it does not require that its this value be a String object. Therefore, it can be transferred to other kinds of objects for use as a method. NOTE The second parameter to this function is likely to be used in a future version of this standard; it is recommended that implementations do not use this parameter position for anything else. String.prototype.match (regexp) If regexp is not an object whose [[Class]] property is "RegExp", it is replaced with the result of the expression new RegExp(regexp). Let string denote the result of converting the this value to a string. Then do one of the following: If regexp.global is false: Return the result obtained by invoking RegExp.prototype.exec (see section  REF _Ref404572122 \r \h  \* MERGEFORMAT 15.10.6.2) on regexp with string as parameter. If regexp.global is true: Set the regexp.lastIndex property to 0 and invoke RegExp.prototype.exec repeatedly until there is no match. If there is a match with an empty string (in other words, if the value of regexp.lastIndex is left unchanged), increment regexp.lastIndex by 1. Let n be the number of matches. The value returned is an array with the length property set to n and properties 0 through n1 corresponding to the first elements of the results of all matching invocations of RegExp.prototype.exec. NOTE The match function is intentionally generic; it does not require that its this value be a String object. Therefore, it can be transferred to other kinds of objects for use as a method. String.prototype.replace (searchValue, replaceValue) Let string denote the result of converting the this value to a string. If searchValue is a regular expression (an object whose [[Class]] property is "RegExp"), do the following: If searchValue.global is false, then search string for the first match of the regular expression searchValue. If searchValue.global is true, then search string for all matches of the regular expression searchValue. Do the search in the same manner as in String.prototype.match, including the update of searchValue.lastIndex. Let m be the number of left capturing parentheses in searchValue (NCapturingParens as specified in section  REF _Ref455931278 \r \h 15.10.2.1). If searchValue is not a regular expression, let searchString be ToString(searchValue) and search string for the first occurrence of searchString. Let m be 0. If replaceValue is a function, then for each matched substring, call the function with the following m + 3 arguments. Argument 1 is the substring that matched. If searchValue is a regular expression, the next m arguments are all of the captures in the MatchResult (see section  REF _Ref455931278 \r \h 15.10.2.1). Argument m + 2 is the offset within string where the match occurred, and argument m + 3 is string. The result is a string value derived from the original input by replacing each matched substring with the corresponding return value of the function call, converted to a string if need be. Otherwise, let newstring denote the result of converting replaceValue to a string. The result is a string value derived from the original input string by replacing each matched substring with a string derived from newstring by replacing characters in newstring by replacement text as specified in the following table. These $ replacements are done left-to-right, and, once such a replacement is performed, the new replacement text is not subject to further replacements. For example, "$1,$2".replace(/(\$(\d))/g, "$$1-$1$2") returns "$1-$11,$1-$22". A $ in newstring that does not match any of the forms below is left as is. CharactersReplacement text$$$$&The matched substring.$The portion of string that precedes the matched substring.$The portion of string that follows the matched substring.$nThe nth capture, where n is a single digit 1-9 and $n is not followed by a decimal digit. If n(m and the nth capture is undefined, use the empty string instead. If n>m, the result is implementation-defined.$nnThe nnth capture, where nn is a two-digit decimal number 01-99. If nn(m and the nnth capture is undefined, use the empty string instead. If nn>m, the result is implementation-defined. NOTE The replace function is intentionally generic; it does not require that its this value be a String object. Therefore, it can be transferred to other kinds of objects for use as a method. String.prototype.search (regexp) If regexp is not an object whose [[Class]] property is "RegExp", it is replaced with the result of the expression new RegExp(regexp). Let string denote the result of converting the this value to a string. The value string is searched from its beginning for an occurrence of the regular expression pattern regexp. The result is a number indicating the offset within the string where the pattern matched, or 1 if there was no match. NOTE This method ignores the lastIndex and global properties of regexp. The lastIndex property of regexp is left unchanged. NOTE The search function is intentionally generic; it does not require that its this value be a String object. Therefore, it can be transferred to other kinds of objects for use as a method. String.prototype.slice (start, end) The slice method takes two arguments, start and end, and returns a substring of the result of converting this object to a string, starting from character position start and running to, but not including, character position end (or through the end of the string if end is undefined). If start is negative, it is treated as (sourceLength+start) where sourceLength is the length of the string. If end is negative, it is treated as (sourceLength+end) where sourceLength is the length of the string. The result is a string value, not a String object. The following steps are taken: Call ToString, giving it the this value as its argument. Compute the number of characters in Result(1). Call ToInteger(start). If end is undefined, use Result(2); else use ToInteger(end). If Result(3) is negative, use max(Result(2)+Result(3),0); else use min(Result(3),Result(2)). If Result(4) is negative, use max(Result(2)+Result(4),0); else use min(Result(4),Result(2)). Compute max(Result(6)Result(5),0). Return a string containing Result(7) consecutive characters from Result(1) beginning with the character at position Result(5). The length property of the slice method is 2. NOTE The slice function is intentionally generic; it does not require that its this value be a String object. Therefore it can be transferred to other kinds of objects for use as a method. String.prototype.split (separator, limit) Returns an Array object into which substrings of the result of converting this object to a string have been stored. The substrings are determined by searching from left to right for occurrences of separator; these occurrences are not part of any substring in the returned array, but serve to divide up the string value. The value of separator may be a string of any length or it may be a RegExp object (i.e., an object whose [[Class]] property is "RegExp"; see section  REF _Ref404565288 \r \h 15.10). The value of separator may be an empty string, an empty regular expression, or a regular expression that can match an empty string. In this case, separator does not match the empty substring at the beginning or end of the input string, nor does it match the empty substring at the end of the previous separator match. (For example, if separator is the empty string, the string is split up into individual characters; the length of the result array equals the length of the string, and each substring contains one character.) If separator is a regular expression, only the first match at a given position of the this string is considered, even if backtracking could yield a non-empty-substring match at that position. (For example, "ab".split(/a*?/) evaluates to the array ["a","b"], while "ab".split(/a*/) evaluates to the array["","b"].) If the this object is (or converts to) the empty string, the result depends on whether separator can match the empty string. If it can, the result array contains no elements. Otherwise, the result array contains one element, which is the empty string. If separator is a regular expression that contains capturing parentheses, then each time separator is matched the results (including any undefined results) of the capturing parentheses are spliced into the output array. (For example, "Aboldandcoded".split(/<(\/)?([^<>]+)>/) evaluates to the array ["A", undefined, "B", "bold", "/", "B", "and", undefined, "CODE", "coded", "/", "CODE", ""].) If separator is undefined, then the result array contains just one string, which is the this value (converted to a string). If limit is not undefined, then the output array is truncated so that it contains no more than limit elements. When the split method is called, the following steps are taken: Let S = ToString(this). Let A be a new array created as if by the expression new Array(). If limit is undefined, let lim = 2321; else let lim = ToUint32(limit). Let s be the number of characters in S. Let p = 0. If separator is a RegExp object (its [[Class]] is "RegExp"), let R = separator; otherwise let R = ToString(separator). If lim = 0, return A. If separator is undefined, go to step 33. If s = 0, go to step 31. Let q = p. If q = s, go to step 28. Call SplitMatch(R, S, q) and let z be its MatchResult result. If z is failure, go to step 26. z must be a State. Let e be z's endIndex and let cap be z's captures array. If e = p, go to step 26. Let T be a string value equal to the substring of S consisting of the characters at positions p (inclusive) through q (exclusive). Call the [[Put]] method of A with arguments A.length and T. If A.length = lim, return A. Let p = e. Let i = 0. If i is equal to the number of elements in cap, go to step 10. Let i = i+1. Call the [[Put]] method of A with arguments A.length and cap[i]. If A.length = lim, return A. Go to step 21. Let q = q+1. Go to step 11. Let T be a string value equal to the substring of S consisting of the characters at positions p (inclusive) through s (exclusive). Call the [[Put]] method of A with arguments A.length and T. Return A. Call SplitMatch(R, S, 0) and let z be its MatchResult result. If z is not failure, return A. Call the [[Put]] method of A with arguments "0" and S. Return A. The internal helper function SplitMatch takes three parameters, a string S, an integer q, and a string or RegExp R, and performs the following in order to return a MatchResult (see section  REF _Ref455931278 \r \h 15.10.2.1): If R is a RegExp object (its [[Class]] is "RegExp"), go to step 8. R must be a string. Let r be the number of characters in R. Let s be the number of characters in S. If q+r > s then return the MatchResult failure. If there exists an integer i between 0 (inclusive) and r (exclusive) such that the character at position q+i of S is different from the character at position i of R, then return failure. Let cap be an empty array of captures (see section  REF _Ref455931278 \r \h 15.10.2.1). Return the State (q+r, cap). (see section  REF _Ref455931278 \r \h 15.10.2.1) Call the [[Match]] method of R giving it the arguments S and q, and return the MatchResult result. The length property of the split method is 2. NOTE The split function is intentionally generic; it does not require that its this value be a String object. Therefore, it can be transferred to other kinds of objects for use as a method. NOTE The split method ignores the value of separator.global for separators that are RegExp objects. String.prototype.substring (start, end) The substring method takes two arguments, start and end, and returns a substring of the result of converting this object to a string, starting from character position start and running to, but not including, character position end of the string (or through the end of the string is end is undefined). The result is a string value, not a String object. If either argument is NaN or negative, it is replaced with zero; if either argument is larger than the length of the string, it is replaced with the length of the string. If start is larger than end, they are swapped. The following steps are taken: Call ToString, giving it the this value as its argument. Compute the number of characters in Result(1). Call ToInteger(start). If end is undefined, use Result(2); else use ToInteger(end). Compute min(max(Result(3), 0), Result(2)). Compute min(max(Result(4), 0), Result(2)). Compute min(Result(5), Result(6)). Compute max(Result(5), Result(6)). Return a string whose length is the difference between Result(8) and Result(7), containing characters from Result(1), namely the characters with indices Result(7) through Result(8)(1, in ascending order. The length property of the substring method is 2. NOTE The substring function is intentionally generic; it does not require that its this value be a String object. Therefore, it can be transferred to other kinds of objects for use as a method. String.prototype.toLowerCase ( ) If this object is not already a string, it is converted to a string. The characters in that string are converted one by one to lower case. The result is a string value, not a String object. The characters are converted one by one. The result of each conversion is the original character, unless that character has a Unicode lowercase equivalent, in which case the lowercase equivalent is used instead. NOTE The result should be derived according to the case mappings in the Unicode character database (this explicitly includes not only the UnicodeData.txt file, but also the SpecialCasings.txt file that accompanies it in Unicode 2.1.8 and later). NOTE The toLowerCase function is intentionally generic; it does not require that its this value be a String object. Therefore, it can be transferred to other kinds of objects for use as a method. String.prototype.toLocaleLowerCase ( ) This function works exactly the same as toLowerCase except that its result is intended to yield the correct result for the host environments current locale, rather than a locale-independent result. There will only be a difference in the few cases (such as Turkish) where the rules for that language conflict with the regular Unicode case mappings. NOTE The toLocaleLowerCase function is intentionally generic; it does not require that its this value be a String object. Therefore, it can be transferred to other kinds of objects for use as a method. NOTE The first parameter to this function is likely to be used in a future version of this standard; it is recommended that implementations do not use this parameter position for anything else. String.prototype.toUpperCase ( ) This function behaves in exactly the same way as String.prototype.toLowerCase, except that characters are mapped to their uppercase equivalents as specified in the Unicode Character Database. NOTE Because both toUpperCase and toLowerCase have context-sensitive behaviour, the functions are not symmetrical. In other words, s.toUpperCase().toLowerCase() is not necessarily equal to s.toLowerCase(). NOTE The toUpperCase function is intentionally generic; it does not require that its this value be a String object. Therefore, it can be transferred to other kinds of objects for use as a method. String.prototype.toLocaleUpperCase ( ) This function works exactly the same as toUpperCase except that its result is intended to yield the correct result for the host environments current locale, rather than a locale-independent result. There will only be a difference in the few cases (such as Turkish) where the rules for that language conflict with the regular Unicode case mappings. NOTE The toLocaleUpperCase function is intentionally generic; it does not require that its this value be a String object. Therefore, it can be transferred to other kinds of objects for use as a method. NOTE The first parameter to this function is likely to be used in a future version of this standard; it is recommended that implementations do not use this parameter position for anything else. Properties of String Instances String instances inherit properties from the String prototype object and also have a [[Value]] property and a length property. The [[Value]] property is the string value represented by this String object. length The number of characters in the String value represented by this String object. Once a String object is created, this property is unchanging. It has the attributes { DontEnum, DontDelete, ReadOnly }. Boolean Objects The Boolean Constructor Called as a Function When Boolean is called as a function rather than as a constructor, it performs a type conversion. Boolean (value) Returns a boolean value (not a Boolean object) computed by ToBoolean(value). The Boolean Constructor When Boolean is called as part of a new expression it is a constructor: it initialises the newly created object. new Boolean (value) The [[Prototype]] property of the newly constructed object is set to the original Boolean prototype object, the one that is the initial value of Boolean.prototype (section  REF _Ref424534464 \r \h 15.6.3.1). The [[Class]] property of the newly constructed Boolean object is set to "Boolean". The [[Value]] property of the newly constructed Boolean object is set to ToBoolean(value). Properties of the Boolean Constructor The value of the internal [[Prototype]] property of the Boolean constructor is the Function prototype object (section  REF _Ref424534100 \r \h 15.3.4). Besides the internal properties and the length property (whose value is 1), the Boolean constructor has the following property: Boolean.prototype The initial value of Boolean.prototype is the Boolean prototype object (section  REF _Ref424535986 \r \h 15.6.4). This property has the attributes { DontEnum, DontDelete, ReadOnly }. Properties of the Boolean Prototype Object The Boolean prototype object is itself a Boolean object (its [[Class]] is "Boolean") whose value is false. The value of the internal [[Prototype]] property of the Boolean prototype object is the Object prototype object (section  REF _Ref424531384 \r \h 15.2.3.1). In following descriptions of functions that are properties of the Boolean prototype object, the phrase this Boolean object refers to the object that is the this value for the invocation of the function; a TypeError exception is thrown if the this value is not an object for which the value of the internal [[Class]] property is "Boolean". Also, the phrase this boolean value refers to the boolean value represented by this Boolean object, that is, the value of the internal [[Value]] property of this Boolean object. Boolean.prototype.constructor The initial value of Boolean.prototype.constructor is the built-in Boolean constructor. Boolean.prototype.toString ( ) If this boolean value is true, then the string "true" is returned. Otherwise, this boolean value must be false, and the string "false" is returned. The toString function is not generic; it throws a TypeError exception if its this value is not a Boolean object. Therefore, it cannot be transferred to other kinds of objects for use as a method. Boolean.prototype.valueOf ( ) Returns this boolean value. The valueOf function is not generic; it throws a TypeError exception if its this value is not a Boolean object. Therefore, it cannot be transferred to other kinds of objects for use as a method. Properties of Boolean Instances Boolean instances have no special properties beyond those inherited from the Boolean prototype object. Number Objects The Number Constructor Called as a Function When Number is called as a function rather than as a constructor, it performs a type conversion. Number ( [ value ] ) Returns a number value (not a Number object) computed by ToNumber(value) if value was supplied, else returns +0. The Number Constructor When Number is called as part of a new expression it is a constructor: it initialises the newly created object. new Number ( [ value ] ) The [[Prototype]] property of the newly constructed object is set to the original Number prototype object, the one that is the initial value of Number.prototype (section  REF _Ref424534510 \r \h  \* MERGEFORMAT 15.7.3.1). The [[Class]] property of the newly constructed object is set to "Number". The [[Value]] property of the newly constructed object is set to ToNumber(value) if value was supplied, else to +0. Properties of the Number Constructor The value of the internal [[Prototype]] property of the Number constructor is the Function prototype object (section  REF _Ref424534100 \r \h 15.3.4). Besides the internal properties and the length property (whose value is 1), the Number constructor has the following property: Number.prototype The initial value of Number.prototype is the Number prototype object (section  REF _Ref424536060 \r \h 15.7.4). This property has the attributes { DontEnum, DontDelete, ReadOnly }. Number.MAX_VALUE The value of Number.MAX_VALUE is the largest positive finite value of the number type, which is approximately 1.7976931348623157(10308. This property has the attributes { DontEnum, DontDelete, ReadOnly }. Number.MIN_VALUE The value of Number.MIN_VALUE is the smallest positive value of the number type, which is approximately 5(10324. This property has the attributes { DontEnum, DontDelete, ReadOnly }. Number.NaN The value of Number.NaN is NaN. This property has the attributes { DontEnum, DontDelete, ReadOnly }. Number.NEGATIVE_INFINITY The value of Number.NEGATIVE_INFINITY is ((. This property has the attributes { DontEnum, DontDelete, ReadOnly }. Number.POSITIVE_INFINITY The value of Number.POSITIVE_INFINITY is +(. This property has the attributes { DontEnum, DontDelete, ReadOnly }. Properties of the Number Prototype Object The Number prototype object is itself a Number object (its [[Class]] is "Number") whose value is +0. The value of the internal [[Prototype]] property of the Number prototype object is the Object prototype object (section  REF _Ref424531384 \r \h 15.2.3.1). In following descriptions of functions that are properties of the Number prototype object, the phrase this Number object refers to the object that is the this value for the invocation of the function; a TypeError exception is thrown if the this value is not an object for which the value of the internal [[Class]] property is "Number". Also, the phrase this number value refers to the number value represented by this Number object, that is, the value of the internal [[Value]] property of this Number object. Number.prototype.constructor The initial value of Number.prototype.constructor is the built-in Number constructor. Number.prototype.toString (radix) If radix is the number 10 or undefined, then this number value is given as an argument to the ToString operator; the resulting string value is returned. If radix is an integer from 2 to 36, but not 10, the result is a string, the choice of which is implementation-dependent. The toString function is not generic; it throws a TypeError exception if its this value is not a Number object. Therefore, it cannot be transferred to other kinds of objects for use as a method. Number.prototype.toLocaleString() Produces a string value that represents the value of the Number formatted according to the conventions of the host environments current locale. This function is implementation-dependent, and it is permissible, but not encouraged, for it to return the same thing as toString. NOTE The first parameter to this function is likely to be used in a future version of this standard; it is recommended that implementations do not use this parameter position for anything else. Number.prototype.valueOf ( ) Returns this number value. The valueOf function is not generic; it throws a TypeError exception if its this value is not a Number object. Therefore, it cannot be transferred to other kinds of objects for use as a method. Number.prototype.toFixed (fractionDigits) Return a string containing the number represented in fixed-point notation with fractionDigits digits after the decimal point. If fractionDigits is undefined, 0 is assumed. Specifically, perform the following steps: Let f be ToInteger(fractionDigits). (If fractionDigits is undefined, this step produces the value 0). If f < 0 or f > 20, throw a RangeError exception. Let x be this number value. If x is NaN, return the string "NaN". Let s be the empty string. If x ( 0, go to step 9. Let s be "-". Let x = x. If x ( 1021, let m = ToString(x) and go to step 20. Let n be an integer for which the exact mathematical value of n ( 10f x is as close to zero as possible. If there are two such n, pick the larger n. If n = 0, let m be the string "0". Otherwise, let m be the string consisting of the digits of the decimal representation of n (in order, with no leading zeroes). If f = 0, go to step 20. Let k be the number of characters in m. If k > f, go to step 18. Let z be the string consisting of f+1k occurrences of the character 0. Let m be the concatenation of strings z and m. Let k = f + 1. Let a be the first kf characters of m, and let b be the remaining f characters of m. Let m be the concatenation of the three strings a, ".", and b. Return the concatenation of the strings s and m. The length property of the toFixed method is 1. If the toFixed method is called with more than one argument, then the behaviour is undefined (see section  REF _Ref457704028 \r \h 15). An implementation is permitted to extend the behaviour of toFixed for values of fractionDigits less than 0 or greater than 20. In this case toFixed would not necessarily throw RangeError for such values. NOTE The output of toFixed may be more precise than toString for some values because toString only prints enough significant digits to distinguish the number from adjacent number values. For example, (1000000000000000128).toString() returns "1000000000000000100", while (1000000000000000128).toFixed(0) returns "1000000000000000128". Number.prototype.toExponential (fractionDigits) Return a string containing the number represented in exponential notation with one digit before the significand's decimal point and fractionDigits digits after the significand's decimal point. If fractionDigits is undefined, include as many significand digits as necessary to uniquely specify the number (just like in ToString except that in this case the number is always output in exponential notation). Specifically, perform the following steps: Let x be this number value. Let f be ToInteger(fractionDigits). If x is NaN, return the string "NaN". Let s be the empty string. If x ( 0, go to step 8. Let s be "-". Let x = x. If x = +(, let m = "Infinity" and go to step 30. If fractionDigits is undefined, go to step 14. If f < 0 or f > 20, throw a RangeError exception. If x = 0, go to step 16. Let e and n be integers such that 10f ( n < 10f+1 and for which the exact mathematical value of n ( 10ef x is as close to zero as possible. If there are two such sets of e and n, pick the e and n for which n ( 10ef is larger. Go to step 20. If x ( 0, go to step 19. Let f = 0. Let m be the string consisting of f+1 occurrences of the character 0. Let e = 0. Go to step 21. Let e, n, and f be integers such that f ( 0, 10f ( n < 10f+1, the number value for n ( 10ef is x, and f is as small as possible. Note that the decimal representation of n has f+1 digits, n is not divisible by 10, and the least significant digit of n is not necessarily uniquely determined by these criteria. Let m be the string consisting of the digits of the decimal representation of n (in order, with no leading zeroes). If f = 0, go to step 24. Let a be the first character of m, and let b be the remaining f characters of m. Let m be the concatenation of the three strings a, ".", and b. If e = 0, let c = "+" and d = "0" and go to step 29. If e > 0, let c = "+" and go to step 28. Let c = "-". Let e = e. Let d be the string consisting of the digits of the decimal representation of e (in order, with no leading zeroes). Let m be the concatenation of the four strings m, "e", c, and d. Return the concatenation of the strings s and m. The length property of the toExponential method is 1. If the toExponential method is called with more than one argument, then the behaviour is undefined (see section  REF _Ref457704028 \r \h 15). An implementation is permitted to extend the behaviour of toExponential for values of fractionDigits less than 0 or greater than 20. In this case toExponential would not necessarily throw RangeError for such values. NOTE For implementations that provide more accurate conversions than required by the rules above, it is recommended that the following alternative version of step 19 be used as a guideline: Let e, n, and f be integers such that f ( 0, 10f ( n < 10f+1, the number value for n ( 10ef is x, and f is as small as possible. If there are multiple possibilities for n, choose the value of n for which n ( 10ef is closest in value to x. If there are two such possible values of n, choose the one that is even. Number.prototype.toPrecision (precision) Return a string containing the number represented either in exponential notation with one digit before the significand's decimal point and precision1 digits after the significand's decimal point or in fixed notation with precision significant digits. If precision is undefined, call ToString (section  REF _Ref457790568 \r 9.8.1) instead. Specifically, perform the following steps: Let x be this number value. If precision is undefined, return ToString(x). Let p be ToInteger(precision). If x is NaN, return the string "NaN". Let s be the empty string. If x ( 0, go to step 9. Let s be "-". Let x = x. If x = +(, let m = "Infinity" and go to step 30. If p < 1 or p > 21, throw a RangeError exception. If x ( 0, go to step 15. Let m be the string consisting of p occurrences of the character 0. Let e = 0. Go to step 18. Let e and n be integers such that 10p1 ( n < 10p and for which the exact mathematical value of n ( 10ep+1 x is as close to zero as possible. If there are two such sets of e and n, pick the e and n for which n ( 10ep+1 is larger. Let m be the string consisting of the digits of the decimal representation of n (in order, with no leading zeroes). If e < 6 or e ( p, go to step 22. If e = p1, go to step 30. If e ( 0, let m be the concatenation of the first e+1 characters of m, the character ., and the remaining p (e+1) characters of m and go to step 30. Let m be the concatenation of the string "0.", (e+1) occurrences of the character 0, and the string m. Go to step 30. Let a be the first character of m, and let b be the remaining p1 characters of m. Let m be the concatenation of the three strings a, ".", and b. If e = 0, let c = "+" and d = "0" and go to step 29. If e > 0, let c = "+" and go to step 28. Let c = "-". Let e = e. Let d be the string consisting of the digits of the decimal representation of e (in order, with no leading zeroes). Let m be the concatenation of the four strings m, "e", c, and d. Return the concatenation of the strings s and m. The length property of the toPrecision method is 1. If the toPrecision method is called with more than one argument, then the behaviour is undefined (see section  REF _Ref457704028 \r \h 15). An implementation is permitted to extend the behaviour of toPrecision for values of precision less than 1 or greater than 21. In this case toPrecision would not necessarily throw RangeError for such values. Properties of Number Instances Number instances have no special properties beyond those inherited from the Number prototype object. The Math Object The Math object is a single object that has some named properties, some of which are functions. The value of the internal [[Prototype]] property of the Math object is the Object prototype object (section  REF _Ref424531384 \r \h 15.2.3.1). The value of the internal [[Class]] property of the Math object is "Math". The Math object does not have a [[Construct]] property; it is not possible to use the Math object as a constructor with the new operator. The Math object does not have a [[Call]] property; it is not possible to invoke the Math object as a function. NOTE In this specification, the phrase the number value for x has a technical meaning defined in section  REF _Ref424532158 \r \h  \* MERGEFORMAT 8.5. Value Properties of the Math Object E The number value for e, the base of the natural logarithms, which is approximately 2.7182818284590452354. This property has the attributes { DontEnum, DontDelete, ReadOnly }. LN10 The number value for the natural logarithm of 10, which is approximately 2.302585092994046. This property has the attributes { DontEnum, DontDelete, ReadOnly }. LN2 The number value for the natural logarithm of 2, which is approximately 0.6931471805599453. This property has the attributes { DontEnum, DontDelete, ReadOnly }. LOG2E The number value for the base-2 logarithm of e, the base of the natural logarithms; this value is approximately 1.4426950408889634. This property has the attributes { DontEnum, DontDelete, ReadOnly }. NOTE The value of Math.LOG2E is approximately the reciprocal of the value of Math.LN2. LOG10E The number value for the base-10 logarithm of e, the base of the natural logarithms; this value is approximately 0.4342944819032518. This property has the attributes { DontEnum, DontDelete, ReadOnly }. NOTE The value of Math.LOG10E is approximately the reciprocal of the value of Math.LN10. PI The number value for (, the ratio of the circumference of a circle to its diameter, which is approximately 3.1415926535897932. This property has the attributes { DontEnum, DontDelete, ReadOnly }. SQRT1_2 The number value for the square root of 1/2, which is approximately 0.7071067811865476. This property has the attributes { DontEnum, DontDelete, ReadOnly }. NOTE The value of Math.SQRT1_2 is approximately the reciprocal of the value of Math.SQRT2. SQRT2 The number value for the square root of 2, which is approximately 1.4142135623730951. This property has the attributes { DontEnum, DontDelete, ReadOnly }. Function Properties of the Math Object Every function listed in this section applies the ToNumber operator to each of its arguments (in left-to-right order if there is more than one) and then performs a computation on the resulting number value(s). In the function descriptions below, the symbols NaN, (0, +0, (( and +( refer to the number values described in section  REF _Ref424530687 \r \h 8.5. NOTE The behaviour of the functions acos, asin, atan, atan2, cos, exp, log, pow, sin, and sqrt is not precisely specified here except to require specific results for certain argument values that represent boundary cases of interest. For other argument values, these functions are intended to compute approximations to the results of familiar mathematical functions, but some latitude is allowed in the choice of approximation algorithms. The general intent is that an implementer should be able to use the same mathematical library for ECMAScript on a given hardware platform that is available to C programmers on that platform. Although the choice of algorithms is left to the implementation, it is recommended (but not specified by this standard) that implementations use the approximation algorithms for IEEE 754 arithmetic contained in fdlibm, the freely distributable mathematical library from Sun Microsystems ( HYPERLINK mailto:Fdlibm-comment@sunpro.eng.sun.com fdlibm-comment@sunpro.eng.sun.com). This specification also requires specific results for certain argument values that represent boundary cases of interest abs (x) Returns the absolute value of x; the result has the same magnitude as x but has positive sign. If x is NaN, the result is NaN. If x is (0, the result is +0. If x is ((, the result is +(. acos (x) Returns an implementation-dependent approximation to the arc cosine of x. The result is expressed in radians and ranges from +0 to +(. If x is NaN, the result is NaN. If x is greater than 1, the result is NaN. If x is less than (1, the result is NaN. If x is exactly 1, the result is +0. asin (x) Returns an implementation-dependent approximation to the arc sine of x. The result is expressed in radians and ranges from ((/2 to +(/2. If x is NaN, the result is NaN. If x is greater than 1, the result is NaN. If x is less than 1, the result is NaN. If x is +0, the result is +0. If x is (0, the result is (0. atan (x) Returns an implementation-dependent approximation to the arc tangent of x. The result is expressed in radians and ranges from ((/2 to +(/2. If x is NaN, the result is NaN. If x is +0, the result is +0. If x is (0, the result is (0. If x is +(, the result is an implementation-dependent approximation to +(/2. If x is ((, the result is an implementation-dependent approximation to ((/2. atan2 (y, x) Returns an implementation-dependent approximation to the arc tangent of the quotient y/x of the arguments y and x, where the signs of y and x are used to determine the quadrant of the result. Note that it is intentional and traditional for the two-argument arc tangent function that the argument named y be first and the argument named x be second. The result is expressed in radians and ranges from (( to +(. If either x or y is NaN, the result is NaN. If y>0 and x is +0, the result is an implementation-dependent approximation to +(/2. If y>0 and x is (0, the result is an implementation-dependent approximation to +(/2. If y is +0 and x>0, the result is +0. If y is +0 and x is +0, the result is +0. If y is +0 and x is (0, the result is an implementation-dependent approximation to +(. If y is +0 and x<0, the result is an implementation-dependent approximation to +(. If y is (0 and x>0, the result is (0. If y is (0 and x is +0, the result is (0. If y is (0 and x is (0, the result is an implementation-dependent approximation to ((. If y is (0 and x<0, the result is an implementation-dependent approximation to ((. If y<0 and x is +0, the result is an implementation-dependent approximation to ((/2. If y<0 and x is (0, the result is an implementation-dependent approximation to ((/2. If y>0 and y is finite and x is +(, the result is +0. If y>0 and y is finite and x is ((, the result if an implementation-dependent approximation to +(. If y<0 and y is finite and x is +(, the result is (0. If y<0 and y is finite and x is ((, the result is an implementation-dependent approximation to ((. If y is +( and x is finite, the result is an implementation-dependent approximation to +(/2. If y is (( and x is finite, the result is an implementation-dependent approximation to ((/2. If y is +( and x is +(, the result is an implementation-dependent approximation to +(/4. If y is +( and x is ((, the result is an implementation-dependent approximation to +3(/4. If y is (( and x is +(, the result is an implementation-dependent approximation to ((/4. If y is (( and x is ((, the result is an implementation-dependent approximation to (3(/4. ceil (x) Returns the smallest (closest to (() number value that is not less than x and is equal to a mathematical integer. If x is already an integer, the result is x. If x is NaN, the result is NaN. If x is +0, the result is +0. If x is (0, the result is (0. If x is +(, the result is +(. If x is ((, the result is ((. If x is less than 0 but greater than -1, the result is (0. The value of Math.ceil(x) is the same as the value of -Math.floor(-x). cos (x) Returns an implementation-dependent approximation to the cosine of x. The argument is expressed in radians. If x is NaN, the result is NaN. If x is +0, the result is 1. If x is (0, the result is 1. If x is +(, the result is NaN. If x is ((, the result is NaN. exp (x) Returns an implementation-dependent approximation to the exponential function of x (e raised to the power of x, where e is the base of the natural logarithms). If x is NaN, the result is NaN. If x is +0, the result is 1. If x is (0, the result is 1. If x is +(, the result is +(. If x is ((, the result is +0. floor (x) Returns the greatest (closest to +() number value that is not greater than x and is equal to a mathematical integer. If x is already an integer, the result is x. If x is NaN, the result is NaN. If x is +0, the result is +0. If x is (0, the result is (0. If x is +(, the result is +(. If x is ((, the result is ((. If x is greater than 0 but less than 1, the result is +0. NOTE The value of Math.floor(x) is the same as the value of -Math.ceil(-x). log (x) Returns an implementation-dependent approximation to the natural logarithm of x. If x is NaN, the result is NaN. If x is less than 0, the result is NaN. If x is +0 or (0, the result is ((. If x is 1, the result is +0. If x is +(, the result is +(. max ( [ value1 [ , value2 [ , ] ] ] ) Given zero or more arguments, calls ToNumber on each of the arguments and returns the largest of the resulting values. If no arguments are given, the result is ((. If any value is NaN, the result is NaN. The comparison of values to determine the largest value is done as in section  REF _Ref424668059 \r \h 11.8.5 except that +0 is considered to be larger than (0. The length property of the max method is 2. min ( [ value1 [ , value2 [ , ] ] ] ) Given zero or more arguments, calls ToNumber on each of the arguments and returns the smallest of the resulting values. If no arguments are given, the result is +(. If any value is NaN, the result is NaN. The comparison of values to determine the smallest value is done as in section  REF _Ref424668059 \r \h 11.8.5 except that +0 is considered to be larger than (0. The length property of the min method is 2. pow (x, y) Returns an implementation-dependent approximation to the result of raising x to the power y. If y is NaN, the result is NaN. If y is +0, the result is 1, even if x is NaN. If y is (0, the result is 1, even if x is NaN. If x is NaN and y is nonzero, the result is NaN. If abs(x)>1 and y is +(, the result is +(. If abs(x)>1 and y is ((, the result is +0. If abs(x)==1 and y is +(, the result is NaN. If abs(x)==1 and y is ((, the result is NaN. If abs(x)<1 and y is +(, the result is +0. If abs(x)<1 and y is ((, the result is +(. If x is +( and y>0, the result is +(. If x is +( and y<0, the result is +0. If x is (( and y>0 and y is an odd integer, the result is ((. If x is (( and y>0 and y is not an odd integer, the result is +(. If x is (( and y<0 and y is an odd integer, the result is (0. If x is (( and y<0 and y is not an odd integer, the result is +0. If x is +0 and y>0, the result is +0. If x is +0 and y<0, the result is +(. If x is (0 and y>0 and y is an odd integer, the result is (0. If x is (0 and y>0 and y is not an odd integer, the result is +0. If x is (0 and y<0 and y is an odd integer, the result is ((. If x is (0 and y<0 and y is not an odd integer, the result is +(. If x<0 and x is finite and y is finite and y is not an integer, the result is NaN. random ( ) Returns a number value with positive sign, greater than or equal to 0 but less than 1, chosen randomly or pseudo randomly with approximately uniform distribution over that range, using an implementation-dependent algorithm or strategy. This function takes no arguments. round (x) Returns the number value that is closest to x and is equal to a mathematical integer. If two integer number values are equally close to x, then the result is the number value that is closer to +(. If x is already an integer, the result is x. If x is NaN, the result is NaN. If x is +0, the result is +0. If x is (0, the result is (0. If x is +(, the result is +(. If x is ((, the result is ((. If x is greater than 0 but less than 0.5, the result is +0. If x is less than 0 but greater than or equal to -0.5, the result is (0. NOTE Math.round(3.5) returns 4, but Math.round(3.5) returns 3. NOTE The value of Math.round(x) is the same as the value of Math.floor(x+0.5), except when x is (0 or is less than 0 but greater than or equal to -0.5; for these cases Math.round(x) returns (0, but Math.floor(x+0.5) returns +0. sin (x) Returns an implementation-dependent approximation to the sine of x. The argument is expressed in radians. If x is NaN, the result is NaN. If x is +0, the result is +0. If x is (0, the result is (0. If x is +( or ((, the result is NaN. sqrt (x) Returns an implementation-dependent approximation to the square root of x. If x is NaN, the result is NaN. If x less than 0, the result is NaN. If x is +0, the result is +0. If x is (0, the result is (0. If x is +(, the result is +(. tan (x) Returns an implementation-dependent approximation to the tangent of x. The argument is expressed in radians. If x is NaN, the result is NaN. If x is +0, the result is +0. If x is (0, the result is (0. If x is +( or ((, the result is NaN. Date Objects Overview of Date Objects and Definitions of Internal Operators A Date object contains a number indicating a particular instant in time to within a millisecond. The number may also be NaN, indicating that the Date object does not represent a specific instant of time. The following sections define a number of functions for operating on time values. Note that, in every case, if any argument to such a function is NaN, the result will be NaN. Time Range Time is measured in ECMAScript in milliseconds since 01 January, 1970 UTC. Leap seconds are ignored. It is assumed that there are exactly 86,400,000 milliseconds per day. ECMAScript number values can represent all integers from 9,007,199,254,740,991 to 9,007,199,254,740,991; this range suffices to measure times to millisecond precision for any instant that is within approximately 285,616 years, either forward or backward, from 01 January, 1970 UTC. The actual range of times supported by ECMAScript Date objects is slightly smaller: exactly 100,000,000 days to 100,000,000 days measured relative to midnight at the beginning of 01 January, 1970 UTC. This gives a range of 8,640,000,000,000,000 milliseconds to either side of 01 January, 1970 UTC. The exact moment of midnight at the beginning of 01 January, 1970 UTC is represented by the value +0. Day Number and Time within Day A given time value t belongs to day number Day(t) = floor(t / msPerDay) where the number of milliseconds per day is msPerDay = 86400000 The remainder is called the time within the day: TimeWithinDay(t) = t modulo msPerDay Year Number ECMAScript uses an extrapolated Gregorian system to map a day number to a year number and to determine the month and date within that year. In this system, leap years are precisely those which are (divisible by 4) and ((not divisible by 100) or (divisible by 400)). The number of days in year number y is therefore defined by DaysInYear(y) = 365 if (y modulo 4) ( 0 = 366 if (y modulo 4) = 0 and (y modulo 100) ( 0 = 365 if (y modulo 100) = 0 and (y modulo 400) ( 0 = 366 if (y modulo 400) = 0 All non-leap years have 365 days with the usual number of days per month and leap years have an extra day in February. The day number of the first day of year y is given by: DayFromYear(y) = 365 ( (y(1970) + floor((y(1969)/4) ( floor((y(1901)/100) + floor((y(1601)/400) The time value of the start of a year is: TimeFromYear(y) = msPerDay ( DayFromYear(y) A time value determines a year by: YearFromTime(t) = the largest integer y (closest to positive infinity) such that TimeFromYear(y) ( t The leap-year function is 1 for a time within a leap year and otherwise is zero: InLeapYear(t) = 0 if DaysInYear(YearFromTime(t)) = 365 = 1 if DaysInYear(YearFromTime(t)) = 366 Month Number Months are identified by an integer in the range 0 to 11, inclusive. The mapping MonthFromTime(t) from a time value t to a month number is defined by: MonthFromTime(t) = 0 if 0 ( DayWithinYear(t) < 31 = 1 if 31 ( DayWithinYear (t) < 59+InLeapYear(t) = 2 if 59+InLeapYear(t) ( DayWithinYear (t) < 90+InLeapYear(t) = 3 if 90+InLeapYear(t) ( DayWithinYear (t) < 120+InLeapYear(t) = 4 if 120+InLeapYear(t) ( DayWithinYear (t) < 151+InLeapYear(t) = 5 if 151+InLeapYear(t) ( DayWithinYear (t) < 181+InLeapYear(t) = 6 if 181+InLeapYear(t) ( DayWithinYear (t) < 212+InLeapYear(t) = 7 if 212+InLeapYear(t) ( DayWithinYear (t) < 243+InLeapYear(t) = 8 if 243+InLeapYear(t) ( DayWithinYear (t) < 273+InLeapYear(t) = 9 if 273+InLeapYear(t) ( DayWithinYear (t) < 304+InLeapYear(t) = 10 if 304+InLeapYear(t) ( DayWithinYear (t) < 334+InLeapYear(t) = 11 if 334+InLeapYear(t) ( DayWithinYear (t) < 365+InLeapYear(t) where DayWithinYear(t) = Day(t)(DayFromYear(YearFromTime(t)) A month value of 0 specifies January; 1 specifies February; 2 specifies March; 3 specifies April; 4specifies May; 5 specifies June; 6 specifies July; 7 specifies August; 8 specifies September; 9 specifies October; 10 specifies November; and 11 specifies December. Note that MonthFromTime(0) = 0, corresponding to Thursday, 01 January, 1970. Date Number A date number is identified by an integer in the range 1 through 31, inclusive. The mapping DateFromTime(t) from a time value t to a month number is defined by: DateFromTime(t) = DayWithinYear(t)+1 if MonthFromTime(t)=0 = DayWithinYear(t)(30 if MonthFromTime(t)=1 = DayWithinYear(t)(58(InLeapYear(t) if MonthFromTime(t)=2 = DayWithinYear(t)(89(InLeapYear(t) if MonthFromTime(t)=3 = DayWithinYear(t)(119(InLeapYear(t) if MonthFromTime(t)=4 = DayWithinYear(t)(150(InLeapYear(t) if MonthFromTime(t)=5 = DayWithinYear(t)(180(InLeapYear(t) if MonthFromTime(t)=6 = DayWithinYear(t)(211(InLeapYear(t) if MonthFromTime(t)=7 = DayWithinYear(t)(242(InLeapYear(t) if MonthFromTime(t)=8 = DayWithinYear(t)(272(InLeapYear(t) if MonthFromTime(t)=9 = DayWithinYear(t)(303(InLeapYear(t) if MonthFromTime(t)=10 = DayWithinYear(t)(333(InLeapYear(t) if MonthFromTime(t)=11 Week Day The weekday for a particular time value t is defined as WeekDay(t) = (Day(t) + 4) modulo 7 A weekday value of 0 specifies Sunday; 1 specifies Monday; 2 specifies Tuesday; 3 specifies Wednesday; 4specifies Thursday; 5 specifies Friday; and 6 specifies Saturday. Note that WeekDay(0) = 4, corresponding to Thursday, 01 January, 1970. Local Time Zone Adjustment An implementation of ECMAScript is expected to determine the local time zone adjustment. The local time zone adjustment is a value LocalTZA measured in milliseconds which when added to UTC represents the local standard time. Daylight saving time is not reflected by LocalTZA. The value LocalTZA does not vary with time but depends only on the geographic location. Daylight Saving Time Adjustment An implementation of ECMAScript is expected to determine the daylight saving time algorithm. The algorithm to determine the daylight saving time adjustment DaylightSavingTA(t), measured in milliseconds, must depend only on four things: (1) the time since the beginning of the year t TimeFromYear(YearFromTime(t)) (2) whether t is in a leap year InLeapYear(t) (3) the week day of the beginning of the year WeekDay(TimeFromYear(YearFromTime(t)) and (4) the geographic location. The implementation of ECMAScript should not try to determine whether the exact time was subject to daylight saving time, but just whether daylight saving time would have been in effect if the current daylight saving time algorithm had been used at the time. This avoids complications such as taking into account the years that the locale observed daylight saving time year round. If the host environment provides functionality for determining daylight saving time, the implementation of ECMAScript is free to map the year in question to an equivalent year (same leap-year-ness and same starting week day for the year) for which the host environment provides daylight saving time information. The only restriction is that all equivalent years should produce the same result. Local Time Conversion from UTC to local time is defined by LocalTime(t) = t + LocalTZA + DaylightSavingTA(t) Conversion from local time to UTC is defined by UTC(t) = t LocalTZA DaylightSavingTA(t LocalTZA) Note that UTC(LocalTime(t)) is not necessarily always equal to t. Hours, Minutes, Second, and Milliseconds The following functions are useful in decomposing time values: HourFromTime(t) = floor(t / msPerHour) modulo HoursPerDay MinFromTime(t) = floor(t / msPerMinute) modulo MinutesPerHour SecFromTime(t) = floor(t / msPerSecond) modulo SecondsPerMinute msFromTime(t) = t modulo msPerSecond where HoursPerDay = 24 MinutesPerHour = 60 SecondsPerMinute = 60 msPerSecond = 1000 msPerMinute = msPerSecond ( SecondsPerMinute = 60000 msPerHour = msPerMinute ( MinutesPerHour = 3600000 MakeTime (hour, min, sec, ms) The operator MakeTime calculates a number of milliseconds from its four arguments, which must be ECMAScript number values. This operator functions as follows: If hour is not finite or min is not finite or sec is not finite or ms is not finite, return NaN. Call ToInteger(hour). Call ToInteger(min). Call ToInteger(sec). Call ToInteger(ms). Compute Result(2) * msPerHour + Result(3) * msPerMinute + Result(4) * msPerSecond + Result(5), performing the arithmetic according to IEEE 754 rules (that is, as if using the ECMAScript operators * and +). Return Result(6). MakeDay (year, month, date) The operator MakeDay calculates a number of days from its three arguments, which must be ECMAScript number values. This operator functions as follows: If year is not finite or month is not finite or date is not finite, return NaN. Call ToInteger(year). Call ToInteger(month). Call ToInteger(date). Compute Result(2) + floor(Result(3)/12). Compute Result(3) modulo 12. Find a value t such that YearFromTime(t) == Result(5) and MonthFromTime(t) == Result(6) and DateFromTime(t) == 1; but if this is not possible (because some argument is out of range), return NaN. Compute Day(Result(7)) + Result(4) ( 1. Return Result(8). MakeDate (day, time) The operator MakeDate calculates a number of milliseconds from its two arguments, which must be ECMAScript number values. This operator functions as follows: If day is not finite or time is not finite, return NaN. Compute day ( msPerDay + time. Return Result(2). TimeClip (time) The operator TimeClip calculates a number of milliseconds from its argument, which must be an ECMAScript number value. This operator functions as follows: If time is not finite, return NaN. If abs(Result(1)) > 8.64x1015, return NaN. Return an implementation-dependent choice of either ToInteger(Result(2)) or ToInteger(Result(2)) + (+0). (Adding a positive zero converts (0 to +0.) NOTE The point of step 3 is that an implementation is permitted a choice of internal representations of time values, for example as a 64-bit signed integer or as a 64-bit floating-point value. Depending on the implementation, this internal representation may or may not distinguish (0 and +0. The Date Constructor Called as a Function When Date is called as a function rather than as a constructor, it returns a string representing the current time (UTC). NOTE The function call Date() is not equivalent to the object creation expression newDate() with the same arguments. Date ( [ year [, month [, date [, hours [, minutes [, seconds [, ms ] ] ] ] ] ] ] ) All of the arguments are optional; any arguments supplied are accepted but are completely ignored. A string is created and returned as if by the expression (new Date()).toString(). The Date Constructor When Date is called as part of a new expression, it is a constructor: it initialises the newly created object. new Date (year, month [, date [, hours [, minutes [, seconds [, ms ] ] ] ] ] ) When Date is called with two to seven arguments, it computes the date from year, month, and (optionally) date, hours, minutes, seconds and ms. The [[Prototype]] property of the newly constructed object is set to the original Date prototype object, the one that is the initial value of Date.prototype (section  REF _Ref424534620 \r \h 15.9.4.1). The [[Class]] property of the newly constructed object is set to "Date". The [[Value]] property of the newly constructed object is set as follows: Call ToNumber(year). Call ToNumber(month). If date is supplied use ToNumber(date); else use 1. If hours is supplied use ToNumber(hours); else use 0. If minutes is supplied use ToNumber(minutes); else use 0. If seconds is supplied use ToNumber(seconds); else use 0. If ms is supplied use ToNumber(ms); else use 0. If Result(1) is not NaN and 0 ( ToInteger(Result(1)) ( 99, Result(8) is 1900+ToInteger(Result(1)); otherwise, Result(8) is Result(1). Compute MakeDay(Result(8), Result(2), Result(3)). Compute MakeTime(Result(4), Result(5), Result(6), Result(7)). Compute MakeDate(Result(9), Result(10)). Set the [[Value]] property of the newly constructed object to TimeClip(UTC(Result(11))). new Date (value) The [[Prototype]] property of the newly constructed object is set to the original Date prototype object, the one that is the initial value of Date.prototype (section  REF _Ref424534620 \r \h 15.9.4.1). The [[Class]] property of the newly constructed object is set to "Date". The [[Value]] property of the newly constructed object is set as follows: Call ToPrimitive(value). If Type(Result(1)) is String, then go to step 5. Let V be ToNumber(Result(1)). Set the [[Value]] property of the newly constructed object to TimeClip(V) and return. Parse Result(1) as a date, in exactly the same manner as for the parse method (section  REF _Ref424536114 \r \h 15.9.4.2); let V be the time value for this date. Go to step 4. new Date ( ) The [[Prototype]] property of the newly constructed object is set to the original Date prototype object, the one that is the initial value of Date.prototype (section  REF _Ref424534620 \r \h 15.9.4.1). The [[Class]] property of the newly constructed object is set to "Date". The [[Value]] property of the newly constructed object is set to the current time (UTC). Properties of the Date Constructor The value of the internal [[Prototype]] property of the Date constructor is the Function prototype object (section  REF _Ref424534100 \r \h 15.3.4). Besides the internal properties and the length property (whose value is 7), the Date constructor has the following properties: Date.prototype The initial value of Date.prototype is the built-in Date prototype object (section  REF _Ref424536220 \r \h 15.9.5). This property has the attributes { DontEnum, DontDelete, ReadOnly }. Date.parse (string) The parse function applies the ToString operator to its argument and interprets the resulting string as a date; it returns a number, the UTC time value corresponding to the date. The string may be interpreted as a local time, a UTC time, or a time in some other time zone, depending on the contents of the string. If x is any Date object whose milliseconds amount is zero within a particular implementation of ECMAScript, then all of the following expressions should produce the same numeric value in that implementation, if all the properties referenced have their initial values: x.valueOf() Date.parse(x.toString()) Date.parse(x.toUTCString()) However, the expression Date.parse(x.toLocaleString()) is not required to produce the same number value as the preceding three expressions and, in general, the value produced by Date.parse is implementation-dependent when given any string value that could not be produced in that implementation by the toString or toUTCString method. Date.UTC (year, month [, date [, hours [, minutes [, seconds [, ms ] ] ] ] ] ) When the UTC function is called with fewer than two arguments, the behaviour is implementation-dependent. When the UTC function is called with two to seven arguments, it computes the date from year, month and (optionally) date, hours, minutes, seconds and ms. The following steps are taken: Call ToNumber(year). Call ToNumber(month). If date is supplied use ToNumber(date); else use 1. If hours is supplied use ToNumber(hours); else use 0. If minutes is supplied use ToNumber(minutes); else use 0. If seconds is supplied use ToNumber(seconds); else use 0. If ms is supplied use ToNumber(ms); else use 0. If Result(1) is not NaN and 0 ( ToInteger(Result(1)) ( 99, Result(8) is 1900+ToInteger(Result(1)); otherwise, Result(8) is Result(1). Compute MakeDay(Result(8), Result(2), Result(3)). Compute MakeTime(Result(4), Result(5), Result(6), Result(7)). Return TimeClip(MakeDate(Result(9), Result(10))). The length property of the UTC function is 7. NOTE The UTC function differs from the Date constructor in two ways: it returns a time value as a number, rather than creating a Date object, and it interprets the arguments in UTC rather than as local time. Properties of the Date Prototype Object The Date prototype object is itself a Date object (its [[Class]] is "Date") whose value is NaN. The value of the internal [[Prototype]] property of the Date prototype object is the Object prototype object (section  REF _Ref424531384 \r \h 15.2.3.1). In following descriptions of functions that are properties of the Date prototype object, the phrase this Date object refers to the object that is the this value for the invocation of the function. None of these functions are generic; a TypeError exception is thrown if the this value is not an object for which the value of the internal [[Class]] property is "Date". Also, the phrase this time value refers to the number value for the time represented by this Date object, that is, the value of the internal [[Value]] property of this Date object. Date.prototype.constructor The initial value of Date.prototype.constructor is the built-in Date constructor. Date.prototype.toString ( ) This function returns a string value. The contents of the string are implementation-dependent, but are intended to represent the Date in the current time zone in a convenient, human-readable form. NOTE It is intended that for any Date value d, the result of Date.prototype.parse(d.toString()) (section  REF _Ref424536114 \r \h 15.9.4.2) is equal to d. Date.prototype.toDateString ( ) This function returns a string value. The contents of the string are implementation-dependent, but are intended to represent the date portion of the Date in the current time zone in a convenient, human-readable form. Date.prototype.toTimeString ( ) This function returns a string value. The contents of the string are implementation-dependent, but are intended to represent the time portion of the Date in the current time zone in a convenient, human-readable form. Date.prototype.toLocaleString ( ) This function returns a string value. The contents of the string are implementation-dependent, but are intended to represent the Date in the current time zone in a convenient, human-readable form that corresponds to the conventions of the host environments current locale. NOTE The first parameter to this function is likely to be used in a future version of this standard; it is recommended that implementations do not use this parameter position for anything else. Date.prototype.toLocaleDateString ( ) This function returns a string value. The contents of the string are implementation-dependent, but are intended to represent the date portion of the Date in the current time zone in a convenient, human-readable form that corresponds to the conventions of the host environments current locale. NOTE The first parameter to this function is likely to be used in a future version of this standard; it is recommended that implementations do not use this parameter position for anything else. Date.prototype.toLocaleTimeString ( ) This function returns a string value. The contents of the string are implementation-dependent, but are intended to represent the time portion of the Date in the current time zone in a convenient, human-readable form that corresponds to the conventions of the host environments current locale. NOTE The first parameter to this function is likely to be used in a future version of this standard; it is recommended that implementations do not use this parameter position for anything else. Date.prototype.valueOf ( ) The valueOf function returns a number, which is this time value. Date.prototype.getTime ( ) If the this value is not an object whose [[Class]] property is "Date", throw a TypeError exception. Return this time value. Date.prototype.getFullYear ( ) Let t be this time value. If t is NaN, return NaN. Return YearFromTime(LocalTime(t)). Date.prototype.getUTCFullYear ( ) Let t be this time value. If t is NaN, return NaN. Return YearFromTime(t). Date.prototype.getMonth ( ) Let t be this time value. If t is NaN, return NaN. Return MonthFromTime(LocalTime(t)). Date.prototype.getUTCMonth ( ) Let t be this time value. If t is NaN, return NaN. Return MonthFromTime(t). Date.prototype.getDate ( ) Let t be this time value. If t is NaN, return NaN. Return DateFromTime(LocalTime(t)). Date.prototype.getUTCDate ( ) Let t be this time value. If t is NaN, return NaN. Return DateFromTime(t). Date.prototype.getDay ( ) Let t be this time value. If t is NaN, return NaN. Return WeekDay(LocalTime(t)). Date.prototype.getUTCDay ( ) Let t be this time value. If t is NaN, return NaN. Return WeekDay(t). Date.prototype.getHours ( ) Let t be this time value. If t is NaN, return NaN. Return HourFromTime(LocalTime(t)). Date.prototype.getUTCHours ( ) Let t be this time value. If t is NaN, return NaN. Return HourFromTime(t). Date.prototype.getMinutes ( ) Let t be this time value. If t is NaN, return NaN. Return MinFromTime(LocalTime(t)). Date.prototype.getUTCMinutes ( ) Let t be this time value. If t is NaN, return NaN. Return MinFromTime(t). Date.prototype.getSeconds ( ) Let t be this time value. If t is NaN, return NaN. Return SecFromTime(LocalTime(t)). Date.prototype.getUTCSeconds ( ) Let t be this time value. If t is NaN, return NaN. Return SecFromTime(t). Date.prototype.getMilliseconds ( ) Let t be this time value. If t is NaN, return NaN. Return msFromTime(LocalTime(t)). Date.prototype.getUTCMilliseconds ( ) Let t be this time value. If t is NaN, return NaN. Return msFromTime(t). Date.prototype.getTimezoneOffset ( ) Returns the difference between local time and UTC time in minutes. Let t be this time value. If t is NaN, return NaN. Return (t ( LocalTime(t)) / msPerMinute. Date.prototype.setTime (time) If the this value is not a Date object, throw a TypeError exception. Call ToNumber(time). Call TimeClip(Result(1)). Set the [[Value]] property of the this value to Result(2). Return the value of the [[Value]] property of the this value. Date.prototype.setMilliseconds (ms) Let t be the result of LocalTime(this time value). Call ToNumber(ms). Compute MakeTime(HourFromTime(t), MinFromTime(t), SecFromTime(t), Result(2)). Compute UTC(MakeDate(Day(t), Result(3))). Set the [[Value]] property of the this value to TimeClip(Result(4)). Return the value of the [[Value]] property of the this value. Date.prototype.setUTCMilliseconds (ms) Let t be this time value. Call ToNumber(ms). Compute MakeTime(HourFromTime(t), MinFromTime(t), SecFromTime(t), Result(2)). Compute MakeDate(Day(t), Result(3)). Set the [[Value]] property of the this value to TimeClip(Result(4)). Return the value of the [[Value]] property of the this value. Date.prototype.setSeconds (sec [, ms ] ) If ms is not specified, this behaves as if ms were specified with the value getMilliseconds( ). Let t be the result of LocalTime(this time value). Call ToNumber(sec). If ms is not specified, compute msFromTime(t); otherwise, call ToNumber(ms). Compute MakeTime(HourFromTime(t), MinFromTime(t), Result(2), Result(3)). Compute UTC(MakeDate(Day(t), Result(4))). Set the [[Value]] property of the this value to TimeClip(Result(5)). Return the value of the [[Value]] property of the this value. The length property of the setSeconds method is 2. Date.prototype.setUTCSeconds (sec [, ms ] ) If ms is not specified, this behaves as if ms were specified with the value getUTCMilliseconds( ). Let t be this time value. Call ToNumber(sec). If ms is not specified, compute msFromTime(t); otherwise, call ToNumber(ms). Compute MakeTime(HourFromTime(t), MinFromTime(t), Result(2), Result(3)). Compute MakeDate(Day(t), Result(4)). Set the [[Value]] property of the this value to TimeClip(Result(5)). Return the value of the [[Value]] property of the this value. The length property of the setUTCSeconds method is 2. Date.prototype.setMinutes (min [, sec [, ms ] ] ) If sec is not specified, this behaves as if sec were specified with the value getSeconds( ). If ms is not specified, this behaves as if ms were specified with the value getMilliseconds( ). Let t be the result of LocalTime(this time value). Call ToNumber(min). If sec is not specified, compute SecFromTime(t); otherwise, call ToNumber(sec). If ms is not specified, compute msFromTime(t); otherwise, call ToNumber(ms). Compute MakeTime(HourFromTime(t), Result(2), Result(3), Result(4)). Compute UTC(MakeDate(Day(t), Result(5))). Set the [[Value]] property of the this value to TimeClip(Result(6)). Return the value of the [[Value]] property of the this value. The length property of the setMinutes method is 3. Date.prototype.setUTCMinutes (min [, sec [, ms ] ] ) If sec is not specified, this behaves as if sec were specified with the value getUTCSeconds( ). If ms is not specified, this behaves as if ms were specified with the value getUTCMilliseconds( ). Let t be this time value. Call ToNumber(min). If sec is not specified, compute SecFromTime(t); otherwise, call ToNumber(sec). If ms is not specified, compute msFromTime(t); otherwise, call ToNumber(ms). Compute MakeTime(HourFromTime(t), Result(2), Result(3), Result(4)). Compute MakeDate(Day(t), Result(5)). Set the [[Value]] property of the this value to TimeClip(Result(6)). Return the value of the [[Value]] property of the this value. The length property of the setUTCMinutes method is 3. Date.prototype.setHours (hour [, min [, sec [, ms ] ] ] ) If min is not specified, this behaves as if min were specified with the value getMinutes( ). If sec is not specified, this behaves as if sec were specified with the value getSeconds( ). If ms is not specified, this behaves as if ms were specified with the value getMilliseconds( ). Let t be the result of LocalTime(this time value). Call ToNumber(hour). If min is not specified, compute MinFromTime(t); otherwise, call ToNumber(min). If sec is not specified, compute SecFromTime(t); otherwise, call ToNumber(sec). If ms is not specified, compute msFromTime(t); otherwise, call ToNumber(ms). Compute MakeTime(Result(2), Result(3), Result(4), Result(5)). Compute UTC(MakeDate(Day(t), Result(6))). Set the [[Value]] property of the this value to TimeClip(Result(7)). Return the value of the [[Value]] property of the this value. The length property of the setHours method is 4. Date.prototype.setUTCHours (hour [, min [, sec [, ms ] ] ] ) If min is not specified, this behaves as if min were specified with the value getUTCMinutes( ). If sec is not specified, this behaves as if sec were specified with the value getUTCSeconds( ). If ms is not specified, this behaves as if ms were specified with the value getUTCMilliseconds( ). Let t be this time value. Call ToNumber(hour). If min is not specified, compute MinFromTime(t); otherwise, call ToNumber(min). If sec is not specified, compute SecFromTime(t); otherwise, call ToNumber(sec). If ms is not specified, compute msFromTime(t); otherwise, call ToNumber(ms). Compute MakeTime(Result(2), Result(3), Result(4), Result(5)). Compute MakeDate(Day(t), Result(6)). Set the [[Value]] property of the this value to TimeClip(Result(7)). Return the value of the [[Value]] property of the this value. The length property of the setUTCHours method is 4. Date.prototype.setDate (date) Let t be the result of LocalTime(this time value). Call ToNumber(date). Compute MakeDay(YearFromTime(t), MonthFromTime(t), Result(2)). Compute UTC(MakeDate(Result(3), TimeWithinDay(t))). Set the [[Value]] property of the this value to TimeClip(Result(4)). Return the value of the [[Value]] property of the this value. Date.prototype.setUTCDate (date) Let t be this time value. Call ToNumber(date). Compute MakeDay(YearFromTime(t), MonthFromTime(t), Result(2)). Compute MakeDate(Result(3), TimeWithinDay(t)). Set the [[Value]] property of the this value to TimeClip(Result(4)). Return the value of the [[Value]] property of the this value. Date.prototype.setMonth (month [, date ] ) If date is not specified, this behaves as if date were specified with the value getDate( ). Let t be the result of LocalTime(this time value). Call ToNumber(month). If date is not specified, compute DateFromTime(t); otherwise, call ToNumber(date). Compute MakeDay(YearFromTime(t), Result(2), Result(3)). Compute UTC(MakeDate(Result(4), TimeWithinDay(t))). Set the [[Value]] property of the this value to TimeClip(Result(5)). Return the value of the [[Value]] property of the this value. The length property of the setMonth method is 2. Date.prototype.setUTCMonth (month [, date ] ) If date is not specified, this behaves as if date were specified with the value getUTCDate( ). Let t be this time value. Call ToNumber(month). If date is not specified, compute DateFromTime(t); otherwise, call ToNumber(date). Compute MakeDay(YearFromTime(t), Result(2), Result(3)). Compute MakeDate(Result(4), TimeWithinDay(t)). Set the [[Value]] property of the this value to TimeClip(Result(5)). Return the value of the [[Value]] property of the this value. The length property of the setUTCMonth method is 2. Date.prototype.setFullYear (year [, month [, date ] ] ) If month is not specified, this behaves as if month were specified with the value getMonth( ). If date is not specified, this behaves as if date were specified with the value getDate( ). Let t be the result of LocalTime(this time value); but if this time value is NaN, let t be +0. Call ToNumber(year). If month is not specified, compute MonthFromTime(t); otherwise, call ToNumber(month). If date is not specified, compute DateFromTime(t); otherwise, call ToNumber(date). Compute MakeDay(Result(2), Result(3), Result(4)). Compute UTC(MakeDate(Result(5), TimeWithinDay(t))). Set the [[Value]] property of the this value to TimeClip(Result(6)). Return the value of the [[Value]] property of the this value. The length property of the setFullYear method is 3. Date.prototype.setUTCFullYear (year [, month [, date ] ] ) If month is not specified, this behaves as if month were specified with the value getUTCMonth( ). If date is not specified, this behaves as if date were specified with the value getUTCDate( ). Let t be this time value; but if this time value is NaN, let t be +0. Call ToNumber(year). If month is not specified, compute MonthFromTime(t); otherwise, call ToNumber(month). If date is not specified, compute DateFromTime(t); otherwise, call ToNumber(date). Compute MakeDay(Result(2), Result(3), Result(4)). Compute MakeDate(Result(5), TimeWithinDay(t)). Set the [[Value]] property of the this value to TimeClip(Result(6)). Return the value of the [[Value]] property of the this value. The length property of the setUTCFullYear method is 3. Date.prototype.toUTCString ( ) This function returns a string value. The contents of the string are implementation-dependent, but are intended to represent the Date in a convenient, human-readable form in UTC. Properties of Date Instances Date instances have no special properties beyond those inherited from the Date prototype object. RegExp (Regular Expression) Objects A RegExp object contains a regular expression and the associated flags. NOTE The form and functionality of regular expressions is modelled after the regular expression facility in the Perl 5 programming language. Patterns The RegExp constructor applies the following grammar to the input pattern string. An error occurs if the grammar cannot interpret the string as an expansion of Pattern. Syntax Pattern :: Disjunction Disjunction :: Alternative Alternative | Disjunction Alternative :: [empty] Alternative Term Term :: Assertion Atom Atom Quantifier Assertion :: ^ $ \ b \ B Quantifier :: QuantifierPrefix QuantifierPrefix ? QuantifierPrefix :: * + ? { DecimalDigits } { DecimalDigits , } { DecimalDigits , DecimalDigits } Atom :: PatternCharacter . \ AtomEscape CharacterClass ( Disjunction ) ( ? : Disjunction ) ( ? = Disjunction ) ( ? ! Disjunction ) PatternCharacter :: SourceCharacter but not any of: ^ $ \ . * + ? ( ) [ ] { } | AtomEscape :: DecimalEscape CharacterEscape CharacterClassEscape CharacterEscape :: ControlEscape c ControlLetter HexEscapeSequence UnicodeEscapeSequence IdentityEscape ControlEscape :: one of f n r t v ControlLetter :: one of a b c d e f g h i j k l m n o p q r s t u v w x y z A B C D E F G H I J K L M N O P Q R S T U V W X Y Z IdentityEscape :: SourceCharacter but not IdentifierPart DecimalEscape :: DecimalIntegerLiteral [lookahead ( DecimalDigit] CharacterClassEscape :: one of d D s S w W CharacterClass :: [ [lookahead ( {^}] ClassRanges ] [ ^ ClassRanges ] ClassRanges :: [empty] NonemptyClassRanges NonemptyClassRanges :: ClassAtom ClassAtom NonemptyClassRangesNoDash ClassAtom - ClassAtom ClassRanges NonemptyClassRangesNoDash :: ClassAtom ClassAtomNoDash NonemptyClassRangesNoDash ClassAtomNoDash - ClassAtom ClassRanges ClassAtom :: - ClassAtomNoDash ClassAtomNoDash :: SourceCharacter but not one of \ ] - \ ClassEscape ClassEscape :: DecimalEscape b CharacterEscape CharacterClassEscape Pattern Semantics A regular expression pattern is converted into an internal function using the process described below. An implementation is encouraged to use more efficient algorithms than the ones listed below, as long as the results are the same. Notation The descriptions below use the following variables: Input is the string being matched by the regular expression pattern. The notation input[n] means the nth character of input, where n can range between 0 (inclusive) and InputLength (exclusive). InputLength is the number of characters in the Input string. NCapturingParens is the total number of left capturing parentheses (i.e. the total number of times the Atom :: ( Disjunction ) production is expanded) in the pattern. A left capturing parenthesis is any ( pattern character that is matched by the ( terminal of the Atom :: ( Disjunction ) production. IgnoreCase is the setting of the RegExp object's ignoreCase property. Multiline is the setting of the RegExp object's multiline property. Furthermore, the descriptions below use the following internal data structures: A CharSet is a mathematical set of characters. A State is an ordered pair (endIndex, captures) where endIndex is an integer and captures is an internal array of NCapturingParens values. States are used to represent partial match states in the regular expression matching algorithms. The endIndex is one plus the index of the last input character matched so far by the pattern, while captures holds the results of capturing parentheses. The nth element of captures is either a string that represents the value obtained by the nth set of capturing parentheses or undefined if the nth set of capturing parentheses hasn't been reached yet. Due to backtracking, many states may be in use at any time during the matching process. A MatchResult is either a State or the special token failure that indicates that the match failed. A Continuation function is an internal closure (i.e. an internal function with some arguments already bound to values) that takes one State argument and returns a MatchResult result. If an internal closure references variables bound in the function that creates the closure, the closure uses the values that these variables had at the time the closure was created. The continuation attempts to match the remaining portion (specified by the closure's already-bound arguments) of the pattern against the input string, starting at the intermediate state given by its State argument. If the match succeeds, the continuation returns the final State that it reached; if the match fails, the continuation returns failure. A Matcher function is an internal closure that takes two arguments -- a State and a Continuation -- and returns a MatchResult result. The matcher attempts to match a middle subpattern (specified by the closure's already-bound arguments) of the pattern against the input string, starting at the intermediate state given by its State argument. The Continuation argument should be a closure that matches the rest of the pattern. After matching the subpattern of a pattern to obtain a new State, the matcher then calls Continuation on that state to test if the rest of the pattern can match as well. If it can, the matcher returns the state returned by the continuation; if not, the matcher may try different choices at its choice points, repeatedly calling Continuation until it either succeeds or all possibilities have been exhausted. An AssertionTester function is an internal closure that takes a State argument and returns a boolean result. The assertion tester tests a specific condition (specified by the closure's already-bound arguments) against the current place in the input string and returns true if the condition matched or false if not. An EscapeValue is either a character or an integer. An EscapeValue is used to denote the interpretation of a DecimalEscape escape sequence: a character ch means that the escape sequence is interpreted as the character ch, while an integer n means that the escape sequence is interpreted as a backreference to the nth set of capturing parentheses. Pattern The production Pattern :: Disjunction evaluates as follows: Evaluate Disjunction to obtain a Matcher m. Return an internal closure that takes two arguments, a string str and an integer index, and performs the following: Let Input be the given string str. This variable will be used throughout the functions in section  REF _Ref455931092 \r \h 15.10.2. Let InputLength be the length of Input. This variable will be used throughout the functions in section  REF _Ref455931092 \r \h 15.10.2. Let c be a Continuation that always returns its State argument as a successful MatchResult. Let cap be an internal array of NCapturingParens undefined values, indexed 1 through NCapturingParens. Let x be the State (index, cap). Call m(x, c) and return its result. Informative comments: A Pattern evaluates ("compiles") to an internal function value. RegExp.prototype.exec can then apply this function to a string and an offset within the string to determine whether the pattern would match starting at exactly that offset within the string, and, if it does match, what the values of the capturing parentheses would be. The algorithms in section  REF _Ref455931092 \r \h 15.10.2 are designed so that compiling a pattern may throw a SyntaxError exception; on the other hand, once the pattern is successfully compiled, applying its result function to find a match in a string cannot throw an exception (except for any host-defined exceptions that can occur anywhere such as out-of-memory). Disjunction The production Disjunction :: Alternative evaluates by evaluating Alternative to obtain a Matcher and returning that Matcher. The production Disjunction :: Alternative | Disjunction evaluates as follows: Evaluate Alternative to obtain a Matcher m1. Evaluate Disjunction to obtain a Matcher m2. Return an internal Matcher closure that takes two arguments, a State x and a Continuation c, and performs the following: Call m1(x, c) and let r be its result. If r isn't failure, return r. Call m2(x, c) and return its result. Informative comments: The | regular expression operator separates two alternatives. The pattern first tries to match the left Alternative (followed by the sequel of the regular expression); if it fails, it tries to match the right Disjunction (followed by the sequel of the regular expression). If the left Alternative, the right Disjunction, and the sequel all have choice points, all choices in the sequel are tried before moving on to the next choice in the left Alternative. If choices in the left Alternative are exhausted, the right Disjunction is tried instead of the left Alternative. Any capturing parentheses inside a portion of the pattern skipped by | produce undefined values instead of strings. Thus, for example, /a|ab/.exec("abc") returns the result "a" and not "ab". Moreover, /((a)|(ab))((c)|(bc))/.exec("abc") returns the array ["abc", "a", "a", undefined, "bc", undefined, "bc"] and not ["abc", "ab", undefined, "ab", "c", "c", undefined] Alternative The production Alternative :: [empty] evaluates by returning a Matcher that takes two arguments, a State x and a Continuation c, and returns the result of calling c(x). The production Alternative :: Alternative Term evaluates as follows: Evaluate Alternative to obtain a Matcher m1. Evaluate Term to obtain a Matcher m2. Return an internal Matcher closure that takes two arguments, a State x and a Continuation c, and performs the following: Create a Continuation d that takes a State argument y and returns the result of calling m2(y, c). Call m1(x, d) and return its result. Informative comments: Consecutive Terms try to simultaneously match consecutive portions of the input string. If the left Alternative, the right Term, and the sequel of the regular expression all have choice points, all choices in the sequel are tried before moving on to the next choice in the right Term, and all choices in the right Term are tried before moving on to the next choice in the left Alternative. Term The production Term :: Assertion evaluates by returning an internal Matcher closure that takes two arguments, a State x and a Continuation c, and performs the following: Evaluate Assertion to obtain an AssertionTester t. Call t(x) and let r be the resulting boolean value. If r is false, return failure. Call c(x) and return its result. The production Term :: Atom evaluates by evaluating Atom to obtain a Matcher and returning that Matcher. The production Term :: Atom Quantifier evaluates as follows: Evaluate Atom to obtain a Matcher m. Evaluate Quantifier to obtain the three results: an integer min, an integer (or () max, and boolean greedy. If max is finite and less than min, then throw a SyntaxError exception. Let parenIndex be the number of left capturing parentheses in the entire regular expression that occur to the left of this production expansion's Term. This is the total number of times the Atom :: ( Disjunction ) production is expanded prior to this production's Term plus the total number of Atom :: ( Disjunction ) productions enclosing this Term. Let parenCount be the number of left capturing parentheses in the expansion of this production's Atom. This is the total number of Atom :: ( Disjunction ) productions enclosed by this production's Atom. Return an internal Matcher closure that takes two arguments, a State x and a Continuation c, and performs the following: Call RepeatMatcher(m, min, max, greedy, x, c, parenIndex, parenCount) and return its result. The internal helper function RepeatMatcher takes eight parameters, a Matcher m, an integer min, an integer (or () max, a boolean greedy, a State x, a Continuation c, an integer parenIndex, and an integer parenCount, and performs the following: If max is zero, then call c(x) and return its result. Create an internal Continuation closure d that takes one State argument y and performs the following: If min is zero and y's endIndex is equal to x's endIndex, then return failure. If min is zero then let min2 be zero; otherwise let min2 be min1. If max is (, then let max2 be (; otherwise let max2 be max1. Call RepeatMatcher(m, min2, max2, greedy, y, c, parenIndex, parenCount) and return its result. Let cap be a fresh copy of x's captures internal array. For every integer k that satisfies parenIndex < k and k ( parenIndex+parenCount, set cap[k] to undefined. Let e be x's endIndex. Let xr be the State (e, cap). If min is not zero, then call m(xr, d) and return its result. If greedy is true, then go to step 12. Call c(x) and let z be its result. If z is not failure, return z. Call m(xr, d) and return its result. Call m(xr, d) and let z be its result. If z is not failure, return z. Call c(x) and return its result. Informative comments: An Atom followed by a Quantifier is repeated the number of times specified by the Quantifier. A quantifier can be non-greedy, in which case the Atom pattern is repeated as few times as possible while still matching the sequel, or it can be greedy, in which case the Atom pattern is repeated as many times as possible while still matching the sequel. The Atom pattern is repeated rather than the input string that it matches, so different repetitions of the Atom can match different input substrings. If the Atom and the sequel of the regular expression all have choice points, the Atom is first matched as many (or as few, if non-greedy) times as possible. All choices in the sequel are tried before moving on to the next choice in the last repetition of Atom. All choices in the last (nth) repetition of Atom are tried before moving on to the next choice in the next-to-last (n1)st repetition of Atom; at which point it may turn out that more or fewer repetitions of Atom are now possible; these are exhausted (again, starting with either as few or as many as possible) before moving on to the next choice in the (n-1)st repetition of Atom and so on. Compare /a[a-z]{2,4}/.exec("abcdefghi") which returns "abcde" with /a[a-z]{2,4}?/.exec("abcdefghi") which returns "abc". Consider also /(aa|aabaac|ba|b|c)*/.exec("aabaac") which, by the choice point ordering above, returns the array ["aaba", "ba"] and not any of: ["aabaac", "aabaac"] ["aabaac", "c"] The above ordering of choice points can be used to write a regular expression that calculates the greatest common divisor of two numbers (represented in unary notation). The following example calculates the gcd of 10 and 15: "aaaaaaaaaa,aaaaaaaaaaaaaaa".replace(/^(a+)\1*,\1+$/,"$1") which returns the gcd in unary notation "aaaaa". Step 4 of the RepeatMatcher clears Atom's captures each time Atom is repeated. We can see its behaviour in the regular expression /(z)((a+)?(b+)?(c))*/.exec("zaacbbbcac") which returns the array ["zaacbbbcac", "z", "ac", "a", undefined, "c"] and not ["zaacbbbcac", "z", "ac", "a", "bbb", "c"] because each iteration of the outermost * clears all captured strings contained in the quantified Atom, which in this case includes capture strings numbered 2, 3, and 4. Step 1 of the RepeatMatcher's closure d states that, once the minimum number of repetitions has been satisfied, any more expansions of Atom that match the empty string are not considered for further repetitions. This prevents the regular expression engine from falling into an infinite loop on patterns such as: /(a*)*/.exec("b") or the slightly more complicated: /(a*)b\1+/.exec("baaaac") which returns the array ["b", ""] Assertion The production Assertion :: ^ evaluates by returning an internal AssertionTester closure that takes a State argument x and performs the following: Let e be x's endIndex. If e is zero, return true. If Multiline is false, return false. If the character Input[e1] is one of the line terminator characters , , , or , return true. Return false. The production Assertion :: $ evaluates by returning an internal AssertionTester closure that takes a State argument x and performs the following: Let e be x's endIndex. If e is equal to InputLength, return true. If multiline is false, return false. If the character Input[e] is one of the line terminator characters , , , or , return true. Return false. The production Assertion :: \ b evaluates by returning an internal AssertionTester closure that takes a State argument x and performs the following: Let e be x's endIndex. Call IsWordChar(e1) and let a be the boolean result. Call IsWordChar(e) and let b be the boolean result. If a is true and b is false, return true. If a is false and b is true, return true. Return false. The production Assertion :: \ B evaluates by returning an internal AssertionTester closure that takes a State argument x and performs the following: Let e be x's endIndex. Call IsWordChar(e1) and let a be the boolean result. Call IsWordChar(e) and let b be the boolean result. If a is true and b is false, return false. If a is false and b is true, return false. Return true. The internal helper function IsWordChar takes an integer parameter e and performs the following: If e == 1 or e == InputLength, return false. Let c be the character Input[e]. If c is one of the sixty-three characters in the table below, return true. abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_Return false. Quantifier The production Quantifier :: QuantifierPrefix evaluates as follows: Evaluate QuantifierPrefix to obtain the two results: an integer min and an integer (or () max. Return the three results min , max, and true. The production Quantifier :: QuantifierPrefix ? evaluates as follows: Evaluate QuantifierPrefix to obtain the two results: an integer min and an integer (or () max. Return the three results min , max, and false. The production QuantifierPrefix :: * evaluates by returning the two results 0 and (. The production QuantifierPrefix :: + evaluates by returning the two results 1 and (. The production QuantifierPrefix :: ? evaluates by returning the two results 0 and 1. The production QuantifierPrefix :: { DecimalDigits } evaluates as follows: Let i be the MV of DecimalDigits (see section  REF _Ref424530746 \r \h 7.8.3). Return the two results i and i. The production QuantifierPrefix :: { DecimalDigits , } evaluates as follows: Let i be the MV of DecimalDigits. Return the two results i and (. The production QuantifierPrefix :: { DecimalDigits , DecimalDigits } evaluates as follows: Let i be the MV of the first DecimalDigits. Let j be the MV of the second DecimalDigits. Return the two results i and j. Atom The production Atom :: PatternCharacter evaluates as follows: Let ch be the character represented by PatternCharacter. Let A be a one-element CharSet containing the character ch. Call CharacterSetMatcher(A, false) and return its Matcher result. The production Atom :: . evaluates as follows: Let A be the set of all characters except the four line terminator characters , , , or . Call CharacterSetMatcher(A, false) and return its Matcher result. The production Atom :: \ AtomEscape evaluates by evaluating AtomEscape to obtain a Matcher and returning that Matcher. The production Atom :: CharacterClass evaluates as follows: Evaluate CharacterClass to obtain a CharSet A and a boolean invert. Call CharacterSetMatcher(A, invert) and return its Matcher result. The production Atom :: ( Disjunction ) evaluates as follows: Evaluate Disjunction to obtain a Matcher m. Let parenIndex be the number of left capturing parentheses in the entire regular expression that occur to the left of this production expansion's initial left parenthesis. This is the total number of times the Atom::(Disjunction) production is expanded prior to this production's Atom plus the total number of Atom::(Disjunction) productions enclosing this Atom. Return an internal Matcher closure that takes two arguments, a State x and a Continuation c, and performs the following: Create an internal Continuation closure d that takes one State argument y and performs the following: Let cap be a fresh copy of y's captures internal array. Let xe be x's endIndex. Let ye be y's endIndex. Let s be a fresh string whose characters are the characters of Input at positions xe (inclusive) through ye (exclusive). Set cap[parenIndex+1] to s. Let z be the State (ye, cap). Call c(z) and return its result. Call m(x, d) and return its result. The production Atom :: ( ? : Disjunction ) evaluates by evaluating Disjunction to obtain a Matcher and returning that Matcher. The production Atom :: ( ? = Disjunction ) evaluates as follows: Evaluate Disjunction to obtain a Matcher m. Return an internal Matcher closure that takes two arguments, a State x and a Continuation c, and performs the following: Let d be a Continuation that always returns its State argument as a successful MatchResult. Call m(x, d) and let r be its result. If r is failure, return failure. Let y be r's State. Let cap be y's captures internal array. Let xe be x's endIndex. Let z be the State (xe, cap). Call c(z) and return its result. The production Atom :: ( ? ! Disjunction ) evaluates as follows: Evaluate Disjunction to obtain a Matcher m. Return an internal Matcher closure that takes two arguments, a State x and a Continuation c, and performs the following: Let d be a Continuation that always returns its State argument as a successful MatchResult. Call m(x, d) and let r be its result. If r isn't failure, return failure. Call c(x) and return its result. The internal helper function CharacterSetMatcher takes two arguments, a CharSet A and a boolean flag invert, and performs the following: Return an internal Matcher closure that takes two arguments, a State x and a Continuation c, and performs the following: Let e be x's endIndex. If e == InputLength, return failure. Let c be the character Input[e]. Let cc be the result of Canonicalize(c). If invert is true, go to step 8. If there does not exist a member a of set A such that Canonicalize(a) == cc, then return failure. Go to step 9. If there exists a member a of set A such that Canonicalize(a) == cc, then return failure. Let cap be x's captures internal array. Let y be the State (e+1, cap). Call c(y) and return its result. The internal helper function Canonicalize takes a character parameter ch and performs the following: If IgnoreCase is false, return ch. Let u be ch converted to upper case as if by calling String.prototype.toUpperCase on the one-character string ch. If u does not consist of a single character, return ch. Let cu be u's character. If ch's code point value is greater than or equal to decimal 128 and cu's code point value is less than decimal 128, then return ch. Return cu. Informative comments: Parentheses of the form ( Disjunction ) serve both to group the components of the Disjunction pattern together and to save the result of the match. The result can be used either in a backreference (\ followed by a nonzero decimal number), referenced in a replace string, or returned as part of an array from the regular expression matching function. To inhibit the capturing behaviour of parentheses, use the form (?: Disjunction ) instead. The form (?= Disjunction ) specifies a zero-width positive lookahead. In order for it to succeed, the pattern inside Disjunction must match at the current position, but the current position is not advanced before matching the sequel. If Disjunction can match at the current position in several ways, only the first one is tried. Unlike other regular expression operators, there is no backtracking into a (?= form (this unusual behaviour is inherited from Perl). This only matters when the Disjunction contains capturing parentheses and the sequel of the pattern contains backreferences to those captures. For example, /(?=(a+))/.exec("baaabac") matches the empty string immediately after the first b and therefore returns the array: ["", "aaa"] To illustrate the lack of backtracking into the lookahead, consider: /(?=(a+))a*b\1/.exec("baaabac") This expression returns ["aba", "a"] and not: ["aaaba", "a"] The form (?! Disjunction ) specifies a zero-width negative lookahead. In order for it to succeed, the pattern inside Disjunction must fail to match at the current position. The current position is not advanced before matching the sequel. Disjunction can contain capturing parentheses, but backreferences to them only make sense from within Disjunction itself. Backreferences to these capturing parentheses from elsewhere in the pattern always return undefined because the negative lookahead must fail for the pattern to succeed. For example, /(.*?)a(?!(a+)b\2c)\2(.*)/.exec("baaabaac") looks for an a not immediately followed by some positive number n of a's, a b, another n a's (specified by the first \2) and a c. The second \2 is outside the negative lookahead, so it matches against undefined and therefore always succeeds. The whole expression returns the array: ["baaabaac", "ba", undefined, "abaac"] In case-insignificant matches all characters are implicitly converted to upper case immediately before they are compared. However, if converting a character to upper case would expand that character into more than one character (such as converting "" (\u00DF) into "SS"), then the character is left as-is instead. The character is also left as-is if it is not an ASCII character but converting it to upper case would make it into an ASCII character. This prevents Unicode characters such as \u0131 and \u017F from matching regular expressions such as /[az]/i, which are only intended to match ASCII letters. Furthermore, if these conversions were allowed, then /[^\W]/i would match each of a, b, , h, but not i or s. AtomEscape The production AtomEscape :: DecimalEscape evaluates as follows: Evaluate DecimalEscape to obtain an EscapeValue E. If E is not a character then go to step 6. Let ch be E's character. Let A be a one-element CharSet containing the character ch. Call CharacterSetMatcher(A, false) and return its Matcher result. E must be an integer. Let n be that integer. If n=0 or n>NCapturingParens then throw a SyntaxError exception. Return an internal Matcher closure that takes two arguments, a State x and a Continuation c, and performs the following: Let cap be x's captures internal array. Let s be cap[n]. If s is undefined, then call c(x) and return its result. Let e be x's endIndex. Let len be s's length. Let f be e+len. If f>InputLength, return failure. If there exists an integer i between 0 (inclusive) and len (exclusive) such that Canonicalize(s[i]) is not the same character as Canonicalize(Input [e+i]), then return failure. Let y be the State (f, cap). Call c(y) and return its result. The production AtomEscape :: CharacterEscape evaluates as follows: Evaluate CharacterEscape to obtain a character ch. Let A be a one-element CharSet containing the character ch. Call CharacterSetMatcher(A, false) and return its Matcher result. The production AtomEscape :: CharacterClassEscape evaluates as follows: Evaluate CharacterClassEscape to obtain a CharSet A. Call CharacterSetMatcher(A, false) and return its Matcher result. Informative comments: An escape sequence of the form \ followed by a nonzero decimal number n matches the result of the nth set of capturing parentheses (see section  REF _Ref455931187 \r \h 15.10.2.11). It is an error if the regular expression has fewer than n capturing parentheses. If the regular expression has n or more capturing parentheses but the nth one is undefined because it hasn't captured anything, then the backreference always succeeds. CharacterEscape The production CharacterEscape :: ControlEscape evaluates by returning the character according to the table below: ControlEscape Unicode ValueNameSymbolt\u0009horizontal tabn\u000Aline feed (new line)v\u000Bvertical tabf\u000Cform feedr\u000Dcarriage return The production CharacterEscape :: c ControlLetter evaluates as follows: Let ch be the character represented by ControlLetter. Let i be ch's code point value. Let j be the remainder of dividing i by 32. Return the Unicode character numbered j. The production CharacterEscape :: HexEscapeSequence evaluates by evaluating the CV of the HexEscapeSequence (see section  REF _Ref440437891 \r \h 7.8.4) and returning its character result. The production CharacterEscape :: UnicodeEscapeSequence evaluates by evaluating the CV of the UnicodeEscapeSequence (see section  REF _Ref440437891 \r \h 7.8.4) and returning its character result. The production CharacterEscape :: IdentityEscape evaluates by returning the character represented by IdentityEscape. DecimalEscape The production DecimalEscape :: DecimalIntegerLiteral [lookahead ( DecimalDigit] evaluates as follows. Let i be the MV of DecimalIntegerLiteral. If i is zero, return the EscapeValue consisting of a character (Unicode value 0000). Return the EscapeValue consisting of the integer i. The definition of the MV of DecimalIntegerLiteral is in section  REF _Ref424530746 \r \h 7.8.3. Informative comments: If \ is followed by a decimal number n whose first digit is not 0, then the escape sequence is considered to be a backreference. It is an error if n is greater than the total number of left capturing parentheses in the entire regular expression. \0 represents the NUL character and cannot be followed by a decimal digit. CharacterClassEscape The production CharacterClassEscape :: d evaluates by returning the ten-element set of characters containing the characters 0 through 9 inclusive. The production CharacterClassEscape :: D evaluates by returning the set of all characters not included in the set returned by CharacterClassEscape :: d. The production CharacterClassEscape :: s evaluates by returning the set of characters containing the characters that are on the right-hand side of the WhiteSpace (section  REF _Ref451679260 \r \h 7.2) or LineTerminator (section  REF _Ref449966403 \r \h 7.3) productions. The production CharacterClassEscape :: S evaluates by returning the set of all characters not included in the set returned by CharacterClassEscape :: s. The production CharacterClassEscape :: w evaluates by returning the set of characters containing the sixty-three characters: abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_The production CharacterClassEscape :: W evaluates by returning the set of all characters not included in the set returned by CharacterClassEscape :: w. CharacterClass The production CharacterClass :: [ [lookahead ( {^}] ClassRanges ] evaluates by evaluating ClassRanges to obtain a CharSet and returning that CharSet and the boolean false. The production CharacterClass :: [ ^ ClassRanges ] evaluates by evaluating ClassRanges to obtain a CharSet and returning that CharSet and the boolean true. ClassRanges The production ClassRanges :: [empty] evaluates by returning the empty CharSet. The production ClassRanges :: NonemptyClassRanges evaluates by evaluating NonemptyClassRanges to obtain a CharSet and returning that CharSet. NonemptyClassRanges The production NonemptyClassRanges :: ClassAtom evaluates by evaluating ClassAtom to obtain a CharSet and returning that CharSet. The production NonemptyClassRanges :: ClassAtom NonemptyClassRangesNoDash evaluates as follows: Evaluate ClassAtom to obtain a CharSet A. Evaluate NonemptyClassRangesNoDash to obtain a CharSet B. Return the union of CharSets A and B. The production NonemptyClassRanges :: ClassAtom - ClassAtom ClassRanges evaluates as follows: Evaluate the first ClassAtom to obtain a CharSet A. Evaluate the second ClassAtom to obtain a CharSet B. Evaluate ClassRanges to obtain a CharSet C. Call CharacterRange(A, B) and let D be the resulting CharSet. Return the union of CharSets D and C. The internal helper function CharacterRange takes two CharSet parameters A and B and performs the following: If A does not contain exactly one character or B does not contain exactly one character then throw a SyntaxError exception. Let a be the one character in CharSet A. Let b be the one character in CharSet B. Let i be the code point value of character a. Let j be the code point value of character b. If I > j then throw a SyntaxError exception. Return the set containing all characters numbered i through j, inclusive. NonemptyClassRangesNoDash The production NonemptyClassRangesNoDash :: ClassAtom evaluates by evaluating ClassAtom to obtain a CharSet and returning that CharSet. The production NonemptyClassRangesNoDash :: ClassAtomNoDash NonemptyClassRangesNoDash evaluates as follows: Evaluate ClassAtomNoDash to obtain a CharSet A. Evaluate NonemptyClassRangesNoDash to obtain a CharSet B. Return the union of CharSets A and B. The production NonemptyClassRangesNoDash :: ClassAtomNoDash - ClassAtom ClassRanges evaluates as follows: Evaluate ClassAtomNoDash to obtain a CharSet A. Evaluate ClassAtom to obtain a CharSet B. Evaluate ClassRanges to obtain a CharSet C. Call CharacterRange(A, B) and let D be the resulting CharSet. Return the union of CharSets D and C. Informative comments: ClassRanges can expand into single ClassAtoms and/or ranges of two ClassAtoms separated by dashes. In the latter case the ClassRanges includes all characters between the first ClassAtom and the second ClassAtom, inclusive; an error occurs if either ClassAtom does not represent a single character (for example, if one is \w) or if the first ClassAtom's code point value is greater than the second ClassAtom's code point value. Even if the pattern ignores case, the case of the two ends of a range is significant in determining which characters belong to the range. Thus, for example, the pattern /[E-F]/i matches only the letters E, F, e, and f, while the pattern /[E-f]/i matches all upper and lower-case ASCII letters as well as the symbols [, \, ], ^, _, and `. A - character can be treated literally or it can denote a range. It is treated literally if it is the first or last character of ClassRanges, the beginning or end limit of a range specification, or immediately follows a range specification. ClassAtom The production ClassAtom :: - evaluates by returning the CharSet containing the one character -. The production ClassAtom :: ClassAtomNoDash evaluates by evaluating ClassAtomNoDash to obtain a CharSet and returning that CharSet. ClassAtomNoDash The production ClassAtomNoDash :: SourceCharacter but not one of \ ] - evaluates by returning a one-element CharSet containing the character represented by SourceCharacter. The production ClassAtomNoDash :: \ ClassEscape evaluates by evaluating ClassEscape to obtain a CharSet and returning that CharSet. ClassEscape The production ClassEscape :: DecimalEscape evaluates as follows: Evaluate DecimalEscape to obtain an EscapeValue E. If E is not a character then throw a SyntaxError exception. Let ch be E's character. Return the one-element CharSet containing the character ch. The production ClassEscape :: b evaluates by returning the CharSet containing the one character (Unicode value 0008). The production ClassEscape :: CharacterEscape evaluates by evaluating CharacterEscape to obtain a character and returning a one-element CharSet containing that character. The production ClassEscape :: CharacterClassEscape evaluates by evaluating CharacterClassEscape to obtain a CharSet and returning that CharSet. Informative comments: A ClassAtom can use any of the escape sequences that are allowed in the rest of the regular expression except for \b, \B, and backreferences. Inside a CharacterClass, \b means the backspace character, while \B and backreferences raise errors. Using a backreference inside a ClassAtom causes an error. The RegExp Constructor Called as a Function RegExp(pattern, flags) If pattern is an object R whose [[Class]] property is "RegExp" and flags is undefined, then return R unchanged. Otherwise call the RegExp constructor (section  REF _Ref404573597 \r \h 15.10.4.1), passing it the pattern and flags arguments and return the object constructed by that constructor. The RegExp Constructor When RegExp is called as part of a new expression, it is a constructor: it initialises the newly created object. new RegExp(pattern, flags) If pattern is an object R whose [[Class]] property is "RegExp" and flags is undefined, then let P be the pattern used to construct R and let F be the flags used to construct R. If pattern is an object R whose [[Class]] property is "RegExp" and flags is not undefined, then throw a TypeError exception. Otherwise, let P be the empty string if pattern is undefined and ToString(pattern) otherwise, and let F be the empty string if flags is undefined and ToString(flags) otherwise. The global property of the newly constructed object is set to a Boolean value that is true if F contains the character g and false otherwise. The ignoreCase property of the newly constructed object is set to a Boolean value that is true if F contains the character i and false otherwise. The multiline property of the newly constructed object is set to a Boolean value that is true if F contains the character m and false otherwise. If F contains any character other than g, i, or m, or if it contains the same one more than once, then throw a SyntaxError exception. If P's characters do not have the form Pattern, then throw a SyntaxError exception. Otherwise let the newly constructed object have a [[Match]] property obtained by evaluating ("compiling") Pattern. Note that evaluating Pattern may throw a SyntaxError exception. (Note: if pattern is a StringLiteral, the usual escape sequence substitutions are performed before the string is processed by RegExp. If pattern must contain an escape sequence to be recognised by RegExp, the \ character must be escaped within the StringLiteral to prevent its being removed when the contents of the StringLiteral are formed.) The source property of the newly constructed object is set to an implementation-defined string value in the form of a Pattern based on P. The lastIndex property of the newly constructed object is set to 0. The [[Prototype]] property of the newly constructed object is set to the original RegExp prototype object, the one that is the initial value of RegExp.prototype. The [[Class]] property of the newly constructed object is set to "RegExp". Properties of the RegExp Constructor The value of the internal [[Prototype]] property of the RegExp constructor is the Function prototype object (section  REF _Ref424534100 \r \h 15.3.4). Besides the internal properties and the length property (whose value is 2), the RegExp constructor has the following properties: RegExp.prototype The initial value of RegExp.prototype is the RegExp prototype object (section  REF _Ref404353569 \r \h 15.10.6). This property shall have the attributes {DontEnum, DontDelete, ReadOnly}. Properties of the RegExp Prototype Object The value of the internal [[Prototype]] property of the RegExp prototype object is the Object prototype. The value of the internal [[Class]] property of the RegExp prototype object is "Object". The RegExp prototype object does not have a valueOf property of its own; however, it inherits the valueOf property from the Object prototype object. In the following descriptions of functions that are properties of the RegExp prototype object, the phrase this RegExp object refers to the object that is the this value for the invocation of the function; a TypeError exception is thrown if the this value is not an object for which the value of the internal [[Class]] property is "RegExp". RegExp.prototype.constructor The initial value of RegExp.prototype.constructor is the built-in RegExp constructor. RegExp.prototype.exec(string) Performs a regular expression match of string against the regular expression and returns an Array object containing the results of the match, or null if the string did not match The string ToString(string) is searched for an occurrence of the regular expression pattern as follows: Let S be the value of ToString(string). Let length be the length of S. Let lastIndex be the value of the lastIndex property. Let i be the value of ToInteger(lastIndex). If the global property is false, let i = 0. If I < 0 or I > length then set lastIndex to 0 and return null. Call [[Match]], giving it the arguments S and i. If [[Match]] returned failure, go to step 8; otherwise let r be its State result and go to step 10. Let i = i+1. Go to step 6. Let e be r's endIndex value. If the global property is true, set lastIndex to e. Let n be the length of r's captures array. (This is the same value as section  REF _Ref455931278 \r \h 15.10.2.1's NCapturingParens.) Return a new array with the following properties: The index property is set to the position of the matched substring within the complete string S. The input property is set to S. The length property is set to n + 1. The 0 property is set to the matched substring (i.e. the portion of S between offset i inclusive and offset e exclusive). For each integer i such that I > 0 and I ( n, set the property named ToString(i) to the ith element of r's captures array. RegExp.prototype.test(string) Equivalent to the expression RegExp.prototype.exec(string) != null. RegExp.prototype.toString() Let src be a string in the form of a Pattern representing the current regular expression. src may or may not be identical to the source property or to the source code supplied to the RegExp constructor; however, if src were supplied to the RegExp constructor along with the current regular expression's flags, the resulting regular expression must behave identically to the current regular expression. toString returns a string value formed by concatenating the strings "/", src, and "/"; plus "g" if the global property is true, "i" if the ignoreCase property is true, and "m" if the multiline property is true. NOTE An implementation may choose to take advantage of src being allowed to be different from the source passed to the RegExp constructor to escape special characters in src. For example, in the regular expression obtained from new RegExp("/"), src could be, among other possibilities, "/" or "\/". The latter would permit the entire result ("/\//") of the toString call to have the form RegularExpressionLiteral. Properties of RegExp Instances RegExp instances inherit properties from their [[Prototype]] object as specified above and also have the following properties. source The value of the source property is string in the form of a Pattern representing the current regular expression. This property shall have the attributes {DontDelete, ReadOnly, DontEnum}. global The value of the global property is a Boolean value indicating whether the flags contained the character g. This property shall have the attributes {DontDelete, ReadOnly, DontEnum}. ignoreCase The value of the ignoreCase property is a Boolean value indicating whether the flags contained the character i. This property shall have the attributes {DontDelete, ReadOnly, DontEnum}. multiline The value of the multiline property is a Boolean value indicating whether the flags contained the character m. This property shall have the attributes {DontDelete, ReadOnly, DontEnum}. lastIndex The value of the lastIndex property is an integer that specifies the string position at which to start the next match. This property shall have the attributes {DontDelete, DontEnum}. Error Objects Instances of Error objects are thrown as exceptions when runtime errors occur. The Error objects may also serve as base objects for user-defined exception classes. The Error Constructor Called as a Function When Error is called as a function rather than as a constructor, it creates and initialises a new Error object. Thus the function call Error() is equivalent to the object creation expression new Error() with the same arguments. Error (message) The [[Prototype]] property of the newly constructed object is set to the original Error prototype object, the one that is the initial value of Error.prototype (section  REF _Ref455964627 \r \h 15.11.3.1). The [[Class]] property of the newly constructed object is set to "Error". If the argument message is not undefined, the message property of the newly constructed object is set to ToString(message). The Error Constructor When Error is called as part of a new expression, it is a constructor: it initialises the newly created object. new Error (message) The [[Prototype]] property of the newly constructed object is set to the original Error prototype object, the one that is the initial value of Error.prototype (section  REF _Ref455964627 \r \h 15.11.3.1). The [[Class]] property of the newly constructed Error object is set to "Error". If the argument message is not undefined, the message property of the newly constructed object is set to ToString(message). Properties of the Error Constructor The value of the internal [[Prototype]] property of the Error constructor is the Function prototype object (section  REF _Ref424534100 \r \h 15.3.4). Besides the internal properties and the length property (whose value is 1), the Error constructor has the following property: Error.prototype The initial value of Error.prototype is the Error prototype object (section  REF _Ref457102523 \r \h 15.11.4). This property has the attributes { DontEnum, DontDelete, ReadOnly }. Properties of the Error Prototype Object The Error prototype object is itself an Error object (its [[Class]] is "Error"). The value of the internal [[Prototype]] property of the Error prototype object is the Object prototype object (section  REF _Ref424531384 \r \h 15.2.3.1). Error.prototype.constructor The initial value of Error.prototype.constructor is the built-in Error constructor. Error.prototype.name The initial value of Error.prototype.name is "Error". Error.prototype.message The initial value of Error.prototype.message is an implementation-defined string. Error.prototype.toString ( ) Returns an implementation defined string. Properties of Error Instances Error instances have no special properties beyond those inherited from the Error prototype object. Native Error Types Used in This Standard One of the NativeError objects below is thrown when a runtime error is detected. All of these objects share the same structure, as described in section  REF _Ref463855081 \r \h 15.11.7. EvalError Indicates that the global function eval was used in a way that is incompatible with its definition. See section  REF _Ref449966832 \r \h 15.1.2.1. RangeError Indicates a numeric value has exceeded the allowable range. See sections  REF _Ref455971750 \r \h 15.4.2.2,  REF _Ref424531062 \r \h 15.4.5.1,  REF _Ref457790851 \r 15.7.4.5,  REF _Ref457790854 \r 15.7.4.6, and  REF _Ref457790874 \r 15.7.4.7. ReferenceError Indicate that an invalid reference value has been detected. See sections  REF _Ref455971379 \r \h 8.7.1, and  REF _Ref455971381 \r \h 8.7.2. SyntaxError Indicates that a parsing error has occurred. See sections  REF _Ref449966832 \r \h 15.1.2.1,  REF _Ref424534066 \r \h 15.3.2.1,  REF _Ref457710778 \r \h 15.10.2.5,  REF _Ref463788107 \r \h 15.10.2.9,  REF _Ref463788134 \r \h 15.10.2.15,  REF _Ref463788188 \r \h 15.10.2.19, and  REF _Ref404573597 \r \h 15.10.4.1. TypeError Indicates the actual type of an operand is different than the expected type. See sections  REF _Ref440438264 \r \h 8.6.2,  REF _Ref424667579 \r \h 8.6.2.6,  REF _Ref455971449 \r \h 9.9,  REF _Ref455972170 \r \h 11.2.2,  REF _Ref455972172 \r \h 11.2.3,  REF _Ref440443297 \r \h 11.8.6,  REF _Ref440443312 \r \h 11.8.7,  REF _Ref455972201 \r \h 15.3.4.2,  REF _Ref449966854 \r \h 15.3.4.3,  REF _Ref457709044 \r \h 15.3.4.4,  REF _Ref449966920 \r \h 15.3.5.3,  REF _Ref451680376 \r \h 15.4.4.2,  REF _Ref456011285 \r \h 15.4.4.3,  REF _Ref455972324 \r \h 15.5.4.2,  REF _Ref455972327 \r \h 15.5.4.3,  REF _Ref424535986 \r \h 15.6.4,  REF _Ref455972335 \r \h 15.6.4.2,  REF _Ref455972337 \r \h 15.6.4.3,  REF _Ref424536060 \r \h 15.7.4,  REF _Ref455972347 \r \h 15.7.4.2,  REF _Ref455972349 \r \h 15.7.4.4,  REF _Ref424536220 \r \h 15.9.5,  REF _Ref455972366 \r \h 15.9.5.9,  REF _Ref455972372 \r \h 15.9.5.27,  REF _Ref404573597 \r \h 15.10.4.1, and  REF _Ref404353569 \r \h 15.10.6. URIError Indicates that one of the global URI handling functions was used in a way that is incompatible with its definition. See section  REF _Ref456003831 \r \h 15.1.3. NativeError Object Structure When an ECMAScript implementation detects a runtime error, it throws an instance of one of the NativeError objects defined in section  REF _Ref463854015 \r \h 15.11.6. Each of these objects has the structure described below, differing only in the name used as the constructor name instead of NativeError, in the name property of the prototype object, and in the implementation-defined message property of the prototype object. For each error object, references to NativeError in the definition should be replaced with the appropriate error object name from section  REF _Ref463854015 \r \h 15.11.6. NativeError Constructors Called as Functions When a NativeError constructor is called as a function rather than as a constructor, it creates and initialises a new object. A call of the object as a function is equivalent to calling it as a constructor with the same arguments. NativeError (message) The [[Prototype]] property of the newly constructed object is set to the prototype object for this error constructor. The [[Class]] property of the newly constructed object is set to "Error". If the argument message is not undefined, the message property of the newly constructed object is set to ToString(message). The NativeError Constructors When a NativeError constructor is called as part of a new expression, it is a constructor: it initialises the newly created object. New NativeError (message) The [[Prototype]] property of the newly constructed object is set to the prototype object for this NativeError constructor. The [[Class]] property of the newly constructed object is set to "Error". If the argument message is not undefined, the message property of the newly constructed object is set to ToString(message). Properties of the NativeError Constructors The value of the internal [[Prototype]] property of a NativeError constructor is the Function prototype object (section  REF _Ref424534100 \r \h 15.3.4). Besides the internal properties and the length property (whose value is 1), each NativeError constructor has the following property: NativeError.prototype The initial value of NativeError.prototype is a NativeError prototype object (section  REF _Ref463853782 \r \h 15.11.7.7). Each NativeError constructor has a separate prototype object. This property has the attributes { DontEnum, DontDelete, ReadOnly }. Properties of the NativeError Prototype Objects Each NativeError prototype object is an Error object (its [[Class]] is "Error"). The value of the internal [[Prototype]] property of each NativeError prototype object is the Error prototype object (section  REF _Ref457102523 \r \h 15.11.4). NativeError.prototype.constructor The initial value of the constructor property of the prototype for a given NativeError constructor is the NativeError constructor function itself (section  REF _Ref463855081 \r \h 15.11.7). NativeError.prototype.name The initial value of the name property of the prototype for a given NativeError constructor is the name of the constructor (the name used instead of NativeError). NativeError.prototype.message The initial value of the message property of the prototype for a given NativeError constructor is an implementation-defined string. NOTE The prototypes for the NativeError constructors do not themselves provide a toString function, but instances of errors will inherit it from the Error prototype object. Properties of NativeError Instances NativeError instances have no special properties beyond those inherited from the Error prototype object. Errors An implementation should report runtime errors at the time the relevant language construct is evaluated. An implementation may report syntax errors in the program at the time the program is read in, or it may, at its option, defer reporting syntax errors until the relevant statement is reached. An implementation may report syntax errors in eval code at the time eval is called, or it may, at its option, defer reporting syntax errors until the relevant statement is reached. An implementation may treat any instance of the following kinds of runtime errors as a syntax error and therefore report it early: Improper uses of return, break, and continue. Using the eval property other than via a direct call. Errors in regular expression literals. Attempts to call PutValue on a value that is not a reference (for example, executing the assignment statement 3=4). An implementation shall not report other kinds of runtime errors early even if the compiler can prove that a construct cannot execute without error under any circumstances. An implementation may issue an early warning in such a case, but it should not report the error until the relevant construct is actually executed. An implementation shall report all errors as specified, except for the following: An implementation may extend program and regular expression syntax. To permit this, all operations (such as calling eval, using a regular expression literal, or using the Function or RegExp constructor) that are allowed to throw SyntaxError are permitted to exhibit implementation-defined behaviour instead of throwing SyntaxError when they encounter an implementation-defined extension to the program or regular expression syntax. An implementation may provide additional types, values, objects, properties, and functions beyond those described in this specification. This may cause constructs (such as looking up a variable in the global scope) to have implementation-defined behaviour instead of throwing an error (such as ReferenceError). An implementation is not required to detect EvalError. If it chooses not to detect EvalError, the implementation must allow eval to be used indirectly and/or allow assignments to eval. An implementation may define behaviour other than throwing RangeError for toFixed, toExponential, and toPrecision when the fractionDigits or precision argument is outside the specified range. Grammar Summary Lexical Grammar SourceCharacter :: See section  REF _Ref459624423 \r \h 6 any Unicode character InputElementDiv :: See section  REF _Ref459624423 \r \h 6 WhiteSpace LineTerminator Comment Token DivPunctuator InputElementRegExp :: See section  REF _Ref459624423 \r \h 6 WhiteSpace LineTerminator Comment Token RegularExpressionLiteral WhiteSpace :: See section  REF _Ref451679260 \r \h 7.2 LineTerminator :: See section  REF _Ref449966403 \r \h 7.3 Comment :: See section  REF _Ref457437441 \r \h 7.4 MultiLineComment SingleLineComment MultiLineComment :: See section  REF _Ref457437442 \r \h 7.4 /* MultiLineCommentCharsopt */ MultiLineCommentChars :: See section  REF _Ref457437443 \r \h 7.4 MultiLineNotAsteriskChar MultiLineCommentCharsopt * PostAsteriskCommentCharsopt PostAsteriskCommentChars :: See section  REF _Ref457437444 \r \h 7.4 MultiLineNotForwardSlashOrAsteriskChar MultiLineCommentCharsopt * PostAsteriskCommentCharsopt MultiLineNotAsteriskChar :: See section  REF _Ref457437448 \r \h 7.4 SourceCharacter but not asterisk * MultiLineNotForwardSlashOrAsteriskChar :: See section  REF _Ref457437449 \r \h 7.4 SourceCharacter but not forward-slash / or asterisk * SingleLineComment :: See section  REF _Ref457437450 \r \h 7.4 // SingleLineCommentCharsopt SingleLineCommentChars :: See section  REF _Ref457437451 \r \h 7.4 SingleLineCommentChar SingleLineCommentCharsopt SingleLineCommentChar :: See section  REF _Ref457437452 \r \h 7.4 SourceCharacter but not LineTerminator Token :: See section  REF _Ref457437455 \r \h 7.5 ReservedWord Identifier Punctuator NumericLiteral StringLiteral ReservedWord :: See section  REF _Ref457437456 \r \h 7.5.1 Keyword FutureReservedWord NullLiteral BooleanLiteral Keyword :: one of See section  REF _Ref440443200 \r \h 7.5.2 breakelsenewvarcasefinallyreturnvoidcatchforswitchwhilecontinuefunctionthiswithdefaultifthrowdeleteintrydoinstanceoftypeof FutureReservedWord :: one of See section  REF _Ref440443215 \r \h 7.5.3 abstractenumintshortbooleanexportinterfacestaticbyteextendslongsupercharfinalnativesynchronizedclassfloatpackagethrowsconstgotoprivatetransientdebuggerimplementsprotectedvolatiledoubleimportpublic Identifier :: See section  REF _Ref451679320 \r \h 7.6 IdentifierName but not ReservedWord IdentifierName :: See section  REF _Ref451679320 \r \h 7.6 IdentifierStart IdentifierName IdentifierPart IdentifierStart :: See section  REF _Ref451679320 \r \h 7.6 UnicodeLetter $ _ UnicodeEscapeSequence IdentifierPart :: See section  REF _Ref451679320 \r \h 7.6 IdentifierStart UnicodeCombiningMark UnicodeDigit UnicodeConnectorPunctuation UnicodeEscapeSequence UnicodeLetter See section  REF _Ref451679320 \r \h 7.6 any character in the Unicode categories Uppercase letter (Lu), Lowercase letter (Ll), Titlecase letter (Lt), Modifier letter (Lm), Other letter (Lo), or Letter number (Nl). UnicodeCombiningMark See section  REF _Ref451679320 \r \h 7.6 any character in the Unicode categories Non-spacing mark (Mn) or Combining spacing mark (Mc) UnicodeDigit See section  REF _Ref451679320 \r \h 7.6 any character in the Unicode category Decimal number (Nd) UnicodeConnectorPunctuation See section  REF _Ref451679320 \r \h 7.6 any character in the Unicode category Connector punctuation (Pc) UnicodeEscapeSequence :: See section  REF _Ref451679320 \r \h 7.6 \u HexDigit HexDigit HexDigit HexDigit HexDigit :: one of See section  REF _Ref451679320 \r \h 7.6 0 1 2 3 4 5 6 7 8 9 a b c d e f A B C D E F Punctuator :: one of See section  REF _Ref456010399 \r \h 7.7 {}()[].;,<><=>===!====!==+-*%++--<<>>>>>&|^!~&&||?:=+=-=*=%=<<=>>=>>>=&=|=^={}()[] DivPunctuator :: one of See section  REF _Ref456010399 \r \h 7.7 //= Literal :: See section  REF _Ref431982634 \r \h 7.8 NullLiteral BooleanLiteral NumericLiteral StringLiteral NullLiteral :: See section  REF _Ref457437478 \r \h 7.8.1 null BooleanLiteral :: See section  REF _Ref457437479 \r \h 7.8.2 true false NumericLiteral :: See section  REF _Ref424530746 \r \h 7.8.3 DecimalLiteral HexIntegerLiteral DecimalLiteral :: See section  REF _Ref424530746 \r \h 7.8.3 DecimalIntegerLiteral . DecimalDigitsopt ExponentPartopt . DecimalDigits ExponentPartopt DecimalIntegerLiteral ExponentPartopt DecimalIntegerLiteral :: See section  REF _Ref424530746 \r \h 7.8.3 0 NonZeroDigit DecimalDigitsopt DecimalDigits :: See section  REF _Ref424530746 \r \h 7.8.3 DecimalDigit DecimalDigits DecimalDigit DecimalDigit :: one of See section  REF _Ref424530746 \r \h 7.8.3 0 1 2 3 4 5 6 7 8 9 ExponentIndicator :: one of See section  REF _Ref424530746 \r \h 7.8.3 e E SignedInteger :: See section  REF _Ref424530746 \r \h 7.8.3 DecimalDigits + DecimalDigits - DecimalDigits HexIntegerLiteral :: See section  REF _Ref424530746 \r \h 7.8.3 0x HexDigit 0X HexDigit HexIntegerLiteral HexDigit StringLiteral :: See section  REF _Ref440437891 \r \h 7.8.4 " DoubleStringCharactersopt " ' SingleStringCharactersopt ' DoubleStringCharacters :: See section  REF _Ref440437891 \r \h 7.8.4 DoubleStringCharacter DoubleStringCharactersopt SingleStringCharacters :: See section  REF _Ref440437891 \r \h 7.8.4 SingleStringCharacter SingleStringCharactersopt DoubleStringCharacter :: See section  REF _Ref440437891 \r \h 7.8.4 SourceCharacter but not double-quote " or backslash \ or LineTerminator \ EscapeSequence SingleStringCharacter :: See section  REF _Ref440437891 \r \h 7.8.4 SourceCharacter but not single-quote ' or backslash \ or LineTerminator \ EscapeSequence EscapeSequence :: See section  REF _Ref440437891 \r \h 7.8.4 CharacterEscapeSequence 0 [lookahead ( DecimalDigit] HexEscapeSequence UnicodeEscapeSequence CharacterEscapeSequence :: See section  REF _Ref440437891 \r \h 7.8.4 SingleEscapeCharacter NonEscapeCharacter SingleEscapeCharacter :: one of See section  REF _Ref440437891 \r \h 7.8.4 ' " \ b f n r t v EscapeCharacter :: See section  REF _Ref440437891 \r \h 7.8.4 SingleEscapeCharacter DecimalDigit x u HexEscapeSequence :: See section  REF _Ref440437891 \r \h 7.8.4 x HexDigit HexDigit UnicodeEscapeSequence :: See section  REF _Ref440437891 \r \h 7.8.4 u HexDigit HexDigit HexDigit HexDigit RegularExpressionLiteral :: See section  REF _Ref457437516 \r \h 7.8.5 / RegularExpressionBody / RegularExpressionFlags RegularExpressionBody :: See section  REF _Ref457437517 \r \h 7.8.5 RegularExpressionFirstChar RegularExpressionChars RegularExpressionChars :: See section  REF _Ref457437518 \r \h 7.8.5 [empty] RegularExpressionChars RegularExpressionChar RegularExpressionFirstChar :: See section  REF _Ref457437523 \r \h 7.8.5 NonTerminator but not * or \ or / BackslashSequence RegularExpressionChar :: See section  REF _Ref457437524 \r \h 7.8.5 NonTerminator but not \ or / BackslashSequence BackslashSequence :: See section  REF _Ref457437525 \r \h 7.8.5 \ NonTerminator NonTerminator :: See section  REF _Ref457437526 \r \h 7.8.5 SourceCharacter but not LineTerminator RegularExpressionFlags :: See section  REF _Ref457437527 \r \h 7.8.5 [empty] RegularExpressionFlags IdentifierPart Number Conversions StringNumericLiteral ::: See section  REF _Ref456028389 \r \h 9.3.1 StrWhiteSpaceopt StrWhiteSpaceopt StrNumericLiteral StrWhiteSpaceopt StrWhiteSpace ::: See section  REF _Ref456028389 \r \h 9.3.1 StrWhiteSpaceChar StrWhiteSpaceopt StrWhiteSpaceChar ::: See section  REF _Ref456028389 \r \h 9.3.1 StrNumericLiteral ::: See section  REF _Ref456028389 \r \h 9.3.1 StrDecimalLiteral HexIntegerLiteral StrDecimalLiteral ::: See section  REF _Ref456028389 \r \h 9.3.1 StrUnsignedDecimalLiteral + StrUnsignedDecimalLiteral - StrUnsignedDecimalLiteral StrUnsignedDecimalLiteral ::: See section  REF _Ref456028389 \r \h 9.3.1 Infinity DecimalDigits . DecimalDigitsopt ExponentPartopt . DecimalDigits ExponentPartopt DecimalDigits ExponentPartopt DecimalDigits ::: See section  REF _Ref456028389 \r \h 9.3.1 DecimalDigit DecimalDigits DecimalDigit DecimalDigit ::: one of See section  REF _Ref456028389 \r \h 9.3.1 0 1 2 3 4 5 6 7 8 9 ExponentPart ::: See section  REF _Ref456028389 \r \h 9.3.1 ExponentIndicator SignedInteger ExponentIndicator ::: one of See section  REF _Ref456028389 \r \h 9.3.1 e E SignedInteger ::: See section  REF _Ref456028389 \r \h 9.3.1 DecimalDigits + DecimalDigits - DecimalDigits HexIntegerLiteral ::: See section  REF _Ref456028389 \r \h 9.3.1 0x HexDigit 0X HexDigit HexIntegerLiteral HexDigit HexDigit ::: one of See section  REF _Ref456028389 \r \h 9.3.1 0 1 2 3 4 5 6 7 8 9 a b c d e f A B C D E F Expressions PrimaryExpression : See section  REF _Ref456010676 \r \h 11.1 this Identifier Literal ArrayLiteral ObjectLiteral ( Expression ) ArrayLiteral : See section  REF _Ref457437563 \r \h 11.1.4 [ Elisionopt ] [ ElementList ] [ ElementList , Elisionopt ] ElementList : See section  REF _Ref457437564 \r \h 11.1.4 Elisionopt AssignmentExpression ElementList , Elisionopt AssignmentExpression Elision : See section  REF _Ref457437570 \r \h 11.1.4 , Elision , ObjectLiteral : See section  REF _Ref456010689 \r \h 11.1.5 { } { PropertyNameAndValueList } PropertyNameAndValueList : See section  REF _Ref456010689 \r \h 11.1.5 PropertyName : AssignmentExpression PropertyNameAndValueList , PropertyName : AssignmentExpression PropertyName : See section  REF _Ref456010689 \r \h 11.1.5 Identifier StringLiteral NumericLiteral MemberExpression : See section  REF _Ref449966579 \r \h 11.2 PrimaryExpression FunctionExpression MemberExpression [ Expression ] MemberExpression . Identifier new MemberExpression Arguments NewExpression : See section  REF _Ref449966579 \r \h 11.2 MemberExpression new NewExpression CallExpression : See section  REF _Ref449966579 \r \h 11.2 MemberExpression Arguments CallExpression Arguments CallExpression [ Expression ] CallExpression . Identifier Arguments : See section  REF _Ref449966579 \r \h 11.2 ( ) ( ArgumentList ) ArgumentList : See section  REF _Ref449966579 \r \h 11.2 AssignmentExpression ArgumentList , AssignmentExpression LeftHandSideExpression : See section  REF _Ref449966579 \r \h 11.2 NewExpression CallExpression PostfixExpression : See section  REF _Ref457437594 \r \h 11.3 LeftHandSideExpression LeftHandSideExpression [no LineTerminator here] ++ LeftHandSideExpression [no LineTerminator here] -- UnaryExpression : See section  REF _Ref457437595 \r \h 11.4 PostfixExpression delete UnaryExpression void UnaryExpression typeof UnaryExpression ++ UnaryExpression -- UnaryExpression + UnaryExpression - UnaryExpression ~ UnaryExpression ! UnaryExpression MultiplicativeExpression : See section  REF _Ref457437596 \r \h 11.5 UnaryExpression MultiplicativeExpression * UnaryExpression MultiplicativeExpression / UnaryExpression MultiplicativeExpression % UnaryExpression AdditiveExpression : See section  REF _Ref457437597 \r \h 11.6 MultiplicativeExpression AdditiveExpression + MultiplicativeExpression AdditiveExpression - MultiplicativeExpression ShiftExpression : See section  REF _Ref457449400 \r \h 11.7 AdditiveExpression ShiftExpression << AdditiveExpression ShiftExpression >> AdditiveExpression ShiftExpression >>> AdditiveExpression RelationalExpression : See section  REF _Ref440438334 \r \h 11.8 ShiftExpression RelationalExpression < ShiftExpression RelationalExpression > ShiftExpression RelationalExpression <= ShiftExpression RelationalExpression >= ShiftExpression RelationalExpression instanceof ShiftExpression RelationalExpression in ShiftExpression RelationalExpressionNoIn : See section  REF _Ref440438334 \r \h 11.8 ShiftExpression RelationalExpressionNoIn < ShiftExpression RelationalExpressionNoIn > ShiftExpression RelationalExpressionNoIn <= ShiftExpression RelationalExpressionNoIn >= ShiftExpression RelationalExpressionNoIn instanceof ShiftExpression EqualityExpression : See section  REF _Ref440445008 \r \h 11.9 RelationalExpression EqualityExpression == RelationalExpression EqualityExpression != RelationalExpression EqualityExpression === RelationalExpression EqualityExpression !== RelationalExpression EqualityExpressionNoIn : See section  REF _Ref440445008 \r \h 11.9 RelationalExpressionNoIn EqualityExpressionNoIn == RelationalExpressionNoIn EqualityExpressionNoIn != RelationalExpressionNoIn EqualityExpressionNoIn === RelationalExpressionNoIn EqualityExpressionNoIn !== RelationalExpressionNoIn BitwiseANDExpression : See section  REF _Ref440445026 \r \h 11.10 EqualityExpression BitwiseANDExpression & EqualityExpression BitwiseANDExpressionNoIn : See section  REF _Ref440445026 \r \h 11.10 EqualityExpressionNoIn BitwiseANDExpressionNoIn & EqualityExpressionNoIn BitwiseXORExpression : See section  REF _Ref440445026 \r \h 11.10 BitwiseANDExpression BitwiseXORExpression ^ BitwiseANDExpression BitwiseXORExpressionNoIn : See section  REF _Ref440445026 \r \h 11.10 BitwiseANDExpressionNoIn BitwiseXORExpressionNoIn ^ BitwiseANDExpressionNoIn BitwiseORExpression : See section  REF _Ref440445026 \r \h 11.10 BitwiseXORExpression BitwiseORExpression | BitwiseXORExpression BitwiseORExpressionNoIn : See section  REF _Ref440445026 \r \h 11.10 BitwiseXORExpressionNoIn BitwiseORExpressionNoIn | BitwiseXORExpressionNoIn LogicalANDExpression : See section  REF _Ref440445041 \r \h 11.11 BitwiseORExpression LogicalANDExpression && BitwiseORExpression LogicalANDExpressionNoIn : See section  REF _Ref440445041 \r \h 11.11 BitwiseORExpressionNoIn LogicalANDExpressionNoIn && BitwiseORExpressionNoIn LogicalORExpression : See section  REF _Ref440445041 \r \h 11.11 LogicalANDExpression LogicalORExpression || LogicalANDExpression LogicalORExpressionNoIn : See section  REF _Ref440445041 \r \h 11.11 LogicalANDExpressionNoIn LogicalORExpressionNoIn || LogicalANDExpressionNoIn ConditionalExpression : See section  REF _Ref440445056 \r \h 11.12 LogicalORExpression LogicalORExpression ? AssignmentExpression : AssignmentExpression ConditionalExpressionNoIn : See section  REF _Ref440445056 \r \h 11.12 LogicalORExpressionNoIn LogicalORExpressionNoIn ? AssignmentExpressionNoIn : AssignmentExpressionNoIn AssignmentExpression : See section  REF _Ref440445075 \r \h 11.13 ConditionalExpression LeftHandSideExpression AssignmentOperator AssignmentExpression AssignmentExpressionNoIn : See section  REF _Ref440445075 \r \h 11.13 ConditionalExpressionNoIn LeftHandSideExpression AssignmentOperator AssignmentExpressionNoIn AssignmentOperator : one of See section  REF _Ref440445075 \r \h 11.13 =*=/=%=+=-=<<=>>=>>>=&=^=|= Expression : See section  REF _Ref440445088 \r \h 11.14 AssignmentExpression Expression , AssignmentExpression ExpressionNoIn : See section  REF _Ref440445088 \r \h 11.14 AssignmentExpressionNoIn ExpressionNoIn , AssignmentExpressionNoIn Statements Statement : See section  REF _Ref457437637 \r \h 12 Block VariableStatement EmptyStatement ExpressionStatement IfStatement IterationStatement ContinueStatement BreakStatement ReturnStatement WithStatement LabelledStatement SwitchStatement ThrowStatement TryStatement Block : See section  REF _Ref440445201 \r \h 12.1 { StatementListopt } StatementList : See section  REF _Ref440445201 \r \h 12.1 Statement StatementList Statement VariableStatement : See section  REF _Ref457708381 \r 12.2 var VariableDeclarationList ; VariableDeclarationList : See section  REF _Ref457708381 \r 12.2 VariableDeclaration VariableDeclarationList , VariableDeclaration VariableDeclarationListNoIn : See section  REF _Ref457708381 \r 12.2 VariableDeclarationNoIn VariableDeclarationListNoIn , VariableDeclarationNoIn VariableDeclaration : See section  REF _Ref457708381 \r 12.2 Identifier Initialiseropt VariableDeclarationNoIn : See section  REF _Ref457708381 \r 12.2 Identifier InitialiserNoInopt Initialiser : See section  REF _Ref457708381 \r 12.2 = AssignmentExpression InitialiserNoIn : See section  REF _Ref457708381 \r 12.2 = AssignmentExpressionNoIn EmptyStatement : See section  REF _Ref457437654 \r \h 12.3 ; ExpressionStatement : See section  REF _Ref456010696 \r \h 12.4 [lookahead ( {{, function}] Expression ; IfStatement : See section  REF _Ref457437655 \r \h 12.5 if ( Expression ) Statement else Statement if ( Expression ) Statement IterationStatement : See section  REF _Ref432004073 \r \h 12.6 do Statement while ( Expression ); while ( Expression ) Statement for (ExpressionNoInopt; Expressionopt ; Expressionopt ) Statement for ( var VariableDeclarationListNoIn; Expressionopt ; Expressionopt ) Statement for ( LeftHandSideExpression in Expression ) Statement for ( var VariableDeclarationNoIn in Expression ) Statement ContinueStatement : See section  REF _Ref440445453 \r \h 12.7 continue [no LineTerminator here] Identifieropt ; BreakStatement : See section  REF _Ref440445472 \r \h 12.8 break [no LineTerminator here] Identifieropt ; ReturnStatement : See section  REF _Ref457437662 \r \h 12.9 return [no LineTerminator here] Expressionopt ; WithStatement : See section  REF _Ref457437663 \r \h 12.10 with ( Expression ) Statement SwitchStatement : See section  REF _Ref457437670 \r \h 12.11 switch ( Expression ) CaseBlock CaseBlock : See section  REF _Ref457437671 \r \h 12.11 { CaseClausesopt } { CaseClausesopt DefaultClause CaseClausesopt } CaseClauses : See section  REF _Ref457437672 \r \h 12.11 CaseClause CaseClauses CaseClause CaseClause : See section  REF _Ref457437673 \r \h 12.11 case Expression : StatementListopt DefaultClause : See section  REF _Ref457437674 \r \h 12.11 default : StatementListopt LabelledStatement : See section  REF _Ref457437678 \r \h 12.12 Identifier : Statement ThrowStatement : See section  REF _Ref457437679 \r \h 12.13 throw [no LineTerminator here] Expression ; TryStatement : See section  REF _Ref457437680 \r \h 12.14 try Block Catch try Block Finally try Block Catch Finally Catch : See section  REF _Ref457437681 \r \h 12.14 catch (Identifier ) Block Finally : See section  REF _Ref457437682 \r \h 12.14 finally Block Functions and Programs FunctionDeclaration : See section  REF _Ref457101484 \r \h 13 function Identifier ( FormalParameterListopt ) { FunctionBody } FunctionExpression : See section  REF _Ref457101484 \r \h 13 function Identifieropt ( FormalParameterListopt ) { FunctionBody } FormalParameterList : See section  REF _Ref457101484 \r \h 13 Identifier FormalParameterList , Identifier FunctionBody : See section  REF _Ref457101484 \r \h 13 SourceElements Program : See section  REF _Ref457437688 \r \h 14 SourceElements SourceElements : See section  REF _Ref457437688 \r \h 14 SourceElement SourceElements SourceElement SourceElement : See section  REF _Ref457437688 \r \h 14 Statement FunctionDeclaration Universal Resource Identifier Character Classes uri ::: See section  REF _Ref456003831 \r \h 15.1.3 uriCharactersopt uriCharacters ::: See section  REF _Ref456003831 \r \h 15.1.3 uriCharacter uriCharactersopt uriCharacter ::: See section  REF _Ref456003831 \r \h 15.1.3 uriReserved uriUnescaped uriEscaped uriReserved ::: one of See section  REF _Ref456003831 \r \h 15.1.3 ; / ? : @ & = + $ , uriUnescaped ::: See section  REF _Ref456003831 \r \h 15.1.3 uriAlpha DecimalDigit uriMark uriEscaped ::: See section  REF _Ref456003831 \r \h 15.1.3 % HexDigit HexDigit uriAlpha ::: one of See section  REF _Ref456003831 \r \h 15.1.3 a b c d e f g h i j k l m n o p q r s t u v w x y z A B C D E F G H I J K L M N O P Q R S T U V W X Y Z uriMark ::: one of See section  REF _Ref456003831 \r \h 15.1.3 - _ . ! ~ * ' ( ) Regular Expressions Pattern :: See section  REF _Ref457446600 \r \h 15.10.1 Disjunction Disjunction :: See section  REF _Ref457437740 \r \h 15.10.1 Alternative Alternative | Disjunction Alternative :: See section  REF _Ref457437745 \r \h 15.10.1 [empty] Alternative Term Term :: See section  REF _Ref457437746 \r \h 15.10.1 Assertion Atom Atom Quantifier Assertion :: See section  REF _Ref457437747 \r \h 15.10.1 ^ $ \ b \ B Quantifier :: See section  REF _Ref457437748 \r \h 15.10.1 QuantifierPrefix QuantifierPrefix ? QuantifierPrefix :: See section  REF _Ref457437749 \r \h 15.10.1 * + ? { DecimalDigits } { DecimalDigits , } { DecimalDigits , DecimalDigits } Atom :: See section  REF _Ref457437753 \r \h 15.10.1 PatternCharacter . \ AtomEscape CharacterClass ( Disjunction ) ( ? : Disjunction ) ( ? = Disjunction ) ( ? ! Disjunction ) PatternCharacter :: SourceCharacter but not any of: See section  REF _Ref457437754 \r \h 15.10.1 ^ $ \ . * + ? ( ) [ ] { } | AtomEscape :: See section  REF _Ref457437755 \r \h 15.10.1 DecimalEscape CharacterEscape CharacterClassEscape CharacterEscape :: See section  REF _Ref457437756 \r \h 15.10.1 ControlEscape c ControlLetter HexEscapeSequence UnicodeEscapeSequence IdentityEscape ControlEscape :: one of See section  REF _Ref457437757 \r \h 15.10.1 f n r t v ControlLetter :: one of See section  REF _Ref457437761 \r \h 15.10.1 a b c d e f g h i j k l m n o p q r s t u v w x y z A B C D E F G H I J K L M N O P Q R S T U V W X Y Z IdentityEscape :: See section  REF _Ref457437762 \r \h 15.10.1 SourceCharacter but not IdentifierPart DecimalEscape :: See section  REF _Ref457437763 \r \h 15.10.1 DecimalIntegerLiteral [lookahead ( DecimalDigit] CharacterClass :: See section  REF _Ref457437765 \r \h 15.10.1 [ [lookahead ( {^}] ClassRanges ] [ ^ ClassRanges ] ClassRanges :: See section  REF _Ref457437769 \r \h 15.10.1 [empty] NonemptyClassRanges NonemptyClassRanges :: See section  REF _Ref457437770 \r \h 15.10.1 ClassAtom ClassAtom NonemptyClassRangesNoDash ClassAtom - ClassAtom ClassRanges NonemptyClassRangesNoDash :: See section  REF _Ref457437771 \r \h 15.10.1 ClassAtom ClassAtomNoDash NonemptyClassRangesNoDash ClassAtomNoDash - ClassAtom ClassRanges ClassAtom :: See section  REF _Ref457437772 \r \h 15.10.1 - ClassAtomNoDash ClassAtomNoDash :: See section  REF _Ref457437773 \r \h 15.10.1 SourceCharacter but not one of \ ] - \ ClassEscape ClassEscape :: See section  REF _Ref457437777 \r \h 15.10.1 DecimalEscape b CharacterEscape CharacterClassEscape Compatibility Additional Syntax Past editions of ECMAScript have included additional syntax and semantics for specifying octal literals and octal escape sequences. These have been removed from this edition of ECMAScript. This non-normative annex presents uniform syntax and semantics for octal literals and octal escape sequences for compatibility with some older ECMAScript programs. Numeric Literals The syntax and semantics of section  REF _Ref424530746 \r \h 7.8.3 can be extended as follows: Syntax NumericLiteral :: DecimalLiteral HexIntegerLiteral OctalIntegerLiteral OctalIntegerLiteral :: 0 OctalDigit OctalIntegerLiteral OctalDigit Semantics The MV of NumericLiteral :: OctalIntegerLiteral is the MV of OctalIntegerLiteral. The MV of OctalDigit :: 0 is 0. The MV of OctalDigit :: 1 is 1. The MV of OctalDigit :: 2 is 2. The MV of OctalDigit :: 3 is 3. The MV of OctalDigit :: 4 is 4. The MV of OctalDigit :: 5 is 5. The MV of OctalDigit :: 6 is 6. The MV of OctalDigit :: 7 is 7. The MV of OctalIntegerLiteral :: 0 OctalDigit is the MV of OctalDigit. The MV of OctalIntegerLiteral :: OctalIntegerLiteral OctalDigit is (the MV of OctalIntegerLiteral times 8) plus the MV of OctalDigit. String Literals The syntax and semantics of section  REF _Ref440437891 \r \h 7.8.4 can be extended as follows: Syntax EscapeSequence :: CharacterEscapeSequence OctalEscapeSequence HexEscapeSequence UnicodeEscapeSequence OctalEscapeSequence :: OctalDigit [lookahead ( DecimalDigit] ZeroToThree OctalDigit [lookahead ( DecimalDigit] FourToSeven OctalDigit ZeroToThree OctalDigit OctalDigit ZeroToThree :: one of 0 1 2 3 FourToSeven :: one of 4 5 6 7 Semantics The CV of EscapeSequence :: OctalEscapeSequence is the CV of the OctalEscapeSequence. The CV of OctalEscapeSequence :: OctalDigit [lookahead ( DecimalDigit] is the character whose code point value is the MV of the OctalDigit. The CV of OctalEscapeSequence :: ZeroToThree OctalDigit [lookahead ( DecimalDigit] is the character whose code point value is (8 times the MV of the ZeroToThree) plus the MV of the OctalDigit. The CV of OctalEscapeSequence :: FourToSeven OctalDigit is the character whose code point value is (8 times the MV of the FourToSeven) plus the MV of the OctalDigit. The CV of OctalEscapeSequence :: ZeroToThree OctalDigit OctalDigit is the character whose code point value is (64 (that is, 82) times the MV of the ZeroToThree) plus (8 times the MV of the first OctalDigit) plus the MV of the second OctalDigit. The MV of ZeroToThree :: 0 is 0. The MV of ZeroToThree :: 1 is 1. The MV of ZeroToThree :: 2 is 2. The MV of ZeroToThree :: 3 is 3. The MV of FourToSeven :: 4 is 4. The MV of FourToSeven :: 5 is 5. The MV of FourToSeven :: 6 is 6. The MV of FourToSeven :: 7 is 7. Additional Properties Some implementations of ECMAScript have included additional properties for some of the standard native objects. This non-normative annex suggests uniform semantics for such properties without making the properties or their semantics part of this standard. escape (string) The escape function is a property of the global object. It computes a new version of a string value in which certain characters have been replaced by a hexadecimal escape sequence. For those characters being replaced whose code point value is 0xFF or less, a two-digit escape sequence of the form %xx is used. For those characters being replaced whose code point value is greater than 0xFF, a four-digit escape sequence of the form %uxxxx is used When the escape function is called with one argument string, the following steps are taken: Call ToString(string). Compute the number of characters in Result(1). Let R be the empty string. Let k be 0. If k equals Result(2), return R. Get the character (represented as a 16-bit unsigned integer) at position k within Result(1). If Result(6) is one of the 69 nonblank characters ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789@*_+-./ then go to step 13. If Result(6), is less than 256, go to step 11. Let S be a string containing six characters %uwxyz where wxyz are four hexadecimal digits encoding the value of Result(6). Go to step 14. Let S be a string containing three characters %xy where xy are two hexadecimal digits encoding the value of Result(6). Go to step 14. Let S be a string containing the single character Result(6). Let R be a new string value computed by concatenating the previous value of R and S. Increase k by 1. Go to step 5. NOTE The encoding is partly based on the encoding described in RFC1738, but the entire encoding specified in this standard is described above without regard to the contents of RFC1738. unescape (string) The unescape function is a property of the global object. It computes a new version of a string value in which each escape sequence of the sort that might be introduced by the escape function is replaced with the character that it represents. When the unescape function is called with one argument string, the following steps are taken: Call ToString(string). Compute the number of characters in Result(1). Let R be the empty string. Let k be 0. If k equals Result(2), return R. Let c be the character at position k within Result(1). If c is not %, go to step 18. If k is greater than Result(2)(6, go to step 14. If the character at position k+1 within Result(1) is not u, go to step 14. If the four characters at positions k+2, k+3, k+4, and k+5 within Result(1) are not all hexadecimal digits, go to step 14. Let c be the character whose code point value is the integer represented by the four hexadecimal digits at positions k+2, k+3, k+4, and k+5 within Result(1). Increase k by 5. Go to step 18. If k is greater than Result(2)(3, go to step 18. If the two characters at positions k+1 and k+2 within Result(1) are not both hexadecimal digits, go to step 18. Let c be the character whose code point value is the integer represented by two zeroes plus the two hexadecimal digits at positions k+1 and k+2 within Result(1). Increase k by 2. Let R be a new string value computed by concatenating the previous value of R and c. Increase k by 1. Go to step 5. String.prototype.substr (start, length) The substr method takes two arguments, start and length, and returns a substring of the result of converting this object to a string, starting from character position start and running for length characters (or through the end of the string is length is undefined). If start is negative, it is treated as (sourceLength+start) where sourceLength is the length of the string. The result is a string value, not a String object. The following steps are taken: Call ToString, giving it the this value as its argument. Call ToInteger(start). If length is undefined, use +(; otherwise call ToInteger(length). Compute the number of characters in Result(1). If Result(2) is positive or zero, use Result(2); else use max(Result(4)+Result(2),0). Compute min(max(Result(3),0), Result(4)Result(5)). If Result(6) ( 0, return the empty string . Return a string containing Result(6) consecutive characters from Result(1) beginning with the character at position Result(5). The length property of the substr method is 2. NOTE The substr function is intentionally generic; it does not require that its this value be a String object. Therefore it can be transferred to other kinds of objects for use as a method. Date.prototype.getYear ( ) NOTE The getFullYear method is preferred for nearly all purposes, because it avoids the year 2000 problem. When the getYear method is called with no arguments the following steps are taken: Let t be this time value. If t is NaN, return NaN. Return YearFromTime(LocalTime(t)) ( 1900. Date.prototype.setYear (year) NOTE The setFullYear method is preferred for nearly all purposes, because it avoids the year 2000 problem. When the setYear method is called with one argument year the following steps are taken: Let t be the result of LocalTime(this time value); but if this time value is NaN, let t be +0. Call ToNumber(year). If Result(2) is NaN, set the [[Value]] property of the this value to NaN and return NaN. If Result(2) is not NaN and 0 ( ToInteger(Result(2)) ( 99 then Result(4) is ToInteger(Result(2)) + 1900. Otherwise, Result(4) is Result(2). Compute MakeDay(Result(4), MonthFromTime(t), DateFromTime(t)). Compute UTC(MakeDate(Result(5), TimeWithinDay(t))). Set the [[Value]] property of the this value to TimeClip(Result(6)). Return the value of the [[Value]] property of the this value. Date.prototype.toGMTString ( ) NOTE The property toUTCString is preferred. The toGMTString property is provided principally for compatibility with old code. It is recommended that the toUTCString property be used in new ECMAScript code. The Function object that is the initial value of Date.prototype.toGMTString is the same Function object that is the initial value of Date.prototype.toUTCString. Printed copies can be ordered from: ECMA 114 Rue du Rhne CH-1204 Geneva Switzerland Fax: +41 22 849.60.01 Internet: documents@ecma.ch Files can be downloaded from our FTP site, ftp.ecma.ch. This Standard is available from library ECMA-ST as a compacted, self-expanding file in MSWord 6.0 format (file E262-DOC.EXE) and as an Acrobat PDF file (file E262-PDF.PDF). File E262-EXP.TXT gives a short presentation of the Standard. Our web site, http://www.ecma.ch, gives full information on ECMA, ECMA activities, ECMA Standards and Technical Reports. ECMA 114 Rue du Rhne CH-1204 Geneva Switzerland This Standard ECMA-262 is available free of charge in printed form and as a file. See inside cover page for instructions ECMAScript Language Specification Edition 3  TIME \@ "d-MMM-yy" \*MERGEFORMAT19-Nov-99 ECMAScript Language Specification Edition 3  TIME \@ "d-MMM-yy" 19-Nov-99 ECMAScript Language Specification Edition 3  TIME \@ "d-MMM-yy" \*MERGEFORMAT19-Nov-99 ECMAScript Language Specification Edition 3  TIME \@ "d-MMM-yy"\*MERGEFORMAT 19-Nov-99 ECMAScript Language Specification Edition 3  TIME \@ "d-MMM-yy" 19-Nov-99 ECMAScript Language Specification Edition 3  TIME \@ "d-MMM-yy" \*MERGEFORMAT 19-Nov-99 PAGE 22 PAGE v ECMAScript Language Specification Edition 3  TIME \@ "d-MMM-yy" 19-Nov-99 PAGE 22 ECMAScript Language Specification Edition 3  TIME \@ "d-MMM-yy" 19-Nov-99 ECMAScript Language Specification Edition 3  TIME \@ "d-MMM-yy" \*MERGEFORMAT 19-Nov-99 PAGE 22 PAGE 133 ECMAScript Language Specification Edition 3  TIME \@ "d-MMM-yy" 19-Nov-99 PAGE 180 cf5 q1 q2 cf4 q1 q2 cf3 q1 q2 Cfp CFP1 CF prototype P1 P2 cf1 q1 q2 cf2 q1 q2 implicit prototype link explicit prototype link =>?efuvyg /01KLMNOPZ[\vǧǧǧjUmHnHuj}UmHnHu"5CJOJQJaJmHnHsH ujUmHnHujUmHnHuaJmHnHuCJ jCJUmH sH OJQJ mHnHu jU5CJ0CJ03=>wxyIJ $dN^J $J ^J a$J &dP^J $-DM a$ l g h q   & 3 B R b r | V    ( 4 A N Y g u PJVvwxyz{   !"<=>?@AFLMg穐t穐jkUmHnHujUmHnHuB*mHnHphujqUmHnHuCJOJQJaJmHnHsH ujUmHnHuaJmHnHu"5CJOJQJaJmHnHsH u mHnHujUmHnHujwUmHnHu-P{Al1e9k;o >sghijklq,-./016EF`abcdejYUmHnHujUmHnHuj_UmHnHujUmHnHujeUmHnHuB*mHnHphuCJOJQJaJmHnHsH u mHnHujUmHnHujUmHnHu2ej{| 456789?KLfghijkq|}jG UmHnHujUmHnHujMUmHnHujUmHnHujSUmHnHuCJOJQJaJmHnHsH ujUmHnHujUmHnHu mHnHuB*mHnHphu2 6789:;AOPjklmnouj UmHnHuj; UmHnHuj UmHnHujA UmHnHuj UmHnHuB*mHnHphuCJOJQJaJmHnHsH u mHnHujUmHnHu5   9:;<=>DSTnopqrsyjUmHnHuj)UmHnHuj UmHnHuj/ UmHnHuj UmHnHuB*mHnHphuCJOJQJaJmHnHsH u mHnHujUmHnHuj5 UmHnHu2)*+EFGHIJOfg  ƾ栕栕y栕kjUmHnHujUmHnHujUmHnHuB*mHnHphuCJOJQJaJmHnHsH ujUmHnHuaJmHnHu"5CJOJQJaJmHnHsH uj#UmHnHujUmHnHu mHnHuaJmHnHu*J I"i*`/]9| ^    )*DEFGHIN`a{|}ޯޙy"5CJOJQJaJmHnHsH uj UmHnHuaJmHnHujUmHnHuaJmHnHujUmHnHujUmHnHuB*mHnHphuCJOJQJaJmHnHsH ujUmHnHu mHnHu+ !"GHIcdeghixyz  $j|UmHnHujUmHnHujUmHnHuCJOJQJaJmHnHsH ujUmHnHuaJmHnHu"5CJOJQJaJmHnHsH u mHnHujUmHnHujUmHnHu-$%&()*/?@Z[\^_`eop )*+єєxjjUmHnHujUmHnHuaJmHnHujpUmHnHujUmHnHujvUmHnHuB*mHnHphuCJOJQJaJmHnHsH u mHnHujUmHnHujUmHnHu/+-./;<=WXY[\]bqr345789>[\v޽޽޽޽޽jUmHnHuj^UmHnHujUmHnHujdUmHnHuB*mHnHphujUmHnHuaJmHnHuCJOJQJaJmHnHsH ujUmHnHu mHnHu4vwxz{|    =>XYZ\]^efgѰѰь~l"5CJOJQJaJmHnHsH ujLUmHnHuaJmHnHujUmHnHujRUmHnHuB*mHnHphujUmHnHuaJmHnHuCJOJQJaJmHnHsH u mHnHujUmHnHujXUmHnHu*"#$&'(;<=WXY[\]pqrj: UmHnHujUmHnHuj@UmHnHujUmHnHujFUmHnHuaJmHnHuCJOJQJaJmHnHsH ujUmHnHujUmHnHu mHnHu3(]IXd"k I { ()CDEGHI_`a{|}ԸԢԔԆj"UmHnHuj."UmHnHuj!UmHnHuaJmHnHuj4!UmHnHuj UmHnHu mHnHuB*mHnHphuCJOJQJaJmHnHsH ujUmHnHu3678RSTVWXijkѳwj%UmHnHuj$UmHnHu"5CJOJQJaJmHnHsH uj"$UmHnHuaJmHnHuj#UmHnHuaJmHnHuCJOJQJaJmHnHsH u mHnHujUmHnHuj(#UmHnHu-CD^_`bcdqrs !"IJKefgѰѰѰѰxj (UmHnHuj'UmHnHuj'UmHnHuj&UmHnHuaJmHnHuj&UmHnHuB*mHnHphuCJOJQJaJmHnHsH u mHnHujUmHnHuj%UmHnHu/gijkwxy     ' ( ) C D E G H I Y Z [ u ޽ޙy"5CJOJQJaJmHnHsH uj)UmHnHuaJmHnHuj)UmHnHuj)UmHnHuB*mHnHphuj(UmHnHuaJmHnHuCJOJQJaJmHnHsH ujUmHnHu mHnHu+u v w y z { !!.!/!0!2!3!4!:!a!b!|!}!~!!!!!!!!!!!!!j,UmHnHujo,UmHnHuj+UmHnHuju+UmHnHuj*UmHnHuB*mHnHphuCJOJQJaJmHnHsH u mHnHujUmHnHuj{*UmHnHu2 4!!!!"X"""#8#h###$R$$$%F%%%%(&e&&&%'[''!!!!!!!!!!!!!""""""%"7"8"R"S"T"V"W"X"z"{"|""""""""""""""""""""Ƣj]/UmHnHuj.UmHnHuaJmHnHujc.UmHnHuj-UmHnHuCJOJQJaJmHnHsH uji-UmHnHujUmHnHu mHnHuB*mHnHphu1"""######2#3#4#6#7#8#F#G#H#b#c#d#f#g#h################Ѱ琈zpOJQJmHnHujQ1UmHnHuaJmHnHu"5CJOJQJaJmHnHsH uj0UmHnHuaJmHnHujW0UmHnHuB*mHnHphuCJOJQJaJmHnHsH u mHnHujUmHnHuj/UmHnHu&#########$$$$$$$1$2$L$M$N$P$Q$R$X$k$l$$$$$$$$$$$$$$$$$$$$%%%%%j?4UmHnHuj3UmHnHujE3UmHnHuj2UmHnHujK2UmHnHuB*mHnHphuCJOJQJaJmHnHsH u mHnHujUmHnHuj1UmHnHu2%$%%%&%@%A%B%D%E%F%L%`%a%{%|%}%%%%%%%%%%%%%%%%%%%%%%%%%%&&"&#&ȽȽȽȽqj6UmHnHuj36UmHnHuj5UmHnHuCJmHnHuCJOJQJmHnHuj95UmHnHuB*mHnHphuCJOJQJaJmHnHsH uj4UmHnHujUmHnHu mHnHuaJmHnHu,#&$&&&'&(&D&E&_&`&a&c&d&e&}&~&&&&&&&&&&&&&&&&&&''' '!'#'$'%'9':';'U'V'W'Y'Z'['a'f'߰߰߰j!9UmHnHuj8UmHnHuj'8UmHnHuB*mHnHphuj7UmHnHuaJmHnHuj-7UmHnHuCJOJQJaJmHnHsH u mHnHujUmHnHu2f'l'v'w'''''''''''''''''''''''(( ( ( ( ((.(/(I(J(K(M(N(O(U(p(q((((ĹĹĹĹwj;UmHnHuj;UmHnHuj:UmHnHuOJQJmHnHuj:UmHnHuB*mHnHphuCJOJQJaJmHnHsH uj9UmHnHujUmHnHu mHnHuCJOJQJmHnHu.'' (O((()F)))*H***+L+++,,{,,-M---6.../UmHnHuj>UmHnHuOJQJmHnHuB*mHnHphuCJOJQJaJmHnHsH uj>UmHnHujUmHnHu mHnHu0*********+++++ +'+(+++,+F+G+H+J+K+L+R+u+v+w+y+++++++++++++++++++,,ԼԮԢʢԔ~jAUmHnHuaJmHnHujnAUmHnHuCJOJQJmHnHuj@UmHnHujt@UmHnHuOJQJmHnHu mHnHuB*mHnHphuCJOJQJaJmHnHsH ujUmHnHu1, , ,&,',(,*,+,,,2,U,W,Z,[,u,v,w,y,z,{,,,,,,,,,,,,,,,-------(-)-,---G-H-I-K-З{j\DUmHnHujCUmHnHuaJmHnHujbCUmHnHujBUmHnHuOJQJmHnHuB*mHnHphuCJOJQJaJmHnHsH ujhBUmHnHujUmHnHu mHnHu0K-L-M-S-p-q-t-u-------------------....0.1.2.4.5.6.<.j.k...............ԼԮԠԒԄjFUmHnHujPFUmHnHujEUmHnHujVEUmHnHujDUmHnHuOJQJmHnHu mHnHuB*mHnHphuCJOJQJaJmHnHsH ujUmHnHu4........//////6/7/8/:/;/IUmHnHujHUmHnHujDHUmHnHuOJQJmHnHujGUmHnHuaJmHnHujJGUmHnHujUmHnHu mHnHuB*mHnHphuCJOJQJaJmHnHsH u06?6Y6Z6[6]6^6_6x6y6z666666666666ɽɽɽɽjmVUmHnHujUUmHnHujsUUmHnHujTUmHnHuOJQJaJmHnHuaJmHnHuCJOJQJaJmHnHsH u mHnHujUmHnHujyTUmHnHu4_6667F7x77738d8889<999$:x:::O;;;-<t<<=B== 6666666666667 7 7 7 77$7%7&7@7A7B7D7E7F7J7K7V7W7X7r7s7t7v7w7x7~7777ȼЦxmB*mHnHphujaXUmHnHu"5CJOJQJaJmHnHsH ujWUmHnHuaJmHnHujgWUmHnHuOJQJaJmHnHuaJmHnHuCJOJQJaJmHnHsH ujUmHnHujVUmHnHu mHnHu)777777777777777888-8.8/818283898C8D8^8_8`8b8c8d8j8y8z88888888888Ѱ~aJmHnHujZUmHnHujUZUmHnHujYUmHnHuaJmHnHuj[YUmHnHuB*mHnHphuCJOJQJaJmHnHsH u mHnHujUmHnHujXUmHnHu-888888888889999999697989:9;9<9B9i9j99999999999999999ϱ瓈z瓈l瓈jC]UmHnHuj\UmHnHuB*mHnHphuCJOJQJaJmHnHsH ujI\UmHnHuaJmHnHuj[UmHnHuaJmHnHu"5CJOJQJaJmHnHsH u mHnHujUmHnHujO[UmHnHu*9:::: :":#:$:*:W:X:r:s:t:v:w:x:~::::::::::::::::::;.;/;I;J;K;M;N;O;U;m;n;;Сj_UmHnHuj7_UmHnHuaJmHnHuj^UmHnHuj=^UmHnHuB*mHnHphuCJOJQJaJmHnHsH uj]UmHnHujUmHnHu mHnHu0;;;;;;;;;;;;;;;; < <'<(<)<+<,<-<3<S<T<n<o<p<r<s<t<<<<<<<<<<<<<<<<єxjbUmHnHuj%bUmHnHuaJmHnHujaUmHnHuj+aUmHnHuj`UmHnHuB*mHnHphuCJOJQJaJmHnHsH u mHnHujUmHnHuj1`UmHnHu/<<===!="=<===>=@=A=B=H=p=q================= >>(>)>*>,>->.>@>A>B>\>]>^>`>a>b>h>>>>ޓjeUmHnHuaJmHnHujdUmHnHujdUmHnHujcUmHnHujcUmHnHuB*mHnHphuCJOJQJaJmHnHsH ujUmHnHu mHnHu4==.>b>>>???? @b@@@CAAABYBBBEC{CCD^DDD0E}EE>>>>>>>>>>>>>>>>??9?:?;?=?>???E?o?p???????????????????@@@цxjhUmHnHuaJmHnHujgUmHnHujgUmHnHujfUmHnHuj fUmHnHuB*mHnHphuCJOJQJaJmHnHsH u mHnHujUmHnHujeUmHnHu/@ @ @ @@@@A@[@\@]@`@a@b@h@@@@@@@@@@@@@@@@@@@!A"AAAABACAIAiAjAAAAAAAAAAAޅaJmHnHujrjUmHnHujiUmHnHujxiUmHnHujhUmHnHuj~hUmHnHuB*mHnHphuCJOJQJaJmHnHsH ujUmHnHu mHnHu4AAAAAAAAABBBBBBB7B8BRBSBTBWBXBYB_BBBBBBBBBBBBBBBBBBC#C$C>C?C@CCCDCECj`mUmHnHujlUmHnHujflUmHnHujkUmHnHujlkUmHnHuB*mHnHphuCJOJQJaJmHnHsH u mHnHujUmHnHujjUmHnHu2ECXCYCZCtCuCvCyCzC{CCCCCCCCCCCCC D D DDDDDOAOBOCO\O]O^OxOyOzO}O~OOOOOOOOOOOOOOOOOѢxjЄUmHnHujSUmHnHujփUmHnHuaJmHnHujYUmHnHuj܂UmHnHuB*mHnHphuCJOJQJaJmHnHsH u mHnHujUmHnHuj_UmHnHu/OOOOOP P:P;Pbbbefgg+h;kl`noorv9w32Irrrrrss0t?tww5x8x{{{{{{{{{{{{{{{{{{V|Z|||||||||||||[}a}z}}<~G~ Xcm /?N؄aeDžl6CJOJQJ565H*5 5OJQJjUmHnHu6 CJOJQJT9wwwz{{O|T|t||Q}X}.~:~~~}+<0K;(#&#$$d%d&d'd+Dʒ/NOPQ+;NXYe]jċЋŌӌ 9lpȆΆMP6<nt̉҉NQ78QRSYZlxًߋՌ}fg$'qې-5ET.6IX|}1@DVjU65CJj;UjU jU 5OJQJ565R ŏYo'GNd?f1+VLRop-OQRTҗטؘ٘ޘߘ{>@›ۛܛݛ9<hyҜӜ՜֜؜ٜxyܝߟSTjUj/U 5OJQJjUOJQJj5U jU6Qɠʠ̠͠ϠР ~6<צ5?v(+O[zǨۨ LXթ&)kz68OSɫ˫̫ѫҫH*56OJQJ566 5OJQJ jUZ@#9Su̫2G߭819Jr1+DFGNOY\^_iloxy~  !+-.8;=>GHMN\`aknpqz{ !*3=BKT^a5656OJQJH* 5OJQJ]aknw~î̮Ӯ!+.K]@KLMPQ9GJѲܲݲ޲3 5OJQJ56CJOJQJ j6CJ566CJ jCJCJ656OJQJQrvyٷ̸ƹ&9Oe@xN1+3M[ȴ̴ڴ$2U[jt;B-;|589NӼԼBCKLtuDEmn|} j- j-55 5OJQJH*CJ6CJ56OJQJ566U67LMfgopvwxz|}~  !"#km 79EK-/L^N]@Bi{: 5OJQJ56j)UjU5 j j-6UN/DEY)0Cy-,1+9t:F&'.28xHrrr$Ifr$$IfT F<W\ _    t'     4  a$-DIfM  &'.9@SZjq}hi&-BIy{4B  aoʼ56OJQJjU65j%U56 5OJQJ 56B*fHphq  56B*fHphq jU jUB89@MRSZdih\$If]$$IfT F<W\ _  t'     4  aijqw|}L?x]$$IfT F<W\ _  t'     4  a$If]$$IfT F<dS l  t'     4  a?]$$IfT F<W\  _   t'     4  a]$$IfT F<W\ _  t'     4  a$If"t\n$Ifo$$IfT F=     t'    4  a$-DIfM -,  %&xCpZ$$IfT F=   t'    4  aZ$$IfT F=   t'    4  a$If&-<ABI]bZ$$IfT F=   t'    4  a$Ifbcj| #s-,Z$$IfT F=   t'    4  a "QTUVor *+SUfm|} 09\^45DE,6pq"#0;0>?XYijopwjU jU655656OJQJH*W ,V!HOV_5>$If,-h`tj$$Ifl\{ I!gggg4 la$If!"*-345<?CDEHSZ[L@\j$$Ifl\{ I!gggg4 la$If[\]s7@EIOPX_ip$If,j$$Ifl\{ I!gggg4 lapqv~dpx$Ifj$$Ifl\{ I!gggg4 la !"#$\j$$Ifl\{ I!gggg4 la$If$0<"5_q!]yVbx-,wxSUjru24CFGInp!\y Vtvw}<>%'(25j6U j6U56OJQJ566 5OJQJUbi~f8$$Iflֈ n4 la@$If, jLj<$$Iflֈ n4 la@$If jD$$Iflֈ n4 la@$If j<jL$$Iflֈ n4 la@$If jPjh,$$Iflֈ n4 la@$If  !"#$-4?wjfdb`-,x$$Iflֈ n4 la@$If w(3=0B 5Li-,23<^b ?AXYgky|}~ BKLiv <>?AKM !&(*3)*,-;IWcqrtu6H*56OJQJ56 5OJQJ5[*?r*4YWVz]! x"9,- 12@ANct(12:;IUaps'39:HT`oqr#019:;<DE6H*H*5656OJQJ65\Eeqwx)6KTU]^lx%-.N[gtuwx #03RS`my 5OJQJ6H*5656^oR$r\Fy E x   y z   >=x ! %&CP\hiklmt|} .:;=>?FRSUVW^fgijk|5566 5OJQJ_$%'()0<=?@AHPQSTUfrsuvw~&')*+2:;=>?PXY[\]dlmopq 5OJQJ56a      $ % ' ( ) 0 8 9 ; < = O W X Z [ \ c k l n o p                       , - 5 D U o w   < ? y z   jU 5OJQJ56_           e p      IMdf!29FGHKVWX[jlCJ j6CJ6CJ56OJQJ5H* 6OJQJ56 5OJQJ6 jUjUN$Mg "{/Pj 6\,-,EGIOPj}  3567  &'()* 5BCEFG 5OJQJ5j UjUjUjU jU56OJQJ656N,+\+u ^G [gw$$-DIfM !! GH^_`nEZf}  5LNOd'Tj()+,-.<M\h}~OJQJ5 5OJQJ6_%6EQ`bcz"$%6GYetvw.Cg 5OJQJ 56B*fHphq 6CJ jCJCJOJQJ65 5OJQJPvhkccc$$If $$$Ifa$$$IfT\(. p d    t#(4 a|~~~~~~tu $$Ifa$$$If $$$Ifa$m$$IfT\(.pd t#4 a  $)h{{{$$If $$$Ifa$j$$IfT\(.pd4 a$If)*-4DIJMTacdgn{~~~h~~~h~~$$If $$$Ifa$m$$IfT\(.pd t#4 a*,-3JLMSabcdfgm{|~"*+:;>LSc*?@BCDMNVW_`h  . 6 R Z \ b d r   P!H*56 5OJQJOJQJ 5OJQJ\{}~\~ $$$Ifa$m$$IfT\(.pd t#4 a$$Ifv \ ^!z!A$&&&&}{{ywu-,9! x! m$$IfT\(. p d   t#4 a P!R!V!\!!!!!!!!1#4#}#~############$$4$5$6$=$>$%'%0%F%3&H&M&c&&&&&&&&&' 'T'V'W'^''''''''''''''''( ((((8(:(;(<(H*6CJ56OJQJ566jUjU5jU jU 5OJQJN& '='W'''''&(;(K(\(((())|,,../@0Z0o1343542x9-,<(Y([(l(t(((((((K)M)))))N*c*h*~***Z+r+++,,,,---!---3-C-H-/&/00>0W0X01"1222222I3W344444444444"54555L5M5Q5_5e5h555555556CJOJQJ 56CJCJjU jUCJ6 5OJQJ56CJ56P4"5655555"646d6u666788>99 :5:@:J:::C;P;v;;"321+955555555555555555555 66666 6!6"6263646;6?6M6S6T6^6a6b6c6d6r6t6u6z6{66666666666666R7`7777777777777788 8(8688885CJOJQJ6CJCJH*6CJOJQJCJ6CJ56CJOJQJ 56CJCJQ888888888899A9K9Q9W9[9`999999999999: :<<<<<===E=K=a=o===== > >J>K>W>e>u>v>{>}>????1B2B3B4BCC C^CgCCCDD DDMENEgEhEiEjEkEHHLj~U jU65 5OJQJ6CJCJ5CJOJQJU;;<<<<<=====>>>???}@@AAABBiCwCCx9"CCD!DFHKKN|P{QRR7SBSS'T2T~T7UUZ[[1\E\\\ 79LLLLLLLL@MCMZM]MMMMMOOO(OOOOOOOOOP PPPGPOPPPPPPQQQQRRRRRwRyRRRRRRRRRRRS S S S S7S8S9S:S;SS@SASHSISSSTSWSXSzS|SSSSSS6H* j6 j-5 j5 5OJQJ5 j-H*WSSSSS'T(T)T*T+T,T-T.T0T1T8T9TCTDTGTHTjTlTrTsTwTxTTT+U-U2U4UNU]UUUUU!V"V*V+VVV W WWyW}WWWWWWWWWWWWWWWWWWWWWWWWWXXXXXXXXXXXXX j55 j-5 jp 5OJQJ6H* j6H* j-VXXXYYYYY:Y;YcTeue;fGfvffffffffgg=gIggg h hhh"i.iiijjCjHj/k5k7kq?q@qjfUjUjlUjU jU 56B*fHphq  5OJQJ65K]eheteueeeeXPPP$$If$$IfTlF,t"f 2 H   t0    4 la$$-DIfM eeeee} uuu$$If$$IfTlF,t"f2 H t0    4 laeeee1f2f:fIflfmfufff} uuu}uuu}uuu$$If$$IfTlF,t"f2 H t0    4 la ffff+g}uuu$$If$$IfTlF,t"f2 H t0    4 la+g,gkkkklOncpysswXwusssss$$IfTlF,t"f2 H t0    4 la$If @qGqHqJqKqdqeqfqmqnqpqqqqqqqqqqqqqqqqqqqqqqUrVrorprqryrzrrswssssstt"t#tGtHtktltttttttuu]u^uwuxuuuuuuuuuuuvvJvKvvvvv65jטUjZUjݗUj`UjU jUQssDt|tttt!u3uBuuuu)v}vvvvbwqwwx=xwxxxP & FP & FP & FP & FP & Fvvv:w;wTwUwVw^w_wwwwwx x,x-xpxux~xxxxxxxxxxxxDyEycydyyyyyyyyyyyyy(z)zjzkzzzzzzzzz{{<{={C{D{M{Q{{{{{{|c|d|l|p||||}^}_}g}k}}}~~c~d~s~ 5OJQJ5jTU jU6\xx y!yyyy+z=zLzzz{F{S{k{{ |7|||}2}}}P & FP & FP & FP & FP & FP & FP & F}}A~~~~<z8U;+>ԃjYBOvO & FE32P & FP & FP & Fs~|~~~~~^_nx@Iyzƀǀ>uwMW#%+JNlv͇؇WXstAB^lhiދQ7<>FHjNU56jљU jU56 5OJQJW)9x!==Qm‘ÑӑO & FFO & FFO & FEO & FEHNSXÐȐʐАِݐ 49?Efk ˔()!9KLV[bg˜ؘ֘ژۘܘ swxy  OJQJ j-5j˚U jU6fHq 56fHq 56 5OJQJN!()3itll$$Ifz$$IfTl0b,"   04 la$$-DIfM ijo$$Ifk$$IfTl0b,"04 la"#*`ah×ėŗϗ$$Ifk$$IfTl0b,"04 laϗ9DKLV\qDkk$Ifz$$IfTl0b,"   04 la$-DIfM \]bh0$Ifk$$IfTl0b,"04 lahiq yzx4$Ifk$$IfTl0b,"04 la  o<ii$Ifz$$IfTl0b,"   04 la$-DIfM  #$$Ifk$$IfTl0b,"04 la "#:;OScey~'HKbesvܜߜ>Ax{#&'(CFadsvԞ!"'58GIWYy|}ßğ>RYgq56OJQJH*566 5OJQJOJQJ5X#$,ƚ4Ntyy & F$If h$If$Ifk$$IfTl0b,"04 laN`abMf,Bf|-,k$$IfTl0b,"04 la & F$If|ΝewԞ"'9g}ğEIC!!x,-qr ;<G[z{ 0145CSghkly|  "0BM^_bctΥܥ1?Xd6H*CJjśU5 5OJQJ6jHU jUVCZmM٩F"f7}ŮUů5mݰM!duxyz{˦֧ڧ%>BOPQ^kwȨը >JWpt˩ש *BOkxy6H* j-H*5656OJQJ j5H* j-5 5OJQJ56TêϪժ֪'5BCKLMUVvȫի#)*8DPimzˬ̬٬ ,9:=>JXdp}~ҭޭ(5AOS6H* j-H*5656OJQJ56[S`an{îϮݮ'34789@HILMN_klopqxϯۯܯ߯ (),-.?KLOPQX`adefw 5OJQJ5566_ȰаѰ԰հְ   +,/018@ADEFW_`cdeltuxyzɱʱͱαϱֱޱ߱ +3476 5OJQJ5aM!Vβ2B%Jjи$N & FN & FN & F>=x!!789@HILMN`hilmnu}~IJ̲ز-01BCKZk  &'(+,Mf!-<=Z]fhz|~ j5 j-5jBU jU j-56 5OJQJV9;XYZ\fhiйӹչ׹ٹڹ۹ݹ޹߹>@13EFHJhn()@AUV>@Amo۾ݾ NOTUVxy  qtz{6 j5 j-55 j-H*]hݼs˽߾[޿j<aN & F N & F N & FN & F89N & F{68xyVW$(=CX]ryEHVWX^_ jOJQJ j-5 5OJQJ6fHq 56fHq 56H* j- j5MH`i]\U$$Ifz$$IfTl0b,"   04 la$-DIfM $$-DIfM 8 4$$Ifk$$IfTl0b,"04 la$If E{|1`$If$$Ifk$$IfTl0b,"04 la1CDEi[sDmO & FGk$$IfTl0b,"04 la$If"#]^efrstu&'DEFGpqvw}~ABRS j- 5OJQJ j-6 j-6H* j6 jH* j-H*6H*TOPQ 34DEGHNOfghiopqrstuv{| ./Z[ j-6H* j jH* j-H*6H* jOJQJ j-55 j-6 j-5OJQJNm}5v$%.$-DIfM :89O & FG <kab{|}./045 &. :Acj,0fm jUj<UjU jU56fHq 56fHq  5OJQJ6L~~$Ifz$$IfTl0b,"   04 la$Ifk$$IfTl0b,"04 la[\c GHI\$Ifk$$IfTl0b,"04 la\EQbHAXL^6K4>TIO & FHO & FH3 ->J>Fh{3?+4?R12XY[\+>Tgk %&1DI\345:;iz}jUj6U jU5 5OJQJ6X8Bdh=G  $%&*+{()9:BCfl.48;=@Z^w{#hloseiuyjUj0U jU 5OJQJ56XV]FSqask32kb%l7Imt%1-,23)-GKKRxy#$%&./01;K6H*OJQJ 6OJQJH*jUj*U jU65 5OJQJOJQJ56OJQJ56L1;F X     5 s    s    " o   O & FLO & FLO & FKO & FKO & FJO & FJO & FIO & FI & FKWXY[]dghi. / 5 6 h t u v w y                 ( 3 > E         * 5 6 7 9 @ C D X                        D X     56 CJOJQJOJQJ6H* 5OJQJ56Y  ; Z t   Rno-4De$c-,O & FNOO & FN & FO & FMO & FM +23467<EklBCDGHJbcd~$4ABCEFGH'OghijwxyzOJQJ 5OJQJ56OJQJ 6OJQJ 6OJQJ56OJQJ5656Rc);2<Sr0O & FSO & FRO & FRO & FQO & FQ$ & Fa$O & FPO & FP & FO & FOO & FO":EQ\p  x"#$%3dr7=#$[\hj{|./;56OJQJ56 5OJQJ56\Nt%7 %Ye{-,9O & FUO & FUO & F O & F O & FT & FO & FS;=LMcdefgjyz]^yz34rs\fw BPmpq CJ CJOJQJ56 5OJQJ5656OJQJX L"@ah 'A[iO & FVO & FV+,-iz5 k   !P!!"#"2"""#,#k##&$$O & FYO & FXO & FXO & FWO & FW ) 1 2 3 6 Q t      !!! !!;!D!!!A"O"P"Q"R"b"c"l"""""""#####V#_### $$$Y$]$$$5%D%E%_%%%%%&&&'''''!'"'#'&'x''''''''''''jUjUj$U jU 5OJQJ65U$%&%%&&'@'i''''#(B(\((()#)=)***x* & FO & F]O & F]O & F\O & F\O & F[O & F[O & FZ9O & FYO & FY'' ( (,(@(((((((((() )!)9*I*J*K*L*^*****++++++6+7+;+I+O+R+}++++++++++++++@,A,p,q,,,,,,,, ----5-6-:-H-N-O-Q-R-t----..jU jUOJQJCJ6CJ56OJQJ5656 5OJQJRx******S+n+++,2,,,,,k----?.d.v...O & F`O & F`O & F_O & F_-,O & F^O & F^...3.4.5.;.<.........../ ///,/-/>/?/P/Q/f/l///////// 0000000001&151X1a1g1m111111111.222;2F22222222222վվ 5OJQJ56fHq OJQJ 5OJQJ56 CJOJQJ56OJQJ56jU jUK..b/v///0,0M0000171Q1c1w1112H2b22O & FcO & FcO & FbO & FbO & FaO & Fa-,222222v\pp$Ifz$$Ifl40& ` :  04 la$-DIfM 2222<$Ifk$$Ifl40& `:04 la2222223 3333I3R3S3{333LDD$Ifk$$Ifl40& `:04 la22233333I3Q3R3{3333333334.4r4s4444444444<5L5M5N5Q5`55555 66!6"6;6<6=6C6D666666666667-7{7|7777777788888#8384858 j-5 CJOJQJjUjU jU56 5OJQJ 5OJQJQ33333404J4d4455-5z5|zO & FdO & Fdxk$$Ifl40& `:04 la$If z5555G6l6~6667/7I7c7u778`8z8888&989S99O & FgO & FgO & FfO & FfO & FeO & Fe586878F8i8x88888O9P9b9r9s9t9u9v9999c:d:v:::::::::;;;$;-;1;l;m;;;;;;;; <<1<2<]<<<===========>>> > >>>(>j UmH sH jUmH sH mH sH jUmH sH 56OJQJ5656 5OJQJH9999::L:g::::;&;3;L;S;n;; <<<<=+=E=_=N & F!-,O & FiO & FiO & FhO & Fh(>)>*>0>1>S>T>b>c>d>????h@k@LCMC[C\CDDDDEEP?PTQUQQQQQQQFRYRZRnRoRRRRRRmSoSTTTTTTT jU656OJQJ56 j-5 5OJQJOJQJmH sH jUmH sH jUmH sH L_=4>F>^>!???5@m@@{A?CWCDDlEEFFGG=HEJ]JJuKM N932N & F!N & F! N6NnNNO{O'Q:QAQVQQQ7RRRRRS3SPST4TNTTTTU?UO & Fj-,32TTTTTRUXUVVVVVVVVVVV W.W@WeW}W%X&X?X@XAXGXHXXXXXXXXXYYZZ#Z&ZVZYZ[[[Y[[[[[]]^^^^^^^^^^^^^'_(_L_N_r_56OJQJ56 6OJQJ j-5 B*ph CJOJQJjU 5OJQJ6OJQJ5 jUjUH?URUVV%WBW\WWWWWKX]XXYYYY(Z[ZZZ][[[]^_32O & FkO & Fk9O & Fj__)___8`````aa6aaaabbbc)cFc`cycccdO & FmO & FlO & Fl-,r_t_____G`W`X`i`k`~`````bbbbbbbbb c2cDcddGeWeXeieleeeeeehgiggggggghh-h7h]h_hhhhhhh i i6i8ibili}iiiiiiiiiijjjjkkAkYkkkkkkkk56 5OJQJ56OJQJ56OJQJZddd8eeeeeff8ff%g7gLgSgjgphh}ijjjkkl$$9-,O & FnO & FnO & Fmkkkkkkk"l6l[ljllllllllllm mEmFmXmmmnmommmmmmmmmnSnTnmnnnonunvnnnnnnnn o o o o!o#o$o3oVojooooo p p ppp'p,p.p8pApFpZp^pppppppjUj}UOJQJ5jU jU 5OJQJ6Sl8lRlllll)mImmmmnnynnnMoloooop`pppO & FqO & FqO & FpO & FpO & FoO & Fopppppppq3qBqqqqqqqqqqqqqqqr@rArDrErMrNrSrTrjrnrprurzrrrrrrssssssss)t,t5t>tPtSt\tetttttttttttttuuuu'u(u)u2u7uIuJuKuTuXujukuluuu j5 j-55jwU jU 5OJQJ6Xpq*qDq^qqr1rrs'ssst@tgtttu9uZu|uuavYwwuxxO & FsO & FrO & FruuzuuuuuuBvFvZv_vvvvvvvvvvvwwwwwwwwxxDxExyxzxxxxx)y*y@yAyDyEyNyRyfykymysyd{x{y{z{{{{{{{{||W|`|||6}K}L}M}a}b}d}e}t}}}}}"~+~~~,.56OJQJ56 5OJQJ6 j5 j-55Xx=ymy={U{{{{|0|l||}}'}}}}}}7~Q~~~O & FuO & Fu$$$O & FtO & Ft$$$9O & FsO & Fs~~~~Ig!@ZʃVsƄ$O & FwO & FvO & Fv$$-,.WZKNMcс,>CW}Ђ*>%'(<_q !48AFZ^jqUjU jU 5OJQJOJQJ655656OJQJR$`4Z{چ 0Uc|%SEߊUˋً9O & FxO & FxO & FwŅɅ҅ͅ!"<=TXbcuy†Ædžʆӆ؆݆ކ  !*.3489:?ADFOS\akl !6:>?DFOS\auz jU j-556_ #()-168;DMQVW[diknr{Љ҉߉<=BCMN̊Ίۊ܊@AQR]^st‹Ëȋɋҋ׋ًߋ+;bpی܌݌ߌ 5OJQJ65 jUjU\=rیLp1Tڐ-j|-Gf"O & FzO & FzO & FyO & Fy; 8CDIJ&(NQcuwxƐؐȑɑʑˑޑ+Pd͒ђڒߒ1278@AFG]aejēɓӓԓ >?CFOTYZ^ajot56OJQJ 5OJQJ_"˓;VqǔՖܖ0KTjĘ-,O & F{O & F{tuŔʔ˔ϔД֔ה $%*+͕ѕՕ֕ەܕ "#()}~IJ{|՗֗9:hi˜Ø56OJQJ56jkU jU j-56XĘۙ m]sΛ%ɜN & F#,N & F"N & F"-)+,2ߚBDqr̛͛$4IJ`bv)fyz{|ʝݝ$(EY  G_ax}Пҟ +-13ʠϠ./_` :OJQJ 5OJQJ56OJQJ5656Z +EWߝ<[u РנEaá͡OmN & F%-,9$$N & F$N & F$N & F#N & F#`á̡ܡ  5Xkڢ0Dv£ף*/GoΤԤpzئ٦HI§G[23EYZ[\rstu©ͩJM_tuOJQJ56 5OJQJ6556OJQJZǢ F`rΤæڦ/Jçŧȧ˧Χѧԧاܧ$If-,9$$N & F%N & F%ܧ6ĩ"4P4SmѫO & F}O & F}O & F|O & F|$$Ff$If=Q@Ajk̬2drխ(27KxyQ[]fxXiͰ߰ nopqбֱױرٱڱ۱ܱ  #)*+,-:H* 5OJQJ556OJQJ56 :OJQJ6Yѫ1B4N`[\gnzQ[[ahp$$N & F&N & F&-,Umղ]o׳#2EL`~N & F*N & F*N & F)N & F)N & F(N & F(N & F'-,:;<^kʲӲ~ȳճ!GLNO^_ƴ̴ʹ^_`c|}ĵŵ,-Z[ru 6I÷ķŷ˷̷PQjklrjiUjU jUH*56OJQJ5656 5OJQJS~ڵF\vӶ w +ۻ$N & F-N & F-N & F,N & F+N & F+-,rsܸ-`iȹҹ,>?@C\]Ǻߺ):QRSTklmnƻٻ oyټ*5˽ܽ#7Ojl̾jU 5OJQJ56 jU\${м!7Qvͽ9K+2CEON & F1-,N & F0N & F0N & F/N & F/N & F.̾/JLcetyпҿ ABCDEN^mnop$z345@ACNP[\5CJOJQJ jCJCJ56CJOJQJ j6CJ6CJ 5OJQJ556OJQJ566Mv6@UobwN & F4N & F3N & F3-,N & F2N & F2 *+;?ce  &IS+,-/01=>HkuBH:CJOJQJ6 5OJQJ56OJQJ56OJQJ5W4: $Hcw,O & FO & F~O & F~-,N & F4  *-.9<=>ILMNY\]^_b~!#$)CEFPUVWceOT56 5OJQJOJQJH*56OJQJ[48PVXY[`gl<AKQSTV[gpZ`bcej  !*Q[ )qH*6H* 5OJQJOJQJ65\,^rmDz ,Fa4&ZhO & FO & FO & FqvJR#pvxy{6@ET^ %*Z_FP#$%&)*+,BCEFOJQJH*6H* 5OJQJ65\h8G} E8ovXO & FO & FO & FO & FFPQRS\e{', "#%*<NOPQTUVWZ[rsuvT]y~ "#$-1?CJ6CJ56OJQJ56OJQJjcU jU5 5OJQJ6RXn-!&K_SO & F ^`O & FO & F $V`r7z &7fpMN & F6N & F5>=-,O & F?EFPSTUV`^p#59JV`567=AOUV`cdefo k}BKO]isCJ56OJQJ6 5OJQJ556OJQJH* 6OJQJ6CJT  '9is!f{ 2GaN & F:N & F9N & F9-,N & F8N & F7789@DRXYcfghirQ[|  (2KQS\^coy 6H* 5OJQJH*CJ6CJ56OJQJ56OJQJ56U ;E().3568=FG "#$12`abfrs'LUH*56OJQJ56 CJOJQJ5 5OJQJ6Xa{%3Ub)C|N & F;-,9N & F:N & F:U GHfk'1DIwz",ALq{%2;EYfjw$()8ENXnx 5OJQJ65aA dGMy >SmN & F=N & F<N & F<N & F;!$GQ:G%DH;N 1!&FWgp49?D CJOJQJ56OJQJ566H*6 5OJQJ5Xm\pwT);OVg)K]dsN & F>N & F>    -,N & F=Ddfgmq 16CHORqrsvhm}*+,-0167<_dH* CJOJQJ 5OJQJ65 6OJQJCJ6CJ56OJQJ56TVf,>n I}N & FAN & F@N & F@N & F?N & F?  -,%*5<LPTZ ).Z[bhno~GL'()1=>RUVWXH*56OJQJ56 5OJQJ56[R>N )i~-,N & FCN & FC  N & FBN & FBN & FAN & FAXYgh|}~!*:NOPXYdey|}~7Jbn#$0:_rst|}~j]UjU jU 5OJQJ65H*5656OJQJS!+PG5i{  B [ m y  & FM & FM & F9M & FM & FM & FM & FM & FM & F-,6ILco+,-s$7:Q]{3 F L V \ n        & K Y   0 7 t  = > W jWU5H*6jگU jU 5OJQJWy   [ b  Ohq=6#9N & FD932W X Y _ ` {           l m               -./56]i!}~?@#$)*BCHIcdijjȲUjKU5jαUjQU 5OJQJ6 jUj԰UO=B3?,-1;_`+,-34XYrs!+1>?p-.67wj9UjUj?Uj³UjEU jU 5OJQJ65OwMNghxy  YZ^_34MN^_gh$%EFef5jUj-UjUj3UjU jU6 5OJQJOj'S  !#*%3%%<&W&&&#'V'd'''MPPY9N & FDN & FD# $ N O  """"-"/"4"6""""" ##'#(#)#/#0#Y#[#`#b###d%e%%%%%%%&&1&2&3&9&:&E&F&I&U&&&&';'A'K'T'''( (7(@(Q(R(4)5)N)O)_)`)h)i)))))j!UjU5j'U jU6 5OJQJU'"(T((k)*:*L*M*U*\*f*u*******+\+u+++,`,M & FM & FM & F-,MM)d*e********++++2+@+e+s+++++++(,7,8,G,i,v,,,,,--4-A-l-{-|-}---- ..<.J.K.U....... ///,/h/{////////////00!0&0(0-0~11112233i5 5OJQJjU jUOJQJ6556X`,x,,,,-]---..-.....`//00010K031M & FM & FM & FM & FM & FM & FM & FM & FM & FM & F3124z56789h<=>>d??C@i@m@@@AA"BKBTBBBOCqCP & F9i5r56666+8=8G8H8a8b8c8k8l89"9,9-9F9G9H9P9Q9::;;h<l<<<=*=P=U=Z=]=z======V?Y?@@@@@@@@@@@AAAAA)A*ACADAEAHAIAAAAAAAAAAjUjU j5jU6jUjU jU 5OJQJ5MAAA]BaBBBBBBBBBBBC C-C.CGCHCICKCLCCCCCCCCCD D"D+DDDIDDDDEEE%E3E@EDEaEjEEEFF+F0FbFgFkFtFFFFFBGDGHGJGUG]GGGGGHHyH}HHHHHHHHHHHHHI j-jU56 5OJQJ jUZqCC-DrDEELGGGuHHHQIiIIIIIIqJ KKKMMN O9P & FP & FP & FP & FIIII&I'INIOIUIVIaIfIlImIIIIIIIIIIIIIJJJJUJVJdJeJJJJJJJJJJJKK K K9K:KKKLKaKbKKKKKKKKKLLLL:L;LU jUjUL`$\ًkqvJuϏ=P & FP & FP & FP & F!38TYjoow"KLefgmn37ltĎՎێʏ͏1;=A{Őǐ͐Ӑא xyŒْ̒ݒ`nԓՓۓܓ#,026XYrj,UjU jU5 5OJQJ6X=֑3WƓؓ%28NsŕVdbP & F$$$P & FP & FP & FP & F9rst{|<=QRlqwxĕȕɕΕϕ#$=>?EFPT˖̖[`=FGHy˙ә  <=TXh OJQJhj&U56 5OJQJ jUjUUb q™5N^4O&2ƞP & FP & F9P & FP & FX '()12S[svכ؛goۜܜ89os  *+56[_ghikʞ˞67Z^de{џݟ78QRSWX~j U56H*H*6h 5OJQJjU jUUƞ->La 3š|Т @Sˤ<եwͦdݧ"9P & FP & FĠР5>šɡhzǤȤʥӥOPijkst¦˦18ǧϧm#+QZlp7>CKȪѪ5h6h5OJQJhhjUjUjU jU5 5OJQJ6H*6LݧJxį òͲ˳[Ѵ<XP & F$?C}78QRbcijox#+5=JNTejuvx®ƮȮ̮=AG{¯ jU5OJQJh 5OJQJjUh jUh6h5hh5RȰɰʰΰϰ#U[޲"#9:^_y~´Դմ  9:?@DHQV[\abеѵҵصٵ`aŶƶԶն NPci j-H*jU6 5OJQJ5jU jUjUSXGrXawRIYsqA[kP & FP & FP & Fw|2<=>vw;<UVW]^|  *+DEFNO,1EFzȿɿFG%&jqjOJQJU6jOJQJUjOJQJUjU jUh OJQJh 5OJQJL58JMQ[ #$*1@FhjtxHO~jUjyUjUjU jU56 5OJQJR"K!>?dRlDXd {P & F9  `iHI\]abgh$(, 26"#EFU]bc67lm6 5OJQJ5ako*_ Q)P & F9P & FP & F!" &,mq48T]"%5>   !%&+,FGMN{|23`a{|tu{ CJOJQJ5 5OJQJ6^Ab0'Ap(I.rP & FP & F9P & FP & F?~ <|#ByN;\P & FP & F9P & FP & F{|#'-0qu NZ  )-89;?EI&.ikopuvNOdhnu18"#)*   j-65 5OJQJ CJOJQJ]\x0Jfr `FZijyEVP & FVd,Fn8J^*{<P & FP & F9P & F FGXYrsyzjo bg'*JPQT\bHMcdnoTU,-=>DEJKTU[a5 5OJQJ CJOJQJ6^9P_kFXMW~=9P & FP & FarwOTpy'/8^b?@7;<>LPQRSTUsw jp5 j65 5OJQJ]Bk=QI-j P & F9P & FP & F>=wxyz<=>?BCDEF[_`adeEFUVXZ[\clmnopwxz|}~H* jp55 5OJQJ6^,-23WXno   013567<=?ABCJKMOPQfhmnprstyz|~H*6c+4EF   "#'09:MVZcy&(*.qz2 6 < @              5OJQJ j-5H*6^0p=t*2 T    * D [    P & F9P & FP & F    $ S X w | ~       ! ' ( S X       D E   ABwx{|IJdecd~KLgh5 CJOJQJ 5OJQJ6] , H   &mC{.r@Q`P & F`uZkz ^o~A{P & FP & FP & F &,mqwA&-[g   GH[\JO9:@Aw~AB[\gh  H I M jsU jU CJOJQJ6 5OJQJ55CJOJQJCJ5CJS9Mk6]{[j&9P & FP & F . U c   '!o!w!!!""""h####E$Z$$$g%%P & FP & FM N R S         ! !!!H!N![!\!i!j!!!!!!!!! """ "B"C"""""""""l#r###$$$$$$$%%%& &*&+&D&E&F&N&O&&&&& '''''''''(((()(jmU jUjOJQJUjOJQJU5 5OJQJ6S%R&& 'E''a(r((')])K+++,,,1-O--...//05111P & F)(((((((((S)[)*******O+U+f+r+++++,,,,,,,, --#------- ..%.).../ //#///0000111(1+1,1-10131>1D1h1k11111K3Q3U3[333`4b4H*6jgU5jU jUhjOJQJU 5OJQJS11 2]2K3 4-4&55555E6D78E8999X:r:::;1;P & FP & FP & FP & F9P & FP & Fb444!5$5/595]5`55555@6C6D7J7N7X777N8T8888899!9(99999v:w::::;; ;;#;.;/;1;5;;;A;;;%<1<<<= ==#='=0=g=n=======>>->5><>D>H>Q>p>q>6?7?]?^???????@@D@E@^@`@x@ 5OJQJ56a1;;"<c==>>t>>>?b@t@@eAABaCCCDQDDDDIF[FP & FP & FP & FP & F9x@~@@@@@@@@@@@AA1B9BBBBBBBBC$C1C4C=C~CCCCCCCCCCD DD!D'D(D)DEEDEEEEEEEEEEE+F,FEFGF_FeFvFFFFFFFFFFGGGGGGLHPHMIQI_IcIIIIIIIJJJJZJ j565 5OJQJ_[FFTGzGI7KsLMhOOPvQQRBS@UU4V{VX]Y[,^7^H^$-DIfM 329ZJ[JtJuJJJJJJJJJJJLLsLwL}LLLLMMOOOPCPGPPPQQQQRRRR R&RKRORRRRRRRRRRRSSSSSS!S'S-S3SESKSLSRSVSZSdSjSkStSSSTTT"TATGTHTQT\TjaU5OJQJ\^J65 5OJQJjU jUT\T]TTTTTTT)U>U@UDUJUOUUU8V>VcVgV~VVVVVVVWWWGWRWWWbWmWqWWWWWWWXX X)X/X0X`XkXmX}XXXXXXXXXXXXYYY Y&YCYOYUYVY`YlYYYZ Z.Z/ZrZsZZ]jU jU5 5OJQJ65OJQJ\^J6]RZZZZZZZZZZZZZ[[[\\\\\\]]]]]]]]],^I^M^O^Q^R^j^m^|^^^^^^^^^^^^_____G_H_I_J_S_T_b_k______________``````H*5 j 6OJQJ56fHq  5OJQJ6 jUj[URH^I^L^N^yo $If $$Ifa$x$$Ifl0@ (   04 laN^O^R^i^j^m^^l~~ $If $$Ifa$i$$Ifl0@ (04 la^^^^^^___v`w`x`9aZa~Lxxvtr9$If $If $$Ifa$i$$Ifl0@ (04 la ```'`J`L`M`N`x`|`````]acaaaaaaaaabb1b7bbb cc(c1c6cgbgeghhhhhhhhh 5OJQJ65H*`Za'b ccGdkdffg+ghgg"hFhhhiikopqrrr:sssP & FP & FP & F9hiCiGijj(k1kkkkkkkkkkkkglpl$m-mmm8nxFxMxVxWxtxuxxxxxxxxxxxxxxxx y yWyXyqyrysy|y}yyyyyyyyyyyzz$z%z*z+z,z-z0z1zNzUzrzszzzzzzzzzzjUU jUOJQJ5 5OJQJ6Zxxyyy'zWz{n{{#|Q|}v}}~0_vހ ,OP & F9P & FP & FP & Fzzzz {{{{E{F{_{`{a{j{k{{{{{{{{{{{{{{{{{{{{'|-|>|C|N|O|Q|U|\|a|||}}} }=}F}M}}}}}}}E~J~~~~~~~nsy|%6 j- 5OJQJjOUjU jU56WOM1ÄЈtC/Y;_9P & F6?JKMSW`ÄDŽąυΆن aeЈԈ.7tx2ACGMXWbY] ˑБ678@A jUjOJQJUjOJQJU65 5OJQJS_אvӑ\pD5G-9B`יk/Mݔ\mw+,-56חۗ-1u @EV]owmtѝӝ 96jCUjOJQJUjOJQJU5 5OJQJ jUjIUMMi,LœOd՝\uW;֠Ufڡ0ɣԣ9:JKSTʠˠ̠ҠӠ{ΡϡС֡ס=M-z{~_w{|}ɥVWpqrz{Kj7U j j-H* jjOJQJU5j=U jU6 5OJQJjOJQJUOJQJjOJQJUDԣ9RĤݤ Oyޥ~( !ޭ߮EwP & F9KTptƧΧΨߨ2;,4Zcuy!% 'MVhlWe"ABHIQRak{|ׯدٯگ    $%>?xyz{~ jH* j6 5OJQJ5]wԯ:ѰsͱFUKس#$JP & F9P & FP & Fΰϰ԰հ߰MNvwѱұ=>CDJKNPhijkz{۲ܲ޲%6=HISZгѳҳԳճ(6dkjU jU5OJQJ 5OJQJ6Zٴnӵܵݵ!'(,/CHNOhijk˸ٸݸ,-FGLMfghijkpqs jH* j6H* j j6 5OJQJ5XJe}ȸ)B(7P[fмDmz;lP & FP & F:;<=TU_`}~ºĺź˺̺$%ghmnyz@AijͼμԼ j jOJQJ j j6H*6H*ZԼռ  !$)*-0GHRSVYqrux~Խս)*,/1289cdijpv-./12o|ǿԿ 6H* jj1U jU5 5OJQJ6W5 /A\t P[jTjP & F89 !"%&'(,-34vw .7;D]^tuz{#&:?EF_`abxy} j j 5OJQJ jU5 jH*6H*6 jV,-LMTUnotu +,12=>?@CDEFHXY    89J j j jH*6H*OJQJ j56 5OJQJVJK\]rsvw78BCUVghno  $%no !,78BM jU5 5OJQJOJQJ6Zj :.mf(*:9P & FP & F(Va~ekfl?@WXAI /:kt2< OPijknoquj%U j j- jpjUj+U56 5OJQJ jUjUM$*KRvy=E>DqB9u<=>_`a)*EFefjk+,12QR|}KLMTU\]|} j-5 jp j j-6 0J/OJQJjOJQJUOJQJjOJQJU 5OJQJNBb.NyYy G;g32Z[BCJKOPQ  '(-.12389EFJKjkrs"#<=HIfgrswx 5OJQJ j jp6 j-]9c5_ aQH[2P32  1289=>DE[\bcghnost [\]delmqr  NOTU\]lmrs j j- jp6_CDKLPQRWX  VW^_cdejkpq    :;<ab/05 j5 j-5 j- j6 jp\56:;<LMNSTbcuwIJij78:;ST\]GHIqr   !'(-.?@ j55 5OJQJOJQJ j j-6ZFf&$B`@`932@EFJKL\]^cduv=>CDcd)*CDEKL|}vw   CDKQbepqjUjeU jU 5OJQJ5OJQJ j j-6SLyGs~*Y :e32 !-.23OP\]ij#$%ABJKPQlmuvz{|"#$)*12YZ_` j j-6a\(f({ (dFf932`defklst%&+,0178?@bcijnouv}~%&+,34CDST&'`afg56 j j-` $%&+,=>MPghvw,=KLPQRSUVcdIJij>?cd 5OJQJ5OJQJ j- j6\f;`~/OmwHs#3223RSpquvtwZ]ru  ()3467EFQR`awx  , - : ; m n         # $ F G o q  j j j5 j-6 j\#Am+ = `   z   /5l#@x^@#  @ #x # p@x^@ #`^`` #@^@q     - . ; < K L a b r s                   % & ) * : ; N O i j m n ~                    5 6 9 : J K ^ _ y z } ~             ,-CD j6bDLMNOhj78LM}~'()*,-89LMcdefijuv !,-@AWXYZ]^ij}~ j-6bo;D|9%Rt(X3\#@x^@ #  !"56lmRSpqbcgh  01 *+^_cd  "46MPaewz5 j j-6`\Sx~4RRh}t   9!!!!P & FP & FP & F ^ zj k p q 7T7U7m7n777jOJQJUjSUjOJQJUjYU jU6jOJQJUjOJQJU 5OJQJGP1^1k19222234%444416=7I7b7~77789>:S:i:::P & Fx$P & F708:88888$9'9999999999:: :::::L:P:a:f:l:p::::::::::::::: ; ;;;1;8;D;E;J;L;f;h;t;u;;;;;;;<<<<<<<< >>!>$>>>>>>>>\?`?????-@jMU jU j56 5OJQJZ: ;G;w;;/<m<<<==&>>@AYAuA:BBBCCDDFFFH9P & FP & F-@3@A6AGAKA:B>BgBhBxBBBBBBBBBBBFFHH&J*JKKgKkKKKKKKLLLL L)L,LLLMLwLxLLLLLLLLLLLLLLLM M,M-MTMUMmMnMrMuM~MMMMMMMMMMMMN N/N0NHNINMNPN6jU jUOJQJ5 5OJQJZHHH&JJKEK`KKKKL.LQLsLLLLLL M1MPMP & FP & FP & FP & FP & FP & FP & FP & F9PMjMMMMMM N+NEN^NvNNNNNNO1ODO`OzOP & FP & FP & FP & FP & FP & FP & FP & FP & FP & FP & FPNYN\NrNsNNNNNNNNNNNOOOO O#O,O/O@OAOdOeO}O~OOOOOOOOOOOOOPPPPBPCP[P\P`PcPlPoPPPPPPPPPPPPP Q!Q9Q:Q>QAQJQMQlQmQQQQQQQQQQQRRRR!R$R-R0RNROR}R~RRRR65czOOOOOP P>PXPqPPPPPPQ6QOQqQQQQP & FP & FP & FP & FP & FP & FP & FP & FP & FP & FP & FQQQR2RSRyRRRRR*SDS]SSSSSTSTTTTP & FP & FP & FP & FP & FP & FP & FP & FP & FP & FRRRRRR.S/SGSHSLSOSXS[SeSfSgShSsStSSSSSSS:T>TTTTTTTUU)U*U9U:UbUcUUUUU!V"VEVGVhViVxVyVVVVVVV4W8WlWnWWWWW X XXX;XlBljlklllllllm mqmummmmmmmmm n n?n@ncnhnnnrnnnnnnn o!oGoKoooooooooppBpGpvpzpppppqq%q 5OJQJ56akk%l;llll?m}mmm;nUnknnn%ojooopspp.qCqqP & FP & FP & FP & FP & F%q&q*q,qCV[\]ϵصٵܵݵ56WX\]`hmn{˶жѶҶ#,1BKLOR̷ͷѷҷշݷ$%&01LMQUZ[_d 5OJQJ56a%3ȷ߷Is@W$Ժ!#%$IfP & FP & FP & FP & FP & FP & FP & FP & Fdmqvw{øĸǸʸ"#DEIJMU\fghtuɹ͹׹ܹ"AKghʺϺкѺ׺غ׻%LOcdfi j 5OJQJ65_%')+-/13579;=?ACEGIKMOQSTVXZ\Ff$If\^`bdfhjlnprtvxz|~Ff$IfȻ kP & FP & FFf$Ifk߼>m½l *w@m EP & FP & FP & FP & FP & FP & FP & FP & FP & FP & FƼȼ"679<WZ]`fk|ѽ&67:;{ʾ׾!"'(9IJMO\`{|ȿؿٿܿ޿1>DE^jU jU j 5OJQJ65Z^k ACJ]^_af$789;@ptuxz+@APV]pqrtz $>BFGHSTUqu 5OJQJ56aEaXwV7Sq5H & F B<BB<H & F <P & FP & FP & FP & FP & FP & F89Z]qru}');>?IPQWXgiknvwxyDHILR]_ |}~ 5OJQJ56a5vw0Q7P & F H & F`^` H & F`^` H & F`<^`P & FH & F H & F H & F <P & F&(*-5678`dehny{;</NOci   *3:@ASXYZacu 5OJQJ56a<] q>a $`l$P & FP & F H & F`^` H & F`^` H & F`<^`019:EQRSXZhoux|}!AKOT]_efjl ')ik'hlwyp{l 5OJQJ56alw=>&(bmef!*19NOQRWXbcgh12egnOJQJ5 5OJQJ6_l,Xrju-i H & F `^` H & F `<^`P & F$ ^_st  "&'67;<=@EFGR[b )*,/789:blmp !&V`a65c2Bd2SGRaot{$IfP & FP & FP & FP & F H & F `^` H & F `^`adx;<bc~EFmnxR_`|}~"1257D_a 5OJQJ 56B*fHphq 56jU jU 5OJQJ65Q{|~yxpjjj$If $$Ifa$$$IfTl\ h  h   (4 lapd$If $$Ifa$j$$IfTl\ hh4 la |$If $$Ifa$j$$IfTl\ hh4 la[z}}P & FP & FP & Fj$$IfTl\ h  h  4 la$%(9`q%:HIbcdij"/03HTUVbc~01PeuvBC 5OJQJjU6CJ jCJCJjzUjU jU56P31H^`bdfhjlnprtvxz|~$IfP & F(),-*+./@TUXY34589Wklop l5CJ jCJCJjUjtU jU56 5OJQJSFfn$IfFf$IfC<`$J={P & FP & FP & FFf$If<AR`beitv KVWZm &/o !"ABGHYlmpy|%:;BPQRTU_`CJ56OJQJ 5OJQJ65\{ 8eQ'M={bP & FP & FP & FP & FP & FP & FP & F=>s~56;=?@NY `yz}$%DEJK\uvy%:;BPQRTU_`1 5OJQJ56a1<gp DO -.0134:;OW5@ (),;Tc@O`opsu ,9STYZ{5 5OJQJ6aQ#Vb  #Md_  P & FP & Fq|}'(+?Xl%')+JXZ\&-;<Yafkox io &.38<EPQY`st}~ -jU jU 5OJQJ56\-.FMQZho%)-.FINScm L P T U m p u z             9 A O Z       # * 0 =           W d v |       = >   #+ 5OJQJ56a r  @  -Rn@j,4Z ?klyP & F+56"*X_ae Iev|9=nt +4CD_hrx%CDpqtu6jU5 5OJQJj-U jUXyb:/M@QX  f!9>=P & F<P & Fu&'@ABKLO_34>?~  'k /5@H CJOJQJH* jj'U jU5 5OJQJ6V KN  36:>kqzio-3N Q   !!!! ###########$$$$$$$jU jU OJQJh5 5OJQJ CJOJQJ6Vf!p!)"7""###$%%%&.&&O'''()))))J**+Y+n+$$$%%(%/%7%@%F%M%%%%%%%&&&&&&&&&F'M'_'f'n'w'}''''c(d(}(~((((((((,);)c)d)})~))))@*G********+5+F+K+++++++++ ----OJQJj Uj UjUj!U56 5OJQJ jUPn+++,+,U,s,,,--^.i.m/|/00s1}155i6668899::--------7.8.Q.R.S.[.\...............//// /!/#/$/:/;/C/D/J/K/a/b/j/k//////////00 000W0X0q0r0s0{0|0~0000j Uj Uj Uj Uj Uj Uj U 5OJQJ jUj UG0000000000000000000011111118191:1D1E1K1L1e1f1g1p1q111111111122222!2"2;2<2=2@2A2C2D2]2^2_2e2f2h2i22jUjhUjUjnUjUjtUjUjzUj U jUE2222222222222222222222222222333"3#3%3&3?3@3A3I3J3L3M3f3g3h3p3q3s3t33333333333333333333jUjJUjUjPUjUjVUjUj\UjU jUjbUC333444 4 444)4*4+414244454N4O4P4X4Y4[4\4u4v4w444444444444444444444444445555555455565>5?5A5B5[5\5jUj,UjUj2UjUj8UjUj>UjUjDU jUC\5]5f5g5i5j5555555555555D6E6^6_6`6f6g6i6t666 7 7&7'7(7/7077777 88[8f88888888889%99:::::::::;;D;K;R;];r;};;;;;l<OJQJjU 5OJQJ5jU6j UjUj&U jUM:N;k;; <<L=w=>>>n???5@@@AA{BBCCCXDYD`D=FF<l<w<<<<<<<<<<=B=I=^=i===== > > >>>=>C>]>^>f>q>>>>>>>>?? ?!?"?+?,?5?@?????+@,@1@2@n@y@@@@@@@@@@AAFAQAeApAAAAAAAAj UjUjU56jU jU5 5OJQJOJQJ6NAAAAAB'BmBxB{BBBBBBC!C:CECoCxCCCCCEEEEFFFFFFFFGGIIIJJJ6JAJJJ'L5LdLmLLLLLLL,M6M;MBMDMQMWMbMlMzM~MMMMMMM N N NNN&N'N7N9NFN56CJj 6U j6UOJQJ5 5OJQJ6UFF$GKGGHQIK8LLMMMMN&N'NeNNNNOOZO|O}OOO-,?* & F32FNGN`NaNbNcNdNNNNNNNNNNNNOO*O,O9O:OSOTOUOXOYO|O}OOOOOOOOOOOOOOOOPPPPP,P-P>P@PMPNPgPhPiPlPmPnPpPPPPPH*56OJQJjy#6Uj"6Uj"6Uj"6Uj!6U56CJj!6U6 j6UCOO P,P-PnPPPP$Q%QnQQQR9R:RRRR S'S(SoSSSS TT-,PPPPPPPPPPPPQQQQ Q#Q$Q%Q>Q@QMQNQgQhQiQlQmQQQQQQQQQQQQRRRRR&R-R7R8R9R:RaRcRpRqRRRRRRRRRRRRRRRRRRRSjm%6Uj$6Ujs$6U56OJQJH*j#6U j6U656CJISSSS S S S#S&S'S(S?SASNSOShSiSjSmSnSSSSSSSSSSSSSSS TTTT#T$T=T>T?TBTCTTTTTTTTTTTTTTUUU UUU3U4U5U:Uj[(6Uj'6Uja'6Uj&6Ujg&6U56CJH*56OJQJ6 j6Uj%6UCTDTTTTTT]A]B]C]E]G]I]K]M]O]P]j4j$$Iflֈ n4 la@$If P]Q]R]]]]]]]]]]d$$Iflֈ n4 la@$If, ]]]^^R^W^X^^^^^__I___`1`2`r``````JaOaPa-,v^w^^^^^^^^^^^^^^^^^^^____&_'_@_A_B_G_H___`_n_r_~______________` ` `````-`1`2`@`B`O`P`i`j`k`p`q`````j26Uj16UH*j%16Uj06U56CJ56OJQJj+06U6 j6UG```````````aa'a(aAaBaCaHaIaJaOaPa^a`amanaaaaaaaaaaaaaaaaaaabbbbbb6b7bEbGbTbUbnbobpbubvbwbxbbbbb5H* 6OJQJj46Uj46Uj36Uj36U56CJ56OJQJj26U j6U6CPaaaab6b7bwbbbb.c/cxccccJdKdddd.eeeeffQf-,bbbbbbbbbbbbbbbbbb*c.c/cFcHcUcVcocpcqcvcwcccccccccccccdddddd%d&d'd*d9d;dJdKdadcdpdqddddddddddddj66U56OJQJj66Uj56Uj 56U j6U656CJH* 6OJQJ 5OJQJFddddddddddd e e%e&e'e,e-eFeGeIeTeUeVebeceeeeeeeeeeeefffff!f.f/fHfIfJfOfPfQfkflf{f~ffffffffffffffffffjx86Uj76Uj~76U j6CJ6CJj76U j6U6CJ5656OJQJGQfkflffffg.g/gwgggghhchhhhiibiiiijjSjcj,-fggggggg.g/gEgGgTgUgngogpgugvgwgxgggggggggggggghhhhhh1h3h@hAhZh[h\hahbhhhhhhhhhhhhhhiii0i2i?i@iH*6CJj:6Ujl:6U5j96Ujr96U56CJ56OJQJ j6Uj86U6D@iYiZi[i`iaipiwixiyi}i~iiiiiiiiiiiiiiiiiiiijj!j#j0j1jJjKjLjQjRjSjTjcjdjrjtjjjjjjjjjjjjjjjj k kkkkkkCk6CJjZ=6Uj<6Uj`<6Uj;6UCJ56OJQJ56 j6Ujf;6U6FcjdjjjjkCkDkWkkkk&lIlJllll m0mummmnnnnnn?-,CkDklkok|k}kkkkkkkkkkkkkkkklllll$l%lElHlIlJl\l_lllmllllllllllllmmm m mBmEmRmSmlmmmnmsmtmmmmmmmmmmm n56OJQJj?6UjN?6Uj>6UjT>6UH*j=6U j6U656CJG n nnnnnn-n.no?o@o]o^okono{o|ooooooooooooppp p p pppp"p/pjvvvvvv;wtwuww-,ssssttt t tttttItJtKtLtXtYtZt[tptqt~tttttttttttttttuuuuuPuQu]u_upuqu}uuuuuuuuuuuuuuuuuuuvjH6UjG6UjG6UCJ56OJQJ 6OJQJ56OJQJ 6OJQJjF6U j6U656Dvvvv6v7v8v|D}E}}~~~,-xxxIxJxNx\xbxex|x}xxxxxxxxxxxxxxxxxxyyyy.y1yByDyUyVygyhyyyzyyyyyyyyyyyyyyzz;zKLefglmȅɅօׅjR6UjYR6UjQ6Uj_Q6U56OJQJjP6U j6U656CJH*,FG]^kl͆Ά '()./_a{|ԇՇևۇ܇23LMZ[tuv{|ڈۈ$jU6UjGU6UjT6UjMT6UjS6U56CJ56OJQJ6 j6UjSS6UDFG0݇23}ڈۈ&(+.147;?DGJM$If-,$%NOZ[hi‰É҉Ӊ+,FG\]jkabhivwʋˋ!"/j9Z6UH*jY6Uj?Y6UjX6U56OJQJjEX6U656CJ j6UGMNO‰ÉFGRabMkl;ʍ?-,FfAV/0FGKLMPijkl܌݌459:opÍčȍɍ  "#'(CFGHTUbcyz~͎ΎҎӎԎՎ 'H*56CJ56OJQJ6 j6UXʍ)GHԎ/12v܏$%h%&e,-'()-./012FGTUnoptuvԏՏ֏ڏۏ܏ޏߏ   $%89FG`abfghktz{пj-\6Uj[6U56CJOJQJ j6CJ6CJj3[6U56CJ56OJQJ6 j6UjZ6UC{|̐ϐАѐܐߐ !"-012=@ABZ\hitwxyz}Ñđёґ"#$%&56 6OJQJ6CJj\6U j6U656CJH*56OJQJS6CD]^_cdeko}͒ΒϒӒԒՒܒ"#<=>CDEIJKWXcdtuj^6Uj!^6Uj]6U56H* 6OJQJCJ6CJ56OJQJj']6U j6U6FՒEcdœƓDED_`'(-,œƓГѓޓߓ!$>ABCDEQR_`yz{ؔٔڔߔ!";<=BCDKLM[_`rsj`6Uj`6Uj_6UH*j_6U j6U656CJ56OJQJKɕ˕ٕؕ'(56CD]^_defiuvyϖЖі֖זؖݖޖߖ  #jb6UH*j b6U 6OJQJ6CJja6U56CJ56OJQJja6U6 j6UE(fؖ,:;Rԗ՗YZȘɘJYZ™Ù?-,#$%*+,3:;fgtu—×ėҗӗԗ՗),-.BEFGHIWXYZno|}Șɘ֘טjzd6Ujc6UH*jc6U56CJ56OJQJ6 j6Ujc6UJ*+DEFHIYZijwx™ÙљҙߙRUbc|}~КњҚؚٚ 0jhg6UH*jf6Ujnf6Uje6Ujte6U56CJ6 j6Ujd6UFÙNښ:^_Ûě#$cwxVW?-,01289^_knouÛěћԛ#$/2?@YZ[abcdwxVW_bcivwjVj6Uji6Uj\i6Ujh6U56OJQJjbh6U56CJ6 j6Ujg6UDѝӝ -.GHIPQklyzҞӞԞٞ۞  +,-79FG`abijklmnorjl6UjJl6UH*6CJjk6UjPk6Ujj6U656CJ56OJQJ j6UEɝRyzӞԞ ,-kwx۟ܟ!op$%-,?rsvwx؟ڟ۟ܟ !$%&'(789:HIJKLMN\]^mnopuwנ٠ڠOJQJj>n6Ujm6UjDm6U j6U656CJH*56OJQJM"#$%69IPQXefΡϡ&'79FG`abijy{ϢѢҢآ  'j2p6Ujo6Uj8o6Ujn6U j6U6CJH*5656OJQJK&'k b@ghܤݤ!UVKL-,')*0=>WXY`ab 567>?PXghvx̤ͤΤڤۤܤݤ !#./1245@BCGRTUƿƿƫ56CJOJQJj&r6U j6CJ6CJjq6Uj,q6UCJ56OJQJjp6U j6U656CUVabdqrǥɥ֥ץ25KLfhuvݦ*+,3456GHXZghjt6Ujt6Ujs6Uj s6UH*6CJjr6U j6U65656OJQJCJE5GH§ç8FXʩ-4F{Ȫ:Zz! x@?*,-§çϧѧާߧ"#  CEǪҪ$./123DNOQRSdnoqrsīΫϫѫҫ 5OJQJ5juU jUju6U j6U6CJH*56OJQJ56Nګa[btȭ߭p_! x-,@  ! x! ҫӫ$8:;<=GU_k¬۬678=>qsܭޭ'()56|~Ʈծ׮خ/023=56OJQJCJ j6CJ6CJ56jvU jU56 5OJQJQ=>IJKWXʯ˯կ֯3>S]i|}ٰ"#%&12<=Gȱұ%1345FRTUVgsuvwʲղ 5OJQJH*566CJ jCJCJ[<]~)޴D[Ҷ/ixO & F@?! ղֲزٲڲ-3!RSUٵ۵ߵ#RX϶жa '+|}AB-3yܻ34>?YZ`aϼ6 5OJQJ5a=k}pλ/;\-FWf O & F@9O & FO & FϼмQRVW[\de!#'(01ij¾þ    Z`}JPT]ch;?fkqw{vw 17BCEI j j55 5OJQJ6 j-\ .VWn5iE=[!O & FO & FO & F9O & FO & F@O & FIOU#)41256[aep%&nqwx|~  #$dh)48=S./PQZ mHnHu jU j j-65 5OJQJYz2p^     9@O & FO & F8i89;<=>?@ABCDEFGHIJ n n n$a$JKLMNOPQRSX\]^ '$ 'a$$a$* & F$a$Z[JKlmvw!"+,./5689:<=CDEFGyz,-OPYZ\]cdfghijlmstwxz0J<0JmHnHu0J j0JU mHnHu jUVxyz{|-.:;<GHI hh]h`h&`#$[\hklyz{|}~  'Bhh]h`h&`#$ hh]h`hz{|}~    #%&8:=>?FHKLMTH* CJOJQJ5H*5 <mH sH 0JmHnHu0J j0JU mHnHu jUOJQJmHnHu@OJQJmHnHumH sH 7 !"&159:?&`#$?CGHMQUVno* & F ? 0 0000&P*P/R / =!2"n#$%2  ? 0 0000&P*P/R / =!2"n#$%2  U 0 0000&P*P/R / =!2"n#$%2   P0? 0 0000&P*P/R / =!2"n#$%2  < 0000&P*P/R / =!2"n#$%2  9000?&P*P/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 000?&P*/R / =!2"n#$%2  5 0 00?&P*/R / =!2"n#$%2  }DyK _Toc472818713}DyK _Toc472818714}DyK _Toc472818715}DyK _Toc472818716}DyK _Toc472818717}DyK _Toc472818718}DyK _Toc472818719}DyK _Toc472818720}DyK _Toc472818721}DyK _Toc472818722}DyK _Toc472818723}DyK _Toc472818724}DyK _Toc472818725}DyK _Toc472818726}DyK _Toc472818727}DyK _Toc472818728}DyK _Toc472818729}DyK _Toc472818730}DyK _Toc472818731}DyK _Toc472818732}DyK _Toc472818733}DyK _Toc472818734}DyK _Toc472818735}DyK _Toc472818736}DyK _Toc472818737}DyK _Toc472818738}DyK _Toc472818739}DyK _Toc472818740}DyK _Toc472818741}DyK _Toc472818742}DyK _Toc472818743}DyK _Toc472818744}DyK _Toc472818745}DyK _Toc472818746}DyK _Toc472818747}DyK _Toc472818748}DyK _Toc472818749}DyK _Toc472818750}DyK _Toc472818751}DyK _Toc472818752}DyK _Toc472818753}DyK _Toc472818754}DyK _Toc472818755}DyK _Toc472818756}DyK _Toc472818757}DyK _Toc472818758}DyK _Toc472818759}DyK _Toc472818760}DyK _Toc472818761}DyK _Toc472818762}DyK _Toc472818763}DyK _Toc472818764}DyK _Toc472818765}DyK _Toc472818766}DyK _Toc472818767}DyK _Toc472818768}DyK _Toc472818769}DyK _Toc472818770}DyK _Toc472818771}DyK _Toc472818772}DyK _Toc472818773}DyK _Toc472818774}DyK _Toc472818775}DyK _Toc472818776}DyK _Toc472818777}DyK _Toc472818778}DyK _Toc472818779}DyK _Toc472818780}DyK _Toc472818781}DyK _Toc472818782}DyK _Toc472818783}DyK _Toc472818784}DyK _Toc472818785}DyK _Toc472818786}DyK _Toc472818787}DyK _Toc472818788}DyK _Toc472818789}DyK _Toc472818790}DyK _Toc472818791}DyK _Toc472818792}DyK _Toc472818793}DyK _Toc472818794}DyK _Toc472818795}DyK _Toc472818796}DyK _Toc472818797}DyK _Toc472818798}DyK _Toc472818799}DyK _Toc472818800}DyK _Toc472818801}DyK _Toc472818802}DyK _Toc472818803}DyK _Toc472818804}DyK _Toc472818805}DyK _Toc472818806}DyK _Toc472818807}DyK _Toc472818808}DyK _Toc472818809}DyK _Toc472818810}DyK _Toc472818811}DyK _Toc472818812}DyK _Toc472818813}DyK _Toc472818814}DyK _Toc472818815}DyK _Toc472818816}DyK _Toc472818817}DyK _Toc472818818}DyK _Toc472818819}DyK _Toc472818820}DyK _Toc472818821}DyK _Toc472818822}DyK _Toc472818823}DyK _Toc472818824}DyK _Toc472818825}DyK _Toc472818826}DyK _Toc472818827}DyK _Toc472818828}DyK _Toc472818829}DyK _Toc472818830}DyK _Toc472818831}DyK _Toc472818832}DyK _Toc472818833}DyK _Toc472818834}DyK _Toc472818835}DyK _Toc472818836}DyK _Toc472818837}DyK _Toc472818838}DyK _Toc472818839}DyK _Toc472818840}DyK _Toc472818841}DyK _Toc472818842}DyK _Toc472818843}DyK _Toc472818844}DyK _Toc472818845}DyK _Toc472818846}DyK _Toc472818847}DyK _Toc472818848}DyK _Toc472818849}DyK _Toc472818850}DyK _Toc472818851}DyK _Toc472818852}DyK _Toc472818853}DyK _Toc472818854}DyK _Toc472818855}DyK _Toc472818856}DyK _Toc472818857}DyK _Toc472818858}DyK _Toc472818859}DyK _Toc472818860}DyK _Toc472818861}DyK _Toc472818862}DyK _Toc472818863}DyK _Toc472818864}DyK _Toc472818865}DyK _Toc472818866}DyK _Toc472818867}DyK _Toc472818868}DyK _Toc472818869}DyK _Toc472818870}DyK _Toc472818871}DyK _Toc472818872}DyK _Toc472818873}DyK _Toc472818874}DyK _Toc472818875}DyK _Toc472818876}DyK _Toc472818877}DyK _Toc472818878}DyK _Toc472818879}DyK _Toc472818880}DyK _Toc472818881}DyK _Toc472818882}DyK _Toc472818883}DyK _Toc472818884}DyK _Toc472818885}DyK _Toc472818886}DyK _Toc472818887}DyK _Toc472818888}DyK _Toc472818889}DyK _Toc472818890}DyK _Toc472818891}DyK _Toc472818892}DyK _Toc472818893}DyK _Toc472818894}DyK _Toc472818895}DyK _Toc472818896}DyK _Toc472818897}DyK _Toc472818898}DyK _Toc472818899}DyK _Toc472818900}DyK _Toc472818901}DyK _Toc472818902}DyK _Toc472818903}DyK _Toc472818904}DyK _Toc472818905}DyK _Toc472818906}DyK _Toc472818907}DyK _Toc472818908}DyK _Toc472818909}DyK _Toc472818910}DyK _Toc472818911}DyK _Toc472818912}DyK _Toc472818913}DyK _Toc472818914}DyK _Toc472818915}DyK _Toc472818916}DyK _Toc472818917}DyK _Toc472818918}DyK _Toc472818919}DyK _Toc472818920}DyK _Toc472818921}DyK _Toc472818922}DyK _Toc472818923}DyK _Toc472818924}DyK _Toc472818925}DyK _Toc472818926}DyK _Toc472818927}DyK _Toc472818928}DyK _Toc472818929}DyK _Toc472818930}DyK _Toc472818931}DyK _Toc472818932}DyK _Toc472818933}DyK _Toc472818934}DyK _Toc472818935}DyK _Toc472818936}DyK _Toc472818937}DyK _Toc472818938}DyK _Toc472818939}DyK _Toc472818940}DyK _Toc472818941}DyK _Toc472818942}DyK _Toc472818943}DyK _Toc472818944}DyK _Toc472818945}DyK _Toc472818946}DyK _Toc472818947}DyK _Toc472818948}DyK _Toc472818949}DyK _Toc472818950}DyK _Toc472818951}DyK _Toc472818952}DyK _Toc472818953}DyK _Toc472818954}DyK _Toc472818955}DyK _Toc472818956}DyK _Toc472818957}DyK _Toc472818958}DyK _Toc472818959}DyK _Toc472818960}DyK _Toc472818961}DyK _Toc472818962}DyK _Toc472818963}DyK _Toc472818964}DyK _Toc472818965}DyK _Toc472818966}DyK _Toc472818967}DyK _Toc472818968}DyK _Toc472818969}DyK _Toc472818970}DyK _Toc472818971}DyK _Toc472818972}DyK _Toc472818973}DyK _Toc472818974}DyK _Toc472818975}DyK _Toc472818976}DyK _Toc472818977}DyK _Toc472818978}DyK _Toc472818979}DyK _Toc472818980}DyK _Toc472818981}DyK _Toc472818982}DyK _Toc472818983}DyK _Toc472818984}DyK _Toc472818985}DyK _Toc472818986}DyK _Toc472818987}DyK _Toc472818988}DyK _Toc472818989}DyK _Ref378325359}DyK _Ref424531760}DyK _Ref424531823}DyK _Ref463686584}DyK _Ref424530589}DyK _Ref404565288}DyK _Ref456028389}DyK _Ref424530657DyK _Ref409416934}DyK _Ref451679320}DyK _Ref424535009}DyK _Ref463859562}DyK _Ref440437891}DyK _Ref440437891}DyK _Ref424530687}DyK _Ref424530746}DyK _Ref424530757}DyK _Ref459647164}DyK _Ref424530811}DyK _Ref404565288}DyK _Ref457201072}DyK _Ref456002819}DyK _Ref432004090}DyK _Ref459624386}DyK _Ref424667409}DyK _Ref424532763}DyK _Ref424667453}DyK _Ref424531014}DyK _Ref455931278}DyK _Ref455974300}DyK _Ref424531086}DyK _Ref424668494}DyK _Ref424531112}DyK _Ref424667502}DyK _Ref424667512}DyK _Ref424667579}DyK _Ref424531062}DyK _Ref424531062}DyK _Ref424532846}DyK _Ref424531183}DyK _Ref424667579}DyK _Ref424531213}DyK _Ref424531238}DyK _Ref424531262}DyK _Ref424531301}DyK _Ref424531326}DyK _Ref424531349}DyK _Ref458336610}DyK _Ref458336613}DyK _Ref457031693}DyK _Ref424531384}DyK _Ref424532979}DyK _Ref431982634}DyK _Ref424531447}DyK _Ref424531464}DyK _Ref424667800}DyK _Ref424667869}DyK _Ref424667882}DyK _Ref424667915}DyK _Ref424667925}DyK _Ref424667968}DyK _Ref424535329}DyK _Ref424535339}DyK _Ref424668007}DyK _Ref424668017}DyK _Ref424668059}DyK _Ref424668059}DyK _Ref424668059}DyK _Ref424668059}DyK _Ref424668141}DyK _Ref424668141}DyK _Ref463875961}DyK _Ref463875961$$If$  8H Xhx!00004 $a@}DyK _Ref449943314}DyK _Ref449943314}DyK _Ref424531495}DyK _Ref424535502}DyK _Ref449943299}DyK _Ref449943314}DyK _Ref449943299}DyK _Ref449943299}DyK _Ref458336277}DyK _Ref449966832}DyK _Ref458336277}DyK _Ref424531728}DyK _Ref424531741}DyK _Ref424535839}DyK _Ref463865954}DyK _Ref463865905}DyK _Ref424532979}DyK _Ref449944243}DyK _Ref449944260}DyK _Ref424535839}DyK _Ref463865954}DyK _Ref463865905}DyK _Ref424532979}DyK _Ref463878604}DyK _Ref457703968}DyK _Ref424531384}DyK _Ref457101484}DyK _Ref424534066}DyK _Ref424531384}DyK _Ref424530687}DyK _Ref424530687}DyK _Ref449763253}DyK _Ref458400834}DyK _Ref456028389}DyK _Ref456003675}DyK _Ref456003678}DyK _Ref456003682}DyK _Ref456003685}DyK _Ref424531694}DyK _Ref449968361}DyK _Ref424531728}DyK _Ref424531741}DyK _Ref424531647}DyK _Ref424531663}DyK _Ref424531760}DyK _Ref424531774}DyK _Ref424531794}DyK _Ref424531804}DyK _Ref424531823}DyK _Ref424531834}DyK _Ref424531852}DyK _Ref456002819}DyK _Ref456002880}DyK _Ref464292699}DyK _Ref464292724}DyK _Ref464292837}DyK _Ref457211232}DyK _Ref457211236}DyK _Ref463849711}DyK _Ref457211245}DyK _Ref457211250}DyK _Ref424531937}DyK _Ref424531574}DyK _Ref424534029}DyK _Ref424531574}DyK _Ref424667502}DyK _Ref463875961}DyK _Ref424534066}DyK _Ref449943299}DyK _Ref424534100}DyK _Ref424534100}DyK _Ref424534066}DyK _Ref449940080}DyK _Ref440438264}DyK _Ref449943299}DyK _Ref463875961}DyK _Ref424531663}DyK _Ref424534154}DyK _Ref424534154}DyK _Ref424534100}DyK _Ref424534233}DyK _Ref424531384}DyK _Ref424531062}DyK _Ref424668494}DyK _Ref424534397}DyK _Ref424534100}DyK _Ref424532099}DyK _Ref424531384}DyK _Ref440446657}DyK _Ref404572122}DyK _Ref455931278}DyK _Ref455931278}DyK _Ref404565288}DyK _Ref455931278}DyK _Ref455931278}DyK _Ref455931278}DyK _Ref424534464}DyK _Ref424534100}DyK _Ref424535986}DyK _Ref424531384}DyK _Ref424534510}DyK _Ref424534100}DyK _Ref424536060}DyK _Ref424531384}DyK _Ref457704028}DyK _Ref457704028}DyK _Ref457704028}DyK _Ref424531384}DyK _Ref424532158}DyK _Ref424530687DyK yK Rmailto:Fdlibm-comment@sunpro.eng.sun.com}DyK _Ref424668059}DyK _Ref424668059}DyK _Ref424534620}DyK _Ref424534620}DyK _Ref424536114}DyK _Ref424534620}DyK _Ref424534100}DyK _Ref424536220}DyK _Ref424531384}DyK _Ref424536114}DyK _Ref455931092}DyK _Ref455931092}DyK _Ref455931092$$IfH4@8Xx  8 Xx8Xx8                          hhhh4 Ha@$$IfH4@8Xx  8 Xx8Xx8                          hhhh4 Ha@$$IfH4@8Xx  8 Xx8Xx8                          hhhh4 Ha@}DyK _Ref424530746}DyK _Ref455931187}DyK _Ref440437891}DyK _Ref440437891}DyK _Ref424530746}DyK _Ref451679260}DyK _Ref449966403$$IfH4@8Xx  8 Xx8Xx8                          hhhh4 Ha@$$IfH4@8Xx  8 Xx8Xx8                          hhhh4 Ha@$$IfH@8Xx  8 Xx8Xx8                          hhhh4 Ha@}DyK _Ref404573597}DyK _Ref424534100}DyK _Ref404353569}DyK _Ref455931278}DyK _Ref455964627}DyK _Ref455964627}DyK _Ref424534100}DyK _Ref457102523}DyK _Ref424531384}DyK _Ref463855081}DyK _Ref449966832}DyK _Ref455971750}DyK _Ref424531062}DyK _Ref455971379}DyK _Ref455971381}DyK _Ref449966832}DyK _Ref424534066}DyK _Ref457710778}DyK _Ref463788107}DyK _Ref463788134}DyK _Ref463788188}DyK _Ref404573597}DyK _Ref440438264}DyK _Ref424667579}DyK _Ref455971449}DyK _Ref455972170}DyK _Ref455972172}DyK _Ref440443297}DyK _Ref440443312}DyK _Ref455972201}DyK _Ref449966854}DyK _Ref457709044}DyK _Ref449966920}DyK _Ref451680376}DyK _Ref456011285}DyK _Ref455972324}DyK _Ref455972327}DyK _Ref424535986}DyK _Ref455972335}DyK _Ref455972337}DyK _Ref424536060}DyK _Ref455972347}DyK _Ref455972349}DyK _Ref424536220}DyK _Ref455972366}DyK _Ref455972372}DyK _Ref404573597}DyK _Ref404353569}DyK _Ref456003831}DyK _Ref463854015}DyK _Ref463854015}DyK _Ref424534100}DyK _Ref463853782}DyK _Ref457102523}DyK _Ref463855081}DyK _Ref459624423}DyK _Ref459624423}DyK _Ref459624423}DyK _Ref451679260}DyK _Ref449966403}DyK _Ref457437441}DyK _Ref457437442}DyK _Ref457437443}DyK _Ref457437444}DyK _Ref457437448}DyK _Ref457437449}DyK _Ref457437450}DyK _Ref457437451}DyK _Ref457437452}DyK _Ref457437455}DyK _Ref457437456}DyK _Ref440443200}DyK _Ref440443215}DyK _Ref451679320}DyK _Ref451679320}DyK _Ref451679320}DyK _Ref451679320}DyK _Ref451679320}DyK _Ref451679320}DyK _Ref451679320}DyK _Ref451679320}DyK _Ref451679320}DyK _Ref451679320}DyK _Ref456010399}DyK _Ref456010399}DyK _Ref431982634}DyK _Ref457437478}DyK _Ref457437479}DyK _Ref424530746}DyK _Ref424530746}DyK _Ref424530746}DyK _Ref424530746}DyK _Ref424530746}DyK _Ref424530746}DyK _Ref424530746}DyK _Ref424530746}DyK _Ref440437891}DyK _Ref440437891}DyK _Ref440437891}DyK _Ref440437891}DyK _Ref440437891}DyK _Ref440437891}DyK _Ref440437891}DyK _Ref440437891}DyK _Ref440437891}DyK _Ref440437891}DyK _Ref440437891}DyK _Ref457437516}DyK _Ref457437517}DyK _Ref457437518}DyK _Ref457437523}DyK _Ref457437524}DyK _Ref457437525}DyK _Ref457437526}DyK _Ref457437527}DyK _Ref456028389}DyK _Ref456028389}DyK _Ref456028389}DyK _Ref456028389}DyK _Ref456028389}DyK _Ref456028389}DyK _Ref456028389}DyK _Ref456028389}DyK _Ref456028389}DyK _Ref456028389}DyK _Ref456028389}DyK _Ref456028389}DyK _Ref456028389}DyK _Ref456010676}DyK _Ref457437563}DyK _Ref457437564}DyK _Ref457437570}DyK _Ref456010689}DyK _Ref456010689}DyK _Ref456010689}DyK _Ref449966579}DyK _Ref449966579}DyK _Ref449966579}DyK _Ref449966579}DyK _Ref449966579}DyK _Ref449966579}DyK _Ref457437594}DyK _Ref457437595}DyK _Ref457437596}DyK _Ref457437597}DyK _Ref457449400}DyK _Ref440438334}DyK _Ref440438334}DyK _Ref440445008}DyK _Ref440445008}DyK _Ref440445026}DyK _Ref440445026}DyK _Ref440445026}DyK _Ref440445026}DyK _Ref440445026}DyK _Ref440445026}DyK _Ref440445041}DyK _Ref440445041}DyK _Ref440445041}DyK _Ref440445041}DyK _Ref440445056}DyK _Ref440445056}DyK _Ref440445075}DyK _Ref440445075}DyK _Ref440445075$$If$  8H Xhx!00004 $a@}DyK _Ref440445088}DyK _Ref440445088}DyK _Ref457437637}DyK _Ref440445201}DyK _Ref440445201}DyK _Ref457437654}DyK _Ref456010696}DyK _Ref457437655}DyK _Ref432004073}DyK _Ref440445453}DyK _Ref440445472}DyK _Ref457437662}DyK _Ref457437663}DyK _Ref457437670}DyK _Ref457437671}DyK _Ref457437672}DyK _Ref457437673}DyK _Ref457437674}DyK _Ref457437678}DyK _Ref457437679}DyK _Ref457437680}DyK _Ref457437681}DyK _Ref457437682}DyK _Ref457101484}DyK _Ref457101484}DyK _Ref457101484}DyK _Ref457101484}DyK _Ref457437688}DyK _Ref457437688}DyK _Ref457437688}DyK _Ref456003831}DyK _Ref456003831}DyK _Ref456003831}DyK _Ref456003831}DyK _Ref456003831}DyK _Ref456003831}DyK _Ref456003831}DyK _Ref456003831}DyK _Ref457446600}DyK _Ref457437740}DyK _Ref457437745}DyK _Ref457437746}DyK _Ref457437747}DyK _Ref457437748}DyK _Ref457437749}DyK _Ref457437753}DyK _Ref457437754}DyK _Ref457437755}DyK _Ref457437756}DyK _Ref457437757}DyK _Ref457437761}DyK _Ref457437762}DyK _Ref457437763}DyK _Ref457437765}DyK _Ref457437769}DyK _Ref457437770}DyK _Ref457437771}DyK _Ref457437772}DyK _Ref457437773}DyK _Ref457437777}DyK _Ref424530746}DyK _Ref440437891Z i8@8 NormalOJQJ_HmH sH tH L@L Heading 1 $ & Fd*$@&5CJH@H Heading 2$ & Fd*$@&5CJ@@"@ Heading 3$ & Fd$*$@&5@@2@ Heading 4$ & Fd$*$@&56@B6 Heading 5$d$@&5:@: Heading 7$ & F @&a$5H@H Heading 8$ & F d@&a$5CJb @b Heading 96 $$ & F d*$@&^`a$5CJ<A@< Default Paragraph Font:O: M0 $a$OJQJ_HmH sH tH  O M1OJQJO M2O" M3O2 M4OB M58@R8 TOC 1$ ' <a$52@Qb2 TOC 2^5&@ar& TOC 3  ^ &@q& TOC 4 ^* @* Footer $a$.@. Header $a$@6@6 Normal Indent ^&)@& Page Number*B@* Body Textx4O4 Syntax <x 5OJQJ:O: SyntaxOneOfx 5OJQJ:@: Footnote Text <OJQJXOX MathSpecialCase 3$! & F (^`(FO"F Code Sample 3"^ 5OJQJXO2X MathDefinition 4&# p  x<^ JO1BJ Code Sample 4$^` 5OJQJ@QR TOC 5%.@. TOC 6& ' ^.@. TOC 7' ' ^.@. TOC 8( ' x^x.@. TOC 9) ' @^@(O( Annex1 * & F2O2 SyntaxRule2 +@^@8O8 SyntaxRule ,$ 6HOH SyntaxDefinition-$@^@68&@8 Footnote ReferenceH*(U@( Hyperlink>*B*6'@6 Comment ReferenceCJ>O> SyntaxDefinition2 1^BO"B Bullet Notlast2 & F h(.O!". Bullet Last3.OB. Number2 4 & F(0OA"0 Number2 Last5"Ob" M1+ 6@^@"Or" M2+ 7@^@&O& Note2 8h^h O Note9CJ&O& Note3 :^<O< Note2 Number; & F >"O12" Note4<CJHO!H Bullet2 Notlast= & F h@^@0O0 Bullet2 Last>(O!( Annex2 ? & F(O1"( Annex3 @ & F(OA2( Annex4 A & FFO1F Alg 4++%B$ & F X>X^Xa$20@22 List Bullet C & F66@B6 List Bullet 2 D & F67@R6 List Bullet 3 E & F68@b6 List Bullet 4 F & F69@r6 List Bullet 5 G & FDO1D Alg 4+%H$ & F h``^`a$:O: CBI$hxa$5@CJOJQJ2O2 CA J$xa$5@OJQJxe@x HTML Preformatted7K 2( Px 4 #\'*.25@9 OJPJQJ4P@4 Body Text 2 Ldx0O0 Alg 1M$ & Fa$"O" Alg 2N0O!0 Alg 3O$ & Fa$0O10 Alg 4P$ & Fa$8Y@8 Document MapQ-D OJ QJ L@ DateR>V@1> FollowedHyperlink >*B* ph<Z@B< Plain TextTOJQJmH sH u,@R, Comment TextU0Ob0 Name List V$a$2Q@r2 Body Text 3WxCJHM@H Body Text First Indent X`@O@ Note CodeY$h^ha$ 5OJQJ*6N\j #)1;LN*6N\jxh MUE=ÍI\M&1,Y@I8 A  ٪  X  ʫ  8 o  ݬ  K    ' ^  ̮ @z@z Bz@z @z@z@z@z@z z z@z@z@z@z@z@z@z@ z@ z@ z@ z@ z@z@z@z@z@z@z@z@z@z@z@z@z@z@z@z@z@z@z@ z@!z@"z@#z@$z@%z@&z@'z@(z@)z@*z@+z@,z@-z@.z@/z@0z@1z@2z@3z@4z@5z@6z@7z@8z@9z@:z@;z@<z@=z@>z@?z@@z@Az@Bz@Cz@Dz@Ez@Fz@Gz@Hz@Iz@Jz@Kz@Lz@Mz@Nz@Oz@Pz@Qz@Rz@Sz@Tz@Uz@Vz@Wz@Xz@Yz@Zz@[z@\z@]z@^z@_z@`z@az@bz@cz@dz@ez@fz@gz@hz@iz@jz@kz@lz@mz@nz@oz@pz@qz@rz@sz@tz@uz@vz@wz@xz@yz@zz@{z@|z@}z@~z@z@z@z@z@z@z@zxxxh ]F! 0E?MMUUGfsM|EE ]_^l)J6;=={M[huÍbūҿ%II6bX$ #*d037CNP[pdmQzGE4\#и@m {:&M&1,1,C<G!W`l xهskI[A'D3@QG`,p{Y)ڝ\9; T, 7DJO5;;6 &ix }!"#=$~%&'() *f+1,i-.$/0812_3 456789:I;<=>?@xA BC{DEFIGGHIJKLMNOPQ8RST/UWVWXYZ[\]^*_`ab{czdIef7gLhijEk9l-mKnoDp_q:rIstu\v5wexyz{|E}6~E* -Q|V:=>wxy l ghq&3BRbr|   ( 4 A N Y g u  P {  A l  1 e  9 k ;o >sJ I"i*`/]9| ^(]IXd"kI{4X8h R !F!!!!("e"""%#[### $O$$$%F%%%&H&&&'L''',({(()M)))6***+<+++,i,, -M--- .M....)/b/// 0E000071t111#2_2223F3x33334d4445<555$6x666O777-8t889B999.:b:::?;;; <b<<<C===>Y>>>E?{??@^@@@0A}AABiBBBFCCC)D\DDD/E~EEFQFFF4GGG"HiHHHH8IjIII.JhJJJ KCKKKKALLLMMMMMTM`MNOyQRRZSSeTT UUUUUY[@]]>^^^abcc+d;gh`jkknr9sssvwwOxTxtxxQyXy.z:zzz||~~}+;NXYe]jćЇňӈ ŋYo'GNd?f@#9Su̧2Gߩ819Jrvyٳ̴Ƶ&9Oe@xļN/DEY)0Cyt:F&'.289@MRSZdijqw|}" %&-<ABI]bcj| #s ,V!HOV_5>!"*-345<?CDEHSZ[\]s7@EIOPX_ipqv~ !"#$0<"5_q!]yVbi~ !"#$-4?w(3=0B 5Li*?r*4YWVz]oR$r\FyExyz   $      M g    " {    / P j      6\,+\+u ^G [gw $)*-4DIJMTacdgn{}~v \^zA """" #=#W#####&$;$K$\$$$$%%|((**+@,Z,o-/0"1611111"242d2u222344>55 656@6J666C7P7v7778888899999:::;;;}<<===>>i?w???@!@BDGGJ|L{MNN7OBOO'P2P~P7QQVWW1XEXXXXXXXYYYiZjZuZ[[ [ \ \+\A^^`Ta]ahatauaaaaaaaaaaa1b2b:bIblbmbubbbbbb+c,cgggghOjclyoooDp|pppp!q3qBqqqq)r}rrrrbsqsst=twtttt u!uuuu+v=vLvvvwFwSwkww x7xxxy2yyyyAz~zz{<{z{{|8|U|;}+~>~jYBOv)9x!==QmÍӍ!()3ijo"#*`ahÓēœϓ9DKLV\]bhiq yz   #$,Ɩ4N`abMf,Bf|ΙewԚ"'9g}ěEICZmM٥F"f7}ŪUū5mݬM!Vή2B%Jjд$hݸs˹ߺ[޻j<aŽH`iѿҿݿ E{|1CDEi[sDm}5v$%.[\c GHI\EQbHAXL^6K4>TIV]FSqaskb%l7Imt%1;FX5ss"o; Z t    R n o     - 4 D e     $ c   );2<Sr0Nt%7 %Ye{ L"@ah 'A[iz5kP#2,k&  !&!!""#@#i#####$B$\$$$%#%=%&*&x&&&&&&S'n'''(2(((((k))))?*d*v****b+v+++,,,M,,,,-7-Q-c-w---.H.b.............../ ////I/R/S/{///////000J0d0011-1z1111G2l2~2223/3I3c3u334`4z4444&585S55555:6L6g66667&737L7S7n77 88889+9E9_94:F:^:!;;;5<m<<{=??W?@@lAABBCC=DEF]FFuGI J6JnJJK{K'M:MAMVMMM7NNNNNO3OPOP4PNPPPPQ?QRQRR%SBS\SSSSSKT]TTYUUU(V[VVV]WWWYZ[[)[[[8\\\\\]]6]]]]^^^_)_F_`_y___```8aaaaabb8bb%c7cLcScjcpdd}efffggh8hRhlhhh)iIiiiijjyjjjMklkkkkl`lllm*mDm^mmn1nno'ooop@pgpppq9qZq|qqarYssutt=umu=wUwwwwx0xlxxyy'yyyyyy7zQzzzzzz{{||I}g~~~!@ZVsƀ$`4Z{ڂ 0Uc|%SE߆Uˇه=rۈLp1Tڌ-j|-Gf"ˏ;VqǐՒܒ0KTjĔە m]sΗ%ɘ +EWߙ<[u МלEaÝ͝OmǞ F`rΠâڢ/JãţȣˣΣѣԣأܣ6ĥ"4P4Smѧ1B4N`[\gnzQ[[ahpUmծ]oׯ#2EL`~ڱF\vӲ w +۷${и!7Qv͹9K+2CEOżۼvȾپ6տ߿@Uobw4: $Hcw,^rmDz ,Fa4&Zh8G} E8ovXn-!&K_S $V`r7z &7fpM  '9is!f{ 2Ga{%3Ub)C|A dGMy >Sm\pwT);OVg)K]dsVf,>n I}R>N )i~!+PG5i{B[my[b   O     hq=6#9j'S*!3!!<"W"""##V#d###"$T$$k%&:&L&M&U&\&f&u&&&&&&*'\'u'''(`(x(((,)])))**-*****`++,0,1,K,3-.0z12345h89::d;;C<i<m<<<==">K>T>>>O?q??-@r@AALCCCuDDDQEiEEEEEEqF GGGIIJ K6LJLLM0MMNO7O4PCPPP.QOQLa 3ŝ|О @Sˠ<աw͢dݣJxī îͮ˯[Ѱ<XGrXawRIYsqAۿ[k"K!>?dRlDXd {ko*_ Q)Ab0'Ap(I.r?~ <|#ByN;\x0Jfr `FZijyEVd,Fn8J^*{<9P_kFXMW~Bk=QI-j 0p=t*2T*D[ , H   & m     C {        . r      @Q`uZkz ^o~A{9Mk6]{[j& .Uc'owhE Z   g!!R"" #E##a$r$$'%]%K'''(((1)O))***++,5---- .].K/ 0-0&11111E2D34E4555X6r6667177"8c99::t:::;b<t<<e==>a???@Q@@@@IB[BBTCzCE7GsHIhKKLvMMNBO@QQ4R{RT]UW,Z7ZHZIZLZNZOZRZiZjZmZZZZZZZ[[[v\w\x\9]Z]'^ __G`k`bbc+chcc"dFdddeegklmnnn:oooo,pBplpppppqSqlqq+rHrSr^rrrrss$s3ssss:tYtttuuu'vWvwnww#xQxyvyyz{{{0|_|v||| },}O}~M~1ÀЄtC/Y;_׌vӍ\pD5G-9B`וk/Mi,L˜Odՙ\uW;֜Ufڝ0ɟԟ9RĠݠ Oyޡ~( !ީߪEwԫ:ѬsͭFUKد#$Je}ȴ)B(7P[fиDmz;l5 ̼/ͿA\t P[jTj :.mf(*:$*KRvy=E>DqBb.NyYy G;g9c5_ aQH[2PFf&$B`@`LyGs~*Y :e\(f({ (dFf;`~/OmwHs#Am+=`z/ 5 l   o ;D|9%Rt(X3\Sx~4RRh}t9$ + ;   &!!" ###Q$%%%%h&6'''''((^((())))!*z**Y+++,6,T,,P-^-k-9..../0%000012=3I3b3~33345>6S6i666 7G7w77/8m88899&::<=Y=u=:>>>??@@BBBDDD&FFGEG`GGGGH.HQHsHHHHHH I1IPIjIIIIII J+JEJ^JvJJJJJJK1KDK`KzKKKKKL L>LXLqLLLLLLM6MOMqMMMMMMN2NSNyNNNNN*ODO]OOOOOPSPPPPPIQsQQQR7RJRRRS@SiSSST]TTTUSUUUV/VCVVVVCWWWWFXXXX=YYYY=Z{ZZZC[[[[$\q\\\]]]]]*^^^_/___`Z```a8auaa5bbbbcgcccd\dddde4eseee*fKfefzfff-gkggg%h;hhhh?i}iii;jUjkjjj%kjkkklsll.mCmmmnRnnn oDoopKp`pp q;qjqqq$rCrrstsssotxt!u(u3u?uNuuuuuuuuuuv#vqvyvv(wQw_wwwwx!x9xxx yyOyoyyyyyy zYzvzzzz{:{I{~{{y|||x}}~'k:ڋzRsnzFs@^[nҖBN<ij+0ڛ A`'L_**ߢ"`axԤ=bɥӧ`hĪ٪ IXh}nڬ\̭ԭ/GQ[ ESj%3ȳ߳Is@W$Զ!#%')+-/13579;=?ACEGIKMOQSTVXZ\^`bdfhjlnprtvxz|~ȷ k߸>m¹l *w@mм EaؾXؿwV7Sq5vw0Q7<] q>a $`l,Xrju-i2Bd2SGRaot{|~ [z31H^`bdfhjlnprtvxz|~C<`$J={ 8eQ'M={bQ#Vb  #Md_r@  - R  n   @ j ,  4Z ?klyb:/M@QXfp)7 !!!".""O###$%%%%%J&&'Y'n'''(+(U(s((())^*i*m+|+,,s-}-11i226445566N7k77 88L9w9:::n;;;5<<<=={>>???X@Y@`@=BBB$CKCCDQEG8HHIIIIJ&J'JeJJJJKKZK|K}KKKK L,L-LnLLLL$M%MnMMMN9N:NNNN O'O(OoOOOO PPDPPPPPPYAYBYCYEYGYIYKYMYOYPYQYRYYYYYYYYYYYYZZRZWZXZZZZZ[[I[[[\1\2\r\\\\\\J]O]P]]]]^6^7^w^^^^._/_x____J`K````.aaaabbQbkblbbbbc.c/cwccccddcddddeebeeeeffSfcfdffffgCgDgWgggg&hIhJhhhh i0iuiiijjjjjj@k]k^kkkk lllRllllll=m~mmmmnnOnnnnooSo_o`oooo pppqppppqqqqqq>rrrrrr;stsussssttttuuuxvyvv1w2wrwww>xDyEyyzzz{{{|||:};}}}}~V~W~~~~4tu  Q܀()nFG0݃23}ڄۄ&(+.147;?DGJMNO…ÅFGRabMkl;ʉ)GHԊ/12v܋$%h%&eՎEcdŏƏDED_`'(fؒ,:;RԓՓYZȔɔJYZ•ÕNږ:^_×ė#$cwxVWəRyzӚԚ ,-kwxۛܛ!op$%&'k b@ghܠݠ!UVKL5GH£ã8FXʥ-4F{Ȧ:Zzڧa[btȩߩp_<]~)ްD[Ҳ/ix=k}pη/;\-FWf .VWn߾5iE=[!z2p^     8i89;<=>?@ABCDEFGHIJKLMNOPQRSX\]^xyz{|-.:;<GHI[\hklyz{|}~ !"&159:?CGHMQUVno000000000000000`00I00000000000`V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0`0`0J0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000`00!00M!00TM0TM0TM0TM!00R0R0R0R0R0R`0R!00U0U0U0U0U 20U 30U!0UU0^0^0^!0UU0c0c0c0c0c(!0cc0k0k0k0k0k0k0k!0UU0w(!0ww0Ox(!0ww0tx(!0ww0Qy(!0ww0.z(!0ww0z(!0ww0|(!0ww0~(!0ww0}(!0ww0+(!0 ww0(!0 ww0(!0 ww0N(!0 ww0(!0 ww0(!0ww0(!0ww090(!0ww0Y(!0ww0(!0ww0](!0ww0ć(!0ww0ň(!0ww0(!0ww0 `0 !0!00(!00Y0Y(!00'0'0'0'(!000(!00N0N0N0N(!000+0100+01000+0100+0100+0100+0100+0100+010000+010+0100+01000+010000+0100+01000+01000+010!00O0O0O0O0O0O0O90O0O`0O!00+0100009090`0!00E0E0E0E,0E-0E,0E-0E!0EE00!0EE0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:0:,0:-0:!0EE000000000000000000000000,0-0!0EE00000,0-0,0-0,0-0,0-0,0-0,0-0,0-0,0-0,0-0!0EE0H,0H-0H(!0HH000,0-0(!0HH0505,05050505050505050505050505050505050505050505050505050505050505050505050505(!0HH0]0],0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]!0EE0$0$0$0$0$0$,0$-0$,0$-0$,0$-0$,0$-0$,0$-0$,0$-0$,0$-0$,0$-0$,0$-0$,0$-0$!0EE0V,0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V,0V0V0V0V0V0V0V0V!0EE0$,0$-0$(!0$$0w,0w-0w0w0w(!0$$0,0-0000(!0$$0,0-0,0-0,0-0,0-0,0-0,0-0,0-0,0-0,0-0,0-0090"09000 !0 !0 !0 !0 !0 !0 !0 !0 !0 !0  !0  !0  !0  !0  !0 !0 !0 !0 !0 !0 !0 !0 !0 !0 !0 !0 !0 !0 !0 !0 !0 !0 !0  !0! !0" !0# !0$00 =0 >0(!0$$0 0 ,0 -0 ,0 -0 ,0 -0 ,0 -0 ,0 -0 ,0 -0 ,0 -0 ,0 -0 ,0 -0 ,0 -0 ,0 -0 ,0 -0 0 0  !0%  !0&  !0'  !0(  !0)  !0*  !0+  !0,  !0-  !0.  !0/  !00  !01  !02  !03  !04  !05 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0  !06  !07  !08  !09 90 (!0$$0^0^0^,0^-0^,0^-0^,0^-0^,0^-0^,0^-0^,0^-0^,0^-0^,0^-0^90^0^0^!0EE0|((!0|(|( 20* 40* 50* 30* 20*0*90*+0*10*+0*10*+0*10*+0*10*+0*10*90* 20* 30*90* 20* 20* 30 *(!0|(|(0 6"0 60 6"0 60 6"0 60 60 6"0 60 60 6"0 60 6"0 690 60 6"0 60 6"0 690 60 6"0 60 60 6"0 60 6"0 60 6`0 6!00=!0==0>!0==0i?!0==0?!0==0@0@90@!0==0G0G0G0G0G0G70G0G0G70G0G0G0G0G0G!0==0W(!0WW01X01X01X01X01X01X01X01X01X01X01X01X01X01X01X01X01X(!0WW0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \0 \8!0 \ \0o P0o P0o P0o P0o P0o P0o8!0 \ \03q P03q P03q P03q P03q P03q P03q P03q03q8!0 \ \0bs0bs P0bs P0bs P0bs P0bs P0bs P0bs8!0 \ \0 u P0 u P0 u P0 u P0 u8!0 \ \0=v P0=v P0=v P0=v P0=v8!0 \ \0Sw P0Sw P0Sw P0Sw P0Sw P0Sw P0Sw P0Sw P0Sw P0Sw0Sw P0Sw P0Sw P0Sw P0Sw P0Sw P0Sw P0Sw P0Sw P0Sw0Sw0Sw!0==0+~0+~0+~0+~0+~ 20 +~ 30 +~0+~(!0+~+~E O0BE O0BE O0BE O0BE O0B(!0+~+~F O0)F O0)F O0)F O0)F O0)F O0)F O0)!0==00!0==0=0=0=`0=!00Í!0ÍÍ000000000000000000000000!0ÍÍ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ0œ!0ÍÍ000000000000000000000 0 0 000(!00b,0b-0b,0b-0b,0b-0b,0b-0b,0b-0b,0b-0b,0b-0b,0b-0b,0b-0b,0b-0b,0b-0b,0b-0b,0b-0b0b !0:b !0;b !0<b !0=b0b !0>b !0?b !0@b !0Ab !0Bb !0Cb !0Db !0Eb !0Fb !0Gb !0Hb !0Ib !0Jb !0Kb !0Lb !0Mb !0Nb !0Ob !0Pb !0Qb !0Rb !0Sb !0Tb !0Ub !0Vb !0Wb !0Xb !0Yb !0Zb !0[b !0\b !0]b !0^b !0_b !0`b !0ab !0bb !0cb !0db !0eb !0fb !0gb0b =0b >0b!0ÍÍ0 N0 N0 N0 N0 N0!0ÍÍ0 N0 N0 N0 N0 N090808080!0ÍÍ0 N0 N0 N0 N0 N09080808080!0ÍÍ0 N0 N0 N0 N0 N0908080!0ÍÍ0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`(!0``0EG O0EG O0EG O0EG O0EG O0EG O0EG O0EG O0EG O0EG O0 E90E80E80E80E:0E80E:0E0E!0ÍÍ0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%`0%!0 0I!0II(!0EE0Q 30 Q 30 Q(!0EE0 30 30 30(!0EE0A0A 30A 30A 30A(!0EE00H O0H O0H O0H O0H O00(!0EE0 20 300(!0EE000(!0EE0(!0EE0 20 20 20 30!0II0S0S0S(!0SS 20 20 30(!0SS0 20 20 30(!0SS 20  20! 30"`0!0 !00,0-0(!00(!00l(!007(!0000,0-0,0-0,0-00 0I O0I O0I O0I O0 0J O0J O0 0K O0K O0K O0K O0K O0 0L O0L O0L O0L O0L O0L O0 0M O0M O0M O0M O0M O0M O0M O0 0N O000!O0N O0(!00 0 ,0 -0 ,0 -0 ,0 -0 0  0 O O0 O O0  0 P O0 P O0  0 Q O0 Q O0 Q O0 Q O0 Q O0 Q O0  0 R O0 R O0 R O0 R O0 R O0 R O0  0 S O0 S O0  0 T O0 0 0  !O0  !O0 (!00U O0U O090!00,0-0,0-0,0-0,0-0,0-0,0-0(!00+00+00+00+00+00+000V O0V O0V O0V O0V O0V O0V O00(!00iW O0iW O0iW O0iW O0iW O0iW O0i0iX O0iX O0iX O0iX O0iX O0iX O0iX O0i(!00#Y O0#Y O0#Y O0#Y O0#Y O0#Y O0#Y O0#Y O0#Y O0#0#90#(!00"0"Z O0"0"[ O0"[ O0"0"\ O0"\ O0"\ O0"0"] O0"] O0"] O0"] O0"(00&^ O0&^ O0&!00&,0&-0&(!0&&0S'_ O0S'_ O0S'_ O0S'_ O0S'_ O0S'_ O0S'(!0&&0(` O0(` O0(` O0(` O0(` O0(` O0(!00v*,0v*-0v*(!0v*v*0b+a O0b+a O0b+a O0b+a O0b+a O0b+a O0b+(!0v*v*0,b O0,b O0,b O0,(!0v*v*0c-c O0c-c O0c-c O0c-c O0c-c O0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-0c-(!0v*v*0/d O0/d O0/d O0/d O0/d O0/d O0/(!0v*v*01e O01e O01e O01e O01e O01e O01(!0v*v*0~20~2f O0~2f O0~2f O0~2f O0~2(!0v*v*0u30u3g O0u3g O0u3g O0u3g O0u3g O0u3g O0u3(!0v*v*085h O085h O085h O085h O085h O085(!0v*v*0L6i O0L6i O0L6i O0L6i O0L6i O0L6!0037,037-037037037! N037! N037! N037! N037! N037! N037! N037! N037(!037370F:0F: 20#F: 20$F: 20%F: 20&F: 20'F: 30(F:(!037370?? 20)?? 20*?? 20+?? 20,?? 20-?? 20.?? 20/?? 200?? 301??(!037370EF90EF0EF0EF 202EF 203EF 204EF 205EF 206EF 307EF!00'M,0'M-0'M(!0'M'M0M0Mj O0Mj O0Mj O0Mj O0Mj O0Mj O0Mj O0Mj O0Mj O0Mj O0 Mj O0 Mj O0 Mj O0 Mj O0 Mj O0M90M(!0'M'M0Rk O0Rk O0Rk O0Rk O0Rk O0Rk O0Rk O0Rk O0R(!0'M'M0]T0]T0]T 208]T 209]T 20:]T 20;]T 20<]T 20=]T 20>]T 30?]T0]T!00Z,0Z-0Z(!0ZZ0[0[l O0[l O0[l O0[l O0[l O0[l O0[l O0[l O0[l O0[(!0ZZ0]0]m O0]m O0]m O0]m O0]m O0]m O0]m O0]m O0]m O0](!0ZZ0`0`n O0`n O0`n O0`n O0`n O0`n O0`n O0`n O0`n O0`!007c,07c-07c,07c-07c907c07c07c07c(!07c7c0go O0go O0go O0go O0go O0go O0g(!07c7c0)ip O0)ip O0)ip O0)ip O0)ip O0)ip O0)i(!07c7c0jq O0jq O0jq O0jq O0jq O0jq O0j(!07c7c0`lr O0`lr O0`lr O0`lr O0`lr O0`lr O0`l(!07c7c0ns O0ns O0ns O0ns O0ns O0ns O0ns O0ns O0ns O0ns O0 ns O0 ns O0 ns O0 ns O0 ns O0ns O0ns O0ns O0ns O0ns O0ns O0n90n(!07c7c0=wt O0=wt O0=wt O0=wt O0=wt O0=wt O0=wt O0=wt O0=w(!07c7c0yu O0yu O0yu O0yu O0yu O0yu O0yu O0yu O0y!00z,0z-0z,0z-0z0z0z0z(!0zz0g~v O0g~v O0g~v O0g~v O0g~v O0g~v O0g~(!0zz0w O0w O0w O0w O0w O0w O0(!0zz0`x O0`x O0`x O0`x O0`x O0`x O0`x O0`x O0`x O0`x O0 `x O0 `x O0 `x O0 `x O0 `x O0`x O0`x O0`x O0`x O0`x O0`x O0`x O0`90`80`80`80`80` ;0` ;0`80`80`(!0zz01y O01y O01y O01y O01y O01y O01(!0zz0|z O0|z O0|z O0|z O0|z O0|z O0|(!0zz0{ O0{ O0{ O0{ O0{ O0{ O0{ O0{ O0{ O0{ O0 { O0 { O0 { O0 !0 0,0-0,0-0,0-0,0-0,0-0,0-000" N0" N0" N0" N0" N0" N0" N0" N0!0 0,0-0,0-0,0-0,0-000# N0# N0# N0# N0# N0# N0# N00$ N0$ N0$ N0$ N0$ N0$ N0$ N0090!0 0,0-0,0-000% N0% N0% N0% N0% N0% N0% N0% N0% N0% N0 090!0 0,0-0,0-0,00000000000000000(!00| O0| O0| O0| O0| O0(!004} O04} O04} O04} O04} O04} O04} O04!0 0ѧ,0ѧ-0ѧ,0ѧ-0ѧ0ѧ0ѧ& N0ѧ& N0ѧ& N0ѧ& N0ѧ& N0ѧ0ѧ`0ѧ!0 0\,0\-0\0\0\!0\\0[,0[-0[,0[-0[0[0[' N0[0[( N0[( N0[0[) N0[) N0[) N0[0[* N0[* N0[* N0[* N0[* N0[* N0[!0\\02,02-02,02-02,02-02,02-02,02-02,02-02,02-0202020202+ N02+ N0202, N0202- N02- N0202. N0202/ N02/ N02/ N02/ N02/ N02020 N020 N0202!0\\0,0-0001 N0!0\\0,0-00002 N02 N02 N0!0\\0Ⱦ,0Ⱦ-0Ⱦ0Ⱦ0Ⱦ0Ⱦ3 N0Ⱦ3 N0Ⱦ3 N0Ⱦ3 N0Ⱦ3 N0Ⱦ3 N0Ⱦ3 N0Ⱦ3 N0Ⱦ0Ⱦ4 N0Ⱦ4 N0Ⱦ4 N0Ⱦ4 N0Ⱦ4 N0Ⱦ4 N0Ⱦ!0\\00,0-0(!00~ O0~ O0~ O0~ O0~ O0~ O0~ O0~ O0~ O0~ O0 ~ O0 (!00c O0c O0c O0c O0c O0c O0c O0c O0c O0c O0 c O0 c(!00 O0 O0 O0 O0 O0 O0 O0 O0 O0 O0  O0  O0  O0  O0  O0 O0 O0 O0 O00 O0 O0 O0 O0 O0 O0 O0 O0 O0 O0  O0  O0  O0  O0  O0 O0 O0(!00 O0 O0 O0 O0 O0 O0 O0 O0 O0 O0  O0  O0  O0  O0 00 O0 O0 O0 O0 O0 O0 O0 O0 O0 O0  O0  O0  O0  O0  O000!0\\0,0-000 =0 >005 N006 N0!0\\0 ,0 -0 0 0  =0  >0 0 7 N0 0 8 N0 !0\\0 ,0 -0 0 0 0 9 N0 9 N0 9 N0 9 N0 !0 \\0,0-00000: N0: N0: N0: N0: N0: N0: N0: N090!0 \\0,0-0,0-0,0-0,0-0,0-000; N0; N0; N0; N0; N00< N0< N0< N0< N0< N0< N0< N0< N0< N0< N0 < N0 < N0 < N0 < N0 < N0< N0< N0< N0< N0< N00= N0= N0= N00!0 \\0\,0\-0\0\0\0\0\0\!0 \\0;,0;-0;0;0;> N0;> N0;> N0;!0 \\0K,0K-0K,0K-0K,0K-0K0K0K0K0K? N0K? N0K? N0K? N0K0K@ N0K@ N0K@ N0K@ N0K0KA N0KA N0KA N0KA N0KA N0KA N0KA N0KA N0K0KB N0KB N0KB N0KB N0KB N0KB N0KB N0K0K0KC N0KC N0K`0K!0 0,0-0,0-0,0-0,0-000 M0 M00 M0 M00!M0!M0!M0!M0!M0!M0900 M0 M0 M0 00m(!0m0 20@ 30A90(!0m0  20B  20C  20D  30E 90 90 !00D N0D N0D N0D N0D N0D N0D N0D N0D N0D N0 D N0 D N0 D N0 D N0 D N0D N0D N0D N0D N0D N0909090Y09090(!00*! P0*! P0*! P0*! P0*! P0*! P0*!(!00V# M0V# M0V# M0V# M0V# M0V# M0V# M0V# M0V#`0V#!0 0M&,0M&-0M&,0M&-0M&,0M&-0M&0M&0M& M0M& M0M& M0M&0M& M0M&0M& M0M& M0M&0M& M0M& M0M&0M& M0M& M0M& M0M& M0M&0M&0M& M0M& M0M&0M& M0M&0M& M0M&`0M&!001,01,01,01,01,901,01,01,01,901,01,!01,1,0:0:0:(!0::8!0C<C<0i<8!0C<C<0<8!0C<C<0=(!0::8!0">">0K> P0K> P0K> P0K> P0K> P0K> P0K>0K>8!0">">0A0A P0A P0A P0A P0A P0A P0A P0A P0A P0A P0 A P0 A P0 A P0 A P0 A P0A P0A P0A P0A90A90A8!0">">06L06L P06L P06L P06L P06L P06L906L8!0">">04P8!0">">0P(!0::0.Q90.Q0.Q0.Q0.Q0.Q,0.Q-0.Q,0.Q-0.Q,0.Q-0.Q,0.Q-0.Q,0.Q-0.Q,0.Q-0.Q,0.Q-0.Q,0.Q-0.Q0.Q0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0 .Q P0 .Q P0 .Q P0 .Q P0 .Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0 .Q P0 .Q P0 .Q P0 .Q P0 .Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0.Q P0 .Q P0!.Q P0".Q P0#.Q P0$.Q P0%.Q P0&.Q P0'.Q P0(.Q P0).Q P0*.Q90.Q90.Q90.Q0.Q0.Q0.Q0.Q0.Q0.Q0.Q0.Q0.QK0.QK0.QK0.QK0.Q0.Q0.Q0.QK0.QK0.QK0.QK0.Q0.QK0.QK0.QK0.QK0.QK0.QK0.Q0.QK0.QK0.QK0.QK0.QK0.QK0.QK0.QK0.QK0.QK0.QK0.QK0.QK0.QK0.Q0.QK0.QK0.QK0.QK0.QK0.QK0.QK0.QK0.QK0.Q0.QK0.QK0.QK0.QK0.QK0.QK0.Q0.QK0.QK0.QK0.QK0.QK0.QK0.Q0.QK0.Q90.Q90.Q90.Q90.Q8!0.Q.Q0q0q P0q P0q P0q P0q90q8!0.Q.Q0t0t P0t P0t P0t P0t8!0.Q.Q0v0v P0v P0v P0v P0v90v8!0.Q.Q0Ny0Ny P0Ny P0Ny P0Ny P0Ny(!0::8!0y{y{0{8!0y{y{0|8!0y{y{0}|8!0y{y{0|8!0y{y{0R}8!0y{y{0}8!0y{y{0)~8!0y{y{0i~8!0y{y{0~8!0 y{y{0B8!0 y{y{08!0 y{y{08!0 y{y{0 8!0 y{y{0j8!0y{y{0(!0::8!00 !01,1,(!0TT0c8!0cc0 P0 P0(!0TT0[8!0[[0ԃ P0ԃ P0ԃ P0ԃ P0ԃ P0ԃ P0ԃ P0ԃ P0ԃ(!0TT0ه0ه8!0هه00(!0TT08!00v8!00 P0 P0 P08!0090908!00֍8!003 P03 P03 P03 P039038!00 P0 P0 P0 P0 P0 P08!00d P0d P0d P0d P0d P0d90d(!0TT0!01,1,(!0qq08!00 P0(!0qq058!05500 P0 P0 P0 P0 P0 P0 P0 P0 P0 P0  P0  P0  P0  P0  P0 P0 P0090"0"0"0(!0qq008!00@0@(!0qq00008!00d8!00ݣ0ݣ8!000008!00x0x0x(!0qq0ī8!0īī08!0īī0î8!0īī0˯0˯ P0˯ P0˯ P0˯ P0˯ P0˯ P0˯ P0˯ P0˯!01,1,0(!00G8!0GG0X P0X(!00a8!0aa000008!0aa0I0I0I(!0008!00[0[(!00"0"0"90"8!0""08!0""0!0!8!0""00 P0 P0 P0 P0 P0 P0 P0 P0 P0 P0  P0  P0  P0  P0  P0 P00908!0""0k0k P0k P0k P0k P0k P0k P0k P0k P0k P0k P0 k P0 k P0 k P0 k P0 k P0k P0k P0k P0k P0k P0k P0k P0k P0k0k90k8!0""0A0A P0A P0A P0A P0A P0A P0A P0A P0A P0A P0 A P0 A P0 A P0 A P0 A P0A P0A0A90A8!0""0 P0 P0 P0 P0 P0 P0 P0 P0 P0 P0 908!0""0B0B P0B P0B P0B P0B P0B P0B P0B P0B0B90B8!0""0\ P0\ P0\ P0\ P0\ P0\ P0\ P0\ P0\ P0\ P0 \ P0 \ P0 \ P0 \ P0 \ P0\ P0\ P0\ P0\ P0\ P0\ P0\ P0\ P0\ P0\ P0\ P0\90\8!0""0 P0 P0 P0 P0 P0 P0 P0 P0 P0 P0  P0  P0  P0  P0  P0 P0 P0 P0 P0 P0908!0 ""0 P0 P0 P0 P0 P0 P0 P0 P0 P0 P0  P0  P0  P0  P0  P0 P0 P0 P0 P0 P00908!0 ""00 =0 =0  =0  =0  >0 0 P0 P0 P0 P00 =0  >000 =0 =0 =0 =0 =0 >0900 P0 P0 P0 P0 P0 P0 P0 P0 P0 P0  P0  P0  P0  P0  P0 P0 P0 P0 P0 P090908!0 ""0T P0T P0T P0T P0T P0T P0T P0T P0T P0T P0 T P0 T P0 T P0 T P0 T P0T P0T P0T P0T P0T P0T P0T P0T P0T P0T P0T P0T P0T P0T P0T P0T P0T P0T P0 T P0!T P0"T P0#T P0$T P0%T P0&T P0'T P0(T P0)T P0*T P0+T P0,T P0-T P0.T P0/T P00T P01T P02T P03T P04T P05T0T0T8!0 ""0A0A P0A P0A P0A P0A P0A P0A P0A P0A P0A P0 A P0 A P0 A P0 A P0 A P0A P0A P0A P0A P0A P0A P0A P0A0A90A(!008!00[0[0[ P0[ P0[ P0[ P0[ P0[ P0[ P0[ P0[ P0[ P0 [ P0 [ P0 [ P0 [ P0 [ P0[ P0[8!000!01,1,(!008!00E (!00 8!0  0g!0g!0g!(!00 #0 #8!0 # #0a$0a$8!0 # #0'%0'%(!00'0'8!0''0(8!0''01)01)8!0''0*0*8!0''0+0+0+ P0+ P0+ P0+ P0+ P0+90+8!0''0 00 0 P0 0 P0 0 P0 0 P0 0 P0 090 08!0''04 P04 P04 P04 P04 P04 P04 P04049048!0''0707 P07 P07 P07 P07 P07 P07 P07 P07079078!0''0e=0e= P0e= P0e= P0e= P0e= P0e= P0e= P0e= P0e= P0e=0e=90e=8!0''0TC0TC0TC90TC90TC90TC90TC90TC8!0 ''0vM 20FvM 30GvM90vM8!0 ''0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q0Q90Q8!0 ''09]09]909]909]8!0 ''0G` P0G` P0G` P0G` P0G` P0G` P0G` P0G` P0G`0G`90G`8!0 ''0e0e0e0e0e0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0 e!P0 e!P0 e!P0 e!P0 e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0e!P0 e!P0!e0e P0e P0e P0e P0e P0e P0e P0e P0e0e90e90e8!0''0vy0vy0vy0vy!P0vy!P0vy!P0vy!P0vy!P0vy!P0vy!P0vy!P0vy!P0vy0vy90vy8!0''0090908!0''0090908!0''090908!0''009090(!0008!000!01,1,(!0׌׌08!00v(!0׌׌0Ӎ8!0ӍӍ0\0\0\(!0׌׌008!00505(!0׌׌0008!00B8!0008!00/0/(!0׌׌0,!01,1,(!00˜8!0˜˜0O(!00ՙ8!0ՙՙ0\0\0\(!0008!00U0U8!0008!0008!00ɟ0ɟ8!009098!00Ġ0Ġ(!00O0O0O8!0OO08!0OO0008!0OO0908!0OO008!0OO0ީ!P0ީ!P0ީ!P0ީ!P0ީ!P0ީ!P0ީ!P0ީ!P0ީ!P0ީ!P0 ީ!P0 ީ!P0 ީ!P0 ީ!P0 ީ!P0ީ!P0ީ!P0ީ!P0ީ!P0ީ!P0ީ0ީ0ީ0ީ90ީ8!0OO0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P0 !P0 !P0 !P0 !P0 !P0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P000090808!0OO0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P0 !P0 !P0 !P0 !P0 !P0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P0!P0000(!00!01,1,000090(!08!00(0(8!0008!0008!00$0$90$8!00K0K90K8!00v0v8!00=0=90=8!00>0>(!00090908!00 20H 20I 30J8!00 20K 20L 20M 30N8!00 20O 20P 20Q 20R 30S8!00  20T  20U  20V  20W  30X 8!00 20Y 20Z 20[ 20\ 20] 20^ 20_ 20` 20a 20b 20c 20d 20e 20f 20g 20h 20i 20j 20k 20l 20m 20n 30o8!00 20p 20q 20r 20s 20t 30u08!00 20v 20w 20x 20y 30z8!00 20{ 20| 20} 20~ 308!00 20 20 20 20 20 30908!0 0 20 20 20 20 308!0 0 20 20 3008!0 0 20 20 3008!0 0s 20s 20s 20s 20s 20s 20s 20s 20s 20s 20s 20s 20s 20s 20s 20s 20s 20s 20s 20s 20s 20s 20s 30s8!0 0{8!00 20 20 20 20 20 20 3090908!00 20 20 20 308!00 20 20 20 20 308!00 20 20 20 30!01,1,(!0008!00w0w0w8!00#00#00#08!00#00#00#00#00#08!00z#0z0z#0z0z8!00 #0 8!00;#0;0;8!008!000#00#00#00008!00#00#008!0 0303030303030303030303038!0 04 P04 P04 P04 P04 P04 P04 P048!0 0 P0 P0 P0 P0 P0 P0 P0 P0 P08!0 0 P0 P0 P08!0 0+  P0+  P0+  P0+ 90+ (!00"90"8!0""0#(!00%8!0%%0%0%0%0% P0% P0% P0% P0% P0% P0% P0% P0% P0% P0 % P0 % P0 %8!0%%0z*0z*0z* P0z* P0z* P0z* P0z* P0z* P0z*8!0%%0^-0^-0^-(!00.0.8!0..00008!0..0000$00$00$0000$00008!0..04 P04 P04 P04 P04 P04 P04 P04 P04 P04 P0 4 P0 404904(!00909098!0990<8!0990Y=90Y=8!0990>8!0990?8!0990@90@8!0990B90B8!0990D90D8!0990F8!099 P0EG P0EG8!0 99 P0G P0G P0G8!0 99 P0QH P0QH P0QH8!0 99 P0H P0H P0H8!0 99 P01I P01I P01I8!0 99 P0I P0I P0I8!099 P0 J P0 J P0 J8!099 P0vJ P0vJ P0vJ8!099 P0J P0J P0J8!099 P0DK P0DK P0DK8!099 P0K P0K P0K8!099 P0 L P0 L P0 L8!099 P0L P0L P0L8!099 P0L P0L P0L8!099 P0qM P0qM P0qM8!099 P0M P0M P0M8!099 P0SN P0SN P0SN8!0990N P0N P0N P0N8!099 P0O P0O P0O P0O P0O8!099 P0P P0P P0P P0P P0P P0P8!099 P0Q P0Q P0Q P0Q P0Q P0Q8!0990@S P0@S P0@S P0@S P0@S P0@S P0@S P0@S0@S8!0990U P0U P0U P0U P0U P0U P0U P0U0U8!09900W:'P0W:'P0W:'P0W:'P0W:'P0W:'P0W:'P0W:'P0W0W:'0 990Z0Z;'P0Z;'P0Z;'P0Z;'P0Z;'P0Z;'P0Z;'P0Z;'P0Z0Z:'0!990]0]0]<'P0]<'P0]<'P0]<'P0]<'P0]<'P0]<'P0]<'P0]<'P0]0]:'0"9909a09a09a='P09a='P09a='P09a='P09a='P09a='P09a='P09a='P09a='P09a09a:'0#99>'P0d>'P0d>'P0d>'P0d>'P0d>'P0d:'0$99?'P0+f?'P0+f?'P0+f?'P0+f?'P0+f?'P0+f:'0%990lg@'P0lg@'P0lg@'P0lg@'P0lg@'P0lg@'P0lg@'P0lg0lg:'0&990iA'P0iA'P0iA'P0iA'P0iA'P0iA'P0iA'P0i0i:'0'990k0kB'P0kB'P0kB'P0kB'P0kB'P0kB'P0kB'P0kB'P0k0k:'0(990 o0 oC'P0 oC'P0 oC'P0 oC'P0 oC'P0 oC'P0 oC'P0 oC'P0 o0 o:'0)990%r*'00r'0 2,2,0us90us*'0usus0pt0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt,0pt-0pt*'0usus0{:'0{{0z| 20z| 20z| 20z| 20z| 30z|0z| 20z| 20z| 20z| 20z| 20z| 20z| 30z|0z|:'0{{0D'P0D'P0o'H0o'H0o'H0o'H0o'H0o'H00:'0{{0o0oE'P0oE'P0oE'P0op'H0op'H0op'H0o0o$0o0o$0o0o$0o0o$0o:'0{{0C0CF'P0CF'P0CF'P0Cq'H0Cq'H0C0C:'0{{0,G'P0,G'P0,G'P0,G'P0,0,0,H'P0,H'P0,H'P0,H'P0,H'P0,H'P0,r'H0,0,'P0,'P0,'H0,'H0,'H0,'H0,'P0,'P0,'P0,'P0,'P0,'P0,'P0,'P0 ,'P0 ,'P0 ,'P0 ,'P0 ,0,0,0,$0,0,$0,0,0,$0,0,$0,0,$0,$0,0,$0,0,0,$0,0,$0,0,$0,0,0,$0,0,$0,0,$0,:'0{{0RK'P0RK'P0RK'P0RK'P0RK'P0R0RL'P0RL'P0RL'P0RL'P0RL'P0R0RM'P0RM'P0RM'P0RM'P0RM'P0RM'P0R0RN'P0RN'P0RN'P0RN'P0RN'P0RN'P0R0RO'P0RO'P0RO'P0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0R0RO'P0R:'0{{0Q'P0Q'P00R'P0R'P00000S'P0S'P00T'P0T'P00U'P0U'P0U'P0:'0{{0V'P0V'P0V'P00W'P0W'P000X'P0X'P00Y'P0Y'P0Y'P0~'H0 B0 B0 B0 B0 B0 B0 B0~'H000Z'P0Z'P0'H0'H0'H0'H0'H0'H0'H0'H00['P0['P0x'H0x'H0x'H0x'H00\'P0y'H0y'H0y'H0y'H0y'H0y'H0y'H0y'H0y'H0y'H0 y'H0 0]'P0]'P0]'P0]'P0]'P0]'P0000$00$00$00$00$00$00$000:'0{{0k^'P0k^'P0k^'P0k^'P0k^'P0k^'P0k^'P0k^'P0kz'H0kz'H0kz'H0kz'H0kz'H0kz'H0kz'H0kz'H0kz'H0kz'H0 k0k_'P0k_'P0k_'P0k0k`'P0k`'P0k0k:'0 {{000000000000000000000000000000000a'P0a'P0a'P0a'P0000:'0 {{0b'P0b'P0b'P000:'0 {{000000000000000000000000000000000000000000000000000000000000000000000000000000000000000:'0 {{00:'0 {{00:'0{{00h'P0h'P0h'P00i'P0i'P0i'P0i'P0i'P00j'P0j'P0j'P0j'P0j'P0j'P0j'P0:'0{{00k'P0k'P0k'P00l'P0l'P0l'P0l'P0l'P0000:'0{{00:'0{{00:'0{{0m'P0m'P0m'P0m'P00000*'0usus:'00 *'0usus0N:'0NN0000000000*'0usus0. 0. :'0. . 0o 0o *'0usus0A 0A 0A :'0A A 0:'0A A 00n'P0n'P0n'P0n'P0n'P0n'P0n'P0n'P0n'P0n'P0 n'P0 n'P0 n'P0  =0 =0 =0 =0 >0:'0A A 00:'0A A 0090*'0usus0:'00R:'00:'00:'00:'00g'0 2,2,0**'0**0:'0000*'0**0!:'0!!0"0"0"*'0**0#0#:'0##0%0%*'0**0%0%:'0%%0&:'0%%0Z':'0%%0':'0%%0(*'0**0V(*'0**0(:'0((0):'0((0_*:'0((0n+:'0((0,:'0((0t-:'0((01*'0**0j20j2:'0j2j204:'0j2j20505:'0j2j20O7:'0j2j20707:'0j2j20M90M9:'0j2j20:0::'0j2j20;0;:'0j2j20<:'0j2j20=:'0 j2j20|><0|>:'0 j2j20?`0? '00Z@0Z@ 20Z@ 20Z@ 20Z@ 30Z@0Z@0Z@ 20Z@ 20Z@ 20Z@ 30Z@`0Z@ '*0'?0II,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I,0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I0I,0I,0I0I0I0I0I0I0I0I0I,0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I,0I-0I0I'?0II,0Eg-0Eg0Eg,0Eg-0Eg0Eg,0Eg-0Eg0Eg,0Eg-0Eg,0Eg-0Eg0Eg,0Eg-0Eg0Eg,0Eg-0Eg0Eg,0Eg-0Eg0Eg,0Eg-0Eg0Eg,0Eg-0Eg0Eg,0Eg-0Eg0Eg,0Eg-0Eg0Eg,0Eg-0Eg0Eg'?0II,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m-0m0m,0m0m0m0m0m0m0m0m0m0m0m0m0m0m0m,0m-0m0m,0m-0m0m'?0II,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H,0H-0H0H'?0II,0<-0<0<,0<-0<0<,0<-0<0<,0<-0<0<,0<-0<0<,0<-0<0<,0<-0<0<'?0II,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00'?0II,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0-00,0@-0 '*0'?0990G*'@0GG00,0-0,0-00 !0h !0i !0j !0k !0l !0m !0n !0o !0p !0q !0r0*'@0GG00,0-0,0-0,0-0,0-00 !0s !0t !0u !0v !0w !0x !0y !0z !0{ !0| !0} !0~ !00'?0990*'@0000&O0&O0&O0&O0&O0&O0&O0&O0&O0&O0 &O0 &O0 &O0 &O0 &O0&O090*'@00l0l&O0l&O0l&O0l&O0l&O0l&O0l&O0l&O0l&O0l&O0 l&O0 l&O0 l&O0 l&O0 l&O0l&O0l&O0l&O0l&O0l&O0l*'@00/&O0/&O0/&O0/&O0/&O0/&O0/&O0/&O0/0/90/*'@0900&O0&O0&O0*'@090>0>&O0>&O0>&O0>&O0>&O0>&O0>&O0>&O0>*'@090q0q`0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q *0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000`|~~~~~~~~~~~~~0>K^n}vge $+vgu !"#%#&f'()*,K-.0123456789;<>@AECDdF"H~I-KsLzMNOVIrlVa3w2E GP!<(58LSX"b@qvs~HqdS7{ K ; '.258(>Tr_kpuu.t`:r̾qF?UDXW w)i5AIO/WI_eTkrXtrX{ aw M )(b4x@ZJ\TZ`hs wz69KԼJu5@`q Dz'8-7-@PNRYaah%qy{iHe4d^la1-+u$-023\5l<AFNPS:UX4\v^`bdf@iCk n/p[rsvxB{nԂ$/'{6#0r'Uҫ=ղϼIZzmrtuvwxz{|}~  !"$)*,12579;=@BDILNQTVXZ]_`bdfhknprtvwy{~    "$&),.13589;=>@BCEGINOQSUVXZ_aeghjkmoprtuvwxz{} P '?ACEFGHJKMOPRSUWY[\^acegijlmoqsuxz|}  !#%'(*+-/02467:<?ADFHJKLMPRTWY[\]^`bcdfilnqsy|~o>eu   0 L N [ w y  ! = ? L h j  - / E a c {   5 7 K g i | 79Okm :<Soq*FHf  )EG`| Hdgy %(?[^o*-<X[q47[wz =Y\f#&<X[q(DG`|7SVjC_br Jfix (DGZvy/2a}7SV{36Gcf  1 M P k !!%!A!D!`!|!!!!!!!!"#"&"D"`"c"~""""""# ###:#V#Y#v#######$ $.$J$M$p$$$$$$$$%%%A%D%h%%%%%%%&&'&C&F&g&&&&&&&''+'G'J''''''' ('(*(Z(v(y((((()),)H)K)t))))))*1*4*j********++7+:+^+z+}+++++,,H,d,g,,,,,- -,-H-K-l-------. .,.H.K.q........./$/'/A/]/`/w///////00$0@0C0c00000000012151S1o1r111111122!2>2Z2]2y2222222 3 3%3A3D3W3s3v33333334.414C4_4b4y444444445575:5i55555566"6W6s6v6666666.7J7M7m777777 8(8+8S8o8r8888888!9=9@9p999999 :):,:A:]:`:::::::;:;=;o;;;;;;;< <@<\<`<<<<<<<!===A=i=======>>7>S>W>>>>>>>#???C?Y?u?y????? @@<@X@\@@@@@@@A*A.A[AwA{AAAAAAAGBcBgBBBBBBB$C@CDCuCCCCCCD#D'D:DVDZDvDDDDDD E)E-E\ExE|EEEEEFF/FKFOFFFFFFFG.G2GeGGGGGGHH HGHcHgHsHHHHHHHHHI2I6IHIdIhIyIIIIII J(J,JFJbJfJxJJJJJJJK K!K=KAK]KyK}KKKKKKKL;L?LbL~LLLLLL MMMRRR7RYf|oؔޔܗҘ՘ؘxɜ̜Ϝ h>ioy ') 5 = 000MAhAjAUWpWtWzWWWCZ^ZeZZZZggg;lVl_llm!m$m?mGmJmemmmpmmmmmmmmmUnpnyn:sUs^s||}qz '+a|/41X[4: %*9Bx "##(((*4*;*000!2<2C29999: ::):0:PPP%T@TGThhhSjnjujk llmmm }ij˳Pkr#=X_l       . 5 ,3r-6Mx3^g$e (/"2"9"4%_%h%+++G4b4k4,5G5P5<<<)=D=H====-?H?K?XNsNyNRRRRRRRSSS0S9S{{{{| |0|K|R|X|s|z|||||||} }'}-}H}O}q}}}}}}}}}~~&~D~_~f~~~~~~~~7?b}B]gҀ1LQ6?KfmxXs{#>E (17RWǠOjs7biɬάѱر;V]*EN%п׿*"E"N"###$$$&&&(((ZFFFNOOTTTrVVVgggWuru|uEw`wjwwww7@,5JS˜Ҝϝ֝Vqzѯԯ.1]tzOjn=_)DK ')'2'1+L+U+--%-.,.5.q///x000:::>>>܌i/7Hciu48      &AK   """c$~$$c%~%%&&&)))7*R*[*******++ +#+:+C+J+a+j+++++,,W,r,{,~,,,,,,,,,,---9-D-K-f-p-----..!.<.@.C.^.e.h............./"/%/@/I/L/g/p/s//////////0 00*01040O0X0[0v00000000000011151>1A1\1f1i111111D2_2f2 3'3/34449 ::;!;+;<<<===I JJFJaJcJJJJ9KTKXKKKKKLLMLhLlLLLLMMhMlMMNNpNNNNOONOiOmOOOO#P>PBPPPPQ4Q:QRR%R/SJSNSSSSTT!TjTTT U%U)UV!V%VVVV(WCWGWWWWX5X9XXXXvYYYYYY/ZJZPZvZZZZZZ&[A[G[[ \\O\j\p\\\\']B]H]m]]]]]^T^o^u^^^^U_p_v____p``` a&a,aaaa.bIbObbbbbccTcocucccc@d[dadddd?eZe`eeee0fKfQfffff gg|ggghh$hlhhhhi iRimisii jjjjjk8k>k{kkkkl l/lJlPllllm5m;mmmm+nFnMnnnn/oJoQo|oooop pppppqqqqqr7rq֡u+3gޣ 7= %t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%t%ttt44t 44tttttttXttttttttttttttttttttttttttttttttt440R\Lnx#-07:>EG{.Q[^ehnuy      !! !  !! !8NO@@!NN (   h  )N  3"4Z  )N   )NZ  6'N   6'NZ  6'N   6'NZ  6'N   6'N<Z  6'N   6'NdZ  6'N   6'NZ  6'N    6'NZ  %N    %N8Z # %N   # %NH   # ?# %N~   61111 ?;#7 %  Z  \!N   \!N2Z  \!N   \!NZZ  \!N   \!NZ  \!N   \!NZ   N    N8Z }  N  }  NH  # ?}  N~  61111?-  Z  N   N(Z  N   N8Z  |N   |NH  # ? |N~  61111?# @ ~Z  N   NZ  N   N Z  N   N Z  N   Nt Z  N   NjZ        8Z f  ! f H " # ?f ~ # 61111#? Z   $  `B % c $>?Z  Z &  Z8Z  Z '  ZH ( # ? Z~ ) 61111)? | DZ   = *   =lB +B 0>? < =fB , s *>?  3Z  N -  NZ  N .  N8Z  FN /  FNH 0 # ? FN~ 1 611111? V C Z  t  2  t >Z  t  3  t fB 4B s *>? s t fB 5 s *>? t fB 6 s *>?  fB 7 s *>? Z  N 8  N8Z = N 9 = NH : # ?= N~ ; 61111;?fA  fB <B s *>?R *S fB = s *>?J S fB > s *>?I \J fB ? s *>?[\Q fB @ s *>? fB A s *>? \! fB B s *>?Q!; R!v fB CB s *>?!: H!; fB D s *>?!"4 fB E s *>?% 6' fB F s *>?-' .' fB GB s *>? ' fB H s *>? lB I 0>?lB J 0>?fB K s *>? ) L <1111L1?3!&)` fB M s *>? ) N < 1111N1?0!)  B S  ?s t _Hlt458334163 _Toc385672078 _Toc393690169 _Toc472818713 _Toc385672079 _Toc393690170 _Ref421431488 _Ref424530757 _Hlt457029716 _Toc472818714 _Toc385672080 _Toc393690171 _Ref457703870 _Toc472818715 _Toc385672081 _Toc393690172 _Toc472818716 _Toc472818717 _Toc385672083 _Toc393690174 _Ref457703889 _Toc472818718 _Toc385672084 _Toc393690175 _Ref457703921 _Toc472818719 _Toc385672085 _Toc393690176 _Toc472818720 _Toc385672086 _Toc393690177 _Toc472818721 _Toc385672087 _Toc393690178 _Toc472818722 _Toc385672088 _Toc393690179 _Toc472818723 _Toc385672089 _Toc393690180 _Ref457703927 _Toc472818724 _Toc385672090 _Toc393690181 _Toc472818725 _Toc385672091 _Toc393690182 _Toc472818726 _Toc385672092 _Toc393690183 _Toc472818727 _Toc393690184 _Toc472818728 _Toc385672093 _Toc393690185 _Toc410465335 _Toc410465807 _Toc410466906 _Toc410533182 _Toc472818729 _Toc385672094 _Toc393690186 _Toc472818730 _Toc385672095 _Toc393690187 _Toc472818731 _Toc385672096 _Toc393690188 _Toc472818732 _Toc385672097 _Toc393690189 _Toc472818733 _Toc385672098 _Toc393690190 _Toc472818734 _Toc385672099 _Toc393690191 _Toc472818735 _Toc385672100 _Toc393690192 _Toc472818736 _Toc385672101 _Toc393690193 _Toc472818737 _Toc385672102 _Toc393690194 _Ref457703934 _Toc472818738 _Toc385672103 _Toc393690195 _Toc472818739 _Toc385672104 _Toc393690196 _Toc472818740 _Toc385672105 _Toc393690197 _Toc472818741 _Toc385672106 _Toc393690198 _Toc472818742 _Toc385672107 _Toc393690199 _Hlt424497426 _Toc472818743 _Toc385672109 _Toc393690200 _Toc472818744 _Toc381513606 _Ref381520185 _Ref381520193 _Ref381520231 _Toc382202747 _Toc382202967 _Toc382212128 _Toc382212307 _Toc382291473 _Ref382710935 _Toc385672110 _Toc393690201 _Toc472818745 _Toc381513607 _Toc382202748 _Toc382202968 _Toc382212129 _Toc382212308 _Toc382291474 _Toc385672111 _Toc393690202 _Toc472818746 _Toc381513608 _Toc382202749 _Toc382202969 _Toc382212130 _Toc382212309 _Toc382291475 _Ref382648155 _Ref384022086 _Toc385672112 _Toc393690203 _Ref404492853 _Ref424530657 _Toc472818747 _Toc381513609 _Toc382202750 _Toc382202970 _Toc382212131 _Toc382212310 _Toc382291476 _Toc385672113 _Toc393690204 _Toc472818748 _Toc381513610 _Toc382202751 _Toc382202971 _Toc382212132 _Toc382212311 _Toc382291477 _Ref384024372 _Toc385672114 _Toc393690205 _Toc472818749 _Toc381513611 _Toc382202752 _Toc382202972 _Toc382212133 _Toc382212312 _Toc382291478 _Ref382711005 _Toc385672115 _Toc393690206 _Ref456010386 _Toc472818750 _Toc381513612 _Toc382202753 _Toc382202973 _Toc382212134 _Toc382212313 _Toc382291479 _Ref385215256 _Ref385215268 _Toc385672116 _Toc393690207 _Ref455935214 _Ref456011133 _Toc472818751 _Hlt410626652 _Toc375031117 _Toc381513613 _Toc382202754 _Toc382202974 _Toc382212135 _Toc382212314 _Toc382291480 _Ref382705463 _Ref382705468 _Toc385672117 _Toc393690208 _Ref421431579 _Ref421432870 _Ref421433084 _Ref424530778 _Ref424530884 _Ref440449662 _Ref457437433 _Ref459624386 _Ref459624423 _Ref459647164 _Toc472818752 _Toc382202756 _Toc382202976 _Toc381513616 _Toc382202758 _Toc382202978 _Toc382212138 _Toc382212317 _Toc382291483 _Toc385672118 _Ref386878476 _Toc393690209 _Ref456010393 _Ref457437434 _Ref463686584 _Toc472818753 _Ref378386056 _Toc381513617 _Toc382202759 _Toc382202979 _Toc382212139 _Toc382212318 _Toc382291484 _Toc385672119 _Toc393690210 _Ref449966391 _Ref451679175 _Ref456028559 _Toc472818754 _Ref451679260 _Toc472818755 _Toc385672120 _Toc393690211 _Ref449966403 _Toc472818756 _Ref379871138 _Toc381513618 _Toc382202760 _Toc382202980 _Toc382212140 _Toc382212319 _Toc382291485 _Toc385672121 _Toc393690212 _Ref457437441 _Ref457437442 _Ref457437443 _Ref457437444 _Ref457437448 _Ref457437449 _Ref457437450 _Ref457437451 _Ref457437452 _Toc472818757 _Toc381513619 _Toc382202761 _Toc382202981 _Toc382212141 _Toc382212320 _Toc382291486 _Toc385672122 _Toc393690213 _Ref457437455 _Toc472818758 _Toc381513620 _Toc382202762 _Toc382202982 _Toc382212142 _Toc382212321 _Toc382291487 _Toc385672123 _Toc393690214 _Ref457437456 _Toc472818759 _Ref378325286 _Toc381513621 _Toc382202763 _Toc382202983 _Toc382212143 _Toc382212322 _Toc382291488 _Toc385672124 _Toc393690215 _Ref440443200 _Toc472818760 _Ref378325359 _Toc381513622 _Toc382202764 _Toc382202984 _Toc382212144 _Toc382212323 _Toc382291489 _Toc385672125 _Toc393690216 _Ref440443215 _Toc472818761 _Toc381513623 _Toc382202765 _Toc382202985 _Toc382212145 _Toc382212324 _Toc382291490 _Ref382709859 _Toc385672126 _Toc393690217 _Ref451679320 _Toc472818762 _Toc381513624 _Toc382202766 _Toc382202986 _Toc382212146 _Toc382212325 _Toc382291491 _Ref382710006 _Toc385672127 _Toc393690218 _Ref456010399 _Toc472818763 _Ref377322467 _Ref377322512 _Toc381513625 _Toc382202767 _Toc382202987 _Toc382212147 _Toc382212326 _Toc382291492 _Toc385672128 _Toc393690219 _Ref431982634 _Toc472818764 _Toc381513626 _Ref381608289 _Toc382202768 _Toc382202988 _Toc382212148 _Toc382212327 _Toc382291493 _Toc385672129 _Toc393690220 _Ref457437478 _Toc472818765 _Toc381513627 _Ref381607899 _Toc382202769 _Toc382202989 _Toc382212149 _Toc382212328 _Toc382291494 _Toc385672130 _Toc393690221 _Ref457437479 _Toc472818766 _Ref379263013 _Toc381513628 _Toc382202770 _Toc382202990 _Toc382212150 _Toc382212329 _Toc382291495 _Ref382706882 _Ref382707062 _Ref383597354 _Toc385672131 _Toc393690222 _Ref404492947 _Ref404492964 _Ref404493248 _Ref404493273 _Ref424530746 _Ref424530811 _Ref424531213 _Hlt424531226 _Ref424531238 _Toc472818767 _Ref378386289 _Toc381513629 _Toc382202771 _Toc382202991 _Toc382212151 _Toc382212330 _Toc382291496 _Ref382709603 _Ref382709689 _Toc385672132 _Toc393690223 _Ref440437891 _Hlt463778258 _Toc472818768 _Toc375031153 _Ref378393823 _Ref379172559 _Ref379873477 _Ref381174987 _Ref381506868 _Toc381513630 _Toc382202772 _Toc382202992 _Toc382212152 _Toc382212331 _Toc382291497 _Ref382649260 _Ref382649794 _Ref383594745 _Toc385672133 _Toc393690224 _Ref424530589 _Ref424535009 _Toc432237481 _Toc432984690 _Ref456010409 _Ref457437516 _Ref457437517 _Ref457437518 _Ref457437523 _Ref457437524 _Ref457437525 _Ref457437526 _Ref457437527 _Ref457705277 _Ref457705317 _Ref457792658 _Ref457792662 _Toc472818769 _Ref463859562 _Toc472818770 _Toc382202773 _Toc382202993 _Toc393690225 _Ref456011139 _Toc472818771 _Toc393690226 _Ref404492883 _Ref404492911 _Ref424532635 _Ref424532665 _Toc472818772 _Toc381513631 _Toc382202774 _Toc382202994 _Toc382212153 _Toc382212332 _Toc382291498 _Toc385672134 _Toc393690227 _Toc472818773 _Toc381513632 _Toc382202775 _Toc382202995 _Toc382212154 _Toc382212333 _Toc382291499 _Toc385672135 _Toc393690228 _Ref449763253 _Toc472818774 _Toc381513633 _Toc382202776 _Toc382202996 _Toc382212155 _Toc382212334 _Toc382291500 _Toc385672136 _Toc393690229 _Toc472818775 _Toc381513634 _Toc382202777 _Toc382202997 _Toc382212156 _Toc382212335 _Toc382291501 _Toc385672137 _Toc393690230 _Toc472818776 _Ref379873913 _Ref379873915 _Toc381513635 _Toc382202778 _Toc382202998 _Toc382212157 _Toc382212336 _Toc382291502 _Ref384033349 _Toc385672138 _Toc393690231 _Ref451679925 _Toc472818777 _Toc385672139 _Ref393616595 _Toc393690232 _Ref404492926 _Ref404493293 _Ref404504794 _Ref424530687 _Ref424531262 _Ref424532158 _Toc472818778 _Toc381513636 _Toc382202779 _Toc382202999 _Toc382212158 _Toc382212337 _Toc382291503 _Toc385672140 _Toc393690233 _Toc472818779 _Ref379172771 _Toc381513637 _Toc382202780 _Toc382203000 _Toc382212159 _Toc382212338 _Toc382291504 _Toc385672141 _Toc393690234 _Ref457707512 _Toc472818780 _Toc381513638 _Toc382202781 _Toc382203001 _Toc382212160 _Toc382212339 _Toc382291505 _Ref382731829 _Toc385672142 _Toc393690235 _Ref440438264 _Toc472818781 _Hlt457029714 _Toc381513640 _Toc382202783 _Toc382203003 _Toc382212162 _Toc382212345 _Toc382291507 _Ref382730731 _Ref382730741 _Toc385672143 _Ref393616854 _Toc393690236 _Ref404493061 _Ref424531086 _Toc382212346 _Toc382212347 _Toc382212348 _Toc382212349 _Toc382212350 _Toc382212351 _Toc381513641 _Toc382202784 _Toc382203004 _Toc382212163 _Toc382212352 _Toc382291508 _Ref382730733 _Ref382730744 _Ref384025010 _Toc385672144 _Toc393690237 _Ref424531101 _Ref424668494 _Hlt462556262 _Toc382212359 _Toc382212360 _Toc382212361 _Toc382212362 _Toc382212363 _Toc382212364 _Toc382212365 _Hlt424532792 _Toc381513642 _Toc382202785 _Toc382203005 _Toc382212164 _Toc382212366 _Toc382291509 _Toc381513639 _Toc382202782 _Toc382203002 _Toc382212161 _Toc382212340 _Toc382291506 _Ref382730734 _Ref382730746 _Toc385672145 _Ref393616857 _Toc393690238 _Ref404493089 _Ref424531112 _Hlt458484268 _Toc382212353 _Toc382212355 _Toc382212356 _Toc382212357 _Toc382212358 _Toc385672146 _Ref393616858 _Toc393690239 _Ref404493103 _Ref424531130 _Ref424667502 _Toc382212341 _Toc382212342 _Toc382212343 _Toc382212344 _Toc381513643 _Toc382202786 _Toc382203006 _Toc382212165 _Toc382212367 _Toc382291510 _Ref383596004 _Toc385672147 _Ref386961072 _Ref393616859 _Toc393690240 _Ref424531142 _Ref424667512 _Toc393690241 _Ref404493223 _Ref424532883 _Ref424667579 _Hlt455971670 _Toc393690242 _Toc472818782 _Toc381513644 _Toc382202787 _Toc382203007 _Toc382212166 _Toc382212368 _Toc382291511 _Toc385672148 _Toc393690243 _Ref455971374 _Ref456011162 _Toc381513646 _Toc382202789 _Toc382203009 _Toc382212168 _Toc382212374 _Toc382291513 _Toc385672150 _Toc393690245 _Ref455971379 _Ref456011174 _Toc472818783 _Toc382212375 _Toc382212376 _Toc382212377 _Toc382212378 _Toc382212379 _Toc381513647 _Toc382202790 _Toc382203010 _Toc382212169 _Toc382212380 _Toc382291514 _Toc385672151 _Toc393690246 _Ref455971381 _Ref456011179 _Toc472818784 _Toc382212381 _Toc382212382 _Toc382212383 _Toc382212384 _Toc382212385 _Toc382212386 _Toc382212387 _Toc381513648 _Toc382202791 _Toc382203011 _Toc382212170 _Toc382212388 _Toc382291515 _Ref384027166 _Toc385672152 _Toc393690247 _Ref424533023 _Ref424667800 _Toc472818785 _Toc385672153 _Toc393690248 _Toc472818786 _Toc385672154 _Toc393690249 _Toc472818787 _Toc375031131 _Ref378389486 _Toc381513649 _Toc382202792 _Toc382203012 _Toc382212171 _Toc382212389 _Toc382291516 _Toc385672155 _Toc393690250 _Ref455971611 _Ref456011185 _Toc472818788 _Toc375031132 _Toc381513650 _Toc382202793 _Toc382203013 _Toc382212172 _Toc382212390 _Toc382291517 _Toc385672156 _Toc393690251 _Toc472818789 _Toc375031133 _Ref379262782 _Toc381513651 _Toc382202794 _Toc382203014 _Toc382212173 _Toc382212391 _Toc382291518 _Toc385672157 _Toc393690252 _Toc472818790 _Toc382212392 _Toc382212393 _Toc382212394 _Toc375031134 _Ref378387275 _Ref378387280 _Ref378387297 _Ref378387363 _Ref379173723 _Ref381502823 _Toc381513652 _Toc382202795 _Toc382203015 _Toc382212174 _Toc382212395 _Toc382291519 _Toc385672158 _Ref386878569 _Ref387126025 _Toc393690253 _Ref404492817 _Ref404501361 _Ref424530616 _Ref424535777 _Ref456028389 _Hlt463230050 _Toc472818791 _Toc375031135 _Toc381513653 _Toc382202796 _Toc382203016 _Toc382212175 _Toc382212396 _Toc382291520 _Toc385672159 _Toc393690254 _Toc472818792 _Toc382212397 _Toc382212398 _Toc382212399 _Toc382212400 _Toc382212401 _Toc375031136 _Ref379906863 _Ref381179003 _Toc381513654 _Toc382202797 _Toc382203017 _Toc382212176 _Toc382212402 _Toc382291521 _Ref382713431 _Ref383595223 _Toc385672160 _Toc393690255 _Ref404492982 _Ref424532750 _Ref424667409 _Toc472818793 _Toc382212403 _Toc382212404 _Toc382212405 _Toc382212407 _Toc375031137 _Ref379906881 _Ref379913789 _Ref381179032 _Toc381513655 _Toc382202798 _Toc382203018 _Toc382212177 _Toc382212408 _Toc382291522 _Ref382713437 _Ref383595202 _Toc385672161 _Toc393690256 _Ref404492996 _Ref424532763 _Toc472818794 _Toc382212409 _Toc382212410 _Toc382212411 _Toc382212413 _Toc375031138 _Ref379262870 _Toc381513656 _Toc382202799 _Toc382203019 _Toc382212178 _Toc382212414 _Toc382291523 _Ref383930447 _Toc385672162 _Toc393690257 _Ref424532099 _Hlt458400770 _Toc472818795 _Toc385672163 _Toc393690258 _Toc472818796 _Toc382212415 _Toc382212416 _Toc382212417 _Toc375031139 _Toc381513657 _Ref381522270 _Toc382202800 _Toc382203020 _Toc382212179 _Toc382212418 _Toc382291524 _Ref382713649 _Ref384025880 _Toc385672164 _Toc393690259 _Ref457790568 _Toc472818797 _Toc375031140 _Toc381513658 _Toc382202801 _Toc382203021 _Toc382212180 _Toc382212419 _Toc382291525 _Toc385672165 _Toc393690260 _Ref455971449 _Ref456011191 _Toc472818798 _Toc381513659 _Toc382202802 _Toc382203022 _Toc382212181 _Toc382212420 _Toc382291526 _Toc385672166 _Toc393690261 _Ref449966566 _Toc472818799 _Toc381513660 _Toc382202803 _Toc382203023 _Toc382212182 _Toc382212421 _Toc382291527 _Toc385672167 _Toc393690262 _Toc472818800 _Toc381513661 _Toc382202804 _Toc382203024 _Toc382212183 _Toc382212422 _Toc382291528 _Toc385672168 _Toc393690263 _Ref398439905 _Ref404493443 _Ref404493461 _Ref424536598 _Ref424536616 _Toc472818801 _Toc381513662 _Toc382202805 _Toc382203025 _Toc382212184 _Toc382212423 _Toc382291529 _Toc385672169 _Toc393690264 _Ref458336277 _Toc472818802 _Toc381513663 _Toc382202806 _Toc382203026 _Toc382212185 _Toc382212424 _Toc382291530 _Toc385672170 _Ref393524922 _Ref393526178 _Toc393690265 _Ref404501155 _Ref404501171 _Ref424533241 _Ref424533260 _Ref424533302 _Ref449943314 _Toc472818803 _Ref381180531 _Toc381513664 _Toc382202807 _Toc382203027 _Toc382212186 _Toc382212425 _Toc382291531 _Toc385672171 _Toc393690266 _Ref424532979 _Toc472818804 _Hlt458336618 _Toc381513665 _Toc382202808 _Toc382203028 _Toc382212187 _Toc382212426 _Toc382291532 _Toc385672172 _Ref393524863 _Toc393690267 _Toc472818805 _Toc381513666 _Toc382202809 _Toc382203029 _Toc382212188 _Toc382212427 _Toc382291533 _Toc385672173 _Ref387139409 _Ref387139418 _Toc393690268 _Ref404501819 _Ref458336280 _Toc472818806 _Toc380981890 _Toc381513668 _Toc382202811 _Toc382203031 _Toc382212190 _Toc382212429 _Toc382291535 _Toc385672174 _Toc393690269 _Toc472818807 _Toc380981891 _Toc381513669 _Toc382202812 _Toc382203032 _Toc382212191 _Toc382212430 _Toc382291536 _Toc385672175 _Ref387139466 _Ref393526420 _Toc393690270 _Ref404501230 _Ref404501830 _Ref449940080 _Toc472818808 _Toc381513670 _Toc382202813 _Toc382203033 _Toc382212192 _Toc382212431 _Toc382291537 _Toc385672176 _Toc393690271 _Ref458336697 _Toc472818809 _Toc381513671 _Toc382202814 _Toc382203034 _Toc382212193 _Toc382212432 _Toc382291538 _Toc385672177 _Toc393690272 _Toc472818810 _Toc381513672 _Toc382202815 _Toc382203035 _Toc382212194 _Toc382212433 _Toc382291539 _Toc385672178 _Toc393690273 _Ref458336782 _Toc472818811 _Toc381513673 _Toc382202816 _Toc382203036 _Toc382212195 _Toc382212434 _Toc382291540 _Toc385672179 _Toc393690274 _Ref457703968 _Ref457707526 _Toc472818812 _Toc381513674 _Toc382202817 _Toc382203037 _Toc382212196 _Toc382212435 _Toc382291541 _Toc385672180 _Toc393690275 _Ref404493379 _Toc375031161 _Toc381513675 _Toc382202818 _Toc382203038 _Toc382212197 _Toc382212436 _Toc382291542 _Toc385672181 _Ref386878637 _Toc393690276 _Ref424532486 _Ref457744587 _Toc472818813 _Toc381513676 _Toc382202819 _Toc382203039 _Toc382212198 _Toc382212437 _Toc382291543 _Toc385672182 _Toc393690277 _Ref456010676 _Toc472818814 _Toc382202820 _Toc382203040 _Toc375031162 _Toc381513677 _Toc382202821 _Toc382203041 _Toc382212199 _Toc382212438 _Toc382291544 _Toc385672183 _Toc393690278 _Toc472818815 _Toc375031164 _Toc381513678 _Toc382202822 _Toc382203042 _Toc382212200 _Toc382212439 _Toc382291545 _Toc385672184 _Toc393690279 _Ref405883026 _Ref421417488 _Hlt421417522 _Ref424531495 _Ref424535502 _Toc472818816 _Toc382202823 _Toc382203043 _Toc375031165 _Toc381513679 _Toc382202824 _Toc382203044 _Toc382212201 _Toc382212440 _Toc382291546 _Toc385672185 _Toc393690280 _Toc472818817 _Toc375031166 _Ref378388036 _Ref381182904 _Toc381513680 _Toc382202825 _Toc382203045 _Toc382212202 _Toc382212441 _Toc382291547 _Toc385672186 _Toc393690281 _Toc401117214 _Toc403317107 _Toc403362662 _Ref409270748 _Ref409320045 _Toc417706160 _Toc432237535 _Toc432984744 _Ref456010683 _Ref457437563 _Ref457437564 _Ref457437570 _Ref457707569 _Ref457792682 _Ref458333136 _Toc472818818 _Ref456010689 _Toc472818819 _Toc472818820 _Toc382202826 _Toc382203046 _Toc382212442 _Toc382212443 _Toc375031167 _Ref381507044 _Toc381513681 _Toc382202827 _Toc382203047 _Toc382212203 _Toc382212444 _Toc382291548 _Ref382714615 _Toc385672187 _Toc393690282 _Ref449966579 _Toc472818821 _Toc382202828 _Toc382203048 _Toc375031168 _Toc381513682 _Toc382202829 _Toc382203049 _Toc382212204 _Toc382212445 _Toc382291549 _Toc385672188 _Toc393690283 _Ref457437585 _Ref457437586 _Ref457437587 _Ref457437588 _Ref457437589 _Ref457437593 _Toc472818822 _Toc382202830 _Toc382203050 _Toc382212446 _Toc382212447 _Toc382212448 _Toc382212449 _Toc382212450 _Toc382212451 _Toc382212452 _Toc375031170 _Toc381513684 _Ref381525416 _Toc382202834 _Toc382212206 _Toc382212460 _Toc382291551 _Toc385672189 _Toc393690284 _Ref455972170 _Ref456011197 _Toc472818823 _Toc382212461 _Toc382212462 _Toc382212463 _Toc382212464 _Toc382212465 _Toc382212467 _Toc382212468 _Toc382212469 _Toc382212470 _Toc382212471 _Toc382212472 _Toc382212473 _Toc375031171 _Ref381180778 _Toc381513685 _Toc382202835 _Toc382212207 _Toc382212475 _Toc382291552 _Toc385672190 _Toc393690285 _Ref455972172 _Ref456011203 _Toc472818824 _Toc382212476 _Toc382212477 _Toc382212478 _Toc382212479 _Toc382212480 _Toc382212481 _Toc382212482 _Toc382212483 _Toc382212484 _Ref384027085 _Toc385672191 _Toc393690286 _Ref424531183 _Ref424531447 _Ref424531464 _Toc472818825 _Toc385672192 _Toc393690287 _Toc472818826 _Ref457437594 _Toc472818827 _Toc375031172 _Toc381513686 _Toc382202836 _Toc382212208 _Toc382212485 _Toc382291553 _Toc385672193 _Toc393690288 _Ref457707573 _Toc472818828 _Toc385672194 _Toc393690289 _Ref457707576 _Toc472818829 _Toc385672195 _Toc393690290 _Ref457437595 _Toc472818830 _Toc382202837 _Ref375019246 _Toc375031173 _Toc381513687 _Toc382202838 _Toc382212209 _Toc382212486 _Toc382291554 _Toc385672196 _Toc393690291 _Ref424531014 _Toc472818831 _Toc382202839 _Toc382212487 _Toc382212488 _Toc382212489 _Toc382212492 _Ref458400786 _Toc382212493 _Toc375031174 _Toc381513688 _Toc382202840 _Toc382212210 _Toc382212497 _Toc382291555 _Toc385672197 _Toc393690292 _Toc472818832 _Toc382202841 _Toc382212498 _Toc382212499 _Toc382212500 _Toc375031175 _Ref379174824 _Ref379914513 _Toc381513689 _Toc382202842 _Toc382212211 _Toc382212501 _Toc382291556 _Toc385672198 _Toc393690293 _Toc472818833 _Toc382212502 _Toc382212503 _Toc382212504 _Toc382212505 _Toc382212506 _Toc382212507 _Toc382212508 _Toc382212509 _Toc382212510 _Toc382212511 _Toc382212512 _Toc382212513 _Toc382212514 _Toc382212515 _Toc382212516 _Toc382212517 _Toc382212518 _Toc382212519 _Toc382212520 _Toc382212521 _Toc382212522 _Toc382212523 _Toc375031176 _Ref378388513 _Ref379174898 _Toc381513690 _Toc382202843 _Toc382212212 _Toc382212524 _Toc382291557 _Toc385672199 _Toc393690294 _Toc472818834 _Toc382212525 _Toc382212526 _Toc382212527 _Toc382212528 _Toc382212529 _Toc382212530 _Toc375031177 _Ref378388811 _Toc381513691 _Toc382202844 _Toc382212213 _Toc382212531 _Toc382291558 _Toc385672200 _Toc393690295 _Toc472818835 _Toc385672201 _Toc393690296 _Toc472818836 _Toc382212532 _Toc382212533 _Toc382212534 _Toc382212535 _Toc385672202 _Toc393690297 _Toc472818837 _Toc382212536 _Toc382212537 _Toc382212538 _Toc382212539 _Toc382212540 _Toc382212541 _Toc375031178 _Toc381513692 _Toc382202845 _Toc382212214 _Toc382212542 _Toc382291559 _Toc385672203 _Toc393690298 _Toc472818838 _Toc382202846 _Toc382212543 _Toc382212544 _Toc382212545 _Toc382212546 _Toc382212547 _Toc375031179 _Toc381513693 _Toc382202847 _Toc382212215 _Toc382212548 _Toc382291560 _Toc385672204 _Toc393690299 _Toc472818839 _Toc382202848 _Toc382212549 _Toc382212550 _Toc382212551 _Toc382212552 _Toc382212553 _Toc375031180 _Ref378390263 _Toc381513694 _Toc382202849 _Toc382212216 _Toc382212554 _Toc382291561 _Toc385672205 _Toc393690300 _Ref457437596 _Toc472818840 _Toc382212555 _Toc382212556 _Toc382212557 _Toc382212558 _Toc382212559 _Toc382212560 _Toc382212561 _Toc382212562 _Ref382715556 _Toc385672206 _Toc393690301 _Ref424535318 _Ref424667968 _Toc472818841 _Ref382715602 _Toc385672207 _Toc393690302 _Ref424535329 _Toc472818842 _Ref382715606 _Toc385672208 _Toc393690303 _Ref424535339 _Toc472818843 _Ref457437597 _Hlt457723851 _Toc472818844 _Toc375031182 _Ref383834802 _Ref384028360 _Toc385672210 _Toc393690305 _Toc472818845 _Toc382212564 _Toc382212565 _Toc382212566 _Toc382212567 _Toc382212568 _Toc382212569 _Toc382212570 _Toc382212571 _Toc382212572 _Toc382212574 _Toc382212575 _Toc382212576 _Toc382212577 _Toc382212578 _Toc382212579 _Toc375031183 _Toc381513696 _Toc382202851 _Toc382212218 _Toc382212580 _Toc382291563 _Toc385672211 _Toc393690306 _Toc472818846 _Toc382202852 _Toc382212581 _Toc382212582 _Toc382212583 _Toc382212584 _Toc382212585 _Toc382212586 _Toc382212587 _Toc382212588 _Ref383593633 _Toc385672212 _Toc393690307 _Ref424533048 _Ref424533073 _Ref424533092 _Ref424535393 _Ref424535434 _Ref424667869 _Ref424667882 _Ref424667915 _Ref424667925 _Ref424668007 _Ref424668017 _Toc472818847 _Toc375031184 _Ref381183061 _Toc381513697 _Toc382202853 _Toc382212219 _Toc382212589 _Toc382291564 _Toc385672213 _Toc393690308 _Ref457437603 _Ref457449400 _Toc472818848 _Toc382202854 _Toc375031185 _Ref378391230 _Toc381513698 _Toc382202855 _Toc382212220 _Toc382212590 _Toc382291565 _Toc385672214 _Toc393690309 _Toc472818849 _Toc382202856 _Toc382212591 _Toc382212592 _Toc382212593 _Toc382212594 _Toc382212595 _Toc382212596 _Toc382212597 _Toc382212598 _Toc382212599 _Toc375031186 _Toc381513699 _Toc382202857 _Toc382212221 _Toc382212600 _Toc382291566 _Toc385672215 _Toc393690310 _Toc472818850 _Toc382202858 _Toc382212601 _Toc382212602 _Toc382212603 _Toc382212604 _Toc382212605 _Toc382212606 _Toc382212607 _Toc382212608 _Toc382212609 _Toc375031187 _Toc381513700 _Toc382202859 _Toc382212222 _Toc382212610 _Toc382291567 _Toc385672216 _Toc393690311 _Toc472818851 _Toc382202860 _Toc382212611 _Toc382212612 _Toc382212613 _Toc382212614 _Toc382212615 _Toc382212616 _Toc382212617 _Toc382212618 _Toc382212619 _Toc382202861 _Toc382212223 _Toc382212620 _Toc382291568 _Toc385672217 _Toc393690312 _Ref440438334 _Toc472818852 _Toc382202862 _Toc393690313 _Ref440425001 _Toc472818853 _Toc393690314 _Ref440425018 _Toc472818854 _Toc393690315 _Ref440425032 _Toc472818855 _Toc393690316 _Ref440425047 _Toc472818856 _Ref393523057 _Toc393690317 _Ref424533139 _Ref424668059 _Toc472818857 _Toc382212625 _Toc382212626 _Toc382212627 _Toc382212628 _Toc382212629 _Toc382212634 _Toc375031189 _Toc381513702 _Ref381523787 _Toc382202863 _Toc382212224 _Toc382212636 _Toc382291569 _Toc385672218 _Toc393690318 _Ref440443297 _Toc472818858 _Ref440443312 _Toc472818859 _Ref440445008 _Toc472818860 _Toc382202864 _Toc393690319 _Toc472818861 _Toc393690320 _Toc472818862 _Ref393523209 _Toc393690321 _Ref424533194 _Ref424668141 _Toc472818863 _Toc382212641 _Toc382212642 _Toc382212643 _Toc382212644 _Toc382212645 _Toc382212646 _Toc382212647 _Toc382212648 _Toc382212649 _Toc382212650 _Toc382212651 _Toc375031190 _Ref378391680 _Toc381513703 _Toc382202865 _Toc382212225 _Toc382212654 _Toc382291570 _Toc385672219 _Toc393690322 _Toc398440770 _Toc403317150 _Toc403362705 _Toc417706204 _Toc472818864 _Toc417706205 _Toc472818865 _Toc417706206 _Ref440445132 _Toc472818866 _Ref440445026 _Toc472818867 _Toc382202866 _Toc382212655 _Toc382212656 _Toc382212657 _Toc382212658 _Toc382212659 _Toc382212660 _Toc382212661 _Toc382212662 _Toc375031191 _Ref381090012 _Toc381513704 _Toc382202867 _Toc382212226 _Toc382212663 _Toc382291571 _Toc385672220 _Toc393690323 _Ref440445041 _Toc472818868 _Toc382202868 _Toc382212664 _Toc382212665 _Toc382212666 _Toc382212667 _Toc382212668 _Toc382212669 _Toc382212670 _Toc382212671 _Toc382212672 _Toc382212673 _Toc382212674 _Toc382212675 _Toc382212676 _Toc375031192 _Ref378391886 _Ref379915204 _Toc381513705 _Toc382202869 _Toc382212227 _Toc382212677 _Toc382291572 _Toc385672221 _Toc393690324 _Ref440445056 _Toc472818869 _Toc382202870 _Toc375031193 _Ref381183204 _Toc381513706 _Toc382202871 _Toc382212228 _Toc382212688 _Toc382291573 _Ref382717195 _Toc385672222 _Toc393690325 _Ref440445075 _Hlt457449446 _Toc472818870 _Toc382202872 _Toc375031194 _Ref378392063 _Toc381513707 _Toc382202873 _Toc382212229 _Toc382212689 _Toc382291574 _Toc385672223 _Toc393690326 _Toc472818871 _Toc382212690 _Toc382212691 _Toc382212692 _Toc382212693 _Toc382212694 _Toc375031195 _Toc381513708 _Toc382202874 _Toc382212230 _Toc382212695 _Toc382291575 _Toc385672224 _Toc393690327 _Toc472818872 _Toc382202875 _Toc382212696 _Toc382212697 _Toc382212698 _Toc382212699 _Toc382212700 _Toc382212701 _Toc382212702 _Toc375031196 _Toc381513709 _Toc382202876 _Toc382212231 _Toc382212703 _Toc382291576 _Toc385672225 _Toc393690328 _Ref440445088 _Toc472818873 _Toc382212704 _Toc382212705 _Toc382212706 _Toc382212707 _Toc382212708 _Toc375031197 _Ref379923281 _Toc381513710 _Toc382212232 _Toc382212709 _Toc382291577 _Toc385672226 _Ref386878652 _Toc393690329 _Ref424532497 _Ref457437637 _Toc472818874 _Toc393690330 _Ref440445201 _Toc472818875 _Toc382212710 _Toc382212711 _Toc417706216 _Ref440445249 _Ref457437644 _Ref457437645 _Ref457437646 _Ref457437647 _Ref457437648 _Ref457437652 _Ref457437653 _Ref457708381 _Ref457792811 _Toc472818876 _Toc382212713 _Toc382212714 _Toc382212715 _Toc382212716 _Toc382212717 _Toc382212718 _Toc382212719 _Toc375031199 _Ref381175098 _Ref381185764 _Toc381513712 _Toc382212234 _Toc382212721 _Toc382291579 _Toc385672228 _Toc393690332 _Ref457437654 _Toc472818877 _Toc381513713 _Toc382212235 _Toc382212722 _Toc382291580 _Toc385672229 _Toc393690333 _Ref456010696 _Toc472818878 _Toc382212723 _Toc382212724 _Toc375031200 _Toc381513714 _Toc382212236 _Toc382212725 _Toc382291581 _Toc385672230 _Toc393690334 _Ref457437655 _Toc472818879 _Toc382212726 _Toc382212727 _Toc382212728 _Toc382212729 _Toc382212730 _Toc382212731 _Toc382212732 _Toc382212733 _Toc382212734 _Toc382212735 _Toc382212736 _Toc382212737 _Toc382212738 _Toc382212739 _Ref375016587 _Ref375016604 _Ref375016635 _Toc375031201 _Toc381513715 _Toc382212237 _Toc382212740 _Toc382291582 _Toc385672231 _Toc393690335 _Ref432004073 _Toc472818880 _Toc375031202 _Toc381513716 _Toc382212238 _Toc382212741 _Toc382291583 _Toc385672232 _Toc393690336 _Toc472818881 _Toc375031203 _Toc381513717 _Toc417706222 _Toc472818882 _Toc382212239 _Toc382212753 _Toc382291584 _Toc385672233 _Toc393690337 _Ref432004090 _Toc472818883 _Ref375019192 _Ref375019200 _Toc375031204 _Toc381513718 _Toc417706224 _Toc382212240 _Toc382212769 _Toc382291585 _Ref383837418 _Toc385672234 _Toc393690338 _Ref404493018 _Hlt424530928 _Ref424530966 _Ref424667453 _Toc472818884 _Toc375031206 _Toc381513719 _Toc382212241 _Toc382212783 _Toc382291586 _Ref382717821 _Toc385672235 _Toc393690339 _Ref440445453 _Toc472818885 _Toc382212784 _Toc375031207 _Toc381513720 _Toc382212242 _Toc382212785 _Toc382291587 _Ref382717823 _Toc385672236 _Toc393690340 _Ref440445472 _Toc472818886 _Toc382212786 _Toc417706227 _Ref449966595 _Ref457437662 _Ref457705349 _Ref457792665 _Toc472818887 _Toc417706228 _Ref440445541 _Ref457437663 _Ref457707585 _Ref457792686 _Ref458333739 _Ref458336610 _Toc472818888 _Toc382212791 _Toc382212792 _Toc382212793 _Toc382212794 _Toc382212795 _Toc382212796 _Toc381513723 _Toc382212245 _Toc382212808 _Toc382291590 _Toc385672239 _Ref386878658 _Toc393690343 _Toc417706229 _Ref457437670 _Ref457437671 _Ref457437672 _Ref457437673 _Ref457437674 _Toc472818889 _Toc417706230 _Ref457437678 _Toc472818890 _Toc404439291 _Toc417706231 _Ref456011222 _Ref457437679 _Ref457707594 _Ref457792687 _Toc472818891 _Toc417706232 _Ref440445607 _Ref440445697 _Ref451680203 _Ref457437680 _Ref457437681 _Ref457437682 _Ref457707597 _Ref457708469 _Ref457708470 _Ref457792688 _Ref457792814 _Ref457792815 _Ref458336613 _Toc472818892 _Ref424532508 _Ref449941631 _Ref457101484 _Toc472818893 _Toc375031212 _Toc381513724 _Toc382212246 _Toc382212809 _Toc382291591 _Toc385672240 _Ref386878660 _Toc393690344 _Toc472818894 _Ref463878604 _Toc472818895 _Ref463875961 _Toc472818896 _Ref449943299 _Toc472818897 _Ref463865954 _Toc472818898 _Ref424532515 _Ref463865905 _Toc472818899 _Ref457437688 _Toc472818900 _Toc375031213 _Ref379914053 _Toc381513725 _Toc382212247 _Toc382212810 _Toc382291592 _Toc385672241 _Toc393690345 _Ref457704028 _Toc472818901 _Toc382212248 _Toc382212811 _Toc382291593 _Toc385672242 _Toc393690346 _Ref457031693 _Toc472818902 _Toc382291594 _Toc385672243 _Toc393690347 _Toc472818903 _Toc382291595 _Toc385672244 _Toc393690348 _Ref449966769 _Toc385672245 _Toc393690349 _Ref449966787 _Toc385672246 _Toc393690350 _Ref449966804 _Toc472818904 _Toc382291596 _Toc385672247 _Toc393690351 _Ref449966832 _Toc382291597 _Toc385672248 _Toc393690352 _Ref457709041 _Toc382291598 _Toc385672249 _Toc393690353 _Ref451680264 _Toc382291599 _Toc385672250 _Toc393690354 _Toc385672252 _Toc393690356 _Toc385672253 _Toc393690357 _Toc382212249 _Toc382212812 _Toc382291601 _Toc385672254 _Toc393690358 _Ref456003831 _Toc472818905 _Ref456003675 _Ref456003678 _Ref456003682 _Ref456003685 _Ref457710538 _Toc472818906 _Toc393690359 _Toc393690360 _Toc393690361 _Toc393690362 _Toc393690363 _Toc393690364 _Toc393690365 _Toc393690366 _Ref456010425 _Ref456011234 _Toc472818907 _Toc393690367 _Toc393690368 _Toc472818908 _Toc382291602 _Toc385672255 _Ref393527264 _Toc393690369 _Ref404501382 _Ref424531694 _Toc472818909 _Ref385475928 _Toc385672256 _Toc393690370 _Ref424531528 _Ref385475932 _Toc385672257 _Toc393690371 _Ref424531555 _Toc385672258 _Ref393527230 _Toc393690372 _Ref404501393 _Ref424531707 _Ref449968361 _Toc472818910 _Toc382291603 _Ref393527857 _Ref385067278 _Toc385672259 _Toc393690373 _Ref424531574 _Hlt458482354 _Toc382291604 _Ref385475937 _Toc385672260 _Ref393527953 _Toc393690374 _Ref404501344 _Ref404501665 _Hlt424531982 _Ref424531588 _Toc382291605 _Toc385672261 _Toc393690375 _Ref457709042 _Toc472818911 _Toc382291606 _Toc385672262 _Ref393522098 _Ref393610784 _Ref393611105 _Toc393690376 _Ref404493404 _Ref404502159 _Ref404502265 _Ref404502515 _Ref404502615 _Ref404502673 _Ref404502690 _Ref404503028 _Ref424531384 _Hlt424534273 _Toc382291607 _Toc385672263 _Ref393609257 _Toc393690377 _Ref424534029 _Toc472818912 _Toc385672264 _Toc393690378 _Toc385672265 _Toc393690379 _Ref455974300 _Toc385672266 _Toc393690380 _Ref451680328 _Ref458484169 _Hlt458484290 _Toc382291608 _Toc385672267 _Toc393690381 _Ref440445879 _Ref440445932 _Ref440445986 _Toc472818913 _Toc382212261 _Toc382212824 _Toc382291609 _Toc385672268 _Toc393690382 _Toc472818914 _Toc382291610 _Toc385672269 _Ref393527385 _Ref393527457 _Toc393690383 _Ref404501411 _Ref424531728 _Toc472818915 _Toc385672270 _Toc393690384 _Ref404501403 _Toc385672271 _Ref393527461 _Toc393690385 _Ref404501432 _Ref424531741 _Toc472818916 _Toc382291611 _Toc385672272 _Ref387139557 _Ref387225901 _Ref393528099 _Toc393690386 _Ref404501197 _Ref404501211 _Ref404501248 _Ref404501266 _Ref404501719 _Ref404501788 _Ref404501803 _Ref424534066 _Toc385672273 _Toc393690387 _Ref457709043 _Toc472818917 _Toc382291612 _Toc385672274 _Ref393610728 _Ref393614246 _Toc393690388 _Ref404501752 _Ref404502250 _Ref424535839 _Toc385672275 _Toc393690389 _Toc385672276 _Ref393609190 _Toc393690390 _Ref404501768 _Ref424534100 _Toc472818918 _Toc382291613 _Toc385672277 _Toc393690391 _Toc385672278 _Toc393690392 _Ref455972201 _Toc385672279 _Toc385672280 _Toc393690393 _Ref449966854 _Ref449966870 _Ref455972205 _Ref457709044 _Ref457710564 _Toc472818919 _Toc385672281 _Toc393690394 _Ref449944243 _Toc385672282 _Toc393690395 _Ref449944260 _Toc382291614 _Toc385672284 _Toc393690397 _Ref440446281 _Ref449966920 _Ref457710573 _Toc472818920 _Toc393690398 _Ref404501450 _Ref424531647 _Toc472818921 _Toc393690399 _Toc393690400 _Toc393690402 _Ref404501465 _Ref424531663 _Toc472818922 _Toc382291616 _Toc385672286 _Toc393690403 _Toc382291617 _Toc385672287 _Toc393690404 _Ref455971750 _Toc382291618 _Toc385672288 _Toc393690405 _Toc382291619 _Toc385672289 _Toc393690406 _Ref457709045 _Toc472818923 _Toc382291620 _Toc385672290 _Ref393614155 _Toc393690407 _Ref404501859 _Ref404502071 _Ref404502112 _Hlt424534161 _Ref424534154 _Toc382291621 _Toc385672291 _Toc393690408 _Toc385672292 _Ref393609293 _Toc393690409 _Ref404502135 _Ref424534233 _Toc472818924 _Toc385672293 _Toc393690410 _Toc385672294 _Toc393690411 _Ref451680376 _Hlt451680383 _Toc382291622 _Toc385672296 _Toc393690412 _Ref440446372 _Hlk440446340 _Ref451680449 _Ref456011285 _Ref456028287 _Ref457793676 _Toc382291623 _Toc385672297 _Toc393690413 _Ref457709102 _Ref440446490 _Toc382291624 _Toc385672298 _Toc393690414 _Ref440446538 _Ref440446605 _Ref440446657 _Toc382291625 _Toc385672299 _Toc393690415 _Ref457709104 _Ref440446838 _Toc472818925 _Ref384024926 _Ref385487297 _Toc385672300 _Toc393690416 _Hlt424531027 _Ref424531062 _Toc382291626 _Toc385672301 _Toc393690417 _Toc382291627 _Ref383601992 _Toc385672302 _Toc393690418 _Ref404493357 _Ref424531349 _Toc472818926 _Toc382212251 _Toc382212814 _Toc382291628 _Toc385672303 _Ref393527560 _Toc393690419 _Ref404501479 _Ref424531760 _Toc472818927 _Toc385672304 _Toc393690420 _Ref457704072 _Toc385672305 _Toc393690421 _Toc385672306 _Ref393527562 _Toc393690422 _Ref404501493 _Ref424531774 _Toc472818928 _Toc385672307 _Toc393690423 _Toc385672308 _Toc393690424 _Toc382212252 _Toc382212815 _Toc382291629 _Toc385672309 _Ref393609337 _Toc393690425 _Ref457709106 _Toc472818929 _Toc382291630 _Toc385672310 _Ref393613870 _Toc393690426 _Ref404502444 _Ref404502469 _Hlt424534372 _Ref424534397 _Hlt424535880 _Toc393690427 _Ref457705192 _Toc385672312 _Ref393609348 _Toc393690428 _Ref404502484 _Ref424535900 _Ref457704247 _Toc472818930 _Toc382212254 _Toc382212817 _Toc382291632 _Toc385672313 _Toc393690429 _Toc385672314 _Toc393690430 _Ref455972324 _Toc382291633 _Toc385672315 _Toc393690431 _Ref455972327 _Toc382291634 _Toc385672316 _Toc393690432 _Ref457704263 _Toc382291635 _Toc385672317 _Toc393690433 _Ref451681117 _Ref385475601 _Ref457709108 _Toc385672318 _Toc393690434 _Ref457704269 _Toc382291636 _Toc385672319 _Toc393690435 _Ref457704276 _Toc382291637 _Toc385672320 _Toc393690436 _Ref456012385 _Ref456010579 _Ref456010585 _Ref456010590 _Ref457709109 _Ref456010446 _Toc382291638 _Toc385672321 _Toc393690437 _Toc385672322 _Toc393690438 _Ref457704308 _Toc382291639 _Toc385672323 _Toc393690439 _Toc382291640 _Ref451681222 _Ref451681173 _Ref457710640 _Ref451681188 _Toc385672324 _Toc393690440 _Ref449966490 _Ref457710642 _Toc382291641 _Toc385672325 _Toc393690441 _Ref457704412 _Toc472818931 _Toc382291642 _Toc385672326 _Toc393690442 _Ref457704420 _Toc382212260 _Toc382212823 _Toc382291643 _Ref383601928 _Toc385672327 _Toc393690443 _Ref404493316 _Ref424531301 _Toc472818932 _Toc382291644 _Toc385672328 _Ref393527597 _Toc393690444 _Ref404501506 _Ref424531794 _Toc472818933 _Toc385672329 _Toc393690445 _Ref457704428 _Toc385672330 _Toc393690446 _Toc385672331 _Ref393527599 _Toc393690447 _Ref404501520 _Ref424531804 _Toc472818934 _Toc382291645 _Toc385672332 _Toc393690448 _Ref457704435 _Toc382291646 _Toc385672333 _Toc393690449 _Toc382291647 _Toc385672334 _Toc393690450 _Ref457709202 _Toc472818935 _Toc382291648 _Toc385672335 _Ref393613897 _Toc393690451 _Ref404502544 _Ref424534464 _Toc382291649 _Toc385672336 _Ref393609398 _Toc393690452 _Ref424535986 _Toc472818936 _Toc382291650 _Toc385672337 _Toc393690453 _Toc385672338 _Toc393690454 _Ref455972335 _Toc382291651 _Toc385672339 _Toc393690455 _Ref455972337 _Toc382291652 _Toc385672340 _Toc393690456 _Toc472818937 _Toc382212263 _Toc382212826 _Toc382212255 _Toc382212818 _Toc382291653 _Ref383601961 _Toc385672341 _Toc393690457 _Ref404493337 _Ref424531326 _Toc472818938 _Toc382212256 _Toc382212819 _Toc382291654 _Toc385672342 _Ref393527624 _Toc393690458 _Ref404501532 _Ref424531823 _Toc472818939 _Toc385672343 _Toc393690459 _Ref457704661 _Toc385672344 _Toc393690460 _Toc385672345 _Ref393527628 _Toc393690461 _Ref404501547 _Ref424531834 _Toc472818940 _Toc382291655 _Toc385672346 _Toc393690462 _Toc382291656 _Toc385672347 _Toc393690463 _Toc382212257 _Toc382212820 _Toc382291657 _Toc385672348 _Toc393690464 _Ref457704674 _Ref457709286 _Toc472818941 _Toc382212258 _Toc382212821 _Toc382291658 _Toc385672349 _Ref393613924 _Toc393690465 _Ref404502635 _Ref424534510 _Toc382291659 _Toc385672350 _Toc393690466 _Ref457704688 _Toc385672351 _Toc393690467 _Toc385672352 _Toc393690468 _Ref457704701 _Toc382291660 _Toc385672353 _Toc393690469 _Toc385672354 _Toc393690470 _Toc385672355 _Ref393609442 _Toc393690471 _Ref424536060 _Toc472818942 _Toc382212259 _Toc382212822 _Toc382291661 _Toc385672356 _Toc393690472 _Toc385672357 _Toc393690473 _Ref455972347 _Toc382291662 _Toc385672358 _Toc393690474 _Ref451681287 _Ref455972349 _Toc382291663 _Toc385672359 _Toc393690475 _Ref457790851 _Ref457790854 _Ref457790874 _Hlt458401033 _Hlt458401028 _Ref457704457 _Toc472818943 _Toc382291664 _Toc385672360 _Ref393527153 _Toc393690476 _Ref404504722 _Ref424531937 _Toc472818944 _Toc382212264 _Toc382212827 _Toc382291665 _Toc385672361 _Toc393690477 _Toc472818945 _Toc382291666 _Toc385672362 _Toc393690478 _Toc382291667 _Toc385672363 _Toc393690479 _Toc382291668 _Toc385672364 _Toc393690480 _Toc382291669 _Toc385672365 _Toc393690481 _Toc382291670 _Toc385672366 _Toc393690482 _Toc382291671 _Toc385672367 _Toc393690483 _Toc382291672 _Toc385672368 _Toc393690484 _Toc382291673 _Toc385672369 _Toc393690485 _Toc382212265 _Toc382212828 _Toc382291674 _Toc385672370 _Toc393690486 _Ref457710673 _Toc472818946 _Hlt457203527 _Toc382291675 _Toc385672371 _Toc393690487 _Toc382291676 _Toc385672372 _Toc393690488 _Toc382291677 _Toc385672373 _Toc393690489 _Toc382291678 _Toc385672374 _Toc393690490 _Toc382291679 _Toc385672375 _Toc393690491 _Toc382291680 _Toc385672376 _Toc393690492 _Toc382291681 _Toc385672377 _Toc393690493 _Toc382291682 _Toc385672378 _Toc393690494 _Toc382291683 _Toc385672379 _Toc393690495 _Toc382291684 _Toc385672380 _Toc393690496 _Toc382291685 _Toc385672381 _Toc393690497 _Ref440446996 _Toc382291686 _Toc385672382 _Toc393690498 _Ref440447000 _Toc382291687 _Toc385672383 _Toc393690499 _Toc382291688 _Toc385672384 _Toc393690500 _Toc382291689 _Toc385672385 _Toc393690501 _Toc382291690 _Toc385672386 _Toc393690502 _Toc382291691 _Toc385672387 _Toc393690503 _Toc382291692 _Toc385672388 _Toc393690504 _Ref385215411 _Toc385672389 _Toc393690505 _Ref424532846 _Toc472818947 _Toc385672390 _Toc393690506 _Toc472818948 _Toc385672391 _Toc393690507 _Toc385672392 _Toc393690508 _Toc385672393 _Toc393690509 _Toc385672394 _Toc393690510 _Toc385672395 _Toc393690511 _Toc385672396 _Toc393690512 _Toc385672397 _Toc393690513 _Toc385672398 _Toc393690514 _Toc385672399 _Toc393690515 _Toc385672400 _Toc393690516 _Toc385672401 _Toc393690517 _Toc385672402 _Toc393690518 _Toc385672403 _Toc393690519 _Toc385672404 _Toc393690520 _Toc385672405 _Ref393527655 _Toc393690521 _Ref404508246 _Ref424531852 _Toc472818949 _Toc393690522 _Toc393690523 _Toc393690530 _Toc472818950 _Toc385672406 _Toc393690531 _Toc393690532 _Toc393690537 _Toc393690538 _Toc393690539 _Ref457709552 _Toc472818951 _Ref393614089 _Toc393690540 _Ref424534620 _Ref387218744 _Toc393690541 _Ref424536114 _Toc393690542 _Ref457709555 _Ref393609478 _Toc393690550 _Ref424536220 _Toc472818952 _Toc393690551 _Toc393690552 _Ref451681328 _Hlt456012598 _Toc393690553 _Ref455972363 _Toc393690589 _Ref451681497 _Ref456012533 _Ref456012539 _Ref456012565 _Ref456012548 _Ref456012554 _Ref456012407 _Toc393690554 _Ref455972366 _Ref456028512 _Toc393690555 _Toc393690556 _Toc393690557 _Toc393690558 _Toc393690559 _Toc393690560 _Toc393690561 _Toc393690562 _Toc393690563 _Toc393690564 _Toc393690565 _Toc393690566 _Toc393690567 _Toc393690568 _Toc393690569 _Toc393690570 _Toc393690571 _Toc393690572 _Toc393690573 _Ref455972372 _Hlt455975912 _Toc393690574 _Toc393690575 _Toc393690576 _Ref457709556 _Toc393690577 _Ref457709563 _Toc393690578 _Ref457709571 _Toc393690579 _Ref457709617 _Toc393690580 _Ref457709619 _Toc393690581 _Ref457709621 _Toc393690582 _Toc393690583 _Toc393690584 _Ref457709622 _Toc393690585 _Ref457709667 _Toc393690586 _Ref457709669 _Toc393690587 _Ref457709670 _Toc393690588 _Toc393690590 _Toc393690591 _Toc393690592 _Toc472818953 _Toc393690593 _Ref404565288 _Toc417706280 _Toc432237645 _Toc432984854 _Toc472818954 _Toc417706281 _Toc432237646 _Toc432984855 _Ref457437739 _Ref457437740 _Ref457437745 _Ref457437746 _Ref457437747 _Ref457437748 _Ref457437749 _Ref457437753 _Ref457437754 _Ref457437755 _Ref457437756 _Ref457437757 _Ref457437761 _Ref457437762 _Ref457437763 _Ref457437764 _Ref457437765 _Ref457437769 _Ref457437770 _Ref457437771 _Ref457437772 _Ref457437773 _Ref457437777 _Hlt457446511 _Ref457446600 _Ref463778805 _Toc472818955 _Ref455931092 _Toc472818956 _Ref455931278 _Ref457710778 _Hlt463788138 _Ref457798373 _Ref463788107 _Ref455931187 _Ref463788134 _Ref463788188 _Toc417706282 _Toc432237647 _Toc432984856 _Ref456002819 _Toc472818957 _Toc417706283 _Toc432237648 _Toc432984857 _Ref456002880 _Ref457201072 _Toc472818958 _Ref404573597 _Hlt457029821 _Toc417706284 _Toc432237649 _Toc432984858 _Ref457709745 _Ref457792868 _Toc472818959 _Ref404353515 _Hlt455971295 _Ref404353569 _Toc417706285 _Toc432237650 _Toc432984859 _Toc472818960 _Ref404572122 _Toc417706286 _Toc432237651 _Toc432984860 _Toc472818961 _Ref408723499 _Ref408723429 _Toc449970607 _Ref456011623 _Ref457710787 _Ref457792928 _Toc472818962 _Toc449970608 _Ref456002936 _Ref464292699 _Toc472818963 _Toc449970609 _Ref456002941 _Ref464292724 _Toc472818964 _Toc449970610 _Ref457710003 _Toc472818965 _Ref455964627 _Ref457102523 _Ref457710788 _Toc472818966 _Ref455972962 _Toc449970612 _Toc472818967 _Ref463854015 _Toc472818968 _Ref457211223 _Ref457211241 _Ref464292837 _Ref457211232 _Ref457211236 _Ref463849711 _Ref457211227 _Ref457211245 _Hlt455972145 _Ref457211250 _Ref456011632 _Hlt457703771 _Ref463855081 _Toc472818969 _Ref463853782 _Ref458400834 _Toc472818970 _Ref457703819 _Hlt457703835 _Ref457741493 _Toc472818971 _Toc472818972 _Toc472818973 _Toc472818974 _Toc472818975 _Toc472818976 _Toc472818977 _Toc472818978 _Toc472818979 _Toc472818980 _Toc472818981 _Toc472818982 _Toc472818983 _Ref457724123 _Ref457793857 _Toc472818984 _Ref457724124 _Ref457793839 _Toc472818985 _Ref457724031 _Toc472818986 _Ref457724052 _Toc472818987 _Ref457724074 _Toc472818988 _Toc472818989w MSMSMSMTMTMTMRRRRSSU^cccckkkkwwwNxNxOxtxtxtxPyPyQy-z-z.z.zzzz||| ~ ~~|}******+MMNY]]]ÇÇćĈĈň bbXXXXXXXXY&&&&&&&&&&&''\\\\\\\\MMMMMMMMNNNNNNNNNNNOOOCCCCCCCCCDDEE00000000000::GGGGGGGGHH44444444455]]]]]]]]]]]#########$$"""""""""VVbbbbbbbbbb$$vvvvvvvvvww            ]]]^^^^^^^^^^^^^^^^^^|(|(((***00022 6;;;;;;;==>>>>>>>>>>h?h?h?h?h?h?h?h?i??????????@@@@@@@@@@@@@BBBBBBGGGGWWWWWWWWW1X1X1X1X1X1X1X1X1X1X1X \ \ \ \ \ \ \ \ \ \ \goooooooooooooCp{pppp q2q2q2q2q2q2q2q2q2q2q2q2q3q3qqqq(r|rrr9sasasasasasasasasasasasasasasasasasasbsbst?>?>?????DFDFDFEFEF'M'M'MMMMMMMNNNNO2OOOP3PMPPPPQ>QRRRRRRRRRR$SAS[S~SSSSJT\T\T\T\T\T\T\T\T]T]T]T]T]T]T]TZZZZZZZZZZZZ[[[[[[[[[[[[\\\\]]5]]]]]]]]]]]]^^_(_E___x___```````````aaaabb7bb$c6c6c6c6c6c6c7c7cJcffg'i)i)ijjj^l`l`lnnnnnno&ooop`r`r`r`r`r`r`rjuv=w=wyyzzzH}g~^^_``3Yzb{$Rnnnnnnnnw11111||Ӓڕ l~~~~~~~~~Ș *ޙ;ZtϜå!333333334N3RlЧЧЧЧЧЧЧЧѧѧ3M_________[\\[[222222222222vϸ 6P̹̹̹̹JJJJJuȾȾȾȾȾȾȾȾȾ?Tnav~~ccoooo                1F`z\\\;;;;;;;KKKKKKKKKKKKKKK++++++++m  *!*!V#V#V#M&M&&&&&&&&/,1,1,:::::::c;c;B<C<h<h<h<i<<<<K=K==">J>J>J>K>q?q?q?A K K K6LILIL3P4P4PPP-Q-Q-Q-Q-Q.Q.QqtvNyy{y{{||||Q}}(~h~i~~STbbbbbccZZZZ[[[[[[[qqӃӃӃԃԃ؇؇؇؇؇؇؇؇؇هههههppuu֍֍2223d   ppq444455M@ʠcccܣܣݣIJxīīxx}}î˯̯FFGGWaaaaHHIXZZZZZZZZ[!""""""  !!kA/B\iSSTAZZZZZ[D D E         f!f!"" # # # # # # # #`$`$`$`$`$`$`$a$a$&%'%J'J'J'J'K'''(((((0)0)1)))****+++ 0 0 0C34777b9d=d=e==SCSCTCvMQ9]G`eOgOgOgvyvyvyy֌֌֌֌֌֌֌׌׌uuvҍҍӍӍӍӍӍӍ[[\444445AAAjj./hh+,˜˜NNOՙՙՙՙՙՙ[[tTTTTTTTUٝٝȟɟ8~à NNOOxx''ݩީ'''99~#<CC?bbbzzzvvGzzl  ;;2233* * !!!"""#%%%%%y*z*]-...000000449999<X=Y=Y=>>>>>?@BDFEGEGEGGGPHH0II JuJJCKKLLLpMMRNNOOOPQ?S@SRUUWWzZZ\]]a8ad)fjgkg|iikkn oqqrrrssusususususotototototototototototototototototototototototototototototot~{~{y|++jMMMMMM- - - - - - n n @ @ @ @ @ f)))))77!!!."O##%%%%(+(U((()))^*m+,s-s--1i2i2i2i2;Y@Y@`@`@IIIDgmG;8Fkkk..==p  !"#$%&'()*+,-./2013456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcefdghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefhijklmnopqrstuvwxyzg{|~}      !"#$%&'()+,-./01234567*@89:;<=>?]^_`abKLMNOPQRABCDE@FGHIJSTUVWXYZ[\mnopqrsthcdefijklguvwxyz{|}~@      !"#$%&'()*12345678,-./+09:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$&'()*+,-./0%345126789:;<=>?RSTUVWXYZ[\@ABCDEFGHIJKLMNOPQ_]^`abcdefghijklopmnqrstuvwxy|}~z{      !"#$%&*+,-./0'()123456789:;<=>?@ABCDEFGHJIKLMNOPQRSTUVWYXZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !&'()*+,-."#$%01/23456789:;<=>?@ABCDEMNOPQRSTUVWXFGHIJKLZ[Y\]^_`abcdefghijklnompqrstuvwxyz{|}~      !"#$%&'()*-.+,/01234589:;6<=>?@AB7CDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()+,-./0123456789*:;<=>?@ABCDGHEIFMNOJKLPQRSTUVaWXYZ[\]^_`bcdefguhijklmnopqrstvwxyz{|}~                           # $ % & ' ( ! ) " * + , - . / 0 1 2 i j 5 3 4 6 7 8 9 : ; < = > ? @ E A B C F D G H I J K L M S T U N O P Q R V Y W X Z [ \ ] ^ _ g h ` a e b c d f k l m n o p q r s t u v w x y z { | } ~                            ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~  s                           ! " # % $ & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = ? > @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` l a b c i g d e f h m j k n t o p q r u v x w y z { | } ~  wMMMTM^M^M^M_M_MRRRRUUU^cccckkkkwwwRxRxSxxxxVyVyWy8z8z9z9zzzz|||~~333333:VVW ccdhhi··χшш҈ ËËËËËËËËËËËËċmmmmmmmmnDDDDDDDDDDDEFbbbbbbbbbcccccccccccdddWWWWWWWWWXXXXDDDDDDDDDEEE !!MMMMMMMMNN<<<<<<<<<==qqqqqqqqqrr.........//`````````aa++++++++++,,  " " " " " " " " " " " # # yyyyyyyyyyyyyyyy(((((((((((((((((((((((***363636464646=========>>>>>>>>>>u?u?u?u?u?u?u?u?v??????????@@@ @ @GGGGGGGGGGGGGGGGGGWWWWWWWWWCXCXCXCXCXCXCXCXCXDXDX)\)\)\)\)\)\)\)\)\*\*\gooooooooooooozppppq1q3q7q7q7q7q7q7q7q7q@q@q@qAqAqqq'rKrrrr:sbsososososps;tuttt uuuuuuuuuuuuu u uuu)v;vI>I>J>R>R>R>S>AAAAHLHLHLIL4P4P4PAPAPPPNQNQqtvoy{{{{!|||b}}6~y~~#``aaab[[[[pppppqqq҃ԃ؇ههههههههމމމމ߉߉֍Vߐ    yyLLLLLMMQQQQQQR:::::;;   ˮˮ̮߯߯ppqq}auuvv   WWWX???@@Ziiiiiiij""IIIIIJJ!99=T``axrsswzZahhhiU U Y            {!{! # #8#8#C#C#C#C#D#D#`$a$p$p$p$p$p$p$q$S%\%'''''''((J)J)J)N)****+++++0+0,0D48 8 8 8!8====yCM3RY]j`eeeevyvyyyyy..99999::   ތތӍӍnnnoEEEEEF++++,,^^ҕҕҕ֕HHHLJJJK__cՙՙppp..999:::ddddde../ҟҟҟӟPP۠۠wwwwwwxx ". ,,,,,,,--&&&&&'((((((PPPwwwCCCBBB@$$$|||  BB77&&ZZPP""9 9  # # # #@$%%%%%%z*z**h-...#0#0$0000559999=Y=p=t=>?@@@BDFGG[G_G_GGGnHHKII&JJJ[KK9LLMMMtNNOOOPRgShSUUWWZZ]]satadIfggiillBoCoq>rrsssssssotwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwtwt{{|+/t     ccccccQ Q Q Q Q Q n ~ i i i i i o66666!!!!###%%%%*(r((()h*{+,,s-|-.111i222;^@_@_@_@`@IIIIVgmQQMșEWɥ(((|||UUZZ>v$CECuCCCCD(D:D[DvDDDD E.E\E}EEEEF/FPFFFFFG3GeGGGGH!HGHhHsHHHHHHI7IHIiIyIIII J-JFJgJxJJJJJ K!KBK]K~KKKKKL@LbLLLLLM.[Jw,.9::<FGGHHIy)*,Z\gjjlxz{|}~>v$CECuCCCCD(D:D[DvDDDD E.E\E}EEEEF/FPFFFFFG3GeGGGGH!HGHhHsHHHHHHI7IHIiIyIIII J-JFJgJxJJJJJ K!KBK]K~KKKKKL@LbLLLLLM.[Jw,<Fy,Zlx>v$CECuCCCCD(D:D[DvDDDD E.E\E}EEEEF/FPFFFFFG3GeGGGGH!HGHhHsHHHHHHI7IHIiIyIIII J-JFJgJxJJJJJ K!KBK]K~KKKKKL@LbLLLLLM.[Jw,<Fy,ZlxWaldemar HorwatD:\users\waldemar\ecma3b.docWaldemar HorwatD:\users\waldemar\ecma3b.docWaldemar Horwat^D:\WINNT\Profiles\waldemar.000\Application Data\Microsoft\Word\AutoRecovery save of ecma3b.asdWaldemar HorwatD:\users\waldemar\ecma3b.docWaldemar HorwatD:\users\waldemar\ecma3b.docWaldemar HorwatD:\users\waldemar\ecma3b.docHERMANV9C:\Documents and Settings\hermanv\My Documents\ecma3a.docHERMANV;C:\Documents and Settings\hermanv\My Documents\standard.docHERMANV;C:\Documents and Settings\hermanv\My Documents\standard.docHERMANV;C:\Documents and Settings\hermanv\My Documents\standard.docdd@0UTT .S" R:FQL`0 Vr r1 |\p.6&a  m b] Y m # ^ > q E {| c  mP p Y D{ D  &  mZ  'Q  uc- uк;  m  -  Zh  } :G 9S Yw = - + uu\ d %  3 c T%  <& X] kx   2WZ  a s  M@ Wy $kz D ZO k (} .MNO[ fN X [ # H J # j }& ] O  v  *C  _=! c1! $%! i_s" k"  9# O## 7$ '$ % V&RT& e& {5R' 5' \i' <( Ro( P( F!v* 8Z* .+ !, T=. (K. p. O/ I0bJ>`0 2 m% 3 d63 3 3 .3 _R4 N5`P< o!^< ]= ziX> jgv> 5;> .? b*6@ er@  @  AA  [A lA ~fA XA qA 8.A ARB 8V/B  fB B+B #CiNq`C !C TDfL}fD IDR<SD aE }E ,MF kF hUG {/G ?-G kG ?)G 2H@v+;I c _I  vI 6I ZXJ eVJ FK -d'K GROK 55K w5M  O rO _ P 7HP ?Q 10R :R YR IR BBS )Sv(%TS K/S QT  $/U$;5U^:  A|U"E7V 9V !uW *?%X xMaX lVrX X .[Y TS[ PQ\ E ] !]  u^ =^ @}^ f^ V-` Df'a >.b Yc md W1e  e f [f geg 3g $gPLAh vch ;p~h b i hi Vi VVm H ym kXn u}n N n  \fp 6pq q  ,qtnx r fJr {r 9r ^}9tb$IOt oSt @Su {4tu 9vu `u Uhv (;v V?v Vw "x ay cy K:z z otz { a{ N_| m} (d~ K~ ^~ =K a^ J h  ^`OJQJo( ^`OJQJo( 88^8`OJQJo( ^`OJQJo( hh^h`OJQJo(hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.^`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.``^``.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.R^R`R^R`.R^R`B*..R^R`... jj^j` .... ^` ..... ^` ...... `^``....... 00^0`........hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hhh^h`o(.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.^`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`. (h^`(OJQJo(hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.``^``.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.[^`[^`.R^R`B*..X^`X... jj^j` .... ^` ..... ^` ...... `^``....... 00^0`........hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hhh^h`o(.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.hh^h`.hh^h`.hh^h`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.hh^h`. (h^`(OJQJo(hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`. \^`\o(\^`\o(.0^`0o(..0^`0o(... 88^8`o( .... 88^8`o( ..... `^``o( ...... `^``o(....... ^`o(........hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`. ^`OJQJo(hh^h`.hh^h`.hh^h`.hh^h`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.[^`[^`.r^r`B*..XX^X`X... jj^j` .... ^` ..... ^` ...... `^``.......0^0`hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.^`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.^`.1^`.r^r`B*..XX^X`X... jj^j` .... ^` ..... ^` ...... `^``.......00^0`hh^h`.hh^h`.hh^h`.hh^h`.^`.1^`.r^r`B*..XX^X`X... jj^j` .... ^` ..... ^` ...... `^``.......00^0`hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.hh^h`.)SIDI0VVmN5;5U ,q^}9t|\p2H $/UWyu+8K:zXK~D5[fN_|O/fJr6pq 9#c _I_R4*?%XvchOJN :RT& v ?-G(;vp.Z;.3?QlAm% 3a ym`0b]>P<{c{|X]3er@a^<m$%!}&7HP8Z* eeVJ[{4tumPP({5R'W1eTS[=b*6@\i'}E#8V/Bmd AAc1!qT%K/S}.;O##SD7oSt$kzdR6T=.*C E ].+ZV7q@}^!Ci_s"^~ZO& jgv>mZ V-`YcfN!uW}fD 3X @m}D`uZh lVrX`0HY7$ vIk"9\5'Q =K_ PkFIOtQT@Suotz; u^GROK5;>%2m OUhvkx>kXnw5M-d'KPQ\Ywf^aE835_=!+;Ia5'ay9r>.b{rhUG8.A3g!,9vu \fpVwq`Ck(K.,MFEY"E7VN na{~8BBS6I$ga2 7hxMaXo!^<.[Y:]:s x r{/G]=3Vi10R55K=^ <&c V?v%O}7d63JIR#'$ [A9SfDf'aM@.?9VzFK<(Ro("xF!v*B+Bi7!]^ fBb i2WZYRTS- L;cy]pu}nj:G[hiziX>ZXJLAhr1b9?)G- +m~fAD{geg;p~hkG(d~ARB:RD qAVruu\e&rOXAGA7uc- V&TD##C(}(}z:A|Ud  @ @&'.289@MRSZdijqw|} %&-<ABI]bc!"*-345<?CDEHSZ[\7@EIOPX_ipqv~ !"#i~ !"#$gw $)*-4DIJMTacdgn{}~XXXXXXYYYiZjZuZ[[ [ \ \^`Ta]ahatauaaaaaaaaaaa1b2b:bIblbmbubbbbbb+c,cggg!()3ijo"#*`ahÓēϓ9DKLV\]bhiq yz   #$,Ɩ`aѿҿݿ {|CD.[\c GHb.............../ ////I/R/S/{//////ãţȣˣΣѣԣأܣkGnXngnqn{nnnnnnnnnnnnnnnnnnoo!o*o3o4o5oaooooooooooooopp p!p"p#p$p%p5pGpPpYpbpcpdpN@QW,Z7ZHZIZLZNZOZRZiZjZmZZZZZZZ[[[v\w\Զ!#%')+-/13579;=?ACEGIKMOQSTVXZ\^`bdfhjlnprtvxz|~Raot{|~ ^`bdfhjlnprtvxz|~PYAYBYCYEYGYIYKYMYOYPYRYYYYYYYYYۄ&(+.147;?DGJMNfirstInsertionPoint )+headingOrdinal4)+insertionPointD)+ lastPositionX)+ syntaxDonel)+ 414470 505 440900 414470True@vv?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                           ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > @ A B C D E F H I J K L M N c Root Entry Fk[ae Data v1TableEUWordDocument SummaryInformation(? DocumentSummaryInformation8G CompObjjObjectPoolk[ak[a  FMicrosoft Word Document MSWordDocWord.Document.89q