Functions — github.com/altyn-bulmers/piscine-go

hub / github.com/altyn-bulmers/piscine-go / functions

Functions280 in github.com/altyn-bulmers/piscine-go

⨍ Functions 280◇ Types & classes 21

↓ 15 callersFunctionf

(a, b int)

QUEST-09/issorted.go:27

↓ 7 callersFunctioninsert

(root *node, elem int)

random-prep/binar.go:10

↓ 4 callersFunctionPrintStr

(str string)

hackaton/fixthemain/main.go:9

↓ 4 callersFunctionshow

(n int, table [9]int, tmax [9]int)

QUEST-02/printcombn23123123.go:7

↓ 3 callersFunctionaddNodeEnd

(newPerson, personList *person)

random-prep/student.go:36

↓ 3 callersFunctioncheck

(a rune)

QUEST-05/capitalize.go:3

↓ 3 callersFunctioninsert

(head *node, data int)

random-prep/example.go:10

↓ 2 callersFunctionAtoi

(s string)

QUEST-09/doop/main.go:97

↓ 2 callersFunctionBTreeApplyInorder

(root *TreeNode, f func(...interface{}) (int, error))

QUEST-12/btreeapplyinorder.go:8

↓ 2 callersFunctionCloseDoor

(ptrDoor *Door)

hackaton/fixthemain/main.go:23

↓ 2 callersFunctionIntoRune

(n int)

QUEST-08/point/main.go:60

↓ 2 callersFunctionLength

(a interface{})

QUEST-07/atoibase.go:36

↓ 2 callersFunctionListSort

(l *NodeI)

QUEST-11/sortedlistmerge.go:27

↓ 2 callersFunctionOpenDoor

(ptrDoor *Door)

hackaton/fixthemain/main.go:17

↓ 2 callersFunctionPow

(a, b int)

QUEST-03/basicatoi.go:3

↓ 2 callersFunctionatoi

(s string)

random-prep/gcd.go:89

↓ 2 callersFunctionche

(v int)

QUEST-02/peerreview.go:5

↓ 2 callersFunctionche

(v int)

QUEST-02/printcombn.go:6

↓ 2 callersFunctionmakeUnique

(slice []int)

random-prep/gcd.go:31

↓ 2 callersFunctionmy_check

(p int)

QUEST-02/peerreview.go:24

↓ 2 callersFunctionmy_check

(p int)

QUEST-02/printcombn.go:25

↓ 2 callersFunctionprimes

(n int)

random-prep/gcd.go:68

↓ 2 callersFunctionprintNbr

(n int)

raid03/main.go:205

↓ 2 callersFunctionprintStr

(str string)

QUEST-08/boolean/main.go:25

↓ 2 callersFunctionstrLen

(s string)

random-prep/atoibase.go:42

↓ 2 callersFunctionstrLen

(s string)

random-prep/longsplit.go:47

↓ 1 callersFunctionA

()

QUEST-02/printnumberr.go:28

↓ 1 callersFunctionAiBase

(s string, base string)

QUEST-07/convertbase.go:8

↓ 1 callersFunctionAtoi

(s string)

QUEST-08/ztail/main.go:36

↓ 1 callersFunctionAtoiBase

(s string, base string)

random-prep/atoibase.go:9

↓ 1 callersFunctionBTreeLevelCount

(root *TreeNode)

qwerty/btreeapplybylevel.go:25

↓ 1 callersFunctionBTreeLevelCount

(root *TreeNode)

QUEST-12/btreeapplybylevel.go:25

↓ 1 callersFunctionBaseRecursion

(nbr int, runes []rune, base int)

random-prep/itoabase.go:36

↓ 1 callersFunctionBaseRecursion

(n int, runes []rune, len int)

random-prep/test1.go:35

↓ 1 callersFunctionBaseRecursion

(n int, runes []rune, len int)

random-prep/printnbrbase.go:43

↓ 1 callersFunctionBaseRecursion

(n int, runes []rune, len int)

QUEST-05/printnbrbase.go:38

↓ 1 callersFunctionEightQueens

()

QUEST-04/eightqueens.go:37

↓ 1 callersFunctionFirstRune

(s string)

random-prep/firstruneprog.go:13

↓ 1 callersFunctionIsDoorClose

(ptrDoor *Door)

hackaton/fixthemain/main.go:34

↓ 1 callersFunctionIsDoorOpen

(ptrDoor *Door)

hackaton/fixthemain/main.go:29

↓ 1 callersFunctionIsPrime

(nb int)

QUEST-04/isprime.go:3

↓ 1 callersFunctionIsSafe

(qn int, rp int, pos [8]int)

QUEST-04/eightqueens.go:11

↓ 1 callersFunctionItoaBase

(value, base int)

random-prep/itoabase.go:11

↓ 1 callersFunctionItoaBase

(value, base int)

random-prep/test1.go:10

↓ 1 callersFunctionListSort

(l *NodeI)

QUEST-11/sortlistinsert.go:28

↓ 1 callersFunctionOrder

(array []rune)

QUEST-06/flags/main.go:82

↓ 1 callersFunctionPNBase

(nbr int, base string)

QUEST-07/convertbase.go:63

↓ 1 callersFunctionPRune

(str string)

QUEST-07/printwordstables.go:11

↓ 1 callersFunctionPrintComb

()

QUEST-02/printcomb.go:5

↓ 1 callersFunctionPrintComb2

()

QUEST-02/com2.go:5

↓ 1 callersFunctionPrintComb333

()

QUEST-02/combi.go:61

↓ 1 callersFunctionPrintCombN

(n int)

QUEST-02/printcombn23123123.go:27

↓ 1 callersFunctionPrintCombN

(n int)

QUEST-02/peerreview.go:56

↓ 1 callersFunctionPrintList

(head *node)

random-prep/example.go:21

↓ 1 callersFunctionPrintNbr123

(n int)

QUEST-02/ntbrAlibi.go:64

↓ 1 callersFunctionPrintTree

(root *node)

random-prep/binar.go:23

↓ 1 callersFunctionRaid1d

(x, y int)

raid01/raid1d.go:11

↓ 1 callersMethodRead

(b []byte)

random-prep/test.go:23

↓ 1 callersFunctionSort

(table []int)

QUEST-05/printnbrinorder.go:23

↓ 1 callersFunctionSortIntegerTable

(table []int)

random-prep/sorting.go:11

↓ 1 callersFunctionSplit

(str, charset string)

random-prep/longsplit.go:11

↓ 1 callersFunctionStrLength

(str string)

QUEST-05/printnbrbase.go:49

↓ 1 callersFunctionSwap

(a *int, b *int)

random-prep/sorting.go:22

↓ 1 callersFunctionSwap

(a *int, b *int)

QUEST-03/swap.go:3

↓ 1 callersFunctionapply

(f func(int, int) int, a int, b int)

QUEST-09/doop/main.go:93

↓ 1 callersFunctionapplyLevel

(root *TreeNode, level int, f func(...interface{}) (int, error))

qwerty/btreeapplybylevel.go:12

↓ 1 callersFunctionapplyLevel

(root *TreeNode, level int, f func(...interface{}) (int, error))

QUEST-12/btreeapplybylevel.go:12

↓ 1 callersFunctionarrange

arrange from second number to the first * 3.0. 0 1 2 3 0 3 3 2 1 0 2 -3 -3 -2 -1 0 1 2 */

random-prep/arrange.go:24

↓ 1 callersFunctionatoi

(runes []rune)

QUEST-05/trimatoi.go:22

↓ 1 callersFunctioncheck

(r int)

QUEST-08/point/main.go:39

↓ 1 callersFunctioncheck

(r int)

QUEST-02/printnbr.go:7

↓ 1 callersFunctioncheckInput

(args []string)

raid02/main.go:39

↓ 1 callersFunctioncheck_ok

(p int)

QUEST-02/peerreview.go:36

↓ 1 callersFunctioncheck_ok

(p int)

QUEST-02/printcombn.go:37

↓ 1 callersFunctionchecklow

(a rune)

QUEST-05/islower.go:3

↓ 1 callersFunctionchecknum

(a rune)

QUEST-05/isnumeric.go:3

↓ 1 callersFunctioncheckprint

(a rune)

QUEST-05/isprintable.go:3

↓ 1 callersFunctioncheckup

(a rune)

QUEST-05/isupper.go:3

↓ 1 callersFunctioncounter

(output []rune)

raid03/main.go:10

↓ 1 callersFunctionfillTable

fills with input arguments

raid02/main.go:66

↓ 1 callersFunctionisDots

counts remaining empty cells

raid02/main.go:76

↓ 1 callersFunctionisEven

(nbr int)

QUEST-08/boolean/main.go:39

↓ 1 callersFunctionisPrime

* func primes(n int) { for n%2 == 0 { fmt.Print("2 * ") n /= 2 } for i := 3; i*i <= n; i += 2 { for n%i == 0 { fmt.Printf("%d * ", i)

random-prep/fprime.go:31

↓ 1 callersFunctionisPrime

(n int)

random-prep/testmyprime.go:35

↓ 1 callersFunctionisPrime

(nb int)

random-prep/gcd.go:50

↓ 1 callersFunctionisSeparator

(r rune)

QUEST-07/splitwhitespaces.go:35

↓ 1 callersFunctionisSolve

backtracking solver

raid02/main.go:119

↓ 1 callersFunctionisValid

check if it fits

raid02/main.go:89

↓ 1 callersFunctionlistPushBackNode

(l *NodeI, data int)

QUEST-11/sortlistinsert.go:14

↓ 1 callersFunctionmove

(l *NodeI)

QUEST-11/listsort.go:22

↓ 1 callersFunctionmove

(l *NodeI)

QUEST-11/sortlistinsert.go:43

↓ 1 callersFunctionmove

(l *NodeI)

QUEST-11/sortedlistmerge.go:42

↓ 1 callersFunctionpartition

(table []int, l int, r int)

QUEST-03/sortingintegertable-notmy.go:3

↓ 1 callersFunctionpow

(a int, b int)

QUEST-07/convertbase.go:51

↓ 1 callersFunctionprimes

* func primes(n int) { for n%2 == 0 { fmt.Print("2 * ") n /= 2 } for i:=3; i*i <= n; i += 2 { if n%i == 0 { fmt. Printf("%d * ", i) n /

random-prep/fprime.go:68

↓ 1 callersFunctionprimes

(n int)

random-prep/testmyprime.go:11

↓ 1 callersFunctionprintComb1

()

QUEST-02/printcombn23123123.go:18

↓ 1 callersFunctionprintList

(personList *person)

random-prep/student.go:30

↓ 1 callersFunctionquickSort

(table []int, l int, r int)

QUEST-03/sortingintegertable-notmy.go:22

↓ 1 callersFunctionraid1a

(x, y int)

raid03/main.go:70

next →1–100 of 280, ranked by callers