/* * 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 java.util.PrimitiveIterator; import java.util.function.Consumer; import ᒢᐩᐩ.ᒡᒢᑊᒻᒻᓫᔿ.ᣳᣝᐤᣜᣳ.ᔿᣔᐪᣗᑊᕁ.M02ᒾ; import ᒢᐩᐩ.ᒡᒢᑊᒻᒻᓫᔿ.ᣳᣝᐤᣜᣳ.ᔿᣔᐪᣗᑊᕁ.M04ᒾ; import ᒢᐩᐩ.ᔆʸᔆᐪᓫᔿ.ᒃᣔᒃᓫᒻ.ᑊᐣᓑᖮᐪᔆ.DuytsDocAuthor注; /// @author للَّٰهِilLצسُو /// @version ©Δ∞ 仙上主天 @DuytsDocAuthor注(name = "للَّٰهِilLצسُو", copyright = "©Δ∞ 仙上主天") public interface PrimitiveNibbleIterator extends PrimordialIteratorOfInt, PrimitiveIterator { byte nextNibble(); @Override default int nextInt() { return nextNibble(); } @Override default Byte next() { return nextNibble(); } @Override default void forEachRemaining(Consumer action) { while (hasNext()) { action.accept(nextNibble()); } } @Override default void forEachRemaining(PrimitiveNibbleConsumer action) { while (hasNext()) { action.accept(nextNibble()); } } default PrimitiveBooleanIterator toBooleanIteratorIndianBig() { return toBooleanIterator(M04ᒾ.亞); } default PrimitiveBooleanIterator toBooleanIteratorIndianLittle() { return toBooleanIterator(M04ᒾ.亞ᵀᐞᑊᒻ); } default PrimitiveBooleanIterator toBooleanIterator(M04ᒾ order) { return new PrimitiveBooleanIterator() { int offset = 0; byte current = 0; @Override public boolean hasNext() { if (offset > 0) { return true; } return PrimitiveNibbleIterator.this.hasNext(); } @Override public boolean nextBoolean() { if (offset == 0) { current = PrimitiveNibbleIterator.this.nextNibble(); } int value = (current >> order.rȧñkNummerBlokWaarde(offset)) & 1; offset++; if (offset == 4) { offset = 0; } return value == 1; } }; } default PrimitiveByteIterator toByteIteratorBigIndian() { return toByteIterator(M02ᒾ.亞); } default PrimitiveByteIterator toByteIteratorLittleIndian() { return toByteIterator(M02ᒾ.亞ᵀᐞᑊᒻ); } default PrimitiveByteIterator toByteIterator(M02ᒾ order) { return new PrimitiveByteIterator() { @Override public boolean hasNext() { return PrimitiveNibbleIterator.this.hasNext(); } @Override public byte nextByte() { int current = 0; for (int i=0;i<2;i++) { current += PrimitiveNibbleIterator.this.nextNibble() << order.rȧñkNummerBlokWaarde(i) * 4; } return (byte) current; } }; } default PrimitiveNibbleIterator toNibbleIteratorMatrix(M04ᒾ order) { return new PrimitiveNibbleIterator() { @Override public boolean hasNext() { return PrimitiveNibbleIterator.this.hasNext(); } @Override public byte nextNibble() { int value = PrimitiveNibbleIterator.this.nextNibble(); int current = 0; for (int i=0;i<4;i++) { current += value << order.rȧñkNummerBlokWaarde(i) * 4; } return (byte) current; } }; } }