MCPcopy Create free account

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

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

⨍ Functions 280◇ Types & classes 21
↓ 1 callersFunctionraid1b
(x, y int)
raid03/main.go:97
↓ 1 callersFunctionraid1c
(x, y int)
raid03/main.go:124
↓ 1 callersFunctionraid1d
(x, y int)
raid03/main.go:151
↓ 1 callersFunctionraid1e
(x, y int)
raid03/main.go:178
↓ 1 callersFunctionsetPoint
(ptr *point)
QUEST-08/point/main.go:12
↓ 1 callersFunctionsolve
(nb int, pos [8]int)
QUEST-04/eightqueens.go:21
↓ 1 callersFunctionstrLen
(s string)
random-prep/printnbrbase.go:56
↓ 1 callersFunctionswap
(vow []rune)
QUEST-06/rotatevowels/main.go:55
FunctionAbort
* import "fmt" func main(){ fmt.Println(Abort(2,2,3,6,4)) }*/ * func Abort(a, b, c, d, e int) int { array := []int{a, b, c, d, e} length := 0 fo
hackaton/abort.go:30
FunctionActiveBits
(n int)
hackaton/activebits.go:3
FunctionAdd2_node
(node *NodeL)
QUEST-11/listforeach.go:15
FunctionAdvancedSortWordArr
(array []string, f func(a, b string) int)
hackaton/advancedsortwordarr.go:3
FunctionAlphaCount
(str string)
QUEST-05/alphacount.go:3
FunctionAny
(f func(string) bool, arr []string)
QUEST-09/any.go:3
FunctionAppendRange
(min, max int)
QUEST-07/appendrange.go:3
FunctionAtoi
(s string)
QUEST-03/atoi.go:3
FunctionAtoiBase
(s string, base string)
QUEST-07/atoibase.go:3
FunctionBTreeApplyByLevel
(root *TreeNode, f func(...interface{}) (int, error))
qwerty/btreeapplybylevel.go:3
FunctionBTreeApplyByLevel
(root *TreeNode, f func(...interface{}) (int, error))
QUEST-12/btreeapplybylevel.go:3
FunctionBTreeApplyPostorder
(root *TreeNode, f func(...interface{}) (int, error))
QUEST-12/btreeapplypostorder.go:3
FunctionBTreeApplyPreorder
(root *TreeNode, f func(...interface{}) (int, error))
QUEST-12/btreeapplypreorder.go:3
FunctionBTreeInsertData
(root *TreeNode, data string)
qwerty/btreeapplybylevel.go:42
FunctionBTreeInsertData
(root *TreeNode, data string)
QUEST-12/btreeapplybylevel.go:42
FunctionBTreeInsertData
(root *TreeNode, data string)
QUEST-12/btreelevelcount.go:20
FunctionBTreeInsertData
(root *TreeNode, data string)
QUEST-12/btreesearchitem.go:22
FunctionBTreeInsertData
(root *TreeNode, data string)
QUEST-12/btreeisbinary.go:20
FunctionBTreeInsertData
(root *TreeNode, data string)
QUEST-12/btreeinsertdata.go:8
FunctionBTreeIsBinary
(root *TreeNode)
QUEST-12/btreeisbinary.go:3
FunctionBTreeLevelCount
(root *TreeNode)
QUEST-12/btreelevelcount.go:3
FunctionBTreeSearchItem
(root *TreeNode, elem string)
QUEST-12/btreesearchitem.go:8
FunctionBasicAtoi
(s string)
QUEST-03/basicatoi.go:15
FunctionBasicAtoi2
(s string)
QUEST-03/basicatoi2.go:3
FunctionBasicJoin
(strs []string)
QUEST-05/basicjoin.go:3
FunctionCapitalize
(s string)
QUEST-05/capitalize.go:10
FunctionCollatzCountdown
(start int)
hackaton/collatzcountdown.go:3
FunctionCompStr
(a, b interface{})
QUEST-11/listfind.go:3
FunctionCompact
(ptr *[]string)
hackaton/compact.go:3
FunctionCompare
(a, b string)
QUEST-05/compare.go:3
FunctionConcat
(str1 string, str2 string)
QUEST-05/concat.go:3
FunctionConcatParams
(args []string)
QUEST-07/concatparams.go:3
FunctionConvertBase
(nbr, baseFrom, baseTo string)
QUEST-07/convertbase.go:3
FunctionCountIf
(f func(string) bool, tab []string)
QUEST-09/countif.go:3
FunctionDivMod
(a int, b int, div *int, mod *int)
QUEST-03/divmod.go:3
FunctionEnigma
* func Enigma(a ***int, b *int, c *******int, d ****int) { y := *******c *******c = ***a t := ****d ****d = y g := *b *b = t ***a = g } */
hackaton/enigma.go:18
FunctionFibonacci
(index int)
QUEST-04/fibonacci.go:3
FunctionFindNextPrime
(nb int)
QUEST-04/findnextprime.go:3
FunctionFirstRune
(s string)
QUEST-05/firstrune.go:3
FunctionForEach
(f func(int), arr []int)
QUEST-09/foreach.go:3
FunctionIndex
(s string, toFind string)
QUEST-05/index.go:3
FunctionIsAlpha
(str string)
QUEST-05/isalpha.go:3
FunctionIsLower
(str string)
QUEST-05/islower.go:10
FunctionIsNegative
(nb int)
QUEST-02/isnegative.go:5
FunctionIsNegative_node
(node *NodeL)
QUEST-11/listforeachif.go:13
FunctionIsNotNumeric_node
(node *NodeL)
QUEST-11/listforeachif.go:23
FunctionIsNumeric
(str string)
QUEST-05/isnumeric.go:10
FunctionIsPositive_node
(node *NodeL)
QUEST-11/listforeachif.go:3
FunctionIsPrintable
(str string)
QUEST-05/isprintable.go:10
FunctionIsSorted
(f func(a, b int) int, tab []int)
QUEST-09/issorted.go:3
FunctionIsUpper
(str string)
QUEST-05/isupper.go:10
FunctionIterativeFactorial
(nb int)
QUEST-04/iterativefactorial.go:3
FunctionIterativePower
(nb int, power int)
QUEST-04/iterativepower.go:3
FunctionJoin
(strs []string, sep string)
QUEST-05/join.go:3
FunctionLastRune
(s string)
QUEST-05/lastrune.go:3
FunctionListAt
(l *NodeL, pos int)
QUEST-11/listat.go:3
FunctionListClear
(l *List)
QUEST-11/listclear.go:3
FunctionListFind
(l *List, ref interface{}, comp func(a, b interface{}) bool)
QUEST-11/listfind.go:7
FunctionListForEach
(l *List, f func(*NodeL))
QUEST-11/listforeach.go:3
FunctionListForEachIf
(l *List, f func(*NodeL), cond func(*NodeL) bool)
QUEST-11/listforeachif.go:33
FunctionListLast
(l *List)
QUEST-11/listlast.go:3
FunctionListMerge
* func ListMerge(l1 *List, l2 *List) { a := l1.Head b := l2.Head for a == nil && l2 != nil { l1.Head = l2.Head l1.Tail = l2.Tail } for a !=
QUEST-11/listmerge.go:23
FunctionListPushBack
(l *List, data interface{})
QUEST-11/listpushback.go:13
FunctionListPushFront
(l *List, data interface{})
QUEST-11/listpushfront.go:3
FunctionListRemoveIf
(l *List, data_ref interface{})
QUEST-11/listremoveif.go:3
FunctionListReverse
(l *List)
QUEST-11/listreverse.go:3
FunctionListSize
(l *List)
random-prep/listsize.go:20
FunctionListSize
(l *List)
QUEST-11/listsize.go:3
FunctionListSort
(l *NodeI)
QUEST-11/listsort.go:8
FunctionMakeRange
(min, max int)
QUEST-07/makerange.go:3
FunctionMap
(f func(int) bool, arr []int)
QUEST-09/map.go:3
FunctionMax
(arr []int)
hackaton/max.go:3
FunctionNRune
(s string, n int)
QUEST-05/nrune.go:3
FunctionNewReaer
(s string)
random-prep/test.go:15
FunctionPointOne
(n *int)
QUEST-03/pointone.go:3
FunctionPrintComb
()
QUEST-02/combi.go:8
FunctionPrintComb123
()
QUEST-02/combi.go:32
FunctionPrintComb2
()
QUEST-02/printcomb2.go:5
FunctionPrintCombN
(n int)
QUEST-02/printcombn.go:57
FunctionPrintNbr
(n int)
QUEST-02/printnumberr.go:7
FunctionPrintNbr
(n int)
QUEST-02/ntbrAlibi.go:7
FunctionPrintNbr
(n int)
QUEST-02/printnbr.go:28
FunctionPrintNbr444
(n int)
QUEST-02/ntbrAlibi.go:27
FunctionPrintNbrBase
(nbr int, base string)
QUEST-05/printnbrbase.go:5
FunctionPrintNbrInOrder
(n int)
QUEST-05/printnbrinorder.go:7
FunctionPrintNbrInOrder1
(n int)
QUEST-05/printnbrinorder1.go:5
FunctionPrintStr
(str string)
QUEST-03/printstr.go:7
FunctionPrintWordsTables
(table []string)
QUEST-07/printwordstables.go:5
FunctionRaid1a
(x, y int)
raid01/raid1a.go:7
FunctionRaid1b
(x, y int)
raid01/raid1b.go:7
FunctionRaid1c
(x, y int)
raid01/raid1c.go:7
FunctionRecursiveFactorial
(nb int)
QUEST-04/recursivefactorial.go:3
← previousnext →101–200 of 280, ranked by callers