Update LS to 2.3.0

libraries.conf

@@ -179,10 +179,22 @@ A continuous function optimization problem is one where you are are trying to fi
 
 Asking and reporting in LevelSpace is conceptually pretty straight forward: You pass blocks of code to child models, and the child models respond as if you had typed that code into their Command Center. LevelSpace allows you to report strings, numbers, and lists from a child to its parent.
 
-In general, the LevelSpace syntax has been designed to align with existing NetLogo primitives whenever possible."""
-    version: "2.2.4"
-    homepage: "http://ccl.northwestern.edu/netlogo/6.0.4/docs/ls.html"
-    downloadURL: "https://raw.githubusercontent.com/NetLogo/NetLogo-Libraries/6.1/extensions/ls-2.2.4.zip"
+In general, the LevelSpace syntax has been designed to align with existing NetLogo primitives whenever possible.
+
+Changelog:
+
+v2.3.0:
+
+- Gracefully handle errors in model loading. Fixes NetLogo/LevelSpace#138
+- Preserve original file path in compiler error messages
+- Disable generator for child models, dramatically speeding up model load times and reducing memory consumption. Fixes NetLogo/LevelSpace#59 and NetLogo/LevelSpace#120.
+- Made headless models use normal repaint mechanism, meaning they now work with `display` and repaint significantly less. Fixes NetLogo/LevelSpace#94
+- Hidden interactive models now run at full speed. Fixes NetLogo/LevelSpace#125 and NetLogo/LevelSpace#136
+
+"""
+    version: "2.3.0"
+    homepage: "http://ccl.northwestern.edu/netlogo/6.1.1/docs/ls.html"
+    downloadURL: "https://raw.githubusercontent.com/NetLogo/NetLogo-Libraries/6.1/extensions/ls-2.3.0.zip"
   }
   {
     name: "Matrix"
@@ -278,7 +290,7 @@ The profiler extension is experimental. It is not yet well tested or user friend
     longDescription: """The queue extension provides NetLogo with a queue, a commonly-used data type in discrete-event simulation. Objects can be inserted into a queue at a particular point in simulation time according to a specified queueing strategy (FIFO or LIFO). Requests to remove an element from a queue always returns the top-most object (or nobody if the queue is empty). Queues can be questioned about their current status (length, empty?) and time-weighted statistics are calculated (mean/max length, mean/max waiting time)."""
     version: "1.1"
     homepage: "https://github.com/ruthmore/netlogo-queue"
-    downloadURL: "https://raw.githubusercontent.com/NetLogo/NetLogo-Libraries/6.1/extensions/queue-1.1.zip"	
+    downloadURL: "https://raw.githubusercontent.com/NetLogo/NetLogo-Libraries/6.1/extensions/queue-1.1.zip"
   }
   {
     name: "R"