trackler 2.2.1.7 → 2.2.1.8

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
checksums.yaml CHANGED
@@ -1,7 +1,7 @@
1
1
  ---
2
2
  SHA1:
3
- metadata.gz: 32b3024c5c1eae3a8430dc5ff9b30dd89482b992
4
- data.tar.gz: 81c39cf9c83b10b547105c0977d37a6789aa6208
3
+ metadata.gz: 9f3ca5df18b1a21d38f1ceac670820682f6deb92
4
+ data.tar.gz: a701101ed75a3ba230ba7363e102a195fc4271b1
5
5
  SHA512:
6
- metadata.gz: 59807cc0f318f2e45f868bbad1c6f2c3638b33acd0269cc91b64498f3a502c67acc492db5b2e10439e77b0957b2ce461fd087ccc8b6ace3ad147892c5d5a067d
7
- data.tar.gz: 20c53bb897465d30cc7dc5d27582b4eb4dc17e912422c2323ccce6995b56662f1d843fb0c8ebde964c71e1b9d03a6df9f9417297d109ab3881995517f9d2bfaf
6
+ metadata.gz: c0b92c4870fc29162abd0ed9ee1a2b8670007a1cf2e7f28c775697359f5ddad3e7c195e4dab02740db17d5bce5524fc35352037ce5a3a5ad051f95553255008b
7
+ data.tar.gz: 74253176cdf8240342e88d637ce780a9423cb2ec4bbe1c4f5f42728ad32f7d5e61a810af7bf409b79496685b2612b868dcb3addf14cce468d74eaffe21cfc956
data/.gitmodules CHANGED
@@ -13,7 +13,6 @@
13
13
  [submodule "tracks/clojure"]
14
14
  path = tracks/clojure
15
15
  url = https://github.com/exercism/clojure
16
- url = https://github.com/exercism/clojurescript
17
16
  [submodule "tracks/coffeescript"]
18
17
  path = tracks/coffeescript
19
18
  url = https://github.com/exercism/coffeescript
@@ -161,15 +160,12 @@
161
160
  [submodule "tracks/scheme"]
162
161
  path = tracks/scheme
163
162
  url = https://github.com/exercism/scheme
164
- url = https://github.com/exercism/smalltalk
165
163
  [submodule "tracks/sml"]
166
164
  path = tracks/sml
167
165
  url = https://github.com/exercism/sml
168
166
  [submodule "tracks/swift"]
169
167
  path = tracks/swift
170
168
  url = https://github.com/exercism/swift
171
- url = https://github.com/exercism/tcl
172
- url = https://github.com/exercism/teco
173
169
  [submodule "tracks/typescript"]
174
170
  path = tracks/typescript
175
171
  url = https://github.com/exercism/typescript
@@ -1,3 +1,3 @@
1
1
  module Trackler
2
- VERSION = "2.2.1.7"
2
+ VERSION = "2.2.1.8"
3
3
  end
@@ -686,9 +686,13 @@
686
686
  "slug": "wordy",
687
687
  "core": false,
688
688
  "unlocked_by": null,
689
- "difficulty": 1,
689
+ "difficulty": 3,
690
690
  "topics": [
691
-
691
+ "Parsing",
692
+ "Control-flow (conditionals)",
693
+ "Type conversion",
694
+ "Integers",
695
+ "Strings"
692
696
  ]
693
697
  },
694
698
  {
@@ -706,9 +710,11 @@
706
710
  "slug": "grade-school",
707
711
  "core": false,
708
712
  "unlocked_by": null,
709
- "difficulty": 1,
713
+ "difficulty": 5,
710
714
  "topics": [
711
-
715
+ "Sorting",
716
+ "Structs",
717
+ "Lists"
712
718
  ]
713
719
  },
714
720
  {
@@ -21,7 +21,7 @@ public class CustomSetTest {
21
21
  @Test
22
22
  public void setsWithElementsAreNotEmpty() {
23
23
  final boolean actual
24
- = new CustomSet<>(Arrays.asList(1))
24
+ = new CustomSet<>(Collections.singletonList(1))
25
25
  .isEmpty();
26
26
 
27
27
  assertFalse(actual);
@@ -73,7 +73,7 @@ public class CustomSetTest {
73
73
  @Test
74
74
  public void emptySetIsASubsetOfNonEmptySet() {
75
75
  final boolean actual
76
- = new CustomSet<>(Arrays.asList(1))
76
+ = new CustomSet<>(Collections.singletonList(1))
77
77
  .isSubset(
78
78
  new CustomSet<>(Collections.EMPTY_LIST)
79
79
  );
@@ -87,7 +87,7 @@ public class CustomSetTest {
87
87
  final boolean actual
88
88
  = new CustomSet<>(Collections.EMPTY_LIST)
89
89
  .isSubset(
90
- new CustomSet<>(Arrays.asList(1))
90
+ new CustomSet<>(Collections.singletonList(1))
91
91
  );
92
92
 
93
93
  assertFalse(actual);
@@ -147,7 +147,7 @@ public class CustomSetTest {
147
147
  final boolean actual
148
148
  = new CustomSet<>(Collections.EMPTY_LIST)
149
149
  .isDisjoint(
150
- new CustomSet<>(Arrays.asList(1))
150
+ new CustomSet<>(Collections.singletonList(1))
151
151
  );
152
152
 
153
153
  assertTrue(actual);
@@ -157,7 +157,7 @@ public class CustomSetTest {
157
157
  @Test
158
158
  public void nonEmptySetIsDisjointWithEmptySet() {
159
159
  final boolean actual
160
- = new CustomSet<>(Arrays.asList(1))
160
+ = new CustomSet<>(Collections.singletonList(1))
161
161
  .isDisjoint(
162
162
  new CustomSet<>(Collections.EMPTY_LIST)
163
163
  );
@@ -255,7 +255,7 @@ public class CustomSetTest {
255
255
  final int element = 3;
256
256
  final CustomSet<Integer> expected
257
257
  = new CustomSet<>(
258
- Collections.unmodifiableList(Arrays.asList(element))
258
+ Collections.unmodifiableList(Collections.singletonList(element))
259
259
  );
260
260
  final CustomSet<Integer> actual
261
261
  = new CustomSet<>(Collections.EMPTY_LIST);
@@ -453,12 +453,12 @@ public class CustomSetTest {
453
453
  public void unionOfAnEmptySetAndNonEmptySetIsTheNonEmptySet() {
454
454
  final CustomSet<Integer> expected
455
455
  = new CustomSet<>(
456
- Collections.unmodifiableList(Arrays.asList(2))
456
+ Collections.unmodifiableList(Collections.singletonList(2))
457
457
  );
458
458
  final CustomSet<Integer> actual
459
459
  = new CustomSet<>(Collections.EMPTY_LIST)
460
460
  .getUnion(
461
- new CustomSet<>(Arrays.asList(2))
461
+ new CustomSet<>(Collections.singletonList(2))
462
462
  );
463
463
 
464
464
  assertNotNull(actual);
data/tracks/r/README.md CHANGED
@@ -120,7 +120,7 @@ The example solutions must pass the tests without failures. Additionally the tes
120
120
  In order to be accepted by Travis-CI, each exercise must be registered in `config.json`.
121
121
 
122
122
  ### Style guide
123
- 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).
123
+ 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/).
124
124
 
125
125
  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.
126
126
 
@@ -131,6 +131,7 @@ Note however that at the moment only the following linting rules are strictly en
131
131
  - the assignment operator <- should be used
132
132
  - all commas should be followed by a space (but not preceded by one)
133
133
  - no absolute paths should be used
134
+ - infix operators (+, -, =, <-) should have spaces around them
134
135
 
135
136
  To perform these specific checks locally, run `source("bin/run_lints.R")`.
136
137
 
@@ -5,7 +5,8 @@ linters <- list(
5
5
  b = camel_case_linter,
6
6
  c = assignment_linter,
7
7
  d = commas_linter,
8
- e = absolute_paths_linter
8
+ e = absolute_paths_linter,
9
+ f = infix_spaces_linter
9
10
  )
10
11
 
11
12
  files <- list.files(path = "exercises", pattern = ".+\\.R$", recursive = TRUE, full.names = TRUE)
@@ -5,9 +5,9 @@ collatz_step_counter <- function(num) {
5
5
  } else if (num == 1) {
6
6
  return(0)
7
7
  } else if (num %% 2 == 0) {
8
- return(1 + collatz_step_counter(num/2))
8
+ return(1 + collatz_step_counter(num / 2))
9
9
  } else {
10
- return(1 + collatz_step_counter(3*num + 1))
10
+ return(1 + collatz_step_counter(3 * num + 1))
11
11
  }
12
12
 
13
13
  }
@@ -10,10 +10,10 @@ is_perfect <- function(n){
10
10
 
11
11
  find_factors <- function(n) {
12
12
  factors <- c()
13
- for (i in 2:floor(n^0.5 + 1)) {
13
+ for (i in 2:floor(n ^ 0.5 + 1)) {
14
14
 
15
15
  if (n %% i == 0) {
16
- if (i^2 != n) {
16
+ if (i ^ 2 != n) {
17
17
  factors <- c(factors, i, n / i)
18
18
  }
19
19
  else {
@@ -6,9 +6,9 @@ sieve <- function(limit) {
6
6
  nums[1] <- FALSE
7
7
  for (i in 2:limit) {
8
8
  if (nums[i]) {
9
- div <- floor(limit/i)
10
- if (div > 1){
11
- nums[i*2:div] <- FALSE
9
+ div <- floor(limit / i)
10
+ if (div > 1) {
11
+ nums[i * 2:div] <- FALSE
12
12
  }
13
13
  }
14
14
  }
metadata CHANGED
@@ -1,14 +1,14 @@
1
1
  --- !ruby/object:Gem::Specification
2
2
  name: trackler
3
3
  version: !ruby/object:Gem::Version
4
- version: 2.2.1.7
4
+ version: 2.2.1.8
5
5
  platform: ruby
6
6
  authors:
7
7
  - Katrina Owen
8
8
  autorequire:
9
9
  bindir: bin
10
10
  cert_chain: []
11
- date: 2017-08-01 00:00:00.000000000 Z
11
+ date: 2017-08-02 00:00:00.000000000 Z
12
12
  dependencies:
13
13
  - !ruby/object:Gem::Dependency
14
14
  name: rubyzip