{"id":384,"date":"2017-10-27T16:37:09","date_gmt":"2017-10-27T16:37:09","guid":{"rendered":"http:\/\/www.onux.com\/jspp\/blog\/?p=384"},"modified":"2017-11-03T03:33:30","modified_gmt":"2017-11-03T03:33:30","slug":"jspp-0-7-0-javascript-fully-implemented","status":"publish","type":"post","link":"https:\/\/www.onux.com\/jspp\/blog\/jspp-0-7-0-javascript-fully-implemented\/","title":{"rendered":"JS++ 0.7.0: JavaScript Fully Implemented"},"content":{"rendered":"

JS++ 0.7.0 has arrived. Everything that is possible to do in JavaScript is now possible to do in JS++. JS++ has fully implemented JavaScript and the JS++ Standard Library is now fully documented<\/a>.<\/p>\n

This means that every JavaScript feature you expect is now available in JS++: arrays (0.7.0 introduces the generic Array<T> class<\/a>), functions, date\/time, regular expressions, loops, bitwise operators, etc. This is in addition to several JS++-only features: foreach<\/a>, modules, classes, imports, enums<\/a>, virtual functions, integer types, optimized auto-boxing, function overloading, dead code elimination (DCE), and so on.<\/p>\n

You can find all the current Standard Library documentation by clicking here<\/a>. Every documented class, method, and field (with examples) should be available and work in 0.7.0.<\/p>\n

System.Array<T><\/h3>\n

The major missing feature for a while now has been arrays. JS++ 0.7.0 brings the generic System.Array<T> class to JS++. With this addition, everything you can do in JavaScript is possible in JS++.<\/p>\n

The full documentation for System.Array<T> is available here<\/a>.<\/p>\n

Additionally, JS++ adds more features to the Array<\/code> API that aren’t available in JavaScript such as clear<\/a>, contains<\/a>, remove<\/a>, first<\/a>, last<\/a>, count<\/a>, and more. These methods are all optimized<\/em>; in other words, there is no performance overhead in using them. In addition, we benchmark each method to make sure we are always providing the fastest implementation for an abstraction you want.<\/p>\n

System.Array.sort and IComparable<T><\/h3>\n

It comes as no surprise that JavaScript has strange behavior. Consider this JavaScript code:<\/p>\n

\r\nvar arr = [ 1, 2, 10, 9 ];\r\narr.sort();\r\nconsole.log(arr); \/\/ [ 1, 10, 2, 9 ]\r\n<\/pre>\n
As you can see, JavaScript did not sort the numeric array correctly. The reason for this behavior is because JavaScript performs a string sort regardless of the types in the array. Since JS++ is statically-typed, we can generate code for a correct sort with zero overhead. In JS++, the System.IComparable<T> interface provides exactly this behavior. If a class implements System.IComparable<T>, it can provide custom sorting behavior.<\/p>\n
All Standard Library wrapper classes implement System.IComparable<T>. Thus, all JS++ numeric types will be sorted numerically<\/em> when used inside an array – as you would expect from a modern, well-designed language. Here’s an example:<\/p>\n
\r\nimport System;\r\n\r\nint[] arr = [ 1, 2, 10, 9 ]; \/\/ make sure you use an internal type like 'int[]' and not an external type like 'var'\r\narr.sort();\r\n<\/pre>\n
And here’s the generated code:<\/p>\n
\r\n\/\/ Compiled with JS++ v.0.7.0\r\n! function() {\r\n    ! function() {\r\n        var arr = [1, 2, 10, 9];\r\n        arr.sort(function(a, b) {\r\n            return (a - b);\r\n        });\r\n    }();\r\n}();\r\n<\/pre>\n
As you can see, there is zero<\/em> overhead – despite the complex inheritance hierarchy (int[]<\/code> being auto-boxed by System.Array<int><\/code>, System.Array<int><\/code> providing a custom sort<\/code> based on generic type constraints, and System.Integer32<\/code> implementing IComparable<T><\/code>).<\/p>\n
ECMAScript 5 Array Methods<\/h3>\n
ECMAScript 5 (ES5) added several array methods:<\/p>\n