trackler 2.2.1.7 → 2.2.1.8

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 32b3024c5c1eae3a8430dc5ff9b30dd89482b992
-  data.tar.gz: 81c39cf9c83b10b547105c0977d37a6789aa6208
+  metadata.gz: 9f3ca5df18b1a21d38f1ceac670820682f6deb92
+  data.tar.gz: a701101ed75a3ba230ba7363e102a195fc4271b1
 SHA512:
-  metadata.gz: 59807cc0f318f2e45f868bbad1c6f2c3638b33acd0269cc91b64498f3a502c67acc492db5b2e10439e77b0957b2ce461fd087ccc8b6ace3ad147892c5d5a067d
-  data.tar.gz: 20c53bb897465d30cc7dc5d27582b4eb4dc17e912422c2323ccce6995b56662f1d843fb0c8ebde964c71e1b9d03a6df9f9417297d109ab3881995517f9d2bfaf
+  metadata.gz: c0b92c4870fc29162abd0ed9ee1a2b8670007a1cf2e7f28c775697359f5ddad3e7c195e4dab02740db17d5bce5524fc35352037ce5a3a5ad051f95553255008b
+  data.tar.gz: 74253176cdf8240342e88d637ce780a9423cb2ec4bbe1c4f5f42728ad32f7d5e61a810af7bf409b79496685b2612b868dcb3addf14cce468d74eaffe21cfc956

data/.gitmodules

@@ -13,7 +13,6 @@
 [submodule "tracks/clojure"]
 	path = tracks/clojure
 	url = https://github.com/exercism/clojure
-	url = https://github.com/exercism/clojurescript
 [submodule "tracks/coffeescript"]
 	path = tracks/coffeescript
 	url = https://github.com/exercism/coffeescript
@@ -161,15 +160,12 @@
 [submodule "tracks/scheme"]
 	path = tracks/scheme
 	url = https://github.com/exercism/scheme
-	url = https://github.com/exercism/smalltalk
 [submodule "tracks/sml"]
 	path = tracks/sml
 	url = https://github.com/exercism/sml
 [submodule "tracks/swift"]
 	path = tracks/swift
 	url = https://github.com/exercism/swift
-	url = https://github.com/exercism/tcl
-	url = https://github.com/exercism/teco
 [submodule "tracks/typescript"]
 	path = tracks/typescript
 	url = https://github.com/exercism/typescript

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.7"
+  VERSION = "2.2.1.8"
 end

data/tracks/go/config.json

@@ -686,9 +686,13 @@
       "slug": "wordy",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 3,
       "topics": [
-
+        "Parsing",
+        "Control-flow (conditionals)",
+        "Type conversion",
+        "Integers",
+        "Strings"
       ]
     },
     {
@@ -706,9 +710,11 @@
       "slug": "grade-school",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 1,
+      "difficulty": 5,
       "topics": [
-
+        "Sorting",
+        "Structs",
+        "Lists"
       ]
     },
     {

data/tracks/java/exercises/custom-set/src/test/java/CustomSetTest.java

@@ -21,7 +21,7 @@ public class CustomSetTest {
     @Test
     public void setsWithElementsAreNotEmpty() {
         final boolean actual
-                = new CustomSet<>(Arrays.asList(1))
+                = new CustomSet<>(Collections.singletonList(1))
                         .isEmpty();
 
         assertFalse(actual);
@@ -73,7 +73,7 @@ public class CustomSetTest {
     @Test
     public void emptySetIsASubsetOfNonEmptySet() {
         final boolean actual
-                = new CustomSet<>(Arrays.asList(1))
+                = new CustomSet<>(Collections.singletonList(1))
                         .isSubset(
                                 new CustomSet<>(Collections.EMPTY_LIST)
                         );
@@ -87,7 +87,7 @@ public class CustomSetTest {
         final boolean actual
                 = new CustomSet<>(Collections.EMPTY_LIST)
                         .isSubset(
-                                new CustomSet<>(Arrays.asList(1))
+                                new CustomSet<>(Collections.singletonList(1))
                         );
 
         assertFalse(actual);
@@ -147,7 +147,7 @@ public class CustomSetTest {
         final boolean actual
                 = new CustomSet<>(Collections.EMPTY_LIST)
                         .isDisjoint(
-                                new CustomSet<>(Arrays.asList(1))
+                                new CustomSet<>(Collections.singletonList(1))
                         );
 
         assertTrue(actual);
@@ -157,7 +157,7 @@ public class CustomSetTest {
     @Test
     public void nonEmptySetIsDisjointWithEmptySet() {
         final boolean actual
-                = new CustomSet<>(Arrays.asList(1))
+                = new CustomSet<>(Collections.singletonList(1))
                         .isDisjoint(
                                 new CustomSet<>(Collections.EMPTY_LIST)
                         );
@@ -255,7 +255,7 @@ public class CustomSetTest {
         final int element = 3;
         final CustomSet<Integer> expected
                 = new CustomSet<>(
-                        Collections.unmodifiableList(Arrays.asList(element))
+                        Collections.unmodifiableList(Collections.singletonList(element))
                 );
         final CustomSet<Integer> actual
                 = new CustomSet<>(Collections.EMPTY_LIST);
@@ -453,12 +453,12 @@ public class CustomSetTest {
     public void unionOfAnEmptySetAndNonEmptySetIsTheNonEmptySet() {
         final CustomSet<Integer> expected
                 = new CustomSet<>(
-                        Collections.unmodifiableList(Arrays.asList(2))
+                        Collections.unmodifiableList(Collections.singletonList(2))
                 );
         final CustomSet<Integer> actual
                 = new CustomSet<>(Collections.EMPTY_LIST)
                         .getUnion(
-                                new CustomSet<>(Arrays.asList(2))
+                                new CustomSet<>(Collections.singletonList(2))
                         );
 
         assertNotNull(actual);

data/tracks/r/README.md

@@ -120,7 +120,7 @@ The example solutions must pass the tests without failures. Additionally the tes
 In order to be accepted by Travis-CI, each exercise must be registered in `config.json`.
 
 ### Style guide
-There are a variety of R style guides in circulation and opinions on the topic can vary widely which does make it hard to settle on specific standards. Our preference is to have R code in this repository follow Hadley Wickham's [R style guide](http://adv-r.had.co.nz/Style.html).
+There are a variety of R style guides in circulation and opinions on the topic can vary widely which does make it hard to settle on specific standards. Our preference is to have R code in this repository follow the [tidyverse style guide](http://style.tidyverse.org/).
 
 You are thus encouraged to run [`lintr`](https://github.com/jimhester/lintr) on your R scripts before opening a [pull request](#writing-a-pull-request) in order to check that your code adheres to this style guide before submitting it for review.
 
@@ -131,6 +131,7 @@ Note however that at the moment only the following linting rules are strictly en
 - the assignment operator <- should be used
 - all commas should be followed by a space (but not preceded by one)
 - no absolute paths should be used
+- infix operators (+, -, =, <-) should have spaces around them
 
 To perform these specific checks locally, run `source("bin/run_lints.R")`.
 

data/tracks/r/bin/run_lints.R

@@ -5,7 +5,8 @@ linters <- list(
   b = camel_case_linter,
   c = assignment_linter,
   d = commas_linter,
-  e = absolute_paths_linter
+  e = absolute_paths_linter,
+  f = infix_spaces_linter
 )
 
 files <- list.files(path = "exercises", pattern = ".+\\.R$", recursive = TRUE, full.names = TRUE)

data/tracks/r/exercises/collatz-conjecture/example.R

@@ -5,9 +5,9 @@ collatz_step_counter <- function(num) {
   } else if (num == 1) {
     return(0)  
   } else if (num %% 2 == 0) {
-    return(1 + collatz_step_counter(num/2))
+    return(1 + collatz_step_counter(num / 2))
   } else {
-    return(1 + collatz_step_counter(3*num + 1))
+    return(1 + collatz_step_counter(3 * num + 1))
   }
   
 }

data/tracks/r/exercises/perfect-numbers/example.R

@@ -10,10 +10,10 @@ is_perfect <- function(n){
   
   find_factors <- function(n) {
     factors <- c()
-    for (i in 2:floor(n^0.5 + 1)) {
+    for (i in 2:floor(n ^ 0.5 + 1)) {
       
       if (n %% i == 0) {
-        if (i^2 != n) {
+        if (i ^ 2 != n) {
           factors <- c(factors, i, n / i)
         }
         else {

data/tracks/r/exercises/sieve/example.R

@@ -6,9 +6,9 @@ sieve <- function(limit) {
   nums[1] <- FALSE
   for (i in 2:limit) {
     if (nums[i]) {
-      div <- floor(limit/i)
-      if (div > 1){
-        nums[i*2:div] <- FALSE  
+      div <- floor(limit / i)
+      if (div > 1) {
+        nums[i * 2:div] <- FALSE  
       }
     }
   }

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.7
+  version: 2.2.1.8
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-08-01 00:00:00.000000000 Z
+date: 2017-08-02 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip