First 30 rows of java
| uuidstring | repo_namestring | relative_pathstring | contentstring | categorystring | algo_rel_scorefloat64 | quality_scorefloat64 |
|---|---|---|---|---|---|---|
| 53b49501-8db2-45bb-b979-fb391a5e635d | CyanogenMod/android_external_proguard | src/proguard/Initializer.java | package proguard; import proguard.classfile.ClassPool; import proguard.classfile.attribute.visitor.AllAttributeVisitor; import proguard.classfile.constant.visitor.*; import proguard.classfile.instruction.visitor.AllInstructionVisitor; import proguard.classfile.util.*; import pro… | TOOL | 0.9118829965591431 | 7.3656325340271 |
| a9f72d2b-bd11-4426-a5c8-9592e3046745 |
| Queues/HW3/ListQueue.java |
| import java.util.Iterator; import java.util.NoSuchElementException; //Marc Sulsenti //I pledge my honor that I have abided by the Stevens Honor System. public class ListQueue <E> { Node<E> front; int size; public class Node<E> { private E data; privat… |
| ALGO |
| 0.999334990978241 |
| 5.559491157531738 |
| acd0d594-d6a5-4ae2-a108-c7a01bd6015e | Rakshith-B-Gowda/Learning-JDBC | JDBC Demo/lib/mysql-connector-j-9.0.0/src/main/user-impl/java/com/mysql/cj/jdbc/result/UpdatableResultSet.java | package com.mysql.cj.jdbc.result; import java.io.InputStream; import java.io.Reader; import java.io.UnsupportedEncodingException; import java.math.BigDecimal; import java.sql.Clob; import java.sql.JDBCType; import java.sql.NClob; import java.sql.SQLException; import java.sql.SQL… | TOOL | 0.8861128687858582 | 5.307267189025879 |
| 968e4012-6c54-4a23-a659-9f123c8c3944 | GameFocal/RivenWorldServer | LowEntryRivenWorld/src/main/java/lowentry/ue4/libs/jackson/databind/ser/std/EnumSetSerializer.java | package lowentry.ue4.libs.jackson.databind.ser.std; import java.io.IOException; import java.util.*; import lowentry.ue4.libs.jackson.core.*; import lowentry.ue4.libs.jackson.databind.*; import lowentry.ue4.libs.jackson.databind.jsontype.TypeSerializer; @SuppressWarnings("all")… | TOOL | 0.7779524922370911 | 7.636869430541992 |
| a950148c-30bf-47e1-b493-50a13f2118f1 | nstrings/create-phone-number.codewars | Kata.java | public class Kata { public static String createPhoneNumber(int[] numbers) { StringBuilder str = new StringBuilder("(" + numbers[0] + numbers[1] + numbers[2] + ") "); for(int i = 3; i<numbers.length; i++){ str.append(numbers[i]); if(i==5){ str.append(… | ALGO | 0.9981099367141724 | 5.5893330574035645 |
| f4aa1b09-215e-4e4c-9280-057e6fe65622 | chenquan1992/java_8_in_action | Java8InAction-master/src/main/java/lambdasinaction/chap6/Grouping.java | package lambdasinaction.chap6; import java.util.*; import static java.util.stream.Collectors.*; import static lambdasinaction.chap6.Dish.menu; public class Grouping { enum CaloricLevel { DIET, NORMAL, FAT }; public static void main(String ... args) { System.o… | TOOL | 0.9117087125778198 | 5.806070327758789 |
| 4a2f54bb-ec4c-4b60-ab21-c1fb64621f25 | openlookeng/hetu-core | presto-main/src/main/java/io/prestosql/metadata/SessionPropertyManager.java | package io.prestosql.metadata; import com.google.common.collect.ImmutableList; import com.google.common.collect.Maps; import io.airlift.json.JsonCodec; import io.airlift.json.JsonCodecFactory; import io.prestosql.Session; import io.prestosql.SystemSessionProperties; import io.pr… | TOOL | 0.7969974875450134 | 7.936896800994873 |
| 17a353e7-8986-4c52-a82e-362bcf89e8ec | ramjiik1992/202005-lnt-advjava | JavaProjects/in.conceptarchitect.collections/tests/in/conceptarchitect/collections/LinkedListPerformanceTest.java | package in.conceptarchitect.collections; import java.util.Iterator; import org.junit.After; import org.junit.Before; import org.junit.Test; import in.conceptarchitect.collections.LinkedList; public class LinkedListPerformanceTest { LinkedList<Integer> list=new LinkedList<>(… | TEST | 0.7331010699272156 | 5.619407653808594 |
| 7c0d953f-b389-4941-8064-71caacd89200 | adityav-verma/programming | SegmentTreeTest.java | //coderadi //basic segment tree implementation, Range Minimum Query import java.io.*; import java.util.*; import java.math.*; class Node{ private int x; Node(int x){ this.x = x; } public void setX(int x){ this.x = x; } public int getX(){ return x; } } class … | ALGO | 0.9991140961647034 | 5.956092834472656 |
| b899efc9-2767-48e1-8f72-7418867ce588 | Harif-Rahman/Competive-Programming | src/JumpGame45.java | import java.util.LinkedList; import java.util.Queue; public class JumpGame45 { /* Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your… | ALGO | 0.9998130202293396 | 5.895269393920898 |
| a7c4eee0-c83d-4cb9-857e-e9f23cee2bea | IPandragonI/Envo-Agent-Mind | src/org/jbox2d/dynamics/contacts/PolygonContact.java | package org.jbox2d.dynamics.contacts; import org.jbox2d.collision.Manifold; import org.jbox2d.collision.shapes.PolygonShape; import org.jbox2d.collision.shapes.ShapeType; import org.jbox2d.common.Transform; import org.jbox2d.dynamics.Fixture; import org.jbox2d.pooling.IWorldPool… | ALGO | 0.8571239709854126 | 6.679129600524902 |
| a16cefca-177f-4b50-b120-4131d30c85ad | koeyhnujeel/CodingTest | src/DFS_BFS_활용/미로의_최단거리_통로_BFS.java | package DFS_BFS_활용; import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; class Point { public int x; public int y; public Point(int x, int y) { this.x = x; this.y = y; } } public class 미로의_최단거리_통로_BFS { static int[] dx = {-1, 0, 1, 0}; stat… | ALGO | 0.9996984004974365 | 5.744794845581055 |
| 85b66fbc-1aa7-4cf2-ab0b-ce3498a432ed | kevinczhang/SpringBootCRUD | src/main/resources/solutions/basicCalculatorII.java | public class Solution { public int calculate(String s) { s = s.trim(); if (s.length() == 0) return 0; int curIndex = 0, total = 0, curNum = 0, sign = 1; if (s.charAt(0) == '+' || s.charAt(0) == '-') sign = s.charAt(0) == '+' ? 1 : -1; while(curIndex < s.le… | ALGO | 0.9993336796760559 | 6.057194709777832 |
| c97219be-05eb-4c52-8234-5a2af715dbc8 | SarthakKotewale/My-Leetcode-Solutions | Leetcode January Challenge 2023/Jan4_minimum-rounds-to-complete-all-tasks.java | /*You are given a 0-indexed integer array tasks, where tasks[i] represents the difficulty level of a task. In each round, you can complete either 2 or 3 tasks of the same difficulty level. Return the minimum rounds required to complete all the tasks, or -1 if it is not possible … | ALGO | 0.9999480247497559 | 6.255683422088623 |
| 2ac0433c-b4f1-45ee-a535-2b9e4530d9d1 | Soyeong4250/like-lion-code | CodeUp/src/Main1089.java | import java.util.Scanner; public class Main1089 { // [기초-종합] 수 나열하기1 private int solution(int a, int d, int n) { return a + d * (n - 1); } public static void main(String[] args) { Main1089 main = new Main1089(); Scanner sc = new Scanner(Syst… | ALGO | 0.9981435537338257 | 5.112524509429932 |
| a1c6a211-4dc6-4bbf-9e17-e87dd99629e7 | Jeongho427/algorithm | 백준/Gold/7576. 토마토/토마토.java | import java.io.*; import java.util.*; class Point{ int x,y; Point(int x,int y){ this.x=x; this.y=y; } } class Main { int n,m,answer; int[][] tomatoes; boolean[][] visit; int[] dx={-1,1,0,0}; int[] dy={0,0,-1,1}; BufferedRead… | ALGO | 0.9988180994987488 | 5.875966548919678 |
| 90d32c7f-565a-402e-aa9a-ee7426a77c63 | Divya1385/CoreJava_Training_ETPL732 | Development/general_programming/swap_without_temp.java | package com.evergent.corejava.general_programming; public class swap_without_temp { public static void main(String[] args) { int a=3,b=4; a=a+b; b=a-b; a=a-b; System.out.println(a); System.out.println(b); } } | ALGO | 0.9797348380088806 | 3.8755319118499756 |
| da0d5be7-daed-4939-996f-ca7275f19b88 | chandrasekarsrin/LeetCode | src/LongestCommonSubsequenceTopDown.java | // PROBLEM: 1143 import java.util.*; class Solution { public int longestCommonSubsequence(String text1, String text2) { Map<String, Integer> map = new HashMap<>(); int res = longestCommonSubsequence(text1, text2, 0, 0, map); return res; } … | ALGO | 0.998798131942749 | 6.3890461921691895 |
| eb1997aa-5d4e-45ac-a31b-eb8bc60a4a93 | Together-Java/AdventOfCode | src/main/java/org/togetherjava/aoc/internal/telemetry/JavaFileFinder.java | package org.togetherjava.aoc.internal.telemetry; import java.io.File; import java.nio.file.Path; import java.nio.file.Paths; import java.util.Optional; public class JavaFileFinder { /** * Finds the Java source file associated with the given class. * * @… | TOOL | 0.8161818981170654 | 7.983138084411621 |
| 86b8e35d-1772-4468-ba4f-d7647c9fe5d5 | steveash/jopenfst | src/main/java/com/github/steveash/jopenfst/ImmutableArc.java | package com.github.steveash.jopenfst; import com.github.steveash.jopenfst.utils.FstUtils; /** * Immutable version of an arc * NOTE: All Immutable* classes are thread safe * @author Steve Ash */ public class ImmutableArc implements Arc { private final int ilabel; privat… | CONFIG | 0.976769745349884 | 7.689297199249268 |
| e37d2e2b-5232-41ec-8d27-0e3a4741dc87 | Almucero/DAM | PROGRAMACION/CAP10/Examen/eCatalog/eCatalog/src/Fase3.java | import library.*; import library.exceptions.*; /** * Clase de prueba para la Fase 3: Implementación Básica de Library * Puntuación total de la fase: 25 puntos */ public class Fase3 { public static void main(String[] args) { System.out.println("=== PRUEBAS FASE 3: … | TEST | 0.9068714380264282 | 5.810453414916992 |
| a6dca93f-4ed7-4196-b31b-e44269826e96 | honnarajuramesh/Java-Geekster | Solved Homework/Class_4_HomeWork/src/PositiveNegetiveNemberCounts.java | import java.util.Scanner; public class PositiveNegetiveNemberCounts { public static void main(String[] args) { Scanner sc=new Scanner(System.in); System.out.println("Enter the total number of elements "); int n=sc.nextInt(); int positiveCount=0; int negetiveCount=0; … | TOOL | 0.9680150151252747 | 5.00337553024292 |
| 4bece819-feb4-4d97-8e80-f9d33c1301f3 | MateuszD/CinemaMovieManager | src/main/java/cinema/model/DAO/MovieDao.java | package cinema.model.DAO; import cinema.model.Movie; import hibernateUtil.HibernateUtil; import org.hibernate.HibernateException; import org.hibernate.Session; import org.hibernate.Transaction; import java.util.List; public class MovieDao { public Integer addMovie(Movie m… | TOOL | 0.8592295050621033 | 5.666172027587891 |
| 1e945e53-ed25-4495-888e-98089a2b8443 | JitenWhatever/LeetCode-Solutions | Easy/Shift2DGrid.java | import java.util.ArrayList; import java.util.List; /* Given a 2D grid of size m x n and an integer k. You need to shift the grid k times. In one shift operation: Element at grid[i][j] moves to grid[i][j + 1]. Element at grid[i][n - 1] moves to grid[i + 1][0]. Element at grid[m… | ALGO | 0.9996236562728882 | 6.059970855712891 |
| 8063d4b6-aa19-4041-946b-79bb0d688fb2 | lui1zz/Collections_Map1 | src/EstoqueProdutos.java | import java.util.Map; import java.util.HashMap; public class EstoqueProdutos { private Map<Long, Produto> estoqueProdutosMap; public EstoqueProdutos() { this.estoqueProdutosMap = new HashMap<>(); } public void adicionarPoduto(long cod, String nome, int … | TOOL | 0.8207058310508728 | 5.38753080368042 |
| cbc2b9db-84b2-4fee-ad93-94acf716fb2b | adityamadhab/java-tps | j10.java | // Program to find the maximum and minimum elements in an array import java.util.Scanner; public class j10 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter the number of elements: "); int n = sc.n… | ALGO | 0.9943068623542786 | 5.265572547912598 |
| dbeebcd9-3c45-4b1d-a903-5138dec2a711 | FurkanKirat/Shadow-of-Roles | src/java/com/rolegame/game/models/player/AIPlayer.java | package com.rolegame.game.models.player; import com.rolegame.game.models.roles.Role; import com.rolegame.game.models.roles.neutralroles.NeutralRole; import com.rolegame.game.services.RoleService; import com.rolegame.game.models.roles.enums.Team; import com.rolegame.game.models.r… | TOOL | 0.9817206859588623 | 5.756012916564941 |
| a104f49c-eac1-4813-bcbd-170ce3c1c2cf | wubi517/SkyDarkTV | app/src/main/java/com/it_tech613/skydark/ui/settings/FragmentSettings.java | package com.it_tech613.skydark.ui.settings; import android.app.Dialog; import android.content.Intent; import android.os.Bundle; import android.view.KeyEvent; import android.view.LayoutInflater; import android.view.View; import android.view.ViewGroup; import androidx.annotation.… | TOOL | 0.7218539118766785 | 5.879057884216309 |
| 66a493ec-bed0-4448-ac6a-97916431ef7d | DemiurgDanilych/Study-in-Netology | HomeWork/Arrays2D/Arrays.java | package HomeWork.Arrays2D; import java.util.Random; import java.util.Scanner; public class Arrays { public static final int SIZE = 8; public static void main(String[] args) { int[][] colors = new int[SIZE][SIZE]; int input; Random random = new Random(); for (int… | TOOL | 0.9388535618782043 | 4.315773963928223 |
| e1459566-cabd-4f5b-9824-c9a769afeed3 | shlinzzr/leetcode-challenge | submissions/combination-sum/Accepted/12-12-2022, 4:46:29 PM/Solution.java | // https://leetcode.com/problems/combination-sum class Solution { public List<List<Integer>> combinationSum(int[] candidates, int target) { Set<List<Integer>> res = new HashSet<>(); helper(res, new ArrayList<>(), candidates, target, 0); return new Arr… | ALGO | 0.9995419979095459 | 7.008883476257324 |
