jeka 0.1.1 → 0.2.0

data/test/example/01_bubble_sort/_algorithm.yaml

@@ -1,12 +0,0 @@
-name: Bubble Sort
-type: Sorting
-description: {
-  file: _description.textile
-}
-references: {
-  file: _references.textile
-}
-complexity: O(n^2)
-implementations:
-  - ruby
-  - cpp

data/test/example/01_bubble_sort/_description.textile

@@ -1 +0,0 @@
-Bubble sort, also known as sinking sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm gets its name from the way smaller elements "bubble" to the top of the list. Because it only uses comparisons to operate on elements, it is a comparison sort. The equally simple insertion sort has better performance than bubble sort, so some have suggested no longer teaching the bubble sort.

data/test/example/01_bubble_sort/_references.textile

@@ -1 +0,0 @@
-http://en.wikipedia.org/wiki/Bubble_sort

data/test/example/01_bubble_sort/_tests/test_01.yaml

@@ -1,3 +0,0 @@
-name: Sequencia decrescente
-input: 9 9 8 7 6 5 4 3 2 1
-output: 1 2 3 4 5 6 7 8 9

data/test/example/01_bubble_sort/_tests/test_02.yaml

@@ -1,3 +0,0 @@
-name: Sequencia aleatoria
-input: 9 8 9 1 3 4 7 6 2 5
-output: 1 2 3 4 5 6 7 8 9

data/test/example/01_bubble_sort/cpp/_implementation.yaml

@@ -1,9 +0,0 @@
-language: c++
-source: bubble.cpp
-comment: Implementação simples em C++
-build: {
-  command: g++ -o $bubble $bubble.cpp 
-}
-run: {
-  command: ./$bubble
-}

data/test/example/01_bubble_sort/ruby/_implementation.yaml

@@ -1,6 +0,0 @@
-language: ruby
-source: bubble.rb
-comment: Implementação simples em Ruby
-run: {
-  command: ruby $bubble.rb
-}

data/test/site/algorithm.textile

@@ -1,27 +0,0 @@
----
-layout: algorithm
-title: Bubble Sort
----
-
-h1. Bubble Sort
-
-h2. Sorting
-
-h3. Descrição
-
-Bubble sort, also known as sinking sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm gets its name from the way smaller elements "bubble" to the top of the list. Because it only uses comparisons to operate on elements, it is a comparison sort. The equally simple insertion sort has better performance than bubble sort, so some have suggested no longer teaching the bubble sort.
-
-h3. Complexidade
-
-O(n^2)
-
-h3. Referências
-
-http://en.wikipedia.org/wiki/Bubble_sort
-
-h3. Implementações
-
-|_. Linguagem |_. Comentário |_. Código fonte |_. Tempo de execução médio |
-| c++ | Implementação simples em C++ | "ver":../../../../implementations/2011/01/01/Implementa%C3%A7%C3%A3o_simples_em_C++.html | 0.003s |
-| ruby | Implementação simples em Ruby | "ver":../../../../implementations/2011/01/01/Implementa%C3%A7%C3%A3o_simples_em_Ruby.html | 0.006500000000000001s |
-

data/test/site/cpp.textile

@@ -1,46 +0,0 @@
----
-layout: implementation
-title: Bubble Sort
----
-
-{% highlight ruby %}
-#include <iostream>
-#include <vector>
-#include <stdlib.h>
-
-using namespace std;
-
-vector<int> bubble_sort(vector<int> numbers) {
-  for(int i = 0; i < 9; i++) {
-    for(int j = i; j < 9; j++) {
-      if (numbers[i] > numbers[j]) {
-        int temp = numbers[i];
-        numbers[i] = numbers[j];
-        numbers[j] = temp;
-      }
-    }
-  }
-  return numbers;
-}
-
-int main() {
-  vector<int> numbers;
-  int max, v;
-  
-  // Reading the input
-  cin >> max;
-  for (int i = 0; i < max; i++) {
-    cin >> v;
-    numbers.push_back(v);
-  }
-  
-  numbers = bubble_sort(numbers);
-  
-  // Printing the output
-  for (int i=0; i< 8; i++)
-    cout << numbers[i] << " ";
-  cout << numbers[8] << endl;
-    
-  return 0;
-}
-{% endhighlight %}

data/test/site/ruby.textile

@@ -1,28 +0,0 @@
----
-layout: implementation
-title: Bubble Sort
----
-
-{% highlight ruby %}
-def bubble(numbers)
-  for i in (0..numbers.size-1)
-    for j in (i..numbers.size-1)
-      if numbers[i] > numbers[j]
-        temp = numbers[i]
-        numbers[i] = numbers[j]
-        numbers[j] = temp
-      end
-    end
-  end
-  numbers
-end
-
-# Reading the input
-input = gets
-input = input.split(' ')[1..-1].map {|c| c.to_i }
-
-bubble(input)
-
-# Printing the output
-puts input.inject {|output, n| "#{output} #{n}"}
-{% endhighlight %}

data/test/test_make.rb

@@ -1,34 +0,0 @@
-require 'helper'
-
-class TestMake < Test::Unit::TestCase
-  
-  context "The example" do
-    
-    should "pass all the tests" do
-      make = Jeka::Make.new(File.join(File.dirname(__FILE__), "example", "01_bubble_sort"))
-      make.build
-      make.test do |i, t, r|
-        assert r
-      end
-    end
-    
-    should "generate the web pages" do
-      falgorithm = File.new(File.join(File.dirname(__FILE__), "site", "algorithm.textile"), "r")
-      falgorithm = falgorithm.readlines.join()
-      falgorithm = falgorithm.gsub(/(\d)*\.(\d)*s/, "*")
-      fcpp = File.new(File.join(File.dirname(__FILE__), "site", "cpp.textile"), "r")
-      fcpp = fcpp.readlines.join()
-      fruby = File.new(File.join(File.dirname(__FILE__), "site", "ruby.textile"), "r")
-      fruby = fruby.readlines.join()
-      make = Jeka::Make.new(File.join(File.dirname(__FILE__), "example", "01_bubble_sort"))
-      make.build
-      make.benchmark(1)
-      algorithm, implementations = make.generate_site
-      assert_equal falgorithm, algorithm[1].gsub(/(\d)*\.(\d)*s/, "*")
-      assert_equal fruby, implementations[0][1]
-      assert_equal fcpp, implementations[1][1]
-    end
-    
-  end
-  
-end

data/test/test_test.rb

@@ -1,16 +0,0 @@
-require 'helper'
-
-class TestTest < Test::Unit::TestCase
-  
-  context "The example" do
-    
-    should "open the bubble sort tests" do
-      test = Jeka::Test.new(File.join(File.dirname(__FILE__), "example", "01_bubble_sort", "_tests", "test_01.yaml"))
-      assert_equal test.name, "Sequencia decrescente"
-      assert_equal test.input, "9 9 8 7 6 5 4 3 2 1"
-      assert_equal test.output, "1 2 3 4 5 6 7 8 9"
-    end
-    
-  end
-  
-end