sync prime-factors (#564)

Author: keiravillekode

exercises/practice/prime-factors/.meta/spec_generator.lua

@@ -0,0 +1,13 @@
+local function render_numbers(numbers)
+  return table.concat(numbers, ', ')
+end
+
+return {
+  module_name = 'prime_factors',
+
+  generate_test = function(case)
+    local template = [[
+      assert.are.same({ %s }, prime_factors(%s))]]
+    return template:format(render_numbers(case.expected), case.input.value)
+  end
+}

exercises/practice/prime-factors/.meta/tests.toml

@@ -1,19 +1,41 @@
-# This is an auto-generated file. Regular comments will be removed when this
-# file is regenerated. Regenerating will not touch any manually added keys,
-# so comments can be added in a "comment" key.
+# This is an auto-generated file.
+#
+# Regenerating this file via `configlet sync` will:
+# - Recreate every `description` key/value pair
+# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications
+# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion)
+# - Preserve any other key/value pair
+#
+# As user-added comments (using the # character) will be removed when this file
+# is regenerated, comments can be added via a `comment` key.
 
 [924fc966-a8f5-4288-82f2-6b9224819ccd]
 description = "no factors"
 
 [17e30670-b105-4305-af53-ddde182cb6ad]
 description = "prime number"
 
+[238d57c8-4c12-42ef-af34-ae4929f94789]
+description = "another prime number"
+
 [f59b8350-a180-495a-8fb1-1712fbee1158]
 description = "square of a prime"
 
+[756949d3-3158-4e3d-91f2-c4f9f043ee70]
+description = "product of first prime"
+
 [bc8c113f-9580-4516-8669-c5fc29512ceb]
 description = "cube of a prime"
 
+[7d6a3300-a4cb-4065-bd33-0ced1de6cb44]
+description = "product of second prime"
+
+[073ac0b2-c915-4362-929d-fc45f7b9a9e4]
+description = "product of third prime"
+
+[6e0e4912-7fb6-47f3-a9ad-dbcd79340c75]
+description = "product of first and second prime"
+
 [00485cd3-a3fe-4fbe-a64a-a4308fc1f870]
 description = "product of primes and non-primes"
 

exercises/practice/prime-factors/prime-factors_spec.lua

@@ -1,47 +1,51 @@
 local prime_factors = require('prime-factors')
 
 describe('prime-factors', function()
-  it('returns an empty array for 1', function()
+  it('no factors', function()
     assert.are.same({}, prime_factors(1))
   end)
 
-  it('factors 2', function()
+  it('prime number', function()
     assert.are.same({ 2 }, prime_factors(2))
   end)
 
-  it('factors 3', function()
+  it('another prime number', function()
     assert.are.same({ 3 }, prime_factors(3))
   end)
 
-  it('factors 4', function()
-    assert.are.same({ 2, 2 }, prime_factors(4))
+  it('square of a prime', function()
+    assert.are.same({ 3, 3 }, prime_factors(9))
   end)
 
-  it('factors 6', function()
-    assert.are.same({ 2, 3 }, prime_factors(6))
+  it('product of first prime', function()
+    assert.are.same({ 2, 2 }, prime_factors(4))
   end)
 
-  it('factors 8', function()
+  it('cube of a prime', function()
     assert.are.same({ 2, 2, 2 }, prime_factors(8))
   end)
 
-  it('factors 9', function()
-    assert.are.same({ 3, 3 }, prime_factors(9))
-  end)
-
-  it('factors 27', function()
+  it('product of second prime', function()
     assert.are.same({ 3, 3, 3 }, prime_factors(27))
   end)
 
-  it('factors 625', function()
+  it('product of third prime', function()
     assert.are.same({ 5, 5, 5, 5 }, prime_factors(625))
   end)
 
-  it('factors 901255', function()
+  it('product of first and second prime', function()
+    assert.are.same({ 2, 3 }, prime_factors(6))
+  end)
+
+  it('product of primes and non-primes', function()
+    assert.are.same({ 2, 2, 3 }, prime_factors(12))
+  end)
+
+  it('product of primes', function()
     assert.are.same({ 5, 17, 23, 461 }, prime_factors(901255))
   end)
 
-  it('factors 93819012551', function()
+  it('factors include a large prime', function()
     assert.are.same({ 11, 9539, 894119 }, prime_factors(93819012551))
   end)
 end)