We have significantly expanded the Standard Library with this release. In particular, System.String has undergone significant expansion.<\/p>\n
between<\/b><\/p>\n Documentation page: click here<\/a><\/p>\n format: C-like printf<\/b><\/p>\n Documentation page: click here<\/a><\/p>\n escape<\/b><\/p>\n Documentation page: click here<\/a><\/p>\n truncate<\/b><\/p>\n Documentation page: click here<\/a><\/p>\n repeat<\/b><\/p>\n Documentation page: click here<\/a><\/p>\n count<\/b><\/p>\n Documentation (count): click here<\/a> contains<\/b><\/p>\n Documentation (contains): click here<\/a> Here are all the new methods available for strings in JS++:<\/p>\n There are close to 50 new string methods (48 including overloads, 39 otherwise), and these methods should cover most application-level usages. With documentation, this resulted in +1400 new lines of code to System.String. I’m happy to announce we actually still have more<\/em> methods (for System.String and others) on the way.<\/p>\n Every single method is documented. All documentation is online and available at the System.String<\/a> index page.<\/p>\n We avoided regular expressions as much as possible to avoid runtime FSM construction, which takes time and space. Therefore, prefer JS++ methods such as The best thing about JS++ is that it’s a compiled language. This gives you performance benefits that a JavaScript library with string utilities can never give you. For example:<\/p>\n becomes:<\/p>\n and<\/p>\n becomes:<\/p>\n The astute observer will notice that both the above methods can be further optimized to reach “perfect” optimization. However, there is no optimizing compiler inside JS++ yet, and inserting branching logic into the code generator will result in technical debt.<\/p>\n Our goal with the Standard Library is to make it easier than ever to write applications compared to JavaScript. Side effects of our work on the JS++ Standard Library are performance, size, and correctness. JS++ dead code elimination means we can add hundreds of methods to System.String, but you only pay for the methods you actually use. For performance, not every team can afford to hire a JavaScript performance expert. Even if you have the performance expert, he can’t be expected to micro-optimize and benchmark every method.<\/p>\n Finally, with the JS++ Standard Library, we can fully avoid the NPM left-pad debacle<\/a>.<\/p>\n Previously, to convert a string to number in JS++, it was a little unintuitive. For example:<\/p>\n For all numeric types, we’ve introduced the JS++ 0.8.4 introduces covariant and contravariant generic types (including upcasting and downcasting for types with variants). Covariance and contravariance are based on use-site variance. At this time, we are not introducing declaration-site variance at all; we have higher priorities. In addition, we’ve introduced generic constraints (subtype constraints, multiple constraints, wildcard constraints, and more).<\/p>\n Finally, we have support for generic functions and generic static methods.<\/p>\n Everything from basic to advanced generic programming in JS++ is covered in our generic programming documentation<\/a>.<\/p>\n When we released version 0.8.0<\/a>, we introduced only basic generics. In today’s 0.8.4 release, you can consider generics fully implemented.<\/p>\n I highly encourage reading the generic programming documentation. To put it all together, here’s generic covariance and contravariance together with use-site variance:<\/p>\n We have significantly expanded the Standard Library with this release. In particular, System.String has undergone significant expansion. System.String Highlights between string quotedWords = ‘”duck” “swan” “crab”‘; \/\/ ‘between’ is smart enough to allow the same string to be used as a start and end delimiter string[] words = quotedWords.between(‘”‘, ‘”‘); Console.log(words); \/\/ [ “duck”, “swan”, … Continue reading “JS++ 0.8.4: Advanced Generics and System.String Expansion”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[2,4],"tags":[],"_links":{"self":[{"href":"https:\/\/www.onux.com\/jspp\/blog\/wp-json\/wp\/v2\/posts\/554"}],"collection":[{"href":"https:\/\/www.onux.com\/jspp\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.onux.com\/jspp\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.onux.com\/jspp\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.onux.com\/jspp\/blog\/wp-json\/wp\/v2\/comments?post=554"}],"version-history":[{"count":40,"href":"https:\/\/www.onux.com\/jspp\/blog\/wp-json\/wp\/v2\/posts\/554\/revisions"}],"predecessor-version":[{"id":626,"href":"https:\/\/www.onux.com\/jspp\/blog\/wp-json\/wp\/v2\/posts\/554\/revisions\/626"}],"wp:attachment":[{"href":"https:\/\/www.onux.com\/jspp\/blog\/wp-json\/wp\/v2\/media?parent=554"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.onux.com\/jspp\/blog\/wp-json\/wp\/v2\/categories?post=554"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.onux.com\/jspp\/blog\/wp-json\/wp\/v2\/tags?post=554"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}\r\nstring quotedWords = '\"duck\" \"swan\" \"crab\"';\r\n\/\/ 'between' is smart enough to allow the same string to be used as a start and end delimiter\r\nstring[] words = quotedWords.between('\"', '\"');\r\nConsole.log(words); \/\/ [ \"duck\", \"swan\", \"crab\" ]\r\n<\/pre>\n\r\n\"%s is %d years old\".format(\"Joe\", 10) \/\/ Joe is 10 years old\r\n<\/pre>\n
\r\n\"a\\r\\nb\".escape() \/\/ a\\\\r\\\\nb\r\n<\/pre>\n
\r\nstring text = \"The quick brown fox jumped over the lazy dog.\";\r\n \r\nConsole.log(text.truncate(9)); \/\/ \"The quick...\"\r\n<\/pre>\n
\r\n\"*\".repeat(5) \/\/ *****\r\n<\/pre>\n
\r\n\"foobar\".count(\"foo\") \/\/ 1\r\n\"FOOBAR\".icount(\"foo\") \/\/ 1\r\n<\/pre>\n
\nDocumentation (icount): click here<\/a><\/p>\n\r\n\"abc\".contains(\"b\") \/\/ true\r\n\"ABC\".icontains(\"b\") \/\/ true\r\n<\/pre>\n
\nDocumentation (icontains): click here<\/a><\/p>\nNew System.String Methods<\/h3>\n
\n
\"abc\".endsWith(\"c\")<\/code> over the traditional regex\/JavaScript \/c$\/.test(\"abc\")<\/code>.<\/p>\n\r\nif (\"abc\".isEmpty());\r\n<\/pre>\n
\r\nif (\"abc\".length===0);\r\n<\/pre>\n
\r\n\"abc\".quote()\r\n<\/pre>\n
\r\n'\"'+\"abc\"+'\"'\r\n<\/pre>\n
\r\nimport System;\r\n\r\nConsole.log(\"1\".padLeft(4, \"0\")); \/\/ \"0001\"\r\n<\/pre>\n
fromString<\/h3>\n
\r\nint x = +\"1000\"; \/\/ use the unary + operator\r\n<\/pre>\n
fromString<\/code>, fromStringOr<\/code>, and fromStringOrThrow<\/code> static methods. The above example can be re-written to use Integer32.fromString<\/a>:<\/p>\n\r\nint x = Integer32.fromString(\"1000\");\r\n<\/pre>\n
Advanced Generics<\/h3>\n
\r\nimport System;\r\n \r\nabstract class Animal {}\r\nclass Tiger : Animal {}\r\n \r\nabstract class Pet : Animal {}\r\nclass Dog : Pet {}\r\nclass Cat : Pet {}\r\n \r\nclass PetCollection\r\n{\r\n Pet[] data = [];\r\n \r\n void insert(descend Pet[] pets) {\r\n foreach(Pet pet in pets) {\r\n this.data.push(pet);\r\n }\r\n }\r\n \r\n ascend Pet[] get() {\r\n return this.data;\r\n }\r\n}\r\n \r\nauto myPets = new PetCollection();\r\n \r\n\/\/ Write operations (descend, covariance)\r\nmyPets.insert([ new Dog, new Cat ]);\r\n\/\/ myPets.insert([ new Tiger ]); \/\/ not allowed\r\n \r\n\/\/ Read operations (ascend, contravariance)\r\nPet[] getPets = [];\r\nAnimal[] getAnimals = [];\r\nascend Pet[] tmp = myPets.get(); \/\/ read here\r\nforeach(Pet pet in tmp) { \/\/ but we still need to put them back into our \"result\" arrays\r\n getPets.push(pet);\r\n getAnimals.push(pet);\r\n}\r\n \r\n\/\/ Now we can modify the arrays we read into above\r\ngetPets.push(new Dog);\r\ngetAnimals.push(new Dog);\r\ngetAnimals.push(new Tiger);\r\n\/\/ getPets.push(new Tiger); \/\/ ERROR\r\n<\/pre>\nOther Changes<\/h3>\n
\n
System.Console.error<\/code> when no console is available<\/li>\nprivate<\/code> access modifier for modules in a multi-file setting.<\/li>\n