dds.solvedPlays Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of dds4j Show documentation
Wrapper around the Double Dummy Solver C++ Library.
The newest version!
// Generated by jextract

package dds;

import java.lang.invoke.*;
import java.lang.foreign.*;
import java.nio.ByteOrder;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;

import static java.lang.foreign.ValueLayout.*;
import static java.lang.foreign.MemoryLayout.PathElement.*;

/**
 * {@snippet lang=c :
 * struct solvedPlays {
 *     int noOfBoards;
 *     struct solvedPlay solved[200];
 * }
 * }
 */
public class solvedPlays {

    solvedPlays() {
        // Should not be called directly
    }

    private static final GroupLayout $LAYOUT = MemoryLayout.structLayout(
        Dds.C_INT.withName("noOfBoards"),
        MemoryLayout.sequenceLayout(200, solvedPlay.layout()).withName("solved")
    ).withName("solvedPlays");

    /**
     * The layout of this struct
     */
    public static final GroupLayout layout() {
        return $LAYOUT;
    }

    private static final OfInt noOfBoards$LAYOUT = (OfInt)$LAYOUT.select(groupElement("noOfBoards"));

    /**
     * Layout for field:
     * {@snippet lang=c :
     * int noOfBoards
     * }
     */
    public static final OfInt noOfBoards$layout() {
        return noOfBoards$LAYOUT;
    }

    private static final long noOfBoards$OFFSET = 0;

    /**
     * Offset for field:
     * {@snippet lang=c :
     * int noOfBoards
     * }
     */
    public static final long noOfBoards$offset() {
        return noOfBoards$OFFSET;
    }

    /**
     * Getter for field:
     * {@snippet lang=c :
     * int noOfBoards
     * }
     */
    public static int noOfBoards(MemorySegment struct) {
        return struct.get(noOfBoards$LAYOUT, noOfBoards$OFFSET);
    }

    /**
     * Setter for field:
     * {@snippet lang=c :
     * int noOfBoards
     * }
     */
    public static void noOfBoards(MemorySegment struct, int fieldValue) {
        struct.set(noOfBoards$LAYOUT, noOfBoards$OFFSET, fieldValue);
    }

    private static final SequenceLayout solved$LAYOUT = (SequenceLayout)$LAYOUT.select(groupElement("solved"));

    /**
     * Layout for field:
     * {@snippet lang=c :
     * struct solvedPlay solved[200]
     * }
     */
    public static final SequenceLayout solved$layout() {
        return solved$LAYOUT;
    }

    private static final long solved$OFFSET = 4;

    /**
     * Offset for field:
     * {@snippet lang=c :
     * struct solvedPlay solved[200]
     * }
     */
    public static final long solved$offset() {
        return solved$OFFSET;
    }

    /**
     * Getter for field:
     * {@snippet lang=c :
     * struct solvedPlay solved[200]
     * }
     */
    public static MemorySegment solved(MemorySegment struct) {
        return struct.asSlice(solved$OFFSET, solved$LAYOUT.byteSize());
    }

    /**
     * Setter for field:
     * {@snippet lang=c :
     * struct solvedPlay solved[200]
     * }
     */
    public static void solved(MemorySegment struct, MemorySegment fieldValue) {
        MemorySegment.copy(fieldValue, 0L, struct, solved$OFFSET, solved$LAYOUT.byteSize());
    }

    private static long[] solved$DIMS = { 200 };

    /**
     * Dimensions for array field:
     * {@snippet lang=c :
     * struct solvedPlay solved[200]
     * }
     */
    public static long[] solved$dimensions() {
        return solved$DIMS;
    }
    private static final MethodHandle solved$ELEM_HANDLE = solved$LAYOUT.sliceHandle(sequenceElement());

    /**
     * Indexed getter for field:
     * {@snippet lang=c :
     * struct solvedPlay solved[200]
     * }
     */
    public static MemorySegment solved(MemorySegment struct, long index0) {
        try {
            return (MemorySegment)solved$ELEM_HANDLE.invokeExact(struct, 0L, index0);
        } catch (Throwable ex$) {
            throw new AssertionError("should not reach here", ex$);
        }
    }

    /**
     * Indexed setter for field:
     * {@snippet lang=c :
     * struct solvedPlay solved[200]
     * }
     */
    public static void solved(MemorySegment struct, long index0, MemorySegment fieldValue) {
        MemorySegment.copy(fieldValue, 0L, solved(struct, index0), 0L, solvedPlay.layout().byteSize());
    }

    /**
     * Obtains a slice of {@code arrayParam} which selects the array element at {@code index}.
     * The returned segment has address {@code arrayParam.address() + index * layout().byteSize()}
     */
    public static MemorySegment asSlice(MemorySegment array, long index) {
        return array.asSlice(layout().byteSize() * index);
    }

    /**
     * The size (in bytes) of this struct
     */
    public static long sizeof() { return layout().byteSize(); }

    /**
     * Allocate a segment of size {@code layout().byteSize()} using {@code allocator}
     */
    public static MemorySegment allocate(SegmentAllocator allocator) {
        return allocator.allocate(layout());
    }

    /**
     * Allocate an array of size {@code elementCount} using {@code allocator}.
     * The returned segment has size {@code elementCount * layout().byteSize()}.
     */
    public static MemorySegment allocateArray(long elementCount, SegmentAllocator allocator) {
        return allocator.allocate(MemoryLayout.sequenceLayout(elementCount, layout()));
    }

    /**
     * Reinterprets {@code addr} using target {@code arena} and {@code cleanupAction) (if any).
     * The returned segment has size {@code layout().byteSize()}
     */
    public static MemorySegment reinterpret(MemorySegment addr, Arena arena, Consumer cleanup) {
        return reinterpret(addr, 1, arena, cleanup);
    }

    /**
     * Reinterprets {@code addr} using target {@code arena} and {@code cleanupAction) (if any).
     * The returned segment has size {@code elementCount * layout().byteSize()}
     */
    public static MemorySegment reinterpret(MemorySegment addr, long elementCount, Arena arena, Consumer cleanup) {
        return addr.reinterpret(layout().byteSize() * elementCount, arena, cleanup);
    }
}