Initial commit
This commit is contained in:
commit
53af313799
|
|
@ -0,0 +1,9 @@
|
|||
#
|
||||
# https://help.github.com/articles/dealing-with-line-endings/
|
||||
#
|
||||
# Linux start script should use lf
|
||||
/gradlew text eol=lf
|
||||
|
||||
# These are Windows script files and should use crlf
|
||||
*.bat text eol=crlf
|
||||
|
||||
|
|
@ -0,0 +1,40 @@
|
|||
# gradle
|
||||
|
||||
.gradle/
|
||||
build/
|
||||
out/
|
||||
classes/
|
||||
|
||||
# eclipse
|
||||
|
||||
*.launch
|
||||
|
||||
# idea
|
||||
|
||||
.idea/
|
||||
*.iml
|
||||
*.ipr
|
||||
*.iws
|
||||
|
||||
# vscode
|
||||
|
||||
.settings/
|
||||
.vscode/
|
||||
bin/
|
||||
.classpath
|
||||
.project
|
||||
|
||||
# macos
|
||||
|
||||
*.DS_Store
|
||||
|
||||
# fabric
|
||||
|
||||
run/
|
||||
|
||||
# java
|
||||
|
||||
hs_err_*.log
|
||||
replay_*.log
|
||||
*.hprof
|
||||
*.jfr
|
||||
|
|
@ -0,0 +1,121 @@
|
|||
Creative Commons Legal Code
|
||||
|
||||
CC0 1.0 Universal
|
||||
|
||||
CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
|
||||
LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
|
||||
ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
|
||||
INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
|
||||
REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
|
||||
PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
|
||||
THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
|
||||
HEREUNDER.
|
||||
|
||||
Statement of Purpose
|
||||
|
||||
The laws of most jurisdictions throughout the world automatically confer
|
||||
exclusive Copyright and Related Rights (defined below) upon the creator
|
||||
and subsequent owner(s) (each and all, an "owner") of an original work of
|
||||
authorship and/or a database (each, a "Work").
|
||||
|
||||
Certain owners wish to permanently relinquish those rights to a Work for
|
||||
the purpose of contributing to a commons of creative, cultural and
|
||||
scientific works ("Commons") that the public can reliably and without fear
|
||||
of later claims of infringement build upon, modify, incorporate in other
|
||||
works, reuse and redistribute as freely as possible in any form whatsoever
|
||||
and for any purposes, including without limitation commercial purposes.
|
||||
These owners may contribute to the Commons to promote the ideal of a free
|
||||
culture and the further production of creative, cultural and scientific
|
||||
works, or to gain reputation or greater distribution for their Work in
|
||||
part through the use and efforts of others.
|
||||
|
||||
For these and/or other purposes and motivations, and without any
|
||||
expectation of additional consideration or compensation, the person
|
||||
associating CC0 with a Work (the "Affirmer"), to the extent that he or she
|
||||
is an owner of Copyright and Related Rights in the Work, voluntarily
|
||||
elects to apply CC0 to the Work and publicly distribute the Work under its
|
||||
terms, with knowledge of his or her Copyright and Related Rights in the
|
||||
Work and the meaning and intended legal effect of CC0 on those rights.
|
||||
|
||||
1. Copyright and Related Rights. A Work made available under CC0 may be
|
||||
protected by copyright and related or neighboring rights ("Copyright and
|
||||
Related Rights"). Copyright and Related Rights include, but are not
|
||||
limited to, the following:
|
||||
|
||||
i. the right to reproduce, adapt, distribute, perform, display,
|
||||
communicate, and translate a Work;
|
||||
ii. moral rights retained by the original author(s) and/or performer(s);
|
||||
iii. publicity and privacy rights pertaining to a person's image or
|
||||
likeness depicted in a Work;
|
||||
iv. rights protecting against unfair competition in regards to a Work,
|
||||
subject to the limitations in paragraph 4(a), below;
|
||||
v. rights protecting the extraction, dissemination, use and reuse of data
|
||||
in a Work;
|
||||
vi. database rights (such as those arising under Directive 96/9/EC of the
|
||||
European Parliament and of the Council of 11 March 1996 on the legal
|
||||
protection of databases, and under any national implementation
|
||||
thereof, including any amended or successor version of such
|
||||
directive); and
|
||||
vii. other similar, equivalent or corresponding rights throughout the
|
||||
world based on applicable law or treaty, and any national
|
||||
implementations thereof.
|
||||
|
||||
2. Waiver. To the greatest extent permitted by, but not in contravention
|
||||
of, applicable law, Affirmer hereby overtly, fully, permanently,
|
||||
irrevocably and unconditionally waives, abandons, and surrenders all of
|
||||
Affirmer's Copyright and Related Rights and associated claims and causes
|
||||
of action, whether now known or unknown (including existing as well as
|
||||
future claims and causes of action), in the Work (i) in all territories
|
||||
worldwide, (ii) for the maximum duration provided by applicable law or
|
||||
treaty (including future time extensions), (iii) in any current or future
|
||||
medium and for any number of copies, and (iv) for any purpose whatsoever,
|
||||
including without limitation commercial, advertising or promotional
|
||||
purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
|
||||
member of the public at large and to the detriment of Affirmer's heirs and
|
||||
successors, fully intending that such Waiver shall not be subject to
|
||||
revocation, rescission, cancellation, termination, or any other legal or
|
||||
equitable action to disrupt the quiet enjoyment of the Work by the public
|
||||
as contemplated by Affirmer's express Statement of Purpose.
|
||||
|
||||
3. Public License Fallback. Should any part of the Waiver for any reason
|
||||
be judged legally invalid or ineffective under applicable law, then the
|
||||
Waiver shall be preserved to the maximum extent permitted taking into
|
||||
account Affirmer's express Statement of Purpose. In addition, to the
|
||||
extent the Waiver is so judged Affirmer hereby grants to each affected
|
||||
person a royalty-free, non transferable, non sublicensable, non exclusive,
|
||||
irrevocable and unconditional license to exercise Affirmer's Copyright and
|
||||
Related Rights in the Work (i) in all territories worldwide, (ii) for the
|
||||
maximum duration provided by applicable law or treaty (including future
|
||||
time extensions), (iii) in any current or future medium and for any number
|
||||
of copies, and (iv) for any purpose whatsoever, including without
|
||||
limitation commercial, advertising or promotional purposes (the
|
||||
"License"). The License shall be deemed effective as of the date CC0 was
|
||||
applied by Affirmer to the Work. Should any part of the License for any
|
||||
reason be judged legally invalid or ineffective under applicable law, such
|
||||
partial invalidity or ineffectiveness shall not invalidate the remainder
|
||||
of the License, and in such case Affirmer hereby affirms that he or she
|
||||
will not (i) exercise any of his or her remaining Copyright and Related
|
||||
Rights in the Work or (ii) assert any associated claims and causes of
|
||||
action with respect to the Work, in either case contrary to Affirmer's
|
||||
express Statement of Purpose.
|
||||
|
||||
4. Limitations and Disclaimers.
|
||||
|
||||
a. No trademark or patent rights held by Affirmer are waived, abandoned,
|
||||
surrendered, licensed or otherwise affected by this document.
|
||||
b. Affirmer offers the Work as-is and makes no representations or
|
||||
warranties of any kind concerning the Work, express, implied,
|
||||
statutory or otherwise, including without limitation warranties of
|
||||
title, merchantability, fitness for a particular purpose, non
|
||||
infringement, or the absence of latent or other defects, accuracy, or
|
||||
the present or absence of errors, whether or not discoverable, all to
|
||||
the greatest extent permissible under applicable law.
|
||||
c. Affirmer disclaims responsibility for clearing rights of other persons
|
||||
that may apply to the Work or any use thereof, including without
|
||||
limitation any person's Copyright and Related Rights in the Work.
|
||||
Further, Affirmer disclaims responsibility for obtaining any necessary
|
||||
consents, permissions or other rights required for any use of the
|
||||
Work.
|
||||
d. Affirmer understands and acknowledges that Creative Commons is not a
|
||||
party to this document and has no duty or obligation with respect to
|
||||
this CC0 or use of the Work.
|
||||
|
|
@ -0,0 +1,159 @@
|
|||
# Presence
|
||||
|
||||
The ever-present range detection library for Java.
|
||||
|
||||
## Features
|
||||
|
||||
- Simple, easy-to-use API
|
||||
- Relies on no existing game libraries (e.g Fabric)
|
||||
- No need to extend any classes
|
||||
- Supports both integer and floating-point ranges
|
||||
- Can implement own presence types with ease
|
||||
- Uses spatial partitioning (chunk-based) for efficient range detection
|
||||
- Uses Manhattan distance (in default implementations) for range detection
|
||||
- Can be used in any Java project
|
||||
- No dependencies (except for JUnit for testing)
|
||||
|
||||
## Installation
|
||||
|
||||
To use the API, add the following to your `build.gradle`:
|
||||
|
||||
```groovy
|
||||
repositories {
|
||||
maven {
|
||||
name = "Arzumify's Maven"
|
||||
url = "https://maven.ailur.dev"
|
||||
}
|
||||
}
|
||||
|
||||
dependencies {
|
||||
implementation "arzumify:presence:${version}"
|
||||
}
|
||||
```
|
||||
|
||||
To get the latest version, check the [Maven repository](https://maven.ailur.dev/arzumify/presence).
|
||||
|
||||
## Usage
|
||||
|
||||
### Implementing a Presence Provider
|
||||
|
||||
```java
|
||||
import arzumify.presence.presences.IntegerPresence;
|
||||
import arzumify.presence.presences.PresenceProvider;
|
||||
|
||||
public class ExampleIntegerPresence implements PresenceProvider<IntegerPresence> {
|
||||
ExampleIntegerPresence(int range, Vec3i... points) {
|
||||
this.presence = new IntegerPresence(range, points);
|
||||
}
|
||||
|
||||
private final IntegerPresence presence;
|
||||
|
||||
public Presence<IntegerPresence> presence() {
|
||||
return this.presence;
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
It's that simple! Even better, no extends, leaving you free to use that elsewhere.
|
||||
|
||||
### Using that Presence Provider
|
||||
|
||||
```java
|
||||
public class Main {
|
||||
private final Channel global = new Channel(true);
|
||||
private final MatchMaker<FloatingPresence, ExampleFloatingPresence> matchMaker = new MatchMaker<>();
|
||||
|
||||
public static void main(String[] args) {
|
||||
var presence = new ExampleIntegerPresence(5, new Vec3i(0, 0, 0));
|
||||
var presence2 = new ExampleIntegerPresence(5, new Vec3i(1, 1, 1));
|
||||
matchMaker.Add(presence, global); // Add to global channel
|
||||
matchMaker.Add(presence2, global); // Add to global channel
|
||||
var found = matchMaker.Search(presence, global); // Search on global channel
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
### Implementing a Presence Type
|
||||
|
||||
Just implement the `Presence` interface and you're good to go!
|
||||
|
||||
```java
|
||||
package arzumify.presence.presences;
|
||||
|
||||
import arzumify.presence.maths.Vec2i;
|
||||
|
||||
import java.util.Set;
|
||||
|
||||
public interface Presence<T extends Presence<T>> {
|
||||
Set<Vec2i> GetChunks();
|
||||
|
||||
Set<Vec2i> GetCollisionChunks();
|
||||
|
||||
boolean Matches(Presence<T> presence);
|
||||
}
|
||||
```
|
||||
|
||||
A "Chunk" is defined as a 16x16 block area in the world. This is used for spatial partitioning.
|
||||
To calculate a chunk from a position, convert the position into an integer position, then shift right by 4.
|
||||
|
||||
```java
|
||||
public Set<Vec2i> getChunkPresence(Set<Vec3i> positions) {
|
||||
var chunks = new Set<Vec2i>();
|
||||
for (Vec3i position : positions) {
|
||||
chunks.add(new Vec2i(position.x() >> 4, position.z() >> 4));
|
||||
}
|
||||
return chunks;
|
||||
}
|
||||
```
|
||||
|
||||
## License
|
||||
|
||||
This library is licensed under the GPL-3.0 License. See the LICENSE file for more information.
|
||||
|
||||
## TL;DR (not legal advice):
|
||||
|
||||
You CAN:
|
||||
|
||||
- Redistribute this library
|
||||
- modify this library
|
||||
- Use this library in a project
|
||||
- Use this library in a video or stream
|
||||
- Sell this library as part of a larger work
|
||||
- Use this library for any purpose
|
||||
|
||||
You CANNOT:
|
||||
|
||||
- Hold the author liable
|
||||
- Claim this library as your own
|
||||
- Change the license of this library
|
||||
- Redistribute the library without the source code
|
||||
- modify the library without sharing the source code
|
||||
|
||||
You MUST:
|
||||
|
||||
- Share the source code of this library
|
||||
- Include the license with any redistribution
|
||||
- Include the source code with any redistribution
|
||||
- Reproduce the below disclaimer in any redistribution
|
||||
|
||||
Thank you for keeping the Java community open and free!
|
||||
|
||||
## Disclaimer
|
||||
|
||||
```
|
||||
Presence - The ever-present range detection library for Java.
|
||||
Copyright (C) 2025 Arzumify
|
||||
|
||||
This program is free software: you can redistribute it and/or libraryify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
```
|
||||
|
|
@ -0,0 +1,46 @@
|
|||
plugins {
|
||||
id "java"
|
||||
}
|
||||
|
||||
version = project.mod_version
|
||||
group = project.maven_group
|
||||
|
||||
base {
|
||||
archivesName = project.archives_base_name
|
||||
}
|
||||
|
||||
repositories {
|
||||
mavenCentral()
|
||||
}
|
||||
|
||||
dependencies {
|
||||
// Testing
|
||||
testImplementation(platform('org.junit:junit-bom:5.12.0'))
|
||||
testImplementation('org.junit.jupiter:junit-jupiter')
|
||||
testRuntimeOnly('org.junit.platform:junit-platform-launcher')
|
||||
}
|
||||
|
||||
tasks.named("test", Test) {
|
||||
useJUnitPlatform()
|
||||
}
|
||||
|
||||
processResources {
|
||||
inputs.property "version", project.version
|
||||
}
|
||||
|
||||
tasks.withType(JavaCompile).configureEach {
|
||||
it.options.release = 21
|
||||
}
|
||||
|
||||
java {
|
||||
withSourcesJar()
|
||||
|
||||
sourceCompatibility = JavaVersion.VERSION_21
|
||||
targetCompatibility = JavaVersion.VERSION_21
|
||||
}
|
||||
|
||||
jar {
|
||||
from("LICENSE") {
|
||||
rename { "${it}_${inputs.properties.archivesName}" }
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,7 @@
|
|||
# Done to increase the memory available to gradle.
|
||||
org.gradle.jvmargs=-Xmx1G
|
||||
org.gradle.parallel=true
|
||||
# Mod Properties
|
||||
mod_version=1.0.0
|
||||
maven_group=arzumify.presence
|
||||
archives_base_name=presence
|
||||
Binary file not shown.
|
|
@ -0,0 +1,7 @@
|
|||
distributionBase=GRADLE_USER_HOME
|
||||
distributionPath=wrapper/dists
|
||||
distributionUrl=https\://services.gradle.org/distributions/gradle-8.12.1-bin.zip
|
||||
networkTimeout=10000
|
||||
validateDistributionUrl=true
|
||||
zipStoreBase=GRADLE_USER_HOME
|
||||
zipStorePath=wrapper/dists
|
||||
|
|
@ -0,0 +1,251 @@
|
|||
#!/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.
|
||||
#
|
||||
# SPDX-License-Identifier: Apache-2.0
|
||||
#
|
||||
|
||||
##############################################################################
|
||||
#
|
||||
# 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/HEAD/platforms/jvm/plugins-application/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
|
||||
|
||||
# This is normally unused
|
||||
# shellcheck disable=SC2034
|
||||
APP_BASE_NAME=${0##*/}
|
||||
# Discard cd standard output in case $CDPATH is set (https://github.com/gradle/gradle/issues/25036)
|
||||
APP_HOME=$( cd -P "${APP_HOME:-./}" > /dev/null && printf '%s\n' "$PWD" ) || exit
|
||||
|
||||
# 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
|
||||
if ! command -v java >/dev/null 2>&1
|
||||
then
|
||||
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
|
||||
fi
|
||||
|
||||
# Increase the maximum file descriptors if we can.
|
||||
if ! "$cygwin" && ! "$darwin" && ! "$nonstop" ; then
|
||||
case $MAX_FD in #(
|
||||
max*)
|
||||
# In POSIX sh, ulimit -H is undefined. That's why the result is checked to see if it worked.
|
||||
# shellcheck disable=SC2039,SC3045
|
||||
MAX_FD=$( ulimit -H -n ) ||
|
||||
warn "Could not query maximum file descriptor limit"
|
||||
esac
|
||||
case $MAX_FD in #(
|
||||
'' | soft) :;; #(
|
||||
*)
|
||||
# In POSIX sh, ulimit -n is undefined. That's why the result is checked to see if it worked.
|
||||
# shellcheck disable=SC2039,SC3045
|
||||
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
|
||||
|
||||
|
||||
# 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"'
|
||||
|
||||
# Collect all arguments for the java command:
|
||||
# * DEFAULT_JVM_OPTS, JAVA_OPTS, JAVA_OPTS, and optsEnvironmentVar are not allowed to contain shell fragments,
|
||||
# and any embedded shellness will be escaped.
|
||||
# * For example: A user cannot expect ${Hostname} to be expanded, as it is an environment variable and will be
|
||||
# treated as '${Hostname}' itself on the command line.
|
||||
|
||||
set -- \
|
||||
"-Dorg.gradle.appname=$APP_BASE_NAME" \
|
||||
-classpath "$CLASSPATH" \
|
||||
org.gradle.wrapper.GradleWrapperMain \
|
||||
"$@"
|
||||
|
||||
# Stop when "xargs" is not available.
|
||||
if ! command -v xargs >/dev/null 2>&1
|
||||
then
|
||||
die "xargs is not available"
|
||||
fi
|
||||
|
||||
# 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" "$@"
|
||||
|
|
@ -0,0 +1,94 @@
|
|||
@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
|
||||
@rem SPDX-License-Identifier: Apache-2.0
|
||||
@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=.
|
||||
@rem This is normally unused
|
||||
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% equ 0 goto execute
|
||||
|
||||
echo. 1>&2
|
||||
echo ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH. 1>&2
|
||||
echo. 1>&2
|
||||
echo Please set the JAVA_HOME variable in your environment to match the 1>&2
|
||||
echo location of your Java installation. 1>&2
|
||||
|
||||
goto fail
|
||||
|
||||
:findJavaFromJavaHome
|
||||
set JAVA_HOME=%JAVA_HOME:"=%
|
||||
set JAVA_EXE=%JAVA_HOME%/bin/java.exe
|
||||
|
||||
if exist "%JAVA_EXE%" goto execute
|
||||
|
||||
echo. 1>&2
|
||||
echo ERROR: JAVA_HOME is set to an invalid directory: %JAVA_HOME% 1>&2
|
||||
echo. 1>&2
|
||||
echo Please set the JAVA_HOME variable in your environment to match the 1>&2
|
||||
echo location of your Java installation. 1>&2
|
||||
|
||||
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% equ 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!
|
||||
set EXIT_CODE=%ERRORLEVEL%
|
||||
if %EXIT_CODE% equ 0 set EXIT_CODE=1
|
||||
if not ""=="%GRADLE_EXIT_CONSOLE%" exit %EXIT_CODE%
|
||||
exit /b %EXIT_CODE%
|
||||
|
||||
:mainEnd
|
||||
if "%OS%"=="Windows_NT" endlocal
|
||||
|
||||
:omega
|
||||
|
|
@ -0,0 +1,10 @@
|
|||
pluginManagement {
|
||||
repositories {
|
||||
maven {
|
||||
name = 'Fabric'
|
||||
url = 'https://maven.fabricmc.net/'
|
||||
}
|
||||
mavenCentral()
|
||||
gradlePluginPortal()
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,6 @@
|
|||
package arzumify.presence.matchmaker;
|
||||
|
||||
public class Channel {
|
||||
public Channel() {
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,44 @@
|
|||
package arzumify.presence.matchmaker;
|
||||
|
||||
import arzumify.presence.maths.Vec2i;
|
||||
import arzumify.presence.presences.Presence;
|
||||
import arzumify.presence.presences.PresenceProvider;
|
||||
|
||||
import java.util.Collections;
|
||||
import java.util.HashSet;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
import java.util.concurrent.ConcurrentHashMap;
|
||||
|
||||
public class MatchMaker<P extends Presence<P>, T extends PresenceProvider<P>> {
|
||||
public MatchMaker() {
|
||||
}
|
||||
|
||||
private final Map<Channel, Map<Vec2i, Set<T>>> channels = new ConcurrentHashMap<>();
|
||||
|
||||
public void Add(T match, Channel channel) {
|
||||
channels.putIfAbsent(channel, new ConcurrentHashMap<>());
|
||||
for (Vec2i chunk : match.presence().GetChunks()) {
|
||||
channels.get(channel).putIfAbsent(chunk, new HashSet<>());
|
||||
channels.get(channel).get(chunk).add(match);
|
||||
}
|
||||
}
|
||||
|
||||
public Set<T> Search(T match, Channel channel) {
|
||||
Set<T> matches = new HashSet<>();
|
||||
Set<Vec2i> presenceChunks = match.presence().GetCollisionChunks();
|
||||
if (!Collections.disjoint(presenceChunks, channels.get(channel).keySet())) {
|
||||
presenceChunks.retainAll(channels.get(channel).keySet());
|
||||
for (Vec2i chunk : presenceChunks) {
|
||||
for (T matching : channels.get(channel).get(chunk)) {
|
||||
if (match != matching) {
|
||||
if (match.presence().Matches(matching.presence())) {
|
||||
matches.add(matching);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return matches;
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,7 @@
|
|||
package arzumify.presence.maths;
|
||||
|
||||
/**
|
||||
* A vector composed of 2 integers.
|
||||
*/
|
||||
public record Vec2i(int x, int y) {
|
||||
}
|
||||
|
|
@ -0,0 +1,10 @@
|
|||
package arzumify.presence.maths;
|
||||
|
||||
/**
|
||||
* A vector composed of 3 floats.
|
||||
*/
|
||||
public record Vec3f(float x, float y, float z) {
|
||||
public Vec3f add(Vec3f offset) {
|
||||
return new Vec3f(x + offset.x, y + offset.y, z + offset.z);
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,10 @@
|
|||
package arzumify.presence.maths;
|
||||
|
||||
/**
|
||||
* A vector composed of 3 integers.
|
||||
*/
|
||||
public record Vec3i(int x, int y, int z) {
|
||||
public Vec3i add(Vec3i offset) {
|
||||
return new Vec3i(x + offset.x, y + offset.y, z + offset.z);
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,95 @@
|
|||
package arzumify.presence.presences;
|
||||
|
||||
import arzumify.presence.maths.Vec2i;
|
||||
import arzumify.presence.maths.Vec3f;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
public class FloatingPresence implements Presence<FloatingPresence> {
|
||||
public FloatingPresence(short range, Vec3f... basePositions) {
|
||||
this.basePositions.addAll(List.of(basePositions));
|
||||
this.range = range;
|
||||
this.baseChunkPresence = getChunkPresence(this.basePositions);
|
||||
this.collisionChunkPresence = getChunkPresence(ComputeCollisionShape(range, this.basePositions));
|
||||
}
|
||||
|
||||
private final HashSet<Vec3f> basePositions = new HashSet<>();
|
||||
public final HashSet<Vec2i> baseChunkPresence;
|
||||
public final HashSet<Vec2i> collisionChunkPresence;
|
||||
private final short range;
|
||||
|
||||
// Calculates the chunk presence for the given positions
|
||||
public HashSet<Vec2i> getChunkPresence(HashSet<Vec3f> positions) {
|
||||
var chunkPresence = new HashSet<Vec2i>();
|
||||
for (Vec3f basePosition : positions) {
|
||||
chunkPresence.add(new Vec2i((int) basePosition.x() >> 4, (int) basePosition.z() >> 4));
|
||||
}
|
||||
return chunkPresence;
|
||||
}
|
||||
|
||||
|
||||
@Override
|
||||
public boolean Matches(Presence<FloatingPresence> presence) {
|
||||
return presence instanceof FloatingPresence && matches((FloatingPresence) presence);
|
||||
}
|
||||
|
||||
private boolean matches(FloatingPresence other) {
|
||||
// Take the other's base position and calculate the manhattan distance to each of this presence's positions
|
||||
for (Vec3f otherBasePosition : other.basePositions) {
|
||||
for (Vec3f presence : this.basePositions) {
|
||||
if (ManhattanDistance(otherBasePosition, presence) <= this.range) {
|
||||
return true;
|
||||
} else {
|
||||
// Print the manhattan distance
|
||||
System.out.println("Manhattan distance between " + otherBasePosition + " and " + presence + " is " + ManhattanDistance(otherBasePosition, presence));
|
||||
}
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
public float ManhattanDistance(Vec3f a, Vec3f b) {
|
||||
return Math.abs(a.x() - b.x()) + Math.abs(a.y() - b.y()) + Math.abs(a.z() - b.z());
|
||||
}
|
||||
|
||||
private static final Map<Short, HashSet<Vec3f>> cachedCollisionShapes = new HashMap<>();
|
||||
|
||||
private static HashSet<Vec3f> ComputeCollisionShape(short range, Set<Vec3f> basePositions) {
|
||||
if (!cachedCollisionShapes.containsKey(range)) {
|
||||
var possiblePresences = ComputePossiblePresences(range);
|
||||
cachedCollisionShapes.put(range, possiblePresences);
|
||||
}
|
||||
var collisionShape = new HashSet<Vec3f>();
|
||||
for (Vec3f basePosition : basePositions) {
|
||||
for (Vec3f possiblePresence : cachedCollisionShapes.get(range)) {
|
||||
collisionShape.add(basePosition.add(possiblePresence));
|
||||
}
|
||||
}
|
||||
return collisionShape;
|
||||
}
|
||||
|
||||
public static HashSet<Vec3f> ComputePossiblePresences(short range) {
|
||||
var presences = new HashSet<Vec3f>();
|
||||
for (int dx = -range; dx <= range; dx++) {
|
||||
for (int dy = -range; dy <= range; dy++) {
|
||||
int dzMax = range - (Math.abs(dx) + Math.abs(dy));
|
||||
if (dzMax >= 0) {
|
||||
for (int dz = -dzMax; dz <= dzMax; dz++) {
|
||||
presences.add(new Vec3f(dx, dy, dz));
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return presences;
|
||||
}
|
||||
|
||||
@Override
|
||||
public HashSet<Vec2i> GetChunks() {
|
||||
return baseChunkPresence;
|
||||
}
|
||||
|
||||
@Override
|
||||
public HashSet<Vec2i> GetCollisionChunks() {
|
||||
return collisionChunkPresence;
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,94 @@
|
|||
package arzumify.presence.presences;
|
||||
|
||||
import arzumify.presence.maths.Vec2i;
|
||||
import arzumify.presence.maths.Vec3i;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
public class IntegerPresence implements Presence<IntegerPresence> {
|
||||
public IntegerPresence(short range, Vec3i... basePositions) {
|
||||
this.basePositions.addAll(List.of(basePositions));
|
||||
this.range = range;
|
||||
this.baseChunkPresence = getChunkPresence(this.basePositions);
|
||||
this.collisionChunkPresence = getChunkPresence(ComputeCollisionShape(range, this.basePositions));
|
||||
}
|
||||
|
||||
private final HashSet<Vec3i> basePositions = new HashSet<>();
|
||||
public final HashSet<Vec2i> baseChunkPresence;
|
||||
public final HashSet<Vec2i> collisionChunkPresence;
|
||||
private final short range;
|
||||
|
||||
// Calculates the chunk presence for the given positions
|
||||
public HashSet<Vec2i> getChunkPresence(HashSet<Vec3i> positions) {
|
||||
var chunkPresence = new HashSet<Vec2i>();
|
||||
for (Vec3i basePosition : positions) {
|
||||
chunkPresence.add(new Vec2i(basePosition.x() >> 4, basePosition.z() >> 4));
|
||||
}
|
||||
return chunkPresence;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean Matches(Presence<IntegerPresence> presence) {
|
||||
return presence instanceof IntegerPresence && matches((IntegerPresence) presence);
|
||||
}
|
||||
|
||||
private boolean matches(IntegerPresence other) {
|
||||
// Take the other's base position and calculate the manhattan distance to each of this presence's positions
|
||||
for (Vec3i otherBasePosition : other.basePositions) {
|
||||
for (Vec3i presence : this.basePositions) {
|
||||
if (ManhattanDistance(otherBasePosition, presence) <= this.range) {
|
||||
return true;
|
||||
} else {
|
||||
// Print the manhattan distance
|
||||
System.out.println("Manhattan distance between " + otherBasePosition + " and " + presence + " is " + ManhattanDistance(otherBasePosition, presence));
|
||||
}
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
public int ManhattanDistance(Vec3i a, Vec3i b) {
|
||||
return Math.abs(a.x() - b.x()) + Math.abs(a.y() - b.y()) + Math.abs(a.z() - b.z());
|
||||
}
|
||||
|
||||
private static final Map<Short, HashSet<Vec3i>> cachedCollisionShapes = new HashMap<>();
|
||||
|
||||
private static HashSet<Vec3i> ComputeCollisionShape(short range, Set<Vec3i> basePositions) {
|
||||
if (!cachedCollisionShapes.containsKey(range)) {
|
||||
var possiblePresences = ComputePossiblePresences(range);
|
||||
cachedCollisionShapes.put(range, possiblePresences);
|
||||
}
|
||||
var collisionShape = new HashSet<Vec3i>();
|
||||
for (Vec3i basePosition : basePositions) {
|
||||
for (Vec3i possiblePresence : cachedCollisionShapes.get(range)) {
|
||||
collisionShape.add(basePosition.add(possiblePresence));
|
||||
}
|
||||
}
|
||||
return collisionShape;
|
||||
}
|
||||
|
||||
public static HashSet<Vec3i> ComputePossiblePresences(short range) {
|
||||
var presences = new HashSet<Vec3i>();
|
||||
for (int dx = -range; dx <= range; dx++) {
|
||||
for (int dy = -range; dy <= range; dy++) {
|
||||
int dzMax = range - (Math.abs(dx) + Math.abs(dy));
|
||||
if (dzMax >= 0) {
|
||||
for (int dz = -dzMax; dz <= dzMax; dz++) {
|
||||
presences.add(new Vec3i(dx, dy, dz));
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return presences;
|
||||
}
|
||||
|
||||
@Override
|
||||
public HashSet<Vec2i> GetChunks() {
|
||||
return baseChunkPresence;
|
||||
}
|
||||
|
||||
@Override
|
||||
public HashSet<Vec2i> GetCollisionChunks() {
|
||||
return collisionChunkPresence;
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,13 @@
|
|||
package arzumify.presence.presences;
|
||||
|
||||
import arzumify.presence.maths.Vec2i;
|
||||
|
||||
import java.util.Set;
|
||||
|
||||
public interface Presence<T extends Presence<T>> {
|
||||
Set<Vec2i> GetChunks();
|
||||
|
||||
Set<Vec2i> GetCollisionChunks();
|
||||
|
||||
boolean Matches(Presence<T> presence);
|
||||
}
|
||||
|
|
@ -0,0 +1,6 @@
|
|||
package arzumify.presence.presences;
|
||||
|
||||
public interface PresenceProvider<T extends Presence<T>> {
|
||||
// Returns the presence
|
||||
Presence<T> presence();
|
||||
}
|
||||
|
|
@ -0,0 +1,5 @@
|
|||
import arzumify.presence.presences.FloatingPresence;
|
||||
import arzumify.presence.presences.PresenceProvider;
|
||||
|
||||
public record ExampleFloatingPresence(FloatingPresence presence) implements PresenceProvider<FloatingPresence> {
|
||||
}
|
||||
|
|
@ -0,0 +1,5 @@
|
|||
import arzumify.presence.presences.IntegerPresence;
|
||||
import arzumify.presence.presences.PresenceProvider;
|
||||
|
||||
public record ExampleIntegerPresence(IntegerPresence presence) implements PresenceProvider<IntegerPresence> {
|
||||
}
|
||||
|
|
@ -0,0 +1,186 @@
|
|||
import arzumify.presence.matchmaker.Channel;
|
||||
import arzumify.presence.matchmaker.MatchMaker;
|
||||
import arzumify.presence.maths.Vec3f;
|
||||
import arzumify.presence.presences.FloatingPresence;
|
||||
import org.junit.jupiter.api.Nested;
|
||||
import org.junit.jupiter.api.Test;
|
||||
import org.junit.jupiter.api.Timeout;
|
||||
|
||||
import java.util.HashSet;
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
import java.util.Set;
|
||||
|
||||
import static arzumify.presence.presences.FloatingPresence.ComputePossiblePresences;
|
||||
import static org.junit.jupiter.api.Assertions.*;
|
||||
|
||||
@Timeout(1)
|
||||
public class FloatingPresenceTests {
|
||||
private final Channel global = new Channel();
|
||||
private final Random rand = new Random();
|
||||
|
||||
@Test
|
||||
public void testOffsetCalculations() {
|
||||
System.out.println("Testing offset calculations");
|
||||
var set = ComputePossiblePresences((short) 1);
|
||||
System.out.println(set);
|
||||
assertTrue(set.containsAll(Set.of(
|
||||
new Vec3f(1, 0, 0),
|
||||
new Vec3f(0, 1, 0),
|
||||
new Vec3f(0, 0, 1),
|
||||
new Vec3f(-1, 0, 0),
|
||||
new Vec3f(0, -1, 0),
|
||||
new Vec3f(0, 0, -1)
|
||||
)));
|
||||
}
|
||||
|
||||
@Test
|
||||
public void testPresenceCalculations() {
|
||||
System.out.println("Testing presence calculations");
|
||||
var presence = new FloatingPresence((short) 1, new Vec3f(0, 0, 0));
|
||||
var presence2 = new FloatingPresence((short) 1, new Vec3f(1, 0, 0));
|
||||
assertTrue(presence.Matches(presence2));
|
||||
}
|
||||
|
||||
@Nested
|
||||
class TestMatchMaker {
|
||||
private final MatchMaker<FloatingPresence, ExampleFloatingPresence> matchMaker = new MatchMaker<>();
|
||||
private final ExampleFloatingPresence presence = new ExampleFloatingPresence(new FloatingPresence((short) 1, new Vec3f(0, 0, 0)));
|
||||
private final ExampleFloatingPresence presence2 = new ExampleFloatingPresence(new FloatingPresence((short) 1, new Vec3f(1, 0, 0)));
|
||||
|
||||
@Test
|
||||
public void testMatchMaker() {
|
||||
System.out.println("Testing match maker");
|
||||
matchMaker.Add(presence, global);
|
||||
matchMaker.Add(presence2, global);
|
||||
var matches = matchMaker.Search(presence, global);
|
||||
assertEquals(1, matches.size());
|
||||
System.out.println(matches);
|
||||
assertTrue(matches.contains(presence2));
|
||||
}
|
||||
}
|
||||
|
||||
@Nested
|
||||
class TestMatchMakerLongRange {
|
||||
private final MatchMaker<FloatingPresence, ExampleFloatingPresence> matchMaker = new MatchMaker<>();
|
||||
private final ExampleFloatingPresence presence = new ExampleFloatingPresence(new FloatingPresence((short) 64, new Vec3f(0, 0, 0)));
|
||||
private final List<Vec3f> validPresences = ComputePossiblePresences((short) 64).stream().toList();
|
||||
private final ExampleFloatingPresence presence2 = new ExampleFloatingPresence(new FloatingPresence((short) 64, validPresences.get(rand.nextInt(validPresences.size() - 1))));
|
||||
|
||||
@Test
|
||||
public void testMatchMakerLongRange() {
|
||||
System.out.println("Testing match maker long range");
|
||||
matchMaker.Add(presence, global);
|
||||
matchMaker.Add(presence2, global);
|
||||
var matches = matchMaker.Search(presence, global);
|
||||
assertEquals(1, matches.size());
|
||||
assertTrue(matches.contains(presence2));
|
||||
}
|
||||
}
|
||||
|
||||
@Nested
|
||||
class TestMatchMakerManyBasePositions {
|
||||
private final MatchMaker<FloatingPresence, ExampleFloatingPresence> matchMaker = new MatchMaker<>();
|
||||
private final ExampleFloatingPresence presence = new ExampleFloatingPresence(new FloatingPresence((short) 1, new Vec3f(0, 0, 0), new Vec3f(1, 0, 0)));
|
||||
private final ExampleFloatingPresence presence2 = new ExampleFloatingPresence(new FloatingPresence((short) 1, new Vec3f(2, 0, 0), new Vec3f(3, 0, 0)));
|
||||
|
||||
@Test
|
||||
public void testMatchMakerManyBasePositions() {
|
||||
System.out.println("Testing match maker many base positions");
|
||||
matchMaker.Add(presence, global);
|
||||
matchMaker.Add(presence2, global);
|
||||
var matches = matchMaker.Search(presence, global);
|
||||
assertEquals(1, matches.size());
|
||||
assertTrue(matches.contains(presence2));
|
||||
}
|
||||
}
|
||||
|
||||
@Nested
|
||||
class TestMatchMakerManyBasePositionsLongRange {
|
||||
private final MatchMaker<FloatingPresence, ExampleFloatingPresence> matchMaker = new MatchMaker<>();
|
||||
private final ExampleFloatingPresence presence = new ExampleFloatingPresence(new FloatingPresence((short) 64, new Vec3f(0, 0, 0), new Vec3f(1, 0, 0)));
|
||||
private final ExampleFloatingPresence presence2 = new ExampleFloatingPresence(new FloatingPresence((short) 64, new Vec3f(65, 0, 0), new Vec3f(66, 0, 0)));
|
||||
|
||||
@Test
|
||||
public void testMatchMakerManyBasePositionsLongRange() {
|
||||
System.out.println("Testing match maker many base positions long range");
|
||||
matchMaker.Add(presence, global);
|
||||
matchMaker.Add(presence2, global);
|
||||
var matches = matchMaker.Search(presence, global);
|
||||
assertEquals(1, matches.size());
|
||||
assertTrue(matches.contains(presence2));
|
||||
}
|
||||
}
|
||||
|
||||
@Nested
|
||||
class StressTestRanges {
|
||||
private final MatchMaker<FloatingPresence, ExampleFloatingPresence> matchMaker = new MatchMaker<>();
|
||||
private final Set<ExampleFloatingPresence> presenceSet = new HashSet<>();
|
||||
private final ExampleFloatingPresence originalPresence = new ExampleFloatingPresence(new FloatingPresence((short) 32, new Vec3f(0, 0, 0)));
|
||||
|
||||
public StressTestRanges() {
|
||||
for (int i = 0; i < 50; i++) {
|
||||
List<Vec3f> validPresences = ComputePossiblePresences((short) 32).stream().toList();
|
||||
var presence = new ExampleFloatingPresence(new FloatingPresence((short) 32, validPresences.get(rand.nextInt(validPresences.size() - 1))));
|
||||
presenceSet.add(presence);
|
||||
}
|
||||
}
|
||||
|
||||
@Test
|
||||
@Timeout(10)
|
||||
public void stressTestRange() {
|
||||
for (ExampleFloatingPresence presence : presenceSet) {
|
||||
matchMaker.Add(presence, global);
|
||||
}
|
||||
var matches = matchMaker.Search(originalPresence, global);
|
||||
assertEquals(presenceSet.size(), matches.size());
|
||||
assertFalse(matches.contains(originalPresence));
|
||||
}
|
||||
}
|
||||
|
||||
@Nested
|
||||
class StressTestBasePositions {
|
||||
private final MatchMaker<FloatingPresence, ExampleFloatingPresence> matchMaker = new MatchMaker<>();
|
||||
private final Set<ExampleFloatingPresence> presenceSet = new HashSet<>();
|
||||
private final ExampleFloatingPresence originalPresence = new ExampleFloatingPresence(new FloatingPresence((short) 1, GenerateVec3fsFromArea(new Vec3f(0, 0, 0), new Vec3f(0, 0, 50))));
|
||||
|
||||
public StressTestBasePositions() {
|
||||
for (int i = 0; i < 50; i++) {
|
||||
var presence = new ExampleFloatingPresence(new FloatingPresence((short) 1, new Vec3f(0, 1, i)));
|
||||
presenceSet.add(presence);
|
||||
}
|
||||
}
|
||||
|
||||
@Test
|
||||
@Timeout(10)
|
||||
public void stressTestBasePositions() {
|
||||
for (ExampleFloatingPresence presence : presenceSet) {
|
||||
matchMaker.Add(presence, global);
|
||||
}
|
||||
var matches = matchMaker.Search(originalPresence, global);
|
||||
assertEquals(presenceSet.size(), matches.size());
|
||||
assertFalse(matches.contains(originalPresence));
|
||||
}
|
||||
}
|
||||
|
||||
private Vec3f[] GenerateVec3fsFromArea(Vec3f corner1, Vec3f corner2) {
|
||||
var Vec3fs = new HashSet<Vec3f>();
|
||||
|
||||
float minX = Math.min(corner1.x(), corner2.x());
|
||||
float maxX = Math.max(corner1.x(), corner2.x());
|
||||
float minY = Math.min(corner1.y(), corner2.y());
|
||||
float maxY = Math.max(corner1.y(), corner2.y());
|
||||
float minZ = Math.min(corner1.z(), corner2.z());
|
||||
float maxZ = Math.max(corner1.z(), corner2.z());
|
||||
|
||||
for (float x = minX; x <= maxX; x += (float) 1) {
|
||||
for (float y = minY; y <= maxY; y += (float) 1) {
|
||||
for (float z = minZ; z <= maxZ; z += (float) 1) {
|
||||
Vec3fs.add(new Vec3f(x, y, z));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return Vec3fs.toArray(new Vec3f[0]);
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,187 @@
|
|||
import arzumify.presence.matchmaker.Channel;
|
||||
import arzumify.presence.matchmaker.MatchMaker;
|
||||
import arzumify.presence.maths.Vec3i;
|
||||
import arzumify.presence.presences.IntegerPresence;
|
||||
import org.junit.jupiter.api.Nested;
|
||||
import org.junit.jupiter.api.Test;
|
||||
import org.junit.jupiter.api.Timeout;
|
||||
|
||||
import java.util.HashSet;
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
import java.util.Set;
|
||||
|
||||
import static arzumify.presence.presences.IntegerPresence.ComputePossiblePresences;
|
||||
import static org.junit.jupiter.api.Assertions.*;
|
||||
|
||||
@Timeout(1)
|
||||
public class IntegerPresenceTests {
|
||||
private final Channel global = new Channel();
|
||||
private final Random rand = new Random();
|
||||
|
||||
@Test
|
||||
public void testOffsetCalculations() {
|
||||
System.out.println("Testing offset calculations");
|
||||
var set = ComputePossiblePresences((short) 1);
|
||||
System.out.println(set);
|
||||
assertTrue(set.containsAll(Set.of(
|
||||
new Vec3i(1, 0, 0),
|
||||
new Vec3i(0, 1, 0),
|
||||
new Vec3i(0, 0, 1),
|
||||
new Vec3i(-1, 0, 0),
|
||||
new Vec3i(0, -1, 0),
|
||||
new Vec3i(0, 0, -1)
|
||||
)));
|
||||
}
|
||||
|
||||
@Test
|
||||
public void testPresenceCalculations() {
|
||||
System.out.println("Testing presence calculations");
|
||||
var presence = new IntegerPresence((short) 1, new Vec3i(0, 0, 0));
|
||||
var presence2 = new IntegerPresence((short) 1, new Vec3i(1, 0, 0));
|
||||
assertTrue(presence.Matches(presence2));
|
||||
}
|
||||
|
||||
@Nested
|
||||
class TestMatchMaker {
|
||||
private final MatchMaker<IntegerPresence, ExampleIntegerPresence> matchMaker = new MatchMaker<>();
|
||||
private final ExampleIntegerPresence presence = new ExampleIntegerPresence(new IntegerPresence((short) 1, new Vec3i(0, 0, 0)));
|
||||
private final ExampleIntegerPresence presence2 = new ExampleIntegerPresence(new IntegerPresence((short) 1, new Vec3i(1, 0, 0)));
|
||||
|
||||
@Test
|
||||
public void testMatchMaker() {
|
||||
System.out.println("Testing match maker");
|
||||
matchMaker.Add(presence, global);
|
||||
matchMaker.Add(presence2, global);
|
||||
var matches = matchMaker.Search(presence, global);
|
||||
assertEquals(1, matches.size());
|
||||
System.out.println(matches);
|
||||
assertTrue(matches.contains(presence2));
|
||||
}
|
||||
}
|
||||
|
||||
@Nested
|
||||
class TestMatchMakerLongRange {
|
||||
private final MatchMaker<IntegerPresence, ExampleIntegerPresence> matchMaker = new MatchMaker<>();
|
||||
private final ExampleIntegerPresence presence = new ExampleIntegerPresence(new IntegerPresence((short) 64, new Vec3i(0, 0, 0)));
|
||||
private final List<Vec3i> validPresences = ComputePossiblePresences((short) 64).stream().toList();
|
||||
private final ExampleIntegerPresence presence2 = new ExampleIntegerPresence(new IntegerPresence((short) 64, validPresences.get(rand.nextInt(validPresences.size() - 1))));
|
||||
|
||||
@Test
|
||||
public void testMatchMakerLongRange() {
|
||||
System.out.println("Testing match maker long range");
|
||||
matchMaker.Add(presence, global);
|
||||
matchMaker.Add(presence2, global);
|
||||
var matches = matchMaker.Search(presence, global);
|
||||
assertEquals(1, matches.size());
|
||||
assertTrue(matches.contains(presence2));
|
||||
}
|
||||
}
|
||||
|
||||
@Nested
|
||||
class TestMatchMakerManyBasePositions {
|
||||
private final MatchMaker<IntegerPresence, ExampleIntegerPresence> matchMaker = new MatchMaker<>();
|
||||
private final ExampleIntegerPresence presence = new ExampleIntegerPresence(new IntegerPresence((short) 1, new Vec3i(0, 0, 0), new Vec3i(1, 0, 0)));
|
||||
private final ExampleIntegerPresence presence2 = new ExampleIntegerPresence(new IntegerPresence((short) 1, new Vec3i(2, 0, 0), new Vec3i(3, 0, 0)));
|
||||
|
||||
@Test
|
||||
public void testMatchMakerManyBasePositions() {
|
||||
System.out.println("Testing match maker many base positions");
|
||||
matchMaker.Add(presence, global);
|
||||
matchMaker.Add(presence2, global);
|
||||
var matches = matchMaker.Search(presence, global);
|
||||
assertEquals(1, matches.size());
|
||||
assertTrue(matches.contains(presence2));
|
||||
}
|
||||
}
|
||||
|
||||
@Nested
|
||||
class TestMatchMakerManyBasePositionsLongRange {
|
||||
private final MatchMaker<IntegerPresence, ExampleIntegerPresence> matchMaker = new MatchMaker<>();
|
||||
private final ExampleIntegerPresence presence = new ExampleIntegerPresence(new IntegerPresence((short) 64, new Vec3i(0, 0, 0), new Vec3i(1, 0, 0)));
|
||||
private final ExampleIntegerPresence presence2 = new ExampleIntegerPresence(new IntegerPresence((short) 64, new Vec3i(65, 0, 0), new Vec3i(66, 0, 0)));
|
||||
|
||||
@Test
|
||||
public void testMatchMakerManyBasePositionsLongRange() {
|
||||
System.out.println("Testing match maker many base positions long range");
|
||||
matchMaker.Add(presence, global);
|
||||
matchMaker.Add(presence2, global);
|
||||
var matches = matchMaker.Search(presence, global);
|
||||
assertEquals(1, matches.size());
|
||||
assertTrue(matches.contains(presence2));
|
||||
}
|
||||
}
|
||||
|
||||
@Nested
|
||||
class StressTestRanges {
|
||||
private final MatchMaker<IntegerPresence, ExampleIntegerPresence> matchMaker = new MatchMaker<>();
|
||||
private final Set<ExampleIntegerPresence> presenceSet = new HashSet<>();
|
||||
private final ExampleIntegerPresence originalPresence = new ExampleIntegerPresence(new IntegerPresence((short) 32, new Vec3i(0, 0, 0)));
|
||||
|
||||
public StressTestRanges() {
|
||||
for (int i = 0; i < 50; i++) {
|
||||
List<Vec3i> validPresences = ComputePossiblePresences((short) 32).stream().toList();
|
||||
var presence = new ExampleIntegerPresence(new IntegerPresence((short) 32, validPresences.get(rand.nextInt(validPresences.size() - 1))));
|
||||
presenceSet.add(presence);
|
||||
}
|
||||
}
|
||||
|
||||
@Test
|
||||
@Timeout(10)
|
||||
public void stressTestRange() {
|
||||
for (ExampleIntegerPresence presence : presenceSet) {
|
||||
matchMaker.Add(presence, global);
|
||||
}
|
||||
var matches = matchMaker.Search(originalPresence, global);
|
||||
assertEquals(presenceSet.size(), matches.size());
|
||||
assertFalse(matches.contains(originalPresence));
|
||||
}
|
||||
}
|
||||
|
||||
@Nested
|
||||
class StressTestBasePositions {
|
||||
private final MatchMaker<IntegerPresence, ExampleIntegerPresence> matchMaker = new MatchMaker<>();
|
||||
private final Set<ExampleIntegerPresence> presenceSet = new HashSet<>();
|
||||
private final ExampleIntegerPresence originalPresence = new ExampleIntegerPresence(new IntegerPresence((short) 1, GenerateVec3isFromArea(new Vec3i(0, 0, 0), new Vec3i(0, 0, 50))));
|
||||
|
||||
public StressTestBasePositions() {
|
||||
for (int i = 0; i < 50; i++) {
|
||||
var presence = new ExampleIntegerPresence(new IntegerPresence((short) 1, new Vec3i(0, 1, i)));
|
||||
presenceSet.add(presence);
|
||||
}
|
||||
}
|
||||
|
||||
@Test
|
||||
@Timeout(10)
|
||||
public void stressTestBasePositions() {
|
||||
for (ExampleIntegerPresence presence : presenceSet) {
|
||||
matchMaker.Add(presence, global);
|
||||
}
|
||||
var matches = matchMaker.Search(originalPresence, global);
|
||||
assertEquals(presenceSet.size(), matches.size());
|
||||
assertFalse(matches.contains(originalPresence));
|
||||
}
|
||||
}
|
||||
|
||||
private Vec3i[] GenerateVec3isFromArea(Vec3i corner1, Vec3i corner2) {
|
||||
var vec3is = new HashSet<Vec3i>();
|
||||
|
||||
int minX = Math.min(corner1.x(), corner2.x());
|
||||
int maxX = Math.max(corner1.x(), corner2.x());
|
||||
int minY = Math.min(corner1.y(), corner2.y());
|
||||
int maxY = Math.max(corner1.y(), corner2.y());
|
||||
int minZ = Math.min(corner1.z(), corner2.z());
|
||||
int maxZ = Math.max(corner1.z(), corner2.z());
|
||||
|
||||
for (int x = minX; x <= maxX; x++) {
|
||||
for (int y = minY; y <= maxY; y++) {
|
||||
for (int z = minZ; z <= maxZ; z++) {
|
||||
vec3is.add(new Vec3i(x, y, z));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return vec3is.toArray(new Vec3i[0]);
|
||||
}
|
||||
|
||||
}
|
||||
Loading…
Reference in New Issue