trackler 2.0.6.16 → 2.0.6.17

data/tracks/go/exercises/custom-set/example_slice.go

@@ -5,19 +5,25 @@ package stringset
 // Example based on slices rather than maps, to validate that such a solution
 // can pass the tests.
 //
-// The API is a little akward for this because it has value receivers but
+// The API is a little awkward for this because it has value receivers but
 // a pointer in a struct works okay.
 
 import "fmt"
 
-const testVersion = 3
+const testVersion = 4
 
-type Set struct{ s *[]string }
+// Set represents some properties of a mathematical set.
+// Sets are finite and all elements are unique string values.
+type Set struct {
+	s *[]string
+}
 
+// New constructs a new Set representing an empty set.
 func New() Set {
 	return Set{new([]string)}
 }
 
+// NewFromSlice constructs a new Set populated from elements of a slice.
 func NewFromSlice(l []string) Set {
 	s := New()
 	for _, e := range l {
@@ -26,27 +32,26 @@ func NewFromSlice(l []string) Set {
 	return s
 }
 
-func (s Set) Add(v string) {
-	for _, e := range *s.s {
-		if e == v {
-			return
+// String returns a printable representation of s.
+func (s Set) String() string {
+	r := "{"
+	i := 0
+	for _, v := range *s.s {
+		if i > 0 {
+			r += ", "
 		}
+		r += fmt.Sprintf("%q", v)
+		i++
 	}
-	*s.s = append(*s.s, v)
+	return r + "}"
 }
 
-func (s Set) Delete(v string) {
-	ss := *s.s
-	for i, e := range ss {
-		if e == v {
-			last := len(ss) - 1
-			ss[i] = ss[last]
-			*s.s = ss[:last]
-			return
-		}
-	}
+// IsEmpty returns true if s represents the empty set.
+func (s Set) IsEmpty() bool {
+	return len(*s.s) == 0
 }
 
+// Has returns true if e is an element of s.
 func (s Set) Has(v string) bool {
 	for _, e := range *s.s {
 		if e == v {
@@ -56,31 +61,28 @@ func (s Set) Has(v string) bool {
 	return false
 }
 
-func (s Set) IsEmpty() bool {
-	return len(*s.s) == 0
-}
-
-func (s Set) Len() int {
-	return len(*s.s)
-}
-
-func (s Set) Slice() []string {
-	return append([]string{}, *s.s...)
+// Add adds element e to Set s.
+// If e is already in s, s is unchanged.
+func (s Set) Add(v string) {
+	for _, e := range *s.s {
+		if e == v {
+			return
+		}
+	}
+	*s.s = append(*s.s, v)
 }
 
-func (s Set) String() string {
-	r := "{"
-	i := 0
-	for _, v := range *s.s {
-		if i > 0 {
-			r += ", "
+// Subset returns true if all elements of s1 are also in s2.
+func Subset(s1, s2 Set) bool {
+	for _, v := range *s1.s {
+		if !s2.Has(v) {
+			return false
 		}
-		r += fmt.Sprintf("%q", v)
-		i++
 	}
-	return r + "}"
+	return true
 }
 
+// Disjoint returns true if s1 and s2 have no elements in common.
 func Disjoint(s1, s2 Set) bool {
 	for _, v := range *s1.s {
 		if s2.Has(v) {
@@ -90,10 +92,13 @@ func Disjoint(s1, s2 Set) bool {
 	return true
 }
 
+// Equal returns true if s1 and s2 contain the same elements.
 func Equal(s1, s2 Set) bool {
-	return s1.Len() == s2.Len() && Subset(s1, s2)
+	return Subset(s1, s2) && Subset(s2, s1)
 }
 
+// Intersection constructs a new Set populated with the elements common to
+// both s1 and s2
 func Intersection(s1, s2 Set) Set {
 	var i []string
 	for _, v := range *s1.s {
@@ -104,15 +109,8 @@ func Intersection(s1, s2 Set) Set {
 	return Set{&i}
 }
 
-func Union(s1, s2 Set) Set {
-	s := s1.Slice()
-	u := Set{&s}
-	for _, v := range *s2.s {
-		u.Add(v)
-	}
-	return u
-}
-
+// Difference returns a new Set populated with elements that appear in s1
+// but not in s2.
 func Difference(s1, s2 Set) Set {
 	var d []string
 	for _, v := range *s1.s {
@@ -123,29 +121,13 @@ func Difference(s1, s2 Set) Set {
 	return Set{&d}
 }
 
-// Subset returns true if all elements of s1 are also in s2.
-func Subset(s1, s2 Set) bool {
-	for _, v := range *s1.s {
-		if !s2.Has(v) {
-			return false
-		}
-	}
-	return true
-}
-
-// SymmetricDifference constructs a new set populated with elements that are
-// members of s1 or s2 but not both.
-func SymmetricDifference(s1, s2 Set) Set {
-	var s []string
-	for _, v := range *s1.s {
-		if !s2.Has(v) {
-			s = append(s, v)
-		}
-	}
+// Union constructs a new Set populated with elements that appear in s1, s2,
+// or both.
+func Union(s1, s2 Set) Set {
+	s := append([]string{}, *s1.s...)
+	u := Set{&s}
 	for _, v := range *s2.s {
-		if !s1.Has(v) {
-			s = append(s, v)
-		}
+		u.Add(v)
 	}
-	return Set{&s}
+	return u
 }

data/tracks/javascript/exercises/luhn/example.js

@@ -1,63 +1,34 @@
 'use strict';
 
-function Luhn(number) {
-  this.checkDigit = number % 10;
-  this.addends = this.calculateAddends(number);
-  this.checksum = this.calculateChecksum(this.addends);
-  this.valid = this.determineIfValid(this.checksum);
-}
-
-Luhn.prototype = {
-  calculateAddends: function(number) {
-
-    var numberAsString = '' + number + '';
-    var numbers = numberAsString.split('');
-    var addends = [];
-
-    for (var i = 0; i < numbers.length; i++) {
-      var index = numbers.length - 1 - i;
-
-      var currentAddend = parseInt(numbers[index], 10);
-
-      if ((i + 1) % 2 === 0) {
-        currentAddend = currentAddend * 2;
-        if (currentAddend > 10) {
-          currentAddend = currentAddend - 9;
-        }
+function isValid(number) {
+  number = number.replace(/\s/g, '');
+  const digits = [...number];
+
+  const sum = digits
+    // convert to integers
+    .map(d => parseInt(d, 10))
+    // double even positions (odd indexes)
+    .map((d, i) => {
+      if (i % 2 !== 0) {
+        return d * 2;
       }
+      return d;
+    })
+    // limit to digits less than 10
+    .map(d => {
+      if (d > 9) {
+        return d - 9;
+      }
+      return d;
+    })
+    // sum all digits
+    .reduce((d, acc) => d + acc, 0);
 
-      addends.push(currentAddend);
-    }
-
-    return addends.reverse();
-
-  },
-  calculateChecksum: function(numbers) {
-    var sum = 0;
-    for (var i = 0; i < numbers.length; i++) {
-      sum += numbers[i];
-    }
-
-    return sum;
-  },
-  determineIfValid: function(sum) {
-    return (sum % 10 === 0);
-  }
-};
-
-Luhn.create = function(number) {
-  var finalNumber = number * 10;
-  var luhnNumber = new Luhn(finalNumber);
-  var index = 0;
-
-  while(!luhnNumber.valid) {
-    finalNumber = number * 10 + index;
-    luhnNumber = new Luhn(finalNumber);
-    if (luhnNumber.valid) { break; }
-    index += 1;
-  }
+  return sum > 0 && sum % 10 === 0;
+}
 
-  return finalNumber;
-};
+function Luhn(number) {
+  this.valid = isValid(number);
+}
 
-module.exports = Luhn;
+module.exports = Luhn;

data/tracks/javascript/exercises/luhn/luhn.spec.js

@@ -2,59 +2,34 @@ var Luhn = require('./luhn');
 
 describe('Luhn',function() {
 
-  it('check digit',function() {
-    var luhn = new Luhn(34567);
-    expect(luhn.checkDigit).toEqual(7);
-  });
-
-  xit('check digit again',function() {
-    var luhn = new Luhn(91370);
-    expect(luhn.checkDigit).toEqual(0);
-  });
-
-  xit('addends',function() {
-    var luhn = new Luhn(12121);
-    expect(luhn.addends).toEqual([1, 4, 1, 4, 1]);
-  });
-
-  xit('too large addend',function() {
-    var luhn = new Luhn(8631);
-    expect(luhn.addends).toEqual([7, 6, 6, 1]);
-  });
-
-  xit('checksum',function() {
-    var luhn = new Luhn(4913);
-    expect(luhn.checksum).toEqual(22);
-  });
-
-  xit('checksum again',function() {
-    var luhn = new Luhn(201773);
-    expect(luhn.checksum).toEqual(21);
+  it('single digit strings can not be valid', function () {
+    const luhn = new Luhn('1');
+    expect(luhn.valid).toEqual(false);
   });
 
-  xit('invalid number',function() {
-    var luhn = new Luhn(738);
+  xit('A single zero is invalid', function () {
+    const luhn = new Luhn('0');
     expect(luhn.valid).toEqual(false);
   });
 
-  xit('invalid number',function() {
-    var luhn = new Luhn(8739567);
+  xit('valid Canadian SIN', function () {
+    const luhn = new Luhn('046 454 286');
     expect(luhn.valid).toEqual(true);
   });
 
-  xit('create valid number',function() {
-    var number = Luhn.create(123);
-    expect(number).toEqual(1230);
+  xit('invalid Canadian SIN', function () {
+    const luhn = new Luhn('046 454 287');
+    expect(luhn.valid).toEqual(false);
   });
 
-  xit('create other valid number',function() {
-    var number = Luhn.create(873956);
-    expect(number).toEqual(8739567);
+  xit('invalid credit card', function () {
+    const luhn = new Luhn('8273 1232 7352 0569');
+    expect(luhn.valid).toEqual(false);
   });
 
-  xit('create yet another valid number',function() {
-    var number = Luhn.create(837263756);
-    expect(number).toEqual(8372637564);
+  xit('valid strings with a non-digit added become invalid', function () {
+    const luhn = new Luhn('046a 454 286');
+    expect(luhn.valid).toEqual(false);
   });
 
 });

data/tracks/ruby/README.md

@@ -1,5 +1,6 @@
 # xRuby
 
+[![Build Status](https://travis-ci.org/exercism/xruby.svg?branch=master)](https://travis-ci.org/exercism/xruby)
 [![Join the chat at https://gitter.im/exercism/xruby](https://badges.gitter.im/exercism/xruby.svg)](https://gitter.im/exercism/xruby?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)
 
 Exercism Exercises in Ruby

data/tracks/swift/docs/TESTS.md

@@ -32,21 +32,21 @@ Optionally, Xcode can create a third file for experimentation:
 3. At this point the project's file inspector should look similar to the following image. If the `HelloWorldTests` folder is closed, click on the disclosure triangle to reveal its contents.
 4. The items Package.swift, Configs, and Products are boilerplate that do not need modification.
 
-![file inspector](img/file-inspector.png)
+![file inspector](/docs/img/file-inspector.png)
 
 ### Running Tests with Xcode
 
 Select the test file from the file inspector. You can trigger tests by clicking on one of the diamonds in the gutter of the Tests Source file. The diamond next to the class definition will run all the tests, whereas the diamond next to each individual test will run only that test.
 
-![tests](img/tests.png)
+![tests](/docs/img/tests.png)
 
 Tests can also be invoked with Command-U, from the Test Inspector (Command-5), or from the sub-menu under the play button in the top bar. Red errors are normal at this stage.
 
-![failing tests](img/tests-fail.png)
+![failing tests](/docs/img/tests-fail.png)
 
 Once all the tests are marked with a green icon, congratulations, you have successfully completed the exercise! Now submit it to the Exercism website for review. If you are impossibly stuck, submit the exercise before it is complete to view how other users solved the exercise.
 
-![passing tests](img/tests-pass.png)
+![passing tests](/docs/img/tests-pass.png)
 
 *The Hello-World exercise is a very simple coding problem, but the complexity of Xcode can make even simple exercises complex. We can ignore most of this complexity, because we only need to edit one file. You can always regenerate the Xcode project if something goes wrong.*
 

metadata

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