diff --git a/1-0-java-basics/1-3-1-crazy-generics/src/main/java/com/bobocode/basics/CrazyGenerics.java b/1-0-java-basics/1-3-1-crazy-generics/src/main/java/com/bobocode/basics/CrazyGenerics.java index 8faec080..5c63d64a 100644 --- a/1-0-java-basics/1-3-1-crazy-generics/src/main/java/com/bobocode/basics/CrazyGenerics.java +++ b/1-0-java-basics/1-3-1-crazy-generics/src/main/java/com/bobocode/basics/CrazyGenerics.java @@ -18,7 +18,7 @@ * cases you will need to add new fields, create new classes, or add new methods. Always try to read java doc and update * the code according to it. *

- * TODO: to get the most out of your learning, visit our website + * TODO: to get the most out of your learning, visit our website *

* * @author Taras Boychuk diff --git a/1-0-java-basics/1-3-2-heterogeneous-max-holder/src/main/java/com/bobocode/basics/HeterogeneousMaxHolder.java b/1-0-java-basics/1-3-2-heterogeneous-max-holder/src/main/java/com/bobocode/basics/HeterogeneousMaxHolder.java index 3be52036..6afbec0e 100644 --- a/1-0-java-basics/1-3-2-heterogeneous-max-holder/src/main/java/com/bobocode/basics/HeterogeneousMaxHolder.java +++ b/1-0-java-basics/1-3-2-heterogeneous-max-holder/src/main/java/com/bobocode/basics/HeterogeneousMaxHolder.java @@ -13,7 +13,7 @@ * It's based on the {@link Map} and provides an API that allows to put a value by type, and get a max value by type. *

*

- * TODO: to get the most out of your learning, visit our website + * TODO: to get the most out of your learning, visit our website *

* * @author Taras Boychuk diff --git a/2-0-data-structures-and-algorithms/2-2-1-node/src/main/java/com/bobobode/cs/Nodes.java b/2-0-data-structures-and-algorithms/2-2-1-node/src/main/java/com/bobobode/cs/Nodes.java index d82bd10d..cfe21377 100644 --- a/2-0-data-structures-and-algorithms/2-2-1-node/src/main/java/com/bobobode/cs/Nodes.java +++ b/2-0-data-structures-and-algorithms/2-2-1-node/src/main/java/com/bobobode/cs/Nodes.java @@ -3,7 +3,7 @@ /** * A class that consists of static methods only and provides util methods for {@link Node}. *

- * TODO: to get the most out of your learning, visit our website + * TODO: to get the most out of your learning, visit our website *

* * @author Taras Boychuk diff --git a/2-0-data-structures-and-algorithms/2-2-2-stack/src/main/java/com/bobocode/cs/LinkedStack.java b/2-0-data-structures-and-algorithms/2-2-2-stack/src/main/java/com/bobocode/cs/LinkedStack.java index 41abc724..4a15e081 100644 --- a/2-0-data-structures-and-algorithms/2-2-2-stack/src/main/java/com/bobocode/cs/LinkedStack.java +++ b/2-0-data-structures-and-algorithms/2-2-2-stack/src/main/java/com/bobocode/cs/LinkedStack.java @@ -8,7 +8,7 @@ * {@link LinkedStack} is a stack implementation that is based on singly linked generic nodes. * A node is implemented as inner static class {@link Node}. *

- * TODO: to get the most out of your learning, visit our website + * TODO: to get the most out of your learning, visit our website *

* * @param generic type parameter diff --git a/2-0-data-structures-and-algorithms/2-2-3-linked-queue/src/main/java/com/bobocode/cs/LinkedQueue.java b/2-0-data-structures-and-algorithms/2-2-3-linked-queue/src/main/java/com/bobocode/cs/LinkedQueue.java index 2307aa66..ce9bd491 100644 --- a/2-0-data-structures-and-algorithms/2-2-3-linked-queue/src/main/java/com/bobocode/cs/LinkedQueue.java +++ b/2-0-data-structures-and-algorithms/2-2-3-linked-queue/src/main/java/com/bobocode/cs/LinkedQueue.java @@ -5,7 +5,7 @@ * class Node. In order to perform operations {@link LinkedQueue#add(Object)} and {@link LinkedQueue#poll()} * in a constant time, it keeps to references to the head and tail of the queue. *

- * TODO: to get the most out of your learning, visit our website + * TODO: to get the most out of your learning, visit our website *

* * @param a generic parameter diff --git a/2-0-data-structures-and-algorithms/2-2-4-linked-list/src/main/java/com/bobocode/cs/LinkedList.java b/2-0-data-structures-and-algorithms/2-2-4-linked-list/src/main/java/com/bobocode/cs/LinkedList.java index 908d98ee..0c8f5f15 100644 --- a/2-0-data-structures-and-algorithms/2-2-4-linked-list/src/main/java/com/bobocode/cs/LinkedList.java +++ b/2-0-data-structures-and-algorithms/2-2-4-linked-list/src/main/java/com/bobocode/cs/LinkedList.java @@ -8,7 +8,7 @@ * {@link LinkedList} is a list implementation that is based on singly linked generic nodes. A node is implemented as * inner static class {@link Node}. *

- * TODO: to get the most out of your learning, visit our website + * TODO: to get the most out of your learning, visit our website *

* * @param generic type parameter diff --git a/2-0-data-structures-and-algorithms/2-2-5-array-list/src/main/java/com/bobocode/cs/ArrayList.java b/2-0-data-structures-and-algorithms/2-2-5-array-list/src/main/java/com/bobocode/cs/ArrayList.java index e60f280d..10be12b8 100644 --- a/2-0-data-structures-and-algorithms/2-2-5-array-list/src/main/java/com/bobocode/cs/ArrayList.java +++ b/2-0-data-structures-and-algorithms/2-2-5-array-list/src/main/java/com/bobocode/cs/ArrayList.java @@ -8,7 +8,7 @@ * {@link ArrayList} is an implementation of {@link List} interface. This resizable data structure * based on an array and is simplified version of {@link java.util.ArrayList}. *

- * TODO: to get the most out of your learning, visit our website + * TODO: to get the most out of your learning, visit our website *

* * @author Serhii Hryhus diff --git a/2-0-data-structures-and-algorithms/2-2-6-binary-search-tree/src/main/java/com/bobocode/cs/RecursiveBinarySearchTree.java b/2-0-data-structures-and-algorithms/2-2-6-binary-search-tree/src/main/java/com/bobocode/cs/RecursiveBinarySearchTree.java index b5c43437..9b821d1d 100644 --- a/2-0-data-structures-and-algorithms/2-2-6-binary-search-tree/src/main/java/com/bobocode/cs/RecursiveBinarySearchTree.java +++ b/2-0-data-structures-and-algorithms/2-2-6-binary-search-tree/src/main/java/com/bobocode/cs/RecursiveBinarySearchTree.java @@ -9,7 +9,7 @@ * and recursion. A tree node is represented as a nested class {@link Node}. It holds an element (a value) and * two references to the left and right child nodes. *

- * TODO: to get the most out of your learning, visit our website + * TODO: to get the most out of your learning, visit our website *

* * @param a type of elements that are stored in the tree diff --git a/2-0-data-structures-and-algorithms/2-2-9-hash-table/src/main/java/com/bobocode/cs/HashTable.java b/2-0-data-structures-and-algorithms/2-2-9-hash-table/src/main/java/com/bobocode/cs/HashTable.java index 1af07147..31a2d9df 100644 --- a/2-0-data-structures-and-algorithms/2-2-9-hash-table/src/main/java/com/bobocode/cs/HashTable.java +++ b/2-0-data-structures-and-algorithms/2-2-9-hash-table/src/main/java/com/bobocode/cs/HashTable.java @@ -21,7 +21,7 @@ *

* The initial array size (initial capacity) is 8. *

- * TODO: to get the most out of your learning, visit our website + * TODO: to get the most out of your learning, visit our website *

* * @param key type diff --git a/3-0-java-core/3-6-4-random-field-comparator/src/main/java/com/bobocode/se/RandomFieldComparator.java b/3-0-java-core/3-6-4-random-field-comparator/src/main/java/com/bobocode/se/RandomFieldComparator.java index ee33f415..630b21c6 100644 --- a/3-0-java-core/3-6-4-random-field-comparator/src/main/java/com/bobocode/se/RandomFieldComparator.java +++ b/3-0-java-core/3-6-4-random-field-comparator/src/main/java/com/bobocode/se/RandomFieldComparator.java @@ -16,7 +16,7 @@ * * @param the type of the objects that may be compared by this comparator *

- * TODO: to get the most out of your learning, visit our website + * TODO: to get the most out of your learning, visit our website *

* * @author Stanislav Zabramnyi diff --git a/5-0-functional-programming/5-1-1-crazy-lambdas/src/main/java/com/bobocode/fp/CrazyLambdas.java b/5-0-functional-programming/5-1-1-crazy-lambdas/src/main/java/com/bobocode/fp/CrazyLambdas.java index 86812db5..4f981027 100644 --- a/5-0-functional-programming/5-1-1-crazy-lambdas/src/main/java/com/bobocode/fp/CrazyLambdas.java +++ b/5-0-functional-programming/5-1-1-crazy-lambdas/src/main/java/com/bobocode/fp/CrazyLambdas.java @@ -15,7 +15,7 @@ *

* TODO: remove exception and implement each method of this class using lambda or method reference *

- * TODO: to get the most out of your learning, visit our website + * TODO: to get the most out of your learning, visit our website *

* * @author Taras Boychuk diff --git a/5-0-functional-programming/5-2-1-crazy-streams/src/main/java/com/bobocode/fp/CrazyStreams.java b/5-0-functional-programming/5-2-1-crazy-streams/src/main/java/com/bobocode/fp/CrazyStreams.java index 47892b44..4b60c0c1 100644 --- a/5-0-functional-programming/5-2-1-crazy-streams/src/main/java/com/bobocode/fp/CrazyStreams.java +++ b/5-0-functional-programming/5-2-1-crazy-streams/src/main/java/com/bobocode/fp/CrazyStreams.java @@ -21,7 +21,7 @@ *

* TODO: remove exception throwing and implement each method using Stream API *

- * TODO: to get the most out of your learning, visit our website + * TODO: to get the most out of your learning, visit our website *

* * @author Taras Boychuk diff --git a/5-0-functional-programming/5-3-1-crazy-optionals/src/main/java/com/bobocode/fp/CrazyOptionals.java b/5-0-functional-programming/5-3-1-crazy-optionals/src/main/java/com/bobocode/fp/CrazyOptionals.java index cccaaee2..227cf317 100644 --- a/5-0-functional-programming/5-3-1-crazy-optionals/src/main/java/com/bobocode/fp/CrazyOptionals.java +++ b/5-0-functional-programming/5-3-1-crazy-optionals/src/main/java/com/bobocode/fp/CrazyOptionals.java @@ -25,7 +25,7 @@ *

* TODO: remove exception and implement each method of this class using Optional API *

- * TODO: to get the most out of your learning, visit our website + * TODO: to get the most out of your learning, visit our website *

* * @author Taras Boychuk