diff --git a/Task_1_2_1/build.gradle b/Task_1_2_1/build.gradle new file mode 100644 index 00000000..0978d62e --- /dev/null +++ b/Task_1_2_1/build.gradle @@ -0,0 +1,37 @@ +plugins { + id 'java' + id 'jacoco' +} + +group 'org.example' +version 'unspecified' + +repositories { + mavenCentral() +} + +dependencies { + testImplementation 'org.junit.jupiter:junit-jupiter-api:5.8.1' + testImplementation 'org.junit.jupiter:junit-jupiter-params:5.8.2' + testImplementation 'org.junit.jupiter:junit-jupiter-params:5.8.2' + testRuntimeOnly 'org.junit.jupiter:junit-jupiter-engine:5.8.1' +} + +test { + useJUnitPlatform() +} + +jacocoTestReport { + dependsOn test // tests are required to run before generating the report + reports { + xml.required = true + //html.outputLocation = layout.buildDirectory.dir('jacocoHtml') Доп опция, чтобы у себя можно было открыть html + } + afterEvaluate { + classDirectories.setFrom(files(classDirectories.files.collect { + fileTree(dir: it, exclude: [ + "Main.class", //".Main.class" Указывайте полное имея пакета с точками + ]) + })) + } +} \ No newline at end of file diff --git a/Task_1_2_1/gradle/wrapper/gradle-wrapper.jar b/Task_1_2_1/gradle/wrapper/gradle-wrapper.jar new file mode 100644 index 00000000..41d9927a Binary files /dev/null and b/Task_1_2_1/gradle/wrapper/gradle-wrapper.jar differ diff --git a/Task_1_2_1/gradle/wrapper/gradle-wrapper.properties b/Task_1_2_1/gradle/wrapper/gradle-wrapper.properties new file mode 100644 index 00000000..41dfb879 --- /dev/null +++ b/Task_1_2_1/gradle/wrapper/gradle-wrapper.properties @@ -0,0 +1,5 @@ +distributionBase=GRADLE_USER_HOME +distributionPath=wrapper/dists +distributionUrl=https\://services.gradle.org/distributions/gradle-7.4-bin.zip +zipStoreBase=GRADLE_USER_HOME +zipStorePath=wrapper/dists diff --git a/Task_1_2_1/gradlew b/Task_1_2_1/gradlew new file mode 100644 index 00000000..1b6c7873 --- /dev/null +++ b/Task_1_2_1/gradlew @@ -0,0 +1,234 @@ +#!/bin/sh + +# +# Copyright © 2015-2021 the original authors. +# +# Licensed under the Apache License, Version 2.0 (the "License"); +# you may not use this file except in compliance with the License. +# You may obtain a copy of the License at +# +# https://www.apache.org/licenses/LICENSE-2.0 +# +# Unless required by applicable law or agreed to in writing, software +# distributed under the License is distributed on an "AS IS" BASIS, +# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. +# See the License for the specific language governing permissions and +# limitations under the License. +# + +############################################################################## +# +# Gradle start up script for POSIX generated by Gradle. +# +# Important for running: +# +# (1) You need a POSIX-compliant shell to run this script. If your /bin/sh is +# noncompliant, but you have some other compliant shell such as ksh or +# bash, then to run this script, type that shell name before the whole +# command line, like: +# +# ksh Gradle +# +# Busybox and similar reduced shells will NOT work, because this script +# requires all of these POSIX shell features: +# * functions; +# * expansions «$var», «${var}», «${var:-default}», «${var+SET}», +# «${var#prefix}», «${var%suffix}», and «$( cmd )»; +# * compound commands having a testable exit status, especially «case»; +# * various built-in commands including «command», «set», and «ulimit». +# +# Important for patching: +# +# (2) This script targets any POSIX shell, so it avoids extensions provided +# by Bash, Ksh, etc; in particular arrays are avoided. +# +# The "traditional" practice of packing multiple parameters into a +# space-separated string is a well documented source of bugs and security +# problems, so this is (mostly) avoided, by progressively accumulating +# options in "$@", and eventually passing that to Java. +# +# Where the inherited environment variables (DEFAULT_JVM_OPTS, JAVA_OPTS, +# and GRADLE_OPTS) rely on word-splitting, this is performed explicitly; +# see the in-line comments for details. +# +# There are tweaks for specific operating systems such as AIX, CygWin, +# Darwin, MinGW, and NonStop. +# +# (3) This script is generated from the Groovy template +# https://github.com/gradle/gradle/blob/master/subprojects/plugins/src/main/resources/org/gradle/api/internal/plugins/unixStartScript.txt +# within the Gradle project. +# +# You can find Gradle at https://github.com/gradle/gradle/. +# +############################################################################## + +# Attempt to set APP_HOME + +# Resolve links: $0 may be a link +app_path=$0 + +# Need this for daisy-chained symlinks. +while + APP_HOME=${app_path%"${app_path##*/}"} # leaves a trailing /; empty if no leading path + [ -h "$app_path" ] +do + ls=$( ls -ld "$app_path" ) + link=${ls#*' -> '} + case $link in #( + /*) app_path=$link ;; #( + *) app_path=$APP_HOME$link ;; + esac +done + +APP_HOME=$( cd "${APP_HOME:-./}" && pwd -P ) || exit + +APP_NAME="Gradle" +APP_BASE_NAME=${0##*/} + +# Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script. +DEFAULT_JVM_OPTS='"-Xmx64m" "-Xms64m"' + +# Use the maximum available, or set MAX_FD != -1 to use that value. +MAX_FD=maximum + +warn () { + echo "$*" +} >&2 + +die () { + echo + echo "$*" + echo + exit 1 +} >&2 + +# OS specific support (must be 'true' or 'false'). +cygwin=false +msys=false +darwin=false +nonstop=false +case "$( uname )" in #( + CYGWIN* ) cygwin=true ;; #( + Darwin* ) darwin=true ;; #( + MSYS* | MINGW* ) msys=true ;; #( + NONSTOP* ) nonstop=true ;; +esac + +CLASSPATH=$APP_HOME/gradle/wrapper/gradle-wrapper.jar + + +# Determine the Java command to use to start the JVM. +if [ -n "$JAVA_HOME" ] ; then + if [ -x "$JAVA_HOME/jre/sh/java" ] ; then + # IBM's JDK on AIX uses strange locations for the executables + JAVACMD=$JAVA_HOME/jre/sh/java + else + JAVACMD=$JAVA_HOME/bin/java + fi + if [ ! -x "$JAVACMD" ] ; then + die "ERROR: JAVA_HOME is set to an invalid directory: $JAVA_HOME + +Please set the JAVA_HOME variable in your environment to match the +location of your Java installation." + fi +else + JAVACMD=java + which java >/dev/null 2>&1 || die "ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH. + +Please set the JAVA_HOME variable in your environment to match the +location of your Java installation." +fi + +# Increase the maximum file descriptors if we can. +if ! "$cygwin" && ! "$darwin" && ! "$nonstop" ; then + case $MAX_FD in #( + max*) + MAX_FD=$( ulimit -H -n ) || + warn "Could not query maximum file descriptor limit" + esac + case $MAX_FD in #( + '' | soft) :;; #( + *) + ulimit -n "$MAX_FD" || + warn "Could not set maximum file descriptor limit to $MAX_FD" + esac +fi + +# Collect all arguments for the java command, stacking in reverse order: +# * args from the command line +# * the main class name +# * -classpath +# * -D...appname settings +# * --module-path (only if needed) +# * DEFAULT_JVM_OPTS, JAVA_OPTS, and GRADLE_OPTS environment variables. + +# For Cygwin or MSYS, switch paths to Windows format before running java +if "$cygwin" || "$msys" ; then + APP_HOME=$( cygpath --path --mixed "$APP_HOME" ) + CLASSPATH=$( cygpath --path --mixed "$CLASSPATH" ) + + JAVACMD=$( cygpath --unix "$JAVACMD" ) + + # Now convert the arguments - kludge to limit ourselves to /bin/sh + for arg do + if + case $arg in #( + -*) false ;; # don't mess with options #( + /?*) t=${arg#/} t=/${t%%/*} # looks like a POSIX filepath + [ -e "$t" ] ;; #( + *) false ;; + esac + then + arg=$( cygpath --path --ignore --mixed "$arg" ) + fi + # Roll the args list around exactly as many times as the number of + # args, so each arg winds up back in the position where it started, but + # possibly modified. + # + # NB: a `for` loop captures its iteration list before it begins, so + # changing the positional parameters here affects neither the number of + # iterations, nor the values presented in `arg`. + shift # remove old arg + set -- "$@" "$arg" # push replacement arg + done +fi + +# Collect all arguments for the java command; +# * $DEFAULT_JVM_OPTS, $JAVA_OPTS, and $GRADLE_OPTS can contain fragments of +# shell script including quotes and variable substitutions, so put them in +# double quotes to make sure that they get re-expanded; and +# * put everything else in single quotes, so that it's not re-expanded. + +set -- \ + "-Dorg.gradle.appname=$APP_BASE_NAME" \ + -classpath "$CLASSPATH" \ + org.gradle.wrapper.GradleWrapperMain \ + "$@" + +# Use "xargs" to parse quoted args. +# +# With -n1 it outputs one arg per line, with the quotes and backslashes removed. +# +# In Bash we could simply go: +# +# readarray ARGS < <( xargs -n1 <<<"$var" ) && +# set -- "${ARGS[@]}" "$@" +# +# but POSIX shell has neither arrays nor command substitution, so instead we +# post-process each arg (as a line of input to sed) to backslash-escape any +# character that might be a shell metacharacter, then use eval to reverse +# that process (while maintaining the separation between arguments), and wrap +# the whole thing up as a single "set" statement. +# +# This will of course break if any of these variables contains a newline or +# an unmatched quote. +# + +eval "set -- $( + printf '%s\n' "$DEFAULT_JVM_OPTS $JAVA_OPTS $GRADLE_OPTS" | + xargs -n1 | + sed ' s~[^-[:alnum:]+,./:=@_]~\\&~g; ' | + tr '\n' ' ' + )" '"$@"' + +exec "$JAVACMD" "$@" diff --git a/Task_1_2_1/gradlew.bat b/Task_1_2_1/gradlew.bat new file mode 100644 index 00000000..107acd32 --- /dev/null +++ b/Task_1_2_1/gradlew.bat @@ -0,0 +1,89 @@ +@rem +@rem Copyright 2015 the original author or authors. +@rem +@rem Licensed under the Apache License, Version 2.0 (the "License"); +@rem you may not use this file except in compliance with the License. +@rem You may obtain a copy of the License at +@rem +@rem https://www.apache.org/licenses/LICENSE-2.0 +@rem +@rem Unless required by applicable law or agreed to in writing, software +@rem distributed under the License is distributed on an "AS IS" BASIS, +@rem WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. +@rem See the License for the specific language governing permissions and +@rem limitations under the License. +@rem + +@if "%DEBUG%" == "" @echo off +@rem ########################################################################## +@rem +@rem Gradle startup script for Windows +@rem +@rem ########################################################################## + +@rem Set local scope for the variables with windows NT shell +if "%OS%"=="Windows_NT" setlocal + +set DIRNAME=%~dp0 +if "%DIRNAME%" == "" set DIRNAME=. +set APP_BASE_NAME=%~n0 +set APP_HOME=%DIRNAME% + +@rem Resolve any "." and ".." in APP_HOME to make it shorter. +for %%i in ("%APP_HOME%") do set APP_HOME=%%~fi + +@rem Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script. +set DEFAULT_JVM_OPTS="-Xmx64m" "-Xms64m" + +@rem Find java.exe +if defined JAVA_HOME goto findJavaFromJavaHome + +set JAVA_EXE=java.exe +%JAVA_EXE% -version >NUL 2>&1 +if "%ERRORLEVEL%" == "0" goto execute + +echo. +echo ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH. +echo. +echo Please set the JAVA_HOME variable in your environment to match the +echo location of your Java installation. + +goto fail + +:findJavaFromJavaHome +set JAVA_HOME=%JAVA_HOME:"=% +set JAVA_EXE=%JAVA_HOME%/bin/java.exe + +if exist "%JAVA_EXE%" goto execute + +echo. +echo ERROR: JAVA_HOME is set to an invalid directory: %JAVA_HOME% +echo. +echo Please set the JAVA_HOME variable in your environment to match the +echo location of your Java installation. + +goto fail + +:execute +@rem Setup the command line + +set CLASSPATH=%APP_HOME%\gradle\wrapper\gradle-wrapper.jar + + +@rem Execute Gradle +"%JAVA_EXE%" %DEFAULT_JVM_OPTS% %JAVA_OPTS% %GRADLE_OPTS% "-Dorg.gradle.appname=%APP_BASE_NAME%" -classpath "%CLASSPATH%" org.gradle.wrapper.GradleWrapperMain %* + +:end +@rem End local scope for the variables with windows NT shell +if "%ERRORLEVEL%"=="0" goto mainEnd + +:fail +rem Set variable GRADLE_EXIT_CONSOLE if you need the _script_ return code instead of +rem the _cmd.exe /c_ return code! +if not "" == "%GRADLE_EXIT_CONSOLE%" exit 1 +exit /b 1 + +:mainEnd +if "%OS%"=="Windows_NT" endlocal + +:omega diff --git a/Task_1_2_1/settings.gradle b/Task_1_2_1/settings.gradle new file mode 100644 index 00000000..e1dc0081 --- /dev/null +++ b/Task_1_2_1/settings.gradle @@ -0,0 +1,2 @@ +rootProject.name = 'Task_1_2_1' + diff --git a/Task_1_2_1/src/main/java/org/example/BfsIterable.java b/Task_1_2_1/src/main/java/org/example/BfsIterable.java new file mode 100644 index 00000000..1c3598d3 --- /dev/null +++ b/Task_1_2_1/src/main/java/org/example/BfsIterable.java @@ -0,0 +1,83 @@ +package org.example; + +import java.util.ArrayDeque; +import java.util.ConcurrentModificationException; +import java.util.Iterator; +import java.util.NoSuchElementException; + +/** + * Provides an iterable interface for breadth-first traversal of a Tree. + */ +public class BfsIterable implements Iterable { + + /** + * Implements an iterator interface for breadth-first traversal of a Tree. + */ + private class BfsIterator implements Iterator { + + // Queue used to store nodes in breadth-first order. + public ArrayDeque> bfsQueue; + + /** + * Constructor. Initializes the queue with the root node. + */ + public BfsIterator() { + bfsQueue = new ArrayDeque>(); + bfsQueue.add(treeNode); + treeNode.setTraverseProtection(true); + } + + /** + * Returns true if the iteration has more elements. + * In other words, returns true if next() would return an element. + * Rather than throwing an exception. + * + * @return true if the iteration has more elements. + */ + @Override + public boolean hasNext() { + return !bfsQueue.isEmpty(); + } + + /** + * Returns the next element in the iteration. + * + * @return the next element in the iteration. + */ + @Override + public T next() { + if (!hasNext()) { + throw new NoSuchElementException(); + } + Tree currentNode = bfsQueue.pollFirst(); + for (var child : currentNode.nodeChildren) { + child.setTraverseProtection(true); + bfsQueue.add(child); + } + currentNode.setTraverseProtection(false); + return currentNode.getNodeValue(); + } + } + + // The tree to traverse. + private final Tree treeNode; + + /** + * Constructor. + * + * @param treeNode The tree to traverse. + */ + public BfsIterable(Tree treeNode) { + this.treeNode = treeNode; + } + + /** + * Returns an iterator over elements of type T. + * + * @return an Iterator. + */ + @Override + public Iterator iterator() { + return new BfsIterator(); + } +} diff --git a/Task_1_2_1/src/main/java/org/example/DfsIterable.java b/Task_1_2_1/src/main/java/org/example/DfsIterable.java new file mode 100644 index 00000000..68b0ae31 --- /dev/null +++ b/Task_1_2_1/src/main/java/org/example/DfsIterable.java @@ -0,0 +1,82 @@ +package org.example; + +import java.util.ArrayDeque; +import java.util.ConcurrentModificationException; +import java.util.Iterator; +import java.util.NoSuchElementException; + +/** + * Provides an iterable interface for depth-first traversal of a Tree. + */ +public class DfsIterable implements Iterable { + + /** + * Implements an iterator interface for depth-first traversal of a Tree. + */ + private class DfsIterator implements Iterator { + + // Stack(Deque) used to store nodes in depth-first order. + public ArrayDeque> dfsStack; + + /** + * Constructor. Initializes the queue with the root node. + */ + public DfsIterator() { + dfsStack = new ArrayDeque>(); + dfsStack.add(treeNode); + treeNode.setTraverseProtection(true); + } + + /** + * Returns true if the iteration has more elements. + * In other words, returns true if next() would return an element. + * Rather than throwing an exception. + * + * @return true if the iteration has more elements. + */ + @Override + public boolean hasNext() { + if (dfsStack.isEmpty()) { + treeNode.setTraverseProtection(false); + } + return !dfsStack.isEmpty(); + } + + /** + * Returns the next element in the iteration. + * + * @return the next element in the iteration. + */ + @Override + public T next() { + if (!hasNext()) { + throw new NoSuchElementException(); + } + Tree currentNode = dfsStack.pollLast(); + dfsStack.addAll(currentNode.nodeChildren); + return currentNode.getNodeValue(); + } + } + + // The tree to traverse. + private final Tree treeNode; + + /** + * Constructor. + * + * @param treeNode The tree to traverse. + */ + public DfsIterable(Tree treeNode) { + this.treeNode = treeNode; + } + + /** + * Returns an iterator over elements of type T. + * + * @return an Iterator. + */ + @Override + public Iterator iterator() { + return new DfsIterator(); + } +} diff --git a/Task_1_2_1/src/main/java/org/example/Tree.java b/Task_1_2_1/src/main/java/org/example/Tree.java new file mode 100644 index 00000000..8b267182 --- /dev/null +++ b/Task_1_2_1/src/main/java/org/example/Tree.java @@ -0,0 +1,226 @@ +package org.example; + +import java.util.ArrayList; +import java.util.Arrays; +import java.util.ConcurrentModificationException; +import java.util.Iterator; + +/** + * Represents a tree data structure that stores generic values T. + * Provides methods for adding/removing nodes, traversing the tree, etc. + */ +public class Tree { + // The children list of this tree node. + ArrayList> nodeChildren; + // The parent node of this tree, or null if this is the root node. + private Tree nodeParent; + // The value stored at this tree node. + private T nodeValue; + private boolean traverseProtection = false; + + /** + * Gets the parent of this node. + * + * @return The node parent. + */ + public Tree getNodeParent() { + return nodeParent; + } + + /** + * Gets the value stored at this node. + * + * @return The node value. + */ + public T getNodeValue() { + return nodeValue; + } + + /** + * Sets the value stored at this node. + * + * @param nodeValue The new node value. + */ + public void setNodeValue(T nodeValue) { + if (nodeValue == null) { + throw new IllegalArgumentException("Node can't be a NULL"); + } + this.nodeValue = nodeValue; + } + + /** + * Creates a new tree node with the given value. + * + * @param value The value to store in the node. + */ + public Tree(T value) { + this.nodeChildren = new ArrayList>(); // initialized + setNodeValue(value); + } + + + /** + * Adds a child subtree. Sets this tree as the parent of the subtree. + * + * @param subtree The subtree to add. + * + * @return The added subtree, or null if it already had a parent. + */ + public Tree addChild(Tree subtree) { + if (subtree.nodeParent == null) { + subtree.nodeParent = this; // pointer to caller object + this.nodeChildren.add(subtree); + return subtree; + } + + return null; + } + + /** + * Creates a new leaf node with the given value and adds it as a child. + * + * @param leaf The leaf value to add. + * + * @return The new leaf node. + */ + public Tree addChild(T leaf) { + Tree newChild = new Tree(leaf); + newChild.nodeParent = this; + this.nodeChildren.add(newChild); + + return newChild; + } + + /** + * Removes this node from the tree. + */ + private void realRemove() { + for (var child : nodeChildren) { + child.nodeParent = null; + } + nodeChildren.clear(); + if (nodeParent != null) { + + this.nodeParent.nodeChildren.remove(this); + + nodeParent = null; + + } + nodeValue = null; + } + + /** + * Проверяет, защищена ли вершина или её предки. + * + * @return isProtected. + */ + public boolean isProtected() { + Tree vertex = this; + while (vertex != null) { + if (vertex.traverseProtection) { + return true; + } + vertex = vertex.nodeParent; + } + return false; + } + + + /** + * Обёртка над реальным удалением, которая будет проверять, выставлен ли флаг защиты. + * Если флаг защиты стоит, будет выброшено ConcurrentModification. + */ + public void remove() { + if (isProtected()) { + throw new ConcurrentModificationException( + "Cannot remove vertex in traversing or its descendant" + ); + } + realRemove(); + } + + public void setTraverseProtection(boolean traverseProtection) { + this.traverseProtection = traverseProtection; + } + + public boolean isTraverseProtection() { + return traverseProtection; + } + + /** + * Returns a flattened list of all node values in the subtree rooted at this node. + * + * @return The flattened subtree values. + */ + // cчитаем все от точки отсчета + private ArrayList subtreeStuff() { + var childrenValues = new ArrayList(); + for (Tree child : nodeChildren) { + childrenValues.add(child.nodeValue); + if (!child.nodeChildren.isEmpty()) { + childrenValues.addAll(child.subtreeStuff()); + } + } + + return childrenValues; + } + + /** + * Returns a hash code value for the object. This method is supported + * for the benefit of hash tables such as those provided by HashMap. + * + * @return a hash code value for this object. + */ + @Override + public int hashCode() { + Object[] fields = {nodeValue, this.subtreeStuff()}; + return Arrays.deepHashCode(fields); + } + + /** + * Checks the equality of this subtree and the another. + * + * @param obj the reference object with which to compare. + * + * @return true 1) if this object has the same value as the obj argument and + * 2) if this object has children branches that have the same order and the same values, + * otherwise it returns false. + */ + @Override + public boolean equals(Object obj) { + if (this == obj) { + return true; + } + + if (obj == null || this.getClass() != obj.getClass()) { + return false; + } + + if (this.hashCode() != obj.hashCode()) { + return false; + } + + final Tree comparable = (Tree) obj; + + return Arrays.equals(this.subtreeStuff().toArray(), comparable.subtreeStuff().toArray()) + && this.nodeValue == comparable.nodeValue; + } + + /** + * Returns an iterable that performs a breadth-first traversal of this tree. + * + * @return Breadth-first iterable. + */ + public Iterable bfs() { + return new BfsIterable(this); + } + + /** + * Returns an iterable that performs a depth-first traversal of this tree. + * + * @return Depth-first iterable. + */ + public Iterable dfs() { + return new DfsIterable(this); + } +} diff --git a/Task_1_2_1/src/test/java/org/example/TreeTest.java b/Task_1_2_1/src/test/java/org/example/TreeTest.java new file mode 100644 index 00000000..81295245 --- /dev/null +++ b/Task_1_2_1/src/test/java/org/example/TreeTest.java @@ -0,0 +1,356 @@ +package org.example; + +import java.util.ArrayList; +import java.util.Arrays; +import java.util.ConcurrentModificationException; +import java.util.Iterator; +import org.junit.jupiter.api.BeforeEach; +import org.junit.jupiter.api.Test; + +import static org.junit.jupiter.api.Assertions.*; + +class TreeTest { + + Tree treeI; + Tree treeS; + + @BeforeEach + void setUp() { + treeI = new Tree(1); + treeS = new Tree("Root"); + } + + @Test + void testSetValueException() { + assertThrows(IllegalArgumentException.class, () -> { + treeS.setNodeValue(null); + }); + } + + @Test + void testGetSetValueI() { + treeI.setNodeValue(5); + assertEquals(5, treeI.getNodeValue()); + } + + @Test + void testGetSetValueS() { + treeS.setNodeValue("Root0"); + assertEquals("Root0", treeS.getNodeValue()); + } + + @Test + void testAddChildSubtreeSizeI() { + Tree child = new Tree<>(2); + treeI.addChild(child); + assertEquals(1, treeI.nodeChildren.size()); + } + + @Test + void testAddChildSubtreeGetI() { + Tree child = new Tree<>(2); + treeI.addChild(child); + assertEquals(child, treeI.nodeChildren.get(0)); + } + + @Test + void testAddChildSubtreeParentI() { + Tree child = new Tree<>(2); + treeI.addChild(child); + assertEquals(treeI, child.getNodeParent()); + } + + + @Test + void testAddChildSubtreeSizeS() { + Tree child = new Tree<>("RootChild"); + treeS.addChild(child); + assertEquals(1, treeS.nodeChildren.size()); + } + + @Test + void testAddChildSubtreeGetS() { + Tree child = new Tree<>("RootChild"); + treeS.addChild(child); + assertEquals(child, treeS.nodeChildren.get(0)); + } + + @Test + void testAddChildSubtreeParentS() { + Tree child = new Tree<>("RootChild"); + treeS.addChild(child); + assertEquals(treeS, child.getNodeParent()); + } + + @Test + void testAddChildLeafSizeI() { + treeI.addChild(3); + assertEquals(1, treeI.nodeChildren.size()); + } + + @Test + void testAddChildLeafParentI() { + Tree leaf = treeI.addChild(3); + assertEquals(3, leaf.getNodeValue()); + } + + + @Test + void testAddChildLeafSizeS() { + treeS.addChild("RootChild"); + assertEquals(1, treeS.nodeChildren.size()); + } + + @Test + void testAddChildLeafParentS() { + Tree leaf = treeS.addChild("RootChild"); + assertEquals("RootChild", leaf.getNodeValue()); + } + + @Test + void testRemoveI() { + Tree child = new Tree<>(2); + treeI.addChild(child); + treeI.remove(); + assertNull(treeI.getNodeValue()); + } + + @Test + void testRemoveParentI() { + Tree child = new Tree<>(2); + treeI.addChild(child); + treeI.remove(); + assertNull(treeI.getNodeParent()); + } + + @Test + void testRemoveSizeI() { + Tree child = new Tree<>(2); + treeI.addChild(child); + treeI.remove(); + assertEquals(0, treeI.nodeChildren.size()); + } + + @Test + void testRemoveS() { + Tree child = new Tree<>("RootChild"); + treeS.addChild(child); + treeS.remove(); + assertNull(treeS.getNodeValue()); + } + + @Test + void testRemoveParentS() { + Tree child = new Tree<>("RootChild"); + treeS.addChild(child); + treeS.remove(); + assertNull(treeS.getNodeParent()); + } + + + @Test + void testRemoveChildS() { + Tree child = new Tree<>("RootChild"); + treeS.addChild(child); + treeS.remove(); + assertEquals("RootChild", child.getNodeValue()); + } + + @Test + void testRemoveChildParentS() { + Tree child = new Tree<>("RootChild"); + treeS.addChild(child); + treeS.remove(); + assertNull(child.getNodeParent()); + } + + @Test + void testRemoveSizeS() { + Tree child = new Tree<>("RootChild"); + treeS.addChild(child); + treeS.remove(); + assertEquals(0, treeS.nodeChildren.size()); + } + + @Test + void testEqHashCodeI() { + Tree sameTree = new Tree<>(1); + assertEquals(treeI.hashCode(), sameTree.hashCode()); + } + + @Test + void testHashCodeI() { + Tree diffTree = new Tree<>(2); + assertNotEquals(treeI.hashCode(), diffTree.hashCode()); + } + + @Test + void testEqHashCodeS() { + Tree sameTree = new Tree<>("Root"); + assertEquals(treeS.hashCode(), sameTree.hashCode()); + } + + @Test + void testHashCodeS() { + Tree diffTree = new Tree<>("AnotherRoot"); + assertNotEquals(treeS.hashCode(), diffTree.hashCode()); + } + + @Test + void testEqualsI() { + Tree sameTree = new Tree<>(1); + assertEquals(treeI, sameTree); + } + + @Test + void testNotEqualsI() { + Tree diffTree = new Tree<>(2); + assertNotEquals(treeI, diffTree); + } + + @Test + void testEqualsS() { + Tree sameTree = new Tree<>("Root"); + assertEquals(treeS, sameTree); + } + + @Test + void testNotEqualsS() { + Tree diffTree = new Tree<>("AnotherRoot"); + assertNotEquals(treeS, diffTree); + } + + @Test + void testDifGenEquals() { + Tree diffTree = new Tree<>(2); + assertNotEquals(treeS, diffTree); + } + + @Test + void testNullEquals() { + assertNotEquals(treeI, null); + } + + @Test + void testBfs() { + Tree child1 = treeI.addChild(2); + Tree child2 = treeI.addChild(3); + child1.addChild(4); + child2.addChild(5); + + Iterable bfs = treeI.bfs(); + Iterator itr = bfs.iterator(); + + ArrayList expected = new ArrayList<>(Arrays.asList(1, 2, 3, 4, 5)); + ArrayList result = new ArrayList<>(); + while (itr.hasNext()) { + result.add(itr.next()); + } + + assertEquals(expected, result); + } + + @Test + void testDfs() { + Tree child1 = treeS.addChild("B"); + Tree child2 = treeS.addChild("A"); + child1.addChild("B_child"); + child2.addChild("A2"); + child2.addChild("A1"); + + Iterable dfs = treeS.dfs(); + Iterator itr = dfs.iterator(); + + ArrayList expected = + new ArrayList<>(Arrays.asList("Root", "A", "A1", "A2", "B", "B_child")); + + ArrayList result = new ArrayList<>(); + while (itr.hasNext()) { + result.add(itr.next()); + } + + assertEquals(expected, result); + } + + + @Test + void testBfsConcurrentExceptionBeforeTraverse() { + Tree child1 = treeS.addChild("B"); + Tree child2 = treeS.addChild("A"); + child1.addChild("B_child"); + child2.addChild("A2"); + child2.addChild("A1"); + + + ArrayList result = new ArrayList<>(); + for (String curVal : treeS.bfs()) { + if (curVal.equals("A2")) + child2.remove(); + result.add(curVal); + } + ArrayList expected = + new ArrayList<>(Arrays.asList("Root", "B", "A", "B_child", "A2", "A1")); + assertEquals(expected, result); + } + + /* + Здесь мы пытаемся удалить вершину ниже текущего обхода BFS, поэтому получим ConcurrentModificationException + */ + @Test + void testBfsConcurrentExceptionAfterTraverse() { + Tree child1 = treeS.addChild("B"); + Tree child2 = treeS.addChild("A"); + child1.addChild("B_child"); + child2.addChild("A2"); + child2.addChild("A1"); + + + assertThrows(ConcurrentModificationException.class, () -> { + for (String curVal : treeS.bfs()) { + if (curVal.equals("Root")) { + child2.remove(); + } + } + }); + } + + /* + У DFS корень до самого конца считается находящимся в обходе + так что здесь при удалении хоть выше, хоть ниже должно быть исключение. + */ + @Test + void testDfsConcurrentExceptionBeforeTraverse() { + Tree child1 = treeI.addChild(1); + Tree child2 = treeI.addChild(2); + child1.addChild(5); + child2.addChild(4); + child2.addChild(3); + + + assertThrows(ConcurrentModificationException.class, () -> { + for (Integer curVal : treeI.dfs()) { + if (curVal == 1) { + child2.remove(); + } + } + }); + } + + @Test + void testDfsConcurrentExceptionAfterTraverse() { + Tree child1 = treeI.addChild(1); + Tree child2 = treeI.addChild(2); + child1.addChild(5); + child2.addChild(4); + child2.addChild(3); + + + assertThrows(ConcurrentModificationException.class, () -> { + for (Integer curVal : treeI.dfs()) { + if (curVal == 5) { + treeI.remove(); + } + } + }); + } +}