golang package name

# golang 에서 package(module)명은 지을 때 소문자로 모두 붙여쓰라고 한다.

# https://go.dev/blog/package-names

# camel_case, snake_case 등은 사용하지 말고

computeServiceClient

priority_queue

# 다음과 같이 소문자로만 의미있게 축약하는것이 좋다고 한다.

strconv (string conversion)

syscall (system call)

fmt (formatted I/O)

# k8s 소스에서 package 를 검색해봤다.(정규식에서 길이 조건을 쓸수 없다.)

# syscall 처럼 의미 있게 축약되면 좋지만 client, pod 이런 단어가 조합되는 경우 축약이 힘들어 보인다.

https://github.com/search?q=repo%3Akubernetes%2Fkubernetes+%2F%5Epackage+client%2F&type=code

# k8s 소스를 다운받아 package 이름 긴것들을 확인해 보면 이렇다.

# 소문자까지는 좋은데 넘 길면 갠적으로 snake_case 가 더 눈에 잘 들어온다.

rg -IN "^package [[:alpha:]]{10,50}$" | awk '{print length, $0}' | sort -r | uniq | head -10

40 package validatingadmissionpolicybinding

39 package validatingadmissionpolicystatus

38 package validatingwebhookconfiguration

37 package prereleaselifecyclegenerators

37 package externalaccountauthorizeduser

36 package storageobjectinuseprotection

36 package mutatingwebhookconfiguration

34 package prioritylevelconfiguration

34 package extendedresourcetoleration

34 package clusterauthenticationtrust

Algorithm

# sorting 구현

https://github.com/ysoftman/test_code/blob/master/cpp/sort_test.cpp

# GCD GCD(greatest common divisor) 최대 공약수 구하기

https://github.com/ysoftman/test_code/blob/master/cpp/gcd_test.cpp

# fibonacci 수열구하기

https://github.com/ysoftman/test_code/blob/master/cpp/fibonacci_test.cpp

# factorial

https://github.com/ysoftman/test_code/blob/master/cpp/factorial_test.cpp

# binary search

https://github.com/ysoftman/test_code/blob/master/cpp/binary_search_test.cpp

# primer number 찾기

https://github.com/ysoftman/test_code/blob/master/cpp/prime_number_test.cpp

# prime number 찾기(Eratosthenes(에라토스테네스의 체) 방법으로 소수 구하기)

https://github.com/ysoftman/test_code/blob/master/golang/prime_number/prime_number_eratosthenes.go

# 무한소수 체크

https://github.com/ysoftman/test_code/blob/master/golang/util/util.go#L98

# Levenshtein-Distance 알고리즘 구현

https://github.com/ysoftman/test_code/blob/master/cpp/levenshtein_distance_test.cpp

실행결과화면 replace cost 를 1로 했을때

# K-Means Clustering

https://github.com/ysoftman/test_code/blob/master/cpp/k_means_clustering_test.cpp

# Dijkstra (다익스트라) 알고리즘으로 최단경로 찾기

https://github.com/ysoftman/test_code/blob/master/cpp/dijkstra_test.cpp

# 통계 값 계산

https://github.com/ysoftman/test_code/blob/master/cpp/statistics_test.cpp

# precision/recall

https://github.com/ysoftman/test_code/blob/master/cpp/precision_recall_test.cpp

# elo rating

https://github.com/ysoftman/test_code/blob/master/cpp/elo_rating_test.cpp

# anagram

https://github.com/ysoftman/test_code/blob/master/golang/anagram/anagram.go

# largest possible combined number

https://github.com/ysoftman/test_code/blob/master/golang/largest_possible_combined_number/largest_possible_combined_number.go

# codility_demo_find_equilibrium_index

https://github.com/ysoftman/codingtest/blob/master/codility/codility_demo_find_equilibrium_index.cpp