mirah 0.0.12-java → 0.1.0-java

data/examples/appengine/Readme

@@ -12,10 +12,10 @@ Datastore API:
   Model.all -> Query
   property foo, String # or any supported datastore type
                        # For numbers use Long or Double
-  
+
   instance.save
   instance.key
-  
+
   instance.foo
   instance.foo=
 
@@ -26,4 +26,4 @@ Datastore API:
   Query.sort(property_name, true) # descending
   Query.foo('foo').bar(3)  # Only return instances where foo = 'foo' and bar = 3
   Query.offset(10)
-  Query.limit(5)
+  Query.limit(5)

data/examples/appengine/src/org/mirah/MirahApp.mirah

@@ -69,4 +69,4 @@ class MirahApp < HttpServlet
     return "" unless o
     h(o.toString)
   end
-end
+end

data/examples/appengine/src/org/mirah/list.dhtml

@@ -12,4 +12,4 @@
     Content: <textarea name=content></textarea><br>
     <input type=submit>
   </form>
-</body>
+</body>

data/examples/bintrees.mirah

@@ -37,7 +37,7 @@ class BinaryTrees
         check += TreeNode.bottomUpTree(-i,depth).itemCheck
         i += 1
       end
-      
+
       puts "#{iterations * 2}\t trees of depth #{depth}\t check: #{check}"
       depth += 2
     end

data/examples/edb.mirah

@@ -15,4 +15,4 @@
 
 def_edb :render, 'test.edb'
 @message = "Hello"
-puts render
+puts render

data/examples/fib.mirah

@@ -13,7 +13,7 @@
 # See the License for the specific language governing permissions and
 # limitations under the License.
 
-def fib(a:int):int
+def fib(a:int)
   if a < 2
     a
   else

data/examples/interfaces.mirah

@@ -30,4 +30,4 @@ end
 
 list = ['foo', 'bar', 'baz']
 p = Printer(MyPrinter.new)
-p.printAll(list)
+p.printAll(list)

data/examples/macros/{string-each-char.mirah → string_each_char.mirah}

@@ -14,12 +14,11 @@
 # limitations under the License.
 
 
-macro def eachChar(value, &block)
-
-    quote { 
-        `value`.toCharArray.each do | my_char |
+macro def eachChar(value, block:Block)
+    quote {
+        `value`.toCharArray.each do |`block.arguments` |
             `block.body`
-        end 
+        end
     }
 end
 

data/examples/maven/README.txt

@@ -1,2 +1,2 @@
 This is a sample project that uses the Mirah plugin for Maven to
-build and compile source.
+build and compile source.

data/examples/maven/src/main/mirah/hello_mirah.mirah

@@ -6,4 +6,4 @@ class HelloMirah
       puts "Hello, Mirah!"
     end
   end
-end
+end

data/examples/plugins/appengine/Rakefile

@@ -69,4 +69,4 @@ task :test => :compile_test do
       formatter :type => 'plain', :usefile => 'false'
     end
   end
-end
+end

data/examples/plugins/appengine/src/com/google/appengine/ext/duby/db/MetaModel.mirah

@@ -382,4 +382,4 @@ class ModelState
     ast << mdef
     @save = Body(mdef.child_nodes.get(2))
   end
-end
+end

data/examples/plugins/appengine/src/com/google/appengine/ext/duby/db/Model.duby

@@ -391,4 +391,4 @@ class Model
 
   def _read_from(e:Entity):void
   end
-end
+end

data/examples/plugins/appengine/test/com/google/appengine/ext/duby/db/ModelTest.duby

@@ -125,4 +125,4 @@ class ModelTest
     assertEquals(e.key, e2.key)
   end
   # TODO more tests.
-end
+end

data/examples/rosettacode/100-doors.mirah

@@ -22,13 +22,13 @@ class Door
 	def initialize
 		@state=false
 	end
- 
+
 	def closed?; !@state; end
 	def open?; @state; end
 
 	def close; @state=false; end
 	def open; @state=true; end
- 
+
 	def toggle
 		if closed?
 			open
@@ -36,14 +36,14 @@ class Door
 			close
 		end
 	end
- 
+
 	def toString; Boolean.toString(@state); end
 end
- 
+
 doors=ArrayList.new
 1.upto(100) do
     doors.add(Door.new)
-end 
+end
 
 1.upto(100) do |multiplier|
     index = 0
@@ -54,7 +54,7 @@ end
 end
 
 i = 0
-doors.each do |door| 
+doors.each do |door|
     puts "Door #{i+1} is #{door}."
     i+=1
 end

data/examples/rosettacode/README.txt

@@ -1,9 +1,9 @@
 
 This example set is all the code for Mirah from the Rosetta Code wiki
-(http://rosettacode.org/. 
+(http://rosettacode.org/.
 
-This code is the canonical source for the wiki. Please add as many more 
+This code is the canonical source for the wiki. Please add as many more
 samples as you'd like. Either add the sample here and send a pull request
 to the project owners, or add a sample to the Rosetta Code wiki and send
 a message to the project owners. Either way, we'd like to try and keep
-the wiki page and this repository synchronized. 
+the wiki page and this repository synchronized.

data/examples/rosettacode/boolean-values.mirah

@@ -16,7 +16,7 @@
 import java.util.ArrayList
 import java.util.HashMap
 
-# booleans 
+# booleans
 puts 'true is true' if true
 puts 'false is false' if (!false)
 

data/examples/rosettacode/comments.mirah

@@ -18,4 +18,4 @@ puts 'code' # I am a comment
 /*
 Here is a multi-
 line comment.
-*/ 
+*/

data/examples/rosettacode/count-occurrences-of-a-substring.mirah

@@ -21,7 +21,7 @@ import java.util.regex.Matcher
 def count_substring(pattern:string, source:string)
     (source.length() - source.replace(pattern, "").length()) / pattern.length()
 end
- 
+
 puts count_substring("th", "the three truths")      # ==> 3
 puts count_substring("abab", "ababababab")          # ==> 2
 puts count_substring("a*b", "abaabba*bbaba*bbab")   # ==> 2

data/examples/rosettacode/factorial.mirah

@@ -15,7 +15,7 @@
 
 def factorial_iterative(n:int)
     2.upto(n-1) do |i|
-        n *= i 
+        n *= i
     end
     n
 end

data/examples/rosettacode/fibonacci.mirah

@@ -18,7 +18,7 @@ def fibonacci(n:int)
     return n if n < 2
     fibPrev = 1
     fib = 1
-    3.upto(Math.abs(n)) do 
+    3.upto(Math.abs(n)) do
         oldFib = fib
         fib = fib + fibPrev
         fibPrev = oldFib

data/examples/rosettacode/fizz-buzz.mirah

@@ -16,12 +16,12 @@
 
 1.upto(100) do |n|
     print "Fizz" if a = ((n % 3) == 0)
-    print "Buzz" if b = ((n % 5) == 0) 
+    print "Buzz" if b = ((n % 5) == 0)
     print n unless (a || b)
     print "\n"
 end
 
-# a little more straight forward 
+# a little more straight forward
 1.upto(100) do |n|
     if (n % 15) == 0
         puts "FizzBuzz"

data/examples/rosettacode/flatten-a-list.mirah

@@ -17,18 +17,18 @@ import java.util.ArrayList
 import java.util.List
 import java.util.Collection
 
-def flatten(list: Collection) 
+def flatten(list: Collection)
     flatten(list, ArrayList.new)
 end
 def flatten(source: Collection, result: List)
 
     source.each do |x|
-        if (Collection.class.isAssignableFrom(x.getClass())) 
-            flatten(Collection(x), result)  
+        if (Collection.class.isAssignableFrom(x.getClass()))
+            flatten(Collection(x), result)
         else
             result.add(x)
             result  # if branches must return same type
-        end 
+        end
     end
     result
 end

data/examples/rosettacode/guess-the-number.mirah

@@ -28,9 +28,9 @@ while !guessed do
     if userNumber == number
         guessed = true
         puts "you guessed it"
-    elsif userNumber > number 
+    elsif userNumber > number
         puts "too high"
     else
-        puts "too low"        
+        puts "too low"
     end
 end

data/examples/rosettacode/hamming-numbers.mirah

@@ -15,13 +15,13 @@
 
 import java.math.BigInteger
 import java.util.PriorityQueue
- 
+
 def updateFrontier(x:BigInteger, queue:PriorityQueue):void
     queue.offer(x.shiftLeft(1))
     queue.offer(x.multiply(BigInteger.valueOf(3)))
     queue.offer(x.multiply(BigInteger.valueOf(5)))
 end
- 
+
 def hamming(n:int):BigInteger
     raise "Invalid parameter" if (n <= 0)
 
@@ -42,8 +42,8 @@ end
 nums = ""
 1.upto(20) do | i |
      nums = nums + " #{hamming(i)}"
-end 
+end
 puts "Hamming(1 .. 20) =#{nums}"
 puts "\nHamming(1691) = #{hamming(1691)}"
-puts "Hamming(1000000) = #{hamming(1000000)}" 
+puts "Hamming(1000000) = #{hamming(1000000)}"
 

data/examples/rosettacode/is-string-numeric.mirah

@@ -17,7 +17,7 @@ import java.text.NumberFormat
 import java.text.ParsePosition
 import java.util.Scanner
 
-# this first example relies on catching an exception, 
+# this first example relies on catching an exception,
 # which is bad style and poorly performing in Java
 def is_numeric?(s:string)
     begin
@@ -40,28 +40,28 @@ puts '1.2.3 is not numeric' unless is_numeric?('1.2.3')
 
 
 # check every element of the string
-def is_numeric2?(s: string) 
-    if (s == nil || s.isEmpty()) 
-        return false 
-    end 
-    if (!s.startsWith('-')) 
+def is_numeric2?(s: string)
+    if (s == nil || s.isEmpty())
+        return false
+    end
+    if (!s.startsWith('-'))
         if s.contains('-')
-            return false 
+            return false
         end
-    end 
-    
+    end
+
     0.upto(s.length()-1) do |x|
         c = s.charAt(x)
         if ((x == 0) && (c == '-'.charAt(0)))
             # negative number
         elsif (c == '.'.charAt(0))
-            if (s.indexOf('.', x) > -1) 
+            if (s.indexOf('.', x) > -1)
                 return false # more than one period
-            end        
+            end
         elsif (!Character.isDigit(c))
             return false
         end
-    end 
+    end
     true
 end
 
@@ -78,7 +78,7 @@ puts '1.2.3 is not numeric' unless is_numeric2?('1.2.3')
 
 
 
-# use a regular  expression 
+# use a regular  expression
 def is_numeric3?(s:string)
   s == nil || s.matches("[-+]?\\d+(\\.\\d+)?")
 end
@@ -94,12 +94,12 @@ puts '123-  is not numeric' unless is_numeric3?('123-')
 puts '1.2.3 is not numeric' unless is_numeric3?('1.2.3')
 
 
-#  use the positional parser in the java.text.NumberFormat object 
-# (a more robust solution). If, after parsing, the parse position is at 
-# the end of the string, we can deduce that the entire string was a 
+#  use the positional parser in the java.text.NumberFormat object
+# (a more robust solution). If, after parsing, the parse position is at
+# the end of the string, we can deduce that the entire string was a
 # valid number.
-def is_numeric4?(s:string) 
-    return false if s == nil    
+def is_numeric4?(s:string)
+    return false if s == nil
     formatter = NumberFormat.getInstance()
     pos = ParsePosition.new(0)
     formatter.parse(s, pos)
@@ -118,10 +118,10 @@ puts '123-  is not numeric' unless is_numeric4?('123-')
 puts '1.2.3 is not numeric' unless is_numeric4?('1.2.3')
 
 
-# use the java.util.Scanner object. Very useful if you have to 
-# scan multiple entries. Scanner also has similar methods for longs, 
-# shorts, bytes, doubles, floats, BigIntegers, and BigDecimals as well 
-# as methods for integral types where you may input a base/radix other than 
+# use the java.util.Scanner object. Very useful if you have to
+# scan multiple entries. Scanner also has similar methods for longs,
+# shorts, bytes, doubles, floats, BigIntegers, and BigDecimals as well
+# as methods for integral types where you may input a base/radix other than
 # 10 (10 is the default, which can be changed using the useRadix method).
 def is_numeric5?(s:string)
     return false if s == nil

data/examples/rosettacode/palindrome.mirah

@@ -14,11 +14,11 @@
 # limitations under the License.
 
 
-def reverse(s:string) 
+def reverse(s:string)
     StringBuilder.new(s).reverse.toString()
 end
 
-def palindrome?(s:string) 
+def palindrome?(s:string)
     s.equals(reverse(s))
 end
 

data/examples/rosettacode/random-numbers.mirah

@@ -19,7 +19,7 @@ list = double[999]
 mean = 1.0
 std = 0.5
 rng = Random.new
-0.upto(998) do | i | 
+0.upto(998) do | i |
     list[i] = mean + std * rng.nextGaussian
 end
 

data/examples/rosettacode/repeat-a-string.mirah

@@ -16,7 +16,7 @@
 
 x = ""
 
-5.times do 
+5.times do
     x = x + "ha"
 end
 

data/examples/rosettacode/reverse-a-string.mirah

@@ -14,7 +14,7 @@
 # limitations under the License.
 
 
-def reverse(s:string) 
+def reverse(s:string)
     StringBuilder.new(s).reverse
 end