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 bid.mythesis.factorization;
import java.math.BigInteger;
import java.security.SecureRandom;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Random;
import java.util.Set;
/**
* Implements the Pollard's Rho metho... | src/bid/mythesis/factorization/PollardRho.java | 0.909273 | 0.422266 | PollardRho.java | starcoder |
package camzup.core;
/**
* Organizes the quaternions that shape a Bezier curve on the surface of a
* sphere into a sphere coordinate (or anchor point), fore handle (the
* following control point) and rear handle (the preceding control point).
*/
@Experimental
public class KnotAnim implements Comparable < KnotAnim ... | src/camzup/core/KnotAnim.java | 0.968306 | 0.69955 | KnotAnim.java | starcoder |
package com.google.devtools.common.options;
import java.util.Objects;
/**
* The position of an option in the interpretation order. Options are interpreted using a
* last-option-wins system for single valued options, and are listed in that order for
* multiple-valued options.
*
* <p>The position of the option is ... | src/main/java/com/google/devtools/common/options/OptionPriority.java | 0.914487 | 0.406509 | OptionPriority.java | starcoder |
package ShortestWordDistanceIII_245;
/**
* This is a follow up of Shortest Word Distance.
* The only difference is now word1 could be the same as word2.
*
* Given a list of words and two words word1 and word2,
* return the shortest distance between these two words in the list.
*
* word1 and word2 may be the sam... | leetcode/src/ShortestWordDistanceIII_245/Solution.java | 0.733929 | 0.477189 | Solution.java | starcoder |
package uk.co.stikman.utils.math;
import uk.co.stikman.utils.GwtIncompatible;
public class Vector4d {
public double x;
public double y;
public double z;
public double w;
public Vector4d() {
}
public Vector4d(double x, double y, double z, double w) {
this.x = x;
this.y = y;
this.z = z;
this.w = w;
}
... | src/uk/co/stikman/utils/math/Vector4d.java | 0.764276 | 0.519521 | Vector4d.java | starcoder |
package com.jsyn.unitgen;
import com.jsyn.ports.UnitInputPort;
/**
* PhaseShifter effects processor. This unit emulates a common guitar pedal effect but without the
* LFO modulation. You can use your own modulation source connected to the "offset" port. Different
* frequencies are phase shifted varying amounts usi... | src/main/java/com/jsyn/unitgen/PhaseShifter.java | 0.915321 | 0.442697 | PhaseShifter.java | starcoder |
package de.adesso.projectboard.base.normalizer;
import java.util.List;
import java.util.Objects;
import java.util.Set;
import java.util.function.Function;
import java.util.stream.Collectors;
public abstract class FieldNormalizer<T> implements Normalizer<T> {
private final Set<RootTermDistanceCalculator> fieldDis... | backend/project-board/src/main/java/de/adesso/projectboard/base/normalizer/FieldNormalizer.java | 0.904266 | 0.427994 | FieldNormalizer.java | starcoder |
package visualiser.model;
import javafx.beans.property.*;
import javafx.scene.paint.Color;
import network.Messages.Enums.BoatStatusEnum;
import shared.model.*;
import java.time.Duration;
import java.time.ZonedDateTime;
import java.util.ArrayList;
import java.util.List;
/**
* Represents a Boat on the visualiser side... | racevisionGame/src/main/java/visualiser/model/VisualiserBoat.java | 0.91219 | 0.41117 | VisualiserBoat.java | starcoder |
package me.soubhik.GeoDatabase;
import me.soubhik.IntegerEncoding;
import org.apache.commons.collections4.MultiValuedMap;
import org.apache.commons.collections4.multimap.HashSetValuedHashMap;
import org.apache.commons.lang3.tuple.ImmutablePair;
import org.apache.commons.lang3.tuple.Pair;
import java.util.*;
/**
* C... | java/practice/src/main/java/me/soubhik/GeoDatabase/InMemoryStorage.java | 0.848722 | 0.490053 | InMemoryStorage.java | starcoder |
package io.parsingdata.metal.expression.value;
import static io.parsingdata.metal.Util.checkNotNull;
import java.util.Objects;
import java.util.Optional;
import io.parsingdata.metal.Util;
import io.parsingdata.metal.data.ImmutableList;
import io.parsingdata.metal.data.ParseGraph;
import io.parsingdata.metal.encoding... | core/src/main/java/io/parsingdata/metal/expression/value/BinaryValueExpression.java | 0.936728 | 0.69526 | BinaryValueExpression.java | starcoder |
package frc.robot;
import com.revrobotics.CANSparkMaxLowLevel.MotorType;
import java.util.ArrayList;
import java.util.Arrays;
import com.revrobotics.CANSparkMax;
import edu.wpi.first.wpilibj.XboxController;
import edu.wpi.first.wpilibj.GenericHID.Hand;
public class DriveTrain {
//instances of side for both le... | src/main/java/frc/robot/DriveTrain.java | 0.618089 | 0.53522 | DriveTrain.java | starcoder |
package cl.uchile.dcc.scrabble.functions.NodeType;
import cl.uchile.dcc.scrabble.factories.NodesFactory.NodeTypeFactory;
/**
* Clase Node
* implementa TypeNode
*/
public abstract class Node implements TypeNode {
@Override
public TypeNode add(TypeNode addend){
return null;
}
@Override
p... | src/main/java/cl/uchile/dcc/scrabble/functions/NodeType/Node.java | 0.74872 | 0.518363 | Node.java | starcoder |
package evaluation;
import java.util.*;
import java.util.stream.Collectors;
import java.util.Comparator;
public class Evaluations {
// R1
/**
* Define number of levels and relative points.
*
* Levels are numbered from 1 on, and points must be strictly decreasing
*
* @param points poi... | src/evaluation/Evaluations.java | 0.945551 | 0.57093 | Evaluations.java | starcoder |
import edu.princeton.cs.algs4.StdIn;
import edu.princeton.cs.algs4.StdOut;
/***************************************************************
* Refer to the notes on QuickUnion.java.
* This code is a great improvement over QuickUnion as it takes
* into account the depth of the trees, thereby weighing them.
*
* Tree... | week1/percolation/WeightedQuickUnionUF.java | 0.7865 | 0.548915 | WeightedQuickUnionUF.java | starcoder |
package net.ssehub.kernel_haven.cpp_utils.parser;
import static net.ssehub.kernel_haven.cpp_utils.parser.CppParserTest.assertFunctionCall;
import static net.ssehub.kernel_haven.cpp_utils.parser.CppParserTest.assertLiteral;
import static net.ssehub.kernel_haven.cpp_utils.parser.CppParserTest.assertOperator;
import stat... | test/net/ssehub/kernel_haven/cpp_utils/parser/CppParserScenarioTests.java | 0.806281 | 0.544256 | CppParserScenarioTests.java | starcoder |
package com.github.manzurola.spacy4j.api.containers;
import java.util.List;
import java.util.Objects;
import java.util.Optional;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
/**
* A slice from a {@link Doc} object.
*/
public final class Span {
private final Doc doc;
private final ... | spacy4j-api/src/main/java/com/github/manzurola/spacy4j/api/containers/Span.java | 0.901271 | 0.45744 | Span.java | starcoder |
package org.lemurproject.galago.tupleflow.execution;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.HashMap;
import java.util.Map;
import org.lemurproject.galago.tupleflow.Utility;
/**
* Represents a multi block in a TupleFlow stage.
* A multi-block is a set of pi... | tupleflow/src/main/java/org/lemurproject/galago/tupleflow/execution/MultiStepInformation.java | 0.899251 | 0.436862 | MultiStepInformation.java | starcoder |
package science.atlarge.graphalytics.dxram.algorithms.bfs.front;
import java.util.concurrent.atomic.AtomicLong;
import java.util.concurrent.atomic.AtomicLongArray;
/**
* Thread safe, lock free implementation of a frontier listed based on
* the BitVector.
* Only the pushBack call is thread safe. The popFront call i... | src/main/java/science/atlarge/graphalytics/dxram/algorithms/bfs/front/HalfConcurrentBitVector.java | 0.906177 | 0.414247 | HalfConcurrentBitVector.java | starcoder |
package ch.bisi.jicon.colorfinder;
import static java.lang.StrictMath.floor;
import java.awt.Color;
import java.awt.image.BufferedImage;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Optional;
/**
* Utility class for finding the main color ... | src/main/java/ch/bisi/jicon/colorfinder/ColorFinder.java | 0.964119 | 0.531392 | ColorFinder.java | starcoder |
package de.chrlembeck.aoc2019.day10;
import de.chrlembeck.aoccommon.AbstractAocBase;
import java.awt.*;
import java.util.*;
public class Aoc2019Day10 extends AbstractAocBase {
public static final Comparator<Point> ANGLE_COMPARATOR = Comparator.comparingDouble((Point point) -> {
if (point.x == 0) {
... | src/main/java/de/chrlembeck/aoc2019/day10/Aoc2019Day10.java | 0.885086 | 0.488222 | Aoc2019Day10.java | starcoder |
package brave.internal.propagation;
import brave.Request;
import brave.Span;
import brave.propagation.Propagation;
import brave.propagation.Propagation.RemoteSetter;
import brave.propagation.Propagation.Setter;
import brave.propagation.TraceContext;
import java.util.ArrayList;
import java.util.Arrays;
import java.util... | brave/src/main/java/brave/internal/propagation/InjectorFactory.java | 0.852568 | 0.40589 | InjectorFactory.java | starcoder |
package org.andengine.b.a;
import org.andengine.b.b.c;
import org.andengine.b.b.d;
import org.andengine.opengl.util.e;
public class a implements c {
static final float[] a = new float[2];
protected float b;
protected float c;
protected float d;
protected float e;
protected float f = 0.0f;
... | APK/flappybirds/sources/org/andengine/b/a/a.java | 0.688259 | 0.454351 | a.java | starcoder |
package com.pushtechnology.utils.filefeeder;
import java.util.Collection;
import java.util.Collections;
import java.util.LinkedList;
import java.util.List;
import java.util.stream.Collectors;
public class Tree<T> {
private TreeNode<T> root;
final class TreeNode<T> {
String name;
T data;
... | src/main/java/com/pushtechnology/utils/filefeeder/Tree.java | 0.875202 | 0.474266 | Tree.java | starcoder |
package com.insulin.excel;
import com.insulin.excel.utils.RowTracker;
import com.insulin.model.form.GlucoseMandatory;
import com.insulin.model.form.InsulinMandatory;
import com.insulin.model.form.MandatoryIndexInformation;
import com.insulin.model.form.OptionalIndexInformation;
import org.apache.poi.ss.usermodel.*;
i... | src/main/java/com/insulin/excel/InformationSheet.java | 0.70791 | 0.57063 | InformationSheet.java | starcoder |
package com.squareup.picasso;
import android.content.Context;
import android.graphics.Bitmap;
import android.graphics.drawable.BitmapDrawable;
import android.graphics.drawable.ColorDrawable;
import android.graphics.drawable.Drawable;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.robolectric.Robole... | test/com/squareup/picasso/PicassoDrawableTest.java | 0.876463 | 0.544135 | PicassoDrawableTest.java | starcoder |
package com.mcleodmoores.date;
import java.util.Objects;
import org.threeten.bp.DayOfWeek;
import org.threeten.bp.LocalDate;
import com.opengamma.financial.convention.calendar.Calendar;
import com.opengamma.util.ArgumentChecker;
/**
* An adapter for {@link Calendar}s that converts them into {@link WorkingDayCalend... | projects/analytics/src/main/java/com/mcleodmoores/date/WorkingDayCalendarAdapter.java | 0.925727 | 0.438665 | WorkingDayCalendarAdapter.java | starcoder |
package org.apache.spark.scheduler;
/**
* Unit tests for the output commit coordination functionality.
* <p>
* The unit test makes both the original task and the speculated task
* attempt to commit, where committing is emulated by creating a
* directory. If both tasks create directories then the end result is
* a... | core/target/java/org/apache/spark/scheduler/OutputCommitCoordinatorSuite.java | 0.766468 | 0.443179 | OutputCommitCoordinatorSuite.java | starcoder |
package org.openstreetmap.atlas.mutator.configuration.parsing.mergeforgiveness.strategies;
import java.io.Serializable;
import java.util.Map;
import org.openstreetmap.atlas.exception.CoreException;
import org.openstreetmap.atlas.geography.atlas.change.ChangeType;
import org.openstreetmap.atlas.geography.atlas.change.... | src/main/java/org/openstreetmap/atlas/mutator/configuration/parsing/mergeforgiveness/strategies/TakeLowerNodeIdentifierStrategy.java | 0.807954 | 0.473962 | TakeLowerNodeIdentifierStrategy.java | starcoder |
package data.structures.java.arrays;
import java.util.*;
import java.util.stream.Collectors;
import static data.structures.java.util.Common.randomRange;
import static data.structures.java.util.Common.swap;
public class ArraysCommon
{
public static int findSecondMax(int[] a)
{
if(a == null || a.length < 2)
... | 2-content/14-Pure-Education/java-data-struc/java-prep/src/main/java/data/structures/java/arrays/ArraysCommon.java | 0.681727 | 0.472075 | ArraysCommon.java | starcoder |
package com.blackoutburst.bogel.graphics;
import static org.lwjgl.opengl.GL11.GL_FLOAT;
import static org.lwjgl.opengl.GL11.GL_TEXTURE_2D;
import static org.lwjgl.opengl.GL11.GL_TRIANGLES;
import static org.lwjgl.opengl.GL11.GL_UNSIGNED_INT;
import static org.lwjgl.opengl.GL11.glBindTexture;
import static org.lwjgl.op... | src/com/blackoutburst/bogel/graphics/RenderQuad.java | 0.671471 | 0.457743 | RenderQuad.java | starcoder |
package com.vaadin.shared.ui.dnd.criteria;
import java.io.Serializable;
import java.util.Collection;
import java.util.Optional;
/**
* Stores parameters for the drag and drop acceptance criterion defined using
* the criteria API.
* <p>
* When data is dragged over a drop target, the value here is compared to the
*... | shared/src/main/java/com/vaadin/shared/ui/dnd/criteria/Criterion.java | 0.962418 | 0.502441 | Criterion.java | starcoder |
package aos.data.iterable;
import aos.data.iterator.AosIterator;
import aos.data.iterator.IteratorOutOfBoundsException;
/**
* An {@link AosIterator} over the contents of an array.
*
*/
public class ArrayIterator implements AosIterator {
/** The array to iterator over. */
private final Object[] _array;
... | structure/core/src/main/java/aos/data/iterable/ArrayIterator.java | 0.907497 | 0.478102 | ArrayIterator.java | starcoder |
class Solution {
// Time: O(mnlog(mn))
// Space: O(1)
// Binary Search - Use binary search to get the mid, then compare mid's smaller num amount with k.
public int kthSmallest(int[][] matrix, int k) {
// Corner Cases
if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
... | 378.kth-smallest-element-in-a-sorted-matrix.java | 0.800185 | 0.635053 | 378.kth-smallest-element-in-a-sorted-matrix.java | starcoder |
package robtest.stateinterfw.data;
import robtest.stateinterfw.ITestCase;
import robtest.stateinterfw.ITestExecutionContext;
import robtest.stateinterfw.ITestInput;
import robtest.stateinterfw.ITestSpecs;
import java.util.ArrayList;
import java.util.List;
public class TestExecutionContext implements ITestExecutionCo... | state-interface-robustness-testing/src/main/java/robtest/stateinterfw/data/TestExecutionContext.java | 0.691602 | 0.443781 | TestExecutionContext.java | starcoder |
package com.opengamma.sesame;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import com.google.common.collect.ImmutableMap;
import com.opengamma.financial.analytics.curve.CurveDefinition;
import com.opengamma.financial.analytics.ircurve.strips.... | sesame/sesame-function/src/main/java/com/opengamma/sesame/CurveDefinitionCurveLabellingFn.java | 0.947284 | 0.49292 | CurveDefinitionCurveLabellingFn.java | starcoder |
package org.cs3.pdt.console.internal.views.completion;
import org.eclipse.swt.graphics.Rectangle;
import org.eclipse.swt.widgets.Control;
/**
* This interface is used to set and retrieve text content from an arbitrary
* control. Clients are expected to implement this interface when defining a
* {@link ContentPropo... | prolog/logicmoo/pdt_server/pdt.console/src/org/cs3/pdt/console/internal/views/completion/IControlContentAdapter.java | 0.871721 | 0.584182 | IControlContentAdapter.java | starcoder |
import java.util.ArrayList;
import java.util.HashMap;
public class DegreeProgression {
public static DegreeNode degree1 = new DegreeNode(1);
public static DegreeNode degree2 = new DegreeNode(2);
public static DegreeNode degree3 = new DegreeNode(3);
public static DegreeNode degree4 = new DegreeNode(4);
... | src/main/java/DegreeProgression.java | 0.551695 | 0.700856 | DegreeProgression.java | starcoder |
package com.wiggler.crux.core.graph;
import java.util.*;
public class Graph {
private final Map<String, Node> nodes = new HashMap<>();
public Graph() {
}
public Iterable<Node> getNodes() {
return nodes.values();
}
public void addNode(Node node) {
Objects.requireNonNull(node)... | Core/src/main/java/com/wiggler/crux/core/graph/Graph.java | 0.929951 | 0.519887 | Graph.java | starcoder |
package de.fzi.cjunit;
import java.lang.annotation.ElementType;
import java.lang.annotation.Retention;
import java.lang.annotation.RetentionPolicy;
import java.lang.annotation.Target;
/**
* The <code>ConcurrentTest</code> annotation tells cJUnit that the
* <code>public void</code> method to which it is attached can... | cJUnit/src/main/de/fzi/cjunit/ConcurrentTest.java | 0.835718 | 0.413359 | ConcurrentTest.java | starcoder |
package com.github.piasy.tryopengl;
import android.content.res.Resources;
import android.opengl.GLES20;
import android.opengl.Matrix;
/**
* Created by Piasy{github.com/Piasy} on 6/7/16.
*/
public class MyGLRenderer extends GLBaseRenderer {
private final float[] mMatrixBuffer = new float[16];
private final ... | try/TryOpenGL/src/main/java/com/github/piasy/tryopengl/MyGLRenderer.java | 0.881155 | 0.535888 | MyGLRenderer.java | starcoder |
package org.talend.dataquality.expressions.util;
import java.util.List;
import org.eclipse.emf.ecore.EClass;
import org.eclipse.emf.ecore.EObject;
import org.talend.dataquality.expressions.BooleanExpressionNode;
import org.talend.dataquality.expressions.ExpressionsPackage;
import orgomg.cwm.foundation.expressions.Exp... | main/plugins/org.talend.dataquality/src/org/talend/dataquality/expressions/util/ExpressionsSwitch.java | 0.830903 | 0.487734 | ExpressionsSwitch.java | starcoder |
package seedu.address.model.person;
import static java.util.Objects.requireNonNull;
import static seedu.address.commons.util.AppUtil.checkArgument;
import java.util.ArrayList;
/**
* Represents an Applicant's employment type in RecruitIn.
*/
public class EmploymentType {
/**
* Enumeration of the possible... | src/main/java/seedu/address/model/person/EmploymentType.java | 0.871693 | 0.453504 | EmploymentType.java | starcoder |
package co.edu.uniandes.csw.biblioteca.ejb;
import co.edu.uniandes.csw.bibilioteca.entities.ReservaEntity;
import co.edu.uniandes.csw.biblioteca.exceptions.BusinessLogicException;
import co.edu.uniandes.csw.biblioteca.persistence.ReservaPersistence;
import java.util.List;
import java.util.logging.Level;
import java.ut... | s2_biblioteca-back/src/main/java/co/edu/uniandes/csw/biblioteca/ejb/ReservaLogic.java | 0.52342 | 0.41834 | ReservaLogic.java | starcoder |
package org.perrierFrancois.turing;
import lombok.*;
import org.perrierFrancois.turing.definition.Action;
import org.perrierFrancois.turing.definition.Move;
import org.perrierFrancois.turing.definition.TuringMachineDefinition;
import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.Stream;
imp... | src/main/java/org/perrierFrancois/turing/TuringMachine.java | 0.705481 | 0.439747 | TuringMachine.java | starcoder |
package uk.ac.sussex.gdsc.smlm.fitting;
import java.util.Arrays;
import uk.ac.sussex.gdsc.core.data.DataException;
import uk.ac.sussex.gdsc.smlm.function.FisherInformation;
import uk.ac.sussex.gdsc.smlm.function.Gradient1Function;
import uk.ac.sussex.gdsc.smlm.function.Gradient1Procedure;
/**
* Calculator for the Fi... | src/main/java/uk/ac/sussex/gdsc/smlm/fitting/UnivariateLikelihoodFisherInformationCalculator.java | 0.921627 | 0.492493 | UnivariateLikelihoodFisherInformationCalculator.java | starcoder |
package experiments.experiment1.datarows;
import core.data.DataRow;
import core.data.Lla;
import core.util.ToStringBuilder;
import no.ffi.hlalib.datatypes.fixedRecordData.VelocityVectorStruct;
import no.ffi.hlalib.datatypes.fixedRecordData.WorldLocationStruct;
import org.apache.commons.math3.geometry.euclidean.threed.... | src/main/java/experiments/experiment1/datarows/RawDataRow.java | 0.878965 | 0.455683 | RawDataRow.java | starcoder |
package com.beaumatherne.mainpackage;
public class WeightModel {
private double mMilligram;
private double mGram;
private double mOunce;
private double mPound;
private double mKilogram;
private double mStone;
private double mShortTon;
private double mMetricTon;
private double mLongTon;
public WeightModel()... | src/com/beaumatherne/mainpackage/WeightModel.java | 0.524882 | 0.451508 | WeightModel.java | starcoder |
package it.matlice.ingsw.tree;
import java.util.*;
public class MapNode<T> implements Node<T> {
private final TreeMap<String, MapNode<T>> children = new TreeMap<>();
private final HashMap<String, Integer> duplicates = new HashMap<>();
private T data;
private MapNode<T> parent;
public MapNode(T da... | src/it/matlice/ingsw/tree/MapNode.java | 0.909593 | 0.59305 | MapNode.java | starcoder |
package qub;
public class SyncResult<T> implements Result<T>
{
private final T value;
private final Throwable error;
private SyncResult(T value, Throwable error)
{
this.value = value;
this.error = error;
}
/**
* Create a new empty successful Result.
* @param <U> The ... | sources/qub/SyncResult.java | 0.925306 | 0.458591 | SyncResult.java | starcoder |
package edu.tamu.weaver.validation.validators;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import edu.tamu.weaver.validation.model.ValidatingEntity;
import edu.tamu.weaver.validation.results.ValidationResults;
import edu.tamu.weaver.va... | validation/src/main/java/edu/tamu/weaver/validation/validators/BaseModelValidator.java | 0.890749 | 0.411879 | BaseModelValidator.java | starcoder |
public class RotorConstants {
/** This constant specifies the number of letters printed on each rotor. */
public static final int ROTOR_LENGTH = 26;
/**
* This is a 1D array of cipher strings, which represent the
* letter-orderings for each rotor. The first rotor (Rotor 0) is the
* identity rotor, ... | RotorConstants.java | 0.757974 | 0.543106 | RotorConstants.java | starcoder |
package poe.level.data;
import java.util.ArrayList;
public class Zone {
public static String[] questline = new String[]{
"Enemy at the Gate",
"Mercy Mission",
"Breaking Some Eggs",
"The Caged Brute",
"The Siren's Cadence",
"Intruders in Black",
"Sharp and Cru... | src/poe/level/data/Zone.java | 0.537041 | 0.401864 | Zone.java | starcoder |
package javax.bluetooth;
import java.util.Vector;
/**
* The <code>DataElement</code> class defines the various data
* types that a Bluetooth service attribute value may have.
* <p>
* The following table describes the data types and valid
* values that a <code>DataElement</code> object can store.
* <p>
* <TABLE... | app/src/main/java/javax/bluetooth/DataElement.java | 0.632049 | 0.495361 | DataElement.java | starcoder |
package edu.neu.leetcode.day7_BFS;
import java.util.LinkedList;
import java.util.Queue;
public class LC490_The_Maze {
/*
Thinking:
- BFS, try 4 direction
- BFS Data structure
- Queue
- visited: set or boolean[][]
Algo:
boolean[][] visited
Q = Queue()
Q.offer(start), a... | src/main/java/edu/neu/leetcode/day7_BFS/LC490_The_Maze.java | 0.845305 | 0.530358 | LC490_The_Maze.java | starcoder |
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
/**
* Your implementation of a LinearProbingHashMap.
*
* @author <NAME>
* @version 1.0
* @userid ychen3221
* @GTID 903531127
*
* Collaborators: N/A
*
* Resources: TAs, canvas, lecture
*/
public class LinearPro... | src/LinearProbingHashMap.java | 0.890526 | 0.410934 | LinearProbingHashMap.java | starcoder |
package org.paukov.combinatorics.util;
import java.math.BigDecimal;
/**
* Utility class for combinatorial package
*
* @author <NAME>
* @version 2.0
*/
public class Util {
/**
* Get minimum of three values
*/
public static int minimum(int a, int b, int c) {
int mi = a;
if (b < mi)
mi = b;
if (c... | src/org/paukov/combinatorics/util/Util.java | 0.779574 | 0.50653 | Util.java | starcoder |
package CodeMonkey.spatial.HalfEdge;
import java.util.ArrayList;
import CodeMonkey.utility.TripleT;
public class Mesh< VD, ED, PD > {
public ArrayList< VertexData< VD > > vds;
public ArrayList< EdgeData< ED > > eds;
public ArrayList< PolygonData< PD > > pds;
private boolean initd = false;
public Mesh( ) {
... | java/CodeMonkey/src/CodeMonkey/spatial/HalfEdge/Mesh.java | 0.572006 | 0.475605 | Mesh.java | starcoder |
package org.jtrim2.concurrent.query;
import java.util.ArrayList;
import java.util.Collection;
import java.util.List;
import java.util.Map;
import java.util.Objects;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
import org.jtrim2.collectio... | subprojects/jtrim-query/src/main/java/org/jtrim2/concurrent/query/CachedAsyncDataQuery.java | 0.937583 | 0.418043 | CachedAsyncDataQuery.java | starcoder |
package io.lateralus.parsergenerator.core.definition;
import com.google.common.collect.HashBasedTable;
import com.google.common.collect.HashMultimap;
import com.google.common.collect.SetMultimap;
import com.google.common.collect.Table;
import io.lateralus.parsergenerator.core.definition.closer.Closer;
import io.latera... | parsergenerator/core/src/main/java/io/lateralus/parsergenerator/core/definition/ParserDefinitionBuilder.java | 0.850407 | 0.411761 | ParserDefinitionBuilder.java | starcoder |
package org.briljantframework.data.vector;
import org.apache.commons.math3.complex.Complex;
import org.briljantframework.data.Is;
import org.briljantframework.data.Logical;
import org.briljantframework.data.Na;
/**
* @author <NAME>
*/
public final class Convert {
private Convert() {}
/**
* Convert the spec... | briljant-core/src/main/java/org/briljantframework/data/vector/Convert.java | 0.922154 | 0.579876 | Convert.java | starcoder |
package squidpony.squidmath;
/**
* A very simple point hash meant only for fixed-size grids, and only for when the hash must be unique but does
* not need to be randomized. If a hashed collection such as a Map has sufficient capacity to hold all items on
* a grid without resizing, then this should never collide whe... | squidlib-util/src/main/java/squidpony/squidmath/KnownSizePointHash.java | 0.933756 | 0.498657 | KnownSizePointHash.java | starcoder |
package cs4r.labs.oracle.mooc;
import java.io.IOException;
import java.util.List;
import java.util.function.Supplier;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import java.util.stream.Stream;
import cs4r.labs.util.Measurements;
/**
* Oracle JDK 8 MOOC Lesson 3 homework
*
* @author cs... | src/main/java/cs4r/labs/oracle/mooc/Lesson3.java | 0.861916 | 0.428712 | Lesson3.java | starcoder |
package he;
import java.util.Scanner;
/**
* @author debmalyajash
*
* Consider an Array a of size N Iterate from 1 to N N In i t h ith
* iteration select the i th minimum and swap it with a [ i ] a[i] You
* are given an array a a, size of the array N N and an integer x x.
* Follo... | src/main/java/he/SelectionStep.java | 0.599602 | 0.641661 | SelectionStep.java | starcoder |
package com.rayferric.comet.core.math;
import java.util.Objects;
public class Vector4i {
public static final int BYTES = 16;
public Vector4i() {
x = y = z = w = 0;
}
public Vector4i(int all) {
x = y = z = w = all;
}
public Vector4i(int x, int y, int z, int w) {
this.... | comet-core/src/main/java/com/rayferric/comet/core/math/Vector4i.java | 0.925525 | 0.5564 | Vector4i.java | starcoder |
package cn.ancono.math.geometry.analytic.plane;
import cn.ancono.math.IMathObject;
import cn.ancono.math.MathObject;
import cn.ancono.math.algebra.abs.calculator.EqualPredicate;
import cn.ancono.math.algebra.abs.calculator.FieldCalculator;
import cn.ancono.math.algebra.abs.calculator.OrderedFieldCal;
import cn.ancono.... | src/cn/ancono/math/geometry/analytic/plane/Triangle.java | 0.911937 | 0.500427 | Triangle.java | starcoder |
package com.android.tools.r8.ir.analysis.framework.intraprocedural;
import com.android.tools.r8.ir.analysis.framework.intraprocedural.DataflowAnalysisResult.FailedDataflowAnalysisResult;
import com.android.tools.r8.ir.analysis.framework.intraprocedural.DataflowAnalysisResult.SuccessfulDataflowAnalysisResult;
import c... | src/main/java/com/android/tools/r8/ir/analysis/framework/intraprocedural/IntraProceduralDataflowAnalysisBase.java | 0.90638 | 0.487734 | IntraProceduralDataflowAnalysisBase.java | starcoder |
package se.toxbee.sleepfighter.utils.collect;
import java.util.Iterator;
import java.util.NoSuchElementException;
import se.toxbee.sleepfighter.utils.geom.Dimension;
import se.toxbee.sleepfighter.utils.geom.FinalPosition;
import se.toxbee.sleepfighter.utils.geom.Position;
import se.toxbee.sleepfighter.utils.reflect.R... | application/sleepfighter/src/main/java/se/toxbee/sleepfighter/utils/collect/Grid.java | 0.886782 | 0.549278 | Grid.java | starcoder |
package com.apreta.plugin;
/**
* Some helper routines for data conversion, all data is treated in network
* byte order.
* @author <NAME> <<EMAIL>>
* @version April 14, 2003
*/
public class BinConverter
{
/**
* Gets bytes from an array into an integer.
* (Apreta: hacked to little endian f... | src/android/BinConverter.java | 0.775562 | 0.480905 | BinConverter.java | starcoder |
package com.im.bioassay.curvefit;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.logging.Level;
import java.util.logging.Logger;
/**
* Curve fitter for the 4 parameter logistic equation.
* <p>
* The 4PL equation is: Y = D+(A-D)/(1+(x/C)^B) where:... | bioassay/src/main/java/com/im/bioassay/curvefit/FourPLFitter.java | 0.957118 | 0.558447 | FourPLFitter.java | starcoder |
package jacobi.core.decomp.svd.dqds;
/**
* Implementation of a flipping step in Dqds algorithm.
*
* <p>Dqds, being a variant of QR algorithm, has a tendency to converge first at the bottom. In cases
* that it is close to convergence at the top, it takes a few iterations to push the converging value down.</p>
*
... | src/main/java/jacobi/core/decomp/svd/dqds/FlippingDqds.java | 0.862091 | 0.561275 | FlippingDqds.java | starcoder |
package parquet.io.api;
import parquet.column.Dictionary;
/**
* converter for leaves of the schema
*
* @author <NAME>
*
*/
abstract public class PrimitiveConverter extends Converter {
@Override
public boolean isPrimitive() {
return true;
}
@Override
public PrimitiveConverter asPrimitiveConverter(... | parquet-column/src/main/java/parquet/io/api/PrimitiveConverter.java | 0.965787 | 0.461199 | PrimitiveConverter.java | starcoder |
package org.highj.optic;
import java.util.Optional;
import java.util.function.Function;
import org.derive4j.hkt.__;
import org.highj.data.Either;
import org.highj.data.Maybe;
import org.highj.function.F1;
import org.highj.data.tuple.T2;
import org.highj.typeclass0.group.Monoid;
import org.highj.typeclass1.monad.Appli... | src/main/java/org/highj/optic/POptional.java | 0.909808 | 0.656548 | POptional.java | starcoder |
package list;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertNotEquals;
import static org.junit.Assert.assertTrue;
import java.util.Collections;
import java.util.Map;
import org.junit.Before;
import org.junit.Test;
import structures.Arra... | test/list/TestList.java | 0.745584 | 0.642096 | TestList.java | starcoder |
import java.util.LinkedList;
import java.util.Queue;
class TreeNode{
Integer data;
TreeNode leftNode;
TreeNode rightNode;
TreeNode(Integer data){
this.data = data;
this.leftNode = null;
this.rightNode = null;
}
public static void preorderDFS(TreeNode root){
if(... | Tree/BinaryTree/BinaryTree.java | 0.648911 | 0.538801 | BinaryTree.java | starcoder |
package org.opensha.commons.data.xyz;
import org.opensha.commons.geo.Location;
import org.opensha.commons.geo.LocationList;
/**
* Interface for a geographic XYZ dataset. These datasets are backed by <code>Location</code> objects
* instead of <code>Point2D</code> objects. They also have the capability of storing lat... | src/main/java/org/opensha/commons/data/xyz/GeoDataSet.java | 0.92243 | 0.576721 | GeoDataSet.java | starcoder |
package tzatziki.analysis.exec;
import com.google.common.base.Function;
import com.google.common.collect.FluentIterable;
import gherkin.formatter.Argument;
import gherkin.formatter.model.*;
import tzatziki.analysis.exec.model.*;
import java.util.ArrayList;
import java.util.List;
/**
* @author <a href="http://twitte... | tzatziki-core/src/main/java/tzatziki/analysis/exec/ModelConverter.java | 0.779196 | 0.415254 | ModelConverter.java | starcoder |
package runtime.datatypes.textual;
import static building.types.specific.datatypes.SingleType.TEXT;
import static runtime.datatypes.numerical.ConceptualNrValue.NAN;
import static runtime.datatypes.numerical.ConceptualNrValue.NEG_INF;
import static runtime.datatypes.numerical.ConceptualNrValue.POS_INF;
import java.mat... | src/runtime/datatypes/textual/TextValue.java | 0.844826 | 0.533397 | TextValue.java | starcoder |
package com.google.common.graph;
import com.google.common.annotations.Beta;
import com.google.common.base.Function;
import com.google.common.collect.ImmutableSet;
import com.google.common.collect.Iterators;
import com.google.common.collect.Maps;
import com.google.common.collect.Sets;
import com.google.common.math.IntM... | com/google/common/graph/AbstractNetwork.java | 0.858778 | 0.417093 | AbstractNetwork.java | starcoder |
package edu.metrostate.ics340.p2.go1337;
/**
* This class is used to represent a Node in a binary decoding tree used in the Huffman coding/decoding algorithm. It can
* store a character data and frequency data, as well as have a left and right child node.
*
* @author <NAME>
* Sunday, May 31st, 2020
*
*/
public... | src/edu/metrostate/ics340/p2/go1337/Node.java | 0.924985 | 0.584153 | Node.java | starcoder |
E
方法1:
换到正确的位置。
需要小心handle i, 因为不知道换到nums[i]上的是什么，所以必须原地清理干净 方能move on.
方法2:
做标记！
很巧妙地运用了标记的方法, 标记成负数，证明visit过。
Preserve原数的负数，这样可以继续用此负数的绝对值来寻找原数所该被定的位置。非常巧妙！
方法3:
做标记！
跟方法2类似，也是做标记，这一次是加上一个大于n的数（因为题目给了n的border），最后check一下就好。为不超Integer.MAX_VALUE, 每次加n前，取余数。
做标记的方法固然快，但是相对来说比较hacky，在常规的代码中，估计不会用到.
```
/*
Given an a... | LintCode-master/Java/Find All Numbers Disappeared in an Array.java | 0.71602 | 0.990235 | Find All Numbers Disappeared in an Array.java | starcoder |
package org.elastos.carrier;
import android.util.Log;
import org.elastos.carrier.common.RobotConnector;
import org.elastos.carrier.common.Synchronizer;
import org.elastos.carrier.common.TestContext;
import org.elastos.carrier.common.TestHelper;
import org.elastos.carrier.common.TestOptions;
import org.elastos.carrier... | app/src/androidTest/java/org/elastos/carrier/FriendMessageTest.java | 0.608827 | 0.408808 | FriendMessageTest.java | starcoder |
package br.com.amdb.domain.core;
import br.com.amdb.domain.core.service.*;
import br.com.amdb.domain.enumeration.Estados;
import br.com.amdb.domain.exception.SintegraException;
import org.apache.commons.lang3.StringUtils;
import java.util.HashMap;
import java.util.Map;
import java.util.Objects;
public class Validaca... | src/main/java/br/com/amdb/domain/core/ValidacaoSintegra.java | 0.708313 | 0.505371 | ValidacaoSintegra.java | starcoder |
package array_matrix_sorting;
import java.util.HashMap;
import java.util.Map;
/**
* Given an array of integers nums and an integer k, return the number of unique k-diff pairs in the array.
*
* A k-diff pair is an integer pair (nums[i], nums[j]), where the following are true:
*
* 0 <= i < j < nums.length
* ... | src/array_matrix_sorting/K_DiffPairsInAnArray.java | 0.756088 | 0.573021 | K_DiffPairsInAnArray.java | starcoder |
package org.agoncal.application.ui;
/*
* Main class for running the simple card game.
*
* A simple card game with an option for two players.
* The deck of cards contains 52 cards with 13 cards each in the 4 suits:
* clubs, diamonds, hearts, spades.
*
* Each player begins with 26 cards and one of the players star... | 99-temp/src/main/java/org/agoncal/application/ui/CardGamePageService.java | 0.726426 | 0.509581 | CardGamePageService.java | starcoder |
package com.kevintweber.kimpachi.board;
import com.google.common.collect.ImmutableSet;
import lombok.EqualsAndHashCode;
import lombok.NonNull;
import lombok.ToString;
import java.util.HashSet;
import java.util.Set;
/**
* A PointSet is a set of points.
*
* The PointSet can contain 0 or more points. The points can... | src/main/java/com/kevintweber/kimpachi/board/PointSet.java | 0.917562 | 0.447823 | PointSet.java | starcoder |
package com.leidoslabs.holeshot.elt.imageop.ogl;
import static org.lwjgl.opengl.GL11.GL_LINEAR;
import static org.lwjgl.opengl.GL11.GL_TEXTURE_2D;
import static org.lwjgl.opengl.GL11.glBindTexture;
import static org.lwjgl.opengl.GL11.glViewport;
import static org.lwjgl.opengl.GL12.GL_CLAMP_TO_EDGE;
import static org.l... | elt/src/main/java/com/leidoslabs/holeshot/elt/imageop/ogl/OglToneTransferCurve.java | 0.68679 | 0.430806 | OglToneTransferCurve.java | starcoder |
package challenge251.easy;
import org.jjrobinson.util.fileio.ChallengeInput;
import java.util.ArrayList;
/**
* [2016-01-25] Challenge #251 [Easy] Create Nonogram description
* submitted 4 hours ago * by fvandepitte
* Description
*
* This week we are doing a challenge involving Nonograms
* It is going to be a t... | src/challenge251/easy/Nonograms.java | 0.672654 | 0.528838 | Nonograms.java | starcoder |
package swim.traffic.model;
import swim.math.TensorDims;
import swim.math.TensorForm;
import swim.structure.Item;
import swim.structure.Kind;
import swim.structure.Record;
import swim.structure.Value;
import swim.util.Murmur3;
public final class SignalPhaseTensor {
public double red;
public double yellow;
publ... | server/src/main/java/swim/traffic/model/SignalPhaseTensor.java | 0.908 | 0.493287 | SignalPhaseTensor.java | starcoder |
package leetcode.hashtable;
import javafx.util.Pair;
import java.util.*;
/*
https://leetcode.com/problems/time-based-key-value-store/
Create a timebased key-value store class TimeMap, that supports two operations.
1. set(string key, string value, int timestamp)
Stores the key and value, along with the given times... | src/leetcode/hashtable/LT981_Time_Based_KV_Store.java | 0.819026 | 0.432303 | LT981_Time_Based_KV_Store.java | starcoder |
public class SparseSet {
private interface SparseSetDataStructure {
public void add(int item);
public void remove(int item);
public int find(int item);
public void clear();
}
private static class SparseSet1 implements SparseSetDataStructure {
int items, capaci... | DataStructures/SparseSet.java | 0.757615 | 0.46873 | SparseSet.java | starcoder |
package de.hsbo.geo.simsamples.eventqueues.servercustomer;
import de.hsbo.geo.simsamples.applications.PubExample;
import de.hsbo.geo.simsamples.eventqueues.Entity;
import de.hsbo.geo.simsamples.eventqueues.EventEntry;
import de.hsbo.geo.simsamples.eventqueues.EventQueue;
import de.hsbo.geo.simsamples.eventqueues.Event... | src/de/hsbo/geo/simsamples/eventqueues/servercustomer/SimpleServerCustomerSimulator.java | 0.600657 | 0.400339 | SimpleServerCustomerSimulator.java | starcoder |
package io.mesosphere.mesos.util;
import com.google.common.base.Function;
import com.google.common.base.Optional;
import com.google.common.base.Supplier;
import com.google.common.collect.Maps;
import org.jetbrains.annotations.NotNull;
import java.util.*;
import static com.google.common.collect.Lists.newArrayList;
im... | cassandra-mesos-model/src/main/java/io/mesosphere/mesos/util/Functions.java | 0.913131 | 0.41182 | Functions.java | starcoder |
package de.renew.unify;
import java.util.Iterator;
public final class List extends Aggregate {
public static List NULL = new List(0);
public List(int arity) {
super(arity);
if (arity != 2 && arity != 0) {
throw new RuntimeException("Illegal list element size.");
}
}
... | root/prj/sol/projects/renew2.5source/renew2.5/src/Simulator/src/de/renew/unify/List.java | 0.681091 | 0.405154 | List.java | starcoder |
package com.kunalkhairnar.sorting;
/**
* <h1>Sorting Algorithm - Bubble Sort</h1>
* <p>
* This class contains various methods for sorting array using
* the <b>Bubble Sort</b> algorithm sometimes referred to as Sinking Sort.
*
* <p>The documentation for the methods contained in this class includes
* brief descri... | src/main/java/com/kunalkhairnar/sorting/BubbleSort.java | 0.858021 | 0.469703 | BubbleSort.java | starcoder |
package org.sleuthkit.autopsy.report.modules.datasourcesummaryexport;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.stream.Collectors;
import java.util.stream.Stream;
import org.apache.commons.lang3.StringUtils;
import org.apache.commons.lang... | Core/src/org/sleuthkit/autopsy/report/modules/datasourcesummaryexport/ExportGeolocation.java | 0.872971 | 0.406803 | ExportGeolocation.java | starcoder |
package io.github.ejif.geometry;
import javax.annotation.Nullable;
import lombok.Builder;
import lombok.Data;
/**
* Represents a directional line segment, ray, or line that corresponds to a subset of the line
* through anyPoint and anyPoint + (dx, dy). The subset of the line starts and ends at the given
* points,... | geometry/src/main/java/io/github/ejif/geometry/DirectedEdge.java | 0.961125 | 0.645818 | DirectedEdge.java | starcoder |
package objConverter;
import org.lwjgl.util.vector.Vector3f;
import java.util.ArrayList;
import java.util.List;
public class Vertex {
private static final int NO_INDEX = -1;
private Vector3f position;
private int textureIndex = NO_INDEX;
private int normalIndex = NO_INDEX;
private Vertex duplic... | src/objConverter/Vertex.java | 0.733643 | 0.530236 | Vertex.java | starcoder |
package com.google.mediapipe.glutil;
import android.opengl.GLES20;
import android.opengl.Matrix;
import java.nio.FloatBuffer;
import java.util.HashMap;
import java.util.Map;
/** Simple renderer for a normal 2D texture. */
public class TextureRenderer {
private static final FloatBuffer TEXTURE_VERTICES =
Shad... | mediapipe/java/com/google/mediapipe/glutil/TextureRenderer.java | 0.8709 | 0.445047 | TextureRenderer.java | starcoder |
package DungeonCrawler.DisplayComponents;
import DungeonCrawler.Utilities.Image;
import DungeonCrawler.Weapon.Weapon;
import java.awt.*;
import java.awt.image.BufferedImage;
import java.util.ArrayList;
//A Heads Up Display that shows the player's health, and lives.
public class HUD {
//An buffer that get written... | src/DungeonCrawler/DisplayComponents/HUD.java | 0.70477 | 0.502258 | HUD.java | starcoder |
package jackrabbit;
import static org.fest.assertions.Assertions.assertThat;
import java.util.LinkedList;
import java.util.List;
import org.junit.Test;
public class PermissionKeyTest {
@Test
public void testEqualsWorks() {
final PermissionKey pk = new PermissionKey("default", "test", "1234");
assertTha... | test/jackrabbit/PermissionKeyTest.java | 0.812347 | 0.662694 | PermissionKeyTest.java | starcoder |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.