trackler 2.0.5.0 → 2.0.5.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: a547beacb50c81feb42130ca6f08bf659a9f25d6
-  data.tar.gz: 404df6144bbbc9c11973c8148cbdb29bb489faef
+  metadata.gz: d08f22cd9cd8ad91c9bd2789324bc7e368e547c8
+  data.tar.gz: 1f551cc425ba3ee5e263c1f6dcdd3a8716627764
 SHA512:
-  metadata.gz: 258a478b5aaa4681af90b72fce55382234fa86e62313d5fbdb7380693d4c49fe388ac4c10d89f238813db163a996da6dbce4f91039ed389ddb422264ffd5bfca
-  data.tar.gz: 5c129cd1186b2cc4180ec503de3a3f156d0baf4583cc8cb5644d26f69ea6bd2ff196b19568b591d4b861e45445d148f58a0258755e15599a85bba2cfcd86deaa
+  metadata.gz: 0b19b0c48ffe4addf76f7208a016a38f465ba69ce4e49d592399ee0162943b8c016e7eaccc87e9f1af631fa495a2a7b5852c5977033db463f77ac59775dae49f
+  data.tar.gz: 725afee0fbc6423574cc17e67ff2992ca01464d2a441612be381161ae78f6f5e5a2b4dc5abafa95c9563c0886051e148eb3c3920b0c9c2512170d2ad1af0506b

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.0.5.0"
+  VERSION = "2.0.5.1"
 end

data/tracks/crystal/exercises/largest-series-product/spec/largest_series_product_spec.cr

@@ -6,52 +6,68 @@ describe "Series" do
     it "can find the largest product of 2 with numbers in order" do
       Series.new("0123456789").largest_product(2).should eq 72
     end
-    it "can find the largest product of 2" do
+
+    pending "can find the largest product of 2" do
       Series.new("576802143").largest_product(2).should eq 48
     end
-    it "finds the largest product if span equals length" do
+
+    pending "finds the largest product if span equals length" do
       Series.new("29").largest_product(2).should eq 18
     end
-    it "can find the largest product of 3 with numbers in order" do
+
+    pending "can find the largest product of 3 with numbers in order" do
       Series.new("0123456789").largest_product(3).should eq 504
     end
-    it "can find the largest product of 3" do
+
+    pending "can find the largest product of 3" do
       Series.new("1027839564").largest_product(3).should eq 270
     end
-    it "can find the largest product of 5 with numbers in order" do
+
+    pending "can find the largest product of 5 with numbers in order" do
       Series.new("0123456789").largest_product(5).should eq 15120
     end
-    it "can get the largest product of a big number" do
+
+    pending "can get the largest product of a big number" do
       Series.new("73167176531330624919225119674426574742355349194934").largest_product(6).should eq 23520
     end
-    it "can get the largest product of a big number II" do
+
+    pending "can get the largest product of a big number II" do
       Series.new("52677741234314237566414902593461595376319419139427").largest_product(6).should eq 28350
     end
-    it "can get the largest product of a big number (Project Euler)" do
+
+    pending "can get the largest product of a big number (Project Euler)" do
       Series.new("7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450").largest_product(13).should eq 23514624000
     end
-    it "reports zero if the only digits are zero" do
+
+    pending "reports zero if the only digits are zero" do
       Series.new("0000").largest_product(2).should eq 0
     end
-    it "reports zero if all spans include zero" do
+
+    pending "reports zero if all spans include zero" do
       Series.new("99099").largest_product(3).should eq 0
     end
-    it "rejects span longer than string length" do
+
+    pending "rejects span longer than string length" do
       expect_raises(ArgumentError) { Series.new("123").largest_product(4) }
     end
-    it "reports 1 for empty string and empty product (0 span)" do
+
+    pending "reports 1 for empty string and empty product (0 span)" do
       Series.new("").largest_product(0).should eq 1
     end
-    it "reports 1 for nonempty string and empty product (0 span)" do
+
+    pending "reports 1 for nonempty string and empty product (0 span)" do
       Series.new("123").largest_product(0).should eq 1
     end
-    it "rejects empty string and nonzero span" do
+
+    pending "rejects empty string and nonzero span" do
       expect_raises(ArgumentError) { Series.new("").largest_product(1) }
     end
-    it "rejects invalid character in digits" do
+
+    pending "rejects invalid character in digits" do
       expect_raises(ArgumentError) { Series.new("1234a5").largest_product(2).should eq -1 }
     end
-    it "rejects negative span" do
+
+    pending "rejects negative span" do
       expect_raises(ArgumentError) { Series.new("12345").largest_product(-1) }
     end
   end

data/tracks/fsharp/exercises/grep/GrepTest.fs

@@ -44,6 +44,7 @@ That Shepherd, who first taught the chosen Seed
 
 [<OneTimeSetUp>]
 let setUp () =
+    Directory.SetCurrentDirectory(Path.GetTempPath());
     File.WriteAllText(iliadFileName, iliadContents)
     File.WriteAllText(midsummerNightFileName, midsummerNightContents)
     File.WriteAllText(paradiseLostFileName, paradiseLostContents)
@@ -329,4 +330,4 @@ let ``Multiple files, no matches, various flags`` (flags) =
 
     let expected = ""
     
-    Assert.That(grep pattern flags files, Is.EqualTo(expected))
+    Assert.That(grep pattern flags files, Is.EqualTo(expected))

data/tracks/fsharp/exercises/linked-list/Example.fs

@@ -1,36 +1,43 @@
 module LinkedList
 
 type Element<'a> = { value: 'a; mutable prev: Element<'a> option; mutable next: Element<'a> option }
-type LinkedList<'a> = { first: Element<'a> option; last: Element<'a> option }
+type LinkedList<'a> = { mutable first: Element<'a> option; mutable last: Element<'a> option }
 
-let mkLinkedList = { first = None; last = None }
+let mkLinkedList () = { first = None; last = None }
 
-let addToEmpty newValue linkedList = 
+let addToEmpty newValue linkedList =
     let newElement = { value = newValue; prev = None; next = None }
-    { linkedList with first = Some newElement; last = Some newElement }
+    linkedList.first <- Some newElement
+    linkedList.last <- Some newElement
 
 let pop linkedList =
     match linkedList.last with
     | None -> failwith "Cannot pop from empty list"
-    | Some(x) -> x.value, { linkedList with last = x.prev }
+    | Some oldLast ->
+        linkedList.last <- oldLast.prev
+        linkedList.last |> Option.iter (fun el -> el.next <- None)
+        oldLast.value
 
 let shift linkedList =
     match linkedList.first with
     | None -> failwith "Cannot shift from empty list"
-    | Some(x) -> x.value, { linkedList with first = x.next }
-        
-let push newValue linkedList = 
+    | Some oldFirst ->
+        linkedList.first <- oldFirst.next
+        linkedList.first |> Option.iter (fun el -> el.prev <- None)
+        oldFirst.value
+
+let push newValue linkedList =
     match linkedList.last with
     | None -> addToEmpty newValue linkedList
-    | Some(x) ->         
-        let last = Some { value = newValue; prev = linkedList.last; next = x.next }
-        x.next <- last            
-        { linkedList with last = last }
+    | Some oldLast ->
+        let newLast = Some { value = newValue; prev = linkedList.last; next = None }
+        oldLast.next <- newLast
+        linkedList.last <- newLast
 
-let unshift newValue linkedList =        
+let unshift newValue linkedList =
     match linkedList.first with
     | None -> addToEmpty newValue linkedList
-    | Some(x) ->     
-        let first = Some { value = newValue; prev = x.prev; next = linkedList.first }
-        x.prev <- first
-        { linkedList with first = first }
+    | Some oldFirst ->
+        let newFirst = Some { value = newValue; prev = None; next = linkedList.first }
+        oldFirst.prev <- newFirst
+        linkedList.first <- newFirst

data/tracks/fsharp/exercises/linked-list/HINTS.md

@@ -0,0 +1,14 @@
+## Hints
+
+A [doubly linked list](https://en.wikipedia.org/wiki/Doubly_linked_list) is a mutable data structure. As F# is a functional-first language, immutability is generally preferred, but there are language features that allow the use of mutation where it is required.
+
+* The `mutable` keyword can be placed before `let` bindings and [record](https://docs.microsoft.com/en-us/dotnet/articles/fsharp/language-reference/records) fields, allowing you to assign new values to them.
+
+* [Class](https://fsharpforfunandprofit.com/posts/classes) properties can be made mutable by specifying a property setter with the `set` keyword.
+
+Mutable bindings must be re-assigned with `<-`
+
+```fsharp
+let mutable x = "initial value"
+x <- "new value"
+```

data/tracks/fsharp/exercises/linked-list/LinkedListTest.fs

@@ -5,117 +5,110 @@ open LinkedList
 
 [<Test>]
 let ``Push and pop are first in last out order`` () =
-    let linkedList = 
-        mkLinkedList
-        |> push 10
-        |> push 20
+    let linkedList = mkLinkedList ()
+    linkedList |> push 10
+    linkedList |> push 20
 
-    let (val', linkedList') = pop linkedList
-    let (val'', _) = pop linkedList'
+    let val1 = pop linkedList
+    let val2 = pop linkedList
 
-    Assert.That(val', Is.EqualTo(20))
-    Assert.That(val'', Is.EqualTo(10))
+    Assert.That(val1, Is.EqualTo(20))
+    Assert.That(val2, Is.EqualTo(10))
 
-[<Test>]  
-[<Ignore("Remove to run test")>]  
+[<Test>]
+[<Ignore("Remove to run test")>]
 let ``Push and shift are first in first out order`` () =
-    let linkedList = 
-        mkLinkedList
-        |> push 10
-        |> push 20
+    let linkedList = mkLinkedList ()
+    linkedList |> push 10
+    linkedList |> push 20
 
-    let (val', linkedList') = shift linkedList
-    let (val'', _) = shift linkedList'
+    let val1 = shift linkedList
+    let val2 = shift linkedList
 
-    Assert.That(val', Is.EqualTo(10))
-    Assert.That(val'', Is.EqualTo(20))
+    Assert.That(val1, Is.EqualTo(10))
+    Assert.That(val2, Is.EqualTo(20))
 
-[<Test>] 
-[<Ignore("Remove to run test")>]  
+[<Test>]
+[<Ignore("Remove to run test")>]
 let ``Unshift and shift are last in first out order`` () =
-    let linkedList = 
-        mkLinkedList
-        |> unshift 10
-        |> unshift 20
+    let linkedList = mkLinkedList ()
+    linkedList |> unshift 10
+    linkedList |> unshift 20
 
-    let (val', linkedList') = shift linkedList
-    let (val'', _) = shift linkedList'
+    let val1 = shift linkedList
+    let val2 = shift linkedList
 
-    Assert.That(val', Is.EqualTo(20))
-    Assert.That(val'', Is.EqualTo(10))
+    Assert.That(val1, Is.EqualTo(20))
+    Assert.That(val2, Is.EqualTo(10))
 
-[<Test>]    
+[<Test>]
 [<Ignore("Remove to run test")>]
 let ``Unshift and pop are last in last out order`` () =
-    let linkedList = 
-        mkLinkedList
-        |> unshift 10
-        |> unshift 20
+    let linkedList = mkLinkedList ()
+    linkedList |> unshift 10
+    linkedList |> unshift 20
 
-    let (val', linkedList') = pop linkedList
-    let (val'', _) = pop linkedList'
+    let val1 = pop linkedList
+    let val2 = pop linkedList
 
-    Assert.That(val', Is.EqualTo(10))
-    Assert.That(val'', Is.EqualTo(20))
+    Assert.That(val1, Is.EqualTo(10))
+    Assert.That(val2, Is.EqualTo(20))
 
-[<Test>]    
+[<Test>]
 [<Ignore("Remove to run test")>]
 let ``Push and pop can handle multiple values`` () =
-    let linkedList = 
-        mkLinkedList
-        |> push 10
-        |> push 20
-        |> push 30
+    let linkedList = mkLinkedList ()
+    linkedList |> push 10
+    linkedList |> push 20
+    linkedList |> push 30
 
-    let (val', linkedList') = pop linkedList
-    let (val'', linkedList'') = pop linkedList'
-    let (val''', _) = pop linkedList''
+    let val1 = pop linkedList
+    let val2 = pop linkedList
+    let val3 = pop linkedList
 
-    Assert.That(val', Is.EqualTo(30))
-    Assert.That(val'', Is.EqualTo(20))
-    Assert.That(val''', Is.EqualTo(10))
+    Assert.That(val1, Is.EqualTo(30))
+    Assert.That(val2, Is.EqualTo(20))
+    Assert.That(val3, Is.EqualTo(10))
 
-[<Test>]    
+[<Test>]
 [<Ignore("Remove to run test")>]
 let ``Unshift and shift can handle multiple values`` () =
-    let linkedList = 
-        mkLinkedList
-        |> unshift 10
-        |> unshift 20
-        |> unshift 30
+    let linkedList = mkLinkedList ()
+    linkedList |> unshift 10
+    linkedList |> unshift 20
+    linkedList |> unshift 30
 
-    let (val', linkedList') = shift linkedList
-    let (val'', linkedList'') = shift linkedList'
-    let (val''', _) = shift linkedList''
+    let val1 = shift linkedList
+    let val2 = shift linkedList
+    let val3 = shift linkedList
 
-    Assert.That(val', Is.EqualTo(30))
-    Assert.That(val'', Is.EqualTo(20))
-    Assert.That(val''', Is.EqualTo(10))
+    Assert.That(val1, Is.EqualTo(30))
+    Assert.That(val2, Is.EqualTo(20))
+    Assert.That(val3, Is.EqualTo(10))
 
-[<Test>]    
+[<Test>]
 [<Ignore("Remove to run test")>]
 let ``All methods of manipulating the linkedList can be used together`` () =
-    let linkedList = 
-        mkLinkedList
-        |> push 10
-        |> push 20
+    let linkedList = mkLinkedList ()
+    linkedList |> push 10
+    linkedList |> push 20
+
+    let val1 = pop linkedList
 
-    let (val', linkedList') = pop linkedList
+    Assert.That(val1, Is.EqualTo(20))
 
-    Assert.That(val', Is.EqualTo(20))
+    linkedList |> push 30
+    let val2 = shift linkedList
 
-    let linkedList'' = push 30 linkedList'
-    let (val''', linkedList''') = shift linkedList''
+    Assert.That(val2, Is.EqualTo(10))
 
-    Assert.That(val''', Is.EqualTo(10))
+    linkedList |> unshift 40
+    linkedList |> push 50
 
-    let linkedList'''' = unshift 40 linkedList'''
-    let linkedList''''' = push 50 linkedList''''
+    let val3 = shift linkedList
+    let val4 = pop linkedList
+    let val5 = shift linkedList
 
-    let (val'''''', linkedList'''''') = shift linkedList'''''
-    let (val''''''', linkedList''''''') = pop linkedList''''''
-    let (val'''''''', _) = shift linkedList'''''''
-        
-    Assert.That(val'''''', Is.EqualTo(40))
-    Assert.That(val''''''', Is.EqualTo(50))
-    Assert.That(val'''''''', Is.EqualTo(30))
+    Assert.That(val3, Is.EqualTo(40))
+    Assert.That(val4, Is.EqualTo(50))
+    Assert.That(val5, Is.EqualTo(30))

data/tracks/lua/config.json

@@ -433,6 +433,14 @@
       "filtering",
       "control-flow (loops)"
     ]
+  }, {
+    "slug": "meetup",
+    "difficulty": 6,
+    "topics": [
+      "time",
+      "control-flow (if-statements)",
+      "control-flow (loops)"
+    ]
   }, {
     "slug": "atbash-cipher",
     "difficulty": 3,

data/tracks/lua/exercises/meetup/example.lua

@@ -0,0 +1,61 @@
+local day_name_to_number = {
+  Sunday = 1,
+  Monday = 2,
+  Tuesday = 3,
+  Wednesday = 4,
+  Thursday = 5,
+  Friday = 6,
+  Saturday = 7
+}
+
+local function matching_days(config)
+  local meetup_day = day_name_to_number[config.day]
+  local days = {}
+
+  for day = 1, math.huge do
+    local date = os.date('*t', os.time({
+      year = config.year,
+      month = config.month,
+      day = day
+    }))
+
+    if date.month ~= config.month then break end
+
+    if date.wday == meetup_day then
+      table.insert(days, day)
+    end
+  end
+
+  return days
+end
+
+local function first_teenth(t)
+  for _, v in ipairs(t) do
+    if v > 12 then return v end
+  end
+end
+
+local function last(t)
+  return t[#t]
+end
+
+local function ordinal(t, which)
+  return t[({
+    first = 1,
+    second = 2,
+    third = 3,
+    fourth = 4
+  })[which]]
+end
+
+return function(config)
+  local days = matching_days(config)
+
+  if config.week == 'teenth' then
+    return first_teenth(days)
+  elseif config.week == 'last' then
+    return last(days)
+  else
+    return ordinal(days, config.week)
+  end
+end