code stringlengths 114 1.05M | path stringlengths 3 312 | quality_prob float64 0.5 0.99 | learning_prob float64 0.2 1 | filename stringlengths 3 168 | kind stringclasses 1
value |
|---|---|---|---|---|---|
package com.zierfisch.gfx.mesh;
import org.joml.Vector2f;
import org.joml.Vector3f;
public interface MeshBuilder {
/**
*
* Returns an integer that stores the attribute mask of position in its most
* significant byte and the attribute index in the least significant three
* bytes. This makes it possible to p... | src/main/java/com/zierfisch/gfx/mesh/MeshBuilder.java | 0.888711 | 0.533276 | MeshBuilder.java | starcoder |
package com.stackmob.sdkapi;
/**
* A "within" query for searching within a rectangular area
*/
public class SMWithinBox extends SMCondition {
private final String field;
private final SMDouble latLL;
private final SMDouble lonLL;
private final SMDouble latUR;
private final SMDouble lonUR;
/**
* Creat... | src/main/java/com/stackmob/sdkapi/SMWithinBox.java | 0.948454 | 0.443841 | SMWithinBox.java | starcoder |
package ca.cgjennings.graphics.filters;
import ca.cgjennings.algo.SplitJoin;
import java.awt.Color;
/**
* Sets every pixel to a common RGB value without modifying the alpha channel.
* Where the alpha channel uses transparency to define a shape, the effect of
* this filter is to overlay the shape with a solid colou... | src/ca/cgjennings/graphics/filters/ColorOverlayFilter.java | 0.955371 | 0.552841 | ColorOverlayFilter.java | starcoder |
package tiralabra.path.datastructures;
import tiralabra.path.logic.Grid;
/**
* PriorityQueue for Grids. Used by Dijkstra, A* and JPS
* @author Tatu
*/
public class PrioQueue {
// PrioQueue is a binary heap in the form of an array. If n is a grid's index, then its children are 2*n and 2*n+1
private Gri... | path/src/main/java/tiralabra/path/datastructures/PrioQueue.java | 0.884831 | 0.501282 | PrioQueue.java | starcoder |
package de.esoco.lib.expression.monad;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.List;
import java.util.Objects;
import java.util.concurrent.CompletableFuture;
import java.util.concurrent.CompletionStage;
import java.util.concurrent.ExecutionException;
impo... | src/main/java/de/esoco/lib/expression/monad/Promise.java | 0.8954 | 0.460835 | Promise.java | starcoder |
package edu.berkeley.nlp.classify;
import java.io.Serializable;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import edu.berkeley.nlp.math.DifferentiableFunction;
import edu.berkeley.nlp.math.DoubleArrays;
import edu.berkeley.nlp.math.LBFGSMinimizer;
import edu.berkeley.nlp.math.SloppyMa... | geolocator-3.0/src/edu/berkeley/nlp/classify/MaximumEntropyClassifier.java | 0.829388 | 0.442456 | MaximumEntropyClassifier.java | starcoder |
package settings;
import org.joml.Vector4f;
import java.util.function.Consumer;
/**
* This class represent a Setting of the Simulation
* @param <T> the type of the Setting's value
*/
public class Setting<T> {
private final SettingIdentifiers identifier;
private T value;
private final Consumer<Setting<... | src/settings/Setting.java | 0.909586 | 0.418162 | Setting.java | starcoder |
package sim;
import static org.junit.Assert.*;
import static org.mockito.Matchers.*;
import static org.mockito.Mockito.*;
import org.junit.Test;
import sim.collectors.MiscStatisticsCollector;
import sim.configuration.ProductionSimbaConfiguration;
import sim.event_handling.EventQueue;
import sim.events.Finish;
import... | java/junit/sim/LooperTest.java | 0.741112 | 0.421373 | LooperTest.java | starcoder |
package ewbik.processing.singlePrecision;
import ewbik.asj.LoadManager;
import ewbik.asj.SaveManager;
import ewbik.asj.Saveable;
import ewbik.math.*;
import processing.Node3D;
import processing.core.PVector;
public class LimitCone implements Saveable {
public ewbik.processing.singlePrecision.Kusudama parentKusud... | ewbik/processing/LimitCone.java | 0.881258 | 0.45641 | LimitCone.java | starcoder |
package com.company;
// 100/100 Judge
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.List;
import java.util.stream.Collectors;
public class Icarus {
public static void main(String[] args) throws IOException {
BufferedRe... | Programming Fundamentals/Progr. Fund. Extended Retake Exam - 04 Sept 2017/src/com/company/Icarus.java | 0.543833 | 0.436202 | Icarus.java | starcoder |
package io.github.astrapi69.check;
import java.io.Serializable;
import java.util.Collection;
import java.util.Map;
/**
* The class {@link Check} can validate arguments in a chainable manner like a builder.
*/
public final class Check implements Serializable
{
/** The Constant instance. */
private static final Ch... | src/main/java/io/github/astrapi69/check/Check.java | 0.948082 | 0.551151 | Check.java | starcoder |
package trufflesom.intepreter.objectstorage;
import java.util.Arrays;
import org.junit.Ignore;
import trufflesom.interpreter.objectstorage.StorageAnalyzer;
import trufflesom.interpreter.objectstorage.StorageLocation;
import trufflesom.vm.Universe;
import trufflesom.vm.constants.Nil;
import trufflesom.vmobjects.SObje... | tests/trufflesom/intepreter/objectstorage/BasicStorageTester.java | 0.636014 | 0.400896 | BasicStorageTester.java | starcoder |
package org.spongepowered.common.util.gen;
import com.flowpowered.math.vector.Vector3i;
import net.minecraft.world.biome.Biome;
import org.spongepowered.api.util.DiscreteTransform3;
import org.spongepowered.api.world.biome.BiomeType;
import org.spongepowered.api.world.biome.VirtualBiomeType;
import org.spongepowered.a... | src/main/java/org/spongepowered/common/util/gen/ObjectArrayImmutableBiomeBuffer.java | 0.907032 | 0.549701 | ObjectArrayImmutableBiomeBuffer.java | starcoder |
package geometry;
/**
* @author <NAME>
* @version 04.02.2012
*/
public final class Vector2f implements Vectorf
{
public float x, y;
/**
* erzeugt einen neuen Vektor
*/
public Vector2f(){}
/**
* Creates a new vector
* @param x x-Component
* @param y y-Component
*/
... | src/geometry/Vector2f.java | 0.821403 | 0.588446 | Vector2f.java | starcoder |
package org.dimdev.dimdoors.client;
import net.minecraft.client.Minecraft;
import net.minecraft.client.renderer.GlStateManager;
import org.dimdev.ddutils.lsystem.LSystem;
import org.dimdev.dimdoors.shared.ModConfig;
import org.lwjgl.opengl.GL11;
import java.awt.*;
import static org.lwjgl.opengl.GL11.*;
public final... | src/main/java/org/dimdev/dimdoors/client/RiftCrackRenderer.java | 0.801858 | 0.423696 | RiftCrackRenderer.java | starcoder |
package seasons;
import agents.ListAnimals;
import environmentGestion.ForestGestion;
import environmentGestion.SeaGestion;
public abstract class Season implements SeasonBases
{
protected double seaExtensionRate, seaEvaporationRate;
protected double fireRate, birthRate;
protected int numberReproduce;
/**
*
... | LI260 - Projet/src/seasons/Season.java | 0.852214 | 0.42316 | Season.java | starcoder |
import java.util.*;
import static org.junit.Assert.*;
import org.junit.Test;
/**
* @author <NAME>
*/
public class MaxPriorityQueueTest {
static class Pair implements Comparable<Pair> {
final double x;
final double y;
Pair(double x, double y) {
this.x = x;
this.y = y;
}
public int compareTo(Pair ... | ch06-heapsort/MaxPriorityQueueTest.java | 0.692538 | 0.550064 | MaxPriorityQueueTest.java | starcoder |
package edu.ithaca.comp345.Rockstar;
public class Ingredient {
private String name;
private double cost;
private int quantity;
public Ingredient(String nameIn, double costIn, int quantityIn){
this.name = nameIn;
this.cost = costIn;
this.quantity = quantityIn;
}
/**
... | src/main/java/edu/ithaca/comp345/Rockstar/Ingredient.java | 0.792865 | 0.457621 | Ingredient.java | starcoder |
package com.dlsc.gemsfx.incubator.templatepane;
public class Visibility implements VisibilityPolicy {
private double minRequiredHeight;
private double minRequiredWidth;
private double maxSupportedHeight = Double.MAX_VALUE;
private double maxSupportedWidth = Double.MAX_VALUE;
public Visibility(double minRequire... | gemsfx/src/main/java/com/dlsc/gemsfx/incubator/templatepane/Visibility.java | 0.869216 | 0.528777 | Visibility.java | starcoder |
package com.epam.jdi.light.asserts.core;
import com.epam.jdi.light.asserts.generic.ITextAssert;
import com.epam.jdi.light.asserts.generic.SelectedAssert;
import com.epam.jdi.light.asserts.generic.UIAssert;
import com.epam.jdi.light.common.JDIAction;
import com.epam.jdi.light.elements.common.UIElement;
import org.hamcr... | jdi-light/src/main/java/com/epam/jdi/light/asserts/core/IsAssert.java | 0.806624 | 0.434881 | IsAssert.java | starcoder |
package com.univocity.parsers.conversions;
/**
* Default implementation for conversions from input Objects of type <b>I</b> to output Objects of type <b>O</b>
*
* <p>Extending classes must implement a proper String to <b>T</b> conversion in {@link ObjectConversion#fromString(String)}
* <p>This abstract class provi... | src/main/java/com/univocity/parsers/conversions/NullConversion.java | 0.9339 | 0.582432 | NullConversion.java | starcoder |
package io.datakernel.common;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
import java.util.function.Function;
import java.util.function.Predicate;
import java.util.function.Supplier;
public final class Preconditions {
@NotNull
public static <T> T checkNotNull(@Nullable T r... | common/src/main/java/io/datakernel/common/Preconditions.java | 0.849987 | 0.459379 | Preconditions.java | starcoder |
package xyz.anarres.algos;
import java.util.ArrayList;
import java.util.List;
/**
* Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.
*
Input:
3
/ \
9 20
/ \
15 7
Output: [3, 14.5, 11]
*
*/
class TreeNode {
int val;
TreeNode left;
... | src/xyz/anarres/algos/AveragesBinaryTree.java | 0.723602 | 0.53965 | AveragesBinaryTree.java | starcoder |
package de.neo.jagil.util;
import java.lang.reflect.Field;
import java.util.ArrayList;
import java.util.UUID;
import org.bukkit.Material;
import org.bukkit.OfflinePlayer;
import org.bukkit.enchantments.Enchantment;
import org.bukkit.inventory.ItemStack;
import org.bukkit.inventory.meta.ItemMeta;
import org.bukkit.inv... | src/de/neo/jagil/util/ItemTool.java | 0.873215 | 0.457803 | ItemTool.java | starcoder |
package edu.pdx.cs410J.deep;
import edu.pdx.cs410J.InvokeMainTestCase;
import org.junit.Test;
import static org.hamcrest.CoreMatchers.containsString;
import static org.hamcrest.CoreMatchers.equalTo;
import static org.hamcrest.MatcherAssert.assertThat;
/**
* Tests the functionality in the {@link Project1} main class... | phonebill/src/it/java/edu/pdx/cs410J/deep/Project3IT.java | 0.578686 | 0.440048 | Project3IT.java | starcoder |
package Tests.Inventory;
import Bussiness_Layer.Location.StorageLocation;
import Bussiness_Layer.Location.StoreLocation;
import org.junit.jupiter.api.Test;
import org.junit.jupiter.api.BeforeEach;
import java.util.HashMap;
import java.util.Map;
import static org.junit.jupiter.api.Assertions.*;
class LocationTest {
... | dev/src/Tests/Inventory/LocationTest.java | 0.66072 | 0.469459 | LocationTest.java | starcoder |
package com.google.cloud.dataflow.sdk.transforms.windowing;
import com.google.cloud.dataflow.sdk.coders.Coder;
import org.joda.time.Instant;
import java.io.Serializable;
import java.util.Collection;
/**
* The argument to the {@link Window} transform used to assign elements into
* windows and to determine how wind... | Benchmarks_with_Functional_Bugs/Java/DataflowJavaSDK-c06125d/src/sdk/src/main/java/com/google/cloud/dataflow/sdk/transforms/windowing/WindowFn.java | 0.850282 | 0.402744 | WindowFn.java | starcoder |
package com.xceptance.neodymium.visual.ai.image;
import java.io.Serializable;
import java.util.ArrayList;
import com.xceptance.neodymium.visual.ai.core.FeaturePoint;
import com.xceptance.neodymium.visual.ai.core.FloatPoint;
/***
* Representation of the merged metrics of different Images, which where analyzed and c... | src/main/java/com/xceptance/neodymium/visual/ai/image/AverageMetric.java | 0.975739 | 0.54577 | AverageMetric.java | starcoder |
package net.ssehub.kernel_haven.incremental.diff.parser;
import java.io.File;
import java.io.IOException;
import java.nio.file.Paths;
import java.util.List;
import org.hamcrest.CoreMatchers;
import org.junit.Assert;
import org.junit.Test;
import net.ssehub.kernel_haven.incremental.diff.parser.FileEntry.Lines;
import... | test/net/ssehub/kernel_haven/incremental/diff/parser/DiffFileParserTest.java | 0.701611 | 0.491883 | DiffFileParserTest.java | starcoder |
package fwcd.fructose.math;
import fwcd.fructose.math.algebra.DivisionRingElement;
import fwcd.fructose.operations.ToleranceEquatable;
/**
* A hypercomplex number (represented using four doubles).
*/
public class Quaternion implements DivisionRingElement<Quaternion>, ToleranceEquatable<Quaternion> {
public static ... | src/main/java/fwcd/fructose/math/Quaternion.java | 0.921521 | 0.401923 | Quaternion.java | starcoder |
package datastructures.graph;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
/**
* Given a un directed graph we have to find if a cycle exists in the graph.
* <p>
* Algorithm:
* We can use disjoint sets for detec... | src/main/java/datastructures/graph/DetectCycleDisjointSet.java | 0.911974 | 0.609873 | DetectCycleDisjointSet.java | starcoder |
package com.softwareverde.bitcoin.block.validator.difficulty;
import com.softwareverde.bitcoin.block.header.difficulty.Difficulty;
import com.softwareverde.logging.Logger;
import java.math.BigInteger;
/**
* BCH Difficulty Calculation via aserti3-2d algorithm.
* The aserti3-2d difficulty adjustment algorithm (ASERT... | src/main/java/com/softwareverde/bitcoin/block/validator/difficulty/AsertDifficultyCalculator.java | 0.858422 | 0.426083 | AsertDifficultyCalculator.java | starcoder |
package KnowledgeableReview201901.java.alitest;
/**
* Created with IntelliJ IDEA.
* Author: zky
* Date: 2019-02-03
* Time: 17:16:28
* Description:
*/
//RegressionLine类，用于处理一元线性回归问题
import java.math.BigDecimal;
import java.util.ArrayList;
public class RegressionLine
{
private double sumX = 0;//训练集x的和
pr... | src/main/java/KnowledgeableReview201901/java/alitest/RegressionLine.java | 0.705684 | 0.456773 | RegressionLine.java | starcoder |
package org.apache.crunch.kafka.record;
import org.apache.hadoop.io.Writable;
import org.apache.hadoop.mapreduce.InputSplit;
import org.apache.kafka.common.TopicPartition;
import java.io.DataInput;
import java.io.DataOutput;
import java.io.IOException;
/**
* InputSplit that represent retrieving data from a single {... | crunch-kafka/src/main/java/org/apache/crunch/kafka/record/KafkaInputSplit.java | 0.901531 | 0.427815 | KafkaInputSplit.java | starcoder |
package com.compomics.util.math.statistics.linear_regression.regressions;
import com.compomics.util.math.BasicMathFunctions;
import com.compomics.util.math.statistics.linear_regression.RegressionStatistics;
import java.util.ArrayList;
/**
* Performs a robust linear regression.
*
* @author <NAME>
*/
public class M... | src/main/java/com/compomics/util/math/statistics/linear_regression/regressions/MedianRegression.java | 0.932905 | 0.779867 | MedianRegression.java | starcoder |
package com.mygames.flappybird.config;
import com.badlogic.gdx.Gdx;
import com.badlogic.gdx.audio.Music;
import com.badlogic.gdx.audio.Sound;
import com.badlogic.gdx.graphics.Color;
import com.badlogic.gdx.graphics.Texture;
import com.badlogic.gdx.graphics.g2d.BitmapFont;
import com.badlogic.gdx.graphics.g2d.TextureRe... | core/src/com/mygames/flappybird/config/Assets.java | 0.566019 | 0.512022 | Assets.java | starcoder |
package dev.yavuztas.utils.collections;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Set;
import java.util.function.Predicate;
import java.util.stream.Collectors;
/**
* Utility class for collections
*
* @a... | src/main/java/dev/yavuztas/utils/collections/UtilsForCollections.java | 0.865423 | 0.649106 | UtilsForCollections.java | starcoder |
package com.taf.automation.asserts;
import com.taf.automation.ui.support.DateActions;
import com.taf.automation.ui.support.util.Utils;
import org.apache.commons.lang3.builder.ReflectionToStringBuilder;
import org.apache.commons.lang3.builder.ToStringBuilder;
import org.assertj.core.api.Condition;
import java.math.Big... | taf/src/main/java/com/taf/automation/asserts/AssertJCondition.java | 0.906463 | 0.454048 | AssertJCondition.java | starcoder |
package likedriving.design.Chess.Pieces;
import likedriving.design.Chess.Color;
import likedriving.design.Chess.Position;
import org.junit.Test;
import java.util.*;
public class PiecePosition {
private static Map<PieceKey, List<Position>> piecePosition = null;
static {
piecePosition = new LinkedHash... | src/main/java/likedriving/design/Chess/Pieces/PiecePosition.java | 0.815563 | 0.511168 | PiecePosition.java | starcoder |
package sim.app.geo.riftland;
import sim.app.geo.riftland.parcel.GrazableArea;
import java.util.Collection;
import java.util.LinkedList;
import sim.app.geo.riftland.parcel.WaterHole;
import sim.engine.SimState;
import sim.engine.Steppable;
import sim.util.Bag;
/** Updates all the GrazableAreas with each step
* @auth... | contrib/geomason/src/main/java/sim/app/geo/riftland/Gardener.java | 0.745398 | 0.46794 | Gardener.java | starcoder |
package bits.util.reflect;
public class Types {
private static final float COST_BOXING = 1000f;
private static final float COST_SUPERCLASS = 1f;
private static final float COST_INTERFACE = 0.25f;
public static Class<?> toNonPrimitive( Class<?> clazz ) {
if( !clazz.isPrimiti... | util-common/src/main/java/bits/util/reflect/Types.java | 0.764188 | 0.430626 | Types.java | starcoder |
package net.instant.api.parser;
import java.io.Closeable;
import java.util.Map;
import net.instant.api.NamedValue;
/**
* A dynamically reprogrammable externally driven tokenizer.
* (Assuming a default implementation,) a TokenSource maintains an input
* character stream, a current location inside that character str... | src/net/instant/api/parser/TokenSource.java | 0.81841 | 0.509398 | TokenSource.java | starcoder |
package flounder.helpers;
import java.util.*;
/**
* A helper for various generic sorting algorithms for java arrays. Value types passed must be {@code comparable}!
* <p>
* Watch some of these algorithms at work here: @see <a href="https://www.youtube.com/watch?v=ZZuD6iUe3Pc">'Visualization and Comparison of Sortin... | src/flounder/helpers/ArraySorting.java | 0.94121 | 0.487795 | ArraySorting.java | starcoder |
package org.apache.datasketches.memory;
import static org.apache.datasketches.memory.internal.XxHash64.hash;
import static org.apache.datasketches.memory.internal.XxHash64.hashBooleans;
import static org.apache.datasketches.memory.internal.XxHash64.hashBytes;
import static org.apache.datasketches.memory.internal.XxHas... | datasketches-memory-java8/src/main/java/org/apache/datasketches/memory/XxHash.java | 0.913708 | 0.654336 | XxHash.java | starcoder |
package breakout;
import javafx.scene.input.KeyCode;
import javafx.scene.paint.Color;
import javafx.scene.shape.Rectangle;
/**
* This class outlines a Paddle to be controlled by the player. It takes in key inputs allowing
* it to move left and right, and it has the ability to shoot the ball. It extends the Collida... | src/breakout/Paddle.java | 0.904645 | 0.527256 | Paddle.java | starcoder |
package skywriting.examples.pi;
import java.io.ByteArrayInputStream;
import java.io.ByteArrayOutputStream;
import java.io.DataInputStream;
import java.io.DataOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import uk.co.mrry.mercator.task.Task;
public class PiMapper ... | examples/Pi/src/java/skywriting/examples/pi/PiMapper.java | 0.608361 | 0.434701 | PiMapper.java | starcoder |
import org.junit.FixMethodOrder;
import org.junit.Test;
import org.junit.runners.MethodSorters;
@FixMethodOrder(MethodSorters.NAME_ASCENDING)
public class RegressionTest23 {
public static boolean debug = false;
@Test
public void test11501() throws Throwable {
if (debug)
System.out.for... | druid/05168808c278c080c59c19e858d9471b316cd1f5/randoop_2/RegressionTest23.java | 0.729809 | 0.439086 | RegressionTest23.java | starcoder |
package org.mini2Dx.core.geom;
import com.badlogic.gdx.math.MathUtils;
import com.badlogic.gdx.math.Vector2;
/**
* Extends {@link Vector2} with some utility methods
*/
@SuppressWarnings({ "rawtypes", "unchecked" })
public class Point extends Vector2 {
private static final long serialVersionUID = 377367395348644583... | core/src/main/java/org/mini2Dx/core/geom/Point.java | 0.95594 | 0.714952 | Point.java | starcoder |
package sidh;
/**************************************************************************************************
*
* Implements classes for Montgomery curves and points on the curve over GF(p) and GF(p^2).
* There are three classes for points on the curve: over Fp in both projective and affine
* coordinates and o... | MontCurve.java | 0.598899 | 0.602646 | MontCurve.java | starcoder |
package br.com.musicas.opus12.todayyourlove;
import org.jfugue.Pattern;
public class Baixo extends Estrutura{
@Override
public void inicio() {
partitura.add(new Pattern("V0 X[Volume]=10000 I[ELECTRIC_BASS_PICK]"));
partitura.add(new Pattern("Rq Rq Rq Rq"), 1);
}
@Override
public void refrao() {
partitu... | album2/workspace/Fascinating/src/br/com/musicas/opus12/todayyourlove/Baixo.java | 0.61173 | 0.430686 | Baixo.java | starcoder |
package de.uniaugsburg.isse.util;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.SortedSet;
import de.uniaugsburg.isse.abstraction.types.Interval;
import de.uniaugsburg.isse.constraints.BoundsConst... | CSP Model Abstraction/src/de/uniaugsburg/isse/util/PowerPlantUtil.java | 0.745769 | 0.411495 | PowerPlantUtil.java | starcoder |
package seedu.address.logic.commands;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
/**
* Sort the statistic we collected.
*/
public class SortShowStatisticCommand {
... | src/main/java/seedu/address/logic/commands/SortShowStatisticCommand.java | 0.894384 | 0.400808 | SortShowStatisticCommand.java | starcoder |
package com.github.sawors.stones.siege;
import org.bukkit.Location;
import org.bukkit.Material;
import org.bukkit.Particle;
import org.bukkit.block.Block;
import org.bukkit.util.Vector;
import java.util.ArrayList;
public class StonesExplosions {
public static void doExplosion(Location loc, float power,... | src/main/java/com/github/sawors/stones/siege/StonesExplosions.java | 0.59972 | 0.42925 | StonesExplosions.java | starcoder |
package com.wildbeeslabs.jentle.collections.utils;
import lombok.experimental.UtilityClass;
import java.nio.ByteBuffer;
import java.nio.CharBuffer;
import java.nio.charset.*;
import java.util.Arrays;
@UtilityClass
public class BufferUtils {
/**
* Ensure the buffer's capacity is large enough to hold a given... | collections/src/main/java/com/wildbeeslabs/jentle/collections/utils/BufferUtils.java | 0.921442 | 0.46035 | BufferUtils.java | starcoder |
package com.tersesystems.echopraxia;
import com.jayway.jsonpath.Predicate;
import java.util.List;
import java.util.Map;
import java.util.Optional;
import org.jetbrains.annotations.NotNull;
/** Methods for finding values and fields using JSON path syntax. */
public interface FindPathMethods {
/**
* Finds a strin... | api/src/main/java/com/tersesystems/echopraxia/FindPathMethods.java | 0.89751 | 0.420362 | FindPathMethods.java | starcoder |
package io.craigmiller160.orgbuilder.api.v1.util;
/**
* Special class with methods to assist with
* operations involving Strings.
*
* Created by Craig on 1/8/2016.
*/
public class StringUtil {
/**
* Determine if the provided String to see if the last
* character is a space. Useful for concatenating... | src/main/java/io/craigmiller160/orgbuilder/api/v1/util/StringUtil.java | 0.806738 | 0.408395 | StringUtil.java | starcoder |
package sim.util;
import java.util.*;
import java.util.stream.*;
public class QuadTree {
int depth = 0;
QTNode root;
List<Integer> availIds;
Map<Integer, QTNode> allNodes;
// Shape of field and the maximum number of partitions it can hold
public QuadTree(final IntHyperRect shape, final int np) {
final int d... | contrib/distributed/src/main/java/sim/util/QuadTree.java | 0.635336 | 0.590602 | QuadTree.java | starcoder |
package com.lyw.zhbj;
public final class R {
public static final class attr {
/** <p>Must be a dimension value, which is a floating point number appended with a unit such as "<code>14.5sp</code>".
Available units are: px (pixels), dp (density-independent pixels), sp (scaled pixels based on preferred font s... | gen/com/lyw/zhbj/R.java | 0.72952 | 0.487246 | R.java | starcoder |
package com.xyonix.mayetrix.mayu.core;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import Jama.Matrix;
public class DistanceDeterminer {
public static float calcCosine(List<String> tFVector1, List<String> tFVector2) {
final Set<S... | src/main/java/com/xyonix/mayetrix/mayu/core/DistanceDeterminer.java | 0.749729 | 0.545165 | DistanceDeterminer.java | starcoder |
package org.noise_planet.qrtone;
/**
* Goertzel algorithm - Compute the RMS power of the selected frequencies for the provided audio signals.
* http://asp.eurasipjournals.com/content/pdf/1687-6180-2012-56.pdf
* ipfs://QmdAMfyq71Fm72Rt5u1qtWM7teReGAHmceAtDN5SG4Pt22
* Sysel and Rajmic:Goertzel algorithm generalized ... | jqrtone/src/main/java/org/noise_planet/qrtone/IterativeGeneralizedGoertzel.java | 0.905187 | 0.520435 | IterativeGeneralizedGoertzel.java | starcoder |
package io.nosqlbench.activitytype.cql.datamappers.functions.diagnostics;
import com.datastax.driver.core.DataType;
import com.datastax.driver.core.LocalDate;
import com.datastax.driver.core.TupleValue;
import com.datastax.driver.core.UDTValue;
import io.nosqlbench.virtdata.api.annotations.ThreadSafeMapper;
import ja... | driver-cql-shaded/src/main/java/io/nosqlbench/activitytype/cql/datamappers/functions/diagnostics/ToCqlType.java | 0.605566 | 0.431884 | ToCqlType.java | starcoder |
package com.bluegosling.concurrent.executors;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertNotNull;
import static org.junit.Assert.assertTrue;
import com.bluegosling.concurrent.executors.ActorThreadPool;
import org.junit.After;
import org.junit.Test;
import java.util.ArrayList;
... | test/com/bluegosling/concurrent/executors/ActorThreadPoolTest.java | 0.729134 | 0.426799 | ActorThreadPoolTest.java | starcoder |
package com.mohadian;
import java.util.Arrays;
import java.util.HashMap;
public class LettersAndNumbers {
private static int[] findLongestOptimal(int[] array) {
int[] diffs = findDiffs(array);
int[] result = findRange(diffs);
if (result != null && result.length == 2) {
retu... | Coding/src/main/java/com/mohadian/LettersAndNumbers.java | 0.830388 | 0.461017 | LettersAndNumbers.java | starcoder |
package Projet;
import java.time.LocalDateTime;
import java.util.Arrays;
/**
* Class that holds different functions that are too general too be implemented in a specific class
*/
public class Utilities {
/**
* Convert an object into a string of length by adding '0' at beginning
* @param n Object to co... | src/Projet/Utilities.java | 0.89369 | 0.452234 | Utilities.java | starcoder |
package org.artrev.workshop.fp.part1.exercise3;
import java.util.Arrays;
import java.util.List;
/*
-- Function Composition --
Please test your solutions against available unit tests!
*/
@SuppressWarnings("unused")
class Exercise3 {
/*
Part 1:
Create a function/method called composeIntFuns for co... | java/exercises/src/main/java/org/artrev/workshop/fp/part1/exercise3/Exercise3.java | 0.806281 | 0.612744 | Exercise3.java | starcoder |
import model.Area;
import model.Arena;
import model.Pose;
import model.Position;
import org.junit.Assert;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.Parameterized;
import java.util.Arrays;
import java.util.Collection;
import java.util.Random;
@RunWith(Parameterized.class)
public ... | test/PositionTest.java | 0.892029 | 0.517083 | PositionTest.java | starcoder |
package gov.sandia.cognition.learning.algorithm.nearest;
import gov.sandia.cognition.learning.data.InputOutputPair;
import gov.sandia.cognition.learning.function.distance.EuclideanDistanceMetric;
import gov.sandia.cognition.math.NumberAverager;
import gov.sandia.cognition.util.Pair;
import gov.sandia.cognition.math.ma... | Components/LearningCore/Test/gov/sandia/cognition/learning/algorithm/nearest/KNearestNeighborExhaustiveTest.java | 0.893901 | 0.644169 | KNearestNeighborExhaustiveTest.java | starcoder |
package be.bhasher.spider.utils.block;
import org.bukkit.Material;
import org.bukkit.block.Block;
import org.bukkit.block.data.type.Bed;
import org.bukkit.block.data.type.Chest;
import org.bukkit.block.data.type.Door;
import org.bukkit.block.data.type.EnderChest;
import org.bukkit.block.data.type.Fence;
import org.buk... | src/main/java/be/bhasher/spider/utils/block/BlockNature.java | 0.866782 | 0.433502 | BlockNature.java | starcoder |
package dsa2020_thuongtruong1009;
public class Vector2D {
/**
* @return the x
*/
public double getX() {
return x;
}
/**
* @param x the x to set
*/
public void setX(double x) {
this.x = x;
}
/**
* @return the y
*/
public double getY() {
... | scr/dsa2020_thuongtruong1009/Vector2D.java | 0.846578 | 0.594816 | Vector2D.java | starcoder |
package io.github.jmcleodfoss.pst;
/** The BTreeNode interface defines the functions required for intermediate and leaf B-tree nodes.
* @see BTree
* @see BTreeLeaf
*/
public interface BTreeNode
{
/** The actualSize function must returns the actual number of bytes read from the input stream to populate this node.
* T... | pst/src/main/java/io/github/jmcleodfoss/pst/BTreeNode.java | 0.773901 | 0.503479 | BTreeNode.java | starcoder |
package it.nextworks.sdk.evalex;
import com.udojava.evalex.Expression;
import java.math.BigDecimal;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
/**
* Created by <NAME> on 21/11/18.
*
* @author <NAME> <m.capitani... | src/sdk-info-model/src/main/java/it/nextworks/sdk/evalex/StringValuedExpression.java | 0.872102 | 0.408631 | StringValuedExpression.java | starcoder |
package ides.dsl.parser;
import org.antlr.v4.runtime.tree.ParseTreeVisitor;
/**
* This interface defines a complete generic visitor for a parse tree produced
* by {@link IdesParser}.
*
* @param <T> The return type of the visit operation. Use {@link Void} for
* operations with no return type.
*/
public inte... | dsl/src/main/java/ides/dsl/parser/IdesParserVisitor.java | 0.822581 | 0.420719 | IdesParserVisitor.java | starcoder |
package com.opengamma.util.timeseries.sqldate;
import java.sql.Date;
import java.util.List;
import java.util.TimeZone;
import com.opengamma.util.timeseries.DateTimeConverter;
import com.opengamma.util.timeseries.ObjectTimeSeries;
import com.opengamma.util.timeseries.fast.DateTimeNumericEncoding;
import com.opengamma.... | projects/OG-Util/src/main/java/com/opengamma/util/timeseries/sqldate/MapSQLDateObjectTimeSeries.java | 0.918836 | 0.787441 | MapSQLDateObjectTimeSeries.java | starcoder |
package arc.math.geom;
import arc.struct.*;
/**
* Encapsulates an axis aligned bounding box represented by a minimum and a maximum Vector. Additionally you can query for the
* bounding box's center, dimensions and corner points.
* @author <EMAIL>, Xoppa
*/
public class BoundingBox{
public final Vec3 min = new... | arc-core/src/arc/math/geom/BoundingBox.java | 0.970013 | 0.649898 | BoundingBox.java | starcoder |
package dataTools;
import RandomAccessFileV.*;
import java.util.*;
public class Descriptor
{
//data.
public LinkedList<String[]> data = new LinkedList<String[]>();
public LinkedList<Integer> type = new LinkedList<Integer>();
public LinkedList<Integer> rpos = new LinkedList<Integer>();
public LinkedList<In... | dataTools/Descriptor.java | 0.675015 | 0.48621 | Descriptor.java | starcoder |
package com.exonum.binding.common.proofs.list;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
/**
* A validator that checks list proofs internal structure.
*/
final class ListProofStructureValidator implements ListProofVisitor {
static final int MAX_NODE... | exonum-java-binding/common/src/main/java/com/exonum/binding/common/proofs/list/ListProofStructureValidator.java | 0.755907 | 0.457743 | ListProofStructureValidator.java | starcoder |
package org.tmatesoft.sqljet.core.internal;
import org.tmatesoft.sqljet.core.SqlJetException;
/**
* An instance of the following structure holds information about a single index
* record that has already been parsed out into individual values.
*
* A record is an object that contains one or more fields of data. R... | sqljet/src/main/java/org/tmatesoft/sqljet/core/internal/ISqlJetUnpackedRecord.java | 0.786541 | 0.478346 | ISqlJetUnpackedRecord.java | starcoder |
package seedu.address.model.category;
import static java.util.Objects.requireNonNull;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Set;
import javafx.collections.FXCollections;
import javafx.collections.ObservableList;
/**
* A list of categories that enforces uniqueness between its elemen... | src/main/java/seedu/address/model/category/UniqueCategoryList.java | 0.943569 | 0.401981 | UniqueCategoryList.java | starcoder |
package org.openjdk.jmc.joverflow.util;
/**
* A simple, low-memory-overhead hash map whose main usage is mapping object IDs to int numbers. The
* map does not support negative values, and returns -1 to signal that the value for the given key
* does not exist.
* <p>
* Object IDs passed to this map as keys are long... | application/org.openjdk.jmc.joverflow/src/main/java/org/openjdk/jmc/joverflow/util/IntToIntMap.java | 0.833528 | 0.416441 | IntToIntMap.java | starcoder |
package org.wso2.developerstudio.datamapper.diagram.custom.generator;
import java.util.ArrayList;
import java.util.List;
/**
* This class represent a for loop object with operations and nested for loops it contains
*
*/
public class ForLoopBean {
private String iterativeName;
private String variableName;
... | plugins/org.wso2.developerstudio.visualdatamapper.diagram/src/org/wso2/developerstudio/datamapper/diagram/custom/generator/ForLoopBean.java | 0.821438 | 0.536677 | ForLoopBean.java | starcoder |
package org.modeshape.common.collection;
import java.io.Serializable;
import java.util.Iterator;
import org.modeshape.common.collection.Problem.Status;
import org.modeshape.common.i18n.I18n;
import org.modeshape.common.logging.Logger;
/**
* An interface for a collection of {@link Problem} objects, with multiple over... | modeshape-common/src/main/java/org/modeshape/common/collection/Problems.java | 0.871475 | 0.443661 | Problems.java | starcoder |
package seedu.tr4cker.model.daily;
import static java.util.Objects.requireNonNull;
import static seedu.tr4cker.commons.util.CollectionUtil.requireAllNonNull;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import javafx.collections.FXCollections;
import ja... | src/main/java/seedu/tr4cker/model/daily/UniqueDailyList.java | 0.744749 | 0.45042 | UniqueDailyList.java | starcoder |
package edu.osumc.prism;
import java.io.Serializable;
import java.util.Locale;
import org.apache.commons.lang3.StringUtils;
import org.apache.commons.math3.random.RandomGenerator;
import org.apache.commons.math3.util.FastMath;
/**
* Single nucleotide polymorphism (SNP) characteristics.
* <p>
* This class stores S... | src/main/java/edu/osumc/prism/SNP.java | 0.946479 | 0.408336 | SNP.java | starcoder |
package au.org.ands.vocabs.registry.workflow.provider.transform.conceptTree;
import org.openrdf.model.Value;
/** Representation of an RDF list, with some inbuilt validity checks.
*/
public class RDFList {
/** Singleton instance used to represent {@code rdf:nil}. We need this
* so that we can distinguish t... | src/main/java/au/org/ands/vocabs/registry/workflow/provider/transform/conceptTree/RDFList.java | 0.929688 | 0.458531 | RDFList.java | starcoder |
package com.zynaptic.relay.cbor.core;
import java.io.DataInputStream;
import java.io.EOFException;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import com.zynaptic.relay.cbor.DataIte... | src/main/java/com/zynaptic/relay/cbor/core/CborItemDecoder.java | 0.891964 | 0.447823 | CborItemDecoder.java | starcoder |
package xal.extension.fit.lsm;
/**
* This class is for data fitting with two Gaussian functions with the same center.
* The function form used in this class is
* y = pedestal+amp*exp(-(x-center0)^2/(sigma^2/2.)) + amp*exp(-(x-center1)^2/(sigma^2/2.)).
* Users should keep in mind that guess does not work very... | extensions/fit/src/xal/extension/fit/lsm/DoubleSymmetricGaussian.java | 0.57332 | 0.578865 | DoubleSymmetricGaussian.java | starcoder |
// The monetary system in DarkLand is really simple and systematic. The locals only use coins. The coins come in different values. The values used are:
// 1, 5, 25, 125, 625, 3125, 15625, ...
// Formally, for each K >= 0 there are coins worth 5K.
// Given an integer A denoting the cost of an item, find and return t... | Greedy/AnotherCoinProblem.java | 0.770724 | 0.637581 | AnotherCoinProblem.java | starcoder |
import java.util.*;
/**
* Given a set of points in the xy-plane, determine the minimum area of any rectangle formed from these points, with sides not necessarily parallel to the x and y axes.
*
* If there isn't any rectangle, return 0.
*
*
*
* Example 1:
*
*
*
* Input: [[1,2],[2,1],[1,0],[0,1]]
* Output: 2... | coding-problems/leetcode/MinAreaFreeRect.java | 0.902474 | 0.688979 | MinAreaFreeRect.java | starcoder |
package src.model;
import java.util.List;
/**
* The {@code ComputerPlayer} class represents a computer player and updates
* the board based on a model.
*/
public class AlphaBetaPlayer extends MinMaxPlayer {
//public boolean player;
public AlphaBetaPlayer(boolean joueur) {
super(joueur);
}
... | src/model/AlphaBetaPlayer.java | 0.880585 | 0.451508 | AlphaBetaPlayer.java | starcoder |
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.List;
public class RootishArrayStack <E> {
protected List<E[]> blocks;
private int size = 0;
private final Class<E> type;
/**
* @param type - It turns out, dynamically creating generic arrays is very
* tricky, so ... | src/RootishArrayStack.java | 0.804636 | 0.400808 | RootishArrayStack.java | starcoder |
package edu.uiowa.cs.clc.kind2.lustre;
import java.util.ArrayList;
import java.util.List;
/**
* This class provides helper functions for constructing a contract node. A contract node is very
* similar to a traditional Lustre node. The two differences are that
* <ul>
* <li>it starts with {@code contract} instead o... | src/main/java/edu/uiowa/cs/clc/kind2/lustre/ContractBuilder.java | 0.891197 | 0.412471 | ContractBuilder.java | starcoder |
package us.ihmc.commonWalkingControlModules.visualizer;
import java.awt.Color;
import java.util.ArrayList;
import java.util.List;
import javax.vecmath.Matrix3d;
import javax.vecmath.Vector3d;
import us.ihmc.commonWalkingControlModules.controllers.Updatable;
import us.ihmc.graphicsDescription.Graphics3DObject;
import... | CommonWalkingControlModules/src/us/ihmc/commonWalkingControlModules/visualizer/CommonInertiaEllipsoidsVisualizer.java | 0.872687 | 0.500427 | CommonInertiaEllipsoidsVisualizer.java | starcoder |
package dev.marksman.kraftwerk.bias;
import dev.marksman.kraftwerk.SizeParameters;
import dev.marksman.kraftwerk.constraints.BigDecimalRange;
import dev.marksman.kraftwerk.constraints.BigIntegerRange;
import dev.marksman.kraftwerk.constraints.ByteRange;
import dev.marksman.kraftwerk.constraints.CharRange;
import dev.m... | src/main/java/dev/marksman/kraftwerk/bias/EmptyBiasSettings.java | 0.854004 | 0.511656 | EmptyBiasSettings.java | starcoder |
package deepboof.impl.backward.standard;
import deepboof.DFunction;
import deepboof.Tensor;
import deepboof.backward.DSpatialPadding2D;
import deepboof.forward.ConfigSpatial;
import deepboof.impl.forward.standard.SpatialWindowImage;
import deepboof.misc.TensorFactory;
import deepboof.misc.TensorOps;
import java.util.... | modules/learning/src/main/java/deepboof/impl/backward/standard/DSpatialWindowImage.java | 0.895566 | 0.401306 | DSpatialWindowImage.java | starcoder |
package net.yadaframework.components;
import java.util.HashMap;
import java.util.Map;
import java.util.concurrent.TimeUnit;
import com.google.common.base.Stopwatch;
/**
* A rate limiter by key. See YadaStatelessRateLimiter for a better description.
* <br />
* Note: ThreadSafe
* @see YadaSimpleRateLimiter
*/
// ... | YadaWeb/src/main/java/net/yadaframework/components/YadaKeyRateLimiter.java | 0.786131 | 0.436742 | YadaKeyRateLimiter.java | starcoder |
package org.pathwayeditor.figure.geometry;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
import org.junit.After;
import org.junit.Before;
import org.junit.Test;
/**
* @author <NAME>
*
*/
public class RectangleHullTest {
private... | test/org/pathwayeditor/figure/geometry/RectangleHullTest.java | 0.874144 | 0.558688 | RectangleHullTest.java | starcoder |
package com.opengamma.sesame.function.scenarios;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Set;
import org.joda.beans.Bean;
import org.joda.beans.Be... | sesame/sesame-engine/src/main/java/com/opengamma/sesame/function/scenarios/ScenarioDefinition.java | 0.908245 | 0.475484 | ScenarioDefinition.java | starcoder |
import java.io.*;
import java.util.*;
import java.util.concurrent.*;
public class knucleotide {
public static void main(final String[] args) throws Exception {
// read full fullSequence
final BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
scanPastHeader(in, ">THREE");
final ... | benchs/knucleotide/knucleotide.java-7.java | 0.797636 | 0.40751 | knucleotide.java-7.java | starcoder |
import edu.princeton.cs.algs4.Queue;
public class MergeSort {
/**
* Removes and returns the smallest item that is in q1 or q2.
*
* The method assumes that both q1 and q2 are in sorted order, with the smallest item first. At
* most one of q1 or q2 can be empty (but both cannot be empty).
*
... | lab12/MergeSort.java | 0.893033 | 0.591871 | MergeSort.java | starcoder |
package Tools;
import java.time.Instant;
import java.time.LocalDate;
import java.time.LocalDateTime;
import java.time.ZoneId;
import java.time.ZonedDateTime;
import java.time.format.DateTimeFormatter;
import java.util.Calendar;
import java.util.Date;
public class Tools {
//Affichage Date
public static String form... | app/Tools/Tools.java | 0.771499 | 0.440048 | Tools.java | starcoder |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.