Rename packages

Author: DanielMichalski

pom.xml

@@ -4,7 +4,7 @@
 		 xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
 	<modelVersion>4.0.0</modelVersion>
 
-	<groupId>pl.dmichalski</groupId>
+	<groupId>com.danielmichalski</groupId>
 	<artifactId>algorithms-and-data-structures-in-kotlin</artifactId>
 	<version>1.0-SNAPSHOT</version>
 	<name>Algorithms and data structures in Kotlin</name>

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_01_sum_from_1_to_n/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_01_sum_from_1_to_n/Runner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._01_sum_from_1_to_n
+package com.danielmichalski.algorithms.algorithms._01_sum_from_1_to_n
 
 /**
  * Write a function which takes n number and returns

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_01_sum_from_1_to_n/SumCounterService1.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_01_sum_from_1_to_n/SumCounterService1.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._01_sum_from_1_to_n
+package com.danielmichalski.algorithms.algorithms._01_sum_from_1_to_n
 
 internal class SumCounterService1 {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_01_sum_from_1_to_n/SumCounterService2.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_01_sum_from_1_to_n/SumCounterService2.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._01_sum_from_1_to_n
+package com.danielmichalski.algorithms.algorithms._01_sum_from_1_to_n
 
 internal class SumCounterService2 {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_02_count_chars_in_text/CharCounterService1.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_02_count_chars_in_text/CharCounterService1.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._02_count_chars_in_text
+package com.danielmichalski.algorithms.algorithms._02_count_chars_in_text
 
 internal class CharCounterService1 {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_02_count_chars_in_text/CharCounterService2.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_02_count_chars_in_text/CharCounterService2.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._02_count_chars_in_text
+package com.danielmichalski.algorithms.algorithms._02_count_chars_in_text
 
 internal class CharCounterService2 {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_02_count_chars_in_text/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_02_count_chars_in_text/Runner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._02_count_chars_in_text
+package com.danielmichalski.algorithms.algorithms._02_count_chars_in_text
 
 /**
  * Write a function which takes in a  string and returns

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_03_is_anagram/AnagramService1.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_03_is_anagram/AnagramService1.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._03_is_anagram
+package com.danielmichalski.algorithms.algorithms._03_is_anagram
 
 internal class AnagramService1 {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_03_is_anagram/AnagramService2.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_03_is_anagram/AnagramService2.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._03_is_anagram
+package com.danielmichalski.algorithms.algorithms._03_is_anagram
 
 internal class AnagramService2 {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_03_is_anagram/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_03_is_anagram/Runner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._03_is_anagram
+package com.danielmichalski.algorithms.algorithms._03_is_anagram
 
 /**
  * Write a function to determine if the second string

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_04_sum_zero/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_04_sum_zero/Runner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._04_sum_zero
+package com.danielmichalski.algorithms.algorithms._04_sum_zero
 
 /**
  * Write a function called sumZero which accepts a sorted

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_04_sum_zero/SumToZeroService1.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_04_sum_zero/SumToZeroService1.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._04_sum_zero
+package com.danielmichalski.algorithms.algorithms._04_sum_zero
 
 internal class SumToZeroService1 {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_04_sum_zero/SumToZeroService2.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_04_sum_zero/SumToZeroService2.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._04_sum_zero
+package com.danielmichalski.algorithms.algorithms._04_sum_zero
 
 internal class SumToZeroService2 {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_05_count_unique_values/CountUniqueValuesService.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_05_count_unique_values/CountUniqueValuesService.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._05_count_unique_values
+package com.danielmichalski.algorithms.algorithms._05_count_unique_values
 
 internal class CountUniqueValuesService {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_05_count_unique_values/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_05_count_unique_values/Runner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._05_count_unique_values
+package com.danielmichalski.algorithms.algorithms._05_count_unique_values
 
 /**
  * Write a function called countUniqueValues which accepts

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_06_max_subarray_sum/MaxSubarraySumService1.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_06_max_subarray_sum/MaxSubarraySumService1.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._06_max_subarray_sum
+package com.danielmichalski.algorithms.algorithms._06_max_subarray_sum
 
 internal class MaxSubarraySumService1 {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_06_max_subarray_sum/MaxSubarraySumService2.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_06_max_subarray_sum/MaxSubarraySumService2.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._06_max_subarray_sum
+package com.danielmichalski.algorithms.algorithms._06_max_subarray_sum
 
 import kotlin.math.max
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_06_max_subarray_sum/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_06_max_subarray_sum/Runner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._06_max_subarray_sum
+package com.danielmichalski.algorithms.algorithms._06_max_subarray_sum
 
 /**
  * Write a function called maxSubarraySum which accepts

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_07_binary_search/BinarySearchService.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_07_binary_search/BinarySearchService.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._07_binary_search
+package com.danielmichalski.algorithms.algorithms._07_binary_search
 
 internal class BinarySearchService {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_07_binary_search/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_07_binary_search/Runner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._07_binary_search
+package com.danielmichalski.algorithms.algorithms._07_binary_search
 
 /**
  * Given a sorted array of integer, write a function

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_07_binary_search/SearchService.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_07_binary_search/SearchService.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._07_binary_search
+package com.danielmichalski.algorithms.algorithms._07_binary_search
 
 internal class SearchService {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_08_naive_string_search/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_08_naive_string_search/Runner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._08_naive_string_search
+package com.danielmichalski.algorithms.algorithms._08_naive_string_search
 
 /**
  * Write a function called countNumberOfAppearances, that accepts

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_08_naive_string_search/StringSearchService.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_08_naive_string_search/StringSearchService.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._08_naive_string_search
+package com.danielmichalski.algorithms.algorithms._08_naive_string_search
 
 internal class StringSearchService {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/SortService.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/SortService.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting
+package com.danielmichalski.algorithms.algorithms._09_sorting
 
 interface SortService {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/SortServiceRunner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/SortServiceRunner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting
+package com.danielmichalski.algorithms.algorithms._09_sorting
 
 class SortServiceRunner {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/bubble/BubbleSortOptimizedService.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/bubble/BubbleSortOptimizedService.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting.bubble
+package com.danielmichalski.algorithms.algorithms._09_sorting.bubble
 
-import pl.dmichalski.algorithms.algorithms._09_sorting.SortService
+import com.danielmichalski.algorithms.algorithms._09_sorting.SortService
 
 /**
  * Optimized bubble sort algorithm.

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/bubble/BubbleSortService.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/bubble/BubbleSortService.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting.bubble
+package com.danielmichalski.algorithms.algorithms._09_sorting.bubble
 
-import pl.dmichalski.algorithms.algorithms._09_sorting.SortService
+import com.danielmichalski.algorithms.algorithms._09_sorting.SortService
 
 /**
  * Bubble sort algorithm.

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/bubble/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/bubble/Runner.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting.bubble
+package com.danielmichalski.algorithms.algorithms._09_sorting.bubble
 
-import pl.dmichalski.algorithms.algorithms._09_sorting.SortServiceRunner
+import com.danielmichalski.algorithms.algorithms._09_sorting.SortServiceRunner
 
 /**
  * Write a function called sort, that accepts integer array

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/insertion/InsertionSortService.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/insertion/InsertionSortService.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting.insertion
+package com.danielmichalski.algorithms.algorithms._09_sorting.insertion
 
-import pl.dmichalski.algorithms.algorithms._09_sorting.SortService
+import com.danielmichalski.algorithms.algorithms._09_sorting.SortService
 
 /**
  * Insertion sort algorithm.

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/insertion/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/insertion/Runner.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting.insertion
+package com.danielmichalski.algorithms.algorithms._09_sorting.insertion
 
-import pl.dmichalski.algorithms.algorithms._09_sorting.SortServiceRunner
+import com.danielmichalski.algorithms.algorithms._09_sorting.SortServiceRunner
 
 /**
  * Write a function called sort, that accepts integer array

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/merge/MergeSortService.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/merge/MergeSortService.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting.merge
+package com.danielmichalski.algorithms.algorithms._09_sorting.merge
 
-import pl.dmichalski.algorithms.algorithms._09_sorting.SortService
+import com.danielmichalski.algorithms.algorithms._09_sorting.SortService
 
 /**
  * Merge sort algorithm.

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/merge/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/merge/Runner.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting.merge
+package com.danielmichalski.algorithms.algorithms._09_sorting.merge
 
-import pl.dmichalski.algorithms.algorithms._09_sorting.SortServiceRunner
+import com.danielmichalski.algorithms.algorithms._09_sorting.SortServiceRunner
 
 /**
  * Write a function called sort, that accepts integer array

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/quick/QuickSortService.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/quick/QuickSortService.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting.quick
+package com.danielmichalski.algorithms.algorithms._09_sorting.quick
 
-import pl.dmichalski.algorithms.algorithms._09_sorting.SortService
+import com.danielmichalski.algorithms.algorithms._09_sorting.SortService
 
 /**
  * Quick sort algorithm.

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/quick/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/quick/Runner.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting.quick
+package com.danielmichalski.algorithms.algorithms._09_sorting.quick
 
-import pl.dmichalski.algorithms.algorithms._09_sorting.SortServiceRunner
+import com.danielmichalski.algorithms.algorithms._09_sorting.SortServiceRunner
 
 /**
  * Write a function called sort, that accepts integer array

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/radix/RadixSortService.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/radix/RadixSortService.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting.radix
+package com.danielmichalski.algorithms.algorithms._09_sorting.radix
 
-import pl.dmichalski.algorithms.algorithms._09_sorting.SortService
+import com.danielmichalski.algorithms.algorithms._09_sorting.SortService
 import kotlin.math.*
 
 /**

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/radix/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/radix/Runner.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting.radix
+package com.danielmichalski.algorithms.algorithms._09_sorting.radix
 
-import pl.dmichalski.algorithms.algorithms._09_sorting.SortServiceRunner
+import com.danielmichalski.algorithms.algorithms._09_sorting.SortServiceRunner
 
 /**
  * Write a function called sort, that accepts integer array

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/selection/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/selection/Runner.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting.selection
+package com.danielmichalski.algorithms.algorithms._09_sorting.selection
 
-import pl.dmichalski.algorithms.algorithms._09_sorting.SortServiceRunner
+import com.danielmichalski.algorithms.algorithms._09_sorting.SortServiceRunner
 
 /**
  * Write a function called sort, that accepts integer array

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_09_sorting/selection/SelectionSortService.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_09_sorting/selection/SelectionSortService.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.algorithms._09_sorting.selection
+package com.danielmichalski.algorithms.algorithms._09_sorting.selection
 
-import pl.dmichalski.algorithms.algorithms._09_sorting.SortService
+import com.danielmichalski.algorithms.algorithms._09_sorting.SortService
 
 /**
  * Selection sort algorithm.

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_10_fibonacci/FibonacciMemoizedService2.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_10_fibonacci/FibonacciMemoizedService2.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._10_fibonacci
+package com.danielmichalski.algorithms.algorithms._10_fibonacci
 
 internal class FibonacciMemoizedService2 {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_10_fibonacci/FibonacciRecursionService1.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_10_fibonacci/FibonacciRecursionService1.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._10_fibonacci
+package com.danielmichalski.algorithms.algorithms._10_fibonacci
 
 internal class FibonacciRecursionService1 {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_10_fibonacci/FibonacciTabulatedService3.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_10_fibonacci/FibonacciTabulatedService3.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._10_fibonacci
+package com.danielmichalski.algorithms.algorithms._10_fibonacci
 
 internal class FibonacciTabulatedService3 {
 

src/main/kotlin/pl/dmichalski/algorithms/algorithms/_10_fibonacci/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/algorithms/_10_fibonacci/Runner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.algorithms._10_fibonacci
+package com.danielmichalski.algorithms.algorithms._10_fibonacci
 
 /**
  * Write a function which takes n number and returns

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_01_singly_linked_list/Node.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_01_singly_linked_list/Node.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.data_structures._01_singly_linked_list
+package com.danielmichalski.algorithms.data_structures._01_singly_linked_list
 
 class Node(private var value: String) {
 

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_01_singly_linked_list/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_01_singly_linked_list/Runner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.data_structures._01_singly_linked_list
+package com.danielmichalski.algorithms.data_structures._01_singly_linked_list
 
 object Runner {
 

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_01_singly_linked_list/SinglyLinkedList.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_01_singly_linked_list/SinglyLinkedList.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.data_structures._01_singly_linked_list
+package com.danielmichalski.algorithms.data_structures._01_singly_linked_list
 
 class SinglyLinkedList {
 

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_02_doubly_linked_list/DoublyLinkedList.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_02_doubly_linked_list/DoublyLinkedList.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.data_structures._02_doubly_linked_list
+package com.danielmichalski.algorithms.data_structures._02_doubly_linked_list
 
 class DoublyLinkedList {
 

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_02_doubly_linked_list/Node.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_02_doubly_linked_list/Node.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.data_structures._02_doubly_linked_list
+package com.danielmichalski.algorithms.data_structures._02_doubly_linked_list
 
 class Node(private var value: String) {
 

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_02_doubly_linked_list/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_02_doubly_linked_list/Runner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.data_structures._02_doubly_linked_list
+package com.danielmichalski.algorithms.data_structures._02_doubly_linked_list
 
 object Runner {
 

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_04_queue/Node.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_03_stack/Node.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.data_structures._04_queue
+package com.danielmichalski.algorithms.data_structures._03_stack
 
 class Node(private var value: String) {
 
@@ -28,4 +28,5 @@ class Node(private var value: String) {
         return "Node(value='$value', next=$next)"
     }
 
+
 }

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_03_stack/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_03_stack/Runner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.data_structures._03_stack
+package com.danielmichalski.algorithms.data_structures._03_stack
 
 object Runner {
 

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_03_stack/Stack.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_03_stack/Stack.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.data_structures._03_stack
+package com.danielmichalski.algorithms.data_structures._03_stack
 
-import pl.dmichalski.algorithms.data_structures._01_singly_linked_list.Node
+import com.danielmichalski.algorithms.data_structures._01_singly_linked_list.Node
 
 class Stack {
 

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_03_stack/Node.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_04_queue/Node.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.data_structures._03_stack
+package com.danielmichalski.algorithms.data_structures._04_queue
 
 class Node(private var value: String) {
 
@@ -28,5 +28,4 @@ class Node(private var value: String) {
         return "Node(value='$value', next=$next)"
     }
 
-
 }

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_04_queue/Queue.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_04_queue/Queue.kt

@@ -1,6 +1,6 @@
-package pl.dmichalski.algorithms.data_structures._04_queue
+package com.danielmichalski.algorithms.data_structures._04_queue
 
-import pl.dmichalski.algorithms.data_structures._01_singly_linked_list.Node
+import com.danielmichalski.algorithms.data_structures._01_singly_linked_list.Node
 
 class Queue {
 

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_04_queue/Runner.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_04_queue/Runner.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.data_structures._04_queue
+package com.danielmichalski.algorithms.data_structures._04_queue
 
 object Runner {
 

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_05_tree/BinarySearchTree.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_05_tree/BinarySearchTree.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.data_structures._05_tree
+package com.danielmichalski.algorithms.data_structures._05_tree
 
 class BinarySearchTree {
 

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_05_tree/Node.kt renamed to src/main/kotlin/com/danielmichalski/algorithms/data_structures/_05_tree/Node.kt

@@ -1,4 +1,4 @@
-package pl.dmichalski.algorithms.data_structures._05_tree
+package com.danielmichalski.algorithms.data_structures._05_tree
 
 class Node(private var value: Int) {