First 50 rows of go
| uuidstring | repo_namestring | relative_pathstring | contentstring | categorystring | algo_rel_scorefloat32 | quality_scorefloat32 | source_meta |
|---|---|---|---|---|---|---|---|
| b3d3d813-5969-493d-99f2-57dcefea4e86 | ivanov-nikolay/distributed_calculator | pkg/calculator/calculator.go | package calculator import ( "time" "github.com/ivanov-nikolay/distributed_calculator/internal/models" ) // ComputeTask реализует простейший математический калькулятор func ComputeTask(task models.Task) float64 { time.AfterFunc(time.Duration(task.OperationTime)*time.Millisec… | ALGO | 0.9648400545120239 | 6.611298561096191 |
| 2f6b2cbc-f5aa-43b7-b043-3d48f9a54640 | qba73/ptb-go | scrabble/4/scrabble.go | package scrabble import ( "unicode" ) // Score takes a string representing a word // and returns calculated score. func Score(word string) int { score := 0 for _, r := range word { switch unicode.ToUpper(r) { case 'A', 'E', 'I', 'O', 'U', 'L', 'N', 'R', 'S', 'T': scor… | ALGO | 0.8605614304542542 | 4.572407245635986 | {"github_metadata":{"branch":"main","commit_count":52,"repo_created_at":"2024-09-16T21:34:46.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":3,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"1f957856e00b83851f62ae26892cc3e435a5eda9","size_… |
| 2214178c-a436-421d-a5db-b4829582211f | AngusGMorrison/sedgewick-algorithms | c2_sorting/s2_mergesort/q20_indirect_sort/indirect.go | package q20_indirect_sort func IndirectSort(s []int) []int { aux := make([]int, len(s)) // idx contains the current positions of elements in s, like pointers. To start with, the 0th // element in s is at idx[0]. When s is "sorted", these pointers will move to different // po… | ALGO | 0.9964433312416077 | 6.6341471672058105 | {"github_metadata":{"branch":"master","commit_count":147,"repo_created_at":"2022-10-21T11:09:55.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"1466fa79a94c00cbd6fe0c1cecfcf1aa3fc3e345","si… |
| aab288a2-0f98-43dc-910a-90d110551964 | VincentDeRijcke/aoc2022 | day11/day11.go | package main import ( "aoc_go22/utils" _ "embed" "fmt" "sort" "strconv" "strings" "time" ) //go:embed input.txt var input string type monkey struct { items []int divider int operator string operand int trueTarget int falseTarget int } func (m *m… | ALGO | 0.9873598217964172 | 5.746503829956055 | {"github_metadata":{"branch":"master","commit_count":60,"repo_created_at":"2022-12-02T13:23:59.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":1,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"1851d1ad9b0b8c91912d6c9011c37a35a49b5f34","siz… |
| 96c207a2-b42f-4ea5-beab-7a93f672bde1 | nfriendly/advent2022 | days/day13.go | package days import ( "errors" "image/color" "sort" "strconv" "strings" "fyne.io/fyne/v2" "fyne.io/fyne/v2/widget" "github.com/gammazero/deque" "gonum.org/v1/plot" "gonum.org/v1/plot/plotter" ) type Day13Solver struct { } func (d Day13Solver) SolvePartA(puzzleInput … | TOOL | 0.977013885974884 | 5.096951007843018 | {"github_metadata":{"branch":"main","commit_count":12,"repo_created_at":"2022-12-21T00:48:08.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"28370d3dd54f15ed6f93dcf863618b8500843d53","size_… |
| 71f0cb75-fdd4-404e-96ea-fee2016cb37c | golang/go | src/net/mac.go | // Copyright 2011 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package net const hexDigit = "0123456789abcdef" // A HardwareAddr represents a physical hardware address. type Hardwar… | ALGO | 0.9318572878837585 | 6.753425598144531 | {"github_metadata":{"branch":"master","commit_count":63406,"repo_created_at":"2014-08-19T04:33:40.000Z","is_fork":false,"is_org_owned":true,"forked_from":null,"stars":128922,"forks":18252,"issues":5000,"pull_requests":317},"file_meta":{"content_id":"20dcf2783cf93a7a4e118361414503… |
| c0c2fa94-6c14-49e1-95d1-d1019cc9b6c8 | samarthya/goexercism | say/say_c.go | package say import ( "fmt" "strings" ) //myMap defines the constant string values var myMap = map[int]string{ 0: "zero", // 0 - Starts with zero. 1: "one", 2: "two", 3: "three", 4: "four", 5: "five", 6: "si… | TOOL | 0.7316830158233643 | 5.128276824951172 | {"github_metadata":{"branch":"master","commit_count":47,"repo_created_at":"2019-12-16T12:13:26.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":29},"file_meta":{"content_id":"e4202d16ec27c8f39ba60b54cc124f518ef68c23","si… |
| 940dede7-f3ae-47c9-b9ee-c568fced81e6 | gambol99/resources | pkg/utils/kubernetes.go | /* Copyright 2018 All rights reserved - Appvia.io Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless requ… | TOOL | 0.628426730632782 | 6.553247451782227 | {"github_metadata":{"branch":"master","commit_count":7,"repo_created_at":"2018-02-13T18:26:38.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":1,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"11f312727931e4dc93f287e673d40d485d3e4c21","size… |
| ede4f277-dda1-4ecf-91af-9ed819c465e4 | liviro/aoc | 2024/cmd/day20/main.go | package main import ( "bufio" "fmt" "math" "os" "strings" "time" ) type coord struct { x, y int } func (ca coord) Equal(cb coord) bool { return ca.x == cb.x && ca.y == cb.y } func (ca coord) dist(cb coord) int { return int(math.Abs(float64(ca.x-cb.x))) + int(math.Abs… | ALGO | 0.9938667416572571 | 5.354068279266357 | {"github_metadata":{"branch":"main","commit_count":63,"repo_created_at":"2021-12-02T14:32:39.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"bbb492acc2977faf1b864dcfa93477fbb806cde5","size_… |
| 0b4a148f-d1b9-429e-a858-e217a38c4a51 | AgroDan/aoc2023 | day14/patterns/repeated.go | package patterns // type RecordsManager struct { // cycleHashes []string // idxValue []int // } type Record interface { CycleHashes() []string IdxValue() []int } func compareArrays(a, b []uint64) bool { // This function will take two arrays and just compare them. // i… | ALGO | 0.9735219478607178 | 5.926508903503418 | {"github_metadata":{"branch":"main","commit_count":16,"repo_created_at":"2023-12-02T22:21:02.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"69e8227e01ed6bf34b582b9833d6ef88ad23c768","size_… |
| 04022b9a-576d-4fba-ba67-4e7ad417ac70 | golifes/algorithms | leetcode/editor/cn/P70ClimbingStairs .go | //假设你正在爬楼梯。需要 n 阶你才能到达楼顶。 // // 每次你可以爬 1 或 2 个台阶。你有多少种不同的方法可以爬到楼顶呢？ // // 注意：给定 n 是一个正整数。 // // 示例 1： // // 输入： 2 //输出： 2 //解释： 有两种方法可以爬到楼顶。 //1. 1 阶 + 1 阶 //2. 2 阶 // // 示例 2： // // 输入： 3 //输出： 3 //解释： 有三种方法可以爬到楼顶。 //1. 1 阶 + 1 阶 + 1 阶 //2. 1 阶 + 2 阶 //3. 2 阶 + 1 阶 //… | ALGO | 0.9879133105278015 | 6.055078506469727 | {"github_metadata":{"branch":"master","commit_count":19,"repo_created_at":"2021-04-16T02:09:42.000Z","is_fork":false,"is_org_owned":true,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"c2a60e77284db5e2fa8610c9aa58b55f9a35f3dd","size… |
| 78675429-dac9-4dba-af2b-8d5179bb62e6 | ThomasBollmeier/codecrafters-interpreter-go | cmd/myinterpreter/scanner.go | package main import ( "fmt" "unicode" ) type Scanner struct { characters []rune index int line int column int done bool } type charInfo struct { char rune line int column int } func NewScanner(content string) *Scanner { var characters []run… | TOOL | 0.833729088306427 | 3.058351993560791 | {"github_metadata":{"branch":"master","commit_count":70,"repo_created_at":"2025-03-18T07:41:40.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":1,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"b33a0dc7fd9f2b812f95857c2a85daf439f10db5","siz… |
| 1df8e40f-5e9d-4c1e-bd0d-d73c701c0a7e | mantlenetworkio/mantle | fraud-proof/proof/proof/verifier_type.go | // Copyright 2022, Specular contributors // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // … | CONFIG | 0.6196452975273132 | 4.531002521514893 | {"github_metadata":{"branch":"main","commit_count":916,"repo_created_at":"2022-08-05T01:15:54.000Z","is_fork":false,"is_org_owned":true,"forked_from":null,"stars":246,"forks":109,"issues":194,"pull_requests":1},"file_meta":{"content_id":"2ce1fcef02b50127e09ea2760bdd841ac46b648f",… |
| c3ab5b57-3809-4b34-aed8-c6b9d50c2380 | olblak/stv | main.go | package stv import ( "errors" //"fmt" "sort" ) // rankMapStringInt takes a map of [string]int as parameters then // returns a revert sorted array of keys // sorted based on their integer values // Remark: an array is needed here as a map datastructure is always unordered fu… | ALGO | 0.942371666431427 | 3.422114849090576 | {"github_metadata":{"branch":"master","commit_count":7,"repo_created_at":"2020-09-09T11:12:05.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"f9f1a7a69ccfedc349c9d101da71ce0e7ac32e9b","size… |
| d0aeb259-c456-4529-b117-588195f6b3e6 | balwaninitu/learngo | first/array/exercises/01-declare-empty-arrays/sort-num/main.go | package main import ( "fmt" "os" "strconv" ) func main() { args := os.Args[1:] if len(args) == 0 || len(args) > 5 { fmt.Println("give me 5 no") return } var nums [5]float64 for i, v := range args { n, err := strconv.ParseFloat(v, 64) if err != nil { … | ALGO | 0.9950443506240845 | 5.38160514831543 | {"github_metadata":{"branch":"main","commit_count":41,"repo_created_at":"2020-12-14T02:19:38.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"304e844f517d7bfc901f5e817b1d8902278819de","size_… |
| 11fc0f28-7de1-414b-87a7-2ee0f8a251ee | fatenkov/test | internal/calc/sub.go | package calc import "net/http" // Sub - вычисляет разность X и Y func Sub(w http.ResponseWriter, r *http.Request) { // TODO: Реализовать обработку вычисления разности X и Y } | WEB | 0.7710065245628357 | 3.5798685550689697 | {"github_metadata":{"branch":"master","commit_count":3,"repo_created_at":"2017-12-17T17:55:27.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"37be49d59bc6682e5820d9227517ea1034f62e09","size… |
| 95524f1b-393b-49f9-8f01-987fa80ccab2 | malred/malang | 4/parser/parser.go | // parser/parser.go package parser import ( "fmt" "malang/ast" "malang/lexer" "malang/token" "strconv" ) const ( _ int = iota // 0 LOWEST OR // || AND // && EQUALS // == LESSGEATER // > or < SUM // + PRODUCT // * PREFIX // -X or !X… | TOOL | 0.9523432850837708 | 3.5710160732269287 | {"github_metadata":{"branch":"main","commit_count":6,"repo_created_at":"2023-06-06T12:56:55.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":2,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"1d38b8bce453a3467b7fed631bbd9ad7b92cebca","size_b… |
| c2656100-f4e4-4dc7-9f46-9d40a22394b8 | richo225/alGOrithms | cmd/quicksort/main.go | package main import ( "fmt" helpers "github.com/richo225/alGOrithms" ) func main() { // Get the number of items and maximum item value. var numItems, max int fmt.Printf("# Items: ") fmt.Scanln(&numItems) fmt.Printf("Max: ") fmt.Scanln(&max) // Make and display the un… | ALGO | 0.9939879179000854 | 6.615148067474365 | {"github_metadata":{"branch":"master","commit_count":14,"repo_created_at":"2023-11-06T23:38:53.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"8caa6445885aff0328569b06e6ec19b7b110498c","siz… |
| 10213a23-51b7-4201-8641-4d1c8d71ae13 | O136/IPrep | leetcode/710/710. Random Pick with Blacklist.go | package leetcode import ( "math/rand" ) type Solution struct { N int upperBound int needRemapping []int remapped map[int]int } func Constructor(N int, blacklist []int) Solution { needRemapping := make([]int, 0, len(blacklist)/2) upperBound := N - len… | ALGO | 0.9932172894477844 | 4.422893047332764 | {"github_metadata":{"branch":"master","commit_count":51,"repo_created_at":"2017-03-02T22:01:56.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"c18924386c7d103685fa918fbe3e442f7916a1a0","siz… |
| 3e637f1e-4123-4655-93c4-421d5c7a24e4 | o0dd0o/lc-test-go | 300.go | package main func lengthOfLIS(nums []int) int { lens := len(nums) if lens == 0 { return 0 } dp := []int{nums[0]} maxlen := 1 for k := 1; k < lens; k++ { if nums[k] > dp[maxlen-1] { dp = append(dp, nums[k]) maxlen++ } else { s, l := 0, maxlen-1 for s <= l … | ALGO | 0.9985722303390503 | 5.844878673553467 | {"github_metadata":{"branch":"master","commit_count":46,"repo_created_at":"2020-07-27T12:29:13.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"30debcd6131e42dbbdb67f3d3d0c78ea0450befa","siz… |
| e7df468d-9454-4261-9783-b1138bb4cc0e | ktcunreal/Collection | Homework/PTA-GO/1016.go | package main import ( . "fmt" . "strconv" ) func main() { var A, DA, PA, B, DB, PB string Scanf("%s%s%s%s", &A, &DA, &B, &DB) for _, v := range A { if Sprintf("%c", v) == DA { PA += Sprintf("%c", v) } } for _, v := range B { if Sprintf("%c", v) == DB { PB += … | ALGO | 0.9935699701309204 | 5.266815662384033 | {"github_metadata":{"branch":"main","commit_count":1,"repo_created_at":"2021-06-09T02:55:12.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"ecc48aefacf4521f2bb32051e16380abffb57ef3","size_b… |
| 6d5597aa-1c3f-4d54-94a4-9a90378d2869 | ivandersr/routing-positions-go | internal/route.go | package internal import ( "context" "math" "go.mongodb.org/mongo-driver/bson" "go.mongodb.org/mongo-driver/mongo" "go.mongodb.org/mongo-driver/mongo/options" ) type Route struct { ID string `bson:"_id" json:"id"` Distance int `bson:"distance" … | TOOL | 0.7052525877952576 | 3.3252053260803223 | {"github_metadata":{"branch":"main","commit_count":2,"repo_created_at":"2024-12-12T17:29:07.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"e2e5b3afc6110030a07d63bf3f5c1efb2d9331a4","size_b… |
| 6f7fc34e-c18a-41e8-b7c9-c08f2f14271c | ywz978020607/drmv-miniadmin | files/wiki/lcof2/剑指 Offer II 103. 最少的硬币数目/Solution.go | func coinChange(coins []int, amount int) int { dp := make([]int, amount+1) for i := 1; i <= amount; i++ { dp[i] = amount + 1 } for _, coin := range coins { for j := coin; j <= amount; j++ { dp[j] = min(dp[j], dp[j-coin]+1) } } if dp[amount] > amount { return -1 … | ALGO | 0.9963682889938354 | 5.314982891082764 | {"github_metadata":{"branch":"master","commit_count":44,"repo_created_at":"2023-09-21T13:41:12.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":3,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"b010f35d2ed155f3587e5e8826f11a8988d2e7f2","siz… |
| dc83c83f-5834-4c3d-a718-201f790d0347 | Julineo/codefights | challenge/studyOrSleep.go | /* https://app.codesignal.com/challenge/TgCWyhmmB9rBnf2uY/solutions/NBPvAibS5qHisCGYb You have an exam coming up tomorrow morning, and you're trying to decide how much longer you should keep studying before going to bed. Your uncle, reflecting on his experience in med school, on… | ALGO | 0.9879323840141296 | 4.453036308288574 | {"github_metadata":{"branch":"master","commit_count":223,"repo_created_at":"2018-04-30T21:59:00.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":1,"forks":1,"issues":0,"pull_requests":0},"file_meta":{"content_id":"d100a21491e57b4cd70d524557a6028d548faf1e","si… |
| 631d5a79-5a48-4e8f-a42d-3ce8544e42a7 | kimi987/GoTools | src/github.com/lightpaw/male71/config/data/amount.go | package data import ( "github.com/lightpaw/male7/util/u64" ) func ParseAmount(data string) (*Amount, error) { amt, pct, err := parseAmount(data) if err != nil { return nil, err } if amt == 0 && pct == 0 { return nil, nil } return &Amount{Amount: amt, Percent: pct},… | TOOL | 0.8355432152748108 | 4.214346408843994 | {"github_metadata":{"branch":"master","commit_count":6,"repo_created_at":"2020-09-19T06:04:33.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":1,"forks":1,"issues":0,"pull_requests":0},"file_meta":{"content_id":"0dfc0c2a58797765bbb76e5f9981d883728fa458","size… |
| 629b2b3c-6521-4734-9b11-b327ab4e626f | nico151999/instruction_serialiser | go/instruction_serialiser/divide_node.go | package instruction_serialiser func (n *DivideNode) calculate(parameters map[string]interface{}) (ArithmeticType, error) { var leftVal ArithmeticType { var err error if leftVal, err = n.GetLeftChild().Calculate(parameters); err != nil { return 0, err } } var rightVa… | ALGO | 0.8602901101112366 | 5.67987585067749 | {"github_metadata":{"branch":"main","commit_count":23,"repo_created_at":"2022-01-25T12:25:51.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":2,"forks":1,"issues":7,"pull_requests":0},"file_meta":{"content_id":"a8d23e996df176cdb0fe982c9db79665567ca50b","size_… |
| bd1724ec-2dc9-4024-88e4-370d088a3aa6 | ecspecial/golang-calculator | backend/calculator2/main.go | package main import ( // Импортирование необходимых пакетов "context" "net" "encoding/json" // Для работы с JSON "fmt" // Для форматированного ввода и вывода "log" // Для логирования "net/http" // Для работы с HTTP… | WEB | 0.7924559116363525 | 6.555352687835693 | {"github_metadata":{"branch":"main","commit_count":3,"repo_created_at":"2024-02-18T10:22:09.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"56e1d5f0b22f25d13d11cb65b1ff25bc8d80a01b","size_b… |
| b881466f-6f1b-4b38-8f6e-170c1a56f707 | imlonghao/LeetCode | Algorithms/remove-outermost-parentheses.go | package solution func removeOuterParentheses(S string) string { c := 0 r := "" for _, rune := range S { if rune == '(' { c++ if c > 1 { r += string(rune) } continue } else { c… | ALGO | 0.953665018081665 | 4.452566623687744 | {"github_metadata":{"branch":"master","commit_count":56,"repo_created_at":"2016-06-08T04:41:42.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"b7b38b9555ba870b880a5bfb215ada90d19d54c7","siz… |
| 8e1244b2-d899-43a3-85d1-5d150d69fe9b | skshahriarahmedraka/Top-150-Leetcode-Interview-Question-Golang | Extras/494. Target Sum.go | /* * Author: <NAME> * Email: <EMAIL> * Telegram: https://t.me/shahriarraka * Github: https://github.com/skshahriarahmedraka * StackOverflow: https://stackoverflow.com/users/12216779/ * Linkedin: https://linkedin.com/in/shahriarraka * ----- * Last Modified: * Modified By:… | ALGO | 0.9959381818771362 | 6.217310905456543 | {"github_metadata":{"branch":"main","commit_count":112,"repo_created_at":"2022-07-12T17:48:03.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":2,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"5964d54c8dce27d2668e8939a2be3191546f8ec1","size… |
| 5de3b1e0-167d-4907-8701-496c2ea182f1 | recluse99/lcgo | 204.计数质数.go | /* * @lc app=leetcode.cn id=204 lang=golang * * [204] 计数质数 */ package lcgo // @lc code=start func countPrimes(n int) int { if n < 2 { return 0 } res := make([]int, n) var count = 0 for i := 2; i < n; i++ { res[i] = 1 } // 2 开始 。将2的倍数 去掉 ，下一个… | ALGO | 0.9845848679542542 | 5.56348180770874 | {"github_metadata":{"branch":"master","commit_count":5,"repo_created_at":"2022-09-29T09:46:13.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":1,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"5ef113e67d525dd31fd078de3be95daac681d5a7","size… |
| d506e692-8a6d-41f6-b91b-d53ec11078b8 | klnusbaum/adventofcode2018-go | day12.2/main.go | package main // Start Dec 13 10:35 am // Part 1 Dec 13 11:31 am /* Part 2 Dec 13 14:27 */ import ( "fmt" "github.com/klnusbaum/adventofcode2018/ll" "os" "strings" "unicode/utf8" ) type mask struct { ll bool l bool c bool r bool rr bool } func main() { if err :=… | ALGO | 0.9972694516181946 | 5.409336090087891 | {"github_metadata":{"branch":"master","commit_count":45,"repo_created_at":"2018-12-02T23:08:00.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":1,"forks":0,"issues":1,"pull_requests":0},"file_meta":{"content_id":"68fd8d86b05e0166958d3263693030d4404d9aa5","siz… |
| 79878e08-5823-4b7b-b5ac-a1b10e28b85e | deatil/lakego-admin | pkg/lakego-pkg/go-hash/sm3/block_amd64.go | //go:build !purego package sm3 import "golang.org/x/sys/cpu" // 汇编部分来自于 github.com/emmansun/gmsm/sm3 var useAVX2 = cpu.X86.HasAVX2 && cpu.X86.HasBMI2 var useAVX = cpu.X86.HasAVX var useSSSE3 = cpu.X86.HasSSSE3 //go:noescape func blockAMD64(dig *digest, p []byte) //go:noesca… | ALGO | 0.8267971873283386 | 5.1509270668029785 | {"github_metadata":{"branch":"main","commit_count":692,"repo_created_at":"2021-07-03T07:09:17.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":391,"forks":59,"issues":0,"pull_requests":0},"file_meta":{"content_id":"5f6370b7bca6ad74d11abca55fc548d98beba0c0","s… |
| c47e1cb3-913a-4e99-be82-88e6c667d09a | Nr90/imgsim | hash.go | package imgsim import ( "fmt" "math/bits" ) // Hash contains the perceptual hash stored as bits in a 64 bit unsigned integer. type Hash uint64 func (h Hash) String() string { return fmt.Sprintf("%064b", h) } // Distance calculates the number of different bits in the hash f… | ALGO | 0.9540770649909973 | 3.4364302158355713 | {"github_metadata":{"branch":"master","commit_count":9,"repo_created_at":"2017-09-18T07:43:20.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":75,"forks":5,"issues":0,"pull_requests":0},"file_meta":{"content_id":"0a4dcd36436fe8976bc79990b3b29f39b868250e","siz… |
| 12123bc0-a21b-4f9e-bd22-bbe14b52fe90 | d3zd3z/godump | src/fsid/blkid.go | package fsid import ( "bufio" "fmt" "io" "os" "os/exec" "strings" "syscall" "unicode" ) // Block ID management type Blkid struct { loaded bool entries []*entry byUuid map[string]*entry byDevId map[uint64]*entry } type entry struct { devName string devId uint… | TOOL | 0.6452054977416992 | 3.284663677215576 | {"github_metadata":{"branch":"master","commit_count":53,"repo_created_at":"2014-04-01T07:16:26.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"87ef484a6f7948585ad83382253786dbfb37e458","siz… |
| bc06a385-4325-4e33-9ead-13c170ee98c4 | KaliKaloo/Golang-Labs-2020 | concurrency-lab-1-master/filter/medianFilter.go | package main import ( "flag" "image" "image/jpeg" "image/png" "os" "sort" ) func check(err error) { if err != nil { panic(err) } } func makeMatrix(height, width int) [][]uint8 { matrix := make([][]uint8, height) for i := range matrix { matrix[i] = make([]uint8, w… | DATA | 0.878685474395752 | 4.122624397277832 | {"github_metadata":{"branch":"main","commit_count":5,"repo_created_at":"2020-10-30T15:12:51.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"0d37ae58f73819307f6de1338e4c151bde0be227","size_b… |
| 923a81c5-4cc4-4e80-b58d-7c7483cc24e4 | uar316025/GoPicDissassemble | gpd/instructionMapper.go | package gpd type InstructionMapper struct { operandsTable []*Operand } func NewInstructionMap() *InstructionMapper { return &InstructionMapper{nil} } func (im *InstructionMapper) matchingOpcode(bin int) *Operand { for _, operand := range im.operandsTable { if (bin & opera… | TOOL | 0.6245109438896179 | 5.937666893005371 | {"github_metadata":{"branch":"master","commit_count":2,"repo_created_at":"2018-04-20T07:27:58.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"b566dae4ede4f1e34d0dace59a5b29fefb689ee4","size… |
| a9cb4059-ba28-42f7-8a40-e99ed3b333f7 | onkncn/leetcode_go | 140-wordBreak/main.go | package main import "fmt" type Tree struct { End bool Next []*Tree } func insert(head *Tree, s string) { l := len(s) for i := 0; i < l; i++ { if head.Next[s[i]-'a'] == nil { head.Next[s[i]-'a'] = &Tree{false, make([]*Tree, 26)} } head = head.Next[s[i]-'a'] } he… | ALGO | 0.9930739402770996 | 6.017475605010986 | {"github_metadata":{"branch":"master","commit_count":170,"repo_created_at":"2021-12-17T18:04:48.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":1,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"dad7c2f84b375fc6fc3d9e8f78efc3a90161ab46","si… |
| d8155f68-285a-4f37-b70a-c0ec71fe8c2b | lbbwyt/go | algorithm/quick2sort.go | package main import ( "fmt" ) //一趟快速排序的算法是： //1）设置两个变量i、j，排序开始的时候：i=0，j=N-1； //2）以第一个数组元素作为关键数据，赋值给key，即 key=A[0]； //3）从j开始向前搜索，即由后开始向前搜索（j -- ），找到第一个小于key的值A[j]，A[i]与A[j]交换； //4）从i开始向后搜索，即由前开始向后搜索（i ++ ），找到第一个大于key的A[i]，A[i]与A[j]交换； //5）重复第3、4、5步，直到 I=J； (3,4步是在程序中没找到时候j=j-1，… | ALGO | 0.9960454106330872 | 6.222506999969482 | {"github_metadata":{"branch":"master","commit_count":77,"repo_created_at":"2018-07-19T01:31:11.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"11f6682803d51464ba16cf526d213d0820bc2040","siz… |
| 11c72587-7baf-4f67-a5f8-36cf06a7442f | mouredev/retos-programacion-2023 | Retos/Reto #14 - OCTAL Y HEXADECIMAL [Fácil]/go/ddaniel27.go | package main func main() { println(DecToOctal(15), DecToHex(15)) } func DecToOctal(dec int) string { oct := "" for dec > 0 { oct = string(dec%8+48) + oct dec /= 8 } return oct } func DecToHex(dec int) string { hex := "" for dec > 0 { if dec%16 > 9 { hex = strin… | ALGO | 0.8469708561897278 | 6.30613374710083 | {"github_metadata":{"branch":"main","commit_count":16771,"repo_created_at":"2022-12-22T06:18:51.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":5464,"forks":2961,"issues":3,"pull_requests":0},"file_meta":{"content_id":"2973ee254c8d45b49967f0ebc76ad0b2927f6e5… |
| 975d8ec8-d738-42f9-8f57-aafc3c8bf40a | jrkb6/portal-protocol | go-sdk/circuits/merkletree/merkletree.go | package merkletree import ( "github.com/consensys/gnark/frontend" "github.com/consensys/gnark/std/hash" ) // MerkleProof stores the path, the root hash and a helper for the Merkle proof. type MerkleProof struct { //root of the Merkle tree RootHash frontend.Variable `gnark:… | ALGO | 0.9159610867500305 | 4.214122295379639 | {"github_metadata":{"branch":"main","commit_count":7,"repo_created_at":"2024-01-08T12:18:11.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":3,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"21f5c67fd57b38286f8dd5576b47f9dd62710ee0","size_b… |
| 219aef23-0164-4141-9969-ba7152a53e07 | pongsawn/test-golang-customer | validx/is-nil-or-empty.go | package validx import ( "reflect" "strings" "time" ) func IsNilOrEmpty(v any) bool { if IsNil(v) { return true // skip nil } // check pointer if reflect.TypeOf(v).Kind() == reflect.Ptr { rv := reflect.ValueOf(v) if rv.IsNil() { return true } return IsNilOr… | TOOL | 0.7340347766876221 | 5.863692760467529 | {"github_metadata":{"branch":"main","commit_count":5,"repo_created_at":"2024-04-23T10:43:42.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"c1d2645b006abc4af45a4b4ab46e74da5592282c","size_b… |
| 1ad1c163-dc55-4a8f-93a9-e5c8f016771c | ishandutta2007/challenges | kattis/modulo.go | /* Given two integers A and B, A modulo B is the remainder when dividing A by B. For example, the numbers 7, 14, 27 and 38 become 1, 2, 0 and 2, modulo 3. Write a program that accepts 10 numbers as input and outputs the number of distinct numbers in the input, if the numbers are… | ALGO | 0.956376314163208 | 6.27407169342041 | {"github_metadata":{"branch":"master","commit_count":1,"repo_created_at":"2022-10-30T08:27:19.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":5,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"2df7142f0c64da92d78650289a49a014602c4e3a","size… |
| a91612ed-66cf-4f3a-a3b9-df400b9a67bc | xcel3011/leetcode-go | 1080_sufficientSubset_mid.go | package leetcode_go /** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */ func sufficientSubset(root *TreeNode, limit int) *TreeNode { if root == nil { return nil } limit -= root.Val // 当ro… | ALGO | 0.9930332899093628 | 5.847834587097168 | {"github_metadata":{"branch":"main","commit_count":235,"repo_created_at":"2021-10-18T03:20:19.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"ce6d04b677bdf0399b9415752ae52dcd809c72b2","size… |
| fe1068d9-2795-4083-91d8-1e25d307387b | ching631108/leetcode-exercise | 1002/answer.go | package main import ( "math" ) func commonChars(A []string) []string { result := []string{} var targetStr string // 寻找最短的字符串 minLength := math.MaxInt64 for _, str := range A { if len(str) < minLength { targetStr = str minLength = len(str) } } // 遍历长度最短的字符串，拼接返… | ALGO | 0.9923646450042725 | 5.608362197875977 | {"github_metadata":{"branch":"master","commit_count":18,"repo_created_at":"2020-09-05T03:58:51.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":1,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"9959d544c4ef604e7b57a3a9aa397c4139e8a282","siz… |
| 1b3e839a-0ecc-4b4a-8423-5559e87e4c13 | luliyucoordinate/Leetcode | src/1202-Smallest-String-With-Swaps/1202.go | var p []int func smallestStringWithSwaps(s string, pairs [][]int) string { p = make([]int, len(s)) for i := 0; i < len(s); i++ { p[i] = i } for _, v := range pairs { px, py := find(v[0]), find(v[1]) if px != py { p[px] = p… | ALGO | 0.9987369179725647 | 6.413782596588135 | {"github_metadata":{"branch":"master","commit_count":1055,"repo_created_at":"2018-05-09T12:30:59.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":1490,"forks":481,"issues":0,"pull_requests":0},"file_meta":{"content_id":"a40c81421e3cd4583918b0af8717bb0a916ef04… |
| e2eaaa71-253d-4da2-9e8f-ca1337cd7f28 | OkDenAl/golex | automata_compiler_v2.go | package main import ( "strconv" "unicode" ) const endSymbol = unicode.MaxRune type Pos struct { followPos []int } var ( naming = map[int]string{} flPos = make(map[int]Pos) letters = make(map[rune]map[int]struct{}) ) func (f *FiniteAutomata) CompileV2() *FiniteAutoma… | ALGO | 0.9866873025894165 | 3.8848791122436523 | {"github_metadata":{"branch":"main","commit_count":40,"repo_created_at":"2024-10-29T20:53:18.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"e1a5d43c138e358e7dc3541b64073b3adc03038b","size_… |
| 317bf7c7-a74c-4174-a780-dc799dbaafa0 | Vystii/sr1-go | optimizer/linesearch.go | package optimizer import "gonum.org/v1/gonum/mat" func backtrackingLineSearch(x, p, grad *mat.VecDense, f func(*mat.VecDense) float64) float64 { alpha := 1.0 rho := 0.5 c := 1e-4 f0 := f(x) gradDotP := mat.Dot(grad, p) var xNew mat.VecDense for { xNew.AddScaledVec(x,… | ALGO | 0.9928448796272278 | 4.809953689575195 | {"github_metadata":{"branch":"1x","commit_count":1,"repo_created_at":"2025-06-22T09:34:03.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"c09600a4be77ddb81cc592a1570b9e844af77522","size_byt… |
| 435b5aa3-4f3a-41c0-aea9-d1f6f0294646 | Tarhche/backend | infrastructure/runner/scheduler/greedy/greedy.go | package greedy import ( "math" "time" "github.com/khanzadimahdi/testproject/domain/runner/node" "github.com/khanzadimahdi/testproject/domain/runner/task" ) type Greedy struct{} var _ task.Scheduler = &Greedy{} func New() *Greedy { return &Greedy{} } func (g *Greedy) Pi… | ALGO | 0.9878196716308594 | 4.029996395111084 | {"github_metadata":{"branch":"main","commit_count":332,"repo_created_at":"2023-07-27T19:34:47.000Z","is_fork":false,"is_org_owned":true,"forked_from":null,"stars":3,"forks":1,"issues":0,"pull_requests":0},"file_meta":{"content_id":"359e2581682c4f6bc1c40b69855cda5d96ea93e2","size_… |
| 2cbb282e-3701-45c4-887f-78bfa7707289 | kapablanca/Go | index.go | package piscine // Function that returns the index of the first instance // of toFind in s, or -1 if toFind not present in s func Index(s string, toFind string) int { n := len(toFind) for i := 0; i < len(s)-n; i++ { if s[i:i+n] == toFind { return i } } return -1 } | ALGO | 0.9750775694847107 | 5.179135322570801 | {"github_metadata":{"branch":"master","commit_count":524,"repo_created_at":"2024-06-18T09:07:02.000Z","is_fork":false,"is_org_owned":false,"forked_from":null,"stars":0,"forks":0,"issues":0,"pull_requests":0},"file_meta":{"content_id":"f7a34a0c750972a204a2b9874a604270e3d2f17e","si… |
| 02e5cea0-fdf0-438e-a329-9d39d341bb62 | readium/go-toolkit | pkg/manifest/utils.go | package manifest import ( "fmt" "time" "github.com/readium/go-toolkit/pkg/internal/extensions" ) func parseSliceOrString(value interface{}, deduplicate bool) (result []string, err error) { switch v := value.(type) { case string: result = []string{v} // Just a single ite… | TOOL | 0.7159493565559387 | 4.573308944702148 | {"github_metadata":{"branch":"develop","commit_count":356,"repo_created_at":"2016-10-12T11:16:39.000Z","is_fork":false,"is_org_owned":true,"forked_from":null,"stars":57,"forks":17,"issues":10,"pull_requests":1},"file_meta":{"content_id":"c3e029f068e5551a48eee807ca43e34660a28e4f",… |
