Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 0c98b50

Browse files
committed
Update website address
1 parent d0dffa0 commit 0c98b50

File tree

13 files changed

+13
-13
lines changed

13 files changed

+13
-13
lines changed

‎1-0-java-basics/1-3-1-crazy-generics/src/main/java/com/bobocode/basics/CrazyGenerics.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@
2020
* cases you will need to add new fields, create new classes, or add new methods. Always try to read java doc and update
2121
* the code according to it.
2222
* <p><p>
23-
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com/learn">visit our website</a></strong>
23+
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com">visit our website</a></strong>
2424
* <p>
2525
*
2626
* @author Taras Boychuk

‎1-0-java-basics/1-3-2-heterogeneous-max-holder/src/main/java/com/bobocode/basics/HeterogeneousMaxHolder.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99
* 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.
1010
* <p>
1111
* <p>
12-
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com/learn">visit our website</a></strong>
12+
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com">visit our website</a></strong>
1313
* <p>
1414
*
1515
* @author Taras Boychuk

‎2-0-data-structures-and-algorithms/2-2-1-node/src/main/java/com/bobobode/cs/Nodes.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
/**
66
* A class that consists of static methods only and provides util methods for {@link Node}.
77
* <p><p>
8-
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com/learn">visit our website</a></strong>
8+
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com">visit our website</a></strong>
99
* <p>
1010
*
1111
* @author Taras Boychuk

‎2-0-data-structures-and-algorithms/2-2-2-stack/src/main/java/com/bobocode/cs/LinkedStack.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77
* {@link LinkedStack} is a stack implementation that is based on singly linked generic nodes.
88
* A node is implemented as inner static class {@link Node<T>}.
99
* <p><p>
10-
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com/learn">visit our website</a></strong>
10+
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com">visit our website</a></strong>
1111
* <p>
1212
*
1313
* @param <T> generic type parameter

‎2-0-data-structures-and-algorithms/2-2-3-linked-queue/src/main/java/com/bobocode/cs/LinkedQueue.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77
* class Node. In order to perform operations {@link LinkedQueue#add(Object)} and {@link LinkedQueue#poll()}
88
* in a constant time, it keeps to references to the head and tail of the queue.
99
* <p><p>
10-
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com/learn">visit our website</a></strong>
10+
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com">visit our website</a></strong>
1111
* <p>
1212
*
1313
* @param <T> a generic parameter

‎2-0-data-structures-and-algorithms/2-2-4-linked-list/src/main/java/com/bobocode/cs/LinkedList.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77
* {@link LinkedList} is a list implementation that is based on singly linked generic nodes. A node is implemented as
88
* inner static class {@link Node<T>}.
99
* <p><p>
10-
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com/learn">visit our website</a></strong>
10+
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com">visit our website</a></strong>
1111
* <p>
1212
*
1313
* @param <T> generic type parameter

‎2-0-data-structures-and-algorithms/2-2-5-array-list/src/main/java/com/bobocode/cs/ArrayList.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@
66
* {@link ArrayList} is an implementation of {@link List} interface. This resizable data structure
77
* based on an array and is simplified version of {@link java.util.ArrayList}.
88
* <p><p>
9-
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com/learn">visit our website</a></strong>
9+
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com">visit our website</a></strong>
1010
* <p>
1111
*
1212
* @author Serhii Hryhus

‎2-0-data-structures-and-algorithms/2-2-6-binary-search-tree/src/main/java/com/bobocode/cs/RecursiveBinarySearchTree.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99
* and recursion. A tree node is represented as a nested class {@link Node}. It holds an element (a value) and
1010
* two references to the left and right child nodes.
1111
* <p><p>
12-
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com/learn">visit our website</a></strong>
12+
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com">visit our website</a></strong>
1313
* <p>
1414
*
1515
* @param <T> a type of elements that are stored in the tree

‎2-0-data-structures-and-algorithms/2-2-9-hash-table/src/main/java/com/bobocode/cs/HashTable.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@
1919
* <p>
2020
* The initial array size (initial capacity) is 8.
2121
* <p><p>
22-
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com/learn">visit our website</a></strong>
22+
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com">visit our website</a></strong>
2323
* <p>
2424
*
2525
* @param <K> key type

‎3-0-java-core/3-6-4-random-field-comparator/src/main/java/com/bobocode/se/RandomFieldComparator.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@
1111
*
1212
* @param <T> the type of the objects that may be compared by this comparator
1313
*<p><p>
14-
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com/learn">visit our website</a></strong>
14+
* <strong>TODO: to get the most out of your learning, <a href="https://www.bobocode.com">visit our website</a></strong>
1515
* <p>
1616
*
1717
* @author Stanislav Zabramnyi

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /