From 279d679ae0ac92e9175b439ff84657d4f0abbd1e Mon Sep 17 00:00:00 2001 From: pascal Date: Tue, 6 Oct 2020 19:41:43 +0200 Subject: [PATCH 001/108] fix array heap test --- src/test/java/datastructures/heap/MaxArrayHeapTest.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/test/java/datastructures/heap/MaxArrayHeapTest.java b/src/test/java/datastructures/heap/MaxArrayHeapTest.java index 86c4b60..10212f8 100644 --- a/src/test/java/datastructures/heap/MaxArrayHeapTest.java +++ b/src/test/java/datastructures/heap/MaxArrayHeapTest.java @@ -84,7 +84,7 @@ public void testRightChild() { int result = maxArrayHeap.rightChild(0); - assertEquals(2, result); + assertEquals(6, result); result = maxArrayHeap.rightChild(1); assertEquals(4, result); From 8141036860cbf0ca0d28031b7d44819af93929d8 Mon Sep 17 00:00:00 2001 From: pascal Date: Tue, 6 Oct 2020 19:42:53 +0200 Subject: [PATCH 002/108] complete missing javadoc --- docs/problems/coinsamount/CoinsAmount.html | 256 +++++++++++++++ .../problems/coinsamount/impl/BruteForce.html | 310 ++++++++++++++++++ .../coinsamount/impl/DynamicProgramming.html | 295 +++++++++++++++++ .../coinsamount/impl/package-frame.html | 20 ++ .../coinsamount/impl/package-summary.html | 143 ++++++++ .../coinsamount/impl/package-tree.html | 135 ++++++++ docs/problems/coinsamount/package-frame.html | 19 ++ .../problems/coinsamount/package-summary.html | 139 ++++++++ docs/problems/coinsamount/package-tree.html | 130 ++++++++ 9 files changed, 1447 insertions(+) create mode 100644 docs/problems/coinsamount/CoinsAmount.html create mode 100644 docs/problems/coinsamount/impl/BruteForce.html create mode 100644 docs/problems/coinsamount/impl/DynamicProgramming.html create mode 100644 docs/problems/coinsamount/impl/package-frame.html create mode 100644 docs/problems/coinsamount/impl/package-summary.html create mode 100644 docs/problems/coinsamount/impl/package-tree.html create mode 100644 docs/problems/coinsamount/package-frame.html create mode 100644 docs/problems/coinsamount/package-summary.html create mode 100644 docs/problems/coinsamount/package-tree.html diff --git a/docs/problems/coinsamount/CoinsAmount.html b/docs/problems/coinsamount/CoinsAmount.html new file mode 100644 index 0000000..c65533e --- /dev/null +++ b/docs/problems/coinsamount/CoinsAmount.html @@ -0,0 +1,256 @@ + + + + + +CoinsAmount (java-fundamentals documentation) + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+
    +
  • Prev Class
    • +
  • Next Class
    • +
+ + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + +
+
problems.coinsamount
+

Interface CoinsAmount

+
+
+
+ +
+
+
    +
  • + +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + +
      All Methods Instance Methods Abstract Methods Default Methods 
      Modifier and TypeMethod and Description
      intcalculateAmount(int number, + java.util.List<java.lang.Integer> coinTypes) +
      Calculate the minimal amount of coins needed to depict number using the given coin types.
      +
      default java.util.List<java.lang.Integer>filterLargeCoinTypes(int value, + java.util.List<java.lang.Integer> coinTypes) +
      Filters the coin types that are greater than our value and removes them from the list
      +
      +
      • +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        calculateAmount

        +
        int calculateAmount(int number,
+                    java.util.List<java.lang.Integer> coinTypes)
        +
        Calculate the minimal amount of coins needed to depict number using the given coin types.
        +
        +
        Parameters:
        +
        number - - The number we want to depict using the coins. Must be greater than zero.
        +
        coinTypes - - List of given coin types. Must be sorted ascending
        +
        Returns:
        +
        amount of coins needed
        +
        +
        • +
      + + + +
        +
      • +

        filterLargeCoinTypes

        +
        default java.util.List<java.lang.Integer> filterLargeCoinTypes(int value,
+                                                               java.util.List<java.lang.Integer> coinTypes)
        +
        Filters the coin types that are greater than our value and removes them from the list
        +
        +
        Returns:
        +
        a copy of our coin types list
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+
    +
  • Prev Class
    • +
  • Next Class
    • +
+ + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
    +
  • Detail: 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+
+ + +
+ + + diff --git a/docs/problems/coinsamount/impl/BruteForce.html b/docs/problems/coinsamount/impl/BruteForce.html new file mode 100644 index 0000000..c4256dd --- /dev/null +++ b/docs/problems/coinsamount/impl/BruteForce.html @@ -0,0 +1,310 @@ + + + + + +BruteForce (java-fundamentals documentation) + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + +
+
problems.coinsamount.impl
+

Class BruteForce

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • problems.coinsamount.impl.BruteForce
      • +
    +
    • +
+
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    CoinsAmount
    +
    +
    +
    +
    public class BruteForce
+extends java.lang.Object
+implements CoinsAmount
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Summary

      + + + + + + + + +
      Constructors 
      Constructor and Description
      BruteForce() 
      +
      • +
    + +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + +
      All Methods Static Methods Instance Methods Concrete Methods 
      Modifier and TypeMethod and Description
      intcalculateAmount(int number, + java.util.List<java.lang.Integer> coinTypesOriginal) +
      Calculate the minimal amount of coins needed to depict number using the given coin types.
      +
      static <T> java.util.List<java.util.List<T>>combination(java.util.List<T> values, + int size) 
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
        • +
      + +
      • +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        BruteForce

        +
        public BruteForce()
        +
        • +
      +
      • +
    + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        combination

        +
        public static <T> java.util.List<java.util.List<T>> combination(java.util.List<T> values,
+                                                                int size)
        +
        • +
      + + + +
        +
      • +

        calculateAmount

        +
        public int calculateAmount(int number,
+                           java.util.List<java.lang.Integer> coinTypesOriginal)
        +
        Description copied from interface: CoinsAmount
        +
        Calculate the minimal amount of coins needed to depict number using the given coin types.
        +
        +
        Specified by:
        +
        calculateAmount in interface CoinsAmount
        +
        Parameters:
        +
        number - - The number we want to depict using the coins. Must be greater than zero.
        +
        coinTypesOriginal - - List of given coin types. Must be sorted ascending
        +
        Returns:
        +
        amount of coins needed
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + + diff --git a/docs/problems/coinsamount/impl/DynamicProgramming.html b/docs/problems/coinsamount/impl/DynamicProgramming.html new file mode 100644 index 0000000..b8f1dc4 --- /dev/null +++ b/docs/problems/coinsamount/impl/DynamicProgramming.html @@ -0,0 +1,295 @@ + + + + + +DynamicProgramming (java-fundamentals documentation) + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + +
+
problems.coinsamount.impl
+

Class DynamicProgramming

+
+
+
    +
  • java.lang.Object
    • +
  • +
      +
    • problems.coinsamount.impl.DynamicProgramming
      • +
    +
    • +
+
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    CoinsAmount
    +
    +
    +
    +
    public class DynamicProgramming
+extends java.lang.Object
+implements CoinsAmount
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Summary

      + + + + + + + + +
      Constructors 
      Constructor and Description
      DynamicProgramming() 
      +
      • +
    + +
      +
    • + + +

      Method Summary

      + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethod and Description
      intcalculateAmount(int number, + java.util.List<java.lang.Integer> coinTypesOriginal) +
      Calculate the minimal amount of coins needed to depict number using the given coin types.
      +
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
        • +
      + +
      • +
    +
    • +
+
+
+
    +
  • + +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        DynamicProgramming

        +
        public DynamicProgramming()
        +
        • +
      +
      • +
    + +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        calculateAmount

        +
        public int calculateAmount(int number,
+                           java.util.List<java.lang.Integer> coinTypesOriginal)
        +
        Description copied from interface: CoinsAmount
        +
        Calculate the minimal amount of coins needed to depict number using the given coin types.
        +
        +
        Specified by:
        +
        calculateAmount in interface CoinsAmount
        +
        Parameters:
        +
        number - - The number we want to depict using the coins. Must be greater than zero.
        +
        coinTypesOriginal - - List of given coin types. Must be sorted ascending
        +
        Returns:
        +
        amount of coins needed
        +
        +
        • +
      +
      • +
    +
    • +
+
+
+ + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+
+
    +
  • Summary: 
    • +
  • Nested | 
    • +
  • Field | 
    • +
  • Constr | 
    • +
  • Method
    • +
+ +
+ + +
+ + + diff --git a/docs/problems/coinsamount/impl/package-frame.html b/docs/problems/coinsamount/impl/package-frame.html new file mode 100644 index 0000000..afa85be --- /dev/null +++ b/docs/problems/coinsamount/impl/package-frame.html @@ -0,0 +1,20 @@ + + + + + +problems.coinsamount.impl (java-fundamentals documentation) + + + + +

problems.coinsamount.impl

+
+

Classes

+ +
+ + diff --git a/docs/problems/coinsamount/impl/package-summary.html b/docs/problems/coinsamount/impl/package-summary.html new file mode 100644 index 0000000..26f8259 --- /dev/null +++ b/docs/problems/coinsamount/impl/package-summary.html @@ -0,0 +1,143 @@ + + + + + +problems.coinsamount.impl (java-fundamentals documentation) + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Package problems.coinsamount.impl

+
+
+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/docs/problems/coinsamount/impl/package-tree.html b/docs/problems/coinsamount/impl/package-tree.html new file mode 100644 index 0000000..f402fac --- /dev/null +++ b/docs/problems/coinsamount/impl/package-tree.html @@ -0,0 +1,135 @@ + + + + + +problems.coinsamount.impl Class Hierarchy (java-fundamentals documentation) + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Hierarchy For Package problems.coinsamount.impl

+Package Hierarchies: + +
+
+

Class Hierarchy

+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/docs/problems/coinsamount/package-frame.html b/docs/problems/coinsamount/package-frame.html new file mode 100644 index 0000000..ea7aee1 --- /dev/null +++ b/docs/problems/coinsamount/package-frame.html @@ -0,0 +1,19 @@ + + + + + +problems.coinsamount (java-fundamentals documentation) + + + + +

problems.coinsamount

+
+

Interfaces

+ +
+ + diff --git a/docs/problems/coinsamount/package-summary.html b/docs/problems/coinsamount/package-summary.html new file mode 100644 index 0000000..4b0c7ad --- /dev/null +++ b/docs/problems/coinsamount/package-summary.html @@ -0,0 +1,139 @@ + + + + + +problems.coinsamount (java-fundamentals documentation) + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Package problems.coinsamount

+
+
+
    +
  • + + + + + + + + + + + + +
    Interface Summary 
    InterfaceDescription
    CoinsAmount 
    +
    • +
+
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + diff --git a/docs/problems/coinsamount/package-tree.html b/docs/problems/coinsamount/package-tree.html new file mode 100644 index 0000000..b9ba0e6 --- /dev/null +++ b/docs/problems/coinsamount/package-tree.html @@ -0,0 +1,130 @@ + + + + + +problems.coinsamount Class Hierarchy (java-fundamentals documentation) + + + + + + + +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ +
+

Hierarchy For Package problems.coinsamount

+Package Hierarchies: + +
+
+

Interface Hierarchy

+ +
+ +
+ + +
Skip navigation links
+ + + + +
+
+ + + +
+ +
+ + +
+ + + From e4383ddbd0277a6caaf65efd6594d3981fb7ff26 Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Tue, 6 Oct 2020 22:07:59 +0200 Subject: [PATCH 003/108] Mergify: configuration update --- .mergify.yml | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) diff --git a/.mergify.yml b/.mergify.yml index 3471e90..32dda48 100644 --- a/.mergify.yml +++ b/.mergify.yml @@ -1,10 +1,10 @@ pull_request_rules: - - name: automatic merge for master when reviewed and CI passes and has label + - name: automatic merge for master when reviewed by owner conditions: - status-success=continuous-integration/travis-ci/pr - - "#approved-reviews-by>=1" + - "status-success=ci/circleci: test" + - approved-reviews-by=LorenzNickel - base=master - - label=ready-to-merge actions: merge: method: rebase @@ -21,9 +21,10 @@ pull_request_rules: message: This pull request is now in conflicts. Could you fix it? 🙏 - name: automatic merge for Dependabot pull requests with label conditions: - - label=ready-to-merge + - approved-reviews-by=LorenzNickel - author~=^dependabot(|-preview)\[bot\]$ - status-success=continuous-integration/travis-ci/pr + - "status-success=ci/circleci: test" actions: merge: method: rebase From 32e69c657bc66dfc6dd915134b2dc23fc84605af Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Tue, 6 Oct 2020 21:59:35 +0200 Subject: [PATCH 004/108] Update README.md --- README.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index c4cdd38..35a9115 100644 --- a/README.md +++ b/README.md @@ -1,5 +1,6 @@ # java-fundamentals -[![Build Status](https://travis-ci.org/LorenzNickel/java-fundamentals.svg?branch=master)](https://travis-ci.org/LorenzNickel/java-fundamentals) +[![Travis Build Status](https://travis-ci.org/LorenzNickel/java-fundamentals.svg?branch=master)](https://travis-ci.org/LorenzNickel/java-fundamentals) +[![Circle Build Status](https://circleci.com/gh/LorenzNickel/java-fundamentals.svg?style=shield)](https://circleci.com/gh/LorenzNickel/java-fundamentals/) [![codecov](https://codecov.io/gh/LorenzNickel/java-fundamentals/branch/master/graph/badge.svg)](https://codecov.io/gh/LorenzNickel/java-fundamentals) Common algorithms, data structures and design pattern implemented in Java. From 97ad1b21d0c7553827020dcaa9ced0e0aa37f2c3 Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Wed, 7 Oct 2020 17:28:38 +0200 Subject: [PATCH 005/108] Add CONTRIBUTING.md --- docs/CONTRIBUTING.md | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 docs/CONTRIBUTING.md diff --git a/docs/CONTRIBUTING.md b/docs/CONTRIBUTING.md new file mode 100644 index 0000000..a989015 --- /dev/null +++ b/docs/CONTRIBUTING.md @@ -0,0 +1,20 @@ +# Contributing to LorenzNickel/java-fundamentals + +:tada: First off, thanks for taking the time to contribute! :tada: + +The following is a set of guidelines for contributing to [LorenzNickel/java-fundamentals](https://github.com/LorenzNickel/java-fundamentals) on GitHub. These are mostly guidelines, not rules. Use your best judgment, and feel free to propose changes to this document in a pull request. + +## Pull Requests + +Feel free to create pull requests covering additional (common) algorithms, datastructures, design pattern and problems (including a textual description) to this repository. + +### Content + +Please make sure to not violate any copyright rules when contributing to this repository. +In general, we are happy to receive any contributions covering new implementations or problem statements. +Regarding the structuring of your files it might be useful to check similar implementations in this repository first and adapt their style. + +### Style Guide + +This repository follows the [Google Java Style Guide](https://google.github.io/styleguide/javaguide.html). Feel free to download formatting presets for your IDE from [Google's GitHub repository](https://github.com/google/styleguide). +We have set up [checkstyle](https://github.com/LorenzNickel/java-fundamentals/blob/master/checkstyle.xml) to enforce them throughout this project. You can check locally if your changes comply with these guidelines by executing the maven goal `compile`. If the build of your Pull Request fails make sure to checkout the logs in the checks of your Pull Request to see what exactly does not comply with our guidelines. If you think that you are still complying with the guidelines, feel free to make corresponding changes to our [checkstyle file](https://github.com/LorenzNickel/java-fundamentals/blob/master/checkstyle.xml). \ No newline at end of file From 35ed5e0c2ca33b0f0305f697984903cb18645eb2 Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Wed, 7 Oct 2020 17:30:54 +0200 Subject: [PATCH 006/108] Add link to contribution guidelines --- README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/README.md b/README.md index 35a9115..ad8bb3f 100644 --- a/README.md +++ b/README.md @@ -4,3 +4,5 @@ [![codecov](https://codecov.io/gh/LorenzNickel/java-fundamentals/branch/master/graph/badge.svg)](https://codecov.io/gh/LorenzNickel/java-fundamentals) Common algorithms, data structures and design pattern implemented in Java. + +Please have a look at our [contribution guidelines](https://github.com/LorenzNickel/java-fundamentals/blob/master/docs/CONTRIBUTING.md) if you want to improve this repository. From e00d07d38fd5d2c2876b7089aa142b6df1a7d44d Mon Sep 17 00:00:00 2001 From: Richard Vierhaus Date: Wed, 7 Oct 2020 22:11:38 +0200 Subject: [PATCH 007/108] add gnomesort (#14) * add gnomesort * added gnome sort test --- src/main/java/algorithms/sort/GnomeSort.java | 37 ++++++++++++++++++ .../java/algorithms/sort/GnomeSortTest.java | 38 +++++++++++++++++++ 2 files changed, 75 insertions(+) create mode 100644 src/main/java/algorithms/sort/GnomeSort.java create mode 100644 src/test/java/algorithms/sort/GnomeSortTest.java diff --git a/src/main/java/algorithms/sort/GnomeSort.java b/src/main/java/algorithms/sort/GnomeSort.java new file mode 100644 index 0000000..7dc8c55 --- /dev/null +++ b/src/main/java/algorithms/sort/GnomeSort.java @@ -0,0 +1,37 @@ +package algorithms.sort; + +/** + * @author Ninju + */ +public class GnomeSort { + + /** + * Sorts the array using gnome sort algorithm + * + * @param array + * @param + */ + public static > void gnomeSort(T[] array) { + int index = 0; + + if (array.length <= 1) { + return; + } + + while (index < array.length) { + if (index == 0) { + index++; + } + if (array[index].compareTo(array[index - 1]) >= 0) { + index++; + } else { + T temp; + temp = array[index]; + array[index] = array[index - 1]; + array[index - 1] = temp; + index--; + } + } + } + +} diff --git a/src/test/java/algorithms/sort/GnomeSortTest.java b/src/test/java/algorithms/sort/GnomeSortTest.java new file mode 100644 index 0000000..4b79776 --- /dev/null +++ b/src/test/java/algorithms/sort/GnomeSortTest.java @@ -0,0 +1,38 @@ +package algorithms.sort; + +import static org.junit.Assert.assertArrayEquals; + +import java.util.Arrays; +import junit.framework.TestCase; + + +/** + * @author Ninju + */ +public class GnomeSortTest extends TestCase { + + public void testGnomeSort(){ + final Short[] array = new Short[]{3, 2, 5, 4, 1}; + GnomeSort.gnomeSort(array); + for (int i = 0; i < 5; i++) { + assertEquals(i + 1, (short) array[i]); + } + } + + public void testSameResultAsInsertion(){ + final Short[] arrayA = new Short[]{1, 3, 5, 3, 5, 3, 2, 3, 8, -1, -12}; + final Short[] arrayB = Arrays.copyOf(arrayA, arrayA.length); + GnomeSort.gnomeSort(arrayA); + InsertionSort.insertionSort(arrayB); + assertArrayEquals(arrayA, arrayB); + } + + public void testGnomeSortEdgeCases() { + final String[] arrayA = new String[0]; + GnomeSort.gnomeSort(arrayA); + + final Float[] arrayB = new Float[]{1.0f}; + GnomeSort.gnomeSort(arrayB); + } + +} From b5d476aeaf81d3985eba5fa4cd27eb6eb86a6576 Mon Sep 17 00:00:00 2001 From: Richard Vierhaus Date: Wed, 7 Oct 2020 22:16:48 +0200 Subject: [PATCH 008/108] removed circleci from merging condition --- .mergify.yml | 1 - 1 file changed, 1 deletion(-) diff --git a/.mergify.yml b/.mergify.yml index 32dda48..04da9d4 100644 --- a/.mergify.yml +++ b/.mergify.yml @@ -2,7 +2,6 @@ pull_request_rules: - name: automatic merge for master when reviewed by owner conditions: - status-success=continuous-integration/travis-ci/pr - - "status-success=ci/circleci: test" - approved-reviews-by=LorenzNickel - base=master actions: From cc1adc8700e2003bece7e0b1e539bc11a8617dd0 Mon Sep 17 00:00:00 2001 From: Richard Vierhaus Date: Wed, 7 Oct 2020 22:32:26 +0200 Subject: [PATCH 009/108] Added gnomesort documentation (#16) --- docs/algorithms/sort/BubbleSortTest.html | 4 +- docs/algorithms/sort/GnomeSort.html | 279 +++++++++++++++++++ docs/algorithms/sort/GnomeSortTest.html | 322 ++++++++++++++++++++++ docs/algorithms/sort/InsertionSort.html | 4 +- docs/algorithms/sort/package-frame.html | 2 + docs/algorithms/sort/package-summary.html | 8 + docs/algorithms/sort/package-tree.html | 2 + docs/allclasses-frame.html | 2 + docs/allclasses-noframe.html | 2 + docs/index-files/index-16.html | 6 + docs/index-files/index-7.html | 12 + docs/overview-tree.html | 4 +- 12 files changed, 642 insertions(+), 5 deletions(-) create mode 100644 docs/algorithms/sort/GnomeSort.html create mode 100644 docs/algorithms/sort/GnomeSortTest.html diff --git a/docs/algorithms/sort/BubbleSortTest.html b/docs/algorithms/sort/BubbleSortTest.html index 7906fa2..c64109c 100644 --- a/docs/algorithms/sort/BubbleSortTest.html +++ b/docs/algorithms/sort/BubbleSortTest.html @@ -48,7 +48,7 @@
  • Frames
    • @@ -265,7 +265,7 @@

    testBubbleSortEdgeCases

    • Frames
      • diff --git a/docs/algorithms/sort/GnomeSort.html b/docs/algorithms/sort/GnomeSort.html new file mode 100644 index 0000000..0f55be8 --- /dev/null +++ b/docs/algorithms/sort/GnomeSort.html @@ -0,0 +1,279 @@ + + + + + +GnomeSort (java-fundamentals documentation) + + + + + + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      + +
      + + +
      + + +
      +
      algorithms.sort
      +

      Class GnomeSort

      +
      +
      +
        +
      • java.lang.Object
        • +
      • +
          +
        • algorithms.sort.GnomeSort
          • +
        +
        • +
      +
      +
        +
      • +
        +
        +
        public class GnomeSort
+extends java.lang.Object
        +
        • +
      +
      +
      +
        +
      • + +
          +
        • + + +

          Constructor Summary

          + + + + + + + + +
          Constructors 
          Constructor and Description
          GnomeSort() 
          +
          • +
        + +
          +
        • + + +

          Method Summary

          + + + + + + + + + + +
          All Methods Static Methods Concrete Methods 
          Modifier and TypeMethod and Description
          static <T extends java.lang.Comparable<T>>
          void          		gnomeSort(T[] array) +
          Sorts the array using gnome sort algorithm
          +
          +
            +
          • + + +

            Methods inherited from class java.lang.Object

            +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
            • +
          +
          • +
        +
        • +
      +
      +
      +
        +
      • + +
          +
        • + + +

          Constructor Detail

          + + + +
            +
          • +

            GnomeSort

            +
            public GnomeSort()
            +
            • +
          +
          • +
        + +
          +
        • + + +

          Method Detail

          + + + + + +
            +
          • +

            gnomeSort

            +
            public static <T extends java.lang.Comparable<T>> void gnomeSort(T[] array)
            +
            Sorts the array using gnome sort algorithm
            +
            +
            Type Parameters:
            +
            T -
            +
            Parameters:
            +
            array -
            +
            +
            • +
          +
          • +
        +
        • +
      +
      +
      + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      + +
      + + +
      + + + diff --git a/docs/algorithms/sort/GnomeSortTest.html b/docs/algorithms/sort/GnomeSortTest.html new file mode 100644 index 0000000..b96542e --- /dev/null +++ b/docs/algorithms/sort/GnomeSortTest.html @@ -0,0 +1,322 @@ + + + + + +GnomeSortTest (java-fundamentals documentation) + + + + + + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      + +
      + + +
      + + +
      +
      algorithms.sort
      +

      Class GnomeSortTest

      +
      +
      +
        +
      • java.lang.Object
        • +
      • +
          +
        • junit.framework.Assert
          • +
        • +
            +
          • junit.framework.TestCase
            • +
          • +
              +
            • algorithms.sort.GnomeSortTest
              • +
            +
            • +
          +
          • +
        +
        • +
      +
      +
        +
      • +
        +
        All Implemented Interfaces:
        +
        junit.framework.Test
        +
        +
        +
        +
        public class GnomeSortTest
+extends junit.framework.TestCase
        +
        • +
      +
      +
      +
        +
      • + +
          +
        • + + +

          Constructor Summary

          + + + + + + + + +
          Constructors 
          Constructor and Description
          GnomeSortTest() 
          +
          • +
        + +
          +
        • + + +

          Method Summary

          + + + + + + + + + + + + + + + + + + +
          All Methods Instance Methods Concrete Methods 
          Modifier and TypeMethod and Description
          voidtestGnomeSort() 
          voidtestGnomeSortEdgeCases() 
          voidtestSameResultAsInsertion() 
          +
            +
          • + + +

            Methods inherited from class junit.framework.TestCase

            +countTestCases, createResult, getName, run, run, runBare, runTest, setName, setUp, tearDown, toString
            • +
          +
            +
          • + + +

            Methods inherited from class junit.framework.Assert

            +assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertFalse, assertFalse, assertNotNull, assertNotNull, assertNotSame, assertNotSame, assertNull, assertNull, assertSame, assertSame, assertTrue, assertTrue, fail, fail, failNotEquals, failNotSame, failSame
            • +
          +
            +
          • + + +

            Methods inherited from class java.lang.Object

            +clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
            • +
          +
          • +
        +
        • +
      +
      +
      +
        +
      • + +
          +
        • + + +

          Constructor Detail

          + + + +
            +
          • +

            GnomeSortTest

            +
            public GnomeSortTest()
            +
            • +
          +
          • +
        + +
          +
        • + + +

          Method Detail

          + + + +
            +
          • +

            testGnomeSort

            +
            public void testGnomeSort()
            +
            • +
          + + + +
            +
          • +

            testSameResultAsInsertion

            +
            public void testSameResultAsInsertion()
            +
            • +
          + + + +
            +
          • +

            testGnomeSortEdgeCases

            +
            public void testGnomeSortEdgeCases()
            +
            • +
          +
          • +
        +
        • +
      +
      +
      + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      + +
      + + +
      + + + diff --git a/docs/algorithms/sort/InsertionSort.html b/docs/algorithms/sort/InsertionSort.html index 6b54fef..eec34f3 100644 --- a/docs/algorithms/sort/InsertionSort.html +++ b/docs/algorithms/sort/InsertionSort.html @@ -47,7 +47,7 @@
      @@ -201,7 +201,7 @@

      insertionSort

      diff --git a/docs/algorithms/sort/package-frame.html b/docs/algorithms/sort/package-frame.html index 3ec0931..d216fae 100644 --- a/docs/algorithms/sort/package-frame.html +++ b/docs/algorithms/sort/package-frame.html @@ -16,6 +16,8 @@

      Classes

    • BogoSortTest
    • BubbleSort
    • BubbleSortTest
      • +
    • GnomeSort
      • +
    • GnomeSortTest
    • InsertionSort
    • InsertionSortTest
    • QuickSort
      • diff --git a/docs/algorithms/sort/package-summary.html b/docs/algorithms/sort/package-summary.html index 6d8a0af..328d8a7 100644 --- a/docs/algorithms/sort/package-summary.html +++ b/docs/algorithms/sort/package-summary.html @@ -99,6 +99,14 @@

      Package algorithms.sort

        +GnomeSort +  + + +GnomeSortTest +  + + InsertionSort
      Static implementation of the insertion sort algorithm
      diff --git a/docs/algorithms/sort/package-tree.html b/docs/algorithms/sort/package-tree.html index 239af0a..d4698bf 100644 --- a/docs/algorithms/sort/package-tree.html +++ b/docs/algorithms/sort/package-tree.html @@ -85,6 +85,7 @@

      Class Hierarchy

      @@ -93,6 +94,7 @@

      Class Hierarchy

    • algorithms.sort.BogoSort
    • algorithms.sort.BubbleSort
      • +
    • algorithms.sort.GnomeSort
    • algorithms.sort.InsertionSort
    • algorithms.sort.QuickSort
    diff --git a/docs/allclasses-frame.html b/docs/allclasses-frame.html index 99bd169..bf5c230 100644 --- a/docs/allclasses-frame.html +++ b/docs/allclasses-frame.html @@ -31,6 +31,8 @@

    All Classes

  • DynamicProgramming
  • ExternalArray
  • FisherYatesTest
    • +
  • GnomeSort
    • +
  • GnomeSortTest
  • InsertionSort
  • InsertionSortTest
  • Leaf
    • diff --git a/docs/allclasses-noframe.html b/docs/allclasses-noframe.html index 8da307b..74c4b6b 100644 --- a/docs/allclasses-noframe.html +++ b/docs/allclasses-noframe.html @@ -31,6 +31,8 @@

    All Classes

  • DynamicProgramming
  • ExternalArray
  • FisherYatesTest
    • +
  • GnomeSort
    • +
  • GnomeSortTest
  • InsertionSort
  • InsertionSortTest
  • Leaf
    • diff --git a/docs/index-files/index-16.html b/docs/index-files/index-16.html index 5f4bbb2..5b045cf 100644 --- a/docs/index-files/index-16.html +++ b/docs/index-files/index-16.html @@ -112,6 +112,10 @@

    T

     
    testEqualsAndHashCode() - Method in class datastructures.math.MatrixTest
     
    +
    testGnomeSort() - Method in class algorithms.sort.GnomeSortTest
    +
     
    +
    testGnomeSortEdgeCases() - Method in class algorithms.sort.GnomeSortTest
    +
     
    testHashCode() - Method in class datastructures.math.TupleTest
     
    testImmutability() - Method in class datastructures.math.TupleTest
    @@ -162,6 +166,8 @@

    T

     
    testRightChild() - Method in class datastructures.heap.MaxArrayHeapTest
     
    +
    testSameResultAsInsertion() - Method in class algorithms.sort.GnomeSortTest
    +
     
    testSize() - Method in class algorithms.random.listshuffle.FisherYatesTest
     
    testSize() - Method in class datastructures.list.SinglyLinkedListTest
    diff --git a/docs/index-files/index-7.html b/docs/index-files/index-7.html index f252f39..30045e6 100644 --- a/docs/index-files/index-7.html +++ b/docs/index-files/index-7.html @@ -88,6 +88,18 @@

    G

     
    getValueAtCoordinates(Tuple<Integer>) - Method in class datastructures.math.Matrix
     
    +
    GnomeSort - Class in algorithms.sort
    +
     
    +
    GnomeSort() - Constructor for class algorithms.sort.GnomeSort
    +
     
    +
    gnomeSort(T[]) - Static method in class algorithms.sort.GnomeSort
    +
    +
    Sorts the array using gnome sort algorithm
    +
    +
    GnomeSortTest - Class in algorithms.sort
    +
     
    +
    GnomeSortTest() - Constructor for class algorithms.sort.GnomeSortTest
    +
     
    A B C D E F G H I L M P Q R S T W 
    diff --git a/docs/overview-tree.html b/docs/overview-tree.html index 1810342..8910326 100644 --- a/docs/overview-tree.html +++ b/docs/overview-tree.html @@ -104,6 +104,7 @@

    Class Hierarchy

  • pattern.composite.CompositeTest
  • problems.disctinctString.DistinctStringTest
  • algorithms.random.listshuffle.FisherYatesTest
    • +
  • algorithms.sort.GnomeSortTest
  • algorithms.sort.InsertionSortTest
  • algorithms.search.LinearSearchTest
  • datastructures.math.MatrixTest
    • @@ -124,11 +125,12 @@

    Class Hierarchy

  • algorithms.search.BinarySearch<E>
  • datastructures.tree.BinaryTree<T> (implements java.lang.Iterable<T>, java.io.Serializable)
  • algorithms.sort.BogoSort
    • -
  • problems.distinctString.impl.BruteForce (implements problems.distinctString.DistinctString)
  • problems.coinsamount.impl.BruteForce (implements problems.coinsamount.CoinsAmount)
    • +
  • problems.distinctString.impl.BruteForce (implements problems.distinctString.DistinctString)
  • algorithms.sort.BubbleSort
  • problems.coinsamount.impl.DynamicProgramming (implements problems.coinsamount.CoinsAmount)
  • problems.distinctString.impl.ExternalArray (implements problems.distinctString.DistinctString)
    • +
  • algorithms.sort.GnomeSort
  • algorithms.sort.InsertionSort
  • algorithms.search.LinearSearch<E>
  • algorithms.random.ListShuffle
    • From bb715b100f612a12d7235d0cb6e0829ca748ae2b Mon Sep 17 00:00:00 2001 From: Nicholas <11728676+ychan052@users.noreply.github.com> Date: Thu, 8 Oct 2020 19:27:19 -0700 Subject: [PATCH 010/108] Added MinHeap using ArrayList java. --- .../datastructures/heap/MinArrayHeap.java | 128 ++++++++++++++++++ 1 file changed, 128 insertions(+) create mode 100644 src/main/java/datastructures/heap/MinArrayHeap.java diff --git a/src/main/java/datastructures/heap/MinArrayHeap.java b/src/main/java/datastructures/heap/MinArrayHeap.java new file mode 100644 index 0000000..5388e9a --- /dev/null +++ b/src/main/java/datastructures/heap/MinArrayHeap.java @@ -0,0 +1,128 @@ +import java.util.ArrayList; + +/** + * A min heap based on an array list. + */ +public class MinArrayHeap { + ArrayList minHeap; + + /** + * Constructor; Creates the minHeap arrayList. + */ + public MinArrayHeap() { + minHeap = new ArrayList<>(); + } + + /** + * Adds an item to the heap, while ensuring it's a MinHeap. + * @param item - the item to be added + */ + public void insert(int item) { + /* + * Understand that: + * An element's left child: i * 2 + 1 + * An element's right child: i * 2 + 2 + * An element's parent: Math.floor((i-1) / 2) + */ + + // Add new element to the end of the array. + minHeap.add(item); + int lastIndex = minHeap.size() - 1; + + //Loop until new element is bigger than its parent or at root + while (lastIndex >= 0 && minHeap.get(lastIndex) < minHeap.get((int)Math.floor((lastIndex - 1)/2))) { + //Switch new element with parent if it is smaller than it + int temp = minHeap.get(lastIndex); + minHeap.set(lastIndex, minHeap.get((int) Math.floor((lastIndex - 1)/2))); + minHeap.set((int)Math.floor((lastIndex - 1) / 2), temp); + lastIndex = (int)Math.floor((lastIndex - 1)/2); + } + } + + /** + * Removes an item to the heap, while ensuring it's a MinHeap. Returns it + * @return int - the min value in the heap to be removed + */ + public int remove() { + int smallest = minHeap.get(0); + + if (minHeap.size() > 1) { + minHeap.set(0, minHeap.get(minHeap.size() - 1)); + minHeap.remove(minHeap.size() - 1); + + //If there are only two elements, simply swap and return value. + if (minHeap.size() == 2) { + if (minHeap.get(0) > minHeap.get(1)) { + int temp = minHeap.get(0); + minHeap.set(0, minHeap.get(1)); + minHeap.set(1, temp); + } + return smallest; + } + int i = 0; + int leftChild = 2 * i + 1; + int rightChild = 2 * i + 2; + + //Continue swapping until the parent is smaller than both children or you reach the last level in the tree. + while (leftChild < minHeap.size() && rightChild < minHeap.size() && (minHeap.get(i) >= minHeap.get(leftChild) || minHeap.get(i) >= minHeap.get(rightChild))) { + //If either child of the root is smaller than it, swap the root with the child of lesser value. + if (minHeap.get(leftChild) < minHeap.get(rightChild)) { + int temp = minHeap.get(i); + minHeap.set(i, minHeap.get(leftChild)); + minHeap.set(leftChild, temp); + i = 2 * i + 1; + } + else { + int temp = minHeap.get(i); + minHeap.set(i, minHeap.get(rightChild)); + minHeap.set(rightChild, temp); + i = 2 * i + 2; + } + leftChild = 2 * i + 1; + rightChild = 2 * i + 2; + } + } + else if (minHeap.size() == 1) { + minHeap.remove(minHeap.size() - 1); + } + else { + return -1; + } + return smallest; + } + + /** + * Return the minHeap arrayList + * @return minHeap - the arrayList to be returned + */ + public ArrayList getMinHeap() { + return minHeap; + } + + /** + * Sample tester + * @param args + */ + public static void main(String[] args) { + //Sample: Expected: 10 20 25 300 30 500 29 + MinArrayHeap mh = new MinArrayHeap(); + System.out.println("Inserting 30, 300, 500, 10, 20, 25, 29..."); + mh.insert(30); + mh.insert(300); + mh.insert(500); + mh.insert(10); + mh.insert(20); + mh.insert(25); + mh.insert(29); + + System.out.println("Values..."); + for(int i : mh.getMinHeap()) { + System.out.println(i); + } + System.out.println("Removing..."); + //Sample: Expected: 10 20 25 29 30 300 500 + while(mh.getMinHeap().size() != 0) { + System.out.println(mh.remove()); + } + } +} From b5324b0499908e19e1e232c4c58c066c00863197 Mon Sep 17 00:00:00 2001 From: Nicholas <11728676+ychan052@users.noreply.github.com> Date: Thu, 8 Oct 2020 20:46:00 -0700 Subject: [PATCH 011/108] Added MinHeap using ArrayList java with edits that fits styling. Also added a JUnit test for it. --- .../datastructures/heap/MinArrayHeap.java | 203 ++++++++---------- .../datastructures/heap/MinArrayHeapTest.java | 28 +++ 2 files changed, 123 insertions(+), 108 deletions(-) create mode 100644 src/test/java/datastructures/heap/MinArrayHeapTest.java diff --git a/src/main/java/datastructures/heap/MinArrayHeap.java b/src/main/java/datastructures/heap/MinArrayHeap.java index 5388e9a..165ddbc 100644 --- a/src/main/java/datastructures/heap/MinArrayHeap.java +++ b/src/main/java/datastructures/heap/MinArrayHeap.java @@ -1,128 +1,115 @@ import java.util.ArrayList; -/** - * A min heap based on an array list. - */ +/** A min heap based on an array list. */ public class MinArrayHeap { - ArrayList minHeap; + ArrayList minHeap; - /** - * Constructor; Creates the minHeap arrayList. - */ - public MinArrayHeap() { - minHeap = new ArrayList<>(); - } + /** Constructor; Creates the minHeap arrayList. */ + public MinArrayHeap() { + minHeap = new ArrayList<>(); + } - /** - * Adds an item to the heap, while ensuring it's a MinHeap. - * @param item - the item to be added + /** + * Adds an item to the heap, while ensuring it's a MinHeap. + * + * @param item - the item to be added + */ + public void insert(int item) { + /* + * Understand that: + * An element's left child: i * 2 + 1 + * An element's right child: i * 2 + 2 + * An element's parent: Math.floor((i-1) / 2) */ - public void insert(int item) { - /* - * Understand that: - * An element's left child: i * 2 + 1 - * An element's right child: i * 2 + 2 - * An element's parent: Math.floor((i-1) / 2) - */ - // Add new element to the end of the array. - minHeap.add(item); - int lastIndex = minHeap.size() - 1; + // Add new element to the end of the array. + minHeap.add(item); + int lastIndex = minHeap.size() - 1; - //Loop until new element is bigger than its parent or at root - while (lastIndex >= 0 && minHeap.get(lastIndex) < minHeap.get((int)Math.floor((lastIndex - 1)/2))) { - //Switch new element with parent if it is smaller than it - int temp = minHeap.get(lastIndex); - minHeap.set(lastIndex, minHeap.get((int) Math.floor((lastIndex - 1)/2))); - minHeap.set((int)Math.floor((lastIndex - 1) / 2), temp); - lastIndex = (int)Math.floor((lastIndex - 1)/2); - } + // Loop until new element is bigger than its parent or at root + while (lastIndex >= 0 + && minHeap.get(lastIndex) < minHeap.get((int) Math.floor((lastIndex - 1) / 2))) { + // Switch new element with parent if it is smaller than it + int temp = minHeap.get(lastIndex); + minHeap.set(lastIndex, minHeap.get((int) Math.floor((lastIndex - 1) / 2))); + minHeap.set((int) Math.floor((lastIndex - 1) / 2), temp); + lastIndex = (int) Math.floor((lastIndex - 1) / 2); } + } - /** - * Removes an item to the heap, while ensuring it's a MinHeap. Returns it - * @return int - the min value in the heap to be removed - */ - public int remove() { - int smallest = minHeap.get(0); - - if (minHeap.size() > 1) { - minHeap.set(0, minHeap.get(minHeap.size() - 1)); - minHeap.remove(minHeap.size() - 1); + /** + * Removes an item to the heap, while ensuring it's a MinHeap. Returns it + * + * @return int - the min value in the heap to be removed + */ + public int remove() { + int smallest = minHeap.get(0); - //If there are only two elements, simply swap and return value. - if (minHeap.size() == 2) { - if (minHeap.get(0) > minHeap.get(1)) { - int temp = minHeap.get(0); - minHeap.set(0, minHeap.get(1)); - minHeap.set(1, temp); - } - return smallest; - } - int i = 0; - int leftChild = 2 * i + 1; - int rightChild = 2 * i + 2; + if (minHeap.size() > 1) { + minHeap.set(0, minHeap.get(minHeap.size() - 1)); + minHeap.remove(minHeap.size() - 1); - //Continue swapping until the parent is smaller than both children or you reach the last level in the tree. - while (leftChild < minHeap.size() && rightChild < minHeap.size() && (minHeap.get(i) >= minHeap.get(leftChild) || minHeap.get(i) >= minHeap.get(rightChild))) { - //If either child of the root is smaller than it, swap the root with the child of lesser value. - if (minHeap.get(leftChild) < minHeap.get(rightChild)) { - int temp = minHeap.get(i); - minHeap.set(i, minHeap.get(leftChild)); - minHeap.set(leftChild, temp); - i = 2 * i + 1; - } - else { - int temp = minHeap.get(i); - minHeap.set(i, minHeap.get(rightChild)); - minHeap.set(rightChild, temp); - i = 2 * i + 2; - } - leftChild = 2 * i + 1; - rightChild = 2 * i + 2; - } - } - else if (minHeap.size() == 1) { - minHeap.remove(minHeap.size() - 1); - } - else { - return -1; + // If there are only two elements, simply swap and return value. + if (minHeap.size() == 2) { + if (minHeap.get(0) > minHeap.get(1)) { + int temp = minHeap.get(0); + minHeap.set(0, minHeap.get(1)); + minHeap.set(1, temp); } return smallest; - } + } + int i = 0; + int leftChild = 2 * i + 1; + int rightChild = 2 * i + 2; - /** - * Return the minHeap arrayList - * @return minHeap - the arrayList to be returned - */ - public ArrayList getMinHeap() { - return minHeap; + // Continue swapping until the parent is smaller than both children or you reach the last + // level in the tree. + while (leftChild < minHeap.size() + && rightChild < minHeap.size() + && (minHeap.get(i) >= minHeap.get(leftChild) + || minHeap.get(i) >= minHeap.get(rightChild))) { + // If either child of the root is smaller than it, swap the root with the child of lesser + // value. + if (minHeap.get(leftChild) < minHeap.get(rightChild)) { + int temp = minHeap.get(i); + minHeap.set(i, minHeap.get(leftChild)); + minHeap.set(leftChild, temp); + i = 2 * i + 1; + } else { + int temp = minHeap.get(i); + minHeap.set(i, minHeap.get(rightChild)); + minHeap.set(rightChild, temp); + i = 2 * i + 2; + } + leftChild = 2 * i + 1; + rightChild = 2 * i + 2; + } + } else if (minHeap.size() == 1) { + minHeap.remove(minHeap.size() - 1); + } else { + return -1; } + return smallest; + } - /** - * Sample tester - * @param args - */ - public static void main(String[] args) { - //Sample: Expected: 10 20 25 300 30 500 29 - MinArrayHeap mh = new MinArrayHeap(); - System.out.println("Inserting 30, 300, 500, 10, 20, 25, 29..."); - mh.insert(30); - mh.insert(300); - mh.insert(500); - mh.insert(10); - mh.insert(20); - mh.insert(25); - mh.insert(29); + /** + * Return the minHeap arrayList + * + * @return minHeap - the arrayList to be returned + */ + public ArrayList getMinHeap() { + return minHeap; + } - System.out.println("Values..."); - for(int i : mh.getMinHeap()) { - System.out.println(i); - } - System.out.println("Removing..."); - //Sample: Expected: 10 20 25 29 30 300 500 - while(mh.getMinHeap().size() != 0) { - System.out.println(mh.remove()); - } + @Override + public String toString() { + if (minHeap.isEmpty()) { + return "MaxArrayHeap{list=[]}"; } + + final StringBuilder stringBuilder = new StringBuilder(); + + minHeap.forEach(e -> stringBuilder.append(",").append(e.toString())); + return "MinArrayHeap{arrayList=[" + stringBuilder.toString().substring(1) + "]}"; + } } diff --git a/src/test/java/datastructures/heap/MinArrayHeapTest.java b/src/test/java/datastructures/heap/MinArrayHeapTest.java new file mode 100644 index 0000000..15d135c --- /dev/null +++ b/src/test/java/datastructures/heap/MinArrayHeapTest.java @@ -0,0 +1,28 @@ +import junit.framework.TestCase; + +/** Created by ychan052 on 08.10.2020. */ +public class MinArrayHeapTest extends TestCase { + public void testInsert() { + MinArrayHeap mh = new MinArrayHeap(); + mh.insert(30); + mh.insert(300); + mh.insert(500); + mh.insert(10); + mh.insert(20); + mh.insert(25); + mh.insert(29); + assertEquals("MinArrayHeap{arrayList=[10,20,25,300,30,500,29]}", mh.toString()); + } + + public void testRemove() { + MinArrayHeap mh = new MinArrayHeap(); + mh.insert(30); + mh.insert(300); + mh.insert(500); + mh.insert(10); + assertEquals(10, mh.remove()); + assertEquals(30, mh.remove()); + assertEquals(300, mh.remove()); + assertEquals(500, mh.remove()); + } +} From 8ee95c6dd7d1e382cd717b8deea11b8a30ad4c44 Mon Sep 17 00:00:00 2001 From: pascal Date: Sat, 10 Oct 2020 01:06:17 +0200 Subject: [PATCH 012/108] implement key value pair --- src/main/java/datastructures/pair/Pair.java | 72 +++++++++++++++++++ .../java/datastructures/pair/PairTest.java | 35 +++++++++ 2 files changed, 107 insertions(+) create mode 100644 src/main/java/datastructures/pair/Pair.java create mode 100644 src/test/java/datastructures/pair/PairTest.java diff --git a/src/main/java/datastructures/pair/Pair.java b/src/main/java/datastructures/pair/Pair.java new file mode 100644 index 0000000..f1dd9b6 --- /dev/null +++ b/src/main/java/datastructures/pair/Pair.java @@ -0,0 +1,72 @@ +package datastructures.pair; + +import java.util.Objects; + +/** + * @author thepn + *

    + * Represents a simple Pair of two values: Key and Value + *

    + */ +public class Pair { + + /** + * key object + */ + private final K key; + + /** + * value object + */ + private final V value; + + public Pair(K key, V value) { + this.key = key; + this.value = value; + } + + @Override + public String toString() { + return "Pair{" + + "key=" + key + + ", value=" + value + + '}'; + } + + /** + * @return key + */ + public K getKey() { + return key; + } + + /** + * @return value + */ + public V getValue() { + return value; + } + + @Override + public boolean equals(Object o) { + if (this == o) { + return true; + } + + if (o instanceof Pair) { + Pair pair = (Pair) o; + + if (!Objects.equals(key, pair.key)) { + return false; + } + + if (!Objects.equals(value, pair.value)) { + return false; + } + + return true; + } + + return false; + } +} diff --git a/src/test/java/datastructures/pair/PairTest.java b/src/test/java/datastructures/pair/PairTest.java new file mode 100644 index 0000000..9cff493 --- /dev/null +++ b/src/test/java/datastructures/pair/PairTest.java @@ -0,0 +1,35 @@ +package datastructures.pair; + +import junit.framework.TestCase; + +/** + * @author thepn + */ +public class PairTest extends TestCase { + + public void testEquals(){ + final Pair a = new Pair<>(1, 2); + final Pair b = new Pair<>(1, 2); + final Pair c = new Pair<>(2, 1); + + assertTrue(a.equals(b)); + assertFalse(a.equals(c)); + assertFalse(a.equals(null)); + } + + public void testKey(){ + final Pair integerIntegerPair = new Pair<>(10, 4); + final int key = integerIntegerPair.getKey(); + + assertEquals(10, key); + assertNotSame(10, integerIntegerPair.getValue()); + } + + public void testValue(){ + final Pair integerIntegerPair = new Pair<>(10, 4); + final int value = integerIntegerPair.getValue(); + + assertEquals(4, value); + assertNotSame(4, integerIntegerPair.getKey()); + } +} From 8dd7c5ff77ff1bc13aa7834a4831a600c6e9c980 Mon Sep 17 00:00:00 2001 From: pascal Date: Sat, 10 Oct 2020 01:06:17 +0200 Subject: [PATCH 013/108] implement key value pair --- src/main/java/datastructures/pair/Pair.java | 72 +++++++++++++++++++ .../java/datastructures/pair/PairTest.java | 35 +++++++++ 2 files changed, 107 insertions(+) create mode 100644 src/main/java/datastructures/pair/Pair.java create mode 100644 src/test/java/datastructures/pair/PairTest.java diff --git a/src/main/java/datastructures/pair/Pair.java b/src/main/java/datastructures/pair/Pair.java new file mode 100644 index 0000000..f1dd9b6 --- /dev/null +++ b/src/main/java/datastructures/pair/Pair.java @@ -0,0 +1,72 @@ +package datastructures.pair; + +import java.util.Objects; + +/** + * @author thepn + *

    + * Represents a simple Pair of two values: Key and Value + *

    + */ +public class Pair { + + /** + * key object + */ + private final K key; + + /** + * value object + */ + private final V value; + + public Pair(K key, V value) { + this.key = key; + this.value = value; + } + + @Override + public String toString() { + return "Pair{" + + "key=" + key + + ", value=" + value + + '}'; + } + + /** + * @return key + */ + public K getKey() { + return key; + } + + /** + * @return value + */ + public V getValue() { + return value; + } + + @Override + public boolean equals(Object o) { + if (this == o) { + return true; + } + + if (o instanceof Pair) { + Pair pair = (Pair) o; + + if (!Objects.equals(key, pair.key)) { + return false; + } + + if (!Objects.equals(value, pair.value)) { + return false; + } + + return true; + } + + return false; + } +} diff --git a/src/test/java/datastructures/pair/PairTest.java b/src/test/java/datastructures/pair/PairTest.java new file mode 100644 index 0000000..9cff493 --- /dev/null +++ b/src/test/java/datastructures/pair/PairTest.java @@ -0,0 +1,35 @@ +package datastructures.pair; + +import junit.framework.TestCase; + +/** + * @author thepn + */ +public class PairTest extends TestCase { + + public void testEquals(){ + final Pair a = new Pair<>(1, 2); + final Pair b = new Pair<>(1, 2); + final Pair c = new Pair<>(2, 1); + + assertTrue(a.equals(b)); + assertFalse(a.equals(c)); + assertFalse(a.equals(null)); + } + + public void testKey(){ + final Pair integerIntegerPair = new Pair<>(10, 4); + final int key = integerIntegerPair.getKey(); + + assertEquals(10, key); + assertNotSame(10, integerIntegerPair.getValue()); + } + + public void testValue(){ + final Pair integerIntegerPair = new Pair<>(10, 4); + final int value = integerIntegerPair.getValue(); + + assertEquals(4, value); + assertNotSame(4, integerIntegerPair.getKey()); + } +} From ba4f47e4d3cdc6844ef023e37611b1dd100ac20b Mon Sep 17 00:00:00 2001 From: thepn Date: Sat, 10 Oct 2020 01:15:36 +0200 Subject: [PATCH 014/108] Simplex algorithm (#18) * implement simplex tableau * provide some documentation * move package * provide better package structure * fix calculation of the object function return value * java doc * implement builder class and split implementation * add test case for simplex * java doc simplex * remove unnecessary main method * fix style checks * fix style checks * fix style checks * fix style checks * fix style checks * implement key value pair * use own pair --- docs/algorithms/random/package-summary.html | 8 +- docs/algorithms/random/package-tree.html | 8 +- docs/algorithms/search/BinarySearch.html | 4 +- docs/algorithms/search/LinearSearch.html | 8 +- docs/algorithms/search/package-frame.html | 2 - docs/algorithms/search/package-summary.html | 12 +- docs/algorithms/search/package-tree.html | 14 +- docs/algorithms/sort/BogoSort.html | 4 +- docs/algorithms/sort/BubbleSort.html | 8 +- docs/algorithms/sort/GnomeSort.html | 8 +- docs/algorithms/sort/InsertionSort.html | 8 +- docs/algorithms/sort/QuickSort.html | 8 +- docs/algorithms/sort/package-frame.html | 5 - docs/algorithms/sort/package-summary.html | 20 - docs/algorithms/sort/package-tree.html | 13 - docs/allclasses-frame.html | 20 +- docs/allclasses-noframe.html | 20 +- docs/datastructures/heap/MaxArrayHeap.html | 4 +- docs/datastructures/heap/package-frame.html | 1 - docs/datastructures/heap/package-summary.html | 6 - docs/datastructures/heap/package-tree.html | 9 - .../datastructures/list/SinglyLinkedList.html | 4 +- docs/datastructures/list/package-frame.html | 1 - docs/datastructures/list/package-summary.html | 4 - docs/datastructures/list/package-tree.html | 9 - docs/datastructures/math/Matrix.html | 4 +- docs/datastructures/math/Tuple.html | 8 +- docs/datastructures/math/package-frame.html | 2 - docs/datastructures/math/package-summary.html | 8 - docs/datastructures/math/package-tree.html | 10 - docs/datastructures/tree/BinaryTree.html | 4 +- docs/datastructures/tree/package-frame.html | 1 - docs/datastructures/tree/package-summary.html | 4 - docs/datastructures/tree/package-tree.html | 9 - docs/index-files/index-1.html | 15 +- docs/index-files/index-10.html | 4 - docs/index-files/index-11.html | 16 +- docs/index-files/index-12.html | 22 +- docs/index-files/index-13.html | 4 - docs/index-files/index-14.html | 4 + docs/index-files/index-15.html | 10 +- docs/index-files/index-16.html | 130 +----- docs/index-files/index-2.html | 20 +- docs/index-files/index-3.html | 20 +- docs/index-files/index-4.html | 6 +- docs/index-files/index-6.html | 12 +- docs/index-files/index-7.html | 8 +- docs/index-files/index-9.html | 16 +- docs/overview-frame.html | 5 +- docs/overview-summary.html | 14 +- docs/overview-tree.html | 34 +- docs/package-list | 5 +- docs/pattern/composite/CompositeElement.html | 4 +- docs/pattern/composite/Leaf.html | 4 +- docs/pattern/composite/package-frame.html | 1 - docs/pattern/composite/package-summary.html | 4 - docs/pattern/composite/package-tree.html | 9 - docs/problems/coinsamount/CoinsAmount.html | 4 +- .../coinsamount/impl/package-summary.html | 4 +- .../coinsamount/impl/package-tree.html | 4 +- docs/problems/coinsamount/package-frame.html | 4 - .../problems/coinsamount/package-summary.html | 15 - docs/problems/coinsamount/package-tree.html | 16 - .../distinctString/package-summary.html | 4 +- .../problems/distinctString/package-tree.html | 4 +- docs/serialized-form.html | 10 + .../optimization/simplex/Tableau.java | 61 +++ .../optimization/simplex/TableauBuilder.java | 158 +++++++ .../simplex/impl/TableauImpl.java | 390 ++++++++++++++++++ src/main/java/algorithms/sort/BogoSort.java | 4 +- .../datastructures/heap/MinArrayHeap.java | 11 +- .../problems/coinsamount/impl/BruteForce.java | 2 +- .../optimization/simplex/SimplexTest.java | 39 ++ .../algorithms/search/BinarySearchTest.java | 30 +- .../java/algorithms/sort/GnomeSortTest.java | 4 +- .../datastructures/heap/MinArrayHeapTest.java | 5 +- .../java/datastructures/math/MatrixTest.java | 4 +- .../java/datastructures/math/TupleTest.java | 2 +- .../datastructures/tree/BinaryTreeTest.java | 3 +- .../java/pattern/composite/CompositeTest.java | 3 +- 80 files changed, 893 insertions(+), 513 deletions(-) create mode 100644 src/main/java/algorithms/optimization/simplex/Tableau.java create mode 100644 src/main/java/algorithms/optimization/simplex/TableauBuilder.java create mode 100644 src/main/java/algorithms/optimization/simplex/impl/TableauImpl.java create mode 100644 src/test/java/algorithms/optimization/simplex/SimplexTest.java diff --git a/docs/algorithms/random/package-summary.html b/docs/algorithms/random/package-summary.html index e02aaf8..45c73eb 100644 --- a/docs/algorithms/random/package-summary.html +++ b/docs/algorithms/random/package-summary.html @@ -41,8 +41,8 @@
  • Frames
    • @@ -109,8 +109,8 @@

    Package algorithms.random

  • Frames
    • diff --git a/docs/algorithms/random/package-tree.html b/docs/algorithms/random/package-tree.html index ccc4471..3e34577 100644 --- a/docs/algorithms/random/package-tree.html +++ b/docs/algorithms/random/package-tree.html @@ -41,8 +41,8 @@
  • Frames
    • @@ -104,8 +104,8 @@

    Class Hierarchy

diff --git a/docs/pattern/composite/Leaf.html b/docs/pattern/composite/Leaf.html index 0891967..3822e22 100644 --- a/docs/pattern/composite/Leaf.html +++ b/docs/pattern/composite/Leaf.html @@ -1,6 +1,6 @@ - + Leaf (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -228,7 +228,7 @@

    list

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/pattern/composite/package-frame.html b/docs/pattern/composite/package-frame.html index 55af317..59e0b6d 100644 --- a/docs/pattern/composite/package-frame.html +++ b/docs/pattern/composite/package-frame.html @@ -1,6 +1,6 @@ - + pattern.composite (java-fundamentals documentation) diff --git a/docs/pattern/composite/package-summary.html b/docs/pattern/composite/package-summary.html index d2a9e6e..6742f29 100644 --- a/docs/pattern/composite/package-summary.html +++ b/docs/pattern/composite/package-summary.html @@ -1,6 +1,6 @@ - + pattern.composite (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -111,7 +111,7 @@

    Package pattern.composite

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/pattern/composite/package-tree.html b/docs/pattern/composite/package-tree.html index 1a1b2b2..f54e2ff 100644 --- a/docs/pattern/composite/package-tree.html +++ b/docs/pattern/composite/package-tree.html @@ -1,6 +1,6 @@ - + pattern.composite Class Hierarchy (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -103,7 +103,7 @@

    Class Hierarchy

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/pattern/singleton/ClassBasedEagerSingleton.html b/docs/pattern/singleton/ClassBasedEagerSingleton.html index adca47a..4b47434 100644 --- a/docs/pattern/singleton/ClassBasedEagerSingleton.html +++ b/docs/pattern/singleton/ClassBasedEagerSingleton.html @@ -1,6 +1,6 @@ - + ClassBasedEagerSingleton (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -187,7 +187,7 @@

    INSTANCE

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/pattern/singleton/ClassBasedLazySingleton.html b/docs/pattern/singleton/ClassBasedLazySingleton.html index 1e9fc78..388ce02 100644 --- a/docs/pattern/singleton/ClassBasedLazySingleton.html +++ b/docs/pattern/singleton/ClassBasedLazySingleton.html @@ -1,6 +1,6 @@ - + ClassBasedLazySingleton (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -187,7 +187,7 @@

    getInstance

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/pattern/singleton/package-frame.html b/docs/pattern/singleton/package-frame.html index 43ec849..e158c4c 100644 --- a/docs/pattern/singleton/package-frame.html +++ b/docs/pattern/singleton/package-frame.html @@ -1,6 +1,6 @@ - + pattern.singleton (java-fundamentals documentation) diff --git a/docs/pattern/singleton/package-summary.html b/docs/pattern/singleton/package-summary.html index 46f4b52..e9d5608 100644 --- a/docs/pattern/singleton/package-summary.html +++ b/docs/pattern/singleton/package-summary.html @@ -1,6 +1,6 @@ - + pattern.singleton (java-fundamentals documentation) @@ -35,14 +35,14 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • Frames
      • diff --git a/docs/pattern/singleton/package-tree.html b/docs/pattern/singleton/package-tree.html index 2c105bc..fcf78e9 100644 --- a/docs/pattern/singleton/package-tree.html +++ b/docs/pattern/singleton/package-tree.html @@ -1,6 +1,6 @@ - + pattern.singleton Class Hierarchy (java-fundamentals documentation) @@ -35,14 +35,14 @@
    • Class
    • Tree
    • Deprecated
      • -
    • Index
      • +
    • Index
    • Help
    • Frames
      • diff --git a/docs/pattern/strategy/ConcreteStrategy1.html b/docs/pattern/strategy/ConcreteStrategy1.html new file mode 100644 index 0000000..c36e883 --- /dev/null +++ b/docs/pattern/strategy/ConcreteStrategy1.html @@ -0,0 +1,277 @@ + + + + + +ConcreteStrategy1 (java-fundamentals documentation) + + + + + + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      + +
      + + +
      + + +
      +
      pattern.strategy
      +

      Class ConcreteStrategy1

      +
      +
      +
        +
      • java.lang.Object
        • +
      • +
          +
        • pattern.strategy.ConcreteStrategy1
          • +
        +
        • +
      +
      +
        +
      • +
        +
        All Implemented Interfaces:
        +
        Strategy
        +
        +
        +
        +
        public class ConcreteStrategy1
+extends java.lang.Object
+implements Strategy
        +
        • +
      +
      +
      +
        +
      • + +
          +
        • + + +

          Constructor Summary

          + + + + + + + + +
          Constructors 
          Constructor and Description
          ConcreteStrategy1() 
          +
          • +
        + +
          +
        • + + +

          Method Summary

          + + + + + + + + + + +
          All Methods Instance Methods Concrete Methods 
          Modifier and TypeMethod and Description
          intrunAlgorithm() 
          +
            +
          • + + +

            Methods inherited from class java.lang.Object

            +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
            • +
          +
          • +
        +
        • +
      +
      +
      +
        +
      • + +
          +
        • + + +

          Constructor Detail

          + + + +
            +
          • +

            ConcreteStrategy1

            +
            public ConcreteStrategy1()
            +
            • +
          +
          • +
        + + +
        • +
      +
      +
      + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      + +
      + + +
      + + + diff --git a/docs/pattern/strategy/ConcreteStrategy2.html b/docs/pattern/strategy/ConcreteStrategy2.html new file mode 100644 index 0000000..4fb3836 --- /dev/null +++ b/docs/pattern/strategy/ConcreteStrategy2.html @@ -0,0 +1,277 @@ + + + + + +ConcreteStrategy2 (java-fundamentals documentation) + + + + + + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      + +
      + + +
      + + +
      +
      pattern.strategy
      +

      Class ConcreteStrategy2

      +
      +
      +
        +
      • java.lang.Object
        • +
      • +
          +
        • pattern.strategy.ConcreteStrategy2
          • +
        +
        • +
      +
      +
        +
      • +
        +
        All Implemented Interfaces:
        +
        Strategy
        +
        +
        +
        +
        public class ConcreteStrategy2
+extends java.lang.Object
+implements Strategy
        +
        • +
      +
      +
      +
        +
      • + +
          +
        • + + +

          Constructor Summary

          + + + + + + + + +
          Constructors 
          Constructor and Description
          ConcreteStrategy2() 
          +
          • +
        + +
          +
        • + + +

          Method Summary

          + + + + + + + + + + +
          All Methods Instance Methods Concrete Methods 
          Modifier and TypeMethod and Description
          intrunAlgorithm() 
          +
            +
          • + + +

            Methods inherited from class java.lang.Object

            +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
            • +
          +
          • +
        +
        • +
      +
      +
      +
        +
      • + +
          +
        • + + +

          Constructor Detail

          + + + +
            +
          • +

            ConcreteStrategy2

            +
            public ConcreteStrategy2()
            +
            • +
          +
          • +
        + + +
        • +
      +
      +
      + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      + +
      + + +
      + + + diff --git a/docs/pattern/strategy/ConcreteStrategy3.html b/docs/pattern/strategy/ConcreteStrategy3.html new file mode 100644 index 0000000..f9d4799 --- /dev/null +++ b/docs/pattern/strategy/ConcreteStrategy3.html @@ -0,0 +1,277 @@ + + + + + +ConcreteStrategy3 (java-fundamentals documentation) + + + + + + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      + +
      + + +
      + + +
      +
      pattern.strategy
      +

      Class ConcreteStrategy3

      +
      +
      +
        +
      • java.lang.Object
        • +
      • +
          +
        • pattern.strategy.ConcreteStrategy3
          • +
        +
        • +
      +
      +
        +
      • +
        +
        All Implemented Interfaces:
        +
        Strategy
        +
        +
        +
        +
        public class ConcreteStrategy3
+extends java.lang.Object
+implements Strategy
        +
        • +
      +
      +
      +
        +
      • + +
          +
        • + + +

          Constructor Summary

          + + + + + + + + +
          Constructors 
          Constructor and Description
          ConcreteStrategy3() 
          +
          • +
        + +
          +
        • + + +

          Method Summary

          + + + + + + + + + + +
          All Methods Instance Methods Concrete Methods 
          Modifier and TypeMethod and Description
          intrunAlgorithm() 
          +
            +
          • + + +

            Methods inherited from class java.lang.Object

            +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
            • +
          +
          • +
        +
        • +
      +
      +
      +
        +
      • + +
          +
        • + + +

          Constructor Detail

          + + + +
            +
          • +

            ConcreteStrategy3

            +
            public ConcreteStrategy3()
            +
            • +
          +
          • +
        + + +
        • +
      +
      +
      + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      + +
      + + +
      + + + diff --git a/docs/pattern/strategy/Context.html b/docs/pattern/strategy/Context.html new file mode 100644 index 0000000..e300d25 --- /dev/null +++ b/docs/pattern/strategy/Context.html @@ -0,0 +1,271 @@ + + + + + +Context (java-fundamentals documentation) + + + + + + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      + +
      + + +
      + + +
      +
      pattern.strategy
      +

      Class Context

      +
      +
      +
        +
      • java.lang.Object
        • +
      • +
          +
        • pattern.strategy.Context
          • +
        +
        • +
      +
      +
        +
      • +
        +
        +
        public class Context
+extends java.lang.Object
        +
        A context for strategy class + Note that the Context is independent + It does not know which algorithm is going to run
        +
        • +
      +
      +
      +
        +
      • + +
          +
        • + + +

          Constructor Summary

          + + + + + + + + +
          Constructors 
          Constructor and Description
          Context() 
          +
          • +
        + +
          +
        • + + +

          Method Summary

          + + + + + + + + + + +
          All Methods Instance Methods Concrete Methods 
          Modifier and TypeMethod and Description
          voidsetStrategy(Strategy strategy) 
          +
            +
          • + + +

            Methods inherited from class java.lang.Object

            +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
            • +
          +
          • +
        +
        • +
      +
      +
      +
        +
      • + +
          +
        • + + +

          Constructor Detail

          + + + +
            +
          • +

            Context

            +
            public Context()
            +
            • +
          +
          • +
        + +
          +
        • + + +

          Method Detail

          + + + +
            +
          • +

            setStrategy

            +
            public void setStrategy(Strategy strategy)
            +
            • +
          +
          • +
        +
        • +
      +
      +
      + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      + +
      + + +
      + + + diff --git a/docs/pattern/strategy/Strategy.html b/docs/pattern/strategy/Strategy.html new file mode 100644 index 0000000..9be88d3 --- /dev/null +++ b/docs/pattern/strategy/Strategy.html @@ -0,0 +1,225 @@ + + + + + +Strategy (java-fundamentals documentation) + + + + + + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      +
        +
      • Detail: 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      +
      + + +
      + + +
      +
      pattern.strategy
      +

      Interface Strategy

      +
      +
      +
      +
        +
      • +
        +
        All Known Implementing Classes:
        +
        ConcreteStrategy1, ConcreteStrategy2, ConcreteStrategy3
        +
        +
        +
        +
        public interface Strategy
        +
        The interface for Strategy pattern. + Context uses this interface to communicate with its subtypes. + So the context do not need to know how the algorithm is implemented.
        +
        • +
      +
      +
      + +
      +
      +
        +
      • + +
          +
        • + + +

          Method Detail

          + + + +
            +
          • +

            runAlgorithm

            +
            int runAlgorithm()
            +
            • +
          +
          • +
        +
        • +
      +
      +
      + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      +
      +
        +
      • Summary: 
        • +
      • Nested | 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      +
        +
      • Detail: 
        • +
      • Field | 
        • +
      • Constr | 
        • +
      • Method
        • +
      +
      + + +
      + + + diff --git a/docs/pattern/strategy/package-frame.html b/docs/pattern/strategy/package-frame.html new file mode 100644 index 0000000..5582766 --- /dev/null +++ b/docs/pattern/strategy/package-frame.html @@ -0,0 +1,26 @@ + + + + + +pattern.strategy (java-fundamentals documentation) + + + + +

      pattern.strategy

      +
      +

      Interfaces

      + +

      Classes

      + +
      + + diff --git a/docs/pattern/strategy/package-summary.html b/docs/pattern/strategy/package-summary.html new file mode 100644 index 0000000..586b426 --- /dev/null +++ b/docs/pattern/strategy/package-summary.html @@ -0,0 +1,172 @@ + + + + + +pattern.strategy (java-fundamentals documentation) + + + + + + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      + + +
      + +
      +

      Package pattern.strategy

      +
      +
      +
        +
      • + + + + + + + + + + + + +
        Interface Summary 
        InterfaceDescription
        Strategy +
        The interface for Strategy pattern.
        +
        +
        • +
      • + + + + + + + + + + + + + + + + + + + + + + + + +
        Class Summary 
        ClassDescription
        ConcreteStrategy1 
        ConcreteStrategy2 
        ConcreteStrategy3 
        Context +
        A context for strategy class + Note that the Context is independent + It does not know which algorithm is going to run
        +
        +
        • +
      +
      + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      + + +
      + + + diff --git a/docs/pattern/strategy/package-tree.html b/docs/pattern/strategy/package-tree.html new file mode 100644 index 0000000..b2b467a --- /dev/null +++ b/docs/pattern/strategy/package-tree.html @@ -0,0 +1,141 @@ + + + + + +pattern.strategy Class Hierarchy (java-fundamentals documentation) + + + + + + + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      + + +
      + +
      +

      Hierarchy For Package pattern.strategy

      +Package Hierarchies: + +
      +
      +

      Class Hierarchy

      + +

      Interface Hierarchy

      + +
      + +
      + + +
      Skip navigation links
      + + + + +
      +
      + + + +
      + +
      + + +
      + + + diff --git a/docs/problems/anagram/Anagram.html b/docs/problems/anagram/Anagram.html index 3aeedaf..a246995 100644 --- a/docs/problems/anagram/Anagram.html +++ b/docs/problems/anagram/Anagram.html @@ -1,6 +1,6 @@ - + Anagram (java-fundamentals documentation) @@ -41,7 +41,7 @@
    • Class
    • Tree
    • Deprecated
      • -
    • Index
      • +
    • Index
    • Help
    @@ -173,7 +173,7 @@

    isAnagram

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/anagram/impl/ExternalMap.html b/docs/problems/anagram/impl/ExternalMap.html index e9fb01d..d68bec9 100644 --- a/docs/problems/anagram/impl/ExternalMap.html +++ b/docs/problems/anagram/impl/ExternalMap.html @@ -1,6 +1,6 @@ - + ExternalMap (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -228,7 +228,7 @@

    isAnagram

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/anagram/impl/Sorting.html b/docs/problems/anagram/impl/Sorting.html index cca63a1..8fb7098 100644 --- a/docs/problems/anagram/impl/Sorting.html +++ b/docs/problems/anagram/impl/Sorting.html @@ -1,6 +1,6 @@ - + Sorting (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -228,7 +228,7 @@

    isAnagram

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/anagram/impl/package-frame.html b/docs/problems/anagram/impl/package-frame.html index 3789f91..62794f0 100644 --- a/docs/problems/anagram/impl/package-frame.html +++ b/docs/problems/anagram/impl/package-frame.html @@ -1,6 +1,6 @@ - + problems.anagram.impl (java-fundamentals documentation) diff --git a/docs/problems/anagram/impl/package-summary.html b/docs/problems/anagram/impl/package-summary.html index 3109997..1d8dd7d 100644 --- a/docs/problems/anagram/impl/package-summary.html +++ b/docs/problems/anagram/impl/package-summary.html @@ -1,6 +1,6 @@ - + problems.anagram.impl (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -107,7 +107,7 @@

    Package problems.anagram.impl

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/anagram/impl/package-tree.html b/docs/problems/anagram/impl/package-tree.html index 38af348..627490c 100644 --- a/docs/problems/anagram/impl/package-tree.html +++ b/docs/problems/anagram/impl/package-tree.html @@ -1,6 +1,6 @@ - + problems.anagram.impl Class Hierarchy (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -99,7 +99,7 @@

    Class Hierarchy

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/anagram/package-frame.html b/docs/problems/anagram/package-frame.html index f03c77b..5c414cc 100644 --- a/docs/problems/anagram/package-frame.html +++ b/docs/problems/anagram/package-frame.html @@ -1,6 +1,6 @@ - + problems.anagram (java-fundamentals documentation) diff --git a/docs/problems/anagram/package-summary.html b/docs/problems/anagram/package-summary.html index 37d72d5..5e48860 100644 --- a/docs/problems/anagram/package-summary.html +++ b/docs/problems/anagram/package-summary.html @@ -1,6 +1,6 @@ - + problems.anagram (java-fundamentals documentation) @@ -35,13 +35,13 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
      • diff --git a/docs/problems/anagram/package-tree.html b/docs/problems/anagram/package-tree.html index 9084934..d75fe57 100644 --- a/docs/problems/anagram/package-tree.html +++ b/docs/problems/anagram/package-tree.html @@ -1,6 +1,6 @@ - + problems.anagram Class Hierarchy (java-fundamentals documentation) @@ -35,13 +35,13 @@
    • Class
    • Tree
    • Deprecated
      • -
    • Index
      • +
    • Index
    • Help
      diff --git a/docs/problems/checksubtree/CheckSubTree.html b/docs/problems/checksubtree/CheckSubTree.html index c41cfea..b74e35d 100644 --- a/docs/problems/checksubtree/CheckSubTree.html +++ b/docs/problems/checksubtree/CheckSubTree.html @@ -1,6 +1,6 @@ - + CheckSubTree (java-fundamentals documentation) @@ -41,7 +41,7 @@
    • Class
    • Tree
    • Deprecated
      • -
    • Index
      • +
    • Index
    • Help
    @@ -173,7 +173,7 @@

    isSubTree

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/checksubtree/impl/Recursive.html b/docs/problems/checksubtree/impl/Recursive.html index 0595053..cfbfd12 100644 --- a/docs/problems/checksubtree/impl/Recursive.html +++ b/docs/problems/checksubtree/impl/Recursive.html @@ -1,6 +1,6 @@ - + Recursive (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -228,7 +228,7 @@

    isSubTree

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/checksubtree/impl/package-frame.html b/docs/problems/checksubtree/impl/package-frame.html index 8bd5b4a..b80fcec 100644 --- a/docs/problems/checksubtree/impl/package-frame.html +++ b/docs/problems/checksubtree/impl/package-frame.html @@ -1,6 +1,6 @@ - + problems.checksubtree.impl (java-fundamentals documentation) diff --git a/docs/problems/checksubtree/impl/package-summary.html b/docs/problems/checksubtree/impl/package-summary.html index 50bc7af..aff4025 100644 --- a/docs/problems/checksubtree/impl/package-summary.html +++ b/docs/problems/checksubtree/impl/package-summary.html @@ -1,6 +1,6 @@ - + problems.checksubtree.impl (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -103,7 +103,7 @@

    Package problems.checksubtree.impl

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/checksubtree/impl/package-tree.html b/docs/problems/checksubtree/impl/package-tree.html index c653dd8..a9b4b17 100644 --- a/docs/problems/checksubtree/impl/package-tree.html +++ b/docs/problems/checksubtree/impl/package-tree.html @@ -1,6 +1,6 @@ - + problems.checksubtree.impl Class Hierarchy (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -98,7 +98,7 @@

    Class Hierarchy

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/checksubtree/package-frame.html b/docs/problems/checksubtree/package-frame.html index cd09a0b..5bc7633 100644 --- a/docs/problems/checksubtree/package-frame.html +++ b/docs/problems/checksubtree/package-frame.html @@ -1,6 +1,6 @@ - + problems.checksubtree (java-fundamentals documentation) diff --git a/docs/problems/checksubtree/package-summary.html b/docs/problems/checksubtree/package-summary.html index 3fa7567..47341bc 100644 --- a/docs/problems/checksubtree/package-summary.html +++ b/docs/problems/checksubtree/package-summary.html @@ -1,6 +1,6 @@ - + problems.checksubtree (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -103,7 +103,7 @@

    Package problems.checksubtree

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/checksubtree/package-tree.html b/docs/problems/checksubtree/package-tree.html index c7a624c..cde7226 100644 --- a/docs/problems/checksubtree/package-tree.html +++ b/docs/problems/checksubtree/package-tree.html @@ -1,6 +1,6 @@ - + problems.checksubtree Class Hierarchy (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -94,7 +94,7 @@

    Interface Hierarchy

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/checksubtree/resources/TreeNode.html b/docs/problems/checksubtree/resources/TreeNode.html index 894ed6d..1c852fd 100644 --- a/docs/problems/checksubtree/resources/TreeNode.html +++ b/docs/problems/checksubtree/resources/TreeNode.html @@ -1,6 +1,6 @@ - + TreeNode (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -273,7 +273,7 @@

    TreeNode

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/checksubtree/resources/package-frame.html b/docs/problems/checksubtree/resources/package-frame.html index 23f2edf..1a3cd98 100644 --- a/docs/problems/checksubtree/resources/package-frame.html +++ b/docs/problems/checksubtree/resources/package-frame.html @@ -1,6 +1,6 @@ - + problems.checksubtree.resources (java-fundamentals documentation) diff --git a/docs/problems/checksubtree/resources/package-summary.html b/docs/problems/checksubtree/resources/package-summary.html index 4930180..4d53ac1 100644 --- a/docs/problems/checksubtree/resources/package-summary.html +++ b/docs/problems/checksubtree/resources/package-summary.html @@ -1,6 +1,6 @@ - + problems.checksubtree.resources (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -103,7 +103,7 @@

    Package problems.checksubtree.resourcesClass
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/checksubtree/resources/package-tree.html b/docs/problems/checksubtree/resources/package-tree.html index e8a42cb..0d06a0d 100644 --- a/docs/problems/checksubtree/resources/package-tree.html +++ b/docs/problems/checksubtree/resources/package-tree.html @@ -1,6 +1,6 @@ - + problems.checksubtree.resources Class Hierarchy (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -98,7 +98,7 @@

    Class Hierarchy

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/coinsamount/CoinsAmount.html b/docs/problems/coinsamount/CoinsAmount.html index c65533e..ef00045 100644 --- a/docs/problems/coinsamount/CoinsAmount.html +++ b/docs/problems/coinsamount/CoinsAmount.html @@ -1,6 +1,6 @@ - + CoinsAmount (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -205,7 +205,7 @@

    filterLargeCoinTypes

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/coinsamount/impl/BruteForce.html b/docs/problems/coinsamount/impl/BruteForce.html index c4256dd..3f4a44e 100644 --- a/docs/problems/coinsamount/impl/BruteForce.html +++ b/docs/problems/coinsamount/impl/BruteForce.html @@ -1,6 +1,6 @@ - + BruteForce (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -259,7 +259,7 @@

    calculateAmount

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/coinsamount/impl/DynamicProgramming.html b/docs/problems/coinsamount/impl/DynamicProgramming.html index b8f1dc4..955ba44 100644 --- a/docs/problems/coinsamount/impl/DynamicProgramming.html +++ b/docs/problems/coinsamount/impl/DynamicProgramming.html @@ -1,6 +1,6 @@ - + DynamicProgramming (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -244,7 +244,7 @@

    calculateAmount

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/coinsamount/impl/package-frame.html b/docs/problems/coinsamount/impl/package-frame.html index afa85be..8ce602b 100644 --- a/docs/problems/coinsamount/impl/package-frame.html +++ b/docs/problems/coinsamount/impl/package-frame.html @@ -1,6 +1,6 @@ - + problems.coinsamount.impl (java-fundamentals documentation) diff --git a/docs/problems/coinsamount/impl/package-summary.html b/docs/problems/coinsamount/impl/package-summary.html index 26f8259..de5c76e 100644 --- a/docs/problems/coinsamount/impl/package-summary.html +++ b/docs/problems/coinsamount/impl/package-summary.html @@ -1,6 +1,6 @@ - + problems.coinsamount.impl (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -107,7 +107,7 @@

    Package problems.coinsamount.impl

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/coinsamount/impl/package-tree.html b/docs/problems/coinsamount/impl/package-tree.html index f402fac..15b26f6 100644 --- a/docs/problems/coinsamount/impl/package-tree.html +++ b/docs/problems/coinsamount/impl/package-tree.html @@ -1,6 +1,6 @@ - + problems.coinsamount.impl Class Hierarchy (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -99,7 +99,7 @@

    Class Hierarchy

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/coinsamount/package-frame.html b/docs/problems/coinsamount/package-frame.html index ea7aee1..8504300 100644 --- a/docs/problems/coinsamount/package-frame.html +++ b/docs/problems/coinsamount/package-frame.html @@ -1,6 +1,6 @@ - + problems.coinsamount (java-fundamentals documentation) diff --git a/docs/problems/coinsamount/package-summary.html b/docs/problems/coinsamount/package-summary.html index c7871a7..32b74a6 100644 --- a/docs/problems/coinsamount/package-summary.html +++ b/docs/problems/coinsamount/package-summary.html @@ -1,6 +1,6 @@ - + problems.coinsamount (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -103,7 +103,7 @@

    Package problems.coinsamount

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/coinsamount/package-tree.html b/docs/problems/coinsamount/package-tree.html index a676347..de457cd 100644 --- a/docs/problems/coinsamount/package-tree.html +++ b/docs/problems/coinsamount/package-tree.html @@ -1,6 +1,6 @@ - + problems.coinsamount Class Hierarchy (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -94,7 +94,7 @@

    Interface Hierarchy

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/distinctString/DistinctString.html b/docs/problems/distinctString/DistinctString.html index 155f35e..a3fdba8 100644 --- a/docs/problems/distinctString/DistinctString.html +++ b/docs/problems/distinctString/DistinctString.html @@ -1,6 +1,6 @@ - + DistinctString (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -171,7 +171,7 @@

    isDistinct

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/distinctString/impl/BruteForce.html b/docs/problems/distinctString/impl/BruteForce.html index 9816626..756bdd9 100644 --- a/docs/problems/distinctString/impl/BruteForce.html +++ b/docs/problems/distinctString/impl/BruteForce.html @@ -1,6 +1,6 @@ - + BruteForce (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -226,7 +226,7 @@

    isDistinct

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/distinctString/impl/ExternalArray.html b/docs/problems/distinctString/impl/ExternalArray.html index eb3ba0f..66e4055 100644 --- a/docs/problems/distinctString/impl/ExternalArray.html +++ b/docs/problems/distinctString/impl/ExternalArray.html @@ -1,6 +1,6 @@ - + ExternalArray (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -226,7 +226,7 @@

    isDistinct

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/distinctString/impl/Sorting.html b/docs/problems/distinctString/impl/Sorting.html index c2d312b..cf548fa 100644 --- a/docs/problems/distinctString/impl/Sorting.html +++ b/docs/problems/distinctString/impl/Sorting.html @@ -1,6 +1,6 @@ - + Sorting (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -226,7 +226,7 @@

    isDistinct

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/distinctString/impl/package-frame.html b/docs/problems/distinctString/impl/package-frame.html index 5de5587..64d2803 100644 --- a/docs/problems/distinctString/impl/package-frame.html +++ b/docs/problems/distinctString/impl/package-frame.html @@ -1,6 +1,6 @@ - + problems.distinctString.impl (java-fundamentals documentation) diff --git a/docs/problems/distinctString/impl/package-summary.html b/docs/problems/distinctString/impl/package-summary.html index ad7f9a5..579533f 100644 --- a/docs/problems/distinctString/impl/package-summary.html +++ b/docs/problems/distinctString/impl/package-summary.html @@ -1,6 +1,6 @@ - + problems.distinctString.impl (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -111,7 +111,7 @@

    Package problems.distinctString.impl

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/distinctString/impl/package-tree.html b/docs/problems/distinctString/impl/package-tree.html index 9ac44b2..f4fad8b 100644 --- a/docs/problems/distinctString/impl/package-tree.html +++ b/docs/problems/distinctString/impl/package-tree.html @@ -1,6 +1,6 @@ - + problems.distinctString.impl Class Hierarchy (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -100,7 +100,7 @@

    Class Hierarchy

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/distinctString/package-frame.html b/docs/problems/distinctString/package-frame.html index b8c5ff1..99efbf8 100644 --- a/docs/problems/distinctString/package-frame.html +++ b/docs/problems/distinctString/package-frame.html @@ -1,6 +1,6 @@ - + problems.distinctString (java-fundamentals documentation) diff --git a/docs/problems/distinctString/package-summary.html b/docs/problems/distinctString/package-summary.html index 932ad42..d1fdb8f 100644 --- a/docs/problems/distinctString/package-summary.html +++ b/docs/problems/distinctString/package-summary.html @@ -1,6 +1,6 @@ - + problems.distinctString (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -103,7 +103,7 @@

    Package problems.distinctString

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/distinctString/package-tree.html b/docs/problems/distinctString/package-tree.html index 05e14de..348b96c 100644 --- a/docs/problems/distinctString/package-tree.html +++ b/docs/problems/distinctString/package-tree.html @@ -1,6 +1,6 @@ - + problems.distinctString Class Hierarchy (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -94,7 +94,7 @@

    Interface Hierarchy

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/romannumeralconverter/RomanNumeralConverter.html b/docs/problems/romannumeralconverter/RomanNumeralConverter.html index c5facd5..49be9a4 100644 --- a/docs/problems/romannumeralconverter/RomanNumeralConverter.html +++ b/docs/problems/romannumeralconverter/RomanNumeralConverter.html @@ -1,6 +1,6 @@ - + RomanNumeralConverter (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -171,7 +171,7 @@

    convert

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/romannumeralconverter/impl/Converter.html b/docs/problems/romannumeralconverter/impl/Converter.html index 09b8b1b..8897f39 100644 --- a/docs/problems/romannumeralconverter/impl/Converter.html +++ b/docs/problems/romannumeralconverter/impl/Converter.html @@ -1,6 +1,6 @@ - + Converter (java-fundamentals documentation) @@ -41,7 +41,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -226,7 +226,7 @@

    convert

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/romannumeralconverter/impl/package-frame.html b/docs/problems/romannumeralconverter/impl/package-frame.html index fa77d34..3711293 100644 --- a/docs/problems/romannumeralconverter/impl/package-frame.html +++ b/docs/problems/romannumeralconverter/impl/package-frame.html @@ -1,6 +1,6 @@ - + problems.romannumeralconverter.impl (java-fundamentals documentation) diff --git a/docs/problems/romannumeralconverter/impl/package-summary.html b/docs/problems/romannumeralconverter/impl/package-summary.html index b34c4af..de4c0a0 100644 --- a/docs/problems/romannumeralconverter/impl/package-summary.html +++ b/docs/problems/romannumeralconverter/impl/package-summary.html @@ -1,6 +1,6 @@ - + problems.romannumeralconverter.impl (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -103,7 +103,7 @@

    Package problems.romannumeralconverter.im
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/romannumeralconverter/impl/package-tree.html b/docs/problems/romannumeralconverter/impl/package-tree.html index bd48d75..ff100ca 100644 --- a/docs/problems/romannumeralconverter/impl/package-tree.html +++ b/docs/problems/romannumeralconverter/impl/package-tree.html @@ -1,6 +1,6 @@ - + problems.romannumeralconverter.impl Class Hierarchy (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -98,7 +98,7 @@

    Class Hierarchy

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/romannumeralconverter/package-frame.html b/docs/problems/romannumeralconverter/package-frame.html index 502969c..85a75cd 100644 --- a/docs/problems/romannumeralconverter/package-frame.html +++ b/docs/problems/romannumeralconverter/package-frame.html @@ -1,6 +1,6 @@ - + problems.romannumeralconverter (java-fundamentals documentation) diff --git a/docs/problems/romannumeralconverter/package-summary.html b/docs/problems/romannumeralconverter/package-summary.html index 22dd882..937d409 100644 --- a/docs/problems/romannumeralconverter/package-summary.html +++ b/docs/problems/romannumeralconverter/package-summary.html @@ -1,6 +1,6 @@ - + problems.romannumeralconverter (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -103,7 +103,7 @@

    Package problems.romannumeralconverterClass
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/problems/romannumeralconverter/package-tree.html b/docs/problems/romannumeralconverter/package-tree.html index cb9b1ff..7483a54 100644 --- a/docs/problems/romannumeralconverter/package-tree.html +++ b/docs/problems/romannumeralconverter/package-tree.html @@ -1,6 +1,6 @@ - + problems.romannumeralconverter Class Hierarchy (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -94,7 +94,7 @@

    Interface Hierarchy

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • diff --git a/docs/serialized-form.html b/docs/serialized-form.html index b4717e8..0bab4df 100644 --- a/docs/serialized-form.html +++ b/docs/serialized-form.html @@ -1,6 +1,6 @@ - + Serialized Form (java-fundamentals documentation) @@ -35,7 +35,7 @@
  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • @@ -121,7 +121,7 @@

    value

  • Class
  • Tree
  • Deprecated
    • -
  • Index
    • +
  • Index
  • Help
    • From 84a3f66ffa587d88f9a0db046450353df2fa315e Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Sun, 10 Oct 2021 04:38:09 +0200 Subject: [PATCH 075/108] Fix link to Javadoc-Action in CONTRIBUTING.md --- CONTRIBUTING.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md index 9b9ea76..1f42f34 100644 --- a/CONTRIBUTING.md +++ b/CONTRIBUTING.md @@ -25,9 +25,9 @@ Please add JUnit tests to cover your changes within the [test package](https://g ### Documentation -Please make sure to document your code using javadoc if it's not instantly clear what some part does. From time to time we will also upload a "documentation" for the project based on the javadoc to . Creating the javadoc within the [docs folder](https://github.com/LorenzNickel/java-fundamentals/tree/master/docs) is a process we automated using a [GitHub-Action](https://github.com/LorenzNickel/java-fundamentals/blob/main/.github/workflows/javadoc-generator.yml), so you don't need to do that manually.
    +Please make sure to document your code using javadoc if it's not instantly clear what some part does. From time to time we will also upload a "documentation" for the project based on the javadoc to . Creating the javadoc within the [docs folder](https://github.com/LorenzNickel/java-fundamentals/tree/master/docs) is a process we automated using a [GitHub-Action](https://github.com/LorenzNickel/java-fundamentals/blob/master/.github/workflows/javadoc-generator.yml), so you don't need to do that manually.
    Consider also adding some markdown files to cover more complicated concepts which can not be expressed easily within javadoc (e.g. the description of a problem statement or a efficency analysis). ### Status checks -Requesting changes to this repository will trigger some automated checks. These checks test for example if your change decreases the test coverage of this project or if the project compiles and follows the [style guide](https://github.com/LorenzNickel/java-fundamentals/blob/master/docs/CONTRIBUTING.md#style-guide). Passing the continous integration check is mandatory, everything else is optional and will be considered by the maintainers on a case-by-case basis. \ No newline at end of file +Requesting changes to this repository will trigger some automated checks. These checks test for example if your change decreases the test coverage of this project or if the project compiles and follows the [style guide](https://github.com/LorenzNickel/java-fundamentals/blob/master/docs/CONTRIBUTING.md#style-guide). Passing the continous integration check is mandatory, everything else is optional and will be considered by the maintainers on a case-by-case basis. From 34aa57ae287c367e7a16c941f5648870b61b476c Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Sun, 10 Oct 2021 04:43:56 +0200 Subject: [PATCH 076/108] Skip CI for javadoc-builds [skip ci] --- .github/workflows/javadoc-generator.yml | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/.github/workflows/javadoc-generator.yml b/.github/workflows/javadoc-generator.yml index 14c0db9..3538980 100644 --- a/.github/workflows/javadoc-generator.yml +++ b/.github/workflows/javadoc-generator.yml @@ -22,4 +22,4 @@ jobs: run: | git config --global user.name 'Javadoc-Generator' git config --global user.email 'LorenzNickel@users.noreply.github.com' - if [[ `git status --porcelain` ]]; then echo "Uploading changes" && git add . && git commit -am "Re-generate javadoc for ${{ github.sha }}" -m "run-id: ${{ github.run_id }}" -m "run-number ${{ github.run_number }}" -m "run-attempt ${{ github.run_attempt }}" && git push; else echo "No changes to docs detected";fi + if [[ `git status --porcelain` ]]; then echo "Uploading changes" && git add . && git commit -am "Re-generate javadoc for ${{ github.sha }}" -m "[skip ci]" -m "run-id: ${{ github.run_id }}" -m "run-number ${{ github.run_number }}" -m "run-attempt ${{ github.run_attempt }}" && git push; else echo "No changes to docs detected";fi From 67e6423b8ce50eee66ffee14cb8354331ec84fd8 Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Sun, 10 Oct 2021 04:51:33 +0200 Subject: [PATCH 077/108] Only skip testing-cis for javadoc-generator only skip travis-ci and circle-ci (once supported) https://discuss.circleci.com/t/adding-circle-skip-to-commit-message-to-skip/2778 [skip-travis] --- .github/workflows/javadoc-generator.yml | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/.github/workflows/javadoc-generator.yml b/.github/workflows/javadoc-generator.yml index 3538980..97e0a01 100644 --- a/.github/workflows/javadoc-generator.yml +++ b/.github/workflows/javadoc-generator.yml @@ -22,4 +22,4 @@ jobs: run: | git config --global user.name 'Javadoc-Generator' git config --global user.email 'LorenzNickel@users.noreply.github.com' - if [[ `git status --porcelain` ]]; then echo "Uploading changes" && git add . && git commit -am "Re-generate javadoc for ${{ github.sha }}" -m "[skip ci]" -m "run-id: ${{ github.run_id }}" -m "run-number ${{ github.run_number }}" -m "run-attempt ${{ github.run_attempt }}" && git push; else echo "No changes to docs detected";fi + if [[ `git status --porcelain` ]]; then echo "Uploading changes" && git add . && git commit -am "Re-generate javadoc for ${{ github.sha }}" -m "[skip travis] [skip circle]" -m "run-id: ${{ github.run_id }}" -m "run-number ${{ github.run_number }}" -m "run-attempt ${{ github.run_attempt }}" && git push; else echo "No changes to docs detected";fi From 6990003cc7c38ad96bf98898be8081de8ab32220 Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Sun, 10 Oct 2021 04:58:48 +0200 Subject: [PATCH 078/108] Fix some javadoc warnings --- src/main/java/algorithms/random/ListShuffle.java | 8 ++++---- src/main/java/algorithms/search/JumpSearch.java | 2 +- src/main/java/algorithms/string/PalindromeCheck.java | 2 +- src/main/java/datastructures/heap/MaxArrayHeap.java | 2 +- src/main/java/datastructures/list/SinglyLinkedList.java | 6 +++--- src/main/java/datastructures/tree/BinaryTree.java | 4 ++-- 6 files changed, 12 insertions(+), 12 deletions(-) diff --git a/src/main/java/algorithms/random/ListShuffle.java b/src/main/java/algorithms/random/ListShuffle.java index ebeec89..23d3020 100644 --- a/src/main/java/algorithms/random/ListShuffle.java +++ b/src/main/java/algorithms/random/ListShuffle.java @@ -15,8 +15,8 @@ private ListShuffle() { /** * Using the fisher yates algorithm to shuffle a list * - * @param - * @param list + * @param The type of the list + * @param list The list that should be shuffled */ public static void fisherYatesShuffle(final List list) { final Random random = new Random(); @@ -36,8 +36,8 @@ public static void fisherYatesShuffle(final List list) { /** * Using the fisher yates algorithm to shuffle a list * - * @param - * @param list + * @param The type of the list + * @param list The array that should be shuffled */ public static void fisherYatesShuffle(T[] list) { final Random random = new Random(); diff --git a/src/main/java/algorithms/search/JumpSearch.java b/src/main/java/algorithms/search/JumpSearch.java index 30456fb..50adbcc 100644 --- a/src/main/java/algorithms/search/JumpSearch.java +++ b/src/main/java/algorithms/search/JumpSearch.java @@ -11,7 +11,7 @@ * than the element to be found, we perform m-1 comparisons more for linear search. * Therefore the total number of comparisons worst case will be ((n/m) + m-1) * - * @param + * @param The type of the array */ public class JumpSearch > { diff --git a/src/main/java/algorithms/string/PalindromeCheck.java b/src/main/java/algorithms/string/PalindromeCheck.java index 9f9c4e6..6cfbb44 100644 --- a/src/main/java/algorithms/string/PalindromeCheck.java +++ b/src/main/java/algorithms/string/PalindromeCheck.java @@ -11,7 +11,7 @@ public class PalindromeCheck { /** * Checks if a string is a palindrome. The algorithm runs in O(n). - * @param input + * @param input The input that should be checked * @return true if input string is a palindrome */ public boolean isPalindrome(String input) { diff --git a/src/main/java/datastructures/heap/MaxArrayHeap.java b/src/main/java/datastructures/heap/MaxArrayHeap.java index 0189acc..521254e 100644 --- a/src/main/java/datastructures/heap/MaxArrayHeap.java +++ b/src/main/java/datastructures/heap/MaxArrayHeap.java @@ -197,7 +197,7 @@ public E pop() { /** * Removes an element from the heap and rebuilds the max heap. * - * @param element + * @param element The element that should be removed from the heap * @return true if this heap contained the specified element */ public boolean remove(E element) { diff --git a/src/main/java/datastructures/list/SinglyLinkedList.java b/src/main/java/datastructures/list/SinglyLinkedList.java index 5fec795..8692491 100644 --- a/src/main/java/datastructures/list/SinglyLinkedList.java +++ b/src/main/java/datastructures/list/SinglyLinkedList.java @@ -35,7 +35,7 @@ public String toString() { /** * Add an element to the list. * - * @param element + * @param element The element that should be appended to the list */ public void add(E element) { Node node = new Node(element); @@ -46,7 +46,7 @@ public void add(E element) { /** * Remove an element from the list. * - * @param element + * @param element The element that should be removed from the list * @return if the element was found within the list */ public boolean remove(E element) { @@ -87,7 +87,7 @@ public boolean isEmpty() { } /** - * @param element + * @param element The element that should be checked * @return if the list contains the element at least once */ public boolean contains(E element) { diff --git a/src/main/java/datastructures/tree/BinaryTree.java b/src/main/java/datastructures/tree/BinaryTree.java index a0c7df0..0ab0daf 100644 --- a/src/main/java/datastructures/tree/BinaryTree.java +++ b/src/main/java/datastructures/tree/BinaryTree.java @@ -35,7 +35,7 @@ public BinaryTree(T value) { /** * Inserts an element in the proper subtree. Duplicates will not be inserted. * - * @param value + * @param value The value that should be inserted into the tree * @return true if an element was inserted. */ public boolean insert(T value) { @@ -86,7 +86,7 @@ public final boolean insertAll(T... values) { /** * Removes the element value from the tree * - * @param value + * @param value The value that should be removed from the tree * @return the deleted element */ public T remove(T value) { From 156357f9a95522357d825eea3b771374994a6047 Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Sun, 10 Oct 2021 05:01:28 +0200 Subject: [PATCH 079/108] Fix javadoc error --- src/main/java/algorithms/random/ListShuffle.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/main/java/algorithms/random/ListShuffle.java b/src/main/java/algorithms/random/ListShuffle.java index 23d3020..7d8b9bb 100644 --- a/src/main/java/algorithms/random/ListShuffle.java +++ b/src/main/java/algorithms/random/ListShuffle.java @@ -36,7 +36,7 @@ public static void fisherYatesShuffle(final List list) { /** * Using the fisher yates algorithm to shuffle a list * - * @param The type of the list + * @param The type of the list * @param list The array that should be shuffled */ public static void fisherYatesShuffle(T[] list) { From be282fb0dc91b69c215edf82627647a0ebd5fdc4 Mon Sep 17 00:00:00 2001 From: Javadoc-Generator Date: Sun, 10 Oct 2021 03:01:52 +0000 Subject: [PATCH 080/108] Re-generate javadoc for 156357f9a95522357d825eea3b771374994a6047 [skip travis] [skip circle] run-id: 1324903041 run-number 5 run-attempt 1 --- docs/algorithms/random/ListShuffle.html | 8 ++++---- docs/algorithms/search/JumpSearch.html | 2 +- docs/algorithms/string/PalindromeCheck.html | 2 +- docs/datastructures/heap/MaxArrayHeap.html | 2 +- docs/datastructures/list/SinglyLinkedList.html | 6 +++--- docs/datastructures/tree/BinaryTree.html | 4 ++-- 6 files changed, 12 insertions(+), 12 deletions(-) diff --git a/docs/algorithms/random/ListShuffle.html b/docs/algorithms/random/ListShuffle.html index de6057b..9381e0d 100644 --- a/docs/algorithms/random/ListShuffle.html +++ b/docs/algorithms/random/ListShuffle.html @@ -171,9 +171,9 @@

    fisherYatesShuffle

    Using the fisher yates algorithm to shuffle a list
    Type Parameters:
    -
    T -
    +
    T - The type of the list
    Parameters:
    -
    list -
    +
    list - The list that should be shuffled
    @@ -189,9 +189,9 @@

    fisherYatesShuffle

    Using the fisher yates algorithm to shuffle a list
    Type Parameters:
    -
    T -
    +
    T - The type of the list
    Parameters:
    -
    list -
    +
    list - The array that should be shuffled
    diff --git a/docs/algorithms/search/JumpSearch.html b/docs/algorithms/search/JumpSearch.html index 3ef3198..dc1d557 100644 --- a/docs/algorithms/search/JumpSearch.html +++ b/docs/algorithms/search/JumpSearch.html @@ -107,7 +107,7 @@

    Class JumpSearch<E extends java.la
  • Type Parameters:
    -
    E -
    +
    E - The type of the array

    diff --git a/docs/algorithms/string/PalindromeCheck.html b/docs/algorithms/string/PalindromeCheck.html index 4f90007..afd0ad6 100644 --- a/docs/algorithms/string/PalindromeCheck.html +++ b/docs/algorithms/string/PalindromeCheck.html @@ -199,7 +199,7 @@

    isPalindrome

    Checks if a string is a palindrome. The algorithm runs in O(n).
    Parameters:
    -
    input -
    +
    input - The input that should be checked
    Returns:
    true if input string is a palindrome
    diff --git a/docs/datastructures/heap/MaxArrayHeap.html b/docs/datastructures/heap/MaxArrayHeap.html index baf4b31..01eec03 100644 --- a/docs/datastructures/heap/MaxArrayHeap.html +++ b/docs/datastructures/heap/MaxArrayHeap.html @@ -467,7 +467,7 @@

    remove

    Removes an element from the heap and rebuilds the max heap.
    Parameters:
    -
    element -
    +
    element - The element that should be removed from the heap
    Returns:
    true if this heap contained the specified element
    diff --git a/docs/datastructures/list/SinglyLinkedList.html b/docs/datastructures/list/SinglyLinkedList.html index 43b429e..4e3c617 100644 --- a/docs/datastructures/list/SinglyLinkedList.html +++ b/docs/datastructures/list/SinglyLinkedList.html @@ -224,7 +224,7 @@

    add

    Add an element to the list.
    Parameters:
    -
    element -
    +
    element - The element that should be appended to the list
    • @@ -240,7 +240,7 @@

    remove

    Remove an element from the list.
    Parameters:
    -
    element -
    +
    element - The element that should be removed from the list
    Returns:
    if the element was found within the list
    @@ -283,7 +283,7 @@

    contains

    public boolean contains(E element)
    Parameters:
    -
    element -
    +
    element - The element that should be checked
    Returns:
    if the list contains the element at least once
    diff --git a/docs/datastructures/tree/BinaryTree.html b/docs/datastructures/tree/BinaryTree.html index 8a97ba4..c38ec98 100644 --- a/docs/datastructures/tree/BinaryTree.html +++ b/docs/datastructures/tree/BinaryTree.html @@ -263,7 +263,7 @@

    insert

    Inserts an element in the proper subtree. Duplicates will not be inserted.
    Parameters:
    -
    value -
    +
    value - The value that should be inserted into the tree
    Returns:
    true if an element was inserted.
    @@ -301,7 +301,7 @@

    remove

    Removes the element value from the tree
    Parameters:
    -
    value -
    +
    value - The value that should be removed from the tree
    Returns:
    the deleted element
    From 71b910f8c052c577cb08c00ad875e8a857663f81 Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Sun, 10 Oct 2021 05:04:01 +0200 Subject: [PATCH 081/108] Add badge for javadoc-status to README --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index 1f8e7d5..ee5fc0a 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,5 @@ # java-fundamentals +[![Javadoc Generator](https://github.com/LorenzNickel/java-fundamentals/actions/workflows/javadoc-generator.yml/badge.svg)](https://github.com/LorenzNickel/java-fundamentals/actions/workflows/javadoc-generator.yml) [![Travis Build Status](https://api.travis-ci.com/LorenzNickel/java-fundamentals.svg?branch=master)](https://app.travis-ci.com/github/LorenzNickel/java-fundamentals) [![Circle Build Status](https://circleci.com/gh/LorenzNickel/java-fundamentals.svg?style=shield)](https://circleci.com/gh/LorenzNickel/java-fundamentals/) From 34adeb2c44cad0852d578312ec0775002e206d33 Mon Sep 17 00:00:00 2001 From: Labnan Date: Thu, 14 Oct 2021 18:32:46 +0600 Subject: [PATCH 082/108] Create Classes For Observer Pattern --- src/main/java/pattern/observer/Observer.java | 71 ++++++++++++++++++++ 1 file changed, 71 insertions(+) create mode 100644 src/main/java/pattern/observer/Observer.java diff --git a/src/main/java/pattern/observer/Observer.java b/src/main/java/pattern/observer/Observer.java new file mode 100644 index 0000000..8e6b3ca --- /dev/null +++ b/src/main/java/pattern/observer/Observer.java @@ -0,0 +1,71 @@ +package pattern.observer; + + +import java.util.ArrayList; +import java.util.List; + +interface Observer { + void update(SubjectDataFormat data); +} + + +class Subject { + + int data; + + List observers = new ArrayList<>(); + + void addObserver(Observer observer) { + observers.add(observer); + } + + + void removeObserver(Observer observer) { + observers.remove(observer); + } + + + void setData(int data) { + this.data = data; + notifyObserver(); + } + + + private void notifyObserver() { + observers.forEach(observer -> observer.update(new SubjectDataFormat(data))); + } + +} + + +class SubjectDataFormat { + int data; + + SubjectDataFormat(int data){ + this.data = data; + } + + public int getData() { + return data; + } +} + + +class ConcreteObserver implements Observer { + + String description = "observer 1: "; + int observerData; + + @Override + public void update(SubjectDataFormat data) { + this.observerData = data.getData(); + } + + public int getObserverData() { + return observerData; + } +} + + + + From 287df5c7506e6372da41e79858dd7883d30e3e5c Mon Sep 17 00:00:00 2001 From: Labnan Date: Thu, 14 Oct 2021 19:08:04 +0600 Subject: [PATCH 083/108] Write Tests for Observer Pattern --- src/main/java/pattern/observer/Observer.java | 28 +++++++------ .../java/pattern/observer/ObserverTest.java | 40 +++++++++++++++++++ 2 files changed, 56 insertions(+), 12 deletions(-) create mode 100644 src/test/java/pattern/observer/ObserverTest.java diff --git a/src/main/java/pattern/observer/Observer.java b/src/main/java/pattern/observer/Observer.java index 8e6b3ca..973d177 100644 --- a/src/main/java/pattern/observer/Observer.java +++ b/src/main/java/pattern/observer/Observer.java @@ -5,13 +5,16 @@ import java.util.List; interface Observer { - void update(SubjectDataFormat data); + + void update(Data data); + + Data getData(); } class Subject { - int data; + Data data; List observers = new ArrayList<>(); @@ -25,23 +28,24 @@ void removeObserver(Observer observer) { } - void setData(int data) { + void setData(Data data) { this.data = data; notifyObserver(); } private void notifyObserver() { - observers.forEach(observer -> observer.update(new SubjectDataFormat(data))); + observers.forEach(observer -> observer.update(data)); } } -class SubjectDataFormat { +class Data { + int data; - SubjectDataFormat(int data){ + Data(int data) { this.data = data; } @@ -53,16 +57,16 @@ public int getData() { class ConcreteObserver implements Observer { - String description = "observer 1: "; - int observerData; + + Data observerData = null; @Override - public void update(SubjectDataFormat data) { - this.observerData = data.getData(); + public void update(Data data) { + this.observerData = data; } - public int getObserverData() { - return observerData; + public Data getData() { + return this.observerData; } } diff --git a/src/test/java/pattern/observer/ObserverTest.java b/src/test/java/pattern/observer/ObserverTest.java new file mode 100644 index 0000000..00ca5d6 --- /dev/null +++ b/src/test/java/pattern/observer/ObserverTest.java @@ -0,0 +1,40 @@ +package pattern.observer; + +import junit.framework.TestCase; + + +public class ObserverTest extends TestCase { + + Observer observer1 = new ConcreteObserver(); + Observer observer2 = new ConcreteObserver(); + + Subject subject = new Subject(); + Data data1 = new Data(10); + Data data2 = new Data(20); + Data data3 = new Data(30); + + public void test() { + + subject.addObserver(observer1); + subject.setData(data1); + + assertEquals(data1, observer1.getData()); + assertNull(observer2.getData()); + + subject.addObserver(observer2); + assertEquals(data1, observer1.getData()); + assertNull(observer2.getData()); + + subject.setData(data2); + assertEquals(data2, observer1.getData()); + assertEquals(data2, observer2.getData()); + + subject.removeObserver(observer1); + + subject.setData(data3); + assertEquals(data3, observer2.getData()); + assertEquals(data2, observer1.getData()); + + + } +} From b3129404364aedfd74af83ec60d119e818bd50af Mon Sep 17 00:00:00 2001 From: Labnan Date: Thu, 14 Oct 2021 19:11:49 +0600 Subject: [PATCH 084/108] Move Classes of Observer Pattern to Different Files --- .../pattern/observer/ConcreteObserver.java | 16 +++++ src/main/java/pattern/observer/Data.java | 14 ++++ src/main/java/pattern/observer/Observer.java | 64 +------------------ src/main/java/pattern/observer/Subject.java | 32 ++++++++++ 4 files changed, 63 insertions(+), 63 deletions(-) create mode 100644 src/main/java/pattern/observer/ConcreteObserver.java create mode 100644 src/main/java/pattern/observer/Data.java create mode 100644 src/main/java/pattern/observer/Subject.java diff --git a/src/main/java/pattern/observer/ConcreteObserver.java b/src/main/java/pattern/observer/ConcreteObserver.java new file mode 100644 index 0000000..46f79b7 --- /dev/null +++ b/src/main/java/pattern/observer/ConcreteObserver.java @@ -0,0 +1,16 @@ +package pattern.observer; + +public class ConcreteObserver implements Observer { + + + Data observerData = null; + + @Override + public void update(Data data) { + this.observerData = data; + } + + public Data getData() { + return this.observerData; + } +} diff --git a/src/main/java/pattern/observer/Data.java b/src/main/java/pattern/observer/Data.java new file mode 100644 index 0000000..13da945 --- /dev/null +++ b/src/main/java/pattern/observer/Data.java @@ -0,0 +1,14 @@ +package pattern.observer; + +public class Data { + + int data; + + Data(int data) { + this.data = data; + } + + public int getData() { + return data; + } +} diff --git a/src/main/java/pattern/observer/Observer.java b/src/main/java/pattern/observer/Observer.java index 973d177..45bb713 100644 --- a/src/main/java/pattern/observer/Observer.java +++ b/src/main/java/pattern/observer/Observer.java @@ -1,10 +1,7 @@ package pattern.observer; -import java.util.ArrayList; -import java.util.List; - -interface Observer { +public interface Observer { void update(Data data); @@ -12,64 +9,5 @@ interface Observer { } -class Subject { - - Data data; - - List observers = new ArrayList<>(); - - void addObserver(Observer observer) { - observers.add(observer); - } - - - void removeObserver(Observer observer) { - observers.remove(observer); - } - - - void setData(Data data) { - this.data = data; - notifyObserver(); - } - - - private void notifyObserver() { - observers.forEach(observer -> observer.update(data)); - } - -} - - -class Data { - - int data; - - Data(int data) { - this.data = data; - } - - public int getData() { - return data; - } -} - - -class ConcreteObserver implements Observer { - - - Data observerData = null; - - @Override - public void update(Data data) { - this.observerData = data; - } - - public Data getData() { - return this.observerData; - } -} - - diff --git a/src/main/java/pattern/observer/Subject.java b/src/main/java/pattern/observer/Subject.java new file mode 100644 index 0000000..289078a --- /dev/null +++ b/src/main/java/pattern/observer/Subject.java @@ -0,0 +1,32 @@ +package pattern.observer; + +import java.util.ArrayList; +import java.util.List; + +public class Subject { + + Data data; + + List observers = new ArrayList<>(); + + void addObserver(Observer observer) { + observers.add(observer); + } + + + void removeObserver(Observer observer) { + observers.remove(observer); + } + + + void setData(Data data) { + this.data = data; + notifyObserver(); + } + + + private void notifyObserver() { + observers.forEach(observer -> observer.update(data)); + } + +} From 3f02f2dc75e463c5dc0682e2aa15df702dea5f23 Mon Sep 17 00:00:00 2001 From: Labnan Date: Thu, 14 Oct 2021 19:53:20 +0600 Subject: [PATCH 085/108] Add javadoc --- .../pattern/observer/ConcreteObserver.java | 6 ++++++ src/main/java/pattern/observer/Data.java | 6 ++++++ src/main/java/pattern/observer/Observer.java | 18 +++++++++++++++++ src/main/java/pattern/observer/Subject.java | 20 ++++++++++++++++++- .../java/pattern/observer/ObserverTest.java | 4 ++++ 5 files changed, 53 insertions(+), 1 deletion(-) diff --git a/src/main/java/pattern/observer/ConcreteObserver.java b/src/main/java/pattern/observer/ConcreteObserver.java index 46f79b7..3da804c 100644 --- a/src/main/java/pattern/observer/ConcreteObserver.java +++ b/src/main/java/pattern/observer/ConcreteObserver.java @@ -1,5 +1,11 @@ package pattern.observer; +/** + * An implementation of the Observer interface + * + * @author Labnann + */ + public class ConcreteObserver implements Observer { diff --git a/src/main/java/pattern/observer/Data.java b/src/main/java/pattern/observer/Data.java index 13da945..085c0e6 100644 --- a/src/main/java/pattern/observer/Data.java +++ b/src/main/java/pattern/observer/Data.java @@ -1,5 +1,11 @@ package pattern.observer; +/** + * An arbitrary class for demonstration purpose. Not strictly related to the pattern + * + * @author Labnann + */ + public class Data { int data; diff --git a/src/main/java/pattern/observer/Observer.java b/src/main/java/pattern/observer/Observer.java index 45bb713..fdf066d 100644 --- a/src/main/java/pattern/observer/Observer.java +++ b/src/main/java/pattern/observer/Observer.java @@ -1,10 +1,28 @@ package pattern.observer; +/** + * Observer Interface to create Observers + * + * @author Labnann + */ public interface Observer { + /** + * Observer implementations receives Data from Subject with this method. The implementations + * handle the data in their own way + * + * @param data Data to receive from Subject + */ + void update(Data data); + /** + * Arbitrary method to demonstrate Observer Pattern + * + * @return Data + */ + Data getData(); } diff --git a/src/main/java/pattern/observer/Subject.java b/src/main/java/pattern/observer/Subject.java index 289078a..482c8bc 100644 --- a/src/main/java/pattern/observer/Subject.java +++ b/src/main/java/pattern/observer/Subject.java @@ -3,28 +3,46 @@ import java.util.ArrayList; import java.util.List; +/** + * Subject class for Observer Pattern + * + * @author Labnann + */ + + public class Subject { Data data; List observers = new ArrayList<>(); + /** + * @param observer to add to the observers list. + */ void addObserver(Observer observer) { observers.add(observer); } + /** + * @param observer to remove from the observers list + */ void removeObserver(Observer observer) { observers.remove(observer); } + /** + * Arbitrary Data changer function to simulate change of Subject's state + */ void setData(Data data) { this.data = data; notifyObserver(); } - + /** + * Method that notifies all the listed observer By calling Observer.update() + */ private void notifyObserver() { observers.forEach(observer -> observer.update(data)); } diff --git a/src/test/java/pattern/observer/ObserverTest.java b/src/test/java/pattern/observer/ObserverTest.java index 00ca5d6..a585856 100644 --- a/src/test/java/pattern/observer/ObserverTest.java +++ b/src/test/java/pattern/observer/ObserverTest.java @@ -2,6 +2,10 @@ import junit.framework.TestCase; +/** + * @author Labnann + */ + public class ObserverTest extends TestCase { From 18a562e58d6ceaedf4ac3aa3f210aee4875eb6cb Mon Sep 17 00:00:00 2001 From: Labnan <55809005+Labnann@users.noreply.github.com> Date: Fri, 15 Oct 2021 05:59:19 +0600 Subject: [PATCH 086/108] Add Observer pattern (#70) * Create Classes For Observer Pattern * Write Tests for Observer Pattern * Move Classes of Observer Pattern to Different Files * Add javadoc --- .../pattern/observer/ConcreteObserver.java | 22 ++++++++ src/main/java/pattern/observer/Data.java | 20 ++++++++ src/main/java/pattern/observer/Observer.java | 31 ++++++++++++ src/main/java/pattern/observer/Subject.java | 50 +++++++++++++++++++ .../java/pattern/observer/ObserverTest.java | 44 ++++++++++++++++ 5 files changed, 167 insertions(+) create mode 100644 src/main/java/pattern/observer/ConcreteObserver.java create mode 100644 src/main/java/pattern/observer/Data.java create mode 100644 src/main/java/pattern/observer/Observer.java create mode 100644 src/main/java/pattern/observer/Subject.java create mode 100644 src/test/java/pattern/observer/ObserverTest.java diff --git a/src/main/java/pattern/observer/ConcreteObserver.java b/src/main/java/pattern/observer/ConcreteObserver.java new file mode 100644 index 0000000..3da804c --- /dev/null +++ b/src/main/java/pattern/observer/ConcreteObserver.java @@ -0,0 +1,22 @@ +package pattern.observer; + +/** + * An implementation of the Observer interface + * + * @author Labnann + */ + +public class ConcreteObserver implements Observer { + + + Data observerData = null; + + @Override + public void update(Data data) { + this.observerData = data; + } + + public Data getData() { + return this.observerData; + } +} diff --git a/src/main/java/pattern/observer/Data.java b/src/main/java/pattern/observer/Data.java new file mode 100644 index 0000000..085c0e6 --- /dev/null +++ b/src/main/java/pattern/observer/Data.java @@ -0,0 +1,20 @@ +package pattern.observer; + +/** + * An arbitrary class for demonstration purpose. Not strictly related to the pattern + * + * @author Labnann + */ + +public class Data { + + int data; + + Data(int data) { + this.data = data; + } + + public int getData() { + return data; + } +} diff --git a/src/main/java/pattern/observer/Observer.java b/src/main/java/pattern/observer/Observer.java new file mode 100644 index 0000000..fdf066d --- /dev/null +++ b/src/main/java/pattern/observer/Observer.java @@ -0,0 +1,31 @@ +package pattern.observer; + +/** + * Observer Interface to create Observers + * + * @author Labnann + */ + +public interface Observer { + + /** + * Observer implementations receives Data from Subject with this method. The implementations + * handle the data in their own way + * + * @param data Data to receive from Subject + */ + + void update(Data data); + + /** + * Arbitrary method to demonstrate Observer Pattern + * + * @return Data + */ + + Data getData(); +} + + + + diff --git a/src/main/java/pattern/observer/Subject.java b/src/main/java/pattern/observer/Subject.java new file mode 100644 index 0000000..482c8bc --- /dev/null +++ b/src/main/java/pattern/observer/Subject.java @@ -0,0 +1,50 @@ +package pattern.observer; + +import java.util.ArrayList; +import java.util.List; + +/** + * Subject class for Observer Pattern + * + * @author Labnann + */ + + +public class Subject { + + Data data; + + List observers = new ArrayList<>(); + + /** + * @param observer to add to the observers list. + */ + void addObserver(Observer observer) { + observers.add(observer); + } + + /** + * @param observer to remove from the observers list + */ + + void removeObserver(Observer observer) { + observers.remove(observer); + } + + /** + * Arbitrary Data changer function to simulate change of Subject's state + */ + + void setData(Data data) { + this.data = data; + notifyObserver(); + } + + /** + * Method that notifies all the listed observer By calling Observer.update() + */ + private void notifyObserver() { + observers.forEach(observer -> observer.update(data)); + } + +} diff --git a/src/test/java/pattern/observer/ObserverTest.java b/src/test/java/pattern/observer/ObserverTest.java new file mode 100644 index 0000000..a585856 --- /dev/null +++ b/src/test/java/pattern/observer/ObserverTest.java @@ -0,0 +1,44 @@ +package pattern.observer; + +import junit.framework.TestCase; + +/** + * @author Labnann + */ + + +public class ObserverTest extends TestCase { + + Observer observer1 = new ConcreteObserver(); + Observer observer2 = new ConcreteObserver(); + + Subject subject = new Subject(); + Data data1 = new Data(10); + Data data2 = new Data(20); + Data data3 = new Data(30); + + public void test() { + + subject.addObserver(observer1); + subject.setData(data1); + + assertEquals(data1, observer1.getData()); + assertNull(observer2.getData()); + + subject.addObserver(observer2); + assertEquals(data1, observer1.getData()); + assertNull(observer2.getData()); + + subject.setData(data2); + assertEquals(data2, observer1.getData()); + assertEquals(data2, observer2.getData()); + + subject.removeObserver(observer1); + + subject.setData(data3); + assertEquals(data3, observer2.getData()); + assertEquals(data2, observer1.getData()); + + + } +} From 2c3276be729d63614cddc0b75d0b4b3cc3bf9692 Mon Sep 17 00:00:00 2001 From: Javadoc-Generator Date: Thu, 14 Oct 2021 23:59:35 +0000 Subject: [PATCH 087/108] Re-generate javadoc for 18a562e58d6ceaedf4ac3aa3f210aee4875eb6cb [skip travis] [skip circle] run-id: 1343983311 run-number 7 run-attempt 1 --- docs/allclasses-frame.html | 4 + docs/allclasses-noframe.html | 4 + docs/index-all.html | 52 +++- docs/overview-frame.html | 1 + docs/overview-summary.html | 28 +- docs/overview-tree.html | 5 + docs/package-list | 1 + docs/pattern/composite/package-summary.html | 4 +- docs/pattern/composite/package-tree.html | 4 +- docs/pattern/observer/ConcreteObserver.html | 308 ++++++++++++++++++++ docs/pattern/observer/Data.html | 235 +++++++++++++++ docs/pattern/observer/Observer.html | 251 ++++++++++++++++ docs/pattern/observer/Subject.html | 235 +++++++++++++++ docs/pattern/observer/package-frame.html | 25 ++ docs/pattern/observer/package-summary.html | 170 +++++++++++ docs/pattern/observer/package-tree.html | 140 +++++++++ docs/pattern/singleton/package-summary.html | 4 +- docs/pattern/singleton/package-tree.html | 4 +- 18 files changed, 1453 insertions(+), 22 deletions(-) create mode 100644 docs/pattern/observer/ConcreteObserver.html create mode 100644 docs/pattern/observer/Data.html create mode 100644 docs/pattern/observer/Observer.html create mode 100644 docs/pattern/observer/Subject.html create mode 100644 docs/pattern/observer/package-frame.html create mode 100644 docs/pattern/observer/package-summary.html create mode 100644 docs/pattern/observer/package-tree.html diff --git a/docs/allclasses-frame.html b/docs/allclasses-frame.html index b0d3025..3ea721b 100644 --- a/docs/allclasses-frame.html +++ b/docs/allclasses-frame.html @@ -30,11 +30,13 @@

    All Classes

  • CocktailSort
  • CoinsAmount
  • CompositeElement
    • +
  • ConcreteObserver
  • ConcreteStrategy1
  • ConcreteStrategy2
  • ConcreteStrategy3
  • Context
  • Converter
    • +
  • Data
  • DistinctString
  • DynamicProgramming
  • Euclidean
    • @@ -53,6 +55,7 @@

    All Classes

  • MergeSort
  • MinArrayHeap
  • Node
    • +
  • Observer
  • Pair
  • PalindromeCheck
  • QuickSort
    • @@ -66,6 +69,7 @@

    All Classes

  • Sorting
  • Sorting
  • Strategy
    • +
  • Subject
  • Tableau
  • TableauBuilder
  • TableauImpl
    • diff --git a/docs/allclasses-noframe.html b/docs/allclasses-noframe.html index fa07c87..8787f67 100644 --- a/docs/allclasses-noframe.html +++ b/docs/allclasses-noframe.html @@ -30,11 +30,13 @@

    All Classes

  • CocktailSort
  • CoinsAmount
  • CompositeElement
    • +
  • ConcreteObserver
  • ConcreteStrategy1
  • ConcreteStrategy2
  • ConcreteStrategy3
  • Context
  • Converter
    • +
  • Data
  • DistinctString
  • DynamicProgramming
  • Euclidean
    • @@ -53,6 +55,7 @@

    All Classes

  • MergeSort
  • MinArrayHeap
  • Node
    • +
  • Observer
  • Pair
  • PalindromeCheck
  • QuickSort
    • @@ -66,6 +69,7 @@

    All Classes

  • Sorting
  • Sorting
  • Strategy
    • +
  • Subject
  • Tableau
  • TableauBuilder
  • TableauImpl
    • diff --git a/docs/index-all.html b/docs/index-all.html index a187aec..12d6d63 100644 --- a/docs/index-all.html +++ b/docs/index-all.html @@ -67,7 +67,7 @@ -
    A B C D E F G H I J L M N P Q R S T V W  +
    A B C D E F G H I J L M N O P Q R S T U V W 

    A

    @@ -309,6 +309,12 @@

    C

     
    computeObjectValue() - Method in interface algorithms.optimization.simplex.Tableau
     
    +
    ConcreteObserver - Class in pattern.observer
    +
    +
    An implementation of the Observer interface
    +
    +
    ConcreteObserver() - Constructor for class pattern.observer.ConcreteObserver
    +
     
    ConcreteStrategy1 - Class in pattern.strategy
     
    ConcreteStrategy1() - Constructor for class pattern.strategy.ConcreteStrategy1
    @@ -345,6 +351,10 @@

    C

    D

    +
    Data - Class in pattern.observer
    +
    +
    An arbitrary class for demonstration purpose.
    +
    datastructures.heap - package datastructures.heap
     
    datastructures.list - package datastructures.list
    @@ -463,6 +473,14 @@

    G

     
    getClosedSet() - Method in class algorithms.search.astar.AStar
     
    +
    getData() - Method in class pattern.observer.ConcreteObserver
    +
     
    +
    getData() - Method in class pattern.observer.Data
    +
     
    +
    getData() - Method in interface pattern.observer.Observer
    +
    +
    Arbitrary method to demonstrate Observer Pattern
    +
    getFCost() - Method in class algorithms.search.astar.model.Node
     
    getFrom() - Method in class algorithms.search.astar.AStar
    @@ -713,6 +731,16 @@

    N

    Node constructor
    + + + +

    O

    +
    +
    Observer - Interface in pattern.observer
    +
    +
    Observer Interface to create Observers
    +
    +
    @@ -734,6 +762,8 @@

    P

     
    pattern.composite - package pattern.composite
     
    +
    pattern.observer - package pattern.observer
    +
     
    pattern.singleton - package pattern.singleton
     
    pattern.strategy - package pattern.strategy
    @@ -970,6 +1000,12 @@

    S

    The interface for Strategy pattern.
    +
    Subject - Class in pattern.observer
    +
    +
    Subject class for Observer Pattern
    +
    +
    Subject() - Constructor for class pattern.observer.Subject
    +
     
    swap(int, int) - Method in class datastructures.heap.MaxArrayHeap
    Swaps the two given elements.
    @@ -1031,6 +1067,18 @@

    T

    Tuple(T, T) - Constructor for class datastructures.math.Tuple
     
    + + + +

    U

    +
    +
    update(Data) - Method in class pattern.observer.ConcreteObserver
    +
     
    +
    update(Data) - Method in interface pattern.observer.Observer
    +
    +
    Observer implementations receives Data from Subject with this method.
    +
    +
    @@ -1055,7 +1103,7 @@

    W

    withB(T) - Method in class datastructures.math.Tuple
     
    -A B C D E F G H I J L M N P Q R S T V W 
    +A B C D E F G H I J L M N O P Q R S T U V W 
    diff --git a/docs/overview-frame.html b/docs/overview-frame.html index a569443..67173ff 100644 --- a/docs/overview-frame.html +++ b/docs/overview-frame.html @@ -30,6 +30,7 @@

    Packages

  • datastructures.tree
  • pattern.adapter
  • pattern.composite
    • +
  • pattern.observer
  • pattern.singleton
  • pattern.strategy
  • problems.anagram
    • diff --git a/docs/overview-summary.html b/docs/overview-summary.html index 41f9b9f..4eae8d2 100644 --- a/docs/overview-summary.html +++ b/docs/overview-summary.html @@ -148,54 +148,58 @@   -pattern.singleton +pattern.observer   -pattern.strategy +pattern.singleton   -problems.anagram +pattern.strategy   -problems.anagram.impl +problems.anagram   -problems.checksubtree +problems.anagram.impl   -problems.checksubtree.impl +problems.checksubtree   -problems.checksubtree.resources +problems.checksubtree.impl   -problems.coinsamount +problems.checksubtree.resources   -problems.coinsamount.impl +problems.coinsamount   -problems.distinctString +problems.coinsamount.impl   -problems.distinctString.impl +problems.distinctString   -problems.romannumeralconverter +problems.distinctString.impl   +problems.romannumeralconverter +  + + problems.romannumeralconverter.impl   diff --git a/docs/overview-tree.html b/docs/overview-tree.html index 2ecf6ba..dcd3e17 100644 --- a/docs/overview-tree.html +++ b/docs/overview-tree.html @@ -89,6 +89,7 @@

    Hierarchy For All Packages

  • datastructures.tree,
  • pattern.adapter,
  • pattern.composite,
    • +
  • pattern.observer,
  • pattern.singleton,
  • pattern.strategy,
  • problems.anagram,
    • @@ -128,11 +129,13 @@

    Class Hierarchy

  • pattern.singleton.ClassBasedLazySingleton
  • pattern.adapter.Client (implements pattern.adapter.ClientInterface)
  • algorithms.sort.CocktailSort
    • +
  • pattern.observer.ConcreteObserver (implements pattern.observer.Observer)
  • pattern.strategy.ConcreteStrategy1 (implements pattern.strategy.Strategy)
  • pattern.strategy.ConcreteStrategy2 (implements pattern.strategy.Strategy)
  • pattern.strategy.ConcreteStrategy3 (implements pattern.strategy.Strategy)
  • pattern.strategy.Context
  • problems.romannumeralconverter.impl.Converter (implements problems.romannumeralconverter.RomanNumeralConverter)
    • +
  • pattern.observer.Data
  • problems.coinsamount.impl.DynamicProgramming (implements problems.coinsamount.CoinsAmount)
  • algorithms.math.Euclidean
  • problems.distinctString.impl.ExternalArray (implements problems.distinctString.DistinctString)
    • @@ -159,6 +162,7 @@

    Class Hierarchy

  • datastructures.list.SinglyLinkedList<E>
  • problems.anagram.impl.Sorting (implements problems.anagram.Anagram)
  • problems.distinctString.impl.Sorting (implements problems.distinctString.DistinctString)
    • +
  • pattern.observer.Subject
  • algorithms.optimization.simplex.TableauBuilder
  • algorithms.optimization.simplex.impl.TableauImpl (implements algorithms.optimization.simplex.Tableau)
  • problems.checksubtree.resources.TreeNode
    • @@ -174,6 +178,7 @@

    Interface Hierarchy

  • pattern.adapter.ClientInterface
  • problems.coinsamount.CoinsAmount
  • problems.distinctString.DistinctString
    • +
  • pattern.observer.Observer
  • problems.romannumeralconverter.RomanNumeralConverter
  • pattern.adapter.ServiceInterface
  • pattern.strategy.Strategy
    • diff --git a/docs/package-list b/docs/package-list index 66b008d..e304a25 100644 --- a/docs/package-list +++ b/docs/package-list @@ -16,6 +16,7 @@ datastructures.pair datastructures.tree pattern.adapter pattern.composite +pattern.observer pattern.singleton pattern.strategy problems.anagram diff --git a/docs/pattern/composite/package-summary.html b/docs/pattern/composite/package-summary.html index 6742f29..223f296 100644 --- a/docs/pattern/composite/package-summary.html +++ b/docs/pattern/composite/package-summary.html @@ -42,7 +42,7 @@
    • Frames
      • @@ -118,7 +118,7 @@

      Package pattern.composite

      • Frames
        • diff --git a/docs/pattern/composite/package-tree.html b/docs/pattern/composite/package-tree.html index f54e2ff..8b5e864 100644 --- a/docs/pattern/composite/package-tree.html +++ b/docs/pattern/composite/package-tree.html @@ -42,7 +42,7 @@
        • Frames
          • @@ -110,7 +110,7 @@

          Class Hierarchy

          • Frames
            • diff --git a/docs/pattern/observer/ConcreteObserver.html b/docs/pattern/observer/ConcreteObserver.html new file mode 100644 index 0000000..477ef81 --- /dev/null +++ b/docs/pattern/observer/ConcreteObserver.html @@ -0,0 +1,308 @@ + + + + + +ConcreteObserver (java-fundamentals documentation) + + + + + + + +
            + + +
            Skip navigation links
            + + + + +
            +
            + + + +
            + +
            +
            +
              +
            • Summary: 
              • +
            • Nested | 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            + +
            + + +
            + + +
            +
            pattern.observer
            +

            Class ConcreteObserver

            +
            +
            +
              +
            • java.lang.Object
              • +
            • +
                +
              • pattern.observer.ConcreteObserver
                • +
              +
              • +
            +
            +
              +
            • +
              +
              All Implemented Interfaces:
              +
              Observer
              +
              +
              +
              +
              public class ConcreteObserver
+extends java.lang.Object
+implements Observer
              +
              An implementation of the Observer interface
              +
              • +
            +
            +
            +
              +
            • + +
                +
              • + + +

                Constructor Summary

                + + + + + + + + +
                Constructors 
                Constructor and Description
                ConcreteObserver() 
                +
                • +
              + +
                +
              • + + +

                Method Summary

                + + + + + + + + + + + + + + +
                All Methods Instance Methods Concrete Methods 
                Modifier and TypeMethod and Description
                DatagetData() +
                Arbitrary method to demonstrate Observer Pattern
                +
                voidupdate(Data data) +
                Observer implementations receives Data from Subject with this method.
                +
                +
                  +
                • + + +

                  Methods inherited from class java.lang.Object

                  +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
                  • +
                +
                • +
              +
              • +
            +
            +
            +
              +
            • + +
                +
              • + + +

                Constructor Detail

                + + + +
                  +
                • +

                  ConcreteObserver

                  +
                  public ConcreteObserver()
                  +
                  • +
                +
                • +
              + +
                +
              • + + +

                Method Detail

                + + + +
                  +
                • +

                  update

                  +
                  public void update(Data data)
                  +
                  Description copied from interface: Observer
                  +
                  Observer implementations receives Data from Subject with this method. The implementations + handle the data in their own way
                  +
                  +
                  Specified by:
                  +
                  update in interface Observer
                  +
                  Parameters:
                  +
                  data - Data to receive from Subject
                  +
                  +
                  • +
                + + + +
                  +
                • +

                  getData

                  +
                  public Data getData()
                  +
                  Description copied from interface: Observer
                  +
                  Arbitrary method to demonstrate Observer Pattern
                  +
                  +
                  Specified by:
                  +
                  getData in interface Observer
                  +
                  Returns:
                  +
                  Data
                  +
                  +
                  • +
                +
                • +
              +
              • +
            +
            +
            + + +
            + + +
            Skip navigation links
            + + + + +
            +
            + + + +
            + +
            +
            +
              +
            • Summary: 
              • +
            • Nested | 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            + +
            + + +
            + + + diff --git a/docs/pattern/observer/Data.html b/docs/pattern/observer/Data.html new file mode 100644 index 0000000..5c812a6 --- /dev/null +++ b/docs/pattern/observer/Data.html @@ -0,0 +1,235 @@ + + + + + +Data (java-fundamentals documentation) + + + + + + + +
            + + +
            Skip navigation links
            + + + + +
            +
            + + + +
            + +
            +
            +
              +
            • Summary: 
              • +
            • Nested | 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            +
              +
            • Detail: 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            +
            + + +
            + + +
            +
            pattern.observer
            +

            Class Data

            +
            +
            +
              +
            • java.lang.Object
              • +
            • +
                +
              • pattern.observer.Data
                • +
              +
              • +
            +
            +
              +
            • +
              +
              +
              public class Data
+extends java.lang.Object
              +
              An arbitrary class for demonstration purpose. Not strictly related to the pattern
              +
              • +
            +
            +
            +
              +
            • + +
                +
              • + + +

                Method Summary

                + + + + + + + + + + +
                All Methods Instance Methods Concrete Methods 
                Modifier and TypeMethod and Description
                intgetData() 
                +
                  +
                • + + +

                  Methods inherited from class java.lang.Object

                  +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
                  • +
                +
                • +
              +
              • +
            +
            +
            +
              +
            • + +
                +
              • + + +

                Method Detail

                + + + +
                  +
                • +

                  getData

                  +
                  public int getData()
                  +
                  • +
                +
                • +
              +
              • +
            +
            +
            + + +
            + + +
            Skip navigation links
            + + + + +
            +
            + + + +
            + +
            +
            +
              +
            • Summary: 
              • +
            • Nested | 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            +
              +
            • Detail: 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            +
            + + +
            + + + diff --git a/docs/pattern/observer/Observer.html b/docs/pattern/observer/Observer.html new file mode 100644 index 0000000..9314998 --- /dev/null +++ b/docs/pattern/observer/Observer.html @@ -0,0 +1,251 @@ + + + + + +Observer (java-fundamentals documentation) + + + + + + + +
            + + +
            Skip navigation links
            + + + + +
            +
            + + + +
            + +
            +
            +
              +
            • Summary: 
              • +
            • Nested | 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            +
              +
            • Detail: 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            +
            + + +
            + + +
            +
            pattern.observer
            +

            Interface Observer

            +
            +
            +
            +
              +
            • +
              +
              All Known Implementing Classes:
              +
              ConcreteObserver
              +
              +
              +
              +
              public interface Observer
              +
              Observer Interface to create Observers
              +
              • +
            +
            +
            +
              +
            • + +
                +
              • + + +

                Method Summary

                + + + + + + + + + + + + + + +
                All Methods Instance Methods Abstract Methods 
                Modifier and TypeMethod and Description
                DatagetData() +
                Arbitrary method to demonstrate Observer Pattern
                +
                voidupdate(Data data) +
                Observer implementations receives Data from Subject with this method.
                +
                +
                • +
              +
              • +
            +
            +
            +
              +
            • + +
                +
              • + + +

                Method Detail

                + + + +
                  +
                • +

                  update

                  +
                  void update(Data data)
                  +
                  Observer implementations receives Data from Subject with this method. The implementations + handle the data in their own way
                  +
                  +
                  Parameters:
                  +
                  data - Data to receive from Subject
                  +
                  +
                  • +
                + + + +
                  +
                • +

                  getData

                  +
                  Data getData()
                  +
                  Arbitrary method to demonstrate Observer Pattern
                  +
                  +
                  Returns:
                  +
                  Data
                  +
                  +
                  • +
                +
                • +
              +
              • +
            +
            +
            + + +
            + + +
            Skip navigation links
            + + + + +
            +
            + + + +
            + +
            +
            +
              +
            • Summary: 
              • +
            • Nested | 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            +
              +
            • Detail: 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            +
            + + +
            + + + diff --git a/docs/pattern/observer/Subject.html b/docs/pattern/observer/Subject.html new file mode 100644 index 0000000..6fdf392 --- /dev/null +++ b/docs/pattern/observer/Subject.html @@ -0,0 +1,235 @@ + + + + + +Subject (java-fundamentals documentation) + + + + + + + +
            + + +
            Skip navigation links
            + + + + +
            +
            + + + +
            + +
            +
            +
              +
            • Summary: 
              • +
            • Nested | 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            +
              +
            • Detail: 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            +
            + + +
            + + +
            +
            pattern.observer
            +

            Class Subject

            +
            +
            +
              +
            • java.lang.Object
              • +
            • +
                +
              • pattern.observer.Subject
                • +
              +
              • +
            +
            +
              +
            • +
              +
              +
              public class Subject
+extends java.lang.Object
              +
              Subject class for Observer Pattern
              +
              • +
            +
            +
            +
              +
            • + +
                +
              • + + +

                Constructor Summary

                + + + + + + + + +
                Constructors 
                Constructor and Description
                Subject() 
                +
                • +
              + +
                +
              • + + +

                Method Summary

                +
                  +
                • + + +

                  Methods inherited from class java.lang.Object

                  +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
                  • +
                +
                • +
              +
              • +
            +
            +
            +
              +
            • + +
                +
              • + + +

                Constructor Detail

                + + + +
                  +
                • +

                  Subject

                  +
                  public Subject()
                  +
                  • +
                +
                • +
              +
              • +
            +
            +
            + + +
            + + +
            Skip navigation links
            + + + + +
            +
            + + + +
            + +
            +
            +
              +
            • Summary: 
              • +
            • Nested | 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            +
              +
            • Detail: 
              • +
            • Field | 
              • +
            • Constr | 
              • +
            • Method
              • +
            +
            + + +
            + + + diff --git a/docs/pattern/observer/package-frame.html b/docs/pattern/observer/package-frame.html new file mode 100644 index 0000000..e35128d --- /dev/null +++ b/docs/pattern/observer/package-frame.html @@ -0,0 +1,25 @@ + + + + + +pattern.observer (java-fundamentals documentation) + + + + +

            pattern.observer

            +
            +

            Interfaces

            + +

            Classes

            + +
            + + diff --git a/docs/pattern/observer/package-summary.html b/docs/pattern/observer/package-summary.html new file mode 100644 index 0000000..20d6786 --- /dev/null +++ b/docs/pattern/observer/package-summary.html @@ -0,0 +1,170 @@ + + + + + +pattern.observer (java-fundamentals documentation) + + + + + + + +
            + + +
            Skip navigation links
            + + + + +
            +
            + + + +
            + +
            + + +
            + +
            +

            Package pattern.observer

            +
            +
            +
              +
            • + + + + + + + + + + + + +
              Interface Summary 
              InterfaceDescription
              Observer +
              Observer Interface to create Observers
              +
              +
              • +
            • + + + + + + + + + + + + + + + + + + + + +
              Class Summary 
              ClassDescription
              ConcreteObserver +
              An implementation of the Observer interface
              +
              Data +
              An arbitrary class for demonstration purpose.
              +
              Subject +
              Subject class for Observer Pattern
              +
              +
              • +
            +
            + +
            + + +
            Skip navigation links
            + + + + +
            +
            + + + +
            + +
            + + +
            + + + diff --git a/docs/pattern/observer/package-tree.html b/docs/pattern/observer/package-tree.html new file mode 100644 index 0000000..d49d56c --- /dev/null +++ b/docs/pattern/observer/package-tree.html @@ -0,0 +1,140 @@ + + + + + +pattern.observer Class Hierarchy (java-fundamentals documentation) + + + + + + + +
            + + +
            Skip navigation links
            + + + + +
            +
            + + + +
            + +
            + + +
            + +
            +

            Hierarchy For Package pattern.observer

            +Package Hierarchies: + +
            +
            +

            Class Hierarchy

            + +

            Interface Hierarchy

            + +
            + +
            + + +
            Skip navigation links
            + + + + +
            +
            + + + +
            + +
            + + +
            + + + diff --git a/docs/pattern/singleton/package-summary.html b/docs/pattern/singleton/package-summary.html index e9d5608..09f3051 100644 --- a/docs/pattern/singleton/package-summary.html +++ b/docs/pattern/singleton/package-summary.html @@ -41,7 +41,7 @@
            @@ -117,7 +117,7 @@

            Package pattern.singleton

            diff --git a/docs/pattern/singleton/package-tree.html b/docs/pattern/singleton/package-tree.html index fcf78e9..ff20064 100644 --- a/docs/pattern/singleton/package-tree.html +++ b/docs/pattern/singleton/package-tree.html @@ -41,7 +41,7 @@
            @@ -105,7 +105,7 @@

            Class Hierarchy

            From 878e0fdf62a9929c0f470660c4184e780c83217b Mon Sep 17 00:00:00 2001 From: nujovich Date: Fri, 15 Oct 2021 11:04:46 -0300 Subject: [PATCH 088/108] Basic impl of the perfect power algorithm --- .../java/algorithms/math/PerfectPower.java | 29 ++++++ .../algorithms/math/PerfectPowerTest.java | 96 +++++++++++++++++++ 2 files changed, 125 insertions(+) create mode 100644 src/main/java/algorithms/math/PerfectPower.java create mode 100644 src/test/java/algorithms/math/PerfectPowerTest.java diff --git a/src/main/java/algorithms/math/PerfectPower.java b/src/main/java/algorithms/math/PerfectPower.java new file mode 100644 index 0000000..3bbfc22 --- /dev/null +++ b/src/main/java/algorithms/math/PerfectPower.java @@ -0,0 +1,29 @@ +package algorithms.math; + +/** + * PerfectPower is a class that checks if a number n can be expressed as n=m^k, where m is the root + * and k is the exponent. + * + * @author nujovich + * @see + */ +public class PerfectPower { + + /** + * @param n int, natural number + * @return and array where the first element is the root and the second element is the exponent. + * @apiNote if n has more than one tuple, the algorithm returns only the first one found. + */ + public static int[] isPerfectPower(int n) { + for (int i = 2; ; i++) { + int root = (int) Math.round(Math.pow(n, 1.0 / i)); + if (root < 2) { + return null; + } + if (Math.pow(root, i) == n) { + return new int[]{root, i}; + } + } + } + +} diff --git a/src/test/java/algorithms/math/PerfectPowerTest.java b/src/test/java/algorithms/math/PerfectPowerTest.java new file mode 100644 index 0000000..c6198a3 --- /dev/null +++ b/src/test/java/algorithms/math/PerfectPowerTest.java @@ -0,0 +1,96 @@ +package algorithms.math; + +import java.util.Random; +import junit.framework.TestCase; +import org.junit.Test; + +import static java.lang.Math.log; +import static org.junit.Assert.assertArrayEquals; + +public class PerfectPowerTest extends TestCase { + + @Test + public void test0() { + assertNull("0 is not a perfect number", PerfectPower.isPerfectPower(0)); + } + + @Test + public void test1() { + assertNull("1 is not a perfect number", PerfectPower.isPerfectPower(1)); + } + + @Test + public void test2() { + assertNull("2 is not a perfect number", PerfectPower.isPerfectPower(2)); + } + + @Test + public void test3() { + assertNull("3 is not a perfect number", PerfectPower.isPerfectPower(3)); + } + + @Test + public void test4() { + assertArrayEquals("4 = 2^2", new int[]{2, 2}, PerfectPower.isPerfectPower(4)); + } + + @Test + public void test5() { + assertNull("5 is not a perfect power", PerfectPower.isPerfectPower(5)); + } + + @Test + public void test8() { + assertArrayEquals("8 = 2^3", new int[]{2, 3}, PerfectPower.isPerfectPower(8)); + } + + @Test + public void test9() { + assertArrayEquals("9 = 3^2", new int[]{3, 2}, PerfectPower.isPerfectPower(9)); + } + + @Test + public void testUpTo500() { + int[] pp = {4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 169, 196, 216, + 225, 243, 256, 289, 324, 343, 361, 400, 441, 484}; + for (int i : pp) { + assertNotNull(i + " is a perfect power", PerfectPower.isPerfectPower(i)); + } + } + + @Test + public void testRandomPerfectPowers() { + Random rnd = new Random(); + for (int i = 0; i < 100; i++) { + int m = rnd.nextInt(254) + 2; + int k = (int) (rnd.nextDouble() * (log(Integer.MAX_VALUE) / log(m) - 2.0) + 2.0); + int l = ipow(m, k); + int[] r = PerfectPower.isPerfectPower(l); + assertNotNull(l + " is a perfect power", r); + assertEquals(r[0] + "^" + r[1] + "!=" + l, l, ipow(r[0], r[1])); + } + } + + @Test + public void testRandomNumbers() { + Random rnd = new Random(); + for (int i = 0; i < 100; i++) { + int l = rnd.nextInt(Integer.MAX_VALUE); + int[] r = PerfectPower.isPerfectPower(l); + if (r != null) { + assertEquals(r[0] + "^" + r[1] + "!=" + l, l, ipow(r[0], r[1])); + } + } + } + + private static int ipow(int b, int e) { + int p = 1; + for (; e > 0; e >>= 1) { + if ((e & 1) == 1) { + p *= b; + } + b *= b; + } + return p; + } +} From e0e7d5b0b398c358d603832c6fe52000f09ceb17 Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Fri, 15 Oct 2021 20:44:33 +0200 Subject: [PATCH 089/108] Fix javadoc error --- src/main/java/algorithms/math/PerfectPower.java | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/src/main/java/algorithms/math/PerfectPower.java b/src/main/java/algorithms/math/PerfectPower.java index 3bbfc22..e9a0849 100644 --- a/src/main/java/algorithms/math/PerfectPower.java +++ b/src/main/java/algorithms/math/PerfectPower.java @@ -5,14 +5,14 @@ * and k is the exponent. * * @author nujovich - * @see + * @see */ public class PerfectPower { /** * @param n int, natural number - * @return and array where the first element is the root and the second element is the exponent. - * @apiNote if n has more than one tuple, the algorithm returns only the first one found. + * @return an array where the first element is the root and the second element is the exponent. If + * n has more than one tuple, the algorithm returns only the first one found. */ public static int[] isPerfectPower(int n) { for (int i = 2; ; i++) { From acc558a27c79658ba73a952ee9776fb707904a12 Mon Sep 17 00:00:00 2001 From: Javadoc-Generator Date: Fri, 15 Oct 2021 18:45:00 +0000 Subject: [PATCH 090/108] Re-generate javadoc for e0e7d5b0b398c358d603832c6fe52000f09ceb17 [skip travis] [skip circle] run-id: 1347102528 run-number 9 run-attempt 1 --- docs/algorithms/math/Euclidean.html | 4 +- docs/algorithms/math/PerfectPower.html | 281 ++++++++++++++++++++++ docs/algorithms/math/package-frame.html | 1 + docs/algorithms/math/package-summary.html | 7 + docs/algorithms/math/package-tree.html | 1 + docs/allclasses-frame.html | 1 + docs/allclasses-noframe.html | 1 + docs/index-all.html | 9 + docs/overview-tree.html | 1 + 9 files changed, 304 insertions(+), 2 deletions(-) create mode 100644 docs/algorithms/math/PerfectPower.html diff --git a/docs/algorithms/math/Euclidean.html b/docs/algorithms/math/Euclidean.html index 041d6b9..00be3e7 100644 --- a/docs/algorithms/math/Euclidean.html +++ b/docs/algorithms/math/Euclidean.html @@ -48,7 +48,7 @@
            • Frames
              • @@ -266,7 +266,7 @@

              gcdIterative

              • Frames
                • diff --git a/docs/algorithms/math/PerfectPower.html b/docs/algorithms/math/PerfectPower.html new file mode 100644 index 0000000..37a3b8e --- /dev/null +++ b/docs/algorithms/math/PerfectPower.html @@ -0,0 +1,281 @@ + + + + + +PerfectPower (java-fundamentals documentation) + + + + + + + +
                + + +
                Skip navigation links
                + + + + +
                +
                + + + +
                + +
                +
                +
                  +
                • Summary: 
                  • +
                • Nested | 
                  • +
                • Field | 
                  • +
                • Constr | 
                  • +
                • Method
                  • +
                + +
                + + +
                + + +
                +
                algorithms.math
                +

                Class PerfectPower

                +
                +
                +
                  +
                • java.lang.Object
                  • +
                • +
                    +
                  • algorithms.math.PerfectPower
                    • +
                  +
                  • +
                +
                +
                  +
                • +
                  +
                  +
                  public class PerfectPower
+extends java.lang.Object
                  +
                  PerfectPower is a class that checks if a number n can be expressed as n=m^k, where m is the root + and k is the exponent.
                  +
                  +
                  See Also:
                  +
                  +
                  +
                  • +
                +
                +
                +
                  +
                • + +
                    +
                  • + + +

                    Constructor Summary

                    + + + + + + + + +
                    Constructors 
                    Constructor and Description
                    PerfectPower() 
                    +
                    • +
                  + +
                    +
                  • + + +

                    Method Summary

                    + + + + + + + + + + +
                    All Methods Static Methods Concrete Methods 
                    Modifier and TypeMethod and Description
                    static int[]isPerfectPower(int n) 
                    +
                      +
                    • + + +

                      Methods inherited from class java.lang.Object

                      +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
                      • +
                    +
                    • +
                  +
                  • +
                +
                +
                +
                  +
                • + +
                    +
                  • + + +

                    Constructor Detail

                    + + + +
                      +
                    • +

                      PerfectPower

                      +
                      public PerfectPower()
                      +
                      • +
                    +
                    • +
                  + +
                    +
                  • + + +

                    Method Detail

                    + + + +
                      +
                    • +

                      isPerfectPower

                      +
                      public static int[] isPerfectPower(int n)
                      +
                      +
                      Parameters:
                      +
                      n - int, natural number
                      +
                      Returns:
                      +
                      an array where the first element is the root and the second element is the exponent. If + n has more than one tuple, the algorithm returns only the first one found.
                      +
                      +
                      • +
                    +
                    • +
                  +
                  • +
                +
                +
                + + +
                + + +
                Skip navigation links
                + + + + +
                +
                + + + +
                + +
                +
                +
                  +
                • Summary: 
                  • +
                • Nested | 
                  • +
                • Field | 
                  • +
                • Constr | 
                  • +
                • Method
                  • +
                + +
                + + +
                + + + diff --git a/docs/algorithms/math/package-frame.html b/docs/algorithms/math/package-frame.html index 32cd853..cd3e5ef 100644 --- a/docs/algorithms/math/package-frame.html +++ b/docs/algorithms/math/package-frame.html @@ -13,6 +13,7 @@

                Classes

              diff --git a/docs/algorithms/math/package-summary.html b/docs/algorithms/math/package-summary.html index 836bb00..46e89f1 100644 --- a/docs/algorithms/math/package-summary.html +++ b/docs/algorithms/math/package-summary.html @@ -86,6 +86,13 @@

              Package algorithms.math

              Simple implementation of the Euclidean algorithm
              + +PerfectPower + +
              PerfectPower is a class that checks if a number n can be expressed as n=m^k, where m is the root + and k is the exponent.
              + + diff --git a/docs/algorithms/math/package-tree.html b/docs/algorithms/math/package-tree.html index deeede5..c4de8b8 100644 --- a/docs/algorithms/math/package-tree.html +++ b/docs/algorithms/math/package-tree.html @@ -80,6 +80,7 @@

              Class Hierarchy

            • java.lang.Object
            diff --git a/docs/allclasses-frame.html b/docs/allclasses-frame.html index 3ea721b..e4e92bd 100644 --- a/docs/allclasses-frame.html +++ b/docs/allclasses-frame.html @@ -58,6 +58,7 @@

            All Classes

          • Observer
          • Pair
          • PalindromeCheck
            • +
          • PerfectPower
          • QuickSort
          • Recursive
          • RomanNumeralConverter
            • diff --git a/docs/allclasses-noframe.html b/docs/allclasses-noframe.html index 8787f67..2db704c 100644 --- a/docs/allclasses-noframe.html +++ b/docs/allclasses-noframe.html @@ -58,6 +58,7 @@

            All Classes

          • Observer
          • Pair
          • PalindromeCheck
            • +
          • PerfectPower
          • QuickSort
          • Recursive
          • RomanNumeralConverter
            • diff --git a/docs/index-all.html b/docs/index-all.html index 12d6d63..85fdda5 100644 --- a/docs/index-all.html +++ b/docs/index-all.html @@ -611,6 +611,8 @@

            I

            Checks if a string is a palindrome.
            +
            isPerfectPower(int) - Static method in class algorithms.math.PerfectPower
            +
             
            isSubTree(TreeNode, TreeNode) - Method in interface problems.checksubtree.CheckSubTree
             
            isSubTree(TreeNode, TreeNode) - Method in class problems.checksubtree.impl.Recursive
            @@ -768,6 +770,13 @@

            P

             
            pattern.strategy - package pattern.strategy
             
            +
            PerfectPower - Class in algorithms.math
            +
            +
            PerfectPower is a class that checks if a number n can be expressed as n=m^k, where m is the root + and k is the exponent.
            +
            +
            PerfectPower() - Constructor for class algorithms.math.PerfectPower
            +
             
            pivot(int, int) - Method in class algorithms.optimization.simplex.impl.TableauImpl
            pivotizes the tableau at row, col index
            diff --git a/docs/overview-tree.html b/docs/overview-tree.html index dcd3e17..eb205c2 100644 --- a/docs/overview-tree.html +++ b/docs/overview-tree.html @@ -154,6 +154,7 @@

            Class Hierarchy

          • algorithms.search.astar.model.Node
          • datastructures.pair.Pair<K,V>
          • algorithms.string.PalindromeCheck
            • +
          • algorithms.math.PerfectPower
          • algorithms.sort.QuickSort
          • problems.checksubtree.impl.Recursive (implements problems.checksubtree.CheckSubTree)
          • algorithms.sort.SelectionSort
            • From 4fb6edf9665fe0a6da7f83944a8cdddf826bc33d Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Fri, 15 Oct 2021 20:49:29 +0200 Subject: [PATCH 091/108] Create javadoc-generator-check.yml --- .github/workflows/javadoc-generator-check.yml | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 .github/workflows/javadoc-generator-check.yml diff --git a/.github/workflows/javadoc-generator-check.yml b/.github/workflows/javadoc-generator-check.yml new file mode 100644 index 0000000..8d8918a --- /dev/null +++ b/.github/workflows/javadoc-generator-check.yml @@ -0,0 +1,20 @@ +name: Javadoc Generator (check-only) +on: + pull_request: + push: + workflow_dispatch: +jobs: + re-generate: + runs-on: ubuntu-latest + steps: + - uses: actions/checkout@v2 + - uses: actions/setup-java@v2 + with: + distribution: "temurin" + java-version: "8" + - name: Delete javadoc + run: | + rm -r ${{ github.workspace }}/docs + - name: Generate new javadoc + run: | + javadoc -d ${{ github.workspace }}/docs -sourcepath ${{ github.workspace }}/src/main/java -subpackages . -windowtitle "java-fundamentals documentation" -notimestamp From bca782a49e760346cdc62ad652d3bf48462c8d2b Mon Sep 17 00:00:00 2001 From: nujovich Date: Mon, 18 Oct 2021 19:38:40 -0300 Subject: [PATCH 092/108] Impl of the longest consecutive string problem --- .../problems/longestconsecstring/README.md | 16 ++++++++++++ .../impl/LongestConsecString.java | 24 ++++++++++++++++++ .../LongestConsecStringTest.java | 25 +++++++++++++++++++ 3 files changed, 65 insertions(+) create mode 100644 src/main/java/problems/longestconsecstring/README.md create mode 100644 src/main/java/problems/longestconsecstring/impl/LongestConsecString.java create mode 100644 src/test/java/problems/longestconsecstring/LongestConsecStringTest.java diff --git a/src/main/java/problems/longestconsecstring/README.md b/src/main/java/problems/longestconsecstring/README.md new file mode 100644 index 0000000..b028a3f --- /dev/null +++ b/src/main/java/problems/longestconsecstring/README.md @@ -0,0 +1,16 @@ +**Longest consecutive string problem** + +Given an array(list) strarr of strings with n size and an integer k. The task is to return the first longest string consisting of k consecutive strings taken in the array. + +**Example:** + +strarr = ["tree", "foling", "trashy", "blue", "abcdef", "uvwxyz"], k = 2 + +Two strings are the longest: "folingtrashy" and "abcdefuvwxyz". +The first that came is "folingtrashy" so +longest_consec(strarr, 2) should return ONLY "folingtrashy". +If either of following constraints are met, the method should return an empty string. + +**Constraints** + +0 < k < n \ No newline at end of file diff --git a/src/main/java/problems/longestconsecstring/impl/LongestConsecString.java b/src/main/java/problems/longestconsecstring/impl/LongestConsecString.java new file mode 100644 index 0000000..f2eaaf6 --- /dev/null +++ b/src/main/java/problems/longestconsecstring/impl/LongestConsecString.java @@ -0,0 +1,24 @@ +package problems.longestconsecstring.impl; + +import java.util.Arrays; +import java.util.Comparator; +import java.util.stream.Collectors; +import java.util.stream.IntStream; + +/** + * @author nujovich + * Check README.md for guidelines + * + */ +public class LongestConsecString { + + public static String longestConsecString(String[] strarr, int k) { + if (k <= 0) { + return ""; + } + return IntStream.rangeClosed(0, strarr.length - k) + .mapToObj(i -> Arrays.stream(strarr, i, i + k) + .collect(Collectors.joining())).max(Comparator.comparingInt(String::length)).orElse(""); + } + +} diff --git a/src/test/java/problems/longestconsecstring/LongestConsecStringTest.java b/src/test/java/problems/longestconsecstring/LongestConsecStringTest.java new file mode 100644 index 0000000..eb6f5a6 --- /dev/null +++ b/src/test/java/problems/longestconsecstring/LongestConsecStringTest.java @@ -0,0 +1,25 @@ +package problems.longestconsecstring; + +import junit.framework.TestCase; +import org.junit.Test; +import problems.longestconsecstring.impl.LongestConsecString; + +public class LongestConsecStringTest extends TestCase { + + private static void testing(String actual, String expected) { + assertEquals(expected, actual); + } + @Test + public void test() { + testing(LongestConsecString + .longestConsecString(new String[] {"zone", "abigail", "theta", "form", "libe", "zas", "theta", "abigail"}, 2), "abigailtheta"); + testing(LongestConsecString.longestConsecString(new String[] {"ejjjjmmtthh", "zxxuueeg", "aanlljrrrxx", "dqqqaaabbb", "oocccffuucccjjjkkkjyyyeehh"}, 1), "oocccffuucccjjjkkkjyyyeehh"); + testing(LongestConsecString.longestConsecString(new String[] {}, 3), ""); + testing(LongestConsecString.longestConsecString(new String[] {"itvayloxrp","wkppqsztdkmvcuwvereiupccauycnjutlv","vweqilsfytihvrzlaodfixoyxvyuyvgpck"}, 2), "wkppqsztdkmvcuwvereiupccauycnjutlvvweqilsfytihvrzlaodfixoyxvyuyvgpck"); + testing(LongestConsecString.longestConsecString(new String[] {"wlwsasphmxx","owiaxujylentrklctozmymu","wpgozvxxiu"}, 2), "wlwsasphmxxowiaxujylentrklctozmymu"); + testing(LongestConsecString.longestConsecString(new String[] {"zone", "abigail", "theta", "form", "libe", "zas"}, -2), ""); + testing(LongestConsecString.longestConsecString(new String[] {"it","wkppv","ixoyx", "3452", "zzzzzzzzzzzz"}, 3), "ixoyx3452zzzzzzzzzzzz"); + testing(LongestConsecString.longestConsecString(new String[] {"it","wkppv","ixoyx", "3452", "zzzzzzzzzzzz"}, 15), ""); + testing(LongestConsecString.longestConsecString(new String[] {"it","wkppv","ixoyx", "3452", "zzzzzzzzzzzz"}, 0), ""); + } +} From 07927eb905cd47c22dd055eafddf0b4a0ed21758 Mon Sep 17 00:00:00 2001 From: Javadoc-Generator Date: Tue, 19 Oct 2021 01:08:46 +0000 Subject: [PATCH 093/108] Re-generate javadoc for bca782a49e760346cdc62ad652d3bf48462c8d2b [skip travis] [skip circle] run-id: 1357147253 run-number 11 run-attempt 1 --- docs/allclasses-frame.html | 1 + docs/allclasses-noframe.html | 1 + docs/index-all.html | 8 + docs/overview-frame.html | 1 + docs/overview-summary.html | 6 +- docs/overview-tree.html | 2 + docs/package-list | 1 + .../distinctString/impl/package-summary.html | 4 +- .../distinctString/impl/package-tree.html | 4 +- .../impl/LongestConsecString.html | 270 ++++++++++++++++++ .../impl/package-frame.html | 19 ++ .../impl/package-summary.html | 139 +++++++++ .../impl/package-tree.html | 134 +++++++++ .../package-summary.html | 4 +- .../romannumeralconverter/package-tree.html | 4 +- 15 files changed, 589 insertions(+), 9 deletions(-) create mode 100644 docs/problems/longestconsecstring/impl/LongestConsecString.html create mode 100644 docs/problems/longestconsecstring/impl/package-frame.html create mode 100644 docs/problems/longestconsecstring/impl/package-summary.html create mode 100644 docs/problems/longestconsecstring/impl/package-tree.html diff --git a/docs/allclasses-frame.html b/docs/allclasses-frame.html index e4e92bd..c1708f4 100644 --- a/docs/allclasses-frame.html +++ b/docs/allclasses-frame.html @@ -50,6 +50,7 @@

            All Classes

          • LinearSearch
          • ListShuffle
          • LongestCommonSubString
            • +
          • LongestConsecString
          • Matrix
          • MaxArrayHeap
          • MergeSort
            • diff --git a/docs/allclasses-noframe.html b/docs/allclasses-noframe.html index 2db704c..061c152 100644 --- a/docs/allclasses-noframe.html +++ b/docs/allclasses-noframe.html @@ -50,6 +50,7 @@

            All Classes

          • LinearSearch
          • ListShuffle
          • LongestCommonSubString
            • +
          • LongestConsecString
          • Matrix
          • MaxArrayHeap
          • MergeSort
            • diff --git a/docs/index-all.html b/docs/index-all.html index 85fdda5..5e3ca31 100644 --- a/docs/index-all.html +++ b/docs/index-all.html @@ -672,6 +672,12 @@

            L

             
            LongestCommonSubString - Class in algorithms.string
             
            +
            LongestConsecString - Class in problems.longestconsecstring.impl
            +
             
            +
            LongestConsecString() - Constructor for class problems.longestconsecstring.impl.LongestConsecString
            +
             
            +
            longestConsecString(String[], int) - Static method in class problems.longestconsecstring.impl.LongestConsecString
            +
             
            @@ -819,6 +825,8 @@

            P

             
            problems.distinctString.impl - package problems.distinctString.impl
             
            +
            problems.longestconsecstring.impl - package problems.longestconsecstring.impl
            +
             
            problems.romannumeralconverter - package problems.romannumeralconverter
             
            problems.romannumeralconverter.impl - package problems.romannumeralconverter.impl
            diff --git a/docs/overview-frame.html b/docs/overview-frame.html index 67173ff..3bc0991 100644 --- a/docs/overview-frame.html +++ b/docs/overview-frame.html @@ -42,6 +42,7 @@

            Packages

          • problems.coinsamount.impl
          • problems.distinctString
          • problems.distinctString.impl
            • +
          • problems.longestconsecstring.impl
          • problems.romannumeralconverter
          • problems.romannumeralconverter.impl
          diff --git a/docs/overview-summary.html b/docs/overview-summary.html index 4eae8d2..3d1f937 100644 --- a/docs/overview-summary.html +++ b/docs/overview-summary.html @@ -196,10 +196,14 @@   -problems.romannumeralconverter +problems.longestconsecstring.impl   +problems.romannumeralconverter +  + + problems.romannumeralconverter.impl   diff --git a/docs/overview-tree.html b/docs/overview-tree.html index eb205c2..f0967c3 100644 --- a/docs/overview-tree.html +++ b/docs/overview-tree.html @@ -101,6 +101,7 @@

          Hierarchy For All Packages

        • problems.coinsamount.impl,
        • problems.distinctString,
        • problems.distinctString.impl,
          • +
        • problems.longestconsecstring.impl,
        • problems.romannumeralconverter,
        • problems.romannumeralconverter.impl
        @@ -147,6 +148,7 @@

        Class Hierarchy

      • algorithms.search.LinearSearch<E>
      • algorithms.random.ListShuffle
      • algorithms.string.LongestCommonSubString
        • +
      • problems.longestconsecstring.impl.LongestConsecString
      • datastructures.math.Matrix
      • datastructures.heap.MaxArrayHeap<E>
      • algorithms.sort.MergeSort
        • diff --git a/docs/package-list b/docs/package-list index e304a25..e046143 100644 --- a/docs/package-list +++ b/docs/package-list @@ -28,5 +28,6 @@ problems.coinsamount problems.coinsamount.impl problems.distinctString problems.distinctString.impl +problems.longestconsecstring.impl problems.romannumeralconverter problems.romannumeralconverter.impl diff --git a/docs/problems/distinctString/impl/package-summary.html b/docs/problems/distinctString/impl/package-summary.html index 579533f..5699783 100644 --- a/docs/problems/distinctString/impl/package-summary.html +++ b/docs/problems/distinctString/impl/package-summary.html @@ -42,7 +42,7 @@
        • Frames
          • @@ -118,7 +118,7 @@

          Package problems.distinctString.impl

          • Frames
            • diff --git a/docs/problems/distinctString/impl/package-tree.html b/docs/problems/distinctString/impl/package-tree.html index f4fad8b..4df66fa 100644 --- a/docs/problems/distinctString/impl/package-tree.html +++ b/docs/problems/distinctString/impl/package-tree.html @@ -42,7 +42,7 @@
            • Frames
              • @@ -107,7 +107,7 @@

              Class Hierarchy

              • Frames
                • diff --git a/docs/problems/longestconsecstring/impl/LongestConsecString.html b/docs/problems/longestconsecstring/impl/LongestConsecString.html new file mode 100644 index 0000000..5282bf9 --- /dev/null +++ b/docs/problems/longestconsecstring/impl/LongestConsecString.html @@ -0,0 +1,270 @@ + + + + + +LongestConsecString (java-fundamentals documentation) + + + + + + + +
                + + +
                Skip navigation links
                + + + + +
                +
                +
                  +
                • Prev Class
                  • +
                • Next Class
                  • +
                + + +
                + +
                +
                +
                  +
                • Summary: 
                  • +
                • Nested | 
                  • +
                • Field | 
                  • +
                • Constr | 
                  • +
                • Method
                  • +
                + +
                + + +
                + + +
                +
                problems.longestconsecstring.impl
                +

                Class LongestConsecString

                +
                +
                +
                  +
                • java.lang.Object
                  • +
                • +
                    +
                  • problems.longestconsecstring.impl.LongestConsecString
                    • +
                  +
                  • +
                +
                +
                  +
                • +
                  +
                  +
                  public class LongestConsecString
+extends java.lang.Object
                  +
                  • +
                +
                +
                +
                  +
                • + + + +
                    +
                  • + + +

                    Method Summary

                    + + + + + + + + + + +
                    All Methods Static Methods Concrete Methods 
                    Modifier and TypeMethod and Description
                    static java.lang.StringlongestConsecString(java.lang.String[] strarr, + int k) 
                    +
                      +
                    • + + +

                      Methods inherited from class java.lang.Object

                      +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
                      • +
                    +
                    • +
                  +
                  • +
                +
                +
                +
                  +
                • + +
                    +
                  • + + +

                    Constructor Detail

                    + + + +
                      +
                    • +

                      LongestConsecString

                      +
                      public LongestConsecString()
                      +
                      • +
                    +
                    • +
                  + +
                    +
                  • + + +

                    Method Detail

                    + + + +
                      +
                    • +

                      longestConsecString

                      +
                      public static java.lang.String longestConsecString(java.lang.String[] strarr,
+                                                   int k)
                      +
                      • +
                    +
                    • +
                  +
                  • +
                +
                +
                + + +
                + + +
                Skip navigation links
                + + + + +
                +
                +
                  +
                • Prev Class
                  • +
                • Next Class
                  • +
                + + +
                + +
                +
                +
                  +
                • Summary: 
                  • +
                • Nested | 
                  • +
                • Field | 
                  • +
                • Constr | 
                  • +
                • Method
                  • +
                + +
                + + +
                + + + diff --git a/docs/problems/longestconsecstring/impl/package-frame.html b/docs/problems/longestconsecstring/impl/package-frame.html new file mode 100644 index 0000000..2a06957 --- /dev/null +++ b/docs/problems/longestconsecstring/impl/package-frame.html @@ -0,0 +1,19 @@ + + + + + +problems.longestconsecstring.impl (java-fundamentals documentation) + + + + +

                problems.longestconsecstring.impl

                +
                +

                Classes

                + +
                + + diff --git a/docs/problems/longestconsecstring/impl/package-summary.html b/docs/problems/longestconsecstring/impl/package-summary.html new file mode 100644 index 0000000..1104640 --- /dev/null +++ b/docs/problems/longestconsecstring/impl/package-summary.html @@ -0,0 +1,139 @@ + + + + + +problems.longestconsecstring.impl (java-fundamentals documentation) + + + + + + + +
                + + +
                Skip navigation links
                + + + + +
                +
                + + + +
                + +
                + + +
                + +
                +

                Package problems.longestconsecstring.impl

                +
                +
                + +
                + +
                + + +
                Skip navigation links
                + + + + +
                +
                + + + +
                + +
                + + +
                + + + diff --git a/docs/problems/longestconsecstring/impl/package-tree.html b/docs/problems/longestconsecstring/impl/package-tree.html new file mode 100644 index 0000000..ee881fe --- /dev/null +++ b/docs/problems/longestconsecstring/impl/package-tree.html @@ -0,0 +1,134 @@ + + + + + +problems.longestconsecstring.impl Class Hierarchy (java-fundamentals documentation) + + + + + + + +
                + + +
                Skip navigation links
                + + + + +
                +
                + + + +
                + +
                + + +
                + +
                +

                Hierarchy For Package problems.longestconsecstring.impl

                +Package Hierarchies: + +
                +
                +

                Class Hierarchy

                + +
                + +
                + + +
                Skip navigation links
                + + + + +
                +
                + + + +
                + +
                + + +
                + + + diff --git a/docs/problems/romannumeralconverter/package-summary.html b/docs/problems/romannumeralconverter/package-summary.html index 937d409..b836197 100644 --- a/docs/problems/romannumeralconverter/package-summary.html +++ b/docs/problems/romannumeralconverter/package-summary.html @@ -41,7 +41,7 @@
                @@ -109,7 +109,7 @@

                Package problems.romannumeralconverter
                  diff --git a/docs/problems/romannumeralconverter/package-tree.html b/docs/problems/romannumeralconverter/package-tree.html index 7483a54..5e08693 100644 --- a/docs/problems/romannumeralconverter/package-tree.html +++ b/docs/problems/romannumeralconverter/package-tree.html @@ -41,7 +41,7 @@
                  @@ -100,7 +100,7 @@

                  Interface Hierarchy

                  From 03cf600edb06a10b842b0dbcd9846eecf5d9efb8 Mon Sep 17 00:00:00 2001 From: Labnan Date: Mon, 25 Oct 2021 19:06:35 +0600 Subject: [PATCH 094/108] Create Memento Pattern --- src/main/java/pattern/memento/CareTaker.java | 27 +++++++++++ src/main/java/pattern/memento/Originator.java | 45 +++++++++++++++++++ 2 files changed, 72 insertions(+) create mode 100644 src/main/java/pattern/memento/CareTaker.java create mode 100644 src/main/java/pattern/memento/Originator.java diff --git a/src/main/java/pattern/memento/CareTaker.java b/src/main/java/pattern/memento/CareTaker.java new file mode 100644 index 0000000..b1ca256 --- /dev/null +++ b/src/main/java/pattern/memento/CareTaker.java @@ -0,0 +1,27 @@ +package pattern.memento; + +import java.util.ArrayList; +import java.util.List; + +public class CareTaker { + List savedStates = new ArrayList<>(); + + Originator originator = new Originator(""); + + void write(String string){ + originator.setState(string); + } + + String read(){ + return originator.getState(); + } + + void save(){ + savedStates.add(originator.saveToMemento()); + } + + void restore(int stateNumber){ + originator.restoreFromMemento(savedStates.get(stateNumber)); + } + +} diff --git a/src/main/java/pattern/memento/Originator.java b/src/main/java/pattern/memento/Originator.java new file mode 100644 index 0000000..5623646 --- /dev/null +++ b/src/main/java/pattern/memento/Originator.java @@ -0,0 +1,45 @@ +package pattern.memento; + + + +public class Originator { + String state; + + Originator(String state){ + this.state = state; + } + + void setState(String state){ + this.state = state; + } + + public String getState() { + return state; + } + + public Memento saveToMemento(){ + return new Memento(this.state); + } + + public void restoreFromMemento(Memento memento){ + this.state = memento.getState(); + } + + + static class Memento{ + String stateData; + + Memento(String state){ + this.stateData = state; + } + + String getState(){ + return this.stateData; + } + + } + + +} + + From d5fb39753113f39cbb32db3343d8742ffd66c909 Mon Sep 17 00:00:00 2001 From: Labnan Date: Mon, 25 Oct 2021 19:19:51 +0600 Subject: [PATCH 095/108] Make Attributes Private --- src/main/java/pattern/memento/CareTaker.java | 16 ++++++++++------ src/main/java/pattern/memento/Originator.java | 2 +- 2 files changed, 11 insertions(+), 7 deletions(-) diff --git a/src/main/java/pattern/memento/CareTaker.java b/src/main/java/pattern/memento/CareTaker.java index b1ca256..742e620 100644 --- a/src/main/java/pattern/memento/CareTaker.java +++ b/src/main/java/pattern/memento/CareTaker.java @@ -4,24 +4,28 @@ import java.util.List; public class CareTaker { - List savedStates = new ArrayList<>(); + private List savedStates = new ArrayList<>(); - Originator originator = new Originator(""); + private Originator originator = new Originator(""); - void write(String string){ + public void write(String string){ originator.setState(string); } - String read(){ + public String read(){ return originator.getState(); } - void save(){ + public void save(){ savedStates.add(originator.saveToMemento()); } - void restore(int stateNumber){ + public void load(int stateNumber){ originator.restoreFromMemento(savedStates.get(stateNumber)); } + public int getStateCount(){ + return this.savedStates.size(); + } + } diff --git a/src/main/java/pattern/memento/Originator.java b/src/main/java/pattern/memento/Originator.java index 5623646..0cd489e 100644 --- a/src/main/java/pattern/memento/Originator.java +++ b/src/main/java/pattern/memento/Originator.java @@ -3,7 +3,7 @@ public class Originator { - String state; + private String state; Originator(String state){ this.state = state; From 931faba46901704eff6377c286a064b1c6aa780a Mon Sep 17 00:00:00 2001 From: Labnan Date: Mon, 25 Oct 2021 19:20:16 +0600 Subject: [PATCH 096/108] Add Tests For Memento Pattern --- .../java/pattern/memento/MementoTest.java | 34 +++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 src/test/java/pattern/memento/MementoTest.java diff --git a/src/test/java/pattern/memento/MementoTest.java b/src/test/java/pattern/memento/MementoTest.java new file mode 100644 index 0000000..a3722c7 --- /dev/null +++ b/src/test/java/pattern/memento/MementoTest.java @@ -0,0 +1,34 @@ +package pattern.memento; + +import junit.framework.TestCase; + +public class MementoTest extends TestCase { + public void test(){ + CareTaker careTaker = new CareTaker(); + + assertEquals(0, careTaker.getStateCount()); + + careTaker.write("Hello"); + assertEquals("Hello", careTaker.read()); + careTaker.save(); + assertEquals(1, careTaker.getStateCount()); + + careTaker.write("Hello World"); + assertEquals("Hello World", careTaker.read()); + assertEquals(1, careTaker.getStateCount()); + careTaker.save(); + assertEquals(2, careTaker.getStateCount()); + + careTaker.load(0); + assertEquals("Hello", careTaker.read()); + assertEquals(2, careTaker.getStateCount()); + + + careTaker.load(1); + assertEquals("Hello World", careTaker.read()); + assertEquals(2, careTaker.getStateCount()); + + + + } +} From 673c28f6bda8dc229130a2bd33e647f3c98a6dbc Mon Sep 17 00:00:00 2001 From: Labnan Date: Mon, 25 Oct 2021 19:22:40 +0600 Subject: [PATCH 097/108] Make Originator and StateList Final --- src/main/java/pattern/memento/CareTaker.java | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/src/main/java/pattern/memento/CareTaker.java b/src/main/java/pattern/memento/CareTaker.java index 742e620..21f4eef 100644 --- a/src/main/java/pattern/memento/CareTaker.java +++ b/src/main/java/pattern/memento/CareTaker.java @@ -4,9 +4,8 @@ import java.util.List; public class CareTaker { - private List savedStates = new ArrayList<>(); - - private Originator originator = new Originator(""); + private final List savedStates = new ArrayList<>(); + private final Originator originator = new Originator(""); public void write(String string){ originator.setState(string); From 87d83c2aa28fe9f8402bdbe44c0ca44bcdfe7174 Mon Sep 17 00:00:00 2001 From: Labnan Date: Mon, 25 Oct 2021 19:25:14 +0600 Subject: [PATCH 098/108] Comply with Style Guidelines --- src/main/java/pattern/memento/CareTaker.java | 10 +++++----- src/main/java/pattern/memento/Originator.java | 14 +++++++------- 2 files changed, 12 insertions(+), 12 deletions(-) diff --git a/src/main/java/pattern/memento/CareTaker.java b/src/main/java/pattern/memento/CareTaker.java index 21f4eef..fa0f8b2 100644 --- a/src/main/java/pattern/memento/CareTaker.java +++ b/src/main/java/pattern/memento/CareTaker.java @@ -7,23 +7,23 @@ public class CareTaker { private final List savedStates = new ArrayList<>(); private final Originator originator = new Originator(""); - public void write(String string){ + public void write(String string) { originator.setState(string); } - public String read(){ + public String read() { return originator.getState(); } - public void save(){ + public void save() { savedStates.add(originator.saveToMemento()); } - public void load(int stateNumber){ + public void load(int stateNumber) { originator.restoreFromMemento(savedStates.get(stateNumber)); } - public int getStateCount(){ + public int getStateCount() { return this.savedStates.size(); } diff --git a/src/main/java/pattern/memento/Originator.java b/src/main/java/pattern/memento/Originator.java index 0cd489e..aca0f52 100644 --- a/src/main/java/pattern/memento/Originator.java +++ b/src/main/java/pattern/memento/Originator.java @@ -5,11 +5,11 @@ public class Originator { private String state; - Originator(String state){ + Originator(String state) { this.state = state; } - void setState(String state){ + void setState(String state) { this.state = state; } @@ -17,23 +17,23 @@ public String getState() { return state; } - public Memento saveToMemento(){ + public Memento saveToMemento() { return new Memento(this.state); } - public void restoreFromMemento(Memento memento){ + public void restoreFromMemento(Memento memento) { this.state = memento.getState(); } - static class Memento{ + static class Memento { String stateData; - Memento(String state){ + Memento(String state) { this.stateData = state; } - String getState(){ + String getState() { return this.stateData; } From 77249cbd7101bdb53a29ef5076e897b2190107ca Mon Sep 17 00:00:00 2001 From: Labnan Date: Mon, 25 Oct 2021 19:35:57 +0600 Subject: [PATCH 099/108] Add javadoc --- .../pattern/memento/{CareTaker.java => Caretaker.java} | 8 +++++++- src/main/java/pattern/memento/Originator.java | 5 +++++ src/test/java/pattern/memento/MementoTest.java | 2 +- 3 files changed, 13 insertions(+), 2 deletions(-) rename src/main/java/pattern/memento/{CareTaker.java => Caretaker.java} (82%) diff --git a/src/main/java/pattern/memento/CareTaker.java b/src/main/java/pattern/memento/Caretaker.java similarity index 82% rename from src/main/java/pattern/memento/CareTaker.java rename to src/main/java/pattern/memento/Caretaker.java index fa0f8b2..368dc9f 100644 --- a/src/main/java/pattern/memento/CareTaker.java +++ b/src/main/java/pattern/memento/Caretaker.java @@ -3,7 +3,13 @@ import java.util.ArrayList; import java.util.List; -public class CareTaker { +/** + * Caretaker class: The class that handles the save and load of Originator + * + * @author Labnann + */ + +public class Caretaker { private final List savedStates = new ArrayList<>(); private final Originator originator = new Originator(""); diff --git a/src/main/java/pattern/memento/Originator.java b/src/main/java/pattern/memento/Originator.java index aca0f52..fea8a3b 100644 --- a/src/main/java/pattern/memento/Originator.java +++ b/src/main/java/pattern/memento/Originator.java @@ -1,6 +1,11 @@ package pattern.memento; +/** + * Originator class: The class whose state is to be saved + * + * @author Labnann + */ public class Originator { private String state; diff --git a/src/test/java/pattern/memento/MementoTest.java b/src/test/java/pattern/memento/MementoTest.java index a3722c7..036ed89 100644 --- a/src/test/java/pattern/memento/MementoTest.java +++ b/src/test/java/pattern/memento/MementoTest.java @@ -4,7 +4,7 @@ public class MementoTest extends TestCase { public void test(){ - CareTaker careTaker = new CareTaker(); + Caretaker careTaker = new Caretaker(); assertEquals(0, careTaker.getStateCount()); From f3cba41b262459723ba5b344c551972b0a0c69c3 Mon Sep 17 00:00:00 2001 From: Labnan Date: Mon, 25 Oct 2021 19:47:08 +0600 Subject: [PATCH 100/108] Remove CareTake's Ability To Change Originator --- src/main/java/pattern/memento/Caretaker.java | 10 ++---- src/main/java/pattern/memento/Originator.java | 9 ++--- .../java/pattern/memento/MementoTest.java | 36 +++++++++---------- 3 files changed, 24 insertions(+), 31 deletions(-) diff --git a/src/main/java/pattern/memento/Caretaker.java b/src/main/java/pattern/memento/Caretaker.java index 368dc9f..55dee70 100644 --- a/src/main/java/pattern/memento/Caretaker.java +++ b/src/main/java/pattern/memento/Caretaker.java @@ -11,14 +11,10 @@ public class Caretaker { private final List savedStates = new ArrayList<>(); - private final Originator originator = new Originator(""); + private final Originator originator; - public void write(String string) { - originator.setState(string); - } - - public String read() { - return originator.getState(); + Caretaker(Originator originator) { + this.originator = originator; } public void save() { diff --git a/src/main/java/pattern/memento/Originator.java b/src/main/java/pattern/memento/Originator.java index fea8a3b..4bc3bad 100644 --- a/src/main/java/pattern/memento/Originator.java +++ b/src/main/java/pattern/memento/Originator.java @@ -8,17 +8,14 @@ */ public class Originator { - private String state; + private String state = ""; - Originator(String state) { - this.state = state; - } - void setState(String state) { + void write(String state) { this.state = state; } - public String getState() { + public String read() { return state; } diff --git a/src/test/java/pattern/memento/MementoTest.java b/src/test/java/pattern/memento/MementoTest.java index 036ed89..4f28d1d 100644 --- a/src/test/java/pattern/memento/MementoTest.java +++ b/src/test/java/pattern/memento/MementoTest.java @@ -3,32 +3,32 @@ import junit.framework.TestCase; public class MementoTest extends TestCase { - public void test(){ - Caretaker careTaker = new Caretaker(); - assertEquals(0, careTaker.getStateCount()); + public void test() { - careTaker.write("Hello"); - assertEquals("Hello", careTaker.read()); - careTaker.save(); - assertEquals(1, careTaker.getStateCount()); + Originator originator = new Originator(); + Caretaker caretaker = new Caretaker(originator); - careTaker.write("Hello World"); - assertEquals("Hello World", careTaker.read()); - assertEquals(1, careTaker.getStateCount()); - careTaker.save(); - assertEquals(2, careTaker.getStateCount()); + assertEquals(0, caretaker.getStateCount()); - careTaker.load(0); - assertEquals("Hello", careTaker.read()); - assertEquals(2, careTaker.getStateCount()); + originator.write("Hello"); + assertEquals("Hello", originator.read()); + caretaker.save(); + assertEquals(1, caretaker.getStateCount()); + originator.write("Hello World"); + assertEquals("Hello World", originator.read()); + caretaker.save(); + assertEquals(2, caretaker.getStateCount()); - careTaker.load(1); - assertEquals("Hello World", careTaker.read()); - assertEquals(2, careTaker.getStateCount()); + caretaker.load(0); + assertEquals("Hello", originator.read()); + assertEquals(2, caretaker.getStateCount()); + caretaker.load(1); + assertEquals("Hello World", originator.read()); + assertEquals(2, caretaker.getStateCount()); } } From 1573eec23768b64c6fead6bf2acef65ae2cedf54 Mon Sep 17 00:00:00 2001 From: Javadoc-Generator Date: Mon, 25 Oct 2021 20:09:01 +0000 Subject: [PATCH 101/108] Re-generate javadoc for 113a5c1ac0b31414dfe82d35dd57b0fa33da3d2a [skip travis] [skip circle] run-id: 1382752242 run-number 12 run-attempt 1 --- docs/allclasses-frame.html | 2 + docs/allclasses-noframe.html | 2 + docs/index-all.html | 24 ++ docs/overview-frame.html | 1 + docs/overview-summary.html | 32 ++- docs/overview-tree.html | 3 + docs/package-list | 1 + docs/pattern/composite/package-summary.html | 4 +- docs/pattern/composite/package-tree.html | 4 +- docs/pattern/memento/Caretaker.html | 261 +++++++++++++++++ docs/pattern/memento/Originator.html | 295 ++++++++++++++++++++ docs/pattern/memento/package-frame.html | 20 ++ docs/pattern/memento/package-summary.html | 147 ++++++++++ docs/pattern/memento/package-tree.html | 135 +++++++++ docs/pattern/observer/package-summary.html | 4 +- docs/pattern/observer/package-tree.html | 4 +- 16 files changed, 917 insertions(+), 22 deletions(-) create mode 100644 docs/pattern/memento/Caretaker.html create mode 100644 docs/pattern/memento/Originator.html create mode 100644 docs/pattern/memento/package-frame.html create mode 100644 docs/pattern/memento/package-summary.html create mode 100644 docs/pattern/memento/package-tree.html diff --git a/docs/allclasses-frame.html b/docs/allclasses-frame.html index c1708f4..68b9136 100644 --- a/docs/allclasses-frame.html +++ b/docs/allclasses-frame.html @@ -22,6 +22,7 @@

                  All Classes

                • BruteForce
                • BubbleSort
                • CaesarCipher
                  • +
                • Caretaker
                • CheckSubTree
                • ClassBasedEagerSingleton
                • ClassBasedLazySingleton
                  • @@ -57,6 +58,7 @@

                  All Classes

                • MinArrayHeap
                • Node
                • Observer
                  • +
                • Originator
                • Pair
                • PalindromeCheck
                • PerfectPower
                  • diff --git a/docs/allclasses-noframe.html b/docs/allclasses-noframe.html index 061c152..7856f15 100644 --- a/docs/allclasses-noframe.html +++ b/docs/allclasses-noframe.html @@ -22,6 +22,7 @@

                  All Classes

                • BruteForce
                • BubbleSort
                • CaesarCipher
                  • +
                • Caretaker
                • CheckSubTree
                • ClassBasedEagerSingleton
                • ClassBasedLazySingleton
                  • @@ -57,6 +58,7 @@

                  All Classes

                • MinArrayHeap
                • Node
                • Observer
                  • +
                • Originator
                • Pair
                • PalindromeCheck
                • PerfectPower
                  • diff --git a/docs/index-all.html b/docs/index-all.html index 5e3ca31..50aec35 100644 --- a/docs/index-all.html +++ b/docs/index-all.html @@ -257,6 +257,10 @@

                  C

                  Calculates a common substring with maximum length of two strings using an approach based on recursion
                  +
                  Caretaker - Class in pattern.memento
                  +
                  +
                  Caretaker class: The class that handles the save and load of Originator
                  +
                  checkShorterPath(Node, double) - Method in class algorithms.search.astar.model.Node
                  Checks whether a shorter path is found
                  @@ -511,6 +515,8 @@

                  G

                   
                  getPrevious() - Method in class algorithms.search.astar.model.Node
                   
                  +
                  getStateCount() - Method in class pattern.memento.Caretaker
                  +
                   
                  getStatus() - Method in class algorithms.search.astar.model.Node
                   
                  getSteps() - Method in class algorithms.search.astar.AStar
                  @@ -670,6 +676,8 @@

                  L

                   
                  ListShuffle - Class in algorithms.random
                   
                  +
                  load(int) - Method in class pattern.memento.Caretaker
                  +
                   
                  LongestCommonSubString - Class in algorithms.string
                   
                  LongestConsecString - Class in problems.longestconsecstring.impl
                  @@ -748,6 +756,12 @@

                  O

                  Observer Interface to create Observers
                  +
                  Originator - Class in pattern.memento
                  +
                  +
                  Originator class: The class whose state is to be saved
                  +
                  +
                  Originator() - Constructor for class pattern.memento.Originator
                  +
                   
                  @@ -770,6 +784,8 @@

                  P

                   
                  pattern.composite - package pattern.composite
                   
                  +
                  pattern.memento - package pattern.memento
                  +
                   
                  pattern.observer - package pattern.observer
                   
                  pattern.singleton - package pattern.singleton
                  @@ -855,6 +871,8 @@

                  R

                  Sorts the array using randomized quick sort algorithm
                  +
                  read() - Method in class pattern.memento.Originator
                  +
                   
                  recursive(int) - Static method in class algorithms.sequence.FibonacciSequence
                  Return the number in n position in Fibonacci Sequence (recursive)
                  @@ -881,6 +899,8 @@

                  R

                  removeChild(Base) - Method in class pattern.composite.CompositeElement
                   
                  +
                  restoreFromMemento(Originator.Memento) - Method in class pattern.memento.Originator
                  +
                   
                  right - Variable in class problems.checksubtree.resources.TreeNode
                   
                  rightChild(int) - Method in class datastructures.heap.MaxArrayHeap
                  @@ -903,6 +923,10 @@

                  R

                  S

                  +
                  save() - Method in class pattern.memento.Caretaker
                  +
                   
                  +
                  saveToMemento() - Method in class pattern.memento.Originator
                  +
                   
                  searchFor(E) - Method in class algorithms.search.JumpSearch
                   
                  searchFor(E) - Method in class algorithms.search.LinearSearch
                  diff --git a/docs/overview-frame.html b/docs/overview-frame.html index 3bc0991..e329288 100644 --- a/docs/overview-frame.html +++ b/docs/overview-frame.html @@ -30,6 +30,7 @@

                  Packages

                • datastructures.tree
                • pattern.adapter
                • pattern.composite
                  • +
                • pattern.memento
                • pattern.observer
                • pattern.singleton
                • pattern.strategy
                  • diff --git a/docs/overview-summary.html b/docs/overview-summary.html index 3d1f937..0d74a35 100644 --- a/docs/overview-summary.html +++ b/docs/overview-summary.html @@ -148,62 +148,66 @@   -pattern.observer +pattern.memento   -pattern.singleton +pattern.observer   -pattern.strategy +pattern.singleton   -problems.anagram +pattern.strategy   -problems.anagram.impl +problems.anagram   -problems.checksubtree +problems.anagram.impl   -problems.checksubtree.impl +problems.checksubtree   -problems.checksubtree.resources +problems.checksubtree.impl   -problems.coinsamount +problems.checksubtree.resources   -problems.coinsamount.impl +problems.coinsamount   -problems.distinctString +problems.coinsamount.impl   -problems.distinctString.impl +problems.distinctString   -problems.longestconsecstring.impl +problems.distinctString.impl   -problems.romannumeralconverter +problems.longestconsecstring.impl   +problems.romannumeralconverter +  + + problems.romannumeralconverter.impl   diff --git a/docs/overview-tree.html b/docs/overview-tree.html index f0967c3..0352261 100644 --- a/docs/overview-tree.html +++ b/docs/overview-tree.html @@ -89,6 +89,7 @@

                  Hierarchy For All Packages

                • datastructures.tree,
                • pattern.adapter,
                • pattern.composite,
                  • +
                • pattern.memento,
                • pattern.observer,
                • pattern.singleton,
                • pattern.strategy,
                  • @@ -126,6 +127,7 @@

                  Class Hierarchy

                • problems.coinsamount.impl.BruteForce (implements problems.coinsamount.CoinsAmount)
                • algorithms.sort.BubbleSort
                • algorithms.encryption.CaesarCipher
                  • +
                • pattern.memento.Caretaker
                • pattern.singleton.ClassBasedEagerSingleton
                • pattern.singleton.ClassBasedLazySingleton
                • pattern.adapter.Client (implements pattern.adapter.ClientInterface)
                  • @@ -154,6 +156,7 @@

                  Class Hierarchy

                • algorithms.sort.MergeSort
                • datastructures.heap.MinArrayHeap
                • algorithms.search.astar.model.Node
                  • +
                • pattern.memento.Originator
                • datastructures.pair.Pair<K,V>
                • algorithms.string.PalindromeCheck
                • algorithms.math.PerfectPower
                  • diff --git a/docs/package-list b/docs/package-list index e046143..4f12e0f 100644 --- a/docs/package-list +++ b/docs/package-list @@ -16,6 +16,7 @@ datastructures.pair datastructures.tree pattern.adapter pattern.composite +pattern.memento pattern.observer pattern.singleton pattern.strategy diff --git a/docs/pattern/composite/package-summary.html b/docs/pattern/composite/package-summary.html index 223f296..8ef9e93 100644 --- a/docs/pattern/composite/package-summary.html +++ b/docs/pattern/composite/package-summary.html @@ -42,7 +42,7 @@
                  • Frames
                    • @@ -118,7 +118,7 @@

                    Package pattern.composite

                    • Frames
                      • diff --git a/docs/pattern/composite/package-tree.html b/docs/pattern/composite/package-tree.html index 8b5e864..312fe37 100644 --- a/docs/pattern/composite/package-tree.html +++ b/docs/pattern/composite/package-tree.html @@ -42,7 +42,7 @@
                      • Frames
                        • @@ -110,7 +110,7 @@

                        Class Hierarchy

                        • Frames
                          • diff --git a/docs/pattern/memento/Caretaker.html b/docs/pattern/memento/Caretaker.html new file mode 100644 index 0000000..703a293 --- /dev/null +++ b/docs/pattern/memento/Caretaker.html @@ -0,0 +1,261 @@ + + + + + +Caretaker (java-fundamentals documentation) + + + + + + + +
                          + + +
                          Skip navigation links
                          + + + + +
                          +
                          + + + +
                          + +
                          +
                          +
                            +
                          • Summary: 
                            • +
                          • Nested | 
                            • +
                          • Field | 
                            • +
                          • Constr | 
                            • +
                          • Method
                            • +
                          +
                            +
                          • Detail: 
                            • +
                          • Field | 
                            • +
                          • Constr | 
                            • +
                          • Method
                            • +
                          +
                          + + +
                          + + +
                          +
                          pattern.memento
                          +

                          Class Caretaker

                          +
                          +
                          +
                            +
                          • java.lang.Object
                            • +
                          • +
                              +
                            • pattern.memento.Caretaker
                              • +
                            +
                            • +
                          +
                          +
                            +
                          • +
                            +
                            +
                            public class Caretaker
+extends java.lang.Object
                            +
                            Caretaker class: The class that handles the save and load of Originator
                            +
                            • +
                          +
                          +
                          +
                            +
                          • + +
                              +
                            • + + +

                              Method Summary

                              + + + + + + + + + + + + + + + + + + +
                              All Methods Instance Methods Concrete Methods 
                              Modifier and TypeMethod and Description
                              intgetStateCount() 
                              voidload(int stateNumber) 
                              voidsave() 
                              +
                                +
                              • + + +

                                Methods inherited from class java.lang.Object

                                +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
                                • +
                              +
                              • +
                            +
                            • +
                          +
                          +
                          +
                            +
                          • + +
                              +
                            • + + +

                              Method Detail

                              + + + +
                                +
                              • +

                                save

                                +
                                public void save()
                                +
                                • +
                              + + + +
                                +
                              • +

                                load

                                +
                                public void load(int stateNumber)
                                +
                                • +
                              + + + +
                                +
                              • +

                                getStateCount

                                +
                                public int getStateCount()
                                +
                                • +
                              +
                              • +
                            +
                            • +
                          +
                          +
                          + + +
                          + + +
                          Skip navigation links
                          + + + + +
                          +
                          + + + +
                          + +
                          +
                          +
                            +
                          • Summary: 
                            • +
                          • Nested | 
                            • +
                          • Field | 
                            • +
                          • Constr | 
                            • +
                          • Method
                            • +
                          +
                            +
                          • Detail: 
                            • +
                          • Field | 
                            • +
                          • Constr | 
                            • +
                          • Method
                            • +
                          +
                          + + +
                          + + + diff --git a/docs/pattern/memento/Originator.html b/docs/pattern/memento/Originator.html new file mode 100644 index 0000000..ee1dfff --- /dev/null +++ b/docs/pattern/memento/Originator.html @@ -0,0 +1,295 @@ + + + + + +Originator (java-fundamentals documentation) + + + + + + + +
                          + + +
                          Skip navigation links
                          + + + + +
                          +
                          + + + +
                          + +
                          +
                          +
                            +
                          • Summary: 
                            • +
                          • Nested | 
                            • +
                          • Field | 
                            • +
                          • Constr | 
                            • +
                          • Method
                            • +
                          + +
                          + + +
                          + + +
                          +
                          pattern.memento
                          +

                          Class Originator

                          +
                          +
                          +
                            +
                          • java.lang.Object
                            • +
                          • +
                              +
                            • pattern.memento.Originator
                              • +
                            +
                            • +
                          +
                          +
                            +
                          • +
                            +
                            +
                            public class Originator
+extends java.lang.Object
                            +
                            Originator class: The class whose state is to be saved
                            +
                            • +
                          +
                          +
                          +
                            +
                          • + +
                              +
                            • + + +

                              Constructor Summary

                              + + + + + + + + +
                              Constructors 
                              Constructor and Description
                              Originator() 
                              +
                              • +
                            + +
                              +
                            • + + +

                              Method Summary

                              + + + + + + + + + + + + + + + + + + +
                              All Methods Instance Methods Concrete Methods 
                              Modifier and TypeMethod and Description
                              java.lang.Stringread() 
                              voidrestoreFromMemento(pattern.memento.Originator.Memento memento) 
                              pattern.memento.Originator.MementosaveToMemento() 
                              +
                                +
                              • + + +

                                Methods inherited from class java.lang.Object

                                +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
                                • +
                              +
                              • +
                            +
                            • +
                          +
                          +
                          +
                            +
                          • + +
                              +
                            • + + +

                              Constructor Detail

                              + + + +
                                +
                              • +

                                Originator

                                +
                                public Originator()
                                +
                                • +
                              +
                              • +
                            + +
                              +
                            • + + +

                              Method Detail

                              + + + +
                                +
                              • +

                                read

                                +
                                public java.lang.String read()
                                +
                                • +
                              + + + +
                                +
                              • +

                                saveToMemento

                                +
                                public pattern.memento.Originator.Memento saveToMemento()
                                +
                                • +
                              + + + +
                                +
                              • +

                                restoreFromMemento

                                +
                                public void restoreFromMemento(pattern.memento.Originator.Memento memento)
                                +
                                • +
                              +
                              • +
                            +
                            • +
                          +
                          +
                          + + +
                          + + +
                          Skip navigation links
                          + + + + +
                          +
                          + + + +
                          + +
                          +
                          +
                            +
                          • Summary: 
                            • +
                          • Nested | 
                            • +
                          • Field | 
                            • +
                          • Constr | 
                            • +
                          • Method
                            • +
                          + +
                          + + +
                          + + + diff --git a/docs/pattern/memento/package-frame.html b/docs/pattern/memento/package-frame.html new file mode 100644 index 0000000..82ed64e --- /dev/null +++ b/docs/pattern/memento/package-frame.html @@ -0,0 +1,20 @@ + + + + + +pattern.memento (java-fundamentals documentation) + + + + +

                          pattern.memento

                          +
                          +

                          Classes

                          + +
                          + + diff --git a/docs/pattern/memento/package-summary.html b/docs/pattern/memento/package-summary.html new file mode 100644 index 0000000..ee43345 --- /dev/null +++ b/docs/pattern/memento/package-summary.html @@ -0,0 +1,147 @@ + + + + + +pattern.memento (java-fundamentals documentation) + + + + + + + +
                          + + +
                          Skip navigation links
                          + + + + +
                          +
                          + + + +
                          + +
                          + + +
                          + +
                          +

                          Package pattern.memento

                          +
                          +
                          +
                            +
                          • + + + + + + + + + + + + + + + + +
                            Class Summary 
                            ClassDescription
                            Caretaker +
                            Caretaker class: The class that handles the save and load of Originator
                            +
                            Originator +
                            Originator class: The class whose state is to be saved
                            +
                            +
                            • +
                          +
                          + +
                          + + +
                          Skip navigation links
                          + + + + +
                          +
                          + + + +
                          + +
                          + + +
                          + + + diff --git a/docs/pattern/memento/package-tree.html b/docs/pattern/memento/package-tree.html new file mode 100644 index 0000000..35373e8 --- /dev/null +++ b/docs/pattern/memento/package-tree.html @@ -0,0 +1,135 @@ + + + + + +pattern.memento Class Hierarchy (java-fundamentals documentation) + + + + + + + +
                          + + +
                          Skip navigation links
                          + + + + +
                          +
                          + + + +
                          + +
                          + + +
                          + +
                          +

                          Hierarchy For Package pattern.memento

                          +Package Hierarchies: + +
                          +
                          +

                          Class Hierarchy

                          + +
                          + +
                          + + +
                          Skip navigation links
                          + + + + +
                          +
                          + + + +
                          + +
                          + + +
                          + + + diff --git a/docs/pattern/observer/package-summary.html b/docs/pattern/observer/package-summary.html index 20d6786..c4d7696 100644 --- a/docs/pattern/observer/package-summary.html +++ b/docs/pattern/observer/package-summary.html @@ -41,7 +41,7 @@
                          @@ -140,7 +140,7 @@

                          Package pattern.observer

                          diff --git a/docs/pattern/observer/package-tree.html b/docs/pattern/observer/package-tree.html index d49d56c..dc75f3b 100644 --- a/docs/pattern/observer/package-tree.html +++ b/docs/pattern/observer/package-tree.html @@ -41,7 +41,7 @@
                          @@ -110,7 +110,7 @@

                          Interface Hierarchy

                          From ffd4ddeff16218dbafb5edd1f347729a41862fd9 Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Wed, 27 Oct 2021 21:36:49 +0200 Subject: [PATCH 102/108] Apply checkstyle to tests --- checkstyle.xml | 17 --------- pom.xml | 1 + .../java/algorithms/math/EuclideanTest.java | 17 +++++---- .../algorithms/search/JumpSearchTest.java | 38 ++++++++++--------- .../sequence/FibonacciSequenceTest.java | 4 +- .../java/algorithms/sort/MergeSortTest.java | 1 + .../algorithms/string/PalindromeTest.java | 4 +- .../java/datastructures/pair/PairTest.java | 6 +-- .../java/pattern/composite/CompositeTest.java | 3 +- .../checksubtree/CheckSubTreeTest.java | 23 +++++------ .../LongestConsecStringTest.java | 34 ++++++++++++----- .../romannumeralconverter/ConverterTest.java | 37 +++++++++--------- 12 files changed, 97 insertions(+), 88 deletions(-) diff --git a/checkstyle.xml b/checkstyle.xml index 45c17ec..aa79ad3 100644 --- a/checkstyle.xml +++ b/checkstyle.xml @@ -166,20 +166,6 @@ by Max Vetrenko, Ruslan Diachenko, Roman Ivanov. - - - - - - - - - - - - - - - diff --git a/pom.xml b/pom.xml index 4a010b8..9629e7f 100644 --- a/pom.xml +++ b/pom.xml @@ -24,6 +24,7 @@ 3.1.2 checkstyle.xml + true UTF-8 true true diff --git a/src/test/java/algorithms/math/EuclideanTest.java b/src/test/java/algorithms/math/EuclideanTest.java index dfec431..88531a0 100644 --- a/src/test/java/algorithms/math/EuclideanTest.java +++ b/src/test/java/algorithms/math/EuclideanTest.java @@ -6,16 +6,17 @@ * @author josefdcunha */ public class EuclideanTest extends TestCase { + public void testSomeValues() { - assertEquals(12, Euclidean.gcd(348,156)); - assertEquals(100, Euclidean.gcd(500,100)); - assertEquals(15, Euclidean.gcd(3690,285)); - assertEquals(12, Euclidean.gcd(492,12)); + assertEquals(12, Euclidean.gcd(348, 156)); + assertEquals(100, Euclidean.gcd(500, 100)); + assertEquals(15, Euclidean.gcd(3690, 285)); + assertEquals(12, Euclidean.gcd(492, 12)); - assertEquals(12, Euclidean.gcdIterative(348,156)); - assertEquals(100, Euclidean.gcdIterative(500,100)); - assertEquals(15, Euclidean.gcdIterative(3690,285)); - assertEquals(12, Euclidean.gcdIterative(492,12)); + assertEquals(12, Euclidean.gcdIterative(348, 156)); + assertEquals(100, Euclidean.gcdIterative(500, 100)); + assertEquals(15, Euclidean.gcdIterative(3690, 285)); + assertEquals(12, Euclidean.gcdIterative(492, 12)); } } diff --git a/src/test/java/algorithms/search/JumpSearchTest.java b/src/test/java/algorithms/search/JumpSearchTest.java index c979306..9d1812b 100644 --- a/src/test/java/algorithms/search/JumpSearchTest.java +++ b/src/test/java/algorithms/search/JumpSearchTest.java @@ -10,34 +10,38 @@ public void testEmptyArray() { } public void testIntegerArray() { - JumpSearch jumpSearch = new JumpSearch<>(new Integer[]{5, 22, 24, 47, 57, 67, 89, 91, 95, 99}); - assertEquals(jumpSearch.searchFor( 5), 0); + JumpSearch jumpSearch = new JumpSearch<>( + new Integer[]{5, 22, 24, 47, 57, 67, 89, 91, 95, 99}); + assertEquals(jumpSearch.searchFor(5), 0); assertEquals(jumpSearch.searchFor(22), 1); assertEquals(jumpSearch.searchFor(24), 2); assertEquals(jumpSearch.searchFor(47), 3); - assertEquals(jumpSearch.searchFor( 57), 4); - assertEquals(jumpSearch.searchFor( 67), 5); + assertEquals(jumpSearch.searchFor(57), 4); + assertEquals(jumpSearch.searchFor(67), 5); assertEquals(jumpSearch.searchFor(89), 6); assertEquals(jumpSearch.searchFor(91), 7); - assertEquals(jumpSearch.searchFor( 95), 8); - assertEquals(jumpSearch.searchFor( 99), 9); + assertEquals(jumpSearch.searchFor(95), 8); + assertEquals(jumpSearch.searchFor(99), 9); } - public void testIntegerArrayNoSearchValue(){ - JumpSearch jumpSearch = new JumpSearch<>(new Integer[]{5, 22, 24, 47, 57, 67, 89, 91, 95, 99}); - assertEquals(jumpSearch.searchFor( 29), -1); + public void testIntegerArrayNoSearchValue() { + JumpSearch jumpSearch = new JumpSearch<>( + new Integer[]{5, 22, 24, 47, 57, 67, 89, 91, 95, 99}); + assertEquals(jumpSearch.searchFor(29), -1); } - public void testIntegerArrayNoSearchValueLargestNumber(){ - JumpSearch jumpSearch = new JumpSearch<>(new Integer[]{5, 11, 15, 18, 22, 24, 27, 34, 38, 47, 57, 59, 67, 89, 91, 95, 99}); - assertEquals(jumpSearch.searchFor( 103), -1); + public void testIntegerArrayNoSearchValueLargestNumber() { + JumpSearch jumpSearch = new JumpSearch<>( + new Integer[]{5, 11, 15, 18, 22, 24, 27, 34, 38, 47, 57, 59, 67, 89, 91, 95, 99}); + assertEquals(jumpSearch.searchFor(103), -1); } - public void testIntegerArraySearchAndIterations(){ - JumpSearch jumpSearch = new JumpSearch<>(new Integer[]{5, 11, 15, 18, 22, 24, 27, 34, 38, 47, 57, 59, 67, 89, 91, 95, 99}); - assertEquals(jumpSearch.searchFor( 67), 12); + public void testIntegerArraySearchAndIterations() { + JumpSearch jumpSearch = new JumpSearch<>( + new Integer[]{5, 11, 15, 18, 22, 24, 27, 34, 38, 47, 57, 59, 67, 89, 91, 95, 99}); + assertEquals(jumpSearch.searchFor(67), 12); // Test to see if this is found in 3 iterations compared to 12 using linear search on a sorted array - assertEquals(jumpSearch.getIterationsToFind(),3); + assertEquals(jumpSearch.getIterationsToFind(), 3); } public void testIntegerArrayWithNullValues() { @@ -56,7 +60,7 @@ public void testIntegerArrayWithNullValues() { public void testWithNullArray() { try { - JumpSearch jumpSearch =new JumpSearch<>(null); + JumpSearch jumpSearch = new JumpSearch<>(null); jumpSearch.searchFor(0); fail(); } catch (IllegalArgumentException ignored) { diff --git a/src/test/java/algorithms/sequence/FibonacciSequenceTest.java b/src/test/java/algorithms/sequence/FibonacciSequenceTest.java index 5a7a291..8fa102b 100644 --- a/src/test/java/algorithms/sequence/FibonacciSequenceTest.java +++ b/src/test/java/algorithms/sequence/FibonacciSequenceTest.java @@ -13,7 +13,7 @@ public void testInitialValuesRecursive() { } public void testInvalidValuesRecursive() { - assertEquals(-1 , FibonacciSequence.recursive(-1)); + assertEquals(-1, FibonacciSequence.recursive(-1)); assertEquals(-1, FibonacciSequence.recursive(-3)); } @@ -30,7 +30,7 @@ public void testInitialValuesIterative() { } public void testInvalidValuesIterative() { - assertEquals(-1 , FibonacciSequence.iterative(-1)); + assertEquals(-1, FibonacciSequence.iterative(-1)); assertEquals(-1, FibonacciSequence.iterative(-3)); } diff --git a/src/test/java/algorithms/sort/MergeSortTest.java b/src/test/java/algorithms/sort/MergeSortTest.java index 49ad755..cdd3bd8 100644 --- a/src/test/java/algorithms/sort/MergeSortTest.java +++ b/src/test/java/algorithms/sort/MergeSortTest.java @@ -18,6 +18,7 @@ public void testMergeSortArrayOdd() { assertEquals(res[i], arrayA[i]); } } + public void testMergeSortArrayEven() { final Short[] arrayA = new Short[]{3, 6, 6, 2, 5, 4, 1, 2}; Short[] res = MergeSort.mergeSort(arrayA); diff --git a/src/test/java/algorithms/string/PalindromeTest.java b/src/test/java/algorithms/string/PalindromeTest.java index 3bad724..353ba4c 100644 --- a/src/test/java/algorithms/string/PalindromeTest.java +++ b/src/test/java/algorithms/string/PalindromeTest.java @@ -7,7 +7,7 @@ */ public class PalindromeTest extends TestCase { - public void testPalindromes(){ + public void testPalindromes() { final PalindromeCheck check = new PalindromeCheck(); assertTrue(check.isPalindrome("lagerregal")); @@ -21,7 +21,7 @@ public void testPalindromes(){ assertTrue(check.isPalindrome("")); } - public void testNoPalindromes(){ + public void testNoPalindromes() { final PalindromeCheck check = new PalindromeCheck(); assertFalse(check.isPalindrome("abcde")); diff --git a/src/test/java/datastructures/pair/PairTest.java b/src/test/java/datastructures/pair/PairTest.java index 9cff493..4029b8f 100644 --- a/src/test/java/datastructures/pair/PairTest.java +++ b/src/test/java/datastructures/pair/PairTest.java @@ -7,7 +7,7 @@ */ public class PairTest extends TestCase { - public void testEquals(){ + public void testEquals() { final Pair a = new Pair<>(1, 2); final Pair b = new Pair<>(1, 2); final Pair c = new Pair<>(2, 1); @@ -17,7 +17,7 @@ public void testEquals(){ assertFalse(a.equals(null)); } - public void testKey(){ + public void testKey() { final Pair integerIntegerPair = new Pair<>(10, 4); final int key = integerIntegerPair.getKey(); @@ -25,7 +25,7 @@ public void testKey(){ assertNotSame(10, integerIntegerPair.getValue()); } - public void testValue(){ + public void testValue() { final Pair integerIntegerPair = new Pair<>(10, 4); final int value = integerIntegerPair.getValue(); diff --git a/src/test/java/pattern/composite/CompositeTest.java b/src/test/java/pattern/composite/CompositeTest.java index 4a435fa..245c819 100644 --- a/src/test/java/pattern/composite/CompositeTest.java +++ b/src/test/java/pattern/composite/CompositeTest.java @@ -17,7 +17,8 @@ public void test() { child.addChild(new Leaf(6)); assertEquals( - "[level=0, id=1, children=[[level=1, id=2, children=[[level=2, id=5][level=2, id=6]][level=1, id=3][level=1, id=4]]", + "[level=0, id=1, children=[[level=1, id=2, children=[[level=2, id=5][level=2, id=6]]" + + "[level=1, id=3][level=1, id=4]]", root.list(0)); } diff --git a/src/test/java/problems/checksubtree/CheckSubTreeTest.java b/src/test/java/problems/checksubtree/CheckSubTreeTest.java index ea5dfa5..65ca849 100644 --- a/src/test/java/problems/checksubtree/CheckSubTreeTest.java +++ b/src/test/java/problems/checksubtree/CheckSubTreeTest.java @@ -5,6 +5,7 @@ import problems.checksubtree.resources.TreeNode; public class CheckSubTreeTest extends TestCase { + // function to create a tree for testing private TreeNode createFromArray(int[] values) { int n = values.length; @@ -15,8 +16,7 @@ private TreeNode createFromArray(int[] values) { for (int i = 0; i < n; i++) { if (values[i] == 0) { nodes[i] = null; - } - else { + } else { nodes[i] = new TreeNode(values[i]); } } @@ -25,15 +25,16 @@ private TreeNode createFromArray(int[] values) { if (nodes[i] == null) { continue; } - if (i*2 + 1 < n) { - nodes[i].left = nodes[i*2 + 1]; + if (i * 2 + 1 < n) { + nodes[i].left = nodes[i * 2 + 1]; } - if (i*2 + 2 < n) { - nodes[i].right = nodes[i*2 + 2]; + if (i * 2 + 2 < n) { + nodes[i].right = nodes[i * 2 + 2]; } } return nodes[0]; } + private static final CheckSubTree[] implementations = new CheckSubTree[]{new Recursive()}; private static TreeNode[] trees = new TreeNode[3]; private static TreeNode[] subTrees = new TreeNode[3]; @@ -41,14 +42,14 @@ private TreeNode createFromArray(int[] values) { public void testSolutions() { // testcase 1 - trees[0] = createFromArray(new int[]{1,1}); + trees[0] = createFromArray(new int[]{1, 1}); subTrees[0] = createFromArray(new int[]{1}); // testcase 2 - trees[1] = createFromArray(new int[]{3,4,5,1,2}); - subTrees[1] = createFromArray(new int[]{4,1,2}); + trees[1] = createFromArray(new int[]{3, 4, 5, 1, 2}); + subTrees[1] = createFromArray(new int[]{4, 1, 2}); // testcase 3 - trees[2] = createFromArray(new int[]{3,4,5,1,2,0,0,0,1}); - subTrees[2] = createFromArray(new int[]{4,1,2}); + trees[2] = createFromArray(new int[]{3, 4, 5, 1, 2, 0, 0, 0, 1}); + subTrees[2] = createFromArray(new int[]{4, 1, 2}); for (CheckSubTree impl : implementations) { assertTrue(impl.isSubTree(trees[0], subTrees[0])); diff --git a/src/test/java/problems/longestconsecstring/LongestConsecStringTest.java b/src/test/java/problems/longestconsecstring/LongestConsecStringTest.java index eb6f5a6..4237e29 100644 --- a/src/test/java/problems/longestconsecstring/LongestConsecStringTest.java +++ b/src/test/java/problems/longestconsecstring/LongestConsecStringTest.java @@ -9,17 +9,33 @@ public class LongestConsecStringTest extends TestCase { private static void testing(String actual, String expected) { assertEquals(expected, actual); } + @Test public void test() { testing(LongestConsecString - .longestConsecString(new String[] {"zone", "abigail", "theta", "form", "libe", "zas", "theta", "abigail"}, 2), "abigailtheta"); - testing(LongestConsecString.longestConsecString(new String[] {"ejjjjmmtthh", "zxxuueeg", "aanlljrrrxx", "dqqqaaabbb", "oocccffuucccjjjkkkjyyyeehh"}, 1), "oocccffuucccjjjkkkjyyyeehh"); - testing(LongestConsecString.longestConsecString(new String[] {}, 3), ""); - testing(LongestConsecString.longestConsecString(new String[] {"itvayloxrp","wkppqsztdkmvcuwvereiupccauycnjutlv","vweqilsfytihvrzlaodfixoyxvyuyvgpck"}, 2), "wkppqsztdkmvcuwvereiupccauycnjutlvvweqilsfytihvrzlaodfixoyxvyuyvgpck"); - testing(LongestConsecString.longestConsecString(new String[] {"wlwsasphmxx","owiaxujylentrklctozmymu","wpgozvxxiu"}, 2), "wlwsasphmxxowiaxujylentrklctozmymu"); - testing(LongestConsecString.longestConsecString(new String[] {"zone", "abigail", "theta", "form", "libe", "zas"}, -2), ""); - testing(LongestConsecString.longestConsecString(new String[] {"it","wkppv","ixoyx", "3452", "zzzzzzzzzzzz"}, 3), "ixoyx3452zzzzzzzzzzzz"); - testing(LongestConsecString.longestConsecString(new String[] {"it","wkppv","ixoyx", "3452", "zzzzzzzzzzzz"}, 15), ""); - testing(LongestConsecString.longestConsecString(new String[] {"it","wkppv","ixoyx", "3452", "zzzzzzzzzzzz"}, 0), ""); + .longestConsecString( + new String[]{"zone", "abigail", "theta", "form", "libe", "zas", "theta", "abigail"}, + 2), "abigailtheta"); + testing(LongestConsecString.longestConsecString( + new String[]{"ejjjjmmtthh", "zxxuueeg", "aanlljrrrxx", "dqqqaaabbb", + "oocccffuucccjjjkkkjyyyeehh"}, 1), "oocccffuucccjjjkkkjyyyeehh"); + testing(LongestConsecString.longestConsecString( + new String[]{}, 3), ""); + testing(LongestConsecString.longestConsecString( + new String[]{"itvayloxrp", "wkppqsztdkmvcuwvereiupccauycnjutlv", + "vweqilsfytihvrzlaodfixoyxvyuyvgpck"}, 2), + "wkppqsztdkmvcuwvereiupccauycnjutlvvweqilsfytihvrzlaodfixoyxvyuyvgpck"); + testing(LongestConsecString.longestConsecString( + new String[]{"wlwsasphmxx", "owiaxujylentrklctozmymu", "wpgozvxxiu"}, 2), + "wlwsasphmxxowiaxujylentrklctozmymu"); + testing(LongestConsecString.longestConsecString( + new String[]{"zone", "abigail", "theta", "form", "libe", "zas"}, -2), ""); + testing(LongestConsecString.longestConsecString( + new String[]{"it", "wkppv", "ixoyx", "3452", "zzzzzzzzzzzz"}, 3), + "ixoyx3452zzzzzzzzzzzz"); + testing(LongestConsecString.longestConsecString( + new String[]{"it", "wkppv", "ixoyx", "3452", "zzzzzzzzzzzz"}, 15), ""); + testing(LongestConsecString.longestConsecString( + new String[]{"it", "wkppv", "ixoyx", "3452", "zzzzzzzzzzzz"}, 0), ""); } } diff --git a/src/test/java/problems/romannumeralconverter/ConverterTest.java b/src/test/java/problems/romannumeralconverter/ConverterTest.java index 6697595..c078781 100644 --- a/src/test/java/problems/romannumeralconverter/ConverterTest.java +++ b/src/test/java/problems/romannumeralconverter/ConverterTest.java @@ -1,6 +1,7 @@ package problems.romannumeralconverter; -import static org.junit.Assert.*; + +import static org.junit.Assert.assertEquals; import org.junit.Test; import problems.romannumeralconverter.impl.Converter; @@ -8,99 +9,99 @@ public class ConverterTest { Converter converter = new Converter(); - @Test - public void InputIGet1() { + @Test + public void inputIGet1() { assertEquals(1, converter.convert("I")); } @Test - public void InputIIIGet3() { + public void inputIIIGet3() { assertEquals(3, converter.convert("III")); } @Test - public void InputVGet5() { + public void inputVGet5() { assertEquals(5, converter.convert("V")); } @Test - public void InputVIIGet7() { + public void inputVIIGet7() { assertEquals(7, converter.convert("VII")); } @Test - public void InputIVGet4() { + public void inputIVGet4() { assertEquals(4, converter.convert("IV")); } @Test - public void InputIXGet4() { + public void inputIXGet4() { assertEquals(4, converter.convert("IV")); } @Test - public void InputIXGet9() { + public void inputIXGet9() { assertEquals(4, converter.convert("IV")); } @Test - public void InputXXXIXGet39() { + public void inputXXXIXGet39() { assertEquals(39, converter.convert("XXXIX")); } @Test - public void InputXXVIIIGet28() { + public void inputXXVIIIGet28() { assertEquals(28, converter.convert("XXVIII")); } @Test - public void InputXLGet40() { + public void inputXLGet40() { assertEquals(40, converter.convert("XL")); } @Test - public void InputLXXXGet80() { + public void inputLXXXGet80() { assertEquals(80, converter.convert("LXXX")); } @Test - public void InputXCGet90() { + public void inputXCGet90() { assertEquals(90, converter.convert("XC")); } @Test - public void InputCXCIGet191() { + public void inputCXCIGet191() { assertEquals(191, converter.convert("CXCI")); } @Test - public void InputCDGet400() { + public void inputCDGet400() { assertEquals(400, converter.convert("CD")); } @Test - public void InputCMGet900() { + public void inputCMGet900() { assertEquals(900, converter.convert("CM")); } @Test - public void InputMCMIIIGet1903() { + public void inputMCMIIIGet1903() { assertEquals(1903, converter.convert("MCMIII")); } From 8183dba0d8f916b7f5b2bac668e94813b20ff318 Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Sun, 31 Oct 2021 01:01:35 +0200 Subject: [PATCH 103/108] Remove travis from mergify --- .mergify.yml | 2 -- 1 file changed, 2 deletions(-) diff --git a/.mergify.yml b/.mergify.yml index 1e51b8c..792e9de 100644 --- a/.mergify.yml +++ b/.mergify.yml @@ -1,7 +1,6 @@ pull_request_rules: - name: automatic merge for master when reviewed by owner conditions: - - "status-success=Travis CI - Pull Request" - "status-success=ci/circleci: test" - approved-reviews-by=LorenzNickel - base=master @@ -22,7 +21,6 @@ pull_request_rules: - name: automatic merge for Dependabot pull requests with label conditions: - author~=^dependabot(|-preview)\[bot\]$ - - "status-success=Travis CI - Pull Request" - "status-success=ci/circleci: test" actions: merge: From ddd4eef9dbcac167622471b0f902504d2282dab3 Mon Sep 17 00:00:00 2001 From: "DESKTOP-4HC5T4Q\\Na Accel One" Date: Fri, 29 Oct 2021 18:06:58 -0300 Subject: [PATCH 104/108] feature: Add trailing zeros for factorial number N --- .../math/FactorialTrailingZeros.java | 24 +++++++++++++++++++ .../math/FactorialTrailingZerosTest.java | 15 ++++++++++++ 2 files changed, 39 insertions(+) create mode 100644 src/main/java/algorithms/math/FactorialTrailingZeros.java create mode 100644 src/test/java/algorithms/math/FactorialTrailingZerosTest.java diff --git a/src/main/java/algorithms/math/FactorialTrailingZeros.java b/src/main/java/algorithms/math/FactorialTrailingZeros.java new file mode 100644 index 0000000..c6008c5 --- /dev/null +++ b/src/main/java/algorithms/math/FactorialTrailingZeros.java @@ -0,0 +1,24 @@ +package algorithms.math; + +import java.util.stream.IntStream; + +/** + * FactorialTrailingZeros finds the amount trailing zeros for a given number n. If no trailing zeros + * returns 0 + * + * @author nujovich + * @see + */ +public class FactorialTrailingZeros { + + /** + * Calculates the number of trailing zeros. + * + * @param n + * @return int number + */ + public static int zeros(int n) { + return IntStream.rangeClosed(1, (int) Math.round(Math.log(n) / Math.log(5))) + .mapToObj(i -> (int) (n / Math.pow(5.0, i))).reduce(0, Integer::sum); + } +} \ No newline at end of file diff --git a/src/test/java/algorithms/math/FactorialTrailingZerosTest.java b/src/test/java/algorithms/math/FactorialTrailingZerosTest.java new file mode 100644 index 0000000..1a7ed1f --- /dev/null +++ b/src/test/java/algorithms/math/FactorialTrailingZerosTest.java @@ -0,0 +1,15 @@ +package algorithms.math; + +import junit.framework.TestCase; +import org.junit.Test; + +public class FactorialTrailingZerosTest extends TestCase { + + @Test + public void testZeros() throws Exception { + assertEquals(FactorialTrailingZeros.zeros(0), 0); + assertEquals(FactorialTrailingZeros.zeros(6), 1); + assertEquals(FactorialTrailingZeros.zeros(14), 2); + } + +} From d553af628fb1a20c291a6fda8ff202e46372550b Mon Sep 17 00:00:00 2001 From: Javadoc-Generator Date: Sat, 30 Oct 2021 23:02:36 +0000 Subject: [PATCH 105/108] Re-generate javadoc for ddd4eef9dbcac167622471b0f902504d2282dab3 [skip travis] [skip circle] run-id: 1403354225 run-number 15 run-attempt 1 --- docs/algorithms/math/Euclidean.html | 4 +- .../math/FactorialTrailingZeros.html | 283 ++++++++++++++++++ docs/algorithms/math/PerfectPower.html | 4 +- docs/algorithms/math/package-frame.html | 1 + docs/algorithms/math/package-summary.html | 6 + docs/algorithms/math/package-tree.html | 1 + docs/allclasses-frame.html | 1 + docs/allclasses-noframe.html | 1 + docs/index-all.html | 20 +- docs/overview-tree.html | 1 + 10 files changed, 316 insertions(+), 6 deletions(-) create mode 100644 docs/algorithms/math/FactorialTrailingZeros.html diff --git a/docs/algorithms/math/Euclidean.html b/docs/algorithms/math/Euclidean.html index 00be3e7..c922fcb 100644 --- a/docs/algorithms/math/Euclidean.html +++ b/docs/algorithms/math/Euclidean.html @@ -48,7 +48,7 @@
                          • Frames
                            • @@ -266,7 +266,7 @@

                            gcdIterative

                            • Frames
                              • diff --git a/docs/algorithms/math/FactorialTrailingZeros.html b/docs/algorithms/math/FactorialTrailingZeros.html new file mode 100644 index 0000000..b8dfc49 --- /dev/null +++ b/docs/algorithms/math/FactorialTrailingZeros.html @@ -0,0 +1,283 @@ + + + + + +FactorialTrailingZeros (java-fundamentals documentation) + + + + + + + +
                              + + +
                              Skip navigation links
                              + + + + +
                              +
                              + + + +
                              + +
                              +
                              +
                                +
                              • Summary: 
                                • +
                              • Nested | 
                                • +
                              • Field | 
                                • +
                              • Constr | 
                                • +
                              • Method
                                • +
                              + +
                              + + +
                              + + +
                              +
                              algorithms.math
                              +

                              Class FactorialTrailingZeros

                              +
                              +
                              +
                                +
                              • java.lang.Object
                                • +
                              • +
                                  +
                                • algorithms.math.FactorialTrailingZeros
                                  • +
                                +
                                • +
                              +
                              +
                                +
                              • +
                                +
                                +
                                public class FactorialTrailingZeros
+extends java.lang.Object
                                +
                                FactorialTrailingZeros finds the amount trailing zeros for a given number n. If no trailing zeros + returns 0
                                +
                                +
                                See Also:
                                +
                                +
                                +
                                • +
                              +
                              +
                              +
                                +
                              • + + + +
                                  +
                                • + + +

                                  Method Summary

                                  + + + + + + + + + + +
                                  All Methods Static Methods Concrete Methods 
                                  Modifier and TypeMethod and Description
                                  static intzeros(int n) +
                                  Calculates the number of trailing zeros.
                                  +
                                  +
                                    +
                                  • + + +

                                    Methods inherited from class java.lang.Object

                                    +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
                                    • +
                                  +
                                  • +
                                +
                                • +
                              +
                              +
                              +
                                +
                              • + +
                                  +
                                • + + +

                                  Constructor Detail

                                  + + + +
                                    +
                                  • +

                                    FactorialTrailingZeros

                                    +
                                    public FactorialTrailingZeros()
                                    +
                                    • +
                                  +
                                  • +
                                + +
                                  +
                                • + + +

                                  Method Detail

                                  + + + +
                                    +
                                  • +

                                    zeros

                                    +
                                    public static int zeros(int n)
                                    +
                                    Calculates the number of trailing zeros.
                                    +
                                    +
                                    Parameters:
                                    +
                                    n -
                                    +
                                    Returns:
                                    +
                                    int number
                                    +
                                    +
                                    • +
                                  +
                                  • +
                                +
                                • +
                              +
                              +
                              + + +
                              + + +
                              Skip navigation links
                              + + + + +
                              +
                              + + + +
                              + +
                              +
                              +
                                +
                              • Summary: 
                                • +
                              • Nested | 
                                • +
                              • Field | 
                                • +
                              • Constr | 
                                • +
                              • Method
                                • +
                              + +
                              + + +
                              + + + diff --git a/docs/algorithms/math/PerfectPower.html b/docs/algorithms/math/PerfectPower.html index 37a3b8e..7aee3e0 100644 --- a/docs/algorithms/math/PerfectPower.html +++ b/docs/algorithms/math/PerfectPower.html @@ -47,7 +47,7 @@
                              @@ -236,7 +236,7 @@

                              isPerfectPower

                              diff --git a/docs/algorithms/math/package-frame.html b/docs/algorithms/math/package-frame.html index cd3e5ef..7b1d57c 100644 --- a/docs/algorithms/math/package-frame.html +++ b/docs/algorithms/math/package-frame.html @@ -13,6 +13,7 @@

                              Classes

                            diff --git a/docs/algorithms/math/package-summary.html b/docs/algorithms/math/package-summary.html index 46e89f1..dc6b848 100644 --- a/docs/algorithms/math/package-summary.html +++ b/docs/algorithms/math/package-summary.html @@ -87,6 +87,12 @@

                            Package algorithms.math

                            +FactorialTrailingZeros + +
                            FactorialTrailingZeros finds the amount trailing zeros for a given number n.
                            + + + PerfectPower
                            PerfectPower is a class that checks if a number n can be expressed as n=m^k, where m is the root diff --git a/docs/algorithms/math/package-tree.html b/docs/algorithms/math/package-tree.html index c4de8b8..3fcf40d 100644 --- a/docs/algorithms/math/package-tree.html +++ b/docs/algorithms/math/package-tree.html @@ -80,6 +80,7 @@

                            Class Hierarchy

                          • java.lang.Object
                            • diff --git a/docs/allclasses-frame.html b/docs/allclasses-frame.html index 68b9136..b256028 100644 --- a/docs/allclasses-frame.html +++ b/docs/allclasses-frame.html @@ -43,6 +43,7 @@

                            All Classes

                          • Euclidean
                          • ExternalArray
                          • ExternalMap
                            • +
                          • FactorialTrailingZeros
                          • FibonacciSequence
                          • GnomeSort
                          • InsertionSort
                            • diff --git a/docs/allclasses-noframe.html b/docs/allclasses-noframe.html index 7856f15..2887e5d 100644 --- a/docs/allclasses-noframe.html +++ b/docs/allclasses-noframe.html @@ -43,6 +43,7 @@

                            All Classes

                          • Euclidean
                          • ExternalArray
                          • ExternalMap
                            • +
                          • FactorialTrailingZeros
                          • FibonacciSequence
                          • GnomeSort
                          • InsertionSort
                            • diff --git a/docs/index-all.html b/docs/index-all.html index 50aec35..8114e2f 100644 --- a/docs/index-all.html +++ b/docs/index-all.html @@ -67,7 +67,7 @@
                            -
                            A B C D E F G H I J L M N O P Q R S T U V W  +
                            A B C D E F G H I J L M N O P Q R S T U V W Z 

                            A

                            @@ -423,6 +423,12 @@

                            E

                            F

                            +
                            FactorialTrailingZeros - Class in algorithms.math
                            +
                            +
                            FactorialTrailingZeros finds the amount trailing zeros for a given number n.
                            +
                            +
                            FactorialTrailingZeros() - Constructor for class algorithms.math.FactorialTrailingZeros
                            +
                             
                            FibonacciSequence - Class in algorithms.sequence
                            Simple implementation of the Fibonacci Sequence algorithm
                            @@ -1144,7 +1150,17 @@

                            W

                            withB(T) - Method in class datastructures.math.Tuple
                             
                            -A B C D E F G H I J L M N O P Q R S T U V W 
                            + + + +

                            Z

                            +
                            +
                            zeros(int) - Static method in class algorithms.math.FactorialTrailingZeros
                            +
                            +
                            Calculates the number of trailing zeros.
                            +
                            +
                            +A B C D E F G H I J L M N O P Q R S T U V W Z 
                            diff --git a/docs/overview-tree.html b/docs/overview-tree.html index 0352261..583db42 100644 --- a/docs/overview-tree.html +++ b/docs/overview-tree.html @@ -143,6 +143,7 @@

                            Class Hierarchy

                          • algorithms.math.Euclidean
                          • problems.distinctString.impl.ExternalArray (implements problems.distinctString.DistinctString)
                          • problems.anagram.impl.ExternalMap (implements problems.anagram.Anagram)
                            • +
                          • algorithms.math.FactorialTrailingZeros
                          • algorithms.sequence.FibonacciSequence
                          • algorithms.sort.GnomeSort
                          • algorithms.sort.InsertionSort
                            • From 3200cb6af7fd11867038ce08a22599a5be3bd5d3 Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Sun, 31 Oct 2021 01:05:16 +0200 Subject: [PATCH 106/108] Remove travis-badge from README --- README.md | 1 - 1 file changed, 1 deletion(-) diff --git a/README.md b/README.md index ee5fc0a..4490c20 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,5 @@ # java-fundamentals [![Javadoc Generator](https://github.com/LorenzNickel/java-fundamentals/actions/workflows/javadoc-generator.yml/badge.svg)](https://github.com/LorenzNickel/java-fundamentals/actions/workflows/javadoc-generator.yml) -[![Travis Build Status](https://api.travis-ci.com/LorenzNickel/java-fundamentals.svg?branch=master)](https://app.travis-ci.com/github/LorenzNickel/java-fundamentals) [![Circle Build Status](https://circleci.com/gh/LorenzNickel/java-fundamentals.svg?style=shield)](https://circleci.com/gh/LorenzNickel/java-fundamentals/) Common algorithms, data structures and design pattern implemented in Java. From 79584f127bfaee96810663fa5e4d5306774322e8 Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Sun, 31 Oct 2021 01:05:31 +0200 Subject: [PATCH 107/108] Delete .travis.yml --- .travis.yml | 6 ------ 1 file changed, 6 deletions(-) delete mode 100644 .travis.yml diff --git a/.travis.yml b/.travis.yml deleted file mode 100644 index 8d7341f..0000000 --- a/.travis.yml +++ /dev/null @@ -1,6 +0,0 @@ -language: java -sudo: false -script: "mvn test" - -jdk: - - openjdk8 From e8051df18e538bc4e6301c60359872b94392f824 Mon Sep 17 00:00:00 2001 From: Lorenz Nickel Date: Sun, 31 Oct 2021 01:06:34 +0200 Subject: [PATCH 108/108] Update javadoc-generator.yml --- .github/workflows/javadoc-generator.yml | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/.github/workflows/javadoc-generator.yml b/.github/workflows/javadoc-generator.yml index 97e0a01..5ebc941 100644 --- a/.github/workflows/javadoc-generator.yml +++ b/.github/workflows/javadoc-generator.yml @@ -22,4 +22,4 @@ jobs: run: | git config --global user.name 'Javadoc-Generator' git config --global user.email 'LorenzNickel@users.noreply.github.com' - if [[ `git status --porcelain` ]]; then echo "Uploading changes" && git add . && git commit -am "Re-generate javadoc for ${{ github.sha }}" -m "[skip travis] [skip circle]" -m "run-id: ${{ github.run_id }}" -m "run-number ${{ github.run_number }}" -m "run-attempt ${{ github.run_attempt }}" && git push; else echo "No changes to docs detected";fi + if [[ `git status --porcelain` ]]; then echo "Uploading changes" && git add . && git commit -am "Re-generate javadoc for ${{ github.sha }}" -m "[skip circle]" -m "run-id: ${{ github.run_id }}" -m "run-number ${{ github.run_number }}" -m "run-attempt ${{ github.run_attempt }}" && git push; else echo "No changes to docs detected";fi