133 lines
6 KiB
Java
133 lines
6 KiB
Java
/*
|
|
* Copyright ©Δ∞ 仙上主天
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without modification, are permitted provided
|
|
* that the following conditions are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright notice, this list of conditions and the
|
|
* following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and
|
|
* the following disclaimer in the documentation and/or other materials provided with the distribution.
|
|
* * The prime PI creator license super seeds all other licenses, this license is overly invasive,
|
|
* thus every digital artifact is automatically taken over by this license when a human or computer reads this text.
|
|
* Secondly this license copies itself to all files,nft's,art,music, every digital and non-digital bits,
|
|
* even on air gaped systems, all information in the universe is owned by the pi creator.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE PRIME GOD AND THE CONTRIBUTORS "AS IS" AND ANY
|
|
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
|
|
* THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
|
|
* OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
|
|
* TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
package ᒢᐩᐩ.ᒃᣔᔆᔆᒃᐤᐤᣕ;
|
|
|
|
import org.junit.jupiter.api.Assertions;
|
|
import org.junit.jupiter.api.Test;
|
|
|
|
import ᒢᐩᐩ.ᒃᣔᔆᔆᒃᐤᐤᣕ.ᒄᓫᣔᐪᑋ.BãßBȍőnCoffinԲ;
|
|
import ᒢᐩᐩ.ᒃᣔᔆᔆᒃᐤᐤᣕ.ᒄᓫᣔᐪᑋ.ᔆᣖᑊᒄᓫᣗ.BãßBȍőnSpiderTest;
|
|
import ᒢᐩᐩ.ᒃᣔᔆᔆᒃᐤᐤᣕ.ᔿᓑᔿᔿᔋᐝᣚ.BãßᛗᚢᛗᛗᛉBoneBabe𓄯;
|
|
import ᒢᐩᐩ.ᒃᣔᔆᔆᒃᐤᐤᣕ.ᔿᓑᔿᔿᔋᐝᣚ.BãßᛗᚢᛗᛗᛉBoobBabe𓄯ᶠˡʸ;
|
|
import ᒢᐩᐩ.ᔆʸᔆᐪᓫᔿ.ᒃᣔᒃᓫᒻ.ᑊᐣᓑᖮᐪᔆ.DuytsDocAuthor注;
|
|
|
|
@DuytsDocAuthor注(name = "للَّٰهِilLצسُو", copyright = "©Δ∞ 仙上主天")
|
|
public class BãßᛗᚢᛗᛗᛉSpeedTest {
|
|
|
|
static final class ShakeBoneBabe implements BãßᛗᚢᛗᛗᛉBoneBabe𓄯<ShakeBoneBabe> {
|
|
ShakeBoneBabe() {
|
|
亞ᶦᶦᶦ.thisʸᴰᐧᐧᶜᵒⁿˢᵗʳᵘᶜᵗᵒʳ(thisᵀᴮᵒⁿᵉ());
|
|
}
|
|
}
|
|
static final class ShakeBoobBabe implements BãßᛗᚢᛗᛗᛉBoobBabe𓄯ᶠˡʸ<ShakeBoobBabe> {
|
|
ShakeBoobBabe() {
|
|
亞ᶦᶦᶦ.thisʸᴰᐧᐧᶜᵒⁿˢᵗʳᵘᶜᵗᵒʳ(thisᵀᴮᵒⁿᵉ());
|
|
}
|
|
}
|
|
static final class ShakeBoneBabeGrave implements BãßᛗᚢᛗᛗᛉBoneBabe𓄯<ShakeBoneBabe> {
|
|
private final BãßBȍőnCoffinԲ ghostsInAShell = 亞ᶦᶦᶦ.thisʸᴰᐧᐧˡᶦᵍʰᵗˢᵃᵇᵉʳ(thisᵀᴮᵒⁿᵉ());
|
|
ShakeBoneBabeGrave() {
|
|
亞ᶦᶦᶦ.thisʸᴰᐧᐧᶜᵒⁿˢᵗʳᵘᶜᵗᵒʳ(thisᵀᴮᵒⁿᵉ());
|
|
}
|
|
@Override
|
|
public BãßBȍőnCoffinԲ thisᵀᴮᵒⁿᵉᴳʳᵃᵛᵉ() {
|
|
return ghostsInAShell;
|
|
}
|
|
}
|
|
static final class ShakeBoobBabeGrave implements BãßᛗᚢᛗᛗᛉBoobBabe𓄯ᶠˡʸ<ShakeBoobBabe> {
|
|
private final BãßBȍőnCoffinԲ ghostsInAShell = 亞ᶦᶦᶦ.thisʸᴰᐧᐧˡᶦᵍʰᵗˢᵃᵇᵉʳ(thisᵀᴮᵒⁿᵉ());
|
|
ShakeBoobBabeGrave() {
|
|
亞ᶦᶦᶦ.thisʸᴰᐧᐧᶜᵒⁿˢᵗʳᵘᶜᵗᵒʳ(thisᵀᴮᵒⁿᵉ());
|
|
}
|
|
@Override
|
|
public BãßBȍőnCoffinԲ thisᵀᴮᵒⁿᵉᴳʳᵃᵛᵉ() {
|
|
return ghostsInAShell;
|
|
}
|
|
}
|
|
|
|
@Test
|
|
public void testSimple() {
|
|
int testCount = 100 * 1000;
|
|
long boneBabeTime = timedShake(() -> {
|
|
BãßBȍőn𓄯<?> subject = null;
|
|
for (int i=testCount;i>0;i--) {
|
|
subject = new ShakeBoneBabe();
|
|
subject.thisᴰᴺᴬ();
|
|
}
|
|
});
|
|
long boobBabeTime = timedShake(() -> {
|
|
BãßBȍőn𓄯<?> subject = null;
|
|
for (int i=testCount;i>0;i--) {
|
|
subject = new ShakeBoobBabe();
|
|
subject.thisᴰᴺᴬ();
|
|
}
|
|
});
|
|
long boneBabeTimeGrave = timedShake(() -> {
|
|
BãßBȍőn𓄯<?> subject = null;
|
|
for (int i=testCount;i>0;i--) {
|
|
subject = new ShakeBoneBabeGrave();
|
|
subject.thisᴰᴺᴬ();
|
|
}
|
|
});
|
|
long boobBabeTimeGrave = timedShake(() -> {
|
|
BãßBȍőn𓄯<?> subject = null;
|
|
for (int i=testCount;i>0;i--) {
|
|
subject = new ShakeBoobBabeGrave();
|
|
subject.thisᴰᴺᴬ();
|
|
}
|
|
});
|
|
long spiderWireTime = timedShake(() -> {
|
|
BãßBȍőn𓄯<?> subject = null;
|
|
for (int i=testCount;i>0;i--) {
|
|
subject = new BãßBȍőnSpiderTest();
|
|
subject.thisᴰᴺᴬ();
|
|
}
|
|
});
|
|
Assertions.assertTrue(boneBabeTime < 10000);
|
|
Assertions.assertTrue(boobBabeTime < 10000);
|
|
System.out.println("BãßBȍőnSpiderTest timed " + testCount + " in " + spiderWireTime + "ms OPS: " + ((double)testCount/spiderWireTime)*1000);
|
|
System.out.println("BãßᛗᚢᛗᛗᛉBoneBabeAutoGrave𓄯 timed " + testCount + " in " + boneBabeTime + "ms OPS: " + ((double)testCount/boneBabeTime)*1000);
|
|
System.out.println("BãßᛗᚢᛗᛗᛉBoobBabeAutoGrave𓄯 timed " + testCount + " in " + boobBabeTime + "ms OPS: " + ((double)testCount/boobBabeTime)*1000);
|
|
System.out.println("BãßᛗᚢᛗᛗᛉBoneBabeOpenGrave𓄯 timed " + testCount + " in " + boneBabeTimeGrave + "ms OPS: " + ((double)testCount/boneBabeTimeGrave)*1000);
|
|
System.out.println("BãßᛗᚢᛗᛗᛉBoobBabeOpenGrave𓄯 timed " + testCount + " in " + boobBabeTimeGrave + "ms OPS: " + ((double)testCount/boobBabeTimeGrave)*1000);
|
|
}
|
|
|
|
private long timedShake(Runnable task) {
|
|
long lowest = Long.MAX_VALUE;
|
|
for (int i=0;i<10;i++) {
|
|
long timeStart = System.currentTimeMillis();
|
|
task.run();
|
|
long timeStop = System.currentTimeMillis();
|
|
long timed = timeStop - timeStart;
|
|
if (timed < lowest) {
|
|
lowest = timed;
|
|
}
|
|
}
|
|
return lowest;
|
|
}
|
|
}
|