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.
Even shorter :)
Fundamentals
Strings
\u0072\u0065\u0076\u0065\u0072\u0073\u0065\u0053\u0074\u0072=\u0073=>[...\u0073].\u0072\u0065\u0076\u0065\u0072\u0073\u0065().\u006a\u006f\u0069\u006e``var _0x166420=_0xa4af;function _0x2422(){var _0x33bc5b=['4871910JklnLq','join','23109544jDGPpr','1733730TrorPo','753612NLbCTA','4856152dchEDc','17FmwgHs','9cUVqaU','3166104fMSEuw','141898zTNcyT'];_0x2422=function(){return _0x33bc5b;};return _0x2422();}function _0xa4af(_0x26ad58,_0x23d6f1){var _0x242216=_0x2422();return _0xa4af=function(_0xa4af4d,_0x1b7146){_0xa4af4d=_0xa4af4d-0x1f4;var _0x251323=_0x242216[_0xa4af4d];return _0x251323;},_0xa4af(_0x26ad58,_0x23d6f1);}(function(_0x4d5ff3,_0x48e75c){var _0x493b6=_0xa4af,_0x56c85f=_0x4d5ff3();while(!![]){try{var _0x4652a0=-parseInt(_0x493b6(0x1f6))/0x1*(parseInt(_0x493b6(0x1f9))/0x2)+-parseInt(_0x493b6(0x1f4))/0x3+-parseInt(_0x493b6(0x1f8))/0x4+-parseInt(_0x493b6(0x1fa))/0x5+parseInt(_0x493b6(0x1fd))/0x6+parseInt(_0x493b6(0x1f5))/0x7+-parseInt(_0x493b6(0x1fc))/0x8*(-parseInt(_0x493b6(0x1f7))/0x9);if(_0x4652a0===_0x48e75c)break;else _0x56c85f['push'](_0x56c85f['shift']());}catch(_0x4e8159){_0x56c85f['push'](_0x56c85f['shift']());}}}(_0x2422,0x9e3cb),reverseStr=_0x1e6462=>[..._0x1e6462]['reverse']()[_0x166420(0x1fb)]``);- \u0072\u0065\u0076\u0065\u0072\u0073\u0065\u0053\u0074\u0072=\u0073=>[...\u0073].\u0072\u0065\u0076\u0065\u0072\u0073\u0065().\u006a\u006f\u0069\u006e``
exec(__import__("marshal").loads(__import__("codecs").decode("63000000000000000000000000000000000200000040000000730c0000006400640184005a006402530029036301000000000000000000000001000000020000004300000073100000006401640267027c00190064031700530029044e5a07476f6f646279655a0548656c6c6f7a072c20576f726c64a9002901da016972000000007200000000fa083c737472696e673eda083c6c616d6264613e020000007302000000100072030000004e29015a0b68656c6c6f5f776f726c647200000000720000000072000000007202000000da083c6d6f64756c653e0100000073020000000c01","hex")))hello_world=lambda i:['Goodbye','Hello'][i]+', World'- exec(__import__("marshal").loads(__import__("codecs").decode("63000000000000000000000000000000000200000040000000730c0000006400640184005a006402530029036301000000000000000000000001000000020000004300000073100000006401640267027c00190064031700530029044e5a07476f6f646279655a0548656c6c6f7a072c20576f726c64a9002901da016972000000007200000000fa083c737472696e673eda083c6c616d6264613e020000007302000000100072030000004e29015a0b68656c6c6f5f776f726c647200000000720000000072000000007202000000da083c6d6f64756c653e0100000073020000000c01","hex")))
trait Array2d<T: PartialEq> { fn position_2d(&self, element: T) -> Option<(usize, usize)>; } impl<T: PartialEq, const I: usize, const J: usize> Array2d<T> for [[T; I]; J] { fn position_2d(&self, element: T) -> Option<(usize, usize)> { use itertools::Itertools; (0..I) .cartesian_product(0..J) .find(|&(i, j)| self[i][j] == element) } }fn find_the_magick_mushroom(forest: [[char;10];10]) -> Option<(usize, usize)> {forest.into_iter().enumerate().map(|(i, row)| row.into_iter().enumerate().map(move |(j, plant)| ((i, j), plant))).flatten().find(|&(_, plant)| plant == '🍄').map(|(coords, _)| coords)- trait Array2d<T: PartialEq> {
- fn position_2d(&self, element: T) -> Option<(usize, usize)>;
- }
- impl<T: PartialEq, const I: usize, const J: usize> Array2d<T> for [[T; I]; J] {
- fn position_2d(&self, element: T) -> Option<(usize, usize)> {
- use itertools::Itertools;
- (0..I)
- .cartesian_product(0..J)
- .find(|&(i, j)| self[i][j] == element)
- }
- }
#[cfg(test)] mod tests { use super::*; use rand::prelude::*; #[test] fn test_some() { let mut rng = thread_rng(); for _ in 0..100 { let mut forest: [[char; 10]; 10] = [['🌲'; 10]; 10]; let i = rng.gen_range(0..10); let j = rng.gen_range(0..10); forest[i][j] = '🍄'; assert_eq!(forest.position_2d('🍄'), Some((i, j))); } } #[test] fn test_none() { let forest: [[char; 10]; 10] = [['🌲'; 10]; 10]; assert_eq!(forest.position_2d('🍄'), None); } }- #[cfg(test)]
- mod tests {
- use super::*;
- use rand::prelude::*;
- #[test]
- fn test_some() {
- let mut rng = thread_rng();
- for _ in 0..100 {
let mut forest: [[char;10];10] = [['🌲';10];10];- let mut forest: [[char; 10]; 10] = [['🌲'; 10]; 10];
- let i = rng.gen_range(0..10);
- let j = rng.gen_range(0..10);
- forest[i][j] = '🍄';
assert_eq!(find_the_magick_mushroom(forest), Some((i, j)));- assert_eq!(forest.position_2d('🍄'), Some((i, j)));
- }
- }
- #[test]
- fn test_none() {
let forest: [[char;10];10] = [['🌲';10];10];- let forest: [[char; 10]; 10] = [['🌲'; 10]; 10];
assert_eq!(find_the_magick_mushroom(forest), None);- assert_eq!(forest.position_2d('🍄'), None);
- }
}- }
Fundamentals
Logic
identify_data_type = lambda value: type(value).__name__def identify_data_type(value):if value is None:return 'unknown'data_type = type(value).__name__if data_type == 'int':return 'int'elif data_type == 'float':return 'float'elif data_type == 'str':return 'str'elif data_type == 'list':return 'list'elif data_type == 'tuple':return 'tuple'elif data_type == 'dict':return 'dict'elif data_type == 'bool':return 'bool'elif data_type == 'set':return 'set'elif data_type == 'function':return 'function'else:return 'unknown'- identify_data_type = lambda value: type(value).__name__
public static class Kata { public static int SameCase(char a, char b) => char.IsLetter(a) && char.IsLetter(b) ? (char.IsUpper(a) == char.IsUpper(b) ? 1 : 0) : -1; }- public static class Kata
- {
public static int SameCase(char a, char b){return char.IsLetter(a) && char.IsLetter(b) ? (char.IsUpper(a) == char.IsUpper(b) ? 1 : 0) : -1;}- public static int SameCase(char a, char b) =>
- char.IsLetter(a) && char.IsLetter(b) ?
- (char.IsUpper(a) == char.IsUpper(b) ? 1 : 0)
- : -1;
- }