Kumite

Show My Kumite Only?
Filter by Language:
Kumite (ko͞omiˌtā) is the practice of taking techniques learned from Kata and applying them through the act of freestyle sparring.
You can create a new kumite by providing some initial code and optionally some test cases. From there other warriors can spar with you, by enhancing, refactoring and translating your code. There is no limit to how many warriors you can spar with.
A great use for kumite is to begin an idea for a kata as one. You can collaborate with other code warriors until you have it right, then you can convert it to a kata.

wichuFailed Tests

tryParseInt

let tryParseInt s = 
   try
      let i = System.Int32.Parse s
      Some i
   with _ -> None

let v1 = tryParseInt "1"
printfn "%O" v1
printfn "%O" v1.Value
printfn "%O" v1.IsSome
printfn "%O" v1.IsNone

printfn ""

let v2 = tryParseInt "?"
printfn "%O" v2
printfn "%O" v2.IsSome
printfn "%O" v2.IsNone

Unnamed

C++ testing bug?

int f() { }
Describe(t) {
  It(t1) {
    Assert::That(true, Equals(true));
  }
  It(t2) {
    Assert::That(f(), Equals(0));
    Assert::That(false, Equals(true));
  }
};

wichuFailed Tests

FizzBuzz inline

[for i in 1 .. 30 -> if i % 3 = 0 && i % 5 = 0 then "FizzBuzz" elif i % 3 = 0 then "Fizz" elif i % 5 = 0 then "Buzz" else i.ToString()] |> List.map(fun v -> printfn "%s" v)

wichuFailed Tests

Function Composition 2

let add n x = x + n
let times n x = x * n

let f1 = add 1 >> times 2
let f2 = add 1 << times 2

printfn "%i" (f1 2) // (2+1)*2
printfn "%i" (f2 2) // 2*2+1

wichuFailed Tests

Function Composition

let add x y = x + y

let add1 = add 1
let add2 = add 2
let add3 = add 3
let add1and2and3 = add1 >> add2 >> add3

printfn "%i" (0 |> add1and2and3)

wichuFailed Tests

Partial Application

let add x y = x + y


let add1 = add 1
let add2 = add 2
let add3 = add 3


printfn "%i" (add1 1)
printfn "%i" (add2 1)
printfn "%i" (add3 1)

SpaceBisonvs.kongwei

Trollderim's Kumite #1

Code

Diff

public class Primes {
  public static boolean isAPrime(int number) {    
    if (number == 1) {
      return false;
    }
  
    if (number == 2) {
      return true;
    }
    
    if (number % 2 == 0) {
      return false;
    }
  
    for (int i = 3; i*i <= number; i += 2) {
      if (number % i == 0)
        return false;
    }
    
    return true;
  }
}

Test Cases

Diff

import org.junit.Test;
import static org.junit.Assert.assertEquals;
import org.junit.runners.JUnit4;
import java.util.Random;

public class SolutionTest {
    private static final Random RANDOM = new Random();

    @Test
    public void twoShouldBeAPrime() {
      testPrime(2, true);
    }

    @Test
    public void fourShouldNotBeAPrime() {
      testPrime(4, false);
    }
    
    @Test
    public void aSquareShouldNotAPrime() {
      for (int i = 0; i < 10000; ++i) {
        int randomNumber = RANDOM.nextInt(Short.MAX_VALUE) + 2;
        int numberToCheck = randomNumber * randomNumber;
        testPrime(numberToCheck, false);
      }
    }
    
    @Test
    public void aProductOfTwoIntegersShouldNotBeAPrime() {
      for (int i = 0; i < 100000; ++i) {
        int a = RANDOM.nextInt(Short.MAX_VALUE) + 2;
        int b = RANDOM.nextInt(Short.MAX_VALUE) + 2;
        int numberToCheck = a * b;
        testPrime(numberToCheck, false);
      }
    }
    
    private static void testPrime(int numberToCheck, boolean expected) {     
      boolean actual = Primes.isAPrime(numberToCheck);
      assertEquals(Integer.toString(numberToCheck), expected, actual);
    }
}

Recent Moves:

kongweivs.Trollderim

Trollderim's Kumite #1

Code

Diff

public class Primes {
  public static boolean isAPrime(int number) {
    for (int i=2;i*i<=number;i++)
    {
      if (number % i == 0)
        return false;
    }
    
    return true;
  }
}

SpaceBisonvs.isbergFailed Tests

Trollderim's Kumite #1

Code

Diff

public class Primes {
  public static boolean isAPrime(int number) {
    if (number == 2) return true;
    if (number % 2 == 0) return false;
    if (Math.sqrt(number) % 1 == 0) return false;
    return true;
  }
}

Test Cases

Diff

import org.junit.Test;
import static org.junit.Assert.assertEquals;
import org.junit.runners.JUnit4;
import java.util.*;

public class SolutionTest {
    private static final Random RANDOM = new Random();

    @Test
    public void twoShouldBeAPrime() {
      testPrime(2, true);
    }

    @Test
    public void fourShouldNotBeAPrime() {
      testPrime(4, false);
    }
    
    @Test
    public void aSquareShouldNotAPrime() {
      for (int i = 0; i < 10; ++i) {
        int randomNumber = RANDOM.nextInt(Short.MAX_VALUE);
        int numberToCheck = randomNumber * randomNumber;
        testPrime(numberToCheck, false);
      }
    }
    
    @Test
    public void aProductOfTwoIntegersShouldNotBeAPrime() {
      for (int i = 0; i < 10; ++i) {
        int a = RANDOM.nextInt(Short.MAX_VALUE);
        int b = RANDOM.nextInt(Short.MAX_VALUE);
        int numberToCheck = a * b;
        testPrime(numberToCheck, false);
      }
    }
    
    private static void testPrime(int numberToCheck, boolean expected) {     
      boolean actual = Primes.isAPrime(numberToCheck);
      assertEquals(Integer.toString(numberToCheck), expected, actual);
    }
}

kongweivs.metasean

Fizz Buzzy

Code

Diff

function fizzbuzzy(n) {
  var three = Math.floor(n/3)+1;
  var five = Math.floor(n/5)+1;
  return three+five;
}

Filter by Language:

Confirm