>= 31\\n\\tlbelow14 = l - 14\\n\\n\\tlbelow14 >>= 31\\n\\tp += lbelow13\\n\\tlbelow15 = l - 15\\n\\n\\tm30 = uint32(m[p+12])\\n\\tlbelow15 >>= 31\\n\\tp += lbelow14\\n\\n\\tm31 = uint32(m[p+13])\\n\\tp += lbelow15\\n\\tm2 += int64(m23)\\n\\n\\tm32 = uint32(m[p+14])\\n\\tm30 &^= uint32(lbelow13)\\n\\tlbelow12 -= lbelow13\\n\\n\\tm30 += uint32(lbelow12)\\n\\tlbelow13 -= lbelow14\\n\\n\\tm3 += int64(m30)\\n\\tm31 &^= uint32(lbelow14)\\n\\n\\tm31 += uint32(lbelow13)\\n\\tm32 &^= uint32(lbelow15)\\n\\n\\tm31 <<= 8\\n\\tlbelow14 -= lbelow15\\n\\n\\tm3 += int64(m31)\\n\\tm32 += uint32(lbelow14)\\n\\td0 = m0\\n\\n\\tm32 <<= 16\\n\\tm33 = uint64(lbelow15 + 1)\\n\\td1 = m1\\n\\n\\tm33 <<= 24\\n\\tm3 += int64(m32)\\n\\td2 = m2\\n\\n\\tm3 += int64(m33)\\n\\td3 = m3\\n\\n\\tz3 = math.Float64frombits(uint64(d3))\\n\\n\\tz2 = math.Float64frombits(uint64(d2))\\n\\n\\tz1 = math.Float64frombits(uint64(d1))\\n\\n\\tz0 = math.Float64frombits(uint64(d0))\\n\\n\\tz3 -= alpha96\\n\\n\\tz2 -= alpha64\\n\\n\\tz1 -= alpha32\\n\\n\\tz0 -= alpha0\\n\\n\\th5 += z3\\n\\n\\th3 += z2\\n\\n\\th1 += z1\\n\\n\\th0 += z0\\n\\n\\ty7 = h7 + alpha130\\n\\n\\ty6 = h6 + alpha130\\n\\n\\ty1 = h1 + alpha32\\n\\n\\ty0 = h0 + alpha32\\n\\n\\ty7 -= alpha130\\n\\n\\ty6 -= alpha130\\n\\n\\ty1 -= alpha32\\n\\n\\ty0 -= alpha32\\n\\n\\ty5 = h5 + alpha96\\n\\n\\ty4 = h4 + alpha96\\n\\n\\tx7 = h7 - y7\\n\\ty7 *= scale\\n\\n\\tx6 = h6 - y6\\n\\ty6 *= scale\\n\\n\\tx1 = h1 - y1\\n\\n\\tx0 = h0 - y0\\n\\n\\ty5 -= alpha96\\n\\n\\ty4 -= alpha96\\n\\n\\tx1 += y7\\n\\n\\tx0 += y6\\n\\n\\tx7 += y5\\n\\n\\tx6 += y4\\n\\n\\ty3 = h3 + alpha64\\n\\n\\ty2 = h2 + alpha64\\n\\n\\tx0 += x1\\n\\n\\tx6 += x7\\n\\n\\ty3 -= alpha64\\n\\tr3low = r3low_stack\\n\\n\\ty2 -= alpha64\\n\\tr0low = r0low_stack\\n\\n\\tx5 = h5 - y5\\n\\tr3lowx0 = r3low * x0\\n\\tr3high = r3high_stack\\n\\n\\tx4 = h4 - y4\\n\\tr0lowx6 = r0low * x6\\n\\tr0high = r0high_stack\\n\\n\\tx3 = h3 - y3\\n\\tr3highx0 = r3high * x0\\n\\tsr1low = sr1low_stack\\n\\n\\tx2 = h2 - y2\\n\\tr0highx6 = r0high * x6\\n\\tsr1high = sr1high_stack\\n\\n\\tx5 += y3\\n\\tr0lowx0 = r0low * x0\\n\\tr1low = r1low_stack\\n\\n\\th6 = r3lowx0 + r0lowx6\\n\\tsr1lowx6 = sr1low * x6\\n\\tr1high = r1high_stack\\n\\n\\tx4 += y2\\n\\tr0highx0 = r0high * x0\\n\\tsr2low = sr2low_stack\\n\\n\\th7 = r3highx0 + r0highx6\\n\\tsr1highx6 = sr1high * x6\\n\\tsr2high = sr2high_stack\\n\\n\\tx3 += y1\\n\\tr1lowx0 = r1low * x0\\n\\tr2low = r2low_stack\\n\\n\\th0 = r0lowx0 + sr1lowx6\\n\\tsr2lowx6 = sr2low * x6\\n\\tr2high = r2high_stack\\n\\n\\tx2 += y0\\n\\tr1highx0 = r1high * x0\\n\\tsr3low = sr3low_stack\\n\\n\\th1 = r0highx0 + sr1highx6\\n\\tsr2highx6 = sr2high * x6\\n\\tsr3high = sr3high_stack\\n\\n\\tx4 += x5\\n\\tr2lowx0 = r2low * x0\\n\\n\\th2 = r1lowx0 + sr2lowx6\\n\\tsr3lowx6 = sr3low * x6\\n\\n\\tx2 += x3\\n\\tr2highx0 = r2high * x0\\n\\n\\th3 = r1highx0 + sr2highx6\\n\\tsr3highx6 = sr3high * x6\\n\\n\\tr1highx4 = r1high * x4\\n\\n\\th4 = r2lowx0 + sr3lowx6\\n\\tr1lowx4 = r1low * x4\\n\\n\\tr0highx4 = r0high * x4\\n\\n\\th5 = r2highx0 + sr3highx6\\n\\tr0lowx4 = r0low * x4\\n\\n\\th7 += r1highx4\\n\\tsr3highx4 = sr3high * x4\\n\\n\\th6 += r1lowx4\\n\\tsr3lowx4 = sr3low * x4\\n\\n\\th5 += r0highx4\\n\\tsr2highx4 = sr2high * x4\\n\\n\\th4 += r0lowx4\\n\\tsr2lowx4 = sr2low * x4\\n\\n\\th3 += sr3highx4\\n\\tr0lowx2 = r0low * x2\\n\\n\\th2 += sr3lowx4\\n\\tr0highx2 = r0high * x2\\n\\n\\th1 += sr2highx4\\n\\tr1lowx2 = r1low * x2\\n\\n\\th0 += sr2lowx4\\n\\tr1highx2 = r1high * x2\\n\\n\\th2 += r0lowx2\\n\\tr2lowx2 = r2low * x2\\n\\n\\th3 += r0highx2\\n\\tr2highx2 = r2high * x2\\n\\n\\th4 += r1lowx2\\n\\tsr3lowx2 = sr3low * x2\\n\\n\\th5 += r1highx2\\n\\tsr3highx2 = sr3high * x2\\n\\n\\th6 += r2lowx2\\n\\n\\th7 += r2highx2\\n\\n\\th0 += sr3lowx2\\n\\n\\th1 += sr3highx2\\n\\nnomorebytes:\\n\\n\\ty7 = h7 + alpha130\\n\\n\\ty0 = h0 + alpha32\\n\\n\\ty1 = h1 + alpha32\\n\\n\\ty2 = h2 + alpha64\\n\\n\\ty7 -= alpha130\\n\\n\\ty3 = h3 + alpha64\\n\\n\\ty4 = h4 + alpha96\\n\\n\\ty5 = h5 + alpha96\\n\\n\\tx7 = h7 - y7\\n\\ty7 *= scale\\n\\n\\ty0 -= alpha32\\n\\n\\ty1 -= alpha32\\n\\n\\ty2 -= alpha64\\n\\n\\th6 += x7\\n\\n\\ty3 -= alpha64\\n\\n\\ty4 -= alpha96\\n\\n\\ty5 -= alpha96\\n\\n\\ty6 = h6 + alpha130\\n\\n\\tx0 = h0 - y0\\n\\n\\tx1 = h1 - y1\\n\\n\\tx2 = h2 - y2\\n\\n\\ty6 -= alpha130\\n\\n\\tx0 += y7\\n\\n\\tx3 = h3 - y3\\n\\n\\tx4 = h4 - y4\\n\\n\\tx5 = h5 - y5\\n\\n\\tx6 = h6 - y6\\n\\n\\ty6 *= scale\\n\\n\\tx2 += y0\\n\\n\\tx3 += y1\\n\\n\\tx4 += y2\\n\\n\\tx0 += y6\\n\\n\\tx5 += y3\\n\\n\\tx6 += y4\\n\\n\\tx2 += x3\\n\\n\\tx0 += x1\\n\\n\\tx4 += x5\\n\\n\\tx6 += y5\\n\\n\\tx2 += offset1\\n\\td1 = int64(math.Float64bits(x2))\\n\\n\\tx0 += offset0\\n\\td0 = int64(math.Float64bits(x0))\\n\\n\\tx4 += offset2\\n\\td2 = int64(math.Float64bits(x4))\\n\\n\\tx6 += offset3\\n\\td3 = int64(math.Float64bits(x6))\\n\\n\\tf0 = uint64(d0)\\n\\n\\tf1 = uint64(d1)\\n\\tbits32 = math.MaxUint64\\n\\n\\tf2 = uint64(d2)\\n\\tbits32 >>= 32\\n\\n\\tf3 = uint64(d3)\\n\\tf = f0 >> 32\\n\\n\\tf0 &= bits32\\n\\tf &= 255\\n\\n\\tf1 += f\\n\\tg0 = f0 + 5\\n\\n\\tg = g0 >> 32\\n\\tg0 &= bits32\\n\\n\\tf = f1 >> 32\\n\\tf1 &= bits32\\n\\n\\tf &= 255\\n\\tg1 = f1 + g\\n\\n\\tg = g1 >> 32\\n\\tf2 += f\\n\\n\\tf = f2 >> 32\\n\\tg1 &= bits32\\n\\n\\tf2 &= bits32\\n\\tf &= 255\\n\\n\\tf3 += f\\n\\tg2 = f2 + g\\n\\n\\tg = g2 >> 32\\n\\tg2 &= bits32\\n\\n\\tf4 = f3 >> 32\\n\\tf3 &= bits32\\n\\n\\tf4 &= 255\\n\\tg3 = f3 + g\\n\\n\\tg = g3 >> 32\\n\\tg3 &= bits32\\n\\n\\tg4 = f4 + g\\n\\n\\tg4 = g4 - 4\\n\\ts00 = uint32(s[0])\\n\\n\\tf = uint64(int64(g4) >> 63)\\n\\ts01 = uint32(s[1])\\n\\n\\tf0 &= f\\n\\tg0 &^= f\\n\\ts02 = uint32(s[2])\\n\\n\\tf1 &= f\\n\\tf0 |= g0\\n\\ts03 = uint32(s[3])\\n\\n\\tg1 &^= f\\n\\tf2 &= f\\n\\ts10 = uint32(s[4])\\n\\n\\tf3 &= f\\n\\tg2 &^= f\\n\\ts11 = uint32(s[5])\\n\\n\\tg3 &^= f\\n\\tf1 |= g1\\n\\ts12 = uint32(s[6])\\n\\n\\tf2 |= g2\\n\\tf3 |= g3\\n\\ts13 = uint32(s[7])\\n\\n\\ts01 <<= 8\\n\\tf0 += uint64(s00)\\n\\ts20 = uint32(s[8])\\n\\n\\ts02 <<= 16\\n\\tf0 += uint64(s01)\\n\\ts21 = uint32(s[9])\\n\\n\\ts03 <<= 24\\n\\tf0 += uint64(s02)\\n\\ts22 = uint32(s[10])\\n\\n\\ts11 <<= 8\\n\\tf1 += uint64(s10)\\n\\ts23 = uint32(s[11])\\n\\n\\ts12 <<= 16\\n\\tf1 += uint64(s11)\\n\\ts30 = uint32(s[12])\\n\\n\\ts13 <<= 24\\n\\tf1 += uint64(s12)\\n\\ts31 = uint32(s[13])\\n\\n\\tf0 += uint64(s03)\\n\\tf1 += uint64(s13)\\n\\ts32 = uint32(s[14])\\n\\n\\ts21 <<= 8\\n\\tf2 += uint64(s20)\\n\\ts33 = uint32(s[15])\\n\\n\\ts22 <<= 16\\n\\tf2 += uint64(s21)\\n\\n\\ts23 <<= 24\\n\\tf2 += uint64(s22)\\n\\n\\ts31 <<= 8\\n\\tf3 += uint64(s30)\\n\\n\\ts32 <<= 16\\n\\tf3 += uint64(s31)\\n\\n\\ts33 <<= 24\\n\\tf3 += uint64(s32)\\n\\n\\tf2 += uint64(s23)\\n\\tf3 += uint64(s33)\\n\\n\\tout[0] = byte(f0)\\n\\tf0 >>= 8\\n\\tout[1] = byte(f0)\\n\\tf0 >>= 8\\n\\tout[2] = byte(f0)\\n\\tf0 >>= 8\\n\\tout[3] = byte(f0)\\n\\tf0 >>= 8\\n\\tf1 += f0\\n\\n\\tout[4] = byte(f1)\\n\\tf1 >>= 8\\n\\tout[5] = byte(f1)\\n\\tf1 >>= 8\\n\\tout[6] = byte(f1)\\n\\tf1 >>= 8\\n\\tout[7] = byte(f1)\\n\\tf1 >>= 8\\n\\tf2 += f1\\n\\n\\tout[8] = byte(f2)\\n\\tf2 >>= 8\\n\\tout[9] = byte(f2)\\n\\tf2 >>= 8\\n\\tout[10] = byte(f2)\\n\\tf2 >>= 8\\n\\tout[11] = byte(f2)\\n\\tf2 >>= 8\\n\\tf3 += f2\\n\\n\\tout[12] = byte(f3)\\n\\tf3 >>= 8\\n\\tout[13] = byte(f3)\\n\\tf3 >>= 8\\n\\tout[14] = byte(f3)\\n\\tf3 >>= 8\\n\\tout[15] = byte(f3)\\n}\",\n \"func anticlockwiseTurn90Degree(slice [][]string) [][]string {\\n return reverse(transpose(slice))\\n}\",\n \"func binary(x int64, arr []int64) {\\n\\t// fmt.Printf(\\\"Looking for %v in %v \\\\n\\\", x, arr)\\n\\tlbound := 0\\n\\trbound := len(arr)\\n\\ti, max := 0, 10\\n\\tmid := (rbound - lbound) / 2\\n\\tvar steps []string\\n\\tfor i < max {\\n\\t\\t// fmt.Printf(\\\"mid: %v, lbound : %v, rbound : %v\\\\n\\\", mid, lbound, rbound)\\n\\t\\tsteps = append(steps, strconv.Itoa(mid))\\n\\t\\tif x == arr[mid] {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tif x > arr[mid] {\\n\\t\\t\\t// fmt.Printf(\\\"lbound %v=>%v\\\\n\\\", lbound, mid)\\n\\t\\t\\tlbound = mid\\n\\t\\t\\tmid = lbound + (rbound-lbound)/2\\n\\t\\t} else {\\n\\t\\t\\t// fmt.Printf(\\\"rbound %v=>%v\\\\n\\\", rbound, mid)\\n\\t\\t\\trbound = mid\\n\\t\\t\\tmid = rbound - (rbound-lbound)/2\\n\\t\\t}\\n\\t\\ti++\\n\\t}\\n\\tfmt.Println(strings.Join(steps, \\\" \\\"))\\n}\",\n \"func encryption(s string) string {\\n length := float64(len(s))\\n root := math.Sqrt(length)\\n rows := math.Floor(root)\\n columns := math.Ceil(root)\\n if rows * columns < length {\\n rows++\\n }\\n var stripped string\\n stripped = strings.ReplaceAll(s, \\\" \\\", \\\"\\\")\\n var encrypted string\\n for y := float64(0); y < columns; y++ {\\n for x := float64(0); x + y < length; x+=columns {\\n encrypted = encrypted + string(stripped[int(x+y)])\\n }\\n encrypted = encrypted + \\\" \\\"\\n }\\n return encrypted\\n}\",\n \"func removeDuplicates80(nums []int) int {\\n\\ti := 0\\n\\tfor _, n := range nums {\\n\\t\\tif i < 2 || n != nums[i-2] {\\n\\t\\t\\tnums[i] = n\\n\\t\\t\\ti++\\n\\t\\t}\\n\\t}\\n\\treturn i\\n}\",\n \"func CuttingPaperSquares(n int32, m int32) int64 {\\n return int64(n)*int64(m)-1\\n}\",\n \"func MakeBoundary()(b string){\\n b = strconv.FormatInt(time.Now().UnixNano(), 10)\\n b += strconv.FormatInt(rand.New(rand.NewSource(time.Now().UnixNano())).Int63(), 10)\\n b = MD5(b)\\n return\\n}\",\n \"func multiples(of []int, below int)[]int {\\n\\t// Using a hash as a poor man's set\\n\\tvalues := make(map[int]bool)\\n\\tfor _, num := range of {\\n\\t\\tfor i := num; i < below; i += num {\\n\\t\\t\\tvalues[i] = true\\n\\t\\t}\\n\\t}\\n\\tresults := make([]int, len(values))\\n\\tvar i int = 0\\n\\tfor n, _ := range values {\\n\\t\\tresults[i] = n\\n\\t\\ti++\\n\\t}\\n\\treturn results\\n}\",\n \"func steps(s []int) int {\\n\\tsteps := 0\\n\\n\\tfor pos := 0; pos >= 0 && pos < len(s); steps += 1 {\\n\\t\\tnewpos := pos + s[pos]\\n\\t\\tif s[pos] >= 3 {\\n\\t\\t\\ts[pos] -= 1\\n\\t\\t} else {\\n\\t\\t\\ts[pos] += 1\\n\\t\\t}\\n\\t\\tpos = newpos\\n\\t}\\n\\n\\treturn steps\\n}\",\n \"func main() {\\n\\tvar buffer bytes.Buffer\\n\\tvar validHash = regexp.MustCompile(`^0{5}.*$`)\\n\\tcount := 0\\n\\tinput := \\\"ugkcyxxp\\\"\\n\\n\\tfor len(buffer.String()) < 8 {\\n\\t\\ttmp := md5.Sum([]byte(fmt.Sprintf(\\\"%s%d\\\", input, count)))\\n\\t\\tif str := hex.EncodeToString(tmp[:]); validHash.MatchString(str) {\\n\\t\\t\\tbuffer.WriteByte(str[5])\\n\\t\\t}\\n\\t\\tcount++\\n\\t}\\n\\n\\tfmt.Println(buffer.String())\\n}\",\n \"func main() {\\n scanner := bufio.NewScanner(os.Stdin)\\n scanner.Buffer(make([]byte, 1000000), 1000000)\\n\\n scanner.Scan()\\n equality := scanner.Text()\\n // _ = equality // to avoid unused error\\n\\n elms := regexp.MustCompile(\\\"[+=]\\\").Split(equality, -1)\\n x, y, z := elms[0], elms[1], elms[2]\\n\\n numerals := \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n maxNumeralIndex := -1\\n for index, num := range numerals {\\n if strings.Contains(equality, string(num)) {\\n maxNumeralIndex = index\\n }\\n }\\n maxNumeralIndex++\\n\\n result := -1\\n for i := maxNumeralIndex; i <= len(numerals); i++ {\\n numeralX := toDecimal(x, i)\\n numeralY := toDecimal(y, i)\\n numeralZ := toDecimal(z, i)\\n\\n if numeralX + numeralY == numeralZ {\\n result = i\\n break\\n }\\n }\\n\\n // fmt.Fprintln(os.Stderr, \\\"Debug messages...\\\")\\n // fmt.Println(\\\"answer\\\")// Write answer to stdout\\n fmt.Println(result)\\n}\",\n \"func div(u uint8) (uint8, uint8) {\\n\\treturn u / 64, u % 64\\n}\",\n \"func numIslands(grid [][]byte) int {\\n\\t//h := len(grid)\\n\\t//w := len(grid[0])\\n\\t//walkJudge := make([][]bool, h)\\n\\t//for i, _ := range walkJudge {\\n\\t//\\twalkJudge[i] = make([]bool, w)\\n\\t//}\\n\\tcount := 0\\n\\n\\tfor i, _ := range grid {\\n\\t\\tfor j, _ := range grid[i] {\\n\\t\\t\\tif grid[i][j] == '1' {\\n\\t\\t\\t\\tdfs(grid, i, j)\\n\\t\\t\\t\\tcount += 1\\n\\t\\t\\t\\t//fullPath(&walkJudge, grid,i, j)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn count\\n}\",\n \"func (s *CountMinSketch) locations(key []byte) (locs []uint) {\\n\\tlocs = make([]uint, s.d)\\n\\ta, b := s.baseHashes(key)\\n\\tua := uint(a)\\n\\tub := uint(b)\\n\\tfor r := uint(0); r < s.d; r++ {\\n\\t\\tlocs[r] = (ua + ub*r) % s.w\\n\\t}\\n\\treturn\\n}\",\n \"func fingerprint(str []byte) uint64 {\\n\\tvar hi = hash32(str, 0, len(str), 0)\\n\\tvar lo = hash32(str, 0, len(str), 102072)\\n\\tif (hi == 0) && (lo == 0 || lo == 1) {\\n\\t\\t// Turn 0/1 into another fingerprint\\n\\t\\thi ^= 0x130f9bef\\n\\t\\tlo ^= 0x94a0a928\\n\\t}\\n\\treturn (uint64(hi) << 32) | uint64(lo&0xffffffff)\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.58024555","0.5661549","0.5576845","0.5349433","0.5328527","0.5309565","0.53035676","0.5302726","0.52974","0.5284454","0.5270035","0.5224862","0.52078164","0.5188299","0.5173334","0.5172408","0.5172408","0.5172408","0.5172408","0.5172408","0.5172408","0.5172408","0.5172408","0.51550025","0.5153112","0.514917","0.51460683","0.51421726","0.5135196","0.5135164","0.5119654","0.51193696","0.51085204","0.5107168","0.50985456","0.5061542","0.5053697","0.5047041","0.5019534","0.5011306","0.49973723","0.49964282","0.49892554","0.49814162","0.49776298","0.4974919","0.49697962","0.4966913","0.495805","0.4958024","0.49552855","0.49552855","0.49506596","0.49497923","0.49472117","0.49465036","0.4943548","0.49420732","0.49404958","0.49378067","0.49342555","0.493043","0.49292123","0.49263886","0.49238405","0.4922644","0.49086556","0.49084547","0.48985362","0.48982117","0.48939914","0.4889766","0.48854727","0.48838905","0.4883343","0.48778617","0.48757645","0.48652","0.4859359","0.4857869","0.48576134","0.4852902","0.484651","0.4845548","0.4845374","0.484301","0.48406872","0.48354128","0.48313367","0.48267984","0.48260692","0.48254535","0.48149982","0.4813896","0.4812025","0.4808479","0.48022333","0.4802225","0.48002836","0.4799712","0.4798361"],"string":"[\n \"0.58024555\",\n \"0.5661549\",\n \"0.5576845\",\n \"0.5349433\",\n \"0.5328527\",\n \"0.5309565\",\n \"0.53035676\",\n \"0.5302726\",\n \"0.52974\",\n \"0.5284454\",\n \"0.5270035\",\n \"0.5224862\",\n \"0.52078164\",\n \"0.5188299\",\n \"0.5173334\",\n \"0.5172408\",\n \"0.5172408\",\n \"0.5172408\",\n \"0.5172408\",\n \"0.5172408\",\n \"0.5172408\",\n \"0.5172408\",\n \"0.5172408\",\n \"0.51550025\",\n \"0.5153112\",\n \"0.514917\",\n \"0.51460683\",\n \"0.51421726\",\n \"0.5135196\",\n \"0.5135164\",\n \"0.5119654\",\n \"0.51193696\",\n \"0.51085204\",\n \"0.5107168\",\n \"0.50985456\",\n \"0.5061542\",\n \"0.5053697\",\n \"0.5047041\",\n \"0.5019534\",\n \"0.5011306\",\n \"0.49973723\",\n \"0.49964282\",\n \"0.49892554\",\n \"0.49814162\",\n \"0.49776298\",\n \"0.4974919\",\n \"0.49697962\",\n \"0.4966913\",\n \"0.495805\",\n \"0.4958024\",\n \"0.49552855\",\n \"0.49552855\",\n \"0.49506596\",\n \"0.49497923\",\n \"0.49472117\",\n \"0.49465036\",\n \"0.4943548\",\n \"0.49420732\",\n \"0.49404958\",\n \"0.49378067\",\n \"0.49342555\",\n \"0.493043\",\n \"0.49292123\",\n \"0.49263886\",\n \"0.49238405\",\n \"0.4922644\",\n \"0.49086556\",\n \"0.49084547\",\n \"0.48985362\",\n \"0.48982117\",\n \"0.48939914\",\n \"0.4889766\",\n \"0.48854727\",\n \"0.48838905\",\n \"0.4883343\",\n \"0.48778617\",\n \"0.48757645\",\n \"0.48652\",\n \"0.4859359\",\n \"0.4857869\",\n \"0.48576134\",\n \"0.4852902\",\n \"0.484651\",\n \"0.4845548\",\n \"0.4845374\",\n \"0.484301\",\n \"0.48406872\",\n \"0.48354128\",\n \"0.48313367\",\n \"0.48267984\",\n \"0.48260692\",\n \"0.48254535\",\n \"0.48149982\",\n \"0.4813896\",\n \"0.4812025\",\n \"0.4808479\",\n \"0.48022333\",\n \"0.4802225\",\n \"0.48002836\",\n \"0.4799712\",\n \"0.4798361\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":982,"cells":{"query":{"kind":"string","value":"Min of max is: 75"},"document":{"kind":"string","value":"func maxOfMinSlidingWindows(arr []int, k int) {\n\tsize := len(arr)\n\tque := new(Queue)\n\tmaxVal := math.MinInt32\n\ti := 0\n\tfor i < size {\n\t\t// Remove out of range elements\n\t\tif que.Len() > 0 && que.Front().(int) <= i-k {\n\t\t\tque.Remove()\n\t\t}\n\t\t// Remove smaller values at left.\n\t\tfor que.Len() > 0 && arr[que.Back().(int)] >= arr[i] {\n\t\t\tque.RemoveBack()\n\t\t}\n\t\tque.Add(i)\n\t\t// window of size k\n\t\tif i >= (k-1) && maxVal < arr[que.Front().(int)] {\n\t\t\tmaxVal = arr[que.Front().(int)]\n\t\t}\n\t\ti += 1\n\t}\n\tfmt.Println(\"Max of min is:\", maxVal)\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func MinMax(x, min, max int) int { return x }","func (p parseSpec) minMax() (int, int) {\n\tmaxVal := -math.MaxInt64\n\tminVal := math.MaxInt64\n\tfor _, v := range p {\n\t\tif v > maxVal {\n\t\t\tmaxVal = v\n\t\t} else if v < minVal {\n\t\t\tminVal = v\n\t\t}\n\t}\n\treturn minVal, maxVal\n}","func minmax(a, b, c float64) float64 {\n\ta = math.Max(a, b)\n\ta = math.Min(a, c)\n\treturn a\n}","func getRange(min, max int) int {\n\treturn max * min\n}","func MinMaxInt8(x, min, max int8) int8 { return x }","func LabelMaxMin(c *Curve, rend gochart.Renderer, width, height int) {\n\n\tminlabel := \"-\"\n\tmaxlabel := \"-\"\n\n\tif c.MinIndex >= 0 {\n\t\tminlabel = strconv.FormatFloat(c.Value[c.MinIndex], 'f', 0, 64)\n\t}\n\n\tif c.MaxIndex >= 0 {\n\t\tmaxlabel = strconv.FormatFloat(c.Value[c.MaxIndex], 'f', 0, 64)\n\t}\n\n\trend.SetFontSize(9)\n\t//rend.SetFontColor(gochart.ColorRed) // Color{R: 0x00, G: 0x66, B: 0xff, A: 255})\n\trend.SetFontColor(drawing.Color{R: 255, G: 0, B: 0, A: 255})\n\trend.Text(minlabel, 4, 12)\n\n\trend.SetFontColor(drawing.Color{R: 0x23, G: 0xd1, B: 0x60, A: 255}) // (drawing.Color{R: 0x00, G: 0xFF, B: 0x00, A: 255})\n\trend.Text(maxlabel, width-2-rend.MeasureText(maxlabel).Right, height-2)\n}","func maxYmin(numeros []int) (int, int) { //indicamos los tipos que va retornar (int, int)\n\tvar max, min int\n\n\tfor _, v := range numeros {\n\t\tif v > max {\n\t\t\tmax = v\n\t\t}\n\n\t\tif v < min {\n\t\t\tmin = v\n\t\t}\n\t}\n\n\treturn max, min //indicamos el orden en el que se debe retornar\n}","func constrain(input, min, max float64) float32 {\n\tvar value float32\n\tvalue = float32(math.Min(max, math.Max(min, input)))\n\treturn value\n}","func maxYmin2(numeros []int) (max int, min int) { //indicamos los tipos y nombre que va retornar (int, int)\n\tfor _, v := range numeros {\n\t\tif v > max {\n\t\t\tmax = v\n\t\t}\n\n\t\tif v < min {\n\t\t\tmin = v\n\t\t}\n\t}\n\n\treturn //ya no necesita return porque ya le indicamos como va retornar y que orden\n}","func clamp(min, max, v int) int {\n\tif v < min {\n\t\tmin = v\n\t} else if v > max {\n\t\tmax = v\n\t}\n\n\treturn v\n}","func max(x int) int {\n\treturn 40 + x\n}","func MinMaxInt32(x, min, max int32) int32 { return x }","func MinMaxDiff(vals []string) int {\n\tmin, _ := strconv.Atoi(vals[0])\n\tmax := min\n\tfor _, v := range vals {\n\t\td, err := strconv.Atoi(v)\n\t\tif err != nil {\n\t\t\tpanic(\"could not parse number!\")\n\t\t}\n\t\tif int(d) < min {\n\t\t\tmin = int(d)\n\t\t} else if int(d) > max {\n\t\t\tmax = int(d)\n\t\t}\n\t}\n\n\treturn max - min\n}","func (s *Slider) Max(max float32) *Slider {\n\ts.max = max\n\treturn s\n}","func (r *Retry) min(a, b uint64) uint64 {\n\tif a > b {\n\t\treturn b\n\t}\n\treturn a\n}","func MinMax(min, max int) int {\n\trand.Seed(time.Now().UTC().UnixNano())\n\tif min > max {\n\t\tbuf := min\n\t\tmin = max\n\t\tmax = buf\n\t}\n\treturn rand.Intn(max-min) + min\n}","func Min(x, min int) int { return x }","func MinMax(w http.ResponseWriter, req *http.Request) {\r\n\r\n minmax_templ.Execute(w, req.FormValue(\"s\"))\r\n if req.FormValue != nil {\r\n min, max, sum := minmax.FindMinmax(req.FormValue(\"s\"))\r\n if min != 0 && max != 0 && sum != 0 {\r\n fmt.Fprintf(w, \"%d %d %d\", min, max, sum)\r\n }\r\n }\r\n \r\n}","func (px *Paxos) Max() int {\n\treturn px.Hi\n}","func minmax() (min float64, max float64) {\n\tmin = math.NaN()\n\tmax = math.NaN()\n\tfor i := 0; i < cells; i++ {\n\t\tfor j := 0; j < cells; j++ {\n\t\t\tfor xoff := 0; xoff <= 1; xoff++ {\n\t\t\t\tfor yoff := 0; yoff <= 1; yoff++ {\n\t\t\t\t\tx := xyrange * (float64(i+xoff)/cells - 0.5)\n\t\t\t\t\ty := xyrange * (float64(j+yoff)/cells - 0.5)\n\t\t\t\t\tz := f(x, y)\n\t\t\t\t\tif math.IsNaN(min) || z < min {\n\t\t\t\t\t\tmin = z\n\t\t\t\t\t}\n\t\t\t\t\tif math.IsNaN(max) || z > max {\n\t\t\t\t\t\tmax = z\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn\n}","func MinMaxInt64(x, min, max int64) int64 { return x }","func clamp(v, min, max int) int {\n\tif v > max {\n\t\treturn max\n\t}\n\tif v < min {\n\t\treturn min\n\t}\n\treturn v\n}","func MinMaxUint8(x, min, max uint8) uint8 { return x }","func MinMaxUint64(x, min, max uint64) uint64 { return x }","func (px *Paxos) Min() int {\n\treturn px.Lo\n}","func (self *Limits) Maximum() uint32 {\n\treturn uint32(self.inner().max)\n}","func clampRange(low, size, max int) (from, upto int) {\n\tfrom, upto = low, low+size\n\tif from > max {\n\t\tfrom = max\n\t}\n\tif upto > max {\n\t\tupto = max\n\t}\n\treturn\n}","func (obj *interval) Max() int {\n\treturn obj.max\n}","func Max(a, b float64) float64 {\n\tif a > b {\n\t\treturn a\n\t}\n\treturn b\n}","func Max(a, b float64) float64 {\n\tif a > b {\n\t\treturn a\n\t}\n\treturn b\n}","func Max(a, b float64) float64 {\n\tif a > b {\n\t\treturn a\n\t}\n\treturn b\n}","func constrain(min, n, max float64) float64 {\n\tn = math.Max(min, n)\n\tn = math.Min(n, max)\n\treturn n\n}","func normalize(val, oldMax, newMax int) int {\n\treturn int(float64(newMax) / float64(oldMax) * float64(val))\n}","func min(x, y int) int {\n\tif x > y {\n\t\treturn y\n\t}\n\treturn x\n}","func min(x, y int64) int64 {\n\tif x > y {\n\t\treturn y\n\t}\n\treturn x\n}","func scale(val float64, min float64, max float64, outMin float64, outMax float64) float64 {\r\n\tdenom := 1.0\r\n\ty := 0.0\r\n\tif outMin - min != 0 {\r\n\t\tdenom = outMin - min\r\n\t\ty = (outMax - max) / denom * val - min + outMin\r\n\t} else {\r\n\t\ty = outMax / max * val - min + outMin\r\n\t}\r\n\treturn y\r\n}","func (m mathUtil) MinAndMax(values ...float64) (min float64, max float64) {\n\tif len(values) == 0 {\n\t\treturn\n\t}\n\tmin = values[0]\n\tmax = values[0]\n\tfor _, v := range values {\n\t\tif max < v {\n\t\t\tmax = v\n\t\t}\n\t\tif min > v {\n\t\t\tmin = v\n\t\t}\n\t}\n\treturn\n}","func (px *Paxos) Max() int {\n\t// Your code here.\n\treturn px.max\n}","func min(x, y int) int {\n\tif x > y {\n\t\treturn y\n\t}\n\n\treturn x\n}","func clamp(n, min, max int16) int16 {\n\tif n < min {\n\t\treturn min\n\t} else if n > max {\n\t\treturn max\n\t}\n\n\treturn n\n}","func main() {\n\tvar minMax = func(n []int) (int, int) {\n\t\tvar min, max int\n\n\t\tfor key, val := range n {\n\n\t\t\tif key == 0 {\n\t\t\t\tmin, max = val, val\n\t\t\t}\n\n\t\t\tif val < min {\n\t\t\t\tmin = val\n\t\t\t}\n\n\t\t\tif val > max {\n\t\t\t\tmax = val\n\t\t\t}\n\t\t}\n\n\t\treturn min, max\n\t}\n\n\tvar number = []int{10, 22, 3, 77, 1, 5}\n\n\tvar min, max = minMax(number)\n\n\tfmt.Printf(\"min : %d \", min)\n\tfmt.Printf(\"max : %d\", max)\n}","func MinMaxInt16(x, min, max int16) int16 { return x }","func InRange(val, min, max float64) float64 {\n\tif val < min {\n\t\treturn min\n\t} else if val > max {\n\t\treturn max\n\t}\n\treturn val\n}","func (rn *RangedNumber) Min() int {\n\tif rn.min > rn.max {\n\t\trn.Set(rn.max, rn.min)\n\t}\n\n\treturn rn.min\n}","func testMaxMin(f interface{}) (passed, failed int, err error) {\n\tintArr := &pr.ArrayMatcher{M: &pr.KindMatcher{Kind: reflect.Int}}\n\twantFn := &pr.FuncMatcher{\n\t\tIn: []pr.TypeMatcher{intArr},\n\t\tOut: []pr.TypeMatcher{\n\t\t\t&pr.KindMatcher{Kind: reflect.Int},\n\t\t\t&pr.KindMatcher{Kind: reflect.Int},\n\t\t},\n\t}\n\tif !wantFn.MatchType(reflect.TypeOf(f)) {\n\t\treturn 0, 0, errors.New(\"want func([N]int)(min, max int)\")\n\t}\n\n\tvalF := reflect.ValueOf(f)\n\tcallF := func(in reflect.Value) (max, min int) {\n\t\targs := []reflect.Value{in.Elem()}\n\t\tret := valF.Call(args)\n\t\treturn int(ret[0].Int()), int(ret[1].Int())\n\t}\n\n\tal := intArr.Len\n\tbuilder := func() *pr.IntArrayBuilder {\n\t\treturn &pr.IntArrayBuilder{Count: al}\n\t}\n\n\tfor _, test := range []struct {\n\t\tname string\n\t\tin *pr.IntArrayBuilder\n\t\twantMin, wantMax int\n\t}{\n\t\t{name: \"zero value\", wantMin: 0, wantMax: 0, in: builder()},\n\t\t{name: \"straight up\", wantMin: 1, wantMax: al, in: builder().FillRange(1, 1)},\n\t\t{name: \"straight down\", wantMin: -al, wantMax: -1, in: builder().FillRange(-1, -1)},\n\t\t{name: \"shuffle\", wantMin: -al / 2, wantMax: -al/2 + al - 1, in: builder().FillRange(-al/2, 1).Shuffle()},\n\t} {\n\t\tactualMax, actualMin := callF(test.in.Build())\n\t\tif actualMin == test.wantMin && actualMax == test.wantMax {\n\t\t\tlog.Println(\"PASS:\", test.name)\n\t\t\tpassed++\n\t\t} else {\n\t\t\tlog.Println(\"FAIL:\", test.name)\n\t\t\tfailed++\n\t\t}\n\t}\n\treturn\n}","func MinMaxUint(x, min, max uint) uint { return x }","func Max(val, max any) bool { return valueCompare(val, max, \"<=\") }","func min(a, b float64) float64 {\n\tif a < b {\n\t\treturn a\n\t}\n\treturn b\n}","func Max(x, y int) int {\n\tif x < y {\n\t\treturn y\n\t}\n\treturn x\n}","func MinMaxUint32(x, min, max uint32) uint32 { return x }","func GetMinmax(target uint32, reset bool, format uint32, xtype uint32, values unsafe.Pointer) {\n C.glowGetMinmax(gpGetMinmax, (C.GLenum)(target), (C.GLboolean)(boolToInt(reset)), (C.GLenum)(format), (C.GLenum)(xtype), values)\n}","func min(a, b int) int {\n\tif a > b {\n\t\treturn b\n\t}\n\treturn a\n}","func (r SampleRateRange) Max() int {\n\treturn r.max\n}","func min(a, b uint64) uint64 {\n\tif a <= b {\n\t\treturn a\n\t}\n\treturn b\n}","func (rn *RangedNumber) Max() int {\n\tif rn.min > rn.max {\n\t\trn.Set(rn.max, rn.min)\n\t}\n\n\treturn rn.max\n}","func GetRangeLimit() int {\n\treturn 25\n}","func Min(a, b float64) float64 {\n\tif a < b {\n\t\treturn a\n\t}\n\treturn b\n}","func Min(a, b float64) float64 {\n\tif a < b {\n\t\treturn a\n\t}\n\treturn b\n}","func Min(a, b float64) float64 {\n\tif a < b {\n\t\treturn a\n\t}\n\treturn b\n}","func max(a, b float64) float64 {\n\tif a > b {\n\t\treturn a\n\t}\n\treturn b\n}","func Clamp(value, min, max float32) float32 {\n\tvar res float32\n\tif value < min {\n\t\tres = min\n\t} else {\n\t\tres = value\n\t}\n\n\tif res > max {\n\t\treturn max\n\t}\n\n\treturn res\n}","func getMinMaxScores(scores framework.NodeScoreList) (int64, int64) {\n\tvar max int64 = math.MinInt64 // Set to min value\n\tvar min int64 = math.MaxInt64 // Set to max value\n\n\tfor _, nodeScore := range scores {\n\t\tif nodeScore.Score > max {\n\t\t\tmax = nodeScore.Score\n\t\t}\n\t\tif nodeScore.Score < min {\n\t\t\tmin = nodeScore.Score\n\t\t}\n\t}\n\t// return min and max scores\n\treturn min, max\n}","func minMax(values []float64) (x, y float64) {\n\tmin, max := numbers.MinMax(values)\n\tif math.IsNaN(min) {\n\t\tmin = 0\n\t}\n\tif math.IsNaN(max) {\n\t\tmax = 0\n\t}\n\treturn min, max\n}","func min(a, b int32) int32 {\n\tif a <= b {\n\t\treturn a\n\t}\n\treturn b\n}","func axisMax(val int) (int, int) {\n\tif val < 10 {\n\t\treturn 10, 1\n\t}\n\n\t// If val is less than 100, return val rounded up to the next 10\n\tif val < 100 {\n\t\tx := val % 10\n\t\treturn val + 10 - x, 10\n\t}\n\n\t// If val is less than 500, return val rounded up to the next 50\n\tif val < 500 {\n\t\tx := val % 50\n\t\treturn val + 50 - x, 50\n\t}\n\treturn 1000, 100\n}","func Max(x, y int) int {\n\tif y > x {\n\t\treturn y\n\t}\n\treturn x\n}","func (qs ControlQS) IntabsmaxLt(v float64) ControlQS {\n\treturn qs.filter(`\"intabsmax\" <`, v)\n}","func (s *Slider) Min(min float32) *Slider {\n\ts.min = min\n\treturn s\n}","func Max(a int, b int) int {\n\tif a >= b {\n\t\treturn a\n\t}\n\treturn b\n}","func Max(a uint64, b uint64) uint64 {\n\tif a > b {\n\t\treturn a\n\t}\n\treturn b\n}","func min(x, y int) int {\n\tif x < y {\n\t\treturn x\n\t}\n\treturn y\n}","func min(x, y int) int {\n\tif x < y {\n\t\treturn x\n\t}\n\treturn y\n}","func min(x, y int) int {\n\tif x < y {\n\t\treturn x\n\t}\n\treturn y\n}","func (self *ComponentScaleMinMax) SetScaleMinMax(minX interface{}, minY interface{}, maxX interface{}, maxY interface{}) {\n self.Object.Call(\"setScaleMinMax\", minX, minY, maxX, maxY)\n}","func MaxFadeExtent(value int) *SimpleElement { return newSEInt(\"maxFadeExtent\", value) }","func Min(a, b int) int {\n\tif a > b {\n\t\treturn b\n\t}\n\treturn a\n}","func Min(a, b int) int {\n\tif a > b {\n\t\treturn b\n\t}\n\treturn a\n}","func Min(a, b int) int {\n\tif a > b {\n\t\treturn b\n\t}\n\treturn a\n}","func (r SampleRateRange) Min() int {\n\treturn r.min\n}","func (m Metric) MinLevel(val float64) int {\n\tif val < 0 {\n\t\treturn maxLevel\n\t}\n\n\tlevel := -(math.Ilogb(val/m.Deriv) >> uint(m.Dim-1))\n\tif level > maxLevel {\n\t\tlevel = maxLevel\n\t}\n\tif level < 0 {\n\t\tlevel = 0\n\t}\n\treturn level\n}","func (p *BW) MaxValue() uint16 {\n\treturn 1\n}","func min(x, y int) int {\n\tif x < y {\n\t\treturn x\n\t} else {\n\t\treturn y\n\t}\n}","func (p *analogPin) Range() (analog.Sample, analog.Sample) {\n\tmax := analog.Sample{Raw: math.MaxInt16, V: p.voltageMultiplier}\n\tmin := analog.Sample{Raw: -math.MaxInt16, V: -p.voltageMultiplier}\n\treturn min, max\n}","func max(a, b int) int {\nif a < b {\nreturn b\n}\nreturn a\n}","func max(x, y int) int {\n\tif x < y {\n\t\treturn y\n\t}\n\treturn x\n}","func Max(x, y int64) int64 {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func Max(x, y int) int {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func Max(x, y int) int {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func Min(val, min any) bool { return valueCompare(val, min, \">=\") }","func Max(a, b uint32) uint32 {\n\tif a > b {\n\t\treturn a\n\t}\n\treturn b\n}","func max(x, y int64) int64 {\n\tif x < y {\n\t\treturn y\n\t}\n\treturn x\n}","func Constrain(n, low, high float64) float64 {\n\treturn math.Max(math.Min(n, high), low)\n}","func MinFadeExtent(value int) *SimpleElement { return newSEInt(\"minFadeExtent\", value) }","func Max(x, y int) int {\n if x < y {\n return y\n }\n return x\n}","func Max(a, b int) int {\n\tif a < b {\n\t\treturn b\n\t}\n\treturn a\n}","func Max(a, b int) int {\n\tif a < b {\n\t\treturn b\n\t}\n\treturn a\n}","func MinMax(array []int64) (int64, int64) {\n\tvar max = array[0]\n\tvar min = array[0]\n\tfor _, value := range array {\n\t\tif max < value {\n\t\t\tmax = value\n\t\t}\n\t\tif min > value {\n\t\t\tmin = value\n\t\t}\n\t}\n\treturn min, max\n}","func MinMax(array []int64) (int64, int64) {\n\tvar max = array[0]\n\tvar min = array[0]\n\tfor _, value := range array {\n\t\tif max < value {\n\t\t\tmax = value\n\t\t}\n\t\tif min > value {\n\t\t\tmin = value\n\t\t}\n\t}\n\treturn min, max\n}","func (qs ControlQS) IntabsmaxGe(v float64) ControlQS {\n\treturn qs.filter(`\"intabsmax\" >=`, v)\n}","func Min(a int, b int) int {\n\tif a <= b {\n\t\treturn a\n\t}\n\treturn b\n}","func (r *SlidingWindow) Max() int {return r.base + len(r.values) - 1}"],"string":"[\n \"func MinMax(x, min, max int) int { return x }\",\n \"func (p parseSpec) minMax() (int, int) {\\n\\tmaxVal := -math.MaxInt64\\n\\tminVal := math.MaxInt64\\n\\tfor _, v := range p {\\n\\t\\tif v > maxVal {\\n\\t\\t\\tmaxVal = v\\n\\t\\t} else if v < minVal {\\n\\t\\t\\tminVal = v\\n\\t\\t}\\n\\t}\\n\\treturn minVal, maxVal\\n}\",\n \"func minmax(a, b, c float64) float64 {\\n\\ta = math.Max(a, b)\\n\\ta = math.Min(a, c)\\n\\treturn a\\n}\",\n \"func getRange(min, max int) int {\\n\\treturn max * min\\n}\",\n \"func MinMaxInt8(x, min, max int8) int8 { return x }\",\n \"func LabelMaxMin(c *Curve, rend gochart.Renderer, width, height int) {\\n\\n\\tminlabel := \\\"-\\\"\\n\\tmaxlabel := \\\"-\\\"\\n\\n\\tif c.MinIndex >= 0 {\\n\\t\\tminlabel = strconv.FormatFloat(c.Value[c.MinIndex], 'f', 0, 64)\\n\\t}\\n\\n\\tif c.MaxIndex >= 0 {\\n\\t\\tmaxlabel = strconv.FormatFloat(c.Value[c.MaxIndex], 'f', 0, 64)\\n\\t}\\n\\n\\trend.SetFontSize(9)\\n\\t//rend.SetFontColor(gochart.ColorRed) // Color{R: 0x00, G: 0x66, B: 0xff, A: 255})\\n\\trend.SetFontColor(drawing.Color{R: 255, G: 0, B: 0, A: 255})\\n\\trend.Text(minlabel, 4, 12)\\n\\n\\trend.SetFontColor(drawing.Color{R: 0x23, G: 0xd1, B: 0x60, A: 255}) // (drawing.Color{R: 0x00, G: 0xFF, B: 0x00, A: 255})\\n\\trend.Text(maxlabel, width-2-rend.MeasureText(maxlabel).Right, height-2)\\n}\",\n \"func maxYmin(numeros []int) (int, int) { //indicamos los tipos que va retornar (int, int)\\n\\tvar max, min int\\n\\n\\tfor _, v := range numeros {\\n\\t\\tif v > max {\\n\\t\\t\\tmax = v\\n\\t\\t}\\n\\n\\t\\tif v < min {\\n\\t\\t\\tmin = v\\n\\t\\t}\\n\\t}\\n\\n\\treturn max, min //indicamos el orden en el que se debe retornar\\n}\",\n \"func constrain(input, min, max float64) float32 {\\n\\tvar value float32\\n\\tvalue = float32(math.Min(max, math.Max(min, input)))\\n\\treturn value\\n}\",\n \"func maxYmin2(numeros []int) (max int, min int) { //indicamos los tipos y nombre que va retornar (int, int)\\n\\tfor _, v := range numeros {\\n\\t\\tif v > max {\\n\\t\\t\\tmax = v\\n\\t\\t}\\n\\n\\t\\tif v < min {\\n\\t\\t\\tmin = v\\n\\t\\t}\\n\\t}\\n\\n\\treturn //ya no necesita return porque ya le indicamos como va retornar y que orden\\n}\",\n \"func clamp(min, max, v int) int {\\n\\tif v < min {\\n\\t\\tmin = v\\n\\t} else if v > max {\\n\\t\\tmax = v\\n\\t}\\n\\n\\treturn v\\n}\",\n \"func max(x int) int {\\n\\treturn 40 + x\\n}\",\n \"func MinMaxInt32(x, min, max int32) int32 { return x }\",\n \"func MinMaxDiff(vals []string) int {\\n\\tmin, _ := strconv.Atoi(vals[0])\\n\\tmax := min\\n\\tfor _, v := range vals {\\n\\t\\td, err := strconv.Atoi(v)\\n\\t\\tif err != nil {\\n\\t\\t\\tpanic(\\\"could not parse number!\\\")\\n\\t\\t}\\n\\t\\tif int(d) < min {\\n\\t\\t\\tmin = int(d)\\n\\t\\t} else if int(d) > max {\\n\\t\\t\\tmax = int(d)\\n\\t\\t}\\n\\t}\\n\\n\\treturn max - min\\n}\",\n \"func (s *Slider) Max(max float32) *Slider {\\n\\ts.max = max\\n\\treturn s\\n}\",\n \"func (r *Retry) min(a, b uint64) uint64 {\\n\\tif a > b {\\n\\t\\treturn b\\n\\t}\\n\\treturn a\\n}\",\n \"func MinMax(min, max int) int {\\n\\trand.Seed(time.Now().UTC().UnixNano())\\n\\tif min > max {\\n\\t\\tbuf := min\\n\\t\\tmin = max\\n\\t\\tmax = buf\\n\\t}\\n\\treturn rand.Intn(max-min) + min\\n}\",\n \"func Min(x, min int) int { return x }\",\n \"func MinMax(w http.ResponseWriter, req *http.Request) {\\r\\n\\r\\n minmax_templ.Execute(w, req.FormValue(\\\"s\\\"))\\r\\n if req.FormValue != nil {\\r\\n min, max, sum := minmax.FindMinmax(req.FormValue(\\\"s\\\"))\\r\\n if min != 0 && max != 0 && sum != 0 {\\r\\n fmt.Fprintf(w, \\\"%d %d %d\\\", min, max, sum)\\r\\n }\\r\\n }\\r\\n \\r\\n}\",\n \"func (px *Paxos) Max() int {\\n\\treturn px.Hi\\n}\",\n \"func minmax() (min float64, max float64) {\\n\\tmin = math.NaN()\\n\\tmax = math.NaN()\\n\\tfor i := 0; i < cells; i++ {\\n\\t\\tfor j := 0; j < cells; j++ {\\n\\t\\t\\tfor xoff := 0; xoff <= 1; xoff++ {\\n\\t\\t\\t\\tfor yoff := 0; yoff <= 1; yoff++ {\\n\\t\\t\\t\\t\\tx := xyrange * (float64(i+xoff)/cells - 0.5)\\n\\t\\t\\t\\t\\ty := xyrange * (float64(j+yoff)/cells - 0.5)\\n\\t\\t\\t\\t\\tz := f(x, y)\\n\\t\\t\\t\\t\\tif math.IsNaN(min) || z < min {\\n\\t\\t\\t\\t\\t\\tmin = z\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif math.IsNaN(max) || z > max {\\n\\t\\t\\t\\t\\t\\tmax = z\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\",\n \"func MinMaxInt64(x, min, max int64) int64 { return x }\",\n \"func clamp(v, min, max int) int {\\n\\tif v > max {\\n\\t\\treturn max\\n\\t}\\n\\tif v < min {\\n\\t\\treturn min\\n\\t}\\n\\treturn v\\n}\",\n \"func MinMaxUint8(x, min, max uint8) uint8 { return x }\",\n \"func MinMaxUint64(x, min, max uint64) uint64 { return x }\",\n \"func (px *Paxos) Min() int {\\n\\treturn px.Lo\\n}\",\n \"func (self *Limits) Maximum() uint32 {\\n\\treturn uint32(self.inner().max)\\n}\",\n \"func clampRange(low, size, max int) (from, upto int) {\\n\\tfrom, upto = low, low+size\\n\\tif from > max {\\n\\t\\tfrom = max\\n\\t}\\n\\tif upto > max {\\n\\t\\tupto = max\\n\\t}\\n\\treturn\\n}\",\n \"func (obj *interval) Max() int {\\n\\treturn obj.max\\n}\",\n \"func Max(a, b float64) float64 {\\n\\tif a > b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func Max(a, b float64) float64 {\\n\\tif a > b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func Max(a, b float64) float64 {\\n\\tif a > b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func constrain(min, n, max float64) float64 {\\n\\tn = math.Max(min, n)\\n\\tn = math.Min(n, max)\\n\\treturn n\\n}\",\n \"func normalize(val, oldMax, newMax int) int {\\n\\treturn int(float64(newMax) / float64(oldMax) * float64(val))\\n}\",\n \"func min(x, y int) int {\\n\\tif x > y {\\n\\t\\treturn y\\n\\t}\\n\\treturn x\\n}\",\n \"func min(x, y int64) int64 {\\n\\tif x > y {\\n\\t\\treturn y\\n\\t}\\n\\treturn x\\n}\",\n \"func scale(val float64, min float64, max float64, outMin float64, outMax float64) float64 {\\r\\n\\tdenom := 1.0\\r\\n\\ty := 0.0\\r\\n\\tif outMin - min != 0 {\\r\\n\\t\\tdenom = outMin - min\\r\\n\\t\\ty = (outMax - max) / denom * val - min + outMin\\r\\n\\t} else {\\r\\n\\t\\ty = outMax / max * val - min + outMin\\r\\n\\t}\\r\\n\\treturn y\\r\\n}\",\n \"func (m mathUtil) MinAndMax(values ...float64) (min float64, max float64) {\\n\\tif len(values) == 0 {\\n\\t\\treturn\\n\\t}\\n\\tmin = values[0]\\n\\tmax = values[0]\\n\\tfor _, v := range values {\\n\\t\\tif max < v {\\n\\t\\t\\tmax = v\\n\\t\\t}\\n\\t\\tif min > v {\\n\\t\\t\\tmin = v\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\",\n \"func (px *Paxos) Max() int {\\n\\t// Your code here.\\n\\treturn px.max\\n}\",\n \"func min(x, y int) int {\\n\\tif x > y {\\n\\t\\treturn y\\n\\t}\\n\\n\\treturn x\\n}\",\n \"func clamp(n, min, max int16) int16 {\\n\\tif n < min {\\n\\t\\treturn min\\n\\t} else if n > max {\\n\\t\\treturn max\\n\\t}\\n\\n\\treturn n\\n}\",\n \"func main() {\\n\\tvar minMax = func(n []int) (int, int) {\\n\\t\\tvar min, max int\\n\\n\\t\\tfor key, val := range n {\\n\\n\\t\\t\\tif key == 0 {\\n\\t\\t\\t\\tmin, max = val, val\\n\\t\\t\\t}\\n\\n\\t\\t\\tif val < min {\\n\\t\\t\\t\\tmin = val\\n\\t\\t\\t}\\n\\n\\t\\t\\tif val > max {\\n\\t\\t\\t\\tmax = val\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn min, max\\n\\t}\\n\\n\\tvar number = []int{10, 22, 3, 77, 1, 5}\\n\\n\\tvar min, max = minMax(number)\\n\\n\\tfmt.Printf(\\\"min : %d \\\", min)\\n\\tfmt.Printf(\\\"max : %d\\\", max)\\n}\",\n \"func MinMaxInt16(x, min, max int16) int16 { return x }\",\n \"func InRange(val, min, max float64) float64 {\\n\\tif val < min {\\n\\t\\treturn min\\n\\t} else if val > max {\\n\\t\\treturn max\\n\\t}\\n\\treturn val\\n}\",\n \"func (rn *RangedNumber) Min() int {\\n\\tif rn.min > rn.max {\\n\\t\\trn.Set(rn.max, rn.min)\\n\\t}\\n\\n\\treturn rn.min\\n}\",\n \"func testMaxMin(f interface{}) (passed, failed int, err error) {\\n\\tintArr := &pr.ArrayMatcher{M: &pr.KindMatcher{Kind: reflect.Int}}\\n\\twantFn := &pr.FuncMatcher{\\n\\t\\tIn: []pr.TypeMatcher{intArr},\\n\\t\\tOut: []pr.TypeMatcher{\\n\\t\\t\\t&pr.KindMatcher{Kind: reflect.Int},\\n\\t\\t\\t&pr.KindMatcher{Kind: reflect.Int},\\n\\t\\t},\\n\\t}\\n\\tif !wantFn.MatchType(reflect.TypeOf(f)) {\\n\\t\\treturn 0, 0, errors.New(\\\"want func([N]int)(min, max int)\\\")\\n\\t}\\n\\n\\tvalF := reflect.ValueOf(f)\\n\\tcallF := func(in reflect.Value) (max, min int) {\\n\\t\\targs := []reflect.Value{in.Elem()}\\n\\t\\tret := valF.Call(args)\\n\\t\\treturn int(ret[0].Int()), int(ret[1].Int())\\n\\t}\\n\\n\\tal := intArr.Len\\n\\tbuilder := func() *pr.IntArrayBuilder {\\n\\t\\treturn &pr.IntArrayBuilder{Count: al}\\n\\t}\\n\\n\\tfor _, test := range []struct {\\n\\t\\tname string\\n\\t\\tin *pr.IntArrayBuilder\\n\\t\\twantMin, wantMax int\\n\\t}{\\n\\t\\t{name: \\\"zero value\\\", wantMin: 0, wantMax: 0, in: builder()},\\n\\t\\t{name: \\\"straight up\\\", wantMin: 1, wantMax: al, in: builder().FillRange(1, 1)},\\n\\t\\t{name: \\\"straight down\\\", wantMin: -al, wantMax: -1, in: builder().FillRange(-1, -1)},\\n\\t\\t{name: \\\"shuffle\\\", wantMin: -al / 2, wantMax: -al/2 + al - 1, in: builder().FillRange(-al/2, 1).Shuffle()},\\n\\t} {\\n\\t\\tactualMax, actualMin := callF(test.in.Build())\\n\\t\\tif actualMin == test.wantMin && actualMax == test.wantMax {\\n\\t\\t\\tlog.Println(\\\"PASS:\\\", test.name)\\n\\t\\t\\tpassed++\\n\\t\\t} else {\\n\\t\\t\\tlog.Println(\\\"FAIL:\\\", test.name)\\n\\t\\t\\tfailed++\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\",\n \"func MinMaxUint(x, min, max uint) uint { return x }\",\n \"func Max(val, max any) bool { return valueCompare(val, max, \\\"<=\\\") }\",\n \"func min(a, b float64) float64 {\\n\\tif a < b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func Max(x, y int) int {\\n\\tif x < y {\\n\\t\\treturn y\\n\\t}\\n\\treturn x\\n}\",\n \"func MinMaxUint32(x, min, max uint32) uint32 { return x }\",\n \"func GetMinmax(target uint32, reset bool, format uint32, xtype uint32, values unsafe.Pointer) {\\n C.glowGetMinmax(gpGetMinmax, (C.GLenum)(target), (C.GLboolean)(boolToInt(reset)), (C.GLenum)(format), (C.GLenum)(xtype), values)\\n}\",\n \"func min(a, b int) int {\\n\\tif a > b {\\n\\t\\treturn b\\n\\t}\\n\\treturn a\\n}\",\n \"func (r SampleRateRange) Max() int {\\n\\treturn r.max\\n}\",\n \"func min(a, b uint64) uint64 {\\n\\tif a <= b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func (rn *RangedNumber) Max() int {\\n\\tif rn.min > rn.max {\\n\\t\\trn.Set(rn.max, rn.min)\\n\\t}\\n\\n\\treturn rn.max\\n}\",\n \"func GetRangeLimit() int {\\n\\treturn 25\\n}\",\n \"func Min(a, b float64) float64 {\\n\\tif a < b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func Min(a, b float64) float64 {\\n\\tif a < b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func Min(a, b float64) float64 {\\n\\tif a < b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func max(a, b float64) float64 {\\n\\tif a > b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func Clamp(value, min, max float32) float32 {\\n\\tvar res float32\\n\\tif value < min {\\n\\t\\tres = min\\n\\t} else {\\n\\t\\tres = value\\n\\t}\\n\\n\\tif res > max {\\n\\t\\treturn max\\n\\t}\\n\\n\\treturn res\\n}\",\n \"func getMinMaxScores(scores framework.NodeScoreList) (int64, int64) {\\n\\tvar max int64 = math.MinInt64 // Set to min value\\n\\tvar min int64 = math.MaxInt64 // Set to max value\\n\\n\\tfor _, nodeScore := range scores {\\n\\t\\tif nodeScore.Score > max {\\n\\t\\t\\tmax = nodeScore.Score\\n\\t\\t}\\n\\t\\tif nodeScore.Score < min {\\n\\t\\t\\tmin = nodeScore.Score\\n\\t\\t}\\n\\t}\\n\\t// return min and max scores\\n\\treturn min, max\\n}\",\n \"func minMax(values []float64) (x, y float64) {\\n\\tmin, max := numbers.MinMax(values)\\n\\tif math.IsNaN(min) {\\n\\t\\tmin = 0\\n\\t}\\n\\tif math.IsNaN(max) {\\n\\t\\tmax = 0\\n\\t}\\n\\treturn min, max\\n}\",\n \"func min(a, b int32) int32 {\\n\\tif a <= b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func axisMax(val int) (int, int) {\\n\\tif val < 10 {\\n\\t\\treturn 10, 1\\n\\t}\\n\\n\\t// If val is less than 100, return val rounded up to the next 10\\n\\tif val < 100 {\\n\\t\\tx := val % 10\\n\\t\\treturn val + 10 - x, 10\\n\\t}\\n\\n\\t// If val is less than 500, return val rounded up to the next 50\\n\\tif val < 500 {\\n\\t\\tx := val % 50\\n\\t\\treturn val + 50 - x, 50\\n\\t}\\n\\treturn 1000, 100\\n}\",\n \"func Max(x, y int) int {\\n\\tif y > x {\\n\\t\\treturn y\\n\\t}\\n\\treturn x\\n}\",\n \"func (qs ControlQS) IntabsmaxLt(v float64) ControlQS {\\n\\treturn qs.filter(`\\\"intabsmax\\\" <`, v)\\n}\",\n \"func (s *Slider) Min(min float32) *Slider {\\n\\ts.min = min\\n\\treturn s\\n}\",\n \"func Max(a int, b int) int {\\n\\tif a >= b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func Max(a uint64, b uint64) uint64 {\\n\\tif a > b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func min(x, y int) int {\\n\\tif x < y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func min(x, y int) int {\\n\\tif x < y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func min(x, y int) int {\\n\\tif x < y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func (self *ComponentScaleMinMax) SetScaleMinMax(minX interface{}, minY interface{}, maxX interface{}, maxY interface{}) {\\n self.Object.Call(\\\"setScaleMinMax\\\", minX, minY, maxX, maxY)\\n}\",\n \"func MaxFadeExtent(value int) *SimpleElement { return newSEInt(\\\"maxFadeExtent\\\", value) }\",\n \"func Min(a, b int) int {\\n\\tif a > b {\\n\\t\\treturn b\\n\\t}\\n\\treturn a\\n}\",\n \"func Min(a, b int) int {\\n\\tif a > b {\\n\\t\\treturn b\\n\\t}\\n\\treturn a\\n}\",\n \"func Min(a, b int) int {\\n\\tif a > b {\\n\\t\\treturn b\\n\\t}\\n\\treturn a\\n}\",\n \"func (r SampleRateRange) Min() int {\\n\\treturn r.min\\n}\",\n \"func (m Metric) MinLevel(val float64) int {\\n\\tif val < 0 {\\n\\t\\treturn maxLevel\\n\\t}\\n\\n\\tlevel := -(math.Ilogb(val/m.Deriv) >> uint(m.Dim-1))\\n\\tif level > maxLevel {\\n\\t\\tlevel = maxLevel\\n\\t}\\n\\tif level < 0 {\\n\\t\\tlevel = 0\\n\\t}\\n\\treturn level\\n}\",\n \"func (p *BW) MaxValue() uint16 {\\n\\treturn 1\\n}\",\n \"func min(x, y int) int {\\n\\tif x < y {\\n\\t\\treturn x\\n\\t} else {\\n\\t\\treturn y\\n\\t}\\n}\",\n \"func (p *analogPin) Range() (analog.Sample, analog.Sample) {\\n\\tmax := analog.Sample{Raw: math.MaxInt16, V: p.voltageMultiplier}\\n\\tmin := analog.Sample{Raw: -math.MaxInt16, V: -p.voltageMultiplier}\\n\\treturn min, max\\n}\",\n \"func max(a, b int) int {\\nif a < b {\\nreturn b\\n}\\nreturn a\\n}\",\n \"func max(x, y int) int {\\n\\tif x < y {\\n\\t\\treturn y\\n\\t}\\n\\treturn x\\n}\",\n \"func Max(x, y int64) int64 {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func Max(x, y int) int {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func Max(x, y int) int {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func Min(val, min any) bool { return valueCompare(val, min, \\\">=\\\") }\",\n \"func Max(a, b uint32) uint32 {\\n\\tif a > b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func max(x, y int64) int64 {\\n\\tif x < y {\\n\\t\\treturn y\\n\\t}\\n\\treturn x\\n}\",\n \"func Constrain(n, low, high float64) float64 {\\n\\treturn math.Max(math.Min(n, high), low)\\n}\",\n \"func MinFadeExtent(value int) *SimpleElement { return newSEInt(\\\"minFadeExtent\\\", value) }\",\n \"func Max(x, y int) int {\\n if x < y {\\n return y\\n }\\n return x\\n}\",\n \"func Max(a, b int) int {\\n\\tif a < b {\\n\\t\\treturn b\\n\\t}\\n\\treturn a\\n}\",\n \"func Max(a, b int) int {\\n\\tif a < b {\\n\\t\\treturn b\\n\\t}\\n\\treturn a\\n}\",\n \"func MinMax(array []int64) (int64, int64) {\\n\\tvar max = array[0]\\n\\tvar min = array[0]\\n\\tfor _, value := range array {\\n\\t\\tif max < value {\\n\\t\\t\\tmax = value\\n\\t\\t}\\n\\t\\tif min > value {\\n\\t\\t\\tmin = value\\n\\t\\t}\\n\\t}\\n\\treturn min, max\\n}\",\n \"func MinMax(array []int64) (int64, int64) {\\n\\tvar max = array[0]\\n\\tvar min = array[0]\\n\\tfor _, value := range array {\\n\\t\\tif max < value {\\n\\t\\t\\tmax = value\\n\\t\\t}\\n\\t\\tif min > value {\\n\\t\\t\\tmin = value\\n\\t\\t}\\n\\t}\\n\\treturn min, max\\n}\",\n \"func (qs ControlQS) IntabsmaxGe(v float64) ControlQS {\\n\\treturn qs.filter(`\\\"intabsmax\\\" >=`, v)\\n}\",\n \"func Min(a int, b int) int {\\n\\tif a <= b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func (r *SlidingWindow) Max() int {return r.base + len(r.values) - 1}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.74028397","0.6915779","0.66241217","0.6616075","0.6559249","0.64556175","0.6428241","0.6380175","0.6302906","0.62899035","0.62846214","0.626812","0.6259294","0.6231927","0.62230694","0.6221588","0.62114716","0.6209669","0.62021357","0.61924946","0.6184377","0.61504984","0.6121321","0.610572","0.6097324","0.6067848","0.60534674","0.6053458","0.604908","0.604908","0.604908","0.6045262","0.60385233","0.6034196","0.60319525","0.60312235","0.60280377","0.6017658","0.6013951","0.5997187","0.59907633","0.5989524","0.5986447","0.59608084","0.59539","0.59524137","0.5938257","0.59238064","0.5915482","0.5906259","0.5905962","0.5891361","0.5877097","0.5867715","0.5862276","0.58612895","0.5851052","0.5851052","0.5851052","0.5840789","0.5840633","0.5839013","0.5836535","0.5833627","0.582472","0.5821611","0.5818792","0.58139896","0.58085006","0.5801227","0.58003294","0.58003294","0.58003294","0.57992435","0.57977587","0.57963425","0.57963425","0.57963425","0.5790176","0.5788928","0.57857597","0.5781677","0.57771695","0.5776763","0.5772524","0.5771385","0.5771291","0.5771291","0.57688314","0.5767646","0.5766692","0.5759481","0.575732","0.57556516","0.57515675","0.57515675","0.5746868","0.5746868","0.5744077","0.57413155","0.5736198"],"string":"[\n \"0.74028397\",\n \"0.6915779\",\n \"0.66241217\",\n \"0.6616075\",\n \"0.6559249\",\n \"0.64556175\",\n \"0.6428241\",\n \"0.6380175\",\n \"0.6302906\",\n \"0.62899035\",\n \"0.62846214\",\n \"0.626812\",\n \"0.6259294\",\n \"0.6231927\",\n \"0.62230694\",\n \"0.6221588\",\n \"0.62114716\",\n \"0.6209669\",\n \"0.62021357\",\n \"0.61924946\",\n \"0.6184377\",\n \"0.61504984\",\n \"0.6121321\",\n \"0.610572\",\n \"0.6097324\",\n \"0.6067848\",\n \"0.60534674\",\n \"0.6053458\",\n \"0.604908\",\n \"0.604908\",\n \"0.604908\",\n \"0.6045262\",\n \"0.60385233\",\n \"0.6034196\",\n \"0.60319525\",\n \"0.60312235\",\n \"0.60280377\",\n \"0.6017658\",\n \"0.6013951\",\n \"0.5997187\",\n \"0.59907633\",\n \"0.5989524\",\n \"0.5986447\",\n \"0.59608084\",\n \"0.59539\",\n \"0.59524137\",\n \"0.5938257\",\n \"0.59238064\",\n \"0.5915482\",\n \"0.5906259\",\n \"0.5905962\",\n \"0.5891361\",\n \"0.5877097\",\n \"0.5867715\",\n \"0.5862276\",\n \"0.58612895\",\n \"0.5851052\",\n \"0.5851052\",\n \"0.5851052\",\n \"0.5840789\",\n \"0.5840633\",\n \"0.5839013\",\n \"0.5836535\",\n \"0.5833627\",\n \"0.582472\",\n \"0.5821611\",\n \"0.5818792\",\n \"0.58139896\",\n \"0.58085006\",\n \"0.5801227\",\n \"0.58003294\",\n \"0.58003294\",\n \"0.58003294\",\n \"0.57992435\",\n \"0.57977587\",\n \"0.57963425\",\n \"0.57963425\",\n \"0.57963425\",\n \"0.5790176\",\n \"0.5788928\",\n \"0.57857597\",\n \"0.5781677\",\n \"0.57771695\",\n \"0.5776763\",\n \"0.5772524\",\n \"0.5771385\",\n \"0.5771291\",\n \"0.5771291\",\n \"0.57688314\",\n \"0.5767646\",\n \"0.5766692\",\n \"0.5759481\",\n \"0.575732\",\n \"0.57556516\",\n \"0.57515675\",\n \"0.57515675\",\n \"0.5746868\",\n \"0.5746868\",\n \"0.5744077\",\n \"0.57413155\",\n \"0.5736198\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":983,"cells":{"query":{"kind":"string","value":"/ Max of min is: 59"},"document":{"kind":"string","value":"func firstNegSlidingWindows(arr []int, k int) {\n\tsize := len(arr)\n\tque := new(Queue)\n\ti := 0\n\tfor i < size {\n\t\t// Remove out of range elements\n\t\tif que.Len() > 0 && que.Front().(int) <= i-k {\n\t\t\tque.Remove()\n\t\t}\n\t\tif arr[i] < 0 {\n\t\t\tque.Add(i)\n\t\t}\n\t\t// window of size k\n\t\tif i >= (k - 1) {\n\t\t\tif que.Len() > 0 {\n\t\t\t\tfmt.Print(arr[que.Front().(int)], \" \")\n\t\t\t} else {\n\t\t\t\tfmt.Print(\"NAN \")\n\t\t\t}\n\t\t}\n\t\ti += 1\n\t}\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func normalizeMinutes(min int) (int, int) {\n\tflag := false\n\taddHours := 0\n\tif min < 0 {\n\t\tflag = !flag\n\t\tmin = -1 * min\n\t}\n\n\tif min >= 60 {\n\t\taddHours = min / 60\n\t\tmin = min % 60\n\t}\n\n\tif flag {\n\t\tif min > 0 {\n\t\t\tmin = 60 - min\n\t\t\taddHours += 1\n\t\t}\n\t\taddHours = -1 * addHours\n\t}\n\n\treturn min, addHours\n}","func (NilTimer) Min() int64 { return 0 }","func (tod *ValidatedTimeOfDay) Min() int {\n\treturn tod.min\n}","func getMinutes(time *int) int {\n\treturn getTimeScale(time, 60)\n}","func (c Clock) max24Hour() Clock {\n\tc = c % minutesInDay\n\tif int(c) < 0 {\n\t\treturn c + minutesInDay\n\t}\n\treturn c\n}","func (NilTimer) Max() int64 { return 0 }","func getRangeTime(agencyID int64) int {\n\n\tswitch agencyID {\n\tcase 14:\n\t\treturn 30\n\tcase 23:\n\t\treturn 10\n\tdefault:\n\t\treturn 10\n\t}\n\treturn 10\n}","func tzsetNum(s string, min, max int) (num int, rest string, ok bool) {\n\tif len(s) == 0 {\n\t\treturn 0, \"\", false\n\t}\n\tnum = 0\n\tfor i, r := range s {\n\t\tif r < '0' || r > '9' {\n\t\t\tif i == 0 || num < min {\n\t\t\t\treturn 0, \"\", false\n\t\t\t}\n\t\t\treturn num, s[i:], true\n\t\t}\n\t\tnum *= 10\n\t\tnum += int(r) - '0'\n\t\tif num > max {\n\t\t\treturn 0, \"\", false\n\t\t}\n\t}\n\tif num < min {\n\t\treturn 0, \"\", false\n\t}\n\treturn num, \"\", true\n}","func (et ExfatTimestamp) Minute() int {\n\treturn int(et&2016) >> 5\n}","func (o TransferJobScheduleStartTimeOfDayOutput) Minutes() pulumi.IntOutput {\n\treturn o.ApplyT(func(v TransferJobScheduleStartTimeOfDay) int { return v.Minutes }).(pulumi.IntOutput)\n}","func (t Time) Minute() int {}","func validateFieldDurationSchedule(fl validator.FieldLevel) bool {\n\tv := fl.Field().Int()\n\tif v < durationScheduleMinutesMin {\n\t\treturn false\n\t}\n\tif v > durationScheduleMinutesMax {\n\t\treturn false\n\t}\n\treturn true\n}","func min(data []int64) string {\n value := data[0]\n for _, n := range data {\n if n < value {\n value = n\n }\n }\n duration, _ := time.ParseDuration(fmt.Sprintf(\"%dns\", value))\n return fmt.Sprintf(\"%.3f\", duration.Seconds())\n}","func MinMax(x, min, max int) int { return x }","func normalize(hour, minute int) (int, int) {\n\tif minute < 0 || minute >= 60 {\n\t\thour += minute / 60\n\t\tminute = minute % 60\n\t}\n\tif minute < 0 {\n\t\tminute += 60\n\t\thour--\n\t}\n\tif hour < 0 || hour >= 24 {\n\t\thour = hour % 24\n\t\tif hour < 0 {\n\t\t\thour += 24\n\t\t}\n\t}\n\treturn hour, minute\n}","func (o BucketReplicationConfigRuleDestinationReplicationTimeTimeOutput) Minutes() pulumi.IntOutput {\n\treturn o.ApplyT(func(v BucketReplicationConfigRuleDestinationReplicationTimeTime) int { return v.Minutes }).(pulumi.IntOutput)\n}","func (tb *TimeBucket) Min() int64 { return tb.min }","func GetTimeRange() uint64 {\n\n\ttimeRange := Get(\"TimeRange\")\n\tif timeRange == \"\" {\n\t\treturn 3600\n\t}\n\n\tparsedTimeRange, err := strconv.ParseUint(timeRange, 10, 64)\n\tif err != nil {\n\t\tlog.Printf(\"[!] Failed to parse time range : %s\\n\", err.Error())\n\t\treturn 3600\n\t}\n\n\treturn parsedTimeRange\n\n}","func hour(n int) float64 { return float64(n * 60 * 60) }","func validateFieldDurationScheduleStr(fl validator.FieldLevel) bool {\n\tv, err := strconv.ParseInt(fl.Field().String(), 10, 32)\n\tif err != nil {\n\t\treturn false\n\t}\n\tif v < durationScheduleMinutesMin {\n\t\treturn false\n\t}\n\tif v > durationScheduleMinutesMax {\n\t\treturn false\n\t}\n\treturn true\n}","func (obj *interval) Max() int {\n\treturn obj.max\n}","func (p parseSpec) minMax() (int, int) {\n\tmaxVal := -math.MaxInt64\n\tminVal := math.MaxInt64\n\tfor _, v := range p {\n\t\tif v > maxVal {\n\t\t\tmaxVal = v\n\t\t} else if v < minVal {\n\t\t\tminVal = v\n\t\t}\n\t}\n\treturn minVal, maxVal\n}","func (o InstanceDenyMaintenancePeriodTimeOutput) Minutes() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v InstanceDenyMaintenancePeriodTime) *int { return v.Minutes }).(pulumi.IntPtrOutput)\n}","func NsMinutes(count int64) int64 { return NsSeconds(count * 60) }","func min(a time.Duration, b time.Duration) time.Duration {\n\tif a > b {\n\t\treturn b\n\t}\n\treturn a\n}","func (obj *interval) Min() int {\n\treturn obj.min\n}","func ToSlabRange(res Resolution, sTime time.Time, eTime time.Time) []string {\n\toutStr := []string{}\n\tonT := sTime.UTC()\n\tuseEnd := eTime.UTC()\n\tswitch res {\n\tcase Resolution_MIN:\n\t\tuseEnd = useEnd.Add(time.Minute * 1) // need to include the end\n\t\tfor onT.Before(useEnd) {\n\t\t\toutStr = append(outStr, onT.Format(\"200601021504\"))\n\t\t\tonT = onT.Add(time.Minute * 1)\n\t\t}\n\t\treturn outStr\n\tcase Resolution_MIN5:\n\t\tuseEnd = useEnd.Add(time.Minute * 5) // need to include the end\n\t\tfor onT.Before(useEnd) {\n\t\t\tm := onT.Minute() / 5\n\t\t\toutStr = append(outStr, onT.Format(\"2006010215\")+\"I5\"+strconv.Itoa(m))\n\t\t\tonT = onT.Add(time.Minute * 5)\n\t\t}\n\t\treturn outStr\n\tcase Resolution_MIN10:\n\t\tuseEnd = useEnd.Add(time.Minute * 10) // need to include the end\n\t\tfor onT.Before(useEnd) {\n\t\t\tm := onT.Minute() / 10\n\t\t\toutStr = append(outStr, onT.Format(\"2006010215\")+\"I10\"+strconv.Itoa(m))\n\t\t\tonT = onT.Add(time.Minute * 10)\n\t\t}\n\t\treturn outStr\n\tcase Resolution_MIN15:\n\t\tuseEnd = useEnd.Add(time.Minute * 15) // need to include the end\n\t\tfor onT.Before(useEnd) {\n\t\t\tm := onT.Minute() / 15\n\t\t\toutStr = append(outStr, onT.Format(\"2006010215\")+\"I15\"+strconv.Itoa(m))\n\t\t\tonT = onT.Add(time.Minute * 15)\n\t\t}\n\t\treturn outStr\n\tcase Resolution_MIN20:\n\t\tuseEnd = useEnd.Add(time.Minute * 20) // need to include the end\n\t\tfor onT.Before(useEnd) {\n\t\t\tm := onT.Minute() / 20\n\t\t\toutStr = append(outStr, onT.Format(\"2006010215\")+\"I20\"+strconv.Itoa(m))\n\t\t\tonT = onT.Add(time.Minute * 20)\n\t\t}\n\t\treturn outStr\n\tcase Resolution_MIN30:\n\t\tuseEnd = useEnd.Add(time.Minute * 30) // need to include the end\n\t\tfor onT.Before(useEnd) {\n\t\t\tm := onT.Minute() / 30\n\t\t\toutStr = append(outStr, onT.Format(\"2006010215\")+\"I30\"+strconv.Itoa(m))\n\t\t\tonT = onT.Add(time.Minute * 30)\n\t\t}\n\t\treturn outStr\n\tcase Resolution_DAY:\n\t\tuseEnd = useEnd.AddDate(0, 0, 1) // need to include the end\n\t\tfor onT.Before(useEnd) {\n\t\t\toutStr = append(outStr, onT.Format(\"20060102\"))\n\t\t\tonT = onT.AddDate(0, 0, 1)\n\t\t}\n\t\treturn outStr\n\tcase Resolution_WEEK:\n\t\tuseEnd = useEnd.AddDate(0, 0, 7) // need to include the end\n\t\tfor onT.Before(useEnd) {\n\t\t\tynum, wnum := onT.ISOWeek()\n\t\t\toutStr = append(outStr, fmt.Sprintf(\"%04d%02d\", ynum, wnum))\n\t\t\tonT = onT.AddDate(0, 0, 7)\n\t\t}\n\t\treturn outStr\n\tcase Resolution_MONTH:\n\t\tuseEnd = useEnd.AddDate(0, 1, 0) // need to include the end\n\t\tfor onT.Before(useEnd) {\n\t\t\toutStr = append(outStr, onT.Format(\"200601\"))\n\t\t\tonT = onT.AddDate(0, 1, 0)\n\t\t}\n\t\treturn outStr\n\tcase Resolution_MONTH2:\n\t\tuseEnd = useEnd.AddDate(0, 2, 0) // need to include the end\n\t\tfor onT.Before(useEnd) {\n\t\t\tm := (int(onT.Month()) / 2)\n\t\t\toutStr = append(outStr, onT.Format(\"2006\")+\"M2\"+strconv.Itoa(m))\n\t\t\tonT = onT.AddDate(0, 2, 0)\n\t\t}\n\t\treturn outStr\n\tcase Resolution_MONTH3:\n\t\tuseEnd = useEnd.AddDate(0, 3, 0) // need to include the end\n\t\tfor onT.Before(eTime) {\n\t\t\tm := (int(onT.Month()) / 3)\n\t\t\toutStr = append(outStr, onT.Format(\"2006\")+\"M3\"+strconv.Itoa(m))\n\t\t\tonT = onT.AddDate(0, 3, 0)\n\t\t}\n\t\treturn outStr\n\tcase Resolution_MONTH6:\n\t\tuseEnd = useEnd.AddDate(0, 6, 0) // need to include the end\n\t\tfor onT.Before(useEnd) {\n\t\t\tm := (int(onT.Month()) / 6)\n\t\t\toutStr = append(outStr, onT.Format(\"2006\")+\"M6\"+strconv.Itoa(m))\n\t\t\tonT = onT.AddDate(0, 6, 0)\n\t\t}\n\t\treturn outStr\n\tcase Resolution_YEAR:\n\t\tuseEnd = useEnd.AddDate(1, 0, 0) // need to include the end\n\t\tfor onT.Before(useEnd) {\n\t\t\toutStr = append(outStr, onT.Format(\"2006\"))\n\t\t\tonT = onT.AddDate(1, 0, 0)\n\t\t}\n\t\treturn outStr\n\tcase Resolution_ALL:\n\t\treturn []string{\"ALL\"}\n\n\t//default is hourly\n\tdefault:\n\t\tuseEnd = useEnd.Add(time.Hour) // need to include the end\n\t\tfor onT.Before(eTime) {\n\t\t\toutStr = append(outStr, onT.Format(\"2006010215\"))\n\t\t\tonT = onT.Add(time.Hour)\n\t\t}\n\t\treturn outStr\n\t}\n}","func validateRange(value, field string, max int) (int, error) {\n\tn, err := strconv.Atoi(value)\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\tif (n < 1) || (n > max) {\n\t\treturn 0, fmt.Errorf(\"field %v=%v but available range [%v - %v]\", field, n, 1, max)\n\t}\n\treturn n, nil\n}","func normalize(hour, minute int) (int, int) {\n\n\t// total minutes are remaining\n\tminutesNormalized := minute % 60\n\n\t// total hours are remaining; don't care about days\n\thoursNormalized := (hour + minute/60) % 24\n\n\t// if remaining hours are negative, add the negative hours to the total hours in day\n\tif hoursNormalized < 0 {\n\t\thoursNormalized = 24 + hoursNormalized\n\t}\n\n\t// if remaining minutes are negative, add the negaive minutes to the total minutes in one hour\n\tif minutesNormalized < 0 {\n\t\tminutesNormalized = 60 + minutesNormalized\n\t\t// when subtracting from minutes, the hour goes down by one\n\t\t// before lowering the hour make, sure the value is 24 and not 0\n\t\tif hoursNormalized == 0 {\n\t\t\thoursNormalized = 24\n\t\t}\n\t\t// lower hours by one\n\t\thoursNormalized--\n\t}\n\n\treturn hoursNormalized, minutesNormalized\n}","func Past(h, m, s int) int {\n\tvar sum int\n\tif h >= 1 && m >= 1 && s >= 1 {\n\t\th = (h * 60 * 60 * 1000)\n\t\tm = (m * 60 * 1000)\n\t\ts = s * 1000\n\t\tsum += h + m + s\n\t} else if h <= 0 && m >= 1 && s >= 1 {\n\t\tm = (m * 60 * 1000)\n\t\ts = s * 1000\n\t\tsum += h + m + s\n\t} else if h >= 1 && m == 0 && s == 0 {\n\t\th = (h * 60 * 60 * 1000)\n\t\tm = (m * 0)\n\t\ts = (s * 0)\n\t\tsum += h + m + s\n\t} else if m <= 0 && h >= 1 && s >= 1 {\n\t\th = (h * 60 * 60 * 1000)\n\t\ts = s * 1000\n\t\tsum += h + m + s\n\t} else if s <= 0 && m >= 1 && h >= 1 {\n\t\th = (h * 60 * 60 * 1000)\n\t\tm = (m * 60 * 1000)\n\t\tsum += h + m + s\n\t} else if h == 0 && m == 0 && s == 0 {\n\t\th = (h * 0)\n\t\tm = (m * 0)\n\t\ts = (s * 0)\n\t\tsum += h + m + s\n\t}\n\n\treturn sum\n}","func checkTimeRange(db *db.DB, mint, maxt int64) (int64, int64) {\n\n\tlogger := log.With(logger, \"stage\", \"checkTimeRange\")\n\n\tvar actualMint int64 = math.MaxInt64\n\tvar actualMaxt int64 = math.MinInt64\n\n\tif db.ReadOnly {\n\t\tblocks, _ := db.BlockReader()\n\t\t//Look time ranges for blocks\n\t\tfor _, block := range blocks {\n\t\t\tif actualMint > block.Meta().MinTime {\n\t\t\t\tactualMint = block.Meta().MinTime\n\t\t\t}\n\n\t\t\tif actualMaxt < block.Meta().MaxTime {\n\t\t\t\tactualMaxt = block.Meta().MaxTime\n\t\t\t}\n\t\t}\n\t} else {\n\t\tblocks := db.Blocks()\n\t\t//Look time ranges for blocks\n\t\tfor _, block := range blocks {\n\t\t\tif actualMint > block.Meta().MinTime {\n\t\t\t\tactualMint = block.Meta().MinTime\n\t\t\t}\n\n\t\t\tif actualMaxt < block.Meta().MaxTime {\n\t\t\t\tactualMaxt = block.Meta().MaxTime\n\t\t\t}\n\t\t}\n\t}\n\n\tlogger.Log(\"status\", fmt.Sprintf(\"According to Blocks Mint: %d, Maxt: %d\", actualMint, actualMaxt))\n\n\thead := db.Head() // If tsdb opened in write mode\n\tif head != nil {\n\t\t//Look the time range for head\n\t\tif head.MinTime() < actualMint {\n\t\t\tactualMint = head.MinTime()\n\t\t}\n\n\t\tif head.MaxTime() > actualMaxt {\n\t\t\tactualMaxt = head.MaxTime()\n\t\t}\n\n\t\tlogger.Log(\"status\", fmt.Sprintf(\"According to Head Mint: %d, Maxt: %d\", actualMint, actualMaxt))\n\t}\n\n\tif actualMint < mint {\n\t\tactualMint = mint\n\t} // else use calculated actualMint\n\n\tif actualMaxt > maxt {\n\t\tactualMaxt = maxt\n\t} // else use calculated actualMaxt\n\n\treturn actualMint, actualMaxt\n\n}","func (tb *TimeBucket) Max() int64 { return tb.max }","func toUnixMsec(t time.Time) int64 {\n\treturn t.UnixNano() / 1e6\n}","func parseTimeWindowLimit(rawLimit uint64, timeMult float64) float64 {\n\n\t//This is taken from the Intel SDM, Vol 3B 14.9.3\n\t/*\n\t\tTime limit = 2^Y * (1.0 + Z/4.0) * Time_Unit\n\n\t\tHere “Y” is the unsigned integer value represented by bits 21:17,\n\t\t“Z” is an unsigned integer represented by bits 23:22.\n\t\t“Time_Unit” is specified by the “Time Units” field of MSR_RAPL_POWER_UNIT.\n\t*/\n\ty := float64(rawLimit & 0x1f)\n\tz := float64(rawLimit >> 5 & 0x3)\n\treturn math.Pow(2, y) * (1.0 + (z / 4.0)) * timeMult\n\n}","func (r *Retry) min(a, b uint64) uint64 {\n\tif a > b {\n\t\treturn b\n\t}\n\treturn a\n}","func validateFieldDurationService(fl validator.FieldLevel) bool {\n\tv, err := strconv.ParseInt(fl.Field().String(), 10, 32)\n\tif err != nil {\n\t\treturn false\n\t}\n\tif v < durationServiceMinutesMin {\n\t\treturn false\n\t}\n\tif v > durationServiceMinutesMax {\n\t\treturn false\n\t}\n\treturn true\n}","func getRange(min, max int) int {\n\treturn max * min\n}","func parseIntegerParameterRange(input string) (*IntegerParameterRange, error) {\n\tvar start, end int\n\n\tvar err error\n\tif strings.Index(input, \"-\") >= 0 {\n\t\tarray := strings.Split(input, \"-\")\n\t\tif len(array) != 2 {\n\t\t\terr = errors.New(\"Failed to split the string type\")\n\t\t\treturn nil, err\n\t\t}\n\n\t\tif start, err = strconv.Atoi(array[0]); err != nil {\n\t\t\t// negative values must be dropped here\n\t\t\treturn nil, err\n\t\t}\n\t\tif end, err = strconv.Atoi(array[1]); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t} else {\n\t\tif start, err = strconv.Atoi(input); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tend = start\n\t}\n\n\tif start > end {\n\t\terr = errors.New(\"The 'max-config-values' attributes MUST be greater or equal to their counterpart in 'min-config-values' attributes.\")\n\t\treturn nil, err\n\t}\n\n\treturn &IntegerParameterRange{\n\t\tstart: start,\n\t\tend: end,\n\t}, nil\n}","func Min(x, min int) int { return x }","func MinMaxDiff(vals []string) int {\n\tmin, _ := strconv.Atoi(vals[0])\n\tmax := min\n\tfor _, v := range vals {\n\t\td, err := strconv.Atoi(v)\n\t\tif err != nil {\n\t\t\tpanic(\"could not parse number!\")\n\t\t}\n\t\tif int(d) < min {\n\t\t\tmin = int(d)\n\t\t} else if int(d) > max {\n\t\t\tmax = int(d)\n\t\t}\n\t}\n\n\treturn max - min\n}","func minDuration(a, b time.Duration) time.Duration {\n\tif a < b {\n\t\treturn a\n\t}\n\treturn b\n}","func (minutes Minutes) Validate() bool {\n\tret := true\n\tif !validation.ValidateInt(minutes.value) ||\n\t\t!validation.CheckRange(minutes.value, 0, 99) {\n\t\tret = false\n\t}\n\treturn ret\n}","func ValidBetween(min, max int) ValidatorFunc {\n\tvar EInvalidInterval = errors.New(\n\t\tfmt.Sprintf(\"must be integer between %d and %d\", min, max))\n\treturn func(field FormField, ctx context.Context) error {\n\t\tvalue, err := field.GetInt()\n\t\tif err != nil {\n\t\t\treturn EInvalidInteger\n\t\t}\n\t\tif value < min || value > max {\n\t\t\treturn EInvalidInterval\n\t\t}\n\t\treturn nil\n\t}\n}","func (f *Formatter) Minutes() string {\n\tvar format string\n\tif f.withoutUnit {\n\t\tformat = \"%d\\n\"\n\t} else {\n\t\tformat = \"%d minutes\\n\"\n\t}\n\treturn fmt.Sprintf(format, int(f.duration.Minutes()))\n}","func (o BucketReplicationConfigurationRuleDestinationReplicationTimeOutput) Minutes() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v BucketReplicationConfigurationRuleDestinationReplicationTime) *int { return v.Minutes }).(pulumi.IntPtrOutput)\n}","func secToMins(t ClockTime) (mins, secs uint) {\n\tmins = uint(t) / 60\n\tsecs = uint(t) % 60\n\n\treturn mins, secs\n}","func Min(val, min any) bool { return valueCompare(val, min, \">=\") }","func getMinTimeDuration(durationFirst, durationSecond time.Duration) time.Duration {\n\tif durationFirst <= durationSecond {\n\t\treturn durationFirst\n\t}\n\treturn durationSecond\n}","func (o InstanceMaintenanceWindowStartTimeOutput) Minutes() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v InstanceMaintenanceWindowStartTime) *int { return v.Minutes }).(pulumi.IntPtrOutput)\n}","func getDurationWithin(min, max int) time.Duration {\n\tjitter := max - min\n\tif jitter <= 0 {\n\t\tjitter = 1\n\t}\n\tduration := rand.Intn(jitter) + min\n\treturn time.Duration(duration) * time.Second\n}","func NsHours(count int64) int64 { return NsMinutes(count * 60) }","func (t *TimerSnapshot) Min() int64 { return t.histogram.Min() }","func MinMax(w http.ResponseWriter, req *http.Request) {\r\n\r\n minmax_templ.Execute(w, req.FormValue(\"s\"))\r\n if req.FormValue != nil {\r\n min, max, sum := minmax.FindMinmax(req.FormValue(\"s\"))\r\n if min != 0 && max != 0 && sum != 0 {\r\n fmt.Fprintf(w, \"%d %d %d\", min, max, sum)\r\n }\r\n }\r\n \r\n}","func (dv *DurationValue) Min(min time.Duration) *DurationValue {\n\tdv.v.add(func() error {\n\t\tif n := dv.get(); n < min {\n\t\t\treturn fmt.Errorf(\"less than %s: %s\", min, n)\n\t\t}\n\t\treturn nil\n\t})\n\treturn dv\n}","func (xt XSDTime) Minute() int {\n\treturn xt.innerTime.Minute()\n}","func (this *MillisToUTC) MinArgs() int { return 1 }","func (c Clock) Minute() int {\n\tr := time.Duration(c) % time.Hour\n\treturn int(r / time.Minute)\n}","func MinimumFinishTime(tires [][]int, changeTime int, numLaps int) int {\n\tvar l int = len(tires)\n\tvar dp []int = make([]int,numLaps + 1)//dp[i], 跑i圈的最短时间\n\tfor i := 0;i <= numLaps;i++{\n\t\tdp[i] = 2147483647\n\t}\n\t//var factor int = 0\n\tvar eachround_time int = 2147483647\n\tfor i := 0;i < l;i++{\n\t\tif tires[i][0] < eachround_time{\n\t\t\teachround_time = tires[i][0]\n\t\t\t//factor = tires[i][1]\n\t\t}\n\t}\n\t//var total int = eachround_time\n\tvar neg bool = false\n\tfor i := 1;i <= numLaps;i++{\n\t\tif !neg{\n\t\t\tfor k := 0;k < l;k++{\n\t\t\t\ta1 := tires[k][0]\n\t\t\t\tan := tires[k][0] * int(math.Pow(float64(tires[k][1]),float64(i - 1)))\n\t\t\t\tsn := (an * tires[k][1] - a1)/(tires[k][1] - 1)\n\t\t\t\tif sn > 0 && sn < 2147483647{\n\t\t\t\t\tdp[i] = min_int(dp[i],sn)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif dp[i] < 0{\n\t\t\tneg = true\n\t\t\tdp[i] = 2147483647\n\t\t}\n\n\t\t//change_perround := changeTime * (i - 1) + eachround_time * i\n\t\t//if change_perround > 0{\n\t\t//\tdp[i] = change_perround\n\t\t//}\n\t\t//if total > 0{\n\t\t//\tdp[i] = min_int(dp[i],total)\n\t\t//}\n\t\t//eachround_time *= factor\n\t\t//total += eachround_time\n\t\tfor j := 1;j < i;j++{\n\t\t\tdp[i] = min_int(dp[i],dp[j] + dp[i - j] + changeTime)\n\t\t}\n\t}\n\treturn dp[numLaps]\n}","func LimitPerMinute(t time.Time) time.Time {\n\treturn time.Date(t.Year(), t.Month(), t.Day(), t.Hour(), t.Minute(), 0, 0, t.Location())\n}","func MinMaxUint(x, min, max uint) uint { return x }","func absClock(abs uint64) (hour, min, sec int) {\n\tsec = int(abs % secondsPerDay)\n\thour = sec / secondsPerHour\n\tsec -= hour * secondsPerHour\n\tmin = sec / secondsPerMinute\n\tsec -= min * secondsPerMinute\n\treturn\n}","func (k *Key) RangeTime(defaultVal, min, max time.Time) time.Time {\n\treturn k.RangeTimeFormat(time.RFC3339, defaultVal, min, max)\n}","func NewMinute(t time.Time, lsw, dut1 int) (Minute, error) {\n\tt = t.UTC() // Don't care about local times\n\tmin := Minute{\n\t\tTime: t,\n\t\tlsw: lsw == 1,\n\t\tdut1: dut1,\n\t}\n\tbits := min.bits[:]\n\n\tmarkers := []int{9, 19, 29, 39, 49, 59} // P1-P6\n\tbits[0] = bitNone // Minute mark\n\tfor _, v := range markers {\n\t\tbits[v] = bitMarker\n\t}\n\n\tmidnight := time.Date(t.Year(), t.Month(), t.Day(), 0, 0, 0, 0, time.UTC)\n\tendOfDay := midnight.AddDate(0, 0, 1)\n\n\tdst1 := 0 // DST status at 00:00Z today\n\tif isDST(midnight) {\n\t\tdst1 = 1\n\t}\n\tdst2 := 0 // DST status at 24:00Z today\n\tif isDST(endOfDay) {\n\t\tdst2 = 1\n\t}\n\n\tyear1s := t.Year() % 10\n\tyear10s := t.Year()%100 - year1s\n\n\tminute1s := t.Minute() % 10\n\tminute10s := t.Minute()%100 - minute1s\n\n\thour1s := t.Hour() % 10\n\thour10s := t.Hour()%100 - hour1s\n\n\tdayOfYear1s := t.YearDay() % 10\n\tdayOfYear10s := t.YearDay()%100 - dayOfYear1s\n\tdayOfYear100s := t.YearDay()%1000 - dayOfYear1s - dayOfYear10s\n\n\tdut1Sign, dut1Magnitude := 1, dut1 // dut1Sign is positive\n\tif dut1 < 0 {\n\t\tdut1Sign = 0\n\t\tdut1Magnitude *= -1\n\t}\n\tif dut1Magnitude > 7 {\n\t\tdut1Magnitude = 7 // Only 3 bits for this value.\n\t}\n\n\terr := minuteEncoder.encode(bits, []int{\n\t\t0, 0, dst1, lsw, year1s, 0, 0,\n\t\tminute1s, minute10s, 0, 0,\n\t\thour1s, hour10s, 0, 0,\n\t\tdayOfYear1s, dayOfYear10s, 0,\n\t\tdayOfYear100s, 0, 0,\n\t\tdut1Sign, year10s, dst2, dut1Magnitude, 0,\n\t})\n\tif err != nil {\n\t\treturn min, errors.Wrapf(err, \"Cannot encode minute %s\", t.Format(\"15:04\"))\n\t}\n\n\tmin.lastSecond = lastSecond(t, min.lsw)\n\n\treturn min, nil\n}","func mesIntFunc() int {\n\tenero := 31\n\tfebrero := 28\n\tmarzo := 31\n\tabril := 30\n\tmayo := 31\n\tjunio := 30\n\tjulio := 31\n\tagosto := 31\n\tseptiembre := 30\n\toctubre := 31\n\tnoviembre := 30\n\tdiciembre := 31\n\t_, mes, _ := time.Now().Date()\n\tswitch {\n\tcase mes == time.January:\n\t\treturn enero\n\tcase mes == time.February:\n\t\treturn enero + febrero\n\tcase mes == time.March:\n\t\treturn enero + febrero + marzo\n\tcase mes == time.April:\n\t\treturn enero + febrero + marzo + abril\n\tcase mes == time.May:\n\t\treturn enero + febrero + marzo + abril + mayo\n\tcase mes == time.June:\n\t\treturn enero + febrero + marzo + abril + mayo + junio\n\tcase mes == time.July:\n\t\treturn enero + febrero + marzo + abril + mayo + junio + julio\n\tcase mes == time.August:\n\t\treturn enero + febrero + marzo + abril + mayo + junio + julio + agosto\n\tcase mes == time.September:\n\t\treturn enero + febrero + marzo + abril + mayo + junio + julio + agosto + septiembre\n\tcase mes == time.October:\n\t\treturn enero + febrero + marzo + abril + mayo + junio + julio + agosto + septiembre + octubre\n\tcase mes == time.November:\n\t\treturn enero + febrero + marzo + abril + mayo + junio + julio + agosto + septiembre + octubre + noviembre\n\tcase mes == time.December:\n\t\treturn enero + febrero + marzo + abril + mayo + junio + julio + agosto + septiembre + octubre + noviembre + diciembre\n\t}\n\treturn 0\n}","func (c *Job) Minutes() *Job {\n\tif c.delayUnit == delayNone {\n\t\tc.unit = minutes\n\t} else {\n\t\tc.delayUnit = delayMinutes\n\t}\n\treturn c\n}","func (o BucketV2ReplicationConfigurationRuleDestinationReplicationTimeOutput) Minutes() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v BucketV2ReplicationConfigurationRuleDestinationReplicationTime) *int { return v.Minutes }).(pulumi.IntPtrOutput)\n}","func (m *sdt) Minute() int32 {\n\treturn m.minuteField\n}","func MinMaxInt64(x, min, max int64) int64 { return x }","func GetMaxBlockGenerationTime() int64 {\r\n\treturn converter.StrToInt64(SysString(MaxBlockGenerationTime))\r\n}","func Min(min time.Duration) exponentialOption {\n\treturn func(e *Exponential) {\n\t\te.min = min\n\t}\n}","func normalizeHours(hrs int) int {\n\tflag := false\n\n\tif hrs < 0 {\n\t\tflag = !flag\n\t\thrs = -1 * hrs\n\t}\n\n\thrs = hrs % 24\n\n\tif flag && hrs > 0 {\n\t\thrs = 24 - hrs\n\t}\n\n\treturn hrs\n}","func NewMaxOrMinDec(negative bool, prec, frac int) *MyDecimal {\n\tstr := make([]byte, prec+2)\n\tfor i := 0; i < len(str); i++ {\n\t\tstr[i] = '9'\n\t}\n\tif negative {\n\t\tstr[0] = '-'\n\t} else {\n\t\tstr[0] = '+'\n\t}\n\tstr[1+prec-frac] = '.'\n\tdec := new(MyDecimal)\n\terr := dec.FromString(str)\n\tterror.Log(errors.Trace(err))\n\treturn dec\n}","func (k *Key) RangeTimeFormat(format string, defaultVal, min, max time.Time) time.Time {\n\tval := k.MustTimeFormat(format)\n\tif val.Unix() < min.Unix() || val.Unix() > max.Unix() {\n\t\treturn defaultVal\n\t}\n\treturn val\n}","func Minute(minute int) string {\n\tt := parsedTime(minute)\n\treturn t.Format(\"04\")\n}","func MinMaxInt8(x, min, max int8) int8 { return x }","func main() {\n\tconst now = 1589570165\n\n\ttimeStamp := time.Unix(now, 0).UTC()\n\n\tscanner := bufio.NewScanner(os.Stdin)\n\tscanner.Scan()\n\ts := scanner.Text()\n\n\telapsedTime := strings.Replace(s, \"мин.\", \"m\", 1)\n\telapsedTime = strings.Replace(elapsedTime, \"сек.\", \"s\", 1)\n\telapsedTime = strings.Replace(elapsedTime, \" \", \"\", -1)\n\n\tdur, err := time.ParseDuration(elapsedTime)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\t//dur.Round(time.Hour).Hours()\n\tunitedDate := timeStamp.Add(dur)\n\n\tfmt.Println(unitedDate.Format(time.UnixDate))\n\n}","func (c *cursor) blockMinTime(pos uint32) int64 {\n\treturn int64(btou64(c.f.mmap[pos+12 : pos+20]))\n}","func (j *Job) Minutes() (job *Job) {\n\tj.unit = JOB_UNIT_TYPE_MINUTE\n\treturn j\n}","func (o SnapshotPolicyHourlyScheduleOutput) Minute() pulumi.IntOutput {\n\treturn o.ApplyT(func(v SnapshotPolicyHourlySchedule) int { return v.Minute }).(pulumi.IntOutput)\n}","func parseClock(s string) (int, error) {\n\tclock := 0\n\n\tfor s != \"\" {\n\t\tcomponent, rest := splitOnce(s, \":\")\n\n\t\tn, err := strconv.Atoi(component)\n\t\tif err != nil {\n\t\t\treturn 0, err\n\t\t}\n\n\t\tclock *= 60\n\t\tclock += int(n)\n\n\t\ts = rest\n\t}\n\n\treturn clock, nil\n}","func validateFieldTimeUnix(fl validator.FieldLevel) bool {\n\tv := ParseTimeUnixUTC(fl.Field().String())\n\tif v.IsZero() {\n\t\treturn false\n\t}\n\treturn v.Unix() > unixTimeMin\n}","func (s *Value) asRangeInt(min, max int64) (int64, error) {\n\tif s == nil {\n\t\treturn 0, fmt.Errorf(\"value is required in the range of [%d..%d]\", min, max)\n\t}\n\tn, err := ParseInt(s.Name)\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\ti, err := n.Int()\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\tif i < min || i > max {\n\t\treturn 0, fmt.Errorf(\"value %s out of range [%d..%d]\", s.Name, min, max)\n\t}\n\treturn i, nil\n}","func inMeshCap(slot time.Duration) float64 {\n\treturn float64((3600 * time.Second) / slot)\n}","func dealDurationBounds(size abi.PaddedPieceSize) (min abi.ChainEpoch, max abi.ChainEpoch) {\n\treturn abi.ChainEpoch(180 * builtin.EpochsInDay), abi.ChainEpoch(540 * builtin.EpochsInDay) // PARAM_FINISH\n}","func (o TransferJobScheduleStartTimeOfDayPtrOutput) Minutes() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v *TransferJobScheduleStartTimeOfDay) *int {\n\t\tif v == nil {\n\t\t\treturn nil\n\t\t}\n\t\treturn &v.Minutes\n\t}).(pulumi.IntPtrOutput)\n}","func (t *TimerSnapshot) Max() int64 { return t.histogram.Max() }","func Int(i *int, title, id, class string, min, max, step float64, valid Validator) (jquery.JQuery, error) {\n\tj := jq(\"<input>\").AddClass(ClassPrefix + \"-int\").AddClass(class)\n\tj.SetAttr(\"title\", title).SetAttr(\"id\", id)\n\tj.SetAttr(\"type\", \"number\")\n\tif !math.IsNaN(min) {\n\t\tj.SetAttr(\"min\", int(min))\n\t}\n\tif !math.IsNaN(max) {\n\t\tj.SetAttr(\"max\", int(max))\n\t}\n\tif !math.IsNaN(step) {\n\t\tj.SetAttr(\"step\", int(step))\n\t}\n\tj.SetAttr(\"value\", *i)\n\tj.SetData(\"prev\", *i)\n\tj.Call(jquery.CHANGE, func(event jquery.Event) {\n\t\tval := event.Target.Get(\"value\").String()\n\t\tnewI, e := strconv.Atoi(val)\n\t\tif e != nil {\n\t\t\tf, e := strconv.ParseFloat(val, 64)\n\t\t\tif e != nil {\n\t\t\t\tpanic(fmt.Errorf(\"value '%s' has invalid type, expected a number\", val))\n\t\t\t}\n\t\t\t// Truncate to int\n\t\t\tnewI = int(f)\n\t\t\tj.SetVal(newI)\n\t\t}\n\t\t// Need to check for min and max ourselves because html min and max are easy to get around\n\t\tisValid := valid == nil || valid.Validate(newI)\n\t\tisToLow := !math.IsNaN(min) && newI < int(min)\n\t\tisToHigh := !math.IsNaN(max) && newI > int(max)\n\t\tif !isValid || isToLow || isToHigh {\n\t\t\tnewI = int(j.Data(\"prev\").(float64))\n\t\t\tj.SetVal(newI)\n\t\t}\n\t\t*i = newI\n\t\tj.SetData(\"prev\", newI)\n\t})\n\treturn j, nil\n}","func max(data []int64) string {\n var value int64\n for _, n := range data {\n if n > value {\n value = n\n }\n }\n duration, _ := time.ParseDuration(fmt.Sprintf(\"%dns\", value))\n return fmt.Sprintf(\"%.3f\", duration.Seconds())\n}","func max(x int) int {\n\treturn 40 + x\n}","func (o SnapshotPolicyDailyScheduleOutput) Minute() pulumi.IntOutput {\n\treturn o.ApplyT(func(v SnapshotPolicyDailySchedule) int { return v.Minute }).(pulumi.IntOutput)\n}","func getExponentialTime(min time.Duration, max time.Duration, attempts int) time.Duration {\n\tif min <= 0 {\n\t\tmin = 100 * time.Millisecond\n\t}\n\tif max <= 0 {\n\t\tmax = 10 * time.Second\n\t}\n\tminFloat := float64(min)\n\tnapDuration := minFloat * math.Pow(2, float64(attempts-1))\n\t// add some jitter\n\tnapDuration += rand.Float64()*minFloat - (minFloat / 2)\n\tif napDuration > float64(max) {\n\t\treturn time.Duration(max)\n\t}\n\treturn time.Duration(napDuration)\n}","func (rn *RangedNumber) Min() int {\n\tif rn.min > rn.max {\n\t\trn.Set(rn.max, rn.min)\n\t}\n\n\treturn rn.min\n}","func (m *Minute) Type() sql.Type { return sql.Int32 }","func (o GetSnapshotPolicyHourlyScheduleOutput) Minute() pulumi.IntOutput {\n\treturn o.ApplyT(func(v GetSnapshotPolicyHourlySchedule) int { return v.Minute }).(pulumi.IntOutput)\n}","func MinMaxInt32(x, min, max int32) int32 { return x }","func Gt(val, min any) bool { return valueCompare(val, min, \">\") }","func FromBPM(bpm int) time.Duration {\n\treturn time.Duration(60 * 1E9 / bpm)\n}","func(md MonitorData) From() int64 {\n return md[0].Timestamp - int64(md[0].Per)\n}","func (o GetSnapshotPolicyDailyScheduleOutput) Minute() pulumi.IntOutput {\n\treturn o.ApplyT(func(v GetSnapshotPolicyDailySchedule) int { return v.Minute }).(pulumi.IntOutput)\n}","func (sc SfcConfig) MinLockupDuration() (hexutil.Big, error) {\n\tc, err := sc.getConfig()\n\tif err != nil {\n\t\treturn hexutil.Big{}, err\n\t}\n\treturn c.MinLockupDuration, nil\n}","func MinMaxUint64(x, min, max uint64) uint64 { return x }"],"string":"[\n \"func normalizeMinutes(min int) (int, int) {\\n\\tflag := false\\n\\taddHours := 0\\n\\tif min < 0 {\\n\\t\\tflag = !flag\\n\\t\\tmin = -1 * min\\n\\t}\\n\\n\\tif min >= 60 {\\n\\t\\taddHours = min / 60\\n\\t\\tmin = min % 60\\n\\t}\\n\\n\\tif flag {\\n\\t\\tif min > 0 {\\n\\t\\t\\tmin = 60 - min\\n\\t\\t\\taddHours += 1\\n\\t\\t}\\n\\t\\taddHours = -1 * addHours\\n\\t}\\n\\n\\treturn min, addHours\\n}\",\n \"func (NilTimer) Min() int64 { return 0 }\",\n \"func (tod *ValidatedTimeOfDay) Min() int {\\n\\treturn tod.min\\n}\",\n \"func getMinutes(time *int) int {\\n\\treturn getTimeScale(time, 60)\\n}\",\n \"func (c Clock) max24Hour() Clock {\\n\\tc = c % minutesInDay\\n\\tif int(c) < 0 {\\n\\t\\treturn c + minutesInDay\\n\\t}\\n\\treturn c\\n}\",\n \"func (NilTimer) Max() int64 { return 0 }\",\n \"func getRangeTime(agencyID int64) int {\\n\\n\\tswitch agencyID {\\n\\tcase 14:\\n\\t\\treturn 30\\n\\tcase 23:\\n\\t\\treturn 10\\n\\tdefault:\\n\\t\\treturn 10\\n\\t}\\n\\treturn 10\\n}\",\n \"func tzsetNum(s string, min, max int) (num int, rest string, ok bool) {\\n\\tif len(s) == 0 {\\n\\t\\treturn 0, \\\"\\\", false\\n\\t}\\n\\tnum = 0\\n\\tfor i, r := range s {\\n\\t\\tif r < '0' || r > '9' {\\n\\t\\t\\tif i == 0 || num < min {\\n\\t\\t\\t\\treturn 0, \\\"\\\", false\\n\\t\\t\\t}\\n\\t\\t\\treturn num, s[i:], true\\n\\t\\t}\\n\\t\\tnum *= 10\\n\\t\\tnum += int(r) - '0'\\n\\t\\tif num > max {\\n\\t\\t\\treturn 0, \\\"\\\", false\\n\\t\\t}\\n\\t}\\n\\tif num < min {\\n\\t\\treturn 0, \\\"\\\", false\\n\\t}\\n\\treturn num, \\\"\\\", true\\n}\",\n \"func (et ExfatTimestamp) Minute() int {\\n\\treturn int(et&2016) >> 5\\n}\",\n \"func (o TransferJobScheduleStartTimeOfDayOutput) Minutes() pulumi.IntOutput {\\n\\treturn o.ApplyT(func(v TransferJobScheduleStartTimeOfDay) int { return v.Minutes }).(pulumi.IntOutput)\\n}\",\n \"func (t Time) Minute() int {}\",\n \"func validateFieldDurationSchedule(fl validator.FieldLevel) bool {\\n\\tv := fl.Field().Int()\\n\\tif v < durationScheduleMinutesMin {\\n\\t\\treturn false\\n\\t}\\n\\tif v > durationScheduleMinutesMax {\\n\\t\\treturn false\\n\\t}\\n\\treturn true\\n}\",\n \"func min(data []int64) string {\\n value := data[0]\\n for _, n := range data {\\n if n < value {\\n value = n\\n }\\n }\\n duration, _ := time.ParseDuration(fmt.Sprintf(\\\"%dns\\\", value))\\n return fmt.Sprintf(\\\"%.3f\\\", duration.Seconds())\\n}\",\n \"func MinMax(x, min, max int) int { return x }\",\n \"func normalize(hour, minute int) (int, int) {\\n\\tif minute < 0 || minute >= 60 {\\n\\t\\thour += minute / 60\\n\\t\\tminute = minute % 60\\n\\t}\\n\\tif minute < 0 {\\n\\t\\tminute += 60\\n\\t\\thour--\\n\\t}\\n\\tif hour < 0 || hour >= 24 {\\n\\t\\thour = hour % 24\\n\\t\\tif hour < 0 {\\n\\t\\t\\thour += 24\\n\\t\\t}\\n\\t}\\n\\treturn hour, minute\\n}\",\n \"func (o BucketReplicationConfigRuleDestinationReplicationTimeTimeOutput) Minutes() pulumi.IntOutput {\\n\\treturn o.ApplyT(func(v BucketReplicationConfigRuleDestinationReplicationTimeTime) int { return v.Minutes }).(pulumi.IntOutput)\\n}\",\n \"func (tb *TimeBucket) Min() int64 { return tb.min }\",\n \"func GetTimeRange() uint64 {\\n\\n\\ttimeRange := Get(\\\"TimeRange\\\")\\n\\tif timeRange == \\\"\\\" {\\n\\t\\treturn 3600\\n\\t}\\n\\n\\tparsedTimeRange, err := strconv.ParseUint(timeRange, 10, 64)\\n\\tif err != nil {\\n\\t\\tlog.Printf(\\\"[!] Failed to parse time range : %s\\\\n\\\", err.Error())\\n\\t\\treturn 3600\\n\\t}\\n\\n\\treturn parsedTimeRange\\n\\n}\",\n \"func hour(n int) float64 { return float64(n * 60 * 60) }\",\n \"func validateFieldDurationScheduleStr(fl validator.FieldLevel) bool {\\n\\tv, err := strconv.ParseInt(fl.Field().String(), 10, 32)\\n\\tif err != nil {\\n\\t\\treturn false\\n\\t}\\n\\tif v < durationScheduleMinutesMin {\\n\\t\\treturn false\\n\\t}\\n\\tif v > durationScheduleMinutesMax {\\n\\t\\treturn false\\n\\t}\\n\\treturn true\\n}\",\n \"func (obj *interval) Max() int {\\n\\treturn obj.max\\n}\",\n \"func (p parseSpec) minMax() (int, int) {\\n\\tmaxVal := -math.MaxInt64\\n\\tminVal := math.MaxInt64\\n\\tfor _, v := range p {\\n\\t\\tif v > maxVal {\\n\\t\\t\\tmaxVal = v\\n\\t\\t} else if v < minVal {\\n\\t\\t\\tminVal = v\\n\\t\\t}\\n\\t}\\n\\treturn minVal, maxVal\\n}\",\n \"func (o InstanceDenyMaintenancePeriodTimeOutput) Minutes() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v InstanceDenyMaintenancePeriodTime) *int { return v.Minutes }).(pulumi.IntPtrOutput)\\n}\",\n \"func NsMinutes(count int64) int64 { return NsSeconds(count * 60) }\",\n \"func min(a time.Duration, b time.Duration) time.Duration {\\n\\tif a > b {\\n\\t\\treturn b\\n\\t}\\n\\treturn a\\n}\",\n \"func (obj *interval) Min() int {\\n\\treturn obj.min\\n}\",\n \"func ToSlabRange(res Resolution, sTime time.Time, eTime time.Time) []string {\\n\\toutStr := []string{}\\n\\tonT := sTime.UTC()\\n\\tuseEnd := eTime.UTC()\\n\\tswitch res {\\n\\tcase Resolution_MIN:\\n\\t\\tuseEnd = useEnd.Add(time.Minute * 1) // need to include the end\\n\\t\\tfor onT.Before(useEnd) {\\n\\t\\t\\toutStr = append(outStr, onT.Format(\\\"200601021504\\\"))\\n\\t\\t\\tonT = onT.Add(time.Minute * 1)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\tcase Resolution_MIN5:\\n\\t\\tuseEnd = useEnd.Add(time.Minute * 5) // need to include the end\\n\\t\\tfor onT.Before(useEnd) {\\n\\t\\t\\tm := onT.Minute() / 5\\n\\t\\t\\toutStr = append(outStr, onT.Format(\\\"2006010215\\\")+\\\"I5\\\"+strconv.Itoa(m))\\n\\t\\t\\tonT = onT.Add(time.Minute * 5)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\tcase Resolution_MIN10:\\n\\t\\tuseEnd = useEnd.Add(time.Minute * 10) // need to include the end\\n\\t\\tfor onT.Before(useEnd) {\\n\\t\\t\\tm := onT.Minute() / 10\\n\\t\\t\\toutStr = append(outStr, onT.Format(\\\"2006010215\\\")+\\\"I10\\\"+strconv.Itoa(m))\\n\\t\\t\\tonT = onT.Add(time.Minute * 10)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\tcase Resolution_MIN15:\\n\\t\\tuseEnd = useEnd.Add(time.Minute * 15) // need to include the end\\n\\t\\tfor onT.Before(useEnd) {\\n\\t\\t\\tm := onT.Minute() / 15\\n\\t\\t\\toutStr = append(outStr, onT.Format(\\\"2006010215\\\")+\\\"I15\\\"+strconv.Itoa(m))\\n\\t\\t\\tonT = onT.Add(time.Minute * 15)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\tcase Resolution_MIN20:\\n\\t\\tuseEnd = useEnd.Add(time.Minute * 20) // need to include the end\\n\\t\\tfor onT.Before(useEnd) {\\n\\t\\t\\tm := onT.Minute() / 20\\n\\t\\t\\toutStr = append(outStr, onT.Format(\\\"2006010215\\\")+\\\"I20\\\"+strconv.Itoa(m))\\n\\t\\t\\tonT = onT.Add(time.Minute * 20)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\tcase Resolution_MIN30:\\n\\t\\tuseEnd = useEnd.Add(time.Minute * 30) // need to include the end\\n\\t\\tfor onT.Before(useEnd) {\\n\\t\\t\\tm := onT.Minute() / 30\\n\\t\\t\\toutStr = append(outStr, onT.Format(\\\"2006010215\\\")+\\\"I30\\\"+strconv.Itoa(m))\\n\\t\\t\\tonT = onT.Add(time.Minute * 30)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\tcase Resolution_DAY:\\n\\t\\tuseEnd = useEnd.AddDate(0, 0, 1) // need to include the end\\n\\t\\tfor onT.Before(useEnd) {\\n\\t\\t\\toutStr = append(outStr, onT.Format(\\\"20060102\\\"))\\n\\t\\t\\tonT = onT.AddDate(0, 0, 1)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\tcase Resolution_WEEK:\\n\\t\\tuseEnd = useEnd.AddDate(0, 0, 7) // need to include the end\\n\\t\\tfor onT.Before(useEnd) {\\n\\t\\t\\tynum, wnum := onT.ISOWeek()\\n\\t\\t\\toutStr = append(outStr, fmt.Sprintf(\\\"%04d%02d\\\", ynum, wnum))\\n\\t\\t\\tonT = onT.AddDate(0, 0, 7)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\tcase Resolution_MONTH:\\n\\t\\tuseEnd = useEnd.AddDate(0, 1, 0) // need to include the end\\n\\t\\tfor onT.Before(useEnd) {\\n\\t\\t\\toutStr = append(outStr, onT.Format(\\\"200601\\\"))\\n\\t\\t\\tonT = onT.AddDate(0, 1, 0)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\tcase Resolution_MONTH2:\\n\\t\\tuseEnd = useEnd.AddDate(0, 2, 0) // need to include the end\\n\\t\\tfor onT.Before(useEnd) {\\n\\t\\t\\tm := (int(onT.Month()) / 2)\\n\\t\\t\\toutStr = append(outStr, onT.Format(\\\"2006\\\")+\\\"M2\\\"+strconv.Itoa(m))\\n\\t\\t\\tonT = onT.AddDate(0, 2, 0)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\tcase Resolution_MONTH3:\\n\\t\\tuseEnd = useEnd.AddDate(0, 3, 0) // need to include the end\\n\\t\\tfor onT.Before(eTime) {\\n\\t\\t\\tm := (int(onT.Month()) / 3)\\n\\t\\t\\toutStr = append(outStr, onT.Format(\\\"2006\\\")+\\\"M3\\\"+strconv.Itoa(m))\\n\\t\\t\\tonT = onT.AddDate(0, 3, 0)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\tcase Resolution_MONTH6:\\n\\t\\tuseEnd = useEnd.AddDate(0, 6, 0) // need to include the end\\n\\t\\tfor onT.Before(useEnd) {\\n\\t\\t\\tm := (int(onT.Month()) / 6)\\n\\t\\t\\toutStr = append(outStr, onT.Format(\\\"2006\\\")+\\\"M6\\\"+strconv.Itoa(m))\\n\\t\\t\\tonT = onT.AddDate(0, 6, 0)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\tcase Resolution_YEAR:\\n\\t\\tuseEnd = useEnd.AddDate(1, 0, 0) // need to include the end\\n\\t\\tfor onT.Before(useEnd) {\\n\\t\\t\\toutStr = append(outStr, onT.Format(\\\"2006\\\"))\\n\\t\\t\\tonT = onT.AddDate(1, 0, 0)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\tcase Resolution_ALL:\\n\\t\\treturn []string{\\\"ALL\\\"}\\n\\n\\t//default is hourly\\n\\tdefault:\\n\\t\\tuseEnd = useEnd.Add(time.Hour) // need to include the end\\n\\t\\tfor onT.Before(eTime) {\\n\\t\\t\\toutStr = append(outStr, onT.Format(\\\"2006010215\\\"))\\n\\t\\t\\tonT = onT.Add(time.Hour)\\n\\t\\t}\\n\\t\\treturn outStr\\n\\t}\\n}\",\n \"func validateRange(value, field string, max int) (int, error) {\\n\\tn, err := strconv.Atoi(value)\\n\\tif err != nil {\\n\\t\\treturn 0, err\\n\\t}\\n\\tif (n < 1) || (n > max) {\\n\\t\\treturn 0, fmt.Errorf(\\\"field %v=%v but available range [%v - %v]\\\", field, n, 1, max)\\n\\t}\\n\\treturn n, nil\\n}\",\n \"func normalize(hour, minute int) (int, int) {\\n\\n\\t// total minutes are remaining\\n\\tminutesNormalized := minute % 60\\n\\n\\t// total hours are remaining; don't care about days\\n\\thoursNormalized := (hour + minute/60) % 24\\n\\n\\t// if remaining hours are negative, add the negative hours to the total hours in day\\n\\tif hoursNormalized < 0 {\\n\\t\\thoursNormalized = 24 + hoursNormalized\\n\\t}\\n\\n\\t// if remaining minutes are negative, add the negaive minutes to the total minutes in one hour\\n\\tif minutesNormalized < 0 {\\n\\t\\tminutesNormalized = 60 + minutesNormalized\\n\\t\\t// when subtracting from minutes, the hour goes down by one\\n\\t\\t// before lowering the hour make, sure the value is 24 and not 0\\n\\t\\tif hoursNormalized == 0 {\\n\\t\\t\\thoursNormalized = 24\\n\\t\\t}\\n\\t\\t// lower hours by one\\n\\t\\thoursNormalized--\\n\\t}\\n\\n\\treturn hoursNormalized, minutesNormalized\\n}\",\n \"func Past(h, m, s int) int {\\n\\tvar sum int\\n\\tif h >= 1 && m >= 1 && s >= 1 {\\n\\t\\th = (h * 60 * 60 * 1000)\\n\\t\\tm = (m * 60 * 1000)\\n\\t\\ts = s * 1000\\n\\t\\tsum += h + m + s\\n\\t} else if h <= 0 && m >= 1 && s >= 1 {\\n\\t\\tm = (m * 60 * 1000)\\n\\t\\ts = s * 1000\\n\\t\\tsum += h + m + s\\n\\t} else if h >= 1 && m == 0 && s == 0 {\\n\\t\\th = (h * 60 * 60 * 1000)\\n\\t\\tm = (m * 0)\\n\\t\\ts = (s * 0)\\n\\t\\tsum += h + m + s\\n\\t} else if m <= 0 && h >= 1 && s >= 1 {\\n\\t\\th = (h * 60 * 60 * 1000)\\n\\t\\ts = s * 1000\\n\\t\\tsum += h + m + s\\n\\t} else if s <= 0 && m >= 1 && h >= 1 {\\n\\t\\th = (h * 60 * 60 * 1000)\\n\\t\\tm = (m * 60 * 1000)\\n\\t\\tsum += h + m + s\\n\\t} else if h == 0 && m == 0 && s == 0 {\\n\\t\\th = (h * 0)\\n\\t\\tm = (m * 0)\\n\\t\\ts = (s * 0)\\n\\t\\tsum += h + m + s\\n\\t}\\n\\n\\treturn sum\\n}\",\n \"func checkTimeRange(db *db.DB, mint, maxt int64) (int64, int64) {\\n\\n\\tlogger := log.With(logger, \\\"stage\\\", \\\"checkTimeRange\\\")\\n\\n\\tvar actualMint int64 = math.MaxInt64\\n\\tvar actualMaxt int64 = math.MinInt64\\n\\n\\tif db.ReadOnly {\\n\\t\\tblocks, _ := db.BlockReader()\\n\\t\\t//Look time ranges for blocks\\n\\t\\tfor _, block := range blocks {\\n\\t\\t\\tif actualMint > block.Meta().MinTime {\\n\\t\\t\\t\\tactualMint = block.Meta().MinTime\\n\\t\\t\\t}\\n\\n\\t\\t\\tif actualMaxt < block.Meta().MaxTime {\\n\\t\\t\\t\\tactualMaxt = block.Meta().MaxTime\\n\\t\\t\\t}\\n\\t\\t}\\n\\t} else {\\n\\t\\tblocks := db.Blocks()\\n\\t\\t//Look time ranges for blocks\\n\\t\\tfor _, block := range blocks {\\n\\t\\t\\tif actualMint > block.Meta().MinTime {\\n\\t\\t\\t\\tactualMint = block.Meta().MinTime\\n\\t\\t\\t}\\n\\n\\t\\t\\tif actualMaxt < block.Meta().MaxTime {\\n\\t\\t\\t\\tactualMaxt = block.Meta().MaxTime\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tlogger.Log(\\\"status\\\", fmt.Sprintf(\\\"According to Blocks Mint: %d, Maxt: %d\\\", actualMint, actualMaxt))\\n\\n\\thead := db.Head() // If tsdb opened in write mode\\n\\tif head != nil {\\n\\t\\t//Look the time range for head\\n\\t\\tif head.MinTime() < actualMint {\\n\\t\\t\\tactualMint = head.MinTime()\\n\\t\\t}\\n\\n\\t\\tif head.MaxTime() > actualMaxt {\\n\\t\\t\\tactualMaxt = head.MaxTime()\\n\\t\\t}\\n\\n\\t\\tlogger.Log(\\\"status\\\", fmt.Sprintf(\\\"According to Head Mint: %d, Maxt: %d\\\", actualMint, actualMaxt))\\n\\t}\\n\\n\\tif actualMint < mint {\\n\\t\\tactualMint = mint\\n\\t} // else use calculated actualMint\\n\\n\\tif actualMaxt > maxt {\\n\\t\\tactualMaxt = maxt\\n\\t} // else use calculated actualMaxt\\n\\n\\treturn actualMint, actualMaxt\\n\\n}\",\n \"func (tb *TimeBucket) Max() int64 { return tb.max }\",\n \"func toUnixMsec(t time.Time) int64 {\\n\\treturn t.UnixNano() / 1e6\\n}\",\n \"func parseTimeWindowLimit(rawLimit uint64, timeMult float64) float64 {\\n\\n\\t//This is taken from the Intel SDM, Vol 3B 14.9.3\\n\\t/*\\n\\t\\tTime limit = 2^Y * (1.0 + Z/4.0) * Time_Unit\\n\\n\\t\\tHere “Y” is the unsigned integer value represented by bits 21:17,\\n\\t\\t“Z” is an unsigned integer represented by bits 23:22.\\n\\t\\t“Time_Unit” is specified by the “Time Units” field of MSR_RAPL_POWER_UNIT.\\n\\t*/\\n\\ty := float64(rawLimit & 0x1f)\\n\\tz := float64(rawLimit >> 5 & 0x3)\\n\\treturn math.Pow(2, y) * (1.0 + (z / 4.0)) * timeMult\\n\\n}\",\n \"func (r *Retry) min(a, b uint64) uint64 {\\n\\tif a > b {\\n\\t\\treturn b\\n\\t}\\n\\treturn a\\n}\",\n \"func validateFieldDurationService(fl validator.FieldLevel) bool {\\n\\tv, err := strconv.ParseInt(fl.Field().String(), 10, 32)\\n\\tif err != nil {\\n\\t\\treturn false\\n\\t}\\n\\tif v < durationServiceMinutesMin {\\n\\t\\treturn false\\n\\t}\\n\\tif v > durationServiceMinutesMax {\\n\\t\\treturn false\\n\\t}\\n\\treturn true\\n}\",\n \"func getRange(min, max int) int {\\n\\treturn max * min\\n}\",\n \"func parseIntegerParameterRange(input string) (*IntegerParameterRange, error) {\\n\\tvar start, end int\\n\\n\\tvar err error\\n\\tif strings.Index(input, \\\"-\\\") >= 0 {\\n\\t\\tarray := strings.Split(input, \\\"-\\\")\\n\\t\\tif len(array) != 2 {\\n\\t\\t\\terr = errors.New(\\\"Failed to split the string type\\\")\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\n\\t\\tif start, err = strconv.Atoi(array[0]); err != nil {\\n\\t\\t\\t// negative values must be dropped here\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tif end, err = strconv.Atoi(array[1]); err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t} else {\\n\\t\\tif start, err = strconv.Atoi(input); err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tend = start\\n\\t}\\n\\n\\tif start > end {\\n\\t\\terr = errors.New(\\\"The 'max-config-values' attributes MUST be greater or equal to their counterpart in 'min-config-values' attributes.\\\")\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\treturn &IntegerParameterRange{\\n\\t\\tstart: start,\\n\\t\\tend: end,\\n\\t}, nil\\n}\",\n \"func Min(x, min int) int { return x }\",\n \"func MinMaxDiff(vals []string) int {\\n\\tmin, _ := strconv.Atoi(vals[0])\\n\\tmax := min\\n\\tfor _, v := range vals {\\n\\t\\td, err := strconv.Atoi(v)\\n\\t\\tif err != nil {\\n\\t\\t\\tpanic(\\\"could not parse number!\\\")\\n\\t\\t}\\n\\t\\tif int(d) < min {\\n\\t\\t\\tmin = int(d)\\n\\t\\t} else if int(d) > max {\\n\\t\\t\\tmax = int(d)\\n\\t\\t}\\n\\t}\\n\\n\\treturn max - min\\n}\",\n \"func minDuration(a, b time.Duration) time.Duration {\\n\\tif a < b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func (minutes Minutes) Validate() bool {\\n\\tret := true\\n\\tif !validation.ValidateInt(minutes.value) ||\\n\\t\\t!validation.CheckRange(minutes.value, 0, 99) {\\n\\t\\tret = false\\n\\t}\\n\\treturn ret\\n}\",\n \"func ValidBetween(min, max int) ValidatorFunc {\\n\\tvar EInvalidInterval = errors.New(\\n\\t\\tfmt.Sprintf(\\\"must be integer between %d and %d\\\", min, max))\\n\\treturn func(field FormField, ctx context.Context) error {\\n\\t\\tvalue, err := field.GetInt()\\n\\t\\tif err != nil {\\n\\t\\t\\treturn EInvalidInteger\\n\\t\\t}\\n\\t\\tif value < min || value > max {\\n\\t\\t\\treturn EInvalidInterval\\n\\t\\t}\\n\\t\\treturn nil\\n\\t}\\n}\",\n \"func (f *Formatter) Minutes() string {\\n\\tvar format string\\n\\tif f.withoutUnit {\\n\\t\\tformat = \\\"%d\\\\n\\\"\\n\\t} else {\\n\\t\\tformat = \\\"%d minutes\\\\n\\\"\\n\\t}\\n\\treturn fmt.Sprintf(format, int(f.duration.Minutes()))\\n}\",\n \"func (o BucketReplicationConfigurationRuleDestinationReplicationTimeOutput) Minutes() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v BucketReplicationConfigurationRuleDestinationReplicationTime) *int { return v.Minutes }).(pulumi.IntPtrOutput)\\n}\",\n \"func secToMins(t ClockTime) (mins, secs uint) {\\n\\tmins = uint(t) / 60\\n\\tsecs = uint(t) % 60\\n\\n\\treturn mins, secs\\n}\",\n \"func Min(val, min any) bool { return valueCompare(val, min, \\\">=\\\") }\",\n \"func getMinTimeDuration(durationFirst, durationSecond time.Duration) time.Duration {\\n\\tif durationFirst <= durationSecond {\\n\\t\\treturn durationFirst\\n\\t}\\n\\treturn durationSecond\\n}\",\n \"func (o InstanceMaintenanceWindowStartTimeOutput) Minutes() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v InstanceMaintenanceWindowStartTime) *int { return v.Minutes }).(pulumi.IntPtrOutput)\\n}\",\n \"func getDurationWithin(min, max int) time.Duration {\\n\\tjitter := max - min\\n\\tif jitter <= 0 {\\n\\t\\tjitter = 1\\n\\t}\\n\\tduration := rand.Intn(jitter) + min\\n\\treturn time.Duration(duration) * time.Second\\n}\",\n \"func NsHours(count int64) int64 { return NsMinutes(count * 60) }\",\n \"func (t *TimerSnapshot) Min() int64 { return t.histogram.Min() }\",\n \"func MinMax(w http.ResponseWriter, req *http.Request) {\\r\\n\\r\\n minmax_templ.Execute(w, req.FormValue(\\\"s\\\"))\\r\\n if req.FormValue != nil {\\r\\n min, max, sum := minmax.FindMinmax(req.FormValue(\\\"s\\\"))\\r\\n if min != 0 && max != 0 && sum != 0 {\\r\\n fmt.Fprintf(w, \\\"%d %d %d\\\", min, max, sum)\\r\\n }\\r\\n }\\r\\n \\r\\n}\",\n \"func (dv *DurationValue) Min(min time.Duration) *DurationValue {\\n\\tdv.v.add(func() error {\\n\\t\\tif n := dv.get(); n < min {\\n\\t\\t\\treturn fmt.Errorf(\\\"less than %s: %s\\\", min, n)\\n\\t\\t}\\n\\t\\treturn nil\\n\\t})\\n\\treturn dv\\n}\",\n \"func (xt XSDTime) Minute() int {\\n\\treturn xt.innerTime.Minute()\\n}\",\n \"func (this *MillisToUTC) MinArgs() int { return 1 }\",\n \"func (c Clock) Minute() int {\\n\\tr := time.Duration(c) % time.Hour\\n\\treturn int(r / time.Minute)\\n}\",\n \"func MinimumFinishTime(tires [][]int, changeTime int, numLaps int) int {\\n\\tvar l int = len(tires)\\n\\tvar dp []int = make([]int,numLaps + 1)//dp[i], 跑i圈的最短时间\\n\\tfor i := 0;i <= numLaps;i++{\\n\\t\\tdp[i] = 2147483647\\n\\t}\\n\\t//var factor int = 0\\n\\tvar eachround_time int = 2147483647\\n\\tfor i := 0;i < l;i++{\\n\\t\\tif tires[i][0] < eachround_time{\\n\\t\\t\\teachround_time = tires[i][0]\\n\\t\\t\\t//factor = tires[i][1]\\n\\t\\t}\\n\\t}\\n\\t//var total int = eachround_time\\n\\tvar neg bool = false\\n\\tfor i := 1;i <= numLaps;i++{\\n\\t\\tif !neg{\\n\\t\\t\\tfor k := 0;k < l;k++{\\n\\t\\t\\t\\ta1 := tires[k][0]\\n\\t\\t\\t\\tan := tires[k][0] * int(math.Pow(float64(tires[k][1]),float64(i - 1)))\\n\\t\\t\\t\\tsn := (an * tires[k][1] - a1)/(tires[k][1] - 1)\\n\\t\\t\\t\\tif sn > 0 && sn < 2147483647{\\n\\t\\t\\t\\t\\tdp[i] = min_int(dp[i],sn)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif dp[i] < 0{\\n\\t\\t\\tneg = true\\n\\t\\t\\tdp[i] = 2147483647\\n\\t\\t}\\n\\n\\t\\t//change_perround := changeTime * (i - 1) + eachround_time * i\\n\\t\\t//if change_perround > 0{\\n\\t\\t//\\tdp[i] = change_perround\\n\\t\\t//}\\n\\t\\t//if total > 0{\\n\\t\\t//\\tdp[i] = min_int(dp[i],total)\\n\\t\\t//}\\n\\t\\t//eachround_time *= factor\\n\\t\\t//total += eachround_time\\n\\t\\tfor j := 1;j < i;j++{\\n\\t\\t\\tdp[i] = min_int(dp[i],dp[j] + dp[i - j] + changeTime)\\n\\t\\t}\\n\\t}\\n\\treturn dp[numLaps]\\n}\",\n \"func LimitPerMinute(t time.Time) time.Time {\\n\\treturn time.Date(t.Year(), t.Month(), t.Day(), t.Hour(), t.Minute(), 0, 0, t.Location())\\n}\",\n \"func MinMaxUint(x, min, max uint) uint { return x }\",\n \"func absClock(abs uint64) (hour, min, sec int) {\\n\\tsec = int(abs % secondsPerDay)\\n\\thour = sec / secondsPerHour\\n\\tsec -= hour * secondsPerHour\\n\\tmin = sec / secondsPerMinute\\n\\tsec -= min * secondsPerMinute\\n\\treturn\\n}\",\n \"func (k *Key) RangeTime(defaultVal, min, max time.Time) time.Time {\\n\\treturn k.RangeTimeFormat(time.RFC3339, defaultVal, min, max)\\n}\",\n \"func NewMinute(t time.Time, lsw, dut1 int) (Minute, error) {\\n\\tt = t.UTC() // Don't care about local times\\n\\tmin := Minute{\\n\\t\\tTime: t,\\n\\t\\tlsw: lsw == 1,\\n\\t\\tdut1: dut1,\\n\\t}\\n\\tbits := min.bits[:]\\n\\n\\tmarkers := []int{9, 19, 29, 39, 49, 59} // P1-P6\\n\\tbits[0] = bitNone // Minute mark\\n\\tfor _, v := range markers {\\n\\t\\tbits[v] = bitMarker\\n\\t}\\n\\n\\tmidnight := time.Date(t.Year(), t.Month(), t.Day(), 0, 0, 0, 0, time.UTC)\\n\\tendOfDay := midnight.AddDate(0, 0, 1)\\n\\n\\tdst1 := 0 // DST status at 00:00Z today\\n\\tif isDST(midnight) {\\n\\t\\tdst1 = 1\\n\\t}\\n\\tdst2 := 0 // DST status at 24:00Z today\\n\\tif isDST(endOfDay) {\\n\\t\\tdst2 = 1\\n\\t}\\n\\n\\tyear1s := t.Year() % 10\\n\\tyear10s := t.Year()%100 - year1s\\n\\n\\tminute1s := t.Minute() % 10\\n\\tminute10s := t.Minute()%100 - minute1s\\n\\n\\thour1s := t.Hour() % 10\\n\\thour10s := t.Hour()%100 - hour1s\\n\\n\\tdayOfYear1s := t.YearDay() % 10\\n\\tdayOfYear10s := t.YearDay()%100 - dayOfYear1s\\n\\tdayOfYear100s := t.YearDay()%1000 - dayOfYear1s - dayOfYear10s\\n\\n\\tdut1Sign, dut1Magnitude := 1, dut1 // dut1Sign is positive\\n\\tif dut1 < 0 {\\n\\t\\tdut1Sign = 0\\n\\t\\tdut1Magnitude *= -1\\n\\t}\\n\\tif dut1Magnitude > 7 {\\n\\t\\tdut1Magnitude = 7 // Only 3 bits for this value.\\n\\t}\\n\\n\\terr := minuteEncoder.encode(bits, []int{\\n\\t\\t0, 0, dst1, lsw, year1s, 0, 0,\\n\\t\\tminute1s, minute10s, 0, 0,\\n\\t\\thour1s, hour10s, 0, 0,\\n\\t\\tdayOfYear1s, dayOfYear10s, 0,\\n\\t\\tdayOfYear100s, 0, 0,\\n\\t\\tdut1Sign, year10s, dst2, dut1Magnitude, 0,\\n\\t})\\n\\tif err != nil {\\n\\t\\treturn min, errors.Wrapf(err, \\\"Cannot encode minute %s\\\", t.Format(\\\"15:04\\\"))\\n\\t}\\n\\n\\tmin.lastSecond = lastSecond(t, min.lsw)\\n\\n\\treturn min, nil\\n}\",\n \"func mesIntFunc() int {\\n\\tenero := 31\\n\\tfebrero := 28\\n\\tmarzo := 31\\n\\tabril := 30\\n\\tmayo := 31\\n\\tjunio := 30\\n\\tjulio := 31\\n\\tagosto := 31\\n\\tseptiembre := 30\\n\\toctubre := 31\\n\\tnoviembre := 30\\n\\tdiciembre := 31\\n\\t_, mes, _ := time.Now().Date()\\n\\tswitch {\\n\\tcase mes == time.January:\\n\\t\\treturn enero\\n\\tcase mes == time.February:\\n\\t\\treturn enero + febrero\\n\\tcase mes == time.March:\\n\\t\\treturn enero + febrero + marzo\\n\\tcase mes == time.April:\\n\\t\\treturn enero + febrero + marzo + abril\\n\\tcase mes == time.May:\\n\\t\\treturn enero + febrero + marzo + abril + mayo\\n\\tcase mes == time.June:\\n\\t\\treturn enero + febrero + marzo + abril + mayo + junio\\n\\tcase mes == time.July:\\n\\t\\treturn enero + febrero + marzo + abril + mayo + junio + julio\\n\\tcase mes == time.August:\\n\\t\\treturn enero + febrero + marzo + abril + mayo + junio + julio + agosto\\n\\tcase mes == time.September:\\n\\t\\treturn enero + febrero + marzo + abril + mayo + junio + julio + agosto + septiembre\\n\\tcase mes == time.October:\\n\\t\\treturn enero + febrero + marzo + abril + mayo + junio + julio + agosto + septiembre + octubre\\n\\tcase mes == time.November:\\n\\t\\treturn enero + febrero + marzo + abril + mayo + junio + julio + agosto + septiembre + octubre + noviembre\\n\\tcase mes == time.December:\\n\\t\\treturn enero + febrero + marzo + abril + mayo + junio + julio + agosto + septiembre + octubre + noviembre + diciembre\\n\\t}\\n\\treturn 0\\n}\",\n \"func (c *Job) Minutes() *Job {\\n\\tif c.delayUnit == delayNone {\\n\\t\\tc.unit = minutes\\n\\t} else {\\n\\t\\tc.delayUnit = delayMinutes\\n\\t}\\n\\treturn c\\n}\",\n \"func (o BucketV2ReplicationConfigurationRuleDestinationReplicationTimeOutput) Minutes() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v BucketV2ReplicationConfigurationRuleDestinationReplicationTime) *int { return v.Minutes }).(pulumi.IntPtrOutput)\\n}\",\n \"func (m *sdt) Minute() int32 {\\n\\treturn m.minuteField\\n}\",\n \"func MinMaxInt64(x, min, max int64) int64 { return x }\",\n \"func GetMaxBlockGenerationTime() int64 {\\r\\n\\treturn converter.StrToInt64(SysString(MaxBlockGenerationTime))\\r\\n}\",\n \"func Min(min time.Duration) exponentialOption {\\n\\treturn func(e *Exponential) {\\n\\t\\te.min = min\\n\\t}\\n}\",\n \"func normalizeHours(hrs int) int {\\n\\tflag := false\\n\\n\\tif hrs < 0 {\\n\\t\\tflag = !flag\\n\\t\\thrs = -1 * hrs\\n\\t}\\n\\n\\thrs = hrs % 24\\n\\n\\tif flag && hrs > 0 {\\n\\t\\thrs = 24 - hrs\\n\\t}\\n\\n\\treturn hrs\\n}\",\n \"func NewMaxOrMinDec(negative bool, prec, frac int) *MyDecimal {\\n\\tstr := make([]byte, prec+2)\\n\\tfor i := 0; i < len(str); i++ {\\n\\t\\tstr[i] = '9'\\n\\t}\\n\\tif negative {\\n\\t\\tstr[0] = '-'\\n\\t} else {\\n\\t\\tstr[0] = '+'\\n\\t}\\n\\tstr[1+prec-frac] = '.'\\n\\tdec := new(MyDecimal)\\n\\terr := dec.FromString(str)\\n\\tterror.Log(errors.Trace(err))\\n\\treturn dec\\n}\",\n \"func (k *Key) RangeTimeFormat(format string, defaultVal, min, max time.Time) time.Time {\\n\\tval := k.MustTimeFormat(format)\\n\\tif val.Unix() < min.Unix() || val.Unix() > max.Unix() {\\n\\t\\treturn defaultVal\\n\\t}\\n\\treturn val\\n}\",\n \"func Minute(minute int) string {\\n\\tt := parsedTime(minute)\\n\\treturn t.Format(\\\"04\\\")\\n}\",\n \"func MinMaxInt8(x, min, max int8) int8 { return x }\",\n \"func main() {\\n\\tconst now = 1589570165\\n\\n\\ttimeStamp := time.Unix(now, 0).UTC()\\n\\n\\tscanner := bufio.NewScanner(os.Stdin)\\n\\tscanner.Scan()\\n\\ts := scanner.Text()\\n\\n\\telapsedTime := strings.Replace(s, \\\"мин.\\\", \\\"m\\\", 1)\\n\\telapsedTime = strings.Replace(elapsedTime, \\\"сек.\\\", \\\"s\\\", 1)\\n\\telapsedTime = strings.Replace(elapsedTime, \\\" \\\", \\\"\\\", -1)\\n\\n\\tdur, err := time.ParseDuration(elapsedTime)\\n\\tif err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\t//dur.Round(time.Hour).Hours()\\n\\tunitedDate := timeStamp.Add(dur)\\n\\n\\tfmt.Println(unitedDate.Format(time.UnixDate))\\n\\n}\",\n \"func (c *cursor) blockMinTime(pos uint32) int64 {\\n\\treturn int64(btou64(c.f.mmap[pos+12 : pos+20]))\\n}\",\n \"func (j *Job) Minutes() (job *Job) {\\n\\tj.unit = JOB_UNIT_TYPE_MINUTE\\n\\treturn j\\n}\",\n \"func (o SnapshotPolicyHourlyScheduleOutput) Minute() pulumi.IntOutput {\\n\\treturn o.ApplyT(func(v SnapshotPolicyHourlySchedule) int { return v.Minute }).(pulumi.IntOutput)\\n}\",\n \"func parseClock(s string) (int, error) {\\n\\tclock := 0\\n\\n\\tfor s != \\\"\\\" {\\n\\t\\tcomponent, rest := splitOnce(s, \\\":\\\")\\n\\n\\t\\tn, err := strconv.Atoi(component)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn 0, err\\n\\t\\t}\\n\\n\\t\\tclock *= 60\\n\\t\\tclock += int(n)\\n\\n\\t\\ts = rest\\n\\t}\\n\\n\\treturn clock, nil\\n}\",\n \"func validateFieldTimeUnix(fl validator.FieldLevel) bool {\\n\\tv := ParseTimeUnixUTC(fl.Field().String())\\n\\tif v.IsZero() {\\n\\t\\treturn false\\n\\t}\\n\\treturn v.Unix() > unixTimeMin\\n}\",\n \"func (s *Value) asRangeInt(min, max int64) (int64, error) {\\n\\tif s == nil {\\n\\t\\treturn 0, fmt.Errorf(\\\"value is required in the range of [%d..%d]\\\", min, max)\\n\\t}\\n\\tn, err := ParseInt(s.Name)\\n\\tif err != nil {\\n\\t\\treturn 0, err\\n\\t}\\n\\ti, err := n.Int()\\n\\tif err != nil {\\n\\t\\treturn 0, err\\n\\t}\\n\\tif i < min || i > max {\\n\\t\\treturn 0, fmt.Errorf(\\\"value %s out of range [%d..%d]\\\", s.Name, min, max)\\n\\t}\\n\\treturn i, nil\\n}\",\n \"func inMeshCap(slot time.Duration) float64 {\\n\\treturn float64((3600 * time.Second) / slot)\\n}\",\n \"func dealDurationBounds(size abi.PaddedPieceSize) (min abi.ChainEpoch, max abi.ChainEpoch) {\\n\\treturn abi.ChainEpoch(180 * builtin.EpochsInDay), abi.ChainEpoch(540 * builtin.EpochsInDay) // PARAM_FINISH\\n}\",\n \"func (o TransferJobScheduleStartTimeOfDayPtrOutput) Minutes() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v *TransferJobScheduleStartTimeOfDay) *int {\\n\\t\\tif v == nil {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn &v.Minutes\\n\\t}).(pulumi.IntPtrOutput)\\n}\",\n \"func (t *TimerSnapshot) Max() int64 { return t.histogram.Max() }\",\n \"func Int(i *int, title, id, class string, min, max, step float64, valid Validator) (jquery.JQuery, error) {\\n\\tj := jq(\\\"<input>\\\").AddClass(ClassPrefix + \\\"-int\\\").AddClass(class)\\n\\tj.SetAttr(\\\"title\\\", title).SetAttr(\\\"id\\\", id)\\n\\tj.SetAttr(\\\"type\\\", \\\"number\\\")\\n\\tif !math.IsNaN(min) {\\n\\t\\tj.SetAttr(\\\"min\\\", int(min))\\n\\t}\\n\\tif !math.IsNaN(max) {\\n\\t\\tj.SetAttr(\\\"max\\\", int(max))\\n\\t}\\n\\tif !math.IsNaN(step) {\\n\\t\\tj.SetAttr(\\\"step\\\", int(step))\\n\\t}\\n\\tj.SetAttr(\\\"value\\\", *i)\\n\\tj.SetData(\\\"prev\\\", *i)\\n\\tj.Call(jquery.CHANGE, func(event jquery.Event) {\\n\\t\\tval := event.Target.Get(\\\"value\\\").String()\\n\\t\\tnewI, e := strconv.Atoi(val)\\n\\t\\tif e != nil {\\n\\t\\t\\tf, e := strconv.ParseFloat(val, 64)\\n\\t\\t\\tif e != nil {\\n\\t\\t\\t\\tpanic(fmt.Errorf(\\\"value '%s' has invalid type, expected a number\\\", val))\\n\\t\\t\\t}\\n\\t\\t\\t// Truncate to int\\n\\t\\t\\tnewI = int(f)\\n\\t\\t\\tj.SetVal(newI)\\n\\t\\t}\\n\\t\\t// Need to check for min and max ourselves because html min and max are easy to get around\\n\\t\\tisValid := valid == nil || valid.Validate(newI)\\n\\t\\tisToLow := !math.IsNaN(min) && newI < int(min)\\n\\t\\tisToHigh := !math.IsNaN(max) && newI > int(max)\\n\\t\\tif !isValid || isToLow || isToHigh {\\n\\t\\t\\tnewI = int(j.Data(\\\"prev\\\").(float64))\\n\\t\\t\\tj.SetVal(newI)\\n\\t\\t}\\n\\t\\t*i = newI\\n\\t\\tj.SetData(\\\"prev\\\", newI)\\n\\t})\\n\\treturn j, nil\\n}\",\n \"func max(data []int64) string {\\n var value int64\\n for _, n := range data {\\n if n > value {\\n value = n\\n }\\n }\\n duration, _ := time.ParseDuration(fmt.Sprintf(\\\"%dns\\\", value))\\n return fmt.Sprintf(\\\"%.3f\\\", duration.Seconds())\\n}\",\n \"func max(x int) int {\\n\\treturn 40 + x\\n}\",\n \"func (o SnapshotPolicyDailyScheduleOutput) Minute() pulumi.IntOutput {\\n\\treturn o.ApplyT(func(v SnapshotPolicyDailySchedule) int { return v.Minute }).(pulumi.IntOutput)\\n}\",\n \"func getExponentialTime(min time.Duration, max time.Duration, attempts int) time.Duration {\\n\\tif min <= 0 {\\n\\t\\tmin = 100 * time.Millisecond\\n\\t}\\n\\tif max <= 0 {\\n\\t\\tmax = 10 * time.Second\\n\\t}\\n\\tminFloat := float64(min)\\n\\tnapDuration := minFloat * math.Pow(2, float64(attempts-1))\\n\\t// add some jitter\\n\\tnapDuration += rand.Float64()*minFloat - (minFloat / 2)\\n\\tif napDuration > float64(max) {\\n\\t\\treturn time.Duration(max)\\n\\t}\\n\\treturn time.Duration(napDuration)\\n}\",\n \"func (rn *RangedNumber) Min() int {\\n\\tif rn.min > rn.max {\\n\\t\\trn.Set(rn.max, rn.min)\\n\\t}\\n\\n\\treturn rn.min\\n}\",\n \"func (m *Minute) Type() sql.Type { return sql.Int32 }\",\n \"func (o GetSnapshotPolicyHourlyScheduleOutput) Minute() pulumi.IntOutput {\\n\\treturn o.ApplyT(func(v GetSnapshotPolicyHourlySchedule) int { return v.Minute }).(pulumi.IntOutput)\\n}\",\n \"func MinMaxInt32(x, min, max int32) int32 { return x }\",\n \"func Gt(val, min any) bool { return valueCompare(val, min, \\\">\\\") }\",\n \"func FromBPM(bpm int) time.Duration {\\n\\treturn time.Duration(60 * 1E9 / bpm)\\n}\",\n \"func(md MonitorData) From() int64 {\\n return md[0].Timestamp - int64(md[0].Per)\\n}\",\n \"func (o GetSnapshotPolicyDailyScheduleOutput) Minute() pulumi.IntOutput {\\n\\treturn o.ApplyT(func(v GetSnapshotPolicyDailySchedule) int { return v.Minute }).(pulumi.IntOutput)\\n}\",\n \"func (sc SfcConfig) MinLockupDuration() (hexutil.Big, error) {\\n\\tc, err := sc.getConfig()\\n\\tif err != nil {\\n\\t\\treturn hexutil.Big{}, err\\n\\t}\\n\\treturn c.MinLockupDuration, nil\\n}\",\n \"func MinMaxUint64(x, min, max uint64) uint64 { return x }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.61662334","0.57398677","0.5701072","0.5669399","0.5604872","0.5507069","0.54734653","0.5398669","0.5395211","0.5355866","0.5341673","0.52995133","0.52645224","0.5257398","0.5246607","0.523801","0.5223781","0.5210974","0.5200304","0.5191768","0.51909083","0.51883173","0.5186917","0.517812","0.5164651","0.5156479","0.5145729","0.51141036","0.5109044","0.5104516","0.5085699","0.50726604","0.50694424","0.50607616","0.50599796","0.50430304","0.50232595","0.50163937","0.5000623","0.49657694","0.49447846","0.49249637","0.4917584","0.49116153","0.49074832","0.4904692","0.48914045","0.48857418","0.48823422","0.48728168","0.48703483","0.48695803","0.4843383","0.48431987","0.48412827","0.4840073","0.483512","0.4832889","0.48325524","0.48300493","0.48229316","0.48160666","0.48053122","0.47983986","0.4798183","0.47940737","0.47931316","0.47823524","0.47809273","0.47802904","0.47729066","0.47679988","0.47670296","0.4758739","0.47531176","0.47518647","0.47505924","0.47453302","0.47397906","0.4738073","0.47371843","0.4736745","0.47344196","0.4732635","0.4730816","0.47258365","0.47196433","0.4711379","0.47108844","0.47089273","0.47057587","0.47055262","0.47048762","0.47000363","0.46987173","0.46960866","0.46821612","0.4680731","0.46760982","0.4673725","0.46731678"],"string":"[\n \"0.61662334\",\n \"0.57398677\",\n \"0.5701072\",\n \"0.5669399\",\n \"0.5604872\",\n \"0.5507069\",\n \"0.54734653\",\n \"0.5398669\",\n \"0.5395211\",\n \"0.5355866\",\n \"0.5341673\",\n \"0.52995133\",\n \"0.52645224\",\n \"0.5257398\",\n \"0.5246607\",\n \"0.523801\",\n \"0.5223781\",\n \"0.5210974\",\n \"0.5200304\",\n \"0.5191768\",\n \"0.51909083\",\n \"0.51883173\",\n \"0.5186917\",\n \"0.517812\",\n \"0.5164651\",\n \"0.5156479\",\n \"0.5145729\",\n \"0.51141036\",\n \"0.5109044\",\n \"0.5104516\",\n \"0.5085699\",\n \"0.50726604\",\n \"0.50694424\",\n \"0.50607616\",\n \"0.50599796\",\n \"0.50430304\",\n \"0.50232595\",\n \"0.50163937\",\n \"0.5000623\",\n \"0.49657694\",\n \"0.49447846\",\n \"0.49249637\",\n \"0.4917584\",\n \"0.49116153\",\n \"0.49074832\",\n \"0.4904692\",\n \"0.48914045\",\n \"0.48857418\",\n \"0.48823422\",\n \"0.48728168\",\n \"0.48703483\",\n \"0.48695803\",\n \"0.4843383\",\n \"0.48431987\",\n \"0.48412827\",\n \"0.4840073\",\n \"0.483512\",\n \"0.4832889\",\n \"0.48325524\",\n \"0.48300493\",\n \"0.48229316\",\n \"0.48160666\",\n \"0.48053122\",\n \"0.47983986\",\n \"0.4798183\",\n \"0.47940737\",\n \"0.47931316\",\n \"0.47823524\",\n \"0.47809273\",\n \"0.47802904\",\n \"0.47729066\",\n \"0.47679988\",\n \"0.47670296\",\n \"0.4758739\",\n \"0.47531176\",\n \"0.47518647\",\n \"0.47505924\",\n \"0.47453302\",\n \"0.47397906\",\n \"0.4738073\",\n \"0.47371843\",\n \"0.4736745\",\n \"0.47344196\",\n \"0.4732635\",\n \"0.4730816\",\n \"0.47258365\",\n \"0.47196433\",\n \"0.4711379\",\n \"0.47108844\",\n \"0.47089273\",\n \"0.47057587\",\n \"0.47055262\",\n \"0.47048762\",\n \"0.47000363\",\n \"0.46987173\",\n \"0.46960866\",\n \"0.46821612\",\n \"0.4680731\",\n \"0.46760982\",\n \"0.4673725\",\n \"0.46731678\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":984,"cells":{"query":{"kind":"string","value":"/ 2 2 6 14 14 NAN"},"document":{"kind":"string","value":"func RottenFruitUtil(arr [][]int, maxCol int, maxRow int, currCol int, currRow int, traversed [][]int, day int) {\n\tif currCol < 0 || currCol >= maxCol || currRow < 0 || currRow >= maxRow {\n\t\treturn\n\t}\n\t// Traversable and rot if not already rotten.\n\tif traversed[currCol][currRow] <= day || arr[currCol][currRow] == 0 {\n\t\treturn\n\t}\n\n\tdir := [][]int{{-1, 0}, {1, 0}, {0, -1}, {0, 1}}\n\ttraversed[currCol][currRow] = day // Update rot time.\n\tfor i := 0; i < 4; i++ {\n\t\tx := currCol + dir[i][0]\n\t\ty := currRow + dir[i][1]\n\t\tRottenFruitUtil(arr, maxCol, maxRow, x, y, traversed, day+1)\n\t}\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func NaN() float32 { return Float32frombits(uvnan) }","func fillNaNDense(m *mat.Dense) {\n\tr, c := m.Dims()\n\tfor i := 0; i < r; i++ {\n\t\tfor j := 0; j < c; j++ {\n\t\t\tm.Set(i, j, math.NaN())\n\t\t}\n\t}\n}","func (a *Array64) NaNSum(axis ...int) *Array64 {\n\tif a.valAxis(&axis, \"NaNSum\") {\n\t\treturn a\n\t}\n\n\tns := func(d []float64) (r float64) {\n\t\tflag := false\n\t\tfor _, v := range d {\n\t\t\tif !math.IsNaN(v) {\n\t\t\t\tflag = true\n\t\t\t\tr += v\n\t\t\t}\n\t\t}\n\t\tif flag {\n\t\t\treturn r\n\t\t}\n\t\treturn math.NaN()\n\t}\n\n\treturn a.Fold(ns, axis...)\n\n}","func (v Volume) Nanolitres() float64 {\n\treturn float64(v / Nanolitre)\n}","func nanotime() int64","func nanotime() int64","func nanotime() int64","func nanotime() int64","func IsNan(arg float64) bool {\n\treturn math.IsNaN(arg)\n}","func DivNoNan(scope *Scope, x tf.Output, y tf.Output) (z tf.Output) {\n\tif scope.Err() != nil {\n\t\treturn\n\t}\n\topspec := tf.OpSpec{\n\t\tType: \"DivNoNan\",\n\t\tInput: []tf.Input{\n\t\t\tx, y,\n\t\t},\n\t}\n\top := scope.AddOperation(opspec)\n\treturn op.Output(0)\n}","func (result Result) NaN() Result {\r\n\tresult.AvgDelay = math.NaN()\r\n\tresult.MinDelay = math.NaN()\r\n\tresult.MaxDelay = math.NaN()\r\n\treturn result\r\n}","func IsNan(f float64) bool {\n\n\treturn math.IsNaN(f)\n}","func Nanotime() int64 {\n\treturn nanotime()\n}","func Nanotime() int64 {\n\treturn nanotime()\n}","func TestFetchNanNumberEndByNonEOF(t *testing.T) {\n\tinputs := [][]byte{[]byte(\"aN \"), []byte(\"aN{\"), []byte(\"aN}\"), []byte(\"aN[\"), []byte(\"aN]\"), []byte(\"aN:\"), []byte(\"aN,\")}\n\texpected := \"NaN\"\n\n\tfor _, input := range inputs {\n\t\tlex := NewLexer(bytes.NewReader(input))\n\t\terr := lex.fetchNanNumber()\n\t\tif err != nil {\n\t\t\tt.Error(err.Error())\n\t\t\treturn\n\t\t}\n\n\t\ttoken := lex.tokens[0]\n\t\tif token.String() != expected {\n\t\t\tt.Errorf(\"unexpected '%s', expecting '%s'\", token.String(), expected)\n\t\t\treturn\n\t\t}\n\t}\n}","func (sp positiveRealSpace) Inf() float64 {\n\treturn 0\n}","func NaN32() float32 { return Float32frombits(uvnan32) }","func (o InstanceDenyMaintenancePeriodTimeOutput) Nanos() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v InstanceDenyMaintenancePeriodTime) *int { return v.Nanos }).(pulumi.IntPtrOutput)\n}","func isNaN(f float64) bool {\n\treturn f != f\n}","func isNaN(f float64) bool {\n\treturn f != f\n}","func naiveMean(i int, j int64, k *int, l *int64, meanValue *float64, w float64, intervallLength int)(){\n\t*meanValue = 6.3\n}","func (o TransferJobScheduleStartTimeOfDayOutput) Nanos() pulumi.IntOutput {\n\treturn o.ApplyT(func(v TransferJobScheduleStartTimeOfDay) int { return v.Nanos }).(pulumi.IntOutput)\n}","func Minf(a, b float32) float32","func (a *Array64) NaNMean(axis ...int) *Array64 {\n\tswitch {\n\tcase a.valAxis(&axis, \"Sum\"):\n\t\treturn a\n\t}\n\treturn a.NaNSum(axis...).Div(a.NaNCount(axis...))\n}","func isNaN(val string) bool {\n\tif val == nan {\n\t\treturn true\n\t}\n\n\t_, err := strconv.ParseFloat(val, 64)\n\n\treturn err != nil\n}","func TestFetchNanNumber(t *testing.T) {\n\texpected := \"NaN\"\n\tinput := []byte(\"aN\")\n\tlex := NewLexer(bytes.NewReader(input))\n\terr := lex.fetchNanNumber()\n\tif err != nil {\n\t\tt.Error(err.Error())\n\t\treturn\n\t}\n\n\ttoken := lex.tokens[0]\n\tif token.String() != expected {\n\t\tt.Errorf(\"unexpected '%s', expecting '%s'\", token.String(), expected)\n\t}\n}","func ReplaceNaNs(data *FilteredData, replacementType NaNReplacement) *FilteredData {\n\t// go does not marshal NaN values properly so make them empty\n\tnumericColumns := make([]int, 0)\n\tfor _, c := range data.Columns {\n\t\tif model.IsNumerical(c.Type) {\n\t\t\tnumericColumns = append(numericColumns, c.Index)\n\t\t}\n\t}\n\n\tif len(numericColumns) > 0 {\n\t\tfor _, r := range data.Values {\n\t\t\tfor _, nc := range numericColumns {\n\t\t\t\tf, ok := r[nc].Value.(float64)\n\t\t\t\tif ok && math.IsNaN(f) {\n\t\t\t\t\tif replacementType == Null {\n\t\t\t\t\t\tr[nc].Value = nil\n\t\t\t\t\t} else if replacementType == EmptyString {\n\t\t\t\t\t\tr[nc].Value = \"\"\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn data\n}","func nanChecker(want, got float64) bool {\n\ta, b, c := math.IsNaN(want), math.IsNaN(got), (want == got)\n\treturn (a && b) || (!a && !b && c)\n}","func (o DurationOutput) Nanos() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v Duration) *int { return v.Nanos }).(pulumi.IntPtrOutput)\n}","func Benchmark_FindNaNOrInf(b *testing.B) {\n\tfuncs := []taggedMultiBenchVarargsFunc{\n\t\t{\n\t\t\tf: findNaNOrInfSimdSubtask,\n\t\t\ttag: \"SIMD\",\n\t\t},\n\t\t{\n\t\t\tf: findNaNOrInfBitwiseSubtask,\n\t\t\ttag: \"Bitwise\",\n\t\t},\n\t\t{\n\t\t\tf: findNaNOrInfStandardSubtask,\n\t\t\ttag: \"Standard\",\n\t\t},\n\t}\n\trand.Seed(1)\n\tfor _, f := range funcs {\n\t\tmultiBenchmarkVarargs(f.f, f.tag+\"Long\", 100000, func() interface{} {\n\t\t\tmain := make([]float64, 30000)\n\t\t\t// Results were overly influenced by RNG if the number of NaNs/infs in\n\t\t\t// the slice was not controlled.\n\t\t\tfor i := 0; i < 30; i++ {\n\t\t\t\tfor {\n\t\t\t\t\tpos := rand.Intn(len(main))\n\t\t\t\t\tif main[pos] != math.Inf(0) {\n\t\t\t\t\t\tmain[pos] = math.Inf(0)\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn float64Args{\n\t\t\t\tmain: main,\n\t\t\t}\n\t\t}, b)\n\t}\n}","func r_mx(Hstar, fo float64) float64 {\n\treturn 1. / (Hstar/3000. + 100.*fo)\n}","func (space RealIntervalSpace) Inf() float64 {\n\treturn space.Min\n}","func Nper(rate decimal.Decimal, pmt decimal.Decimal, pv decimal.Decimal, fv decimal.Decimal, when paymentperiod.Type) (result decimal.Decimal, err error) {\n\tdefer func() {\n\t\tif r := recover(); r != nil {\n\t\t\tresult = decimal.Zero\n\t\t\terr = fmt.Errorf(\"%w: %v\", ErrOutOfBounds, r)\n\t\t}\n\t}()\n\tone := decimal.NewFromInt(1)\n\tminusOne := decimal.NewFromInt(-1)\n\tdWhen := decimal.NewFromInt(when.Value())\n\tdRateWithWhen := rate.Mul(dWhen)\n\tz := pmt.Mul(one.Add(dRateWithWhen)).Div(rate)\n\tnumerator := minusOne.Mul(fv).Add(z).Div(pv.Add(z))\n\tdenominator := one.Add(rate)\n\tfloatNumerator, _ := numerator.BigFloat().Float64()\n\tfloatDenominator, _ := denominator.BigFloat().Float64()\n\tlogNumerator := math.Log(floatNumerator)\n\tlogDenominator := math.Log(floatDenominator)\n\tdlogDenominator := decimal.NewFromFloat(logDenominator)\n\tresult = decimal.NewFromFloat(logNumerator).Div(dlogDenominator)\n\treturn result, nil\n}","func expAvg2N(d []float64, step float64) float64 {\n\ts := 0.\n\t//\tsz := float64(len(d))\n\tm := step\n\tl := len(d) - 1\n\tfor i := range d {\n\t\ts += m * d[l-i]\n\t\tm *= (1 - step)\n\t\t//\tfmt.Printf(\"S = %v M = %v\\n\", s, m)\n\t}\n\treturn s\n}","func IsNan(scope *Scope, x tf.Output) (y tf.Output) {\n\tif scope.Err() != nil {\n\t\treturn\n\t}\n\topspec := tf.OpSpec{\n\t\tType: \"IsNan\",\n\t\tInput: []tf.Input{\n\t\t\tx,\n\t\t},\n\t}\n\top := scope.AddOperation(opspec)\n\treturn op.Output(0)\n}","func nd(n int) int {\n\tif n == 0 {\n\t\treturn 1\n\t}\n\treturn int(math.Log10(float64(n))) + 1\n}","func (o InstanceDenyMaintenancePeriodTimePtrOutput) Nanos() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v *InstanceDenyMaintenancePeriodTime) *int {\n\t\tif v == nil {\n\t\t\treturn nil\n\t\t}\n\t\treturn v.Nanos\n\t}).(pulumi.IntPtrOutput)\n}","func (o TransferJobScheduleStartTimeOfDayPtrOutput) Nanos() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v *TransferJobScheduleStartTimeOfDay) *int {\n\t\tif v == nil {\n\t\t\treturn nil\n\t\t}\n\t\treturn &v.Nanos\n\t}).(pulumi.IntPtrOutput)\n}","func (o InstanceMaintenanceWindowStartTimeOutput) Nanos() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v InstanceMaintenanceWindowStartTime) *int { return v.Nanos }).(pulumi.IntPtrOutput)\n}","func (t Time) Nanosecond() int {}","func Sum(values []float64) float64 {\n\tvar sum float64 = 0.0\n\tfor _, d := range values {\n\t\tif !math.IsNaN(d) {\n\t\t\tsum += d\n\t\t}\n\t}\n\treturn sum\n}","func (o InstanceMaintenancePolicyWeeklyMaintenanceWindowStartTimeOutput) Nanos() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v InstanceMaintenancePolicyWeeklyMaintenanceWindowStartTime) *int { return v.Nanos }).(pulumi.IntPtrOutput)\n}","func (o InstanceMaintenancePolicyWeeklyMaintenanceWindowStartTimeOutput) Nanos() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v InstanceMaintenancePolicyWeeklyMaintenanceWindowStartTime) *int { return v.Nanos }).(pulumi.IntPtrOutput)\n}","func SomenteNumeros(cnpj string) string {\n\tr := regexp.MustCompile(\"[0-9]+\")\n\treturn strings.Join(r.FindAllString(cnpj, -1), \"\")\n}","func NaN32() float32 {\n\treturn float32(math.NaN())\n}","func trailingZeroes(n int) int {\n\tif n < 5 {\n\t\treturn 0\n\t}\n\tfives := n / 5\n\n\treturn fives + trailingZeroes(n/5)\n}","func (sp booleanSpace) Inf() float64 {\n\treturn 0\n}","func TestNoPanic(t *testing.T) {\n\ts := NewGKArray(testEps)\n\tfor i := 0; i < 2*int(1/s.epsilon); i++ {\n\t\ts.Add(float64(i))\n\t\tassert.NotPanics(t, func() { s.Quantile(0.9) })\n\t}\n}","func isNaN64(f float64) bool { return f != f }","func HitungNA(clo1, clo2, clo3 float64) float64 {\r\n\r\n\tvar Total float64\r\n\tTotal = (clo1 * 20 / 100) + (clo2 * 35 / 100) + (clo3 * 45 / 100)\r\n\r\n\treturn Total\r\n\r\n}","func (NilTimer) Mean() float64 { return 0.0 }","func Infoln(v ...interface{}) {\n\tlog.Infoln(v...)\n}","func (o DurationResponseOutput) Nanos() pulumi.IntOutput {\n\treturn o.ApplyT(func(v DurationResponse) int { return v.Nanos }).(pulumi.IntOutput)\n}","func (o DurationPtrOutput) Nanos() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v *Duration) *int {\n\t\tif v == nil {\n\t\t\treturn nil\n\t\t}\n\t\treturn v.Nanos\n\t}).(pulumi.IntPtrOutput)\n}","func parseTemp(t float64) float64 {\n\treturn (t * 1.8) + 32\n}","func posInf() float64 {\n\treturn math.Inf(1) // argument specifies positive infinity\n}","func dagiFNV(r, p *node)","func (*BigInt) IsNaN() bool {\n\treturn false\n}","func JN(T, fmin, fmax, R float64) float64 {\n\tconst k_b = 1.38064852e-23\n\treturn math.Sqrt(4 * k_b * (273.15 + T) * (fmax - fmin) * R)\n}","func (Integer) IsNaN() bool {\n\treturn false\n}","func JNO(r operand.Op) { ctx.JNO(r) }","func formatNano(nanosec uint, n int, trim bool) []byte {\n\tu := nanosec\n\tvar buf [9]byte\n\tfor start := len(buf); start > 0; {\n\t\tstart--\n\t\tbuf[start] = byte(u%10 + '0')\n\t\tu /= 10\n\t}\n\n\tif n > 9 {\n\t\tn = 9\n\t}\n\tif trim {\n\t\tfor n > 0 && buf[n-1] == '0' {\n\t\t\tn--\n\t\t}\n\t\tif n == 0 {\n\t\t\treturn buf[:0]\n\t\t}\n\t}\n\treturn buf[:n]\n}","func Mean(values []float64) float64 {\n\tvar sum float64 = 0.0\n\tcount := 0\n\tfor _, d := range values {\n\t\tif !math.IsNaN(d) {\n\t\t\tsum += d\n\t\t\tcount++\n\t\t}\n\t}\n\treturn sum / float64(count)\n}","func (o InstanceMaintenanceWindowStartTimePtrOutput) Nanos() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v *InstanceMaintenanceWindowStartTime) *int {\n\t\tif v == nil {\n\t\t\treturn nil\n\t\t}\n\t\treturn v.Nanos\n\t}).(pulumi.IntPtrOutput)\n}","func (dt DateTime) Nanosecond() int {\n\treturn dt.src.Nanosecond()\n}","func DivZeroExp(exp string) bool {\n var index int = strings.Index(exp, \"/\")\n for index != -1 {\n var divisor string = exp[index+1:index+2]\n if divisor == \"(\" {\n divisor = exp[index+1:FindClosingParen(exp, index+1)+1]\n } else {\n var end int = index + 2\n for end < len(exp) && strings.Index(numbers, string(exp[end])) != -1 {\n end++\n }\n divisor = exp[index+1:end]\n }\n\n var result string = Pemdas(divisor)\n if result == \"Infinity\" || NotateToDouble(result) == 0 {\n return true\n }\n\n index = strings.Index(exp[index + 1:], \"/\")\n }\n\n return false\n}","func JNZ(r operand.Op) { ctx.JNZ(r) }","func (s Series) IsNaN() []bool {\n\tret := make([]bool, s.Len())\n\tfor i := 0; i < s.Len(); i++ {\n\t\tret[i] = s.elements.Elem(i).IsNaN()\n\t}\n\treturn ret\n}","func (xt XSDTime) Nanosecond() int {\n\treturn xt.innerTime.Nanosecond()\n}","func Nanosec() int64 {\n\treturn internal.Syscall0r64(NANOSEC)\n}","func MulNoNan(scope *Scope, x tf.Output, y tf.Output) (z tf.Output) {\n\tif scope.Err() != nil {\n\t\treturn\n\t}\n\topspec := tf.OpSpec{\n\t\tType: \"MulNoNan\",\n\t\tInput: []tf.Input{\n\t\t\tx, y,\n\t\t},\n\t}\n\top := scope.AddOperation(opspec)\n\treturn op.Output(0)\n}","func Infinity() Point {\n\treturn Point{1, 0}\n}","func calcSolarNoon(longitude float64, equationOfTime []float64, utcOffset float64) (solarNoon []float64) {\n\tfor index := 0; index < len(equationOfTime); index++ {\n\t\ttemp := (720.0 - 4.0*longitude - equationOfTime[index] + utcOffset*60.0) * 60.0\n\t\tsolarNoon = append(solarNoon, temp)\n\t}\n\treturn\n}","func moment(data []float64, c float64, p float64, N int) float64 {\n\n\tsum := 0.0\n\tfor i := 0; i < N; i++ {\n\t\tsum += math.Pow(data[i]-c, p)\n\t}\n\n\treturn sum / float64(N)\n}","func naiveDFT(x []complex128) (y []complex128) {\n\ty = make([]complex128, len(x))\n\tdt := -2 * math.Pi / float64(len(x))\n\tfor i := range x {\n\t\targ1 := float64(i) * dt\n\t\tfor k, xv := range x {\n\t\t\targ2 := float64(k) * arg1\n\t\t\ty[i] += complex(math.Cos(arg2), math.Sin(arg2)) * xv\n\t\t}\n\t}\n\treturn y\n}","func NSEpow(o, s []float64, p float64) float64 {\n\tvar n, d float64\n\tom, _ := Meansd(o)\n\tif len(o) != len(s) {\n\t\tlog.Fatalf(\"NSEpow array lengths not matching %d %d\\n\", len(o), len(s))\n\t}\n\tfor i := range o {\n\t\tif !math.IsNaN(s[i]) && !math.IsNaN(o[i]) {\n\t\t\tn += math.Pow(s[i]-o[i], p)\n\t\t\td += math.Pow(o[i]-om, p)\n\t\t}\n\t}\n\treturn 1. - n/d\n}","func parseNullableFloat64(content []byte, aggErr *AggregateError) *float64 {\n if len(content) == 0 {\n return nil\n }\n result := parseFloat64(content, aggErr)\n return &result\n}","func recip(val float64) float64 {\n\treturn 1 / val\n}","func nulls(i int) string {\n\ts := \"\"\n\tfor j := 0; j < i; j++ {\n\t\ts += zero\n\t}\n\treturn s\n}","func Nanosec() int64 {\n\treturn syscall.Nanosec()\n}","func _MeasurementNoOp() {\n\tvar x [1]struct{}\n\t_ = x[Frequency-(1)]\n\t_ = x[Current-(2)]\n\t_ = x[CurrentL1-(3)]\n\t_ = x[CurrentL2-(4)]\n\t_ = x[CurrentL3-(5)]\n\t_ = x[Voltage-(6)]\n\t_ = x[VoltageL1-(7)]\n\t_ = x[VoltageL2-(8)]\n\t_ = x[VoltageL3-(9)]\n\t_ = x[Power-(10)]\n\t_ = x[PowerL1-(11)]\n\t_ = x[PowerL2-(12)]\n\t_ = x[PowerL3-(13)]\n\t_ = x[ImportPower-(14)]\n\t_ = x[ImportPowerL1-(15)]\n\t_ = x[ImportPowerL2-(16)]\n\t_ = x[ImportPowerL3-(17)]\n\t_ = x[ExportPower-(18)]\n\t_ = x[ExportPowerL1-(19)]\n\t_ = x[ExportPowerL2-(20)]\n\t_ = x[ExportPowerL3-(21)]\n\t_ = x[ReactivePower-(22)]\n\t_ = x[ReactivePowerL1-(23)]\n\t_ = x[ReactivePowerL2-(24)]\n\t_ = x[ReactivePowerL3-(25)]\n\t_ = x[ApparentPower-(26)]\n\t_ = x[ApparentPowerL1-(27)]\n\t_ = x[ApparentPowerL2-(28)]\n\t_ = x[ApparentPowerL3-(29)]\n\t_ = x[Cosphi-(30)]\n\t_ = x[CosphiL1-(31)]\n\t_ = x[CosphiL2-(32)]\n\t_ = x[CosphiL3-(33)]\n\t_ = x[THD-(34)]\n\t_ = x[THDL1-(35)]\n\t_ = x[THDL2-(36)]\n\t_ = x[THDL3-(37)]\n\t_ = x[Sum-(38)]\n\t_ = x[SumT1-(39)]\n\t_ = x[SumT2-(40)]\n\t_ = x[SumL1-(41)]\n\t_ = x[SumL2-(42)]\n\t_ = x[SumL3-(43)]\n\t_ = x[Import-(44)]\n\t_ = x[ImportT1-(45)]\n\t_ = x[ImportT2-(46)]\n\t_ = x[ImportL1-(47)]\n\t_ = x[ImportL2-(48)]\n\t_ = x[ImportL3-(49)]\n\t_ = x[Export-(50)]\n\t_ = x[ExportT1-(51)]\n\t_ = x[ExportT2-(52)]\n\t_ = x[ExportL1-(53)]\n\t_ = x[ExportL2-(54)]\n\t_ = x[ExportL3-(55)]\n\t_ = x[ReactiveSum-(56)]\n\t_ = x[ReactiveSumT1-(57)]\n\t_ = x[ReactiveSumT2-(58)]\n\t_ = x[ReactiveSumL1-(59)]\n\t_ = x[ReactiveSumL2-(60)]\n\t_ = x[ReactiveSumL3-(61)]\n\t_ = x[ReactiveImport-(62)]\n\t_ = x[ReactiveImportT1-(63)]\n\t_ = x[ReactiveImportT2-(64)]\n\t_ = x[ReactiveImportL1-(65)]\n\t_ = x[ReactiveImportL2-(66)]\n\t_ = x[ReactiveImportL3-(67)]\n\t_ = x[ReactiveExport-(68)]\n\t_ = x[ReactiveExportT1-(69)]\n\t_ = x[ReactiveExportT2-(70)]\n\t_ = x[ReactiveExportL1-(71)]\n\t_ = x[ReactiveExportL2-(72)]\n\t_ = x[ReactiveExportL3-(73)]\n\t_ = x[DCCurrent-(74)]\n\t_ = x[DCVoltage-(75)]\n\t_ = x[DCPower-(76)]\n\t_ = x[HeatSinkTemp-(77)]\n\t_ = x[DCCurrentS1-(78)]\n\t_ = x[DCVoltageS1-(79)]\n\t_ = x[DCPowerS1-(80)]\n\t_ = x[DCEnergyS1-(81)]\n\t_ = x[DCCurrentS2-(82)]\n\t_ = x[DCVoltageS2-(83)]\n\t_ = x[DCPowerS2-(84)]\n\t_ = x[DCEnergyS2-(85)]\n\t_ = x[DCCurrentS3-(86)]\n\t_ = x[DCVoltageS3-(87)]\n\t_ = x[DCPowerS3-(88)]\n\t_ = x[DCEnergyS3-(89)]\n\t_ = x[DCCurrentS4-(90)]\n\t_ = x[DCVoltageS4-(91)]\n\t_ = x[DCPowerS4-(92)]\n\t_ = x[DCEnergyS4-(93)]\n\t_ = x[ChargeState-(94)]\n\t_ = x[BatteryVoltage-(95)]\n\t_ = x[PhaseAngle-(96)]\n}","func Infoln(val ...interface{}) error {\n\tlog := logger.Get()\n\tlog.Infoln(val...)\n\treturn nil\n}","func (z *Big) setNaN(c Condition, f form, p Payload) *Big {\n\tz.form = f\n\tz.compact = uint64(p)\n\tz.Context.Conditions |= c\n\tif z.Context.OperatingMode == Go {\n\t\tpanic(ErrNaN{Msg: z.Context.Conditions.String()})\n\t}\n\treturn z\n}","func (x *Big) IsNaN(quiet int) bool {\n\treturn quiet >= 0 && x.form&qnan == qnan || quiet <= 0 && x.form&snan == snan\n}","func RegulateTemp (value float64) float64{\n\n\tif value> 22 {\n\t\treturn (22 * 100)/ value\n\t}else if value < 22{\n return 100.0\n\t}\n\n\treturn 0.0\n}","func NilFloat() Float {\n\treturn Float{0, false}\n}","func (o DurationResponsePtrOutput) Nanos() pulumi.IntPtrOutput {\n\treturn o.ApplyT(func(v *DurationResponse) *int {\n\t\tif v == nil {\n\t\t\treturn nil\n\t\t}\n\t\treturn &v.Nanos\n\t}).(pulumi.IntPtrOutput)\n}","func TestEvaluatorMissingValue(t *testing.T) {\n\tvar values = make(map[string]int)\n\texpression := \"value\"\n\n\t_, err := evaluator.Evaluate(expression, values)\n\n\tassert.Error(t, err, \"error is expected\")\n}","func (s *Series) CountOfNA() int {\n\tcount := 0\n\tfor _, val := range s.Data {\n\t\tif val == nil {\n\t\t\tcount++\n\t\t}\n\t}\n\treturn count\n}","func naiveDFTreal(x []float64) (y []complex128) {\n\ty = make([]complex128, len(x))\n\tdt := -2 * math.Pi / float64(len(x))\n\tfor i := range x {\n\t\targ1 := float64(i) * dt\n\t\tfor k, xv := range x {\n\t\t\targ2 := float64(k) * arg1\n\t\t\ty[i] += complex(xv*math.Cos(arg2), xv*math.Sin(arg2))\n\t\t}\n\t}\n\treturn y[:len(x)/2+1]\n}","func (dt *DateTime) Nanosecond() *Number {\n\topChain := dt.chain.enter(\"Nanosecond()\")\n\tdefer opChain.leave()\n\n\tif opChain.failed() {\n\t\treturn newNumber(opChain, float64(0))\n\t}\n\n\treturn newNumber(opChain, float64(dt.value.Nanosecond()))\n}","func (x *Float) IsInf() bool {}","func pi(n int) float64 {\n\tvar x float64\n\tvar a = 1\n\tvar b = 1\n\tfor i := 0; i < n; i++ {\n\t\tx += float64(a) / float64(b)\n\t\ta *= -1\n\t\tb += 2\n\t}\n\treturn x * 4.0\n}","func main() {\n\tfmt.Println(missingNumber([]int{0}))\n\tfmt.Println(missingNumber([]int{0, 1}))\n}","func (p *Parser) NullFloat64(i int, context string) Float64 {\n\ts := p.String(i, context)\n\tif p.err != nil {\n\t\treturn Float64{}\n\t}\n\tif s == \"\" {\n\t\treturn Float64{}\n\t}\n\tv, err := strconv.ParseFloat(s, 64)\n\tif err != nil {\n\t\tp.SetErr(context, s)\n\t\treturn Float64{}\n\t}\n\treturn Float64{Value: v, Valid: true}\n}","func TestFloatNull(t *testing.T) {\n\tclient := newQueriesClient(t)\n\tresult, err := client.FloatNull(context.Background(), nil)\n\trequire.NoError(t, err)\n\trequire.Zero(t, result)\n}","func (a *Array64) NaNCount(axis ...int) *Array64 {\n\tif a.valAxis(&axis, \"NaNCount\") {\n\t\treturn a\n\t}\n\n\tnc := func(d []float64) (r float64) {\n\t\tfor _, v := range d {\n\t\t\tif !math.IsNaN(v) {\n\t\t\t\tr++\n\t\t\t}\n\t\t}\n\t\treturn r\n\t}\n\n\treturn a.Fold(nc, axis...)\n}","func encodeFloats(data map[string]any) {\n\tfor k, v := range data {\n\t\tswitch v := v.(type) {\n\t\tcase float64:\n\t\t\tif math.IsNaN(v) || math.IsInf(v, 0) {\n\t\t\t\tdata[k] = nil\n\t\t\t}\n\t\t}\n\t}\n}","func (dt DateTime) Nanosecond() int {\n\treturn dt.Time().Nanosecond()\n}","func Momentum(n int) func(s []float64) []float64 {\n\treturn func(s []float64) (res []float64) {\n\t\tf := Skip(n)(s)\n\t\tres = make([]float64, len(f))\n\t\tfor i := range res {\n\t\t\tres[i] = f[i]/s[i] - 1\n\t\t}\n\n\t\treturn\n\t}\n}","func (a *Array64) Nonzero(axis ...int) *Array64 {\n\tif a.valAxis(&axis, \"Nonzero\") {\n\t\treturn a\n\t}\n\n\treturn a.Map(func(d float64) float64 {\n\t\tif d == 0 {\n\t\t\treturn 0\n\t\t}\n\t\treturn 1\n\t}).Sum(axis...)\n}"],"string":"[\n \"func NaN() float32 { return Float32frombits(uvnan) }\",\n \"func fillNaNDense(m *mat.Dense) {\\n\\tr, c := m.Dims()\\n\\tfor i := 0; i < r; i++ {\\n\\t\\tfor j := 0; j < c; j++ {\\n\\t\\t\\tm.Set(i, j, math.NaN())\\n\\t\\t}\\n\\t}\\n}\",\n \"func (a *Array64) NaNSum(axis ...int) *Array64 {\\n\\tif a.valAxis(&axis, \\\"NaNSum\\\") {\\n\\t\\treturn a\\n\\t}\\n\\n\\tns := func(d []float64) (r float64) {\\n\\t\\tflag := false\\n\\t\\tfor _, v := range d {\\n\\t\\t\\tif !math.IsNaN(v) {\\n\\t\\t\\t\\tflag = true\\n\\t\\t\\t\\tr += v\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif flag {\\n\\t\\t\\treturn r\\n\\t\\t}\\n\\t\\treturn math.NaN()\\n\\t}\\n\\n\\treturn a.Fold(ns, axis...)\\n\\n}\",\n \"func (v Volume) Nanolitres() float64 {\\n\\treturn float64(v / Nanolitre)\\n}\",\n \"func nanotime() int64\",\n \"func nanotime() int64\",\n \"func nanotime() int64\",\n \"func nanotime() int64\",\n \"func IsNan(arg float64) bool {\\n\\treturn math.IsNaN(arg)\\n}\",\n \"func DivNoNan(scope *Scope, x tf.Output, y tf.Output) (z tf.Output) {\\n\\tif scope.Err() != nil {\\n\\t\\treturn\\n\\t}\\n\\topspec := tf.OpSpec{\\n\\t\\tType: \\\"DivNoNan\\\",\\n\\t\\tInput: []tf.Input{\\n\\t\\t\\tx, y,\\n\\t\\t},\\n\\t}\\n\\top := scope.AddOperation(opspec)\\n\\treturn op.Output(0)\\n}\",\n \"func (result Result) NaN() Result {\\r\\n\\tresult.AvgDelay = math.NaN()\\r\\n\\tresult.MinDelay = math.NaN()\\r\\n\\tresult.MaxDelay = math.NaN()\\r\\n\\treturn result\\r\\n}\",\n \"func IsNan(f float64) bool {\\n\\n\\treturn math.IsNaN(f)\\n}\",\n \"func Nanotime() int64 {\\n\\treturn nanotime()\\n}\",\n \"func Nanotime() int64 {\\n\\treturn nanotime()\\n}\",\n \"func TestFetchNanNumberEndByNonEOF(t *testing.T) {\\n\\tinputs := [][]byte{[]byte(\\\"aN \\\"), []byte(\\\"aN{\\\"), []byte(\\\"aN}\\\"), []byte(\\\"aN[\\\"), []byte(\\\"aN]\\\"), []byte(\\\"aN:\\\"), []byte(\\\"aN,\\\")}\\n\\texpected := \\\"NaN\\\"\\n\\n\\tfor _, input := range inputs {\\n\\t\\tlex := NewLexer(bytes.NewReader(input))\\n\\t\\terr := lex.fetchNanNumber()\\n\\t\\tif err != nil {\\n\\t\\t\\tt.Error(err.Error())\\n\\t\\t\\treturn\\n\\t\\t}\\n\\n\\t\\ttoken := lex.tokens[0]\\n\\t\\tif token.String() != expected {\\n\\t\\t\\tt.Errorf(\\\"unexpected '%s', expecting '%s'\\\", token.String(), expected)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}\\n}\",\n \"func (sp positiveRealSpace) Inf() float64 {\\n\\treturn 0\\n}\",\n \"func NaN32() float32 { return Float32frombits(uvnan32) }\",\n \"func (o InstanceDenyMaintenancePeriodTimeOutput) Nanos() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v InstanceDenyMaintenancePeriodTime) *int { return v.Nanos }).(pulumi.IntPtrOutput)\\n}\",\n \"func isNaN(f float64) bool {\\n\\treturn f != f\\n}\",\n \"func isNaN(f float64) bool {\\n\\treturn f != f\\n}\",\n \"func naiveMean(i int, j int64, k *int, l *int64, meanValue *float64, w float64, intervallLength int)(){\\n\\t*meanValue = 6.3\\n}\",\n \"func (o TransferJobScheduleStartTimeOfDayOutput) Nanos() pulumi.IntOutput {\\n\\treturn o.ApplyT(func(v TransferJobScheduleStartTimeOfDay) int { return v.Nanos }).(pulumi.IntOutput)\\n}\",\n \"func Minf(a, b float32) float32\",\n \"func (a *Array64) NaNMean(axis ...int) *Array64 {\\n\\tswitch {\\n\\tcase a.valAxis(&axis, \\\"Sum\\\"):\\n\\t\\treturn a\\n\\t}\\n\\treturn a.NaNSum(axis...).Div(a.NaNCount(axis...))\\n}\",\n \"func isNaN(val string) bool {\\n\\tif val == nan {\\n\\t\\treturn true\\n\\t}\\n\\n\\t_, err := strconv.ParseFloat(val, 64)\\n\\n\\treturn err != nil\\n}\",\n \"func TestFetchNanNumber(t *testing.T) {\\n\\texpected := \\\"NaN\\\"\\n\\tinput := []byte(\\\"aN\\\")\\n\\tlex := NewLexer(bytes.NewReader(input))\\n\\terr := lex.fetchNanNumber()\\n\\tif err != nil {\\n\\t\\tt.Error(err.Error())\\n\\t\\treturn\\n\\t}\\n\\n\\ttoken := lex.tokens[0]\\n\\tif token.String() != expected {\\n\\t\\tt.Errorf(\\\"unexpected '%s', expecting '%s'\\\", token.String(), expected)\\n\\t}\\n}\",\n \"func ReplaceNaNs(data *FilteredData, replacementType NaNReplacement) *FilteredData {\\n\\t// go does not marshal NaN values properly so make them empty\\n\\tnumericColumns := make([]int, 0)\\n\\tfor _, c := range data.Columns {\\n\\t\\tif model.IsNumerical(c.Type) {\\n\\t\\t\\tnumericColumns = append(numericColumns, c.Index)\\n\\t\\t}\\n\\t}\\n\\n\\tif len(numericColumns) > 0 {\\n\\t\\tfor _, r := range data.Values {\\n\\t\\t\\tfor _, nc := range numericColumns {\\n\\t\\t\\t\\tf, ok := r[nc].Value.(float64)\\n\\t\\t\\t\\tif ok && math.IsNaN(f) {\\n\\t\\t\\t\\t\\tif replacementType == Null {\\n\\t\\t\\t\\t\\t\\tr[nc].Value = nil\\n\\t\\t\\t\\t\\t} else if replacementType == EmptyString {\\n\\t\\t\\t\\t\\t\\tr[nc].Value = \\\"\\\"\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn data\\n}\",\n \"func nanChecker(want, got float64) bool {\\n\\ta, b, c := math.IsNaN(want), math.IsNaN(got), (want == got)\\n\\treturn (a && b) || (!a && !b && c)\\n}\",\n \"func (o DurationOutput) Nanos() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v Duration) *int { return v.Nanos }).(pulumi.IntPtrOutput)\\n}\",\n \"func Benchmark_FindNaNOrInf(b *testing.B) {\\n\\tfuncs := []taggedMultiBenchVarargsFunc{\\n\\t\\t{\\n\\t\\t\\tf: findNaNOrInfSimdSubtask,\\n\\t\\t\\ttag: \\\"SIMD\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tf: findNaNOrInfBitwiseSubtask,\\n\\t\\t\\ttag: \\\"Bitwise\\\",\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tf: findNaNOrInfStandardSubtask,\\n\\t\\t\\ttag: \\\"Standard\\\",\\n\\t\\t},\\n\\t}\\n\\trand.Seed(1)\\n\\tfor _, f := range funcs {\\n\\t\\tmultiBenchmarkVarargs(f.f, f.tag+\\\"Long\\\", 100000, func() interface{} {\\n\\t\\t\\tmain := make([]float64, 30000)\\n\\t\\t\\t// Results were overly influenced by RNG if the number of NaNs/infs in\\n\\t\\t\\t// the slice was not controlled.\\n\\t\\t\\tfor i := 0; i < 30; i++ {\\n\\t\\t\\t\\tfor {\\n\\t\\t\\t\\t\\tpos := rand.Intn(len(main))\\n\\t\\t\\t\\t\\tif main[pos] != math.Inf(0) {\\n\\t\\t\\t\\t\\t\\tmain[pos] = math.Inf(0)\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn float64Args{\\n\\t\\t\\t\\tmain: main,\\n\\t\\t\\t}\\n\\t\\t}, b)\\n\\t}\\n}\",\n \"func r_mx(Hstar, fo float64) float64 {\\n\\treturn 1. / (Hstar/3000. + 100.*fo)\\n}\",\n \"func (space RealIntervalSpace) Inf() float64 {\\n\\treturn space.Min\\n}\",\n \"func Nper(rate decimal.Decimal, pmt decimal.Decimal, pv decimal.Decimal, fv decimal.Decimal, when paymentperiod.Type) (result decimal.Decimal, err error) {\\n\\tdefer func() {\\n\\t\\tif r := recover(); r != nil {\\n\\t\\t\\tresult = decimal.Zero\\n\\t\\t\\terr = fmt.Errorf(\\\"%w: %v\\\", ErrOutOfBounds, r)\\n\\t\\t}\\n\\t}()\\n\\tone := decimal.NewFromInt(1)\\n\\tminusOne := decimal.NewFromInt(-1)\\n\\tdWhen := decimal.NewFromInt(when.Value())\\n\\tdRateWithWhen := rate.Mul(dWhen)\\n\\tz := pmt.Mul(one.Add(dRateWithWhen)).Div(rate)\\n\\tnumerator := minusOne.Mul(fv).Add(z).Div(pv.Add(z))\\n\\tdenominator := one.Add(rate)\\n\\tfloatNumerator, _ := numerator.BigFloat().Float64()\\n\\tfloatDenominator, _ := denominator.BigFloat().Float64()\\n\\tlogNumerator := math.Log(floatNumerator)\\n\\tlogDenominator := math.Log(floatDenominator)\\n\\tdlogDenominator := decimal.NewFromFloat(logDenominator)\\n\\tresult = decimal.NewFromFloat(logNumerator).Div(dlogDenominator)\\n\\treturn result, nil\\n}\",\n \"func expAvg2N(d []float64, step float64) float64 {\\n\\ts := 0.\\n\\t//\\tsz := float64(len(d))\\n\\tm := step\\n\\tl := len(d) - 1\\n\\tfor i := range d {\\n\\t\\ts += m * d[l-i]\\n\\t\\tm *= (1 - step)\\n\\t\\t//\\tfmt.Printf(\\\"S = %v M = %v\\\\n\\\", s, m)\\n\\t}\\n\\treturn s\\n}\",\n \"func IsNan(scope *Scope, x tf.Output) (y tf.Output) {\\n\\tif scope.Err() != nil {\\n\\t\\treturn\\n\\t}\\n\\topspec := tf.OpSpec{\\n\\t\\tType: \\\"IsNan\\\",\\n\\t\\tInput: []tf.Input{\\n\\t\\t\\tx,\\n\\t\\t},\\n\\t}\\n\\top := scope.AddOperation(opspec)\\n\\treturn op.Output(0)\\n}\",\n \"func nd(n int) int {\\n\\tif n == 0 {\\n\\t\\treturn 1\\n\\t}\\n\\treturn int(math.Log10(float64(n))) + 1\\n}\",\n \"func (o InstanceDenyMaintenancePeriodTimePtrOutput) Nanos() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v *InstanceDenyMaintenancePeriodTime) *int {\\n\\t\\tif v == nil {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn v.Nanos\\n\\t}).(pulumi.IntPtrOutput)\\n}\",\n \"func (o TransferJobScheduleStartTimeOfDayPtrOutput) Nanos() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v *TransferJobScheduleStartTimeOfDay) *int {\\n\\t\\tif v == nil {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn &v.Nanos\\n\\t}).(pulumi.IntPtrOutput)\\n}\",\n \"func (o InstanceMaintenanceWindowStartTimeOutput) Nanos() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v InstanceMaintenanceWindowStartTime) *int { return v.Nanos }).(pulumi.IntPtrOutput)\\n}\",\n \"func (t Time) Nanosecond() int {}\",\n \"func Sum(values []float64) float64 {\\n\\tvar sum float64 = 0.0\\n\\tfor _, d := range values {\\n\\t\\tif !math.IsNaN(d) {\\n\\t\\t\\tsum += d\\n\\t\\t}\\n\\t}\\n\\treturn sum\\n}\",\n \"func (o InstanceMaintenancePolicyWeeklyMaintenanceWindowStartTimeOutput) Nanos() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v InstanceMaintenancePolicyWeeklyMaintenanceWindowStartTime) *int { return v.Nanos }).(pulumi.IntPtrOutput)\\n}\",\n \"func (o InstanceMaintenancePolicyWeeklyMaintenanceWindowStartTimeOutput) Nanos() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v InstanceMaintenancePolicyWeeklyMaintenanceWindowStartTime) *int { return v.Nanos }).(pulumi.IntPtrOutput)\\n}\",\n \"func SomenteNumeros(cnpj string) string {\\n\\tr := regexp.MustCompile(\\\"[0-9]+\\\")\\n\\treturn strings.Join(r.FindAllString(cnpj, -1), \\\"\\\")\\n}\",\n \"func NaN32() float32 {\\n\\treturn float32(math.NaN())\\n}\",\n \"func trailingZeroes(n int) int {\\n\\tif n < 5 {\\n\\t\\treturn 0\\n\\t}\\n\\tfives := n / 5\\n\\n\\treturn fives + trailingZeroes(n/5)\\n}\",\n \"func (sp booleanSpace) Inf() float64 {\\n\\treturn 0\\n}\",\n \"func TestNoPanic(t *testing.T) {\\n\\ts := NewGKArray(testEps)\\n\\tfor i := 0; i < 2*int(1/s.epsilon); i++ {\\n\\t\\ts.Add(float64(i))\\n\\t\\tassert.NotPanics(t, func() { s.Quantile(0.9) })\\n\\t}\\n}\",\n \"func isNaN64(f float64) bool { return f != f }\",\n \"func HitungNA(clo1, clo2, clo3 float64) float64 {\\r\\n\\r\\n\\tvar Total float64\\r\\n\\tTotal = (clo1 * 20 / 100) + (clo2 * 35 / 100) + (clo3 * 45 / 100)\\r\\n\\r\\n\\treturn Total\\r\\n\\r\\n}\",\n \"func (NilTimer) Mean() float64 { return 0.0 }\",\n \"func Infoln(v ...interface{}) {\\n\\tlog.Infoln(v...)\\n}\",\n \"func (o DurationResponseOutput) Nanos() pulumi.IntOutput {\\n\\treturn o.ApplyT(func(v DurationResponse) int { return v.Nanos }).(pulumi.IntOutput)\\n}\",\n \"func (o DurationPtrOutput) Nanos() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v *Duration) *int {\\n\\t\\tif v == nil {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn v.Nanos\\n\\t}).(pulumi.IntPtrOutput)\\n}\",\n \"func parseTemp(t float64) float64 {\\n\\treturn (t * 1.8) + 32\\n}\",\n \"func posInf() float64 {\\n\\treturn math.Inf(1) // argument specifies positive infinity\\n}\",\n \"func dagiFNV(r, p *node)\",\n \"func (*BigInt) IsNaN() bool {\\n\\treturn false\\n}\",\n \"func JN(T, fmin, fmax, R float64) float64 {\\n\\tconst k_b = 1.38064852e-23\\n\\treturn math.Sqrt(4 * k_b * (273.15 + T) * (fmax - fmin) * R)\\n}\",\n \"func (Integer) IsNaN() bool {\\n\\treturn false\\n}\",\n \"func JNO(r operand.Op) { ctx.JNO(r) }\",\n \"func formatNano(nanosec uint, n int, trim bool) []byte {\\n\\tu := nanosec\\n\\tvar buf [9]byte\\n\\tfor start := len(buf); start > 0; {\\n\\t\\tstart--\\n\\t\\tbuf[start] = byte(u%10 + '0')\\n\\t\\tu /= 10\\n\\t}\\n\\n\\tif n > 9 {\\n\\t\\tn = 9\\n\\t}\\n\\tif trim {\\n\\t\\tfor n > 0 && buf[n-1] == '0' {\\n\\t\\t\\tn--\\n\\t\\t}\\n\\t\\tif n == 0 {\\n\\t\\t\\treturn buf[:0]\\n\\t\\t}\\n\\t}\\n\\treturn buf[:n]\\n}\",\n \"func Mean(values []float64) float64 {\\n\\tvar sum float64 = 0.0\\n\\tcount := 0\\n\\tfor _, d := range values {\\n\\t\\tif !math.IsNaN(d) {\\n\\t\\t\\tsum += d\\n\\t\\t\\tcount++\\n\\t\\t}\\n\\t}\\n\\treturn sum / float64(count)\\n}\",\n \"func (o InstanceMaintenanceWindowStartTimePtrOutput) Nanos() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v *InstanceMaintenanceWindowStartTime) *int {\\n\\t\\tif v == nil {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn v.Nanos\\n\\t}).(pulumi.IntPtrOutput)\\n}\",\n \"func (dt DateTime) Nanosecond() int {\\n\\treturn dt.src.Nanosecond()\\n}\",\n \"func DivZeroExp(exp string) bool {\\n var index int = strings.Index(exp, \\\"/\\\")\\n for index != -1 {\\n var divisor string = exp[index+1:index+2]\\n if divisor == \\\"(\\\" {\\n divisor = exp[index+1:FindClosingParen(exp, index+1)+1]\\n } else {\\n var end int = index + 2\\n for end < len(exp) && strings.Index(numbers, string(exp[end])) != -1 {\\n end++\\n }\\n divisor = exp[index+1:end]\\n }\\n\\n var result string = Pemdas(divisor)\\n if result == \\\"Infinity\\\" || NotateToDouble(result) == 0 {\\n return true\\n }\\n\\n index = strings.Index(exp[index + 1:], \\\"/\\\")\\n }\\n\\n return false\\n}\",\n \"func JNZ(r operand.Op) { ctx.JNZ(r) }\",\n \"func (s Series) IsNaN() []bool {\\n\\tret := make([]bool, s.Len())\\n\\tfor i := 0; i < s.Len(); i++ {\\n\\t\\tret[i] = s.elements.Elem(i).IsNaN()\\n\\t}\\n\\treturn ret\\n}\",\n \"func (xt XSDTime) Nanosecond() int {\\n\\treturn xt.innerTime.Nanosecond()\\n}\",\n \"func Nanosec() int64 {\\n\\treturn internal.Syscall0r64(NANOSEC)\\n}\",\n \"func MulNoNan(scope *Scope, x tf.Output, y tf.Output) (z tf.Output) {\\n\\tif scope.Err() != nil {\\n\\t\\treturn\\n\\t}\\n\\topspec := tf.OpSpec{\\n\\t\\tType: \\\"MulNoNan\\\",\\n\\t\\tInput: []tf.Input{\\n\\t\\t\\tx, y,\\n\\t\\t},\\n\\t}\\n\\top := scope.AddOperation(opspec)\\n\\treturn op.Output(0)\\n}\",\n \"func Infinity() Point {\\n\\treturn Point{1, 0}\\n}\",\n \"func calcSolarNoon(longitude float64, equationOfTime []float64, utcOffset float64) (solarNoon []float64) {\\n\\tfor index := 0; index < len(equationOfTime); index++ {\\n\\t\\ttemp := (720.0 - 4.0*longitude - equationOfTime[index] + utcOffset*60.0) * 60.0\\n\\t\\tsolarNoon = append(solarNoon, temp)\\n\\t}\\n\\treturn\\n}\",\n \"func moment(data []float64, c float64, p float64, N int) float64 {\\n\\n\\tsum := 0.0\\n\\tfor i := 0; i < N; i++ {\\n\\t\\tsum += math.Pow(data[i]-c, p)\\n\\t}\\n\\n\\treturn sum / float64(N)\\n}\",\n \"func naiveDFT(x []complex128) (y []complex128) {\\n\\ty = make([]complex128, len(x))\\n\\tdt := -2 * math.Pi / float64(len(x))\\n\\tfor i := range x {\\n\\t\\targ1 := float64(i) * dt\\n\\t\\tfor k, xv := range x {\\n\\t\\t\\targ2 := float64(k) * arg1\\n\\t\\t\\ty[i] += complex(math.Cos(arg2), math.Sin(arg2)) * xv\\n\\t\\t}\\n\\t}\\n\\treturn y\\n}\",\n \"func NSEpow(o, s []float64, p float64) float64 {\\n\\tvar n, d float64\\n\\tom, _ := Meansd(o)\\n\\tif len(o) != len(s) {\\n\\t\\tlog.Fatalf(\\\"NSEpow array lengths not matching %d %d\\\\n\\\", len(o), len(s))\\n\\t}\\n\\tfor i := range o {\\n\\t\\tif !math.IsNaN(s[i]) && !math.IsNaN(o[i]) {\\n\\t\\t\\tn += math.Pow(s[i]-o[i], p)\\n\\t\\t\\td += math.Pow(o[i]-om, p)\\n\\t\\t}\\n\\t}\\n\\treturn 1. - n/d\\n}\",\n \"func parseNullableFloat64(content []byte, aggErr *AggregateError) *float64 {\\n if len(content) == 0 {\\n return nil\\n }\\n result := parseFloat64(content, aggErr)\\n return &result\\n}\",\n \"func recip(val float64) float64 {\\n\\treturn 1 / val\\n}\",\n \"func nulls(i int) string {\\n\\ts := \\\"\\\"\\n\\tfor j := 0; j < i; j++ {\\n\\t\\ts += zero\\n\\t}\\n\\treturn s\\n}\",\n \"func Nanosec() int64 {\\n\\treturn syscall.Nanosec()\\n}\",\n \"func _MeasurementNoOp() {\\n\\tvar x [1]struct{}\\n\\t_ = x[Frequency-(1)]\\n\\t_ = x[Current-(2)]\\n\\t_ = x[CurrentL1-(3)]\\n\\t_ = x[CurrentL2-(4)]\\n\\t_ = x[CurrentL3-(5)]\\n\\t_ = x[Voltage-(6)]\\n\\t_ = x[VoltageL1-(7)]\\n\\t_ = x[VoltageL2-(8)]\\n\\t_ = x[VoltageL3-(9)]\\n\\t_ = x[Power-(10)]\\n\\t_ = x[PowerL1-(11)]\\n\\t_ = x[PowerL2-(12)]\\n\\t_ = x[PowerL3-(13)]\\n\\t_ = x[ImportPower-(14)]\\n\\t_ = x[ImportPowerL1-(15)]\\n\\t_ = x[ImportPowerL2-(16)]\\n\\t_ = x[ImportPowerL3-(17)]\\n\\t_ = x[ExportPower-(18)]\\n\\t_ = x[ExportPowerL1-(19)]\\n\\t_ = x[ExportPowerL2-(20)]\\n\\t_ = x[ExportPowerL3-(21)]\\n\\t_ = x[ReactivePower-(22)]\\n\\t_ = x[ReactivePowerL1-(23)]\\n\\t_ = x[ReactivePowerL2-(24)]\\n\\t_ = x[ReactivePowerL3-(25)]\\n\\t_ = x[ApparentPower-(26)]\\n\\t_ = x[ApparentPowerL1-(27)]\\n\\t_ = x[ApparentPowerL2-(28)]\\n\\t_ = x[ApparentPowerL3-(29)]\\n\\t_ = x[Cosphi-(30)]\\n\\t_ = x[CosphiL1-(31)]\\n\\t_ = x[CosphiL2-(32)]\\n\\t_ = x[CosphiL3-(33)]\\n\\t_ = x[THD-(34)]\\n\\t_ = x[THDL1-(35)]\\n\\t_ = x[THDL2-(36)]\\n\\t_ = x[THDL3-(37)]\\n\\t_ = x[Sum-(38)]\\n\\t_ = x[SumT1-(39)]\\n\\t_ = x[SumT2-(40)]\\n\\t_ = x[SumL1-(41)]\\n\\t_ = x[SumL2-(42)]\\n\\t_ = x[SumL3-(43)]\\n\\t_ = x[Import-(44)]\\n\\t_ = x[ImportT1-(45)]\\n\\t_ = x[ImportT2-(46)]\\n\\t_ = x[ImportL1-(47)]\\n\\t_ = x[ImportL2-(48)]\\n\\t_ = x[ImportL3-(49)]\\n\\t_ = x[Export-(50)]\\n\\t_ = x[ExportT1-(51)]\\n\\t_ = x[ExportT2-(52)]\\n\\t_ = x[ExportL1-(53)]\\n\\t_ = x[ExportL2-(54)]\\n\\t_ = x[ExportL3-(55)]\\n\\t_ = x[ReactiveSum-(56)]\\n\\t_ = x[ReactiveSumT1-(57)]\\n\\t_ = x[ReactiveSumT2-(58)]\\n\\t_ = x[ReactiveSumL1-(59)]\\n\\t_ = x[ReactiveSumL2-(60)]\\n\\t_ = x[ReactiveSumL3-(61)]\\n\\t_ = x[ReactiveImport-(62)]\\n\\t_ = x[ReactiveImportT1-(63)]\\n\\t_ = x[ReactiveImportT2-(64)]\\n\\t_ = x[ReactiveImportL1-(65)]\\n\\t_ = x[ReactiveImportL2-(66)]\\n\\t_ = x[ReactiveImportL3-(67)]\\n\\t_ = x[ReactiveExport-(68)]\\n\\t_ = x[ReactiveExportT1-(69)]\\n\\t_ = x[ReactiveExportT2-(70)]\\n\\t_ = x[ReactiveExportL1-(71)]\\n\\t_ = x[ReactiveExportL2-(72)]\\n\\t_ = x[ReactiveExportL3-(73)]\\n\\t_ = x[DCCurrent-(74)]\\n\\t_ = x[DCVoltage-(75)]\\n\\t_ = x[DCPower-(76)]\\n\\t_ = x[HeatSinkTemp-(77)]\\n\\t_ = x[DCCurrentS1-(78)]\\n\\t_ = x[DCVoltageS1-(79)]\\n\\t_ = x[DCPowerS1-(80)]\\n\\t_ = x[DCEnergyS1-(81)]\\n\\t_ = x[DCCurrentS2-(82)]\\n\\t_ = x[DCVoltageS2-(83)]\\n\\t_ = x[DCPowerS2-(84)]\\n\\t_ = x[DCEnergyS2-(85)]\\n\\t_ = x[DCCurrentS3-(86)]\\n\\t_ = x[DCVoltageS3-(87)]\\n\\t_ = x[DCPowerS3-(88)]\\n\\t_ = x[DCEnergyS3-(89)]\\n\\t_ = x[DCCurrentS4-(90)]\\n\\t_ = x[DCVoltageS4-(91)]\\n\\t_ = x[DCPowerS4-(92)]\\n\\t_ = x[DCEnergyS4-(93)]\\n\\t_ = x[ChargeState-(94)]\\n\\t_ = x[BatteryVoltage-(95)]\\n\\t_ = x[PhaseAngle-(96)]\\n}\",\n \"func Infoln(val ...interface{}) error {\\n\\tlog := logger.Get()\\n\\tlog.Infoln(val...)\\n\\treturn nil\\n}\",\n \"func (z *Big) setNaN(c Condition, f form, p Payload) *Big {\\n\\tz.form = f\\n\\tz.compact = uint64(p)\\n\\tz.Context.Conditions |= c\\n\\tif z.Context.OperatingMode == Go {\\n\\t\\tpanic(ErrNaN{Msg: z.Context.Conditions.String()})\\n\\t}\\n\\treturn z\\n}\",\n \"func (x *Big) IsNaN(quiet int) bool {\\n\\treturn quiet >= 0 && x.form&qnan == qnan || quiet <= 0 && x.form&snan == snan\\n}\",\n \"func RegulateTemp (value float64) float64{\\n\\n\\tif value> 22 {\\n\\t\\treturn (22 * 100)/ value\\n\\t}else if value < 22{\\n return 100.0\\n\\t}\\n\\n\\treturn 0.0\\n}\",\n \"func NilFloat() Float {\\n\\treturn Float{0, false}\\n}\",\n \"func (o DurationResponsePtrOutput) Nanos() pulumi.IntPtrOutput {\\n\\treturn o.ApplyT(func(v *DurationResponse) *int {\\n\\t\\tif v == nil {\\n\\t\\t\\treturn nil\\n\\t\\t}\\n\\t\\treturn &v.Nanos\\n\\t}).(pulumi.IntPtrOutput)\\n}\",\n \"func TestEvaluatorMissingValue(t *testing.T) {\\n\\tvar values = make(map[string]int)\\n\\texpression := \\\"value\\\"\\n\\n\\t_, err := evaluator.Evaluate(expression, values)\\n\\n\\tassert.Error(t, err, \\\"error is expected\\\")\\n}\",\n \"func (s *Series) CountOfNA() int {\\n\\tcount := 0\\n\\tfor _, val := range s.Data {\\n\\t\\tif val == nil {\\n\\t\\t\\tcount++\\n\\t\\t}\\n\\t}\\n\\treturn count\\n}\",\n \"func naiveDFTreal(x []float64) (y []complex128) {\\n\\ty = make([]complex128, len(x))\\n\\tdt := -2 * math.Pi / float64(len(x))\\n\\tfor i := range x {\\n\\t\\targ1 := float64(i) * dt\\n\\t\\tfor k, xv := range x {\\n\\t\\t\\targ2 := float64(k) * arg1\\n\\t\\t\\ty[i] += complex(xv*math.Cos(arg2), xv*math.Sin(arg2))\\n\\t\\t}\\n\\t}\\n\\treturn y[:len(x)/2+1]\\n}\",\n \"func (dt *DateTime) Nanosecond() *Number {\\n\\topChain := dt.chain.enter(\\\"Nanosecond()\\\")\\n\\tdefer opChain.leave()\\n\\n\\tif opChain.failed() {\\n\\t\\treturn newNumber(opChain, float64(0))\\n\\t}\\n\\n\\treturn newNumber(opChain, float64(dt.value.Nanosecond()))\\n}\",\n \"func (x *Float) IsInf() bool {}\",\n \"func pi(n int) float64 {\\n\\tvar x float64\\n\\tvar a = 1\\n\\tvar b = 1\\n\\tfor i := 0; i < n; i++ {\\n\\t\\tx += float64(a) / float64(b)\\n\\t\\ta *= -1\\n\\t\\tb += 2\\n\\t}\\n\\treturn x * 4.0\\n}\",\n \"func main() {\\n\\tfmt.Println(missingNumber([]int{0}))\\n\\tfmt.Println(missingNumber([]int{0, 1}))\\n}\",\n \"func (p *Parser) NullFloat64(i int, context string) Float64 {\\n\\ts := p.String(i, context)\\n\\tif p.err != nil {\\n\\t\\treturn Float64{}\\n\\t}\\n\\tif s == \\\"\\\" {\\n\\t\\treturn Float64{}\\n\\t}\\n\\tv, err := strconv.ParseFloat(s, 64)\\n\\tif err != nil {\\n\\t\\tp.SetErr(context, s)\\n\\t\\treturn Float64{}\\n\\t}\\n\\treturn Float64{Value: v, Valid: true}\\n}\",\n \"func TestFloatNull(t *testing.T) {\\n\\tclient := newQueriesClient(t)\\n\\tresult, err := client.FloatNull(context.Background(), nil)\\n\\trequire.NoError(t, err)\\n\\trequire.Zero(t, result)\\n}\",\n \"func (a *Array64) NaNCount(axis ...int) *Array64 {\\n\\tif a.valAxis(&axis, \\\"NaNCount\\\") {\\n\\t\\treturn a\\n\\t}\\n\\n\\tnc := func(d []float64) (r float64) {\\n\\t\\tfor _, v := range d {\\n\\t\\t\\tif !math.IsNaN(v) {\\n\\t\\t\\t\\tr++\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn r\\n\\t}\\n\\n\\treturn a.Fold(nc, axis...)\\n}\",\n \"func encodeFloats(data map[string]any) {\\n\\tfor k, v := range data {\\n\\t\\tswitch v := v.(type) {\\n\\t\\tcase float64:\\n\\t\\t\\tif math.IsNaN(v) || math.IsInf(v, 0) {\\n\\t\\t\\t\\tdata[k] = nil\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (dt DateTime) Nanosecond() int {\\n\\treturn dt.Time().Nanosecond()\\n}\",\n \"func Momentum(n int) func(s []float64) []float64 {\\n\\treturn func(s []float64) (res []float64) {\\n\\t\\tf := Skip(n)(s)\\n\\t\\tres = make([]float64, len(f))\\n\\t\\tfor i := range res {\\n\\t\\t\\tres[i] = f[i]/s[i] - 1\\n\\t\\t}\\n\\n\\t\\treturn\\n\\t}\\n}\",\n \"func (a *Array64) Nonzero(axis ...int) *Array64 {\\n\\tif a.valAxis(&axis, \\\"Nonzero\\\") {\\n\\t\\treturn a\\n\\t}\\n\\n\\treturn a.Map(func(d float64) float64 {\\n\\t\\tif d == 0 {\\n\\t\\t\\treturn 0\\n\\t\\t}\\n\\t\\treturn 1\\n\\t}).Sum(axis...)\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.602442","0.58442634","0.5628861","0.56243914","0.55352783","0.55352783","0.55352783","0.55352783","0.5477595","0.5387952","0.5378903","0.5312592","0.52907044","0.52907044","0.52536094","0.5228146","0.5210892","0.5192936","0.5192836","0.5192836","0.5129684","0.5119692","0.50891507","0.50829613","0.50723016","0.5070217","0.5065093","0.50431216","0.5039759","0.50165457","0.50154424","0.5009955","0.4981591","0.4958172","0.4944439","0.49395725","0.49136388","0.49020612","0.489799","0.48833823","0.48821366","0.48750034","0.48750034","0.48675478","0.48619005","0.48580202","0.48555353","0.484155","0.48324353","0.48305535","0.48203075","0.47866753","0.47830993","0.47702512","0.4758619","0.47579315","0.47570753","0.47569522","0.47567484","0.474523","0.47390795","0.4733964","0.473174","0.47308522","0.47224903","0.47120064","0.46845117","0.46314865","0.46300358","0.46221492","0.46213147","0.46144757","0.46078715","0.45990503","0.45989445","0.45967135","0.45880625","0.4583485","0.4567007","0.4564724","0.45595378","0.45517495","0.45510498","0.455059","0.4548045","0.4547688","0.4547583","0.4547473","0.45471954","0.4542184","0.45359108","0.45050377","0.4500752","0.44999436","0.44916752","0.44807282","0.4476989","0.44734642","0.44727492","0.4465442","0.4459521"],"string":"[\n \"0.602442\",\n \"0.58442634\",\n \"0.5628861\",\n \"0.56243914\",\n \"0.55352783\",\n \"0.55352783\",\n \"0.55352783\",\n \"0.55352783\",\n \"0.5477595\",\n \"0.5387952\",\n \"0.5378903\",\n \"0.5312592\",\n \"0.52907044\",\n \"0.52907044\",\n \"0.52536094\",\n \"0.5228146\",\n \"0.5210892\",\n \"0.5192936\",\n \"0.5192836\",\n \"0.5192836\",\n \"0.5129684\",\n \"0.5119692\",\n \"0.50891507\",\n \"0.50829613\",\n \"0.50723016\",\n \"0.5070217\",\n \"0.5065093\",\n \"0.50431216\",\n \"0.5039759\",\n \"0.50165457\",\n \"0.50154424\",\n \"0.5009955\",\n \"0.4981591\",\n \"0.4958172\",\n \"0.4944439\",\n \"0.49395725\",\n \"0.49136388\",\n \"0.49020612\",\n \"0.489799\",\n \"0.48833823\",\n \"0.48821366\",\n \"0.48750034\",\n \"0.48750034\",\n \"0.48675478\",\n \"0.48619005\",\n \"0.48580202\",\n \"0.48555353\",\n \"0.484155\",\n \"0.48324353\",\n \"0.48305535\",\n \"0.48203075\",\n \"0.47866753\",\n \"0.47830993\",\n \"0.47702512\",\n \"0.4758619\",\n \"0.47579315\",\n \"0.47570753\",\n \"0.47569522\",\n \"0.47567484\",\n \"0.474523\",\n \"0.47390795\",\n \"0.4733964\",\n \"0.473174\",\n \"0.47308522\",\n \"0.47224903\",\n \"0.47120064\",\n \"0.46845117\",\n \"0.46314865\",\n \"0.46300358\",\n \"0.46221492\",\n \"0.46213147\",\n \"0.46144757\",\n \"0.46078715\",\n \"0.45990503\",\n \"0.45989445\",\n \"0.45967135\",\n \"0.45880625\",\n \"0.4583485\",\n \"0.4567007\",\n \"0.4564724\",\n \"0.45595378\",\n \"0.45517495\",\n \"0.45510498\",\n \"0.455059\",\n \"0.4548045\",\n \"0.4547688\",\n \"0.4547583\",\n \"0.4547473\",\n \"0.45471954\",\n \"0.4542184\",\n \"0.45359108\",\n \"0.45050377\",\n \"0.4500752\",\n \"0.44999436\",\n \"0.44916752\",\n \"0.44807282\",\n \"0.4476989\",\n \"0.44734642\",\n \"0.44727492\",\n \"0.4465442\",\n \"0.4459521\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":985,"cells":{"query":{"kind":"string","value":"/ RottenFruit : 3 RottenFruit2 : 3"},"document":{"kind":"string","value":"func StepsOfKnightUtil(size int, currCol int, currRow int, traversed [][]int, dist int) {\n\t// Range check\n\tif currCol < 0 || currCol >= size || currRow < 0 || currRow >= size {\n\t\treturn\n\t}\n\n\t// Traverse if not already traversed.\n\tif traversed[currCol][currRow] <= dist {\n\t\treturn\n\t}\n\n\tdir := [][]int{{-2, -1}, {-2, 1}, {2, -1}, {2, 1}, {-1, -2}, {1, -2}, {-1, 2}, {1, 2}}\n\ttraversed[currCol][currRow] = dist\n\n\tfor i := 0; i < 8; i++ {\n\t\tx := currCol + dir[i][0]\n\t\ty := currRow + dir[i][1]\n\t\tStepsOfKnightUtil(size, x, y, traversed, dist+1)\n\t}\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func printTally(wrapped, dropped int64) {\n\tfmt.Println(\"\\n--------------------------------------\")\n\tfmt.Printf(\"%-10s : %02d\\n\", \"Total\", chocolateCount)\n\tfmt.Printf(\"%-10s : %02d\\n\", \"Wrapped\", wrapped)\n\tfmt.Printf(\"%-10s : %02d\\n\", \"Dropped\", dropped)\n\tfmt.Println(\"--------------------------------------\")\n}","func totalFruit(fruits []int) int {\n\tpairs := make([]pair, 0)\n\tif len(fruits) > 0 {\n\t\tcrtPair := newPair(0)\n\t\tcrtPair.fruits[fruits[0]] = 1\n\t\tfor i := 1; i < len(fruits); i++ {\n\t\t\tfruit := fruits[i]\n\t\t\tct, present := crtPair.fruits[fruit]\n\t\t\tif present {\n\t\t\t\tcrtPair.fruits[fruit] = ct + 1\n\t\t\t} else {\n\t\t\t\tif len(crtPair.fruits) == 1 {\n\t\t\t\t\tcrtPair.fruits[fruit] = 1\n\t\t\t\t} else {\n\t\t\t\t\t// we have encountered a new fruit, start the new pair\n\t\t\t\t\tj := i - 1\n\t\t\t\t\tpreviousFruit := fruits[j]\n\t\t\t\t\tpreviousFruitCount := 0\n\t\t\t\t\tfor j > -1 && fruits[j] == previousFruit {\n\t\t\t\t\t\tpreviousFruitCount++\n\t\t\t\t\t\tj--\n\t\t\t\t\t}\n\t\t\t\t\t// add the current pair\n\t\t\t\t\tpairs = append(pairs, *crtPair)\n\t\t\t\t\t// create a new pair\n\t\t\t\t\tcrtPair = newPair(i)\n\t\t\t\t\tcrtPair.fruits[previousFruit] = previousFruitCount\n\t\t\t\t\tcrtPair.fruits[fruit] = 1\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tpairs = append(pairs, *crtPair)\n\t}\n\treturn findMaxCount(pairs)\n}","func fungsilen() {\n\n\tvar fruits = []string{\"apple\", \"grape\", \"banana\", \"melon\"}\n\tfmt.Println(\"index is: \", len(fruits))\n}","func (self *Tween) Repeat2O(total int, repeat int, index int) *Tween{\n return &Tween{self.Object.Call(\"repeat\", total, repeat, index)}\n}","func repeatWord(word string, repetitions int) string {\n\tvar response string\n\tvar i int\n\n\tif repetitions < 0 {\n\t\tlog.Fatal(\"Can not repeat a word a negative number of times\\n\")\n\t} else if repetitions == 0 {\n\t\treturn \"\"\n\t}\n\n\t// we are now dealing with the case that we must\n\t// repeat the word one, or more, times\n\tresponse = word\n\tfor i = 1; i < repetitions; i++ {\n\t\tresponse = fmt.Sprintf(\"%s %s\", response, word)\n\t}\n\n\treturn response\n}","func Grapple(i *InputHandler, b *models.Box) {\n\ti.NewRope = true\n\ti.DestroyRope = false\n\tb.State = models.GRAPPLING\n}","func (self *Tween) RepeatCounter() int{\n return self.Object.Get(\"repeatCounter\").Int()\n}","func main() {\n\tfmt.Println(first, second)\n\n\t//fmt.Println(first, second, third) // in case example number 5 only\n\n\t//fmt.Println(first, second, third, fourth) // in case example number 6 (the last one) only\n}","func PrintDiff(add, remove []domain.UserAudience) {\n\tfmt.Println(\"************* Count add *************\")\n\tfmt.Println(len(add))\n\tfmt.Println(\"************* Array add *************\")\n\tfmt.Println(add)\n\tfmt.Println(\"************ Count remove ***********\")\n\tfmt.Println(len(remove))\n\tfmt.Println(\"************ Array remove ***********\")\n\tfmt.Println(remove)\n}","func RepeatMe(words ...string) {\n\tfmt.Println(words)\n}","func totalFruit(tree []int) int {\n\tif len(tree) <= 2 {\n\t\treturn len(tree)\n\t}\n\tm := make(map[int]int)\n\tres := 0\n\t// 以下的code是典型的滑动窗口的写法\n\tstart := 0\n\tfor end := 0; end < len(tree); end++ {\n\t\tif _, ok := m[tree[end]]; ok {\n\t\t\tm[tree[end]] += 1\n\t\t} else {\n\t\t\tm[tree[end]] = 1\n\t\t}\n\t\tfor len(m) > 2 && start < end {\n\t\t\tm[tree[start]] -= 1\n\t\t\tif m[tree[start]] == 0 {\n\t\t\t\tdelete(m, tree[start])\n\t\t\t}\n\t\t\tstart++\n\t\t}\n\t\tif (end - start + 1) > res {\n\t\t\tres = end - start + 1\n\t\t}\n\t}\n\treturn res\n}","func (self *Tween) Repeat1O(total int, repeat int) *Tween{\n return &Tween{self.Object.Call(\"repeat\", total, repeat)}\n}","func infoPhotosQuantity() {\n\tfmt.Println(\"!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\")\n\tfmt.Printf(\"! SE ENCONTRARON %v FOTOS\\n\", len(store))\n\tfmt.Println(\"!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\")\n}","func ExampleRepeat() {\n\tsum := Repeat(\"a\", 5)\n\tfmt.Println(sum)\n\t// Output: aaaaa\n}","func Verse(v int) string {\n\t// if it's the final verse, return it alone\n\tif v == len(lyrics) {\n\t\treturn lyrics[v-1].item\n\t}\n\n\t// otherwise return the item plus the list plus the list of all previous stanzas\n\tr := lyrics[v-1].item\n\tfor i := v - 1; i >= 0; i-- {\n\t\tr += \"\\n\" + lyrics[i].list\n\t}\n\treturn r\n}","func Teapot(w http.ResponseWriter, message ...interface{}) {\n\tboom(w, 418, message...)\n}","func getIceCream(w http.ResponseWriter, r *http.Request) {\r\n\tw.Header().Set(\"Content-Type\", \"application/json\")\r\n\tparams := mux.Vars(r) // Gets params\r\n\tflavourid_int,_ := strconv.Atoi(params[\"flavourid\"])\r\n\t// Loop through flavours and find one with the flavourId from the params\r\n\tfor _, item := range flavours {\r\n\t\tif item.FlavourId == flavourid_int {\r\n\t\t\tjson.NewEncoder(w).Encode(item)\r\n\t\t\treturn\r\n\t\t}\r\n\t}\r\n\tjson.NewEncoder(w).Encode(&IceCream{})\r\n}","func formatUserChoice(playlists []map[string]interface{}) (string, error) {\n\ti := 1\n\tres := \"\"\n\tfor _, v := range playlists {\n\t\tres += strconv.Itoa(i) + \")\" + v[\"name\"].(string) + \"\\n\"\n\t\ti++\n\t}\n\tif res == \"\" {\n\t\treturn res, errors.New(\"Can't format user choice\")\n\t}\n\treturn res, nil\n}","func RottenFruitUtil(arr [][]int, maxCol int, maxRow int, currCol int, currRow int, traversed [][]int, day int) {\n\tif currCol < 0 || currCol >= maxCol || currRow < 0 || currRow >= maxRow {\n\t\treturn\n\t}\n\t// Traversable and rot if not already rotten.\n\tif traversed[currCol][currRow] <= day || arr[currCol][currRow] == 0 {\n\t\treturn\n\t}\n\n\tdir := [][]int{{-1, 0}, {1, 0}, {0, -1}, {0, 1}}\n\ttraversed[currCol][currRow] = day // Update rot time.\n\tfor i := 0; i < 4; i++ {\n\t\tx := currCol + dir[i][0]\n\t\ty := currRow + dir[i][1]\n\t\tRottenFruitUtil(arr, maxCol, maxRow, x, y, traversed, day+1)\n\t}\n}","func Zap(f Food) {\n\tfmt.Printf(\"I hate %ss!\", f.Name)\n\n}","func Teapot(message ...interface{}) Err {\n\treturn Boomify(http.StatusTeapot, message...)\n}","func TestApploffer1(t *testing.T) {\n\tclearBasket()\n\n\tbasket.Basket.AddItem(\"AP1\")\n\tbasket.Basket.AddItem(\"AP1\")\n\n\tvar totalItem, appleCount int64\n\n\tCos.PrintBills()\n\n\tfor _, be := range Cos.bill {\n\t\ttotalItem++\n\n\t\tif be.prodCode == \"AP1\" {\n\t\t\tappleCount++\n\t\t}\n\t}\n\n\tif totalItem != appleCount {\n\t\tt.Errorf(\"ordered 2 apple. But found: %d\", appleCount)\n\t}\n}","func printTopK(tags []string, data map[string]float64,topKWord int){\n // i :=1\n // for _,t := range tags{\n // fmt.Printf(\" %s :%v \\n\", t,data[t])\n // // i++\n // }\n\n fmt.Println(strings.Join(tags, \"/ \"))\n }","func (s *Scanner) identRest() {\n\tswitch {\n\tcase s.acceptIf(text.IdentRest):\n\t\ts.identRest()\n\tcase s.accept('_'):\n\t\ts.identOrOperatorRest()\n\tcase s.acceptIf(text.IsIdentifierPart):\n\t\ts.identRest()\n\t}\n}","func redact(match HTTPMatch, value interface{}, locationPrefix string) interface{} {\n\tif match.HasBodyWhitelistMatch(locationPrefix) {\n\t\treturn value\n\t}\n\n\tswitch typedValue := value.(type) {\n\tcase map[string]interface{}:\n\t\tm := make(map[string]interface{})\n\t\tfor k, v := range typedValue {\n\t\t\tm[k] = redact(match, v, locationPrefix+\".\"+k)\n\t\t}\n\t\treturn m\n\tcase []interface{}:\n\t\tm := make([]interface{}, len(typedValue))\n\t\tfor k, v := range typedValue {\n\t\t\tm[k] = redact(match, v, locationPrefix+\"[\"+strconv.Itoa(k)+\"]\")\n\t\t}\n\t\treturn m\n\tcase float64:\n\t\treturn RedactedNumber\n\tcase string:\n\t\treturn RedactedStr\n\tcase bool:\n\t\treturn RedactedBool\n\tcase nil:\n\t\treturn nil\n\tdefault:\n\t\treturn nil\n\t}\n}","func deleteIceCream(w http.ResponseWriter, r *http.Request) {\r\n\tw.Header().Set(\"Content-Type\", \"application/json\")\r\n\tparams := mux.Vars(r)\r\n\tflavourid_int,_ := strconv.Atoi(params[\"flavourid\"])\r\n\tfor index, item := range flavours {\r\n\t\tif item.FlavourId == flavourid_int {\r\n\t\t\tflavours = append(flavours[:index], flavours[index+1:]...)\r\n\t\t\tbreak\r\n\t\t}\r\n\t}\r\n\tjson.NewEncoder(w).Encode(flavours)\r\n}","func TugOfWars(arr []int) (ans1, ans2 []int) {\n\tfirst := []int{}\n\tsecond := []int{}\n\ttugHelper(arr, first, second, 0, 0, 0)\n\treturn ans1, ans2\n}","func AutoG(w http.ResponseWriter, req *http.Request) {\n\tvar frase Frase\n\t_ = json.NewDecoder(req.Body).Decode(&frase)\n\tfraseNooized := \"\"\n\trand.Seed(time.Now().UnixNano())\n\tnum := rand.Intn(3)\n\tswitch num {\n\tcase 0:\n\t\tfraseNooized = NDecorator(frase.Testo)\n\tcase 1:\n\t\tfraseNooized = GDecorator(frase.Testo)\n\tdefault:\n\t\tfraseNooized = EDecorator(frase.Testo)\n\t}\n\tjson.NewEncoder(w).Encode(fraseNooized)\n}","func slicecap() {\n\n\tvar fruits = []string{\"apple\", \"grape\", \"banana\", \"melon\"}\n\tfmt.Println(\"index len is: \", len(fruits))\n\tfmt.Println(\"index cap is: \", cap(fruits))\n\n\tvar aFruits = fruits[0:3]\n\tfmt.Println(\"index len is: \", len(aFruits))\n\tfmt.Println(\"index cap is: \", cap(aFruits))\n\n\tvar bFruits = fruits[1:4]\n\tfmt.Println(\"index len is: \", len(bFruits))\n\tfmt.Println(\"index cap is: \", cap(bFruits))\n}","func createIceCream(w http.ResponseWriter, r *http.Request) {\r\n\tw.Header().Set(\"Content-Type\", \"application/json\")\r\n\tvar IceCream IceCream\r\n\t_ = json.NewDecoder(r.Body).Decode(&IceCream)\r\n\tIceCream.FlavourId = genNextId()\r\n\tflavours = append(flavours, IceCream)\r\n\tjson.NewEncoder(w).Encode(IceCream)\r\n}","func RobotLingo() string {\n\n println(\"Affirmatives\")\n println(\"Affirmative\")\n println(\"affirmative\")\n println(\"affirmative\")\n\n println(\"lickMyBatteries\")\n println(\"LickMyBattery\")\n println(\"lickMyBattery\")\n println(\"lick_my_battery\")\n\n println(\"exterminate_the_humans\")\n println(\"Exterminatethehuman\")\n println(\"exterminatethehuman\")\n println(\"exterminate_the_human\")\n\n}","func betterRestaurant() {\r\n\tvar wg sync.WaitGroup\r\n\r\n\twg.Add(1)\r\n\tgo func() {\r\n\t\tbetterChef(\"炒饭\")\r\n\t\twg.Done()\r\n\t}()\r\n\r\n\twg.Add(1)\r\n\tgo func() {\r\n\t\tbetterChef(\"炒时蔬\")\r\n\t\twg.Done()\r\n\t}()\r\n\r\n\twg.Add(1)\r\n\tgo func() {\r\n\t\tbetterChef(\"水煮肉片\")\r\n\t\twg.Done()\r\n\t}()\r\n\r\n\twg.Wait()\r\n}","func (self *Tween) Repeat(total int) *Tween{\n return &Tween{self.Object.Call(\"repeat\", total)}\n}","func Red(x ...interface{}) {\n\tred.Println(x...)\n}","func amigos(res http.ResponseWriter, req *http.Request) {\n\trows, err := db.Query(`SELECT amigoName FROM amigos;`)\n\tcheck(err)\n\tdefer rows.Close()\n\n\t// data to be used in query\n\tvar s, name string\n\ts = \"RETRIEVED RECORDS:\\n\"\n\n\t// query\n\tfor rows.Next() {\n\t\terr = rows.Scan(&name)\n\t\tcheck(err)\n\t\ts += name + \"\\n\"\n\t}\n\tfmt.Fprintln(res, s)\n}","func TestAddManyViewMany(t *testing.T) {\n\ttarget := teaser.New()\n\tm1id := target.Add(\"msg1\")\n\tm2id := target.Add(\"msg2\")\n\tm3id := target.Add(\"msg3\")\n\n\tm2Hash, m1vid := target.View()\n\tassertMessageId(m1id, m1vid, t)\n\tassertMessageHash(\"msg2\", m2Hash, t)\n\n\tm3Hash, m2vid := target.View()\n\tassertMessageId(m2id, m2vid, t)\n\tassertMessageHash(\"msg3\", m3Hash, t)\n\n\tnextHash, m3vid := target.View()\n\tassertMessageId(m3id, m3vid, t)\n\tassertMessageHash(\"\", nextHash, t)\n\n}","func Repeat(word string, repeat int) string {\n\tvar result string\n\n\tif repeat == 0 {\n\t\trepeat = repeatCount\n\t}\n\n\tfor i := 0; i < repeat; i++ {\n\t\tresult += word\n\t}\n\treturn result\n}","func addQuantity(ingredient Ingredient, quantity int) Ingredient {\n\tingredient.Quantity = ingredient.Quantity + quantity\n\treturn ingredient\n}","func (a AnalysisServer) TopRestaurants(ctx stdctx.Context, quantity *pb.Quantity) (*pb.RestaurantList, error) {\n restaurantList, err := db.GetTopRestaurants(\"Restaurants\", quantity.Size)\n if err != nil {\n return &pb.RestaurantList{}, err\n }\n return restaurantListToPb(restaurantList), nil\n}","func indexHandler1( w http.ResponseWriter, r *http.Request){\n\n\treg, err := regexp.Compile(\"[^a-zA-Z0-9]+\")\n\tfmt.Fprintf(w, \"word\"+\" \"+\"count\")\n\tfmt.Fprintf(w,\"\\n----------\\n\")\n\tfor key, val := range wordcountMap {\n\n\t\tfmt.Println(strings.TrimRight(key, \" \"), val)\n\t\tfmt.Fprintf(w, reg.ReplaceAllString(key, \"\")+\" \"+strconv.Itoa(val))\n\t\tfmt.Fprintf(w,\"\\n\")\n\n\t}\n\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n}","func key(keys ...string) string {\n\treturn fmt.Sprintf(\"%s:%s\", \"mailimage\", strings.Join(keys, \":\"))\n}","func spacer(level int) string {\n\treturn strings.Repeat(\" \", level)\n}","func printIDs(sectionName string, matches map[string]string) {\n\tfmt.Printf(\"%v:\\n\", sectionName)\n\tfor id, title := range matches {\n\t\tfmt.Printf(\"[%v] %v\\n\", id, title)\n\t}\n\tfmt.Printf(\"\\n\\n\")\n}","func RETFW(i operand.Op) { ctx.RETFW(i) }","func CountPrintln(f ...interface{}) {\n\tcount++\n\tfmt.Printf(\"%d - \", count)\n\tfmt.Println(f...)\n}","func TestAddTwoDeleteFirst(t *testing.T) {\n\ttarget := teaser.New()\n\tm1id := target.Add(\"msg1\")\n\tm2id := target.Add(\"msg2\")\n\n\t{\n\t\tdeleted := target.Delete(m1id)\n\t\tassertDeleted(m1id, deleted, t)\n\t}\n\n\t{\n\t\tnextHash, m2vid := target.View()\n\t\tassertMessageId(m2id, m2vid, t)\n\t\tassertMessageHash(\"\", nextHash, t)\n\t}\n}","func TestAddOnceViewMany(t *testing.T) {\n\ttarget := teaser.New()\n\tm1id := target.Add(\"msg1\")\n\n\t{\n\t\tnextHash, m1vid := target.View()\n\t\tassertMessageId(m1id, m1vid, t)\n\t\tassertMessageHash(\"\", nextHash, t)\n\t}\n\n\t{\n\t\tnextHash, nextvid := target.View()\n\t\tassertMessageId(\"\", nextvid, t)\n\t\tassertMessageHash(\"\", nextHash, t)\n\t}\n}","func (a Snake) Eat() {\n\tfmt.Printf(\"%s \\n\", a.food)\n}","func countApplesAndOranges(s int32, t int32, a int32, b int32, apples []int32, oranges []int32) {\n\tvar hitApples, hitOranges int32\n\tfor _, apple := range apples {\n\t\tplace := a + apple\n\t\tif s <= place && place <= t {\n\t\t\thitApples++\n\t\t}\n\t}\n\tfor _, orange := range oranges {\n\t\tplace := b + orange\n\t\tif s <= place && place <= t {\n\t\t\thitOranges++\n\t\t}\n\t}\n\tfmt.Println(hitApples)\n\tfmt.Println(hitOranges)\n}","func wearArmor(dexterity int) (string, int) {\n\tlottery := random(1, 5)\n\tvar armorname string\n\tvar armorBonus, dexBonus int\n\tdexBonus = attrModifier(dexterity)\n\tswitch lottery {\n\tcase 1:\n\t\tarmorname = \"Leather Armor\"\n\t\tarmorBonus = 2\n\t\tif dexBonus > 8 { // Every armor has a limit of how many dexterity bonus points can be added.\n\t\t\tdexBonus = 8\n\t\t}\n\tcase 2:\n\t\tarmorname = \"Chain Shirt\"\n\t\tarmorBonus = 4\n\t\tif dexBonus > 4 {\n\t\t\tdexBonus = 4\n\t\t}\n\tcase 3:\n\t\tarmorname = \"Scale Mail\"\n\t\tarmorBonus = 4\n\t\tif dexBonus > 4 {\n\t\t\tdexBonus = 4\n\t\t}\n\tcase 4:\n\t\tarmorname = \"Breastplate\"\n\t\tarmorBonus = 5\n\t\tif dexBonus > 3 {\n\t\t\tdexBonus = 3\n\t\t}\n\tcase 5:\n\t\tarmorname = \"Full Plate Armor\"\n\t\tarmorBonus = 8\n\t\tif dexBonus > 1 {\n\t\t\tdexBonus = 1\n\t\t}\n\t}\n\treturn armorname, 10 + armorBonus + dexBonus\n}","func (t *Translator) chooseUnit(unit string, count int64) (string, error) {\n\ts := strings.Split(t.resources[unit], \"|\")\n\tif count > 1 {\n\t\treturn strings.Replace(s[1], \":count\", strconv.FormatInt(int64(count), 10), 1), nil\n\t}\n\n\treturn s[0], nil\n}","func ConcatVitals(x, y, rot float64, health uint64) string {\n\treturn fmt.Sprintf(\"%f|%f|%f|%d\", x, y, rot, health)\n}","func (m *RoomdetailMutation) AddRoomprice(i int) {\n\tif m.addroomprice != nil {\n\t\t*m.addroomprice += i\n\t} else {\n\t\tm.addroomprice = &i\n\t}\n}","func DeleteFruit(c *gin.Context, params *FruitIdentityParams) error {\n\tif params.APIKey == \"\" {\n\t\treturn errors.Forbiddenf(\"invalid api key\")\n\t}\n\tmarket.Lock()\n\tdefer market.Unlock()\n\n\tn := strings.ToLower(params.Name)\n\tif _, ok := market.fruits[n]; !ok {\n\t\treturn errors.NotFoundf(\"fruit\")\n\t}\n\tdelete(market.fruits, n)\n\n\treturn nil\n}","func (self *Tween) RepeatAll1O(total int) *Tween{\n return &Tween{self.Object.Call(\"repeatAll\", total)}\n}","func (r *Responder) Teapot() { r.write(http.StatusTeapot) }","func (g *Game) Shot(shot int) {\n\n\tif g.isOver() {\n\t\tfmt.Println(\"Illegal extra shot\")\n\t\treturn\n\t}\n\tfmt.Printf(\"Shot: %d, Pinup: %d. Game frames: %v \\n\", shot, g.numPinUp, g.frames)\n\tg.accountBonus(shot)\n\tg.recordShot(shot)\n\tg.prepareNextShot()\n}","func Repeat(count int, operand string) string { return strings.Repeat(operand, count) }","func print_prefix_name(p int32)(str string){\nl:=name_dir[p].name[0]\nstr= fmt.Sprint(string(name_dir[p].name[1:]))\nif int(l)<len(name_dir[p].name){\nstr+= \"...\"\n}\nreturn\n}","func Redact(s string) string {\n redaction := \"[REDACTED]\"\n str := strings.Fields(s)\n for idx, _ := range str {\n str[idx] = redaction\n }\n\n return strings.Join(str, \" \")\n}","func (animal *Animal) Eat() {\n\tfmt.Println(string(colorRed), animal.food)\n}","func redact(line []byte, ranges []matchRange) []byte {\n\tvar offset int // the offset of ranges generated by replacing x bytes by the RedactStr\n\tfor _, r := range ranges {\n\t\tlength := r.last - r.first\n\t\tfirst := r.first + offset\n\t\tlast := first + length\n\n\t\ttoRedact := line[first:last]\n\t\tredactStr := RedactStr\n\t\tif bytes.HasSuffix(toRedact, []byte(\"\\n\")) {\n\t\t\t// if string to redact ends with newline redact message should also\n\t\t\tredactStr += \"\\n\"\n\t\t}\n\n\t\tnewLine := append([]byte{}, line[:first]...)\n\t\tnewLine = append(newLine, redactStr...)\n\t\tnewLine = append(newLine, line[last:]...)\n\n\t\toffset += len(redactStr) - length\n\n\t\tline = newLine\n\t}\n\treturn line\n}","func TestRecruitEditor_UpdateRecruit(t *testing.T) {\n\tassert := assert.New(t)\n\tcrud := moc.NewLoadedCRUD()\n\thandler := createGqlHandler(crud)\n\n\t// login as recruit user\n\ttoken, _ := login(crud, getRecruitUserAccount().ID, \"none\")\n\n\t// prep data\n\tphone := \"082 345 6789\"\n\temail := \"newa@gmail.com\"\n\tprovince := \"LIMPOPO\"\n\tgender := \"FEMALE\"\n\tcity := \"Polokwane\"\n\tdisability := \"Blind\"\n\tvid1URL := \"http://google.com\"\n\tvid2URL := \"http://youtube.com\"\n\tbirthYear := 1987\n\n\t// prepare query\n\tquery := fmt.Sprintf(`\n\t\tmutation {\n\t\t\tedit(token: \"%s\"){\n\t\t\t\t... on RecruitEditor{\n\t\t\t\t\tupdateRecruit(info: {\n\t\t\t\t\t\tphone: \"%s\",\n\t\t\t\t\t\temail: \"%s\",\n\t\t\t\t\t\tprovince: %s,\n\t\t\t\t\t\tcity: \"%s\",\n\t\t\t\t\t\tgender: %s,\n\t\t\t\t\t\tdisability: \"%s\",\n\t\t\t\t\t\tvid1_url: \"%s\",\n\t\t\t\t\t\tvid2_url: \"%s\",\n\t\t\t\t\t\tbirth_year: %v,\n\t\t\t\t\t}){\n\t\t\t\t\t\tphone\n\t\t\t\t\t\temail\n\t\t\t\t\t\tprovince\n\t\t\t\t\t\tcity\n\t\t\t\t\t\tgender\n\t\t\t\t\t\tdisability\n\t\t\t\t\t\tvid1_url\n\t\t\t\t\t\tvid2_url\n\t\t\t\t\t\tage\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t`, token, phone, email, province, city, gender, disability,\n\t\tvid1URL, vid2URL, birthYear,\n\t)\n\n\tresponse, err := gqlRequestAndRespond(handler, query, nil)\n\tfailOnError(assert, err)\n\n\texpected := map[string]interface{}{\n\t\t\"data\": map[string]interface{}{\n\t\t\t\"edit\": map[string]interface{}{\n\t\t\t\t\"updateRecruit\": map[string]interface{}{\n\t\t\t\t\t\"phone\": phone,\n\t\t\t\t\t\"email\": email,\n\t\t\t\t\t\"province\": province,\n\t\t\t\t\t\"city\": city,\n\t\t\t\t\t\"gender\": gender,\n\t\t\t\t\t\"disability\": disability,\n\t\t\t\t\t\"vid1_url\": vid1URL,\n\t\t\t\t\t\"vid2_url\": vid2URL,\n\t\t\t\t\t\"age\": float64(time.Now().Year() - birthYear),\n\t\t\t\t},\n\t\t\t},\n\t\t},\n\t}\n\tassert.Equal(expected, response, msgInvalidResult)\n}","func (t *Text) IdentTop(n int) *Text {\n\tif n < 0 {\n\t\treturn t\n\t}\n\tt.addMethod(func() {\n\t\tfor i := 0; i < n; i++ {\n\t\t\tt.buffer.WriteString(\"\\n\")\n\t\t}\n\t})\n\treturn t\n}","func (self *Tween) SetRepeatCounterA(member int) {\n self.Object.Set(\"repeatCounter\", member)\n}","func TestAddProductToCatalog2(t *testing.T) {\n\t\n\te := httpexpect.New(t, API_URL)\n\t\n\tprintComment(\"ADD0002\", \"Test add product 2 to catalog --> ult_medium Unlimited 2GB $29.90\")\n\tproduct := map[string]interface{}{\n\t\t\"code\": \"ult_medium\",\n\t\t\"name\": \"Unlimited 2GB\",\n\t\t\"price\": 29.90,\n\t}\n\n\te.POST(\"/products\").\n\t\tWithJSON(product).\n\t\tExpect().\n\t\tStatus(http.StatusOK)\n\n}","func (level *Level) EatApple() {\n\t// log.Println(\"Apple was eaten\")\n\n\t// Increment the size of the snake\n\tlevel.snake.IncrementSize()\n\n\t// Increment the game score\n\tlevel.game.score++\n\n\t// Move the apple to a new location\n\tlevel.apple.position = level.GetRandomPosition()\n}","func add_grocery(a ...string) {\n\tfor _, d := range a {\n\t\tg_groceries = append(g_groceries, d)\n\t}\n}","func Repeat(v string, repeatNtimes int) string {\n\tvar repeated string\n\tfor i := 1; i <= repeatNtimes; i++ {\n\t\trepeated += v\n\t}\n\treturn repeated\n}","func (b *Banana) PrintfFood() {\n\tfmt.Println(\"I am a fruit of banana\")\n}","func updateIceCream(w http.ResponseWriter, r *http.Request) {\r\n\tw.Header().Set(\"Content-Type\", \"application/json\")\r\n\tparams := mux.Vars(r)\r\n\tflavourid_int,_ := strconv.Atoi(params[\"flavourid\"])\r\n\tfor index, item := range flavours {\r\n\t\tif item.FlavourId == flavourid_int {\r\n\t\t\tflavours = append(flavours[:index], flavours[index+1:]...)\r\n\t\t\tvar IceCream IceCream\r\n\t\t\t_ = json.NewDecoder(r.Body).Decode(&IceCream)\r\n\t\t\tIceCream.FlavourId = flavourid_int\r\n\t\t\tflavours = append(flavours, IceCream)\r\n\t\t\tjson.NewEncoder(w).Encode(IceCream)\r\n\t\t\treturn\r\n\t\t}\r\n\t}\r\n}","func printRes() {\n\tfmt.Printf(\"%d %d\\n\", pAlice, pBob)\n}","func viewLots(a [10]car) {\n\tfmt.Println(len(a))\n}","func (arg1 *UConverter) GetStarters(arg2 *UErrorCode) []int","func main() {\n\tvar name string\n\tfriends := make([]string, 3)\n\n\tfor i := 0; name != \"q\"; i++ {\n\t\tfmt.Print(\"Digite o nome de um amigo e digite 'q' para parar: \")\n\t\tfmt.Scanf(\"%s\", &name)\n\t\tif name != \"q\" {\n\t\t\tif i < 3 {\n\t\t\t\tfriends[i] = name\n\t\t\t} else {\n\t\t\t\t// friends = append(friends, name, \"João\", \"Maria\", \"Mario\")\n\t\t\t\tfriends = append(friends, name)\n\t\t\t}\n\t\t}\n\t}\n\n\tfmt.Printf(\"\\nVocê tem %v amigo(s) \\n\", len(friends))\n\tfor _, friend := range friends {\n\t\tfmt.Printf(\"— %s \\n\", friend)\n\t}\n\n\t// other_type_slice := friends[:3] // Quando nenhum valor é colocado antes do ':' quer dizer que é sempre 0\n\n\tother_type_slice := friends[1:3]\n\tfmt.Println(other_type_slice)\n}","func take(theitem, arg int) int {\n\t/* cursors(); */\n\tlimit := 15 + (c[LEVEL] >> 1)\n\tif limit > 26 {\n\t\tlimit = 26\n\t}\n\tfor i := 0; i < limit; i++ {\n\t\tif iven[i] == 0 {\n\t\t\tiven[i] = theitem\n\t\t\tivenarg[i] = arg\n\t\t\tlimit = 0\n\t\t\tswitch theitem {\n\t\t\tcase OPROTRING, ODAMRING, OBELT:\n\t\t\t\tlimit = 1\n\t\t\tcase ODEXRING:\n\t\t\t\tc[DEXTERITY] += ivenarg[i] + 1\n\t\t\t\tlimit = 1\n\t\t\tcase OSTRRING:\n\t\t\t\tc[STREXTRA] += ivenarg[i] + 1\n\t\t\t\tlimit = 1\n\t\t\tcase OCLEVERRING:\n\t\t\t\tc[INTELLIGENCE] += ivenarg[i] + 1\n\t\t\t\tlimit = 1\n\t\t\tcase OHAMMER:\n\t\t\t\tc[DEXTERITY] += 10\n\t\t\t\tc[STREXTRA] += 10\n\t\t\t\tc[INTELLIGENCE] -= 10\n\t\t\t\tlimit = 1\n\n\t\t\tcase OORBOFDRAGON:\n\t\t\t\tc[SLAYING]++\n\t\t\tcase OSPIRITSCARAB:\n\t\t\t\tc[NEGATESPIRIT]++\n\t\t\tcase OCUBEofUNDEAD:\n\t\t\t\tc[CUBEofUNDEAD]++\n\t\t\tcase ONOTHEFT:\n\t\t\t\tc[NOTHEFT]++\n\t\t\tcase OSWORDofSLASHING:\n\t\t\t\tc[DEXTERITY] += 5\n\t\t\t\tlimit = 1\n\t\t\t}\n\t\t\tlprcat(\"\\nYou pick up:\")\n\t\t\tsrcount = 0\n\t\t\tshow3(i)\n\t\t\tif limit != 0 {\n\t\t\t\tbottomline()\n\t\t\t}\n\t\t\treturn 0\n\t\t}\n\t}\n\tlprcat(\"\\nYou can't carry anything else\")\n\treturn 1\n}","func cleaner(listy ...int) {\n\tfor _, x := range listy {\n\t\tfmt.Println(\"Deleting\", x)\n\t\tdelete(myGreeting, x)\n\t}\n}","func Racer(url1, url2 string) (winner string, err error) {\n\treturn ConfigurableRacer(url1, url2, tenSecondTimeout)\n}","func newRelease(a Artist) int {\n a.Songs++\n return a.Songs\n}","func (m *Match) printMatch() {\n\tfmt.Printf(\"%s%s%s%s:%s:%s%s%s%s%s%s\\n\",\n\t\tcolors.Purple,\n\t\tm.Path,\n\t\tcolors.Restore,\n\t\tcolors.Green,\n\t\tstrconv.Itoa(m.LineNumber),\n\t\tcolors.Restore,\n\t\tstring(m.Line[:m.Match[0]]),\n\t\tcolors.LightRed,\n\t\tstring(m.Line[m.Match[0]:m.Match[1]]),\n\t\tcolors.Restore,\n\t\tstring(m.Line[m.Match[1]:]),\n\t)\n}","func MogTar() int {\r\n\treturn rand.Intn(3) + 1\r\n}","func printColoredSecretJsonObject(secret SecretFound, isFirstSecret *bool) {\n\tIndent3 := Indent + Indent + Indent\n\n\tif *isFirstSecret {\n\t\tfmt.Printf(Indent + Indent + \"{\\n\")\n\t} else {\n\t\tfmt.Printf(\",\\n\" + Indent + Indent + \"{\\n\")\n\t}\n\n\tfmt.Printf(Indent3+\"\\\"Image Layer ID\\\": %s,\\n\", jsonMarshal(secret.LayerID))\n\tfmt.Printf(Indent3+\"\\\"Matched Rule ID\\\": %d,\\n\", secret.RuleID)\n\tfmt.Printf(Indent3+\"\\\"Matched Rule Name\\\": %s,\\n\", jsonMarshal(secret.RuleName))\n\tfmt.Printf(Indent3+\"\\\"Matched Part\\\": %s,\\n\", jsonMarshal(secret.PartToMatch))\n\tfmt.Printf(Indent3+\"\\\"String to Match\\\": %s,\\n\", jsonMarshal(secret.Match))\n\tfmt.Printf(Indent3+\"\\\"Signature to Match\\\": %s,\\n\", jsonMarshal(secret.Regex))\n\tfmt.Printf(Indent3+\"\\\"Severity\\\": %s,\\n\", jsonMarshal(secret.Severity))\n\tfmt.Printf(Indent3+\"\\\"Severity Score\\\": %.2f,\\n\", secret.SeverityScore)\n\tfmt.Printf(Indent3+\"\\\"Starting Index of Match in Original Content\\\": %d,\\n\", secret.PrintBufferStartIndex)\n\tfmt.Printf(Indent3+\"\\\"Relative Starting Index of Match in Displayed Substring\\\": %d,\\n\", secret.MatchFromByte)\n\tfmt.Printf(Indent3+\"\\\"Relative Ending Index of Match in Displayed Substring\\\": %d,\\n\", secret.MatchToByte)\n\tfmt.Printf(Indent3+\"\\\"Full File Name\\\": %s,\\n\", jsonMarshal(secret.CompleteFilename))\n\tmatch := secret.MatchedContents\n\tfrom := secret.MatchFromByte\n\tto := secret.MatchToByte\n\tprefix := removeFirstLastChar(jsonMarshal(match[0:from]))\n\tcoloredMatch := color.RedString(removeFirstLastChar(jsonMarshal(string(match[from:to]))))\n\tsuffix := removeFirstLastChar(jsonMarshal(match[to:]))\n\tfmt.Printf(Indent3+\"\\\"Matched Contents\\\": \\\"%s%s%s\\\"\\n\", prefix, coloredMatch, suffix)\n\n\tfmt.Printf(Indent + Indent + \"}\")\n}","func getHashColorBullet(v string) string {\n\tif len(v) > 6 {\n\t\tv = strutil.Head(v, 6)\n\t}\n\n\treturn fmtc.Sprintf(\" {#\" + strutil.Head(v, 6) + \"}● {!}\")\n}","func Verse(v int) string {\n\n\tdays := map[int]string{\n\t\t1: \"first\",\n\t\t2: \"second\",\n\t\t3: \"third\",\n\t\t4: \"fourth\",\n\t\t5: \"fifth\",\n\t\t6: \"sixth\",\n\t\t7: \"seventh\",\n\t\t8: \"eighth\",\n\t\t9: \"ninth\",\n\t\t10: \"tenth\",\n\t\t11: \"eleventh\",\n\t\t12: \"twelfth\",\n\t}\n\n\tgifts := map[int]string{\n\t\t1: \"a Partridge in a Pear Tree\",\n\t\t2: \"two Turtle Doves\",\n\t\t3: \"three French Hens\",\n\t\t4: \"four Calling Birds\",\n\t\t5: \"five Gold Rings\",\n\t\t6: \"six Geese-a-Laying\",\n\t\t7: \"seven Swans-a-Swimming\",\n\t\t8: \"eight Maids-a-Milking\",\n\t\t9: \"nine Ladies Dancing\",\n\t\t10: \"ten Lords-a-Leaping\",\n\t\t11: \"eleven Pipers Piping\",\n\t\t12: \"twelve Drummers Drumming\",\n\t}\n\n\tgift := \"\"\n\tfor d := v; d >= 1; d-- {\n\n\t\tif v != 1 && d == 1 {\n\t\t\tgift = fmt.Sprintf(\"%s, and %s\", gift, gifts[d])\n\t\t} else {\n\t\t\tgift = fmt.Sprintf(\"%s, %s\", gift, gifts[d])\n\t\t}\n\t}\n\treturn fmt.Sprintf(\"On the %s day of Christmas my true love gave to me%s.\", days[v], gift)\n}","func (p *Bare) sprintTrice() (n int, err error) {\n\tswitch p.trice.Type {\n\tcase \"TRICE0\":\n\t\treturn p.trice0()\n\tcase \"TRICE8_1\":\n\t\treturn p.trice81()\n\tcase \"TRICE8_2\":\n\t\treturn p.trice82()\n\tcase \"TRICE8_3\":\n\t\treturn p.trice83()\n\tcase \"TRICE8_4\":\n\t\treturn p.trice84()\n\tcase \"TRICE8_5\":\n\t\treturn p.trice85()\n\tcase \"TRICE8_6\":\n\t\treturn p.trice86()\n\tcase \"TRICE8_7\":\n\t\treturn p.trice87()\n\tcase \"TRICE8_8\":\n\t\treturn p.trice88()\n\tcase \"TRICE16_1\":\n\t\treturn p.trice161()\n\tcase \"TRICE16_2\":\n\t\treturn p.trice162()\n\tcase \"TRICE16_3\":\n\t\treturn p.trice163()\n\tcase \"TRICE16_4\":\n\t\treturn p.trice164()\n\tcase \"TRICE32_1\":\n\t\treturn p.trice321()\n\tcase \"TRICE32_2\":\n\t\treturn p.trice322()\n\tcase \"TRICE32_3\":\n\t\treturn p.trice323()\n\tcase \"TRICE32_4\":\n\t\treturn p.trice324()\n\tcase \"TRICE64_1\":\n\t\treturn p.trice641()\n\tcase \"TRICE64_2\":\n\t\treturn p.trice642()\n\t}\n\treturn p.outOfSync(fmt.Sprintf(\"Unexpected trice.Type %s\", p.trice.Type))\n}","func generateItemNumbers() (int, int, int) {\n\tnumComments := (numDoc * 4) / 5\n\tnumUsers := (numDoc * 3) / 20\n\tnumAssets := numDoc / 20\n\treturn numComments, numUsers, numAssets\n}","func (tk Tokens) CombineRepeats() bool {\n\tcat := tk.Cat()\n\treturn (cat == Literal || cat == Comment || cat == Text || cat == Name)\n}","func main() {\n\ts1 := stringAppender(\"hoo\")\n\tfmt.Println(s1(\"woo\"))\n\n\ts2 := stringAppender(\"Orioles\")\n\tfmt.Println(s2(\"Baltimore \"))\n\n}","func prt(args ...interface{}) {\n\tfmt.Println(append([]interface{}{\"-------------> DEMO\"}, args...)...)\n}","func (r Roster) Inject(i int) {\n\tfor _, v := range r {\n\t\tv.rating = v.rating + i\n\t}\n}","func AddPlanetEndpoint(w http.ResponseWriter, req *http.Request) {\n var planet Planet\n _ = json.NewDecoder(req.Body).Decode(&planet)\n auto_id_ = auto_id_ + 1\n planet.ID = strconv.FormatInt(int64(auto_id_), 10)\n planet.Films = GetNumElements(getapiinfo.GetApiInformation(planet.Name))\n planets_ = append(planets_, planet)\n json.NewEncoder(w).Encode(planets_)\n}","func TestSizeRepeat(t *testing.T) {\n\t// init trie obj\n\ttrieObj := trie.NewTrie()\n\n\t// test size with 1st insert\n\ttrieObj.Insert(\"A\")\n\tassert.Equal(t, trieObj.Size, 1)\n\tassert.Equal(t, trieObj.IsEmpty(), false)\n\n\t// test size with repeated insert\n\ttrieObj.Insert(\"A\")\n\tassert.Equal(t, trieObj.Size, 1)\n\n\t// test size with 2nd insert\n\ttrieObj.Insert(\"ALO\")\n\tassert.Equal(t, trieObj.Size, 2)\n\tassert.Equal(t, trieObj.IsEmpty(), false)\n\n\t// test with repeated insert\n\ttrieObj.Insert(\"ALO\")\n\tassert.Equal(t, trieObj.Size, 2)\n\n\t// test with 3rd insert\n\ttrieObj.Insert(\"ALOHA\")\n\tassert.Equal(t, trieObj.Size, 3)\n\tassert.Equal(t, trieObj.IsEmpty(), false)\n\n\t// test with repeated insert\n\ttrieObj.Insert(\"ALOHA\")\n\tassert.Equal(t, trieObj.Size, 3)\n\n}","func restNote(rest rune, dotted bool, tempo int) []int16 {\n\tvar samples int\n\tlength := wholeNote + (wholeNote / 100 * 4 * (4 - tempo)) // 4% per tempo unit\n\tswitch rest {\n\tcase 'W':\n\t\tsamples = length\n\tcase 'H':\n\t\tsamples = length / 2\n\tcase 'Q':\n\t\tsamples = length / 4\n\tcase 'E':\n\t\tsamples = length / 8\n\tcase 'S':\n\t\tsamples = length / 16\n\tcase 'T':\n\t\tsamples = length / 32\n\tcase 'I':\n\t\tsamples = length / 64\n\t}\n\n\tif dotted {\n\t\tsamples += samples / 2\n\t}\n\n\treturn make([]int16, samples)\n}","func Eat(f Food) {\n\tfmt.Printf(\"I love %ss!\", f.Name)\n}","func (Service) TooManyArguments(a, b string) {\n}","func TestAddTwoDeleteScond(t *testing.T) {\n\ttarget := teaser.New()\n\tm1id := target.Add(\"msg1\")\n\tm2id := target.Add(\"msg2\")\n\n\t{\n\t\tdeleted := target.Delete(m2id)\n\t\tassertDeleted(m2id, deleted, t)\n\t}\n\n\t{\n\t\tnextHash, m1vid := target.View()\n\t\tassertMessageId(m1id, m1vid, t)\n\t\tassertMessageHash(\"\", nextHash, t)\n\t}\n}","func plusUserID(step int64) int64 {\n\tuserid += step\n\treturn userid\n}","func generateLogLine(id int) string {\n\tmethod := httpMethods[rand.Intn(len(httpMethods))]\n\tnamespace := namespaces[rand.Intn(len(namespaces))]\n\n\tpodName := rand.String(rand.IntnRange(3, 5))\n\turl := fmt.Sprintf(\"/api/v1/namespaces/%s/pods/%s\", namespace, podName)\n\tstatus := rand.IntnRange(200, 600)\n\n\treturn fmt.Sprintf(\"%d %s %s %d\", id, method, url, status)\n}","func viewCar(a [10]car, printLots func(a [10]car)) {\n\tfor i := 0; i < lots; i++ {\n\t\tfmt.Println(a[i].color, a[i].cost)\n\t}\n\tprintLots(a)\n}","func newRelease(a *Artist) int {\n a.Songs++\n return a.Songs\n}","func (s *stepConstructor) RepeatStep() {\n\ts.CurrentStep--\n}"],"string":"[\n \"func printTally(wrapped, dropped int64) {\\n\\tfmt.Println(\\\"\\\\n--------------------------------------\\\")\\n\\tfmt.Printf(\\\"%-10s : %02d\\\\n\\\", \\\"Total\\\", chocolateCount)\\n\\tfmt.Printf(\\\"%-10s : %02d\\\\n\\\", \\\"Wrapped\\\", wrapped)\\n\\tfmt.Printf(\\\"%-10s : %02d\\\\n\\\", \\\"Dropped\\\", dropped)\\n\\tfmt.Println(\\\"--------------------------------------\\\")\\n}\",\n \"func totalFruit(fruits []int) int {\\n\\tpairs := make([]pair, 0)\\n\\tif len(fruits) > 0 {\\n\\t\\tcrtPair := newPair(0)\\n\\t\\tcrtPair.fruits[fruits[0]] = 1\\n\\t\\tfor i := 1; i < len(fruits); i++ {\\n\\t\\t\\tfruit := fruits[i]\\n\\t\\t\\tct, present := crtPair.fruits[fruit]\\n\\t\\t\\tif present {\\n\\t\\t\\t\\tcrtPair.fruits[fruit] = ct + 1\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif len(crtPair.fruits) == 1 {\\n\\t\\t\\t\\t\\tcrtPair.fruits[fruit] = 1\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t// we have encountered a new fruit, start the new pair\\n\\t\\t\\t\\t\\tj := i - 1\\n\\t\\t\\t\\t\\tpreviousFruit := fruits[j]\\n\\t\\t\\t\\t\\tpreviousFruitCount := 0\\n\\t\\t\\t\\t\\tfor j > -1 && fruits[j] == previousFruit {\\n\\t\\t\\t\\t\\t\\tpreviousFruitCount++\\n\\t\\t\\t\\t\\t\\tj--\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t// add the current pair\\n\\t\\t\\t\\t\\tpairs = append(pairs, *crtPair)\\n\\t\\t\\t\\t\\t// create a new pair\\n\\t\\t\\t\\t\\tcrtPair = newPair(i)\\n\\t\\t\\t\\t\\tcrtPair.fruits[previousFruit] = previousFruitCount\\n\\t\\t\\t\\t\\tcrtPair.fruits[fruit] = 1\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tpairs = append(pairs, *crtPair)\\n\\t}\\n\\treturn findMaxCount(pairs)\\n}\",\n \"func fungsilen() {\\n\\n\\tvar fruits = []string{\\\"apple\\\", \\\"grape\\\", \\\"banana\\\", \\\"melon\\\"}\\n\\tfmt.Println(\\\"index is: \\\", len(fruits))\\n}\",\n \"func (self *Tween) Repeat2O(total int, repeat int, index int) *Tween{\\n return &Tween{self.Object.Call(\\\"repeat\\\", total, repeat, index)}\\n}\",\n \"func repeatWord(word string, repetitions int) string {\\n\\tvar response string\\n\\tvar i int\\n\\n\\tif repetitions < 0 {\\n\\t\\tlog.Fatal(\\\"Can not repeat a word a negative number of times\\\\n\\\")\\n\\t} else if repetitions == 0 {\\n\\t\\treturn \\\"\\\"\\n\\t}\\n\\n\\t// we are now dealing with the case that we must\\n\\t// repeat the word one, or more, times\\n\\tresponse = word\\n\\tfor i = 1; i < repetitions; i++ {\\n\\t\\tresponse = fmt.Sprintf(\\\"%s %s\\\", response, word)\\n\\t}\\n\\n\\treturn response\\n}\",\n \"func Grapple(i *InputHandler, b *models.Box) {\\n\\ti.NewRope = true\\n\\ti.DestroyRope = false\\n\\tb.State = models.GRAPPLING\\n}\",\n \"func (self *Tween) RepeatCounter() int{\\n return self.Object.Get(\\\"repeatCounter\\\").Int()\\n}\",\n \"func main() {\\n\\tfmt.Println(first, second)\\n\\n\\t//fmt.Println(first, second, third) // in case example number 5 only\\n\\n\\t//fmt.Println(first, second, third, fourth) // in case example number 6 (the last one) only\\n}\",\n \"func PrintDiff(add, remove []domain.UserAudience) {\\n\\tfmt.Println(\\\"************* Count add *************\\\")\\n\\tfmt.Println(len(add))\\n\\tfmt.Println(\\\"************* Array add *************\\\")\\n\\tfmt.Println(add)\\n\\tfmt.Println(\\\"************ Count remove ***********\\\")\\n\\tfmt.Println(len(remove))\\n\\tfmt.Println(\\\"************ Array remove ***********\\\")\\n\\tfmt.Println(remove)\\n}\",\n \"func RepeatMe(words ...string) {\\n\\tfmt.Println(words)\\n}\",\n \"func totalFruit(tree []int) int {\\n\\tif len(tree) <= 2 {\\n\\t\\treturn len(tree)\\n\\t}\\n\\tm := make(map[int]int)\\n\\tres := 0\\n\\t// 以下的code是典型的滑动窗口的写法\\n\\tstart := 0\\n\\tfor end := 0; end < len(tree); end++ {\\n\\t\\tif _, ok := m[tree[end]]; ok {\\n\\t\\t\\tm[tree[end]] += 1\\n\\t\\t} else {\\n\\t\\t\\tm[tree[end]] = 1\\n\\t\\t}\\n\\t\\tfor len(m) > 2 && start < end {\\n\\t\\t\\tm[tree[start]] -= 1\\n\\t\\t\\tif m[tree[start]] == 0 {\\n\\t\\t\\t\\tdelete(m, tree[start])\\n\\t\\t\\t}\\n\\t\\t\\tstart++\\n\\t\\t}\\n\\t\\tif (end - start + 1) > res {\\n\\t\\t\\tres = end - start + 1\\n\\t\\t}\\n\\t}\\n\\treturn res\\n}\",\n \"func (self *Tween) Repeat1O(total int, repeat int) *Tween{\\n return &Tween{self.Object.Call(\\\"repeat\\\", total, repeat)}\\n}\",\n \"func infoPhotosQuantity() {\\n\\tfmt.Println(\\\"!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\\\")\\n\\tfmt.Printf(\\\"! SE ENCONTRARON %v FOTOS\\\\n\\\", len(store))\\n\\tfmt.Println(\\\"!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\\\")\\n}\",\n \"func ExampleRepeat() {\\n\\tsum := Repeat(\\\"a\\\", 5)\\n\\tfmt.Println(sum)\\n\\t// Output: aaaaa\\n}\",\n \"func Verse(v int) string {\\n\\t// if it's the final verse, return it alone\\n\\tif v == len(lyrics) {\\n\\t\\treturn lyrics[v-1].item\\n\\t}\\n\\n\\t// otherwise return the item plus the list plus the list of all previous stanzas\\n\\tr := lyrics[v-1].item\\n\\tfor i := v - 1; i >= 0; i-- {\\n\\t\\tr += \\\"\\\\n\\\" + lyrics[i].list\\n\\t}\\n\\treturn r\\n}\",\n \"func Teapot(w http.ResponseWriter, message ...interface{}) {\\n\\tboom(w, 418, message...)\\n}\",\n \"func getIceCream(w http.ResponseWriter, r *http.Request) {\\r\\n\\tw.Header().Set(\\\"Content-Type\\\", \\\"application/json\\\")\\r\\n\\tparams := mux.Vars(r) // Gets params\\r\\n\\tflavourid_int,_ := strconv.Atoi(params[\\\"flavourid\\\"])\\r\\n\\t// Loop through flavours and find one with the flavourId from the params\\r\\n\\tfor _, item := range flavours {\\r\\n\\t\\tif item.FlavourId == flavourid_int {\\r\\n\\t\\t\\tjson.NewEncoder(w).Encode(item)\\r\\n\\t\\t\\treturn\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\tjson.NewEncoder(w).Encode(&IceCream{})\\r\\n}\",\n \"func formatUserChoice(playlists []map[string]interface{}) (string, error) {\\n\\ti := 1\\n\\tres := \\\"\\\"\\n\\tfor _, v := range playlists {\\n\\t\\tres += strconv.Itoa(i) + \\\")\\\" + v[\\\"name\\\"].(string) + \\\"\\\\n\\\"\\n\\t\\ti++\\n\\t}\\n\\tif res == \\\"\\\" {\\n\\t\\treturn res, errors.New(\\\"Can't format user choice\\\")\\n\\t}\\n\\treturn res, nil\\n}\",\n \"func RottenFruitUtil(arr [][]int, maxCol int, maxRow int, currCol int, currRow int, traversed [][]int, day int) {\\n\\tif currCol < 0 || currCol >= maxCol || currRow < 0 || currRow >= maxRow {\\n\\t\\treturn\\n\\t}\\n\\t// Traversable and rot if not already rotten.\\n\\tif traversed[currCol][currRow] <= day || arr[currCol][currRow] == 0 {\\n\\t\\treturn\\n\\t}\\n\\n\\tdir := [][]int{{-1, 0}, {1, 0}, {0, -1}, {0, 1}}\\n\\ttraversed[currCol][currRow] = day // Update rot time.\\n\\tfor i := 0; i < 4; i++ {\\n\\t\\tx := currCol + dir[i][0]\\n\\t\\ty := currRow + dir[i][1]\\n\\t\\tRottenFruitUtil(arr, maxCol, maxRow, x, y, traversed, day+1)\\n\\t}\\n}\",\n \"func Zap(f Food) {\\n\\tfmt.Printf(\\\"I hate %ss!\\\", f.Name)\\n\\n}\",\n \"func Teapot(message ...interface{}) Err {\\n\\treturn Boomify(http.StatusTeapot, message...)\\n}\",\n \"func TestApploffer1(t *testing.T) {\\n\\tclearBasket()\\n\\n\\tbasket.Basket.AddItem(\\\"AP1\\\")\\n\\tbasket.Basket.AddItem(\\\"AP1\\\")\\n\\n\\tvar totalItem, appleCount int64\\n\\n\\tCos.PrintBills()\\n\\n\\tfor _, be := range Cos.bill {\\n\\t\\ttotalItem++\\n\\n\\t\\tif be.prodCode == \\\"AP1\\\" {\\n\\t\\t\\tappleCount++\\n\\t\\t}\\n\\t}\\n\\n\\tif totalItem != appleCount {\\n\\t\\tt.Errorf(\\\"ordered 2 apple. But found: %d\\\", appleCount)\\n\\t}\\n}\",\n \"func printTopK(tags []string, data map[string]float64,topKWord int){\\n // i :=1\\n // for _,t := range tags{\\n // fmt.Printf(\\\" %s :%v \\\\n\\\", t,data[t])\\n // // i++\\n // }\\n\\n fmt.Println(strings.Join(tags, \\\"/ \\\"))\\n }\",\n \"func (s *Scanner) identRest() {\\n\\tswitch {\\n\\tcase s.acceptIf(text.IdentRest):\\n\\t\\ts.identRest()\\n\\tcase s.accept('_'):\\n\\t\\ts.identOrOperatorRest()\\n\\tcase s.acceptIf(text.IsIdentifierPart):\\n\\t\\ts.identRest()\\n\\t}\\n}\",\n \"func redact(match HTTPMatch, value interface{}, locationPrefix string) interface{} {\\n\\tif match.HasBodyWhitelistMatch(locationPrefix) {\\n\\t\\treturn value\\n\\t}\\n\\n\\tswitch typedValue := value.(type) {\\n\\tcase map[string]interface{}:\\n\\t\\tm := make(map[string]interface{})\\n\\t\\tfor k, v := range typedValue {\\n\\t\\t\\tm[k] = redact(match, v, locationPrefix+\\\".\\\"+k)\\n\\t\\t}\\n\\t\\treturn m\\n\\tcase []interface{}:\\n\\t\\tm := make([]interface{}, len(typedValue))\\n\\t\\tfor k, v := range typedValue {\\n\\t\\t\\tm[k] = redact(match, v, locationPrefix+\\\"[\\\"+strconv.Itoa(k)+\\\"]\\\")\\n\\t\\t}\\n\\t\\treturn m\\n\\tcase float64:\\n\\t\\treturn RedactedNumber\\n\\tcase string:\\n\\t\\treturn RedactedStr\\n\\tcase bool:\\n\\t\\treturn RedactedBool\\n\\tcase nil:\\n\\t\\treturn nil\\n\\tdefault:\\n\\t\\treturn nil\\n\\t}\\n}\",\n \"func deleteIceCream(w http.ResponseWriter, r *http.Request) {\\r\\n\\tw.Header().Set(\\\"Content-Type\\\", \\\"application/json\\\")\\r\\n\\tparams := mux.Vars(r)\\r\\n\\tflavourid_int,_ := strconv.Atoi(params[\\\"flavourid\\\"])\\r\\n\\tfor index, item := range flavours {\\r\\n\\t\\tif item.FlavourId == flavourid_int {\\r\\n\\t\\t\\tflavours = append(flavours[:index], flavours[index+1:]...)\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\tjson.NewEncoder(w).Encode(flavours)\\r\\n}\",\n \"func TugOfWars(arr []int) (ans1, ans2 []int) {\\n\\tfirst := []int{}\\n\\tsecond := []int{}\\n\\ttugHelper(arr, first, second, 0, 0, 0)\\n\\treturn ans1, ans2\\n}\",\n \"func AutoG(w http.ResponseWriter, req *http.Request) {\\n\\tvar frase Frase\\n\\t_ = json.NewDecoder(req.Body).Decode(&frase)\\n\\tfraseNooized := \\\"\\\"\\n\\trand.Seed(time.Now().UnixNano())\\n\\tnum := rand.Intn(3)\\n\\tswitch num {\\n\\tcase 0:\\n\\t\\tfraseNooized = NDecorator(frase.Testo)\\n\\tcase 1:\\n\\t\\tfraseNooized = GDecorator(frase.Testo)\\n\\tdefault:\\n\\t\\tfraseNooized = EDecorator(frase.Testo)\\n\\t}\\n\\tjson.NewEncoder(w).Encode(fraseNooized)\\n}\",\n \"func slicecap() {\\n\\n\\tvar fruits = []string{\\\"apple\\\", \\\"grape\\\", \\\"banana\\\", \\\"melon\\\"}\\n\\tfmt.Println(\\\"index len is: \\\", len(fruits))\\n\\tfmt.Println(\\\"index cap is: \\\", cap(fruits))\\n\\n\\tvar aFruits = fruits[0:3]\\n\\tfmt.Println(\\\"index len is: \\\", len(aFruits))\\n\\tfmt.Println(\\\"index cap is: \\\", cap(aFruits))\\n\\n\\tvar bFruits = fruits[1:4]\\n\\tfmt.Println(\\\"index len is: \\\", len(bFruits))\\n\\tfmt.Println(\\\"index cap is: \\\", cap(bFruits))\\n}\",\n \"func createIceCream(w http.ResponseWriter, r *http.Request) {\\r\\n\\tw.Header().Set(\\\"Content-Type\\\", \\\"application/json\\\")\\r\\n\\tvar IceCream IceCream\\r\\n\\t_ = json.NewDecoder(r.Body).Decode(&IceCream)\\r\\n\\tIceCream.FlavourId = genNextId()\\r\\n\\tflavours = append(flavours, IceCream)\\r\\n\\tjson.NewEncoder(w).Encode(IceCream)\\r\\n}\",\n \"func RobotLingo() string {\\n\\n println(\\\"Affirmatives\\\")\\n println(\\\"Affirmative\\\")\\n println(\\\"affirmative\\\")\\n println(\\\"affirmative\\\")\\n\\n println(\\\"lickMyBatteries\\\")\\n println(\\\"LickMyBattery\\\")\\n println(\\\"lickMyBattery\\\")\\n println(\\\"lick_my_battery\\\")\\n\\n println(\\\"exterminate_the_humans\\\")\\n println(\\\"Exterminatethehuman\\\")\\n println(\\\"exterminatethehuman\\\")\\n println(\\\"exterminate_the_human\\\")\\n\\n}\",\n \"func betterRestaurant() {\\r\\n\\tvar wg sync.WaitGroup\\r\\n\\r\\n\\twg.Add(1)\\r\\n\\tgo func() {\\r\\n\\t\\tbetterChef(\\\"炒饭\\\")\\r\\n\\t\\twg.Done()\\r\\n\\t}()\\r\\n\\r\\n\\twg.Add(1)\\r\\n\\tgo func() {\\r\\n\\t\\tbetterChef(\\\"炒时蔬\\\")\\r\\n\\t\\twg.Done()\\r\\n\\t}()\\r\\n\\r\\n\\twg.Add(1)\\r\\n\\tgo func() {\\r\\n\\t\\tbetterChef(\\\"水煮肉片\\\")\\r\\n\\t\\twg.Done()\\r\\n\\t}()\\r\\n\\r\\n\\twg.Wait()\\r\\n}\",\n \"func (self *Tween) Repeat(total int) *Tween{\\n return &Tween{self.Object.Call(\\\"repeat\\\", total)}\\n}\",\n \"func Red(x ...interface{}) {\\n\\tred.Println(x...)\\n}\",\n \"func amigos(res http.ResponseWriter, req *http.Request) {\\n\\trows, err := db.Query(`SELECT amigoName FROM amigos;`)\\n\\tcheck(err)\\n\\tdefer rows.Close()\\n\\n\\t// data to be used in query\\n\\tvar s, name string\\n\\ts = \\\"RETRIEVED RECORDS:\\\\n\\\"\\n\\n\\t// query\\n\\tfor rows.Next() {\\n\\t\\terr = rows.Scan(&name)\\n\\t\\tcheck(err)\\n\\t\\ts += name + \\\"\\\\n\\\"\\n\\t}\\n\\tfmt.Fprintln(res, s)\\n}\",\n \"func TestAddManyViewMany(t *testing.T) {\\n\\ttarget := teaser.New()\\n\\tm1id := target.Add(\\\"msg1\\\")\\n\\tm2id := target.Add(\\\"msg2\\\")\\n\\tm3id := target.Add(\\\"msg3\\\")\\n\\n\\tm2Hash, m1vid := target.View()\\n\\tassertMessageId(m1id, m1vid, t)\\n\\tassertMessageHash(\\\"msg2\\\", m2Hash, t)\\n\\n\\tm3Hash, m2vid := target.View()\\n\\tassertMessageId(m2id, m2vid, t)\\n\\tassertMessageHash(\\\"msg3\\\", m3Hash, t)\\n\\n\\tnextHash, m3vid := target.View()\\n\\tassertMessageId(m3id, m3vid, t)\\n\\tassertMessageHash(\\\"\\\", nextHash, t)\\n\\n}\",\n \"func Repeat(word string, repeat int) string {\\n\\tvar result string\\n\\n\\tif repeat == 0 {\\n\\t\\trepeat = repeatCount\\n\\t}\\n\\n\\tfor i := 0; i < repeat; i++ {\\n\\t\\tresult += word\\n\\t}\\n\\treturn result\\n}\",\n \"func addQuantity(ingredient Ingredient, quantity int) Ingredient {\\n\\tingredient.Quantity = ingredient.Quantity + quantity\\n\\treturn ingredient\\n}\",\n \"func (a AnalysisServer) TopRestaurants(ctx stdctx.Context, quantity *pb.Quantity) (*pb.RestaurantList, error) {\\n restaurantList, err := db.GetTopRestaurants(\\\"Restaurants\\\", quantity.Size)\\n if err != nil {\\n return &pb.RestaurantList{}, err\\n }\\n return restaurantListToPb(restaurantList), nil\\n}\",\n \"func indexHandler1( w http.ResponseWriter, r *http.Request){\\n\\n\\treg, err := regexp.Compile(\\\"[^a-zA-Z0-9]+\\\")\\n\\tfmt.Fprintf(w, \\\"word\\\"+\\\" \\\"+\\\"count\\\")\\n\\tfmt.Fprintf(w,\\\"\\\\n----------\\\\n\\\")\\n\\tfor key, val := range wordcountMap {\\n\\n\\t\\tfmt.Println(strings.TrimRight(key, \\\" \\\"), val)\\n\\t\\tfmt.Fprintf(w, reg.ReplaceAllString(key, \\\"\\\")+\\\" \\\"+strconv.Itoa(val))\\n\\t\\tfmt.Fprintf(w,\\\"\\\\n\\\")\\n\\n\\t}\\n\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n}\",\n \"func key(keys ...string) string {\\n\\treturn fmt.Sprintf(\\\"%s:%s\\\", \\\"mailimage\\\", strings.Join(keys, \\\":\\\"))\\n}\",\n \"func spacer(level int) string {\\n\\treturn strings.Repeat(\\\" \\\", level)\\n}\",\n \"func printIDs(sectionName string, matches map[string]string) {\\n\\tfmt.Printf(\\\"%v:\\\\n\\\", sectionName)\\n\\tfor id, title := range matches {\\n\\t\\tfmt.Printf(\\\"[%v] %v\\\\n\\\", id, title)\\n\\t}\\n\\tfmt.Printf(\\\"\\\\n\\\\n\\\")\\n}\",\n \"func RETFW(i operand.Op) { ctx.RETFW(i) }\",\n \"func CountPrintln(f ...interface{}) {\\n\\tcount++\\n\\tfmt.Printf(\\\"%d - \\\", count)\\n\\tfmt.Println(f...)\\n}\",\n \"func TestAddTwoDeleteFirst(t *testing.T) {\\n\\ttarget := teaser.New()\\n\\tm1id := target.Add(\\\"msg1\\\")\\n\\tm2id := target.Add(\\\"msg2\\\")\\n\\n\\t{\\n\\t\\tdeleted := target.Delete(m1id)\\n\\t\\tassertDeleted(m1id, deleted, t)\\n\\t}\\n\\n\\t{\\n\\t\\tnextHash, m2vid := target.View()\\n\\t\\tassertMessageId(m2id, m2vid, t)\\n\\t\\tassertMessageHash(\\\"\\\", nextHash, t)\\n\\t}\\n}\",\n \"func TestAddOnceViewMany(t *testing.T) {\\n\\ttarget := teaser.New()\\n\\tm1id := target.Add(\\\"msg1\\\")\\n\\n\\t{\\n\\t\\tnextHash, m1vid := target.View()\\n\\t\\tassertMessageId(m1id, m1vid, t)\\n\\t\\tassertMessageHash(\\\"\\\", nextHash, t)\\n\\t}\\n\\n\\t{\\n\\t\\tnextHash, nextvid := target.View()\\n\\t\\tassertMessageId(\\\"\\\", nextvid, t)\\n\\t\\tassertMessageHash(\\\"\\\", nextHash, t)\\n\\t}\\n}\",\n \"func (a Snake) Eat() {\\n\\tfmt.Printf(\\\"%s \\\\n\\\", a.food)\\n}\",\n \"func countApplesAndOranges(s int32, t int32, a int32, b int32, apples []int32, oranges []int32) {\\n\\tvar hitApples, hitOranges int32\\n\\tfor _, apple := range apples {\\n\\t\\tplace := a + apple\\n\\t\\tif s <= place && place <= t {\\n\\t\\t\\thitApples++\\n\\t\\t}\\n\\t}\\n\\tfor _, orange := range oranges {\\n\\t\\tplace := b + orange\\n\\t\\tif s <= place && place <= t {\\n\\t\\t\\thitOranges++\\n\\t\\t}\\n\\t}\\n\\tfmt.Println(hitApples)\\n\\tfmt.Println(hitOranges)\\n}\",\n \"func wearArmor(dexterity int) (string, int) {\\n\\tlottery := random(1, 5)\\n\\tvar armorname string\\n\\tvar armorBonus, dexBonus int\\n\\tdexBonus = attrModifier(dexterity)\\n\\tswitch lottery {\\n\\tcase 1:\\n\\t\\tarmorname = \\\"Leather Armor\\\"\\n\\t\\tarmorBonus = 2\\n\\t\\tif dexBonus > 8 { // Every armor has a limit of how many dexterity bonus points can be added.\\n\\t\\t\\tdexBonus = 8\\n\\t\\t}\\n\\tcase 2:\\n\\t\\tarmorname = \\\"Chain Shirt\\\"\\n\\t\\tarmorBonus = 4\\n\\t\\tif dexBonus > 4 {\\n\\t\\t\\tdexBonus = 4\\n\\t\\t}\\n\\tcase 3:\\n\\t\\tarmorname = \\\"Scale Mail\\\"\\n\\t\\tarmorBonus = 4\\n\\t\\tif dexBonus > 4 {\\n\\t\\t\\tdexBonus = 4\\n\\t\\t}\\n\\tcase 4:\\n\\t\\tarmorname = \\\"Breastplate\\\"\\n\\t\\tarmorBonus = 5\\n\\t\\tif dexBonus > 3 {\\n\\t\\t\\tdexBonus = 3\\n\\t\\t}\\n\\tcase 5:\\n\\t\\tarmorname = \\\"Full Plate Armor\\\"\\n\\t\\tarmorBonus = 8\\n\\t\\tif dexBonus > 1 {\\n\\t\\t\\tdexBonus = 1\\n\\t\\t}\\n\\t}\\n\\treturn armorname, 10 + armorBonus + dexBonus\\n}\",\n \"func (t *Translator) chooseUnit(unit string, count int64) (string, error) {\\n\\ts := strings.Split(t.resources[unit], \\\"|\\\")\\n\\tif count > 1 {\\n\\t\\treturn strings.Replace(s[1], \\\":count\\\", strconv.FormatInt(int64(count), 10), 1), nil\\n\\t}\\n\\n\\treturn s[0], nil\\n}\",\n \"func ConcatVitals(x, y, rot float64, health uint64) string {\\n\\treturn fmt.Sprintf(\\\"%f|%f|%f|%d\\\", x, y, rot, health)\\n}\",\n \"func (m *RoomdetailMutation) AddRoomprice(i int) {\\n\\tif m.addroomprice != nil {\\n\\t\\t*m.addroomprice += i\\n\\t} else {\\n\\t\\tm.addroomprice = &i\\n\\t}\\n}\",\n \"func DeleteFruit(c *gin.Context, params *FruitIdentityParams) error {\\n\\tif params.APIKey == \\\"\\\" {\\n\\t\\treturn errors.Forbiddenf(\\\"invalid api key\\\")\\n\\t}\\n\\tmarket.Lock()\\n\\tdefer market.Unlock()\\n\\n\\tn := strings.ToLower(params.Name)\\n\\tif _, ok := market.fruits[n]; !ok {\\n\\t\\treturn errors.NotFoundf(\\\"fruit\\\")\\n\\t}\\n\\tdelete(market.fruits, n)\\n\\n\\treturn nil\\n}\",\n \"func (self *Tween) RepeatAll1O(total int) *Tween{\\n return &Tween{self.Object.Call(\\\"repeatAll\\\", total)}\\n}\",\n \"func (r *Responder) Teapot() { r.write(http.StatusTeapot) }\",\n \"func (g *Game) Shot(shot int) {\\n\\n\\tif g.isOver() {\\n\\t\\tfmt.Println(\\\"Illegal extra shot\\\")\\n\\t\\treturn\\n\\t}\\n\\tfmt.Printf(\\\"Shot: %d, Pinup: %d. Game frames: %v \\\\n\\\", shot, g.numPinUp, g.frames)\\n\\tg.accountBonus(shot)\\n\\tg.recordShot(shot)\\n\\tg.prepareNextShot()\\n}\",\n \"func Repeat(count int, operand string) string { return strings.Repeat(operand, count) }\",\n \"func print_prefix_name(p int32)(str string){\\nl:=name_dir[p].name[0]\\nstr= fmt.Sprint(string(name_dir[p].name[1:]))\\nif int(l)<len(name_dir[p].name){\\nstr+= \\\"...\\\"\\n}\\nreturn\\n}\",\n \"func Redact(s string) string {\\n redaction := \\\"[REDACTED]\\\"\\n str := strings.Fields(s)\\n for idx, _ := range str {\\n str[idx] = redaction\\n }\\n\\n return strings.Join(str, \\\" \\\")\\n}\",\n \"func (animal *Animal) Eat() {\\n\\tfmt.Println(string(colorRed), animal.food)\\n}\",\n \"func redact(line []byte, ranges []matchRange) []byte {\\n\\tvar offset int // the offset of ranges generated by replacing x bytes by the RedactStr\\n\\tfor _, r := range ranges {\\n\\t\\tlength := r.last - r.first\\n\\t\\tfirst := r.first + offset\\n\\t\\tlast := first + length\\n\\n\\t\\ttoRedact := line[first:last]\\n\\t\\tredactStr := RedactStr\\n\\t\\tif bytes.HasSuffix(toRedact, []byte(\\\"\\\\n\\\")) {\\n\\t\\t\\t// if string to redact ends with newline redact message should also\\n\\t\\t\\tredactStr += \\\"\\\\n\\\"\\n\\t\\t}\\n\\n\\t\\tnewLine := append([]byte{}, line[:first]...)\\n\\t\\tnewLine = append(newLine, redactStr...)\\n\\t\\tnewLine = append(newLine, line[last:]...)\\n\\n\\t\\toffset += len(redactStr) - length\\n\\n\\t\\tline = newLine\\n\\t}\\n\\treturn line\\n}\",\n \"func TestRecruitEditor_UpdateRecruit(t *testing.T) {\\n\\tassert := assert.New(t)\\n\\tcrud := moc.NewLoadedCRUD()\\n\\thandler := createGqlHandler(crud)\\n\\n\\t// login as recruit user\\n\\ttoken, _ := login(crud, getRecruitUserAccount().ID, \\\"none\\\")\\n\\n\\t// prep data\\n\\tphone := \\\"082 345 6789\\\"\\n\\temail := \\\"newa@gmail.com\\\"\\n\\tprovince := \\\"LIMPOPO\\\"\\n\\tgender := \\\"FEMALE\\\"\\n\\tcity := \\\"Polokwane\\\"\\n\\tdisability := \\\"Blind\\\"\\n\\tvid1URL := \\\"http://google.com\\\"\\n\\tvid2URL := \\\"http://youtube.com\\\"\\n\\tbirthYear := 1987\\n\\n\\t// prepare query\\n\\tquery := fmt.Sprintf(`\\n\\t\\tmutation {\\n\\t\\t\\tedit(token: \\\"%s\\\"){\\n\\t\\t\\t\\t... on RecruitEditor{\\n\\t\\t\\t\\t\\tupdateRecruit(info: {\\n\\t\\t\\t\\t\\t\\tphone: \\\"%s\\\",\\n\\t\\t\\t\\t\\t\\temail: \\\"%s\\\",\\n\\t\\t\\t\\t\\t\\tprovince: %s,\\n\\t\\t\\t\\t\\t\\tcity: \\\"%s\\\",\\n\\t\\t\\t\\t\\t\\tgender: %s,\\n\\t\\t\\t\\t\\t\\tdisability: \\\"%s\\\",\\n\\t\\t\\t\\t\\t\\tvid1_url: \\\"%s\\\",\\n\\t\\t\\t\\t\\t\\tvid2_url: \\\"%s\\\",\\n\\t\\t\\t\\t\\t\\tbirth_year: %v,\\n\\t\\t\\t\\t\\t}){\\n\\t\\t\\t\\t\\t\\tphone\\n\\t\\t\\t\\t\\t\\temail\\n\\t\\t\\t\\t\\t\\tprovince\\n\\t\\t\\t\\t\\t\\tcity\\n\\t\\t\\t\\t\\t\\tgender\\n\\t\\t\\t\\t\\t\\tdisability\\n\\t\\t\\t\\t\\t\\tvid1_url\\n\\t\\t\\t\\t\\t\\tvid2_url\\n\\t\\t\\t\\t\\t\\tage\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t`, token, phone, email, province, city, gender, disability,\\n\\t\\tvid1URL, vid2URL, birthYear,\\n\\t)\\n\\n\\tresponse, err := gqlRequestAndRespond(handler, query, nil)\\n\\tfailOnError(assert, err)\\n\\n\\texpected := map[string]interface{}{\\n\\t\\t\\\"data\\\": map[string]interface{}{\\n\\t\\t\\t\\\"edit\\\": map[string]interface{}{\\n\\t\\t\\t\\t\\\"updateRecruit\\\": map[string]interface{}{\\n\\t\\t\\t\\t\\t\\\"phone\\\": phone,\\n\\t\\t\\t\\t\\t\\\"email\\\": email,\\n\\t\\t\\t\\t\\t\\\"province\\\": province,\\n\\t\\t\\t\\t\\t\\\"city\\\": city,\\n\\t\\t\\t\\t\\t\\\"gender\\\": gender,\\n\\t\\t\\t\\t\\t\\\"disability\\\": disability,\\n\\t\\t\\t\\t\\t\\\"vid1_url\\\": vid1URL,\\n\\t\\t\\t\\t\\t\\\"vid2_url\\\": vid2URL,\\n\\t\\t\\t\\t\\t\\\"age\\\": float64(time.Now().Year() - birthYear),\\n\\t\\t\\t\\t},\\n\\t\\t\\t},\\n\\t\\t},\\n\\t}\\n\\tassert.Equal(expected, response, msgInvalidResult)\\n}\",\n \"func (t *Text) IdentTop(n int) *Text {\\n\\tif n < 0 {\\n\\t\\treturn t\\n\\t}\\n\\tt.addMethod(func() {\\n\\t\\tfor i := 0; i < n; i++ {\\n\\t\\t\\tt.buffer.WriteString(\\\"\\\\n\\\")\\n\\t\\t}\\n\\t})\\n\\treturn t\\n}\",\n \"func (self *Tween) SetRepeatCounterA(member int) {\\n self.Object.Set(\\\"repeatCounter\\\", member)\\n}\",\n \"func TestAddProductToCatalog2(t *testing.T) {\\n\\t\\n\\te := httpexpect.New(t, API_URL)\\n\\t\\n\\tprintComment(\\\"ADD0002\\\", \\\"Test add product 2 to catalog --> ult_medium Unlimited 2GB $29.90\\\")\\n\\tproduct := map[string]interface{}{\\n\\t\\t\\\"code\\\": \\\"ult_medium\\\",\\n\\t\\t\\\"name\\\": \\\"Unlimited 2GB\\\",\\n\\t\\t\\\"price\\\": 29.90,\\n\\t}\\n\\n\\te.POST(\\\"/products\\\").\\n\\t\\tWithJSON(product).\\n\\t\\tExpect().\\n\\t\\tStatus(http.StatusOK)\\n\\n}\",\n \"func (level *Level) EatApple() {\\n\\t// log.Println(\\\"Apple was eaten\\\")\\n\\n\\t// Increment the size of the snake\\n\\tlevel.snake.IncrementSize()\\n\\n\\t// Increment the game score\\n\\tlevel.game.score++\\n\\n\\t// Move the apple to a new location\\n\\tlevel.apple.position = level.GetRandomPosition()\\n}\",\n \"func add_grocery(a ...string) {\\n\\tfor _, d := range a {\\n\\t\\tg_groceries = append(g_groceries, d)\\n\\t}\\n}\",\n \"func Repeat(v string, repeatNtimes int) string {\\n\\tvar repeated string\\n\\tfor i := 1; i <= repeatNtimes; i++ {\\n\\t\\trepeated += v\\n\\t}\\n\\treturn repeated\\n}\",\n \"func (b *Banana) PrintfFood() {\\n\\tfmt.Println(\\\"I am a fruit of banana\\\")\\n}\",\n \"func updateIceCream(w http.ResponseWriter, r *http.Request) {\\r\\n\\tw.Header().Set(\\\"Content-Type\\\", \\\"application/json\\\")\\r\\n\\tparams := mux.Vars(r)\\r\\n\\tflavourid_int,_ := strconv.Atoi(params[\\\"flavourid\\\"])\\r\\n\\tfor index, item := range flavours {\\r\\n\\t\\tif item.FlavourId == flavourid_int {\\r\\n\\t\\t\\tflavours = append(flavours[:index], flavours[index+1:]...)\\r\\n\\t\\t\\tvar IceCream IceCream\\r\\n\\t\\t\\t_ = json.NewDecoder(r.Body).Decode(&IceCream)\\r\\n\\t\\t\\tIceCream.FlavourId = flavourid_int\\r\\n\\t\\t\\tflavours = append(flavours, IceCream)\\r\\n\\t\\t\\tjson.NewEncoder(w).Encode(IceCream)\\r\\n\\t\\t\\treturn\\r\\n\\t\\t}\\r\\n\\t}\\r\\n}\",\n \"func printRes() {\\n\\tfmt.Printf(\\\"%d %d\\\\n\\\", pAlice, pBob)\\n}\",\n \"func viewLots(a [10]car) {\\n\\tfmt.Println(len(a))\\n}\",\n \"func (arg1 *UConverter) GetStarters(arg2 *UErrorCode) []int\",\n \"func main() {\\n\\tvar name string\\n\\tfriends := make([]string, 3)\\n\\n\\tfor i := 0; name != \\\"q\\\"; i++ {\\n\\t\\tfmt.Print(\\\"Digite o nome de um amigo e digite 'q' para parar: \\\")\\n\\t\\tfmt.Scanf(\\\"%s\\\", &name)\\n\\t\\tif name != \\\"q\\\" {\\n\\t\\t\\tif i < 3 {\\n\\t\\t\\t\\tfriends[i] = name\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t// friends = append(friends, name, \\\"João\\\", \\\"Maria\\\", \\\"Mario\\\")\\n\\t\\t\\t\\tfriends = append(friends, name)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfmt.Printf(\\\"\\\\nVocê tem %v amigo(s) \\\\n\\\", len(friends))\\n\\tfor _, friend := range friends {\\n\\t\\tfmt.Printf(\\\"— %s \\\\n\\\", friend)\\n\\t}\\n\\n\\t// other_type_slice := friends[:3] // Quando nenhum valor é colocado antes do ':' quer dizer que é sempre 0\\n\\n\\tother_type_slice := friends[1:3]\\n\\tfmt.Println(other_type_slice)\\n}\",\n \"func take(theitem, arg int) int {\\n\\t/* cursors(); */\\n\\tlimit := 15 + (c[LEVEL] >> 1)\\n\\tif limit > 26 {\\n\\t\\tlimit = 26\\n\\t}\\n\\tfor i := 0; i < limit; i++ {\\n\\t\\tif iven[i] == 0 {\\n\\t\\t\\tiven[i] = theitem\\n\\t\\t\\tivenarg[i] = arg\\n\\t\\t\\tlimit = 0\\n\\t\\t\\tswitch theitem {\\n\\t\\t\\tcase OPROTRING, ODAMRING, OBELT:\\n\\t\\t\\t\\tlimit = 1\\n\\t\\t\\tcase ODEXRING:\\n\\t\\t\\t\\tc[DEXTERITY] += ivenarg[i] + 1\\n\\t\\t\\t\\tlimit = 1\\n\\t\\t\\tcase OSTRRING:\\n\\t\\t\\t\\tc[STREXTRA] += ivenarg[i] + 1\\n\\t\\t\\t\\tlimit = 1\\n\\t\\t\\tcase OCLEVERRING:\\n\\t\\t\\t\\tc[INTELLIGENCE] += ivenarg[i] + 1\\n\\t\\t\\t\\tlimit = 1\\n\\t\\t\\tcase OHAMMER:\\n\\t\\t\\t\\tc[DEXTERITY] += 10\\n\\t\\t\\t\\tc[STREXTRA] += 10\\n\\t\\t\\t\\tc[INTELLIGENCE] -= 10\\n\\t\\t\\t\\tlimit = 1\\n\\n\\t\\t\\tcase OORBOFDRAGON:\\n\\t\\t\\t\\tc[SLAYING]++\\n\\t\\t\\tcase OSPIRITSCARAB:\\n\\t\\t\\t\\tc[NEGATESPIRIT]++\\n\\t\\t\\tcase OCUBEofUNDEAD:\\n\\t\\t\\t\\tc[CUBEofUNDEAD]++\\n\\t\\t\\tcase ONOTHEFT:\\n\\t\\t\\t\\tc[NOTHEFT]++\\n\\t\\t\\tcase OSWORDofSLASHING:\\n\\t\\t\\t\\tc[DEXTERITY] += 5\\n\\t\\t\\t\\tlimit = 1\\n\\t\\t\\t}\\n\\t\\t\\tlprcat(\\\"\\\\nYou pick up:\\\")\\n\\t\\t\\tsrcount = 0\\n\\t\\t\\tshow3(i)\\n\\t\\t\\tif limit != 0 {\\n\\t\\t\\t\\tbottomline()\\n\\t\\t\\t}\\n\\t\\t\\treturn 0\\n\\t\\t}\\n\\t}\\n\\tlprcat(\\\"\\\\nYou can't carry anything else\\\")\\n\\treturn 1\\n}\",\n \"func cleaner(listy ...int) {\\n\\tfor _, x := range listy {\\n\\t\\tfmt.Println(\\\"Deleting\\\", x)\\n\\t\\tdelete(myGreeting, x)\\n\\t}\\n}\",\n \"func Racer(url1, url2 string) (winner string, err error) {\\n\\treturn ConfigurableRacer(url1, url2, tenSecondTimeout)\\n}\",\n \"func newRelease(a Artist) int {\\n a.Songs++\\n return a.Songs\\n}\",\n \"func (m *Match) printMatch() {\\n\\tfmt.Printf(\\\"%s%s%s%s:%s:%s%s%s%s%s%s\\\\n\\\",\\n\\t\\tcolors.Purple,\\n\\t\\tm.Path,\\n\\t\\tcolors.Restore,\\n\\t\\tcolors.Green,\\n\\t\\tstrconv.Itoa(m.LineNumber),\\n\\t\\tcolors.Restore,\\n\\t\\tstring(m.Line[:m.Match[0]]),\\n\\t\\tcolors.LightRed,\\n\\t\\tstring(m.Line[m.Match[0]:m.Match[1]]),\\n\\t\\tcolors.Restore,\\n\\t\\tstring(m.Line[m.Match[1]:]),\\n\\t)\\n}\",\n \"func MogTar() int {\\r\\n\\treturn rand.Intn(3) + 1\\r\\n}\",\n \"func printColoredSecretJsonObject(secret SecretFound, isFirstSecret *bool) {\\n\\tIndent3 := Indent + Indent + Indent\\n\\n\\tif *isFirstSecret {\\n\\t\\tfmt.Printf(Indent + Indent + \\\"{\\\\n\\\")\\n\\t} else {\\n\\t\\tfmt.Printf(\\\",\\\\n\\\" + Indent + Indent + \\\"{\\\\n\\\")\\n\\t}\\n\\n\\tfmt.Printf(Indent3+\\\"\\\\\\\"Image Layer ID\\\\\\\": %s,\\\\n\\\", jsonMarshal(secret.LayerID))\\n\\tfmt.Printf(Indent3+\\\"\\\\\\\"Matched Rule ID\\\\\\\": %d,\\\\n\\\", secret.RuleID)\\n\\tfmt.Printf(Indent3+\\\"\\\\\\\"Matched Rule Name\\\\\\\": %s,\\\\n\\\", jsonMarshal(secret.RuleName))\\n\\tfmt.Printf(Indent3+\\\"\\\\\\\"Matched Part\\\\\\\": %s,\\\\n\\\", jsonMarshal(secret.PartToMatch))\\n\\tfmt.Printf(Indent3+\\\"\\\\\\\"String to Match\\\\\\\": %s,\\\\n\\\", jsonMarshal(secret.Match))\\n\\tfmt.Printf(Indent3+\\\"\\\\\\\"Signature to Match\\\\\\\": %s,\\\\n\\\", jsonMarshal(secret.Regex))\\n\\tfmt.Printf(Indent3+\\\"\\\\\\\"Severity\\\\\\\": %s,\\\\n\\\", jsonMarshal(secret.Severity))\\n\\tfmt.Printf(Indent3+\\\"\\\\\\\"Severity Score\\\\\\\": %.2f,\\\\n\\\", secret.SeverityScore)\\n\\tfmt.Printf(Indent3+\\\"\\\\\\\"Starting Index of Match in Original Content\\\\\\\": %d,\\\\n\\\", secret.PrintBufferStartIndex)\\n\\tfmt.Printf(Indent3+\\\"\\\\\\\"Relative Starting Index of Match in Displayed Substring\\\\\\\": %d,\\\\n\\\", secret.MatchFromByte)\\n\\tfmt.Printf(Indent3+\\\"\\\\\\\"Relative Ending Index of Match in Displayed Substring\\\\\\\": %d,\\\\n\\\", secret.MatchToByte)\\n\\tfmt.Printf(Indent3+\\\"\\\\\\\"Full File Name\\\\\\\": %s,\\\\n\\\", jsonMarshal(secret.CompleteFilename))\\n\\tmatch := secret.MatchedContents\\n\\tfrom := secret.MatchFromByte\\n\\tto := secret.MatchToByte\\n\\tprefix := removeFirstLastChar(jsonMarshal(match[0:from]))\\n\\tcoloredMatch := color.RedString(removeFirstLastChar(jsonMarshal(string(match[from:to]))))\\n\\tsuffix := removeFirstLastChar(jsonMarshal(match[to:]))\\n\\tfmt.Printf(Indent3+\\\"\\\\\\\"Matched Contents\\\\\\\": \\\\\\\"%s%s%s\\\\\\\"\\\\n\\\", prefix, coloredMatch, suffix)\\n\\n\\tfmt.Printf(Indent + Indent + \\\"}\\\")\\n}\",\n \"func getHashColorBullet(v string) string {\\n\\tif len(v) > 6 {\\n\\t\\tv = strutil.Head(v, 6)\\n\\t}\\n\\n\\treturn fmtc.Sprintf(\\\" {#\\\" + strutil.Head(v, 6) + \\\"}● {!}\\\")\\n}\",\n \"func Verse(v int) string {\\n\\n\\tdays := map[int]string{\\n\\t\\t1: \\\"first\\\",\\n\\t\\t2: \\\"second\\\",\\n\\t\\t3: \\\"third\\\",\\n\\t\\t4: \\\"fourth\\\",\\n\\t\\t5: \\\"fifth\\\",\\n\\t\\t6: \\\"sixth\\\",\\n\\t\\t7: \\\"seventh\\\",\\n\\t\\t8: \\\"eighth\\\",\\n\\t\\t9: \\\"ninth\\\",\\n\\t\\t10: \\\"tenth\\\",\\n\\t\\t11: \\\"eleventh\\\",\\n\\t\\t12: \\\"twelfth\\\",\\n\\t}\\n\\n\\tgifts := map[int]string{\\n\\t\\t1: \\\"a Partridge in a Pear Tree\\\",\\n\\t\\t2: \\\"two Turtle Doves\\\",\\n\\t\\t3: \\\"three French Hens\\\",\\n\\t\\t4: \\\"four Calling Birds\\\",\\n\\t\\t5: \\\"five Gold Rings\\\",\\n\\t\\t6: \\\"six Geese-a-Laying\\\",\\n\\t\\t7: \\\"seven Swans-a-Swimming\\\",\\n\\t\\t8: \\\"eight Maids-a-Milking\\\",\\n\\t\\t9: \\\"nine Ladies Dancing\\\",\\n\\t\\t10: \\\"ten Lords-a-Leaping\\\",\\n\\t\\t11: \\\"eleven Pipers Piping\\\",\\n\\t\\t12: \\\"twelve Drummers Drumming\\\",\\n\\t}\\n\\n\\tgift := \\\"\\\"\\n\\tfor d := v; d >= 1; d-- {\\n\\n\\t\\tif v != 1 && d == 1 {\\n\\t\\t\\tgift = fmt.Sprintf(\\\"%s, and %s\\\", gift, gifts[d])\\n\\t\\t} else {\\n\\t\\t\\tgift = fmt.Sprintf(\\\"%s, %s\\\", gift, gifts[d])\\n\\t\\t}\\n\\t}\\n\\treturn fmt.Sprintf(\\\"On the %s day of Christmas my true love gave to me%s.\\\", days[v], gift)\\n}\",\n \"func (p *Bare) sprintTrice() (n int, err error) {\\n\\tswitch p.trice.Type {\\n\\tcase \\\"TRICE0\\\":\\n\\t\\treturn p.trice0()\\n\\tcase \\\"TRICE8_1\\\":\\n\\t\\treturn p.trice81()\\n\\tcase \\\"TRICE8_2\\\":\\n\\t\\treturn p.trice82()\\n\\tcase \\\"TRICE8_3\\\":\\n\\t\\treturn p.trice83()\\n\\tcase \\\"TRICE8_4\\\":\\n\\t\\treturn p.trice84()\\n\\tcase \\\"TRICE8_5\\\":\\n\\t\\treturn p.trice85()\\n\\tcase \\\"TRICE8_6\\\":\\n\\t\\treturn p.trice86()\\n\\tcase \\\"TRICE8_7\\\":\\n\\t\\treturn p.trice87()\\n\\tcase \\\"TRICE8_8\\\":\\n\\t\\treturn p.trice88()\\n\\tcase \\\"TRICE16_1\\\":\\n\\t\\treturn p.trice161()\\n\\tcase \\\"TRICE16_2\\\":\\n\\t\\treturn p.trice162()\\n\\tcase \\\"TRICE16_3\\\":\\n\\t\\treturn p.trice163()\\n\\tcase \\\"TRICE16_4\\\":\\n\\t\\treturn p.trice164()\\n\\tcase \\\"TRICE32_1\\\":\\n\\t\\treturn p.trice321()\\n\\tcase \\\"TRICE32_2\\\":\\n\\t\\treturn p.trice322()\\n\\tcase \\\"TRICE32_3\\\":\\n\\t\\treturn p.trice323()\\n\\tcase \\\"TRICE32_4\\\":\\n\\t\\treturn p.trice324()\\n\\tcase \\\"TRICE64_1\\\":\\n\\t\\treturn p.trice641()\\n\\tcase \\\"TRICE64_2\\\":\\n\\t\\treturn p.trice642()\\n\\t}\\n\\treturn p.outOfSync(fmt.Sprintf(\\\"Unexpected trice.Type %s\\\", p.trice.Type))\\n}\",\n \"func generateItemNumbers() (int, int, int) {\\n\\tnumComments := (numDoc * 4) / 5\\n\\tnumUsers := (numDoc * 3) / 20\\n\\tnumAssets := numDoc / 20\\n\\treturn numComments, numUsers, numAssets\\n}\",\n \"func (tk Tokens) CombineRepeats() bool {\\n\\tcat := tk.Cat()\\n\\treturn (cat == Literal || cat == Comment || cat == Text || cat == Name)\\n}\",\n \"func main() {\\n\\ts1 := stringAppender(\\\"hoo\\\")\\n\\tfmt.Println(s1(\\\"woo\\\"))\\n\\n\\ts2 := stringAppender(\\\"Orioles\\\")\\n\\tfmt.Println(s2(\\\"Baltimore \\\"))\\n\\n}\",\n \"func prt(args ...interface{}) {\\n\\tfmt.Println(append([]interface{}{\\\"-------------> DEMO\\\"}, args...)...)\\n}\",\n \"func (r Roster) Inject(i int) {\\n\\tfor _, v := range r {\\n\\t\\tv.rating = v.rating + i\\n\\t}\\n}\",\n \"func AddPlanetEndpoint(w http.ResponseWriter, req *http.Request) {\\n var planet Planet\\n _ = json.NewDecoder(req.Body).Decode(&planet)\\n auto_id_ = auto_id_ + 1\\n planet.ID = strconv.FormatInt(int64(auto_id_), 10)\\n planet.Films = GetNumElements(getapiinfo.GetApiInformation(planet.Name))\\n planets_ = append(planets_, planet)\\n json.NewEncoder(w).Encode(planets_)\\n}\",\n \"func TestSizeRepeat(t *testing.T) {\\n\\t// init trie obj\\n\\ttrieObj := trie.NewTrie()\\n\\n\\t// test size with 1st insert\\n\\ttrieObj.Insert(\\\"A\\\")\\n\\tassert.Equal(t, trieObj.Size, 1)\\n\\tassert.Equal(t, trieObj.IsEmpty(), false)\\n\\n\\t// test size with repeated insert\\n\\ttrieObj.Insert(\\\"A\\\")\\n\\tassert.Equal(t, trieObj.Size, 1)\\n\\n\\t// test size with 2nd insert\\n\\ttrieObj.Insert(\\\"ALO\\\")\\n\\tassert.Equal(t, trieObj.Size, 2)\\n\\tassert.Equal(t, trieObj.IsEmpty(), false)\\n\\n\\t// test with repeated insert\\n\\ttrieObj.Insert(\\\"ALO\\\")\\n\\tassert.Equal(t, trieObj.Size, 2)\\n\\n\\t// test with 3rd insert\\n\\ttrieObj.Insert(\\\"ALOHA\\\")\\n\\tassert.Equal(t, trieObj.Size, 3)\\n\\tassert.Equal(t, trieObj.IsEmpty(), false)\\n\\n\\t// test with repeated insert\\n\\ttrieObj.Insert(\\\"ALOHA\\\")\\n\\tassert.Equal(t, trieObj.Size, 3)\\n\\n}\",\n \"func restNote(rest rune, dotted bool, tempo int) []int16 {\\n\\tvar samples int\\n\\tlength := wholeNote + (wholeNote / 100 * 4 * (4 - tempo)) // 4% per tempo unit\\n\\tswitch rest {\\n\\tcase 'W':\\n\\t\\tsamples = length\\n\\tcase 'H':\\n\\t\\tsamples = length / 2\\n\\tcase 'Q':\\n\\t\\tsamples = length / 4\\n\\tcase 'E':\\n\\t\\tsamples = length / 8\\n\\tcase 'S':\\n\\t\\tsamples = length / 16\\n\\tcase 'T':\\n\\t\\tsamples = length / 32\\n\\tcase 'I':\\n\\t\\tsamples = length / 64\\n\\t}\\n\\n\\tif dotted {\\n\\t\\tsamples += samples / 2\\n\\t}\\n\\n\\treturn make([]int16, samples)\\n}\",\n \"func Eat(f Food) {\\n\\tfmt.Printf(\\\"I love %ss!\\\", f.Name)\\n}\",\n \"func (Service) TooManyArguments(a, b string) {\\n}\",\n \"func TestAddTwoDeleteScond(t *testing.T) {\\n\\ttarget := teaser.New()\\n\\tm1id := target.Add(\\\"msg1\\\")\\n\\tm2id := target.Add(\\\"msg2\\\")\\n\\n\\t{\\n\\t\\tdeleted := target.Delete(m2id)\\n\\t\\tassertDeleted(m2id, deleted, t)\\n\\t}\\n\\n\\t{\\n\\t\\tnextHash, m1vid := target.View()\\n\\t\\tassertMessageId(m1id, m1vid, t)\\n\\t\\tassertMessageHash(\\\"\\\", nextHash, t)\\n\\t}\\n}\",\n \"func plusUserID(step int64) int64 {\\n\\tuserid += step\\n\\treturn userid\\n}\",\n \"func generateLogLine(id int) string {\\n\\tmethod := httpMethods[rand.Intn(len(httpMethods))]\\n\\tnamespace := namespaces[rand.Intn(len(namespaces))]\\n\\n\\tpodName := rand.String(rand.IntnRange(3, 5))\\n\\turl := fmt.Sprintf(\\\"/api/v1/namespaces/%s/pods/%s\\\", namespace, podName)\\n\\tstatus := rand.IntnRange(200, 600)\\n\\n\\treturn fmt.Sprintf(\\\"%d %s %s %d\\\", id, method, url, status)\\n}\",\n \"func viewCar(a [10]car, printLots func(a [10]car)) {\\n\\tfor i := 0; i < lots; i++ {\\n\\t\\tfmt.Println(a[i].color, a[i].cost)\\n\\t}\\n\\tprintLots(a)\\n}\",\n \"func newRelease(a *Artist) int {\\n a.Songs++\\n return a.Songs\\n}\",\n \"func (s *stepConstructor) RepeatStep() {\\n\\ts.CurrentStep--\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.48526704","0.45791003","0.45148775","0.45120233","0.45096675","0.4484106","0.44114172","0.44073385","0.43790644","0.4351559","0.43006048","0.42932254","0.42848495","0.4264322","0.42597494","0.42453548","0.4244313","0.42309946","0.422844","0.4227956","0.4188795","0.41744077","0.417175","0.41701224","0.4147963","0.4130036","0.4118443","0.41147417","0.40997154","0.4093644","0.40845743","0.4072336","0.4060472","0.40575415","0.40428293","0.40391344","0.4033631","0.4014582","0.4012665","0.40090466","0.40036762","0.39963773","0.39931825","0.3993081","0.3992702","0.39899758","0.39865008","0.3986126","0.398449","0.3978036","0.3972328","0.3972197","0.3967863","0.39673063","0.3966417","0.39633983","0.39629227","0.39622864","0.3957854","0.395638","0.39556938","0.39482585","0.39375156","0.39374155","0.39374065","0.39253992","0.3921235","0.39207423","0.3919707","0.39172396","0.3916506","0.39150208","0.3914878","0.3910657","0.39066902","0.39059678","0.38900083","0.38796255","0.38784528","0.38682276","0.38643077","0.38618827","0.38614306","0.38595238","0.38584694","0.38571963","0.38511485","0.3845322","0.3838638","0.38361806","0.38358864","0.38343126","0.3834312","0.38262457","0.3826142","0.38233343","0.3821757","0.3820973","0.38199952","0.3818266","0.38171113"],"string":"[\n \"0.48526704\",\n \"0.45791003\",\n \"0.45148775\",\n \"0.45120233\",\n \"0.45096675\",\n \"0.4484106\",\n \"0.44114172\",\n \"0.44073385\",\n \"0.43790644\",\n \"0.4351559\",\n \"0.43006048\",\n \"0.42932254\",\n \"0.42848495\",\n \"0.4264322\",\n \"0.42597494\",\n \"0.42453548\",\n \"0.4244313\",\n \"0.42309946\",\n \"0.422844\",\n \"0.4227956\",\n \"0.4188795\",\n \"0.41744077\",\n \"0.417175\",\n \"0.41701224\",\n \"0.4147963\",\n \"0.4130036\",\n \"0.4118443\",\n \"0.41147417\",\n \"0.40997154\",\n \"0.4093644\",\n \"0.40845743\",\n \"0.4072336\",\n \"0.4060472\",\n \"0.40575415\",\n \"0.40428293\",\n \"0.40391344\",\n \"0.4033631\",\n \"0.4014582\",\n \"0.4012665\",\n \"0.40090466\",\n \"0.40036762\",\n \"0.39963773\",\n \"0.39931825\",\n \"0.3993081\",\n \"0.3992702\",\n \"0.39899758\",\n \"0.39865008\",\n \"0.3986126\",\n \"0.398449\",\n \"0.3978036\",\n \"0.3972328\",\n \"0.3972197\",\n \"0.3967863\",\n \"0.39673063\",\n \"0.3966417\",\n \"0.39633983\",\n \"0.39629227\",\n \"0.39622864\",\n \"0.3957854\",\n \"0.395638\",\n \"0.39556938\",\n \"0.39482585\",\n \"0.39375156\",\n \"0.39374155\",\n \"0.39374065\",\n \"0.39253992\",\n \"0.3921235\",\n \"0.39207423\",\n \"0.3919707\",\n \"0.39172396\",\n \"0.3916506\",\n \"0.39150208\",\n \"0.3914878\",\n \"0.3910657\",\n \"0.39066902\",\n \"0.39059678\",\n \"0.38900083\",\n \"0.38796255\",\n \"0.38784528\",\n \"0.38682276\",\n \"0.38643077\",\n \"0.38618827\",\n \"0.38614306\",\n \"0.38595238\",\n \"0.38584694\",\n \"0.38571963\",\n \"0.38511485\",\n \"0.3845322\",\n \"0.3838638\",\n \"0.38361806\",\n \"0.38358864\",\n \"0.38343126\",\n \"0.3834312\",\n \"0.38262457\",\n \"0.3826142\",\n \"0.38233343\",\n \"0.3821757\",\n \"0.3820973\",\n \"0.38199952\",\n \"0.3818266\",\n \"0.38171113\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":986,"cells":{"query":{"kind":"string","value":"/ StepsOfKnight : 8 StepsOfKnight2 : 8"},"document":{"kind":"string","value":"func DistNearestFillUtil(arr [][]int, maxCol int, maxRow int, currCol int, currRow int, traversed [][]int, dist int) {\n\t// Range check\n\tif currCol < 0 || currCol >= maxCol || currRow < 0 || currRow >= maxRow {\n\t\treturn\n\t}\n\n\t// Traversable if there is a better distance.\n\tif traversed[currCol][currRow] <= dist {\n\t\treturn\n\t}\n\n\t// Update distance.\n\ttraversed[currCol][currRow] = dist\n\n\tdir := [][]int{{-1, 0}, {1, 0}, {0, -1}, {0, 1}}\n\n\t// Traverse in each direction.\n\tfor i := 0; i < 4; i++ {\n\t\tx := currCol + dir[i][0]\n\t\ty := currRow + dir[i][1]\n\t\tDistNearestFillUtil(arr, maxCol, maxRow, x, y, traversed, dist+1)\n\t}\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func StepsOfKnightUtil(size int, currCol int, currRow int, traversed [][]int, dist int) {\n\t// Range check\n\tif currCol < 0 || currCol >= size || currRow < 0 || currRow >= size {\n\t\treturn\n\t}\n\n\t// Traverse if not already traversed.\n\tif traversed[currCol][currRow] <= dist {\n\t\treturn\n\t}\n\n\tdir := [][]int{{-2, -1}, {-2, 1}, {2, -1}, {2, 1}, {-1, -2}, {1, -2}, {-1, 2}, {1, 2}}\n\ttraversed[currCol][currRow] = dist\n\n\tfor i := 0; i < 8; i++ {\n\t\tx := currCol + dir[i][0]\n\t\ty := currRow + dir[i][1]\n\t\tStepsOfKnightUtil(size, x, y, traversed, dist+1)\n\t}\n}","func minKnightMoves(ex int, ey int) int {\r\n\tif ex == 0 && ey == 0 {\r\n\t\treturn 0\r\n\t}\r\n\tq := [][]int{}\r\n\tq = append(q, []int{0, 0})\r\n\tdir := [][]int{{1, 2}, {2, 1}, {2, -1}, {1, -2}, {-1, 2}, {-2, 1}, {-1, -2}, {-2, -1}}\r\n\tsteps := 0\r\n\tseen := map[int]map[int]bool{0: map[int]bool{0: true}}\r\n\t// BFS loop\r\n\tfor len(q) > 0 {\r\n\t\tsteps++\r\n\t\tn := len(q)\r\n\t\tfor i := 0; i < n; i++ {\r\n\t\t\tt := q[0]\r\n\t\t\tq = q[1:]\r\n\t\t\tfor _, d := range dir {\r\n\t\t\t\tnx := t[0] + d[0]\r\n\t\t\t\tny := t[1] + d[1]\r\n\t\t\t\tif nx == ex && ny == ey {\r\n\t\t\t\t\treturn steps\r\n\t\t\t\t}\r\n\t\t\t\tif _, exists := seen[nx]; !exists {\r\n\t\t\t\t\tseen[nx] = map[int]bool{}\r\n\t\t\t\t}\r\n\t\t\t\tif _, exists := seen[nx][ny]; !exists &&\r\n\t\t\t\t\t(nx*ex >= 0 && ny*ey >= 0 || steps < 3) {\r\n\t\t\t\t\tseen[nx][ny] = true\r\n\t\t\t\t\tq = append(q, []int{nx, ny})\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\treturn -1\r\n}","func findSteps(lines [][]Point) []int {\n\tline1 := lines[0]\n\tline2 := lines[1]\n\n\tline1Size := len(lines[0])\n\tline2Size := len(lines[1])\n\tvar steps []int\n\n\tif line1Size == line2Size {\n\t\tfor i := 0; i <= line1Size-2; i++ {\n\t\t\tfor j := 0; j <= line1Size-2; j++ {\n\t\t\t\tnumSteps := calculateSteps(line1, line2, i, j)\n\t\t\t\tif numSteps != 0 {\n\t\t\t\t\tsteps = append(steps, numSteps)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else if line1Size > line2Size {\n\t\tfor i := 0; i <= line1Size-2; i++ {\n\t\t\tfor j := 0; j <= line2Size-2; j++ {\n\t\t\t\tnumSteps := calculateSteps(line1, line2, i, j)\n\t\t\t\tif numSteps != 0 {\n\t\t\t\t\tsteps = append(steps, numSteps)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor i := 0; i < line2Size-2; i++ {\n\t\t\tfor j := 0; j < line1Size-2; j++ {\n\t\t\t\tnumSteps := calculateSteps(line1, line2, i, j)\n\t\t\t\tif numSteps != 0 {\n\t\t\t\t\tsteps = append(steps, numSteps)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn steps\n}","func knightDialer(n int) int {\n\tif n == 1 {\n\t\t// the only case where 5 is a valid starting position\n\t\treturn 10\n\t}\n\n\tconst mod = 1e9 + 7\n\tr := [10]int{1, 1, 1, 1, 1, 0, 1, 1, 1, 1}\n\tfor n > 1 {\n\t\tnext := [10]int{\n\t\t\t(r[4] + r[6]) % mod, // 0\n\t\t\t(r[6] + r[8]) % mod, // 1\n\t\t\t(r[7] + r[9]) % mod, // 2\n\t\t\t(r[4] + r[8]) % mod, // 3\n\t\t\t(r[3] + r[9] + r[0]) % mod, // 4\n\t\t\t0,\n\t\t\t(r[1] + r[7] + r[0]) % mod, // 6\n\t\t\t(r[2] + r[6]) % mod, // 7\n\t\t\t(r[1] + r[3]) % mod, // 8\n\t\t\t(r[2] + r[4]) % mod, // 9\n\t\t}\n\t\tr = next\n\t\tn--\n\t}\n\n\ts := 0\n\tfor _, v := range r {\n\t\ts = (s + v) % mod\n\t}\n\treturn s\n}","func KnightMoves(b Board, row, col int, recurse bool) (possible []ValidMove) {\n\tpossible = tryAndAppend(possible, b, row, col, -2, -1, recurse) // up-left\n\tpossible = tryAndAppend(possible, b, row, col, -2, 1, recurse) // up-right\n\tpossible = tryAndAppend(possible, b, row, col, 2, -1, recurse) // down-left\n\tpossible = tryAndAppend(possible, b, row, col, 2, 1, recurse) // down-right\n\n\tpossible = tryAndAppend(possible, b, row, col, -1, -2, recurse) // left-up\n\tpossible = tryAndAppend(possible, b, row, col, 1, -2, recurse) // left-down\n\tpossible = tryAndAppend(possible, b, row, col, -1, 2, recurse) // right-up\n\tpossible = tryAndAppend(possible, b, row, col, 1, 2, recurse) // right-down\n\n\treturn\n}","func countDiag(mygame game.Game, playerNum int, streakLength int) int {\n\tcount := 0 //overall # of streaks of n length\n\tcurrCount := 0 //this needs to be exactly n so that we don't count streaks of 2 as streaks of 3\n\tsymbol := mygame.PlayerSymbols[playerNum]\n\t//downwards to the right first\n\t//increment over every square\n\tfor i := 0; i < game.BoardHeight; i++ { //rows\n\t\tfor j := 0; j < game.BoardWidth; j++ { //columns\n\t\t\tif mygame.GameBoard[i][j].Active {\n\t\t\t\t//check that the symbol matches\n\t\t\t\tif mygame.GameBoard[i][j].Symbol == symbol {\n\t\t\t\t\t//make sure piece up and left to it isn't the same symbol\n\t\t\t\t\t//so that we're not double counting\n\t\t\t\t\tif i == 0 || j == 0 || mygame.GameBoard[i-1][j-1].Symbol != symbol {\n\t\t\t\t\t\tcurrCount++\n\t\t\t\t\t\tfor k := 1; k < 4; k++ {\n\t\t\t\t\t\t\tif i+k < game.BoardHeight && j+k < game.BoardWidth { //make sure we don't go off board\n\t\t\t\t\t\t\t\tif mygame.GameBoard[i+k][j+k].Symbol == symbol {\n\t\t\t\t\t\t\t\t\tcurrCount++\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tbreak //break if different symbol\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t//only increment count if currentcount matches n\n\t\t\t\t\t\tif currCount == streakLength {\n\t\t\t\t\t\t\tcount++\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcurrCount = 0 //reset currCount\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t}\n\t//now downwards to the left\n\tfor i := 0; i < game.BoardHeight; i++ { //rows\n\t\tfor j := 0; j < game.BoardWidth; j++ { //columns\n\t\t\tif mygame.GameBoard[i][j].Active {\n\t\t\t\t//check that the symbol matches\n\t\t\t\tif mygame.GameBoard[i][j].Symbol == symbol {\n\t\t\t\t\t//make sure piece up and left to it isn't the same symbol\n\t\t\t\t\t//so that we're not double counting\n\t\t\t\t\tif i == 0 || j == game.BoardWidth-1 || mygame.GameBoard[i-1][j+1].Symbol != symbol {\n\t\t\t\t\t\tcurrCount++\n\t\t\t\t\t\tfor k := 1; k < 4; k++ {\n\t\t\t\t\t\t\tif i+k < game.BoardHeight && j-k >= 0 { //make sure we don't go off board\n\t\t\t\t\t\t\t\tif mygame.GameBoard[i+k][j-k].Symbol == symbol {\n\t\t\t\t\t\t\t\t\tcurrCount++\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tbreak //break if different symbol\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t//only increment count if currentcount matches n\n\t\t\t\t\t\tif currCount == streakLength {\n\t\t\t\t\t\t\tcount++\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcurrCount = 0 //reset currCount\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t}\n\treturn count\n}","func Day16Part2(input []string) int {\n\tresult := 1\n\tvalidCond := make(map[int][]string)\n\t// validValue := []int{}\n\tmyTicket := []int{}\n\tvalidTickets := [][]int{}\n\tpossibleFields := [][]string{}\n\tcondRE := regexp.MustCompile(`\\d+-\\d+`)\n\tsteps := 1\n\tfor _, item := range input {\n\t\tcmd := strings.Split(item, \":\")\n\t\tswitch cmd[0] {\n\t\tcase \"departure location\", \"departure station\", \"departure platform\", \"departure track\", \"departure date\", \"departure time\", \"arrival location\", \"arrival station\", \"arrival platform\", \"arrival track\", \"class\", \"duration\", \"price\", \"route\", \"row\", \"seat\", \"train\", \"type\", \"wagon\", \"zone\":\n\t\t\tsteps = 1\n\t\tcase \"your ticket\":\n\t\t\tsteps = 2\n\t\tcase \"nearby tickets\":\n\t\t\tsteps = 3\n\t\tcase \"\":\n\t\t\tsteps = 0\n\t\t}\n\t\tswitch steps {\n\t\tcase 1:\n\t\t\tfor _, rangeStr := range condRE.FindAllStringSubmatch(item, -1) {\n\t\t\t\ts, _ := strconv.Atoi(strings.Split(rangeStr[0], \"-\")[0])\n\t\t\t\te, _ := strconv.Atoi(strings.Split(rangeStr[0], \"-\")[1])\n\t\t\t\tfor i := s; i < e+1; i++ {\n\t\t\t\t\tvalidCond[i] = append(validCond[i], cmd[0])\n\t\t\t\t}\n\t\t\t}\n\t\tcase 2:\n\t\t\tif item == \"your ticket:\" {\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\tfor _, value := range strings.Split(item, \",\") {\n\t\t\t\tv, _ := strconv.Atoi(value)\n\t\t\t\tmyTicket = append(myTicket, v)\n\t\t\t}\n\n\t\tcase 3:\n\t\t\tif item == \"nearby tickets:\" {\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\tcheck := true\n\t\t\tticketValues := strings.Split(item, \",\")\n\t\t\t// maze := [][]string{}\n\t\t\tvalidTicket := []int{}\n\t\t\tfor _, value := range ticketValues {\n\t\t\t\tv, _ := strconv.Atoi(value)\n\t\t\t\tif _, ok := validCond[v]; !ok {\n\t\t\t\t\tcheck = false\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif check {\n\t\t\t\tfor _, value := range strings.Split(item, \",\") {\n\t\t\t\t\tv, _ := strconv.Atoi(value)\n\t\t\t\t\tvalidTicket = append(validTicket, v)\n\t\t\t\t}\n\t\t\t\tvalidTickets = append(validTickets, validTicket)\n\t\t\t}\n\t\t}\n\t}\n\n\tfor j := 0; j < len(validTickets[0]); j++ {\n\t\tpossibleField := []string{}\n\t\tfor i := 0; i < len(validTickets); i++ {\n\t\t\tv := validTickets[i][j]\n\t\t\tf, _ := validCond[v]\n\t\t\tif len(possibleField) == 0 {\n\t\t\t\tpossibleField = append(possibleField, f...)\n\t\t\t} else {\n\t\t\t\tpossibleField = intersection(possibleField, f)\n\t\t\t}\n\t\t}\n\t\tpossibleFields = append(possibleFields, possibleField)\n\t}\n\n\tcount := 0\n\tfor count < len(possibleFields) {\n\t\t// fmt.Printf(\"%#v\\n\", possibleFields)\n\t\tcount = 0\n\t\tfor i := 0; i < len(possibleFields); i++ {\n\t\t\tif len(possibleFields[i]) == 1 {\n\t\t\t\tcount++\n\t\t\t\tfor j := 0; j < len(possibleFields); j++ {\n\t\t\t\t\tif i != j {\n\t\t\t\t\t\tidx := -1\n\t\t\t\t\t\tfor ii, v := range possibleFields[j] {\n\t\t\t\t\t\t\tif v == possibleFields[i][0] {\n\t\t\t\t\t\t\t\tidx = ii\n\t\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif idx == -1 {\n\t\t\t\t\t\t\tcontinue\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif idx+1 >= len(possibleFields[j]) {\n\t\t\t\t\t\t\tpossibleFields[j] = possibleFields[j][:idx]\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tpossibleFields[j] = append(possibleFields[j][:idx], possibleFields[j][idx+1:]...)\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t// fmt.Printf(\"%#v\\n\", possibleFields)\n\tfor i, v := range possibleFields {\n\t\tif strings.Contains(v[0], \"departure\") {\n\t\t\tresult *= myTicket[i]\n\t\t}\n\t}\n\n\treturn result\n}","func (s Solution) Steps() string {\n\treturn s.text\n}","func waysToClimbStaircase(numberOfStairs int, possibleSteps []int) int {\n\tif numberOfStairs <= 0 {\n\t\treturn 0\n\t}\n\n\tpossibleWays := 0\n\tfor _, step := range possibleSteps {\n\t\tif numberOfStairs-step == 0 {\n\t\t\tpossibleWays++\n\t\t}\n\t}\n\tfor _, step := range possibleSteps {\n\t\tpossibleWays += waysToClimbStaircase(numberOfStairs-step, possibleSteps)\n\t}\n\n\treturn possibleWays\n}","func Day8Part1(filepath string) any {\n\tvar res int\n\n\t// open file\n\treadFile, _ := os.Open(filepath)\n\n\t// read line\n\tfileScanner := bufio.NewScanner(readFile)\n\tfileScanner.Split(bufio.ScanLines)\n\n\t// parse map in to [][]int\n\ttreeMap := parseMap(fileScanner)\n\t// fmt.Println(treeMap)\n\n\t// init visible trees 2D array\n\tvisible := make([][]bool, len(treeMap))\n\tfor i := range visible {\n\t\tvisible[i] = make([]bool, len(treeMap[0]))\n\t}\n\n\t// look from left to r\n\tfor i := range treeMap {\n\t\tmax := 0\n\t\tfor j := range treeMap[0] {\n\t\t\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\n\t\t\t\tvisible[i][j] = true\n\t\t\t\tmax = treeMap[i][j]\n\t\t\t}\n\t\t}\n\t}\n\n\t// look from right to l\n\tfor i := range treeMap {\n\t\tmax := 0\n\t\tfor j := len(treeMap[0]) - 1; j >= 0; j-- {\n\t\t\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\n\t\t\t\tvisible[i][j] = true\n\t\t\t\tmax = treeMap[i][j]\n\t\t\t}\n\t\t}\n\t}\n\n\t// look from up to down\n\tfor j := 0; j <= len(treeMap[0])-1; j++ {\n\t\tmax := 0\n\t\tfor i := 0; i <= len(treeMap)-1; i++ {\n\t\t\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\n\t\t\t\tvisible[i][j] = true\n\t\t\t\tmax = treeMap[i][j]\n\t\t\t}\n\t\t}\n\t}\n\n\t// look from down to up\n\tfor j := 0; j <= len(treeMap[0])-1; j++ {\n\t\tmax := 0\n\t\tfor i := len(treeMap) - 1; i >= 0; i-- {\n\t\t\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\n\t\t\t\tvisible[i][j] = true\n\t\t\t\tmax = treeMap[i][j]\n\t\t\t}\n\t\t}\n\t}\n\n\t// traverse visible trees 2D array and count visibles\n\tfor i := range visible {\n\t\tfor j := range visible[i] {\n\t\t\tif visible[i][j] {\n\t\t\t\tres++\n\t\t\t}\n\t\t}\n\t}\n\n\treturn res\n}","func testOneScenario(start, goal Node, algo func (start, goal Node) []Node, trials int) ([]Node, int, float64, float64, int) {\n\tvar path []Node\n\n\t// Get path and average runtime\n\ttotalRuntime := 0.0\n\tfor i := 0; i < trials; i++ {\n\t\tbefore := time.Now()\n\t\tpath = algo(start, goal)\n\t\tafter := time.Now()\n\t\telapsed := after.Sub(before)\n\t\ttotalRuntime += float64(elapsed.Milliseconds())\n\t}\n\tavgRuntime := int(math.Round(totalRuntime/float64(trials)))\n\n\t// Calculate path length\n\tpathLen := 0.0\n\tfor i := 0; i < len(path)-1; i++ {\n\t\tn1 := path[i]\n\t\tn2 := path[i+1]\n\t\tpathLen += StraightLineDist(n1, n2)\n\t}\n\n\t// Calculate turn count and average angle of turns\n\tturns := 0\n\tavgAngle := 0.0\n\tfor i := 0; i < len(path)-2; i++ {\n\t\tn1 := path[i]\n\t\tn2 := path[i+1]\n\t\tn3 := path[i+2]\n\t\t// There are two vectors (n1,n2) and (n2,n3)\n\t\tv1_x, v1_y := float64(n2.X - n1.X), float64(n2.Y - n1.Y)\n\t\tv2_x, v2_y := float64(n3.X - n2.X), float64(n3.Y - n2.Y)\n\t\tdot := v1_x * v2_x + v1_y * v2_y\n\t\tv1_len := math.Sqrt(v1_x * v1_x + v1_y * v1_y)\n\t\tv2_len := math.Sqrt(v2_x * v2_x + v2_y * v2_y)\n\t\ta := dot / (v1_len * v2_len)\n\t\ta = math.Max(-1, math.Min(1, a)) // Rounding errors may produce values outside [-1,1] so clamp it.\n\t\tangle := math.Acos(a)\n\t\tif angle >= 0.001 {\n\t\t\t// We are turning at node n1\n\t\t\tavgAngle += angle\n\t\t\tturns++\n\t\t}\n\t}\n\n\tif turns > 0 {\n\t\tavgAngle /= float64(turns)\n\t}\n\n\treturn path, turns, pathLen, avgAngle, avgRuntime\n}","func KnightAttacks(square Square) Bitboard {\n\treturn knightTable[square]\n}","func findPaths2(m int, n int, maxMove int, startRow int, startColumn int) int {\n\t// 값이 클 수 있어 modulo 모듈 값을 리턴하라고 문제에 써있음\n\tmodulo := 1000000000 + 7\n\tif startRow < 0 || startRow == m ||\n\t\tstartColumn < 0 || startColumn == n {\n\t\treturn 1\n\t}\n\tif maxMove == 0 {\n\t\treturn 0\n\t}\n\t// 4방향 각각에 대해서 boundary 를 벗어나는지 경우들을 모두 더한다.\n\treturn findPaths(m, n, maxMove-1, startRow-1, startColumn)%modulo +\n\t\tfindPaths(m, n, maxMove-1, startRow, startColumn-1)%modulo +\n\t\tfindPaths(m, n, maxMove-1, startRow+1, startColumn)%modulo +\n\t\tfindPaths(m, n, maxMove-1, startRow, startColumn+1)%modulo\n}","func part2(mem []int64) int64 {\n\tg := readGrid(mem)\n\tvar r robot\n\tfor y, row := range g {\n\t\tfor x, c := range row {\n\t\t\tif strings.ContainsRune(\"^v<>\", c) {\n\t\t\t\tr = robot{point{x, y}, north}\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n\n\tprev := r.pos.move(west)\n\tpath := []direction{east}\n\tfor {\n\t\tadj := adjacent(g, r.pos)\n\t\tif len(path) > 2 && len(adj) == 1 {\n\t\t\tbreak\n\t\t}\n\t\tif 0 < len(adj) && len(adj) <= 2 {\n\t\t\tnext := adj[0]\n\t\t\tif len(adj) == 2 && adj[0] == prev {\n\t\t\t\tnext = adj[1]\n\t\t\t}\n\t\t\tif r.pos.x < next.x {\n\t\t\t\tr.dir = east\n\t\t\t}\n\t\t\tif r.pos.x > next.x {\n\t\t\t\tr.dir = west\n\t\t\t}\n\t\t\tif r.pos.y < next.y {\n\t\t\t\tr.dir = south\n\t\t\t}\n\t\t\tif r.pos.y > next.y {\n\t\t\t\tr.dir = north\n\t\t\t}\n\t\t}\n\t\tpath = append(path, r.dir)\n\t\tprev = r.pos\n\t\tr.move()\n\t}\n\n\tqueue := []step{{0, right}}\n\tfor i, d := range path[1:] {\n\t\trot := path[i].rotation(d)\n\t\tif len(queue) > 0 && rot == none {\n\t\t\tqueue[len(queue)-1].n++\n\t\t\tcontinue\n\t\t}\n\t\tqueue = append(queue, step{1, rot})\n\t}\n\n\tvar out string\n\tfor _, v := range queue {\n\t\tout += v.String() + \",\"\n\t}\n\tfmt.Println(out)\n\n\tp := newProgram(mem)\n\tp.memory[0] = 2\n\t// I have to be honest. I used my editors \"highlight other occurrences\"\n\t// feature on the previous output.\n\tin := strings.Join([]string{\n\t\t\"A,B,A,C,A,B,C,C,A,B\",\n\t\t\"R,8,L,10,R,8\",\n\t\t\"R,12,R,8,L,8,L,12\",\n\t\t\"L,12,L,10,L,8\",\n\t\t\"n\",\n\t\t\"\",\n\t}, \"\\n\")\n\tfor _, c := range in {\n\t\tp.input = append(p.input, int64(c))\n\t}\n\tres, err := p.run()\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\treturn res[len(res)-1]\n}","func Steps(turns float64) int {\n\treturn int(MotorSteps * turns)\n}","func (i *BaseInhabitant) NextStep(relWatcher cr.RelativeWatcher) (int, int) {\n\ti.days++\n\t// iterate over fields to find enemy\n\tfor rH := 2; rH >= -2; rH-- {\n\t\tfor rW := 2; rW >= -2; rW-- {\n\t\t\tif rH == 0 && rW == 0 {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif i.IsEnemy(relWatcher(rH, rW)) {\n\t\t\t\t// found enemy, trying to find safe field\n\t\t\t\tisHPositive := rH >= 0\n\t\t\t\tisWPositive := rW >= 0\n\t\t\t\tvar nextH, nextW int\n\n\t\t\t\tif isHPositive && rH != 0 {\n\t\t\t\t\tnextH = -1\n\t\t\t\t} else if !isHPositive && rH != 0 {\n\t\t\t\t\tnextH = 1\n\t\t\t\t}\n\n\t\t\t\tif isWPositive && rW != 0 {\n\t\t\t\t\tnextW = -1\n\t\t\t\t} else if !isWPositive && rW != 0 {\n\t\t\t\t\tnextW = 1\n\t\t\t\t}\n\n\t\t\t\tif i.IsSafeField(relWatcher, nextH, nextW) {\n\t\t\t\t\treturn nextH, nextW\n\t\t\t\t}\n\t\t\t\t// try find safe place\n\n\t\t\t\tif rH == 0 && i.IsSafeField(relWatcher, -1, nextW) {\n\t\t\t\t\treturn -1, nextW\n\t\t\t\t}\n\n\t\t\t\tif rH == 0 && i.IsSafeField(relWatcher, 1, nextW) {\n\t\t\t\t\treturn 1, nextW\n\t\t\t\t}\n\n\t\t\t\tif rW == 0 && i.IsSafeField(relWatcher, nextH, -1) {\n\t\t\t\t\treturn nextH, -1\n\t\t\t\t}\n\n\t\t\t\tif rW == 0 && i.IsSafeField(relWatcher, nextH, 1) {\n\t\t\t\t\treturn nextH, 1\n\t\t\t\t}\n\n\t\t\t\tif isHPositive && i.IsSafeField(relWatcher, nextH, nextW-1) {\n\t\t\t\t\treturn nextH, nextW - 1\n\t\t\t\t}\n\n\t\t\t\tif isHPositive && i.IsSafeField(relWatcher, nextH, nextW+1) {\n\t\t\t\t\treturn nextH, nextW + 1\n\t\t\t\t}\n\n\t\t\t\tif isWPositive && i.IsSafeField(relWatcher, nextH-1, nextW) {\n\t\t\t\t\treturn nextH - 1, nextW\n\t\t\t\t}\n\n\t\t\t\tif isHPositive && i.IsSafeField(relWatcher, nextH+1, nextW) {\n\t\t\t\t\treturn nextH + 1, nextW\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\t}\n\n\treturn rand.Intn(i.maxMove+i.maxMove+1) - i.maxMove, rand.Intn(i.maxMove+i.maxMove+1) - i.maxMove\n}","func (g *Game) Step() {\n\n\trows, cols := int(g.rows), int(g.cols)\n\tvar neighbors int\n\n\t//Swapping the boards allows us to overwrite the state from two turns ago, while reading the state from last turn\n\tg.state, g.prevState = g.prevState, g.state\n\n\t//Iterate over every row, skipping the border rows\n\tfor y := 1; y <= rows; y++ {\n\t\t//Cell by cell, skipping borders\n\t\tfor x := 1; x <= cols; x++ {\n\n\t\t\t// Count the neighbors\n\t\t\tneighbors = 0\n\t\t\tfor i := 0; i < 8; i++ {\n\t\t\t\tif g.prevState[offset[i].y+y][offset[i].x+x].Alive {\n\t\t\t\t\tneighbors++\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t/*Implement game of life ruleset:\n\t\t\t With exactly 2 neighbors: Alive cell stays alive and dead cell stays dead\n\t\t\t With exactly 3 neighbors: Alive cell stays alive and dead cell also lives\n\t\t\t Any other number of neighbors: Alive cell dies and dead cell stays dead\n\t\t\t*/\n\t\t\tif neighbors == 2 {\n\t\t\t\tg.state[y][x] = g.prevState[y][x]\n\t\t\t} else if neighbors == 3 {\n\t\t\t\tg.state[y][x].Alive = true\n\t\t\t} else {\n\t\t\t\tg.state[y][x].Alive = false\n\t\t\t}\n\n\t\t}\n\t}\n\n\t//Update the copy\n\tfor y := 0; y < int(g.rows); y++ {\n\t\tfor x := 0; x < int(g.cols); x++ {\n\t\t\t//+1 to avoid copying the border cells\n\t\t\tg.board[y][x] = g.state[y+1][x+1]\n\t\t}\n\t}\n\n\treturn\n\n}","func findPaths2(m int, n int, maxMove int, startRow int, startColumn int) int {\n\tprevGrid := make([][]int, m)\n\tnextGrid := make([][]int, m)\n\tfor i := 0; i < m; i++ {\n\t\tprevGrid[i] = make([]int, n)\n\t\tnextGrid[i] = make([]int, n)\n\t}\n\n\tres := 0\n\tprevGrid[startRow][startColumn] = 1\n\n\tfor move := 0; move < maxMove; move++ {\n\t\tfor x := 0; x < m; x++ {\n\t\t\tfor y := 0; y < n; y++ {\n\t\t\t\tv := prevGrid[x][y] % modulo\n\t\t\t\tif v == 0 {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\n\t\t\t\tprevGrid[x][y] = 0\n\n\t\t\t\tif x == 0 {\n\t\t\t\t\tres += v\n\t\t\t\t} else {\n\t\t\t\t\tnextGrid[x-1][y] += v\n\t\t\t\t}\n\n\t\t\t\tif x == m-1 {\n\t\t\t\t\tres += v\n\t\t\t\t} else {\n\t\t\t\t\tnextGrid[x+1][y] += v\n\t\t\t\t}\n\n\t\t\t\tif y == 0 {\n\t\t\t\t\tres += v\n\t\t\t\t} else {\n\t\t\t\t\tnextGrid[x][y-1] += v\n\t\t\t\t}\n\n\t\t\t\tif y == n-1 {\n\t\t\t\t\tres += v\n\t\t\t\t} else {\n\t\t\t\t\tnextGrid[x][y+1] += v\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprevGrid, nextGrid = nextGrid, prevGrid\n\t}\n\n\treturn res % modulo\n}","func numWays(steps int, arrLen int) int {\n\tfor i := 2; i <= 500; i += 2 {\n\t\tresult := calcWays(0, i, i/2, i/2, arrLen-1)\n\t\tcache[i] = result\n\t\tpp.Println(i, result)\n\t}\n\n\treturn calcWays(0, steps, steps/2, steps/2, arrLen-1)\n\t// Since the answer may be too large, return it modulo 10^9 + 7.\n\t// return 0\n}","func countHoriz(mygame game.Game, playerNum int, streakLength int) int {\n\tcount := 0 //overall # of streaks of n length\n\tcurrCount := 0 //this needs to be exactly n so that we don't count streaks of 2 as streaks of 3\n\tsymbol := mygame.PlayerSymbols[playerNum]\n\t//increment over every square\n\tfor i := 0; i < game.BoardHeight; i++ { //rows\n\t\tfor j := 0; j < game.BoardWidth; j++ { //columns\n\t\t\tif mygame.GameBoard[i][j].Active {\n\t\t\t\t//check that the symbol matches\n\t\t\t\tif mygame.GameBoard[i][j].Symbol == symbol {\n\t\t\t\t\t//make sure piece to left isn't the same symbol\n\t\t\t\t\t//so that we're not double counting\n\t\t\t\t\tif j == 0 || mygame.GameBoard[i][j-1].Symbol != symbol {\n\t\t\t\t\t\tcurrCount++\n\t\t\t\t\t\tfor k := 1; k < 4; k++ {\n\t\t\t\t\t\t\tif j+k < game.BoardWidth { //make sure we don't go off board\n\t\t\t\t\t\t\t\tif mygame.GameBoard[i][j+k].Symbol == symbol {\n\t\t\t\t\t\t\t\t\tcurrCount++\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tbreak //break if different symbol\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t//only increment count if currentcount matches n\n\t\t\t\t\t\tif currCount == streakLength {\n\t\t\t\t\t\t\tcount++\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcurrCount = 0 //reset currCount\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t}\n\treturn count\n}","func Part2(shipMap ShipMap) string {\n\tminutes := 0\n\toxygenatedPoints := []Point{shipMap.grid[shipMap.osY][shipMap.osX]}\n\n\tfor shipMap.Unoxygenated() > 0 {\n\t\tfor _, point := range oxygenatedPoints {\n\t\t\tneighbors := shipMap.Neighbors(point)\n\t\t\tfor idx := 0; idx < len(neighbors); idx++ {\n\t\t\t\tneighbor := neighbors[idx]\n\t\t\t\tshipMap.grid[neighbor.y][neighbor.x].oxygenated = true\n\t\t\t\tif !containsPoint(oxygenatedPoints, neighbor) {\n\t\t\t\t\toxygenatedPoints = append(oxygenatedPoints, neighbor)\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t\tminutes++\n\t}\n\n\treturn \"Answer: \" + strconv.Itoa(minutes)\n}","func steps(s []int) int {\n\tsteps := 0\n\n\tfor pos := 0; pos >= 0 && pos < len(s); steps += 1 {\n\t\tnewpos := pos + s[pos]\n\t\tif s[pos] >= 3 {\n\t\t\ts[pos] -= 1\n\t\t} else {\n\t\t\ts[pos] += 1\n\t\t}\n\t\tpos = newpos\n\t}\n\n\treturn steps\n}","func step2(w string) string {\n\tvar endings []string = []string{\"gd\", \"dt\", \"gt\", \"kt\"}\n\n\tfor _, e := range endings {\n\t\tif searchInR1(w, e) {\n\t\t\treturn w[0 : len(w)-1]\n\t\t}\n\t}\n\n\treturn w\n}","func PathLength(board [][]bool, start, target Coord) (int, bool) {\n\tn := len(board)\n\t// Check if start is out of bounds\n\tif start.Row < 0 || start.Row >= n || start.Col < 0 || start.Col >= len(board[start.Row]) {\n\t\treturn 0, false\n\t}\n\n\t// Check that not a wall\n\tif board[start.Row][start.Col] {\n\t\treturn 0, false\n\t}\n\n\t// Are we done?!\n\tif start == target {\n\t\treturn 0, true\n\t}\n\n\t// Backtracking algorithm\n\n\t// Set board-value at the current position\n\tboard[start.Row][start.Col] = true\n\n\tnSteps := math.MaxInt64\n\n\tup, ok := PathLength(board, Coord{Row: start.Row - 1, Col: start.Col}, target)\n\tnSteps = minIfOkElseFirstArg(nSteps, up, ok)\n\n\tdown, ok := PathLength(board, Coord{Row: start.Row + 1, Col: start.Col}, target)\n\tnSteps = minIfOkElseFirstArg(nSteps, down, ok)\n\n\tleft, ok := PathLength(board, Coord{Row: start.Row, Col: start.Col - 1}, target)\n\tnSteps = minIfOkElseFirstArg(nSteps, left, ok)\n\n\tright, ok := PathLength(board, Coord{Row: start.Row, Col: start.Col + 1}, target)\n\tnSteps = minIfOkElseFirstArg(nSteps, right, ok)\n\n\t// Unset the board-value at the current position\n\tboard[start.Row][start.Col] = false\n\n\t// No direction is valid\n\tif nSteps == math.MaxInt64 {\n\t\treturn -1, false\n\t}\n\n\t// Return minimum number of steps to target\n\treturn 1 + nSteps, true\n}","func findPaths(m int, n int, N int, i int, j int) int {\n \n}","func prisonAfterNDays(cells []int, N int) []int {\n \n}","func stepsToOxygen(d *droid) int {\n\n\t// Run search algorithm (assume no more than n steps are required)\n\tfor i := 0; i < 1000; i++ {\n\t\t// Try to take next step from all existing moves with distance i\n\t\ttryMoves := d.getAllMovesWithDistance(i)\n\t\tfor _, tryMove := range tryMoves {\n\t\t\t// First, navigate to the location of the move chosen\n\t\t\td.moveToPoint(tryMove.location)\n\t\t\t// Take a step in every direction (will populate map of movements)\n\t\t\td.moveEveryDirection()\n\t\t}\n\t\t// Check if target found flag is set, if yes, we're done\n\t\tif d.foundTarget {\n\t\t\treturn i + 1\n\t\t}\n\t}\n\n\tlog.Fatal(\"Could not find target...\")\n\treturn 0\n}","func TimeToRun(marathonHours, marathonMinutes, miles float64) float64 {\n var speed float64 = 26.2 / (marathonHours * 60 + marathonMinutes)\n var days float64 = (miles / speed) / (24 * 60)\n fmt.Println(\"You could run %.4f in %.4f days.\", miles, days)\n return days\n}","func TestStepCycle(t *testing.T) {\n\tvar pathways [alphabetSize]int\n\tfor i := 0; i < alphabetSize; i++ {\n\t\tpathways[i] = i\n\t}\n\n\tfor i, test := range []struct {\n\t\tstep int\n\t\tcycle int\n\t\tshouldErr bool\n\t}{\n\t\t{\n\t\t\tstep: 1,\n\t\t\tcycle: 1,\n\t\t\tshouldErr: false,\n\t\t},\n\t\t{\n\t\t\tstep: 1,\n\t\t\tcycle: 2,\n\t\t\tshouldErr: false,\n\t\t},\n\t\t{\n\t\t\tstep: 2,\n\t\t\tcycle: 1,\n\t\t\tshouldErr: false,\n\t\t},\n\t\t{\n\t\t\tstep: 1,\n\t\t\tcycle: 13,\n\t\t\tshouldErr: false,\n\t\t},\n\t\t{\n\t\t\tstep: 13,\n\t\t\tcycle: 1,\n\t\t\tshouldErr: false,\n\t\t},\n\t\t{\n\t\t\tstep: 1,\n\t\t\tcycle: 26,\n\t\t\tshouldErr: false,\n\t\t},\n\t\t{\n\t\t\tstep: 26,\n\t\t\tcycle: 1,\n\t\t\tshouldErr: false,\n\t\t},\n\t\t{\n\t\t\tstep: 2,\n\t\t\tcycle: 13,\n\t\t\tshouldErr: false,\n\t\t},\n\t\t{\n\t\t\tstep: 13,\n\t\t\tcycle: 2,\n\t\t\tshouldErr: false,\n\t\t},\n\t\t{\n\t\t\tstep: 23,\n\t\t\tcycle: 32,\n\t\t\tshouldErr: true,\n\t\t},\n\t\t{\n\t\t\tstep: 1,\n\t\t\tcycle: -3,\n\t\t\tshouldErr: true,\n\t\t},\n\t\t{\n\t\t\tstep: 0,\n\t\t\tcycle: 1,\n\t\t\tshouldErr: true,\n\t\t},\n\t} {\n\t\terr := verifyRotor(pathways, 0, test.step, test.cycle)\n\t\tif test.shouldErr && err == nil {\n\t\t\tt.Errorf(\"test %d: want error, got nil\", i)\n\t\t} else if !test.shouldErr && err != nil {\n\t\t\tt.Errorf(\"test %d: want nil, got %w\", i, err)\n\t\t}\n\t}\n}","func (c Chessboard) validPieceKnight(square int) bool {\n return int(c.boardSquares[square] % 10) == 2\n}","func (c Chessboard) candSquaresKnight(from int) []int {\n if !c.validPieceKnight(from) {\n return make([]int, 0, 1)\n }\n\n candSquares := make([]int, 0, 16)\n color := c.pieceColorOnPosition(from)\n\n directions := [][]int{{2,1},{-2,1},{2,-1},{-2,-1}, {1,2},{-1,2},{1,-2},{-1,-2}}\n\n for _,v := range(directions) {\n currRow := rowFromPosition(from) + v[0]\n currCol := colFromPosition(from) + v[1]\n\n currPos := posFromRowColumn(currRow, currCol)\n\n if currRow > -1 && currRow < 8 && currCol > -1 && currCol < 8 {\n if c.pieceColorOnPosition(currPos) != color {\n candSquares = append(candSquares, currPos)\n }\n }\n }\n\n return candSquares\n}","func Day8Part2(filepath string) any {\n\tvar res int\n\n\t// parse out treeMap from file\n\t// open file\n\treadFile, _ := os.Open(filepath)\n\n\t// read line\n\tfileScanner := bufio.NewScanner(readFile)\n\tfileScanner.Split(bufio.ScanLines)\n\n\t// parse map in to [][]int\n\ttreeMap := parseMap(fileScanner)\n\n\t// iterate every tree\n\tfor i := range treeMap {\n\t\tfor j := range treeMap[0] {\n\t\t\t// for every tree, calculate scenicScore\n\t\t\ts := getScenicScore(treeMap, i, j)\n\t\t\t// update max scenic score\n\t\t\tif s > res {\n\t\t\t\tres = s\n\t\t\t}\n\t\t}\n\t}\n\treturn res\n}","func findRescuePathLength(caveDepth, targetX, targetY int, cavePlan cavePlanType) (int, cavePlanType) {\n\tgraphMap := make(graphMapType)\n\tstartTorchKey := graphItemKeyType{0, 0, TORCH}\n\tstartTorch := graphItemType{&startTorchKey, 0, -1, nil, false}\n\tpq := make(priorityQueue, 1)\n\tpq[0] = &startTorch\n\tgraphMap[startTorchKey] = &startTorch\n\theap.Init(&pq)\n\n\tfor len(pq) > 0 {\n\t\thead := heap.Pop(&pq).(*graphItemType)\n\t\thead.processed = true\n\t\t// If target reached return distance\n\t\tif head.x == targetX && head.y == targetY && head.tool == TORCH {\n\t\t\treturn head.dist, cavePlan\n\t\t}\n\t\t// Left\n\t\tif head.x > 0 && cavePlan[head.y][head.x-1].erosion != head.tool {\n\t\t\tcreateGraphItem(head.x-1, head.y, head.tool, head.dist+1, &pq, &graphMap, head)\n\t\t}\n\t\t// Up\n\t\tif head.y > 0 && cavePlan[head.y-1][head.x].erosion != head.tool {\n\t\t\tcreateGraphItem(head.x, head.y-1, head.tool, head.dist+1, &pq, &graphMap, head)\n\t\t}\n\t\t// Generate additional cave plan if required\n\t\tif head.x == len(cavePlan[head.y])-1 {\n\t\t\tcavePlan = addColumn(caveDepth, targetX, targetY, cavePlan)\n\t\t}\n\t\tif head.y == len(cavePlan)-1 {\n\t\t\tcavePlan = addRow(caveDepth, targetX, targetY, cavePlan)\n\t\t}\n\t\t// Right\n\t\tif cavePlan[head.y][head.x+1].erosion != head.tool {\n\t\t\tcreateGraphItem(head.x+1, head.y, head.tool, head.dist+1, &pq, &graphMap, head)\n\t\t}\n\t\t// Down\n\t\tif cavePlan[head.y+1][head.x].erosion != head.tool {\n\t\t\tcreateGraphItem(head.x, head.y+1, head.tool, head.dist+1, &pq, &graphMap, head)\n\t\t}\n\t\t// Change the tool operation is also one of options\n\t\tnewTool := (head.tool + 1) % 3\n\t\tif newTool == cavePlan[head.y][head.x].erosion {\n\t\t\tnewTool = (newTool + 1) % 3\n\t\t}\n\t\tcreateGraphItem(head.x, head.y, newTool, head.dist+7, &pq, &graphMap, head)\n\t}\n\treturn -1, cavePlan\n}","func (r *Register) totalSteps() string {\n\treturn fmt.Sprintf(\"%d\", len(r.steps)-1)\n}","func (c Chessboard) validMoveKnight(from int, to int) bool {\n if !c.validPieceKnight(from) {\n return false\n }\n\n fromRow := rowFromPosition(from)\n fromCol := colFromPosition(from)\n toRow := rowFromPosition(to)\n toCol := colFromPosition(to)\n\n if ((toRow == (fromRow - 2) || toRow == (fromRow + 2)) &&\n (toCol == (fromCol - 1) || toCol == (fromCol + 1))) {\n\n return true\n\n }\n\n if ((toRow == (fromRow - 1) || toRow == (fromRow + 1)) &&\n (toCol == (fromCol - 2) || toCol == (fromCol + 2))) {\n\n return true\n\n }\n\n return false\n}","func Test_step1(t *testing.T) {\n\ttestCases := []romance.StepTestCase{\n\t\t{\"rapidement\", 3, 5, 2, true, \"rapid\", 3, 5, 2},\n\t\t{\"paresseuse\", 3, 5, 3, true, \"paress\", 3, 5, 3},\n\t\t{\"prosaïqUement\", 4, 7, 3, true, \"prosaïqU\", 4, 7, 3},\n\t\t{\"nonchalance\", 3, 7, 2, true, \"nonchal\", 3, 7, 2},\n\t\t{\"apostoliqUes\", 2, 4, 3, true, \"apostol\", 2, 4, 3},\n\t\t{\"assiduités\", 2, 5, 4, true, \"assidu\", 2, 5, 4},\n\t\t{\"philosophiqUement\", 4, 6, 3, true, \"philosoph\", 4, 6, 3},\n\t\t{\"despotiqUement\", 3, 6, 2, true, \"despot\", 3, 6, 2},\n\t\t{\"incontestablement\", 2, 5, 4, true, \"incontest\", 2, 5, 4},\n\t\t{\"diminution\", 3, 5, 2, true, \"diminu\", 3, 5, 2},\n\t\t{\"séditieuse\", 3, 5, 2, true, \"séditi\", 3, 5, 2},\n\t\t{\"anonymement\", 2, 4, 3, true, \"anonym\", 2, 4, 3},\n\t\t{\"conservation\", 3, 6, 2, true, \"conserv\", 3, 6, 2},\n\t\t{\"fâcheuses\", 3, 7, 2, true, \"fâcheux\", 3, 7, 2},\n\t\t{\"houleuse\", 4, 7, 2, true, \"houleux\", 4, 7, 2},\n\t\t{\"historiqUes\", 3, 6, 2, true, \"histor\", 3, 6, 2},\n\t\t{\"impérieusement\", 2, 5, 4, true, \"impéri\", 2, 5, 4},\n\t\t{\"complaisances\", 3, 8, 2, true, \"complais\", 3, 8, 2},\n\t\t{\"confessionnaux\", 3, 6, 2, true, \"confessionnal\", 3, 6, 2},\n\t\t{\"grandement\", 4, 7, 3, true, \"grand\", 4, 5, 3},\n\t\t{\"passablement\", 3, 6, 2, true, \"passabl\", 3, 6, 2},\n\t\t{\"strictement\", 5, 8, 4, true, \"strict\", 5, 6, 4},\n\t\t{\"physiqUement\", 4, 6, 3, true, \"physiqU\", 4, 6, 3},\n\t\t{\"serieusement\", 3, 7, 2, true, \"serieux\", 3, 7, 2},\n\t\t{\"roulement\", 4, 6, 2, true, \"roul\", 4, 4, 2},\n\t\t{\"appartement\", 2, 5, 4, true, \"appart\", 2, 5, 4},\n\t\t{\"reconnaissance\", 3, 5, 2, true, \"reconnaiss\", 3, 5, 2},\n\t\t{\"aigrement\", 3, 6, 3, true, \"aigr\", 3, 4, 3},\n\t\t{\"impertinences\", 2, 5, 4, true, \"impertinent\", 2, 5, 4},\n\t\t{\"parlement\", 3, 6, 3, true, \"parl\", 3, 4, 3},\n\t\t{\"malicieux\", 3, 5, 2, true, \"malici\", 3, 5, 2},\n\t\t{\"suffisance\", 3, 6, 2, true, \"suffis\", 3, 6, 2},\n\t\t{\"prémédité\", 4, 6, 3, true, \"préméd\", 4, 6, 3},\n\t\t{\"métalliqUes\", 3, 5, 2, true, \"métall\", 3, 5, 2},\n\t\t{\"météorologiste\", 3, 6, 2, true, \"météorolog\", 3, 6, 2},\n\t\t{\"prononciation\", 4, 6, 3, true, \"prononci\", 4, 6, 3},\n\t\t{\"nombreuse\", 3, 8, 2, true, \"nombreux\", 3, 8, 2},\n\t\t{\"extatiqUe\", 2, 5, 4, true, \"extat\", 2, 5, 4},\n\t\t{\"magnifiqUement\", 3, 6, 2, true, \"magnif\", 3, 6, 2},\n\t\t{\"gymnastiqUe\", 3, 6, 2, true, \"gymnast\", 3, 6, 2},\n\t\t{\"dramatiqUe\", 4, 6, 3, true, \"dramat\", 4, 6, 3},\n\t\t{\"simplicité\", 3, 7, 2, true, \"simpliqU\", 3, 7, 2},\n\t\t{\"roYalistes\", 3, 5, 2, true, \"roYal\", 3, 5, 2},\n\t\t{\"fortifications\", 3, 6, 2, true, \"fortif\", 3, 6, 2},\n\t\t{\"attendrissement\", 2, 5, 4, true, \"attendr\", 2, 5, 4},\n\t\t{\"respectueusement\", 3, 6, 2, true, \"respectu\", 3, 6, 2},\n\t\t{\"patriotisme\", 3, 7, 2, true, \"patriot\", 3, 7, 2},\n\t\t{\"curieuse\", 3, 7, 2, true, \"curieux\", 3, 7, 2},\n\t\t{\"fascination\", 3, 6, 2, true, \"fascin\", 3, 6, 2},\n\t\t{\"effectivement\", 2, 5, 4, true, \"effect\", 2, 5, 4},\n\t\t{\"condoléance\", 3, 6, 2, true, \"condolé\", 3, 6, 2},\n\t\t{\"malignité\", 3, 5, 2, true, \"malign\", 3, 5, 2},\n\t\t{\"capricieuse\", 3, 6, 2, true, \"caprici\", 3, 6, 2},\n\t\t{\"applaudissements\", 2, 7, 5, true, \"applaud\", 2, 7, 5},\n\t\t{\"praticable\", 4, 6, 3, true, \"pratic\", 4, 6, 3},\n\t\t{\"rivaux\", 3, 6, 2, true, \"rival\", 3, 5, 2},\n\t\t{\"augmentation\", 3, 6, 3, true, \"augment\", 3, 6, 3},\n\t\t{\"ameublement\", 2, 5, 3, true, \"ameubl\", 2, 5, 3},\n\t\t{\"honorables\", 3, 5, 2, true, \"honor\", 3, 5, 2},\n\t\t{\"effervescence\", 2, 5, 4, true, \"effervescent\", 2, 5, 4},\n\t\t{\"excentricité\", 2, 5, 4, true, \"excentr\", 2, 5, 4},\n\t\t{\"misérable\", 3, 5, 2, true, \"misér\", 3, 5, 2},\n\t\t{\"capitulation\", 3, 5, 2, true, \"capitul\", 3, 5, 2},\n\t\t{\"enjoUement\", 2, 5, 4, true, \"enjoU\", 2, 5, 4},\n\t\t{\"sévérité\", 3, 5, 2, true, \"sévér\", 3, 5, 2},\n\t\t{\"perplexités\", 3, 7, 2, true, \"perplex\", 3, 7, 2},\n\t\t{\"consentement\", 3, 6, 2, true, \"consent\", 3, 6, 2},\n\t\t{\"convocation\", 3, 6, 2, true, \"convoc\", 3, 6, 2},\n\t\t{\"assurances\", 2, 5, 4, true, \"assur\", 2, 5, 4},\n\t\t{\"ébloUissement\", 2, 5, 4, true, \"ébloU\", 2, 5, 4},\n\t\t{\"méridionaux\", 3, 5, 2, true, \"méridional\", 3, 5, 2},\n\t\t{\"dérangements\", 3, 5, 2, true, \"dérang\", 3, 5, 2},\n\t\t{\"domination\", 3, 5, 2, true, \"domin\", 3, 5, 2},\n\t\t{\"incroYable\", 2, 6, 5, true, \"incroY\", 2, 6, 5},\n\t\t{\"réjoUissances\", 3, 5, 2, true, \"réjoUiss\", 3, 5, 2},\n\t\t{\"décadence\", 3, 5, 2, true, \"décadent\", 3, 5, 2},\n\t\t{\"bâillement\", 4, 7, 2, true, \"bâill\", 4, 5, 2},\n\t\t{\"habillement\", 3, 5, 2, true, \"habill\", 3, 5, 2},\n\t\t{\"irréparablement\", 2, 5, 4, true, \"irrépar\", 2, 5, 4},\n\t\t{\"diplomatiqUes\", 3, 6, 2, true, \"diplomat\", 3, 6, 2},\n\t\t{\"distribution\", 3, 7, 2, true, \"distribu\", 3, 7, 2},\n\t\t{\"pétulance\", 3, 5, 2, true, \"pétul\", 3, 5, 2},\n\t\t{\"considérable\", 3, 6, 2, true, \"considér\", 3, 6, 2},\n\t\t{\"éducation\", 2, 4, 3, true, \"éduc\", 2, 4, 3},\n\t\t{\"indications\", 2, 5, 4, true, \"indiqU\", 2, 5, 4},\n\t\t{\"cupidité\", 3, 5, 2, true, \"cupid\", 3, 5, 2},\n\t\t{\"traîtreusement\", 5, 9, 3, true, \"traîtreux\", 5, 9, 3},\n\t\t{\"silencieuse\", 3, 5, 2, true, \"silenci\", 3, 5, 2},\n\t\t{\"pessimisme\", 3, 6, 2, true, \"pessim\", 3, 6, 2},\n\t\t{\"préoccupation\", 5, 8, 3, true, \"préoccup\", 5, 8, 3},\n\t\t// Special cases that should return false despite\n\t\t// being changed. They \"don't count\".\n\t\t{\"compliment\", 3, 7, 2, false, \"compli\", 3, 6, 2},\n\t\t{\"vraiment\", 5, 7, 3, false, \"vrai\", 4, 4, 3},\n\t\t{\"remercîment\", 3, 5, 2, false, \"remercî\", 3, 5, 2},\n\t\t{\"puissamment\", 4, 7, 2, false, \"puissant\", 4, 7, 2},\n\t\t{\"absolument\", 2, 5, 4, false, \"absolu\", 2, 5, 4},\n\t\t{\"décidément\", 3, 5, 2, false, \"décidé\", 3, 5, 2},\n\t\t{\"condiments\", 3, 6, 2, false, \"condi\", 3, 5, 2},\n\t}\n\tromance.RunStepTest(t, step1, testCases)\n\n}","func findPaths(m int, n int, maxMove int, startRow int, startColumn int) int {\n\tgrid := make([][][]int, maxMove+1)\n\tfor k := 0; k <= maxMove; k++ {\n\t\tgrid[k] = make([][]int, m)\n\t\tfor i := 0; i < m; i++ {\n\t\t\tgrid[k][i] = make([]int, n)\n\t\t}\n\t}\n\n\tres := 0\n\tgrid[0][startRow][startColumn] = 1\n\n\tfor move := 0; move < maxMove; move++ {\n\t\tfor x := 0; x < m; x++ {\n\t\t\tfor y := 0; y < n; y++ {\n\t\t\t\tv := grid[move][x][y] % modulo\n\t\t\t\tif v == 0 {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\n\t\t\t\tif x == 0 {\n\t\t\t\t\tres += v\n\t\t\t\t} else {\n\t\t\t\t\tgrid[move+1][x-1][y] += v\n\t\t\t\t}\n\n\t\t\t\tif x == m-1 {\n\t\t\t\t\tres += v\n\t\t\t\t} else {\n\t\t\t\t\tgrid[move+1][x+1][y] += v\n\t\t\t\t}\n\n\t\t\t\tif y == 0 {\n\t\t\t\t\tres += v\n\t\t\t\t} else {\n\t\t\t\t\tgrid[move+1][x][y-1] += v\n\t\t\t\t}\n\n\t\t\t\tif y == n-1 {\n\t\t\t\t\tres += v\n\t\t\t\t} else {\n\t\t\t\t\tgrid[move+1][x][y+1] += v\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn res % modulo\n}","func stepSeatMap(seatMap *SeatMap, count CountNeighbours, neighbourLimit int) (*SeatMap, bool) {\n\tnewMap := &SeatMap{\n\t\tseats: make([][]rune, len(seatMap.seats)),\n\t\toccupied: 0,\n\t}\n\tchanged := false\n\n\tfor i := 0; i < len(seatMap.seats); i++ {\n\t\tnewMap.seats[i] = make([]rune, len(seatMap.seats[i]))\n\t\tfor j := 0; j < len(seatMap.seats[i]); j++ {\n\t\t\tif seatMap.seats[i][j] == '.' {\n\t\t\t\tnewMap.seats[i][j] = '.'\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\toccupiedNeighbours := count(seatMap, i, j)\n\t\t\tif seatMap.seats[i][j] == 'L' {\n\t\t\t\tif occupiedNeighbours == 0 {\n\t\t\t\t\tnewMap.seats[i][j] = '#'\n\t\t\t\t\tchanged = true\n\t\t\t\t\tnewMap.occupied++\n\t\t\t\t} else {\n\t\t\t\t\tnewMap.seats[i][j] = 'L'\n\t\t\t\t}\n\t\t\t} else if seatMap.seats[i][j] == '#' {\n\t\t\t\tif occupiedNeighbours < neighbourLimit {\n\t\t\t\t\tnewMap.seats[i][j] = '#'\n\t\t\t\t\tnewMap.occupied++\n\t\t\t\t} else {\n\t\t\t\t\tnewMap.seats[i][j] = 'L'\n\t\t\t\t\tchanged = true\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn newMap, !changed\n}","func kerDIT8(a []fr.Element, twiddles [][]fr.Element, stage int) {\n\n\tfr.Butterfly(&a[0], &a[1])\n\tfr.Butterfly(&a[2], &a[3])\n\tfr.Butterfly(&a[4], &a[5])\n\tfr.Butterfly(&a[6], &a[7])\n\tfr.Butterfly(&a[0], &a[2])\n\ta[3].Mul(&a[3], &twiddles[stage+1][1])\n\tfr.Butterfly(&a[1], &a[3])\n\tfr.Butterfly(&a[4], &a[6])\n\ta[7].Mul(&a[7], &twiddles[stage+1][1])\n\tfr.Butterfly(&a[5], &a[7])\n\tfr.Butterfly(&a[0], &a[4])\n\ta[5].Mul(&a[5], &twiddles[stage+0][1])\n\tfr.Butterfly(&a[1], &a[5])\n\ta[6].Mul(&a[6], &twiddles[stage+0][2])\n\tfr.Butterfly(&a[2], &a[6])\n\ta[7].Mul(&a[7], &twiddles[stage+0][3])\n\tfr.Butterfly(&a[3], &a[7])\n}","func TestTakeSteps(t *testing.T) {\n\tfor i, test := range []struct {\n\t\trotors *Rotors\n\t\tsteps []int\n\t\texpected [][]int\n\t}{\n\t\t{\n\t\t\trotors: newTestRotors(\n\t\t\t\tt,\n\t\t\t\t[]int{0, 0, 0},\n\t\t\t\t[]int{1, 1, 1},\n\t\t\t\t[]int{26, 26, 26},\n\t\t\t),\n\t\t\tsteps: []int{10, 26 * 26 * 26},\n\t\t\texpected: [][]int{{10, 0, 0}, {10, 0, 0}},\n\t\t},\n\t\t{\n\t\t\trotors: newTestRotors(\n\t\t\t\tt,\n\t\t\t\t[]int{1, 0, 0},\n\t\t\t\t[]int{1, 1, 1},\n\t\t\t\t[]int{2, 2, 2},\n\t\t\t),\n\t\t\tsteps: []int{3, 20},\n\t\t\texpected: [][]int{{4, 2, 1}, {24, 12, 6}},\n\t\t},\n\t\t{\n\t\t\trotors: newTestRotors(\n\t\t\t\tt,\n\t\t\t\t[]int{0, 13, 0},\n\t\t\t\t[]int{13, 13, 13},\n\t\t\t\t[]int{2, 2, 2},\n\t\t\t),\n\t\t\tsteps: []int{2, 8},\n\t\t\texpected: [][]int{{0, 0, 13}, {0, 0, 13}},\n\t\t},\n\t\t{\n\t\t\trotors: newTestRotors(\n\t\t\t\tt,\n\t\t\t\t[]int{0, 0, 0},\n\t\t\t\t[]int{2, 2, 2},\n\t\t\t\t[]int{13, 13, 13},\n\t\t\t),\n\t\t\tsteps: []int{1, 14},\n\t\t\texpected: [][]int{{2, 0, 0}, {4, 2, 0}},\n\t\t},\n\t\t{\n\t\t\trotors: newTestRotors(\n\t\t\t\tt,\n\t\t\t\t[]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t[]int{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},\n\t\t\t\t[]int{26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26},\n\t\t\t),\n\t\t\tsteps: []int{5, 26 * 26 * 26 * 26},\n\t\t\texpected: [][]int{\n\t\t\t\t{5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{5, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\trotors: newTestRotors(\n\t\t\t\tt,\n\t\t\t\t[]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t[]int{13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13},\n\t\t\t\t[]int{2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2},\n\t\t\t),\n\t\t\tsteps: []int{15, 30},\n\t\t\texpected: [][]int{\n\t\t\t\t{13, 13, 13, 13, 0, 0, 0, 0, 0, 0, 0, 0},\n\t\t\t\t{13, 0, 13, 13, 0, 13, 0, 0, 0, 0, 0, 0},\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\trotors: newTestRotors(\n\t\t\t\tt,\n\t\t\t\t[]int{0, 0, 0},\n\t\t\t\t[]int{1, 2, 1},\n\t\t\t\t[]int{1, 13, 26},\n\t\t\t),\n\t\t\tsteps: []int{8, 2},\n\t\t\texpected: [][]int{{8, 16, 0}, {10, 20, 0}},\n\t\t},\n\t\t{\n\t\t\trotors: newTestRotors(\n\t\t\t\tt,\n\t\t\t\t[]int{\n\t\t\t\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n\t\t\t\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n\t\t\t\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n\t\t\t\t},\n\t\t\t\t[]int{\n\t\t\t\t\t13, 2, 13, 2, 13, 2, 13, 2, 13, 2,\n\t\t\t\t\t13, 2, 13, 2, 13, 2, 13, 2, 13, 2,\n\t\t\t\t\t13, 2, 13, 2, 13, 2, 13, 2, 13, 2,\n\t\t\t\t},\n\t\t\t\t[]int{\n\t\t\t\t\t2, 13, 2, 13, 2, 13, 2, 13, 2, 13,\n\t\t\t\t\t2, 13, 2, 13, 2, 13, 2, 13, 2, 13,\n\t\t\t\t\t2, 13, 2, 13, 2, 13, 2, 13, 2, 13,\n\t\t\t\t},\n\t\t\t),\n\t\t\tsteps: []int{30, 30},\n\t\t\texpected: [][]int{\n\t\t\t\t{\n\t\t\t\t\t0, 4, 13, 0, 0, 0, 0, 0, 0, 0,\n\t\t\t\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n\t\t\t\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\t0, 8, 0, 2, 0, 0, 0, 0, 0, 0,\n\t\t\t\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n\t\t\t\t\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n\t\t\t\t},\n\t\t\t},\n\t\t},\n\t} {\n\t\tfor j, step := range test.steps {\n\t\t\tfor k := 0; k < step; k++ {\n\t\t\t\ttest.rotors.takeStep()\n\t\t\t}\n\n\t\t\tif diff := cmp.Diff(test.expected[j], test.rotors.Setting()); diff != \"\" {\n\t\t\t\tt.Errorf(\"test %d: mismatch (-want +got):\\n%s\", i, diff)\n\t\t\t}\n\t\t}\n\t}\n}","func (s *statement) prevTurn() int {\n\treturn (s.Step+2)%4 + 1\n}","func main() {\n\tg, nodesMap := graphLineByLine()\n\n\tstart := nodesMap[\"shiny gold\"]\n\tcount := 0\n\tgraph.BFS(g, start, func(v, w int, _ int64) {\n\t\t//fmt.Println(v, \"to\", w)\n\t\tcount++\n\n\t})\n\n\tfmt.Println(count)\n}","func mapSteps(g *GraphFile, edgeIndices []int) int {\n\tsize := 0\n\tfor e := 0; e < g.EdgeCount(); e++ {\n\t\tif edgeIndices[e] == -1 {\n\t\t\tcontinue\n\t\t}\n\t\tsize += int(g.Steps[e+1] - g.Steps[e])\n\t}\n\treturn size\n}","func stepPerms(n int32) int32 {\n\tcollection := &StepsPremsCollection{memory: make(map[int32]int32)}\n\treturn collection.getPerms(n)\n}","func countVert(mygame game.Game, playerNum int, streakLength int) int {\n\n\tcount := 0 //overall # of streaks of n length\n\tcurrCount := 0 //this needs to be exactly n so that we don't count streaks of 2 as streaks of 3\n\tsymbol := mygame.PlayerSymbols[playerNum]\n\n\t//increment over every square\n\tfor i := 0; i < game.BoardHeight; i++ { //rows\n\t\tfor j := 0; j < game.BoardWidth; j++ { //columns\n\n\t\t\tif mygame.GameBoard[i][j].Active {\n\t\t\t\t//check that the symbol matches\n\t\t\t\tif mygame.GameBoard[i][j].Symbol == symbol {\n\t\t\t\t\t//make sure piece above isn't the same symbol\n\t\t\t\t\t//so that we're not double counting\n\t\t\t\t\tif i == 0 || mygame.GameBoard[i-1][j].Symbol != symbol {\n\t\t\t\t\t\tcurrCount++\n\t\t\t\t\t\tfor k := 1; k < 4; k++ {\n\t\t\t\t\t\t\tif i+k < game.BoardHeight { //make sure we don't go off board\n\t\t\t\t\t\t\t\tif mygame.GameBoard[i+k][j].Symbol == symbol {\n\t\t\t\t\t\t\t\t\tcurrCount++\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tbreak //break if different symbol\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t//only increment count if currentcount matches n\n\n\t\t\t\t\t\tif currCount == streakLength {\n\t\t\t\t\t\t\tcount++\n\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcurrCount = 0 //reset currCount\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t}\n\n\treturn count\n}","func Test_step2b(t *testing.T) {\n\ttestCases := []romance.StepTestCase{\n\t\t{\"posée\", 3, 5, 2, true, \"pos\", 3, 3, 2},\n\t\t{\"contentait\", 3, 6, 2, true, \"content\", 3, 6, 2},\n\t\t{\"évita\", 2, 4, 3, true, \"évit\", 2, 4, 3},\n\t\t{\"cantonnées\", 3, 6, 2, true, \"cantonn\", 3, 6, 2},\n\t\t{\"tender\", 3, 6, 2, true, \"tend\", 3, 4, 2},\n\t\t{\"survenait\", 3, 6, 2, true, \"surven\", 3, 6, 2},\n\t\t{\"plongeaIent\", 4, 8, 3, true, \"plong\", 4, 5, 3},\n\t\t{\"modéra\", 3, 5, 2, true, \"modér\", 3, 5, 2},\n\t\t{\"copier\", 3, 6, 2, true, \"copi\", 3, 4, 2},\n\t\t{\"bougez\", 4, 6, 2, true, \"boug\", 4, 4, 2},\n\t\t{\"déploYaIent\", 3, 6, 2, true, \"déploY\", 3, 6, 2},\n\t\t{\"entendra\", 2, 5, 4, true, \"entendr\", 2, 5, 4},\n\t\t{\"blâmer\", 4, 6, 3, true, \"blâm\", 4, 4, 3},\n\t\t{\"déshonorait\", 3, 6, 2, true, \"déshonor\", 3, 6, 2},\n\t\t{\"concentrés\", 3, 6, 2, true, \"concentr\", 3, 6, 2},\n\t\t{\"mangeant\", 3, 7, 2, true, \"mang\", 3, 4, 2},\n\t\t{\"écouteront\", 2, 5, 3, true, \"écout\", 2, 5, 3},\n\t\t{\"pressaIent\", 4, 7, 3, true, \"press\", 4, 5, 3},\n\t\t{\"ébréché\", 2, 5, 4, true, \"ébréch\", 2, 5, 4},\n\t\t{\"frapper\", 4, 7, 3, true, \"frapp\", 4, 5, 3},\n\t\t{\"côtoYé\", 3, 5, 2, true, \"côtoY\", 3, 5, 2},\n\t\t{\"réfugié\", 3, 5, 2, true, \"réfugi\", 3, 5, 2},\n\t\t{\"jeûnant\", 4, 6, 2, true, \"jeûn\", 4, 4, 2},\n\t\t{\"succombé\", 3, 6, 2, true, \"succomb\", 3, 6, 2},\n\t\t{\"irrité\", 2, 5, 4, true, \"irrit\", 2, 5, 4},\n\t\t{\"danger\", 3, 6, 2, true, \"dang\", 3, 4, 2},\n\t\t{\"sachant\", 3, 6, 2, true, \"sach\", 3, 4, 2},\n\t\t{\"reparaissaIent\", 3, 5, 2, true, \"reparaiss\", 3, 5, 2},\n\t\t{\"reconnaissant\", 3, 5, 2, true, \"reconnaiss\", 3, 5, 2},\n\t\t{\"faisant\", 4, 6, 2, true, \"fais\", 4, 4, 2},\n\t\t{\"arrangés\", 2, 5, 4, true, \"arrang\", 2, 5, 4},\n\t\t{\"emparés\", 2, 5, 4, true, \"empar\", 2, 5, 4},\n\t\t{\"choqUée\", 4, 7, 3, true, \"choqU\", 4, 5, 3},\n\t\t{\"gênait\", 3, 6, 2, true, \"gên\", 3, 3, 2},\n\t\t{\"croissante\", 5, 8, 3, true, \"croiss\", 5, 6, 3},\n\t\t{\"scié\", 4, 4, 3, true, \"sci\", 3, 3, 3},\n\t\t{\"reconnaissez\", 3, 5, 2, true, \"reconnaiss\", 3, 5, 2},\n\t\t{\"pliaIent\", 5, 7, 3, true, \"pli\", 3, 3, 3},\n\t\t{\"expédia\", 2, 5, 4, true, \"expédi\", 2, 5, 4},\n\t\t{\"déshabillaIent\", 3, 6, 2, true, \"déshabill\", 3, 6, 2},\n\t\t{\"appréciée\", 2, 6, 5, true, \"appréci\", 2, 6, 5},\n\t\t{\"amputés\", 2, 5, 4, true, \"amput\", 2, 5, 4},\n\t\t{\"dominait\", 3, 5, 2, true, \"domin\", 3, 5, 2},\n\t\t{\"vexantes\", 3, 5, 2, true, \"vex\", 3, 3, 2},\n\t\t{\"fabriqUées\", 3, 6, 2, true, \"fabriqU\", 3, 6, 2},\n\t\t{\"retomber\", 3, 5, 2, true, \"retomb\", 3, 5, 2},\n\t\t{\"exercer\", 2, 4, 3, true, \"exerc\", 2, 4, 3},\n\t\t{\"entourait\", 2, 6, 4, true, \"entour\", 2, 6, 4},\n\t\t{\"voYait\", 3, 6, 2, true, \"voY\", 3, 3, 2},\n\t\t{\"soupait\", 4, 7, 2, true, \"soup\", 4, 4, 2},\n\t\t{\"apportiez\", 2, 5, 4, true, \"apport\", 2, 5, 4},\n\t\t{\"tuée\", 4, 4, 2, true, \"tu\", 2, 2, 2},\n\t\t{\"proposait\", 4, 6, 3, true, \"propos\", 4, 6, 3},\n\t\t{\"citations\", 3, 5, 2, true, \"citat\", 3, 5, 2},\n\t\t{\"distinguée\", 3, 6, 2, true, \"distingu\", 3, 6, 2},\n\t\t{\"parlerez\", 3, 6, 3, true, \"parl\", 3, 4, 3},\n\t\t{\"stanislas\", 4, 6, 3, true, \"stanisl\", 4, 6, 3},\n\t\t{\"enlevée\", 2, 5, 4, true, \"enlev\", 2, 5, 4},\n\t\t{\"irriguaIent\", 2, 5, 4, true, \"irrigu\", 2, 5, 4},\n\t\t{\"contenant\", 3, 6, 2, true, \"conten\", 3, 6, 2},\n\t\t{\"empêchèrent\", 2, 5, 4, true, \"empêch\", 2, 5, 4},\n\t\t{\"inspirées\", 2, 6, 5, true, \"inspir\", 2, 6, 5},\n\t\t{\"basée\", 3, 5, 2, true, \"bas\", 3, 3, 2},\n\t\t{\"consultait\", 3, 6, 2, true, \"consult\", 3, 6, 2},\n\t\t{\"retardait\", 3, 5, 2, true, \"retard\", 3, 5, 2},\n\t\t{\"enlevât\", 2, 5, 4, true, \"enlev\", 2, 5, 4},\n\t\t{\"convenaIent\", 3, 6, 2, true, \"conven\", 3, 6, 2},\n\t\t{\"portât\", 3, 6, 2, true, \"port\", 3, 4, 2},\n\t\t{\"admirée\", 2, 5, 4, true, \"admir\", 2, 5, 4},\n\t\t{\"copiée\", 3, 6, 2, true, \"copi\", 3, 4, 2},\n\t\t{\"démenaIent\", 3, 5, 2, true, \"démen\", 3, 5, 2},\n\t\t{\"fortifiées\", 3, 6, 2, true, \"fortifi\", 3, 6, 2},\n\t\t{\"apercevrait\", 2, 4, 3, true, \"apercevr\", 2, 4, 3},\n\t\t{\"risqUer\", 3, 7, 2, true, \"risqU\", 3, 5, 2},\n\t\t{\"réclamer\", 3, 6, 2, true, \"réclam\", 3, 6, 2},\n\t\t{\"tremblaIent\", 4, 8, 3, true, \"trembl\", 4, 6, 3},\n\t\t{\"calomnier\", 3, 5, 2, true, \"calomni\", 3, 5, 2},\n\t\t{\"réclamée\", 3, 6, 2, true, \"réclam\", 3, 6, 2},\n\t\t{\"déposât\", 3, 5, 2, true, \"dépos\", 3, 5, 2},\n\t\t{\"filé\", 3, 4, 2, true, \"fil\", 3, 3, 2},\n\t\t{\"déchirée\", 3, 6, 2, true, \"déchir\", 3, 6, 2},\n\t\t{\"prononça\", 4, 6, 3, true, \"prononç\", 4, 6, 3},\n\t\t{\"précédé\", 4, 6, 3, true, \"précéd\", 4, 6, 3},\n\t\t{\"asseYait\", 2, 5, 4, true, \"asseY\", 2, 5, 4},\n\t\t{\"emploYés\", 2, 6, 5, true, \"emploY\", 2, 6, 5},\n\t\t{\"chagriner\", 4, 7, 3, true, \"chagrin\", 4, 7, 3},\n\t\t{\"dévorât\", 3, 5, 2, true, \"dévor\", 3, 5, 2},\n\t\t{\"remonté\", 3, 5, 2, true, \"remont\", 3, 5, 2},\n\t\t{\"emploYant\", 2, 6, 5, true, \"emploY\", 2, 6, 5},\n\t\t{\"redoublait\", 3, 6, 2, true, \"redoubl\", 3, 6, 2},\n\t\t{\"marchant\", 3, 7, 2, true, \"march\", 3, 5, 2},\n\t\t{\"pétrifiée\", 3, 6, 2, true, \"pétrifi\", 3, 6, 2},\n\t\t{\"enlevées\", 2, 5, 4, true, \"enlev\", 2, 5, 4},\n\t\t{\"donnassent\", 3, 6, 2, true, \"donn\", 3, 4, 2},\n\t\t{\"recomptait\", 3, 5, 2, true, \"recompt\", 3, 5, 2},\n\t\t{\"masqUait\", 3, 8, 2, true, \"masqU\", 3, 5, 2},\n\t\t{\"renouvelèrent\", 3, 6, 2, true, \"renouvel\", 3, 6, 2},\n\t\t{\"recoucher\", 3, 6, 2, true, \"recouch\", 3, 6, 2},\n\t\t{\"abrégea\", 2, 5, 4, true, \"abrég\", 2, 5, 4},\n\t\t{\"flattait\", 4, 8, 3, true, \"flatt\", 4, 5, 3},\n\t}\n\tromance.RunStepTest(t, step2b, testCases)\n}","func Day8Part2(input []string) (string, error) {\n\n\timData := input[0]\n\timWidth, imHeight := 25, 6\n\n\tlayers := generateLayers(imData, imWidth, imHeight)\n\n\tmessage := \"\"\n\tfor y := 0; y < imHeight; y++ {\n\t\tfor x := 0; x < imWidth; x++ {\n\t\t\tmessage += getMessagePixel(layers, x, y)\n\t\t}\n\t\tmessage += \"\\n\"\n\t}\n\n\treturn message, nil\n}","func gameOfLife(board [][]int) {\n\tm := len(board)\n\tn := len(board[0])\n\tfor y := 0; y < m; y++ {\n\t\tfor x := 0; x < n; x++ {\n\t\t\tneighbors := 0\n\t\t\tif y > 0 {\n\t\t\t\tneighbors += board[y-1][x] & 1\n\t\t\t\tif x > 0 {\n\t\t\t\t\tneighbors += board[y-1][x-1] & 1\n\t\t\t\t}\n\t\t\t\tif x < n-1 {\n\t\t\t\t\tneighbors += board[y-1][x+1] & 1\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif y < m-1 {\n\t\t\t\tneighbors += board[y+1][x] & 1\n\t\t\t\tif x > 0 {\n\t\t\t\t\tneighbors += board[y+1][x-1] & 1\n\t\t\t\t}\n\t\t\t\tif x < n-1 {\n\t\t\t\t\tneighbors += board[y+1][x+1] & 1\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif x > 0 {\n\t\t\t\tneighbors += board[y][x-1] & 1\n\t\t\t}\n\n\t\t\tif x < n-1 {\n\t\t\t\tneighbors += board[y][x+1] & 1\n\t\t\t}\n\n\t\t\tlive := 1 == (board[y][x] & 1)\n\t\t\tswitch {\n\t\t\tcase !live && neighbors == 3:\n\t\t\t\tboard[y][x] |= 2\n\t\t\tcase live && (neighbors == 2 || neighbors == 3):\n\t\t\t\tboard[y][x] |= 2\n\t\t\t}\n\t\t}\n\t}\n\n\tfor y := 0; y < m; y++ {\n\t\tfor x := 0; x < n; x++ {\n\t\t\tboard[y][x] >>= 1\n\t\t}\n\t}\n}","func main() {\n\tinstructions := readLineByLine()\n\n\tvar accumulator int\n\tvar hasCycles bool\n\tinstructionsSwitched := make(map[int]instruction)\n\ti := 0\n\n\tfor i > -1 {\n\t\tfor k, v := range instructions {\n\t\t\tinstructionsSwitched[k] = v\n\t\t}\n\n\t\tif i > len(instructions) {\n\t\t\tbreak\n\t\t}\n\t\t// cycle through instructions and if found nop or jmp switch > create new instructions\n\t\t// calculate accumulator and if has cycles\n\t\taction := instructions[i].action\n\t\tif action == \"jmp\" || action == \"nop\" {\n\t\t\tif action == \"jmp\" {\n\t\t\t\tmove := instructions[i].move\n\t\t\t\tinstructionsSwitched[i] = instruction{\"nop\", move}\n\t\t\t\taccumulator, hasCycles = computeAcc(instructionsSwitched)\n\t\t\t}\n\t\t\tif action == \"nop\" {\n\t\t\t\tmove := instructions[i].move\n\t\t\t\tinstructionsSwitched[i] = instruction{\"jmp\", move}\n\t\t\t\taccumulator, hasCycles = computeAcc(instructionsSwitched)\n\t\t\t}\n\t\t\tif !hasCycles {\n\t\t\t\tfmt.Println(\"no cycle found\", i)\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tif hasCycles {\n\t\t\t\tfmt.Println(\"cycle found\", i)\n\t\t\t\ti++\n\t\t\t}\n\t\t}\n\t\tif action == \"acc\" {\n\t\t\ti++\n\t\t}\n\t}\n\n\tfmt.Println(accumulator)\n\t//fmt.Println(g, nodesMap)\n}","func tictactoe(moves [][]int) string {\n\tgrid := [3][3]int{}\n\n\tbefore := 1\n\tfor _, move := range moves {\n\t\tgrid[move[0]][move[1]] = before\n\t\tswitch before {\n\t\tcase 1:\n\t\t\tbefore = 2\n\t\tcase 2:\n\t\t\tbefore = 1\n\t\t}\n\t}\n\n\t// if (9 - len(moves)) == 1 {\n\t// \tfor i := range grid {\n\t// \t\tfor j := range grid {\n\t// \t\t\tif grid[i][j] == 0 {\n\t// \t\t\t\tgrid[i][j] = 1\n\t// \t\t\t}\n\t// \t\t}\n\t// \t}\n\t// }\n\n\tfmt.Println(grid)\n\n\tend := func(this int) string {\n\t\tif this == 1 {\n\t\t\treturn \"A\"\n\t\t} else if this == 2 {\n\t\t\treturn \"B\"\n\t\t}\n\t\treturn \"\"\n\t}\n\n\thalf := (9 - len(moves)) / 2\n\taReft := half + (9-len(moves))%2\n\tbReft := half\n\n\taReach := 0\n\tbReach := 0\n\tfor i := 0; i < 3; i++ {\n\t\tif grid[0][i] == grid[1][i] && grid[1][i] == grid[2][i] {\n\t\t\tif winner := end(grid[1][i]); winner != \"\" {\n\t\t\t\treturn winner\n\t\t\t}\n\t\t}\n\t}\n\t// if aReach >= aReft && aReft != bReft {\n\n\t// }\n\n\taReach = 0\n\tbReach = 0\n\tfor i := 0; i < 3; i++ {\n\t\tif grid[i][0] == grid[i][1] && grid[i][1] == grid[i][2] {\n\t\t\tif winner := end(grid[i][1]); winner != \"\" {\n\t\t\t\treturn winner\n\t\t\t}\n\t\t}\n\t}\n\n\taReach = 0\n\tbReach = 0\n\tif grid[0][0] == grid[1][1] && grid[1][1] == grid[2][2] {\n\t\tif winner := end(grid[1][1]); winner != \"\" {\n\t\t\treturn winner\n\t\t}\n\t}\n\n\taReach = 0\n\tbReach = 0\n\tif grid[0][2] == grid[1][1] && grid[1][1] == grid[2][0] {\n\t\tif winner := end(grid[1][1]); winner != \"\" {\n\t\t\treturn winner\n\t\t}\n\t}\n\n\t// if len(moves) >= 8 {\n\tif len(moves) == 9 {\n\t\treturn \"Draw\"\n\t}\n\n\t// あと何回打てるか？\n\t// 自分の回数より多いとそっちの勝ち\n\n\t_ = aReft\n\t_ = bReft\n\t_ = aReach\n\t_ = bReach\n\n\treturn \"Pending\"\n}","func (graph *Graph) GetSteps(path Path) int {\n\treturn len(path) - 1 // contains start point so -1\n}","func Test_step2a(t *testing.T) {\n\ttestCases := []romance.StepTestCase{\n\t\t{\"épanoUit\", 2, 4, 3, true, \"épanoU\", 2, 4, 3},\n\t\t{\"faillirent\", 4, 7, 2, true, \"faill\", 4, 5, 2},\n\t\t{\"acabit\", 2, 4, 3, true, \"acab\", 2, 4, 3},\n\t\t{\"établissait\", 2, 4, 3, true, \"établ\", 2, 4, 3},\n\t\t{\"découvrir\", 3, 6, 2, true, \"découvr\", 3, 6, 2},\n\t\t{\"réjoUissait\", 3, 5, 2, true, \"réjoU\", 3, 5, 2},\n\t\t{\"trahiront\", 4, 6, 3, true, \"trah\", 4, 4, 3},\n\t\t{\"maintenir\", 4, 7, 2, true, \"mainten\", 4, 7, 2},\n\t\t{\"vendit\", 3, 6, 2, true, \"vend\", 3, 4, 2},\n\t\t{\"repartit\", 3, 5, 2, true, \"repart\", 3, 5, 2},\n\t\t{\"giletti\", 3, 5, 2, true, \"gilett\", 3, 5, 2},\n\t\t{\"rienzi\", 4, 6, 2, true, \"rienz\", 4, 5, 2},\n\t\t{\"punie\", 3, 5, 2, true, \"pun\", 3, 3, 2},\n\t\t{\"accueillir\", 2, 7, 4, true, \"accueill\", 2, 7, 4},\n\t\t{\"rétablit\", 3, 5, 2, true, \"rétabl\", 3, 5, 2},\n\t\t{\"ravis\", 3, 5, 2, true, \"rav\", 3, 3, 2},\n\t\t{\"xviIi\", 4, 5, 3, true, \"xviI\", 4, 4, 3},\n\t\t{\"blottie\", 4, 7, 3, true, \"blott\", 4, 5, 3},\n\t\t{\"approfondie\", 2, 6, 5, true, \"approfond\", 2, 6, 5},\n\t\t{\"infirmerie\", 2, 5, 4, true, \"infirmer\", 2, 5, 4},\n\t\t{\"scotti\", 4, 6, 3, true, \"scott\", 4, 5, 3},\n\t\t{\"adoucissait\", 2, 5, 3, true, \"adouc\", 2, 5, 3},\n\t\t{\"finissait\", 3, 5, 2, true, \"fin\", 3, 3, 2},\n\t\t{\"promit\", 4, 6, 3, true, \"prom\", 4, 4, 3},\n\t\t{\"franchies\", 4, 9, 3, true, \"franch\", 4, 6, 3},\n\t\t{\"franchissant\", 4, 8, 3, true, \"franch\", 4, 6, 3},\n\t\t{\"micheli\", 3, 6, 2, true, \"michel\", 3, 6, 2},\n\t\t{\"éteignit\", 2, 5, 3, true, \"éteign\", 2, 5, 3},\n\t\t{\"puni\", 3, 4, 2, true, \"pun\", 3, 3, 2},\n\t\t{\"apoplexie\", 2, 4, 3, true, \"apoplex\", 2, 4, 3},\n\t\t{\"désira\", 3, 5, 2, true, \"dés\", 3, 3, 2},\n\t\t{\"étourdi\", 2, 5, 3, true, \"étourd\", 2, 5, 3},\n\t\t{\"giovanni\", 4, 6, 2, true, \"giovann\", 4, 6, 2},\n\t\t{\"apprécie\", 2, 6, 5, true, \"appréc\", 2, 6, 5},\n\t\t{\"poésies\", 4, 7, 2, true, \"poés\", 4, 4, 2},\n\t\t{\"pairie\", 4, 6, 2, true, \"pair\", 4, 4, 2},\n\t\t{\"sortit\", 3, 6, 2, true, \"sort\", 3, 4, 2},\n\t\t{\"subi\", 3, 4, 2, true, \"sub\", 3, 3, 2},\n\t\t{\"aigrirait\", 3, 6, 3, true, \"aigr\", 3, 4, 3},\n\t\t{\"assailli\", 2, 6, 4, true, \"assaill\", 2, 6, 4},\n\t\t{\"bertolotti\", 3, 6, 2, true, \"bertolott\", 3, 6, 2},\n\t\t{\"recouvrir\", 3, 6, 2, true, \"recouvr\", 3, 6, 2},\n\t\t{\"visconti\", 3, 6, 2, true, \"viscont\", 3, 6, 2},\n\t\t{\"surgir\", 3, 6, 2, true, \"surg\", 3, 4, 2},\n\t\t{\"remercie\", 3, 5, 2, true, \"remerc\", 3, 5, 2},\n\t\t{\"joUissaIent\", 3, 5, 2, true, \"joU\", 3, 3, 2},\n\t\t{\"bondissant\", 3, 6, 2, true, \"bond\", 3, 4, 2},\n\t\t{\"saisi\", 4, 5, 2, true, \"sais\", 4, 4, 2},\n\t\t{\"missouri\", 3, 7, 2, true, \"missour\", 3, 7, 2},\n\t\t{\"remplirent\", 3, 7, 2, true, \"rempl\", 3, 5, 2},\n\t\t{\"envahi\", 2, 5, 4, true, \"envah\", 2, 5, 4},\n\t\t{\"tandis\", 3, 6, 2, true, \"tand\", 3, 4, 2},\n\t\t{\"trahit\", 4, 6, 3, true, \"trah\", 4, 4, 3},\n\t\t{\"trahissaIent\", 4, 6, 3, true, \"trah\", 4, 4, 3},\n\t\t{\"réunie\", 4, 6, 2, true, \"réun\", 4, 4, 2},\n\t\t{\"avarie\", 2, 4, 3, true, \"avar\", 2, 4, 3},\n\t\t{\"dilettanti\", 3, 5, 2, true, \"dilettant\", 3, 5, 2},\n\t\t{\"raidie\", 4, 6, 2, true, \"raid\", 4, 4, 2},\n\t\t{\"écuries\", 2, 4, 3, true, \"écur\", 2, 4, 3},\n\t\t{\"recouvrît\", 3, 6, 2, true, \"recouvr\", 3, 6, 2},\n\t\t{\"parsis\", 3, 6, 3, true, \"pars\", 3, 4, 3},\n\t\t{\"monti\", 3, 5, 2, true, \"mont\", 3, 4, 2},\n\t\t{\"reproduisit\", 3, 6, 2, true, \"reproduis\", 3, 6, 2},\n\t\t{\"étendit\", 2, 4, 3, true, \"étend\", 2, 4, 3},\n\t\t{\"suffi\", 3, 5, 2, true, \"suff\", 3, 4, 2},\n\t\t{\"pillaji\", 3, 6, 2, true, \"pillaj\", 3, 6, 2},\n\t\t{\"rougir\", 4, 6, 2, true, \"roug\", 4, 4, 2},\n\t\t{\"désirez\", 3, 5, 2, true, \"dés\", 3, 3, 2},\n\t\t{\"subit\", 3, 5, 2, true, \"sub\", 3, 3, 2},\n\t\t{\"fondirent\", 3, 6, 2, true, \"fond\", 3, 4, 2},\n\t\t{\"coqUineries\", 3, 6, 2, true, \"coqUiner\", 3, 6, 2},\n\t\t{\"venir\", 3, 5, 2, true, \"ven\", 3, 3, 2},\n\t\t{\"plaidoirie\", 5, 8, 3, true, \"plaidoir\", 5, 8, 3},\n\t\t{\"fournissant\", 4, 7, 2, true, \"fourn\", 4, 5, 2},\n\t\t{\"bonzeries\", 3, 6, 2, true, \"bonzer\", 3, 6, 2},\n\t\t{\"flétri\", 4, 6, 3, true, \"flétr\", 4, 5, 3},\n\t\t{\"faillit\", 4, 7, 2, true, \"faill\", 4, 5, 2},\n\t\t{\"hardie\", 3, 6, 2, true, \"hard\", 3, 4, 2},\n\t\t{\"compagnie\", 3, 6, 2, true, \"compagn\", 3, 6, 2},\n\t\t{\"vernis\", 3, 6, 2, true, \"vern\", 3, 4, 2},\n\t\t{\"attendit\", 2, 5, 4, true, \"attend\", 2, 5, 4},\n\t\t{\"blanchies\", 4, 9, 3, true, \"blanch\", 4, 6, 3},\n\t\t{\"choisie\", 5, 7, 3, true, \"chois\", 5, 5, 3},\n\t\t{\"rafraîchir\", 3, 7, 2, true, \"rafraîch\", 3, 7, 2},\n\t\t{\"choisir\", 5, 7, 3, true, \"chois\", 5, 5, 3},\n\t\t{\"nourrisse\", 4, 7, 2, true, \"nourr\", 4, 5, 2},\n\t\t{\"chancellerie\", 4, 7, 3, true, \"chanceller\", 4, 7, 3},\n\t\t{\"repartie\", 3, 5, 2, true, \"repart\", 3, 5, 2},\n\t\t{\"redira\", 3, 5, 2, true, \"red\", 3, 3, 2},\n\t\t{\"sentira\", 3, 6, 2, true, \"sent\", 3, 4, 2},\n\t\t{\"surgirait\", 3, 6, 2, true, \"surg\", 3, 4, 2},\n\t\t{\"cani\", 3, 4, 2, true, \"can\", 3, 3, 2},\n\t\t{\"gratis\", 4, 6, 3, true, \"grat\", 4, 4, 3},\n\t\t{\"médît\", 3, 5, 2, true, \"méd\", 3, 3, 2},\n\t\t{\"avertis\", 2, 4, 3, true, \"avert\", 2, 4, 3},\n\t\t{\"chirurgie\", 4, 6, 3, true, \"chirurg\", 4, 6, 3},\n\t\t{\"ironie\", 2, 4, 3, true, \"iron\", 2, 4, 3},\n\t\t{\"punîtes\", 3, 5, 2, true, \"pun\", 3, 3, 2},\n\t\t{\"compromis\", 3, 7, 2, true, \"comprom\", 3, 7, 2},\n\t\t{\"simonie\", 3, 5, 2, true, \"simon\", 3, 5, 2},\n\t}\n\tromance.RunStepTest(t, step2a, testCases)\n}","func parseSteps(filename string) (int, map[string][]string) {\n\tdeps := make(map[string][]string)\n\trawLogs, _ := ioutil.ReadFile(filename)\n\tarr := strings.Split(string(rawLogs), \"\\n\")\n\tfor _, raw := range arr {\n\t\tif len(raw) > 0 {\n\t\t\tstep := string(raw[36])\n\t\t\tdep := string(raw[5])\n\t\t\tdeps[step] = append(deps[step], dep)\n\t\t}\n\t}\n\treturn len(arr) - 1, deps\n}","func path(start Point) int {\n\tret := 0\n\tupret := 0\n\trightret := 0\n\tdownret := 0\n\tuppoint := start\n\tuppoint.Y = uppoint.Y + 1\n\tok := isPointOK(&uppoint)\n\tif ok {\n\t\tfmt.Printf(\"%+v\\n\", uppoint)\n\t\tsumpoint <- uppoint\n\t\tpathrecordpoint <- uppoint\n\t\tupret = path(uppoint)\n\n\t\tret = ret + 1\n\t}\n\trightpoint := start\n\trightpoint.X = rightpoint.X + 1\n\tok = isPointOK(&rightpoint)\n\tif ok {\n\t\tfmt.Printf(\"%+v\\n\", rightpoint)\n\t\tsumpoint <- rightpoint\n\t\tpathrecordpoint <- rightpoint\n\t\trightret = path(rightpoint)\n\t\tret = ret + 1\n\n\t}\n\n\treturn ret + upret + downret + rightret\n}","func main() {\n\n\tvar t int\n\tfmt.Scanln(&t)\n\n\tfor ; t > 0; t-- {\n\n\t\tvar n, m, D, H int\n\t\tfmt.Scanln(&n, &m, &D)\n\n\t\tpassed := 0\n\t\theroi := 0\n\n\t\tfor ; heroi < n && passed < m; heroi++ {\n\t\t\tfmt.Scanln(&H)\n\t\t\tpassed += (H - 1) / D\n\t\t}\n\n\t\tfor ; heroi < n; heroi++ {\n\t\t\tvar dummy string\n\t\t\tfmt.Scanln(&dummy)\n\t\t}\n\n\t\tif passed >= m {\n\t\t\tfmt.Println(\"YES\")\n\t\t} else {\n\t\t\tfmt.Println(\"NO\")\n\t\t}\n\t}\n}","func path(n, m int) int {\n\tif n == 1 || m == 1 {\n\t\treturn 1\n\t}\n\treturn path(n-1, m) + path(n, m-1)\n}","func stepPerms(n int32) int32 {\n\tif n < 3 {\n\t\treturn n\n\t}\n\n\ta, b, c, current := 1, 2, 4, 0\n\n\tfor i := int32(3); i < n; i++ {\n\t\tcurrent = a + b + c\n\t\ta, b = b, c\n\t\tc = current\n\t}\n\n\treturn int32(c)\n}","func testTrucks() map[string]string {\n\treturn map[string]string{\n\t\t`truck 1\n0 0 4 4 2\nendtruck\n`: `\n| ! ! ! ! |\n| ! ! ! ! |\n| ! ! ! ! |\n| ! ! ! ! |\n`,\n\t\t`truck 3\n0 0 4 3 4\n0 0 4 1 5\nendtruck\n`: `\n| ! ! ! @ |\n| ! ! ! @ |\n| ! ! ! @ |\n| ! ! ! @ |\n`,\n\t\t`truck 6\n0 0 4 2 7\n0 0 4 2 8\nendtruck\n`: `\n| ! ! @ @ |\n| ! ! @ @ |\n| ! ! @ @ |\n| ! ! @ @ |\n`,\n\t\t`truck 9 \n0 0 4 2 10 \n0 0 4 1 11 \nendtruck\n`: `\n| ! ! @ |\n| ! ! @ |\n| ! ! @ |\n| ! ! @ |\n`,\n\t\t`truck 12 \n0 0 4 2 13 \n0 0 3 2 14 \n0 0 1 1 15 \n0 0 1 1 16 \nendtruck\n`: `\n| ! ! @ @ |\n| ! ! @ @ |\n| ! ! @ @ |\n| ! ! # $ |\n`,\n\t\t`truck 17 \n0 0 4 2 18 \n0 0 2 1 19 \n0 0 2 1 20 \n0 0 2 1 21 \n0 0 1 1 22 \n0 0 1 1 23 \nendtruck\n`: `\n| ! ! @ # |\n| ! ! @ # |\n| ! ! $ % |\n| ! ! $ ^ |\n`,\n\t\t`truck 24\n0 0 4 1 25\n0 0 3 1 26\n0 0 1 1 27\n0 0 3 2 28\n0 0 2 1 29\nendtruck\n`: `\n| ! @ $ $ |\n| ! @ $ $ |\n| ! @ $ $ |\n| ! # % % |\n`,\n\t\t`truck 30\n0 0 3 3 31\n0 0 3 1 32\n0 0 1 2 33\n0 0 2 1 34\nendtruck\n`: `\n| ! ! ! # |\n| ! ! ! # |\n| ! ! ! $ |\n| @ @ @ $ |\n`,\n\t\t`truck 35\n0 0 3 3 36\n0 0 2 1 37\n0 0 1 1 38\n0 0 2 1 39\n0 0 1 1 40\n0 0 1 1 41\nendtruck\n`: `\n| ! ! ! $ |\n| ! ! ! $ |\n| ! ! ! % |\n| @ @ # ^ |\n`,\n\t\t`truck 42\n0 0 3 3 43\n0 0 1 1 44\n0 0 1 1 45\n0 0 1 1 46\n0 0 1 1 47\nendtruck\n`: `\n| ! ! ! % |\n| ! ! ! |\n| ! ! ! |\n| @ # $ |\n`,\n\t\t`truck 48\n0 0 3 2 49\n0 0 2 1 50\n0 0 3 1 51\n0 0 1 1 52\nendtruck\n`: `\n| ! ! # |\n| ! ! # |\n| ! ! # |\n| @ @ $ |\n`,\n\t\t`truck 53\n0 0 2 3 54\n0 0 1 1 55\n0 0 1 1 56\n0 0 2 2 57\nendtruck\n`: `\n| ! ! $ $ |\n| ! ! $ $ |\n| ! ! |\n| @ # |\n`,\n\t\t`truck 58\n0 0 3 1 59\n0 0 1 1 60\nendtruck\n`: `\n| ! |\n| ! |\n| ! |\n| @ |\n`,\n\t\t`truck 61 \n0 0 1 1 62 \n0 0 1 1 63 \n0 0 1 1 64 \n0 0 1 1 65 \nendtruck\n`: `\n| ! @ |\n| $ # |\n| |\n| |\n`,\n\t\t`truck 66\nendtruck\n`: `\n| |\n| |\n| |\n| |\n`,\n\t}\n}","func getWays(n int, c []int) int {\n\t// Write your code here\n\t// Create table of size len(c)+1 and n+1\n\ttable := make([][]int, len(c)+1)\n\tfor row := 0; row <= len(c); row++ {\n\t\trow_ := []int{}\n\n\t\tfor col := 0; col <= n; col++ {\n\t\t\trow_ = append(row_, 0)\n\t\t}\n\t\ttable[row] = row_\n\t\ttable[row][0] = 1\n\t}\n\n\tfor r := 1; r <= len(c); r++ {\n\t\tfor co := 1; co <= n; co++ {\n\t\t\ttop := table[r-1][co]\n\t\t\tif co-c[r-1] < 0 {\n\t\t\t\ttable[r][co] = top + 0\n\t\t\t} else {\n\t\t\t\ttable[r][co] = top + table[r][co-c[r-1]]\n\n\t\t\t}\n\t\t}\n\t}\n\tfmt.Println(table)\n\n\treturn table[len(c)][n]\n}","func mo(s string) string {\n\tif \"\" == s {\n\t\treturn \"\"\n\t}\n\n\tfmt.Println(\"s:\", s)\n\tb := []byte(s)\n\tl := len(b)\n\tm := l / 2\n\teven := false\n\tif 0 == l%2 {\n\t\tfmt.Println(\"even\")\n\t\teven = true\n\t}\n\n\tvar win result\n\n\tdmax := m + 1\n\tfor d := 0; d < dmax; d++ {\n\n\t\tvar lodd result\n\t\tvar rodd result\n\t\tvar leven result\n\t\tvar reven result\n\n\t\tif even {\n\t\t\tfmt.Println(\"possible remaining\", (m-d)*2, l)\n\t\t\tif (m-d)*2 <= win.l {\n\t\t\t\treturn string(win.b)\n\t\t\t}\n\t\t\tlm := m - d\n\n\t\t\tfmt.Println(\"left even\")\n\t\t\tleven = findEven(b, lm, l)\n\t\t\tfmt.Println(\" \", leven.l, string(leven.b))\n\t\t\tif leven.l == l {\n\t\t\t\tfmt.Println(\" 🎂\")\n\t\t\t\treturn s\n\t\t\t}\n\n\t\t\trm := m + d + 1\n\n\t\t\tfmt.Println(\"right even\")\n\t\t\treven = findEven(b, rm-1, l)\n\t\t\tfmt.Println(\" \", reven.l, string(reven.b))\n\t\t\tif reven.l == l {\n\t\t\t\tfmt.Println(\" 🎂\")\n\t\t\t\treturn s\n\t\t\t}\n\n\t\t\tfmt.Println(\"left odd\")\n\t\t\tlodd = findOdd(b, lm, l)\n\t\t\tfmt.Println(\" \", lodd.l, string(lodd.b))\n\n\t\t\tfmt.Println(\"right odd\")\n\t\t\trodd = findOdd(b, rm-1, l)\n\t\t\tfmt.Println(\" \", rodd.l, string(rodd.b))\n\n\t\t} else {\n\t\t\tfmt.Println(\"possible remaining\", (dmax-d)*2, l)\n\t\t\tif (dmax-d)*2 <= win.l {\n\t\t\t\treturn string(win.b)\n\t\t\t}\n\n\t\t\tlm := m - d\n\n\t\t\tfmt.Println(\"left odd\")\n\t\t\tlodd = findOdd(b, lm, l)\n\t\t\tfmt.Println(\" \", lodd.l, string(lodd.b))\n\t\t\tif lodd.l == l {\n\t\t\t\tfmt.Println(\" 🎂\")\n\t\t\t\treturn s\n\t\t\t}\n\n\t\t\trm := m + d + 1\n\n\t\t\tfmt.Println(\"right odd\")\n\t\t\trodd = findOdd(b, rm, l)\n\t\t\tfmt.Println(\" \", rodd.l, string(rodd.b))\n\t\t\tif rodd.l == l {\n\t\t\t\tfmt.Println(\" 🎂\")\n\t\t\t\treturn s\n\t\t\t}\n\n\t\t\tfmt.Println(\"left even\")\n\t\t\tleven = findEven(b, lm, l)\n\t\t\tfmt.Println(\" \", leven.l, string(leven.b))\n\n\t\t\tfmt.Println(\"right even\")\n\t\t\treven = findEven(b, rm-1, l)\n\t\t\tfmt.Println(\" \", reven.l, string(reven.b))\n\t\t}\n\n\t\t// figure max remaining size from here\n\n\t\tif lodd.l > win.l {\n\t\t\twin = lodd\n\t\t}\n\n\t\tif rodd.l > win.l {\n\t\t\twin = rodd\n\t\t}\n\n\t\tif leven.l > win.l {\n\t\t\twin = leven\n\t\t}\n\n\t\tif reven.l > win.l {\n\t\t\twin = reven\n\t\t}\n\t}\n\n\treturn string(win.b)\n}","func Day8Part1(input []string) (string, error) {\n\n\timData := input[0]\n\timWidth, imHeight := 25, 6\n\n\tlayers := generateLayers(imData, imWidth, imHeight)\n\n\tvar layerWithFewestZeros [][]int\n\tfewestZeros := imWidth * imHeight\n\tfor _, layer := range layers {\n\n\t\tzeros := 0\n\t\tfor y := 0; y < len(layer); y++ {\n\t\t\tfor x := 0; x < len(layer[y]); x++ {\n\t\t\t\tif layer[y][x] == 0 {\n\t\t\t\t\tzeros++\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif zeros < fewestZeros {\n\t\t\tfewestZeros = zeros\n\t\t\tlayerWithFewestZeros = layer\n\t\t}\n\t}\n\n\tones, twos := 0, 0\n\tfor y := 0; y < len(layerWithFewestZeros); y++ {\n\t\tfor x := 0; x < len(layerWithFewestZeros[y]); x++ {\n\t\t\tswitch layerWithFewestZeros[y][x] {\n\t\t\tcase 1:\n\t\t\t\tones++\n\t\t\tcase 2:\n\t\t\t\ttwos++\n\t\t\t}\n\t\t}\n\t}\n\n\treturn fmt.Sprintf(\"%d\", ones*twos), nil\n}","func JumpIterationsHd(out1 *uint64) {\n\t*out1 = 0x5\n}","func MinimumStepsPath(path []Point) int {\n\tif len(path) < 2 {\n\t\treturn 0\n\t}\n\tsteps := 0\n\tcurrent := path[0]\n\tfor i := 1; i < len(path); i++ {\n\t\tnext := path[i]\n\t\tdx, dy := delta(current, next)\n\t\tif dx < dy {\n\t\t\tsteps += dy\n\t\t} else {\n\t\t\tsteps += dx\n\t\t}\n\t\tcurrent = next\n\t}\n\treturn steps\n}","func main() {\n\trand.Seed(time.Now().UnixNano())\n\tgconfig := Kiai.Connect(\"localhost:4000\", \"Easyfucka\", 1, 0) //Creates a variable with a GameConfig type. The output unit of connect function is Gameconfig which consists of multiple int data. Width,Height,MaxMoves,MaxFires,MaxHealth,PlayerCount,Timeout\n\tdefer Kiai.Disconnect() //Makes sure that at the end of the main function bot disconnects from server.\n\t\n\t\n\tfor {\n\t\tturn = Kiai.WaitForTurn() //Assigns the starting values of the wait for turn to turn variable.\n\t\t\n\t\tif start == false {\n\t\t\tfirstdecision(gconfig)\n\t\t}\n\t\t\n\t\tif iterate == maxiteration {\n\t\t\titerate = 0\n\t\t\tif path < 4 {\n\t\t\t\tpath += 1 \n\t\t\t} else {\n\t\t\t\tpath = 1\t\n\t\t\t}\t\t\n\t\t}\n\t\t\n\t\tif path == 1 { //This part is one of the four movement tactics that belong to a path. For all the moves left it directs the bot towards the corner and if corner is reached, it starts main offense.\n\t\t\t\n\t\t\tfor i := 0; i < turn.MovesLeft; i++ {\n\t\t\t\tfiring()\n\t\t\t\t\n\t\t\t\tif turn.X == 0 && turn.Y == 0 {\n\t\t\t\t\tmaintactic()\n\t\t\t\t\tbreak\n\t\t\t\t} else if turn.X != 0 && turn.Y != 0 {\n\t\t\t\t\tturn.Move(Kiai.NorthWest)\n\t\t\t\t} else if turn.X == 0 && turn.Y != 0 {\n\t\t\t\t\tturn.Move(Kiai.North)\n\t\t\t\t} else if turn.X != 0 && turn.Y == 0 {\n\t\t\t\t\tturn.Move(Kiai.West)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tif path == 2 {\n\t\t\t\n\t\t\tfor i := 0; i < turn.MovesLeft; i++ {\n\t\t\t\tfiring()\n\t\t\t\t\n\t\t\t\tif turn.X == gconfig.Width-1 && turn.Y == 0 {\n\t\t\t\t\tmaintactic()\n\t\t\t\t\tbreak\n\t\t\t\t} else if turn.X != gconfig.Width-1 && turn.Y != 0 {\n\t\t\t\t\tturn.Move(Kiai.NorthEast)\n\t\t\t\t} else if turn.X == gconfig.Width-1 && turn.Y != 0 {\n\t\t\t\t\tturn.Move(Kiai.North)\n\t\t\t\t} else if turn.X != gconfig.Width-1 && turn.Y == 0 {\n\t\t\t\t\tturn.Move(Kiai.East)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tif path == 3 {\n\t\t\t\n\t\t\tfor i := 0; i < turn.MovesLeft; i++ {\n\t\t\t\tfiring()\n\t\t\t\t\n\t\t\t\tif turn.X == gconfig.Width-1 && turn.Y == gconfig.Height-1 {\n\t\t\t\t\tmaintactic()\n\t\t\t\t\tbreak\n\t\t\t\t} else if turn.X != gconfig.Width-1 && turn.Y != gconfig.Height-1 {\n\t\t\t\t\tturn.Move(Kiai.SouthEast)\n\t\t\t\t} else if turn.X == gconfig.Width-1 && turn.Y != gconfig.Height-1 {\n\t\t\t\t\tturn.Move(Kiai.South)\n\t\t\t\t} else if turn.X != gconfig.Width-1 && turn.Y == gconfig.Height-1 {\n\t\t\t\t\tturn.Move(Kiai.East)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tif path == 4 {\n\t\t\t\n\t\t\tfor i := 0; i < turn.MovesLeft; i++ {\n\t\t\t\tfiring()\n\t\t\t\t\n\t\t\t\tif turn.X == 0 && turn.Y == gconfig.Height-1 {\n\t\t\t\t\tmaintactic()\n\t\t\t\t\tbreak\n\t\t\t\t} else if turn.X != 0 && turn.Y != gconfig.Height-1 {\n\t\t\t\t\tturn.Move(Kiai.SouthWest)\n\t\t\t\t} else if turn.X == 0 && turn.Y != gconfig.Height-1 {\n\t\t\t\t\tturn.Move(Kiai.South)\n\t\t\t\t} else if turn.X != 0 && turn.Y == gconfig.Height-1 {\n\t\t\t\t\tturn.Move(Kiai.West)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\n//This section just shoots randomly towards the middle of the board at the last move if someone is not seen around.\n\t\n\t\tif path == 1 {\n\t\t\tif turn.Y == 0 {\n\t\t\t\tturn.Fire(Kiai.SouthEast)\n\t\t\t} else {\n\t\t\t\tturn.Fire(Kiai.East)\n\t\t\t}\t \n\t\t} \n\t\t\n\t\tif path == 2 {\n\t\t\tif turn.X == gconfig.Width - 1 {\n\t\t\t\tturn.Fire(Kiai.SouthWest)\n\t\t\t} else {\n\t\t\t\tturn.Fire(Kiai.South)\n\t\t\t}\t\t\n\t\t}\n\t\t\n\t\tif path == 3 {\n\t\t\tif turn.Y == gconfig.Height - 1 {\n\t\t\t\tturn.Fire(Kiai.NorthWest)\n\t\t\t} else {\n\t\t\t\tturn.Fire(Kiai.West)\n\t\t\t}\n\t\t}\n\t\t\n\t\tif path == 4 {\n\t\t\tif turn.X == 0 {\n\t\t\t\tturn.Fire(Kiai.NorthEast)\n\t\t\t} else {\n\t\t\t\tturn.Fire(Kiai.North)\n\t\t\t}\n\t\t}\n\t\t\n\t\titerate += 1\n\t\tKiai.EndTurn()\n\t}\n}","func solutionLvl2(puzzle string, parameters map[string]int) (answer int) {\n\tfor _, line := range strings.Split(puzzle, \"\\n\") {\n\t\tif line != \"\" {\n\t\t\tanswer += evaluateExpr2(line)\n\t\t}\n\t}\n\treturn\n}","func solveAlgo6(g Solver, l *Line) {\n\t//l.print(\"solveAlgo6\")\n\trsg := l.getUnsolvedRanges()\n\n\tfor _, r := range rsg {\n\t\tcs := l.getPotentialCluesForRange(r)\n\n\t\tlongest := 0\n\t\tisFound, step := l.getStepToNextBlank(r, false)\n\t\tif isFound {\n\t\t\tisFound = false\n\t\t\tfor _, c := range cs {\n\t\t\t\tif c.index < l.ce {\n\t\t\t\t\tnext := l.clues[c.index+1]\n\t\t\t\t\tif step <= c.length-r.length() || step > next.length {\n\t\t\t\t\t\tisFound = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tlongest = max(longest, c.length-r.length())\n\t\t\t}\n\t\t\t//if we didn't find anyone, we can blank taking into account the longest trail\n\t\t\tif len(cs) > 1 && !isFound {\n\t\t\t\tfor i := longest + 1; i <= step; i++ {\n\t\t\t\t\tg.SetValue(l.squares[r.max+i], BLANK)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tlongest = 0\n\t\tisFound, step = l.getStepToNextBlank(r, true)\n\t\tif isFound {\n\t\t\tisFound = false\n\t\t\tfor _, c := range cs {\n\t\t\t\tif c.index > l.cb {\n\t\t\t\t\tprevious := l.clues[c.index-1]\n\t\t\t\t\tif step <= c.length-r.length() || step > previous.length {\n\t\t\t\t\t\tisFound = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tlongest = max(longest, c.length-r.length())\n\t\t\t}\n\t\t\t//if we didn't find anyone, we can blank taking into account the longest trail\n\t\t\tif len(cs) > 1 && !isFound {\n\t\t\t\tfor i := longest + 1; i <= step; i++ {\n\t\t\t\t\tg.SetValue(l.squares[r.min-i], BLANK)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}","func slidingPuzzle(board [][]int) int {\n\n}","func TowerOfHanoiMoves(disks int) []string {\n\treturn towerOfHanoi(disks, 1, 3, 2)\n}","func gameOfLife(board [][]int) {\n\tm := len(board)\n\tn := len(board[0])\n\tr := make([][]int, m, m)\n\tfor i := 0; i < m; i++ {\n\t\tr[i] = make([]int, n, n)\n\t\tfor j := 0; j < n; j++ {\n\t\t\tr[i][j] = board[i][j]\n\t\t}\n\t}\n\tfor i := 0; i < m; i++ {\n\t\tfor j := 0; j < n; j++ {\n\t\t\tlives := 0\n\t\t\tif j > 0 {\n\t\t\t\tlives = lives + r[i][j-1]\n\t\t\t}\n\t\t\tif j < n-1 {\n\t\t\t\tlives = lives + r[i][j+1]\n\t\t\t}\n\t\t\tif i > 0 {\n\t\t\t\tlives = lives + r[i-1][j]\n\t\t\t\tif j > 0 {\n\t\t\t\t\tlives = lives + r[i-1][j-1]\n\t\t\t\t}\n\t\t\t\tif j < n-1 {\n\t\t\t\t\tlives = lives + r[i-1][j+1]\n\t\t\t\t}\n\t\t\t}\n\t\t\tif i < m-1 {\n\t\t\t\tlives = lives + r[i+1][j]\n\t\t\t\tif j > 0 {\n\t\t\t\t\tlives = lives + r[i+1][j-1]\n\t\t\t\t}\n\t\t\t\tif j < n-1 {\n\t\t\t\t\tlives = lives + r[i+1][j+1]\n\t\t\t\t}\n\t\t\t}\n\t\t\tl := r[i][j]\n\t\t\tswitch {\n\t\t\tcase l == 0 && lives == 3:\n\t\t\t\tboard[i][j] = 1\n\t\t\tcase l == 1 && (lives == 2 || lives == 3):\n\t\t\t\tboard[i][j] = 1\n\t\t\tdefault:\n\t\t\t\tboard[i][j] = 0\n\t\t\t}\n\t\t}\n\t}\n}","func firstStep(y int) {\n\tfmt.Println(\"1.1\", y)\n\ty = 52 // 1.4 assign y to 52\n\tfmt.Println(\"1.2\", y)\n}","func Step(a, b Universe) {\n\t//based on prev state of universe\n for i, row := range a {\n for j := range row {\n\t\t\tif a.Next(j, i) {\n\t\t\t\tb[i][j] = true\n\t\t\t} else {\n b[i][j] = false\n\t\t\t}\n\t\t}\n\t\tfmt.Println(\"\\x0c\")\n\t}\n}","func main15() {\n\tgph := new(Graph)\n\tgph.Init(5)\n gph.AddDirectedEdge(0, 1, 3)\n gph.AddDirectedEdge(0, 4, 2)\n gph.AddDirectedEdge(1, 2, 1)\n gph.AddDirectedEdge(2, 3, 1)\n gph.AddDirectedEdge(4, 1, -2)\n gph.AddDirectedEdge(4, 3, 1)\n gph.BellmanFordShortestPath(0)\n}","func (n *TreeNode) Step() (s Step, pass bool) {\n\treturn n.step, n.pass\n}","func ways(n, goal, most int) [][]int {\n\tif goal < 0 || most*n < goal {\n\t\treturn nil\n\t}\n\n\tif n == 1 {\n\t\treturn [][]int{{goal}}\n\t}\n\n\taccumulate := make([][]int, 0)\n\n\tfor i := 0; i <= most; i++ {\n\t\tif below := ways(n-1, goal-i, i); below != nil {\n\t\t\taccumulate = append(accumulate, paint(i, below)...)\n\t\t}\n\t}\n\n\treturn accumulate\n}","func run(input string) (interface{}, interface{}) {\n\tvar displays []sevenSegmentDisplay\n\n\tfor _, line := range strings.Split(input, \"\\n\") {\n\t\tdigitsAndTarget := strings.Split(line, \" | \")\n\t\tsegments := strings.Split(digitsAndTarget[0], \" \")\n\t\tval := strings.Split(digitsAndTarget[1], \" \")\n\t\t// sort them to enable the lookup table in the future\n\t\tfor i, s := range segments {\n\t\t\tsegments[i] = helpers.SortString(s)\n\t\t}\n\t\tfor i, s := range val {\n\t\t\tval[i] = helpers.SortString(s)\n\t\t}\n\t\tdisplays = append(displays, sevenSegmentDisplay{\n\t\t\tsegments: segments,\n\t\t\tvalues: val,\n\t\t})\n\t}\n\n\ttotalA := 0\n\tfor _, segment := range displays {\n\t\ttotalA += solveBasicSegments(segment)\n\t}\n\n\ttotalB := 0\n\tfor _, segment := range displays {\n\t\ttotalB += solveAllSegments(segment)\n\t}\n\n\treturn totalA, totalB\n}","func minRefuelStops(target int, startFuel int, stations [][]int) int {\n \n}","func (e *OptTester) OptSteps(verbose bool) (string, error) {\n\tvar buf bytes.Buffer\n\tvar prev, next string\n\tif verbose {\n\t\tfmt.Print(\"------ optsteps verbose output starts ------\\n\")\n\t}\n\toutput := func(format string, args ...interface{}) {\n\t\tfmt.Fprintf(&buf, format, args...)\n\t\tif verbose {\n\t\t\tfmt.Printf(format, args...)\n\t\t}\n\t}\n\tindent := func(str string) {\n\t\tstr = strings.TrimRight(str, \" \\n\\t\\r\")\n\t\tlines := strings.Split(str, \"\\n\")\n\t\tfor _, line := range lines {\n\t\t\toutput(\" %s\\n\", line)\n\t\t}\n\t}\n\tfor i := 0; ; i++ {\n\t\to := xform.NewOptimizer(&e.evalCtx)\n\n\t\t// Override SetOnRuleMatch to stop optimizing after the ith rule matches.\n\t\tsteps := i\n\t\tlastRuleName := opt.InvalidRuleName\n\t\to.SetOnRuleMatch(func(ruleName opt.RuleName) bool {\n\t\t\tif steps == 0 {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tsteps--\n\t\t\tlastRuleName = ruleName\n\t\t\treturn true\n\t\t})\n\n\t\troot, required, err := e.buildExpr(o.Factory())\n\t\tif err != nil {\n\t\t\treturn \"\", err\n\t\t}\n\n\t\tnext = o.Optimize(root, required).FormatString(e.Flags.Format)\n\t\tif steps != 0 {\n\t\t\t// All steps were not used, so must be done.\n\t\t\tbreak\n\t\t}\n\n\t\tif i == 0 {\n\t\t\toutput(\"*** Initial expr:\\n\")\n\t\t\t// Output starting tree.\n\t\t\tindent(next)\n\t\t} else {\n\t\t\toutput(\"\\n*** %s applied; \", lastRuleName.String())\n\n\t\t\tif prev == next {\n\t\t\t\t// The expression can be unchanged if a part of the memo changed that\n\t\t\t\t// does not affect the final best expression.\n\t\t\t\toutput(\"best expr unchanged.\\n\")\n\t\t\t} else {\n\t\t\t\toutput(\"best expr changed:\\n\")\n\t\t\t\tdiff := difflib.UnifiedDiff{\n\t\t\t\t\tA: difflib.SplitLines(prev),\n\t\t\t\t\tB: difflib.SplitLines(next),\n\t\t\t\t\tContext: 100,\n\t\t\t\t}\n\n\t\t\t\ttext, _ := difflib.GetUnifiedDiffString(diff)\n\t\t\t\t// Skip the \"@@ ... @@\" header (first line).\n\t\t\t\ttext = strings.SplitN(text, \"\\n\", 2)[1]\n\t\t\t\tindent(text)\n\t\t\t}\n\t\t}\n\n\t\tprev = next\n\t}\n\n\t// Output ending tree.\n\toutput(\"\\n*** Final best expr:\\n\")\n\tindent(next)\n\n\tif verbose {\n\t\tfmt.Print(\"------ optsteps verbose output ends ------\\n\")\n\t}\n\n\treturn buf.String(), nil\n}","func MoveKnights(knights uint64) uint64 {\n\tnewKnights := knights\n\tmoves := [4]uint64{15, 17, 6, 10}\n\tfor i := 0; i < 4; i++ {\n\t\tnewKnights = newKnights | (knights << moves[i]) | knights>>moves[i]\n\t}\n\treturn newKnights\n}","func uniquePathsWithObstacles(obstacleGrid [][]int) int {\n\trow, col := len(obstacleGrid), len(obstacleGrid[0])\n\t// if the starting point has obstacle, then we can't walk to anywhere\n\tif obstacleGrid[0][0] == 1 {\n\t\treturn 0\n\t}\n\n\t// if the starting point has no obstacle, then the number of path walking to starting point is 1\n\tobstacleGrid[0][0] = 1\n\n\t// for first column, if the cell has no obstacle , then set the number of path of that cell to 1, otherwise 0\n\tfor i := 1; i < row; i++ {\n\t\tif obstacleGrid[i][0] == 0 && obstacleGrid[i-1][0] == 1 {\n\t\t\tobstacleGrid[i][0] = 1\n\t\t} else {\n\t\t\tobstacleGrid[i][0] = 0\n\t\t}\n\t}\n\n\t// for the first row, if the cell has no obstacle, then set the number of path of that cell to 1, otherwise 0\n\tfor i := 1; i < col; i++ {\n\t\tif obstacleGrid[0][i] == 0 && obstacleGrid[0][i-1] == 1 {\n\t\t\tobstacleGrid[0][i] = 1\n\t\t} else {\n\t\t\tobstacleGrid[0][i] = 0\n\t\t}\n\t}\n\n\t// every cell can only be reached from up or left, if the cell has obstacle, we set the number of path walking to that cell to 0, otherwise\n\t// set it to the sum of up and left cell\n\tfor i := 1; i < row; i++ {\n\t\tfor j := 1; j < col; j++ {\n\t\t\tif obstacleGrid[i][j] == 0 {\n\t\t\t\tobstacleGrid[i][j] = obstacleGrid[i-1][j] + obstacleGrid[i][j-1]\n\t\t\t} else {\n\t\t\t\tobstacleGrid[i][j] = 0\n\t\t\t}\n\t\t}\n\t}\n\n\treturn obstacleGrid[row-1][col-1]\n}","func main() {\n\tfmt.Println(numTreesDp(19))\n}","func main() {\n\tscanner := bufio.NewScanner(os.Stdin)\n\tscanner.Buffer(make([]byte, 1000000), 1000000)\n\n\t// W: number of columns.\n\t// H: number of rows.\n\tvar W, H int\n\tscanner.Scan()\n\tfmt.Sscan(scanner.Text(),&W, &H)\n\n\tfor i := 0; i < H; i++ {\n\t\tscanner.Scan()\n\t\tLINE := scanner.Text() // represents a line in the grid and contains W integers. Each integer represents one room of a given type.\n\t\tre := regexp.MustCompile(\" \")\n\t\tstr := \"[\" + re.ReplaceAllString(LINE, \",\") + \"]\"\n\t\tvar ints []int\n\t\tjson.Unmarshal([]byte(str), &ints)\n\n\t}\n\t// EX: the coordinate along the X axis of the exit (not useful for this first mission, but must be read).\n\tvar EX int\n\tscanner.Scan()\n\tfmt.Sscan(scanner.Text(),&EX)\n\n\tfor {\n\t\tvar XI, YI int\n\t\tvar POS string\n\t\tscanner.Scan()\n\t\tfmt.Sscan(scanner.Text(),&XI, &YI, &POS)\n\n\n\t\t// fmt.Fprintln(os.Stderr, \"Debug messages...\")\n\n\t\t// One line containing the X Y coordinates of the room in which you believe Indy will be on the next turn.\n\t\tfmt.Println(\"0 0\")\n\t}\n}","func kerDIF8(a []fr.Element, twiddles [][]fr.Element, stage int) {\n\n\tfr.Butterfly(&a[0], &a[4])\n\tfr.Butterfly(&a[1], &a[5])\n\tfr.Butterfly(&a[2], &a[6])\n\tfr.Butterfly(&a[3], &a[7])\n\ta[5].Mul(&a[5], &twiddles[stage+0][1])\n\ta[6].Mul(&a[6], &twiddles[stage+0][2])\n\ta[7].Mul(&a[7], &twiddles[stage+0][3])\n\tfr.Butterfly(&a[0], &a[2])\n\tfr.Butterfly(&a[1], &a[3])\n\tfr.Butterfly(&a[4], &a[6])\n\tfr.Butterfly(&a[5], &a[7])\n\ta[3].Mul(&a[3], &twiddles[stage+1][1])\n\ta[7].Mul(&a[7], &twiddles[stage+1][1])\n\tfr.Butterfly(&a[0], &a[1])\n\tfr.Butterfly(&a[2], &a[3])\n\tfr.Butterfly(&a[4], &a[5])\n\tfr.Butterfly(&a[6], &a[7])\n}","func parent_step(x uint) uint {\n\t// xy01 -> x011\n\tk := level(x)\n\tone := uint(1)\n\treturn (x | (one << k)) & ^(one << (k + 1))\n}","func path(b board) (p float64) {\n\tfor _, i := range lh {\n\t\tfor _, j := range lh {\n\t\t\tvar lrl float64\n\t\t\tfor _, k := range rh {\n\t\t\t\tlrl += t[b[i]][b[k]][b[j]]\n\t\t\t}\n\t\t\tp += pathpair[i][j] * (letterpair[b[i]][b[j]] + lrl)\n\t\t}\n\t}\n\tfor _, i := range rh {\n\t\tfor _, j := range rh {\n\t\t\tvar rlr float64\n\t\t\tfor _, k := range lh {\n\t\t\t\trlr += t[b[i]][b[k]][b[j]]\n\t\t\t}\n\t\t\tp += pathpair[i][j] * (letterpair[b[i]][b[j]] + rlr)\n\t\t}\n\t}\n\treturn\n}","func day1B() {\n\t//Test comment\n\tvar nums = []int{+5, -11, +17, +9, -4, -2, +11, -10, -16, +18, +18, -2, -2, +17, +13, +14, -11, +19, -14, +8, +10, -3, -12, +13, -3, +18, -20, +8, +3, +8, +13, +9, +14, -11, -6, +16, -12, +14, -8, +3, -18, -11, +6, -2, -14, -2, +17, -2, +6, -1, -13, +20, +9, +14, -15, -16, +18, -4, -8, +5, +19, -1, +19, +11, -3, +16, -12, -6, +3, -7, -1, +4, -15, -5, +13, +9, +11, +2, +17, +12, -7, -16, +13, -11, -14, +22, +16, -8, +16, +8, -10, +8, -19, +17, -9, +8, -2, +18, +9, +1, +10, -14, +6, +2, +2, -15, -15, -6, +11, +16, -8, +14, -18, -12, +14, +7, -1, -13, -18, -13, +5, -3, -18, +7, -2, -2, +6, -12, +15, +1, +18, -8, +22, +6, -1, +9, +9, +17, +18, +9, +13, -8, -17, +16, +16, +12, -11, -6, -9, +13, +11, -8, -12, +8, -10, +17, -13, -17, +7, -10, -3, +4, +1, -11, +3, -6, +19, +4, +13, +1, +11, +6, -3, +16, +8, +1, +17, -10, +18, -3, -7, +20, +4, +1, -8, +1, -2, +12, -1, +8, +8, +18, -10, +6, -16, +1, -3, +10, -11, -1, -5, +15, -11, -10, +18, +4, +8, +14, +6, +16, +12, +2, -19, +18, -5, -16, -10, -7, -3, +13, +14, +16, +13, -12, +15, +8, +17, +10, +7, +6, +17, +19, +19, -16, +10, +4, -16, -14, +8, +7, -22, -8, -19, +13, +12, -18, -21, +10, -12, -2, -12, -11, -16, -20, +6, -3, +2, -16, +9, -13, +1, +2, -13, +15, +9, -7, +22, -2, +18, +5, +4, -20, +14, -17, -19, +16, -6, +19, +1, +5, +24, +11, -16, +15, +13, +15, -3, -5, -17, -1, +8, +5, -10, +9, -2, +7, -11, -17, -13, -1, -9, +4, -10, -26, -22, +16, +14, +21, -20, +43, +8, -12, +2, -7, +15, +12, +17, +12, -18, +16, -12, +13, +8, +14, -12, +26, -6, +18, -3, -7, +19, -5, +13, +12, -14, -7, -14, +13, +13, -18, -6, +3, -12, +5, -20, +19, -11, -7, -15, -11, +12, -14, +24, -1, +18, +24, -9, +11, +9, -3, +8, -21, +1, +17, +1, +4, +20, -12, -5, +23, -9, +6, -12, -36, +13, -3, +33, -2, +9, +11, +23, -18, +22, -11, +14, +9, +8, -12, +5, -3, -3, +8, +16, +6, -18, +10, -18, -6, -1, -2, +24, -17, +23, +16, -9, +10, +23, -10, +2, +2, -9, +13, +3, +18, +12, +15, +16, -3, -7, -7, -5, +9, +1, -3, -19, -7, +17, +3, +13, +25, -4, -1, -19, -7, +15, -21, +43, +17, +5, +19, +10, +14, -15, -12, +19, +19, -16, -7, -7, -15, +6, -8, +18, +12, -7, -18, +9, +18, +16, -23, -18, -3, +12, -15, +9, +3, -14, +16, +18, +13, +19, -1, +11, +14, -4, -16, +11, -12, +27, -1, -13, +9, +7, -9, -1, +14, -35, -28, +1, +4, +15, -18, +10, -6, +12, -2, -5, -23, +31, -23, -37, +6, -13, -3, +4, +38, -23, -28, -24, -15, +4, +3, -16, +32, +13, -24, -9, -41, -41, -13, -41, -17, +16, -3, -36, -136, -9, +7, -4, -54, +20, +3, +11, +13, +16, +6, +6, -29, -118, -68, -416, -393, -73804, +17, +8, -14, +12, -22, -19, -7, -3, -14, +8, -3, -3, +16, -14, +5, -19, +16, +15, +8, +11, -14, -13, +3, +14, -15, +19, +26, +8, -11, -12, +17, -12, -12, +20, +22, +13, +14, +13, -3, -2, -1, -4, -16, +7, +12, +18, -15, -11, +7, -15, +11, +16, +13, +16, -2, -9, -4, +6, -8, -27, +16, -7, +87, +17, +11, -12, -2, +11, -13, -9, -10, -21, +15, -23, -15, +13, +11, +37, +16, +22, +16, +12, +18, -9, -8, +19, -5, -4, +13, +8, +4, -9, +4, +9, +4, -19, -2, -11, -2, +16, +17, +6, -8, +19, -2, +6, +2, -10, +12, +6, -20, -6, +5, +14, +12, +20, -21, +22, -2, +9, -2, -14, -15, +14, +7, -2, +9, -19, -52, -20, +4, -1, -18, +9, +7, -17, -22, -20, -7, -2, -9, +8, -3, +11, +18, -7, +17, +22, -18, -15, -19, -8, +13, +3, -15, +17, -3, -43, -34, +9, -37, +41, +141, -16, +19, -10, +14, +4, -7, -17, +12, +23, +2, +16, +36, -61, -253, -41, -44, -17, +10, -9, -5, +15, +20, +16, -4, +3, -12, +21, -11, -9, +16, -24, -12, +5, -2, -6, -18, -15, +16, -10, -5, -4, +8, +6, -20, -3, -19, +7, +4, -3, -11, +20, +4, +17, -3, -5, -3, +6, -4, -16, -15, +3, +19, -18, +16, -9, +17, +15, -25, -12, -17, -17, -4, +13, -15, +4, +17, -7, +13, -18, +4, +3, +10, +5, -1, +12, +9, -19, +16, +2, -11, -14, -14, -14, -2, +6, -3, +1, -15, +3, +2, -11, -9, +4, -3, +13, -1, -20, -19, -13, -8, -1, +13, +8, +9, +2, +6, +8, -9, -20, -5, +11, +20, +2, +9, +15, +17, +3, +18, -20, -3, +7, +8, +15, -6, -10, -16, +19, +2, -32, -7, -11, +3, +11, -25, -11, +16, -3, +16, -35, +10, +16, +24, -3, +1, -15, -8, +20, +27, +23, +20, -1, -14, +34, +14, +3, -18, +6, +10, +9, -18, -27, -42, -41, -37, -12, -22, +15, +12, -19, -18, +17, -15, +18, -4, +20, -12, +17, -34, -23, -8, -27, -4, -8, +20, -10, -8, -19, +8, -4, +11, -1, -11, +9, +1, -4, +15, -6, +3, -10, -10, -4, +5, +28, -2, +15, -21, +19, -1, -6, -8, +13, -44, +3, -9, +3, -24, -19, +17, -3, +7, -16, +11, +17, -27, -15, -2, -11, -18, +9, -6, -17, +2, -16, +13, +16, -9, +1, -13, -5, -11, +4, -2, +8, +3, +25, +15, -20, +7, +2, +5, -3, -13, -17, -5, -6, +4, +20, +22, +8, +18, -7, +4, +13, -1, -6, -14, -4, -5, -25, +21, -5, -20, +15, +20, +1, +1, +3, +5, +3, +75248}\n\tsum := 0\n\tset := make(map[int]bool)\n\tset[0] = true\n\tm := false\n\tfor set[sum] {\n\t\tfor _, num := range nums {\n\t\t\t// map the freq and check if array has that value, if true print and break\n\t\t\tsum += num\n\t\t\tif set[sum] {\n\t\t\t\tfmt.Println(\"freq match\")\n\t\t\t\tm = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tset[sum] = true\n\t\t}\n\t\tif m {\n\t\t\tbreak\n\t\t}\n\t}\n\tfmt.Println(\"match:\", sum)\n}","func convertStepToDays(insight SearchInsight) int {\n\tif insight.Step.Days != nil {\n\t\treturn *insight.Step.Days\n\t} else if insight.Step.Hours != nil {\n\t\treturn 0\n\t} else if insight.Step.Weeks != nil {\n\t\treturn *insight.Step.Weeks * 7\n\t} else if insight.Step.Months != nil {\n\t\treturn *insight.Step.Months * 30\n\t} else if insight.Step.Years != nil {\n\t\treturn *insight.Step.Years * 365\n\t}\n\n\treturn 0\n}","func (p *Mach) Step() bool {\n\tinstr := p.Mem[p.Reg[p.P]%SZ]\n\ti, n := (instr>>4)&15, instr&15\n\tswitch i {\n\tcase 0: // LDN, but IDL if N==0\n\t\tif n == 0 {\n\t\t\t// NOP -- we have moved WAIT to 0x68.\n\t\t} else {\n\t\t\tp.D = p.Mem[p.Reg[n]%SZ]\n\t\t}\n\tcase 1: // INC rn\n\t\tp.Reg[n]++\n\tcase 2: // DEC rn\n\t\tp.Reg[n]--\n\tcase 3: // BR...\n\t\tswitch n {\n\t\tcase 0:\n\t\t\tp.shortBranch(true)\n\t\tcase 1:\n\t\t\tp.shortBranch(!p.Q)\n\t\tcase 2:\n\t\t\tp.shortBranch(p.D == 0)\n\t\tcase 3:\n\t\t\tp.shortBranch(p.DF)\n\t\tcase 4:\n\t\t\tp.shortBranch(16 == 16&(p.EF<<1))\n\t\tcase 5:\n\t\t\tp.shortBranch(16 == 16&(p.EF<<2))\n\t\tcase 6:\n\t\t\tp.shortBranch(16 == 16&(p.EF<<3))\n\t\tcase 7:\n\t\t\tp.shortBranch(16 == 16&(p.EF<<4))\n\n\t\tcase 8:\n\t\t\tp.shortBranch(false)\n\t\tcase 9:\n\t\t\tp.shortBranch(p.Q)\n\t\tcase 10:\n\t\t\tp.shortBranch(p.D != 0)\n\t\tcase 11:\n\t\t\tp.shortBranch(!p.DF)\n\t\tcase 12:\n\t\t\tp.shortBranch(0 == 16&(p.EF<<1))\n\t\tcase 13:\n\t\t\tp.shortBranch(0 == 16&(p.EF<<2))\n\t\tcase 14:\n\t\t\tp.shortBranch(0 == 16&(p.EF<<3))\n\t\tcase 15:\n\t\t\tp.shortBranch(0 == 16&(p.EF<<4))\n\t\t}\n\tcase 4: // LDA\n\t\tp.D = p.Mem[p.Reg[n]%SZ]\n\t\tp.Reg[n]++\n\tcase 5: // STR\n\t\tp.Mem[p.Reg[n]%SZ] = p.D\n\tcase 6: // I/O\n // Special case 0x68:\n\t\tif n == 8 {\n\t\t\treturn false // The spare opcode 0x68 becomes IDL/STOP (rather than opcode 0)\n\t\t}\n // Special case 0x60:\n\t\tif n == 0 {\n\t\t\tp.Reg[p.X]++ // IRX\n\t\t}\n // Inputs and Outputs\n\t\tif n < 8 {\n\t\t\tp.Out[n] = p.D // OUT n&7\n\t\t\t// println(\"OUT\", n, p.D)\n\t\t} else {\n\t\t\tp.D = p.In[(n & 7)] // IN n&7\n\t\t}\n\tcase 7: // misc...\n\t\tswitch n {\n\t\tcase 0: // RET\n\n\t\tcase 1: // DIS\n\n\t\tcase 2: // LDXA\n\t\t\tp.D = p.Mem[p.Reg[p.X]%SZ]\n\t\t\tp.Reg[p.X]++\n\t\tcase 3: // STXD\n\t\t\tp.Mem[p.Reg[p.X]%SZ] = p.D\n\t\t\tp.Reg[p.X]--\n\t\tcase 4: //\n\t\t\tb := p.dfByte()\n\t\t\tp.DF = (int(b)+int(p.D)+int(p.Mem[p.Reg[p.X]%SZ]) > 255)\n\t\t\tp.D += b + p.Mem[p.Reg[p.X]%SZ]\n\t\tcase 5: //\n\t\t\tb := p.dfByte()\n\t\t\tp.DF = (int(p.D) > int(p.Mem[p.Reg[p.X]%SZ])+int(b))\n\t\t\tp.D = b + p.Mem[p.Reg[p.X]%SZ] - p.D\n\t\tcase 6: // SHRC\n\t\t\tc := (p.D&1 == 128)\n\t\t\tp.D = (p.D >> 1) | (p.dfByte() << 8)\n\t\t\tp.DF = c\n\t\tcase 7: //\n\t\t\tb := p.dfByte()\n\t\t\tp.DF = (int(p.D)+int(b) < int(p.Mem[p.Reg[p.X]%SZ]))\n\t\t\tp.D = b + p.D - p.Mem[p.Reg[p.X]%SZ]\n\t\tcase 8: // LDI\n\t\t\tp.D = p.imm()\n\t\tcase 9: //\n\t\t\tp.D |= p.imm()\n\t\tcase 10: // REQ\n\t\t\tp.Q = false\n\t\tcase 11: // SEQ\n\t\t\tp.Q = true\n\t\tcase 12: // ADCI\n\t\t\tb := p.dfByte()\n\t\t\timm := p.imm()\n\t\t\tp.DF = (int(b)+int(p.D)+int(imm) > 255)\n\t\t\tp.D += b + imm\n\t\tcase 13: // SDBI\n\t\t\tb := p.dfByte()\n\t\t\timm := p.imm()\n\t\t\tp.DF = (p.D > b+imm)\n\t\t\tp.D = b + imm - p.D\n\t\tcase 14: // SHLC\n\t\t\tc := (p.D&128 == 128)\n\t\t\tp.D = (p.D << 1) | p.dfByte()\n\t\t\tp.DF = c\n\t\tcase 15: // SMBI\n\t\t\tb := p.dfByte()\n\t\t\timm := p.imm()\n\t\t\tp.DF = (b+p.D < imm)\n\t\t\tp.D = b + p.D - imm\n\t\t}\n\tcase 8: // Get Lo\n\t\tp.D = byte(p.Reg[n])\n\tcase 9: // Get Hi\n\t\tp.D = byte(p.Reg[n] >> 8)\n\tcase 10: // Set Lo\n\t\tp.Reg[n] = (p.Reg[n] & 0xFF00) | uint16(p.D)\n\tcase 11: // Set Hi\n\t\tp.Reg[n] = (p.Reg[n] & 0x00FF) | (uint16(p.D) << 8)\n\tcase 12: // LBR...\n\tcase 13: // Set P\n\t\tp.P = n\n\tcase 14: // Set X\n\t\tp.X = n\n\tcase 15: // misc...\n\n\t\tswitch n {\n\t\tcase 0: // LDX\n\t\t\tp.D = p.Mem[p.Reg[p.X]%SZ]\n\t\tcase 1: // OR\n\t\t\tp.D |= p.Mem[p.Reg[p.X]%SZ]\n\t\tcase 2: // AND\n\t\t\tp.D &= p.Mem[p.Reg[p.X]%SZ]\n\t\tcase 3: // XOR\n\t\t\tp.D ^= p.Mem[p.Reg[p.X]%SZ]\n\t\tcase 4: //\n\t\t\tp.DF = (int(p.D)+int(p.Mem[p.Reg[p.X]%SZ]) > 255)\n\t\t\tp.D += p.Mem[p.Reg[p.X]%SZ]\n\t\tcase 5: // SD\n\t\t\tp.DF = (int(p.D) > int(p.Mem[p.Reg[p.X]%SZ]))\n\t\t\tp.D = p.Mem[p.Reg[p.X]%SZ] - p.D\n\t\tcase 6: // SHR\n\t\t\tp.D = p.D >> 1\n\t\tcase 7: // SM\n\t\t\tp.DF = (int(p.D) < int(p.Mem[p.Reg[p.X]%SZ]))\n\t\t\tp.D = p.D - p.Mem[p.Reg[p.X]%SZ]\n\t\tcase 8: // LDI\n\t\t\tp.D = p.imm()\n\t\tcase 9: //\n\t\t\tp.D |= p.imm()\n\t\tcase 10: //\n\t\t\tp.D &= p.imm()\n\t\tcase 11: //\n\t\t\tp.D ^= p.imm()\n\t\tcase 12: //\n\t\t\timm := p.imm()\n\t\t\tp.DF = (p.D+imm > 255)\n\t\t\tp.D += imm\n\t\tcase 13: //\n\t\t\timm := p.imm()\n\t\t\tp.DF = (p.D > imm)\n\t\t\tp.D = imm - p.D\n\t\tcase 14: // SHL\n\t\t\tp.D = p.D << 1\n\t\tcase 15: //\n\t\t\timm := p.imm()\n\t\t\tp.DF = (p.D < imm)\n\t\t\tp.D = p.D - imm\n\t\t}\n\t}\n\tp.Reg[p.P]++\n\treturn true\n}","func doTurn2(from, to []bool, stride int) {\n\tfor pos := range from {\n\t\tvar aliveNeighbors int\n\n\t\t// the following nested branches are ordered in most likely -> least likely\n\t\t// on a 100x100 grid, 9602/10000 cells will not go inside the outer branches\n\t\t// e.g.: most cells have have a direct up and left neighbor, only cells on the top and left borders do not, for which we wrap around\n\n\t\tvar upLeft int\n\n\t\t// try directly up and left\n\t\tif upLeft = pos - stride - 1; upLeft < 0 {\n\n\t\t\t// try directly up and wrapping to last col\n\t\t\tif upLeft = pos - 1; upLeft < 0 {\n\n\t\t\t\t// this cell is in the upper left corner, wrap to last row and col\n\t\t\t\tupLeft = len(from) - 1\n\t\t\t}\n\t\t}\n\n\t\tif from[upLeft] {\n\t\t\taliveNeighbors++\n\t\t}\n\n\t\tvar up int\n\n\t\t// try directly up\n\t\tif up = pos - stride; up < 0 {\n\n\t\t\t// this cell is in the top row, wrap to last row\n\t\t\tup = len(from) - (stride - pos)\n\t\t}\n\n\t\tif from[up] {\n\t\t\taliveNeighbors++\n\t\t}\n\n\t\tvar upRight int\n\n\t\t// try directly up and right\n\t\tif upRight = pos - stride + 1; upRight < 0 {\n\n\t\t\t// try directly up and wrapping to first col\n\t\t\tif upRight = pos - stride - stride + 1; upRight < 0 {\n\n\t\t\t\t// this cell is in the upper right corner, wrap to last row & first col\n\t\t\t\tupRight = len(from) - stride\n\t\t\t}\n\t\t}\n\n\t\tif from[upRight] {\n\t\t\taliveNeighbors++\n\t\t}\n\n\t\t// go directly left\n\t\tleft := pos - 1\n\t\t// cell is on the left border and pos-1 wrapped around, so move down 1 row\n\t\tif pos%stride == 0 {\n\t\t\tleft += stride\n\t\t}\n\n\t\tif from[left] {\n\t\t\taliveNeighbors++\n\t\t}\n\n\t\t// go directly right\n\t\tright := pos + 1\n\t\t// cell is n the right border and pos+1 wrapped around, so move up 1 row\n\t\tif pos%stride == stride-1 {\n\t\t\tright -= stride\n\t\t}\n\n\t\tif from[right] {\n\t\t\taliveNeighbors++\n\t\t}\n\n\t\tvar downLeft int\n\n\t\t// try directly down and left\n\t\tif downLeft = pos + stride - 1; downLeft >= len(from) {\n\n\t\t\t// try wrapping to last col\n\t\t\tif downLeft = pos + stride + stride - 1; downLeft >= len(from) {\n\n\t\t\t\t// we are in bottom left corner\n\t\t\t\tdownLeft = stride - 1\n\t\t\t}\n\t\t}\n\n\t\tif from[downLeft] {\n\t\t\taliveNeighbors++\n\t\t}\n\n\t\tvar down int\n\n\t\tif down = pos + stride; down >= len(from) {\n\n\t\t\t// we are in bottom row, wrap to top\n\t\t\tdown = stride - (len(from) - pos)\n\t\t}\n\n\t\tif from[down] {\n\t\t\taliveNeighbors++\n\t\t}\n\n\t\tvar downRight int\n\n\t\t// try directly down and right\n\t\tif downRight = pos + stride + 1; downRight >= len(from) {\n\n\t\t\t// we are on last col\n\t\t\tif downRight = pos + 1; downRight >= len(from) {\n\n\t\t\t\tdownRight = 0\n\t\t\t}\n\t\t}\n\n\t\tif from[downRight] {\n\t\t\taliveNeighbors++\n\t\t}\n\n\t\tto[pos] = (from[pos] && (aliveNeighbors == 2 || aliveNeighbors == 3)) || aliveNeighbors == 3\n\t}\n}","func findDirections(x, y int, length *int, value int, directions []dirTable) int {\n num := 0\n numChecks := 0\n if value != wall || (getMaze(x, y) == path && setCell(x, y, check, noUpdate, *length, numChecks)) {\n minLength := [4]int {*length, *length, *length, *length}\n len := *length\n for {\n setInt(&dspLength, len)\n dirLength := [4]int {len, len, len, len}\n offset := rand.Intn(4)\n for i := 0; i < 4; i++ {\n dir := &stdDirection[(i + offset) % 4]\n num += look(dir.heading, x, y, dir.x, dir.y, num, value, directions, &dirLength[i] , &minLength[i], &numChecks)\n }\n if num > 0 || len < 0 {\n break\n }\n minLength := min( min(minLength[0], minLength[1]), min(minLength[2], minLength[3]) )\n if minLength <= 0 {\n minLength = 1\n }\n len -= minLength\n }\n if len == *length && len < getInt(&depth) {\n len++\n }\n *length = len\n if getMaze(x, y) == check {\n setMaze(x, y, path)\n }\n }\n if getInt(&maxChecks) < numChecks {\n setInt(&maxChecks , numChecks)\n }\n return (num);\n}","func stepfrom(dir rune, x, y int) (sx, sy int) {\n\tswitch dir {\n\tcase 'N':\n\t\treturn x, y + 1\n\tcase 'S':\n\t\treturn x, y - 1\n\tcase 'W':\n\t\treturn x + 1, y\n\tcase 'E':\n\t\treturn x - 1, y\n\t}\n\tpanic(\"invalid stepfrom direction\")\n}","func (w walk) cycleDepth() uint {\n\tif len(w) == 0 {\n\t\treturn 0\n\t}\n\tn := w[len(w)-1]\n\tc := uint(1)\n\tfor i := len(w) - 2; i >= 0; i-- {\n\t\tif n == w[i] {\n\t\t\tc++\n\t\t}\n\t}\n\treturn c\n}","func shortestPathAllKeys(grid []string) int {\n \n}","func Run() {\n\tinputInts := bp.Atoi(bp.GetN(\"day10/day10_input.txt\"))\n\tsort.Ints(inputInts)\n\n\toneJoltDiff, threeJoltDiff := 0, 0\n\tfor i := 0; i <= len(inputInts); i++ {\n\t\tcurr := 0\n\t\tif i == 0 {\n\t\t\tcurr = 0\n\t\t} else {\n\t\t\tcurr = inputInts[i-1]\n\t\t}\n\n\t\tnext := 0\n\t\tif len(inputInts) == i {\n\t\t\tnext = inputInts[i-1] + 3\n\t\t} else {\n\t\t\tnext = inputInts[i]\n\t\t}\n\n\t\tif next-curr == 1 {\n\t\t\toneJoltDiff++\n\t\t} else if next-curr == 3 {\n\t\t\tthreeJoltDiff++\n\t\t}\n\t}\n\n\tfmt.Println(\"\\tpart 1:\", oneJoltDiff*threeJoltDiff)\n\n\tinputInts = append([]int{0}, inputInts...)\n\tinputInts = append(inputInts, inputInts[len(inputInts)-1]+3)\n\n\tindices := make([]int, 1)\n\tfor i := 1; i < len(inputInts); i++ {\n\t\tif inputInts[i-1] == inputInts[i]-3 {\n\t\t\tindices = append(indices, i)\n\t\t}\n\t}\n\n\tres := 1\n\tfor i := 1; i < len(indices); i++ {\n\t\tpaths, prevIndex, currIndex := 0, indices[i-1], indices[i]\n\t\tnext(prevIndex, &inputInts, &paths, currIndex)\n\t\tres *= paths\n\t}\n\n\tfmt.Println(\"\\tpart 2:\", res)\n}","func (d Day) SolvePartTwo() (string, error) {\n\txCycleLength := findCycleLength(d.moons, xDimension)\n\tyCycleLength := findCycleLength(d.moons, yDimension)\n\tzCycleLength := findCycleLength(d.moons, zDimension)\n\treturn fmt.Sprintf(\"%d\", util.LCM3(xCycleLength, yCycleLength, zCycleLength)), nil\n}","func TestSwitchMotion(t *testing.T) {\n\talphabet := \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n\tm, err := NewMachine(21, 1, 25, 5, 1, 2, alphabet)\n\tif err != nil {\n\t\tt.Fatalf(\"Could not complete NewMachine: %s\", err.Error())\n\t}\n\tvar tests = [][]int{\n\t\t{20, 0, 24, 4},\n\t\t{21, 1, 24, 4},\n\t\t{22, 2, 24, 4},\n\t\t{23, 3, 24, 4},\n\t\t{24, 3, 24, 5},\n\t\t{0, 3, 0, 5},\n\t\t{1, 4, 0, 5},\n\t\t{2, 5, 0, 5},\n\t}\n\tfor i, test := range tests {\n\t\tif m.sixes.position != test[0] ||\n\t\t\tm.fast.position != test[1] ||\n\t\t\tm.middle.position != test[2] ||\n\t\t\tm.slow.position != test[3] {\n\t\t\tt.Errorf(\"TestSwitchMotion fails after %d steps: [%d,%d,%d,%d], want %v\", i,\n\t\t\t\tm.sixes.position, m.fast.position, m.middle.position, m.slow.position, test)\n\t\t}\n\t\tm.step()\n\t}\n}","func numIslands(grid [][]byte) int {\n\t//h := len(grid)\n\t//w := len(grid[0])\n\t//walkJudge := make([][]bool, h)\n\t//for i, _ := range walkJudge {\n\t//\twalkJudge[i] = make([]bool, w)\n\t//}\n\tcount := 0\n\n\tfor i, _ := range grid {\n\t\tfor j, _ := range grid[i] {\n\t\t\tif grid[i][j] == '1' {\n\t\t\t\tdfs(grid, i, j)\n\t\t\t\tcount += 1\n\t\t\t\t//fullPath(&walkJudge, grid,i, j)\n\t\t\t}\n\t\t}\n\t}\n\treturn count\n}","func (v *Values) GetSteps() map[string]interface{} {\n\treturn v.m[\"step\"].(map[string]interface{})\n}","func TestStepsFailedRetries(t *testing.T) {\n\twf := test.LoadTestWorkflow(\"testdata/steps-failed-retries.yaml\")\n\twoc := newWoc(*wf)\n\twoc.operate()\n\tassert.Equal(t, string(wfv1.NodeFailed), string(woc.wf.Status.Phase))\n}","func solveAllSegments(display sevenSegmentDisplay) (result int) {\n\tlookupTable := make(map[string]int)\n\tcountPositions := make(map[rune]int)\n\tfor _, displayPos := range display.segments {\n\t\tfor _, char := range displayPos {\n\t\t\tcountPositions[char]++\n\t\t}\n\t}\n\n\tpositionSheet := make(map[int][]rune)\n\tfor char, val := range countPositions {\n\t\tpositionSheet[val] = append(positionSheet[val], char)\n\t}\n\n\tfor _, displayPos := range display.segments {\n\t\tswitch len(displayPos) {\n\t\tcase 2:\n\t\t\tlookupTable[displayPos] = 1\n\t\tcase 3:\n\t\t\tlookupTable[displayPos] = 7\n\t\tcase 4:\n\t\t\tlookupTable[displayPos] = 4\n\t\tcase 7:\n\t\t\tlookupTable[displayPos] = 8\n\t\tcase 5: // 2, 3 or 5\n\t\t\t// Only 2 has an empty space bottom-right\n\t\t\tif !strings.ContainsRune(displayPos, positionSheet[9][0]) {\n\t\t\t\tlookupTable[displayPos] = 2\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\t// if they have top and top-right it's 3 else 5\n\t\t\tif strings.ContainsRune(displayPos, positionSheet[8][0]) && strings.ContainsRune(displayPos, positionSheet[8][1]) {\n\t\t\t\tlookupTable[displayPos] = 3\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tlookupTable[displayPos] = 5\n\t\tcase 6: // 0, 6 or 9\n\t\t\t// if they have bottom left they can be - 0 6 -\n\t\t\tif strings.ContainsRune(displayPos, positionSheet[4][0]) {\n\t\t\t\t// if they have top and top-right it's 0 else 6\n\t\t\t\tif strings.ContainsRune(displayPos, positionSheet[8][0]) && strings.ContainsRune(displayPos, positionSheet[8][1]) {\n\t\t\t\t\tlookupTable[displayPos] = 0\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tlookupTable[displayPos] = 6\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tlookupTable[displayPos] = 9\n\t\t}\n\t}\n\n\tvar resultString = \"\"\n\tfor _, value := range display.values {\n\t\tresultString += strconv.FormatInt(int64(lookupTable[value]), 10)\n\t}\n\n\treturn pkg.MustAtoi(resultString)\n}","func (stem *Stem) step3() {\r\n\tif stem.k == stem.k0 {\r\n\t\treturn /*ForBug1*/\r\n\t}\r\n\tswitch stem.b[stem.k-1] {\r\n\tcase 'a':\r\n\t\tif stem.ends(\"ational\") {\r\n\t\t\tstem.r(\"ate\")\r\n\t\t}\r\n\t\tif stem.ends(\"tional\") {\r\n\t\t\tstem.r(\"tion\")\r\n\t\t}\r\n\tcase 'c':\r\n\t\tif stem.ends(\"enci\") {\r\n\t\t\tstem.r(\"ence\")\r\n\t\t}\r\n\t\tif stem.ends(\"anci\") {\r\n\t\t\tstem.r(\"ance\")\r\n\t\t\tbreak\r\n\t\t}\r\n\tcase 'e':\r\n\t\tif stem.ends(\"izer\") {\r\n\t\t\tstem.r(\"ize\")\r\n\t\t}\r\n\tcase 'l':\r\n\t\tif stem.ends(\"bli\") {\r\n\t\t\tstem.r(\"ble\")\r\n\t\t\tbreak\r\n\t\t}\r\n\t\tif stem.ends(\"alli\") {\r\n\t\t\tstem.r(\"al\")\r\n\t\t\tbreak\r\n\t\t}\r\n\t\tif stem.ends(\"entli\") {\r\n\t\t\tstem.r(\"ent\")\r\n\t\t\tbreak\r\n\t\t}\r\n\t\tif stem.ends(\"eli\") {\r\n\t\t\tstem.r(\"e\")\r\n\t\t\tbreak\r\n\t\t}\r\n\t\tif stem.ends(\"ousli\") {\r\n\t\t\tstem.r(\"ous\")\r\n\t\t\tbreak\r\n\t\t}\r\n\tcase 'o':\r\n\t\tif stem.ends(\"ization\") {\r\n\t\t\tstem.r(\"ize\")\r\n\t\t\tbreak\r\n\t\t}\r\n\t\tif stem.ends(\"ation\") {\r\n\t\t\tstem.r(\"ate\")\r\n\t\t\tbreak\r\n\t\t}\r\n\t\tif stem.ends(\"ator\") {\r\n\t\t\tstem.r(\"ate\")\r\n\t\t\tbreak\r\n\t\t}\r\n\tcase 's':\r\n\t\tif stem.ends(\"alism\") {\r\n\t\t\tstem.r(\"al\")\r\n\t\t\tbreak\r\n\t\t}\r\n\t\tif stem.ends(\"iveness\") {\r\n\t\t\tstem.r(\"ive\")\r\n\t\t\tbreak\r\n\t\t}\r\n\t\tif stem.ends(\"fulness\") {\r\n\t\t\tstem.r(\"ful\")\r\n\t\t\tbreak\r\n\t\t}\r\n\t\tif stem.ends(\"ousness\") {\r\n\t\t\tstem.r(\"ous\")\r\n\t\t\tbreak\r\n\t\t}\r\n\tcase 't':\r\n\t\tif stem.ends(\"aliti\") {\r\n\t\t\tstem.r(\"al\")\r\n\t\t\tbreak\r\n\t\t}\r\n\t\tif stem.ends(\"iviti\") {\r\n\t\t\tstem.r(\"ive\")\r\n\t\t\tbreak\r\n\t\t}\r\n\t\tif stem.ends(\"biliti\") {\r\n\t\t\tstem.r(\"ble\")\r\n\t\t\tbreak\r\n\t\t}\r\n\tcase 'g':\r\n\t\tif stem.ends(\"logi\") {\r\n\t\t\tstem.r(\"log\")\r\n\t\t\tbreak\r\n\t\t}\r\n\t}\r\n}","func Part2(ctx context.Context, input string) (interface{}, error) {\n\tg1 := new4DSpace(strings.Split(input, \"\\n\"), \".\")\n\tg2 := new4DSpace(strings.Split(input, \"\\n\"), \".\")\n\n\tvar curr, next map[coordinate4D]string\n\tfor i := 0; i < 6; i++ {\n\t\tif i%2 == 0 {\n\t\t\tcurr = g1\n\t\t\tnext = g2\n\t\t} else {\n\t\t\tcurr = g2\n\t\t\tnext = g1\n\t\t}\n\n\t\tminX, maxX, minY, maxY, minZ, maxZ, minW, maxW := 0, 0, 0, 0, 0, 0, 0, 0\n\t\tfor c := range curr {\n\t\t\tif c.X < minX {\n\t\t\t\tminX = c.X\n\t\t\t}\n\t\t\tif c.X > maxX {\n\t\t\t\tmaxX = c.X\n\t\t\t}\n\n\t\t\tif c.Y < minY {\n\t\t\t\tminY = c.Y\n\t\t\t}\n\t\t\tif c.Y > maxY {\n\t\t\t\tmaxY = c.Y\n\t\t\t}\n\n\t\t\tif c.Z < minZ {\n\t\t\t\tminZ = c.Z\n\t\t\t}\n\t\t\tif c.Z > maxZ {\n\t\t\t\tmaxZ = c.Z\n\t\t\t}\n\n\t\t\tif c.W < minW {\n\t\t\t\tminW = c.W\n\t\t\t}\n\t\t\tif c.W > maxW {\n\t\t\t\tmaxW = c.W\n\t\t\t}\n\t\t}\n\t\tmaxX++\n\t\tmaxY++\n\t\tmaxZ++\n\t\tmaxW++\n\n\t\tfor x := minX - 1; x <= maxX; x++ {\n\t\t\tfor y := minY - 1; y <= maxY; y++ {\n\t\t\t\tfor z := minZ - 1; z <= maxZ; z++ {\n\t\t\t\t\tfor w := minW - 1; w <= maxW; w++ {\n\t\t\t\t\t\tc := coordinate4D{X: x, Y: y, Z: z, W: w}\n\t\t\t\t\t\tv := curr[c]\n\t\t\t\t\t\tif v == \"\" {\n\t\t\t\t\t\t\tv = \".\"\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tactiveCount := 0\n\t\t\t\t\t\tfor _, s := range c.Surrounding() {\n\t\t\t\t\t\t\tswitch curr[s] {\n\t\t\t\t\t\t\tcase \"#\":\n\t\t\t\t\t\t\t\tactiveCount++\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif v == \"#\" && (activeCount != 2 && activeCount != 3) {\n\t\t\t\t\t\t\tnext[c] = \".\"\n\t\t\t\t\t\t} else if v == \".\" && activeCount == 3 {\n\t\t\t\t\t\t\tnext[c] = \"#\"\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tnext[c] = v\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Count\n\tc := 0\n\tfor _, v := range next {\n\t\tif v == \"#\" {\n\t\t\tc++\n\t\t}\n\t}\n\n\treturn c, nil\n}"],"string":"[\n \"func StepsOfKnightUtil(size int, currCol int, currRow int, traversed [][]int, dist int) {\\n\\t// Range check\\n\\tif currCol < 0 || currCol >= size || currRow < 0 || currRow >= size {\\n\\t\\treturn\\n\\t}\\n\\n\\t// Traverse if not already traversed.\\n\\tif traversed[currCol][currRow] <= dist {\\n\\t\\treturn\\n\\t}\\n\\n\\tdir := [][]int{{-2, -1}, {-2, 1}, {2, -1}, {2, 1}, {-1, -2}, {1, -2}, {-1, 2}, {1, 2}}\\n\\ttraversed[currCol][currRow] = dist\\n\\n\\tfor i := 0; i < 8; i++ {\\n\\t\\tx := currCol + dir[i][0]\\n\\t\\ty := currRow + dir[i][1]\\n\\t\\tStepsOfKnightUtil(size, x, y, traversed, dist+1)\\n\\t}\\n}\",\n \"func minKnightMoves(ex int, ey int) int {\\r\\n\\tif ex == 0 && ey == 0 {\\r\\n\\t\\treturn 0\\r\\n\\t}\\r\\n\\tq := [][]int{}\\r\\n\\tq = append(q, []int{0, 0})\\r\\n\\tdir := [][]int{{1, 2}, {2, 1}, {2, -1}, {1, -2}, {-1, 2}, {-2, 1}, {-1, -2}, {-2, -1}}\\r\\n\\tsteps := 0\\r\\n\\tseen := map[int]map[int]bool{0: map[int]bool{0: true}}\\r\\n\\t// BFS loop\\r\\n\\tfor len(q) > 0 {\\r\\n\\t\\tsteps++\\r\\n\\t\\tn := len(q)\\r\\n\\t\\tfor i := 0; i < n; i++ {\\r\\n\\t\\t\\tt := q[0]\\r\\n\\t\\t\\tq = q[1:]\\r\\n\\t\\t\\tfor _, d := range dir {\\r\\n\\t\\t\\t\\tnx := t[0] + d[0]\\r\\n\\t\\t\\t\\tny := t[1] + d[1]\\r\\n\\t\\t\\t\\tif nx == ex && ny == ey {\\r\\n\\t\\t\\t\\t\\treturn steps\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif _, exists := seen[nx]; !exists {\\r\\n\\t\\t\\t\\t\\tseen[nx] = map[int]bool{}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif _, exists := seen[nx][ny]; !exists &&\\r\\n\\t\\t\\t\\t\\t(nx*ex >= 0 && ny*ey >= 0 || steps < 3) {\\r\\n\\t\\t\\t\\t\\tseen[nx][ny] = true\\r\\n\\t\\t\\t\\t\\tq = append(q, []int{nx, ny})\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\treturn -1\\r\\n}\",\n \"func findSteps(lines [][]Point) []int {\\n\\tline1 := lines[0]\\n\\tline2 := lines[1]\\n\\n\\tline1Size := len(lines[0])\\n\\tline2Size := len(lines[1])\\n\\tvar steps []int\\n\\n\\tif line1Size == line2Size {\\n\\t\\tfor i := 0; i <= line1Size-2; i++ {\\n\\t\\t\\tfor j := 0; j <= line1Size-2; j++ {\\n\\t\\t\\t\\tnumSteps := calculateSteps(line1, line2, i, j)\\n\\t\\t\\t\\tif numSteps != 0 {\\n\\t\\t\\t\\t\\tsteps = append(steps, numSteps)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t} else if line1Size > line2Size {\\n\\t\\tfor i := 0; i <= line1Size-2; i++ {\\n\\t\\t\\tfor j := 0; j <= line2Size-2; j++ {\\n\\t\\t\\t\\tnumSteps := calculateSteps(line1, line2, i, j)\\n\\t\\t\\t\\tif numSteps != 0 {\\n\\t\\t\\t\\t\\tsteps = append(steps, numSteps)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t} else {\\n\\t\\tfor i := 0; i < line2Size-2; i++ {\\n\\t\\t\\tfor j := 0; j < line1Size-2; j++ {\\n\\t\\t\\t\\tnumSteps := calculateSteps(line1, line2, i, j)\\n\\t\\t\\t\\tif numSteps != 0 {\\n\\t\\t\\t\\t\\tsteps = append(steps, numSteps)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn steps\\n}\",\n \"func knightDialer(n int) int {\\n\\tif n == 1 {\\n\\t\\t// the only case where 5 is a valid starting position\\n\\t\\treturn 10\\n\\t}\\n\\n\\tconst mod = 1e9 + 7\\n\\tr := [10]int{1, 1, 1, 1, 1, 0, 1, 1, 1, 1}\\n\\tfor n > 1 {\\n\\t\\tnext := [10]int{\\n\\t\\t\\t(r[4] + r[6]) % mod, // 0\\n\\t\\t\\t(r[6] + r[8]) % mod, // 1\\n\\t\\t\\t(r[7] + r[9]) % mod, // 2\\n\\t\\t\\t(r[4] + r[8]) % mod, // 3\\n\\t\\t\\t(r[3] + r[9] + r[0]) % mod, // 4\\n\\t\\t\\t0,\\n\\t\\t\\t(r[1] + r[7] + r[0]) % mod, // 6\\n\\t\\t\\t(r[2] + r[6]) % mod, // 7\\n\\t\\t\\t(r[1] + r[3]) % mod, // 8\\n\\t\\t\\t(r[2] + r[4]) % mod, // 9\\n\\t\\t}\\n\\t\\tr = next\\n\\t\\tn--\\n\\t}\\n\\n\\ts := 0\\n\\tfor _, v := range r {\\n\\t\\ts = (s + v) % mod\\n\\t}\\n\\treturn s\\n}\",\n \"func KnightMoves(b Board, row, col int, recurse bool) (possible []ValidMove) {\\n\\tpossible = tryAndAppend(possible, b, row, col, -2, -1, recurse) // up-left\\n\\tpossible = tryAndAppend(possible, b, row, col, -2, 1, recurse) // up-right\\n\\tpossible = tryAndAppend(possible, b, row, col, 2, -1, recurse) // down-left\\n\\tpossible = tryAndAppend(possible, b, row, col, 2, 1, recurse) // down-right\\n\\n\\tpossible = tryAndAppend(possible, b, row, col, -1, -2, recurse) // left-up\\n\\tpossible = tryAndAppend(possible, b, row, col, 1, -2, recurse) // left-down\\n\\tpossible = tryAndAppend(possible, b, row, col, -1, 2, recurse) // right-up\\n\\tpossible = tryAndAppend(possible, b, row, col, 1, 2, recurse) // right-down\\n\\n\\treturn\\n}\",\n \"func countDiag(mygame game.Game, playerNum int, streakLength int) int {\\n\\tcount := 0 //overall # of streaks of n length\\n\\tcurrCount := 0 //this needs to be exactly n so that we don't count streaks of 2 as streaks of 3\\n\\tsymbol := mygame.PlayerSymbols[playerNum]\\n\\t//downwards to the right first\\n\\t//increment over every square\\n\\tfor i := 0; i < game.BoardHeight; i++ { //rows\\n\\t\\tfor j := 0; j < game.BoardWidth; j++ { //columns\\n\\t\\t\\tif mygame.GameBoard[i][j].Active {\\n\\t\\t\\t\\t//check that the symbol matches\\n\\t\\t\\t\\tif mygame.GameBoard[i][j].Symbol == symbol {\\n\\t\\t\\t\\t\\t//make sure piece up and left to it isn't the same symbol\\n\\t\\t\\t\\t\\t//so that we're not double counting\\n\\t\\t\\t\\t\\tif i == 0 || j == 0 || mygame.GameBoard[i-1][j-1].Symbol != symbol {\\n\\t\\t\\t\\t\\t\\tcurrCount++\\n\\t\\t\\t\\t\\t\\tfor k := 1; k < 4; k++ {\\n\\t\\t\\t\\t\\t\\t\\tif i+k < game.BoardHeight && j+k < game.BoardWidth { //make sure we don't go off board\\n\\t\\t\\t\\t\\t\\t\\t\\tif mygame.GameBoard[i+k][j+k].Symbol == symbol {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcurrCount++\\n\\t\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak //break if different symbol\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t//only increment count if currentcount matches n\\n\\t\\t\\t\\t\\t\\tif currCount == streakLength {\\n\\t\\t\\t\\t\\t\\t\\tcount++\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tcurrCount = 0 //reset currCount\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//now downwards to the left\\n\\tfor i := 0; i < game.BoardHeight; i++ { //rows\\n\\t\\tfor j := 0; j < game.BoardWidth; j++ { //columns\\n\\t\\t\\tif mygame.GameBoard[i][j].Active {\\n\\t\\t\\t\\t//check that the symbol matches\\n\\t\\t\\t\\tif mygame.GameBoard[i][j].Symbol == symbol {\\n\\t\\t\\t\\t\\t//make sure piece up and left to it isn't the same symbol\\n\\t\\t\\t\\t\\t//so that we're not double counting\\n\\t\\t\\t\\t\\tif i == 0 || j == game.BoardWidth-1 || mygame.GameBoard[i-1][j+1].Symbol != symbol {\\n\\t\\t\\t\\t\\t\\tcurrCount++\\n\\t\\t\\t\\t\\t\\tfor k := 1; k < 4; k++ {\\n\\t\\t\\t\\t\\t\\t\\tif i+k < game.BoardHeight && j-k >= 0 { //make sure we don't go off board\\n\\t\\t\\t\\t\\t\\t\\t\\tif mygame.GameBoard[i+k][j-k].Symbol == symbol {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcurrCount++\\n\\t\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak //break if different symbol\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t//only increment count if currentcount matches n\\n\\t\\t\\t\\t\\t\\tif currCount == streakLength {\\n\\t\\t\\t\\t\\t\\t\\tcount++\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tcurrCount = 0 //reset currCount\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn count\\n}\",\n \"func Day16Part2(input []string) int {\\n\\tresult := 1\\n\\tvalidCond := make(map[int][]string)\\n\\t// validValue := []int{}\\n\\tmyTicket := []int{}\\n\\tvalidTickets := [][]int{}\\n\\tpossibleFields := [][]string{}\\n\\tcondRE := regexp.MustCompile(`\\\\d+-\\\\d+`)\\n\\tsteps := 1\\n\\tfor _, item := range input {\\n\\t\\tcmd := strings.Split(item, \\\":\\\")\\n\\t\\tswitch cmd[0] {\\n\\t\\tcase \\\"departure location\\\", \\\"departure station\\\", \\\"departure platform\\\", \\\"departure track\\\", \\\"departure date\\\", \\\"departure time\\\", \\\"arrival location\\\", \\\"arrival station\\\", \\\"arrival platform\\\", \\\"arrival track\\\", \\\"class\\\", \\\"duration\\\", \\\"price\\\", \\\"route\\\", \\\"row\\\", \\\"seat\\\", \\\"train\\\", \\\"type\\\", \\\"wagon\\\", \\\"zone\\\":\\n\\t\\t\\tsteps = 1\\n\\t\\tcase \\\"your ticket\\\":\\n\\t\\t\\tsteps = 2\\n\\t\\tcase \\\"nearby tickets\\\":\\n\\t\\t\\tsteps = 3\\n\\t\\tcase \\\"\\\":\\n\\t\\t\\tsteps = 0\\n\\t\\t}\\n\\t\\tswitch steps {\\n\\t\\tcase 1:\\n\\t\\t\\tfor _, rangeStr := range condRE.FindAllStringSubmatch(item, -1) {\\n\\t\\t\\t\\ts, _ := strconv.Atoi(strings.Split(rangeStr[0], \\\"-\\\")[0])\\n\\t\\t\\t\\te, _ := strconv.Atoi(strings.Split(rangeStr[0], \\\"-\\\")[1])\\n\\t\\t\\t\\tfor i := s; i < e+1; i++ {\\n\\t\\t\\t\\t\\tvalidCond[i] = append(validCond[i], cmd[0])\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\tcase 2:\\n\\t\\t\\tif item == \\\"your ticket:\\\" {\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor _, value := range strings.Split(item, \\\",\\\") {\\n\\t\\t\\t\\tv, _ := strconv.Atoi(value)\\n\\t\\t\\t\\tmyTicket = append(myTicket, v)\\n\\t\\t\\t}\\n\\n\\t\\tcase 3:\\n\\t\\t\\tif item == \\\"nearby tickets:\\\" {\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\n\\t\\t\\tcheck := true\\n\\t\\t\\tticketValues := strings.Split(item, \\\",\\\")\\n\\t\\t\\t// maze := [][]string{}\\n\\t\\t\\tvalidTicket := []int{}\\n\\t\\t\\tfor _, value := range ticketValues {\\n\\t\\t\\t\\tv, _ := strconv.Atoi(value)\\n\\t\\t\\t\\tif _, ok := validCond[v]; !ok {\\n\\t\\t\\t\\t\\tcheck = false\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif check {\\n\\t\\t\\t\\tfor _, value := range strings.Split(item, \\\",\\\") {\\n\\t\\t\\t\\t\\tv, _ := strconv.Atoi(value)\\n\\t\\t\\t\\t\\tvalidTicket = append(validTicket, v)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tvalidTickets = append(validTickets, validTicket)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor j := 0; j < len(validTickets[0]); j++ {\\n\\t\\tpossibleField := []string{}\\n\\t\\tfor i := 0; i < len(validTickets); i++ {\\n\\t\\t\\tv := validTickets[i][j]\\n\\t\\t\\tf, _ := validCond[v]\\n\\t\\t\\tif len(possibleField) == 0 {\\n\\t\\t\\t\\tpossibleField = append(possibleField, f...)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tpossibleField = intersection(possibleField, f)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tpossibleFields = append(possibleFields, possibleField)\\n\\t}\\n\\n\\tcount := 0\\n\\tfor count < len(possibleFields) {\\n\\t\\t// fmt.Printf(\\\"%#v\\\\n\\\", possibleFields)\\n\\t\\tcount = 0\\n\\t\\tfor i := 0; i < len(possibleFields); i++ {\\n\\t\\t\\tif len(possibleFields[i]) == 1 {\\n\\t\\t\\t\\tcount++\\n\\t\\t\\t\\tfor j := 0; j < len(possibleFields); j++ {\\n\\t\\t\\t\\t\\tif i != j {\\n\\t\\t\\t\\t\\t\\tidx := -1\\n\\t\\t\\t\\t\\t\\tfor ii, v := range possibleFields[j] {\\n\\t\\t\\t\\t\\t\\t\\tif v == possibleFields[i][0] {\\n\\t\\t\\t\\t\\t\\t\\t\\tidx = ii\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif idx == -1 {\\n\\t\\t\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif idx+1 >= len(possibleFields[j]) {\\n\\t\\t\\t\\t\\t\\t\\tpossibleFields[j] = possibleFields[j][:idx]\\n\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\tpossibleFields[j] = append(possibleFields[j][:idx], possibleFields[j][idx+1:]...)\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t// fmt.Printf(\\\"%#v\\\\n\\\", possibleFields)\\n\\tfor i, v := range possibleFields {\\n\\t\\tif strings.Contains(v[0], \\\"departure\\\") {\\n\\t\\t\\tresult *= myTicket[i]\\n\\t\\t}\\n\\t}\\n\\n\\treturn result\\n}\",\n \"func (s Solution) Steps() string {\\n\\treturn s.text\\n}\",\n \"func waysToClimbStaircase(numberOfStairs int, possibleSteps []int) int {\\n\\tif numberOfStairs <= 0 {\\n\\t\\treturn 0\\n\\t}\\n\\n\\tpossibleWays := 0\\n\\tfor _, step := range possibleSteps {\\n\\t\\tif numberOfStairs-step == 0 {\\n\\t\\t\\tpossibleWays++\\n\\t\\t}\\n\\t}\\n\\tfor _, step := range possibleSteps {\\n\\t\\tpossibleWays += waysToClimbStaircase(numberOfStairs-step, possibleSteps)\\n\\t}\\n\\n\\treturn possibleWays\\n}\",\n \"func Day8Part1(filepath string) any {\\n\\tvar res int\\n\\n\\t// open file\\n\\treadFile, _ := os.Open(filepath)\\n\\n\\t// read line\\n\\tfileScanner := bufio.NewScanner(readFile)\\n\\tfileScanner.Split(bufio.ScanLines)\\n\\n\\t// parse map in to [][]int\\n\\ttreeMap := parseMap(fileScanner)\\n\\t// fmt.Println(treeMap)\\n\\n\\t// init visible trees 2D array\\n\\tvisible := make([][]bool, len(treeMap))\\n\\tfor i := range visible {\\n\\t\\tvisible[i] = make([]bool, len(treeMap[0]))\\n\\t}\\n\\n\\t// look from left to r\\n\\tfor i := range treeMap {\\n\\t\\tmax := 0\\n\\t\\tfor j := range treeMap[0] {\\n\\t\\t\\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\\n\\t\\t\\t\\tvisible[i][j] = true\\n\\t\\t\\t\\tmax = treeMap[i][j]\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// look from right to l\\n\\tfor i := range treeMap {\\n\\t\\tmax := 0\\n\\t\\tfor j := len(treeMap[0]) - 1; j >= 0; j-- {\\n\\t\\t\\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\\n\\t\\t\\t\\tvisible[i][j] = true\\n\\t\\t\\t\\tmax = treeMap[i][j]\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// look from up to down\\n\\tfor j := 0; j <= len(treeMap[0])-1; j++ {\\n\\t\\tmax := 0\\n\\t\\tfor i := 0; i <= len(treeMap)-1; i++ {\\n\\t\\t\\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\\n\\t\\t\\t\\tvisible[i][j] = true\\n\\t\\t\\t\\tmax = treeMap[i][j]\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// look from down to up\\n\\tfor j := 0; j <= len(treeMap[0])-1; j++ {\\n\\t\\tmax := 0\\n\\t\\tfor i := len(treeMap) - 1; i >= 0; i-- {\\n\\t\\t\\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\\n\\t\\t\\t\\tvisible[i][j] = true\\n\\t\\t\\t\\tmax = treeMap[i][j]\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// traverse visible trees 2D array and count visibles\\n\\tfor i := range visible {\\n\\t\\tfor j := range visible[i] {\\n\\t\\t\\tif visible[i][j] {\\n\\t\\t\\t\\tres++\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn res\\n}\",\n \"func testOneScenario(start, goal Node, algo func (start, goal Node) []Node, trials int) ([]Node, int, float64, float64, int) {\\n\\tvar path []Node\\n\\n\\t// Get path and average runtime\\n\\ttotalRuntime := 0.0\\n\\tfor i := 0; i < trials; i++ {\\n\\t\\tbefore := time.Now()\\n\\t\\tpath = algo(start, goal)\\n\\t\\tafter := time.Now()\\n\\t\\telapsed := after.Sub(before)\\n\\t\\ttotalRuntime += float64(elapsed.Milliseconds())\\n\\t}\\n\\tavgRuntime := int(math.Round(totalRuntime/float64(trials)))\\n\\n\\t// Calculate path length\\n\\tpathLen := 0.0\\n\\tfor i := 0; i < len(path)-1; i++ {\\n\\t\\tn1 := path[i]\\n\\t\\tn2 := path[i+1]\\n\\t\\tpathLen += StraightLineDist(n1, n2)\\n\\t}\\n\\n\\t// Calculate turn count and average angle of turns\\n\\tturns := 0\\n\\tavgAngle := 0.0\\n\\tfor i := 0; i < len(path)-2; i++ {\\n\\t\\tn1 := path[i]\\n\\t\\tn2 := path[i+1]\\n\\t\\tn3 := path[i+2]\\n\\t\\t// There are two vectors (n1,n2) and (n2,n3)\\n\\t\\tv1_x, v1_y := float64(n2.X - n1.X), float64(n2.Y - n1.Y)\\n\\t\\tv2_x, v2_y := float64(n3.X - n2.X), float64(n3.Y - n2.Y)\\n\\t\\tdot := v1_x * v2_x + v1_y * v2_y\\n\\t\\tv1_len := math.Sqrt(v1_x * v1_x + v1_y * v1_y)\\n\\t\\tv2_len := math.Sqrt(v2_x * v2_x + v2_y * v2_y)\\n\\t\\ta := dot / (v1_len * v2_len)\\n\\t\\ta = math.Max(-1, math.Min(1, a)) // Rounding errors may produce values outside [-1,1] so clamp it.\\n\\t\\tangle := math.Acos(a)\\n\\t\\tif angle >= 0.001 {\\n\\t\\t\\t// We are turning at node n1\\n\\t\\t\\tavgAngle += angle\\n\\t\\t\\tturns++\\n\\t\\t}\\n\\t}\\n\\n\\tif turns > 0 {\\n\\t\\tavgAngle /= float64(turns)\\n\\t}\\n\\n\\treturn path, turns, pathLen, avgAngle, avgRuntime\\n}\",\n \"func KnightAttacks(square Square) Bitboard {\\n\\treturn knightTable[square]\\n}\",\n \"func findPaths2(m int, n int, maxMove int, startRow int, startColumn int) int {\\n\\t// 값이 클 수 있어 modulo 모듈 값을 리턴하라고 문제에 써있음\\n\\tmodulo := 1000000000 + 7\\n\\tif startRow < 0 || startRow == m ||\\n\\t\\tstartColumn < 0 || startColumn == n {\\n\\t\\treturn 1\\n\\t}\\n\\tif maxMove == 0 {\\n\\t\\treturn 0\\n\\t}\\n\\t// 4방향 각각에 대해서 boundary 를 벗어나는지 경우들을 모두 더한다.\\n\\treturn findPaths(m, n, maxMove-1, startRow-1, startColumn)%modulo +\\n\\t\\tfindPaths(m, n, maxMove-1, startRow, startColumn-1)%modulo +\\n\\t\\tfindPaths(m, n, maxMove-1, startRow+1, startColumn)%modulo +\\n\\t\\tfindPaths(m, n, maxMove-1, startRow, startColumn+1)%modulo\\n}\",\n \"func part2(mem []int64) int64 {\\n\\tg := readGrid(mem)\\n\\tvar r robot\\n\\tfor y, row := range g {\\n\\t\\tfor x, c := range row {\\n\\t\\t\\tif strings.ContainsRune(\\\"^v<>\\\", c) {\\n\\t\\t\\t\\tr = robot{point{x, y}, north}\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprev := r.pos.move(west)\\n\\tpath := []direction{east}\\n\\tfor {\\n\\t\\tadj := adjacent(g, r.pos)\\n\\t\\tif len(path) > 2 && len(adj) == 1 {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tif 0 < len(adj) && len(adj) <= 2 {\\n\\t\\t\\tnext := adj[0]\\n\\t\\t\\tif len(adj) == 2 && adj[0] == prev {\\n\\t\\t\\t\\tnext = adj[1]\\n\\t\\t\\t}\\n\\t\\t\\tif r.pos.x < next.x {\\n\\t\\t\\t\\tr.dir = east\\n\\t\\t\\t}\\n\\t\\t\\tif r.pos.x > next.x {\\n\\t\\t\\t\\tr.dir = west\\n\\t\\t\\t}\\n\\t\\t\\tif r.pos.y < next.y {\\n\\t\\t\\t\\tr.dir = south\\n\\t\\t\\t}\\n\\t\\t\\tif r.pos.y > next.y {\\n\\t\\t\\t\\tr.dir = north\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tpath = append(path, r.dir)\\n\\t\\tprev = r.pos\\n\\t\\tr.move()\\n\\t}\\n\\n\\tqueue := []step{{0, right}}\\n\\tfor i, d := range path[1:] {\\n\\t\\trot := path[i].rotation(d)\\n\\t\\tif len(queue) > 0 && rot == none {\\n\\t\\t\\tqueue[len(queue)-1].n++\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tqueue = append(queue, step{1, rot})\\n\\t}\\n\\n\\tvar out string\\n\\tfor _, v := range queue {\\n\\t\\tout += v.String() + \\\",\\\"\\n\\t}\\n\\tfmt.Println(out)\\n\\n\\tp := newProgram(mem)\\n\\tp.memory[0] = 2\\n\\t// I have to be honest. I used my editors \\\"highlight other occurrences\\\"\\n\\t// feature on the previous output.\\n\\tin := strings.Join([]string{\\n\\t\\t\\\"A,B,A,C,A,B,C,C,A,B\\\",\\n\\t\\t\\\"R,8,L,10,R,8\\\",\\n\\t\\t\\\"R,12,R,8,L,8,L,12\\\",\\n\\t\\t\\\"L,12,L,10,L,8\\\",\\n\\t\\t\\\"n\\\",\\n\\t\\t\\\"\\\",\\n\\t}, \\\"\\\\n\\\")\\n\\tfor _, c := range in {\\n\\t\\tp.input = append(p.input, int64(c))\\n\\t}\\n\\tres, err := p.run()\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\treturn res[len(res)-1]\\n}\",\n \"func Steps(turns float64) int {\\n\\treturn int(MotorSteps * turns)\\n}\",\n \"func (i *BaseInhabitant) NextStep(relWatcher cr.RelativeWatcher) (int, int) {\\n\\ti.days++\\n\\t// iterate over fields to find enemy\\n\\tfor rH := 2; rH >= -2; rH-- {\\n\\t\\tfor rW := 2; rW >= -2; rW-- {\\n\\t\\t\\tif rH == 0 && rW == 0 {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tif i.IsEnemy(relWatcher(rH, rW)) {\\n\\t\\t\\t\\t// found enemy, trying to find safe field\\n\\t\\t\\t\\tisHPositive := rH >= 0\\n\\t\\t\\t\\tisWPositive := rW >= 0\\n\\t\\t\\t\\tvar nextH, nextW int\\n\\n\\t\\t\\t\\tif isHPositive && rH != 0 {\\n\\t\\t\\t\\t\\tnextH = -1\\n\\t\\t\\t\\t} else if !isHPositive && rH != 0 {\\n\\t\\t\\t\\t\\tnextH = 1\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif isWPositive && rW != 0 {\\n\\t\\t\\t\\t\\tnextW = -1\\n\\t\\t\\t\\t} else if !isWPositive && rW != 0 {\\n\\t\\t\\t\\t\\tnextW = 1\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif i.IsSafeField(relWatcher, nextH, nextW) {\\n\\t\\t\\t\\t\\treturn nextH, nextW\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// try find safe place\\n\\n\\t\\t\\t\\tif rH == 0 && i.IsSafeField(relWatcher, -1, nextW) {\\n\\t\\t\\t\\t\\treturn -1, nextW\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif rH == 0 && i.IsSafeField(relWatcher, 1, nextW) {\\n\\t\\t\\t\\t\\treturn 1, nextW\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif rW == 0 && i.IsSafeField(relWatcher, nextH, -1) {\\n\\t\\t\\t\\t\\treturn nextH, -1\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif rW == 0 && i.IsSafeField(relWatcher, nextH, 1) {\\n\\t\\t\\t\\t\\treturn nextH, 1\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif isHPositive && i.IsSafeField(relWatcher, nextH, nextW-1) {\\n\\t\\t\\t\\t\\treturn nextH, nextW - 1\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif isHPositive && i.IsSafeField(relWatcher, nextH, nextW+1) {\\n\\t\\t\\t\\t\\treturn nextH, nextW + 1\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif isWPositive && i.IsSafeField(relWatcher, nextH-1, nextW) {\\n\\t\\t\\t\\t\\treturn nextH - 1, nextW\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif isHPositive && i.IsSafeField(relWatcher, nextH+1, nextW) {\\n\\t\\t\\t\\t\\treturn nextH + 1, nextW\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t}\\n\\n\\treturn rand.Intn(i.maxMove+i.maxMove+1) - i.maxMove, rand.Intn(i.maxMove+i.maxMove+1) - i.maxMove\\n}\",\n \"func (g *Game) Step() {\\n\\n\\trows, cols := int(g.rows), int(g.cols)\\n\\tvar neighbors int\\n\\n\\t//Swapping the boards allows us to overwrite the state from two turns ago, while reading the state from last turn\\n\\tg.state, g.prevState = g.prevState, g.state\\n\\n\\t//Iterate over every row, skipping the border rows\\n\\tfor y := 1; y <= rows; y++ {\\n\\t\\t//Cell by cell, skipping borders\\n\\t\\tfor x := 1; x <= cols; x++ {\\n\\n\\t\\t\\t// Count the neighbors\\n\\t\\t\\tneighbors = 0\\n\\t\\t\\tfor i := 0; i < 8; i++ {\\n\\t\\t\\t\\tif g.prevState[offset[i].y+y][offset[i].x+x].Alive {\\n\\t\\t\\t\\t\\tneighbors++\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t/*Implement game of life ruleset:\\n\\t\\t\\t With exactly 2 neighbors: Alive cell stays alive and dead cell stays dead\\n\\t\\t\\t With exactly 3 neighbors: Alive cell stays alive and dead cell also lives\\n\\t\\t\\t Any other number of neighbors: Alive cell dies and dead cell stays dead\\n\\t\\t\\t*/\\n\\t\\t\\tif neighbors == 2 {\\n\\t\\t\\t\\tg.state[y][x] = g.prevState[y][x]\\n\\t\\t\\t} else if neighbors == 3 {\\n\\t\\t\\t\\tg.state[y][x].Alive = true\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tg.state[y][x].Alive = false\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t}\\n\\n\\t//Update the copy\\n\\tfor y := 0; y < int(g.rows); y++ {\\n\\t\\tfor x := 0; x < int(g.cols); x++ {\\n\\t\\t\\t//+1 to avoid copying the border cells\\n\\t\\t\\tg.board[y][x] = g.state[y+1][x+1]\\n\\t\\t}\\n\\t}\\n\\n\\treturn\\n\\n}\",\n \"func findPaths2(m int, n int, maxMove int, startRow int, startColumn int) int {\\n\\tprevGrid := make([][]int, m)\\n\\tnextGrid := make([][]int, m)\\n\\tfor i := 0; i < m; i++ {\\n\\t\\tprevGrid[i] = make([]int, n)\\n\\t\\tnextGrid[i] = make([]int, n)\\n\\t}\\n\\n\\tres := 0\\n\\tprevGrid[startRow][startColumn] = 1\\n\\n\\tfor move := 0; move < maxMove; move++ {\\n\\t\\tfor x := 0; x < m; x++ {\\n\\t\\t\\tfor y := 0; y < n; y++ {\\n\\t\\t\\t\\tv := prevGrid[x][y] % modulo\\n\\t\\t\\t\\tif v == 0 {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tprevGrid[x][y] = 0\\n\\n\\t\\t\\t\\tif x == 0 {\\n\\t\\t\\t\\t\\tres += v\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tnextGrid[x-1][y] += v\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif x == m-1 {\\n\\t\\t\\t\\t\\tres += v\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tnextGrid[x+1][y] += v\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif y == 0 {\\n\\t\\t\\t\\t\\tres += v\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tnextGrid[x][y-1] += v\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif y == n-1 {\\n\\t\\t\\t\\t\\tres += v\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tnextGrid[x][y+1] += v\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprevGrid, nextGrid = nextGrid, prevGrid\\n\\t}\\n\\n\\treturn res % modulo\\n}\",\n \"func numWays(steps int, arrLen int) int {\\n\\tfor i := 2; i <= 500; i += 2 {\\n\\t\\tresult := calcWays(0, i, i/2, i/2, arrLen-1)\\n\\t\\tcache[i] = result\\n\\t\\tpp.Println(i, result)\\n\\t}\\n\\n\\treturn calcWays(0, steps, steps/2, steps/2, arrLen-1)\\n\\t// Since the answer may be too large, return it modulo 10^9 + 7.\\n\\t// return 0\\n}\",\n \"func countHoriz(mygame game.Game, playerNum int, streakLength int) int {\\n\\tcount := 0 //overall # of streaks of n length\\n\\tcurrCount := 0 //this needs to be exactly n so that we don't count streaks of 2 as streaks of 3\\n\\tsymbol := mygame.PlayerSymbols[playerNum]\\n\\t//increment over every square\\n\\tfor i := 0; i < game.BoardHeight; i++ { //rows\\n\\t\\tfor j := 0; j < game.BoardWidth; j++ { //columns\\n\\t\\t\\tif mygame.GameBoard[i][j].Active {\\n\\t\\t\\t\\t//check that the symbol matches\\n\\t\\t\\t\\tif mygame.GameBoard[i][j].Symbol == symbol {\\n\\t\\t\\t\\t\\t//make sure piece to left isn't the same symbol\\n\\t\\t\\t\\t\\t//so that we're not double counting\\n\\t\\t\\t\\t\\tif j == 0 || mygame.GameBoard[i][j-1].Symbol != symbol {\\n\\t\\t\\t\\t\\t\\tcurrCount++\\n\\t\\t\\t\\t\\t\\tfor k := 1; k < 4; k++ {\\n\\t\\t\\t\\t\\t\\t\\tif j+k < game.BoardWidth { //make sure we don't go off board\\n\\t\\t\\t\\t\\t\\t\\t\\tif mygame.GameBoard[i][j+k].Symbol == symbol {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcurrCount++\\n\\t\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak //break if different symbol\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t//only increment count if currentcount matches n\\n\\t\\t\\t\\t\\t\\tif currCount == streakLength {\\n\\t\\t\\t\\t\\t\\t\\tcount++\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tcurrCount = 0 //reset currCount\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn count\\n}\",\n \"func Part2(shipMap ShipMap) string {\\n\\tminutes := 0\\n\\toxygenatedPoints := []Point{shipMap.grid[shipMap.osY][shipMap.osX]}\\n\\n\\tfor shipMap.Unoxygenated() > 0 {\\n\\t\\tfor _, point := range oxygenatedPoints {\\n\\t\\t\\tneighbors := shipMap.Neighbors(point)\\n\\t\\t\\tfor idx := 0; idx < len(neighbors); idx++ {\\n\\t\\t\\t\\tneighbor := neighbors[idx]\\n\\t\\t\\t\\tshipMap.grid[neighbor.y][neighbor.x].oxygenated = true\\n\\t\\t\\t\\tif !containsPoint(oxygenatedPoints, neighbor) {\\n\\t\\t\\t\\t\\toxygenatedPoints = append(oxygenatedPoints, neighbor)\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tminutes++\\n\\t}\\n\\n\\treturn \\\"Answer: \\\" + strconv.Itoa(minutes)\\n}\",\n \"func steps(s []int) int {\\n\\tsteps := 0\\n\\n\\tfor pos := 0; pos >= 0 && pos < len(s); steps += 1 {\\n\\t\\tnewpos := pos + s[pos]\\n\\t\\tif s[pos] >= 3 {\\n\\t\\t\\ts[pos] -= 1\\n\\t\\t} else {\\n\\t\\t\\ts[pos] += 1\\n\\t\\t}\\n\\t\\tpos = newpos\\n\\t}\\n\\n\\treturn steps\\n}\",\n \"func step2(w string) string {\\n\\tvar endings []string = []string{\\\"gd\\\", \\\"dt\\\", \\\"gt\\\", \\\"kt\\\"}\\n\\n\\tfor _, e := range endings {\\n\\t\\tif searchInR1(w, e) {\\n\\t\\t\\treturn w[0 : len(w)-1]\\n\\t\\t}\\n\\t}\\n\\n\\treturn w\\n}\",\n \"func PathLength(board [][]bool, start, target Coord) (int, bool) {\\n\\tn := len(board)\\n\\t// Check if start is out of bounds\\n\\tif start.Row < 0 || start.Row >= n || start.Col < 0 || start.Col >= len(board[start.Row]) {\\n\\t\\treturn 0, false\\n\\t}\\n\\n\\t// Check that not a wall\\n\\tif board[start.Row][start.Col] {\\n\\t\\treturn 0, false\\n\\t}\\n\\n\\t// Are we done?!\\n\\tif start == target {\\n\\t\\treturn 0, true\\n\\t}\\n\\n\\t// Backtracking algorithm\\n\\n\\t// Set board-value at the current position\\n\\tboard[start.Row][start.Col] = true\\n\\n\\tnSteps := math.MaxInt64\\n\\n\\tup, ok := PathLength(board, Coord{Row: start.Row - 1, Col: start.Col}, target)\\n\\tnSteps = minIfOkElseFirstArg(nSteps, up, ok)\\n\\n\\tdown, ok := PathLength(board, Coord{Row: start.Row + 1, Col: start.Col}, target)\\n\\tnSteps = minIfOkElseFirstArg(nSteps, down, ok)\\n\\n\\tleft, ok := PathLength(board, Coord{Row: start.Row, Col: start.Col - 1}, target)\\n\\tnSteps = minIfOkElseFirstArg(nSteps, left, ok)\\n\\n\\tright, ok := PathLength(board, Coord{Row: start.Row, Col: start.Col + 1}, target)\\n\\tnSteps = minIfOkElseFirstArg(nSteps, right, ok)\\n\\n\\t// Unset the board-value at the current position\\n\\tboard[start.Row][start.Col] = false\\n\\n\\t// No direction is valid\\n\\tif nSteps == math.MaxInt64 {\\n\\t\\treturn -1, false\\n\\t}\\n\\n\\t// Return minimum number of steps to target\\n\\treturn 1 + nSteps, true\\n}\",\n \"func findPaths(m int, n int, N int, i int, j int) int {\\n \\n}\",\n \"func prisonAfterNDays(cells []int, N int) []int {\\n \\n}\",\n \"func stepsToOxygen(d *droid) int {\\n\\n\\t// Run search algorithm (assume no more than n steps are required)\\n\\tfor i := 0; i < 1000; i++ {\\n\\t\\t// Try to take next step from all existing moves with distance i\\n\\t\\ttryMoves := d.getAllMovesWithDistance(i)\\n\\t\\tfor _, tryMove := range tryMoves {\\n\\t\\t\\t// First, navigate to the location of the move chosen\\n\\t\\t\\td.moveToPoint(tryMove.location)\\n\\t\\t\\t// Take a step in every direction (will populate map of movements)\\n\\t\\t\\td.moveEveryDirection()\\n\\t\\t}\\n\\t\\t// Check if target found flag is set, if yes, we're done\\n\\t\\tif d.foundTarget {\\n\\t\\t\\treturn i + 1\\n\\t\\t}\\n\\t}\\n\\n\\tlog.Fatal(\\\"Could not find target...\\\")\\n\\treturn 0\\n}\",\n \"func TimeToRun(marathonHours, marathonMinutes, miles float64) float64 {\\n var speed float64 = 26.2 / (marathonHours * 60 + marathonMinutes)\\n var days float64 = (miles / speed) / (24 * 60)\\n fmt.Println(\\\"You could run %.4f in %.4f days.\\\", miles, days)\\n return days\\n}\",\n \"func TestStepCycle(t *testing.T) {\\n\\tvar pathways [alphabetSize]int\\n\\tfor i := 0; i < alphabetSize; i++ {\\n\\t\\tpathways[i] = i\\n\\t}\\n\\n\\tfor i, test := range []struct {\\n\\t\\tstep int\\n\\t\\tcycle int\\n\\t\\tshouldErr bool\\n\\t}{\\n\\t\\t{\\n\\t\\t\\tstep: 1,\\n\\t\\t\\tcycle: 1,\\n\\t\\t\\tshouldErr: false,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tstep: 1,\\n\\t\\t\\tcycle: 2,\\n\\t\\t\\tshouldErr: false,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tstep: 2,\\n\\t\\t\\tcycle: 1,\\n\\t\\t\\tshouldErr: false,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tstep: 1,\\n\\t\\t\\tcycle: 13,\\n\\t\\t\\tshouldErr: false,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tstep: 13,\\n\\t\\t\\tcycle: 1,\\n\\t\\t\\tshouldErr: false,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tstep: 1,\\n\\t\\t\\tcycle: 26,\\n\\t\\t\\tshouldErr: false,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tstep: 26,\\n\\t\\t\\tcycle: 1,\\n\\t\\t\\tshouldErr: false,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tstep: 2,\\n\\t\\t\\tcycle: 13,\\n\\t\\t\\tshouldErr: false,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tstep: 13,\\n\\t\\t\\tcycle: 2,\\n\\t\\t\\tshouldErr: false,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tstep: 23,\\n\\t\\t\\tcycle: 32,\\n\\t\\t\\tshouldErr: true,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tstep: 1,\\n\\t\\t\\tcycle: -3,\\n\\t\\t\\tshouldErr: true,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tstep: 0,\\n\\t\\t\\tcycle: 1,\\n\\t\\t\\tshouldErr: true,\\n\\t\\t},\\n\\t} {\\n\\t\\terr := verifyRotor(pathways, 0, test.step, test.cycle)\\n\\t\\tif test.shouldErr && err == nil {\\n\\t\\t\\tt.Errorf(\\\"test %d: want error, got nil\\\", i)\\n\\t\\t} else if !test.shouldErr && err != nil {\\n\\t\\t\\tt.Errorf(\\\"test %d: want nil, got %w\\\", i, err)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (c Chessboard) validPieceKnight(square int) bool {\\n return int(c.boardSquares[square] % 10) == 2\\n}\",\n \"func (c Chessboard) candSquaresKnight(from int) []int {\\n if !c.validPieceKnight(from) {\\n return make([]int, 0, 1)\\n }\\n\\n candSquares := make([]int, 0, 16)\\n color := c.pieceColorOnPosition(from)\\n\\n directions := [][]int{{2,1},{-2,1},{2,-1},{-2,-1}, {1,2},{-1,2},{1,-2},{-1,-2}}\\n\\n for _,v := range(directions) {\\n currRow := rowFromPosition(from) + v[0]\\n currCol := colFromPosition(from) + v[1]\\n\\n currPos := posFromRowColumn(currRow, currCol)\\n\\n if currRow > -1 && currRow < 8 && currCol > -1 && currCol < 8 {\\n if c.pieceColorOnPosition(currPos) != color {\\n candSquares = append(candSquares, currPos)\\n }\\n }\\n }\\n\\n return candSquares\\n}\",\n \"func Day8Part2(filepath string) any {\\n\\tvar res int\\n\\n\\t// parse out treeMap from file\\n\\t// open file\\n\\treadFile, _ := os.Open(filepath)\\n\\n\\t// read line\\n\\tfileScanner := bufio.NewScanner(readFile)\\n\\tfileScanner.Split(bufio.ScanLines)\\n\\n\\t// parse map in to [][]int\\n\\ttreeMap := parseMap(fileScanner)\\n\\n\\t// iterate every tree\\n\\tfor i := range treeMap {\\n\\t\\tfor j := range treeMap[0] {\\n\\t\\t\\t// for every tree, calculate scenicScore\\n\\t\\t\\ts := getScenicScore(treeMap, i, j)\\n\\t\\t\\t// update max scenic score\\n\\t\\t\\tif s > res {\\n\\t\\t\\t\\tres = s\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn res\\n}\",\n \"func findRescuePathLength(caveDepth, targetX, targetY int, cavePlan cavePlanType) (int, cavePlanType) {\\n\\tgraphMap := make(graphMapType)\\n\\tstartTorchKey := graphItemKeyType{0, 0, TORCH}\\n\\tstartTorch := graphItemType{&startTorchKey, 0, -1, nil, false}\\n\\tpq := make(priorityQueue, 1)\\n\\tpq[0] = &startTorch\\n\\tgraphMap[startTorchKey] = &startTorch\\n\\theap.Init(&pq)\\n\\n\\tfor len(pq) > 0 {\\n\\t\\thead := heap.Pop(&pq).(*graphItemType)\\n\\t\\thead.processed = true\\n\\t\\t// If target reached return distance\\n\\t\\tif head.x == targetX && head.y == targetY && head.tool == TORCH {\\n\\t\\t\\treturn head.dist, cavePlan\\n\\t\\t}\\n\\t\\t// Left\\n\\t\\tif head.x > 0 && cavePlan[head.y][head.x-1].erosion != head.tool {\\n\\t\\t\\tcreateGraphItem(head.x-1, head.y, head.tool, head.dist+1, &pq, &graphMap, head)\\n\\t\\t}\\n\\t\\t// Up\\n\\t\\tif head.y > 0 && cavePlan[head.y-1][head.x].erosion != head.tool {\\n\\t\\t\\tcreateGraphItem(head.x, head.y-1, head.tool, head.dist+1, &pq, &graphMap, head)\\n\\t\\t}\\n\\t\\t// Generate additional cave plan if required\\n\\t\\tif head.x == len(cavePlan[head.y])-1 {\\n\\t\\t\\tcavePlan = addColumn(caveDepth, targetX, targetY, cavePlan)\\n\\t\\t}\\n\\t\\tif head.y == len(cavePlan)-1 {\\n\\t\\t\\tcavePlan = addRow(caveDepth, targetX, targetY, cavePlan)\\n\\t\\t}\\n\\t\\t// Right\\n\\t\\tif cavePlan[head.y][head.x+1].erosion != head.tool {\\n\\t\\t\\tcreateGraphItem(head.x+1, head.y, head.tool, head.dist+1, &pq, &graphMap, head)\\n\\t\\t}\\n\\t\\t// Down\\n\\t\\tif cavePlan[head.y+1][head.x].erosion != head.tool {\\n\\t\\t\\tcreateGraphItem(head.x, head.y+1, head.tool, head.dist+1, &pq, &graphMap, head)\\n\\t\\t}\\n\\t\\t// Change the tool operation is also one of options\\n\\t\\tnewTool := (head.tool + 1) % 3\\n\\t\\tif newTool == cavePlan[head.y][head.x].erosion {\\n\\t\\t\\tnewTool = (newTool + 1) % 3\\n\\t\\t}\\n\\t\\tcreateGraphItem(head.x, head.y, newTool, head.dist+7, &pq, &graphMap, head)\\n\\t}\\n\\treturn -1, cavePlan\\n}\",\n \"func (r *Register) totalSteps() string {\\n\\treturn fmt.Sprintf(\\\"%d\\\", len(r.steps)-1)\\n}\",\n \"func (c Chessboard) validMoveKnight(from int, to int) bool {\\n if !c.validPieceKnight(from) {\\n return false\\n }\\n\\n fromRow := rowFromPosition(from)\\n fromCol := colFromPosition(from)\\n toRow := rowFromPosition(to)\\n toCol := colFromPosition(to)\\n\\n if ((toRow == (fromRow - 2) || toRow == (fromRow + 2)) &&\\n (toCol == (fromCol - 1) || toCol == (fromCol + 1))) {\\n\\n return true\\n\\n }\\n\\n if ((toRow == (fromRow - 1) || toRow == (fromRow + 1)) &&\\n (toCol == (fromCol - 2) || toCol == (fromCol + 2))) {\\n\\n return true\\n\\n }\\n\\n return false\\n}\",\n \"func Test_step1(t *testing.T) {\\n\\ttestCases := []romance.StepTestCase{\\n\\t\\t{\\\"rapidement\\\", 3, 5, 2, true, \\\"rapid\\\", 3, 5, 2},\\n\\t\\t{\\\"paresseuse\\\", 3, 5, 3, true, \\\"paress\\\", 3, 5, 3},\\n\\t\\t{\\\"prosaïqUement\\\", 4, 7, 3, true, \\\"prosaïqU\\\", 4, 7, 3},\\n\\t\\t{\\\"nonchalance\\\", 3, 7, 2, true, \\\"nonchal\\\", 3, 7, 2},\\n\\t\\t{\\\"apostoliqUes\\\", 2, 4, 3, true, \\\"apostol\\\", 2, 4, 3},\\n\\t\\t{\\\"assiduités\\\", 2, 5, 4, true, \\\"assidu\\\", 2, 5, 4},\\n\\t\\t{\\\"philosophiqUement\\\", 4, 6, 3, true, \\\"philosoph\\\", 4, 6, 3},\\n\\t\\t{\\\"despotiqUement\\\", 3, 6, 2, true, \\\"despot\\\", 3, 6, 2},\\n\\t\\t{\\\"incontestablement\\\", 2, 5, 4, true, \\\"incontest\\\", 2, 5, 4},\\n\\t\\t{\\\"diminution\\\", 3, 5, 2, true, \\\"diminu\\\", 3, 5, 2},\\n\\t\\t{\\\"séditieuse\\\", 3, 5, 2, true, \\\"séditi\\\", 3, 5, 2},\\n\\t\\t{\\\"anonymement\\\", 2, 4, 3, true, \\\"anonym\\\", 2, 4, 3},\\n\\t\\t{\\\"conservation\\\", 3, 6, 2, true, \\\"conserv\\\", 3, 6, 2},\\n\\t\\t{\\\"fâcheuses\\\", 3, 7, 2, true, \\\"fâcheux\\\", 3, 7, 2},\\n\\t\\t{\\\"houleuse\\\", 4, 7, 2, true, \\\"houleux\\\", 4, 7, 2},\\n\\t\\t{\\\"historiqUes\\\", 3, 6, 2, true, \\\"histor\\\", 3, 6, 2},\\n\\t\\t{\\\"impérieusement\\\", 2, 5, 4, true, \\\"impéri\\\", 2, 5, 4},\\n\\t\\t{\\\"complaisances\\\", 3, 8, 2, true, \\\"complais\\\", 3, 8, 2},\\n\\t\\t{\\\"confessionnaux\\\", 3, 6, 2, true, \\\"confessionnal\\\", 3, 6, 2},\\n\\t\\t{\\\"grandement\\\", 4, 7, 3, true, \\\"grand\\\", 4, 5, 3},\\n\\t\\t{\\\"passablement\\\", 3, 6, 2, true, \\\"passabl\\\", 3, 6, 2},\\n\\t\\t{\\\"strictement\\\", 5, 8, 4, true, \\\"strict\\\", 5, 6, 4},\\n\\t\\t{\\\"physiqUement\\\", 4, 6, 3, true, \\\"physiqU\\\", 4, 6, 3},\\n\\t\\t{\\\"serieusement\\\", 3, 7, 2, true, \\\"serieux\\\", 3, 7, 2},\\n\\t\\t{\\\"roulement\\\", 4, 6, 2, true, \\\"roul\\\", 4, 4, 2},\\n\\t\\t{\\\"appartement\\\", 2, 5, 4, true, \\\"appart\\\", 2, 5, 4},\\n\\t\\t{\\\"reconnaissance\\\", 3, 5, 2, true, \\\"reconnaiss\\\", 3, 5, 2},\\n\\t\\t{\\\"aigrement\\\", 3, 6, 3, true, \\\"aigr\\\", 3, 4, 3},\\n\\t\\t{\\\"impertinences\\\", 2, 5, 4, true, \\\"impertinent\\\", 2, 5, 4},\\n\\t\\t{\\\"parlement\\\", 3, 6, 3, true, \\\"parl\\\", 3, 4, 3},\\n\\t\\t{\\\"malicieux\\\", 3, 5, 2, true, \\\"malici\\\", 3, 5, 2},\\n\\t\\t{\\\"suffisance\\\", 3, 6, 2, true, \\\"suffis\\\", 3, 6, 2},\\n\\t\\t{\\\"prémédité\\\", 4, 6, 3, true, \\\"préméd\\\", 4, 6, 3},\\n\\t\\t{\\\"métalliqUes\\\", 3, 5, 2, true, \\\"métall\\\", 3, 5, 2},\\n\\t\\t{\\\"météorologiste\\\", 3, 6, 2, true, \\\"météorolog\\\", 3, 6, 2},\\n\\t\\t{\\\"prononciation\\\", 4, 6, 3, true, \\\"prononci\\\", 4, 6, 3},\\n\\t\\t{\\\"nombreuse\\\", 3, 8, 2, true, \\\"nombreux\\\", 3, 8, 2},\\n\\t\\t{\\\"extatiqUe\\\", 2, 5, 4, true, \\\"extat\\\", 2, 5, 4},\\n\\t\\t{\\\"magnifiqUement\\\", 3, 6, 2, true, \\\"magnif\\\", 3, 6, 2},\\n\\t\\t{\\\"gymnastiqUe\\\", 3, 6, 2, true, \\\"gymnast\\\", 3, 6, 2},\\n\\t\\t{\\\"dramatiqUe\\\", 4, 6, 3, true, \\\"dramat\\\", 4, 6, 3},\\n\\t\\t{\\\"simplicité\\\", 3, 7, 2, true, \\\"simpliqU\\\", 3, 7, 2},\\n\\t\\t{\\\"roYalistes\\\", 3, 5, 2, true, \\\"roYal\\\", 3, 5, 2},\\n\\t\\t{\\\"fortifications\\\", 3, 6, 2, true, \\\"fortif\\\", 3, 6, 2},\\n\\t\\t{\\\"attendrissement\\\", 2, 5, 4, true, \\\"attendr\\\", 2, 5, 4},\\n\\t\\t{\\\"respectueusement\\\", 3, 6, 2, true, \\\"respectu\\\", 3, 6, 2},\\n\\t\\t{\\\"patriotisme\\\", 3, 7, 2, true, \\\"patriot\\\", 3, 7, 2},\\n\\t\\t{\\\"curieuse\\\", 3, 7, 2, true, \\\"curieux\\\", 3, 7, 2},\\n\\t\\t{\\\"fascination\\\", 3, 6, 2, true, \\\"fascin\\\", 3, 6, 2},\\n\\t\\t{\\\"effectivement\\\", 2, 5, 4, true, \\\"effect\\\", 2, 5, 4},\\n\\t\\t{\\\"condoléance\\\", 3, 6, 2, true, \\\"condolé\\\", 3, 6, 2},\\n\\t\\t{\\\"malignité\\\", 3, 5, 2, true, \\\"malign\\\", 3, 5, 2},\\n\\t\\t{\\\"capricieuse\\\", 3, 6, 2, true, \\\"caprici\\\", 3, 6, 2},\\n\\t\\t{\\\"applaudissements\\\", 2, 7, 5, true, \\\"applaud\\\", 2, 7, 5},\\n\\t\\t{\\\"praticable\\\", 4, 6, 3, true, \\\"pratic\\\", 4, 6, 3},\\n\\t\\t{\\\"rivaux\\\", 3, 6, 2, true, \\\"rival\\\", 3, 5, 2},\\n\\t\\t{\\\"augmentation\\\", 3, 6, 3, true, \\\"augment\\\", 3, 6, 3},\\n\\t\\t{\\\"ameublement\\\", 2, 5, 3, true, \\\"ameubl\\\", 2, 5, 3},\\n\\t\\t{\\\"honorables\\\", 3, 5, 2, true, \\\"honor\\\", 3, 5, 2},\\n\\t\\t{\\\"effervescence\\\", 2, 5, 4, true, \\\"effervescent\\\", 2, 5, 4},\\n\\t\\t{\\\"excentricité\\\", 2, 5, 4, true, \\\"excentr\\\", 2, 5, 4},\\n\\t\\t{\\\"misérable\\\", 3, 5, 2, true, \\\"misér\\\", 3, 5, 2},\\n\\t\\t{\\\"capitulation\\\", 3, 5, 2, true, \\\"capitul\\\", 3, 5, 2},\\n\\t\\t{\\\"enjoUement\\\", 2, 5, 4, true, \\\"enjoU\\\", 2, 5, 4},\\n\\t\\t{\\\"sévérité\\\", 3, 5, 2, true, \\\"sévér\\\", 3, 5, 2},\\n\\t\\t{\\\"perplexités\\\", 3, 7, 2, true, \\\"perplex\\\", 3, 7, 2},\\n\\t\\t{\\\"consentement\\\", 3, 6, 2, true, \\\"consent\\\", 3, 6, 2},\\n\\t\\t{\\\"convocation\\\", 3, 6, 2, true, \\\"convoc\\\", 3, 6, 2},\\n\\t\\t{\\\"assurances\\\", 2, 5, 4, true, \\\"assur\\\", 2, 5, 4},\\n\\t\\t{\\\"ébloUissement\\\", 2, 5, 4, true, \\\"ébloU\\\", 2, 5, 4},\\n\\t\\t{\\\"méridionaux\\\", 3, 5, 2, true, \\\"méridional\\\", 3, 5, 2},\\n\\t\\t{\\\"dérangements\\\", 3, 5, 2, true, \\\"dérang\\\", 3, 5, 2},\\n\\t\\t{\\\"domination\\\", 3, 5, 2, true, \\\"domin\\\", 3, 5, 2},\\n\\t\\t{\\\"incroYable\\\", 2, 6, 5, true, \\\"incroY\\\", 2, 6, 5},\\n\\t\\t{\\\"réjoUissances\\\", 3, 5, 2, true, \\\"réjoUiss\\\", 3, 5, 2},\\n\\t\\t{\\\"décadence\\\", 3, 5, 2, true, \\\"décadent\\\", 3, 5, 2},\\n\\t\\t{\\\"bâillement\\\", 4, 7, 2, true, \\\"bâill\\\", 4, 5, 2},\\n\\t\\t{\\\"habillement\\\", 3, 5, 2, true, \\\"habill\\\", 3, 5, 2},\\n\\t\\t{\\\"irréparablement\\\", 2, 5, 4, true, \\\"irrépar\\\", 2, 5, 4},\\n\\t\\t{\\\"diplomatiqUes\\\", 3, 6, 2, true, \\\"diplomat\\\", 3, 6, 2},\\n\\t\\t{\\\"distribution\\\", 3, 7, 2, true, \\\"distribu\\\", 3, 7, 2},\\n\\t\\t{\\\"pétulance\\\", 3, 5, 2, true, \\\"pétul\\\", 3, 5, 2},\\n\\t\\t{\\\"considérable\\\", 3, 6, 2, true, \\\"considér\\\", 3, 6, 2},\\n\\t\\t{\\\"éducation\\\", 2, 4, 3, true, \\\"éduc\\\", 2, 4, 3},\\n\\t\\t{\\\"indications\\\", 2, 5, 4, true, \\\"indiqU\\\", 2, 5, 4},\\n\\t\\t{\\\"cupidité\\\", 3, 5, 2, true, \\\"cupid\\\", 3, 5, 2},\\n\\t\\t{\\\"traîtreusement\\\", 5, 9, 3, true, \\\"traîtreux\\\", 5, 9, 3},\\n\\t\\t{\\\"silencieuse\\\", 3, 5, 2, true, \\\"silenci\\\", 3, 5, 2},\\n\\t\\t{\\\"pessimisme\\\", 3, 6, 2, true, \\\"pessim\\\", 3, 6, 2},\\n\\t\\t{\\\"préoccupation\\\", 5, 8, 3, true, \\\"préoccup\\\", 5, 8, 3},\\n\\t\\t// Special cases that should return false despite\\n\\t\\t// being changed. They \\\"don't count\\\".\\n\\t\\t{\\\"compliment\\\", 3, 7, 2, false, \\\"compli\\\", 3, 6, 2},\\n\\t\\t{\\\"vraiment\\\", 5, 7, 3, false, \\\"vrai\\\", 4, 4, 3},\\n\\t\\t{\\\"remercîment\\\", 3, 5, 2, false, \\\"remercî\\\", 3, 5, 2},\\n\\t\\t{\\\"puissamment\\\", 4, 7, 2, false, \\\"puissant\\\", 4, 7, 2},\\n\\t\\t{\\\"absolument\\\", 2, 5, 4, false, \\\"absolu\\\", 2, 5, 4},\\n\\t\\t{\\\"décidément\\\", 3, 5, 2, false, \\\"décidé\\\", 3, 5, 2},\\n\\t\\t{\\\"condiments\\\", 3, 6, 2, false, \\\"condi\\\", 3, 5, 2},\\n\\t}\\n\\tromance.RunStepTest(t, step1, testCases)\\n\\n}\",\n \"func findPaths(m int, n int, maxMove int, startRow int, startColumn int) int {\\n\\tgrid := make([][][]int, maxMove+1)\\n\\tfor k := 0; k <= maxMove; k++ {\\n\\t\\tgrid[k] = make([][]int, m)\\n\\t\\tfor i := 0; i < m; i++ {\\n\\t\\t\\tgrid[k][i] = make([]int, n)\\n\\t\\t}\\n\\t}\\n\\n\\tres := 0\\n\\tgrid[0][startRow][startColumn] = 1\\n\\n\\tfor move := 0; move < maxMove; move++ {\\n\\t\\tfor x := 0; x < m; x++ {\\n\\t\\t\\tfor y := 0; y < n; y++ {\\n\\t\\t\\t\\tv := grid[move][x][y] % modulo\\n\\t\\t\\t\\tif v == 0 {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif x == 0 {\\n\\t\\t\\t\\t\\tres += v\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tgrid[move+1][x-1][y] += v\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif x == m-1 {\\n\\t\\t\\t\\t\\tres += v\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tgrid[move+1][x+1][y] += v\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif y == 0 {\\n\\t\\t\\t\\t\\tres += v\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tgrid[move+1][x][y-1] += v\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif y == n-1 {\\n\\t\\t\\t\\t\\tres += v\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tgrid[move+1][x][y+1] += v\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn res % modulo\\n}\",\n \"func stepSeatMap(seatMap *SeatMap, count CountNeighbours, neighbourLimit int) (*SeatMap, bool) {\\n\\tnewMap := &SeatMap{\\n\\t\\tseats: make([][]rune, len(seatMap.seats)),\\n\\t\\toccupied: 0,\\n\\t}\\n\\tchanged := false\\n\\n\\tfor i := 0; i < len(seatMap.seats); i++ {\\n\\t\\tnewMap.seats[i] = make([]rune, len(seatMap.seats[i]))\\n\\t\\tfor j := 0; j < len(seatMap.seats[i]); j++ {\\n\\t\\t\\tif seatMap.seats[i][j] == '.' {\\n\\t\\t\\t\\tnewMap.seats[i][j] = '.'\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\toccupiedNeighbours := count(seatMap, i, j)\\n\\t\\t\\tif seatMap.seats[i][j] == 'L' {\\n\\t\\t\\t\\tif occupiedNeighbours == 0 {\\n\\t\\t\\t\\t\\tnewMap.seats[i][j] = '#'\\n\\t\\t\\t\\t\\tchanged = true\\n\\t\\t\\t\\t\\tnewMap.occupied++\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tnewMap.seats[i][j] = 'L'\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else if seatMap.seats[i][j] == '#' {\\n\\t\\t\\t\\tif occupiedNeighbours < neighbourLimit {\\n\\t\\t\\t\\t\\tnewMap.seats[i][j] = '#'\\n\\t\\t\\t\\t\\tnewMap.occupied++\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tnewMap.seats[i][j] = 'L'\\n\\t\\t\\t\\t\\tchanged = true\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn newMap, !changed\\n}\",\n \"func kerDIT8(a []fr.Element, twiddles [][]fr.Element, stage int) {\\n\\n\\tfr.Butterfly(&a[0], &a[1])\\n\\tfr.Butterfly(&a[2], &a[3])\\n\\tfr.Butterfly(&a[4], &a[5])\\n\\tfr.Butterfly(&a[6], &a[7])\\n\\tfr.Butterfly(&a[0], &a[2])\\n\\ta[3].Mul(&a[3], &twiddles[stage+1][1])\\n\\tfr.Butterfly(&a[1], &a[3])\\n\\tfr.Butterfly(&a[4], &a[6])\\n\\ta[7].Mul(&a[7], &twiddles[stage+1][1])\\n\\tfr.Butterfly(&a[5], &a[7])\\n\\tfr.Butterfly(&a[0], &a[4])\\n\\ta[5].Mul(&a[5], &twiddles[stage+0][1])\\n\\tfr.Butterfly(&a[1], &a[5])\\n\\ta[6].Mul(&a[6], &twiddles[stage+0][2])\\n\\tfr.Butterfly(&a[2], &a[6])\\n\\ta[7].Mul(&a[7], &twiddles[stage+0][3])\\n\\tfr.Butterfly(&a[3], &a[7])\\n}\",\n \"func TestTakeSteps(t *testing.T) {\\n\\tfor i, test := range []struct {\\n\\t\\trotors *Rotors\\n\\t\\tsteps []int\\n\\t\\texpected [][]int\\n\\t}{\\n\\t\\t{\\n\\t\\t\\trotors: newTestRotors(\\n\\t\\t\\t\\tt,\\n\\t\\t\\t\\t[]int{0, 0, 0},\\n\\t\\t\\t\\t[]int{1, 1, 1},\\n\\t\\t\\t\\t[]int{26, 26, 26},\\n\\t\\t\\t),\\n\\t\\t\\tsteps: []int{10, 26 * 26 * 26},\\n\\t\\t\\texpected: [][]int{{10, 0, 0}, {10, 0, 0}},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\trotors: newTestRotors(\\n\\t\\t\\t\\tt,\\n\\t\\t\\t\\t[]int{1, 0, 0},\\n\\t\\t\\t\\t[]int{1, 1, 1},\\n\\t\\t\\t\\t[]int{2, 2, 2},\\n\\t\\t\\t),\\n\\t\\t\\tsteps: []int{3, 20},\\n\\t\\t\\texpected: [][]int{{4, 2, 1}, {24, 12, 6}},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\trotors: newTestRotors(\\n\\t\\t\\t\\tt,\\n\\t\\t\\t\\t[]int{0, 13, 0},\\n\\t\\t\\t\\t[]int{13, 13, 13},\\n\\t\\t\\t\\t[]int{2, 2, 2},\\n\\t\\t\\t),\\n\\t\\t\\tsteps: []int{2, 8},\\n\\t\\t\\texpected: [][]int{{0, 0, 13}, {0, 0, 13}},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\trotors: newTestRotors(\\n\\t\\t\\t\\tt,\\n\\t\\t\\t\\t[]int{0, 0, 0},\\n\\t\\t\\t\\t[]int{2, 2, 2},\\n\\t\\t\\t\\t[]int{13, 13, 13},\\n\\t\\t\\t),\\n\\t\\t\\tsteps: []int{1, 14},\\n\\t\\t\\texpected: [][]int{{2, 0, 0}, {4, 2, 0}},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\trotors: newTestRotors(\\n\\t\\t\\t\\tt,\\n\\t\\t\\t\\t[]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\\n\\t\\t\\t\\t[]int{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},\\n\\t\\t\\t\\t[]int{26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26},\\n\\t\\t\\t),\\n\\t\\t\\tsteps: []int{5, 26 * 26 * 26 * 26},\\n\\t\\t\\texpected: [][]int{\\n\\t\\t\\t\\t{5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\\n\\t\\t\\t\\t{5, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0},\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\trotors: newTestRotors(\\n\\t\\t\\t\\tt,\\n\\t\\t\\t\\t[]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\\n\\t\\t\\t\\t[]int{13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13},\\n\\t\\t\\t\\t[]int{2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2},\\n\\t\\t\\t),\\n\\t\\t\\tsteps: []int{15, 30},\\n\\t\\t\\texpected: [][]int{\\n\\t\\t\\t\\t{13, 13, 13, 13, 0, 0, 0, 0, 0, 0, 0, 0},\\n\\t\\t\\t\\t{13, 0, 13, 13, 0, 13, 0, 0, 0, 0, 0, 0},\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\trotors: newTestRotors(\\n\\t\\t\\t\\tt,\\n\\t\\t\\t\\t[]int{0, 0, 0},\\n\\t\\t\\t\\t[]int{1, 2, 1},\\n\\t\\t\\t\\t[]int{1, 13, 26},\\n\\t\\t\\t),\\n\\t\\t\\tsteps: []int{8, 2},\\n\\t\\t\\texpected: [][]int{{8, 16, 0}, {10, 20, 0}},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\trotors: newTestRotors(\\n\\t\\t\\t\\tt,\\n\\t\\t\\t\\t[]int{\\n\\t\\t\\t\\t\\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n\\t\\t\\t\\t\\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n\\t\\t\\t\\t\\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n\\t\\t\\t\\t},\\n\\t\\t\\t\\t[]int{\\n\\t\\t\\t\\t\\t13, 2, 13, 2, 13, 2, 13, 2, 13, 2,\\n\\t\\t\\t\\t\\t13, 2, 13, 2, 13, 2, 13, 2, 13, 2,\\n\\t\\t\\t\\t\\t13, 2, 13, 2, 13, 2, 13, 2, 13, 2,\\n\\t\\t\\t\\t},\\n\\t\\t\\t\\t[]int{\\n\\t\\t\\t\\t\\t2, 13, 2, 13, 2, 13, 2, 13, 2, 13,\\n\\t\\t\\t\\t\\t2, 13, 2, 13, 2, 13, 2, 13, 2, 13,\\n\\t\\t\\t\\t\\t2, 13, 2, 13, 2, 13, 2, 13, 2, 13,\\n\\t\\t\\t\\t},\\n\\t\\t\\t),\\n\\t\\t\\tsteps: []int{30, 30},\\n\\t\\t\\texpected: [][]int{\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t0, 4, 13, 0, 0, 0, 0, 0, 0, 0,\\n\\t\\t\\t\\t\\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n\\t\\t\\t\\t\\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n\\t\\t\\t\\t},\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t0, 8, 0, 2, 0, 0, 0, 0, 0, 0,\\n\\t\\t\\t\\t\\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n\\t\\t\\t\\t\\t0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\\n\\t\\t\\t\\t},\\n\\t\\t\\t},\\n\\t\\t},\\n\\t} {\\n\\t\\tfor j, step := range test.steps {\\n\\t\\t\\tfor k := 0; k < step; k++ {\\n\\t\\t\\t\\ttest.rotors.takeStep()\\n\\t\\t\\t}\\n\\n\\t\\t\\tif diff := cmp.Diff(test.expected[j], test.rotors.Setting()); diff != \\\"\\\" {\\n\\t\\t\\t\\tt.Errorf(\\\"test %d: mismatch (-want +got):\\\\n%s\\\", i, diff)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (s *statement) prevTurn() int {\\n\\treturn (s.Step+2)%4 + 1\\n}\",\n \"func main() {\\n\\tg, nodesMap := graphLineByLine()\\n\\n\\tstart := nodesMap[\\\"shiny gold\\\"]\\n\\tcount := 0\\n\\tgraph.BFS(g, start, func(v, w int, _ int64) {\\n\\t\\t//fmt.Println(v, \\\"to\\\", w)\\n\\t\\tcount++\\n\\n\\t})\\n\\n\\tfmt.Println(count)\\n}\",\n \"func mapSteps(g *GraphFile, edgeIndices []int) int {\\n\\tsize := 0\\n\\tfor e := 0; e < g.EdgeCount(); e++ {\\n\\t\\tif edgeIndices[e] == -1 {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tsize += int(g.Steps[e+1] - g.Steps[e])\\n\\t}\\n\\treturn size\\n}\",\n \"func stepPerms(n int32) int32 {\\n\\tcollection := &StepsPremsCollection{memory: make(map[int32]int32)}\\n\\treturn collection.getPerms(n)\\n}\",\n \"func countVert(mygame game.Game, playerNum int, streakLength int) int {\\n\\n\\tcount := 0 //overall # of streaks of n length\\n\\tcurrCount := 0 //this needs to be exactly n so that we don't count streaks of 2 as streaks of 3\\n\\tsymbol := mygame.PlayerSymbols[playerNum]\\n\\n\\t//increment over every square\\n\\tfor i := 0; i < game.BoardHeight; i++ { //rows\\n\\t\\tfor j := 0; j < game.BoardWidth; j++ { //columns\\n\\n\\t\\t\\tif mygame.GameBoard[i][j].Active {\\n\\t\\t\\t\\t//check that the symbol matches\\n\\t\\t\\t\\tif mygame.GameBoard[i][j].Symbol == symbol {\\n\\t\\t\\t\\t\\t//make sure piece above isn't the same symbol\\n\\t\\t\\t\\t\\t//so that we're not double counting\\n\\t\\t\\t\\t\\tif i == 0 || mygame.GameBoard[i-1][j].Symbol != symbol {\\n\\t\\t\\t\\t\\t\\tcurrCount++\\n\\t\\t\\t\\t\\t\\tfor k := 1; k < 4; k++ {\\n\\t\\t\\t\\t\\t\\t\\tif i+k < game.BoardHeight { //make sure we don't go off board\\n\\t\\t\\t\\t\\t\\t\\t\\tif mygame.GameBoard[i+k][j].Symbol == symbol {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcurrCount++\\n\\t\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak //break if different symbol\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t//only increment count if currentcount matches n\\n\\n\\t\\t\\t\\t\\t\\tif currCount == streakLength {\\n\\t\\t\\t\\t\\t\\t\\tcount++\\n\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tcurrCount = 0 //reset currCount\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn count\\n}\",\n \"func Test_step2b(t *testing.T) {\\n\\ttestCases := []romance.StepTestCase{\\n\\t\\t{\\\"posée\\\", 3, 5, 2, true, \\\"pos\\\", 3, 3, 2},\\n\\t\\t{\\\"contentait\\\", 3, 6, 2, true, \\\"content\\\", 3, 6, 2},\\n\\t\\t{\\\"évita\\\", 2, 4, 3, true, \\\"évit\\\", 2, 4, 3},\\n\\t\\t{\\\"cantonnées\\\", 3, 6, 2, true, \\\"cantonn\\\", 3, 6, 2},\\n\\t\\t{\\\"tender\\\", 3, 6, 2, true, \\\"tend\\\", 3, 4, 2},\\n\\t\\t{\\\"survenait\\\", 3, 6, 2, true, \\\"surven\\\", 3, 6, 2},\\n\\t\\t{\\\"plongeaIent\\\", 4, 8, 3, true, \\\"plong\\\", 4, 5, 3},\\n\\t\\t{\\\"modéra\\\", 3, 5, 2, true, \\\"modér\\\", 3, 5, 2},\\n\\t\\t{\\\"copier\\\", 3, 6, 2, true, \\\"copi\\\", 3, 4, 2},\\n\\t\\t{\\\"bougez\\\", 4, 6, 2, true, \\\"boug\\\", 4, 4, 2},\\n\\t\\t{\\\"déploYaIent\\\", 3, 6, 2, true, \\\"déploY\\\", 3, 6, 2},\\n\\t\\t{\\\"entendra\\\", 2, 5, 4, true, \\\"entendr\\\", 2, 5, 4},\\n\\t\\t{\\\"blâmer\\\", 4, 6, 3, true, \\\"blâm\\\", 4, 4, 3},\\n\\t\\t{\\\"déshonorait\\\", 3, 6, 2, true, \\\"déshonor\\\", 3, 6, 2},\\n\\t\\t{\\\"concentrés\\\", 3, 6, 2, true, \\\"concentr\\\", 3, 6, 2},\\n\\t\\t{\\\"mangeant\\\", 3, 7, 2, true, \\\"mang\\\", 3, 4, 2},\\n\\t\\t{\\\"écouteront\\\", 2, 5, 3, true, \\\"écout\\\", 2, 5, 3},\\n\\t\\t{\\\"pressaIent\\\", 4, 7, 3, true, \\\"press\\\", 4, 5, 3},\\n\\t\\t{\\\"ébréché\\\", 2, 5, 4, true, \\\"ébréch\\\", 2, 5, 4},\\n\\t\\t{\\\"frapper\\\", 4, 7, 3, true, \\\"frapp\\\", 4, 5, 3},\\n\\t\\t{\\\"côtoYé\\\", 3, 5, 2, true, \\\"côtoY\\\", 3, 5, 2},\\n\\t\\t{\\\"réfugié\\\", 3, 5, 2, true, \\\"réfugi\\\", 3, 5, 2},\\n\\t\\t{\\\"jeûnant\\\", 4, 6, 2, true, \\\"jeûn\\\", 4, 4, 2},\\n\\t\\t{\\\"succombé\\\", 3, 6, 2, true, \\\"succomb\\\", 3, 6, 2},\\n\\t\\t{\\\"irrité\\\", 2, 5, 4, true, \\\"irrit\\\", 2, 5, 4},\\n\\t\\t{\\\"danger\\\", 3, 6, 2, true, \\\"dang\\\", 3, 4, 2},\\n\\t\\t{\\\"sachant\\\", 3, 6, 2, true, \\\"sach\\\", 3, 4, 2},\\n\\t\\t{\\\"reparaissaIent\\\", 3, 5, 2, true, \\\"reparaiss\\\", 3, 5, 2},\\n\\t\\t{\\\"reconnaissant\\\", 3, 5, 2, true, \\\"reconnaiss\\\", 3, 5, 2},\\n\\t\\t{\\\"faisant\\\", 4, 6, 2, true, \\\"fais\\\", 4, 4, 2},\\n\\t\\t{\\\"arrangés\\\", 2, 5, 4, true, \\\"arrang\\\", 2, 5, 4},\\n\\t\\t{\\\"emparés\\\", 2, 5, 4, true, \\\"empar\\\", 2, 5, 4},\\n\\t\\t{\\\"choqUée\\\", 4, 7, 3, true, \\\"choqU\\\", 4, 5, 3},\\n\\t\\t{\\\"gênait\\\", 3, 6, 2, true, \\\"gên\\\", 3, 3, 2},\\n\\t\\t{\\\"croissante\\\", 5, 8, 3, true, \\\"croiss\\\", 5, 6, 3},\\n\\t\\t{\\\"scié\\\", 4, 4, 3, true, \\\"sci\\\", 3, 3, 3},\\n\\t\\t{\\\"reconnaissez\\\", 3, 5, 2, true, \\\"reconnaiss\\\", 3, 5, 2},\\n\\t\\t{\\\"pliaIent\\\", 5, 7, 3, true, \\\"pli\\\", 3, 3, 3},\\n\\t\\t{\\\"expédia\\\", 2, 5, 4, true, \\\"expédi\\\", 2, 5, 4},\\n\\t\\t{\\\"déshabillaIent\\\", 3, 6, 2, true, \\\"déshabill\\\", 3, 6, 2},\\n\\t\\t{\\\"appréciée\\\", 2, 6, 5, true, \\\"appréci\\\", 2, 6, 5},\\n\\t\\t{\\\"amputés\\\", 2, 5, 4, true, \\\"amput\\\", 2, 5, 4},\\n\\t\\t{\\\"dominait\\\", 3, 5, 2, true, \\\"domin\\\", 3, 5, 2},\\n\\t\\t{\\\"vexantes\\\", 3, 5, 2, true, \\\"vex\\\", 3, 3, 2},\\n\\t\\t{\\\"fabriqUées\\\", 3, 6, 2, true, \\\"fabriqU\\\", 3, 6, 2},\\n\\t\\t{\\\"retomber\\\", 3, 5, 2, true, \\\"retomb\\\", 3, 5, 2},\\n\\t\\t{\\\"exercer\\\", 2, 4, 3, true, \\\"exerc\\\", 2, 4, 3},\\n\\t\\t{\\\"entourait\\\", 2, 6, 4, true, \\\"entour\\\", 2, 6, 4},\\n\\t\\t{\\\"voYait\\\", 3, 6, 2, true, \\\"voY\\\", 3, 3, 2},\\n\\t\\t{\\\"soupait\\\", 4, 7, 2, true, \\\"soup\\\", 4, 4, 2},\\n\\t\\t{\\\"apportiez\\\", 2, 5, 4, true, \\\"apport\\\", 2, 5, 4},\\n\\t\\t{\\\"tuée\\\", 4, 4, 2, true, \\\"tu\\\", 2, 2, 2},\\n\\t\\t{\\\"proposait\\\", 4, 6, 3, true, \\\"propos\\\", 4, 6, 3},\\n\\t\\t{\\\"citations\\\", 3, 5, 2, true, \\\"citat\\\", 3, 5, 2},\\n\\t\\t{\\\"distinguée\\\", 3, 6, 2, true, \\\"distingu\\\", 3, 6, 2},\\n\\t\\t{\\\"parlerez\\\", 3, 6, 3, true, \\\"parl\\\", 3, 4, 3},\\n\\t\\t{\\\"stanislas\\\", 4, 6, 3, true, \\\"stanisl\\\", 4, 6, 3},\\n\\t\\t{\\\"enlevée\\\", 2, 5, 4, true, \\\"enlev\\\", 2, 5, 4},\\n\\t\\t{\\\"irriguaIent\\\", 2, 5, 4, true, \\\"irrigu\\\", 2, 5, 4},\\n\\t\\t{\\\"contenant\\\", 3, 6, 2, true, \\\"conten\\\", 3, 6, 2},\\n\\t\\t{\\\"empêchèrent\\\", 2, 5, 4, true, \\\"empêch\\\", 2, 5, 4},\\n\\t\\t{\\\"inspirées\\\", 2, 6, 5, true, \\\"inspir\\\", 2, 6, 5},\\n\\t\\t{\\\"basée\\\", 3, 5, 2, true, \\\"bas\\\", 3, 3, 2},\\n\\t\\t{\\\"consultait\\\", 3, 6, 2, true, \\\"consult\\\", 3, 6, 2},\\n\\t\\t{\\\"retardait\\\", 3, 5, 2, true, \\\"retard\\\", 3, 5, 2},\\n\\t\\t{\\\"enlevât\\\", 2, 5, 4, true, \\\"enlev\\\", 2, 5, 4},\\n\\t\\t{\\\"convenaIent\\\", 3, 6, 2, true, \\\"conven\\\", 3, 6, 2},\\n\\t\\t{\\\"portât\\\", 3, 6, 2, true, \\\"port\\\", 3, 4, 2},\\n\\t\\t{\\\"admirée\\\", 2, 5, 4, true, \\\"admir\\\", 2, 5, 4},\\n\\t\\t{\\\"copiée\\\", 3, 6, 2, true, \\\"copi\\\", 3, 4, 2},\\n\\t\\t{\\\"démenaIent\\\", 3, 5, 2, true, \\\"démen\\\", 3, 5, 2},\\n\\t\\t{\\\"fortifiées\\\", 3, 6, 2, true, \\\"fortifi\\\", 3, 6, 2},\\n\\t\\t{\\\"apercevrait\\\", 2, 4, 3, true, \\\"apercevr\\\", 2, 4, 3},\\n\\t\\t{\\\"risqUer\\\", 3, 7, 2, true, \\\"risqU\\\", 3, 5, 2},\\n\\t\\t{\\\"réclamer\\\", 3, 6, 2, true, \\\"réclam\\\", 3, 6, 2},\\n\\t\\t{\\\"tremblaIent\\\", 4, 8, 3, true, \\\"trembl\\\", 4, 6, 3},\\n\\t\\t{\\\"calomnier\\\", 3, 5, 2, true, \\\"calomni\\\", 3, 5, 2},\\n\\t\\t{\\\"réclamée\\\", 3, 6, 2, true, \\\"réclam\\\", 3, 6, 2},\\n\\t\\t{\\\"déposât\\\", 3, 5, 2, true, \\\"dépos\\\", 3, 5, 2},\\n\\t\\t{\\\"filé\\\", 3, 4, 2, true, \\\"fil\\\", 3, 3, 2},\\n\\t\\t{\\\"déchirée\\\", 3, 6, 2, true, \\\"déchir\\\", 3, 6, 2},\\n\\t\\t{\\\"prononça\\\", 4, 6, 3, true, \\\"prononç\\\", 4, 6, 3},\\n\\t\\t{\\\"précédé\\\", 4, 6, 3, true, \\\"précéd\\\", 4, 6, 3},\\n\\t\\t{\\\"asseYait\\\", 2, 5, 4, true, \\\"asseY\\\", 2, 5, 4},\\n\\t\\t{\\\"emploYés\\\", 2, 6, 5, true, \\\"emploY\\\", 2, 6, 5},\\n\\t\\t{\\\"chagriner\\\", 4, 7, 3, true, \\\"chagrin\\\", 4, 7, 3},\\n\\t\\t{\\\"dévorât\\\", 3, 5, 2, true, \\\"dévor\\\", 3, 5, 2},\\n\\t\\t{\\\"remonté\\\", 3, 5, 2, true, \\\"remont\\\", 3, 5, 2},\\n\\t\\t{\\\"emploYant\\\", 2, 6, 5, true, \\\"emploY\\\", 2, 6, 5},\\n\\t\\t{\\\"redoublait\\\", 3, 6, 2, true, \\\"redoubl\\\", 3, 6, 2},\\n\\t\\t{\\\"marchant\\\", 3, 7, 2, true, \\\"march\\\", 3, 5, 2},\\n\\t\\t{\\\"pétrifiée\\\", 3, 6, 2, true, \\\"pétrifi\\\", 3, 6, 2},\\n\\t\\t{\\\"enlevées\\\", 2, 5, 4, true, \\\"enlev\\\", 2, 5, 4},\\n\\t\\t{\\\"donnassent\\\", 3, 6, 2, true, \\\"donn\\\", 3, 4, 2},\\n\\t\\t{\\\"recomptait\\\", 3, 5, 2, true, \\\"recompt\\\", 3, 5, 2},\\n\\t\\t{\\\"masqUait\\\", 3, 8, 2, true, \\\"masqU\\\", 3, 5, 2},\\n\\t\\t{\\\"renouvelèrent\\\", 3, 6, 2, true, \\\"renouvel\\\", 3, 6, 2},\\n\\t\\t{\\\"recoucher\\\", 3, 6, 2, true, \\\"recouch\\\", 3, 6, 2},\\n\\t\\t{\\\"abrégea\\\", 2, 5, 4, true, \\\"abrég\\\", 2, 5, 4},\\n\\t\\t{\\\"flattait\\\", 4, 8, 3, true, \\\"flatt\\\", 4, 5, 3},\\n\\t}\\n\\tromance.RunStepTest(t, step2b, testCases)\\n}\",\n \"func Day8Part2(input []string) (string, error) {\\n\\n\\timData := input[0]\\n\\timWidth, imHeight := 25, 6\\n\\n\\tlayers := generateLayers(imData, imWidth, imHeight)\\n\\n\\tmessage := \\\"\\\"\\n\\tfor y := 0; y < imHeight; y++ {\\n\\t\\tfor x := 0; x < imWidth; x++ {\\n\\t\\t\\tmessage += getMessagePixel(layers, x, y)\\n\\t\\t}\\n\\t\\tmessage += \\\"\\\\n\\\"\\n\\t}\\n\\n\\treturn message, nil\\n}\",\n \"func gameOfLife(board [][]int) {\\n\\tm := len(board)\\n\\tn := len(board[0])\\n\\tfor y := 0; y < m; y++ {\\n\\t\\tfor x := 0; x < n; x++ {\\n\\t\\t\\tneighbors := 0\\n\\t\\t\\tif y > 0 {\\n\\t\\t\\t\\tneighbors += board[y-1][x] & 1\\n\\t\\t\\t\\tif x > 0 {\\n\\t\\t\\t\\t\\tneighbors += board[y-1][x-1] & 1\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif x < n-1 {\\n\\t\\t\\t\\t\\tneighbors += board[y-1][x+1] & 1\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif y < m-1 {\\n\\t\\t\\t\\tneighbors += board[y+1][x] & 1\\n\\t\\t\\t\\tif x > 0 {\\n\\t\\t\\t\\t\\tneighbors += board[y+1][x-1] & 1\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif x < n-1 {\\n\\t\\t\\t\\t\\tneighbors += board[y+1][x+1] & 1\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif x > 0 {\\n\\t\\t\\t\\tneighbors += board[y][x-1] & 1\\n\\t\\t\\t}\\n\\n\\t\\t\\tif x < n-1 {\\n\\t\\t\\t\\tneighbors += board[y][x+1] & 1\\n\\t\\t\\t}\\n\\n\\t\\t\\tlive := 1 == (board[y][x] & 1)\\n\\t\\t\\tswitch {\\n\\t\\t\\tcase !live && neighbors == 3:\\n\\t\\t\\t\\tboard[y][x] |= 2\\n\\t\\t\\tcase live && (neighbors == 2 || neighbors == 3):\\n\\t\\t\\t\\tboard[y][x] |= 2\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor y := 0; y < m; y++ {\\n\\t\\tfor x := 0; x < n; x++ {\\n\\t\\t\\tboard[y][x] >>= 1\\n\\t\\t}\\n\\t}\\n}\",\n \"func main() {\\n\\tinstructions := readLineByLine()\\n\\n\\tvar accumulator int\\n\\tvar hasCycles bool\\n\\tinstructionsSwitched := make(map[int]instruction)\\n\\ti := 0\\n\\n\\tfor i > -1 {\\n\\t\\tfor k, v := range instructions {\\n\\t\\t\\tinstructionsSwitched[k] = v\\n\\t\\t}\\n\\n\\t\\tif i > len(instructions) {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\t// cycle through instructions and if found nop or jmp switch > create new instructions\\n\\t\\t// calculate accumulator and if has cycles\\n\\t\\taction := instructions[i].action\\n\\t\\tif action == \\\"jmp\\\" || action == \\\"nop\\\" {\\n\\t\\t\\tif action == \\\"jmp\\\" {\\n\\t\\t\\t\\tmove := instructions[i].move\\n\\t\\t\\t\\tinstructionsSwitched[i] = instruction{\\\"nop\\\", move}\\n\\t\\t\\t\\taccumulator, hasCycles = computeAcc(instructionsSwitched)\\n\\t\\t\\t}\\n\\t\\t\\tif action == \\\"nop\\\" {\\n\\t\\t\\t\\tmove := instructions[i].move\\n\\t\\t\\t\\tinstructionsSwitched[i] = instruction{\\\"jmp\\\", move}\\n\\t\\t\\t\\taccumulator, hasCycles = computeAcc(instructionsSwitched)\\n\\t\\t\\t}\\n\\t\\t\\tif !hasCycles {\\n\\t\\t\\t\\tfmt.Println(\\\"no cycle found\\\", i)\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t\\tif hasCycles {\\n\\t\\t\\t\\tfmt.Println(\\\"cycle found\\\", i)\\n\\t\\t\\t\\ti++\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif action == \\\"acc\\\" {\\n\\t\\t\\ti++\\n\\t\\t}\\n\\t}\\n\\n\\tfmt.Println(accumulator)\\n\\t//fmt.Println(g, nodesMap)\\n}\",\n \"func tictactoe(moves [][]int) string {\\n\\tgrid := [3][3]int{}\\n\\n\\tbefore := 1\\n\\tfor _, move := range moves {\\n\\t\\tgrid[move[0]][move[1]] = before\\n\\t\\tswitch before {\\n\\t\\tcase 1:\\n\\t\\t\\tbefore = 2\\n\\t\\tcase 2:\\n\\t\\t\\tbefore = 1\\n\\t\\t}\\n\\t}\\n\\n\\t// if (9 - len(moves)) == 1 {\\n\\t// \\tfor i := range grid {\\n\\t// \\t\\tfor j := range grid {\\n\\t// \\t\\t\\tif grid[i][j] == 0 {\\n\\t// \\t\\t\\t\\tgrid[i][j] = 1\\n\\t// \\t\\t\\t}\\n\\t// \\t\\t}\\n\\t// \\t}\\n\\t// }\\n\\n\\tfmt.Println(grid)\\n\\n\\tend := func(this int) string {\\n\\t\\tif this == 1 {\\n\\t\\t\\treturn \\\"A\\\"\\n\\t\\t} else if this == 2 {\\n\\t\\t\\treturn \\\"B\\\"\\n\\t\\t}\\n\\t\\treturn \\\"\\\"\\n\\t}\\n\\n\\thalf := (9 - len(moves)) / 2\\n\\taReft := half + (9-len(moves))%2\\n\\tbReft := half\\n\\n\\taReach := 0\\n\\tbReach := 0\\n\\tfor i := 0; i < 3; i++ {\\n\\t\\tif grid[0][i] == grid[1][i] && grid[1][i] == grid[2][i] {\\n\\t\\t\\tif winner := end(grid[1][i]); winner != \\\"\\\" {\\n\\t\\t\\t\\treturn winner\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t// if aReach >= aReft && aReft != bReft {\\n\\n\\t// }\\n\\n\\taReach = 0\\n\\tbReach = 0\\n\\tfor i := 0; i < 3; i++ {\\n\\t\\tif grid[i][0] == grid[i][1] && grid[i][1] == grid[i][2] {\\n\\t\\t\\tif winner := end(grid[i][1]); winner != \\\"\\\" {\\n\\t\\t\\t\\treturn winner\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\taReach = 0\\n\\tbReach = 0\\n\\tif grid[0][0] == grid[1][1] && grid[1][1] == grid[2][2] {\\n\\t\\tif winner := end(grid[1][1]); winner != \\\"\\\" {\\n\\t\\t\\treturn winner\\n\\t\\t}\\n\\t}\\n\\n\\taReach = 0\\n\\tbReach = 0\\n\\tif grid[0][2] == grid[1][1] && grid[1][1] == grid[2][0] {\\n\\t\\tif winner := end(grid[1][1]); winner != \\\"\\\" {\\n\\t\\t\\treturn winner\\n\\t\\t}\\n\\t}\\n\\n\\t// if len(moves) >= 8 {\\n\\tif len(moves) == 9 {\\n\\t\\treturn \\\"Draw\\\"\\n\\t}\\n\\n\\t// あと何回打てるか？\\n\\t// 自分の回数より多いとそっちの勝ち\\n\\n\\t_ = aReft\\n\\t_ = bReft\\n\\t_ = aReach\\n\\t_ = bReach\\n\\n\\treturn \\\"Pending\\\"\\n}\",\n \"func (graph *Graph) GetSteps(path Path) int {\\n\\treturn len(path) - 1 // contains start point so -1\\n}\",\n \"func Test_step2a(t *testing.T) {\\n\\ttestCases := []romance.StepTestCase{\\n\\t\\t{\\\"épanoUit\\\", 2, 4, 3, true, \\\"épanoU\\\", 2, 4, 3},\\n\\t\\t{\\\"faillirent\\\", 4, 7, 2, true, \\\"faill\\\", 4, 5, 2},\\n\\t\\t{\\\"acabit\\\", 2, 4, 3, true, \\\"acab\\\", 2, 4, 3},\\n\\t\\t{\\\"établissait\\\", 2, 4, 3, true, \\\"établ\\\", 2, 4, 3},\\n\\t\\t{\\\"découvrir\\\", 3, 6, 2, true, \\\"découvr\\\", 3, 6, 2},\\n\\t\\t{\\\"réjoUissait\\\", 3, 5, 2, true, \\\"réjoU\\\", 3, 5, 2},\\n\\t\\t{\\\"trahiront\\\", 4, 6, 3, true, \\\"trah\\\", 4, 4, 3},\\n\\t\\t{\\\"maintenir\\\", 4, 7, 2, true, \\\"mainten\\\", 4, 7, 2},\\n\\t\\t{\\\"vendit\\\", 3, 6, 2, true, \\\"vend\\\", 3, 4, 2},\\n\\t\\t{\\\"repartit\\\", 3, 5, 2, true, \\\"repart\\\", 3, 5, 2},\\n\\t\\t{\\\"giletti\\\", 3, 5, 2, true, \\\"gilett\\\", 3, 5, 2},\\n\\t\\t{\\\"rienzi\\\", 4, 6, 2, true, \\\"rienz\\\", 4, 5, 2},\\n\\t\\t{\\\"punie\\\", 3, 5, 2, true, \\\"pun\\\", 3, 3, 2},\\n\\t\\t{\\\"accueillir\\\", 2, 7, 4, true, \\\"accueill\\\", 2, 7, 4},\\n\\t\\t{\\\"rétablit\\\", 3, 5, 2, true, \\\"rétabl\\\", 3, 5, 2},\\n\\t\\t{\\\"ravis\\\", 3, 5, 2, true, \\\"rav\\\", 3, 3, 2},\\n\\t\\t{\\\"xviIi\\\", 4, 5, 3, true, \\\"xviI\\\", 4, 4, 3},\\n\\t\\t{\\\"blottie\\\", 4, 7, 3, true, \\\"blott\\\", 4, 5, 3},\\n\\t\\t{\\\"approfondie\\\", 2, 6, 5, true, \\\"approfond\\\", 2, 6, 5},\\n\\t\\t{\\\"infirmerie\\\", 2, 5, 4, true, \\\"infirmer\\\", 2, 5, 4},\\n\\t\\t{\\\"scotti\\\", 4, 6, 3, true, \\\"scott\\\", 4, 5, 3},\\n\\t\\t{\\\"adoucissait\\\", 2, 5, 3, true, \\\"adouc\\\", 2, 5, 3},\\n\\t\\t{\\\"finissait\\\", 3, 5, 2, true, \\\"fin\\\", 3, 3, 2},\\n\\t\\t{\\\"promit\\\", 4, 6, 3, true, \\\"prom\\\", 4, 4, 3},\\n\\t\\t{\\\"franchies\\\", 4, 9, 3, true, \\\"franch\\\", 4, 6, 3},\\n\\t\\t{\\\"franchissant\\\", 4, 8, 3, true, \\\"franch\\\", 4, 6, 3},\\n\\t\\t{\\\"micheli\\\", 3, 6, 2, true, \\\"michel\\\", 3, 6, 2},\\n\\t\\t{\\\"éteignit\\\", 2, 5, 3, true, \\\"éteign\\\", 2, 5, 3},\\n\\t\\t{\\\"puni\\\", 3, 4, 2, true, \\\"pun\\\", 3, 3, 2},\\n\\t\\t{\\\"apoplexie\\\", 2, 4, 3, true, \\\"apoplex\\\", 2, 4, 3},\\n\\t\\t{\\\"désira\\\", 3, 5, 2, true, \\\"dés\\\", 3, 3, 2},\\n\\t\\t{\\\"étourdi\\\", 2, 5, 3, true, \\\"étourd\\\", 2, 5, 3},\\n\\t\\t{\\\"giovanni\\\", 4, 6, 2, true, \\\"giovann\\\", 4, 6, 2},\\n\\t\\t{\\\"apprécie\\\", 2, 6, 5, true, \\\"appréc\\\", 2, 6, 5},\\n\\t\\t{\\\"poésies\\\", 4, 7, 2, true, \\\"poés\\\", 4, 4, 2},\\n\\t\\t{\\\"pairie\\\", 4, 6, 2, true, \\\"pair\\\", 4, 4, 2},\\n\\t\\t{\\\"sortit\\\", 3, 6, 2, true, \\\"sort\\\", 3, 4, 2},\\n\\t\\t{\\\"subi\\\", 3, 4, 2, true, \\\"sub\\\", 3, 3, 2},\\n\\t\\t{\\\"aigrirait\\\", 3, 6, 3, true, \\\"aigr\\\", 3, 4, 3},\\n\\t\\t{\\\"assailli\\\", 2, 6, 4, true, \\\"assaill\\\", 2, 6, 4},\\n\\t\\t{\\\"bertolotti\\\", 3, 6, 2, true, \\\"bertolott\\\", 3, 6, 2},\\n\\t\\t{\\\"recouvrir\\\", 3, 6, 2, true, \\\"recouvr\\\", 3, 6, 2},\\n\\t\\t{\\\"visconti\\\", 3, 6, 2, true, \\\"viscont\\\", 3, 6, 2},\\n\\t\\t{\\\"surgir\\\", 3, 6, 2, true, \\\"surg\\\", 3, 4, 2},\\n\\t\\t{\\\"remercie\\\", 3, 5, 2, true, \\\"remerc\\\", 3, 5, 2},\\n\\t\\t{\\\"joUissaIent\\\", 3, 5, 2, true, \\\"joU\\\", 3, 3, 2},\\n\\t\\t{\\\"bondissant\\\", 3, 6, 2, true, \\\"bond\\\", 3, 4, 2},\\n\\t\\t{\\\"saisi\\\", 4, 5, 2, true, \\\"sais\\\", 4, 4, 2},\\n\\t\\t{\\\"missouri\\\", 3, 7, 2, true, \\\"missour\\\", 3, 7, 2},\\n\\t\\t{\\\"remplirent\\\", 3, 7, 2, true, \\\"rempl\\\", 3, 5, 2},\\n\\t\\t{\\\"envahi\\\", 2, 5, 4, true, \\\"envah\\\", 2, 5, 4},\\n\\t\\t{\\\"tandis\\\", 3, 6, 2, true, \\\"tand\\\", 3, 4, 2},\\n\\t\\t{\\\"trahit\\\", 4, 6, 3, true, \\\"trah\\\", 4, 4, 3},\\n\\t\\t{\\\"trahissaIent\\\", 4, 6, 3, true, \\\"trah\\\", 4, 4, 3},\\n\\t\\t{\\\"réunie\\\", 4, 6, 2, true, \\\"réun\\\", 4, 4, 2},\\n\\t\\t{\\\"avarie\\\", 2, 4, 3, true, \\\"avar\\\", 2, 4, 3},\\n\\t\\t{\\\"dilettanti\\\", 3, 5, 2, true, \\\"dilettant\\\", 3, 5, 2},\\n\\t\\t{\\\"raidie\\\", 4, 6, 2, true, \\\"raid\\\", 4, 4, 2},\\n\\t\\t{\\\"écuries\\\", 2, 4, 3, true, \\\"écur\\\", 2, 4, 3},\\n\\t\\t{\\\"recouvrît\\\", 3, 6, 2, true, \\\"recouvr\\\", 3, 6, 2},\\n\\t\\t{\\\"parsis\\\", 3, 6, 3, true, \\\"pars\\\", 3, 4, 3},\\n\\t\\t{\\\"monti\\\", 3, 5, 2, true, \\\"mont\\\", 3, 4, 2},\\n\\t\\t{\\\"reproduisit\\\", 3, 6, 2, true, \\\"reproduis\\\", 3, 6, 2},\\n\\t\\t{\\\"étendit\\\", 2, 4, 3, true, \\\"étend\\\", 2, 4, 3},\\n\\t\\t{\\\"suffi\\\", 3, 5, 2, true, \\\"suff\\\", 3, 4, 2},\\n\\t\\t{\\\"pillaji\\\", 3, 6, 2, true, \\\"pillaj\\\", 3, 6, 2},\\n\\t\\t{\\\"rougir\\\", 4, 6, 2, true, \\\"roug\\\", 4, 4, 2},\\n\\t\\t{\\\"désirez\\\", 3, 5, 2, true, \\\"dés\\\", 3, 3, 2},\\n\\t\\t{\\\"subit\\\", 3, 5, 2, true, \\\"sub\\\", 3, 3, 2},\\n\\t\\t{\\\"fondirent\\\", 3, 6, 2, true, \\\"fond\\\", 3, 4, 2},\\n\\t\\t{\\\"coqUineries\\\", 3, 6, 2, true, \\\"coqUiner\\\", 3, 6, 2},\\n\\t\\t{\\\"venir\\\", 3, 5, 2, true, \\\"ven\\\", 3, 3, 2},\\n\\t\\t{\\\"plaidoirie\\\", 5, 8, 3, true, \\\"plaidoir\\\", 5, 8, 3},\\n\\t\\t{\\\"fournissant\\\", 4, 7, 2, true, \\\"fourn\\\", 4, 5, 2},\\n\\t\\t{\\\"bonzeries\\\", 3, 6, 2, true, \\\"bonzer\\\", 3, 6, 2},\\n\\t\\t{\\\"flétri\\\", 4, 6, 3, true, \\\"flétr\\\", 4, 5, 3},\\n\\t\\t{\\\"faillit\\\", 4, 7, 2, true, \\\"faill\\\", 4, 5, 2},\\n\\t\\t{\\\"hardie\\\", 3, 6, 2, true, \\\"hard\\\", 3, 4, 2},\\n\\t\\t{\\\"compagnie\\\", 3, 6, 2, true, \\\"compagn\\\", 3, 6, 2},\\n\\t\\t{\\\"vernis\\\", 3, 6, 2, true, \\\"vern\\\", 3, 4, 2},\\n\\t\\t{\\\"attendit\\\", 2, 5, 4, true, \\\"attend\\\", 2, 5, 4},\\n\\t\\t{\\\"blanchies\\\", 4, 9, 3, true, \\\"blanch\\\", 4, 6, 3},\\n\\t\\t{\\\"choisie\\\", 5, 7, 3, true, \\\"chois\\\", 5, 5, 3},\\n\\t\\t{\\\"rafraîchir\\\", 3, 7, 2, true, \\\"rafraîch\\\", 3, 7, 2},\\n\\t\\t{\\\"choisir\\\", 5, 7, 3, true, \\\"chois\\\", 5, 5, 3},\\n\\t\\t{\\\"nourrisse\\\", 4, 7, 2, true, \\\"nourr\\\", 4, 5, 2},\\n\\t\\t{\\\"chancellerie\\\", 4, 7, 3, true, \\\"chanceller\\\", 4, 7, 3},\\n\\t\\t{\\\"repartie\\\", 3, 5, 2, true, \\\"repart\\\", 3, 5, 2},\\n\\t\\t{\\\"redira\\\", 3, 5, 2, true, \\\"red\\\", 3, 3, 2},\\n\\t\\t{\\\"sentira\\\", 3, 6, 2, true, \\\"sent\\\", 3, 4, 2},\\n\\t\\t{\\\"surgirait\\\", 3, 6, 2, true, \\\"surg\\\", 3, 4, 2},\\n\\t\\t{\\\"cani\\\", 3, 4, 2, true, \\\"can\\\", 3, 3, 2},\\n\\t\\t{\\\"gratis\\\", 4, 6, 3, true, \\\"grat\\\", 4, 4, 3},\\n\\t\\t{\\\"médît\\\", 3, 5, 2, true, \\\"méd\\\", 3, 3, 2},\\n\\t\\t{\\\"avertis\\\", 2, 4, 3, true, \\\"avert\\\", 2, 4, 3},\\n\\t\\t{\\\"chirurgie\\\", 4, 6, 3, true, \\\"chirurg\\\", 4, 6, 3},\\n\\t\\t{\\\"ironie\\\", 2, 4, 3, true, \\\"iron\\\", 2, 4, 3},\\n\\t\\t{\\\"punîtes\\\", 3, 5, 2, true, \\\"pun\\\", 3, 3, 2},\\n\\t\\t{\\\"compromis\\\", 3, 7, 2, true, \\\"comprom\\\", 3, 7, 2},\\n\\t\\t{\\\"simonie\\\", 3, 5, 2, true, \\\"simon\\\", 3, 5, 2},\\n\\t}\\n\\tromance.RunStepTest(t, step2a, testCases)\\n}\",\n \"func parseSteps(filename string) (int, map[string][]string) {\\n\\tdeps := make(map[string][]string)\\n\\trawLogs, _ := ioutil.ReadFile(filename)\\n\\tarr := strings.Split(string(rawLogs), \\\"\\\\n\\\")\\n\\tfor _, raw := range arr {\\n\\t\\tif len(raw) > 0 {\\n\\t\\t\\tstep := string(raw[36])\\n\\t\\t\\tdep := string(raw[5])\\n\\t\\t\\tdeps[step] = append(deps[step], dep)\\n\\t\\t}\\n\\t}\\n\\treturn len(arr) - 1, deps\\n}\",\n \"func path(start Point) int {\\n\\tret := 0\\n\\tupret := 0\\n\\trightret := 0\\n\\tdownret := 0\\n\\tuppoint := start\\n\\tuppoint.Y = uppoint.Y + 1\\n\\tok := isPointOK(&uppoint)\\n\\tif ok {\\n\\t\\tfmt.Printf(\\\"%+v\\\\n\\\", uppoint)\\n\\t\\tsumpoint <- uppoint\\n\\t\\tpathrecordpoint <- uppoint\\n\\t\\tupret = path(uppoint)\\n\\n\\t\\tret = ret + 1\\n\\t}\\n\\trightpoint := start\\n\\trightpoint.X = rightpoint.X + 1\\n\\tok = isPointOK(&rightpoint)\\n\\tif ok {\\n\\t\\tfmt.Printf(\\\"%+v\\\\n\\\", rightpoint)\\n\\t\\tsumpoint <- rightpoint\\n\\t\\tpathrecordpoint <- rightpoint\\n\\t\\trightret = path(rightpoint)\\n\\t\\tret = ret + 1\\n\\n\\t}\\n\\n\\treturn ret + upret + downret + rightret\\n}\",\n \"func main() {\\n\\n\\tvar t int\\n\\tfmt.Scanln(&t)\\n\\n\\tfor ; t > 0; t-- {\\n\\n\\t\\tvar n, m, D, H int\\n\\t\\tfmt.Scanln(&n, &m, &D)\\n\\n\\t\\tpassed := 0\\n\\t\\theroi := 0\\n\\n\\t\\tfor ; heroi < n && passed < m; heroi++ {\\n\\t\\t\\tfmt.Scanln(&H)\\n\\t\\t\\tpassed += (H - 1) / D\\n\\t\\t}\\n\\n\\t\\tfor ; heroi < n; heroi++ {\\n\\t\\t\\tvar dummy string\\n\\t\\t\\tfmt.Scanln(&dummy)\\n\\t\\t}\\n\\n\\t\\tif passed >= m {\\n\\t\\t\\tfmt.Println(\\\"YES\\\")\\n\\t\\t} else {\\n\\t\\t\\tfmt.Println(\\\"NO\\\")\\n\\t\\t}\\n\\t}\\n}\",\n \"func path(n, m int) int {\\n\\tif n == 1 || m == 1 {\\n\\t\\treturn 1\\n\\t}\\n\\treturn path(n-1, m) + path(n, m-1)\\n}\",\n \"func stepPerms(n int32) int32 {\\n\\tif n < 3 {\\n\\t\\treturn n\\n\\t}\\n\\n\\ta, b, c, current := 1, 2, 4, 0\\n\\n\\tfor i := int32(3); i < n; i++ {\\n\\t\\tcurrent = a + b + c\\n\\t\\ta, b = b, c\\n\\t\\tc = current\\n\\t}\\n\\n\\treturn int32(c)\\n}\",\n \"func testTrucks() map[string]string {\\n\\treturn map[string]string{\\n\\t\\t`truck 1\\n0 0 4 4 2\\nendtruck\\n`: `\\n| ! ! ! ! |\\n| ! ! ! ! |\\n| ! ! ! ! |\\n| ! ! ! ! |\\n`,\\n\\t\\t`truck 3\\n0 0 4 3 4\\n0 0 4 1 5\\nendtruck\\n`: `\\n| ! ! ! @ |\\n| ! ! ! @ |\\n| ! ! ! @ |\\n| ! ! ! @ |\\n`,\\n\\t\\t`truck 6\\n0 0 4 2 7\\n0 0 4 2 8\\nendtruck\\n`: `\\n| ! ! @ @ |\\n| ! ! @ @ |\\n| ! ! @ @ |\\n| ! ! @ @ |\\n`,\\n\\t\\t`truck 9 \\n0 0 4 2 10 \\n0 0 4 1 11 \\nendtruck\\n`: `\\n| ! ! @ |\\n| ! ! @ |\\n| ! ! @ |\\n| ! ! @ |\\n`,\\n\\t\\t`truck 12 \\n0 0 4 2 13 \\n0 0 3 2 14 \\n0 0 1 1 15 \\n0 0 1 1 16 \\nendtruck\\n`: `\\n| ! ! @ @ |\\n| ! ! @ @ |\\n| ! ! @ @ |\\n| ! ! # $ |\\n`,\\n\\t\\t`truck 17 \\n0 0 4 2 18 \\n0 0 2 1 19 \\n0 0 2 1 20 \\n0 0 2 1 21 \\n0 0 1 1 22 \\n0 0 1 1 23 \\nendtruck\\n`: `\\n| ! ! @ # |\\n| ! ! @ # |\\n| ! ! $ % |\\n| ! ! $ ^ |\\n`,\\n\\t\\t`truck 24\\n0 0 4 1 25\\n0 0 3 1 26\\n0 0 1 1 27\\n0 0 3 2 28\\n0 0 2 1 29\\nendtruck\\n`: `\\n| ! @ $ $ |\\n| ! @ $ $ |\\n| ! @ $ $ |\\n| ! # % % |\\n`,\\n\\t\\t`truck 30\\n0 0 3 3 31\\n0 0 3 1 32\\n0 0 1 2 33\\n0 0 2 1 34\\nendtruck\\n`: `\\n| ! ! ! # |\\n| ! ! ! # |\\n| ! ! ! $ |\\n| @ @ @ $ |\\n`,\\n\\t\\t`truck 35\\n0 0 3 3 36\\n0 0 2 1 37\\n0 0 1 1 38\\n0 0 2 1 39\\n0 0 1 1 40\\n0 0 1 1 41\\nendtruck\\n`: `\\n| ! ! ! $ |\\n| ! ! ! $ |\\n| ! ! ! % |\\n| @ @ # ^ |\\n`,\\n\\t\\t`truck 42\\n0 0 3 3 43\\n0 0 1 1 44\\n0 0 1 1 45\\n0 0 1 1 46\\n0 0 1 1 47\\nendtruck\\n`: `\\n| ! ! ! % |\\n| ! ! ! |\\n| ! ! ! |\\n| @ # $ |\\n`,\\n\\t\\t`truck 48\\n0 0 3 2 49\\n0 0 2 1 50\\n0 0 3 1 51\\n0 0 1 1 52\\nendtruck\\n`: `\\n| ! ! # |\\n| ! ! # |\\n| ! ! # |\\n| @ @ $ |\\n`,\\n\\t\\t`truck 53\\n0 0 2 3 54\\n0 0 1 1 55\\n0 0 1 1 56\\n0 0 2 2 57\\nendtruck\\n`: `\\n| ! ! $ $ |\\n| ! ! $ $ |\\n| ! ! |\\n| @ # |\\n`,\\n\\t\\t`truck 58\\n0 0 3 1 59\\n0 0 1 1 60\\nendtruck\\n`: `\\n| ! |\\n| ! |\\n| ! |\\n| @ |\\n`,\\n\\t\\t`truck 61 \\n0 0 1 1 62 \\n0 0 1 1 63 \\n0 0 1 1 64 \\n0 0 1 1 65 \\nendtruck\\n`: `\\n| ! @ |\\n| $ # |\\n| |\\n| |\\n`,\\n\\t\\t`truck 66\\nendtruck\\n`: `\\n| |\\n| |\\n| |\\n| |\\n`,\\n\\t}\\n}\",\n \"func getWays(n int, c []int) int {\\n\\t// Write your code here\\n\\t// Create table of size len(c)+1 and n+1\\n\\ttable := make([][]int, len(c)+1)\\n\\tfor row := 0; row <= len(c); row++ {\\n\\t\\trow_ := []int{}\\n\\n\\t\\tfor col := 0; col <= n; col++ {\\n\\t\\t\\trow_ = append(row_, 0)\\n\\t\\t}\\n\\t\\ttable[row] = row_\\n\\t\\ttable[row][0] = 1\\n\\t}\\n\\n\\tfor r := 1; r <= len(c); r++ {\\n\\t\\tfor co := 1; co <= n; co++ {\\n\\t\\t\\ttop := table[r-1][co]\\n\\t\\t\\tif co-c[r-1] < 0 {\\n\\t\\t\\t\\ttable[r][co] = top + 0\\n\\t\\t\\t} else {\\n\\t\\t\\t\\ttable[r][co] = top + table[r][co-c[r-1]]\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfmt.Println(table)\\n\\n\\treturn table[len(c)][n]\\n}\",\n \"func mo(s string) string {\\n\\tif \\\"\\\" == s {\\n\\t\\treturn \\\"\\\"\\n\\t}\\n\\n\\tfmt.Println(\\\"s:\\\", s)\\n\\tb := []byte(s)\\n\\tl := len(b)\\n\\tm := l / 2\\n\\teven := false\\n\\tif 0 == l%2 {\\n\\t\\tfmt.Println(\\\"even\\\")\\n\\t\\teven = true\\n\\t}\\n\\n\\tvar win result\\n\\n\\tdmax := m + 1\\n\\tfor d := 0; d < dmax; d++ {\\n\\n\\t\\tvar lodd result\\n\\t\\tvar rodd result\\n\\t\\tvar leven result\\n\\t\\tvar reven result\\n\\n\\t\\tif even {\\n\\t\\t\\tfmt.Println(\\\"possible remaining\\\", (m-d)*2, l)\\n\\t\\t\\tif (m-d)*2 <= win.l {\\n\\t\\t\\t\\treturn string(win.b)\\n\\t\\t\\t}\\n\\t\\t\\tlm := m - d\\n\\n\\t\\t\\tfmt.Println(\\\"left even\\\")\\n\\t\\t\\tleven = findEven(b, lm, l)\\n\\t\\t\\tfmt.Println(\\\" \\\", leven.l, string(leven.b))\\n\\t\\t\\tif leven.l == l {\\n\\t\\t\\t\\tfmt.Println(\\\" 🎂\\\")\\n\\t\\t\\t\\treturn s\\n\\t\\t\\t}\\n\\n\\t\\t\\trm := m + d + 1\\n\\n\\t\\t\\tfmt.Println(\\\"right even\\\")\\n\\t\\t\\treven = findEven(b, rm-1, l)\\n\\t\\t\\tfmt.Println(\\\" \\\", reven.l, string(reven.b))\\n\\t\\t\\tif reven.l == l {\\n\\t\\t\\t\\tfmt.Println(\\\" 🎂\\\")\\n\\t\\t\\t\\treturn s\\n\\t\\t\\t}\\n\\n\\t\\t\\tfmt.Println(\\\"left odd\\\")\\n\\t\\t\\tlodd = findOdd(b, lm, l)\\n\\t\\t\\tfmt.Println(\\\" \\\", lodd.l, string(lodd.b))\\n\\n\\t\\t\\tfmt.Println(\\\"right odd\\\")\\n\\t\\t\\trodd = findOdd(b, rm-1, l)\\n\\t\\t\\tfmt.Println(\\\" \\\", rodd.l, string(rodd.b))\\n\\n\\t\\t} else {\\n\\t\\t\\tfmt.Println(\\\"possible remaining\\\", (dmax-d)*2, l)\\n\\t\\t\\tif (dmax-d)*2 <= win.l {\\n\\t\\t\\t\\treturn string(win.b)\\n\\t\\t\\t}\\n\\n\\t\\t\\tlm := m - d\\n\\n\\t\\t\\tfmt.Println(\\\"left odd\\\")\\n\\t\\t\\tlodd = findOdd(b, lm, l)\\n\\t\\t\\tfmt.Println(\\\" \\\", lodd.l, string(lodd.b))\\n\\t\\t\\tif lodd.l == l {\\n\\t\\t\\t\\tfmt.Println(\\\" 🎂\\\")\\n\\t\\t\\t\\treturn s\\n\\t\\t\\t}\\n\\n\\t\\t\\trm := m + d + 1\\n\\n\\t\\t\\tfmt.Println(\\\"right odd\\\")\\n\\t\\t\\trodd = findOdd(b, rm, l)\\n\\t\\t\\tfmt.Println(\\\" \\\", rodd.l, string(rodd.b))\\n\\t\\t\\tif rodd.l == l {\\n\\t\\t\\t\\tfmt.Println(\\\" 🎂\\\")\\n\\t\\t\\t\\treturn s\\n\\t\\t\\t}\\n\\n\\t\\t\\tfmt.Println(\\\"left even\\\")\\n\\t\\t\\tleven = findEven(b, lm, l)\\n\\t\\t\\tfmt.Println(\\\" \\\", leven.l, string(leven.b))\\n\\n\\t\\t\\tfmt.Println(\\\"right even\\\")\\n\\t\\t\\treven = findEven(b, rm-1, l)\\n\\t\\t\\tfmt.Println(\\\" \\\", reven.l, string(reven.b))\\n\\t\\t}\\n\\n\\t\\t// figure max remaining size from here\\n\\n\\t\\tif lodd.l > win.l {\\n\\t\\t\\twin = lodd\\n\\t\\t}\\n\\n\\t\\tif rodd.l > win.l {\\n\\t\\t\\twin = rodd\\n\\t\\t}\\n\\n\\t\\tif leven.l > win.l {\\n\\t\\t\\twin = leven\\n\\t\\t}\\n\\n\\t\\tif reven.l > win.l {\\n\\t\\t\\twin = reven\\n\\t\\t}\\n\\t}\\n\\n\\treturn string(win.b)\\n}\",\n \"func Day8Part1(input []string) (string, error) {\\n\\n\\timData := input[0]\\n\\timWidth, imHeight := 25, 6\\n\\n\\tlayers := generateLayers(imData, imWidth, imHeight)\\n\\n\\tvar layerWithFewestZeros [][]int\\n\\tfewestZeros := imWidth * imHeight\\n\\tfor _, layer := range layers {\\n\\n\\t\\tzeros := 0\\n\\t\\tfor y := 0; y < len(layer); y++ {\\n\\t\\t\\tfor x := 0; x < len(layer[y]); x++ {\\n\\t\\t\\t\\tif layer[y][x] == 0 {\\n\\t\\t\\t\\t\\tzeros++\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif zeros < fewestZeros {\\n\\t\\t\\tfewestZeros = zeros\\n\\t\\t\\tlayerWithFewestZeros = layer\\n\\t\\t}\\n\\t}\\n\\n\\tones, twos := 0, 0\\n\\tfor y := 0; y < len(layerWithFewestZeros); y++ {\\n\\t\\tfor x := 0; x < len(layerWithFewestZeros[y]); x++ {\\n\\t\\t\\tswitch layerWithFewestZeros[y][x] {\\n\\t\\t\\tcase 1:\\n\\t\\t\\t\\tones++\\n\\t\\t\\tcase 2:\\n\\t\\t\\t\\ttwos++\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn fmt.Sprintf(\\\"%d\\\", ones*twos), nil\\n}\",\n \"func JumpIterationsHd(out1 *uint64) {\\n\\t*out1 = 0x5\\n}\",\n \"func MinimumStepsPath(path []Point) int {\\n\\tif len(path) < 2 {\\n\\t\\treturn 0\\n\\t}\\n\\tsteps := 0\\n\\tcurrent := path[0]\\n\\tfor i := 1; i < len(path); i++ {\\n\\t\\tnext := path[i]\\n\\t\\tdx, dy := delta(current, next)\\n\\t\\tif dx < dy {\\n\\t\\t\\tsteps += dy\\n\\t\\t} else {\\n\\t\\t\\tsteps += dx\\n\\t\\t}\\n\\t\\tcurrent = next\\n\\t}\\n\\treturn steps\\n}\",\n \"func main() {\\n\\trand.Seed(time.Now().UnixNano())\\n\\tgconfig := Kiai.Connect(\\\"localhost:4000\\\", \\\"Easyfucka\\\", 1, 0) //Creates a variable with a GameConfig type. The output unit of connect function is Gameconfig which consists of multiple int data. Width,Height,MaxMoves,MaxFires,MaxHealth,PlayerCount,Timeout\\n\\tdefer Kiai.Disconnect() //Makes sure that at the end of the main function bot disconnects from server.\\n\\t\\n\\t\\n\\tfor {\\n\\t\\tturn = Kiai.WaitForTurn() //Assigns the starting values of the wait for turn to turn variable.\\n\\t\\t\\n\\t\\tif start == false {\\n\\t\\t\\tfirstdecision(gconfig)\\n\\t\\t}\\n\\t\\t\\n\\t\\tif iterate == maxiteration {\\n\\t\\t\\titerate = 0\\n\\t\\t\\tif path < 4 {\\n\\t\\t\\t\\tpath += 1 \\n\\t\\t\\t} else {\\n\\t\\t\\t\\tpath = 1\\t\\n\\t\\t\\t}\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\tif path == 1 { //This part is one of the four movement tactics that belong to a path. For all the moves left it directs the bot towards the corner and if corner is reached, it starts main offense.\\n\\t\\t\\t\\n\\t\\t\\tfor i := 0; i < turn.MovesLeft; i++ {\\n\\t\\t\\t\\tfiring()\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif turn.X == 0 && turn.Y == 0 {\\n\\t\\t\\t\\t\\tmaintactic()\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t} else if turn.X != 0 && turn.Y != 0 {\\n\\t\\t\\t\\t\\tturn.Move(Kiai.NorthWest)\\n\\t\\t\\t\\t} else if turn.X == 0 && turn.Y != 0 {\\n\\t\\t\\t\\t\\tturn.Move(Kiai.North)\\n\\t\\t\\t\\t} else if turn.X != 0 && turn.Y == 0 {\\n\\t\\t\\t\\t\\tturn.Move(Kiai.West)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tif path == 2 {\\n\\t\\t\\t\\n\\t\\t\\tfor i := 0; i < turn.MovesLeft; i++ {\\n\\t\\t\\t\\tfiring()\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif turn.X == gconfig.Width-1 && turn.Y == 0 {\\n\\t\\t\\t\\t\\tmaintactic()\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t} else if turn.X != gconfig.Width-1 && turn.Y != 0 {\\n\\t\\t\\t\\t\\tturn.Move(Kiai.NorthEast)\\n\\t\\t\\t\\t} else if turn.X == gconfig.Width-1 && turn.Y != 0 {\\n\\t\\t\\t\\t\\tturn.Move(Kiai.North)\\n\\t\\t\\t\\t} else if turn.X != gconfig.Width-1 && turn.Y == 0 {\\n\\t\\t\\t\\t\\tturn.Move(Kiai.East)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tif path == 3 {\\n\\t\\t\\t\\n\\t\\t\\tfor i := 0; i < turn.MovesLeft; i++ {\\n\\t\\t\\t\\tfiring()\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif turn.X == gconfig.Width-1 && turn.Y == gconfig.Height-1 {\\n\\t\\t\\t\\t\\tmaintactic()\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t} else if turn.X != gconfig.Width-1 && turn.Y != gconfig.Height-1 {\\n\\t\\t\\t\\t\\tturn.Move(Kiai.SouthEast)\\n\\t\\t\\t\\t} else if turn.X == gconfig.Width-1 && turn.Y != gconfig.Height-1 {\\n\\t\\t\\t\\t\\tturn.Move(Kiai.South)\\n\\t\\t\\t\\t} else if turn.X != gconfig.Width-1 && turn.Y == gconfig.Height-1 {\\n\\t\\t\\t\\t\\tturn.Move(Kiai.East)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tif path == 4 {\\n\\t\\t\\t\\n\\t\\t\\tfor i := 0; i < turn.MovesLeft; i++ {\\n\\t\\t\\t\\tfiring()\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif turn.X == 0 && turn.Y == gconfig.Height-1 {\\n\\t\\t\\t\\t\\tmaintactic()\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t} else if turn.X != 0 && turn.Y != gconfig.Height-1 {\\n\\t\\t\\t\\t\\tturn.Move(Kiai.SouthWest)\\n\\t\\t\\t\\t} else if turn.X == 0 && turn.Y != gconfig.Height-1 {\\n\\t\\t\\t\\t\\tturn.Move(Kiai.South)\\n\\t\\t\\t\\t} else if turn.X != 0 && turn.Y == gconfig.Height-1 {\\n\\t\\t\\t\\t\\tturn.Move(Kiai.West)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\n//This section just shoots randomly towards the middle of the board at the last move if someone is not seen around.\\n\\t\\n\\t\\tif path == 1 {\\n\\t\\t\\tif turn.Y == 0 {\\n\\t\\t\\t\\tturn.Fire(Kiai.SouthEast)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tturn.Fire(Kiai.East)\\n\\t\\t\\t}\\t \\n\\t\\t} \\n\\t\\t\\n\\t\\tif path == 2 {\\n\\t\\t\\tif turn.X == gconfig.Width - 1 {\\n\\t\\t\\t\\tturn.Fire(Kiai.SouthWest)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tturn.Fire(Kiai.South)\\n\\t\\t\\t}\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\tif path == 3 {\\n\\t\\t\\tif turn.Y == gconfig.Height - 1 {\\n\\t\\t\\t\\tturn.Fire(Kiai.NorthWest)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tturn.Fire(Kiai.West)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tif path == 4 {\\n\\t\\t\\tif turn.X == 0 {\\n\\t\\t\\t\\tturn.Fire(Kiai.NorthEast)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tturn.Fire(Kiai.North)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\titerate += 1\\n\\t\\tKiai.EndTurn()\\n\\t}\\n}\",\n \"func solutionLvl2(puzzle string, parameters map[string]int) (answer int) {\\n\\tfor _, line := range strings.Split(puzzle, \\\"\\\\n\\\") {\\n\\t\\tif line != \\\"\\\" {\\n\\t\\t\\tanswer += evaluateExpr2(line)\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\",\n \"func solveAlgo6(g Solver, l *Line) {\\n\\t//l.print(\\\"solveAlgo6\\\")\\n\\trsg := l.getUnsolvedRanges()\\n\\n\\tfor _, r := range rsg {\\n\\t\\tcs := l.getPotentialCluesForRange(r)\\n\\n\\t\\tlongest := 0\\n\\t\\tisFound, step := l.getStepToNextBlank(r, false)\\n\\t\\tif isFound {\\n\\t\\t\\tisFound = false\\n\\t\\t\\tfor _, c := range cs {\\n\\t\\t\\t\\tif c.index < l.ce {\\n\\t\\t\\t\\t\\tnext := l.clues[c.index+1]\\n\\t\\t\\t\\t\\tif step <= c.length-r.length() || step > next.length {\\n\\t\\t\\t\\t\\t\\tisFound = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tlongest = max(longest, c.length-r.length())\\n\\t\\t\\t}\\n\\t\\t\\t//if we didn't find anyone, we can blank taking into account the longest trail\\n\\t\\t\\tif len(cs) > 1 && !isFound {\\n\\t\\t\\t\\tfor i := longest + 1; i <= step; i++ {\\n\\t\\t\\t\\t\\tg.SetValue(l.squares[r.max+i], BLANK)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tlongest = 0\\n\\t\\tisFound, step = l.getStepToNextBlank(r, true)\\n\\t\\tif isFound {\\n\\t\\t\\tisFound = false\\n\\t\\t\\tfor _, c := range cs {\\n\\t\\t\\t\\tif c.index > l.cb {\\n\\t\\t\\t\\t\\tprevious := l.clues[c.index-1]\\n\\t\\t\\t\\t\\tif step <= c.length-r.length() || step > previous.length {\\n\\t\\t\\t\\t\\t\\tisFound = true\\n\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tlongest = max(longest, c.length-r.length())\\n\\t\\t\\t}\\n\\t\\t\\t//if we didn't find anyone, we can blank taking into account the longest trail\\n\\t\\t\\tif len(cs) > 1 && !isFound {\\n\\t\\t\\t\\tfor i := longest + 1; i <= step; i++ {\\n\\t\\t\\t\\t\\tg.SetValue(l.squares[r.min-i], BLANK)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func slidingPuzzle(board [][]int) int {\\n\\n}\",\n \"func TowerOfHanoiMoves(disks int) []string {\\n\\treturn towerOfHanoi(disks, 1, 3, 2)\\n}\",\n \"func gameOfLife(board [][]int) {\\n\\tm := len(board)\\n\\tn := len(board[0])\\n\\tr := make([][]int, m, m)\\n\\tfor i := 0; i < m; i++ {\\n\\t\\tr[i] = make([]int, n, n)\\n\\t\\tfor j := 0; j < n; j++ {\\n\\t\\t\\tr[i][j] = board[i][j]\\n\\t\\t}\\n\\t}\\n\\tfor i := 0; i < m; i++ {\\n\\t\\tfor j := 0; j < n; j++ {\\n\\t\\t\\tlives := 0\\n\\t\\t\\tif j > 0 {\\n\\t\\t\\t\\tlives = lives + r[i][j-1]\\n\\t\\t\\t}\\n\\t\\t\\tif j < n-1 {\\n\\t\\t\\t\\tlives = lives + r[i][j+1]\\n\\t\\t\\t}\\n\\t\\t\\tif i > 0 {\\n\\t\\t\\t\\tlives = lives + r[i-1][j]\\n\\t\\t\\t\\tif j > 0 {\\n\\t\\t\\t\\t\\tlives = lives + r[i-1][j-1]\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif j < n-1 {\\n\\t\\t\\t\\t\\tlives = lives + r[i-1][j+1]\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif i < m-1 {\\n\\t\\t\\t\\tlives = lives + r[i+1][j]\\n\\t\\t\\t\\tif j > 0 {\\n\\t\\t\\t\\t\\tlives = lives + r[i+1][j-1]\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif j < n-1 {\\n\\t\\t\\t\\t\\tlives = lives + r[i+1][j+1]\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tl := r[i][j]\\n\\t\\t\\tswitch {\\n\\t\\t\\tcase l == 0 && lives == 3:\\n\\t\\t\\t\\tboard[i][j] = 1\\n\\t\\t\\tcase l == 1 && (lives == 2 || lives == 3):\\n\\t\\t\\t\\tboard[i][j] = 1\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\tboard[i][j] = 0\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func firstStep(y int) {\\n\\tfmt.Println(\\\"1.1\\\", y)\\n\\ty = 52 // 1.4 assign y to 52\\n\\tfmt.Println(\\\"1.2\\\", y)\\n}\",\n \"func Step(a, b Universe) {\\n\\t//based on prev state of universe\\n for i, row := range a {\\n for j := range row {\\n\\t\\t\\tif a.Next(j, i) {\\n\\t\\t\\t\\tb[i][j] = true\\n\\t\\t\\t} else {\\n b[i][j] = false\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfmt.Println(\\\"\\\\x0c\\\")\\n\\t}\\n}\",\n \"func main15() {\\n\\tgph := new(Graph)\\n\\tgph.Init(5)\\n gph.AddDirectedEdge(0, 1, 3)\\n gph.AddDirectedEdge(0, 4, 2)\\n gph.AddDirectedEdge(1, 2, 1)\\n gph.AddDirectedEdge(2, 3, 1)\\n gph.AddDirectedEdge(4, 1, -2)\\n gph.AddDirectedEdge(4, 3, 1)\\n gph.BellmanFordShortestPath(0)\\n}\",\n \"func (n *TreeNode) Step() (s Step, pass bool) {\\n\\treturn n.step, n.pass\\n}\",\n \"func ways(n, goal, most int) [][]int {\\n\\tif goal < 0 || most*n < goal {\\n\\t\\treturn nil\\n\\t}\\n\\n\\tif n == 1 {\\n\\t\\treturn [][]int{{goal}}\\n\\t}\\n\\n\\taccumulate := make([][]int, 0)\\n\\n\\tfor i := 0; i <= most; i++ {\\n\\t\\tif below := ways(n-1, goal-i, i); below != nil {\\n\\t\\t\\taccumulate = append(accumulate, paint(i, below)...)\\n\\t\\t}\\n\\t}\\n\\n\\treturn accumulate\\n}\",\n \"func run(input string) (interface{}, interface{}) {\\n\\tvar displays []sevenSegmentDisplay\\n\\n\\tfor _, line := range strings.Split(input, \\\"\\\\n\\\") {\\n\\t\\tdigitsAndTarget := strings.Split(line, \\\" | \\\")\\n\\t\\tsegments := strings.Split(digitsAndTarget[0], \\\" \\\")\\n\\t\\tval := strings.Split(digitsAndTarget[1], \\\" \\\")\\n\\t\\t// sort them to enable the lookup table in the future\\n\\t\\tfor i, s := range segments {\\n\\t\\t\\tsegments[i] = helpers.SortString(s)\\n\\t\\t}\\n\\t\\tfor i, s := range val {\\n\\t\\t\\tval[i] = helpers.SortString(s)\\n\\t\\t}\\n\\t\\tdisplays = append(displays, sevenSegmentDisplay{\\n\\t\\t\\tsegments: segments,\\n\\t\\t\\tvalues: val,\\n\\t\\t})\\n\\t}\\n\\n\\ttotalA := 0\\n\\tfor _, segment := range displays {\\n\\t\\ttotalA += solveBasicSegments(segment)\\n\\t}\\n\\n\\ttotalB := 0\\n\\tfor _, segment := range displays {\\n\\t\\ttotalB += solveAllSegments(segment)\\n\\t}\\n\\n\\treturn totalA, totalB\\n}\",\n \"func minRefuelStops(target int, startFuel int, stations [][]int) int {\\n \\n}\",\n \"func (e *OptTester) OptSteps(verbose bool) (string, error) {\\n\\tvar buf bytes.Buffer\\n\\tvar prev, next string\\n\\tif verbose {\\n\\t\\tfmt.Print(\\\"------ optsteps verbose output starts ------\\\\n\\\")\\n\\t}\\n\\toutput := func(format string, args ...interface{}) {\\n\\t\\tfmt.Fprintf(&buf, format, args...)\\n\\t\\tif verbose {\\n\\t\\t\\tfmt.Printf(format, args...)\\n\\t\\t}\\n\\t}\\n\\tindent := func(str string) {\\n\\t\\tstr = strings.TrimRight(str, \\\" \\\\n\\\\t\\\\r\\\")\\n\\t\\tlines := strings.Split(str, \\\"\\\\n\\\")\\n\\t\\tfor _, line := range lines {\\n\\t\\t\\toutput(\\\" %s\\\\n\\\", line)\\n\\t\\t}\\n\\t}\\n\\tfor i := 0; ; i++ {\\n\\t\\to := xform.NewOptimizer(&e.evalCtx)\\n\\n\\t\\t// Override SetOnRuleMatch to stop optimizing after the ith rule matches.\\n\\t\\tsteps := i\\n\\t\\tlastRuleName := opt.InvalidRuleName\\n\\t\\to.SetOnRuleMatch(func(ruleName opt.RuleName) bool {\\n\\t\\t\\tif steps == 0 {\\n\\t\\t\\t\\treturn false\\n\\t\\t\\t}\\n\\t\\t\\tsteps--\\n\\t\\t\\tlastRuleName = ruleName\\n\\t\\t\\treturn true\\n\\t\\t})\\n\\n\\t\\troot, required, err := e.buildExpr(o.Factory())\\n\\t\\tif err != nil {\\n\\t\\t\\treturn \\\"\\\", err\\n\\t\\t}\\n\\n\\t\\tnext = o.Optimize(root, required).FormatString(e.Flags.Format)\\n\\t\\tif steps != 0 {\\n\\t\\t\\t// All steps were not used, so must be done.\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\n\\t\\tif i == 0 {\\n\\t\\t\\toutput(\\\"*** Initial expr:\\\\n\\\")\\n\\t\\t\\t// Output starting tree.\\n\\t\\t\\tindent(next)\\n\\t\\t} else {\\n\\t\\t\\toutput(\\\"\\\\n*** %s applied; \\\", lastRuleName.String())\\n\\n\\t\\t\\tif prev == next {\\n\\t\\t\\t\\t// The expression can be unchanged if a part of the memo changed that\\n\\t\\t\\t\\t// does not affect the final best expression.\\n\\t\\t\\t\\toutput(\\\"best expr unchanged.\\\\n\\\")\\n\\t\\t\\t} else {\\n\\t\\t\\t\\toutput(\\\"best expr changed:\\\\n\\\")\\n\\t\\t\\t\\tdiff := difflib.UnifiedDiff{\\n\\t\\t\\t\\t\\tA: difflib.SplitLines(prev),\\n\\t\\t\\t\\t\\tB: difflib.SplitLines(next),\\n\\t\\t\\t\\t\\tContext: 100,\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\ttext, _ := difflib.GetUnifiedDiffString(diff)\\n\\t\\t\\t\\t// Skip the \\\"@@ ... @@\\\" header (first line).\\n\\t\\t\\t\\ttext = strings.SplitN(text, \\\"\\\\n\\\", 2)[1]\\n\\t\\t\\t\\tindent(text)\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tprev = next\\n\\t}\\n\\n\\t// Output ending tree.\\n\\toutput(\\\"\\\\n*** Final best expr:\\\\n\\\")\\n\\tindent(next)\\n\\n\\tif verbose {\\n\\t\\tfmt.Print(\\\"------ optsteps verbose output ends ------\\\\n\\\")\\n\\t}\\n\\n\\treturn buf.String(), nil\\n}\",\n \"func MoveKnights(knights uint64) uint64 {\\n\\tnewKnights := knights\\n\\tmoves := [4]uint64{15, 17, 6, 10}\\n\\tfor i := 0; i < 4; i++ {\\n\\t\\tnewKnights = newKnights | (knights << moves[i]) | knights>>moves[i]\\n\\t}\\n\\treturn newKnights\\n}\",\n \"func uniquePathsWithObstacles(obstacleGrid [][]int) int {\\n\\trow, col := len(obstacleGrid), len(obstacleGrid[0])\\n\\t// if the starting point has obstacle, then we can't walk to anywhere\\n\\tif obstacleGrid[0][0] == 1 {\\n\\t\\treturn 0\\n\\t}\\n\\n\\t// if the starting point has no obstacle, then the number of path walking to starting point is 1\\n\\tobstacleGrid[0][0] = 1\\n\\n\\t// for first column, if the cell has no obstacle , then set the number of path of that cell to 1, otherwise 0\\n\\tfor i := 1; i < row; i++ {\\n\\t\\tif obstacleGrid[i][0] == 0 && obstacleGrid[i-1][0] == 1 {\\n\\t\\t\\tobstacleGrid[i][0] = 1\\n\\t\\t} else {\\n\\t\\t\\tobstacleGrid[i][0] = 0\\n\\t\\t}\\n\\t}\\n\\n\\t// for the first row, if the cell has no obstacle, then set the number of path of that cell to 1, otherwise 0\\n\\tfor i := 1; i < col; i++ {\\n\\t\\tif obstacleGrid[0][i] == 0 && obstacleGrid[0][i-1] == 1 {\\n\\t\\t\\tobstacleGrid[0][i] = 1\\n\\t\\t} else {\\n\\t\\t\\tobstacleGrid[0][i] = 0\\n\\t\\t}\\n\\t}\\n\\n\\t// every cell can only be reached from up or left, if the cell has obstacle, we set the number of path walking to that cell to 0, otherwise\\n\\t// set it to the sum of up and left cell\\n\\tfor i := 1; i < row; i++ {\\n\\t\\tfor j := 1; j < col; j++ {\\n\\t\\t\\tif obstacleGrid[i][j] == 0 {\\n\\t\\t\\t\\tobstacleGrid[i][j] = obstacleGrid[i-1][j] + obstacleGrid[i][j-1]\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tobstacleGrid[i][j] = 0\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn obstacleGrid[row-1][col-1]\\n}\",\n \"func main() {\\n\\tfmt.Println(numTreesDp(19))\\n}\",\n \"func main() {\\n\\tscanner := bufio.NewScanner(os.Stdin)\\n\\tscanner.Buffer(make([]byte, 1000000), 1000000)\\n\\n\\t// W: number of columns.\\n\\t// H: number of rows.\\n\\tvar W, H int\\n\\tscanner.Scan()\\n\\tfmt.Sscan(scanner.Text(),&W, &H)\\n\\n\\tfor i := 0; i < H; i++ {\\n\\t\\tscanner.Scan()\\n\\t\\tLINE := scanner.Text() // represents a line in the grid and contains W integers. Each integer represents one room of a given type.\\n\\t\\tre := regexp.MustCompile(\\\" \\\")\\n\\t\\tstr := \\\"[\\\" + re.ReplaceAllString(LINE, \\\",\\\") + \\\"]\\\"\\n\\t\\tvar ints []int\\n\\t\\tjson.Unmarshal([]byte(str), &ints)\\n\\n\\t}\\n\\t// EX: the coordinate along the X axis of the exit (not useful for this first mission, but must be read).\\n\\tvar EX int\\n\\tscanner.Scan()\\n\\tfmt.Sscan(scanner.Text(),&EX)\\n\\n\\tfor {\\n\\t\\tvar XI, YI int\\n\\t\\tvar POS string\\n\\t\\tscanner.Scan()\\n\\t\\tfmt.Sscan(scanner.Text(),&XI, &YI, &POS)\\n\\n\\n\\t\\t// fmt.Fprintln(os.Stderr, \\\"Debug messages...\\\")\\n\\n\\t\\t// One line containing the X Y coordinates of the room in which you believe Indy will be on the next turn.\\n\\t\\tfmt.Println(\\\"0 0\\\")\\n\\t}\\n}\",\n \"func kerDIF8(a []fr.Element, twiddles [][]fr.Element, stage int) {\\n\\n\\tfr.Butterfly(&a[0], &a[4])\\n\\tfr.Butterfly(&a[1], &a[5])\\n\\tfr.Butterfly(&a[2], &a[6])\\n\\tfr.Butterfly(&a[3], &a[7])\\n\\ta[5].Mul(&a[5], &twiddles[stage+0][1])\\n\\ta[6].Mul(&a[6], &twiddles[stage+0][2])\\n\\ta[7].Mul(&a[7], &twiddles[stage+0][3])\\n\\tfr.Butterfly(&a[0], &a[2])\\n\\tfr.Butterfly(&a[1], &a[3])\\n\\tfr.Butterfly(&a[4], &a[6])\\n\\tfr.Butterfly(&a[5], &a[7])\\n\\ta[3].Mul(&a[3], &twiddles[stage+1][1])\\n\\ta[7].Mul(&a[7], &twiddles[stage+1][1])\\n\\tfr.Butterfly(&a[0], &a[1])\\n\\tfr.Butterfly(&a[2], &a[3])\\n\\tfr.Butterfly(&a[4], &a[5])\\n\\tfr.Butterfly(&a[6], &a[7])\\n}\",\n \"func parent_step(x uint) uint {\\n\\t// xy01 -> x011\\n\\tk := level(x)\\n\\tone := uint(1)\\n\\treturn (x | (one << k)) & ^(one << (k + 1))\\n}\",\n \"func path(b board) (p float64) {\\n\\tfor _, i := range lh {\\n\\t\\tfor _, j := range lh {\\n\\t\\t\\tvar lrl float64\\n\\t\\t\\tfor _, k := range rh {\\n\\t\\t\\t\\tlrl += t[b[i]][b[k]][b[j]]\\n\\t\\t\\t}\\n\\t\\t\\tp += pathpair[i][j] * (letterpair[b[i]][b[j]] + lrl)\\n\\t\\t}\\n\\t}\\n\\tfor _, i := range rh {\\n\\t\\tfor _, j := range rh {\\n\\t\\t\\tvar rlr float64\\n\\t\\t\\tfor _, k := range lh {\\n\\t\\t\\t\\trlr += t[b[i]][b[k]][b[j]]\\n\\t\\t\\t}\\n\\t\\t\\tp += pathpair[i][j] * (letterpair[b[i]][b[j]] + rlr)\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\",\n \"func day1B() {\\n\\t//Test comment\\n\\tvar nums = []int{+5, -11, +17, +9, -4, -2, +11, -10, -16, +18, +18, -2, -2, +17, +13, +14, -11, +19, -14, +8, +10, -3, -12, +13, -3, +18, -20, +8, +3, +8, +13, +9, +14, -11, -6, +16, -12, +14, -8, +3, -18, -11, +6, -2, -14, -2, +17, -2, +6, -1, -13, +20, +9, +14, -15, -16, +18, -4, -8, +5, +19, -1, +19, +11, -3, +16, -12, -6, +3, -7, -1, +4, -15, -5, +13, +9, +11, +2, +17, +12, -7, -16, +13, -11, -14, +22, +16, -8, +16, +8, -10, +8, -19, +17, -9, +8, -2, +18, +9, +1, +10, -14, +6, +2, +2, -15, -15, -6, +11, +16, -8, +14, -18, -12, +14, +7, -1, -13, -18, -13, +5, -3, -18, +7, -2, -2, +6, -12, +15, +1, +18, -8, +22, +6, -1, +9, +9, +17, +18, +9, +13, -8, -17, +16, +16, +12, -11, -6, -9, +13, +11, -8, -12, +8, -10, +17, -13, -17, +7, -10, -3, +4, +1, -11, +3, -6, +19, +4, +13, +1, +11, +6, -3, +16, +8, +1, +17, -10, +18, -3, -7, +20, +4, +1, -8, +1, -2, +12, -1, +8, +8, +18, -10, +6, -16, +1, -3, +10, -11, -1, -5, +15, -11, -10, +18, +4, +8, +14, +6, +16, +12, +2, -19, +18, -5, -16, -10, -7, -3, +13, +14, +16, +13, -12, +15, +8, +17, +10, +7, +6, +17, +19, +19, -16, +10, +4, -16, -14, +8, +7, -22, -8, -19, +13, +12, -18, -21, +10, -12, -2, -12, -11, -16, -20, +6, -3, +2, -16, +9, -13, +1, +2, -13, +15, +9, -7, +22, -2, +18, +5, +4, -20, +14, -17, -19, +16, -6, +19, +1, +5, +24, +11, -16, +15, +13, +15, -3, -5, -17, -1, +8, +5, -10, +9, -2, +7, -11, -17, -13, -1, -9, +4, -10, -26, -22, +16, +14, +21, -20, +43, +8, -12, +2, -7, +15, +12, +17, +12, -18, +16, -12, +13, +8, +14, -12, +26, -6, +18, -3, -7, +19, -5, +13, +12, -14, -7, -14, +13, +13, -18, -6, +3, -12, +5, -20, +19, -11, -7, -15, -11, +12, -14, +24, -1, +18, +24, -9, +11, +9, -3, +8, -21, +1, +17, +1, +4, +20, -12, -5, +23, -9, +6, -12, -36, +13, -3, +33, -2, +9, +11, +23, -18, +22, -11, +14, +9, +8, -12, +5, -3, -3, +8, +16, +6, -18, +10, -18, -6, -1, -2, +24, -17, +23, +16, -9, +10, +23, -10, +2, +2, -9, +13, +3, +18, +12, +15, +16, -3, -7, -7, -5, +9, +1, -3, -19, -7, +17, +3, +13, +25, -4, -1, -19, -7, +15, -21, +43, +17, +5, +19, +10, +14, -15, -12, +19, +19, -16, -7, -7, -15, +6, -8, +18, +12, -7, -18, +9, +18, +16, -23, -18, -3, +12, -15, +9, +3, -14, +16, +18, +13, +19, -1, +11, +14, -4, -16, +11, -12, +27, -1, -13, +9, +7, -9, -1, +14, -35, -28, +1, +4, +15, -18, +10, -6, +12, -2, -5, -23, +31, -23, -37, +6, -13, -3, +4, +38, -23, -28, -24, -15, +4, +3, -16, +32, +13, -24, -9, -41, -41, -13, -41, -17, +16, -3, -36, -136, -9, +7, -4, -54, +20, +3, +11, +13, +16, +6, +6, -29, -118, -68, -416, -393, -73804, +17, +8, -14, +12, -22, -19, -7, -3, -14, +8, -3, -3, +16, -14, +5, -19, +16, +15, +8, +11, -14, -13, +3, +14, -15, +19, +26, +8, -11, -12, +17, -12, -12, +20, +22, +13, +14, +13, -3, -2, -1, -4, -16, +7, +12, +18, -15, -11, +7, -15, +11, +16, +13, +16, -2, -9, -4, +6, -8, -27, +16, -7, +87, +17, +11, -12, -2, +11, -13, -9, -10, -21, +15, -23, -15, +13, +11, +37, +16, +22, +16, +12, +18, -9, -8, +19, -5, -4, +13, +8, +4, -9, +4, +9, +4, -19, -2, -11, -2, +16, +17, +6, -8, +19, -2, +6, +2, -10, +12, +6, -20, -6, +5, +14, +12, +20, -21, +22, -2, +9, -2, -14, -15, +14, +7, -2, +9, -19, -52, -20, +4, -1, -18, +9, +7, -17, -22, -20, -7, -2, -9, +8, -3, +11, +18, -7, +17, +22, -18, -15, -19, -8, +13, +3, -15, +17, -3, -43, -34, +9, -37, +41, +141, -16, +19, -10, +14, +4, -7, -17, +12, +23, +2, +16, +36, -61, -253, -41, -44, -17, +10, -9, -5, +15, +20, +16, -4, +3, -12, +21, -11, -9, +16, -24, -12, +5, -2, -6, -18, -15, +16, -10, -5, -4, +8, +6, -20, -3, -19, +7, +4, -3, -11, +20, +4, +17, -3, -5, -3, +6, -4, -16, -15, +3, +19, -18, +16, -9, +17, +15, -25, -12, -17, -17, -4, +13, -15, +4, +17, -7, +13, -18, +4, +3, +10, +5, -1, +12, +9, -19, +16, +2, -11, -14, -14, -14, -2, +6, -3, +1, -15, +3, +2, -11, -9, +4, -3, +13, -1, -20, -19, -13, -8, -1, +13, +8, +9, +2, +6, +8, -9, -20, -5, +11, +20, +2, +9, +15, +17, +3, +18, -20, -3, +7, +8, +15, -6, -10, -16, +19, +2, -32, -7, -11, +3, +11, -25, -11, +16, -3, +16, -35, +10, +16, +24, -3, +1, -15, -8, +20, +27, +23, +20, -1, -14, +34, +14, +3, -18, +6, +10, +9, -18, -27, -42, -41, -37, -12, -22, +15, +12, -19, -18, +17, -15, +18, -4, +20, -12, +17, -34, -23, -8, -27, -4, -8, +20, -10, -8, -19, +8, -4, +11, -1, -11, +9, +1, -4, +15, -6, +3, -10, -10, -4, +5, +28, -2, +15, -21, +19, -1, -6, -8, +13, -44, +3, -9, +3, -24, -19, +17, -3, +7, -16, +11, +17, -27, -15, -2, -11, -18, +9, -6, -17, +2, -16, +13, +16, -9, +1, -13, -5, -11, +4, -2, +8, +3, +25, +15, -20, +7, +2, +5, -3, -13, -17, -5, -6, +4, +20, +22, +8, +18, -7, +4, +13, -1, -6, -14, -4, -5, -25, +21, -5, -20, +15, +20, +1, +1, +3, +5, +3, +75248}\\n\\tsum := 0\\n\\tset := make(map[int]bool)\\n\\tset[0] = true\\n\\tm := false\\n\\tfor set[sum] {\\n\\t\\tfor _, num := range nums {\\n\\t\\t\\t// map the freq and check if array has that value, if true print and break\\n\\t\\t\\tsum += num\\n\\t\\t\\tif set[sum] {\\n\\t\\t\\t\\tfmt.Println(\\\"freq match\\\")\\n\\t\\t\\t\\tm = true\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t\\tset[sum] = true\\n\\t\\t}\\n\\t\\tif m {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\tfmt.Println(\\\"match:\\\", sum)\\n}\",\n \"func convertStepToDays(insight SearchInsight) int {\\n\\tif insight.Step.Days != nil {\\n\\t\\treturn *insight.Step.Days\\n\\t} else if insight.Step.Hours != nil {\\n\\t\\treturn 0\\n\\t} else if insight.Step.Weeks != nil {\\n\\t\\treturn *insight.Step.Weeks * 7\\n\\t} else if insight.Step.Months != nil {\\n\\t\\treturn *insight.Step.Months * 30\\n\\t} else if insight.Step.Years != nil {\\n\\t\\treturn *insight.Step.Years * 365\\n\\t}\\n\\n\\treturn 0\\n}\",\n \"func (p *Mach) Step() bool {\\n\\tinstr := p.Mem[p.Reg[p.P]%SZ]\\n\\ti, n := (instr>>4)&15, instr&15\\n\\tswitch i {\\n\\tcase 0: // LDN, but IDL if N==0\\n\\t\\tif n == 0 {\\n\\t\\t\\t// NOP -- we have moved WAIT to 0x68.\\n\\t\\t} else {\\n\\t\\t\\tp.D = p.Mem[p.Reg[n]%SZ]\\n\\t\\t}\\n\\tcase 1: // INC rn\\n\\t\\tp.Reg[n]++\\n\\tcase 2: // DEC rn\\n\\t\\tp.Reg[n]--\\n\\tcase 3: // BR...\\n\\t\\tswitch n {\\n\\t\\tcase 0:\\n\\t\\t\\tp.shortBranch(true)\\n\\t\\tcase 1:\\n\\t\\t\\tp.shortBranch(!p.Q)\\n\\t\\tcase 2:\\n\\t\\t\\tp.shortBranch(p.D == 0)\\n\\t\\tcase 3:\\n\\t\\t\\tp.shortBranch(p.DF)\\n\\t\\tcase 4:\\n\\t\\t\\tp.shortBranch(16 == 16&(p.EF<<1))\\n\\t\\tcase 5:\\n\\t\\t\\tp.shortBranch(16 == 16&(p.EF<<2))\\n\\t\\tcase 6:\\n\\t\\t\\tp.shortBranch(16 == 16&(p.EF<<3))\\n\\t\\tcase 7:\\n\\t\\t\\tp.shortBranch(16 == 16&(p.EF<<4))\\n\\n\\t\\tcase 8:\\n\\t\\t\\tp.shortBranch(false)\\n\\t\\tcase 9:\\n\\t\\t\\tp.shortBranch(p.Q)\\n\\t\\tcase 10:\\n\\t\\t\\tp.shortBranch(p.D != 0)\\n\\t\\tcase 11:\\n\\t\\t\\tp.shortBranch(!p.DF)\\n\\t\\tcase 12:\\n\\t\\t\\tp.shortBranch(0 == 16&(p.EF<<1))\\n\\t\\tcase 13:\\n\\t\\t\\tp.shortBranch(0 == 16&(p.EF<<2))\\n\\t\\tcase 14:\\n\\t\\t\\tp.shortBranch(0 == 16&(p.EF<<3))\\n\\t\\tcase 15:\\n\\t\\t\\tp.shortBranch(0 == 16&(p.EF<<4))\\n\\t\\t}\\n\\tcase 4: // LDA\\n\\t\\tp.D = p.Mem[p.Reg[n]%SZ]\\n\\t\\tp.Reg[n]++\\n\\tcase 5: // STR\\n\\t\\tp.Mem[p.Reg[n]%SZ] = p.D\\n\\tcase 6: // I/O\\n // Special case 0x68:\\n\\t\\tif n == 8 {\\n\\t\\t\\treturn false // The spare opcode 0x68 becomes IDL/STOP (rather than opcode 0)\\n\\t\\t}\\n // Special case 0x60:\\n\\t\\tif n == 0 {\\n\\t\\t\\tp.Reg[p.X]++ // IRX\\n\\t\\t}\\n // Inputs and Outputs\\n\\t\\tif n < 8 {\\n\\t\\t\\tp.Out[n] = p.D // OUT n&7\\n\\t\\t\\t// println(\\\"OUT\\\", n, p.D)\\n\\t\\t} else {\\n\\t\\t\\tp.D = p.In[(n & 7)] // IN n&7\\n\\t\\t}\\n\\tcase 7: // misc...\\n\\t\\tswitch n {\\n\\t\\tcase 0: // RET\\n\\n\\t\\tcase 1: // DIS\\n\\n\\t\\tcase 2: // LDXA\\n\\t\\t\\tp.D = p.Mem[p.Reg[p.X]%SZ]\\n\\t\\t\\tp.Reg[p.X]++\\n\\t\\tcase 3: // STXD\\n\\t\\t\\tp.Mem[p.Reg[p.X]%SZ] = p.D\\n\\t\\t\\tp.Reg[p.X]--\\n\\t\\tcase 4: //\\n\\t\\t\\tb := p.dfByte()\\n\\t\\t\\tp.DF = (int(b)+int(p.D)+int(p.Mem[p.Reg[p.X]%SZ]) > 255)\\n\\t\\t\\tp.D += b + p.Mem[p.Reg[p.X]%SZ]\\n\\t\\tcase 5: //\\n\\t\\t\\tb := p.dfByte()\\n\\t\\t\\tp.DF = (int(p.D) > int(p.Mem[p.Reg[p.X]%SZ])+int(b))\\n\\t\\t\\tp.D = b + p.Mem[p.Reg[p.X]%SZ] - p.D\\n\\t\\tcase 6: // SHRC\\n\\t\\t\\tc := (p.D&1 == 128)\\n\\t\\t\\tp.D = (p.D >> 1) | (p.dfByte() << 8)\\n\\t\\t\\tp.DF = c\\n\\t\\tcase 7: //\\n\\t\\t\\tb := p.dfByte()\\n\\t\\t\\tp.DF = (int(p.D)+int(b) < int(p.Mem[p.Reg[p.X]%SZ]))\\n\\t\\t\\tp.D = b + p.D - p.Mem[p.Reg[p.X]%SZ]\\n\\t\\tcase 8: // LDI\\n\\t\\t\\tp.D = p.imm()\\n\\t\\tcase 9: //\\n\\t\\t\\tp.D |= p.imm()\\n\\t\\tcase 10: // REQ\\n\\t\\t\\tp.Q = false\\n\\t\\tcase 11: // SEQ\\n\\t\\t\\tp.Q = true\\n\\t\\tcase 12: // ADCI\\n\\t\\t\\tb := p.dfByte()\\n\\t\\t\\timm := p.imm()\\n\\t\\t\\tp.DF = (int(b)+int(p.D)+int(imm) > 255)\\n\\t\\t\\tp.D += b + imm\\n\\t\\tcase 13: // SDBI\\n\\t\\t\\tb := p.dfByte()\\n\\t\\t\\timm := p.imm()\\n\\t\\t\\tp.DF = (p.D > b+imm)\\n\\t\\t\\tp.D = b + imm - p.D\\n\\t\\tcase 14: // SHLC\\n\\t\\t\\tc := (p.D&128 == 128)\\n\\t\\t\\tp.D = (p.D << 1) | p.dfByte()\\n\\t\\t\\tp.DF = c\\n\\t\\tcase 15: // SMBI\\n\\t\\t\\tb := p.dfByte()\\n\\t\\t\\timm := p.imm()\\n\\t\\t\\tp.DF = (b+p.D < imm)\\n\\t\\t\\tp.D = b + p.D - imm\\n\\t\\t}\\n\\tcase 8: // Get Lo\\n\\t\\tp.D = byte(p.Reg[n])\\n\\tcase 9: // Get Hi\\n\\t\\tp.D = byte(p.Reg[n] >> 8)\\n\\tcase 10: // Set Lo\\n\\t\\tp.Reg[n] = (p.Reg[n] & 0xFF00) | uint16(p.D)\\n\\tcase 11: // Set Hi\\n\\t\\tp.Reg[n] = (p.Reg[n] & 0x00FF) | (uint16(p.D) << 8)\\n\\tcase 12: // LBR...\\n\\tcase 13: // Set P\\n\\t\\tp.P = n\\n\\tcase 14: // Set X\\n\\t\\tp.X = n\\n\\tcase 15: // misc...\\n\\n\\t\\tswitch n {\\n\\t\\tcase 0: // LDX\\n\\t\\t\\tp.D = p.Mem[p.Reg[p.X]%SZ]\\n\\t\\tcase 1: // OR\\n\\t\\t\\tp.D |= p.Mem[p.Reg[p.X]%SZ]\\n\\t\\tcase 2: // AND\\n\\t\\t\\tp.D &= p.Mem[p.Reg[p.X]%SZ]\\n\\t\\tcase 3: // XOR\\n\\t\\t\\tp.D ^= p.Mem[p.Reg[p.X]%SZ]\\n\\t\\tcase 4: //\\n\\t\\t\\tp.DF = (int(p.D)+int(p.Mem[p.Reg[p.X]%SZ]) > 255)\\n\\t\\t\\tp.D += p.Mem[p.Reg[p.X]%SZ]\\n\\t\\tcase 5: // SD\\n\\t\\t\\tp.DF = (int(p.D) > int(p.Mem[p.Reg[p.X]%SZ]))\\n\\t\\t\\tp.D = p.Mem[p.Reg[p.X]%SZ] - p.D\\n\\t\\tcase 6: // SHR\\n\\t\\t\\tp.D = p.D >> 1\\n\\t\\tcase 7: // SM\\n\\t\\t\\tp.DF = (int(p.D) < int(p.Mem[p.Reg[p.X]%SZ]))\\n\\t\\t\\tp.D = p.D - p.Mem[p.Reg[p.X]%SZ]\\n\\t\\tcase 8: // LDI\\n\\t\\t\\tp.D = p.imm()\\n\\t\\tcase 9: //\\n\\t\\t\\tp.D |= p.imm()\\n\\t\\tcase 10: //\\n\\t\\t\\tp.D &= p.imm()\\n\\t\\tcase 11: //\\n\\t\\t\\tp.D ^= p.imm()\\n\\t\\tcase 12: //\\n\\t\\t\\timm := p.imm()\\n\\t\\t\\tp.DF = (p.D+imm > 255)\\n\\t\\t\\tp.D += imm\\n\\t\\tcase 13: //\\n\\t\\t\\timm := p.imm()\\n\\t\\t\\tp.DF = (p.D > imm)\\n\\t\\t\\tp.D = imm - p.D\\n\\t\\tcase 14: // SHL\\n\\t\\t\\tp.D = p.D << 1\\n\\t\\tcase 15: //\\n\\t\\t\\timm := p.imm()\\n\\t\\t\\tp.DF = (p.D < imm)\\n\\t\\t\\tp.D = p.D - imm\\n\\t\\t}\\n\\t}\\n\\tp.Reg[p.P]++\\n\\treturn true\\n}\",\n \"func doTurn2(from, to []bool, stride int) {\\n\\tfor pos := range from {\\n\\t\\tvar aliveNeighbors int\\n\\n\\t\\t// the following nested branches are ordered in most likely -> least likely\\n\\t\\t// on a 100x100 grid, 9602/10000 cells will not go inside the outer branches\\n\\t\\t// e.g.: most cells have have a direct up and left neighbor, only cells on the top and left borders do not, for which we wrap around\\n\\n\\t\\tvar upLeft int\\n\\n\\t\\t// try directly up and left\\n\\t\\tif upLeft = pos - stride - 1; upLeft < 0 {\\n\\n\\t\\t\\t// try directly up and wrapping to last col\\n\\t\\t\\tif upLeft = pos - 1; upLeft < 0 {\\n\\n\\t\\t\\t\\t// this cell is in the upper left corner, wrap to last row and col\\n\\t\\t\\t\\tupLeft = len(from) - 1\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif from[upLeft] {\\n\\t\\t\\taliveNeighbors++\\n\\t\\t}\\n\\n\\t\\tvar up int\\n\\n\\t\\t// try directly up\\n\\t\\tif up = pos - stride; up < 0 {\\n\\n\\t\\t\\t// this cell is in the top row, wrap to last row\\n\\t\\t\\tup = len(from) - (stride - pos)\\n\\t\\t}\\n\\n\\t\\tif from[up] {\\n\\t\\t\\taliveNeighbors++\\n\\t\\t}\\n\\n\\t\\tvar upRight int\\n\\n\\t\\t// try directly up and right\\n\\t\\tif upRight = pos - stride + 1; upRight < 0 {\\n\\n\\t\\t\\t// try directly up and wrapping to first col\\n\\t\\t\\tif upRight = pos - stride - stride + 1; upRight < 0 {\\n\\n\\t\\t\\t\\t// this cell is in the upper right corner, wrap to last row & first col\\n\\t\\t\\t\\tupRight = len(from) - stride\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif from[upRight] {\\n\\t\\t\\taliveNeighbors++\\n\\t\\t}\\n\\n\\t\\t// go directly left\\n\\t\\tleft := pos - 1\\n\\t\\t// cell is on the left border and pos-1 wrapped around, so move down 1 row\\n\\t\\tif pos%stride == 0 {\\n\\t\\t\\tleft += stride\\n\\t\\t}\\n\\n\\t\\tif from[left] {\\n\\t\\t\\taliveNeighbors++\\n\\t\\t}\\n\\n\\t\\t// go directly right\\n\\t\\tright := pos + 1\\n\\t\\t// cell is n the right border and pos+1 wrapped around, so move up 1 row\\n\\t\\tif pos%stride == stride-1 {\\n\\t\\t\\tright -= stride\\n\\t\\t}\\n\\n\\t\\tif from[right] {\\n\\t\\t\\taliveNeighbors++\\n\\t\\t}\\n\\n\\t\\tvar downLeft int\\n\\n\\t\\t// try directly down and left\\n\\t\\tif downLeft = pos + stride - 1; downLeft >= len(from) {\\n\\n\\t\\t\\t// try wrapping to last col\\n\\t\\t\\tif downLeft = pos + stride + stride - 1; downLeft >= len(from) {\\n\\n\\t\\t\\t\\t// we are in bottom left corner\\n\\t\\t\\t\\tdownLeft = stride - 1\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif from[downLeft] {\\n\\t\\t\\taliveNeighbors++\\n\\t\\t}\\n\\n\\t\\tvar down int\\n\\n\\t\\tif down = pos + stride; down >= len(from) {\\n\\n\\t\\t\\t// we are in bottom row, wrap to top\\n\\t\\t\\tdown = stride - (len(from) - pos)\\n\\t\\t}\\n\\n\\t\\tif from[down] {\\n\\t\\t\\taliveNeighbors++\\n\\t\\t}\\n\\n\\t\\tvar downRight int\\n\\n\\t\\t// try directly down and right\\n\\t\\tif downRight = pos + stride + 1; downRight >= len(from) {\\n\\n\\t\\t\\t// we are on last col\\n\\t\\t\\tif downRight = pos + 1; downRight >= len(from) {\\n\\n\\t\\t\\t\\tdownRight = 0\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif from[downRight] {\\n\\t\\t\\taliveNeighbors++\\n\\t\\t}\\n\\n\\t\\tto[pos] = (from[pos] && (aliveNeighbors == 2 || aliveNeighbors == 3)) || aliveNeighbors == 3\\n\\t}\\n}\",\n \"func findDirections(x, y int, length *int, value int, directions []dirTable) int {\\n num := 0\\n numChecks := 0\\n if value != wall || (getMaze(x, y) == path && setCell(x, y, check, noUpdate, *length, numChecks)) {\\n minLength := [4]int {*length, *length, *length, *length}\\n len := *length\\n for {\\n setInt(&dspLength, len)\\n dirLength := [4]int {len, len, len, len}\\n offset := rand.Intn(4)\\n for i := 0; i < 4; i++ {\\n dir := &stdDirection[(i + offset) % 4]\\n num += look(dir.heading, x, y, dir.x, dir.y, num, value, directions, &dirLength[i] , &minLength[i], &numChecks)\\n }\\n if num > 0 || len < 0 {\\n break\\n }\\n minLength := min( min(minLength[0], minLength[1]), min(minLength[2], minLength[3]) )\\n if minLength <= 0 {\\n minLength = 1\\n }\\n len -= minLength\\n }\\n if len == *length && len < getInt(&depth) {\\n len++\\n }\\n *length = len\\n if getMaze(x, y) == check {\\n setMaze(x, y, path)\\n }\\n }\\n if getInt(&maxChecks) < numChecks {\\n setInt(&maxChecks , numChecks)\\n }\\n return (num);\\n}\",\n \"func stepfrom(dir rune, x, y int) (sx, sy int) {\\n\\tswitch dir {\\n\\tcase 'N':\\n\\t\\treturn x, y + 1\\n\\tcase 'S':\\n\\t\\treturn x, y - 1\\n\\tcase 'W':\\n\\t\\treturn x + 1, y\\n\\tcase 'E':\\n\\t\\treturn x - 1, y\\n\\t}\\n\\tpanic(\\\"invalid stepfrom direction\\\")\\n}\",\n \"func (w walk) cycleDepth() uint {\\n\\tif len(w) == 0 {\\n\\t\\treturn 0\\n\\t}\\n\\tn := w[len(w)-1]\\n\\tc := uint(1)\\n\\tfor i := len(w) - 2; i >= 0; i-- {\\n\\t\\tif n == w[i] {\\n\\t\\t\\tc++\\n\\t\\t}\\n\\t}\\n\\treturn c\\n}\",\n \"func shortestPathAllKeys(grid []string) int {\\n \\n}\",\n \"func Run() {\\n\\tinputInts := bp.Atoi(bp.GetN(\\\"day10/day10_input.txt\\\"))\\n\\tsort.Ints(inputInts)\\n\\n\\toneJoltDiff, threeJoltDiff := 0, 0\\n\\tfor i := 0; i <= len(inputInts); i++ {\\n\\t\\tcurr := 0\\n\\t\\tif i == 0 {\\n\\t\\t\\tcurr = 0\\n\\t\\t} else {\\n\\t\\t\\tcurr = inputInts[i-1]\\n\\t\\t}\\n\\n\\t\\tnext := 0\\n\\t\\tif len(inputInts) == i {\\n\\t\\t\\tnext = inputInts[i-1] + 3\\n\\t\\t} else {\\n\\t\\t\\tnext = inputInts[i]\\n\\t\\t}\\n\\n\\t\\tif next-curr == 1 {\\n\\t\\t\\toneJoltDiff++\\n\\t\\t} else if next-curr == 3 {\\n\\t\\t\\tthreeJoltDiff++\\n\\t\\t}\\n\\t}\\n\\n\\tfmt.Println(\\\"\\\\tpart 1:\\\", oneJoltDiff*threeJoltDiff)\\n\\n\\tinputInts = append([]int{0}, inputInts...)\\n\\tinputInts = append(inputInts, inputInts[len(inputInts)-1]+3)\\n\\n\\tindices := make([]int, 1)\\n\\tfor i := 1; i < len(inputInts); i++ {\\n\\t\\tif inputInts[i-1] == inputInts[i]-3 {\\n\\t\\t\\tindices = append(indices, i)\\n\\t\\t}\\n\\t}\\n\\n\\tres := 1\\n\\tfor i := 1; i < len(indices); i++ {\\n\\t\\tpaths, prevIndex, currIndex := 0, indices[i-1], indices[i]\\n\\t\\tnext(prevIndex, &inputInts, &paths, currIndex)\\n\\t\\tres *= paths\\n\\t}\\n\\n\\tfmt.Println(\\\"\\\\tpart 2:\\\", res)\\n}\",\n \"func (d Day) SolvePartTwo() (string, error) {\\n\\txCycleLength := findCycleLength(d.moons, xDimension)\\n\\tyCycleLength := findCycleLength(d.moons, yDimension)\\n\\tzCycleLength := findCycleLength(d.moons, zDimension)\\n\\treturn fmt.Sprintf(\\\"%d\\\", util.LCM3(xCycleLength, yCycleLength, zCycleLength)), nil\\n}\",\n \"func TestSwitchMotion(t *testing.T) {\\n\\talphabet := \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n\\tm, err := NewMachine(21, 1, 25, 5, 1, 2, alphabet)\\n\\tif err != nil {\\n\\t\\tt.Fatalf(\\\"Could not complete NewMachine: %s\\\", err.Error())\\n\\t}\\n\\tvar tests = [][]int{\\n\\t\\t{20, 0, 24, 4},\\n\\t\\t{21, 1, 24, 4},\\n\\t\\t{22, 2, 24, 4},\\n\\t\\t{23, 3, 24, 4},\\n\\t\\t{24, 3, 24, 5},\\n\\t\\t{0, 3, 0, 5},\\n\\t\\t{1, 4, 0, 5},\\n\\t\\t{2, 5, 0, 5},\\n\\t}\\n\\tfor i, test := range tests {\\n\\t\\tif m.sixes.position != test[0] ||\\n\\t\\t\\tm.fast.position != test[1] ||\\n\\t\\t\\tm.middle.position != test[2] ||\\n\\t\\t\\tm.slow.position != test[3] {\\n\\t\\t\\tt.Errorf(\\\"TestSwitchMotion fails after %d steps: [%d,%d,%d,%d], want %v\\\", i,\\n\\t\\t\\t\\tm.sixes.position, m.fast.position, m.middle.position, m.slow.position, test)\\n\\t\\t}\\n\\t\\tm.step()\\n\\t}\\n}\",\n \"func numIslands(grid [][]byte) int {\\n\\t//h := len(grid)\\n\\t//w := len(grid[0])\\n\\t//walkJudge := make([][]bool, h)\\n\\t//for i, _ := range walkJudge {\\n\\t//\\twalkJudge[i] = make([]bool, w)\\n\\t//}\\n\\tcount := 0\\n\\n\\tfor i, _ := range grid {\\n\\t\\tfor j, _ := range grid[i] {\\n\\t\\t\\tif grid[i][j] == '1' {\\n\\t\\t\\t\\tdfs(grid, i, j)\\n\\t\\t\\t\\tcount += 1\\n\\t\\t\\t\\t//fullPath(&walkJudge, grid,i, j)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn count\\n}\",\n \"func (v *Values) GetSteps() map[string]interface{} {\\n\\treturn v.m[\\\"step\\\"].(map[string]interface{})\\n}\",\n \"func TestStepsFailedRetries(t *testing.T) {\\n\\twf := test.LoadTestWorkflow(\\\"testdata/steps-failed-retries.yaml\\\")\\n\\twoc := newWoc(*wf)\\n\\twoc.operate()\\n\\tassert.Equal(t, string(wfv1.NodeFailed), string(woc.wf.Status.Phase))\\n}\",\n \"func solveAllSegments(display sevenSegmentDisplay) (result int) {\\n\\tlookupTable := make(map[string]int)\\n\\tcountPositions := make(map[rune]int)\\n\\tfor _, displayPos := range display.segments {\\n\\t\\tfor _, char := range displayPos {\\n\\t\\t\\tcountPositions[char]++\\n\\t\\t}\\n\\t}\\n\\n\\tpositionSheet := make(map[int][]rune)\\n\\tfor char, val := range countPositions {\\n\\t\\tpositionSheet[val] = append(positionSheet[val], char)\\n\\t}\\n\\n\\tfor _, displayPos := range display.segments {\\n\\t\\tswitch len(displayPos) {\\n\\t\\tcase 2:\\n\\t\\t\\tlookupTable[displayPos] = 1\\n\\t\\tcase 3:\\n\\t\\t\\tlookupTable[displayPos] = 7\\n\\t\\tcase 4:\\n\\t\\t\\tlookupTable[displayPos] = 4\\n\\t\\tcase 7:\\n\\t\\t\\tlookupTable[displayPos] = 8\\n\\t\\tcase 5: // 2, 3 or 5\\n\\t\\t\\t// Only 2 has an empty space bottom-right\\n\\t\\t\\tif !strings.ContainsRune(displayPos, positionSheet[9][0]) {\\n\\t\\t\\t\\tlookupTable[displayPos] = 2\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\t// if they have top and top-right it's 3 else 5\\n\\t\\t\\tif strings.ContainsRune(displayPos, positionSheet[8][0]) && strings.ContainsRune(displayPos, positionSheet[8][1]) {\\n\\t\\t\\t\\tlookupTable[displayPos] = 3\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tlookupTable[displayPos] = 5\\n\\t\\tcase 6: // 0, 6 or 9\\n\\t\\t\\t// if they have bottom left they can be - 0 6 -\\n\\t\\t\\tif strings.ContainsRune(displayPos, positionSheet[4][0]) {\\n\\t\\t\\t\\t// if they have top and top-right it's 0 else 6\\n\\t\\t\\t\\tif strings.ContainsRune(displayPos, positionSheet[8][0]) && strings.ContainsRune(displayPos, positionSheet[8][1]) {\\n\\t\\t\\t\\t\\tlookupTable[displayPos] = 0\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tlookupTable[displayPos] = 6\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tlookupTable[displayPos] = 9\\n\\t\\t}\\n\\t}\\n\\n\\tvar resultString = \\\"\\\"\\n\\tfor _, value := range display.values {\\n\\t\\tresultString += strconv.FormatInt(int64(lookupTable[value]), 10)\\n\\t}\\n\\n\\treturn pkg.MustAtoi(resultString)\\n}\",\n \"func (stem *Stem) step3() {\\r\\n\\tif stem.k == stem.k0 {\\r\\n\\t\\treturn /*ForBug1*/\\r\\n\\t}\\r\\n\\tswitch stem.b[stem.k-1] {\\r\\n\\tcase 'a':\\r\\n\\t\\tif stem.ends(\\\"ational\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ate\\\")\\r\\n\\t\\t}\\r\\n\\t\\tif stem.ends(\\\"tional\\\") {\\r\\n\\t\\t\\tstem.r(\\\"tion\\\")\\r\\n\\t\\t}\\r\\n\\tcase 'c':\\r\\n\\t\\tif stem.ends(\\\"enci\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ence\\\")\\r\\n\\t\\t}\\r\\n\\t\\tif stem.ends(\\\"anci\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ance\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\tcase 'e':\\r\\n\\t\\tif stem.ends(\\\"izer\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ize\\\")\\r\\n\\t\\t}\\r\\n\\tcase 'l':\\r\\n\\t\\tif stem.ends(\\\"bli\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ble\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t\\tif stem.ends(\\\"alli\\\") {\\r\\n\\t\\t\\tstem.r(\\\"al\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t\\tif stem.ends(\\\"entli\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ent\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t\\tif stem.ends(\\\"eli\\\") {\\r\\n\\t\\t\\tstem.r(\\\"e\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t\\tif stem.ends(\\\"ousli\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ous\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\tcase 'o':\\r\\n\\t\\tif stem.ends(\\\"ization\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ize\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t\\tif stem.ends(\\\"ation\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ate\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t\\tif stem.ends(\\\"ator\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ate\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\tcase 's':\\r\\n\\t\\tif stem.ends(\\\"alism\\\") {\\r\\n\\t\\t\\tstem.r(\\\"al\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t\\tif stem.ends(\\\"iveness\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ive\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t\\tif stem.ends(\\\"fulness\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ful\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t\\tif stem.ends(\\\"ousness\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ous\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\tcase 't':\\r\\n\\t\\tif stem.ends(\\\"aliti\\\") {\\r\\n\\t\\t\\tstem.r(\\\"al\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t\\tif stem.ends(\\\"iviti\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ive\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t\\tif stem.ends(\\\"biliti\\\") {\\r\\n\\t\\t\\tstem.r(\\\"ble\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\tcase 'g':\\r\\n\\t\\tif stem.ends(\\\"logi\\\") {\\r\\n\\t\\t\\tstem.r(\\\"log\\\")\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t}\\r\\n}\",\n \"func Part2(ctx context.Context, input string) (interface{}, error) {\\n\\tg1 := new4DSpace(strings.Split(input, \\\"\\\\n\\\"), \\\".\\\")\\n\\tg2 := new4DSpace(strings.Split(input, \\\"\\\\n\\\"), \\\".\\\")\\n\\n\\tvar curr, next map[coordinate4D]string\\n\\tfor i := 0; i < 6; i++ {\\n\\t\\tif i%2 == 0 {\\n\\t\\t\\tcurr = g1\\n\\t\\t\\tnext = g2\\n\\t\\t} else {\\n\\t\\t\\tcurr = g2\\n\\t\\t\\tnext = g1\\n\\t\\t}\\n\\n\\t\\tminX, maxX, minY, maxY, minZ, maxZ, minW, maxW := 0, 0, 0, 0, 0, 0, 0, 0\\n\\t\\tfor c := range curr {\\n\\t\\t\\tif c.X < minX {\\n\\t\\t\\t\\tminX = c.X\\n\\t\\t\\t}\\n\\t\\t\\tif c.X > maxX {\\n\\t\\t\\t\\tmaxX = c.X\\n\\t\\t\\t}\\n\\n\\t\\t\\tif c.Y < minY {\\n\\t\\t\\t\\tminY = c.Y\\n\\t\\t\\t}\\n\\t\\t\\tif c.Y > maxY {\\n\\t\\t\\t\\tmaxY = c.Y\\n\\t\\t\\t}\\n\\n\\t\\t\\tif c.Z < minZ {\\n\\t\\t\\t\\tminZ = c.Z\\n\\t\\t\\t}\\n\\t\\t\\tif c.Z > maxZ {\\n\\t\\t\\t\\tmaxZ = c.Z\\n\\t\\t\\t}\\n\\n\\t\\t\\tif c.W < minW {\\n\\t\\t\\t\\tminW = c.W\\n\\t\\t\\t}\\n\\t\\t\\tif c.W > maxW {\\n\\t\\t\\t\\tmaxW = c.W\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmaxX++\\n\\t\\tmaxY++\\n\\t\\tmaxZ++\\n\\t\\tmaxW++\\n\\n\\t\\tfor x := minX - 1; x <= maxX; x++ {\\n\\t\\t\\tfor y := minY - 1; y <= maxY; y++ {\\n\\t\\t\\t\\tfor z := minZ - 1; z <= maxZ; z++ {\\n\\t\\t\\t\\t\\tfor w := minW - 1; w <= maxW; w++ {\\n\\t\\t\\t\\t\\t\\tc := coordinate4D{X: x, Y: y, Z: z, W: w}\\n\\t\\t\\t\\t\\t\\tv := curr[c]\\n\\t\\t\\t\\t\\t\\tif v == \\\"\\\" {\\n\\t\\t\\t\\t\\t\\t\\tv = \\\".\\\"\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tactiveCount := 0\\n\\t\\t\\t\\t\\t\\tfor _, s := range c.Surrounding() {\\n\\t\\t\\t\\t\\t\\t\\tswitch curr[s] {\\n\\t\\t\\t\\t\\t\\t\\tcase \\\"#\\\":\\n\\t\\t\\t\\t\\t\\t\\t\\tactiveCount++\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif v == \\\"#\\\" && (activeCount != 2 && activeCount != 3) {\\n\\t\\t\\t\\t\\t\\t\\tnext[c] = \\\".\\\"\\n\\t\\t\\t\\t\\t\\t} else if v == \\\".\\\" && activeCount == 3 {\\n\\t\\t\\t\\t\\t\\t\\tnext[c] = \\\"#\\\"\\n\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\tnext[c] = v\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Count\\n\\tc := 0\\n\\tfor _, v := range next {\\n\\t\\tif v == \\\"#\\\" {\\n\\t\\t\\tc++\\n\\t\\t}\\n\\t}\\n\\n\\treturn c, nil\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.631437","0.6289041","0.5995027","0.5943802","0.58128786","0.5675189","0.5543537","0.55353135","0.55158156","0.5515774","0.54764587","0.54721206","0.5456247","0.5381262","0.5378672","0.53775716","0.53614694","0.5350701","0.53365123","0.53184175","0.5297281","0.52075386","0.5199651","0.5183207","0.51633257","0.5142028","0.5129821","0.5127829","0.51167876","0.5092953","0.50871724","0.5079805","0.50724936","0.50419986","0.50326186","0.5030932","0.5019751","0.5013328","0.501022","0.5006592","0.50000155","0.49951226","0.4993729","0.4989663","0.49793044","0.4973419","0.49597302","0.49575353","0.4956297","0.49517104","0.49448442","0.49382585","0.49343315","0.49208546","0.48918927","0.48904493","0.48880407","0.48875445","0.4880187","0.48763844","0.4872424","0.48612168","0.48611537","0.48546505","0.48545483","0.48475185","0.48419672","0.48208344","0.48191342","0.48144913","0.48083836","0.48070198","0.48052353","0.47980547","0.47908816","0.4789271","0.47816625","0.4770155","0.47691897","0.47674453","0.47658598","0.4764117","0.47592124","0.47559533","0.4750269","0.47481936","0.47470096","0.47283617","0.4723456","0.4717415","0.4715442","0.471541","0.47064358","0.47002098","0.4675443","0.46719924","0.46713346","0.46660152","0.46621847","0.466074","0.46596295"],"string":"[\n \"0.631437\",\n \"0.6289041\",\n \"0.5995027\",\n \"0.5943802\",\n \"0.58128786\",\n \"0.5675189\",\n \"0.5543537\",\n \"0.55353135\",\n \"0.55158156\",\n \"0.5515774\",\n \"0.54764587\",\n \"0.54721206\",\n \"0.5456247\",\n \"0.5381262\",\n \"0.5378672\",\n \"0.53775716\",\n \"0.53614694\",\n \"0.5350701\",\n \"0.53365123\",\n \"0.53184175\",\n \"0.5297281\",\n \"0.52075386\",\n \"0.5199651\",\n \"0.5183207\",\n \"0.51633257\",\n \"0.5142028\",\n \"0.5129821\",\n \"0.5127829\",\n \"0.51167876\",\n \"0.5092953\",\n \"0.50871724\",\n \"0.5079805\",\n \"0.50724936\",\n \"0.50419986\",\n \"0.50326186\",\n \"0.5030932\",\n \"0.5019751\",\n \"0.5013328\",\n \"0.501022\",\n \"0.5006592\",\n \"0.50000155\",\n \"0.49951226\",\n \"0.4993729\",\n \"0.4989663\",\n \"0.49793044\",\n \"0.4973419\",\n \"0.49597302\",\n \"0.49575353\",\n \"0.4956297\",\n \"0.49517104\",\n \"0.49448442\",\n \"0.49382585\",\n \"0.49343315\",\n \"0.49208546\",\n \"0.48918927\",\n \"0.48904493\",\n \"0.48880407\",\n \"0.48875445\",\n \"0.4880187\",\n \"0.48763844\",\n \"0.4872424\",\n \"0.48612168\",\n \"0.48611537\",\n \"0.48546505\",\n \"0.48545483\",\n \"0.48475185\",\n \"0.48419672\",\n \"0.48208344\",\n \"0.48191342\",\n \"0.48144913\",\n \"0.48083836\",\n \"0.48070198\",\n \"0.48052353\",\n \"0.47980547\",\n \"0.47908816\",\n \"0.4789271\",\n \"0.47816625\",\n \"0.4770155\",\n \"0.47691897\",\n \"0.47674453\",\n \"0.47658598\",\n \"0.4764117\",\n \"0.47592124\",\n \"0.47559533\",\n \"0.4750269\",\n \"0.47481936\",\n \"0.47470096\",\n \"0.47283617\",\n \"0.4723456\",\n \"0.4717415\",\n \"0.4715442\",\n \"0.471541\",\n \"0.47064358\",\n \"0.47002098\",\n \"0.4675443\",\n \"0.46719924\",\n \"0.46713346\",\n \"0.46660152\",\n \"0.46621847\",\n \"0.466074\",\n \"0.46596295\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":987,"cells":{"query":{"kind":"string","value":"/ 0 1 0 0 1 0 0 1 0 1 1 1 2 1 0 2 2 2 1 0 3 3 2 1 0"},"document":{"kind":"string","value":"func findLargestIslandUtil(arr [][]int, maxCol int, maxRow int, currCol int, currRow int, traversed [][]bool) int {\n\tdir := [][]int{{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}}\n\tvar x, y int\n\tvar sum = 1\n\n\t// Traverse in all eight directions.\n\tfor i := 0; i < 8; i++ {\n\t\tx = currCol + dir[i][0]\n\t\ty = currRow + dir[i][1]\n\t\tif x >= 0 && x < maxCol && y >= 0 && y < maxRow && traversed[x][y] == false && arr[x][y] == 1 {\n\t\t\ttraversed[x][y] = true\n\t\t\tsum += findLargestIslandUtil(arr, maxCol, maxRow, x, y, traversed)\n\t\t}\n\t}\n\n\treturn sum\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func createSet(input [9]int8) int16 {\n\tvar used int16 = 0\n\tfor i := 0; i < 9; i++ {\n\t\tused += (1 << uint(input[i] - 1))\n\t}\n\treturn used;\n}","func duplicateZeros1(arr []int) {\n\tvar count int\n\tn := len(arr)\n\tfor _, v := range arr {\n\t\tif v == 0 {\n\t\t\tcount++\n\t\t}\n\t}\n\n\tfor i := n - 1; i >= 0; i-- {\n\t\tif i+count >= n {\n\t\t\tif arr[i] == 0 {\n\t\t\t\tif i+count-1 < n {\n\t\t\t\t\tarr[i+count-1] = 0\n\t\t\t\t}\n\t\t\t\tcount--\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\tif count != 0 {\n\t\t\tarr[i+count] = arr[i]\n\t\t\tif arr[i] == 0 {\n\t\t\t\tarr[i+count-1] = 0\n\t\t\t\tcount--\n\t\t\t}\n\t\t}\n\t}\n}","func c1(n int) int { return n - WIDTH - 1 }","func countInitialOccurrences(s []byte, x byte) int {\n\tfor i, c := range s {\n\t\tif c != x {\n\t\t\treturn i\n\t\t}\n\t}\n\treturn len(s)\n}","func rej(a []int16, buf []byte) int {\n\tctr, buflen, alen := 0, len(buf), len(a)\n\tfor pos := 0; pos+3 <= buflen && ctr < alen; pos += 3 {\n\t\tval0 := (uint16(buf[pos]) | (uint16(buf[pos+1]) << 8)) & 0xfff\n\t\tval1 := (uint16(buf[pos+1]>>4) | (uint16(buf[pos+2]) << 4)) & 0xfff\n\t\tif val0 < uint16(q) {\n\t\t\ta[ctr] = int16(val0)\n\t\t\tctr++\n\t\t}\n\t\tif val1 < uint16(q) && ctr != alen {\n\t\t\ta[ctr] = int16(val1)\n\t\t\tctr++\n\t\t}\n\t}\n\treturn ctr\n}","func duplicateZeros(n int) string {\n\tvar zero string\n\tfor i := 0; i < n; i++ {\n\t\tzero += \"f0\"\n\t}\n\n\treturn zero\n}","func slog(block uint32) uint16 {\n\tfor i := uint16(12); i <= 20; i++ {\n\t\tif block == (1 << i) {\n\t\t\treturn i\n\t\t}\n\t}\n\treturn 0\n}","func countLeadingZeroes(i int, word int32) int {\n\tleading := 0\n\tfor word < powers10[i] {\n\t\ti--\n\t\tleading++\n\t}\n\treturn leading\n}","func countLeadingZeroes(i int, word int32) int {\n\ttrace_util_0.Count(_mydecimal_00000, 25)\n\tleading := 0\n\tfor word < powers10[i] {\n\t\ttrace_util_0.Count(_mydecimal_00000, 27)\n\t\ti--\n\t\tleading++\n\t}\n\ttrace_util_0.Count(_mydecimal_00000, 26)\n\treturn leading\n}","func TestDuplicateZeros(t *testing.T) {\n\tduplicateZeros1([]int{1, 0, 2, 3, 0, 4, 5, 0})\n\tduplicateZeros1([]int{1, 2, 3})\n}","func countAndSay(n int) string {\n\tif n <= 1{\n\t\treturn \"1\"\n\t}\n\tvar last string = \"1\"\n\tfor i := 2;i <= n;i++{\n\t\tslow := 0\n\t\tfast := slow + 1\n\t\t//var cur string\n\t\tvar cur bytes.Buffer\n\t\tl := len(last)\n\t\tfor fast <= l{\n\t\t\tif fast < len(last) && last[slow] == last[fast]{\n\t\t\t\tfast++\n\t\t\t}else{\n\t\t\t\t//l := fast - slow\n\t\t\t\t//cnt := strconv.Itoa(l)\n\t\t\t\t//num := string(last[slow])\n\t\t\t\t//cur += cnt + num\n\t\t\t\tcur.WriteString(strconv.Itoa(fast - slow))\n\t\t\t\tcur.WriteByte(last[slow])\n\t\t\t\tslow = fast\n\t\t\t\tfast++\n\t\t\t}\n\t\t}\n\t\tlast = cur.String()\n\t\tif i == n{\n\t\t\treturn last\n\t\t}\n\t}\n\treturn last\n}","func duplicateZerosV1(arr []int) {\n\tvar buf []int\n\tfor i := 0; i < len(arr); i++ {\n\t\tif arr[i] == 0 && i < len(arr)-1 {\n\t\t\tbuf = make([]int, len(arr)-i-1)\n\t\t\tcopy(buf, arr[i+1:i+len(buf)])\n\t\t\tarr[i+1] = 0\n\t\t\tfor j := 0; j < len(buf)-1; j++ {\n\t\t\t\tarr[i+2+j] = buf[j]\n\t\t\t}\n\t\t\ti++\n\t\t}\n\t}\n}","func increment(counter []byte) {\n\tfor i := len(counter) - 1; i >= 0; i-- {\n\t\tcounter[i]++\n\t\tif counter[i] != 0 {\n\t\t\tbreak\n\t\t}\n\t}\n}","func RepeatFasta(s []byte, count int) {\n pos := 0\n s2 := make([]byte, len(s)+WIDTH)\n copy(s2, s)\n copy(s2[len(s):], s)\n for count > 0 {\n line := min(WIDTH, count)\n out.Write(s2[pos : pos+line])\n out.WriteByte('\\n')\n pos += line\n if pos >= len(s) {\n pos -= len(s)\n }\n count -= line\n }\n}","func init() {\n\tval := make([]byte, 4)\n\tfor i := 0; i < 256; i++ {\n\t\tfor j := 0; j < 4; j++ {\n\t\t\t// First base is the most significant digit.\n\t\t\tval[3-j] = Iton((i >> (2 * j)) & 3)\n\t\t}\n\t\tcopy(dnaFrom2bit[i][:], val)\n\t}\n}","func countingValleys(n int32, s string) int32 {\n\tstartAr := []int32{0}\n\tvar start int32\n\tvar valleyPoint int32 = 1\n\tfor _, elem := range s {\n\t\tchar := string(elem)\n\t\tcheckInt := true\n\t\tcheckInt = math.Signbit(float64(start))\n\t\tif char == \"D\" {\n\t\t\tstart = start - 1\n\t\t} else {\n\t\t\tstart = start + 1\n\t\t}\n\n\t\tif start == 0 {\n\t\t\tif checkInt == true {\n\t\t\t\tvalleyPoint = valleyPoint + 1\n\t\t\t}\n\t\t}\n\t\tstartAr = append(startAr, start)\n\t}\n\tfmt.Println(startAr)\n\tvalley := valleyPoint - 1\n\treturn valley\n}","func countAndSay(n int) string {\n\tif n == 1 { // special case\n\t\treturn \"1\"\n\t}\n\tpre, cur := \"\", \"1\"\n\thead, tail := 0, 0\n\n\ttmp := cur[0]\n\tlength := len(cur)\n\n\tfor i := 1; i < n; i++ { // 1 -> n -1\n\t\tlength = len(cur) // reset length\n\t\ttmp = cur[0] // reset tmp\n\t\thead = 0 // reset head and tail 0 0\n\t\tfor tail = 0; tail < length; tail++ {\n\t\t\tif cur[tail] == tmp { // find same as cache\n\t\t\t\thead++\n\t\t\t} else { // not found add tmp and cache pre then mark head -> 1\n\t\t\t\tpre = pre + strconv.Itoa(head) + string(tmp)\n\t\t\t\ttmp = cur[tail]\n\t\t\t\thead = 1\n\t\t\t}\n\n\t\t\tif tail == length-1 { // special case length-1 cache pre\n\t\t\t\tpre = pre + strconv.Itoa(head) + string(tmp)\n\t\t\t}\n\t\t}\n\t\tcur = pre // cur now\n\t\tpre = \"\" //reset\n\t}\n\treturn cur\n}","func emitRepeat(dst []byte, offset, length int) int {\n\t// Repeat offset, make length cheaper\n\tlength -= 4\n\tif length <= 4 {\n\t\tdst[0] = uint8(length)<<2 | tagCopy1\n\t\tdst[1] = 0\n\t\treturn 2\n\t}\n\tif length < 8 && offset < 2048 {\n\t\t// Encode WITH offset\n\t\tdst[1] = uint8(offset)\n\t\tdst[0] = uint8(offset>>8)<<5 | uint8(length)<<2 | tagCopy1\n\t\treturn 2\n\t}\n\tif length < (1<<8)+4 {\n\t\tlength -= 4\n\t\tdst[2] = uint8(length)\n\t\tdst[1] = 0\n\t\tdst[0] = 5<<2 | tagCopy1\n\t\treturn 3\n\t}\n\tif length < (1<<16)+(1<<8) {\n\t\tlength -= 1 << 8\n\t\tdst[3] = uint8(length >> 8)\n\t\tdst[2] = uint8(length >> 0)\n\t\tdst[1] = 0\n\t\tdst[0] = 6<<2 | tagCopy1\n\t\treturn 4\n\t}\n\tconst maxRepeat = (1 << 24) - 1\n\tlength -= 1 << 16\n\tleft := 0\n\tif length > maxRepeat {\n\t\tleft = length - maxRepeat + 4\n\t\tlength = maxRepeat - 4\n\t}\n\tdst[4] = uint8(length >> 16)\n\tdst[3] = uint8(length >> 8)\n\tdst[2] = uint8(length >> 0)\n\tdst[1] = 0\n\tdst[0] = 7<<2 | tagCopy1\n\tif left > 0 {\n\t\treturn 5 + emitRepeat(dst[5:], offset, left)\n\t}\n\treturn 5\n}","func singleNumberA(nums []int) int {\n result:=0\n for _,data := range nums{\n result^=data\n }\n return result\n}","func table(w string) []int {\n\tvar (\n\t\tt []int = []int{-1}\n\t\tk int\n\t)\n\tfor j := 1; j < len(w); j++ {\n\t\tk = j - 1\n\t\tfor w[0:k] != w[j-k:j] && k > 0 {\n\t\t\tk--\n\t\t}\n\t\tt = append(t, k)\n\t}\n\treturn t\n}","func ones(n int) []int {\n\ts := make([]int, n)\n\tfor i := range s {\n\t\ts[i] = 1\n\t}\n\treturn s\n}","func findMaxSequenceOf1s(x int) int {\n\tmaxSequenceOf1s := 0\n\tcurrentSequenceOf1s := 0\n\t// Assume int has 32 bits.\n\tfor i := 0; i < 32; i++ {\n\t\tmask := 1 << i\n\t\tif x&mask > 0 {\n\t\t\tcurrentSequenceOf1s++\n\t\t} else {\n\t\t\tmaxSequenceOf1s = ix.Max(maxSequenceOf1s, currentSequenceOf1s)\n\t\t\tcurrentSequenceOf1s = 0\n\t\t}\n\t}\n\tmaxSequenceOf1s = ix.Max(maxSequenceOf1s, currentSequenceOf1s)\n\treturn maxSequenceOf1s\n}","func countTrailingZeroes(i int, word int32) int {\n\ttrailing := 0\n\tfor word%powers10[i] == 0 {\n\t\ti++\n\t\ttrailing++\n\t}\n\treturn trailing\n}","func get1N(indices *[]uint16, start, end int) []uint16 {\n\tif end > cap(*indices) {\n\t\t*indices = make([]uint16, end)\n\t\tfor i := range *indices {\n\t\t\t(*indices)[i] = uint16(i)\n\t\t}\n\t}\n\treturn (*indices)[start:end]\n}","func steps(s []int) int {\n\tsteps := 0\n\n\tfor pos := 0; pos >= 0 && pos < len(s); steps += 1 {\n\t\tnewpos := pos + s[pos]\n\t\tif s[pos] >= 3 {\n\t\t\ts[pos] -= 1\n\t\t} else {\n\t\t\ts[pos] += 1\n\t\t}\n\t\tpos = newpos\n\t}\n\n\treturn steps\n}","func Solution(N int) int {\n result := 0\n binaryRepresentation := strconv.FormatInt(int64(N), 2)\n currentGap := 0\n \n for _,value := range binaryRepresentation{\n //Converts the current rune to ASCII representation of the digit\n val := int(value -'0')\n if val == 1{\n if currentGap > result{\n result = currentGap\n currentGap = 0\n }\n }else{\n currentGap ++\n }\n }\n \n return result\n}","func LeadingZeros(x uint) int { return UintSize - Len(x) }","func part1() {\n\ts := \"abc\"\n\tcount := 0\n\ti := 0\n\th := md5.New()\n\tbuffer := bytes.NewBuffer(make([]byte, 64))\n\n\tfor count < 8 {\n\t\tbuffer.Reset()\n\t\tfmt.Fprintf(buffer, \"%s%d\", s, i)\n\n\t\th.Reset()\n\t\th.Write(buffer.Bytes())\n\t\tdigest := h.Sum(nil)\n\t\tif digest[0] == 0 && digest[1] == 0 && digest[2] < 16 {\n\t\t\tfmt.Printf(\"%x\", digest[2])\n\t\t\tcount++\n\t\t}\n\t\ti++\n\t}\n\tfmt.Println()\n}","func bitVectorLetterAppearsOddNumberOfTimes(s string) uint32 {\n\tvar result uint32 = 0\n\n\tfor _, r := range s {\n\t\t// ignore non latin lowercase alphabet runes\n\t\tif r < 'a' || r > 'z' {\n\t\t\tcontinue\n\t\t}\n\n\t\ti := r - 'a' // number of letter r in alphabet\n\t\tresult ^= (1 << i) // toggle ith bit of v\n\t}\n\n\treturn result\n}","func countingValleys(n int32, s string) int32 {\n\n l, v := 0, 0\n s = strings.ToLower(s)\n for _, r := range s {\n\n if r == 'u' {\n if l < 0 && l+1 == 0 {\n v++\n }\n l++\n\n } else {\n l--\n }\n }\n return int32(v)\n}","func icecreamParlor(m int32, arr []int32) []int32 {\n prev := map[int32]int{};\n for i, a := range arr {\n if prev[m-a] != 0 {\n return []int32{int32(prev[m-a]), int32(i+1)}\n }\n\n prev[a] = i+1\n }\n\n return []int32{}\n}","func viralAdvertising(n int32) int32 {\n\n\toutput := make([]int32, n)\n\n\toutput[0] = (5 / 2) * 3\n\n\tvar i int32 = 1\n\n\tvar total int32 = 2\n\n\tfor ; i < n; i++ {\n\t\tcurrentTotal := output[i-1] / 2\n\t\toutput[i] = currentTotal * 3\n\t\ttotal += currentTotal\n\t}\n\n\treturn total\n}","func fnv1(x uint32, list string) uint32 {\n\tfor _, b := range list {\n\t\tx = x*16777619 ^ uint32(b)\n\t}\n\treturn x\n}","func increment(b []byte) {\n\tfor i := range b {\n\t\tb[i]++\n\t\tif b[i] != 0 {\n\t\t\treturn\n\t\t}\n\t}\n}","func increment(b []byte) {\n\tfor i := range b {\n\t\tb[i]++\n\t\tif b[i] != 0 {\n\t\t\treturn\n\t\t}\n\t}\n}","func incSeq(seq *[24]byte) {\n\tn := uint32(1)\n\tfor i := 0; i < 8; i++ {\n\t\tn += uint32(seq[i])\n\t\tseq[i] = byte(n)\n\t\tn >>= 8\n\t}\n}","func init() {\n\tfor i := range pc {\n\t\tpc[i] = pc[i/2] + byte(i&1)\n\t}\n}","func main() {\n\t// input := []int{1, 2, 2, 1, 1, 3}\n\t// input := []int{1, 2}\n\tinput := []int{-3, 0, 1, -3, 1, 1, 1, -3, 10, 0}\n\toutput := uniqueOccurrences(input)\n\tfmt.Println(output)\n}","func countTrailingZeroes(i int, word int32) int {\n\ttrace_util_0.Count(_mydecimal_00000, 28)\n\ttrailing := 0\n\tfor word%powers10[i] == 0 {\n\t\ttrace_util_0.Count(_mydecimal_00000, 30)\n\t\ti++\n\t\ttrailing++\n\t}\n\ttrace_util_0.Count(_mydecimal_00000, 29)\n\treturn trailing\n}","func countDuplicates(s []byte) int {\n\tbytes := make(map[byte]int)\n\tfor _, b := range s {\n\t\tif _, ok := bytes[b]; ok != true {\n\t\t\tbytes[b] = 1\n\t\t} else {\n\t\t\tbytes[b]++\n\t\t}\n\t}\n\tnum := 0\n\tfor _, v := range bytes {\n\t\tif v > 1 {\n\t\t\tnum += v - 1\n\t\t}\n\t}\n\treturn num\n}","func Test_BitTwiddle(t *testing.T) {\n\tvar b byte\n\tfor i:=0; i<512; i++ {\n\t\tvar bool1 bool = ((b >> 7) == 1)\n\t\tvar bool2 bool = ((b & 0x80) == 0x80)\n\t\tif bool1 != bool2 {\n\t\t\tt.Fatal()\n\t\t}\n\t\tb++\n\t}\n}","func leadingDrawdownSequence(returns []Percent) ([]GrowthMultiplier, bool) {\n\tend := -1\n\tcumulativeReturns := cumulativeList(returns)[1:]\n\tfor i, value := range cumulativeReturns {\n\t\tif value >= 1 {\n\t\t\tend = i\n\t\t\tbreak\n\t\t}\n\t}\n\tif end == -1 {\n\t\treturn cumulativeReturns, false\n\t}\n\treturn cumulativeReturns[0:end], true\n}","func LeadingZeros(x uint) int { return int(benchmarks.SizeOfUintInBits) - Len(x) }","func strobogrammatic(numCount int) []string {\n\tsbgNumbers := []int{1, 6, 8, 9, 0}\n\tn := numCount % 2\n\n\tvar numList []string\n\tvar f func(str string)\n\tf = func(str string) {\n\t\tif len(str) == numCount {\n\t\t\tnumList = append(numList, str)\n\t\t\treturn\n\t\t}\n\t\tfor _, x := range sbgNumbers {\n\t\t\ty := strconv.Itoa(x)\n\t\t\tif str == \"\" && n > 0 {\n\t\t\t\tif x == 6 || x == 9 {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tf(y)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif len(str) == numCount-2 && x == 0 {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tz := y\n\t\t\tif x == 6 {\n\t\t\t\tz = \"9\"\n\t\t\t}\n\t\t\tif x == 9 {\n\t\t\t\tz = \"6\"\n\t\t\t}\n\t\t\tf(y + str + z)\n\t\t}\n\t}\n\tf(\"\")\n\n\treturn numList\n}","func multiples(of []int, below int)[]int {\n\t// Using a hash as a poor man's set\n\tvalues := make(map[int]bool)\n\tfor _, num := range of {\n\t\tfor i := num; i < below; i += num {\n\t\t\tvalues[i] = true\n\t\t}\n\t}\n\tresults := make([]int, len(values))\n\tvar i int = 0\n\tfor n, _ := range values {\n\t\tresults[i] = n\n\t\ti++\n\t}\n\treturn results\n}","func Day8Part1(input []string) (string, error) {\n\n\timData := input[0]\n\timWidth, imHeight := 25, 6\n\n\tlayers := generateLayers(imData, imWidth, imHeight)\n\n\tvar layerWithFewestZeros [][]int\n\tfewestZeros := imWidth * imHeight\n\tfor _, layer := range layers {\n\n\t\tzeros := 0\n\t\tfor y := 0; y < len(layer); y++ {\n\t\t\tfor x := 0; x < len(layer[y]); x++ {\n\t\t\t\tif layer[y][x] == 0 {\n\t\t\t\t\tzeros++\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif zeros < fewestZeros {\n\t\t\tfewestZeros = zeros\n\t\t\tlayerWithFewestZeros = layer\n\t\t}\n\t}\n\n\tones, twos := 0, 0\n\tfor y := 0; y < len(layerWithFewestZeros); y++ {\n\t\tfor x := 0; x < len(layerWithFewestZeros[y]); x++ {\n\t\t\tswitch layerWithFewestZeros[y][x] {\n\t\t\tcase 1:\n\t\t\t\tones++\n\t\t\tcase 2:\n\t\t\t\ttwos++\n\t\t\t}\n\t\t}\n\t}\n\n\treturn fmt.Sprintf(\"%d\", ones*twos), nil\n}","func Test_BitTwiddle(t *testing.T) {\n\tvar b byte\n\tfor i := 0; i < 512; i++ {\n\t\tvar bool1 bool = ((b >> 7) == 1)\n\t\tvar bool2 bool = ((b & 0x80) == 0x80)\n\t\tif bool1 != bool2 {\n\t\t\tt.Fatal()\n\t\t}\n\t\tb++\n\t}\n}","func trailingZeroes(n int) int {\n\tif n < 5 {\n\t\treturn 0\n\t}\n\tfives := n / 5\n\n\treturn fives + trailingZeroes(n/5)\n}","func countDistinctBinStrings(n uint) uint {\n\tif n > 32 {\n\t\treturn 0\n\t}\n\tcount := uint(0)\n\tfor num := (1 << n) - 1; num >= 0; num-- {\n\t\tif hasNoConsecutive1s(num) {\n\t\t\tcount++\n\t\t}\n\t}\n\treturn count\n}","func Separate_0_1_2(in []int) (zeros, ones, twos int) {\n\n\tfor _, val := range in {\n\t\tif val == 0 {\n\t\t\tzeros++\n\t\t} else if val == 1 {\n\t\t\tones++\n\t\t} else {\n\t\t\ttwos++\n\t\t}\n\t}\n\treturn zeros, ones, twos\n}","func count_X(x, y, z byte) int {\n\tcount := 0;\n\t// 'x' = 120\n\tif ( x == 120) {\n\t\tcount = count + 1\n\t}\n\tif ( y == 120) {\n\t\tcount = count + 1\n\t}\n\tif ( z == 120) {\n\t\tcount = count + 1\n\t}\n\treturn count\n}","func row(k int) int { return k % 4 }","func n926(S string) int {\n\tright := make([]int, len(S)+1)\n\tfor i := len(S) - 1; i >= 0; i-- {\n\t\tright[i] = right[i+1]\n\t\tif S[i] == '0' {\n\t\t\tright[i]++\n\t\t}\n\t}\n\tans := len(S)\n\tone_count := 0\n\tfor i, c := range S {\n\t\tif right[i]+one_count < ans {\n\t\t\tans = right[i] + one_count\n\t\t}\n\t\tif c == '1' {\n\t\t\tone_count++\n\t\t}\n\t}\n\tif one_count < ans {\n\t\treturn one_count // change all 1s to 0s\n\t} else {\n\t\treturn ans\n\t}\n}","func minIncrementForUnique(A []int) int {\n\tarr := [80000]int{}\n\tfor _, v := range A {\n\t\tarr[v]++\n\t}\n\n\tvar (\n\t\tans int\n\t\ttoken int\n\t)\n\tfor i := 0; i < 80000; i++ {\n\t\tif arr[i] > 1 {\n\t\t\ttoken += arr[i] - 1\n\t\t\tans -= i * (arr[i] - 1)\n\t\t} else if token > 0 && arr[i] == 0 {\n\t\t\ttoken--\n\t\t\tans += i\n\t\t}\n\t}\n\n\treturn ans\n}","func repeatedString(s string, n int64) int64 {\n l := float64(len(s))\n baseA := int64(0)\n for _, letter := range s {\n if letter == 'a' {\n baseA++\n }\n }\n incompleteRepeat := math.Floor(float64(n)/l)\n incompleteLength := incompleteRepeat * l\n\n\n reminder := n - int64(incompleteLength)\n\n reminderA := int64(0)\n for index := int64(0); index < reminder; index++ {\n if s[index] == 'a' {\n reminderA++\n }\n }\n\n return (baseA * int64(incompleteRepeat)) + reminderA\n}","func OnesCount8(x uint8) int {\n\tx = x - ((x >> 1) & 0x55)\n\tx = (x & 0x33) + ((x >> 2) & 0x33)\n\tx = (x + (x >> 4)) & 0x0f\n\treturn int(x)\n}","func countingValleys(n int32, s string) int32 {\n depth := 0\n valley := 0\n for i := 0; int32(i) < n; i++ {\n if s[i] == 'U' {\n depth++\n }\n if s[i] == 'D' {\n depth--\n }\n\n if depth == 0 && s[i] == 'U' {\n valley++\n }\n }\n return int32(valley)\n}","func duplicateZeros(arr []int) {\n\tfor i := 0; i < len(arr); i++ {\n\t\tif arr[i] == 0 && i < len(arr)-1 {\n\t\t\tfor j := len(arr) - 1; j > i+1; j-- {\n\t\t\t\tarr[j] = arr[j-1]\n\t\t\t}\n\t\t\tarr[i+1] = 0\n\t\t\ti++\n\t\t}\n\t}\n}","func duplicateZeros(arr []int) {\n\tif len(arr) <= 1 {\n\t\treturn\n\t}\n\t//j:=len(arr)-1\n\tfor i := 0; i < len(arr); i++ {\n\t\tif arr[i] == 0 {\n\t\t\tfor j := len(arr) - 1; j != i; j-- {\n\t\t\t\tarr[j] = arr[j-1]\n\t\t\t}\n\t\t\ti++\n\t\t}\n\t}\n}","func main() {\n\tch := make(chan int)\n\tgo func() {\n\t\tvar c1 int;\n\t\tvar c2 int;\n\t\tvar c3 int;\n\t\tfor {\n\t\t\tc1 = <- ch;\n\t\t\tc2 = <- ch;\n\t\t\tc3 = <- ch;\n\t\t\tprint(c1);\n\t\t\tprint(c2);\n\t\t\tprint(c3);\n\t\t}\n\t}()\n\tvar cnt int;\n\tcnt = 0;\n\tfor {\n\t\tch <- cnt;\n\t\tif cnt == 8 { cnt = 0 } else { cnt = cnt + 1 };\n\t}\n}","func counting_bits(number int) []int {\n\tonesPositions := []int{}\n\tposition := 0\n\tfor number > 0 {\n\t\tif is1 := number & 1; is1 == 1 {\n\t\t\tonesPositions = append(onesPositions, position)\n\t\t}\n\t\tnumber = number >> 1\n\t\tposition++\n\t}\n\tresult := append([]int{len(onesPositions)}, onesPositions...)\n\treturn result\n}","func main() {\n\tvar a [101]int\n\t//j is the trip\n\tfor j := 1; j <= 100; j++ {\n\t\t//k is the switch\n\t\tfor k := 1; k <= 100; k++ {\n\t\t\tif k%j == 0 {\n\t\t\t\ta[k]++\n\t\t\t}\n\t\t}\n\t}\n\n\tfor i := 1; i <= 100; i++ {\n\t\tif a[i]%2 == 1 {\n\t\t\tfmt.Printf(\"switch %v = nyala, dipencet %v kali\\n\", i, a[i])\n\t\t}\n\t}\n\n}","func isLeadingNumZeroes(hash []byte) bool {\n\tif numLeadingZeroes == 0 {\n\t\treturn true\n\t} else {\n\t\ti := 0\n\t\tnumZeroes := numLeadingZeroes\n\t\tfor {\n\t\t\t// numZeroes <= 8, byte at hash[i] will determine validity\n\t\t\tif numZeroes-8 <= 0 {\n\t\t\t\tbreak\n\t\t\t} else {\n\t\t\t\t// numZeroes is greater than 8, byte at hash[i] must be zero\n\t\t\t\tif hash[i] != 0 {\n\t\t\t\t\treturn false\n\t\t\t\t} else {\n\t\t\t\t\ti++\n\t\t\t\t\tnumZeroes -= 8\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// returns true if byte at hash[i] has the the minimum number of leading zeroes\n\t\t// if numZeroes is 8: hash[i] < 2^(8-8) == hash[1] < 1 == hash[i] must be (0000 0000)b.\n\t\t// if numZeroes is 1: hash[i] < 2^(8-1) == hash[1] < (1000 0000)b == hash[i] <= (0111 1111)b\n\t\treturn float64(hash[i]) < math.Pow(2, float64(8-numZeroes))\n\t}\n}","func main() {\n\ttrailingZeroes(125)\n}","func TestZeros(t *testing.T) {\n\tvect, err := os.Open(\"randvect.txt\")\n\tif err != nil {\n\t\tt.Error(\"could not find text vector file\")\n\t}\n\tdefer vect.Close()\n\tscanner := bufio.NewScanner(vect)\n\tscanner.Scan()\n\n\tvar rng ISAAC\n\trng.randInit(true)\n\n\tvar buf bytes.Buffer\n\tfor i := 0; i < 2; i++ {\n\t\trng.isaac()\n\t\tfor j := 0; j < 256; j++ {\n\t\t\tbuf.WriteString(fmt.Sprintf(\"%.8x\", rng.randrsl[j]))\n\t\t\tif (j & 7) == 7 {\n\t\t\t\tvar output = buf.String()\n\t\t\t\tif scanner.Text() == output {\n\t\t\t\t\tscanner.Scan()\n\t\t\t\t\tbuf.Reset()\n\t\t\t\t} else {\n\t\t\t\t\tfmt.Printf(\"o: \" + output + \"\\n\" + \"v: \" + scanner.Text() + \"\\n\")\n\t\t\t\t\tt.Fail()\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}","func findOnes(arr []string) []string {\n\tvar allPoss []string\n\tfor _, item := range arr {\n\t\tif strings.Contains(item, \"1\") {\n\t\t\tvar possibilities []string\n\t\t\tpossibilities = replaceWithFours(item, 0, possibilities)\n\t\t\tfor _, newPoss := range possibilities {\n\t\t\t\tallPoss = append(allPoss, newPoss)\n\t\t\t}\n\t\t}\n\t\tallPoss = append(allPoss, item)\n\t}\n\treturn allPoss\n}","func makeNext(pattern string) ([]int, error) {\n\t// sanity check\n\tlength := len(pattern)\n\tif length == 0 {\n\t\treturn nil, errors.New(\"'pattern' must contain at least one character\")\n\t}\n\tif length == 1 {\n\t\treturn []int{-1}, nil\n\t}\n\tnext := make([]int, length)\n\tnext[0], next[1] = -1, 0\n\n\tpos, count := 2, 0\n\tfor pos < length {\n\t\tif pattern[pos-1] == pattern[count] {\n\t\t\tcount++\n\t\t\tnext[pos] = count\n\t\t\tpos++\n\t\t} else {\n\t\t\tif count > 0 {\n\t\t\t\tcount = next[count]\n\t\t\t} else {\n\t\t\t\tnext[pos] = 0\n\t\t\t\tpos++\n\t\t\t}\n\t\t}\n\t}\n\treturn next, nil\n}","func generatePRData(l int) []byte {\n\tres := make([]byte, l)\n\tseed := uint64(1)\n\tfor i := 0; i < l; i++ {\n\t\tseed = seed * 48271 % 2147483647\n\t\tres[i] = byte(seed)\n\t}\n\treturn res\n}","func leadingZeros(x uint32) (n int) {\n\tif x >= 1<<16 {\n\t\tx >>= 16\n\t\tn = 16\n\t}\n\tif x >= 1<<8 {\n\t\tx >>= 8\n\t\tn += 8\n\t}\n\tn += int(len8tab[x])\n\treturn 32 - n\n}","func main() {\n\ttotal := int64(0)\n\tvectors := ways(10, top, 3)\n\tfor _, vector := range vectors {\n\t\ttotal += distribute(vector)\n\t}\n\n\tfmt.Println(\"172/ How many 18-digit numbers n (without leading zeros) are there such that no digit occurs more than three times in n?\")\n\tfmt.Println(total)\n}","func duplicateZeros(arr []int) {\n\tfor i := 0; i < len(arr); i++ {\n\t\tif arr[i] == 0 {\n\t\t\tfor j := len(arr) - 1; j > i; j-- {\n\t\t\t\tarr[j] = arr[j-1]\n\t\t\t}\n\t\t\ti++\n\t\t}\n\t}\n}","func canPlaceFlowers(flowerbed []int, n int) bool {\n\tif n == 0 {\n\t\treturn true\n\t}\n\t// 很容易分析得知连续三个零可以种一朵花\n\t// 为了方便处理边界情况，可以在两边补 0，假设为没种花的情况\n\tflowerbed = append([]int{0}, flowerbed...)\n\tflowerbed = append(flowerbed, 0)\n\t// 从 1 开始遍历，遍历到倒数第二位\n\tfor i := 1; i < len(flowerbed)-1; i++ {\n\t\t// 连续三个 0\n\t\tif flowerbed[i] == 0 && flowerbed[i-1] == 0 && flowerbed[i+1] == 0 {\n\t\t\tflowerbed[i] = 1\n\t\t\tn--\n\t\t}\n\t\tif n < 1 {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}","func jumpingOnClouds(c []int32) int32 {\n\tvar jumps int32\n\tfor i := 0; i < len(c)-1; i++ {\n\t\tjumps++\n\t\tif i+2 < len(c) && c[i+2] == 0 {\n\t\t\ti++\n\t\t}\n\t}\n\treturn jumps\n}","func disturbs(candidate []int) []int {\r\n\tnew_candidate := make([]int, len(candidate))\r\n\tr := rand.Intn(len(candidate))\r\n\tcopy(new_candidate, candidate)\r\n\tif new_candidate[r] == 1 {\r\n\t\tnew_candidate[r] = 0\r\n\t} else {\r\n\t\tnew_candidate[r] = 1\r\n\t}\r\n\treturn new_candidate\r\n}","func main() {\n\tfmt.Println(numberOfOnes(15))\n}","func jumpingOnClouds(c []int32) int32 {\n // Write your code here\n const SAFE int32 = 0\n const AVOID int32 = 1\n var n int32 = int32(len(c))\n var count int32 = 0\n var cloud int32 = 0\n for {\n // can move to cloud c[cloud+2]? c[cloud+1]?\n // can c+2?\n // can c+1?\n if (cloud+2 < n) && (c[cloud+2] == SAFE) {\n cloud += 2\n count++\n } else if (cloud+1 < n) && (c[cloud+1] == SAFE) {\n cloud += 1\n count++\n } else {\n // cannot move\n break\n }\n }\n return count\n}","func vn(x []u8, y []u8, n int) u32 {\n\tif len(x) != n {\n\t\treturn 0\n\t}\n\tif len(y) != n {\n\t\treturn 0\n\t}\n\n\tvar d u32\n\tfor i := 0; i < n; i++ {\n\t\td |= u32(x[i]) ^ u32(y[i])\n\t}\n\treturn (1 & ((d - 1) >> 8)) - 1\n}","func g(i int) (n int) {\n\tfor n = 1; sf(n) != i; n++ {\n\t}\n\treturn\n}","func stateG1(s *scanner, c byte) int {\n\tif '0' <= c && c <= '9' {\n\t\ts.step = stateG1\n\t\treturn scanContinue\n\t}\n\treturn stateG0(s, c)\n}","func solve1(input string) string {\n\tlist := parseInput(input)\n\ti := 0\n\tn := 0\n\tfor i >= 0 && i < len(list) {\n\t\tj := list[i]\n\t\tlist[i]++\n\t\ti += j\n\t\tn++\n\t}\n\treturn fmt.Sprint(n)\n}","func bufferValue(index uint16, buffer []byte) (uint8, bool) {\n\ti := int(index)\n\ttotal := uint8(0)\n\tswitch buffer[i] {\n\tcase '0':\n\tcase '1':\n\t\ttotal += 16 * 1\n\tcase '2':\n\t\ttotal += 16 * 2\n\tcase '3':\n\t\ttotal += 16 * 3\n\tcase '4':\n\t\ttotal += 16 * 4\n\tcase '5':\n\t\ttotal += 16 * 5\n\tcase '6':\n\t\ttotal += 16 * 6\n\tcase '7':\n\t\ttotal += 16 * 7\n\tcase '8':\n\t\ttotal += 16 * 8\n\tcase '9':\n\t\ttotal += 16 * 9\n\tcase 'a', 'A':\n\t\ttotal += 16 * 10\n\tcase 'b', 'B':\n\t\ttotal += 16 * 11\n\tcase 'c', 'C':\n\t\ttotal += 16 * 12\n\tcase 'd', 'D':\n\t\ttotal += 16 * 13\n\tcase 'e', 'E':\n\t\ttotal += 16 * 14\n\tcase 'f', 'F':\n\t\ttotal += 16 * 15\n\tdefault:\n\t\tprint(\"!bad character in payload hi byte(number #\", i, \"):\", buffer[i], \"\\n\")\n\t\treturn 0xff, false\n\t}\n\tswitch buffer[i+1] {\n\tcase '0':\n\tcase '1':\n\t\ttotal++\n\tcase '2':\n\t\ttotal += 2\n\tcase '3':\n\t\ttotal += 3\n\tcase '4':\n\t\ttotal += 4\n\tcase '5':\n\t\ttotal += 5\n\tcase '6':\n\t\ttotal += 6\n\tcase '7':\n\t\ttotal += 7\n\tcase '8':\n\t\ttotal += 8\n\tcase '9':\n\t\ttotal += 9\n\tcase 'a', 'A':\n\t\ttotal += 10\n\tcase 'b', 'B':\n\t\ttotal += 11\n\tcase 'c', 'C':\n\t\ttotal += 12\n\tcase 'd', 'D':\n\t\ttotal += 13\n\tcase 'e', 'E':\n\t\ttotal += 14\n\tcase 'f', 'F':\n\t\ttotal += 15\n\tdefault:\n\t\tprint(\"!bad character in payload low byte (number #\", i+1, \"):\", buffer[i+1], \"\\n\")\n\t\treturn 0xff, false\n\t}\n\treturn total, true\n}","func bufferValue(index uint16, buffer []byte) (uint8, bool) {\n\ti := int(index)\n\ttotal := uint8(0)\n\tswitch buffer[i] {\n\tcase '0':\n\tcase '1':\n\t\ttotal += 16 * 1\n\tcase '2':\n\t\ttotal += 16 * 2\n\tcase '3':\n\t\ttotal += 16 * 3\n\tcase '4':\n\t\ttotal += 16 * 4\n\tcase '5':\n\t\ttotal += 16 * 5\n\tcase '6':\n\t\ttotal += 16 * 6\n\tcase '7':\n\t\ttotal += 16 * 7\n\tcase '8':\n\t\ttotal += 16 * 8\n\tcase '9':\n\t\ttotal += 16 * 9\n\tcase 'a', 'A':\n\t\ttotal += 16 * 10\n\tcase 'b', 'B':\n\t\ttotal += 16 * 11\n\tcase 'c', 'C':\n\t\ttotal += 16 * 12\n\tcase 'd', 'D':\n\t\ttotal += 16 * 13\n\tcase 'e', 'E':\n\t\ttotal += 16 * 14\n\tcase 'f', 'F':\n\t\ttotal += 16 * 15\n\tdefault:\n\t\tprint(\"!bad character in payload hi byte(number #\", i, \"):\", buffer[i], \"\\n\")\n\t\treturn 0xff, false\n\t}\n\tswitch buffer[i+1] {\n\tcase '0':\n\tcase '1':\n\t\ttotal++\n\tcase '2':\n\t\ttotal += 2\n\tcase '3':\n\t\ttotal += 3\n\tcase '4':\n\t\ttotal += 4\n\tcase '5':\n\t\ttotal += 5\n\tcase '6':\n\t\ttotal += 6\n\tcase '7':\n\t\ttotal += 7\n\tcase '8':\n\t\ttotal += 8\n\tcase '9':\n\t\ttotal += 9\n\tcase 'a', 'A':\n\t\ttotal += 10\n\tcase 'b', 'B':\n\t\ttotal += 11\n\tcase 'c', 'C':\n\t\ttotal += 12\n\tcase 'd', 'D':\n\t\ttotal += 13\n\tcase 'e', 'E':\n\t\ttotal += 14\n\tcase 'f', 'F':\n\t\ttotal += 15\n\tdefault:\n\t\tprint(\"!bad character in payload low byte (number #\", i+1, \"):\", buffer[i+1], \"\\n\")\n\t\treturn 0xff, false\n\t}\n\treturn total, true\n}","func singleNumber(nums []int) []int {\n\tbitmap := 0\n\tfor _, num := range nums {\n\t\tbitmap = bitmap ^ num\n\t}\n\tdiff, x := bitmap&(-bitmap), 0\n\tfor _, num := range nums {\n\t\tif num&diff != 0 {\n\t\t\tx = x ^ num\n\t\t}\n\t}\n\treturn []int{x, bitmap ^ x}\n}","func check(arr []int) bool {\n\tvar used [10]bool\n\tfor _, f := range field {\n\t\tfor i := 0; i <= 9; i++ {\n\t\t\tused[i] = false\n\t\t}\n\t\tfor i := 0; i < 9; i++ {\n\t\t\tif arr[f[i]-1] == 0 {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif used[arr[f[i]-1]] == true {\n\t\t\t\treturn false\n\t\t\t}\n\t\t\tused[arr[f[i]-1]] = true\n\t\t}\n\t}\n\treturn true\n}","func main() {\n\n\tinput := []int{1, 1, 0, 1, 1, 1}\n\n\tresult := solution(input)\n\tfmt.Println(result)\n\n}","func minimumBribes(q []int32) {\n\tbribes := 0\n\tqbribes := make([]int, len(q))\n\treverse := false\n\tfor i, j := 0, len(q)-1; i < len(q); {\n\t\tif !reverse {\n\t\t\tfor x := 0; x < len(q)-i-1; x++ {\n\t\t\t\tif q[x]-1 == int32(x) {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tif q[x] > q[x+1] {\n\t\t\t\t\tqbribes[q[x]-1]++\n\t\t\t\t\tif qbribes[q[x]-1] > 2 {\n\t\t\t\t\t\tfmt.Printf(\"Too chaotic\\n\")\n\t\t\t\t\t\treturn\n\t\t\t\t\t}\n\t\t\t\t\tq[x], q[x+1] = q[x+1], q[x]\n\t\t\t\t\tbribes++\n\t\t\t\t}\n\t\t\t}\n\t\t\ti++\n\t\t} else {\n\t\t\tfor x := j; x > i; x-- {\n\t\t\t\tif q[x]-1 == int32(x) {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tif q[x-1] > q[x] {\n\t\t\t\t\tqbribes[q[x-1]-1]++\n\t\t\t\t\tif qbribes[q[x-1]-1] > 2 {\n\t\t\t\t\t\tfmt.Printf(\"Too chaotic\\n\")\n\t\t\t\t\t\treturn\n\t\t\t\t\t}\n\t\t\t\t\tq[x-1], q[x] = q[x], q[x-1]\n\t\t\t\t\tbribes++\n\t\t\t\t}\n\t\t\t}\n\t\t\tj--\n\t\t}\n\t\treverse = !reverse\n\t}\n\tfmt.Printf(\"%d\\n\", bribes)\n}","func nums(v int) int {\n\tres := 0\n\tfor i := 0; i < v; i++ {\n\t\tif i%3 == 0 || i%5 == 0 {\n\t\t\tres += i\n\t\t}\n\t}\n\treturn res\n}","func findRun(a uint32) int {\n\treturn int(math.Log2(float64(a & -a)))\n}","func backtrack(pos int, total *int, fill []int, avail map[int]bool) {\n\tif pos == len(fill) {\n\t\t*total++\n\t\treturn\n\t}\n\tfor n, ok := range avail {\n\t\tif !ok || (n%(pos+1) != 0 && (pos+1)%n != 0) {\n\t\t\tcontinue // Not beautiful!\n\t\t}\n\t\tavail[n] = false\n\t\tfill[pos] = n\n\t\tbacktrack(pos+1, total, fill, avail)\n\t\tavail[n] = true\n\t}\n}","func numTilePossibilities(tiles string) int {\n\tvar m [26]int\n\tfor _, c := range tiles {\n\t\tm[c-'A']++\n\t}\n\tvar uniq []int\n\tfor _, v := range m {\n\t\tif v > 0 {\n\t\t\tuniq = append(uniq, v)\n\t\t}\n\t}\n\n\tr := 0\n\n\tfac := func(x int) int {\n\t\tv := 1\n\t\tfor x > 0 {\n\t\t\tv *= x\n\t\t\tx--\n\t\t}\n\t\treturn v\n\t}\n\n\tn := len(uniq)\n\tuses := make([]int, n)\n\tcalc := func() int {\n\t\ttotal := 0\n\t\tp := 1\n\t\tfor _, v := range uses {\n\t\t\ttotal += v\n\t\t\tp *= fac(v)\n\t\t}\n\t\tif total == 0 {\n\t\t\treturn 0\n\t\t}\n\n\t\treturn fac(total) / p\n\t}\n\n\tvar walk func(i int)\n\twalk = func(i int) {\n\t\tif i >= len(uniq) {\n\t\t\tr += calc()\n\t\t\treturn\n\t\t}\n\n\t\tfor j := 0; j <= uniq[i]; j++ {\n\t\t\tuses[i] = j\n\t\t\twalk(i + 1)\n\t\t}\n\t}\n\n\twalk(0)\n\treturn r\n}","func coverZeros(input [][]float64) int {\n\n\treturn 0\n}","func (this *SlicerH264) getOneNal1(data []byte) (nalData []byte, dataCur int) {\n\t//read start\n\tnalStart := 0\n\tnalEnd := 0\n\tfor {\n\t\tif nalStart+4 >= len(data) {\n\t\t\treturn\n\t\t}\n\t\tif data[nalStart] == 0x00 &&\n\t\t\tdata[nalStart+1] == 0x00 {\n\t\t\tif data[nalStart+2] == 0x01 {\n\t\t\t\tnalStart += 3\n\t\t\t\tbreak\n\t\t\t} else if data[nalStart+2] == 0x00 {\n\t\t\t\tif data[nalStart+3] == 0x01 {\n\t\t\t\t\tnalStart += 4\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tnalStart += 2\n\t\t\t}\n\t\t}\n\t\tnalStart++\n\t}\n\t//read end\n\tnalEnd = nalStart\n\tfor nalEnd < len(data) {\n\t\tif nalEnd+4 > len(data) {\n\t\t\tnalEnd = len(data)\n\t\t\tbreak\n\t\t}\n\t\tif data[nalEnd] == 0x00 &&\n\t\t\tdata[nalEnd+1] == 0x00 {\n\t\t\tif data[nalEnd+2] == 0x01 {\n\t\t\t\tbreak\n\t\t\t} else if data[nalEnd+2] == 0x00 && data[nalEnd+3] == 0x01 {\n\t\t\t\tbreak\n\t\t\t} else {\n\t\t\t\tnalEnd += 2\n\t\t\t}\n\n\t\t}\n\t\tnalEnd++\n\t}\n\t//nal data\n\tnalData = data[nalStart:nalEnd]\n\tdataCur = nalEnd\n\treturn\n}","func popcount(x uint64) int {\n\tx -= (x >> 1) & m1 //put count of each 2 bits into those 2 bits\n\tx = (x & m2) + ((x >> 2) & m2) //put count of each 4 bits into those 4 bits\n\tx = (x + (x >> 4)) & m4 //put count of each 8 bits into those 8 bits\n\treturn int((x * h01) >> 56) //returns left 8 bits of x + (x<<8) + (x<<16) + (x<<24) + ...\n}","func emptyhanded() int {\n\tfor i := 0; i < 26; i++ {\n\t\tif iven[i] != 0 {\n\t\t\tif i != c[WIELD] {\n\t\t\t\tif i != c[WEAR] {\n\t\t\t\t\tif i != c[SHIELD] {\n\t\t\t\t\t\treturn 0\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn 1\n}","func (s *Scratch) readNCount() error {\n\tvar (\n\t\tcharnum uint16\n\t\tprevious0 bool\n\t\tb = &s.br\n\t)\n\tiend := b.remain()\n\tif iend < 4 {\n\t\treturn errors.New(\"input too small\")\n\t}\n\tbitStream := b.Uint32()\n\tnbBits := uint((bitStream & 0xF) + minTablelog) // extract tableLog\n\tif nbBits > tablelogAbsoluteMax {\n\t\treturn errors.New(\"tableLog too large\")\n\t}\n\tbitStream >>= 4\n\tbitCount := uint(4)\n\n\ts.actualTableLog = uint8(nbBits)\n\tremaining := int32((1 << nbBits) + 1)\n\tthreshold := int32(1 << nbBits)\n\tgotTotal := int32(0)\n\tnbBits++\n\n\tfor remaining > 1 {\n\t\tif previous0 {\n\t\t\tn0 := charnum\n\t\t\tfor (bitStream & 0xFFFF) == 0xFFFF {\n\t\t\t\tn0 += 24\n\t\t\t\tif b.off < iend-5 {\n\t\t\t\t\tb.advance(2)\n\t\t\t\t\tbitStream = b.Uint32() >> bitCount\n\t\t\t\t} else {\n\t\t\t\t\tbitStream >>= 16\n\t\t\t\t\tbitCount += 16\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (bitStream & 3) == 3 {\n\t\t\t\tn0 += 3\n\t\t\t\tbitStream >>= 2\n\t\t\t\tbitCount += 2\n\t\t\t}\n\t\t\tn0 += uint16(bitStream & 3)\n\t\t\tbitCount += 2\n\t\t\tif n0 > maxSymbolValue {\n\t\t\t\treturn errors.New(\"maxSymbolValue too small\")\n\t\t\t}\n\t\t\tfor charnum < n0 {\n\t\t\t\ts.norm[charnum&0xff] = 0\n\t\t\t\tcharnum++\n\t\t\t}\n\n\t\t\tif b.off <= iend-7 || b.off+int(bitCount>>3) <= iend-4 {\n\t\t\t\tb.advance(bitCount >> 3)\n\t\t\t\tbitCount &= 7\n\t\t\t\tbitStream = b.Uint32() >> bitCount\n\t\t\t} else {\n\t\t\t\tbitStream >>= 2\n\t\t\t}\n\t\t}\n\n\t\tmax := (2*(threshold) - 1) - (remaining)\n\t\tvar count int32\n\n\t\tif (int32(bitStream) & (threshold - 1)) < max {\n\t\t\tcount = int32(bitStream) & (threshold - 1)\n\t\t\tbitCount += nbBits - 1\n\t\t} else {\n\t\t\tcount = int32(bitStream) & (2*threshold - 1)\n\t\t\tif count >= threshold {\n\t\t\t\tcount -= max\n\t\t\t}\n\t\t\tbitCount += nbBits\n\t\t}\n\n\t\tcount-- // extra accuracy\n\t\tif count < 0 {\n\t\t\t// -1 means +1\n\t\t\tremaining += count\n\t\t\tgotTotal -= count\n\t\t} else {\n\t\t\tremaining -= count\n\t\t\tgotTotal += count\n\t\t}\n\t\ts.norm[charnum&0xff] = int16(count)\n\t\tcharnum++\n\t\tprevious0 = count == 0\n\t\tfor remaining < threshold {\n\t\t\tnbBits--\n\t\t\tthreshold >>= 1\n\t\t}\n\t\tif b.off <= iend-7 || b.off+int(bitCount>>3) <= iend-4 {\n\t\t\tb.advance(bitCount >> 3)\n\t\t\tbitCount &= 7\n\t\t} else {\n\t\t\tbitCount -= (uint)(8 * (len(b.b) - 4 - b.off))\n\t\t\tb.off = len(b.b) - 4\n\t\t}\n\t\tbitStream = b.Uint32() >> (bitCount & 31)\n\t}\n\ts.symbolLen = charnum\n\n\tif s.symbolLen <= 1 {\n\t\treturn fmt.Errorf(\"symbolLen (%d) too small\", s.symbolLen)\n\t}\n\tif s.symbolLen > maxSymbolValue+1 {\n\t\treturn fmt.Errorf(\"symbolLen (%d) too big\", s.symbolLen)\n\t}\n\tif remaining != 1 {\n\t\treturn fmt.Errorf(\"corruption detected (remaining %d != 1)\", remaining)\n\t}\n\tif bitCount > 32 {\n\t\treturn fmt.Errorf(\"corruption detected (bitCount %d > 32)\", bitCount)\n\t}\n\tif gotTotal != 1<<s.actualTableLog {\n\t\treturn fmt.Errorf(\"corruption detected (total %d != %d)\", gotTotal, 1<<s.actualTableLog)\n\t}\n\tb.advance((bitCount + 7) >> 3)\n\treturn nil\n}","func cyclicPattern(length int) []byte {\n data := make([]byte, length + (3 - length % 3))\n\n // generate cyclic pattern\n x, y, z := byte(65), byte(97), byte(48)\n for i := 0; i < length; i += 3 {\n data[i] = x\n data[i + 1] = y\n data[i + 2] = z\n\n // get the next cycle\n x, y, z = nextCycle(x, y, z)\n }\n\n // since data is a multiple of 3, cut it to length\n return data[:length]\n}","func nonZeroToAllOnes(x uint32) uint32 {\n\treturn ((x - 1) >> 31) - 1\n}","func nonZeroToAllOnes(x uint32) uint32 {\n\treturn ((x - 1) >> 31) - 1\n}","func nextSystemRepeat(s *system, cmp *system) {\n\ts.advance()\n\txRepeat := int64(0)\n\tyRepeat := int64(0)\n\tzRepeat := int64(0)\n\tfor xRepeat == 0 || yRepeat == 0 || zRepeat == 0 {\n\t\ts.advance()\n\t\tif xRepeat == 0 && checkSystemDimension(s, cmp, func(m *moon) int { return m.p.x }, func(m *moon) int { return m.v.x }) {\n\t\t\txRepeat = s.timeStep\n\t\t}\n\t\tif yRepeat == 0 && checkSystemDimension(s, cmp, func(m *moon) int { return m.p.y }, func(m *moon) int { return m.v.y }) {\n\t\t\tyRepeat = s.timeStep\n\t\t}\n\t\tif zRepeat == 0 && checkSystemDimension(s, cmp, func(m *moon) int { return m.p.z }, func(m *moon) int { return m.v.z }) {\n\t\t\tzRepeat = s.timeStep\n\t\t}\n\t}\n\tfmt.Printf(\"Repeats at x: %d, y: %d, z: %d (lcm: %d)\\n\", xRepeat, yRepeat, zRepeat, lcm(xRepeat, yRepeat, zRepeat))\n\n}","func countBattleships(board [][]byte) int {\n\t// O(1) extra space\n\tcount1, single1 := 0, 0\n\tfor i := 0; i < len(board); i++ {\n\t\tgood, bad := 0, 0\n\t\tfor j := 0; j <= len(board[0]); j++ {\n\t\t\tif j == len(board[0]) || board[i][j] == '.' {\n\t\t\t\tif good > 0 && bad == 0 {\n\t\t\t\t\tcount1++\n\t\t\t\t\tif good == 1 {\n\t\t\t\t\t\tsingle1++\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tgood, bad = 0, 0\n\t\t\t}\n\t\t\tif j < len(board[0]) && board[i][j] == 'X' {\n\t\t\t\tif (i-1 >= 0 && board[i-1][j] == 'X') || (i+1 < len(board) && board[i+1][j] == 'X') {\n\t\t\t\t\tbad++\n\t\t\t\t} else {\n\t\t\t\t\tgood++\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcount2, single2 := 0, 0\n\tfor j := 0; j < len(board[0]); j++ {\n\t\tgood, bad := 0, 0\n\t\tfor i := 0; i <= len(board); i++ {\n\t\t\tif i == len(board) || board[i][j] == '.' {\n\t\t\t\tif good > 0 && bad == 0 {\n\t\t\t\t\tcount2++\n\t\t\t\t\tif good == 1 {\n\t\t\t\t\t\tsingle2++\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tgood, bad = 0, 0\n\t\t\t}\n\t\t\tif i < len(board) && board[i][j] == 'X' {\n\t\t\t\tif (j-1 >= 0 && board[i][j-1] == 'X') || (j+1 < len(board[0]) && board[i][j+1] == 'X') {\n\t\t\t\t\tbad++\n\t\t\t\t} else {\n\t\t\t\t\tgood++\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn count1 + count2 - single1\n}","func kerDIF8(a []fr.Element, twiddles [][]fr.Element, stage int) {\n\n\tfr.Butterfly(&a[0], &a[4])\n\tfr.Butterfly(&a[1], &a[5])\n\tfr.Butterfly(&a[2], &a[6])\n\tfr.Butterfly(&a[3], &a[7])\n\ta[5].Mul(&a[5], &twiddles[stage+0][1])\n\ta[6].Mul(&a[6], &twiddles[stage+0][2])\n\ta[7].Mul(&a[7], &twiddles[stage+0][3])\n\tfr.Butterfly(&a[0], &a[2])\n\tfr.Butterfly(&a[1], &a[3])\n\tfr.Butterfly(&a[4], &a[6])\n\tfr.Butterfly(&a[5], &a[7])\n\ta[3].Mul(&a[3], &twiddles[stage+1][1])\n\ta[7].Mul(&a[7], &twiddles[stage+1][1])\n\tfr.Butterfly(&a[0], &a[1])\n\tfr.Butterfly(&a[2], &a[3])\n\tfr.Butterfly(&a[4], &a[5])\n\tfr.Butterfly(&a[6], &a[7])\n}"],"string":"[\n \"func createSet(input [9]int8) int16 {\\n\\tvar used int16 = 0\\n\\tfor i := 0; i < 9; i++ {\\n\\t\\tused += (1 << uint(input[i] - 1))\\n\\t}\\n\\treturn used;\\n}\",\n \"func duplicateZeros1(arr []int) {\\n\\tvar count int\\n\\tn := len(arr)\\n\\tfor _, v := range arr {\\n\\t\\tif v == 0 {\\n\\t\\t\\tcount++\\n\\t\\t}\\n\\t}\\n\\n\\tfor i := n - 1; i >= 0; i-- {\\n\\t\\tif i+count >= n {\\n\\t\\t\\tif arr[i] == 0 {\\n\\t\\t\\t\\tif i+count-1 < n {\\n\\t\\t\\t\\t\\tarr[i+count-1] = 0\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcount--\\n\\t\\t\\t}\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tif count != 0 {\\n\\t\\t\\tarr[i+count] = arr[i]\\n\\t\\t\\tif arr[i] == 0 {\\n\\t\\t\\t\\tarr[i+count-1] = 0\\n\\t\\t\\t\\tcount--\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func c1(n int) int { return n - WIDTH - 1 }\",\n \"func countInitialOccurrences(s []byte, x byte) int {\\n\\tfor i, c := range s {\\n\\t\\tif c != x {\\n\\t\\t\\treturn i\\n\\t\\t}\\n\\t}\\n\\treturn len(s)\\n}\",\n \"func rej(a []int16, buf []byte) int {\\n\\tctr, buflen, alen := 0, len(buf), len(a)\\n\\tfor pos := 0; pos+3 <= buflen && ctr < alen; pos += 3 {\\n\\t\\tval0 := (uint16(buf[pos]) | (uint16(buf[pos+1]) << 8)) & 0xfff\\n\\t\\tval1 := (uint16(buf[pos+1]>>4) | (uint16(buf[pos+2]) << 4)) & 0xfff\\n\\t\\tif val0 < uint16(q) {\\n\\t\\t\\ta[ctr] = int16(val0)\\n\\t\\t\\tctr++\\n\\t\\t}\\n\\t\\tif val1 < uint16(q) && ctr != alen {\\n\\t\\t\\ta[ctr] = int16(val1)\\n\\t\\t\\tctr++\\n\\t\\t}\\n\\t}\\n\\treturn ctr\\n}\",\n \"func duplicateZeros(n int) string {\\n\\tvar zero string\\n\\tfor i := 0; i < n; i++ {\\n\\t\\tzero += \\\"f0\\\"\\n\\t}\\n\\n\\treturn zero\\n}\",\n \"func slog(block uint32) uint16 {\\n\\tfor i := uint16(12); i <= 20; i++ {\\n\\t\\tif block == (1 << i) {\\n\\t\\t\\treturn i\\n\\t\\t}\\n\\t}\\n\\treturn 0\\n}\",\n \"func countLeadingZeroes(i int, word int32) int {\\n\\tleading := 0\\n\\tfor word < powers10[i] {\\n\\t\\ti--\\n\\t\\tleading++\\n\\t}\\n\\treturn leading\\n}\",\n \"func countLeadingZeroes(i int, word int32) int {\\n\\ttrace_util_0.Count(_mydecimal_00000, 25)\\n\\tleading := 0\\n\\tfor word < powers10[i] {\\n\\t\\ttrace_util_0.Count(_mydecimal_00000, 27)\\n\\t\\ti--\\n\\t\\tleading++\\n\\t}\\n\\ttrace_util_0.Count(_mydecimal_00000, 26)\\n\\treturn leading\\n}\",\n \"func TestDuplicateZeros(t *testing.T) {\\n\\tduplicateZeros1([]int{1, 0, 2, 3, 0, 4, 5, 0})\\n\\tduplicateZeros1([]int{1, 2, 3})\\n}\",\n \"func countAndSay(n int) string {\\n\\tif n <= 1{\\n\\t\\treturn \\\"1\\\"\\n\\t}\\n\\tvar last string = \\\"1\\\"\\n\\tfor i := 2;i <= n;i++{\\n\\t\\tslow := 0\\n\\t\\tfast := slow + 1\\n\\t\\t//var cur string\\n\\t\\tvar cur bytes.Buffer\\n\\t\\tl := len(last)\\n\\t\\tfor fast <= l{\\n\\t\\t\\tif fast < len(last) && last[slow] == last[fast]{\\n\\t\\t\\t\\tfast++\\n\\t\\t\\t}else{\\n\\t\\t\\t\\t//l := fast - slow\\n\\t\\t\\t\\t//cnt := strconv.Itoa(l)\\n\\t\\t\\t\\t//num := string(last[slow])\\n\\t\\t\\t\\t//cur += cnt + num\\n\\t\\t\\t\\tcur.WriteString(strconv.Itoa(fast - slow))\\n\\t\\t\\t\\tcur.WriteByte(last[slow])\\n\\t\\t\\t\\tslow = fast\\n\\t\\t\\t\\tfast++\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tlast = cur.String()\\n\\t\\tif i == n{\\n\\t\\t\\treturn last\\n\\t\\t}\\n\\t}\\n\\treturn last\\n}\",\n \"func duplicateZerosV1(arr []int) {\\n\\tvar buf []int\\n\\tfor i := 0; i < len(arr); i++ {\\n\\t\\tif arr[i] == 0 && i < len(arr)-1 {\\n\\t\\t\\tbuf = make([]int, len(arr)-i-1)\\n\\t\\t\\tcopy(buf, arr[i+1:i+len(buf)])\\n\\t\\t\\tarr[i+1] = 0\\n\\t\\t\\tfor j := 0; j < len(buf)-1; j++ {\\n\\t\\t\\t\\tarr[i+2+j] = buf[j]\\n\\t\\t\\t}\\n\\t\\t\\ti++\\n\\t\\t}\\n\\t}\\n}\",\n \"func increment(counter []byte) {\\n\\tfor i := len(counter) - 1; i >= 0; i-- {\\n\\t\\tcounter[i]++\\n\\t\\tif counter[i] != 0 {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n}\",\n \"func RepeatFasta(s []byte, count int) {\\n pos := 0\\n s2 := make([]byte, len(s)+WIDTH)\\n copy(s2, s)\\n copy(s2[len(s):], s)\\n for count > 0 {\\n line := min(WIDTH, count)\\n out.Write(s2[pos : pos+line])\\n out.WriteByte('\\\\n')\\n pos += line\\n if pos >= len(s) {\\n pos -= len(s)\\n }\\n count -= line\\n }\\n}\",\n \"func init() {\\n\\tval := make([]byte, 4)\\n\\tfor i := 0; i < 256; i++ {\\n\\t\\tfor j := 0; j < 4; j++ {\\n\\t\\t\\t// First base is the most significant digit.\\n\\t\\t\\tval[3-j] = Iton((i >> (2 * j)) & 3)\\n\\t\\t}\\n\\t\\tcopy(dnaFrom2bit[i][:], val)\\n\\t}\\n}\",\n \"func countingValleys(n int32, s string) int32 {\\n\\tstartAr := []int32{0}\\n\\tvar start int32\\n\\tvar valleyPoint int32 = 1\\n\\tfor _, elem := range s {\\n\\t\\tchar := string(elem)\\n\\t\\tcheckInt := true\\n\\t\\tcheckInt = math.Signbit(float64(start))\\n\\t\\tif char == \\\"D\\\" {\\n\\t\\t\\tstart = start - 1\\n\\t\\t} else {\\n\\t\\t\\tstart = start + 1\\n\\t\\t}\\n\\n\\t\\tif start == 0 {\\n\\t\\t\\tif checkInt == true {\\n\\t\\t\\t\\tvalleyPoint = valleyPoint + 1\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstartAr = append(startAr, start)\\n\\t}\\n\\tfmt.Println(startAr)\\n\\tvalley := valleyPoint - 1\\n\\treturn valley\\n}\",\n \"func countAndSay(n int) string {\\n\\tif n == 1 { // special case\\n\\t\\treturn \\\"1\\\"\\n\\t}\\n\\tpre, cur := \\\"\\\", \\\"1\\\"\\n\\thead, tail := 0, 0\\n\\n\\ttmp := cur[0]\\n\\tlength := len(cur)\\n\\n\\tfor i := 1; i < n; i++ { // 1 -> n -1\\n\\t\\tlength = len(cur) // reset length\\n\\t\\ttmp = cur[0] // reset tmp\\n\\t\\thead = 0 // reset head and tail 0 0\\n\\t\\tfor tail = 0; tail < length; tail++ {\\n\\t\\t\\tif cur[tail] == tmp { // find same as cache\\n\\t\\t\\t\\thead++\\n\\t\\t\\t} else { // not found add tmp and cache pre then mark head -> 1\\n\\t\\t\\t\\tpre = pre + strconv.Itoa(head) + string(tmp)\\n\\t\\t\\t\\ttmp = cur[tail]\\n\\t\\t\\t\\thead = 1\\n\\t\\t\\t}\\n\\n\\t\\t\\tif tail == length-1 { // special case length-1 cache pre\\n\\t\\t\\t\\tpre = pre + strconv.Itoa(head) + string(tmp)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcur = pre // cur now\\n\\t\\tpre = \\\"\\\" //reset\\n\\t}\\n\\treturn cur\\n}\",\n \"func emitRepeat(dst []byte, offset, length int) int {\\n\\t// Repeat offset, make length cheaper\\n\\tlength -= 4\\n\\tif length <= 4 {\\n\\t\\tdst[0] = uint8(length)<<2 | tagCopy1\\n\\t\\tdst[1] = 0\\n\\t\\treturn 2\\n\\t}\\n\\tif length < 8 && offset < 2048 {\\n\\t\\t// Encode WITH offset\\n\\t\\tdst[1] = uint8(offset)\\n\\t\\tdst[0] = uint8(offset>>8)<<5 | uint8(length)<<2 | tagCopy1\\n\\t\\treturn 2\\n\\t}\\n\\tif length < (1<<8)+4 {\\n\\t\\tlength -= 4\\n\\t\\tdst[2] = uint8(length)\\n\\t\\tdst[1] = 0\\n\\t\\tdst[0] = 5<<2 | tagCopy1\\n\\t\\treturn 3\\n\\t}\\n\\tif length < (1<<16)+(1<<8) {\\n\\t\\tlength -= 1 << 8\\n\\t\\tdst[3] = uint8(length >> 8)\\n\\t\\tdst[2] = uint8(length >> 0)\\n\\t\\tdst[1] = 0\\n\\t\\tdst[0] = 6<<2 | tagCopy1\\n\\t\\treturn 4\\n\\t}\\n\\tconst maxRepeat = (1 << 24) - 1\\n\\tlength -= 1 << 16\\n\\tleft := 0\\n\\tif length > maxRepeat {\\n\\t\\tleft = length - maxRepeat + 4\\n\\t\\tlength = maxRepeat - 4\\n\\t}\\n\\tdst[4] = uint8(length >> 16)\\n\\tdst[3] = uint8(length >> 8)\\n\\tdst[2] = uint8(length >> 0)\\n\\tdst[1] = 0\\n\\tdst[0] = 7<<2 | tagCopy1\\n\\tif left > 0 {\\n\\t\\treturn 5 + emitRepeat(dst[5:], offset, left)\\n\\t}\\n\\treturn 5\\n}\",\n \"func singleNumberA(nums []int) int {\\n result:=0\\n for _,data := range nums{\\n result^=data\\n }\\n return result\\n}\",\n \"func table(w string) []int {\\n\\tvar (\\n\\t\\tt []int = []int{-1}\\n\\t\\tk int\\n\\t)\\n\\tfor j := 1; j < len(w); j++ {\\n\\t\\tk = j - 1\\n\\t\\tfor w[0:k] != w[j-k:j] && k > 0 {\\n\\t\\t\\tk--\\n\\t\\t}\\n\\t\\tt = append(t, k)\\n\\t}\\n\\treturn t\\n}\",\n \"func ones(n int) []int {\\n\\ts := make([]int, n)\\n\\tfor i := range s {\\n\\t\\ts[i] = 1\\n\\t}\\n\\treturn s\\n}\",\n \"func findMaxSequenceOf1s(x int) int {\\n\\tmaxSequenceOf1s := 0\\n\\tcurrentSequenceOf1s := 0\\n\\t// Assume int has 32 bits.\\n\\tfor i := 0; i < 32; i++ {\\n\\t\\tmask := 1 << i\\n\\t\\tif x&mask > 0 {\\n\\t\\t\\tcurrentSequenceOf1s++\\n\\t\\t} else {\\n\\t\\t\\tmaxSequenceOf1s = ix.Max(maxSequenceOf1s, currentSequenceOf1s)\\n\\t\\t\\tcurrentSequenceOf1s = 0\\n\\t\\t}\\n\\t}\\n\\tmaxSequenceOf1s = ix.Max(maxSequenceOf1s, currentSequenceOf1s)\\n\\treturn maxSequenceOf1s\\n}\",\n \"func countTrailingZeroes(i int, word int32) int {\\n\\ttrailing := 0\\n\\tfor word%powers10[i] == 0 {\\n\\t\\ti++\\n\\t\\ttrailing++\\n\\t}\\n\\treturn trailing\\n}\",\n \"func get1N(indices *[]uint16, start, end int) []uint16 {\\n\\tif end > cap(*indices) {\\n\\t\\t*indices = make([]uint16, end)\\n\\t\\tfor i := range *indices {\\n\\t\\t\\t(*indices)[i] = uint16(i)\\n\\t\\t}\\n\\t}\\n\\treturn (*indices)[start:end]\\n}\",\n \"func steps(s []int) int {\\n\\tsteps := 0\\n\\n\\tfor pos := 0; pos >= 0 && pos < len(s); steps += 1 {\\n\\t\\tnewpos := pos + s[pos]\\n\\t\\tif s[pos] >= 3 {\\n\\t\\t\\ts[pos] -= 1\\n\\t\\t} else {\\n\\t\\t\\ts[pos] += 1\\n\\t\\t}\\n\\t\\tpos = newpos\\n\\t}\\n\\n\\treturn steps\\n}\",\n \"func Solution(N int) int {\\n result := 0\\n binaryRepresentation := strconv.FormatInt(int64(N), 2)\\n currentGap := 0\\n \\n for _,value := range binaryRepresentation{\\n //Converts the current rune to ASCII representation of the digit\\n val := int(value -'0')\\n if val == 1{\\n if currentGap > result{\\n result = currentGap\\n currentGap = 0\\n }\\n }else{\\n currentGap ++\\n }\\n }\\n \\n return result\\n}\",\n \"func LeadingZeros(x uint) int { return UintSize - Len(x) }\",\n \"func part1() {\\n\\ts := \\\"abc\\\"\\n\\tcount := 0\\n\\ti := 0\\n\\th := md5.New()\\n\\tbuffer := bytes.NewBuffer(make([]byte, 64))\\n\\n\\tfor count < 8 {\\n\\t\\tbuffer.Reset()\\n\\t\\tfmt.Fprintf(buffer, \\\"%s%d\\\", s, i)\\n\\n\\t\\th.Reset()\\n\\t\\th.Write(buffer.Bytes())\\n\\t\\tdigest := h.Sum(nil)\\n\\t\\tif digest[0] == 0 && digest[1] == 0 && digest[2] < 16 {\\n\\t\\t\\tfmt.Printf(\\\"%x\\\", digest[2])\\n\\t\\t\\tcount++\\n\\t\\t}\\n\\t\\ti++\\n\\t}\\n\\tfmt.Println()\\n}\",\n \"func bitVectorLetterAppearsOddNumberOfTimes(s string) uint32 {\\n\\tvar result uint32 = 0\\n\\n\\tfor _, r := range s {\\n\\t\\t// ignore non latin lowercase alphabet runes\\n\\t\\tif r < 'a' || r > 'z' {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\ti := r - 'a' // number of letter r in alphabet\\n\\t\\tresult ^= (1 << i) // toggle ith bit of v\\n\\t}\\n\\n\\treturn result\\n}\",\n \"func countingValleys(n int32, s string) int32 {\\n\\n l, v := 0, 0\\n s = strings.ToLower(s)\\n for _, r := range s {\\n\\n if r == 'u' {\\n if l < 0 && l+1 == 0 {\\n v++\\n }\\n l++\\n\\n } else {\\n l--\\n }\\n }\\n return int32(v)\\n}\",\n \"func icecreamParlor(m int32, arr []int32) []int32 {\\n prev := map[int32]int{};\\n for i, a := range arr {\\n if prev[m-a] != 0 {\\n return []int32{int32(prev[m-a]), int32(i+1)}\\n }\\n\\n prev[a] = i+1\\n }\\n\\n return []int32{}\\n}\",\n \"func viralAdvertising(n int32) int32 {\\n\\n\\toutput := make([]int32, n)\\n\\n\\toutput[0] = (5 / 2) * 3\\n\\n\\tvar i int32 = 1\\n\\n\\tvar total int32 = 2\\n\\n\\tfor ; i < n; i++ {\\n\\t\\tcurrentTotal := output[i-1] / 2\\n\\t\\toutput[i] = currentTotal * 3\\n\\t\\ttotal += currentTotal\\n\\t}\\n\\n\\treturn total\\n}\",\n \"func fnv1(x uint32, list string) uint32 {\\n\\tfor _, b := range list {\\n\\t\\tx = x*16777619 ^ uint32(b)\\n\\t}\\n\\treturn x\\n}\",\n \"func increment(b []byte) {\\n\\tfor i := range b {\\n\\t\\tb[i]++\\n\\t\\tif b[i] != 0 {\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}\\n}\",\n \"func increment(b []byte) {\\n\\tfor i := range b {\\n\\t\\tb[i]++\\n\\t\\tif b[i] != 0 {\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}\\n}\",\n \"func incSeq(seq *[24]byte) {\\n\\tn := uint32(1)\\n\\tfor i := 0; i < 8; i++ {\\n\\t\\tn += uint32(seq[i])\\n\\t\\tseq[i] = byte(n)\\n\\t\\tn >>= 8\\n\\t}\\n}\",\n \"func init() {\\n\\tfor i := range pc {\\n\\t\\tpc[i] = pc[i/2] + byte(i&1)\\n\\t}\\n}\",\n \"func main() {\\n\\t// input := []int{1, 2, 2, 1, 1, 3}\\n\\t// input := []int{1, 2}\\n\\tinput := []int{-3, 0, 1, -3, 1, 1, 1, -3, 10, 0}\\n\\toutput := uniqueOccurrences(input)\\n\\tfmt.Println(output)\\n}\",\n \"func countTrailingZeroes(i int, word int32) int {\\n\\ttrace_util_0.Count(_mydecimal_00000, 28)\\n\\ttrailing := 0\\n\\tfor word%powers10[i] == 0 {\\n\\t\\ttrace_util_0.Count(_mydecimal_00000, 30)\\n\\t\\ti++\\n\\t\\ttrailing++\\n\\t}\\n\\ttrace_util_0.Count(_mydecimal_00000, 29)\\n\\treturn trailing\\n}\",\n \"func countDuplicates(s []byte) int {\\n\\tbytes := make(map[byte]int)\\n\\tfor _, b := range s {\\n\\t\\tif _, ok := bytes[b]; ok != true {\\n\\t\\t\\tbytes[b] = 1\\n\\t\\t} else {\\n\\t\\t\\tbytes[b]++\\n\\t\\t}\\n\\t}\\n\\tnum := 0\\n\\tfor _, v := range bytes {\\n\\t\\tif v > 1 {\\n\\t\\t\\tnum += v - 1\\n\\t\\t}\\n\\t}\\n\\treturn num\\n}\",\n \"func Test_BitTwiddle(t *testing.T) {\\n\\tvar b byte\\n\\tfor i:=0; i<512; i++ {\\n\\t\\tvar bool1 bool = ((b >> 7) == 1)\\n\\t\\tvar bool2 bool = ((b & 0x80) == 0x80)\\n\\t\\tif bool1 != bool2 {\\n\\t\\t\\tt.Fatal()\\n\\t\\t}\\n\\t\\tb++\\n\\t}\\n}\",\n \"func leadingDrawdownSequence(returns []Percent) ([]GrowthMultiplier, bool) {\\n\\tend := -1\\n\\tcumulativeReturns := cumulativeList(returns)[1:]\\n\\tfor i, value := range cumulativeReturns {\\n\\t\\tif value >= 1 {\\n\\t\\t\\tend = i\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\tif end == -1 {\\n\\t\\treturn cumulativeReturns, false\\n\\t}\\n\\treturn cumulativeReturns[0:end], true\\n}\",\n \"func LeadingZeros(x uint) int { return int(benchmarks.SizeOfUintInBits) - Len(x) }\",\n \"func strobogrammatic(numCount int) []string {\\n\\tsbgNumbers := []int{1, 6, 8, 9, 0}\\n\\tn := numCount % 2\\n\\n\\tvar numList []string\\n\\tvar f func(str string)\\n\\tf = func(str string) {\\n\\t\\tif len(str) == numCount {\\n\\t\\t\\tnumList = append(numList, str)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tfor _, x := range sbgNumbers {\\n\\t\\t\\ty := strconv.Itoa(x)\\n\\t\\t\\tif str == \\\"\\\" && n > 0 {\\n\\t\\t\\t\\tif x == 6 || x == 9 {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tf(y)\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tif len(str) == numCount-2 && x == 0 {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tz := y\\n\\t\\t\\tif x == 6 {\\n\\t\\t\\t\\tz = \\\"9\\\"\\n\\t\\t\\t}\\n\\t\\t\\tif x == 9 {\\n\\t\\t\\t\\tz = \\\"6\\\"\\n\\t\\t\\t}\\n\\t\\t\\tf(y + str + z)\\n\\t\\t}\\n\\t}\\n\\tf(\\\"\\\")\\n\\n\\treturn numList\\n}\",\n \"func multiples(of []int, below int)[]int {\\n\\t// Using a hash as a poor man's set\\n\\tvalues := make(map[int]bool)\\n\\tfor _, num := range of {\\n\\t\\tfor i := num; i < below; i += num {\\n\\t\\t\\tvalues[i] = true\\n\\t\\t}\\n\\t}\\n\\tresults := make([]int, len(values))\\n\\tvar i int = 0\\n\\tfor n, _ := range values {\\n\\t\\tresults[i] = n\\n\\t\\ti++\\n\\t}\\n\\treturn results\\n}\",\n \"func Day8Part1(input []string) (string, error) {\\n\\n\\timData := input[0]\\n\\timWidth, imHeight := 25, 6\\n\\n\\tlayers := generateLayers(imData, imWidth, imHeight)\\n\\n\\tvar layerWithFewestZeros [][]int\\n\\tfewestZeros := imWidth * imHeight\\n\\tfor _, layer := range layers {\\n\\n\\t\\tzeros := 0\\n\\t\\tfor y := 0; y < len(layer); y++ {\\n\\t\\t\\tfor x := 0; x < len(layer[y]); x++ {\\n\\t\\t\\t\\tif layer[y][x] == 0 {\\n\\t\\t\\t\\t\\tzeros++\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif zeros < fewestZeros {\\n\\t\\t\\tfewestZeros = zeros\\n\\t\\t\\tlayerWithFewestZeros = layer\\n\\t\\t}\\n\\t}\\n\\n\\tones, twos := 0, 0\\n\\tfor y := 0; y < len(layerWithFewestZeros); y++ {\\n\\t\\tfor x := 0; x < len(layerWithFewestZeros[y]); x++ {\\n\\t\\t\\tswitch layerWithFewestZeros[y][x] {\\n\\t\\t\\tcase 1:\\n\\t\\t\\t\\tones++\\n\\t\\t\\tcase 2:\\n\\t\\t\\t\\ttwos++\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn fmt.Sprintf(\\\"%d\\\", ones*twos), nil\\n}\",\n \"func Test_BitTwiddle(t *testing.T) {\\n\\tvar b byte\\n\\tfor i := 0; i < 512; i++ {\\n\\t\\tvar bool1 bool = ((b >> 7) == 1)\\n\\t\\tvar bool2 bool = ((b & 0x80) == 0x80)\\n\\t\\tif bool1 != bool2 {\\n\\t\\t\\tt.Fatal()\\n\\t\\t}\\n\\t\\tb++\\n\\t}\\n}\",\n \"func trailingZeroes(n int) int {\\n\\tif n < 5 {\\n\\t\\treturn 0\\n\\t}\\n\\tfives := n / 5\\n\\n\\treturn fives + trailingZeroes(n/5)\\n}\",\n \"func countDistinctBinStrings(n uint) uint {\\n\\tif n > 32 {\\n\\t\\treturn 0\\n\\t}\\n\\tcount := uint(0)\\n\\tfor num := (1 << n) - 1; num >= 0; num-- {\\n\\t\\tif hasNoConsecutive1s(num) {\\n\\t\\t\\tcount++\\n\\t\\t}\\n\\t}\\n\\treturn count\\n}\",\n \"func Separate_0_1_2(in []int) (zeros, ones, twos int) {\\n\\n\\tfor _, val := range in {\\n\\t\\tif val == 0 {\\n\\t\\t\\tzeros++\\n\\t\\t} else if val == 1 {\\n\\t\\t\\tones++\\n\\t\\t} else {\\n\\t\\t\\ttwos++\\n\\t\\t}\\n\\t}\\n\\treturn zeros, ones, twos\\n}\",\n \"func count_X(x, y, z byte) int {\\n\\tcount := 0;\\n\\t// 'x' = 120\\n\\tif ( x == 120) {\\n\\t\\tcount = count + 1\\n\\t}\\n\\tif ( y == 120) {\\n\\t\\tcount = count + 1\\n\\t}\\n\\tif ( z == 120) {\\n\\t\\tcount = count + 1\\n\\t}\\n\\treturn count\\n}\",\n \"func row(k int) int { return k % 4 }\",\n \"func n926(S string) int {\\n\\tright := make([]int, len(S)+1)\\n\\tfor i := len(S) - 1; i >= 0; i-- {\\n\\t\\tright[i] = right[i+1]\\n\\t\\tif S[i] == '0' {\\n\\t\\t\\tright[i]++\\n\\t\\t}\\n\\t}\\n\\tans := len(S)\\n\\tone_count := 0\\n\\tfor i, c := range S {\\n\\t\\tif right[i]+one_count < ans {\\n\\t\\t\\tans = right[i] + one_count\\n\\t\\t}\\n\\t\\tif c == '1' {\\n\\t\\t\\tone_count++\\n\\t\\t}\\n\\t}\\n\\tif one_count < ans {\\n\\t\\treturn one_count // change all 1s to 0s\\n\\t} else {\\n\\t\\treturn ans\\n\\t}\\n}\",\n \"func minIncrementForUnique(A []int) int {\\n\\tarr := [80000]int{}\\n\\tfor _, v := range A {\\n\\t\\tarr[v]++\\n\\t}\\n\\n\\tvar (\\n\\t\\tans int\\n\\t\\ttoken int\\n\\t)\\n\\tfor i := 0; i < 80000; i++ {\\n\\t\\tif arr[i] > 1 {\\n\\t\\t\\ttoken += arr[i] - 1\\n\\t\\t\\tans -= i * (arr[i] - 1)\\n\\t\\t} else if token > 0 && arr[i] == 0 {\\n\\t\\t\\ttoken--\\n\\t\\t\\tans += i\\n\\t\\t}\\n\\t}\\n\\n\\treturn ans\\n}\",\n \"func repeatedString(s string, n int64) int64 {\\n l := float64(len(s))\\n baseA := int64(0)\\n for _, letter := range s {\\n if letter == 'a' {\\n baseA++\\n }\\n }\\n incompleteRepeat := math.Floor(float64(n)/l)\\n incompleteLength := incompleteRepeat * l\\n\\n\\n reminder := n - int64(incompleteLength)\\n\\n reminderA := int64(0)\\n for index := int64(0); index < reminder; index++ {\\n if s[index] == 'a' {\\n reminderA++\\n }\\n }\\n\\n return (baseA * int64(incompleteRepeat)) + reminderA\\n}\",\n \"func OnesCount8(x uint8) int {\\n\\tx = x - ((x >> 1) & 0x55)\\n\\tx = (x & 0x33) + ((x >> 2) & 0x33)\\n\\tx = (x + (x >> 4)) & 0x0f\\n\\treturn int(x)\\n}\",\n \"func countingValleys(n int32, s string) int32 {\\n depth := 0\\n valley := 0\\n for i := 0; int32(i) < n; i++ {\\n if s[i] == 'U' {\\n depth++\\n }\\n if s[i] == 'D' {\\n depth--\\n }\\n\\n if depth == 0 && s[i] == 'U' {\\n valley++\\n }\\n }\\n return int32(valley)\\n}\",\n \"func duplicateZeros(arr []int) {\\n\\tfor i := 0; i < len(arr); i++ {\\n\\t\\tif arr[i] == 0 && i < len(arr)-1 {\\n\\t\\t\\tfor j := len(arr) - 1; j > i+1; j-- {\\n\\t\\t\\t\\tarr[j] = arr[j-1]\\n\\t\\t\\t}\\n\\t\\t\\tarr[i+1] = 0\\n\\t\\t\\ti++\\n\\t\\t}\\n\\t}\\n}\",\n \"func duplicateZeros(arr []int) {\\n\\tif len(arr) <= 1 {\\n\\t\\treturn\\n\\t}\\n\\t//j:=len(arr)-1\\n\\tfor i := 0; i < len(arr); i++ {\\n\\t\\tif arr[i] == 0 {\\n\\t\\t\\tfor j := len(arr) - 1; j != i; j-- {\\n\\t\\t\\t\\tarr[j] = arr[j-1]\\n\\t\\t\\t}\\n\\t\\t\\ti++\\n\\t\\t}\\n\\t}\\n}\",\n \"func main() {\\n\\tch := make(chan int)\\n\\tgo func() {\\n\\t\\tvar c1 int;\\n\\t\\tvar c2 int;\\n\\t\\tvar c3 int;\\n\\t\\tfor {\\n\\t\\t\\tc1 = <- ch;\\n\\t\\t\\tc2 = <- ch;\\n\\t\\t\\tc3 = <- ch;\\n\\t\\t\\tprint(c1);\\n\\t\\t\\tprint(c2);\\n\\t\\t\\tprint(c3);\\n\\t\\t}\\n\\t}()\\n\\tvar cnt int;\\n\\tcnt = 0;\\n\\tfor {\\n\\t\\tch <- cnt;\\n\\t\\tif cnt == 8 { cnt = 0 } else { cnt = cnt + 1 };\\n\\t}\\n}\",\n \"func counting_bits(number int) []int {\\n\\tonesPositions := []int{}\\n\\tposition := 0\\n\\tfor number > 0 {\\n\\t\\tif is1 := number & 1; is1 == 1 {\\n\\t\\t\\tonesPositions = append(onesPositions, position)\\n\\t\\t}\\n\\t\\tnumber = number >> 1\\n\\t\\tposition++\\n\\t}\\n\\tresult := append([]int{len(onesPositions)}, onesPositions...)\\n\\treturn result\\n}\",\n \"func main() {\\n\\tvar a [101]int\\n\\t//j is the trip\\n\\tfor j := 1; j <= 100; j++ {\\n\\t\\t//k is the switch\\n\\t\\tfor k := 1; k <= 100; k++ {\\n\\t\\t\\tif k%j == 0 {\\n\\t\\t\\t\\ta[k]++\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor i := 1; i <= 100; i++ {\\n\\t\\tif a[i]%2 == 1 {\\n\\t\\t\\tfmt.Printf(\\\"switch %v = nyala, dipencet %v kali\\\\n\\\", i, a[i])\\n\\t\\t}\\n\\t}\\n\\n}\",\n \"func isLeadingNumZeroes(hash []byte) bool {\\n\\tif numLeadingZeroes == 0 {\\n\\t\\treturn true\\n\\t} else {\\n\\t\\ti := 0\\n\\t\\tnumZeroes := numLeadingZeroes\\n\\t\\tfor {\\n\\t\\t\\t// numZeroes <= 8, byte at hash[i] will determine validity\\n\\t\\t\\tif numZeroes-8 <= 0 {\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t// numZeroes is greater than 8, byte at hash[i] must be zero\\n\\t\\t\\t\\tif hash[i] != 0 {\\n\\t\\t\\t\\t\\treturn false\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\ti++\\n\\t\\t\\t\\t\\tnumZeroes -= 8\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// returns true if byte at hash[i] has the the minimum number of leading zeroes\\n\\t\\t// if numZeroes is 8: hash[i] < 2^(8-8) == hash[1] < 1 == hash[i] must be (0000 0000)b.\\n\\t\\t// if numZeroes is 1: hash[i] < 2^(8-1) == hash[1] < (1000 0000)b == hash[i] <= (0111 1111)b\\n\\t\\treturn float64(hash[i]) < math.Pow(2, float64(8-numZeroes))\\n\\t}\\n}\",\n \"func main() {\\n\\ttrailingZeroes(125)\\n}\",\n \"func TestZeros(t *testing.T) {\\n\\tvect, err := os.Open(\\\"randvect.txt\\\")\\n\\tif err != nil {\\n\\t\\tt.Error(\\\"could not find text vector file\\\")\\n\\t}\\n\\tdefer vect.Close()\\n\\tscanner := bufio.NewScanner(vect)\\n\\tscanner.Scan()\\n\\n\\tvar rng ISAAC\\n\\trng.randInit(true)\\n\\n\\tvar buf bytes.Buffer\\n\\tfor i := 0; i < 2; i++ {\\n\\t\\trng.isaac()\\n\\t\\tfor j := 0; j < 256; j++ {\\n\\t\\t\\tbuf.WriteString(fmt.Sprintf(\\\"%.8x\\\", rng.randrsl[j]))\\n\\t\\t\\tif (j & 7) == 7 {\\n\\t\\t\\t\\tvar output = buf.String()\\n\\t\\t\\t\\tif scanner.Text() == output {\\n\\t\\t\\t\\t\\tscanner.Scan()\\n\\t\\t\\t\\t\\tbuf.Reset()\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tfmt.Printf(\\\"o: \\\" + output + \\\"\\\\n\\\" + \\\"v: \\\" + scanner.Text() + \\\"\\\\n\\\")\\n\\t\\t\\t\\t\\tt.Fail()\\n\\t\\t\\t\\t\\treturn\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func findOnes(arr []string) []string {\\n\\tvar allPoss []string\\n\\tfor _, item := range arr {\\n\\t\\tif strings.Contains(item, \\\"1\\\") {\\n\\t\\t\\tvar possibilities []string\\n\\t\\t\\tpossibilities = replaceWithFours(item, 0, possibilities)\\n\\t\\t\\tfor _, newPoss := range possibilities {\\n\\t\\t\\t\\tallPoss = append(allPoss, newPoss)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tallPoss = append(allPoss, item)\\n\\t}\\n\\treturn allPoss\\n}\",\n \"func makeNext(pattern string) ([]int, error) {\\n\\t// sanity check\\n\\tlength := len(pattern)\\n\\tif length == 0 {\\n\\t\\treturn nil, errors.New(\\\"'pattern' must contain at least one character\\\")\\n\\t}\\n\\tif length == 1 {\\n\\t\\treturn []int{-1}, nil\\n\\t}\\n\\tnext := make([]int, length)\\n\\tnext[0], next[1] = -1, 0\\n\\n\\tpos, count := 2, 0\\n\\tfor pos < length {\\n\\t\\tif pattern[pos-1] == pattern[count] {\\n\\t\\t\\tcount++\\n\\t\\t\\tnext[pos] = count\\n\\t\\t\\tpos++\\n\\t\\t} else {\\n\\t\\t\\tif count > 0 {\\n\\t\\t\\t\\tcount = next[count]\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tnext[pos] = 0\\n\\t\\t\\t\\tpos++\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn next, nil\\n}\",\n \"func generatePRData(l int) []byte {\\n\\tres := make([]byte, l)\\n\\tseed := uint64(1)\\n\\tfor i := 0; i < l; i++ {\\n\\t\\tseed = seed * 48271 % 2147483647\\n\\t\\tres[i] = byte(seed)\\n\\t}\\n\\treturn res\\n}\",\n \"func leadingZeros(x uint32) (n int) {\\n\\tif x >= 1<<16 {\\n\\t\\tx >>= 16\\n\\t\\tn = 16\\n\\t}\\n\\tif x >= 1<<8 {\\n\\t\\tx >>= 8\\n\\t\\tn += 8\\n\\t}\\n\\tn += int(len8tab[x])\\n\\treturn 32 - n\\n}\",\n \"func main() {\\n\\ttotal := int64(0)\\n\\tvectors := ways(10, top, 3)\\n\\tfor _, vector := range vectors {\\n\\t\\ttotal += distribute(vector)\\n\\t}\\n\\n\\tfmt.Println(\\\"172/ How many 18-digit numbers n (without leading zeros) are there such that no digit occurs more than three times in n?\\\")\\n\\tfmt.Println(total)\\n}\",\n \"func duplicateZeros(arr []int) {\\n\\tfor i := 0; i < len(arr); i++ {\\n\\t\\tif arr[i] == 0 {\\n\\t\\t\\tfor j := len(arr) - 1; j > i; j-- {\\n\\t\\t\\t\\tarr[j] = arr[j-1]\\n\\t\\t\\t}\\n\\t\\t\\ti++\\n\\t\\t}\\n\\t}\\n}\",\n \"func canPlaceFlowers(flowerbed []int, n int) bool {\\n\\tif n == 0 {\\n\\t\\treturn true\\n\\t}\\n\\t// 很容易分析得知连续三个零可以种一朵花\\n\\t// 为了方便处理边界情况，可以在两边补 0，假设为没种花的情况\\n\\tflowerbed = append([]int{0}, flowerbed...)\\n\\tflowerbed = append(flowerbed, 0)\\n\\t// 从 1 开始遍历，遍历到倒数第二位\\n\\tfor i := 1; i < len(flowerbed)-1; i++ {\\n\\t\\t// 连续三个 0\\n\\t\\tif flowerbed[i] == 0 && flowerbed[i-1] == 0 && flowerbed[i+1] == 0 {\\n\\t\\t\\tflowerbed[i] = 1\\n\\t\\t\\tn--\\n\\t\\t}\\n\\t\\tif n < 1 {\\n\\t\\t\\treturn true\\n\\t\\t}\\n\\t}\\n\\treturn false\\n}\",\n \"func jumpingOnClouds(c []int32) int32 {\\n\\tvar jumps int32\\n\\tfor i := 0; i < len(c)-1; i++ {\\n\\t\\tjumps++\\n\\t\\tif i+2 < len(c) && c[i+2] == 0 {\\n\\t\\t\\ti++\\n\\t\\t}\\n\\t}\\n\\treturn jumps\\n}\",\n \"func disturbs(candidate []int) []int {\\r\\n\\tnew_candidate := make([]int, len(candidate))\\r\\n\\tr := rand.Intn(len(candidate))\\r\\n\\tcopy(new_candidate, candidate)\\r\\n\\tif new_candidate[r] == 1 {\\r\\n\\t\\tnew_candidate[r] = 0\\r\\n\\t} else {\\r\\n\\t\\tnew_candidate[r] = 1\\r\\n\\t}\\r\\n\\treturn new_candidate\\r\\n}\",\n \"func main() {\\n\\tfmt.Println(numberOfOnes(15))\\n}\",\n \"func jumpingOnClouds(c []int32) int32 {\\n // Write your code here\\n const SAFE int32 = 0\\n const AVOID int32 = 1\\n var n int32 = int32(len(c))\\n var count int32 = 0\\n var cloud int32 = 0\\n for {\\n // can move to cloud c[cloud+2]? c[cloud+1]?\\n // can c+2?\\n // can c+1?\\n if (cloud+2 < n) && (c[cloud+2] == SAFE) {\\n cloud += 2\\n count++\\n } else if (cloud+1 < n) && (c[cloud+1] == SAFE) {\\n cloud += 1\\n count++\\n } else {\\n // cannot move\\n break\\n }\\n }\\n return count\\n}\",\n \"func vn(x []u8, y []u8, n int) u32 {\\n\\tif len(x) != n {\\n\\t\\treturn 0\\n\\t}\\n\\tif len(y) != n {\\n\\t\\treturn 0\\n\\t}\\n\\n\\tvar d u32\\n\\tfor i := 0; i < n; i++ {\\n\\t\\td |= u32(x[i]) ^ u32(y[i])\\n\\t}\\n\\treturn (1 & ((d - 1) >> 8)) - 1\\n}\",\n \"func g(i int) (n int) {\\n\\tfor n = 1; sf(n) != i; n++ {\\n\\t}\\n\\treturn\\n}\",\n \"func stateG1(s *scanner, c byte) int {\\n\\tif '0' <= c && c <= '9' {\\n\\t\\ts.step = stateG1\\n\\t\\treturn scanContinue\\n\\t}\\n\\treturn stateG0(s, c)\\n}\",\n \"func solve1(input string) string {\\n\\tlist := parseInput(input)\\n\\ti := 0\\n\\tn := 0\\n\\tfor i >= 0 && i < len(list) {\\n\\t\\tj := list[i]\\n\\t\\tlist[i]++\\n\\t\\ti += j\\n\\t\\tn++\\n\\t}\\n\\treturn fmt.Sprint(n)\\n}\",\n \"func bufferValue(index uint16, buffer []byte) (uint8, bool) {\\n\\ti := int(index)\\n\\ttotal := uint8(0)\\n\\tswitch buffer[i] {\\n\\tcase '0':\\n\\tcase '1':\\n\\t\\ttotal += 16 * 1\\n\\tcase '2':\\n\\t\\ttotal += 16 * 2\\n\\tcase '3':\\n\\t\\ttotal += 16 * 3\\n\\tcase '4':\\n\\t\\ttotal += 16 * 4\\n\\tcase '5':\\n\\t\\ttotal += 16 * 5\\n\\tcase '6':\\n\\t\\ttotal += 16 * 6\\n\\tcase '7':\\n\\t\\ttotal += 16 * 7\\n\\tcase '8':\\n\\t\\ttotal += 16 * 8\\n\\tcase '9':\\n\\t\\ttotal += 16 * 9\\n\\tcase 'a', 'A':\\n\\t\\ttotal += 16 * 10\\n\\tcase 'b', 'B':\\n\\t\\ttotal += 16 * 11\\n\\tcase 'c', 'C':\\n\\t\\ttotal += 16 * 12\\n\\tcase 'd', 'D':\\n\\t\\ttotal += 16 * 13\\n\\tcase 'e', 'E':\\n\\t\\ttotal += 16 * 14\\n\\tcase 'f', 'F':\\n\\t\\ttotal += 16 * 15\\n\\tdefault:\\n\\t\\tprint(\\\"!bad character in payload hi byte(number #\\\", i, \\\"):\\\", buffer[i], \\\"\\\\n\\\")\\n\\t\\treturn 0xff, false\\n\\t}\\n\\tswitch buffer[i+1] {\\n\\tcase '0':\\n\\tcase '1':\\n\\t\\ttotal++\\n\\tcase '2':\\n\\t\\ttotal += 2\\n\\tcase '3':\\n\\t\\ttotal += 3\\n\\tcase '4':\\n\\t\\ttotal += 4\\n\\tcase '5':\\n\\t\\ttotal += 5\\n\\tcase '6':\\n\\t\\ttotal += 6\\n\\tcase '7':\\n\\t\\ttotal += 7\\n\\tcase '8':\\n\\t\\ttotal += 8\\n\\tcase '9':\\n\\t\\ttotal += 9\\n\\tcase 'a', 'A':\\n\\t\\ttotal += 10\\n\\tcase 'b', 'B':\\n\\t\\ttotal += 11\\n\\tcase 'c', 'C':\\n\\t\\ttotal += 12\\n\\tcase 'd', 'D':\\n\\t\\ttotal += 13\\n\\tcase 'e', 'E':\\n\\t\\ttotal += 14\\n\\tcase 'f', 'F':\\n\\t\\ttotal += 15\\n\\tdefault:\\n\\t\\tprint(\\\"!bad character in payload low byte (number #\\\", i+1, \\\"):\\\", buffer[i+1], \\\"\\\\n\\\")\\n\\t\\treturn 0xff, false\\n\\t}\\n\\treturn total, true\\n}\",\n \"func bufferValue(index uint16, buffer []byte) (uint8, bool) {\\n\\ti := int(index)\\n\\ttotal := uint8(0)\\n\\tswitch buffer[i] {\\n\\tcase '0':\\n\\tcase '1':\\n\\t\\ttotal += 16 * 1\\n\\tcase '2':\\n\\t\\ttotal += 16 * 2\\n\\tcase '3':\\n\\t\\ttotal += 16 * 3\\n\\tcase '4':\\n\\t\\ttotal += 16 * 4\\n\\tcase '5':\\n\\t\\ttotal += 16 * 5\\n\\tcase '6':\\n\\t\\ttotal += 16 * 6\\n\\tcase '7':\\n\\t\\ttotal += 16 * 7\\n\\tcase '8':\\n\\t\\ttotal += 16 * 8\\n\\tcase '9':\\n\\t\\ttotal += 16 * 9\\n\\tcase 'a', 'A':\\n\\t\\ttotal += 16 * 10\\n\\tcase 'b', 'B':\\n\\t\\ttotal += 16 * 11\\n\\tcase 'c', 'C':\\n\\t\\ttotal += 16 * 12\\n\\tcase 'd', 'D':\\n\\t\\ttotal += 16 * 13\\n\\tcase 'e', 'E':\\n\\t\\ttotal += 16 * 14\\n\\tcase 'f', 'F':\\n\\t\\ttotal += 16 * 15\\n\\tdefault:\\n\\t\\tprint(\\\"!bad character in payload hi byte(number #\\\", i, \\\"):\\\", buffer[i], \\\"\\\\n\\\")\\n\\t\\treturn 0xff, false\\n\\t}\\n\\tswitch buffer[i+1] {\\n\\tcase '0':\\n\\tcase '1':\\n\\t\\ttotal++\\n\\tcase '2':\\n\\t\\ttotal += 2\\n\\tcase '3':\\n\\t\\ttotal += 3\\n\\tcase '4':\\n\\t\\ttotal += 4\\n\\tcase '5':\\n\\t\\ttotal += 5\\n\\tcase '6':\\n\\t\\ttotal += 6\\n\\tcase '7':\\n\\t\\ttotal += 7\\n\\tcase '8':\\n\\t\\ttotal += 8\\n\\tcase '9':\\n\\t\\ttotal += 9\\n\\tcase 'a', 'A':\\n\\t\\ttotal += 10\\n\\tcase 'b', 'B':\\n\\t\\ttotal += 11\\n\\tcase 'c', 'C':\\n\\t\\ttotal += 12\\n\\tcase 'd', 'D':\\n\\t\\ttotal += 13\\n\\tcase 'e', 'E':\\n\\t\\ttotal += 14\\n\\tcase 'f', 'F':\\n\\t\\ttotal += 15\\n\\tdefault:\\n\\t\\tprint(\\\"!bad character in payload low byte (number #\\\", i+1, \\\"):\\\", buffer[i+1], \\\"\\\\n\\\")\\n\\t\\treturn 0xff, false\\n\\t}\\n\\treturn total, true\\n}\",\n \"func singleNumber(nums []int) []int {\\n\\tbitmap := 0\\n\\tfor _, num := range nums {\\n\\t\\tbitmap = bitmap ^ num\\n\\t}\\n\\tdiff, x := bitmap&(-bitmap), 0\\n\\tfor _, num := range nums {\\n\\t\\tif num&diff != 0 {\\n\\t\\t\\tx = x ^ num\\n\\t\\t}\\n\\t}\\n\\treturn []int{x, bitmap ^ x}\\n}\",\n \"func check(arr []int) bool {\\n\\tvar used [10]bool\\n\\tfor _, f := range field {\\n\\t\\tfor i := 0; i <= 9; i++ {\\n\\t\\t\\tused[i] = false\\n\\t\\t}\\n\\t\\tfor i := 0; i < 9; i++ {\\n\\t\\t\\tif arr[f[i]-1] == 0 {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tif used[arr[f[i]-1]] == true {\\n\\t\\t\\t\\treturn false\\n\\t\\t\\t}\\n\\t\\t\\tused[arr[f[i]-1]] = true\\n\\t\\t}\\n\\t}\\n\\treturn true\\n}\",\n \"func main() {\\n\\n\\tinput := []int{1, 1, 0, 1, 1, 1}\\n\\n\\tresult := solution(input)\\n\\tfmt.Println(result)\\n\\n}\",\n \"func minimumBribes(q []int32) {\\n\\tbribes := 0\\n\\tqbribes := make([]int, len(q))\\n\\treverse := false\\n\\tfor i, j := 0, len(q)-1; i < len(q); {\\n\\t\\tif !reverse {\\n\\t\\t\\tfor x := 0; x < len(q)-i-1; x++ {\\n\\t\\t\\t\\tif q[x]-1 == int32(x) {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif q[x] > q[x+1] {\\n\\t\\t\\t\\t\\tqbribes[q[x]-1]++\\n\\t\\t\\t\\t\\tif qbribes[q[x]-1] > 2 {\\n\\t\\t\\t\\t\\t\\tfmt.Printf(\\\"Too chaotic\\\\n\\\")\\n\\t\\t\\t\\t\\t\\treturn\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tq[x], q[x+1] = q[x+1], q[x]\\n\\t\\t\\t\\t\\tbribes++\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\ti++\\n\\t\\t} else {\\n\\t\\t\\tfor x := j; x > i; x-- {\\n\\t\\t\\t\\tif q[x]-1 == int32(x) {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif q[x-1] > q[x] {\\n\\t\\t\\t\\t\\tqbribes[q[x-1]-1]++\\n\\t\\t\\t\\t\\tif qbribes[q[x-1]-1] > 2 {\\n\\t\\t\\t\\t\\t\\tfmt.Printf(\\\"Too chaotic\\\\n\\\")\\n\\t\\t\\t\\t\\t\\treturn\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tq[x-1], q[x] = q[x], q[x-1]\\n\\t\\t\\t\\t\\tbribes++\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tj--\\n\\t\\t}\\n\\t\\treverse = !reverse\\n\\t}\\n\\tfmt.Printf(\\\"%d\\\\n\\\", bribes)\\n}\",\n \"func nums(v int) int {\\n\\tres := 0\\n\\tfor i := 0; i < v; i++ {\\n\\t\\tif i%3 == 0 || i%5 == 0 {\\n\\t\\t\\tres += i\\n\\t\\t}\\n\\t}\\n\\treturn res\\n}\",\n \"func findRun(a uint32) int {\\n\\treturn int(math.Log2(float64(a & -a)))\\n}\",\n \"func backtrack(pos int, total *int, fill []int, avail map[int]bool) {\\n\\tif pos == len(fill) {\\n\\t\\t*total++\\n\\t\\treturn\\n\\t}\\n\\tfor n, ok := range avail {\\n\\t\\tif !ok || (n%(pos+1) != 0 && (pos+1)%n != 0) {\\n\\t\\t\\tcontinue // Not beautiful!\\n\\t\\t}\\n\\t\\tavail[n] = false\\n\\t\\tfill[pos] = n\\n\\t\\tbacktrack(pos+1, total, fill, avail)\\n\\t\\tavail[n] = true\\n\\t}\\n}\",\n \"func numTilePossibilities(tiles string) int {\\n\\tvar m [26]int\\n\\tfor _, c := range tiles {\\n\\t\\tm[c-'A']++\\n\\t}\\n\\tvar uniq []int\\n\\tfor _, v := range m {\\n\\t\\tif v > 0 {\\n\\t\\t\\tuniq = append(uniq, v)\\n\\t\\t}\\n\\t}\\n\\n\\tr := 0\\n\\n\\tfac := func(x int) int {\\n\\t\\tv := 1\\n\\t\\tfor x > 0 {\\n\\t\\t\\tv *= x\\n\\t\\t\\tx--\\n\\t\\t}\\n\\t\\treturn v\\n\\t}\\n\\n\\tn := len(uniq)\\n\\tuses := make([]int, n)\\n\\tcalc := func() int {\\n\\t\\ttotal := 0\\n\\t\\tp := 1\\n\\t\\tfor _, v := range uses {\\n\\t\\t\\ttotal += v\\n\\t\\t\\tp *= fac(v)\\n\\t\\t}\\n\\t\\tif total == 0 {\\n\\t\\t\\treturn 0\\n\\t\\t}\\n\\n\\t\\treturn fac(total) / p\\n\\t}\\n\\n\\tvar walk func(i int)\\n\\twalk = func(i int) {\\n\\t\\tif i >= len(uniq) {\\n\\t\\t\\tr += calc()\\n\\t\\t\\treturn\\n\\t\\t}\\n\\n\\t\\tfor j := 0; j <= uniq[i]; j++ {\\n\\t\\t\\tuses[i] = j\\n\\t\\t\\twalk(i + 1)\\n\\t\\t}\\n\\t}\\n\\n\\twalk(0)\\n\\treturn r\\n}\",\n \"func coverZeros(input [][]float64) int {\\n\\n\\treturn 0\\n}\",\n \"func (this *SlicerH264) getOneNal1(data []byte) (nalData []byte, dataCur int) {\\n\\t//read start\\n\\tnalStart := 0\\n\\tnalEnd := 0\\n\\tfor {\\n\\t\\tif nalStart+4 >= len(data) {\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tif data[nalStart] == 0x00 &&\\n\\t\\t\\tdata[nalStart+1] == 0x00 {\\n\\t\\t\\tif data[nalStart+2] == 0x01 {\\n\\t\\t\\t\\tnalStart += 3\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t} else if data[nalStart+2] == 0x00 {\\n\\t\\t\\t\\tif data[nalStart+3] == 0x01 {\\n\\t\\t\\t\\t\\tnalStart += 4\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tnalStart += 2\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tnalStart++\\n\\t}\\n\\t//read end\\n\\tnalEnd = nalStart\\n\\tfor nalEnd < len(data) {\\n\\t\\tif nalEnd+4 > len(data) {\\n\\t\\t\\tnalEnd = len(data)\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tif data[nalEnd] == 0x00 &&\\n\\t\\t\\tdata[nalEnd+1] == 0x00 {\\n\\t\\t\\tif data[nalEnd+2] == 0x01 {\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t} else if data[nalEnd+2] == 0x00 && data[nalEnd+3] == 0x01 {\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tnalEnd += 2\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\tnalEnd++\\n\\t}\\n\\t//nal data\\n\\tnalData = data[nalStart:nalEnd]\\n\\tdataCur = nalEnd\\n\\treturn\\n}\",\n \"func popcount(x uint64) int {\\n\\tx -= (x >> 1) & m1 //put count of each 2 bits into those 2 bits\\n\\tx = (x & m2) + ((x >> 2) & m2) //put count of each 4 bits into those 4 bits\\n\\tx = (x + (x >> 4)) & m4 //put count of each 8 bits into those 8 bits\\n\\treturn int((x * h01) >> 56) //returns left 8 bits of x + (x<<8) + (x<<16) + (x<<24) + ...\\n}\",\n \"func emptyhanded() int {\\n\\tfor i := 0; i < 26; i++ {\\n\\t\\tif iven[i] != 0 {\\n\\t\\t\\tif i != c[WIELD] {\\n\\t\\t\\t\\tif i != c[WEAR] {\\n\\t\\t\\t\\t\\tif i != c[SHIELD] {\\n\\t\\t\\t\\t\\t\\treturn 0\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 1\\n}\",\n \"func (s *Scratch) readNCount() error {\\n\\tvar (\\n\\t\\tcharnum uint16\\n\\t\\tprevious0 bool\\n\\t\\tb = &s.br\\n\\t)\\n\\tiend := b.remain()\\n\\tif iend < 4 {\\n\\t\\treturn errors.New(\\\"input too small\\\")\\n\\t}\\n\\tbitStream := b.Uint32()\\n\\tnbBits := uint((bitStream & 0xF) + minTablelog) // extract tableLog\\n\\tif nbBits > tablelogAbsoluteMax {\\n\\t\\treturn errors.New(\\\"tableLog too large\\\")\\n\\t}\\n\\tbitStream >>= 4\\n\\tbitCount := uint(4)\\n\\n\\ts.actualTableLog = uint8(nbBits)\\n\\tremaining := int32((1 << nbBits) + 1)\\n\\tthreshold := int32(1 << nbBits)\\n\\tgotTotal := int32(0)\\n\\tnbBits++\\n\\n\\tfor remaining > 1 {\\n\\t\\tif previous0 {\\n\\t\\t\\tn0 := charnum\\n\\t\\t\\tfor (bitStream & 0xFFFF) == 0xFFFF {\\n\\t\\t\\t\\tn0 += 24\\n\\t\\t\\t\\tif b.off < iend-5 {\\n\\t\\t\\t\\t\\tb.advance(2)\\n\\t\\t\\t\\t\\tbitStream = b.Uint32() >> bitCount\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tbitStream >>= 16\\n\\t\\t\\t\\t\\tbitCount += 16\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (bitStream & 3) == 3 {\\n\\t\\t\\t\\tn0 += 3\\n\\t\\t\\t\\tbitStream >>= 2\\n\\t\\t\\t\\tbitCount += 2\\n\\t\\t\\t}\\n\\t\\t\\tn0 += uint16(bitStream & 3)\\n\\t\\t\\tbitCount += 2\\n\\t\\t\\tif n0 > maxSymbolValue {\\n\\t\\t\\t\\treturn errors.New(\\\"maxSymbolValue too small\\\")\\n\\t\\t\\t}\\n\\t\\t\\tfor charnum < n0 {\\n\\t\\t\\t\\ts.norm[charnum&0xff] = 0\\n\\t\\t\\t\\tcharnum++\\n\\t\\t\\t}\\n\\n\\t\\t\\tif b.off <= iend-7 || b.off+int(bitCount>>3) <= iend-4 {\\n\\t\\t\\t\\tb.advance(bitCount >> 3)\\n\\t\\t\\t\\tbitCount &= 7\\n\\t\\t\\t\\tbitStream = b.Uint32() >> bitCount\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tbitStream >>= 2\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tmax := (2*(threshold) - 1) - (remaining)\\n\\t\\tvar count int32\\n\\n\\t\\tif (int32(bitStream) & (threshold - 1)) < max {\\n\\t\\t\\tcount = int32(bitStream) & (threshold - 1)\\n\\t\\t\\tbitCount += nbBits - 1\\n\\t\\t} else {\\n\\t\\t\\tcount = int32(bitStream) & (2*threshold - 1)\\n\\t\\t\\tif count >= threshold {\\n\\t\\t\\t\\tcount -= max\\n\\t\\t\\t}\\n\\t\\t\\tbitCount += nbBits\\n\\t\\t}\\n\\n\\t\\tcount-- // extra accuracy\\n\\t\\tif count < 0 {\\n\\t\\t\\t// -1 means +1\\n\\t\\t\\tremaining += count\\n\\t\\t\\tgotTotal -= count\\n\\t\\t} else {\\n\\t\\t\\tremaining -= count\\n\\t\\t\\tgotTotal += count\\n\\t\\t}\\n\\t\\ts.norm[charnum&0xff] = int16(count)\\n\\t\\tcharnum++\\n\\t\\tprevious0 = count == 0\\n\\t\\tfor remaining < threshold {\\n\\t\\t\\tnbBits--\\n\\t\\t\\tthreshold >>= 1\\n\\t\\t}\\n\\t\\tif b.off <= iend-7 || b.off+int(bitCount>>3) <= iend-4 {\\n\\t\\t\\tb.advance(bitCount >> 3)\\n\\t\\t\\tbitCount &= 7\\n\\t\\t} else {\\n\\t\\t\\tbitCount -= (uint)(8 * (len(b.b) - 4 - b.off))\\n\\t\\t\\tb.off = len(b.b) - 4\\n\\t\\t}\\n\\t\\tbitStream = b.Uint32() >> (bitCount & 31)\\n\\t}\\n\\ts.symbolLen = charnum\\n\\n\\tif s.symbolLen <= 1 {\\n\\t\\treturn fmt.Errorf(\\\"symbolLen (%d) too small\\\", s.symbolLen)\\n\\t}\\n\\tif s.symbolLen > maxSymbolValue+1 {\\n\\t\\treturn fmt.Errorf(\\\"symbolLen (%d) too big\\\", s.symbolLen)\\n\\t}\\n\\tif remaining != 1 {\\n\\t\\treturn fmt.Errorf(\\\"corruption detected (remaining %d != 1)\\\", remaining)\\n\\t}\\n\\tif bitCount > 32 {\\n\\t\\treturn fmt.Errorf(\\\"corruption detected (bitCount %d > 32)\\\", bitCount)\\n\\t}\\n\\tif gotTotal != 1<<s.actualTableLog {\\n\\t\\treturn fmt.Errorf(\\\"corruption detected (total %d != %d)\\\", gotTotal, 1<<s.actualTableLog)\\n\\t}\\n\\tb.advance((bitCount + 7) >> 3)\\n\\treturn nil\\n}\",\n \"func cyclicPattern(length int) []byte {\\n data := make([]byte, length + (3 - length % 3))\\n\\n // generate cyclic pattern\\n x, y, z := byte(65), byte(97), byte(48)\\n for i := 0; i < length; i += 3 {\\n data[i] = x\\n data[i + 1] = y\\n data[i + 2] = z\\n\\n // get the next cycle\\n x, y, z = nextCycle(x, y, z)\\n }\\n\\n // since data is a multiple of 3, cut it to length\\n return data[:length]\\n}\",\n \"func nonZeroToAllOnes(x uint32) uint32 {\\n\\treturn ((x - 1) >> 31) - 1\\n}\",\n \"func nonZeroToAllOnes(x uint32) uint32 {\\n\\treturn ((x - 1) >> 31) - 1\\n}\",\n \"func nextSystemRepeat(s *system, cmp *system) {\\n\\ts.advance()\\n\\txRepeat := int64(0)\\n\\tyRepeat := int64(0)\\n\\tzRepeat := int64(0)\\n\\tfor xRepeat == 0 || yRepeat == 0 || zRepeat == 0 {\\n\\t\\ts.advance()\\n\\t\\tif xRepeat == 0 && checkSystemDimension(s, cmp, func(m *moon) int { return m.p.x }, func(m *moon) int { return m.v.x }) {\\n\\t\\t\\txRepeat = s.timeStep\\n\\t\\t}\\n\\t\\tif yRepeat == 0 && checkSystemDimension(s, cmp, func(m *moon) int { return m.p.y }, func(m *moon) int { return m.v.y }) {\\n\\t\\t\\tyRepeat = s.timeStep\\n\\t\\t}\\n\\t\\tif zRepeat == 0 && checkSystemDimension(s, cmp, func(m *moon) int { return m.p.z }, func(m *moon) int { return m.v.z }) {\\n\\t\\t\\tzRepeat = s.timeStep\\n\\t\\t}\\n\\t}\\n\\tfmt.Printf(\\\"Repeats at x: %d, y: %d, z: %d (lcm: %d)\\\\n\\\", xRepeat, yRepeat, zRepeat, lcm(xRepeat, yRepeat, zRepeat))\\n\\n}\",\n \"func countBattleships(board [][]byte) int {\\n\\t// O(1) extra space\\n\\tcount1, single1 := 0, 0\\n\\tfor i := 0; i < len(board); i++ {\\n\\t\\tgood, bad := 0, 0\\n\\t\\tfor j := 0; j <= len(board[0]); j++ {\\n\\t\\t\\tif j == len(board[0]) || board[i][j] == '.' {\\n\\t\\t\\t\\tif good > 0 && bad == 0 {\\n\\t\\t\\t\\t\\tcount1++\\n\\t\\t\\t\\t\\tif good == 1 {\\n\\t\\t\\t\\t\\t\\tsingle1++\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tgood, bad = 0, 0\\n\\t\\t\\t}\\n\\t\\t\\tif j < len(board[0]) && board[i][j] == 'X' {\\n\\t\\t\\t\\tif (i-1 >= 0 && board[i-1][j] == 'X') || (i+1 < len(board) && board[i+1][j] == 'X') {\\n\\t\\t\\t\\t\\tbad++\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tgood++\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcount2, single2 := 0, 0\\n\\tfor j := 0; j < len(board[0]); j++ {\\n\\t\\tgood, bad := 0, 0\\n\\t\\tfor i := 0; i <= len(board); i++ {\\n\\t\\t\\tif i == len(board) || board[i][j] == '.' {\\n\\t\\t\\t\\tif good > 0 && bad == 0 {\\n\\t\\t\\t\\t\\tcount2++\\n\\t\\t\\t\\t\\tif good == 1 {\\n\\t\\t\\t\\t\\t\\tsingle2++\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tgood, bad = 0, 0\\n\\t\\t\\t}\\n\\t\\t\\tif i < len(board) && board[i][j] == 'X' {\\n\\t\\t\\t\\tif (j-1 >= 0 && board[i][j-1] == 'X') || (j+1 < len(board[0]) && board[i][j+1] == 'X') {\\n\\t\\t\\t\\t\\tbad++\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tgood++\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn count1 + count2 - single1\\n}\",\n \"func kerDIF8(a []fr.Element, twiddles [][]fr.Element, stage int) {\\n\\n\\tfr.Butterfly(&a[0], &a[4])\\n\\tfr.Butterfly(&a[1], &a[5])\\n\\tfr.Butterfly(&a[2], &a[6])\\n\\tfr.Butterfly(&a[3], &a[7])\\n\\ta[5].Mul(&a[5], &twiddles[stage+0][1])\\n\\ta[6].Mul(&a[6], &twiddles[stage+0][2])\\n\\ta[7].Mul(&a[7], &twiddles[stage+0][3])\\n\\tfr.Butterfly(&a[0], &a[2])\\n\\tfr.Butterfly(&a[1], &a[3])\\n\\tfr.Butterfly(&a[4], &a[6])\\n\\tfr.Butterfly(&a[5], &a[7])\\n\\ta[3].Mul(&a[3], &twiddles[stage+1][1])\\n\\ta[7].Mul(&a[7], &twiddles[stage+1][1])\\n\\tfr.Butterfly(&a[0], &a[1])\\n\\tfr.Butterfly(&a[2], &a[3])\\n\\tfr.Butterfly(&a[4], &a[5])\\n\\tfr.Butterfly(&a[6], &a[7])\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5901486","0.57600516","0.5691947","0.56687385","0.5632322","0.56271887","0.5624384","0.5614425","0.5581852","0.557765","0.5537337","0.54688233","0.5465581","0.54486245","0.54246455","0.5421789","0.541518","0.54054135","0.5336431","0.5312148","0.52895814","0.52820474","0.5267109","0.52641284","0.5263497","0.52553654","0.5255247","0.52532685","0.5249208","0.5246304","0.5230985","0.5210601","0.5207772","0.5182032","0.5182032","0.51817924","0.5168768","0.516638","0.516318","0.5159327","0.51561654","0.51502085","0.5149734","0.5145273","0.51444364","0.5141065","0.5122224","0.5122152","0.51182187","0.5114608","0.5110662","0.51042485","0.5097422","0.5090538","0.5088352","0.50872856","0.50871515","0.50801325","0.50605494","0.5059073","0.5056778","0.5050024","0.50443906","0.5035605","0.502991","0.5027193","0.502271","0.5020718","0.501662","0.5011965","0.5001754","0.5000927","0.49996725","0.49989745","0.4996437","0.49939045","0.49791563","0.4978981","0.4968537","0.49683052","0.49667358","0.49667358","0.49648935","0.49616957","0.49615607","0.49568725","0.49566016","0.49545282","0.49491417","0.49454206","0.49435008","0.4940012","0.493885","0.49370372","0.4936621","0.49363992","0.4933166","0.4933166","0.49307314","0.49273986","0.49198177"],"string":"[\n \"0.5901486\",\n \"0.57600516\",\n \"0.5691947\",\n \"0.56687385\",\n \"0.5632322\",\n \"0.56271887\",\n \"0.5624384\",\n \"0.5614425\",\n \"0.5581852\",\n \"0.557765\",\n \"0.5537337\",\n \"0.54688233\",\n \"0.5465581\",\n \"0.54486245\",\n \"0.54246455\",\n \"0.5421789\",\n \"0.541518\",\n \"0.54054135\",\n \"0.5336431\",\n \"0.5312148\",\n \"0.52895814\",\n \"0.52820474\",\n \"0.5267109\",\n \"0.52641284\",\n \"0.5263497\",\n \"0.52553654\",\n \"0.5255247\",\n \"0.52532685\",\n \"0.5249208\",\n \"0.5246304\",\n \"0.5230985\",\n \"0.5210601\",\n \"0.5207772\",\n \"0.5182032\",\n \"0.5182032\",\n \"0.51817924\",\n \"0.5168768\",\n \"0.516638\",\n \"0.516318\",\n \"0.5159327\",\n \"0.51561654\",\n \"0.51502085\",\n \"0.5149734\",\n \"0.5145273\",\n \"0.51444364\",\n \"0.5141065\",\n \"0.5122224\",\n \"0.5122152\",\n \"0.51182187\",\n \"0.5114608\",\n \"0.5110662\",\n \"0.51042485\",\n \"0.5097422\",\n \"0.5090538\",\n \"0.5088352\",\n \"0.50872856\",\n \"0.50871515\",\n \"0.50801325\",\n \"0.50605494\",\n \"0.5059073\",\n \"0.5056778\",\n \"0.5050024\",\n \"0.50443906\",\n \"0.5035605\",\n \"0.502991\",\n \"0.5027193\",\n \"0.502271\",\n \"0.5020718\",\n \"0.501662\",\n \"0.5011965\",\n \"0.5001754\",\n \"0.5000927\",\n \"0.49996725\",\n \"0.49989745\",\n \"0.4996437\",\n \"0.49939045\",\n \"0.49791563\",\n \"0.4978981\",\n \"0.4968537\",\n \"0.49683052\",\n \"0.49667358\",\n \"0.49667358\",\n \"0.49648935\",\n \"0.49616957\",\n \"0.49615607\",\n \"0.49568725\",\n \"0.49566016\",\n \"0.49545282\",\n \"0.49491417\",\n \"0.49454206\",\n \"0.49435008\",\n \"0.4940012\",\n \"0.493885\",\n \"0.49370372\",\n \"0.4936621\",\n \"0.49363992\",\n \"0.4933166\",\n \"0.4933166\",\n \"0.49307314\",\n \"0.49273986\",\n \"0.49198177\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":988,"cells":{"query":{"kind":"string","value":"/ Largest Island: 12"},"document":{"kind":"string","value":"func main() {\n\tmain1()\n\tmain2()\n\tmain3()\n\tmain4()\n\tmain5()\n\tmain6()\n\tmain7()\n\tmain8()\n\tmain9()\n\tmain10()\n\tmain11()\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func main() {\n\thighestStartingPoint := 0\n\thighestValue := 0\n\tfor i := 1; i < 1000000; i++ {\n\t\tlatz := collatz.From(i)\n\t\tif latz.Length > highestValue {\n\t\t\thighestStartingPoint = i\n\t\t\thighestValue = latz.Length\n\t\t}\n\t}\n\n\tfmt.Println(highestStartingPoint)\n}","func findLargestIslandUtil(arr [][]int, maxCol int, maxRow int, currCol int, currRow int, traversed [][]bool) int {\n\tdir := [][]int{{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}}\n\tvar x, y int\n\tvar sum = 1\n\n\t// Traverse in all eight directions.\n\tfor i := 0; i < 8; i++ {\n\t\tx = currCol + dir[i][0]\n\t\ty = currRow + dir[i][1]\n\t\tif x >= 0 && x < maxCol && y >= 0 && y < maxRow && traversed[x][y] == false && arr[x][y] == 1 {\n\t\t\ttraversed[x][y] = true\n\t\t\tsum += findLargestIslandUtil(arr, maxCol, maxRow, x, y, traversed)\n\t\t}\n\t}\n\n\treturn sum\n}","func getMaxArea(board *[][]int) int {\n\tinfinites := getInfinites(board)\n\tmaxMap := make(map[int]int)\n\tvar max int\n\tfor i := 0; i < len(*board); i++ {\n\t\tfor j := 0; j < len((*board)[i]); j++ {\n\t\t\tpos := (*board)[i][j]\n\t\t\t_, ok := infinites[pos]\n\t\t\tif !ok && pos != -1 {\n\t\t\t\tmaxMap[pos]++\n\t\t\t}\n\t\t\tif maxMap[pos] > max {\n\t\t\t\tmax = maxMap[pos]\n\t\t\t}\n\t\t}\t\n\t}\n\treturn max\n}","func main() {\n fmt.Println(largestIsland([][]int{{1, 0}, {0, 1}}))\n fmt.Println(largestIsland([][]int{{1, 1}, {1, 0}}))\n fmt.Println(largestIsland([][]int{{1, 1}, {1, 1}}))\n x := [][]int{\n {0,0,0,0,0,0,0},{0,1,1,1,1,0,0},{0,1,0,0,1,0,0},{1,0,1,0,1,0,0},{0,1,0,0,1,0,0},{0,1,0,0,1,0,0},{0,1,1,1,1,0,0},\n }\n fmt.Println(largestIsland(x))\n}","func main() {\n\tvar highest int\n\tflag.IntVar(&highest, \"highest\", 1000000, \"highest starting number to test\")\n\tflag.Parse()\n\n\tmaxl, maxn := 1, 1\n\tfor n := highest; n > 1; n-- {\n\t\tl := lenCollatz(n)\n\t\tif l > maxl {\n\t\t\tmaxl = l\n\t\t\tmaxn = n\n\t\t}\n\t}\n\tfmt.Println(maxn)\n}","func main() {\n\td := []int{2, 3, 4, 5, 18, 17, 6}\n\tfmt.Println(maxArea(d))\n\n}","func findMax(sum map[int64]int64) int64 {\n\tdx := int64(0)\n\n\tfor _, v := range sum {\n\t\tdx = int64(math.Max(float64(dx), float64(v)))\n\t}\n\treturn dx\n}","func MaxHailstoneValue(n int) int {\n var max int = n\n for n > 1 {\n var temp int = h(n)\n if temp > max {\n max = temp\n }\n n = temp\n }\n return max\n}","func maxRegion(grid [][]int32) int32 {\n\tvar maxRegion int32\n\tfor row := 0; row < len(grid); row++ {\n\t\tfor column := 0; column < len(grid[row]); column++ {\n\t\t\tif grid[row][column] == 1 {\n\t\t\t\tsize := getRegionSize(grid, row, column)\n\t\t\t\tfmt.Println(\"size\", size, \"maxRegion\", maxRegion)\n\t\t\t\tmaxRegion = int32(math.Max(float64(size), float64(maxRegion)))\n\t\t\t}\n\t\t}\n\t}\n\n\treturn maxRegion\n}","func maxArea(height []int) int {\n\treturn 0\n}","func maxi(x int, y int) int {\n if x >= y {\n return x\n } else {\n return y\n }\n}","func maxRegion(grid [][]int32) int32 {\n\tmax := int32(0)\n\tfor i := 0; i < len(grid); i++ {\n\t\tfor j := 0; j < len(grid[0]); j++ {\n\t\t\tif grid[i][j] == 1 {\n\t\t\t\treg := clearRegion(grid, i, j)\n\t\t\t\tfor i := 0; i < len(grid); i++ {\n\t\t\t\t\t//fmt.Println(grid[i])\n\t\t\t\t}\n\t\t\t\t//fmt.Println(\"----------------\")\n\t\t\t\tif reg > max {\n\t\t\t\t\tmax = reg\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn max\n}","func numDistinctIslands(grid [][]int) int {\n\n}","func FindTheCity(n int, edges [][]int, distanceThreshold int) int {\n\tvar graph [][]int = make([][]int,n)\n\tfor i := 0;i < n;i++{\n\t\tgraph[i] = make([]int,n)\n\t}\n\tfor i := 0;i < n;i++ {\n\t\tfor j := 0; j < n; j++ {\n\t\t\tif i == j {\n\t\t\t\tgraph[i][j] = 0\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tgraph[i][j] = 2147483647\n\t\t}\n\t}\n\tvar l int = len(edges)\n\tfor i := 0;i < l;i++{\n\t\tgraph[edges[i][0]][edges[i][1]] = edges[i][2]\n\t\tgraph[edges[i][1]][edges[i][0]] = edges[i][2]\n\t}\n\tfor k := 0;k < n;k++{\n\t\tfor j := 0;j < n;j++{\n\t\t\tfor i := 0;i < n;i++{\n\t\t\t\tif graph[i][j] > graph[i][k] + graph[k][j]{\n\t\t\t\t\tgraph[i][j] = graph[i][k] + graph[k][j]\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tvar min_cnt int = 2147483647\n\tvar res int = 0\n\tfor i := 0;i < n;i++{\n\t\tvar cnt int = 0\n\t\tfor j := 0;j < n;j++{\n\t\t\tif i == j{\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif graph[i][j] <= distanceThreshold{\n\t\t\t\tcnt++\n\t\t\t}\n\t\t}\n\t\tif cnt <= min_cnt{\n\t\t\tmin_cnt = cnt\n\t\t\tres = i\n\t\t}\n\t}\n\treturn res\n}","func maxYmin(numeros []int) (int, int) { //indicamos los tipos que va retornar (int, int)\n\tvar max, min int\n\n\tfor _, v := range numeros {\n\t\tif v > max {\n\t\t\tmax = v\n\t\t}\n\n\t\tif v < min {\n\t\t\tmin = v\n\t\t}\n\t}\n\n\treturn max, min //indicamos el orden en el que se debe retornar\n}","func HighestPeak(isWater [][]int) [][]int {\n\tvar rows int = len(isWater)\n\tvar columns int = len(isWater[0])\n\tvar res [][]int = make([][]int, rows)\n\tfor i := 0; i < rows; i++ {\n\t\tres[i] = make([]int, columns)\n\t\tfor j := 0; j < columns; j++ {\n\t\t\tres[i][j] = -1\n\t\t}\n\t}\n\tvar q list.List\n\tfor i := 0; i < rows; i++ {\n\t\tfor j := 0; j < columns; j++ {\n\t\t\tif isWater[i][j] == 1 {\n\t\t\t\tvar p point\n\t\t\t\tp.x = i\n\t\t\t\tp.y = j\n\t\t\t\tq.PushBack(p)\n\t\t\t\tres[i][j] = 0\n\t\t\t}\n\t\t}\n\t}\n\tvar dirs [][]int = [][]int{{-1, 0}, {1, 0}, {0, -1}, {0, 1}}\n\tvar height int = 1\n\tfor q.Len() > 0 {\n\t\tvar l int = q.Len()\n\t\tfor i := 0; i < l; i++ {\n\t\t\tvar cur point = q.Front().Value.(point)\n\t\t\tq.Remove(q.Front())\n\t\t\tfor _, dir := range dirs {\n\t\t\t\tnext := cur\n\t\t\t\tnext.x += dir[0]\n\t\t\t\tnext.y += dir[1]\n\t\t\t\tif next.x >= 0 && next.x < rows && next.y >= 0 && next.y < columns {\n\t\t\t\t\tif res[next.x][next.y] == -1 {\n\t\t\t\t\t\tres[next.x][next.y] = height\n\t\t\t\t\t\tq.PushBack(next)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\theight++\n\t}\n\treturn res\n}","func shortestBridge(grid [][]int) int {\n\tm := len(grid)\n\tn := len(grid[0])\n\tvar islands [][]int // 2 slice of locations of 2 islands\n\n\tvar collect func(x, y int, r *[]int)\n\tcollect = func(x, y int, r *[]int) {\n\t\tgrid[y][x] = 0\n\t\t*r = append(*r, x, y)\n\t\tif 0 <= x-1 && grid[y][x-1] == 1 {\n\t\t\tcollect(x-1, y, r)\n\t\t}\n\n\t\tif n > x+1 && grid[y][x+1] == 1 {\n\t\t\tcollect(x+1, y, r)\n\t\t}\n\n\t\tif 0 <= y-1 && grid[y-1][x] == 1 {\n\t\t\tcollect(x, y-1, r)\n\t\t}\n\n\t\tif m > y+1 && grid[y+1][x] == 1 {\n\t\t\tcollect(x, y+1, r)\n\t\t}\n\t}\n\n\tfor y := 0; y < m; y++ {\n\t\tfor x := 0; x < n; x++ {\n\t\t\tif grid[y][x] == 1 {\n\t\t\t\tvar xys []int\n\t\t\t\tcollect(x, y, &xys)\n\t\t\t\tislands = append(islands, xys)\n\t\t\t}\n\t\t}\n\t}\n\n\ta, b := islands[0], islands[1]\n\tbest := math.MaxInt32\n\tfor i := 0; i < len(a) && best > 1; i += 2 {\n\t\tx1, y1 := a[i], a[i+1]\n\t\tfor j := 0; j < len(b) && best > 1; j += 2 {\n\t\t\tx2, y2 := b[j], b[j+1]\n\t\t\td := abs(x2-x1) + abs(y2-y1) - 1\n\t\t\tif d < best {\n\t\t\t\tbest = d\n\t\t\t}\n\t\t}\n\t}\n\treturn best\n}","func Max(x, y int32) int32 {\n\treturn x - (((x - y) >> 31) & (x - y))\n}","func highBitLoc(n uint32) uint32 {\n\treturn uint32(math.Ilogb(float64(n)*2 + 1))\n}","func getMaximumGold(grid [][]int) int {\n m := len(grid)\n n := len(grid[0])\n var ans int\n for i := 0; i<m;i++ {\n for j := 0;j < n; j++ {\n ans = max(ans, dfsGold(grid, m, n, i, j, 0))\n }\n }\n return ans\n}","func largestTriangleArea(points [][]int) float64 {\n \n}","func max(sf ...int64) int64 {\n\tvar max int64\n\tfor _, val := range sf {\n\t\tif val > max {\n\t\t\tmax = val\n\t\t}\n\t}\n\treturn max\n}","func Max(x, y int64) int64 {\n if x > y {\n return x\n }\n return y\n}","func getMaximumGold(grid [][]int) int {\n\tdirections := [][]int{{0, 1}, {0, -1}, {1, 0}, {-1, 0}}\n\n\tif len(grid) == 0 {\n\t\treturn 0\n\t}\n\n\tm, n := len(grid), len(grid[0])\n\tresult := 0\n\n\tfor i := 0; i < m; i++ {\n\t\tfor j := 0; j < n; j++ {\n\t\t\tresult = Max(result, findMaxGold(grid, i, j, directions))\n\t\t}\n\t}\n\treturn result\n}","func largestRectangleAreaUsingStack(heights []int) int {\n\tvar (\n\t\tmax = 0\n\t\tstack = newIntStack()\n\t)\n\n\tstack.push(-1)\n\n\tfor k := range heights {\n\t\tfor stack.top() != -1 && heights[stack.top()] >= heights[k] {\n\t\t\tmax = maxInt(max, heights[stack.pop()]*(k-stack.top()-1))\n\t\t}\n\t\tstack.push(k)\n\t}\n\n\tfor stack.top() != -1 {\n\t\tmax = maxInt(max, heights[stack.pop()]*(len(heights)-stack.top()-1))\n\t}\n\n\treturn max\n}","func maxYmin2(numeros []int) (max int, min int) { //indicamos los tipos y nombre que va retornar (int, int)\n\tfor _, v := range numeros {\n\t\tif v > max {\n\t\t\tmax = v\n\t\t}\n\n\t\tif v < min {\n\t\t\tmin = v\n\t\t}\n\t}\n\n\treturn //ya no necesita return porque ya le indicamos como va retornar y que orden\n}","func main(){\n\tdp := make([]uint, len(w)+1)\n\tfor i := 1; i < len(w)+1; i++{\n\t\tif i == 1 {\n\t\t\tdp[i] = w[i-1][2]\n\t\t}else {\n\t\t\tdp[i] = max(dp[i-1], (dp[free_slot(i-1, w)]+w[i-1][2]))\n\t\t}\n\t}\n\tfmt.Println(dp[len(w)])\n//\tfind_slot(dp)\n}","func max(x, y int) int {\n\tif x < y {\n\t\treturn y\n\t}\n\treturn x\n}","func max(x, y int) int {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func max(x, y int) int {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func max(x, y int) int {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func max(x, y int) int {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func max(x, y int) int {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func (bl branchList) HighestBranchIndexes() []int {\n\tmaxHeight := uint64(0)\n\tvar br branch\n\tcols := []int{}\n\tfor i, b := range bl {\n\t\tif b.height > maxHeight {\n\t\t\tmaxHeight = b.height\n\t\t\tbr = b\n\t\t\tcols = []int{i}\n\t\t} else if b.height == maxHeight && b.addr == br.addr {\n\t\t\tcols = append(cols, i)\n\t\t}\n\t}\n\treturn cols\n}","func getMaximumGold(grid [][]int) int {\n\tvisited := make([][]bool, len(grid))\n\tfor i := range visited {\n\t\tvisited[i] = make([]bool, len(grid[0]))\n\t}\n\tmax, cur := new(int), new(int)\n\tfor i := 0; i < len(grid); i++ {\n\t\tfor j := 0; j < len(grid[0]); j++ {\n\t\t\t// only start from edge cell\n\t\t\tif grid[i][j] > 0 {\n\t\t\t\tvisit(grid, visited, i, j, max, cur)\n\t\t\t}\n\t\t}\n\t}\n\treturn *max\n}","func max(x, y int64) int64 {\n\tif x < y {\n\t\treturn y\n\t}\n\treturn x\n}","func main() {\n\tgreatest := max(10, 20, 15, 8, 9, 6)\n\tfmt.Println(greatest)\n}","func Find_Largest(arr []int ) {\n\tfmt.Println(\"FIND LARGEST VALUE\")\n\tvar largest = -99999999\n\tfor i:=1 ; i < len(arr) ; i++ {\n\t\t\t//fmt.Println(arr[i])\n\t\t\tif largest <= arr[i] {\n\t\t\t\tlargest = arr[i]\n\t\t\t}\n\t\t}\n\t\tfmt.Println(\"Largest: \" , largest )\n}","func max(x int, y int) int {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func MaxValue(freqMap map[string]int) int {\n m := 0\n firstTimeThrough := true\n\n for _, value := range freqMap {\n if firstTimeThrough || value > m {\n m = value\n firstTimeThrough = false\n }\n }\n\n return m\n}","func maxArea(height []int) int {\n maxArea := 0\n maxheight := 0\n for i := 0; i < len(height) -1; i++ {\n for j := i+1; j < len(height); j++ {\n if height[i] >= height[j] {\n maxheight = height[j]\n } else {\n maxheight = height[i]\n }\n if maxArea < (maxheight * (j-i)) {\n maxArea = (maxheight * (j-i))\n }\n }\n }\n return maxArea\n}","func (g *graph) find_max_value(chk *checklist) int {\n\tcurrent := 0\n\tidx := -1\n\tfor i,c := range chk.nodes_count {\n\t\tif c > current {\n\t\t\tidx = i\n\t\t\tcurrent = c\n\t\t}\n\t}\n\tif idx >= 0 { chk.nodes_count[idx] = -1 }\n\treturn idx\n}","func findMax(number []int, max int) (int, func() []int) {\n\tvar res []int\n\tfor _, p := range number {\n\t\tif p <= max {\n\t\t\tres = append(res, p)\n\t\t}\n\t}\n\n\treturn len(res), func() []int {\n\t\treturn res\n\t}\n}","func main() {\n\tfmt.Println(maxDistToClosest([]int{1, 0, 0, 0, 1, 0, 1}))\n\tfmt.Println(maxDistToClosest([]int{1, 0, 0, 0}))\n\tfmt.Println(maxDistToClosest([]int{0, 0, 0, 1}))\n}","func (gossiper *Gossiper) getHighestFit(confirmedGossips []*packets.TLCMessage) (*packets.TLCMessage, int) {\n\tmaxFit := float32(0)\n\tvar maxGossip *packets.TLCMessage\n\tindex := 0\n\tfor i, gossip := range confirmedGossips {\n\t\tif gossip.Fitness > maxFit {\n\t\t\tmaxGossip = gossip\n\t\t\tmaxFit = gossip.Fitness\n\t\t\tindex = i\n\t\t}\n\t}\n\treturn maxGossip, index\n}","func maxIndexSlo(arr []int) int {\n\tii, jj := 0, 0\n\tmaxDiff := 0\n\tfor i := range arr {\n\t\tfor j := i + 1; j < len(arr); j++ {\n\t\t\tif arr[i] <= arr[j] && (j-i) >= maxDiff {\n\t\t\t\tmaxDiff = j - i\n\t\t\t\tii, jj = i, j\n\t\t\t}\n\t\t}\n\t}\n\treturn jj - ii\n}","func Day8Part1(filepath string) any {\n\tvar res int\n\n\t// open file\n\treadFile, _ := os.Open(filepath)\n\n\t// read line\n\tfileScanner := bufio.NewScanner(readFile)\n\tfileScanner.Split(bufio.ScanLines)\n\n\t// parse map in to [][]int\n\ttreeMap := parseMap(fileScanner)\n\t// fmt.Println(treeMap)\n\n\t// init visible trees 2D array\n\tvisible := make([][]bool, len(treeMap))\n\tfor i := range visible {\n\t\tvisible[i] = make([]bool, len(treeMap[0]))\n\t}\n\n\t// look from left to r\n\tfor i := range treeMap {\n\t\tmax := 0\n\t\tfor j := range treeMap[0] {\n\t\t\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\n\t\t\t\tvisible[i][j] = true\n\t\t\t\tmax = treeMap[i][j]\n\t\t\t}\n\t\t}\n\t}\n\n\t// look from right to l\n\tfor i := range treeMap {\n\t\tmax := 0\n\t\tfor j := len(treeMap[0]) - 1; j >= 0; j-- {\n\t\t\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\n\t\t\t\tvisible[i][j] = true\n\t\t\t\tmax = treeMap[i][j]\n\t\t\t}\n\t\t}\n\t}\n\n\t// look from up to down\n\tfor j := 0; j <= len(treeMap[0])-1; j++ {\n\t\tmax := 0\n\t\tfor i := 0; i <= len(treeMap)-1; i++ {\n\t\t\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\n\t\t\t\tvisible[i][j] = true\n\t\t\t\tmax = treeMap[i][j]\n\t\t\t}\n\t\t}\n\t}\n\n\t// look from down to up\n\tfor j := 0; j <= len(treeMap[0])-1; j++ {\n\t\tmax := 0\n\t\tfor i := len(treeMap) - 1; i >= 0; i-- {\n\t\t\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\n\t\t\t\tvisible[i][j] = true\n\t\t\t\tmax = treeMap[i][j]\n\t\t\t}\n\t\t}\n\t}\n\n\t// traverse visible trees 2D array and count visibles\n\tfor i := range visible {\n\t\tfor j := range visible[i] {\n\t\t\tif visible[i][j] {\n\t\t\t\tres++\n\t\t\t}\n\t\t}\n\t}\n\n\treturn res\n}","func maxArea(height []int) int {\n\tmaxArea := 0\n\tfor i, v := range height {\n\t\tfor j := i + 1; j < len(height); j++ {\n\t\t\tcurrentArea := min(v, height[j]) * (j - i)\n\t\t\tif maxArea < currentArea {\n\t\t\t\tmaxArea = currentArea\n\t\t\t}\n\t\t}\n\t}\n\treturn maxArea\n}","func findCheapestPrice(n int, flights [][]int, src int, dst int, K int) int {\n \n}","func largestRectangleArea(heights []int) int {\n\tl := len(heights)\n\tif l == 1{\n\t\treturn heights[0]\n\t}\n\tvar s []int\n\tvar max int = 0\n\theights = append(heights, 0)\n\tl++\n\tfor i := 0;i < l;i++{\n\t\tif len(s) == 0 || heights[i] > heights[s[len(s) - 1]]{\n\t\t\ts = append(s,i)\n\t\t\tcontinue\n\t\t}\n\t\tfor len(s) > 0 && heights[i] < heights[s[len(s) - 1]] {\n\t\t\th := heights[s[len(s) - 1]]\n\t\t\ts = s[:len(s) - 1]\n\t\t\tvar res int = 0\n\t\t\tif len(s) == 0{\n\t\t\t\tres = h * i\n\t\t\t}else{\n\t\t\t\tres = h * (i - 1 - s[len(s) - 1])\n\t\t\t}\n\t\t\tif res > max{\n\t\t\t\tmax = res\n\t\t\t}\n\t\t}\n\t\ts = append(s,i)\n\t}\n\treturn max\n}","func main() {\n\tn := max(1, 2, 3, 4, 5, 6, 7, 8, 9, 20)\n\tfmt.Println(n)\n}","func findMaxConsecutiveOnes(nums []int) int {\n \n}","func Max(x, y int) int {\n if x < y {\n return y\n }\n return x\n}","func findShortestSubArray(nums []int) int {\n \n}","func maxArea(height []int) int {\n\tmaxArea := 0.0\n\tright := len(height) - 1\n\tleft := 0\n\t//简化代码 简化的点在于go自带的min函数只能比float\n\tfor left < right {\n\t\tmaxArea = math.Max(maxArea, math.Min(float64(height[right]), float64(height[left]))*float64(right-left))\n\t\tif height[right] > height[left] {\n\t\t\tleft += 1\n\t\t} else {\n\t\t\tright -= 1\n\t\t}\n\t}\n\t/*for left<right {\n\t\tminHeight := 0\n\t\tif height[right] > height[left]{\n\t\t\tminHeight = height[left]\n\t\t\tleft+=1\n\t\t}else{\n\t\t\tminHeight = height[right]\n\t\t\tright -=1\n\t\t}\n\t\tif (right-left+1)* minHeight > maxArea{\n\t\t\tmaxArea = (right-left+1)* minHeight\n\t\t}\n\t}*/\n\treturn int(maxArea)\n}","func max(m, n int) (int, bool) {\n\tif m > n {\n\t\treturn m, true\n\t}\n\treturn n, false\n}","func MaxI(x, y int) int {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func flatlandSpaceStations(n int32, c []int32) (maxDistance int32) {\n\tvar (\n\t\ttmpDistance int32\n\t\ttmpMaxDistance int32\n\t\tinitStation = false\n\t\tcities = populateCity(n, c)\n\t)\n\n\t//fmt.Println(cities)\n\n\tfor _, v := range cities {\n\t\tif !v.hasStation {\n\t\t\ttmpDistance++\n\t\t} else {\n\t\t\tif initStation {\n\t\t\t\ttmpMaxDistance = (tmpDistance + 1) / 2\n\t\t\t} else {\n\t\t\t\ttmpMaxDistance = tmpDistance\n\t\t\t}\n\n\t\t\t// Set the max distance\n\t\t\tif tmpMaxDistance >= maxDistance {\n\t\t\t\tmaxDistance = tmpMaxDistance\n\t\t\t}\n\n\t\t\ttmpDistance = 0\n\t\t\tinitStation = true\n\t\t}\n\t}\n\n\t// When does not exist station on the last city\n\tif tmpDistance != 0 {\n\t\ttmpMaxDistance = tmpDistance\n\t\tif tmpMaxDistance >= maxDistance {\n\t\t\tmaxDistance = tmpMaxDistance\n\t\t}\n\t}\n\treturn\n}","func findHighestValue(matrix [][]score) (topValue, x, y int) {\n\tvar currLargest, currX, currY int\n\tvar currValue int\n\tfor i := 0; i < len(matrix); i++ {\n\t\tfor j := 0; j < len(matrix[i]); j++ {\n\t\t\tcurrValue = matrix[i][j].value\n\t\t\tif currValue > currLargest {\n\t\t\t\tcurrLargest = currValue\n\t\t\t\tcurrX = i\n\t\t\t\tcurrY = j\n\t\t\t}\n\t\t}\n\t}\n\treturn currLargest, currX, currY\n}","func MaxLamport(x, y Lamport) Lamport {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func max(x, y int) int {\n\tif x > y {\n\t\treturn x\n\t} else {\n\t\treturn y\n\t}\n}","func largestRectangle(h []int32) int64 {\n\t// how can we easily keep track of the minimum?\n\t// naive approach - recalculate it each time\n\t// will be something like O(n^2) since calculating\n\t// minimum is O(n)\n\t// and brute-force trying all possible sets of buildings\n\t// is also O(n^2)\n\t// so maybe worse than n^2\n\n\t// array of answers where i = index of start\n\t// and k = index of end\n\t// will be a triangular array since k >= i\n\t// equivalently, could have array of i and length\n\t/*\n\t\teg for array [6 3 2 5 4 1]\n\t\twould look like (index, length)\n\t\t6 3 2 2 2 1\n\t\t3 2 2 2 1\n\t\t2 2 2 1\n\t\t5 4 1\n\t\t4 1\n\t\t1\n\t\tor (startindex, endindex)\n\t\t6 3 2 2 2 1\n\t\t- 3 2 2 2 1\n\t\t- - 2 2 2 1\n\t\t- - - 5 4 1\n\t\t- - - - 4 1\n\t\t- - - - - 1\n\t*/\n\n\t// build up 2D array of minimum heights\n\t// 0 index means length of 1\n\t// min(i, 0) = i\n\t// min(i, 1) = min(min(i, 0), i + 1)\n\t// min(i, k +1) = min(min(i, k), i+k+1)\n\t// in array notation:\n\t// arr[i][k+1] = min(arr[i][k], arr[i+k])\n\tvar minHeightArray = make([][]int64, len(h))\n\n\t// initialise array\n\tfor i, v := range h {\n\t\tminHeightArray[i] = make([]int64, len(h))\n\t\tminHeightArray[i][0] = int64(v)\n\t}\n\t// flesh out rest of array\n\tfor i := range h { // here j is length of slice\n\t\tfor j := 1; j < len(h)-i; j++ { // start index must be low enough to allow slice length\n\t\t\tminHeightArray[i][j] = minInt(minHeightArray[i][j-1], minHeightArray[i+j][0])\n\t\t}\n\t}\n\n\tvar area, maxArea int64\n\n\tfor i := range h {\n\t\tfor j := 1; j < len(h)-i; j++ {\n\t\t\tarea = int64(j+1) * minHeightArray[i][j]\n\t\t\tif area > maxArea {\n\t\t\t\tmaxArea = area\n\t\t\t}\n\t\t}\n\t}\n\n\treturn maxArea\n}","func maxSlidingWindow(nums []int, k int) []int {\n\n\treturn nums\n}","func findMaxLength(nums []int) int {\n\tm := map[int]int{} //key is count, value is index\n\n\tvar count, maxVal int\n\tm[0] = -1\n\tfor i, num := range nums {\n\t\tif num == 0 {\n\t\t\tcount--\n\t\t} else {\n\t\t\tcount++\n\t\t}\n\t\tidx, ok := m[count]\n\t\tif ok {\n\t\t\tmaxVal = max(maxVal, i-idx)\n\t\t} else {\n\t\t\tm[count] = i\n\t\t}\n\t}\n\n\treturn maxVal\n}","func Max(x, y int) int {\n\tif x < y {\n\t\treturn y\n\t}\n\treturn x\n}","func Max(x, y int) int {\n\tif y > x {\n\t\treturn y\n\t}\n\treturn x\n}","func maxSideLength(mat [][]int, threshold int) int {\n\t// acc[i][j]: the accumulated sum right and bottom of point (i, j)\n\tm, n := len(mat), len(mat[0])\n acc := make([][]int, m+1)\n for i := range acc {\n \tacc[i] = make([]int, n+1)\n\t}\n\tfor i:=m-1; i>=0; i-- {\n\t\tfor j:=n-1; j>=0; j-- {\n\t\t\tacc[i][j] = mat[i][j]+acc[i+1][j]+acc[i][j+1]-acc[i+1][j+1]\n\t\t}\n\t}\n\t// binary search for low=0 and high=min(m,n). for each mid,\n\t// check if there exists one square with side length <= threshold\n\t// time is m*n*log(min(m,n))\n\tlo, hi := 1, m+1\n\tif m>n {\n\t\thi = n+1\n\t}\n\tfor lo<hi {\n\t\tmid := (lo+hi)/2\n\t\texist := false\n\t\touter: for i:=0; i+mid<=m; i++ {\n\t\t\tfor j:=0; j+mid<=n; j++ {\n\t\t\t\tarea := acc[i][j]-acc[i+mid][j]-acc[i][j+mid]+acc[i+mid][j+mid]\n\t\t\t\tif area<=threshold {\n\t\t\t\t\texist = true\n\t\t\t\t\tbreak outer\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// we want the max value of that CAN. so we search the first CAN'T. the candidate is 1 to n,\n\t\t// so we let lo=1, hi=n+1. the loop end with lo=hi with first that CAN'T. so lo-1 is max value that CAN.\n\t\tif exist {\n\t\t\tlo = mid+1\n\t\t} else {\n\t\t\thi = mid\n\t\t}\n\t}\n\treturn lo-1\n}","func findLargestNumber(args ...int) int {\n\tnumber := args[0]\n\n\tfor _, value := range args {\n\t\tif value > number {\n\t\t\tnumber = value\n\t\t}\n\t}\n\treturn number\n}","func Solution(C []int, k int) int {\n\tn := len(C) + 1\n\tdp := make([][]int, n)\n\tfor i := range dp {\n\t\tdp[i] = make([]int, k+1)\n\t}\n\n\tfor i := 0; i < n; i++ {\n\t\tdp[i][0] = 0\n\t}\n\n\tfor i := 1; i <= k; i++ {\n\t\tdp[0][i] = math.MaxInt64\n\t}\n\n\tfor i := 1; i < n; i++ {\n\t\tfor j := 1; j <= k; j++ {\n\t\t\tCmax := C[0]\n\t\t\tfor idx := 0; idx < i; idx++ {\n\t\t\t\tif C[idx] > j {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tCmax = C[idx]\n\t\t\t}\n\n\t\t\tdpij1 := dp[i][j-Cmax] + 1\n\t\t\tdpij2 := dp[i-1][j]\n\t\t\tif dpij1 <= dpij2 {\n\t\t\t\tdp[i][j] = dpij1\n\t\t\t} else {\n\t\t\t\tdp[i][j] = dpij2\n\t\t\t}\n\t\t}\n\t}\n\n\t//printDp(dp)\n\n\treturn dp[n-1][k]\n}","func Max(x, y int) int {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func Max(x, y int) int {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func getMaxLen(nums []int) int {\n\tmaxlen := 0\n\ts := -1\n\tfn, ln, negs := -1, -1, 0\n\tfor i:=0; i<=len(nums); i++ {\n\t\t// add zero at end to trigger final compute\n\t\tv := 0\n\t\tif i<len(nums) {\n\t\t\tv = nums[i]\n\t\t}\n\n\t\t// find an interval\n\t\tif v==0 { \n\t\t\tif i-s > 1 { // non-empty interval\n\t\t\t\tif negs%2==0 { // even negs, whole interval is ok\n\t\t\t\t\tmaxlen = max(maxlen, i-s-1)\n\t\t\t\t} else {\n\t\t\t\t\tmaxlen = max(maxlen, max(ln-s-1, i-fn-1))\n\t\t\t\t}\n\t\t\t}\n\t\t\tfn, ln, s = i, i, i\n\t\t\tnegs = 0\n\t\t}\n\n\t\t// find a value\n\t\tif v < 0 {\n\t\t\tnegs++\n\t\t\tif fn==s {\n\t\t\t\tfn = i\n\t\t\t}\n\t\t\tln = i\n\t\t}\n\t\t// if v > 0, do nothing\n\t}\n return maxlen\n}","func findMax(vals []float64) float64 {\n\tmax := float64(vals[0])\n\tfor v := range vals {\n\t\tif vals[v] > max {\n\t\t\tmax = vals[v]\n\t\t}\n\t}\n\treturn float64(max)\n}","func Max(x, y int64) int64 {\n\tif x > y {\n\t\treturn x\n\t}\n\treturn y\n}","func Max(x int, y int) int {\n\tif x > y { return x }\n\treturn y\n}","func Mimax(nums ...int) (int, int) {\n\tmin, max := nums[0], nums[0]\n\n\tfor _, num := range nums {\n\t\tif min > num {\n\t\t\tmin = num\n\t\t}\n\n\t\tif max < num {\n\t\t\tmax = num\n\t\t}\n\t}\n\n\treturn min, max\n}","func (f *fragment) max(filter *Row, bitDepth uint) (max int64, count uint64, err error) {\n\tconsider := f.row(bsiExistsBit)\n\tif filter != nil {\n\t\tconsider = consider.Intersect(filter)\n\t}\n\n\t// If there are no columns to consider, return early.\n\tif !consider.Any() {\n\t\treturn 0, 0, nil\n\t}\n\n\t// Find lowest negative number w/o sign and negate, if no positives are available.\n\tpos := consider.Difference(f.row(bsiSignBit))\n\tif !pos.Any() {\n\t\tmax, count = f.minUnsigned(consider, bitDepth)\n\t\treturn -max, count, nil\n\t}\n\n\t// Otherwise find highest positive number.\n\tmax, count = f.maxUnsigned(pos, bitDepth)\n\treturn max, count, nil\n}","func findCenter(edges [][]int) int {\n\tnumberMap, l := make(map[int]int), len(edges)\n\tfor _, edge := range edges {\n\t\tnumberMap[edge[0]]++\n\t\tnumberMap[edge[1]]++\n\t}\n\tfor key, value := range numberMap {\n\t\tif value == l {\n\t\t\treturn key\n\t\t}\n\t}\n\treturn -1\n}","func max(x int) int {\n\treturn 40 + x\n}","func main() {\n\n\thittable := make(map[int]bool)\n\tans := int64(0)\n\n\tfor i := 1; i*i <= top*9*9; i++ {\n\t\thittable[i*i] = true\n\t}\n\n\tfor i := range hittable {\n\t\tways, _ := enumerate(9, top, i)\n\t\tfor i := 0; i < len(ways); i++ {\n\t\t\tans += process(ways[i])\n\t\t\tans %= mod\n\t\t}\n\t}\n\n\tfmt.Println(\"171/ Find the last nine digits of the sum of all n, 0 < n < 10^20, such that f(n) is a perfect square\")\n\tfmt.Println(ans)\n}","func main() {\n\tmountain = [5][5]int{\n\t\t{1, 2, 3, 4, 5},\n\t\t{16, 17, 18, 19, 6},\n\t\t{15, 24, 25, 20, 7},\n\t\t{14, 23, 22, 21, 8},\n\t\t{13, 12, 11, 10, 9},\n\t}\n\tmax := 0\n\n\tfor i := 0; i < 5; i++ {\n\t\tfor j := 0; j < 5; j++ {\n\t\t\tpath[i][j] = dfs(i, j) + 1\n\t\t\tif path[i][j] >= max {\n\t\t\t\tmax = path[i][j]\n\t\t\t}\n\t\t}\n\t}\n\tfmt.Printf(\"the longest path size is %d %v\\n\", max, path)\n\n}","func Max(i, j int) int {\n\tif i > j {\n\t\treturn i\n\t}\n\treturn j\n}","func findMaxPosition(data []int) int {\n\tif len(data) == 0 {\n\t\treturn -1\n\t}\n\tvar position int\n\tmax := data[0]\n\n\tfor index := 0; index < len(data); index++ {\n\t\tif data[index] > max {\n\t\t\tmax = data[index]\n\t\t\tposition = index\n\t\t}\n\t}\n\treturn position\n}","func Max(x, y int64) int64 {\n\treturn x ^ ((x ^ y) & ((x - y) >> 63))\n}","func numIslands(grid [][]byte) int {\n\tx := len(grid)\n\tif x == 0 {\n\t\treturn 0\n\t}\n\ty := len(grid[0])\n\tcount := 0\n\tfor i := 0; i < x; i++ {\n\t\tfor j := 0; j < y; j++ {\n\t\t\tif grid[i][j] == 0 {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tmarkIsland(grid, i, j, func(i, j int) bool {\n\t\t\t\tif i < 0 || j < 0 || i >= x || j >= y || grid[i][j] == 0 {\n\t\t\t\t\treturn false\n\t\t\t\t}\n\t\t\t\treturn true\n\t\t\t})\n\t\t\tcount += 1\n\t\t}\n\t}\n\treturn count\n}","func maximize() int64 {\n\tmax := 0\n\tmaxItem := int64(0)\n\t// var cache Cache\n\n\t// The larger the cache, the faster it is. Even without a\n\t// cache, it's only around a second on a modern machine, so\n\t// not that big of a deal.\n\t// cache.init(10000)\n\n\tfor x := int64(1); x < 1000000; x++ {\n\t\tcount := collatz2(x)\n\t\t// count := cache.chainLen(x)\n\t\tif count > max {\n\t\t\tmax = count\n\t\t\tmaxItem = x\n\t\t}\n\t}\n\tfmt.Printf(\"%d, %d\\n\", maxItem, max)\n\treturn maxItem\n}","func rmax(data ArrType) float64 {\r\n\tvar i, idxCari, idxMax int\r\n\ti = 0\r\n\tidxCari = 1\r\n\tidxMax = 0\r\n\tfor i < N-1 { // N-1 karena idxCari = i + 1 sehingga data terakhir masih diperhitungkan\r\n\t\tif data[idxCari].f3 > data[idxMax].f3 {\r\n\t\t\tidxMax = idxCari\r\n\t\t}\r\n\t\tidxCari++\r\n\t\ti++\r\n\t}\r\n\treturn data[idxMax].f3\r\n}","func findBiggest(numbers ...int) int {\n\tvar biggest int\n\t//iterate over numbers\n\tfor _, v := range numbers {\n\t\tif v > biggest {\n\t\t\tbiggest = v\n\t\t}\n\t}\n\n\treturn biggest\n}","func MaximalRectangle(matrix [][]byte) int {\n type point struct {\n i, j int\n }\n // re map right bottom point to left top point for all rectangles which contain only \"1\"\n re := make(map[point]map[point]bool)\n var maxArea, area int\n for i := range matrix {\n for j := range matrix[i] {\n if matrix[i][j] == '0' {\n continue\n }\n re[point{i,j}] = map[point]bool{point{i,j}: true}\n if maxArea == 0 {\n maxArea = 1\n }\n\n if i > 0 {\n jLeftTop := j-1\n for jLeftTop >= 0 && matrix[i][jLeftTop] == '1' {\n jLeftTop--\n }\n m, exist := re[point{i-1, j}]\n if exist {\n for p := range m {\n if p.j > jLeftTop {\n re[point{i, j}][p] = true\n area = (i-p.i+1) * (j-p.j+1)\n if area > maxArea {\n maxArea = area\n }\n }\n }\n }\n }\n\n if j > 0 {\n iLeftTop := i-1\n for iLeftTop >= 0 && matrix[iLeftTop][j] == '1' {\n iLeftTop--\n }\n m, exist := re[point{i, j-1}]\n if exist {\n for p := range m {\n if p.i > iLeftTop {\n re[point{i, j}][p] = true\n area = (i-p.i+1) * (j-p.j+1)\n if area > maxArea {\n maxArea = area\n }\n }\n }\n }\n }\n }\n }\n\n return maxArea\n}","func max(a, b int32) int32 {\n\tif a >= b {\n\t\treturn a\n\t}\n\treturn b\n}","func lastPersonDistances(numStalls, numPeople uint64) (min uint64, max uint64) {\n\tb := newBathroom(numStalls)\n\n\tvar placed uint64\n\tfor numPeople > placed {\n\t\tvar count uint64\n\t\tmin, max, count = b.addPeople()\n\t\tplaced += count\n\t}\n\n\treturn min, max\n}","func largestRectangleArea(heights []int) int {\n\theiList := []int{} // save height with grow\n\theiLengthList := []int{} // save line length with height\n\tmax := 0\n\tfor i, currHei := range heights {\n\t\tj := len(heiList) - 1\n\t\tcurrPos := i\n\t\tfor ; j >= 0; j-- {\n\t\t\t// if current height larger than the tail of heiList,remove it\n\t\t\tif heiList[j] >= currHei {\n\t\t\t\tarea := (i - heiLengthList[j]) * heiList[j]\n\t\t\t\tif area > max {\n\t\t\t\t\tmax = area\n\t\t\t\t}\n\t\t\t\tcurrPos = heiLengthList[j]\n\t\t\t} else {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\theiList = append(heiList[:j+1], currHei)\n\t\theiLengthList = append(heiLengthList[:j+1], currPos)\n\t}\n\tfor j := len(heiList) - 1; j >= 0; j-- {\n\t\tarea := (len(heights) - heiLengthList[j]) * heiList[j]\n\t\tif area > max {\n\t\t\tmax = area\n\t\t}\n\t}\n\treturn max\n}","func maxSubArray(nums []int) int {\n\tstMax := -1\n\tvar max int\n\t// var endMax int\n\tfor st := 0; st < len(nums); st++ {\n\t\tsum := 0\n\t\tfor end := st; end < len(nums); end++ {\n\t\t\tsum += nums[end]\n\t\t\tif (stMax < 0) || (sum > max) {\n\t\t\t\tmax = sum\n\t\t\t\tstMax = st\n\t\t\t\t// end_max = end\n\t\t\t}\n\t\t}\n\t}\n\treturn max\n}","func maxI(a int, b int) (res int) {\n\tif a < b {\n\t\tres = b\n\t} else {\n\t\tres = a\n\t}\n\n\treturn\n}","func Solution(A []int) int {\n\t// write your code in Go 1.4\n\tvar peakIndex []int\n\t// var currentFlags int\n\tfor i, val := range A {\n\t\tif i == 0 || i == len(A)-1 {\n\t\t\tcontinue\n\t\t} else if val > A[i-1] && val > A[i+1] {\n\t\t\tfmt.Printf(\"masuk sini val %v\\n\", val)\n\t\t\tpeakIndex = append(peakIndex, i)\n\t\t}\n\t}\n\tk := len(peakIndex)\n\tif k == 0 {\n\t\treturn 0\n\t}\n\tfmt.Printf(\"peakIndex %v\\n\", peakIndex)\n\treturn k\n}","func largestOpenInterval(intervals []Interval) Interval {\n\tresult := Interval{}\n\tif len(intervals) <= 1 {\n\t\treturn result\n\t}\n\n\tmaxTime := 0\n\tfor i := 1; i < len(intervals); i++ {\n\t\ttime := intervals[i].Start - intervals[i-1].End\n\t\tif time > maxTime {\n\t\t\tmaxTime = time\n\t\t\tresult.Start = intervals[i-1].End\n\t\t\tresult.End = intervals[i].Start\n\t\t}\n\t}\n\n\treturn result\n}","func max(a, b int) int {\nif a < b {\nreturn b\n}\nreturn a\n}","func MinimizeStops() int {\n\ttopography := parseMap()\n\tresult := 1\n\tfor _, angle := range [][2]int{{1, 1}, {3, 1}, {5, 1}, {7, 1}, {1, 2}} {\n\t\tresult *= topography.countTrees(angle[0], angle[1])\n\t}\n\treturn result\n}","func thirdMax(nums []int) int {\n\tconst min = math.MinInt32-1\n\tfl,sl,tl := min,min,min\n\tfor _, v := range nums{\n\t\tif v>fl{\n\t\t\ttl=sl\n\t\t\tsl=fl\n\t\t\tfl=v\n\t\t} else if v>sl && v !=fl {\n\t\t\ttl=sl\n\t\t\tsl=v\n\t\t} else if v>tl && v !=sl && v!=fl {\n\t\t\ttl=v\n\t\t}\n\n\t}\n\tif tl== min{\n\t\treturn fl\n\t}\n\treturn tl\n}","func Imax(a, b int) int {\n\tif a > b {\n\t\treturn a\n\t}\n\treturn b\n}","func Imax(a, b int) int {\n\tif a > b {\n\t\treturn a\n\t}\n\treturn b\n}"],"string":"[\n \"func main() {\\n\\thighestStartingPoint := 0\\n\\thighestValue := 0\\n\\tfor i := 1; i < 1000000; i++ {\\n\\t\\tlatz := collatz.From(i)\\n\\t\\tif latz.Length > highestValue {\\n\\t\\t\\thighestStartingPoint = i\\n\\t\\t\\thighestValue = latz.Length\\n\\t\\t}\\n\\t}\\n\\n\\tfmt.Println(highestStartingPoint)\\n}\",\n \"func findLargestIslandUtil(arr [][]int, maxCol int, maxRow int, currCol int, currRow int, traversed [][]bool) int {\\n\\tdir := [][]int{{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}}\\n\\tvar x, y int\\n\\tvar sum = 1\\n\\n\\t// Traverse in all eight directions.\\n\\tfor i := 0; i < 8; i++ {\\n\\t\\tx = currCol + dir[i][0]\\n\\t\\ty = currRow + dir[i][1]\\n\\t\\tif x >= 0 && x < maxCol && y >= 0 && y < maxRow && traversed[x][y] == false && arr[x][y] == 1 {\\n\\t\\t\\ttraversed[x][y] = true\\n\\t\\t\\tsum += findLargestIslandUtil(arr, maxCol, maxRow, x, y, traversed)\\n\\t\\t}\\n\\t}\\n\\n\\treturn sum\\n}\",\n \"func getMaxArea(board *[][]int) int {\\n\\tinfinites := getInfinites(board)\\n\\tmaxMap := make(map[int]int)\\n\\tvar max int\\n\\tfor i := 0; i < len(*board); i++ {\\n\\t\\tfor j := 0; j < len((*board)[i]); j++ {\\n\\t\\t\\tpos := (*board)[i][j]\\n\\t\\t\\t_, ok := infinites[pos]\\n\\t\\t\\tif !ok && pos != -1 {\\n\\t\\t\\t\\tmaxMap[pos]++\\n\\t\\t\\t}\\n\\t\\t\\tif maxMap[pos] > max {\\n\\t\\t\\t\\tmax = maxMap[pos]\\n\\t\\t\\t}\\n\\t\\t}\\t\\n\\t}\\n\\treturn max\\n}\",\n \"func main() {\\n fmt.Println(largestIsland([][]int{{1, 0}, {0, 1}}))\\n fmt.Println(largestIsland([][]int{{1, 1}, {1, 0}}))\\n fmt.Println(largestIsland([][]int{{1, 1}, {1, 1}}))\\n x := [][]int{\\n {0,0,0,0,0,0,0},{0,1,1,1,1,0,0},{0,1,0,0,1,0,0},{1,0,1,0,1,0,0},{0,1,0,0,1,0,0},{0,1,0,0,1,0,0},{0,1,1,1,1,0,0},\\n }\\n fmt.Println(largestIsland(x))\\n}\",\n \"func main() {\\n\\tvar highest int\\n\\tflag.IntVar(&highest, \\\"highest\\\", 1000000, \\\"highest starting number to test\\\")\\n\\tflag.Parse()\\n\\n\\tmaxl, maxn := 1, 1\\n\\tfor n := highest; n > 1; n-- {\\n\\t\\tl := lenCollatz(n)\\n\\t\\tif l > maxl {\\n\\t\\t\\tmaxl = l\\n\\t\\t\\tmaxn = n\\n\\t\\t}\\n\\t}\\n\\tfmt.Println(maxn)\\n}\",\n \"func main() {\\n\\td := []int{2, 3, 4, 5, 18, 17, 6}\\n\\tfmt.Println(maxArea(d))\\n\\n}\",\n \"func findMax(sum map[int64]int64) int64 {\\n\\tdx := int64(0)\\n\\n\\tfor _, v := range sum {\\n\\t\\tdx = int64(math.Max(float64(dx), float64(v)))\\n\\t}\\n\\treturn dx\\n}\",\n \"func MaxHailstoneValue(n int) int {\\n var max int = n\\n for n > 1 {\\n var temp int = h(n)\\n if temp > max {\\n max = temp\\n }\\n n = temp\\n }\\n return max\\n}\",\n \"func maxRegion(grid [][]int32) int32 {\\n\\tvar maxRegion int32\\n\\tfor row := 0; row < len(grid); row++ {\\n\\t\\tfor column := 0; column < len(grid[row]); column++ {\\n\\t\\t\\tif grid[row][column] == 1 {\\n\\t\\t\\t\\tsize := getRegionSize(grid, row, column)\\n\\t\\t\\t\\tfmt.Println(\\\"size\\\", size, \\\"maxRegion\\\", maxRegion)\\n\\t\\t\\t\\tmaxRegion = int32(math.Max(float64(size), float64(maxRegion)))\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn maxRegion\\n}\",\n \"func maxArea(height []int) int {\\n\\treturn 0\\n}\",\n \"func maxi(x int, y int) int {\\n if x >= y {\\n return x\\n } else {\\n return y\\n }\\n}\",\n \"func maxRegion(grid [][]int32) int32 {\\n\\tmax := int32(0)\\n\\tfor i := 0; i < len(grid); i++ {\\n\\t\\tfor j := 0; j < len(grid[0]); j++ {\\n\\t\\t\\tif grid[i][j] == 1 {\\n\\t\\t\\t\\treg := clearRegion(grid, i, j)\\n\\t\\t\\t\\tfor i := 0; i < len(grid); i++ {\\n\\t\\t\\t\\t\\t//fmt.Println(grid[i])\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//fmt.Println(\\\"----------------\\\")\\n\\t\\t\\t\\tif reg > max {\\n\\t\\t\\t\\t\\tmax = reg\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn max\\n}\",\n \"func numDistinctIslands(grid [][]int) int {\\n\\n}\",\n \"func FindTheCity(n int, edges [][]int, distanceThreshold int) int {\\n\\tvar graph [][]int = make([][]int,n)\\n\\tfor i := 0;i < n;i++{\\n\\t\\tgraph[i] = make([]int,n)\\n\\t}\\n\\tfor i := 0;i < n;i++ {\\n\\t\\tfor j := 0; j < n; j++ {\\n\\t\\t\\tif i == j {\\n\\t\\t\\t\\tgraph[i][j] = 0\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tgraph[i][j] = 2147483647\\n\\t\\t}\\n\\t}\\n\\tvar l int = len(edges)\\n\\tfor i := 0;i < l;i++{\\n\\t\\tgraph[edges[i][0]][edges[i][1]] = edges[i][2]\\n\\t\\tgraph[edges[i][1]][edges[i][0]] = edges[i][2]\\n\\t}\\n\\tfor k := 0;k < n;k++{\\n\\t\\tfor j := 0;j < n;j++{\\n\\t\\t\\tfor i := 0;i < n;i++{\\n\\t\\t\\t\\tif graph[i][j] > graph[i][k] + graph[k][j]{\\n\\t\\t\\t\\t\\tgraph[i][j] = graph[i][k] + graph[k][j]\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvar min_cnt int = 2147483647\\n\\tvar res int = 0\\n\\tfor i := 0;i < n;i++{\\n\\t\\tvar cnt int = 0\\n\\t\\tfor j := 0;j < n;j++{\\n\\t\\t\\tif i == j{\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tif graph[i][j] <= distanceThreshold{\\n\\t\\t\\t\\tcnt++\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif cnt <= min_cnt{\\n\\t\\t\\tmin_cnt = cnt\\n\\t\\t\\tres = i\\n\\t\\t}\\n\\t}\\n\\treturn res\\n}\",\n \"func maxYmin(numeros []int) (int, int) { //indicamos los tipos que va retornar (int, int)\\n\\tvar max, min int\\n\\n\\tfor _, v := range numeros {\\n\\t\\tif v > max {\\n\\t\\t\\tmax = v\\n\\t\\t}\\n\\n\\t\\tif v < min {\\n\\t\\t\\tmin = v\\n\\t\\t}\\n\\t}\\n\\n\\treturn max, min //indicamos el orden en el que se debe retornar\\n}\",\n \"func HighestPeak(isWater [][]int) [][]int {\\n\\tvar rows int = len(isWater)\\n\\tvar columns int = len(isWater[0])\\n\\tvar res [][]int = make([][]int, rows)\\n\\tfor i := 0; i < rows; i++ {\\n\\t\\tres[i] = make([]int, columns)\\n\\t\\tfor j := 0; j < columns; j++ {\\n\\t\\t\\tres[i][j] = -1\\n\\t\\t}\\n\\t}\\n\\tvar q list.List\\n\\tfor i := 0; i < rows; i++ {\\n\\t\\tfor j := 0; j < columns; j++ {\\n\\t\\t\\tif isWater[i][j] == 1 {\\n\\t\\t\\t\\tvar p point\\n\\t\\t\\t\\tp.x = i\\n\\t\\t\\t\\tp.y = j\\n\\t\\t\\t\\tq.PushBack(p)\\n\\t\\t\\t\\tres[i][j] = 0\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvar dirs [][]int = [][]int{{-1, 0}, {1, 0}, {0, -1}, {0, 1}}\\n\\tvar height int = 1\\n\\tfor q.Len() > 0 {\\n\\t\\tvar l int = q.Len()\\n\\t\\tfor i := 0; i < l; i++ {\\n\\t\\t\\tvar cur point = q.Front().Value.(point)\\n\\t\\t\\tq.Remove(q.Front())\\n\\t\\t\\tfor _, dir := range dirs {\\n\\t\\t\\t\\tnext := cur\\n\\t\\t\\t\\tnext.x += dir[0]\\n\\t\\t\\t\\tnext.y += dir[1]\\n\\t\\t\\t\\tif next.x >= 0 && next.x < rows && next.y >= 0 && next.y < columns {\\n\\t\\t\\t\\t\\tif res[next.x][next.y] == -1 {\\n\\t\\t\\t\\t\\t\\tres[next.x][next.y] = height\\n\\t\\t\\t\\t\\t\\tq.PushBack(next)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\theight++\\n\\t}\\n\\treturn res\\n}\",\n \"func shortestBridge(grid [][]int) int {\\n\\tm := len(grid)\\n\\tn := len(grid[0])\\n\\tvar islands [][]int // 2 slice of locations of 2 islands\\n\\n\\tvar collect func(x, y int, r *[]int)\\n\\tcollect = func(x, y int, r *[]int) {\\n\\t\\tgrid[y][x] = 0\\n\\t\\t*r = append(*r, x, y)\\n\\t\\tif 0 <= x-1 && grid[y][x-1] == 1 {\\n\\t\\t\\tcollect(x-1, y, r)\\n\\t\\t}\\n\\n\\t\\tif n > x+1 && grid[y][x+1] == 1 {\\n\\t\\t\\tcollect(x+1, y, r)\\n\\t\\t}\\n\\n\\t\\tif 0 <= y-1 && grid[y-1][x] == 1 {\\n\\t\\t\\tcollect(x, y-1, r)\\n\\t\\t}\\n\\n\\t\\tif m > y+1 && grid[y+1][x] == 1 {\\n\\t\\t\\tcollect(x, y+1, r)\\n\\t\\t}\\n\\t}\\n\\n\\tfor y := 0; y < m; y++ {\\n\\t\\tfor x := 0; x < n; x++ {\\n\\t\\t\\tif grid[y][x] == 1 {\\n\\t\\t\\t\\tvar xys []int\\n\\t\\t\\t\\tcollect(x, y, &xys)\\n\\t\\t\\t\\tislands = append(islands, xys)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\ta, b := islands[0], islands[1]\\n\\tbest := math.MaxInt32\\n\\tfor i := 0; i < len(a) && best > 1; i += 2 {\\n\\t\\tx1, y1 := a[i], a[i+1]\\n\\t\\tfor j := 0; j < len(b) && best > 1; j += 2 {\\n\\t\\t\\tx2, y2 := b[j], b[j+1]\\n\\t\\t\\td := abs(x2-x1) + abs(y2-y1) - 1\\n\\t\\t\\tif d < best {\\n\\t\\t\\t\\tbest = d\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn best\\n}\",\n \"func Max(x, y int32) int32 {\\n\\treturn x - (((x - y) >> 31) & (x - y))\\n}\",\n \"func highBitLoc(n uint32) uint32 {\\n\\treturn uint32(math.Ilogb(float64(n)*2 + 1))\\n}\",\n \"func getMaximumGold(grid [][]int) int {\\n m := len(grid)\\n n := len(grid[0])\\n var ans int\\n for i := 0; i<m;i++ {\\n for j := 0;j < n; j++ {\\n ans = max(ans, dfsGold(grid, m, n, i, j, 0))\\n }\\n }\\n return ans\\n}\",\n \"func largestTriangleArea(points [][]int) float64 {\\n \\n}\",\n \"func max(sf ...int64) int64 {\\n\\tvar max int64\\n\\tfor _, val := range sf {\\n\\t\\tif val > max {\\n\\t\\t\\tmax = val\\n\\t\\t}\\n\\t}\\n\\treturn max\\n}\",\n \"func Max(x, y int64) int64 {\\n if x > y {\\n return x\\n }\\n return y\\n}\",\n \"func getMaximumGold(grid [][]int) int {\\n\\tdirections := [][]int{{0, 1}, {0, -1}, {1, 0}, {-1, 0}}\\n\\n\\tif len(grid) == 0 {\\n\\t\\treturn 0\\n\\t}\\n\\n\\tm, n := len(grid), len(grid[0])\\n\\tresult := 0\\n\\n\\tfor i := 0; i < m; i++ {\\n\\t\\tfor j := 0; j < n; j++ {\\n\\t\\t\\tresult = Max(result, findMaxGold(grid, i, j, directions))\\n\\t\\t}\\n\\t}\\n\\treturn result\\n}\",\n \"func largestRectangleAreaUsingStack(heights []int) int {\\n\\tvar (\\n\\t\\tmax = 0\\n\\t\\tstack = newIntStack()\\n\\t)\\n\\n\\tstack.push(-1)\\n\\n\\tfor k := range heights {\\n\\t\\tfor stack.top() != -1 && heights[stack.top()] >= heights[k] {\\n\\t\\t\\tmax = maxInt(max, heights[stack.pop()]*(k-stack.top()-1))\\n\\t\\t}\\n\\t\\tstack.push(k)\\n\\t}\\n\\n\\tfor stack.top() != -1 {\\n\\t\\tmax = maxInt(max, heights[stack.pop()]*(len(heights)-stack.top()-1))\\n\\t}\\n\\n\\treturn max\\n}\",\n \"func maxYmin2(numeros []int) (max int, min int) { //indicamos los tipos y nombre que va retornar (int, int)\\n\\tfor _, v := range numeros {\\n\\t\\tif v > max {\\n\\t\\t\\tmax = v\\n\\t\\t}\\n\\n\\t\\tif v < min {\\n\\t\\t\\tmin = v\\n\\t\\t}\\n\\t}\\n\\n\\treturn //ya no necesita return porque ya le indicamos como va retornar y que orden\\n}\",\n \"func main(){\\n\\tdp := make([]uint, len(w)+1)\\n\\tfor i := 1; i < len(w)+1; i++{\\n\\t\\tif i == 1 {\\n\\t\\t\\tdp[i] = w[i-1][2]\\n\\t\\t}else {\\n\\t\\t\\tdp[i] = max(dp[i-1], (dp[free_slot(i-1, w)]+w[i-1][2]))\\n\\t\\t}\\n\\t}\\n\\tfmt.Println(dp[len(w)])\\n//\\tfind_slot(dp)\\n}\",\n \"func max(x, y int) int {\\n\\tif x < y {\\n\\t\\treturn y\\n\\t}\\n\\treturn x\\n}\",\n \"func max(x, y int) int {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func max(x, y int) int {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func max(x, y int) int {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func max(x, y int) int {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func max(x, y int) int {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func (bl branchList) HighestBranchIndexes() []int {\\n\\tmaxHeight := uint64(0)\\n\\tvar br branch\\n\\tcols := []int{}\\n\\tfor i, b := range bl {\\n\\t\\tif b.height > maxHeight {\\n\\t\\t\\tmaxHeight = b.height\\n\\t\\t\\tbr = b\\n\\t\\t\\tcols = []int{i}\\n\\t\\t} else if b.height == maxHeight && b.addr == br.addr {\\n\\t\\t\\tcols = append(cols, i)\\n\\t\\t}\\n\\t}\\n\\treturn cols\\n}\",\n \"func getMaximumGold(grid [][]int) int {\\n\\tvisited := make([][]bool, len(grid))\\n\\tfor i := range visited {\\n\\t\\tvisited[i] = make([]bool, len(grid[0]))\\n\\t}\\n\\tmax, cur := new(int), new(int)\\n\\tfor i := 0; i < len(grid); i++ {\\n\\t\\tfor j := 0; j < len(grid[0]); j++ {\\n\\t\\t\\t// only start from edge cell\\n\\t\\t\\tif grid[i][j] > 0 {\\n\\t\\t\\t\\tvisit(grid, visited, i, j, max, cur)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn *max\\n}\",\n \"func max(x, y int64) int64 {\\n\\tif x < y {\\n\\t\\treturn y\\n\\t}\\n\\treturn x\\n}\",\n \"func main() {\\n\\tgreatest := max(10, 20, 15, 8, 9, 6)\\n\\tfmt.Println(greatest)\\n}\",\n \"func Find_Largest(arr []int ) {\\n\\tfmt.Println(\\\"FIND LARGEST VALUE\\\")\\n\\tvar largest = -99999999\\n\\tfor i:=1 ; i < len(arr) ; i++ {\\n\\t\\t\\t//fmt.Println(arr[i])\\n\\t\\t\\tif largest <= arr[i] {\\n\\t\\t\\t\\tlargest = arr[i]\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfmt.Println(\\\"Largest: \\\" , largest )\\n}\",\n \"func max(x int, y int) int {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func MaxValue(freqMap map[string]int) int {\\n m := 0\\n firstTimeThrough := true\\n\\n for _, value := range freqMap {\\n if firstTimeThrough || value > m {\\n m = value\\n firstTimeThrough = false\\n }\\n }\\n\\n return m\\n}\",\n \"func maxArea(height []int) int {\\n maxArea := 0\\n maxheight := 0\\n for i := 0; i < len(height) -1; i++ {\\n for j := i+1; j < len(height); j++ {\\n if height[i] >= height[j] {\\n maxheight = height[j]\\n } else {\\n maxheight = height[i]\\n }\\n if maxArea < (maxheight * (j-i)) {\\n maxArea = (maxheight * (j-i))\\n }\\n }\\n }\\n return maxArea\\n}\",\n \"func (g *graph) find_max_value(chk *checklist) int {\\n\\tcurrent := 0\\n\\tidx := -1\\n\\tfor i,c := range chk.nodes_count {\\n\\t\\tif c > current {\\n\\t\\t\\tidx = i\\n\\t\\t\\tcurrent = c\\n\\t\\t}\\n\\t}\\n\\tif idx >= 0 { chk.nodes_count[idx] = -1 }\\n\\treturn idx\\n}\",\n \"func findMax(number []int, max int) (int, func() []int) {\\n\\tvar res []int\\n\\tfor _, p := range number {\\n\\t\\tif p <= max {\\n\\t\\t\\tres = append(res, p)\\n\\t\\t}\\n\\t}\\n\\n\\treturn len(res), func() []int {\\n\\t\\treturn res\\n\\t}\\n}\",\n \"func main() {\\n\\tfmt.Println(maxDistToClosest([]int{1, 0, 0, 0, 1, 0, 1}))\\n\\tfmt.Println(maxDistToClosest([]int{1, 0, 0, 0}))\\n\\tfmt.Println(maxDistToClosest([]int{0, 0, 0, 1}))\\n}\",\n \"func (gossiper *Gossiper) getHighestFit(confirmedGossips []*packets.TLCMessage) (*packets.TLCMessage, int) {\\n\\tmaxFit := float32(0)\\n\\tvar maxGossip *packets.TLCMessage\\n\\tindex := 0\\n\\tfor i, gossip := range confirmedGossips {\\n\\t\\tif gossip.Fitness > maxFit {\\n\\t\\t\\tmaxGossip = gossip\\n\\t\\t\\tmaxFit = gossip.Fitness\\n\\t\\t\\tindex = i\\n\\t\\t}\\n\\t}\\n\\treturn maxGossip, index\\n}\",\n \"func maxIndexSlo(arr []int) int {\\n\\tii, jj := 0, 0\\n\\tmaxDiff := 0\\n\\tfor i := range arr {\\n\\t\\tfor j := i + 1; j < len(arr); j++ {\\n\\t\\t\\tif arr[i] <= arr[j] && (j-i) >= maxDiff {\\n\\t\\t\\t\\tmaxDiff = j - i\\n\\t\\t\\t\\tii, jj = i, j\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn jj - ii\\n}\",\n \"func Day8Part1(filepath string) any {\\n\\tvar res int\\n\\n\\t// open file\\n\\treadFile, _ := os.Open(filepath)\\n\\n\\t// read line\\n\\tfileScanner := bufio.NewScanner(readFile)\\n\\tfileScanner.Split(bufio.ScanLines)\\n\\n\\t// parse map in to [][]int\\n\\ttreeMap := parseMap(fileScanner)\\n\\t// fmt.Println(treeMap)\\n\\n\\t// init visible trees 2D array\\n\\tvisible := make([][]bool, len(treeMap))\\n\\tfor i := range visible {\\n\\t\\tvisible[i] = make([]bool, len(treeMap[0]))\\n\\t}\\n\\n\\t// look from left to r\\n\\tfor i := range treeMap {\\n\\t\\tmax := 0\\n\\t\\tfor j := range treeMap[0] {\\n\\t\\t\\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\\n\\t\\t\\t\\tvisible[i][j] = true\\n\\t\\t\\t\\tmax = treeMap[i][j]\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// look from right to l\\n\\tfor i := range treeMap {\\n\\t\\tmax := 0\\n\\t\\tfor j := len(treeMap[0]) - 1; j >= 0; j-- {\\n\\t\\t\\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\\n\\t\\t\\t\\tvisible[i][j] = true\\n\\t\\t\\t\\tmax = treeMap[i][j]\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// look from up to down\\n\\tfor j := 0; j <= len(treeMap[0])-1; j++ {\\n\\t\\tmax := 0\\n\\t\\tfor i := 0; i <= len(treeMap)-1; i++ {\\n\\t\\t\\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\\n\\t\\t\\t\\tvisible[i][j] = true\\n\\t\\t\\t\\tmax = treeMap[i][j]\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// look from down to up\\n\\tfor j := 0; j <= len(treeMap[0])-1; j++ {\\n\\t\\tmax := 0\\n\\t\\tfor i := len(treeMap) - 1; i >= 0; i-- {\\n\\t\\t\\tif i == 0 || i == len(treeMap)-1 || j == 0 || j == len(treeMap[0])-1 || treeMap[i][j] > max {\\n\\t\\t\\t\\tvisible[i][j] = true\\n\\t\\t\\t\\tmax = treeMap[i][j]\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// traverse visible trees 2D array and count visibles\\n\\tfor i := range visible {\\n\\t\\tfor j := range visible[i] {\\n\\t\\t\\tif visible[i][j] {\\n\\t\\t\\t\\tres++\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn res\\n}\",\n \"func maxArea(height []int) int {\\n\\tmaxArea := 0\\n\\tfor i, v := range height {\\n\\t\\tfor j := i + 1; j < len(height); j++ {\\n\\t\\t\\tcurrentArea := min(v, height[j]) * (j - i)\\n\\t\\t\\tif maxArea < currentArea {\\n\\t\\t\\t\\tmaxArea = currentArea\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn maxArea\\n}\",\n \"func findCheapestPrice(n int, flights [][]int, src int, dst int, K int) int {\\n \\n}\",\n \"func largestRectangleArea(heights []int) int {\\n\\tl := len(heights)\\n\\tif l == 1{\\n\\t\\treturn heights[0]\\n\\t}\\n\\tvar s []int\\n\\tvar max int = 0\\n\\theights = append(heights, 0)\\n\\tl++\\n\\tfor i := 0;i < l;i++{\\n\\t\\tif len(s) == 0 || heights[i] > heights[s[len(s) - 1]]{\\n\\t\\t\\ts = append(s,i)\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tfor len(s) > 0 && heights[i] < heights[s[len(s) - 1]] {\\n\\t\\t\\th := heights[s[len(s) - 1]]\\n\\t\\t\\ts = s[:len(s) - 1]\\n\\t\\t\\tvar res int = 0\\n\\t\\t\\tif len(s) == 0{\\n\\t\\t\\t\\tres = h * i\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tres = h * (i - 1 - s[len(s) - 1])\\n\\t\\t\\t}\\n\\t\\t\\tif res > max{\\n\\t\\t\\t\\tmax = res\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ts = append(s,i)\\n\\t}\\n\\treturn max\\n}\",\n \"func main() {\\n\\tn := max(1, 2, 3, 4, 5, 6, 7, 8, 9, 20)\\n\\tfmt.Println(n)\\n}\",\n \"func findMaxConsecutiveOnes(nums []int) int {\\n \\n}\",\n \"func Max(x, y int) int {\\n if x < y {\\n return y\\n }\\n return x\\n}\",\n \"func findShortestSubArray(nums []int) int {\\n \\n}\",\n \"func maxArea(height []int) int {\\n\\tmaxArea := 0.0\\n\\tright := len(height) - 1\\n\\tleft := 0\\n\\t//简化代码 简化的点在于go自带的min函数只能比float\\n\\tfor left < right {\\n\\t\\tmaxArea = math.Max(maxArea, math.Min(float64(height[right]), float64(height[left]))*float64(right-left))\\n\\t\\tif height[right] > height[left] {\\n\\t\\t\\tleft += 1\\n\\t\\t} else {\\n\\t\\t\\tright -= 1\\n\\t\\t}\\n\\t}\\n\\t/*for left<right {\\n\\t\\tminHeight := 0\\n\\t\\tif height[right] > height[left]{\\n\\t\\t\\tminHeight = height[left]\\n\\t\\t\\tleft+=1\\n\\t\\t}else{\\n\\t\\t\\tminHeight = height[right]\\n\\t\\t\\tright -=1\\n\\t\\t}\\n\\t\\tif (right-left+1)* minHeight > maxArea{\\n\\t\\t\\tmaxArea = (right-left+1)* minHeight\\n\\t\\t}\\n\\t}*/\\n\\treturn int(maxArea)\\n}\",\n \"func max(m, n int) (int, bool) {\\n\\tif m > n {\\n\\t\\treturn m, true\\n\\t}\\n\\treturn n, false\\n}\",\n \"func MaxI(x, y int) int {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func flatlandSpaceStations(n int32, c []int32) (maxDistance int32) {\\n\\tvar (\\n\\t\\ttmpDistance int32\\n\\t\\ttmpMaxDistance int32\\n\\t\\tinitStation = false\\n\\t\\tcities = populateCity(n, c)\\n\\t)\\n\\n\\t//fmt.Println(cities)\\n\\n\\tfor _, v := range cities {\\n\\t\\tif !v.hasStation {\\n\\t\\t\\ttmpDistance++\\n\\t\\t} else {\\n\\t\\t\\tif initStation {\\n\\t\\t\\t\\ttmpMaxDistance = (tmpDistance + 1) / 2\\n\\t\\t\\t} else {\\n\\t\\t\\t\\ttmpMaxDistance = tmpDistance\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Set the max distance\\n\\t\\t\\tif tmpMaxDistance >= maxDistance {\\n\\t\\t\\t\\tmaxDistance = tmpMaxDistance\\n\\t\\t\\t}\\n\\n\\t\\t\\ttmpDistance = 0\\n\\t\\t\\tinitStation = true\\n\\t\\t}\\n\\t}\\n\\n\\t// When does not exist station on the last city\\n\\tif tmpDistance != 0 {\\n\\t\\ttmpMaxDistance = tmpDistance\\n\\t\\tif tmpMaxDistance >= maxDistance {\\n\\t\\t\\tmaxDistance = tmpMaxDistance\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\",\n \"func findHighestValue(matrix [][]score) (topValue, x, y int) {\\n\\tvar currLargest, currX, currY int\\n\\tvar currValue int\\n\\tfor i := 0; i < len(matrix); i++ {\\n\\t\\tfor j := 0; j < len(matrix[i]); j++ {\\n\\t\\t\\tcurrValue = matrix[i][j].value\\n\\t\\t\\tif currValue > currLargest {\\n\\t\\t\\t\\tcurrLargest = currValue\\n\\t\\t\\t\\tcurrX = i\\n\\t\\t\\t\\tcurrY = j\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn currLargest, currX, currY\\n}\",\n \"func MaxLamport(x, y Lamport) Lamport {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func max(x, y int) int {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t} else {\\n\\t\\treturn y\\n\\t}\\n}\",\n \"func largestRectangle(h []int32) int64 {\\n\\t// how can we easily keep track of the minimum?\\n\\t// naive approach - recalculate it each time\\n\\t// will be something like O(n^2) since calculating\\n\\t// minimum is O(n)\\n\\t// and brute-force trying all possible sets of buildings\\n\\t// is also O(n^2)\\n\\t// so maybe worse than n^2\\n\\n\\t// array of answers where i = index of start\\n\\t// and k = index of end\\n\\t// will be a triangular array since k >= i\\n\\t// equivalently, could have array of i and length\\n\\t/*\\n\\t\\teg for array [6 3 2 5 4 1]\\n\\t\\twould look like (index, length)\\n\\t\\t6 3 2 2 2 1\\n\\t\\t3 2 2 2 1\\n\\t\\t2 2 2 1\\n\\t\\t5 4 1\\n\\t\\t4 1\\n\\t\\t1\\n\\t\\tor (startindex, endindex)\\n\\t\\t6 3 2 2 2 1\\n\\t\\t- 3 2 2 2 1\\n\\t\\t- - 2 2 2 1\\n\\t\\t- - - 5 4 1\\n\\t\\t- - - - 4 1\\n\\t\\t- - - - - 1\\n\\t*/\\n\\n\\t// build up 2D array of minimum heights\\n\\t// 0 index means length of 1\\n\\t// min(i, 0) = i\\n\\t// min(i, 1) = min(min(i, 0), i + 1)\\n\\t// min(i, k +1) = min(min(i, k), i+k+1)\\n\\t// in array notation:\\n\\t// arr[i][k+1] = min(arr[i][k], arr[i+k])\\n\\tvar minHeightArray = make([][]int64, len(h))\\n\\n\\t// initialise array\\n\\tfor i, v := range h {\\n\\t\\tminHeightArray[i] = make([]int64, len(h))\\n\\t\\tminHeightArray[i][0] = int64(v)\\n\\t}\\n\\t// flesh out rest of array\\n\\tfor i := range h { // here j is length of slice\\n\\t\\tfor j := 1; j < len(h)-i; j++ { // start index must be low enough to allow slice length\\n\\t\\t\\tminHeightArray[i][j] = minInt(minHeightArray[i][j-1], minHeightArray[i+j][0])\\n\\t\\t}\\n\\t}\\n\\n\\tvar area, maxArea int64\\n\\n\\tfor i := range h {\\n\\t\\tfor j := 1; j < len(h)-i; j++ {\\n\\t\\t\\tarea = int64(j+1) * minHeightArray[i][j]\\n\\t\\t\\tif area > maxArea {\\n\\t\\t\\t\\tmaxArea = area\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn maxArea\\n}\",\n \"func maxSlidingWindow(nums []int, k int) []int {\\n\\n\\treturn nums\\n}\",\n \"func findMaxLength(nums []int) int {\\n\\tm := map[int]int{} //key is count, value is index\\n\\n\\tvar count, maxVal int\\n\\tm[0] = -1\\n\\tfor i, num := range nums {\\n\\t\\tif num == 0 {\\n\\t\\t\\tcount--\\n\\t\\t} else {\\n\\t\\t\\tcount++\\n\\t\\t}\\n\\t\\tidx, ok := m[count]\\n\\t\\tif ok {\\n\\t\\t\\tmaxVal = max(maxVal, i-idx)\\n\\t\\t} else {\\n\\t\\t\\tm[count] = i\\n\\t\\t}\\n\\t}\\n\\n\\treturn maxVal\\n}\",\n \"func Max(x, y int) int {\\n\\tif x < y {\\n\\t\\treturn y\\n\\t}\\n\\treturn x\\n}\",\n \"func Max(x, y int) int {\\n\\tif y > x {\\n\\t\\treturn y\\n\\t}\\n\\treturn x\\n}\",\n \"func maxSideLength(mat [][]int, threshold int) int {\\n\\t// acc[i][j]: the accumulated sum right and bottom of point (i, j)\\n\\tm, n := len(mat), len(mat[0])\\n acc := make([][]int, m+1)\\n for i := range acc {\\n \\tacc[i] = make([]int, n+1)\\n\\t}\\n\\tfor i:=m-1; i>=0; i-- {\\n\\t\\tfor j:=n-1; j>=0; j-- {\\n\\t\\t\\tacc[i][j] = mat[i][j]+acc[i+1][j]+acc[i][j+1]-acc[i+1][j+1]\\n\\t\\t}\\n\\t}\\n\\t// binary search for low=0 and high=min(m,n). for each mid,\\n\\t// check if there exists one square with side length <= threshold\\n\\t// time is m*n*log(min(m,n))\\n\\tlo, hi := 1, m+1\\n\\tif m>n {\\n\\t\\thi = n+1\\n\\t}\\n\\tfor lo<hi {\\n\\t\\tmid := (lo+hi)/2\\n\\t\\texist := false\\n\\t\\touter: for i:=0; i+mid<=m; i++ {\\n\\t\\t\\tfor j:=0; j+mid<=n; j++ {\\n\\t\\t\\t\\tarea := acc[i][j]-acc[i+mid][j]-acc[i][j+mid]+acc[i+mid][j+mid]\\n\\t\\t\\t\\tif area<=threshold {\\n\\t\\t\\t\\t\\texist = true\\n\\t\\t\\t\\t\\tbreak outer\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// we want the max value of that CAN. so we search the first CAN'T. the candidate is 1 to n,\\n\\t\\t// so we let lo=1, hi=n+1. the loop end with lo=hi with first that CAN'T. so lo-1 is max value that CAN.\\n\\t\\tif exist {\\n\\t\\t\\tlo = mid+1\\n\\t\\t} else {\\n\\t\\t\\thi = mid\\n\\t\\t}\\n\\t}\\n\\treturn lo-1\\n}\",\n \"func findLargestNumber(args ...int) int {\\n\\tnumber := args[0]\\n\\n\\tfor _, value := range args {\\n\\t\\tif value > number {\\n\\t\\t\\tnumber = value\\n\\t\\t}\\n\\t}\\n\\treturn number\\n}\",\n \"func Solution(C []int, k int) int {\\n\\tn := len(C) + 1\\n\\tdp := make([][]int, n)\\n\\tfor i := range dp {\\n\\t\\tdp[i] = make([]int, k+1)\\n\\t}\\n\\n\\tfor i := 0; i < n; i++ {\\n\\t\\tdp[i][0] = 0\\n\\t}\\n\\n\\tfor i := 1; i <= k; i++ {\\n\\t\\tdp[0][i] = math.MaxInt64\\n\\t}\\n\\n\\tfor i := 1; i < n; i++ {\\n\\t\\tfor j := 1; j <= k; j++ {\\n\\t\\t\\tCmax := C[0]\\n\\t\\t\\tfor idx := 0; idx < i; idx++ {\\n\\t\\t\\t\\tif C[idx] > j {\\n\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tCmax = C[idx]\\n\\t\\t\\t}\\n\\n\\t\\t\\tdpij1 := dp[i][j-Cmax] + 1\\n\\t\\t\\tdpij2 := dp[i-1][j]\\n\\t\\t\\tif dpij1 <= dpij2 {\\n\\t\\t\\t\\tdp[i][j] = dpij1\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tdp[i][j] = dpij2\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//printDp(dp)\\n\\n\\treturn dp[n-1][k]\\n}\",\n \"func Max(x, y int) int {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func Max(x, y int) int {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func getMaxLen(nums []int) int {\\n\\tmaxlen := 0\\n\\ts := -1\\n\\tfn, ln, negs := -1, -1, 0\\n\\tfor i:=0; i<=len(nums); i++ {\\n\\t\\t// add zero at end to trigger final compute\\n\\t\\tv := 0\\n\\t\\tif i<len(nums) {\\n\\t\\t\\tv = nums[i]\\n\\t\\t}\\n\\n\\t\\t// find an interval\\n\\t\\tif v==0 { \\n\\t\\t\\tif i-s > 1 { // non-empty interval\\n\\t\\t\\t\\tif negs%2==0 { // even negs, whole interval is ok\\n\\t\\t\\t\\t\\tmaxlen = max(maxlen, i-s-1)\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tmaxlen = max(maxlen, max(ln-s-1, i-fn-1))\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfn, ln, s = i, i, i\\n\\t\\t\\tnegs = 0\\n\\t\\t}\\n\\n\\t\\t// find a value\\n\\t\\tif v < 0 {\\n\\t\\t\\tnegs++\\n\\t\\t\\tif fn==s {\\n\\t\\t\\t\\tfn = i\\n\\t\\t\\t}\\n\\t\\t\\tln = i\\n\\t\\t}\\n\\t\\t// if v > 0, do nothing\\n\\t}\\n return maxlen\\n}\",\n \"func findMax(vals []float64) float64 {\\n\\tmax := float64(vals[0])\\n\\tfor v := range vals {\\n\\t\\tif vals[v] > max {\\n\\t\\t\\tmax = vals[v]\\n\\t\\t}\\n\\t}\\n\\treturn float64(max)\\n}\",\n \"func Max(x, y int64) int64 {\\n\\tif x > y {\\n\\t\\treturn x\\n\\t}\\n\\treturn y\\n}\",\n \"func Max(x int, y int) int {\\n\\tif x > y { return x }\\n\\treturn y\\n}\",\n \"func Mimax(nums ...int) (int, int) {\\n\\tmin, max := nums[0], nums[0]\\n\\n\\tfor _, num := range nums {\\n\\t\\tif min > num {\\n\\t\\t\\tmin = num\\n\\t\\t}\\n\\n\\t\\tif max < num {\\n\\t\\t\\tmax = num\\n\\t\\t}\\n\\t}\\n\\n\\treturn min, max\\n}\",\n \"func (f *fragment) max(filter *Row, bitDepth uint) (max int64, count uint64, err error) {\\n\\tconsider := f.row(bsiExistsBit)\\n\\tif filter != nil {\\n\\t\\tconsider = consider.Intersect(filter)\\n\\t}\\n\\n\\t// If there are no columns to consider, return early.\\n\\tif !consider.Any() {\\n\\t\\treturn 0, 0, nil\\n\\t}\\n\\n\\t// Find lowest negative number w/o sign and negate, if no positives are available.\\n\\tpos := consider.Difference(f.row(bsiSignBit))\\n\\tif !pos.Any() {\\n\\t\\tmax, count = f.minUnsigned(consider, bitDepth)\\n\\t\\treturn -max, count, nil\\n\\t}\\n\\n\\t// Otherwise find highest positive number.\\n\\tmax, count = f.maxUnsigned(pos, bitDepth)\\n\\treturn max, count, nil\\n}\",\n \"func findCenter(edges [][]int) int {\\n\\tnumberMap, l := make(map[int]int), len(edges)\\n\\tfor _, edge := range edges {\\n\\t\\tnumberMap[edge[0]]++\\n\\t\\tnumberMap[edge[1]]++\\n\\t}\\n\\tfor key, value := range numberMap {\\n\\t\\tif value == l {\\n\\t\\t\\treturn key\\n\\t\\t}\\n\\t}\\n\\treturn -1\\n}\",\n \"func max(x int) int {\\n\\treturn 40 + x\\n}\",\n \"func main() {\\n\\n\\thittable := make(map[int]bool)\\n\\tans := int64(0)\\n\\n\\tfor i := 1; i*i <= top*9*9; i++ {\\n\\t\\thittable[i*i] = true\\n\\t}\\n\\n\\tfor i := range hittable {\\n\\t\\tways, _ := enumerate(9, top, i)\\n\\t\\tfor i := 0; i < len(ways); i++ {\\n\\t\\t\\tans += process(ways[i])\\n\\t\\t\\tans %= mod\\n\\t\\t}\\n\\t}\\n\\n\\tfmt.Println(\\\"171/ Find the last nine digits of the sum of all n, 0 < n < 10^20, such that f(n) is a perfect square\\\")\\n\\tfmt.Println(ans)\\n}\",\n \"func main() {\\n\\tmountain = [5][5]int{\\n\\t\\t{1, 2, 3, 4, 5},\\n\\t\\t{16, 17, 18, 19, 6},\\n\\t\\t{15, 24, 25, 20, 7},\\n\\t\\t{14, 23, 22, 21, 8},\\n\\t\\t{13, 12, 11, 10, 9},\\n\\t}\\n\\tmax := 0\\n\\n\\tfor i := 0; i < 5; i++ {\\n\\t\\tfor j := 0; j < 5; j++ {\\n\\t\\t\\tpath[i][j] = dfs(i, j) + 1\\n\\t\\t\\tif path[i][j] >= max {\\n\\t\\t\\t\\tmax = path[i][j]\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfmt.Printf(\\\"the longest path size is %d %v\\\\n\\\", max, path)\\n\\n}\",\n \"func Max(i, j int) int {\\n\\tif i > j {\\n\\t\\treturn i\\n\\t}\\n\\treturn j\\n}\",\n \"func findMaxPosition(data []int) int {\\n\\tif len(data) == 0 {\\n\\t\\treturn -1\\n\\t}\\n\\tvar position int\\n\\tmax := data[0]\\n\\n\\tfor index := 0; index < len(data); index++ {\\n\\t\\tif data[index] > max {\\n\\t\\t\\tmax = data[index]\\n\\t\\t\\tposition = index\\n\\t\\t}\\n\\t}\\n\\treturn position\\n}\",\n \"func Max(x, y int64) int64 {\\n\\treturn x ^ ((x ^ y) & ((x - y) >> 63))\\n}\",\n \"func numIslands(grid [][]byte) int {\\n\\tx := len(grid)\\n\\tif x == 0 {\\n\\t\\treturn 0\\n\\t}\\n\\ty := len(grid[0])\\n\\tcount := 0\\n\\tfor i := 0; i < x; i++ {\\n\\t\\tfor j := 0; j < y; j++ {\\n\\t\\t\\tif grid[i][j] == 0 {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tmarkIsland(grid, i, j, func(i, j int) bool {\\n\\t\\t\\t\\tif i < 0 || j < 0 || i >= x || j >= y || grid[i][j] == 0 {\\n\\t\\t\\t\\t\\treturn false\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn true\\n\\t\\t\\t})\\n\\t\\t\\tcount += 1\\n\\t\\t}\\n\\t}\\n\\treturn count\\n}\",\n \"func maximize() int64 {\\n\\tmax := 0\\n\\tmaxItem := int64(0)\\n\\t// var cache Cache\\n\\n\\t// The larger the cache, the faster it is. Even without a\\n\\t// cache, it's only around a second on a modern machine, so\\n\\t// not that big of a deal.\\n\\t// cache.init(10000)\\n\\n\\tfor x := int64(1); x < 1000000; x++ {\\n\\t\\tcount := collatz2(x)\\n\\t\\t// count := cache.chainLen(x)\\n\\t\\tif count > max {\\n\\t\\t\\tmax = count\\n\\t\\t\\tmaxItem = x\\n\\t\\t}\\n\\t}\\n\\tfmt.Printf(\\\"%d, %d\\\\n\\\", maxItem, max)\\n\\treturn maxItem\\n}\",\n \"func rmax(data ArrType) float64 {\\r\\n\\tvar i, idxCari, idxMax int\\r\\n\\ti = 0\\r\\n\\tidxCari = 1\\r\\n\\tidxMax = 0\\r\\n\\tfor i < N-1 { // N-1 karena idxCari = i + 1 sehingga data terakhir masih diperhitungkan\\r\\n\\t\\tif data[idxCari].f3 > data[idxMax].f3 {\\r\\n\\t\\t\\tidxMax = idxCari\\r\\n\\t\\t}\\r\\n\\t\\tidxCari++\\r\\n\\t\\ti++\\r\\n\\t}\\r\\n\\treturn data[idxMax].f3\\r\\n}\",\n \"func findBiggest(numbers ...int) int {\\n\\tvar biggest int\\n\\t//iterate over numbers\\n\\tfor _, v := range numbers {\\n\\t\\tif v > biggest {\\n\\t\\t\\tbiggest = v\\n\\t\\t}\\n\\t}\\n\\n\\treturn biggest\\n}\",\n \"func MaximalRectangle(matrix [][]byte) int {\\n type point struct {\\n i, j int\\n }\\n // re map right bottom point to left top point for all rectangles which contain only \\\"1\\\"\\n re := make(map[point]map[point]bool)\\n var maxArea, area int\\n for i := range matrix {\\n for j := range matrix[i] {\\n if matrix[i][j] == '0' {\\n continue\\n }\\n re[point{i,j}] = map[point]bool{point{i,j}: true}\\n if maxArea == 0 {\\n maxArea = 1\\n }\\n\\n if i > 0 {\\n jLeftTop := j-1\\n for jLeftTop >= 0 && matrix[i][jLeftTop] == '1' {\\n jLeftTop--\\n }\\n m, exist := re[point{i-1, j}]\\n if exist {\\n for p := range m {\\n if p.j > jLeftTop {\\n re[point{i, j}][p] = true\\n area = (i-p.i+1) * (j-p.j+1)\\n if area > maxArea {\\n maxArea = area\\n }\\n }\\n }\\n }\\n }\\n\\n if j > 0 {\\n iLeftTop := i-1\\n for iLeftTop >= 0 && matrix[iLeftTop][j] == '1' {\\n iLeftTop--\\n }\\n m, exist := re[point{i, j-1}]\\n if exist {\\n for p := range m {\\n if p.i > iLeftTop {\\n re[point{i, j}][p] = true\\n area = (i-p.i+1) * (j-p.j+1)\\n if area > maxArea {\\n maxArea = area\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n\\n return maxArea\\n}\",\n \"func max(a, b int32) int32 {\\n\\tif a >= b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func lastPersonDistances(numStalls, numPeople uint64) (min uint64, max uint64) {\\n\\tb := newBathroom(numStalls)\\n\\n\\tvar placed uint64\\n\\tfor numPeople > placed {\\n\\t\\tvar count uint64\\n\\t\\tmin, max, count = b.addPeople()\\n\\t\\tplaced += count\\n\\t}\\n\\n\\treturn min, max\\n}\",\n \"func largestRectangleArea(heights []int) int {\\n\\theiList := []int{} // save height with grow\\n\\theiLengthList := []int{} // save line length with height\\n\\tmax := 0\\n\\tfor i, currHei := range heights {\\n\\t\\tj := len(heiList) - 1\\n\\t\\tcurrPos := i\\n\\t\\tfor ; j >= 0; j-- {\\n\\t\\t\\t// if current height larger than the tail of heiList,remove it\\n\\t\\t\\tif heiList[j] >= currHei {\\n\\t\\t\\t\\tarea := (i - heiLengthList[j]) * heiList[j]\\n\\t\\t\\t\\tif area > max {\\n\\t\\t\\t\\t\\tmax = area\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcurrPos = heiLengthList[j]\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\theiList = append(heiList[:j+1], currHei)\\n\\t\\theiLengthList = append(heiLengthList[:j+1], currPos)\\n\\t}\\n\\tfor j := len(heiList) - 1; j >= 0; j-- {\\n\\t\\tarea := (len(heights) - heiLengthList[j]) * heiList[j]\\n\\t\\tif area > max {\\n\\t\\t\\tmax = area\\n\\t\\t}\\n\\t}\\n\\treturn max\\n}\",\n \"func maxSubArray(nums []int) int {\\n\\tstMax := -1\\n\\tvar max int\\n\\t// var endMax int\\n\\tfor st := 0; st < len(nums); st++ {\\n\\t\\tsum := 0\\n\\t\\tfor end := st; end < len(nums); end++ {\\n\\t\\t\\tsum += nums[end]\\n\\t\\t\\tif (stMax < 0) || (sum > max) {\\n\\t\\t\\t\\tmax = sum\\n\\t\\t\\t\\tstMax = st\\n\\t\\t\\t\\t// end_max = end\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn max\\n}\",\n \"func maxI(a int, b int) (res int) {\\n\\tif a < b {\\n\\t\\tres = b\\n\\t} else {\\n\\t\\tres = a\\n\\t}\\n\\n\\treturn\\n}\",\n \"func Solution(A []int) int {\\n\\t// write your code in Go 1.4\\n\\tvar peakIndex []int\\n\\t// var currentFlags int\\n\\tfor i, val := range A {\\n\\t\\tif i == 0 || i == len(A)-1 {\\n\\t\\t\\tcontinue\\n\\t\\t} else if val > A[i-1] && val > A[i+1] {\\n\\t\\t\\tfmt.Printf(\\\"masuk sini val %v\\\\n\\\", val)\\n\\t\\t\\tpeakIndex = append(peakIndex, i)\\n\\t\\t}\\n\\t}\\n\\tk := len(peakIndex)\\n\\tif k == 0 {\\n\\t\\treturn 0\\n\\t}\\n\\tfmt.Printf(\\\"peakIndex %v\\\\n\\\", peakIndex)\\n\\treturn k\\n}\",\n \"func largestOpenInterval(intervals []Interval) Interval {\\n\\tresult := Interval{}\\n\\tif len(intervals) <= 1 {\\n\\t\\treturn result\\n\\t}\\n\\n\\tmaxTime := 0\\n\\tfor i := 1; i < len(intervals); i++ {\\n\\t\\ttime := intervals[i].Start - intervals[i-1].End\\n\\t\\tif time > maxTime {\\n\\t\\t\\tmaxTime = time\\n\\t\\t\\tresult.Start = intervals[i-1].End\\n\\t\\t\\tresult.End = intervals[i].Start\\n\\t\\t}\\n\\t}\\n\\n\\treturn result\\n}\",\n \"func max(a, b int) int {\\nif a < b {\\nreturn b\\n}\\nreturn a\\n}\",\n \"func MinimizeStops() int {\\n\\ttopography := parseMap()\\n\\tresult := 1\\n\\tfor _, angle := range [][2]int{{1, 1}, {3, 1}, {5, 1}, {7, 1}, {1, 2}} {\\n\\t\\tresult *= topography.countTrees(angle[0], angle[1])\\n\\t}\\n\\treturn result\\n}\",\n \"func thirdMax(nums []int) int {\\n\\tconst min = math.MinInt32-1\\n\\tfl,sl,tl := min,min,min\\n\\tfor _, v := range nums{\\n\\t\\tif v>fl{\\n\\t\\t\\ttl=sl\\n\\t\\t\\tsl=fl\\n\\t\\t\\tfl=v\\n\\t\\t} else if v>sl && v !=fl {\\n\\t\\t\\ttl=sl\\n\\t\\t\\tsl=v\\n\\t\\t} else if v>tl && v !=sl && v!=fl {\\n\\t\\t\\ttl=v\\n\\t\\t}\\n\\n\\t}\\n\\tif tl== min{\\n\\t\\treturn fl\\n\\t}\\n\\treturn tl\\n}\",\n \"func Imax(a, b int) int {\\n\\tif a > b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\",\n \"func Imax(a, b int) int {\\n\\tif a > b {\\n\\t\\treturn a\\n\\t}\\n\\treturn b\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.66160476","0.64744246","0.618712","0.61700565","0.6037497","0.5992314","0.59851134","0.59376025","0.5864505","0.5848303","0.5829246","0.5827219","0.5810036","0.5801721","0.579599","0.57703656","0.57446194","0.5703196","0.57013416","0.56909364","0.56879175","0.5681232","0.567605","0.56479347","0.56289786","0.5623089","0.5620345","0.5615831","0.5612873","0.5612873","0.5612873","0.5612873","0.5612873","0.55996966","0.5596071","0.5590753","0.55866617","0.55866235","0.55814064","0.5576806","0.55712825","0.55621094","0.55552346","0.55529076","0.55514705","0.5535398","0.5530651","0.55230564","0.5519421","0.5516746","0.55153465","0.551249","0.55083853","0.5504014","0.55038786","0.54935753","0.54919267","0.5486102","0.54820377","0.548072","0.54793394","0.5451168","0.54459256","0.54155886","0.53969055","0.53963274","0.53925294","0.5388972","0.5381886","0.5380906","0.5380906","0.5379438","0.5377224","0.53705865","0.53584313","0.53581846","0.5358145","0.53537625","0.53537476","0.53521377","0.5349576","0.53494143","0.53485996","0.53264964","0.5323446","0.5306227","0.5292065","0.52822655","0.5279909","0.527761","0.5267588","0.5266989","0.52663356","0.52656305","0.52617174","0.52574027","0.52572197","0.52569926","0.52515006","0.5249731","0.5249731"],"string":"[\n \"0.66160476\",\n \"0.64744246\",\n \"0.618712\",\n \"0.61700565\",\n \"0.6037497\",\n \"0.5992314\",\n \"0.59851134\",\n \"0.59376025\",\n \"0.5864505\",\n \"0.5848303\",\n \"0.5829246\",\n \"0.5827219\",\n \"0.5810036\",\n \"0.5801721\",\n \"0.579599\",\n \"0.57703656\",\n \"0.57446194\",\n \"0.5703196\",\n \"0.57013416\",\n \"0.56909364\",\n \"0.56879175\",\n \"0.5681232\",\n \"0.567605\",\n \"0.56479347\",\n \"0.56289786\",\n \"0.5623089\",\n \"0.5620345\",\n \"0.5615831\",\n \"0.5612873\",\n \"0.5612873\",\n \"0.5612873\",\n \"0.5612873\",\n \"0.5612873\",\n \"0.55996966\",\n \"0.5596071\",\n \"0.5590753\",\n \"0.55866617\",\n \"0.55866235\",\n \"0.55814064\",\n \"0.5576806\",\n \"0.55712825\",\n \"0.55621094\",\n \"0.55552346\",\n \"0.55529076\",\n \"0.55514705\",\n \"0.5535398\",\n \"0.5530651\",\n \"0.55230564\",\n \"0.5519421\",\n \"0.5516746\",\n \"0.55153465\",\n \"0.551249\",\n \"0.55083853\",\n \"0.5504014\",\n \"0.55038786\",\n \"0.54935753\",\n \"0.54919267\",\n \"0.5486102\",\n \"0.54820377\",\n \"0.548072\",\n \"0.54793394\",\n \"0.5451168\",\n \"0.54459256\",\n \"0.54155886\",\n \"0.53969055\",\n \"0.53963274\",\n \"0.53925294\",\n \"0.5388972\",\n \"0.5381886\",\n \"0.5380906\",\n \"0.5380906\",\n \"0.5379438\",\n \"0.5377224\",\n \"0.53705865\",\n \"0.53584313\",\n \"0.53581846\",\n \"0.5358145\",\n \"0.53537625\",\n \"0.53537476\",\n \"0.53521377\",\n \"0.5349576\",\n \"0.53494143\",\n \"0.53485996\",\n \"0.53264964\",\n \"0.5323446\",\n \"0.5306227\",\n \"0.5292065\",\n \"0.52822655\",\n \"0.5279909\",\n \"0.527761\",\n \"0.5267588\",\n \"0.5266989\",\n \"0.52663356\",\n \"0.52656305\",\n \"0.52617174\",\n \"0.52574027\",\n \"0.52572197\",\n \"0.52569926\",\n \"0.52515006\",\n \"0.5249731\",\n \"0.5249731\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":989,"cells":{"query":{"kind":"string","value":"create a master node and initialize its channels"},"document":{"kind":"string","value":"func NewMaster() *Master {\n\tm := &Master{\n\t\tsubMap: map[string]*Submission{},\n\t\tjobChan: make(chan *WorkerJob, 0),\n\t\tNodeHandles: map[string]*NodeHandle{}}\n\thttp.Handle(\"/master/\", websocket.Handler(func(ws *websocket.Conn) { m.Listen(ws) }))\n\treturn m\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func NewMasterNode() *MasterNode {\n\tcurrentNode := MasterNode{}\n\tcurrentNode.Slaves = make(map[*websocket.Conn]bool)\n\tcurrentNode.broadcast = make(chan []byte)\n\treturn ¤tNode\n}","func (n *MasterNode) StartMasterNode(host string, port int) {\n\t// Configure websocket route\n\thttp.HandleFunc(\"/ws\", n.handleConnections)\n\n\t// Start listening for incoming chat messages\n\tgo n.readInputCommands()\n\tgo n.broadcastCommandsToRun()\n\n\t// Start the server on localhost port 8000 and log any errors\n\taddress := fmt.Sprintf(\"%s:%d\", host, port)\n\terr := http.ListenAndServe(address, nil)\n\tif err != nil {\n\t\tlog.Fatal(\"Stopped Server: \", err)\n\t}\n}","func newNode(ready chan struct{}) {\n\t// Create & start node\n\tnode = nm.NewNodeDefault(config)\n\tnode.Start()\n\n\ttime.Sleep(time.Second)\n\n\tready <- struct{}{}\n\n\t// Sleep forever\n\tch := make(chan struct{})\n\t<-ch\n}","func (s *RedisSystem) NewMaster(server string) {\n\tlogInfo(\"setting new master: %s\", server)\n\ts.currentMaster = NewRedisShim(server)\n}","func InitMasterClusterComm(_routeHandlerMap RouteHandlerMap) {\n\trouteHandlerMap = _routeHandlerMap\n\n\t// Setup router\n\trouter := mux.NewRouter()\n\trouter.HandleFunc(\"/KillAll\", killAllRoute).Methods(\"GET\")\n\trouter.HandleFunc(\"/CreateNode\", createNodeRoute).Methods(\"GET\")\n\trouter.HandleFunc(\"/Send\", sendRoute).Methods(\"GET\")\n\trouter.HandleFunc(\"/Receive\", receiveRoute).Methods(\"GET\")\n\trouter.HandleFunc(\"/ReceiveAll\", receiveAllRoute).Methods(\"GET\")\n\trouter.HandleFunc(\"/BeginSnapshot\", beginSnapshotRoute).Methods(\"GET\")\n\trouter.HandleFunc(\"/CollectState\", collectStateRoute).Methods(\"GET\")\n\trouter.HandleFunc(\"/PrintSnapshot\", printSnapshotRoute).Methods(\"GET\")\n\n\t// Starting Cluster Server\n\t// fmt.Println(\"\\nStarting Cluster Server @ http://localhost:8118\")\n\tif err := http.ListenAndServe(\":8118\", router); err != nil {\n\t\t// fmt.Printf(\"\\nmux server: %v\\n\", err)\n\t}\n}","func init() {\n\tconfig = tendermint_test.ResetConfig(\"rpc_test_client_test\")\n\tchainID = config.GetString(\"chain_id\")\n\trpcAddr = config.GetString(\"rpc_laddr\")\n\tgrpcAddr = config.GetString(\"grpc_laddr\")\n\trequestAddr = rpcAddr\n\twebsocketAddr = rpcAddr\n\twebsocketEndpoint = \"/websocket\"\n\n\tclientURI = client.NewClientURI(requestAddr)\n\tclientJSON = client.NewClientJSONRPC(requestAddr)\n\tclientGRPC = core_grpc.StartGRPCClient(grpcAddr)\n\n\t// TODO: change consensus/state.go timeouts to be shorter\n\n\t// start a node\n\tready := make(chan struct{})\n\tgo newNode(ready)\n\t<-ready\n}","func newChannelNode(t *testing.T) *testNode {\n\tch, err := tchannel.NewChannel(\"test\", nil)\n\trequire.NoError(t, err, \"channel must create successfully\")\n\n\t// Set the channel listening so it binds to the socket and we get a port\n\t// allocated by the OS\n\terr = ch.ListenAndServe(\"127.0.0.1:0\")\n\trequire.NoError(t, err, \"channel must listen\")\n\n\thostport := ch.PeerInfo().HostPort\n\tc := clock.NewMock()\n\tnode := NewNode(\"test\", hostport, ch.GetSubChannel(\"test\"), &Options{\n\t\tClock: c,\n\t})\n\n\treturn &testNode{node, ch, c}\n}","func New(commandArgs common.CommandArgs) *Node {\n\n\tnode := Node{\n\t\tNodeCommon: common.NewNodeCommon(commandArgs, \"master\"),\n\t\t// FirstSlaveListenPort: 7500, // TODO(greg) make this an env parameter /TODO this is the *base* port that the new slave should try. incrementing if failing to get the port\n\t}\n\n\treturn &node\n}","func masterMain(ln net.Listener) {\n\tm := &Master{}\n\tm.startTime = time.Now()\n\tm.lastInput = time.Now()\n\tm.suppressions = newPersistentSet(filepath.Join(*flagWorkdir, \"suppressions\"))\n\tm.crashers = newPersistentSet(filepath.Join(*flagWorkdir, \"crashers\"))\n\tm.corpus = newPersistentSet(filepath.Join(*flagWorkdir, \"corpus\"))\n\tif len(m.corpus.m) == 0 {\n\t\tm.corpus.add(Artifact{[]byte{}, 0, false})\n\t}\n\n\tm.slaves = make(map[int]*MasterSlave)\n\tgo masterLoop(m)\n\n\ts := rpc.NewServer()\n\ts.Register(m)\n\ts.Accept(ln)\n}","func main() {\n\ts := master.New()\n\tif err := s.Run(port); err != nil {\n\t\tlog.Fatal(err)\n\t}\n}","func (s *Service) bootstrapMaster(ctx context.Context, runner Runner, config Config, bsCfg BootstrapConfig) {\n\t// Check HTTP server port\n\tcontainerHTTPPort, _, err := s.getHTTPServerPort()\n\tif err != nil {\n\t\ts.log.Fatal().Err(err).Msg(\"Cannot find HTTP server info\")\n\t}\n\tif !WaitUntilPortAvailable(config.BindAddress, containerHTTPPort, time.Second*5) {\n\t\ts.log.Fatal().Msgf(\"Port %d is already in use\", containerHTTPPort)\n\t}\n\n\t// Select storage engine\n\tstorageEngine := bsCfg.ServerStorageEngine\n\tif storageEngine == \"\" {\n\t\tstorageEngine = s.DatabaseFeatures().DefaultStorageEngine()\n\t\tbsCfg.ServerStorageEngine = storageEngine\n\t}\n\ts.log.Info().Msgf(\"Using storage engine '%s'\", bsCfg.ServerStorageEngine)\n\n\t// Create initial cluster configuration\n\thasAgent := boolFromRef(bsCfg.StartAgent, !s.mode.IsSingleMode())\n\thasDBServer := boolFromRef(bsCfg.StartDBserver, true)\n\thasCoordinator := boolFromRef(bsCfg.StartCoordinator, true)\n\thasResilientSingle := boolFromRef(bsCfg.StartResilientSingle, s.mode.IsActiveFailoverMode())\n\thasSyncMaster := boolFromRef(bsCfg.StartSyncMaster, true) && config.SyncEnabled\n\thasSyncWorker := boolFromRef(bsCfg.StartSyncWorker, true) && config.SyncEnabled\n\tme := NewPeer(s.id, config.OwnAddress, s.announcePort, 0, config.DataDir,\n\t\thasAgent, hasDBServer, hasCoordinator, hasResilientSingle,\n\t\thasSyncMaster, hasSyncWorker, s.IsSecure())\n\ts.myPeers.Initialize(me, bsCfg.AgencySize, storageEngine, s.cfg.Configuration.PersistentOptions)\n\ts.learnOwnAddress = config.OwnAddress == \"\"\n\n\t// Start HTTP listener\n\ts.startHTTPServer(config)\n\n\t// Permanent loop:\n\ts.log.Info().Msgf(\"Serving as master with ID '%s' on %s:%d...\", s.id, config.OwnAddress, s.announcePort)\n\n\t// Can we start right away?\n\tneedMorePeers := true\n\tif s.mode.IsSingleMode() {\n\t\tneedMorePeers = false\n\t} else if !s.myPeers.HaveEnoughAgents() {\n\t\tneedMorePeers = true\n\t} else if bsCfg.StartLocalSlaves {\n\t\tpeersNeeded := bsCfg.PeersNeeded()\n\t\tneedMorePeers = len(s.myPeers.AllPeers) < peersNeeded\n\t}\n\tif !needMorePeers {\n\t\t// We have all the agents that we need, start a single server/cluster right now\n\t\ts.saveSetup()\n\t\ts.log.Info().Msg(\"Starting service...\")\n\t\ts.startRunning(runner, config, bsCfg)\n\t\treturn\n\t}\n\n\twg := sync.WaitGroup{}\n\tif bsCfg.StartLocalSlaves {\n\t\t// Start additional local slaves\n\t\ts.createAndStartLocalSlaves(&wg, config, bsCfg)\n\t} else {\n\t\t// Show commands needed to start slaves\n\t\ts.log.Info().Msgf(\"Waiting for %d servers to show up.\\n\", s.myPeers.AgencySize)\n\t\ts.showSlaveStartCommands(runner, config)\n\t}\n\n\tfor {\n\t\ttime.Sleep(time.Second)\n\t\tselect {\n\t\tcase <-s.bootstrapCompleted.ctx.Done():\n\t\t\ts.saveSetup()\n\t\t\ts.log.Info().Msg(\"Starting service...\")\n\t\t\ts.startRunning(runner, config, bsCfg)\n\t\t\treturn\n\t\tdefault:\n\t\t}\n\t\tif ctx.Err() != nil {\n\t\t\t// Context is cancelled, stop now\n\t\t\tbreak\n\t\t}\n\t}\n\t// Wait for any local slaves to return.\n\twg.Wait()\n}","func newMaster(name, binDir, rootDir string, loggers []Logger) *Master {\n\treturn &Master{\n\t\tprocBase: newProcBase(name, join(binDir, \"master\"), genLocalAddr(), loggers),\n\t\tmasterRoot: join(rootDir, name),\n\t\traftRoot: join(rootDir, name, \"raft\"),\n\t}\n}","func MakeMaster(files []string, nReduce int) *Master {\n\tm := Master{}\n\n\t// Your code here.\n\tm.mu = sync.Mutex{}\n\tm.nReduce = nReduce\n\tm.files = files\n\t\n\tif nReduce > len(files) {\n\t\tm.taskCh = make(chan Task, nReduce)\n\t} else {\n\t\tm.taskCh = make(chan Task, len(m.files))\n\t}\n\n\tm.initMapTasks()\n\tgo m.tickSchedule()\n\n\tm.server()\n\tdisplay(\"master init...\")\n\treturn &m\n}","func NewNodeHostWithMasterClientFactory(nhConfig config.NodeHostConfig,\n\tfactory MasterClientFactoryFunc) *NodeHost {\n\tlogBuildTagsAndVersion()\n\tif err := nhConfig.Validate(); err != nil {\n\t\tplog.Panicf(\"invalid nodehost config, %v\", err)\n\t}\n\tnh := &NodeHost{\n\t\tserverCtx: server.NewContext(nhConfig),\n\t\tnhConfig: nhConfig,\n\t\tstopper: syncutil.NewStopper(),\n\t\tduStopper: syncutil.NewStopper(),\n\t\tnodes: transport.NewNodes(streamConnections),\n\t\tinitializedC: make(chan struct{}),\n\t\ttransportLatency: newSample(),\n\t}\n\tnh.snapshotStatus = newSnapshotFeedback(nh.pushSnapshotStatus)\n\tnh.msgHandler = newNodeHostMessageHandler(nh)\n\tnh.clusterMu.requests = make(map[uint64]*server.MessageQueue)\n\tnh.createPools()\n\tnh.createTransport()\n\tif nhConfig.MasterMode() {\n\t\tplog.Infof(\"master servers specified, creating the master client\")\n\t\tnh.masterClient = newMasterClient(nh, factory)\n\t\tplog.Infof(\"master client type: %s\", nh.masterClient.Name())\n\t} else {\n\t\tplog.Infof(\"no master server specified, running in standalone mode\")\n\t\tdid := unmanagedDeploymentID\n\t\tif nhConfig.DeploymentID == 0 {\n\t\t\tplog.Warningf(\"DeploymentID not set in NodeHostConfig\")\n\t\t\tnh.transport.SetUnmanagedDeploymentID()\n\t\t} else {\n\t\t\tdid = nhConfig.DeploymentID\n\t\t\tnh.transport.SetDeploymentID(nhConfig.DeploymentID)\n\t\t}\n\t\tplog.Infof(\"DeploymentID set to %d\", unmanagedDeploymentID)\n\t\tnh.deploymentID = did\n\t\tnh.createLogDB(nhConfig, did)\n\t}\n\tctx, cancel := context.WithCancel(context.Background())\n\tnh.cancel = cancel\n\tinitializeFn := func() {\n\t\tif err := nh.initialize(ctx, nhConfig); err != nil {\n\t\t\tif err != context.Canceled && err != ErrCanceled {\n\t\t\t\tplog.Panicf(\"nh.initialize failed %v\", err)\n\t\t\t}\n\t\t}\n\t}\n\tif nh.masterMode() {\n\t\tplog.Infof(\"master mode, nh.initialize() invoked in new goroutine\")\n\t\tnh.stopper.RunWorker(func() {\n\t\t\tinitializeFn()\n\t\t})\n\t} else {\n\t\tplog.Infof(\"standalone mode, nh.initialize() directly invoked\")\n\t\tinitializeFn()\n\t}\n\tnh.stopper.RunWorker(func() {\n\t\tnh.masterRequestHandler(ctx)\n\t})\n\t// info reporting worker is using a different stopper as we need to stop it\n\t// separately during monkey test\n\tnh.duStopper.RunWorker(func() {\n\t\tnh.reportingWorker(ctx)\n\t})\n\tnh.stopper.RunWorker(func() {\n\t\tnh.nodeMonitorMain(ctx, nhConfig)\n\t})\n\tnh.stopper.RunWorker(func() {\n\t\tnh.tickWorkerMain()\n\t})\n\tif nh.masterMode() {\n\t\tnh.waitUntilInitialized()\n\t}\n\tnh.logNodeHostDetails()\n\treturn nh\n}","func Start() {\n\tIPs := DNS.GetAddr(Config.BootstrapDomainName)\n\tnodeContext = NC.NewNodeContext()\n\tnodeContext.SetLocalName(nameService.GetLocalName())\n\tnodeContext.LocalIp, _ = DNS.ExternalIP()\n\tmp = MP.NewMessagePasser(nodeContext.LocalName)\n\tstreamer = Streamer.NewStreamer(mp, nodeContext)\n\n\n\t// We use for loop to connect with all supernode one-by-one,\n\t// if a connection to one supernode fails, an error message\n\t// will be sent by messagePasser, and this message is further\n\t// processed in error handler.\n\t// init_fail: used in hello phase\n\t// exit: used when all supernode cannot be connected.\n\tmp.AddMappings([]string{\"exit\", \"init_fail\", \"super_fail\", \"ack\", \"loadtrack_result\"})\n\n\t// Initialize all the package structs\n\n\t// Define all the channel names and the binded functions\n\t// TODO: Register your channel name and binded eventhandlers here\n\t// The map goes as map[channelName][eventHandler]\n\t// All the messages with type channelName will be put in this channel by messagePasser\n\t// Then the binded handler of this channel will be called with the argument (*Message)\n\n\tchannelNames := map[string]func(*MP.Message){\n\t\t\"election_assign\": joinAssign,\n\t\t\"error\" : errorHandler,\n\n\t\t// The streaming related handlers goes here\n\t\t\"streaming_election\": streamer.HandleElection,\n\t\t\"streaming_join\": streamer.HandleJoin,\n\t\t\"streaming_data\": streamer.HandleStreamerData,\n\t\t\"streaming_stop\": streamer.HandleStop,\n\t\t\"streaming_assign\": streamer.HandleAssign,\n\t\t\"streaming_new_program\": streamer.HandleNewProgram,\n\t\t\"streaming_stop_program\": streamer.HandleStopProgram,\n\t\t\"streaming_quit\": streamer.HandleChildQuit,\n\t}\n\n\t// Init and listen\n\tfor channelName, handler := range channelNames {\n\t\t// Init all the channels listening on\n\t\tmp.Messages[channelName] = make(chan *MP.Message)\n\t\t// Bind all the functions listening on the channel\n\t\tgo listenOnChannel(channelName, handler)\n\t}\n\tgo nodeJoin(IPs)\n\tgo NodeCLIInterface(streamer)\n\twebInterface(streamer, nodeContext)\n\texitMsg := <- mp.Messages[\"exit\"]\n\tvar exitData string\n\tMP.DecodeData(&exitData, exitMsg.Data)\n\tfmt.Printf(\"Node: receiving force exit message [%s], node exit\\n\", exitData);\n}","func createNode(id int, myConf *Config, sm *State_Machine) cluster.Server {\n\tinitNode(id, myConf, sm)\n\t//Set up details about cluster nodes form json file.\n\tserver, err := cluster.New(id, \"config/cluster_config.json\")\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn server\n}","func MakeMaster(files []string, nReduce int) *Master {\r\n\tm := Master{}\r\n\r\n\t// Your code here.\r\n\tm.nextMapTaskNo = 1\r\n\tm.nextReduceTaskNo = 1\r\n\tm.inputFiles = make(chan string, 100)\r\n\tm.mapTasks = make(map[int]string)\r\n\tm.mapFinish = make(map[string]int)\r\n\tm.failedMapTaskNo = make(map[int]int)\r\n\tm.reduceTasks = make(map[int][]string)\r\n\tm.inputIntermediateFiles = make(chan []string, 100)\r\n\tm.done = make(chan bool)\r\n\tm.reduceFinish = make(map[int]bool)\r\n\tm.mapIntermediateFiles = make([][]string, 0)\r\n\tm.taskPhase = 0\r\n\tm.nReduce = nReduce\r\n\r\n\tfor _, file := range files {\r\n\t\tm.inputFiles <- file\r\n\t\tm.totalInputFiles++\r\n\t}\r\n\r\n\tm.server()\r\n\t// log.Println(\"-----Server Started------\")\r\n\treturn &m\r\n}","func StartMaster(configFile *goconf.ConfigFile) {\n\tSubIOBufferSize(\"master\", configFile)\n\tGoMaxProc(\"master\", configFile)\n\tConBufferSize(\"master\", configFile)\n\tIOMOnitors(configFile)\n\n\thostname := GetRequiredString(configFile, \"default\", \"hostname\")\n\tpassword := GetRequiredString(configFile, \"default\", \"password\")\n\n\tm := NewMaster()\n\n\trest.Resource(\"jobs\", MasterJobController{m, password})\n\trest.Resource(\"nodes\", MasterNodeController{m, password})\n\n\trest.ResourceContentType(\"jobs\", \"application/json\")\n\trest.ResourceContentType(\"nodes\", \"application/json\")\n\n\tListenAndServeTLSorNot(hostname)\n}","func NewMaster(addr string, port int, cert *services.HTTPCert) *Master {\n\tvar sm *services.HTTPService\n\n\tif cert == nil {\n\t\tsm = services.NewHTTPService(\"master\", addr, port, nil)\n\t} else {\n\t\tsm = services.NewHTTPSecureService(\"master\", addr, port, cert, nil)\n\t}\n\n\t// reg, err := sm.Select(\"register\")\n\t//\n\t// if err == nil {\n\t//\n\t// \treg.Terminal().Only(grids.ByPackets(func(g *grids.GridPacket) {\n\t// \t\tfmt.Println(\"/register receieves\", g)\n\t// \t}))\n\t// }\n\t//\n\t// disc, err := sm.Select(\"discover\")\n\t//\n\t// if err == nil {\n\t//\n\t// \tdisc.Terminal().Only(grids.ByPackets(func(g *grids.GridPacket) {\n\t// \t\tfmt.Println(\"/discover receieves\", g)\n\t// \t}))\n\t// }\n\t//\n\t// unreg, err := sm.Select(\"unregister\")\n\t//\n\t// if err == nil {\n\t//\n\t// \tunreg.Terminal().Only(grids.ByPackets(func(g *grids.GridPacket) {\n\t// \t\tfmt.Println(\"/unregister receieves\", g)\n\t// \t}))\n\t// }\n\n\treturn &Master{sm}\n}","func newNode() *topicNode {\n\treturn &topicNode{\n\t\tchildren: children{},\n\t\tclients: make(clientOpts),\n\t\tshared: make(map[string]clientOpts),\n\t}\n}","func NewMasterRouter() *MasterRouter {\n\tr := &MasterRouter{\n\t\tmessages: make(chan *routerpb.Message, 1),\n\t}\n\tgo func() {\n\t\tfor msg := range r.messages {\n\t\t\tfmt.Println(msg)\n\t\t}\n\t}()\n\treturn r\n}","func main() {\n\tlog.LoadConfiguration(\"log.cfg\")\n\tlog.Info(\"Start Master\")\n\n\tcfg := loadMasterConfiguration()\n\n\tlog.Info(\"Setting go cpu number to \", cfg.Constants.CpuNumber, \" success: \", runtime.GOMAXPROCS(cfg.Constants.CpuNumber))\n\n\t// Start rest api server with tcp services for inserts and selects\n\tportNum := fmt.Sprintf(\":%d\", cfg.Ports.RestApi)\n\tvar server = restApi.Server{Port: portNum}\n\tchanReq := server.StartApi()\n\n\t// Initialize node manager\n\tlog.Info(\"Initialize node manager\")\n\tgo node.NodeManager.Manage()\n\tnodeBal := node.NewLoadBalancer(node.NodeManager.GetNodes())\n\tgo nodeBal.Balance(node.NodeManager.InfoChan)\n\n\t// Initialize reduce factory\n\tlog.Info(\"Initialize reduce factory\")\n\treduce.Initialize()\n\n\t// Initialize task manager (balancer)\n\tlog.Info(\"Initialize task manager\")\n\tgo task.TaskManager.Manage()\n\ttaskBal := task.NewBalancer(cfg.Constants.WorkersCount, cfg.Constants.JobForWorkerCount, nodeBal)\n\tgo taskBal.Balance(chanReq, cfg.Balancer.Timeout)\n\n\t// Initialize node listener\n\tlog.Info(\"Initialize node listener\")\n\tservice := fmt.Sprintf(\":%d\", cfg.Ports.NodeCommunication)\n\tlog.Debug(service)\n\tlist := node.NewListener(service)\n\tgo list.WaitForNodes(task.TaskManager.GetChan)\n\tdefer list.Close() // fire netListen.Close() when program ends\n\n\t// TODO: Wait for console instructions (q - quit for example)\n\t// Wait for some input end exit (only for now)\n\t//var i int\n\t//fmt.Scanf(\"%d\", &i)\n\tc := make(chan os.Signal, 1)\n\tsignal.Notify(c, os.Interrupt)\n\t<-c\n\treturn\n}","func init() {\n\t// This function will be executed before everything else.\n\t// Do some initialization here.\n\tSBC = data.NewBlockChain()\n\t// When server works\n\t// Peers = data.NewPeerList(Register(), 32)\n\t// While server doesn't work -> use port as id\n\tid, _ := strconv.ParseInt(os.Args[1], 10, 64)\n\tPeers = data.NewPeerList(int32(id), 32)\n\tifStarted = true\n}","func initCluster() (_ *cluster, cbChan <-chan Callback) {\n cb := make(chan Callback)\n c := &cluster{\n nil,\n chan<- Callback(cb),\n make(map[Nid]*Node),\n make(map[Nid]*GossipNode),\n nil,\n sync.RWMutex{},\n }\n return c, (<-chan Callback)(cb)\n}","func RegisterNodeToMaster(UID, nodehandler, nodeselector string) error {\n\tbody, err := GenerateNodeReqBody(UID, nodeselector)\n\tif err != nil {\n\t\tFatalf(\"Unmarshal body failed: %v\", err)\n\t\treturn err\n\t}\n\n\ttr := &http.Transport{\n\t\tTLSClientConfig: &tls.Config{InsecureSkipVerify: true},\n\t}\n\tclient := &http.Client{\n\t\tTransport: tr,\n\t}\n\n\tt := time.Now()\n\tnodebody, err := json.Marshal(body)\n\tif err != nil {\n\t\tFatalf(\"Marshal body failed: %v\", err)\n\t\treturn err\n\t}\n\tBodyBuf := bytes.NewReader(nodebody)\n\treq, err := http.NewRequest(http.MethodPost, nodehandler, BodyBuf)\n\treq.Header.Set(\"Content-Type\", \"application/json\")\n\tif err != nil {\n\t\tFatalf(\"Frame HTTP request failed: %v\", err)\n\t\treturn err\n\t}\n\tresp, err := client.Do(req)\n\tif err != nil {\n\t\tFatalf(\"Sending HTTP request failed: %v\", err)\n\t\treturn err\n\t}\n\tInfof(\"%s %s %v in %v\", req.Method, req.URL, resp.Status, time.Since(t))\n\tdefer resp.Body.Close()\n\n\tgomega.Expect(resp.StatusCode).Should(gomega.Equal(http.StatusCreated))\n\treturn nil\n}","func createNodeDiscovery(c *SwarmContext) discovery.Backend {\n // we're to go through BeaconManger directly\n err := c.discoveryBack.Initialize(\"pc-beacon\", c.heartbeat, 0, getDiscoveryOpt(c))\n if err != nil {\n log.Fatal(err)\n }\n return c.discoveryBack\n}","func (zk *ZookeeperMaster) Register() error {\n\tif err := zk.createSelfNode(); err != nil {\n\t\treturn err\n\t}\n\t//create event loop for master flag\n\tgo zk.masterLoop()\n\tgo zk.healthLoop()\n\treturn nil\n\n}","func (self *RRSMNode) Build(addr string, initState RRSMState, configuration *RRSMConfig,\n\tRPCListenPort string, electionTimeout time.Duration, heartbeatInterval time.Duration) error {\n\tself.InitState = initState\n\tself.CurrentState = initState\n\tself.nodes = make(map[string]*rpc.RPCClient)\n\tself.addr = addr\n\n\t// init timer\n\tself.electionTimeoutTicker = nil\n\tself.electionTimeout = electionTimeout\n\tself.heartbeatTimeTicker = nil\n\tself.heartbeatInterval = heartbeatInterval\n\n\t// become a follower at the beginning\n\tself.character = RaftFOLLOWER\n\tself.currentTerm = uint64(0)\n\tself.haveVoted = false\n\n\t// init channels\n\tself.newTermChan = make(chan int, 1)\n\tself.accessLeaderChan = make(chan int, 1)\n\n\t// init lock\n\tself.termChangingLock = &sync.Mutex{}\n\tself.leaderChangingLock = &sync.Mutex{}\n\n\t// init node configuration\n\tif configuration == nil {\n\t\treturn fmt.Errorf(\"configuration is needed!\")\n\t}\n\tif len(configuration.Nodes) <= 0 {\n\t\treturn fmt.Errorf(\"config err: amounts of nodes needed to be a positive number!\")\n\t}\n\tself.config = *configuration\n\tself.amountsOfNodes = uint32(len(self.config.Nodes))\n\n\t// register rpc service\n\traftRPC := RaftRPC{\n\t\tnode: self,\n\t}\n\terr := rpc.RPCRegister(RPCListenPort, &raftRPC)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// build rpc connection with other nodes\n\tfor _, node := range self.config.Nodes {\n\t\tif node != addr {\n\t\t\tclient, err := rpc.RPCConnect(node)\n\t\t\tif err != nil {\n\t\t\t\t// need to connect with all the nodes at the period of building\n\t\t\t\treturn err\n\t\t\t} else {\n\t\t\t\tself.nodes[node] = client\n\t\t\t}\n\t\t}\n\t}\n\n\treturn nil\n}","func main() {\n\t// init our channel new info listener\n\tinfo := make(chan string)\n\tgo printNewInfo(info)\n\t// open up listener\n\tlisten, err := net.Listen(\"tcp\", \"127.0.0.1:8001\")\n\tif err != nil {\n\t\t// fatal error starting up listener. Someone is occupying Port\n\t\tlog.Fatal(err)\n\t}\n\t// for loop while we haven't reached 5 nodes\n\tfor ; max_nodes > 0; max_nodes = max_nodes - 1 {\n\t\t// listen for new connection requests\n\t\tconn, err := listen.Accept()\n\n\t\tif err != nil {\n\t\t\t// not breaking error, that is a node side error\n\t\t\tfmt.Println(\"An error occured trying to accept new connection.\", err)\n\t\t}\n\n\t\t// node handler\n\t\tif _, ok := conn.RemoteAddr().(*net.TCPAddr); ok {\n\n\t\t\t// let's make the last node the leader (even if they aren't the closest)\n\t\t\tif max_nodes == 1 {\n\t\t\t\tleader = true\n\t\t\t}\n\n\t\t\tcheck := false\n\t\t\t// assign random ID\n\t\t\t// between 8002 and 8999\n\t\t\tvar ID int\n\t\t\tfor check == false {\n\n\t\t\t\tID = 8000 + rand.Intn(997) + 2\n\t\t\t\t// sanity check to see if someone has that ID\n\t\t\t\tln, err := net.Listen(\"tcp\", \"127.0.0.1:\"+strconv.Itoa(ID))\n\t\t\t\tif err != nil {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tcheck = true\n\t\t\t\t_ = ln.Close()\n\t\t\t}\n\t\t\tnodeList[conn] = Node{ID: ID, Leader: false, Port: ID, Conn: conn}\n\t\t\tinfo <- \"Node: \" + strconv.Itoa(ID) + \" has joined\"\n\t\t\t// send the Node info to the node in question\n\t\t\tio.WriteString(conn, strconv.Itoa(ID) + \":\" + strconv.Itoa(ID) + \":\" + strconv.FormatBool(leader) + \"\\n\")\n\t\t\t// monitor the new connection in case it drops\n\t\t\tgo connectionCheck(conn, info, ID)\n\t\t}\n\n\t}\n\n\t// at this point we have gotten all 5 nodes on board\n\t// we now need to send an update to them\n\tfor conn, _ := range nodeList {\n\t\tgo sendInfo(conn)\n\t}\n\n\tvar empty int\n\tfmt.Scan(&empty)\n}","func (server *Server) ConntectMaster(in *pb.ConnectionRequest, stream pb.Result_ConntectMasterServer) error {\n\n\tserver.addNewClient(in.Id, stream)\n\t// make the stream long lived\n\tfor {\n\t}\n\n}","func (h *hub) start() error {\n\t// Start transport\n\tif err := h.transport.start(); err != nil {\n\t\treturn err\n\t}\n\n\t// Start hub channel listeners\n\tgo func() {\n\t\tfor {\n\t\t\tselect {\n\t\t\tcase client := <-h.registerc:\n\t\t\t\t// Handle register client request\n\t\t\t\th.registerClient(client)\n\t\t\tcase client := <-h.unregisterc:\n\t\t\t\t// Handle unregister client request\n\t\t\t\th.unregisterClient(client)\n\t\t\tcase msg := <-h.inboundc:\n\t\t\t\t// Handle message received from client\n\t\t\t\th.onClientMessage(msg)\n\t\t\tcase msg := <-h.peerc:\n\t\t\t\t// Handle message received from peer\n\t\t\t\th.onPeerMessage(msg)\n\t\t\tcase data := <-h.masterc:\n\t\t\t\t// Handle message received from master\n\t\t\t\th.onMasterMessage(data)\n\t\t\t}\n\t\t}\n\t}()\n\n\treturn nil\n}","func startNode(cfg *Config) error {\n\tapp, err := app.NewApplication(cfg.App())\n\tif err != nil {\n\t\treturn err\n\t}\n\n\ttmcfg, nodeLogger, nodeKey, err := setupNode()\n\tif err != nil {\n\t\treturn fmt.Errorf(\"failed to setup config: %w\", err)\n\t}\n\n\tn, err := node.NewNode(tmcfg,\n\t\tprivval.LoadOrGenFilePV(tmcfg.PrivValidatorKeyFile(), tmcfg.PrivValidatorStateFile()),\n\t\tnodeKey,\n\t\tproxy.NewLocalClientCreator(app),\n\t\tnode.DefaultGenesisDocProviderFunc(tmcfg),\n\t\tnode.DefaultDBProvider,\n\t\tnode.DefaultMetricsProvider(tmcfg.Instrumentation),\n\t\tnodeLogger,\n\t)\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn n.Start()\n}","func (instance *DBSyncSlave) init() {\n\tif nil != instance {\n\t\tif len(instance.Config.Uuid) > 0 {\n\t\t\tinstance.UID = instance.Config.Uuid\n\t\t} else {\n\t\t\tinstance.UID, _ = lygo_sys.ID()\n\t\t}\n\t\tif nil == instance.client {\n\t\t\tinstance.client = lygo_nio.NewNioClient(instance.Config.Host(), instance.Config.Port())\n\t\t\tinstance.client.OnConnect(instance.doConnect)\n\t\t\tinstance.client.OnDisconnect(instance.doDisconnect)\n\t\t}\n\t}\n}","func (node *DataNode) Init() error {\n\tctx := context.Background()\n\n\treq := &datapb.RegisterNodeRequest{\n\t\tBase: &commonpb.MsgBase{\n\t\t\tSourceID: node.NodeID,\n\t\t},\n\t\tAddress: &commonpb.Address{\n\t\t\tIp: Params.IP,\n\t\t\tPort: int64(Params.Port),\n\t\t},\n\t}\n\n\tresp, err := node.dataService.RegisterNode(ctx, req)\n\tif err != nil {\n\t\treturn fmt.Errorf(\"Register node failed: %v\", err)\n\t}\n\tif resp.Status.ErrorCode != commonpb.ErrorCode_Success {\n\t\treturn fmt.Errorf(\"Receive error when registering data node, msg: %s\", resp.Status.Reason)\n\t}\n\n\tselect {\n\tcase <-time.After(RPCConnectionTimeout):\n\t\treturn errors.New(\"Get DmChannels failed in 30 seconds\")\n\tcase <-node.watchDm:\n\t\tlog.Debug(\"insert channel names set\")\n\t}\n\n\tfor _, kv := range resp.InitParams.StartParams {\n\t\tswitch kv.Key {\n\t\tcase \"DDChannelName\":\n\t\t\tParams.DDChannelNames = []string{kv.Value}\n\t\tcase \"SegmentStatisticsChannelName\":\n\t\t\tParams.SegmentStatisticsChannelName = kv.Value\n\t\tcase \"TimeTickChannelName\":\n\t\t\tParams.TimeTickChannelName = kv.Value\n\t\tcase \"CompleteFlushChannelName\":\n\t\t\tParams.CompleteFlushChannelName = kv.Value\n\t\tdefault:\n\t\t\treturn fmt.Errorf(\"Invalid key: %v\", kv.Key)\n\t\t}\n\t}\n\n\treplica := newReplica()\n\n\tvar alloc allocatorInterface = newAllocator(node.masterService)\n\n\tchanSize := 100\n\tflushChan := make(chan *flushMsg, chanSize)\n\tnode.flushChan = flushChan\n\tnode.dataSyncService = newDataSyncService(node.ctx, flushChan, replica, alloc, node.msFactory)\n\tnode.dataSyncService.init()\n\tnode.metaService = newMetaService(node.ctx, replica, node.masterService)\n\tnode.replica = replica\n\n\treturn nil\n}","func MakeMaster(files []string, nReduce int) *Master {\n\tm := Master{}\n\n\t// Your code here.\n\tm.init()\n\n\tm.server()\n\treturn &m\n}","func initConsumer() sarama.Consumer {\n\tsarama.Logger = log.New(os.Stdout, \"\", log.Ltime)\n\n\tconfig := sarama.NewConfig()\n\tconfig.ClientID = CLIENTID\n\tconfig.Consumer.Return.Errors = true\n\n\tbrokers := []string{BROKERS}\n\n\tmaster, err := sarama.NewConsumer(brokers, config)\n\tif err != nil {\n\t\tfmt.Println(\"error create master consumer: \")\n\t\tpanic(err)\n\t}\n\n\treturn master\n}","func (b *ClusterNodesBuilder) Master(value int) *ClusterNodesBuilder {\n\tb.master = &value\n\treturn b\n}","func newNodes(c *Client) *nodes {\n\treturn &nodes{c}\n}","func newSwimCluster(size int) *swimCluster {\n\tvar nodes []*Node\n\tvar channels []*tchannel.Channel\n\tfor i := 0; i < size; i++ {\n\t\tch, err := tchannel.NewChannel(\"test\", nil)\n\t\tif err != nil {\n\t\t\tpanic(err)\n\t\t}\n\n\t\tif err := ch.ListenAndServe(\"127.0.0.1:0\"); err != nil {\n\t\t\tpanic(err)\n\t\t}\n\t\tchannels = append(channels, ch)\n\n\t\thostport := ch.PeerInfo().HostPort\n\t\tnode := NewNode(\"test\", hostport, ch.GetSubChannel(\"test\"), nil)\n\n\t\tnodes = append(nodes, node)\n\t}\n\treturn &swimCluster{nodes: nodes, channels: channels}\n}","func main() {\n\trouter := mux.NewRouter()\n\t\n\t//initial nodes can be added form the command line \n\tif len(os.Args) > 1 {\n\t\tnodeEndpoints := strings.Split(os.Args[1], \",\")\n\t\tfor ind, node := range nodeEndpoints {\n\t\t\tcounternodes[node] = strconv.Itoa(ind) \n\t\t}\n\t} \n\n\n\tfmt.Println(\"master node started on : 8000\")\n\trouter.HandleFunc(\"/items\", UpdateCount).Methods(\"POST\")\n\trouter.HandleFunc(\"/items/{id}/count\", GetCount).Methods(\"GET\")\n\trouter.HandleFunc(\"/ping\", CheckStatus).Methods(\"GET\")\n\trouter.HandleFunc(\"/addnode\", AddCounterNode).Methods(\"POST\")\n\trouter.HandleFunc(\"/removenode\", RemoveCounterNode).Methods(\"POST\")\n\trouter.HandleFunc(\"/syncnode/{nodeid}\", SyncCounterNode).Methods(\"POST\")\n\tlog.Fatal(http.ListenAndServe(\":8000\", router))\n}","func InitNetwork(nodes []Node, myself int) (network Network, err error) {\n\trC := make(chan Message, 65535) //Increased for TS\n\tsC := make(chan Message, 65535) //Increased for TS\n\tccC := make(chan *net.TCPConn, 65535)\n\tnetwork = Network{\n\t\tNodes: []Node{},\n\t\tConnections: map[int]*net.TCPConn{},\n\t\tClientConns: []*net.TCPConn{},\n\t\tReceiveChan: rC,\n\t\tSendChan: sC,\n\t\tClientConnChan: ccC,\n\t}\n\n\tfor _, node := range nodes {\n\t\tif node.ID == myself {\n\t\t\tfmt.Printf(\"You are number %v\\n\", myself)\n\t\t\tnetwork.Myself = node\n\t\t\tTCPsocket := network.Myself.IP + \":\" + strconv.Itoa(network.Myself.Port)\n\t\t\tnetwork.Myself.TCPaddr, err = net.ResolveTCPAddr(\"tcp\", TCPsocket)\n\t\t} else {\n\t\t\tTCPsocket := node.IP + \":\" + strconv.Itoa(node.Port)\n\t\t\taddr, _ := net.ResolveTCPAddr(\"tcp\", TCPsocket)\n\t\t\tnetwork.Nodes = append(network.Nodes, Node{\n\t\t\t\tID: node.ID,\n\t\t\t\tIP: node.IP,\n\t\t\t\tPort: node.Port,\n\t\t\t\tTCPaddr: addr,\n\t\t\t})\n\t\t}\n\t}\n\treturn network, err\n}","func (m *Master) Build() {\n\toutChannel := make(chan [2]string, 100)\n\n\tvar channels [][]chan [2]string\n\tfor i := 0; i < len(m.workers); i++ {\n\t\tvar newChannels []chan [2]string\n\t\tfor j := 0; j < len(m.workers[i]); j++ {\n\t\t\tnewChannels = append(newChannels, make(chan [2]string, 100))\n\t\t}\n\t\tchannels = append(channels, newChannels)\n\t}\n\tfor j := 0; j < len(m.workers[0]); j++ {\n\t\tm.workers[0][j].init(1, channels[0][j], channels[1])\n\t}\n\tfor i := 1; i < len(m.workers)-1; i++ {\n\t\tfor j := 0; j < len(m.workers[i]); j++ {\n\t\t\tm.workers[i][j].init(len(m.workers[i-1]), channels[i][j], channels[i+1])\n\t\t}\n\t}\n\tlast := len(m.workers) - 1\n\tfor j := 0; j < len(m.workers[last]); j++ {\n\t\tm.workers[last][j].init(len(m.workers[last-1]), channels[last][j], []chan [2]string{outChannel})\n\t}\n\n\tm.input.init(channels[0])\n\n\tm.output.init(len(m.workers[last]), outChannel)\n\n\tm.output.numUpstream = len(m.workers[last])\n\tm.output.inChannel = outChannel\n\tm.output.endChannel = make(chan int)\n}","func NewNODES(config configuration.CONFIGURATION) *NODES_IMPL {\r\n client := new(NODES_IMPL)\r\n client.config = config\r\n return client\r\n}","func NewMasterConn(c net.Conn) (m Master, e error) {\n\tdefer func() {\n\t\tif e != nil {\n\t\t\tc.Close()\n\t\t}\n\t}()\n\n\tgobCon := gobplexer.NetConnection(c)\n\trootConnector := gobplexer.MultiplexConnector(gobCon)\n\tkeptAlive, err := gobplexer.KeepaliveConnector(rootConnector,\n\t\tpingInterval, pingMaxDelay)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tconnector := gobplexer.MultiplexConnector(keptAlive)\n\tif conn, err := connector.Connect(); err != nil {\n\t\treturn nil, fmt.Errorf(\"connect for info: %s\", err)\n\t} else if infoObj, err := conn.Receive(); err != nil {\n\t\treturn nil, fmt.Errorf(\"read info: %s\", err)\n\t} else if info, ok := infoObj.(SlaveInfo); !ok {\n\t\treturn nil, fmt.Errorf(\"invalid info type: %T\", infoObj)\n\t} else {\n\t\tdoneChan := make(chan struct{})\n\t\tgo func() {\n\t\t\t// The other end leaves this sub-connection open so we\n\t\t\t// can poll from it to see when the connection dies.\n\t\t\tconn.Receive()\n\t\t\tc.Close()\n\t\t\tclose(doneChan)\n\t\t}()\n\t\treturn &masterConn{\n\t\t\tconnector: connector,\n\t\t\tdoneChan: doneChan,\n\t\t\tinfo: info,\n\t\t}, nil\n\t}\n}","func initServer(ctx context.Context, n *Node) error {\n\n\tif n.index < int32(len(n.config.Nodes)) {\n\n\t\tle := n.config.Nodes[n.index]\n\t\tvar listener net.Listener\n\n\t\terr := backoff.Retry(\n\t\t\tfunc() error {\n\t\t\t\tvar err error\n\t\t\t\tlistener, err = net.Listen(\"tcp\", le)\n\t\t\t\treturn err\n\t\t\t},\n\t\t\tbackoff.WithMaxRetries(backoff.NewExponentialBackOff(), 3),\n\t\t)\n\n\t\t// listener, err := net.Listen(\"tcp\", le)\n\t\tif err != nil {\n\t\t\terr = raftErrorf(err, \"failed to acquire local TCP socket for gRPC\")\n\t\t\tn.logger.Errorw(\"initServer failed (some other application or previous instance still using socket?)\",\n\t\t\t\traftErrKeyword, err)\n\t\t\treturn err\n\t\t}\n\n\t\ts := &raftServer{\n\t\t\tnode: n,\n\t\t\tlocalListener: listener,\n\t\t\tlocalAddr: le,\n\t\t}\n\n\t\tn.messaging.server = s\n\t\tn.logger.Debugw(\"listener acquired local node address\", s.logKV()...)\n\n\t} else {\n\n\t\terr := raftErrorf(\n\t\t\tRaftErrorServerNotSetup, \"LocalNodeIndex in out of bounds of cluster Nodes configuration\")\n\t\tn.logger.Errorw(\"initServer failed\", raftErrKeyword, err)\n\t\treturn err\n\n\t}\n\n\treturn nil\n}","func (agent *ActionAgent) InitMaster(ctx context.Context) (string, error) {\n\tif err := agent.lock(ctx); err != nil {\n\t\treturn \"\", err\n\t}\n\tdefer agent.unlock()\n\n\t// Initializing as master implies undoing any previous \"do not replicate\".\n\tagent.setSlaveStopped(false)\n\n\t// we need to insert something in the binlogs, so we can get the\n\t// current position. Let's just use the mysqlctl.CreateReparentJournal commands.\n\tcmds := mysqlctl.CreateReparentJournal()\n\tif err := agent.MysqlDaemon.ExecuteSuperQueryList(ctx, cmds); err != nil {\n\t\treturn \"\", err\n\t}\n\n\t// get the current replication position\n\tpos, err := agent.MysqlDaemon.MasterPosition()\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\n\t// If using semi-sync, we need to enable it before going read-write.\n\tif err := agent.fixSemiSync(topodatapb.TabletType_MASTER); err != nil {\n\t\treturn \"\", err\n\t}\n\n\t// Set the server read-write, from now on we can accept real\n\t// client writes. Note that if semi-sync replication is enabled,\n\t// we'll still need some slaves to be able to commit transactions.\n\tstartTime := time.Now()\n\tif err := agent.MysqlDaemon.SetReadOnly(false); err != nil {\n\t\treturn \"\", err\n\t}\n\tagent.setExternallyReparentedTime(startTime)\n\n\t// Change our type to master if not already\n\tif _, err := agent.TopoServer.UpdateTabletFields(ctx, agent.TabletAlias, func(tablet *topodatapb.Tablet) error {\n\t\ttablet.Type = topodatapb.TabletType_MASTER\n\t\treturn nil\n\t}); err != nil {\n\t\treturn \"\", err\n\t}\n\n\t// and refresh our state\n\tagent.initReplication = true\n\tif err := agent.refreshTablet(ctx, \"InitMaster\"); err != nil {\n\t\treturn \"\", err\n\t}\n\treturn mysql.EncodePosition(pos), nil\n}","func NewMasterNode(seed []byte) (*Node, error) {\n\t// Check if seed has valid size\n\tif len(seed) < minSeedSize || len(seed) > maxSeedSize {\n\t\treturn nil, errors.New(\"NewMasterNode: invalid seed size\")\n\t}\n\n\t// Generate HMAC-SHA512 with hardcoded seed as Key\n\th := hmac.New(hasher.SHA2_512.New, []byte(\"Bitcoin seed\"))\n\n\t// Data: H(seed)\n\th.Write(seed)\n\taux := h.Sum(nil)\n\n\t// Validate Private Key\n\terr := validatePrivateKey(aux[:keySize])\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// Export Key and Chain Code from aux\n\tnode := &Node{\n\t\tKey: aux[:keySize],\n\t\tCode: aux[keySize:],\n\t}\n\treturn node, nil\n}","func (m *Master) server() {\n\trpc.Register(m)\n\trpc.HandleHTTP()\n\tos.Create(\"mr-socket\")\n\n\tl, e := net.Listen(\"tcp\", \"0.0.0.0:8080\")\n\tif e != nil {\n\t\tlog.Fatal(\"listen error:\", e)\n\t}\n\tlog.Printf(\"Server is running at %s\\n\", l.Addr().String())\n\tgo http.Serve(l, nil)\n}","func init() {\n\n\t//Welcome Message\n\tfmt.Println(\"------------------------------------------------------------------\")\n\tfmt.Println(\"Starting Natyla...\")\n\tfmt.Println(\"Version: 1.02\")\n\n\t//Set the thread quantity based on the number of CPU's\n\tcoreNum := runtime.NumCPU()\n\n\tfmt.Println(\"Number of cores: \", coreNum)\n\n\t//read the config file\n\treadConfig()\n\n\t//create the data directory\n\tcreateDataDir()\n\n\t//set max memory form config\n\tmaxMemBytes, _ = config[\"memory\"].(json.Number).Int64()\n\tfmt.Println(\"Max memory defined as: \", maxMemBytes/1024/1024, \" Mbytes\")\n\n\truntime.GOMAXPROCS(coreNum)\n\n\t//Create a new doble-linked list to act as LRU\n\tlruList = list.New()\n\n\t//Create the channels\n\tlisChan = make(chan int, 1)\n\tLRUChan = make(chan int, 1)\n\tcollectionChan = make(chan int, 1)\n\n\tcollections = make(map[string]collectionChannel)\n\n\t//Read collections from disk\n\tnRead := readAllFromDisk()\n\tfmt.Println(\"Read\", nRead, \"entries from disk\")\n\n\tfmt.Println(\"Ready, API Listening on http://localhost:8080, Telnet on port 8081\")\n\tfmt.Println(\"------------------------------------------------------------------\")\n}","func (n *Node) Init() {\n\tn.NodeNet.Init()\n\n\tn.NodeNet.Logger = n.Logger\n\tn.NodeBC.Logger = n.Logger\n\n\tn.NodeBC.MinterAddress = n.MinterAddress\n\n\tn.NodeBC.DBConn = n.DBConn\n\n\t// Nodes list storage\n\tn.NodeNet.SetExtraManager(NodesListStorage{n.DBConn, n.SessionID})\n\t// load list of nodes from config\n\tn.NodeNet.SetNodes([]net.NodeAddr{}, true)\n\n\tn.InitClient()\n\n\trand.Seed(time.Now().UTC().UnixNano())\n}","func StartRPCClient(spawnChannel chan int, somechan chan bool,job *Job) {\n\tfmt.Print(\"\\n> Initating connection with master\")\n\tclient, err := rpc.Dial(\"tcp\", \"0.0.0.0:12345\")\n\tif err != nil {\n\t log.Fatal(err)\n\t}\n\n\tl := string(\"Test String\")\n\n\terr = client.Call(\"Master.EstConnection\", l, &job)\n\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\tfmt.Printf(\"\\n> Pusblising on mapper spawn channel\")\n\tspawnChannel <- job.NMappers\n\tsomechan <- true\n\tclose(spawnChannel)\n\tclose(somechan)\n}","func (zk *ZookeeperMaster) Init() error {\n\tzk.isMaster = false\n\t//create connection to zookeeper\n\tzk.client = zkclient.NewZkClient(zk.zkHosts)\n\tif err := zk.client.ConnectEx(time.Second * 10); err != nil {\n\t\treturn fmt.Errorf(\"Init failed when connect zk, %s\", err.Error())\n\t}\n\treturn nil\n}","func TcpManagerInit() *TcpManager {\n\tm := &TcpManager{\n\t\tbind: make(chan *TcpClient, 10),\n\t\tunbind: make(chan *TcpClient, 10),\n\t\tclose: make(chan *TcpClient, 10),\n\t\tbindClients: util.NewConcMap(),\n\t\tunbindClients: util.NewConcMap(),\n\t}\n\tants.Submit(m.Run)\n\treturn m\n}","func (m *Master) Connect(a *ConnectArgs, r *ConnectRes) error {\n\tm.mu.Lock()\n\tdefer m.mu.Unlock()\n\n\tm.idSeq++\n\ts := &MasterSlave{\n\t\tid: m.idSeq,\n\t\tprocs: a.Procs,\n\t\tlastSync: time.Now(),\n\t}\n\tm.slaves[s.id] = s\n\tr.ID = s.id\n\t// Give the slave initial corpus.\n\tfor _, a := range m.corpus.m {\n\t\tr.Corpus = append(r.Corpus, MasterInput{a.data, a.meta, execCorpus, !a.user, true})\n\t}\n\treturn nil\n}","func init() {\n\tbackendQueue = make(chan *Backend, 10) \t//channel at a size of 10\n\t\t\t\t\t\t//This is a buffered channel.\n\t\t\t\t\t\t//This means that it can hold 10 Backends before it starts to block\n}","func init() {\n\t// Reset commands, so `pegnetnode` is the only h\n\tpcmd.RootCmd.ResetCommands()\n\tpcmd.RootCmd.Flags().Bool(\"mock\", false, \"Do not actually connect to discord\")\n\tpcmd.RootCmd.Run = func(cmd *cobra.Command, args []string) {\n\t\tdiscordNode.Run(cmd, args)\n\t}\n}","func newHub(id string, redis *predis.Client) *hub {\n\th := &hub{\n\t\tid: id,\n\t\tredis: redis,\n\t\tclients: make(map[string]*client),\n\t\tinboundc: make(chan *Message),\n\t\tpeerc: make(chan *Message),\n\t\tmasterc: make(chan []byte),\n\t\tregisterc: make(chan *client),\n\t\tunregisterc: make(chan *client),\n\t}\n\n\th.presence = newPresence(h.id, h.redis)\n\th.transport = newTransport(h.id, h.redis, h.masterc, h.peerc)\n\n\treturn h\n}","func newResponseNode(model string, hash string, version *big.Int, sim *backends.SimulatedBackend) {\n\topts := mqtt.NewClientOptions().AddBroker(\"tcp://localhost:1883\")\n\tclient := mqtt.NewClient(opts)\n\ttoken := client.Connect()\n\tif token.Wait() && token.Error() != nil {\n\t\tlog.Fatalln(token.Error())\n\t}\n\n\tvar messageHandler mqtt.MessageHandler = func(client mqtt.Client, msg mqtt.Message) {\n\t\tcontract, _ := contracts.NewVerifier(common.HexToAddress(string(msg.Payload())), sim)\n\t\tsendResponse(sim, contract, hash, version)\n\t}\n\ttoken = client.Subscribe(model, 0, messageHandler)\n\tif token.Wait() && token.Error() != nil {\n\t\tlog.Fatalln(token.Error())\n\t}\n}","func ConnectNodes(config *utils.Config) {\n\tnodes := config.Nodes\n\tip := config.Master.Ip\n\tport := config.Master.Port\n\tCONN := ip + \":\" + port\n\n//connect to master server for all nodes and then connect to each other\n\tfor j := range nodes {\n\t\t//dial into master server\n\t\tconn, err := net.Dial(\"tcp\", CONN)\n\t\tutils.Error(err)\n\t\tnodes[j].Conns = append(nodes[j].Conns, conn)\n\t}\n\tfor i := range nodes {\n\t\t//have it connect to all nodes including itself\n\t\tfor _, serverNode := range nodes {\n\t\t\tip := serverNode.Ip\n\t\t\tport := serverNode.Port\n\t\t\tCONN := ip + \":\" + port\n\t\t\t//connect to all other nodes\n\t\t\tconn, err := net.Dial(\"tcp\", CONN)\n\t\t\tutils.Error(err)\n\t\t\tnodes[i].Conns = append(nodes[i].Conns, conn)\n\t\t}\n\t}\n}","func handleSlaveConnection(c net.Conn, msgchan chan Msg, addchan chan Slave) {\n\n\tlog.Printf(\"Handling new slave connection...\\n\")\n\tslaveReader := bufio.NewReader(c)\n\t//get number of files\n\tbuff1, _, _ := slaveReader.ReadLine() //get number of original files\n\tbuff2, _, _ := slaveReader.ReadLine() //get number of replicated files\n\tsize, _ := strconv.Atoi(string(buff1))\n\trsize, _ := strconv.Atoi(string(buff2))\n\tlog.Printf(\"Size: %d\\nRSize: %d\\n\", size, rsize)\n\t//create new slave\n\tnewClient := Slave{\n\t\tconnection: c,\n\t\tchunks: make([]string, 0, size),\n\t\trchunks: make([]string, 0, rsize),\n\t\tchannel: make(chan string, 2),\n\t\tresponse: \"nr\"}\n\tnewMsg := Msg{\n\t\tconnection: c}\n\t//receive original file names from slave\n\tfor i := 0; i < size; i++ {\n\t\tname, _, _ := slaveReader.ReadLine() //get Name of chunks\n\t\tnewClient.chunks = append(newClient.chunks, string(name))\n\t\tlog.Printf(\"Chunk # %d , Name: %s \\n\", i, string(name))\n\t}\n\t//receive replicated files names from slave\n\tfor i := 0; i < rsize; i++ {\n\t\tname, _, _ := slaveReader.ReadLine() //get Name of chunks\n\t\tnewClient.rchunks = append(newClient.rchunks, string(name))\n\t\tlog.Printf(\"RChunk # %d , Name: %s \\n\", i, string(name))\n\t}\n\tlog.Print(newClient)\n\t//sending new slave information to master thread\n\taddchan <- newClient\n\n\tcommand := \"nil\"\n\tfor {\n\t\tselect {\n\t\tcase x := <-newClient.channel:\n\t\t\tcommand = x\n\t\t\tfmt.Println(\"setting new command: \" + command)\n\t\tdefault:\n\n\t\t\tc.Write([]byte(command + \"\\n\"))\n\n\t\t\tcc, _, err := slaveReader.ReadLine()\n\t\t\tresponse := string(cc)\n\t\t\t//check for disconnectivity\n\t\t\tif response == \"\" || err != nil {\n\t\t\t\tlog.Println(\"Slave disconnected...\")\n\t\t\t\tnewMsg.msg = \"rmv\"\n\t\t\t\tmsgchan <- newMsg\n\t\t\t\treturn\n\t\t\t}\n\t\t\t//Parse reponse\n\t\t\tprsResp := strings.Split(response, \":\")\n\t\t\tlog.Print(prsResp[0])\n\t\t\t//set response of not found\n\t\t\tif prsResp[0] == \"not\" {\n\t\t\t\tcommand = \"nil\"\n\t\t\t\tnewMsg.msg = response\n\t\t\t\tmsgchan <- newMsg\n\t\t\t} else if prsResp[0] == \"done\" {\n\t\t\t\tcommand = \"nil\"\n\t\t\t\tnewMsg.msg = response\n\t\t\t\tmsgchan <- newMsg\n\t\t\t} else if prsResp[0] == \"nil\" {\n\t\t\t\tcommand = \"nil\"\n\t\t\t}\n\t\t\ttime.Sleep(1 * time.Second)\n\t\t}\n\t}\n}","func (n *Node) Start() error {\n\tgo n.mainLoop()\n\t// Wait until fully initialized\n\t<-n.initializedChan\n\treturn n.connect(NodeInfo{Ip: \"127.0.0.1\", Port: n.listenPort})\n}","func init(){\n\tskeleton.RegisterChanRPC(reflect.TypeOf(&msg.Hello{}), handleHello)\n}","func doStart(server common.Server, cfg *config.Config) (err error) {\n\tdebug.SetMaxThreads(20000)\n\n\ts, ok := server.(*DataNode)\n\tif !ok {\n\t\treturn errors.New(\"Invalid Node Type!\")\n\t}\n\n\ts.stopC = make(chan bool, 0)\n\n\t// parse the config file\n\tif err = s.parseConfig(cfg); err != nil {\n\t\treturn\n\t}\n\n\texporter.Init(ModuleName, cfg)\n\ts.registerMetrics()\n\ts.register(cfg)\n\n\t//parse the smux config\n\tif err = s.parseSmuxConfig(cfg); err != nil {\n\t\treturn\n\t}\n\t//connection pool must be created before initSpaceManager\n\ts.initConnPool()\n\n\t// init limit\n\tinitRepairLimit(s, cfg)\n\n\t// start the raft server\n\tif err = s.startRaftServer(cfg); err != nil {\n\t\treturn\n\t}\n\n\t// create space manager (disk, partition, etc.)\n\tif err = s.startSpaceManager(cfg); err != nil {\n\t\treturn\n\t}\n\n\t// check local partition compare with master ,if lack,then not start\n\tif err = s.checkLocalPartitionMatchWithMaster(); err != nil {\n\t\tlog.LogError(err)\n\t\texporter.Warning(err.Error())\n\t\treturn\n\t}\n\n\t// tcp listening & tcp connection pool\n\tif err = s.startTCPService(); err != nil {\n\t\treturn\n\t}\n\n\t//smux listening & smux connection pool\n\tif err = s.startSmuxService(cfg); err != nil {\n\t\treturn\n\t}\n\n\tgo s.registerHandler()\n\n\tgo s.startUpdateNodeInfo()\n\n\treturn\n}","func MakeMaster(files []string, nReduce int) *Master {\n\tnMap := len(files)\n\tm := NewMaster(files, max(nMap, nReduce), masterTimeout, nReduce)\n\n\t// Your code here.\n\tm.server()\n\treturn m\n}","func Initialize(configFileName string) error {\n\n\tif err := readConfigJSON(configFileName); err != nil {\n\t\treturn fmt.Errorf(\"initialize error: %v\", err)\n\t}\n\n\tmanager = &ManagerNode{\n\t\tManagerNodeID: ManagerNodeID(config.ManagerNodeID),\n\t\tTopicMap: make(map[string]*Topic),\n\t\tManagerPeers: make(map[ManagerNodeID]string),\n\t\tBrokerNodes: make(map[BrokerNodeID]string),\n\t\tTopicMutex: &sync.Mutex{},\n\t\tManagerMutex: &sync.Mutex{},\n\t\tBrokerMutex: &sync.Mutex{},\n\t\tMU: &sync.Mutex{},\n\t}\n\n\tcache, err := lru.New(cacheSize)\n\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tmanager.TransactionCache = cache\n\n\tlogger = govec.InitGoVector(string(manager.ManagerNodeID), fmt.Sprintf(\"%v-logfile\", manager.ManagerNodeID), govec.GetDefaultConfig())\n\tloggerOptions = govec.GetDefaultLogOptions()\n\n\tgo func() {\n\t\ttime.Sleep(time.Duration(100) * time.Millisecond)\n\t\tif len(config.PeerManagerNodeIP) != 0 {\n\t\t\tif err := manager.registerPeerRequest(config.PeerManagerNodeIP); err != nil {\n\t\t\t\tfmt.Println(err)\n\t\t\t\tos.Exit(1)\n\t\t\t}\n\t\t}\n\t}()\n\n\tvar emptylist []string\n\tring = hashring.New(emptylist)\n\tspawnRPCServer()\n\treturn nil\n}","func createChannel() Channel {\n\tchannel := channelStruct{}\n\treturn &channel\n}","func (n *NodeConn) Init(arg interface {}) (interface {}) {\n\tn.ComplexComm.Init(c.ComplexCommInit{numChan:2})\n\treturn n\n}","func main(){\n\tmc := master.LoadConfig()\n\terrList := master.Start(mc.Num_instances, mc.Selection_config, mc.Ports)\n\tfor i, err := range errList {\n\t\tlog.Println(\"ERR: \", i, \"th master terminated with error: \", err)\n\t}\n\n}","func guildCreate(s *discordgo.Session, event *discordgo.GuildCreate) {\n\n\tif event.Guild.Unavailable {\n\t\treturn\n\t}\n\n\tfor _, channel := range event.Guild.Channels {\n\t\tif channel.ID == event.Guild.ID {\n\t\t\t_, _ = s.ChannelMessageSend(channel.ID, \"primitive-gobot is ready!\")\n\t\t\treturn\n\t\t}\n\t}\n}","func MakeMaster(files []string, nReduce int) *Master {\n\tm := Master{}\n\n\t// Your code here.\n\tm.nReduce = nReduce\n\tm.files = files\n\tm.nMap = len(files)\n\tm.mapStates = make([]mapState, m.nMap)\n\tm.reduceStates = make([]reduceState, m.nReduce)\n\tm.server()\n\treturn &m\n}","func init() {\n\tSBC = data.NewBlockChain()\n\tid, _ := strconv.ParseInt(os.Args[1], 10, 32)\n\tPeers = data.NewPeerList( /*Register()*/ int32(id), 32) // Uses port number as ID since TA server is down\n\tprivateKey, publicKey = client.GenerateKeyPair()\n\tifStarted = false\n\tmpt.Initial()\n\tclientBalanceMap = make(map[string]int32)\n\tpendingTransaction = make(map[string]string)\n\ttransactionMpt.Initial()\n\tclientBalanceMap[string(client.PublicKeyToBytes(publicKey))] = 1000\n\thighestblockTransaction = 0\n}","func MakeMaster(files []string, nReduce int) *Master {\n\tm := Master{}\n\tm.files = files\n\tm.record = map[string]*record{}\n\tm.tasks = map[int][]*record{}\n\tm.reduceTasks = map[int]*record{}\n\tm.nReduce = nReduce\n\tm.phase = TaskMapType\n\t// Your code here.\n\n\tm.server()\n\treturn &m\n}","func (c *Client) init() {\n\tif c.domains == nil {\n\t\tc.domains = map[int]string{}\n\t}\n\tif c.cfg == nil {\n\t\tc.cfg = manager.NewAtomicConfig(tg.Config{})\n\t}\n\tc.ready = tdsync.NewResetReady()\n\tc.restart = make(chan struct{})\n\tc.migration = make(chan struct{}, 1)\n\tc.sessions = map[int]*pool.SyncSession{}\n\tc.subConns = map[int]CloseInvoker{}\n\tc.invoker = chainMiddlewares(InvokeFunc(c.invokeDirect), c.mw...)\n\tc.tg = tg.NewClient(c.invoker)\n}","func NewConnectionToNodes(cycle int, nodes ...string) (Connection, error){\n disqueConn, err := connectToFirstAvailableNode(nodes...); if err != nil {\n return Connection{Cycle: cycle, Nodes: nodes}, err\n }\n\n return Connection{disqueConn, cycle, nodes}, nil\n}","func InitNode(absPath string, metaData MetaData) {\n\tfmt.Println(\"Initiating Node.JS project\")\n\n\t// Create the new directory\n\tfmt.Println(\"Making Directories\")\n\tos.Mkdir(path.Join(absPath, \"src\"), 0777)\n\tos.Mkdir(path.Join(absPath, \"test\"), 0777)\n\tos.Mkdir(path.Join(absPath, \".circleci\"), 0777)\n\n\t// Get node version\n\tnodev, err := runCmd(\"node\", \"-v\")\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\t// Write .nvmrc\n\tioutil.WriteFile(path.Join(absPath, \".nvmrc\"), []byte(nodev), 0666)\n\n\t// node version comes out like v10.9.0, so we need to trim the leading 'v'\n\tnodev = nodev[1:]\n\n\tfmt.Println(\"Getting Dependency Versions\")\n\tchaiv, err := runCmd(\"npm\", \"show\", \"chai\", \"version\")\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\tmochav, err := runCmd(\"npm\", \"show\", \"mocha\", \"version\")\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\teslintv, err := runCmd(\"npm\", \"show\", \"eslint\", \"version\")\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\tnycv, err := runCmd(\"npm\", \"show\", \"nyc\", \"version\")\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\tpInfo := packageInfo{\n\t\tName: metaData.Name,\n\t\tAuthor: metaData.Author,\n\t\tNodeVersion: nodev,\n\t\tChaiVersion: chaiv,\n\t\tMochaVersion: mochav,\n\t\tESLintVersion: eslintv,\n\t\tNYCVersion: nycv,\n\t}\n\n\t// Initiate the project\n\terr = createFileFromTemplate(templates.PackageJSON(), path.Join(absPath, \"package.json\"), pInfo)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\tnewFile, err := os.Create(path.Join(absPath, \"src\", \"index.js\"))\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tnewFile.Close()\n\n\tfmt.Println(\"Installing dependencies\")\n\t_, err = runCmdFromDir(absPath, \"npm\", \"install\")\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\terr = ioutil.WriteFile(path.Join(absPath, \".eslintrc.js\"), []byte(templates.ESLintRC()), 0666)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\tfmt.Println(\"Setting up CircleCI\")\n\terr = createFileFromTemplate(templates.CircleNode(), path.Join(absPath, \".circleci\", \"config.yml\"), pInfo)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\tfmt.Println(\"Fetching .gitignore\")\n\tresp, err := http.Get(\"https://raw.githubusercontent.com/github/gitignore/master/Node.gitignore\")\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tdefer resp.Body.Close()\n\tbody, err := ioutil.ReadAll(resp.Body)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tioutil.WriteFile(path.Join(absPath, \".gitignore\"), body, 0666)\n\n\terr = createFileFromTemplate(templates.ComposeNode(), path.Join(absPath, \"docker-compose.yml\"), pInfo)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n}","func (p *Pupil) setupEventChannel(eventChan chan []byte) {\n\tvar err error\n\tif p.sock, err = respondent.NewSocket(); err != nil {\n\t\tlog.Fatal(\"Couldn't open the event port\")\n\t}\n\tp.sock.AddTransport(tcp.NewTransport())\n\tlog.Printf(\"Dialing into the master at %s\\n\", p.MasterEventURL)\n\tif err = p.sock.Dial(p.MasterEventURL); err != nil {\n\t\tlog.Fatalf(\"Couldn't connect to the master's event port at - %s\\n\", p.MasterEventURL)\n\t}\n\tlog.Printf(\"pupil ready to receive events from the master\")\n}","func MakeMaster(files []string, nReduce int) *Master {\n\tdelete()\n\tm := Master {\n\t\tmu: sync.RWMutex{},\n\t\tM: len(files),\n\t\tR: nReduce,\n\t\tidleTasks: [2]chan Task{make(chan Task, len(files)), make(chan Task, nReduce)},\n\t\tinProgress: [2]map[Task]bool{make(map[Task]bool), make(map[Task]bool)},\n\t\tcompletedTasks: [2]chan Task{make(chan Task, len(files)), make(chan Task, nReduce)},\n\t}\n\n\n\t// Your code here.\n\tfor i, file := range files {\n\t\ttask := Task{Type: \"map\", Filename: file, TaskNum: i, NReduce: nReduce}\n\t\tm.idleTasks[0] <- task\n\t}\n\n\tfor i:=0; i<nReduce ; i++ {\n\t\tm.idleTasks[1] <- Task{\n\t\t\tType: \"reduce\",\n\t\t\tFilename: \"\",\n\t\t\tTaskNum: i,\n\t\t\tNReduce: nReduce,\n\t\t}\n\t}\n\n\tm.server()\n\treturn &m\n}","func Connect(token string) error {\n\tdg, err := discordgo.New(\"Bot \" + token)\n\tif err != nil {\n\t\tfmt.Println(\"error creating Discord session,\", err)\n\t\treturn err\n\t}\n\tdg.AddHandler(manager)\n\tchannels, _ := dg.GuildChannels(\"675106841436356628\")\n\n\tfor _, v := range channels {\n\t\tfmt.Printf(\"Channel id: %s Channel name: %s\\n\", v.ID, v.Name)\n\t}\n\n\t// This function sends message every hour concurrently.\n\tgo func() {\n\t\tfor range time.NewTicker(time.Hour).C {\n\t\t\t_, err := dg.ChannelMessageSend(\"675109890204762143\", \"dont forget washing ur hands!\")\n\t\t\tif err != nil {\n\t\t\t\tlog.Println(\"couldn't send ticker message\", err)\n\t\t\t}\n\t\t}\n\t}()\n\n\terr = dg.Open()\n\tif err != nil {\n\t\tfmt.Println(\"error opening connection,\", err)\n\t\treturn err\n\t}\n\t// Wait here until CTRL-C or other term signal is received.\n\tfmt.Println(\"Bot is now running. Press CTRL-C to exit.\")\n\tsc := make(chan os.Signal, 1)\n\tsignal.Notify(sc, syscall.SIGINT, syscall.SIGTERM, os.Interrupt, os.Kill)\n\t<-sc\n\t// Cleanly close down the Discord session.\n\tdg.Close()\n\treturn nil\n}","func init() {\n\tbinlogplayer.RegisterClientFactory(\"gorpc\", func() binlogplayer.Client {\n\t\treturn &client{}\n\t})\n}","func InitiateAndStartQmlGrpcServer() {\n\tvar err error\n\n\tQmlServerObject.logger.WithFields(logrus.Fields{\n\t\t\"ID\": \"56b6419f-d714-4ab0-be62-f3c7f08b9558\",\n\t}).Info(\"Mother Server tries to start\")\n\n\t// Find first non allocated port from defined start port\n\t// TODO\n\n\tQmlServerObject.logger.WithFields(logrus.Fields{\n\t\t\"common_config.QmlServer_port): \": common_config.QmlServer_port,\n\t\t\"ID\": \"8f904ace-9d24-452b-891a-5b8e5c247ba2\",\n\t}).Info(\"Start listening on:\")\n\tlis, err = net.Listen(\"tcp\", string(common_config.QmlServer_port))\n\n\tif err != nil {\n\t\tQmlServerObject.logger.WithFields(logrus.Fields{\n\t\t\t\"err: \": err,\n\t\t\t\"ID\": \"0fbf0f08-6114-4cd8-9992-6a387955fb5f\",\n\t\t}).Fatal(\"failed to listen:\")\n\n\t} else {\n\t\tQmlServerObject.logger.WithFields(logrus.Fields{\n\t\t\t\"common_config.QmlServer_port): \": common_config.QmlServer_port,\n\t\t\t\"ID\": \"93496c07-2b6c-4edc-a1f9-3fd555fa1201\",\n\t\t}).Info(\"Success in listening on port:\")\n\n\t}\n\n\t// Creates a new RegisterMotherServer gRPC server\n\tgo func() {\n\t\tQmlServerObject.logger.WithFields(logrus.Fields{\n\t\t\t\"ID\": \"ebc26735-9d13-4b13-91b8-20999cd5e254\",\n\t\t}).Info(\"Starting QML gRPC Server\")\n\n\t\tregisterQmlGrpcServer = grpc.NewServer()\n\t\tqml_server_grpc_api.RegisterQmlGrpcServicesServer(registerQmlGrpcServer, &QMLgRrpServer_struct{})\n\n\t\tQmlServerObject.logger.WithFields(logrus.Fields{\n\t\t\t\"common_config.QmlServer_port): \": common_config.QmlServer_port,\n\t\t\t\"ID\": \"cfed87c4-55aa-4cd1-980a-a15eb75ab6fb\",\n\t\t}).Info(\"registerQmlGrpcServer for QMLs gRPC Server started\")\n\n\t\tregisterQmlGrpcServer.Serve(lis)\n\t}()\n}","func (n *miniNode) Init() Nodes { return Nodes{} }","func (s *Server) SetMaster(host string, config toolkit.M) error {\n\tif s.masterClient != nil {\n s.masterClient.Call(\"unfollow\", toolkit.M{}.Set(\"nodeid\", s.masterClient.Host), nil)\n\t\ts.masterClient.Close()\n\t}\n \n s.masterHost = host\n\tif host==\"\"{\n return nil \n }\n \n masterClient := NewClient(s.masterHost, config)\n\te := masterClient.Connect()\n\tif e != nil {\n\t\treturn errors.New(\"Server.SetMaster: \" + e.Error())\n\t}\n\n\te = masterClient.Call(\"follow\", toolkit.M{}.Set(\"nodeid\", s.Host), nil)\n\tif e != nil {\n\t\treturn errors.New(\"Server.SetMaster.Follow: \" + e.Error())\n\t}\n s.Log.AddLog(toolkit.Sprintf(\"Server %s is now following %s\", s.Host, host), \"INFO\") \t\n\treturn nil\n}","func MakeMaster(files []string, nReduce int) *Master {\n\tm := Master{}\n\n\t// Your code here.\n\tm.ReduceTask = make(map[int]*ReduceTaskStatus)\n\tm.MapTask = make(map[int]*MapTaskStatus)\n\tm.inputFileList = files\n\tm.nReduce = nReduce\n\tm.State = Map\n\tfor i, _ := range files {\n\t\tm.MapTask[i] = &MapTaskStatus{\n\t\t\tStatus: UnInit,\n\t\t}\n\t}\n\n\tm.server()\n\treturn &m\n}","func (c *Cluster) SetMaster(opts *pg.Options) error {\n\tconn, err := newConnection(opts, c.conf.ConnPingTimeout, c.conf.ConnCheckDelay)\n\tif err != nil {\n\t\treturn err\n\t}\n\tc.manager.master = conn\n\treturn nil\n}","func InitRing(myIp string, myId int) {\n\tfmt.Println(\"\\n------------------------------------------------------------------------------\")\n\tfmt.Println(\"Test 1: creating/join chord ring ...\")\n\tstart1 := time.Now()\n\n\t// scan for ring\n\tfmt.Println(\"\\nScanning for ring ...\")\n\tipInRing, _ := chord.CheckRing()\n\tringSize := len(ipInRing)\n\tfmt.Println(\"Ring scan completed!\\nNodes in ring: \", ipInRing, \"\\nRing size: \", ringSize)\n\n\t// init node\n\tfmt.Println(\"\\nCreating node ...\")\n\tchord.ChordNode = &chord.Node{\n\t\tIdentifier: myId,\n\t\tIP: myIp,\n\t}\n\tfmt.Println(\"\\nActivating node ...\")\n\tgo node_listen(myIp)\n\n\t// create / join ring\n\tif ringSize == 0 {\n\t\t// Ring does NOT exists => CREATE ring\n\t\tfmt.Println(\"\\nRing does NOT exists!\\nCreating new ring at \", myIp)\n\t\tchord.ChordNode.CreateNodeAndJoin(nil)\n\t\tfmt.Println(\"New ring successfully created!\")\n\t} else {\n\t\t// Ring EXISTS => JOIN ring\n\t\tfmt.Println(\"\\nRing does EXISTS!\")\n\t\tremoteIp := ipInRing[0]\n\t\tremoteId := chord.Hash(remoteIp)\n\t\tremoteNode := &chord.RemoteNode{\n\t\t\tIdentifier: remoteId,\n\t\t\tIP: remoteIp,\n\t\t}\n\n\t\tchord.ChordNode.IP = myIp\n\t\tchord.ChordNode.Identifier = myId\n\n\t\tfmt.Println(\"Joining ring via \", remoteId, \"(\", remoteIp, \")\")\n\t\tchord.ChordNode.CreateNodeAndJoin(remoteNode)\n\t\tfmt.Println(\"Node \", myId, \" successfully joined ring!\")\n\t}\n\n\tend1 := time.Now()\n\tduration1 := end1.Sub(start1)\n\tfmt.Println(\"Test 1 COMPLETED!!!\\nDuration \", duration1)\n\tfmt.Println(\"------------------------------------------------------------------------------\\n \")\n\tchord.ChordNode.PrintNode()\n}","func MakeMaster(filePath string, nReduce int) *Master {\n\n\tWriteDataIntoLists(filePath)\n\n\t// fmt.Println(courseList)\n\t// fmt.Println(roomList)\n\t// fmt.Println(timeSlotList)\n\n\tvar firstGeneration []Chrom\n\tfirstGeneration = CreateFirstGeneration(courseList, timeSlotList, roomList)\n\t//fmt.Println(len(firstGeneration))\n\t//PrintGeneration(firstGeneration)\n\t// for _, chrom := range firstGeneration {\n\t// \tfor _, gene := range chrom.genes {\n\t// \t\tPrintGene(gene)\n\t// \t}\n\t// }\n\n\tbestFitValue := float64(0)\n\tbestChromId := 0\n\n\tfor _, chrom := range firstGeneration {\n\t\tif chrom.FitnessScore > bestFitValue {\n\t\t\tbestChromId = chrom.Id\n\t\t\tbestFitValue = chrom.FitnessScore\n\t\t}\n\t}\n\n\tprevGeneration = firstGeneration\n\n\tbestChromInPrevGen := GetBestChromFromGen(prevGeneration)\n\twipGen = append(wipGen, bestChromInPrevGen)\n\tfmt.Println(\"------------------------------\")\n\tPrintGeneration(firstGeneration)\n\tfmt.Println(\"bestFitValue in initial generation is \", bestFitValue, \" chrom id is \", bestChromId)\n\n\tm := Master{}\n\n\tgo Monitor()\n\tm.server()\n\treturn &m\n}","func connectToMaster(u url.URL, done chan error) {\n\tdefer func() {\n\t\tdone <- errors.New(\"Channel Closed\")\n\t}()\n\n\tlog.Printf(\"connecting to %s\", u.String())\n\n\tconn, _, err := websocket.DefaultDialer.Dial(u.String(), nil)\n\tif err != nil {\n\t\tlog.Println(\"dial:\", err)\n\t\treturn\n\t}\n\tlog.Println(\"connect to master: SUCCESS\")\n\tslave := &BackupSlave{conn: conn, send: make(chan []byte, 256)}\n\tgo slave.writeBackupSlavePump()\n\tslave.readBackupSlavePump()\n\n}","func New(APIaddr string, requiredUserAgent string, requiredPassword string, nodeParams node.NodeParams, loadStartTime time.Time) (*Server, error) {\n\t// Wait for the node to be done loading.\n\tsrv, errChan := NewAsync(APIaddr, requiredUserAgent, requiredPassword, nodeParams, loadStartTime)\n\tif err := <-errChan; err != nil {\n\t\t// Error occurred during async load. Close all modules.\n\t\tif build.Release == \"standard\" {\n\t\t\tfmt.Println(\"ERROR:\", err)\n\t\t}\n\t\treturn nil, err\n\t}\n\treturn srv, nil\n}","func Genesis() {\n\tserver.listen()\n\tserver.managePeers()\n}","func main() {\n\tnode := node.New(\"modbus\")\n\tconfig := NewConfig()\n\n\tnode.OnConfig(updatedConfig(config))\n\twait := node.WaitForFirstConfig()\n\n\terr := node.Connect()\n\tif err != nil {\n\t\tlogrus.Error(err)\n\t\treturn\n\t}\n\tlogrus.Info(\"Waiting for config from server\")\n\terr = wait()\n\tif err != nil {\n\t\tlogrus.Error(err)\n\t\treturn\n\t}\n\n\tmodbusConnection := &Modbus{}\n\tlogrus.Infof(\"Connecting to modbus device: %s\", config.Device)\n\terr = modbusConnection.Connect()\n\n\tif err != nil {\n\t\tlogrus.Error(\"error connecting to modbus: \", err)\n\t\treturn\n\t}\n\n\tdefer modbusConnection.Close()\n\n\tresults, _ := modbusConnection.ReadInputRegister(214)\n\tlog.Println(\"REG_HC_TEMP_IN1: \", results)\n\tresults, _ = modbusConnection.ReadInputRegister(215)\n\tlog.Println(\"REG_HC_TEMP_IN2: \", results)\n\tresults, _ = modbusConnection.ReadInputRegister(216)\n\tlog.Println(\"REG_HC_TEMP_IN3: \", results)\n\tresults, _ = modbusConnection.ReadInputRegister(217)\n\tlog.Println(\"REG_HC_TEMP_IN4: \", results)\n\tresults, _ = modbusConnection.ReadInputRegister(218)\n\tlog.Println(\"REG_HC_TEMP_IN5: \", binary.BigEndian.Uint16(results))\n\tresults, _ = modbusConnection.ReadInputRegister(207)\n\tlog.Println(\"REG_HC_TEMP_LVL: \", results)\n\tresults, _ = modbusConnection.ReadInputRegister(301)\n\tlog.Println(\"REG_DAMPER_PWM: \", results)\n\tresults, _ = modbusConnection.ReadInputRegister(204)\n\tlog.Println(\"REG_HC_WC_SIGNAL: \", results)\n\tresults, _ = modbusConnection.ReadInputRegister(209)\n\tlog.Println(\"REG_HC_TEMP_LVL1-5: \", results)\n\tresults, _ = modbusConnection.ReadInputRegister(101)\n\tlog.Println(\"100 REG_FAN_SPEED_LEVEL: \", results)\n\n\t// connection := basenode.Connect()\n\tdev := &devices.Device{\n\t\tName: \"modbusDevice\",\n\t\tType: \"sensor\", // TODO if we add modbus write support we need to have another type\n\t\tID: devices.ID{ID: \"1\"},\n\t\tOnline: true,\n\t\tTraits: []string{},\n\t\tState: make(devices.State),\n\t}\n\n\tnode.AddOrUpdate(dev)\n\n\t// node.SetState(registers)\n\n\t// This worker recives all incomming commands\n\tticker := time.NewTicker(30 * time.Second)\n\tfor {\n\t\tselect {\n\t\tcase <-ticker.C:\n\t\t\tif len(config.Registers) == 0 {\n\t\t\t\tlogrus.Info(\"no configured registers to poll yet\")\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tfetchRegisters(config.Registers, modbusConnection)\n\n\t\t\tnewState := make(devices.State)\n\t\t\tfor _, v := range config.Registers {\n\t\t\t\tnewState[v.Name] = v.Value\n\t\t\t}\n\t\t\tnode.UpdateState(dev.ID.ID, newState)\n\t\tcase <-node.Stopped():\n\t\t\tticker.Stop()\n\t\t\tlog.Println(\"Stopping modbus node\")\n\t\t\treturn\n\t\t}\n\t}\n}","func (m *Master) Start() error {\n\treturn m.start(\"-masterCfg\", join(m.masterRoot, \"master.cfg\"), \"-raftCfg\", join(m.masterRoot, \"raft.cfg\"))\n}","func init() {\n\tiHub = NewHub()\n}","func MakeMaster(files []string, nReduce int) *Master {\n\tm := Master{}\n\tm.nMap = len(files)\n\tm.ReduceOutNum = nReduce\n\tm.nReduce = 0\n\t// Your code here.\n\t// init task\n\tm.mapTasks = make([]Task, 0)\n\tm.reduceTasks = make([]Task, 0)\n\tm.reduceTaskFileLists = make([][]string, m.ReduceOutNum)\n\tm.hasGenerateReduceTasks = false\n\tinitMapTaskNum := len(files)\n\tfor i := 0; i < initMapTaskNum; i++ {\n\t\tm.mapTasks = append(m.mapTasks, Task{Id: i, State: GENERATED, TaskKind: MAPTASK, MapTaskFile: files[i]})\n\t}\n\n\tm.server()\n\treturn &m\n}","func startNodeCommunication(nodeAddress string, bc *Blockchain) {\n\tlistener, err := net.Listen(protocol, nodeAddress)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tdefer listener.Close()\n\n\tfor {\n\t\tconn, err := listener.Accept()\n\t\tif err != nil {\n\t\t\tlog.Printf(\"Error: %s\\n\", err)\n\t\t}\n\t\tgo handleConnection(conn, bc)\n\t}\n}","func initClientReader(player *models.Player, host string) {\n\taddr := net.JoinHostPort(host, sendPort)\n\tlog.Printf(\"[Reader] Client is making a connection to %s\", addr)\n\n\tconn, err := net.Dial(\"tcp\", addr)\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\n\tlog.Printf(\"[Reader] Client is connected\")\n\n\tgo addNewPlayer(player.Scene, conn)\n}","func MakeMaster(files []string, nReduce int) *Master {\n\tm := Master{\n\t\tnReduce: nReduce,\n\t\tmapTask: []Task{},\n\t\tmasterState: newMaster,\n\t\tend: false,\n\t}\n\n\t// Your code here.\n\n\tfor i, file := range files {\n\t\tm.mapTask = append(m.mapTask, Task{\n\t\t\tType_: mapTask,\n\t\t\tId: i,\n\t\t\tFilename: file,\n\t\t\tState: initialState,\n\t\t\tNReduce: m.nReduce,\n\t\t})\n\t}\n\n\tgo m.server()\n\treturn &m\n}","func InitRedis() {\n\tclient = redis.NewClient(&redis.Options{\n\t\tAddr: \"localhost:6379\", //default port of redis-server; lo-host when same machine\n\t})\n\n\ttileClient = redis.NewClient(&redis.Options{\n\t\tAddr: \"127.0.0.1:9851\",\n\t\t// OnConnect: func(conn *redis.Conn) error {\n\t\t//something here if needed on connect\n\t\t// },\n\t})\n\n}","func (e *Engine) becomeMaster() {\n\te.syncClient.disable()\n\te.notifier.SetSource(config.SourceServer)\n\n\tif err := e.lbInterface.Up(); err != nil {\n\t\tlog.Fatalf(\"Failed to bring LB interface up: %v\", err)\n\t}\n}","func createNodes(clusterSpec *ClusterSpec, role string, suffixNumberStart int, count int) error {\n\tfor suffix := suffixNumberStart; suffix < suffixNumberStart+count; suffix++ {\n\t\tcontainerID := \"\"\n\t\tvar err error\n\t\tif role == \"agent\" {\n\t\t\tcontainerID, err = createWorker(clusterSpec, suffix)\n\t\t} else if role == \"server\" {\n\t\t\tcontainerID, err = createServer(clusterSpec)\n\t\t}\n\t\tif err != nil {\n\t\t\tlog.Errorf(\"Failed to create %s-node\", role)\n\t\t\treturn err\n\t\t}\n\t\tlog.Infof(\"Created %s-node with ID %s\", role, containerID)\n\t}\n\treturn nil\n}","func MakeMaster(files []string, nReduce int) *Master {\n\tm := Master{}\n\tm.inputFiles = files\n\tm.nReduceTasks = nReduce\n\tm.init()\n\n\tm.server()\n\treturn &m\n}"],"string":"[\n \"func NewMasterNode() *MasterNode {\\n\\tcurrentNode := MasterNode{}\\n\\tcurrentNode.Slaves = make(map[*websocket.Conn]bool)\\n\\tcurrentNode.broadcast = make(chan []byte)\\n\\treturn ¤tNode\\n}\",\n \"func (n *MasterNode) StartMasterNode(host string, port int) {\\n\\t// Configure websocket route\\n\\thttp.HandleFunc(\\\"/ws\\\", n.handleConnections)\\n\\n\\t// Start listening for incoming chat messages\\n\\tgo n.readInputCommands()\\n\\tgo n.broadcastCommandsToRun()\\n\\n\\t// Start the server on localhost port 8000 and log any errors\\n\\taddress := fmt.Sprintf(\\\"%s:%d\\\", host, port)\\n\\terr := http.ListenAndServe(address, nil)\\n\\tif err != nil {\\n\\t\\tlog.Fatal(\\\"Stopped Server: \\\", err)\\n\\t}\\n}\",\n \"func newNode(ready chan struct{}) {\\n\\t// Create & start node\\n\\tnode = nm.NewNodeDefault(config)\\n\\tnode.Start()\\n\\n\\ttime.Sleep(time.Second)\\n\\n\\tready <- struct{}{}\\n\\n\\t// Sleep forever\\n\\tch := make(chan struct{})\\n\\t<-ch\\n}\",\n \"func (s *RedisSystem) NewMaster(server string) {\\n\\tlogInfo(\\\"setting new master: %s\\\", server)\\n\\ts.currentMaster = NewRedisShim(server)\\n}\",\n \"func InitMasterClusterComm(_routeHandlerMap RouteHandlerMap) {\\n\\trouteHandlerMap = _routeHandlerMap\\n\\n\\t// Setup router\\n\\trouter := mux.NewRouter()\\n\\trouter.HandleFunc(\\\"/KillAll\\\", killAllRoute).Methods(\\\"GET\\\")\\n\\trouter.HandleFunc(\\\"/CreateNode\\\", createNodeRoute).Methods(\\\"GET\\\")\\n\\trouter.HandleFunc(\\\"/Send\\\", sendRoute).Methods(\\\"GET\\\")\\n\\trouter.HandleFunc(\\\"/Receive\\\", receiveRoute).Methods(\\\"GET\\\")\\n\\trouter.HandleFunc(\\\"/ReceiveAll\\\", receiveAllRoute).Methods(\\\"GET\\\")\\n\\trouter.HandleFunc(\\\"/BeginSnapshot\\\", beginSnapshotRoute).Methods(\\\"GET\\\")\\n\\trouter.HandleFunc(\\\"/CollectState\\\", collectStateRoute).Methods(\\\"GET\\\")\\n\\trouter.HandleFunc(\\\"/PrintSnapshot\\\", printSnapshotRoute).Methods(\\\"GET\\\")\\n\\n\\t// Starting Cluster Server\\n\\t// fmt.Println(\\\"\\\\nStarting Cluster Server @ http://localhost:8118\\\")\\n\\tif err := http.ListenAndServe(\\\":8118\\\", router); err != nil {\\n\\t\\t// fmt.Printf(\\\"\\\\nmux server: %v\\\\n\\\", err)\\n\\t}\\n}\",\n \"func init() {\\n\\tconfig = tendermint_test.ResetConfig(\\\"rpc_test_client_test\\\")\\n\\tchainID = config.GetString(\\\"chain_id\\\")\\n\\trpcAddr = config.GetString(\\\"rpc_laddr\\\")\\n\\tgrpcAddr = config.GetString(\\\"grpc_laddr\\\")\\n\\trequestAddr = rpcAddr\\n\\twebsocketAddr = rpcAddr\\n\\twebsocketEndpoint = \\\"/websocket\\\"\\n\\n\\tclientURI = client.NewClientURI(requestAddr)\\n\\tclientJSON = client.NewClientJSONRPC(requestAddr)\\n\\tclientGRPC = core_grpc.StartGRPCClient(grpcAddr)\\n\\n\\t// TODO: change consensus/state.go timeouts to be shorter\\n\\n\\t// start a node\\n\\tready := make(chan struct{})\\n\\tgo newNode(ready)\\n\\t<-ready\\n}\",\n \"func newChannelNode(t *testing.T) *testNode {\\n\\tch, err := tchannel.NewChannel(\\\"test\\\", nil)\\n\\trequire.NoError(t, err, \\\"channel must create successfully\\\")\\n\\n\\t// Set the channel listening so it binds to the socket and we get a port\\n\\t// allocated by the OS\\n\\terr = ch.ListenAndServe(\\\"127.0.0.1:0\\\")\\n\\trequire.NoError(t, err, \\\"channel must listen\\\")\\n\\n\\thostport := ch.PeerInfo().HostPort\\n\\tc := clock.NewMock()\\n\\tnode := NewNode(\\\"test\\\", hostport, ch.GetSubChannel(\\\"test\\\"), &Options{\\n\\t\\tClock: c,\\n\\t})\\n\\n\\treturn &testNode{node, ch, c}\\n}\",\n \"func New(commandArgs common.CommandArgs) *Node {\\n\\n\\tnode := Node{\\n\\t\\tNodeCommon: common.NewNodeCommon(commandArgs, \\\"master\\\"),\\n\\t\\t// FirstSlaveListenPort: 7500, // TODO(greg) make this an env parameter /TODO this is the *base* port that the new slave should try. incrementing if failing to get the port\\n\\t}\\n\\n\\treturn &node\\n}\",\n \"func masterMain(ln net.Listener) {\\n\\tm := &Master{}\\n\\tm.startTime = time.Now()\\n\\tm.lastInput = time.Now()\\n\\tm.suppressions = newPersistentSet(filepath.Join(*flagWorkdir, \\\"suppressions\\\"))\\n\\tm.crashers = newPersistentSet(filepath.Join(*flagWorkdir, \\\"crashers\\\"))\\n\\tm.corpus = newPersistentSet(filepath.Join(*flagWorkdir, \\\"corpus\\\"))\\n\\tif len(m.corpus.m) == 0 {\\n\\t\\tm.corpus.add(Artifact{[]byte{}, 0, false})\\n\\t}\\n\\n\\tm.slaves = make(map[int]*MasterSlave)\\n\\tgo masterLoop(m)\\n\\n\\ts := rpc.NewServer()\\n\\ts.Register(m)\\n\\ts.Accept(ln)\\n}\",\n \"func main() {\\n\\ts := master.New()\\n\\tif err := s.Run(port); err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n}\",\n \"func (s *Service) bootstrapMaster(ctx context.Context, runner Runner, config Config, bsCfg BootstrapConfig) {\\n\\t// Check HTTP server port\\n\\tcontainerHTTPPort, _, err := s.getHTTPServerPort()\\n\\tif err != nil {\\n\\t\\ts.log.Fatal().Err(err).Msg(\\\"Cannot find HTTP server info\\\")\\n\\t}\\n\\tif !WaitUntilPortAvailable(config.BindAddress, containerHTTPPort, time.Second*5) {\\n\\t\\ts.log.Fatal().Msgf(\\\"Port %d is already in use\\\", containerHTTPPort)\\n\\t}\\n\\n\\t// Select storage engine\\n\\tstorageEngine := bsCfg.ServerStorageEngine\\n\\tif storageEngine == \\\"\\\" {\\n\\t\\tstorageEngine = s.DatabaseFeatures().DefaultStorageEngine()\\n\\t\\tbsCfg.ServerStorageEngine = storageEngine\\n\\t}\\n\\ts.log.Info().Msgf(\\\"Using storage engine '%s'\\\", bsCfg.ServerStorageEngine)\\n\\n\\t// Create initial cluster configuration\\n\\thasAgent := boolFromRef(bsCfg.StartAgent, !s.mode.IsSingleMode())\\n\\thasDBServer := boolFromRef(bsCfg.StartDBserver, true)\\n\\thasCoordinator := boolFromRef(bsCfg.StartCoordinator, true)\\n\\thasResilientSingle := boolFromRef(bsCfg.StartResilientSingle, s.mode.IsActiveFailoverMode())\\n\\thasSyncMaster := boolFromRef(bsCfg.StartSyncMaster, true) && config.SyncEnabled\\n\\thasSyncWorker := boolFromRef(bsCfg.StartSyncWorker, true) && config.SyncEnabled\\n\\tme := NewPeer(s.id, config.OwnAddress, s.announcePort, 0, config.DataDir,\\n\\t\\thasAgent, hasDBServer, hasCoordinator, hasResilientSingle,\\n\\t\\thasSyncMaster, hasSyncWorker, s.IsSecure())\\n\\ts.myPeers.Initialize(me, bsCfg.AgencySize, storageEngine, s.cfg.Configuration.PersistentOptions)\\n\\ts.learnOwnAddress = config.OwnAddress == \\\"\\\"\\n\\n\\t// Start HTTP listener\\n\\ts.startHTTPServer(config)\\n\\n\\t// Permanent loop:\\n\\ts.log.Info().Msgf(\\\"Serving as master with ID '%s' on %s:%d...\\\", s.id, config.OwnAddress, s.announcePort)\\n\\n\\t// Can we start right away?\\n\\tneedMorePeers := true\\n\\tif s.mode.IsSingleMode() {\\n\\t\\tneedMorePeers = false\\n\\t} else if !s.myPeers.HaveEnoughAgents() {\\n\\t\\tneedMorePeers = true\\n\\t} else if bsCfg.StartLocalSlaves {\\n\\t\\tpeersNeeded := bsCfg.PeersNeeded()\\n\\t\\tneedMorePeers = len(s.myPeers.AllPeers) < peersNeeded\\n\\t}\\n\\tif !needMorePeers {\\n\\t\\t// We have all the agents that we need, start a single server/cluster right now\\n\\t\\ts.saveSetup()\\n\\t\\ts.log.Info().Msg(\\\"Starting service...\\\")\\n\\t\\ts.startRunning(runner, config, bsCfg)\\n\\t\\treturn\\n\\t}\\n\\n\\twg := sync.WaitGroup{}\\n\\tif bsCfg.StartLocalSlaves {\\n\\t\\t// Start additional local slaves\\n\\t\\ts.createAndStartLocalSlaves(&wg, config, bsCfg)\\n\\t} else {\\n\\t\\t// Show commands needed to start slaves\\n\\t\\ts.log.Info().Msgf(\\\"Waiting for %d servers to show up.\\\\n\\\", s.myPeers.AgencySize)\\n\\t\\ts.showSlaveStartCommands(runner, config)\\n\\t}\\n\\n\\tfor {\\n\\t\\ttime.Sleep(time.Second)\\n\\t\\tselect {\\n\\t\\tcase <-s.bootstrapCompleted.ctx.Done():\\n\\t\\t\\ts.saveSetup()\\n\\t\\t\\ts.log.Info().Msg(\\\"Starting service...\\\")\\n\\t\\t\\ts.startRunning(runner, config, bsCfg)\\n\\t\\t\\treturn\\n\\t\\tdefault:\\n\\t\\t}\\n\\t\\tif ctx.Err() != nil {\\n\\t\\t\\t// Context is cancelled, stop now\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\t// Wait for any local slaves to return.\\n\\twg.Wait()\\n}\",\n \"func newMaster(name, binDir, rootDir string, loggers []Logger) *Master {\\n\\treturn &Master{\\n\\t\\tprocBase: newProcBase(name, join(binDir, \\\"master\\\"), genLocalAddr(), loggers),\\n\\t\\tmasterRoot: join(rootDir, name),\\n\\t\\traftRoot: join(rootDir, name, \\\"raft\\\"),\\n\\t}\\n}\",\n \"func MakeMaster(files []string, nReduce int) *Master {\\n\\tm := Master{}\\n\\n\\t// Your code here.\\n\\tm.mu = sync.Mutex{}\\n\\tm.nReduce = nReduce\\n\\tm.files = files\\n\\t\\n\\tif nReduce > len(files) {\\n\\t\\tm.taskCh = make(chan Task, nReduce)\\n\\t} else {\\n\\t\\tm.taskCh = make(chan Task, len(m.files))\\n\\t}\\n\\n\\tm.initMapTasks()\\n\\tgo m.tickSchedule()\\n\\n\\tm.server()\\n\\tdisplay(\\\"master init...\\\")\\n\\treturn &m\\n}\",\n \"func NewNodeHostWithMasterClientFactory(nhConfig config.NodeHostConfig,\\n\\tfactory MasterClientFactoryFunc) *NodeHost {\\n\\tlogBuildTagsAndVersion()\\n\\tif err := nhConfig.Validate(); err != nil {\\n\\t\\tplog.Panicf(\\\"invalid nodehost config, %v\\\", err)\\n\\t}\\n\\tnh := &NodeHost{\\n\\t\\tserverCtx: server.NewContext(nhConfig),\\n\\t\\tnhConfig: nhConfig,\\n\\t\\tstopper: syncutil.NewStopper(),\\n\\t\\tduStopper: syncutil.NewStopper(),\\n\\t\\tnodes: transport.NewNodes(streamConnections),\\n\\t\\tinitializedC: make(chan struct{}),\\n\\t\\ttransportLatency: newSample(),\\n\\t}\\n\\tnh.snapshotStatus = newSnapshotFeedback(nh.pushSnapshotStatus)\\n\\tnh.msgHandler = newNodeHostMessageHandler(nh)\\n\\tnh.clusterMu.requests = make(map[uint64]*server.MessageQueue)\\n\\tnh.createPools()\\n\\tnh.createTransport()\\n\\tif nhConfig.MasterMode() {\\n\\t\\tplog.Infof(\\\"master servers specified, creating the master client\\\")\\n\\t\\tnh.masterClient = newMasterClient(nh, factory)\\n\\t\\tplog.Infof(\\\"master client type: %s\\\", nh.masterClient.Name())\\n\\t} else {\\n\\t\\tplog.Infof(\\\"no master server specified, running in standalone mode\\\")\\n\\t\\tdid := unmanagedDeploymentID\\n\\t\\tif nhConfig.DeploymentID == 0 {\\n\\t\\t\\tplog.Warningf(\\\"DeploymentID not set in NodeHostConfig\\\")\\n\\t\\t\\tnh.transport.SetUnmanagedDeploymentID()\\n\\t\\t} else {\\n\\t\\t\\tdid = nhConfig.DeploymentID\\n\\t\\t\\tnh.transport.SetDeploymentID(nhConfig.DeploymentID)\\n\\t\\t}\\n\\t\\tplog.Infof(\\\"DeploymentID set to %d\\\", unmanagedDeploymentID)\\n\\t\\tnh.deploymentID = did\\n\\t\\tnh.createLogDB(nhConfig, did)\\n\\t}\\n\\tctx, cancel := context.WithCancel(context.Background())\\n\\tnh.cancel = cancel\\n\\tinitializeFn := func() {\\n\\t\\tif err := nh.initialize(ctx, nhConfig); err != nil {\\n\\t\\t\\tif err != context.Canceled && err != ErrCanceled {\\n\\t\\t\\t\\tplog.Panicf(\\\"nh.initialize failed %v\\\", err)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif nh.masterMode() {\\n\\t\\tplog.Infof(\\\"master mode, nh.initialize() invoked in new goroutine\\\")\\n\\t\\tnh.stopper.RunWorker(func() {\\n\\t\\t\\tinitializeFn()\\n\\t\\t})\\n\\t} else {\\n\\t\\tplog.Infof(\\\"standalone mode, nh.initialize() directly invoked\\\")\\n\\t\\tinitializeFn()\\n\\t}\\n\\tnh.stopper.RunWorker(func() {\\n\\t\\tnh.masterRequestHandler(ctx)\\n\\t})\\n\\t// info reporting worker is using a different stopper as we need to stop it\\n\\t// separately during monkey test\\n\\tnh.duStopper.RunWorker(func() {\\n\\t\\tnh.reportingWorker(ctx)\\n\\t})\\n\\tnh.stopper.RunWorker(func() {\\n\\t\\tnh.nodeMonitorMain(ctx, nhConfig)\\n\\t})\\n\\tnh.stopper.RunWorker(func() {\\n\\t\\tnh.tickWorkerMain()\\n\\t})\\n\\tif nh.masterMode() {\\n\\t\\tnh.waitUntilInitialized()\\n\\t}\\n\\tnh.logNodeHostDetails()\\n\\treturn nh\\n}\",\n \"func Start() {\\n\\tIPs := DNS.GetAddr(Config.BootstrapDomainName)\\n\\tnodeContext = NC.NewNodeContext()\\n\\tnodeContext.SetLocalName(nameService.GetLocalName())\\n\\tnodeContext.LocalIp, _ = DNS.ExternalIP()\\n\\tmp = MP.NewMessagePasser(nodeContext.LocalName)\\n\\tstreamer = Streamer.NewStreamer(mp, nodeContext)\\n\\n\\n\\t// We use for loop to connect with all supernode one-by-one,\\n\\t// if a connection to one supernode fails, an error message\\n\\t// will be sent by messagePasser, and this message is further\\n\\t// processed in error handler.\\n\\t// init_fail: used in hello phase\\n\\t// exit: used when all supernode cannot be connected.\\n\\tmp.AddMappings([]string{\\\"exit\\\", \\\"init_fail\\\", \\\"super_fail\\\", \\\"ack\\\", \\\"loadtrack_result\\\"})\\n\\n\\t// Initialize all the package structs\\n\\n\\t// Define all the channel names and the binded functions\\n\\t// TODO: Register your channel name and binded eventhandlers here\\n\\t// The map goes as map[channelName][eventHandler]\\n\\t// All the messages with type channelName will be put in this channel by messagePasser\\n\\t// Then the binded handler of this channel will be called with the argument (*Message)\\n\\n\\tchannelNames := map[string]func(*MP.Message){\\n\\t\\t\\\"election_assign\\\": joinAssign,\\n\\t\\t\\\"error\\\" : errorHandler,\\n\\n\\t\\t// The streaming related handlers goes here\\n\\t\\t\\\"streaming_election\\\": streamer.HandleElection,\\n\\t\\t\\\"streaming_join\\\": streamer.HandleJoin,\\n\\t\\t\\\"streaming_data\\\": streamer.HandleStreamerData,\\n\\t\\t\\\"streaming_stop\\\": streamer.HandleStop,\\n\\t\\t\\\"streaming_assign\\\": streamer.HandleAssign,\\n\\t\\t\\\"streaming_new_program\\\": streamer.HandleNewProgram,\\n\\t\\t\\\"streaming_stop_program\\\": streamer.HandleStopProgram,\\n\\t\\t\\\"streaming_quit\\\": streamer.HandleChildQuit,\\n\\t}\\n\\n\\t// Init and listen\\n\\tfor channelName, handler := range channelNames {\\n\\t\\t// Init all the channels listening on\\n\\t\\tmp.Messages[channelName] = make(chan *MP.Message)\\n\\t\\t// Bind all the functions listening on the channel\\n\\t\\tgo listenOnChannel(channelName, handler)\\n\\t}\\n\\tgo nodeJoin(IPs)\\n\\tgo NodeCLIInterface(streamer)\\n\\twebInterface(streamer, nodeContext)\\n\\texitMsg := <- mp.Messages[\\\"exit\\\"]\\n\\tvar exitData string\\n\\tMP.DecodeData(&exitData, exitMsg.Data)\\n\\tfmt.Printf(\\\"Node: receiving force exit message [%s], node exit\\\\n\\\", exitData);\\n}\",\n \"func createNode(id int, myConf *Config, sm *State_Machine) cluster.Server {\\n\\tinitNode(id, myConf, sm)\\n\\t//Set up details about cluster nodes form json file.\\n\\tserver, err := cluster.New(id, \\\"config/cluster_config.json\\\")\\n\\tif err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\treturn server\\n}\",\n \"func MakeMaster(files []string, nReduce int) *Master {\\r\\n\\tm := Master{}\\r\\n\\r\\n\\t// Your code here.\\r\\n\\tm.nextMapTaskNo = 1\\r\\n\\tm.nextReduceTaskNo = 1\\r\\n\\tm.inputFiles = make(chan string, 100)\\r\\n\\tm.mapTasks = make(map[int]string)\\r\\n\\tm.mapFinish = make(map[string]int)\\r\\n\\tm.failedMapTaskNo = make(map[int]int)\\r\\n\\tm.reduceTasks = make(map[int][]string)\\r\\n\\tm.inputIntermediateFiles = make(chan []string, 100)\\r\\n\\tm.done = make(chan bool)\\r\\n\\tm.reduceFinish = make(map[int]bool)\\r\\n\\tm.mapIntermediateFiles = make([][]string, 0)\\r\\n\\tm.taskPhase = 0\\r\\n\\tm.nReduce = nReduce\\r\\n\\r\\n\\tfor _, file := range files {\\r\\n\\t\\tm.inputFiles <- file\\r\\n\\t\\tm.totalInputFiles++\\r\\n\\t}\\r\\n\\r\\n\\tm.server()\\r\\n\\t// log.Println(\\\"-----Server Started------\\\")\\r\\n\\treturn &m\\r\\n}\",\n \"func StartMaster(configFile *goconf.ConfigFile) {\\n\\tSubIOBufferSize(\\\"master\\\", configFile)\\n\\tGoMaxProc(\\\"master\\\", configFile)\\n\\tConBufferSize(\\\"master\\\", configFile)\\n\\tIOMOnitors(configFile)\\n\\n\\thostname := GetRequiredString(configFile, \\\"default\\\", \\\"hostname\\\")\\n\\tpassword := GetRequiredString(configFile, \\\"default\\\", \\\"password\\\")\\n\\n\\tm := NewMaster()\\n\\n\\trest.Resource(\\\"jobs\\\", MasterJobController{m, password})\\n\\trest.Resource(\\\"nodes\\\", MasterNodeController{m, password})\\n\\n\\trest.ResourceContentType(\\\"jobs\\\", \\\"application/json\\\")\\n\\trest.ResourceContentType(\\\"nodes\\\", \\\"application/json\\\")\\n\\n\\tListenAndServeTLSorNot(hostname)\\n}\",\n \"func NewMaster(addr string, port int, cert *services.HTTPCert) *Master {\\n\\tvar sm *services.HTTPService\\n\\n\\tif cert == nil {\\n\\t\\tsm = services.NewHTTPService(\\\"master\\\", addr, port, nil)\\n\\t} else {\\n\\t\\tsm = services.NewHTTPSecureService(\\\"master\\\", addr, port, cert, nil)\\n\\t}\\n\\n\\t// reg, err := sm.Select(\\\"register\\\")\\n\\t//\\n\\t// if err == nil {\\n\\t//\\n\\t// \\treg.Terminal().Only(grids.ByPackets(func(g *grids.GridPacket) {\\n\\t// \\t\\tfmt.Println(\\\"/register receieves\\\", g)\\n\\t// \\t}))\\n\\t// }\\n\\t//\\n\\t// disc, err := sm.Select(\\\"discover\\\")\\n\\t//\\n\\t// if err == nil {\\n\\t//\\n\\t// \\tdisc.Terminal().Only(grids.ByPackets(func(g *grids.GridPacket) {\\n\\t// \\t\\tfmt.Println(\\\"/discover receieves\\\", g)\\n\\t// \\t}))\\n\\t// }\\n\\t//\\n\\t// unreg, err := sm.Select(\\\"unregister\\\")\\n\\t//\\n\\t// if err == nil {\\n\\t//\\n\\t// \\tunreg.Terminal().Only(grids.ByPackets(func(g *grids.GridPacket) {\\n\\t// \\t\\tfmt.Println(\\\"/unregister receieves\\\", g)\\n\\t// \\t}))\\n\\t// }\\n\\n\\treturn &Master{sm}\\n}\",\n \"func newNode() *topicNode {\\n\\treturn &topicNode{\\n\\t\\tchildren: children{},\\n\\t\\tclients: make(clientOpts),\\n\\t\\tshared: make(map[string]clientOpts),\\n\\t}\\n}\",\n \"func NewMasterRouter() *MasterRouter {\\n\\tr := &MasterRouter{\\n\\t\\tmessages: make(chan *routerpb.Message, 1),\\n\\t}\\n\\tgo func() {\\n\\t\\tfor msg := range r.messages {\\n\\t\\t\\tfmt.Println(msg)\\n\\t\\t}\\n\\t}()\\n\\treturn r\\n}\",\n \"func main() {\\n\\tlog.LoadConfiguration(\\\"log.cfg\\\")\\n\\tlog.Info(\\\"Start Master\\\")\\n\\n\\tcfg := loadMasterConfiguration()\\n\\n\\tlog.Info(\\\"Setting go cpu number to \\\", cfg.Constants.CpuNumber, \\\" success: \\\", runtime.GOMAXPROCS(cfg.Constants.CpuNumber))\\n\\n\\t// Start rest api server with tcp services for inserts and selects\\n\\tportNum := fmt.Sprintf(\\\":%d\\\", cfg.Ports.RestApi)\\n\\tvar server = restApi.Server{Port: portNum}\\n\\tchanReq := server.StartApi()\\n\\n\\t// Initialize node manager\\n\\tlog.Info(\\\"Initialize node manager\\\")\\n\\tgo node.NodeManager.Manage()\\n\\tnodeBal := node.NewLoadBalancer(node.NodeManager.GetNodes())\\n\\tgo nodeBal.Balance(node.NodeManager.InfoChan)\\n\\n\\t// Initialize reduce factory\\n\\tlog.Info(\\\"Initialize reduce factory\\\")\\n\\treduce.Initialize()\\n\\n\\t// Initialize task manager (balancer)\\n\\tlog.Info(\\\"Initialize task manager\\\")\\n\\tgo task.TaskManager.Manage()\\n\\ttaskBal := task.NewBalancer(cfg.Constants.WorkersCount, cfg.Constants.JobForWorkerCount, nodeBal)\\n\\tgo taskBal.Balance(chanReq, cfg.Balancer.Timeout)\\n\\n\\t// Initialize node listener\\n\\tlog.Info(\\\"Initialize node listener\\\")\\n\\tservice := fmt.Sprintf(\\\":%d\\\", cfg.Ports.NodeCommunication)\\n\\tlog.Debug(service)\\n\\tlist := node.NewListener(service)\\n\\tgo list.WaitForNodes(task.TaskManager.GetChan)\\n\\tdefer list.Close() // fire netListen.Close() when program ends\\n\\n\\t// TODO: Wait for console instructions (q - quit for example)\\n\\t// Wait for some input end exit (only for now)\\n\\t//var i int\\n\\t//fmt.Scanf(\\\"%d\\\", &i)\\n\\tc := make(chan os.Signal, 1)\\n\\tsignal.Notify(c, os.Interrupt)\\n\\t<-c\\n\\treturn\\n}\",\n \"func init() {\\n\\t// This function will be executed before everything else.\\n\\t// Do some initialization here.\\n\\tSBC = data.NewBlockChain()\\n\\t// When server works\\n\\t// Peers = data.NewPeerList(Register(), 32)\\n\\t// While server doesn't work -> use port as id\\n\\tid, _ := strconv.ParseInt(os.Args[1], 10, 64)\\n\\tPeers = data.NewPeerList(int32(id), 32)\\n\\tifStarted = true\\n}\",\n \"func initCluster() (_ *cluster, cbChan <-chan Callback) {\\n cb := make(chan Callback)\\n c := &cluster{\\n nil,\\n chan<- Callback(cb),\\n make(map[Nid]*Node),\\n make(map[Nid]*GossipNode),\\n nil,\\n sync.RWMutex{},\\n }\\n return c, (<-chan Callback)(cb)\\n}\",\n \"func RegisterNodeToMaster(UID, nodehandler, nodeselector string) error {\\n\\tbody, err := GenerateNodeReqBody(UID, nodeselector)\\n\\tif err != nil {\\n\\t\\tFatalf(\\\"Unmarshal body failed: %v\\\", err)\\n\\t\\treturn err\\n\\t}\\n\\n\\ttr := &http.Transport{\\n\\t\\tTLSClientConfig: &tls.Config{InsecureSkipVerify: true},\\n\\t}\\n\\tclient := &http.Client{\\n\\t\\tTransport: tr,\\n\\t}\\n\\n\\tt := time.Now()\\n\\tnodebody, err := json.Marshal(body)\\n\\tif err != nil {\\n\\t\\tFatalf(\\\"Marshal body failed: %v\\\", err)\\n\\t\\treturn err\\n\\t}\\n\\tBodyBuf := bytes.NewReader(nodebody)\\n\\treq, err := http.NewRequest(http.MethodPost, nodehandler, BodyBuf)\\n\\treq.Header.Set(\\\"Content-Type\\\", \\\"application/json\\\")\\n\\tif err != nil {\\n\\t\\tFatalf(\\\"Frame HTTP request failed: %v\\\", err)\\n\\t\\treturn err\\n\\t}\\n\\tresp, err := client.Do(req)\\n\\tif err != nil {\\n\\t\\tFatalf(\\\"Sending HTTP request failed: %v\\\", err)\\n\\t\\treturn err\\n\\t}\\n\\tInfof(\\\"%s %s %v in %v\\\", req.Method, req.URL, resp.Status, time.Since(t))\\n\\tdefer resp.Body.Close()\\n\\n\\tgomega.Expect(resp.StatusCode).Should(gomega.Equal(http.StatusCreated))\\n\\treturn nil\\n}\",\n \"func createNodeDiscovery(c *SwarmContext) discovery.Backend {\\n // we're to go through BeaconManger directly\\n err := c.discoveryBack.Initialize(\\\"pc-beacon\\\", c.heartbeat, 0, getDiscoveryOpt(c))\\n if err != nil {\\n log.Fatal(err)\\n }\\n return c.discoveryBack\\n}\",\n \"func (zk *ZookeeperMaster) Register() error {\\n\\tif err := zk.createSelfNode(); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\t//create event loop for master flag\\n\\tgo zk.masterLoop()\\n\\tgo zk.healthLoop()\\n\\treturn nil\\n\\n}\",\n \"func (self *RRSMNode) Build(addr string, initState RRSMState, configuration *RRSMConfig,\\n\\tRPCListenPort string, electionTimeout time.Duration, heartbeatInterval time.Duration) error {\\n\\tself.InitState = initState\\n\\tself.CurrentState = initState\\n\\tself.nodes = make(map[string]*rpc.RPCClient)\\n\\tself.addr = addr\\n\\n\\t// init timer\\n\\tself.electionTimeoutTicker = nil\\n\\tself.electionTimeout = electionTimeout\\n\\tself.heartbeatTimeTicker = nil\\n\\tself.heartbeatInterval = heartbeatInterval\\n\\n\\t// become a follower at the beginning\\n\\tself.character = RaftFOLLOWER\\n\\tself.currentTerm = uint64(0)\\n\\tself.haveVoted = false\\n\\n\\t// init channels\\n\\tself.newTermChan = make(chan int, 1)\\n\\tself.accessLeaderChan = make(chan int, 1)\\n\\n\\t// init lock\\n\\tself.termChangingLock = &sync.Mutex{}\\n\\tself.leaderChangingLock = &sync.Mutex{}\\n\\n\\t// init node configuration\\n\\tif configuration == nil {\\n\\t\\treturn fmt.Errorf(\\\"configuration is needed!\\\")\\n\\t}\\n\\tif len(configuration.Nodes) <= 0 {\\n\\t\\treturn fmt.Errorf(\\\"config err: amounts of nodes needed to be a positive number!\\\")\\n\\t}\\n\\tself.config = *configuration\\n\\tself.amountsOfNodes = uint32(len(self.config.Nodes))\\n\\n\\t// register rpc service\\n\\traftRPC := RaftRPC{\\n\\t\\tnode: self,\\n\\t}\\n\\terr := rpc.RPCRegister(RPCListenPort, &raftRPC)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\t// build rpc connection with other nodes\\n\\tfor _, node := range self.config.Nodes {\\n\\t\\tif node != addr {\\n\\t\\t\\tclient, err := rpc.RPCConnect(node)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t// need to connect with all the nodes at the period of building\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tself.nodes[node] = client\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func main() {\\n\\t// init our channel new info listener\\n\\tinfo := make(chan string)\\n\\tgo printNewInfo(info)\\n\\t// open up listener\\n\\tlisten, err := net.Listen(\\\"tcp\\\", \\\"127.0.0.1:8001\\\")\\n\\tif err != nil {\\n\\t\\t// fatal error starting up listener. Someone is occupying Port\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\t// for loop while we haven't reached 5 nodes\\n\\tfor ; max_nodes > 0; max_nodes = max_nodes - 1 {\\n\\t\\t// listen for new connection requests\\n\\t\\tconn, err := listen.Accept()\\n\\n\\t\\tif err != nil {\\n\\t\\t\\t// not breaking error, that is a node side error\\n\\t\\t\\tfmt.Println(\\\"An error occured trying to accept new connection.\\\", err)\\n\\t\\t}\\n\\n\\t\\t// node handler\\n\\t\\tif _, ok := conn.RemoteAddr().(*net.TCPAddr); ok {\\n\\n\\t\\t\\t// let's make the last node the leader (even if they aren't the closest)\\n\\t\\t\\tif max_nodes == 1 {\\n\\t\\t\\t\\tleader = true\\n\\t\\t\\t}\\n\\n\\t\\t\\tcheck := false\\n\\t\\t\\t// assign random ID\\n\\t\\t\\t// between 8002 and 8999\\n\\t\\t\\tvar ID int\\n\\t\\t\\tfor check == false {\\n\\n\\t\\t\\t\\tID = 8000 + rand.Intn(997) + 2\\n\\t\\t\\t\\t// sanity check to see if someone has that ID\\n\\t\\t\\t\\tln, err := net.Listen(\\\"tcp\\\", \\\"127.0.0.1:\\\"+strconv.Itoa(ID))\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcheck = true\\n\\t\\t\\t\\t_ = ln.Close()\\n\\t\\t\\t}\\n\\t\\t\\tnodeList[conn] = Node{ID: ID, Leader: false, Port: ID, Conn: conn}\\n\\t\\t\\tinfo <- \\\"Node: \\\" + strconv.Itoa(ID) + \\\" has joined\\\"\\n\\t\\t\\t// send the Node info to the node in question\\n\\t\\t\\tio.WriteString(conn, strconv.Itoa(ID) + \\\":\\\" + strconv.Itoa(ID) + \\\":\\\" + strconv.FormatBool(leader) + \\\"\\\\n\\\")\\n\\t\\t\\t// monitor the new connection in case it drops\\n\\t\\t\\tgo connectionCheck(conn, info, ID)\\n\\t\\t}\\n\\n\\t}\\n\\n\\t// at this point we have gotten all 5 nodes on board\\n\\t// we now need to send an update to them\\n\\tfor conn, _ := range nodeList {\\n\\t\\tgo sendInfo(conn)\\n\\t}\\n\\n\\tvar empty int\\n\\tfmt.Scan(&empty)\\n}\",\n \"func (server *Server) ConntectMaster(in *pb.ConnectionRequest, stream pb.Result_ConntectMasterServer) error {\\n\\n\\tserver.addNewClient(in.Id, stream)\\n\\t// make the stream long lived\\n\\tfor {\\n\\t}\\n\\n}\",\n \"func (h *hub) start() error {\\n\\t// Start transport\\n\\tif err := h.transport.start(); err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\t// Start hub channel listeners\\n\\tgo func() {\\n\\t\\tfor {\\n\\t\\t\\tselect {\\n\\t\\t\\tcase client := <-h.registerc:\\n\\t\\t\\t\\t// Handle register client request\\n\\t\\t\\t\\th.registerClient(client)\\n\\t\\t\\tcase client := <-h.unregisterc:\\n\\t\\t\\t\\t// Handle unregister client request\\n\\t\\t\\t\\th.unregisterClient(client)\\n\\t\\t\\tcase msg := <-h.inboundc:\\n\\t\\t\\t\\t// Handle message received from client\\n\\t\\t\\t\\th.onClientMessage(msg)\\n\\t\\t\\tcase msg := <-h.peerc:\\n\\t\\t\\t\\t// Handle message received from peer\\n\\t\\t\\t\\th.onPeerMessage(msg)\\n\\t\\t\\tcase data := <-h.masterc:\\n\\t\\t\\t\\t// Handle message received from master\\n\\t\\t\\t\\th.onMasterMessage(data)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}()\\n\\n\\treturn nil\\n}\",\n \"func startNode(cfg *Config) error {\\n\\tapp, err := app.NewApplication(cfg.App())\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\ttmcfg, nodeLogger, nodeKey, err := setupNode()\\n\\tif err != nil {\\n\\t\\treturn fmt.Errorf(\\\"failed to setup config: %w\\\", err)\\n\\t}\\n\\n\\tn, err := node.NewNode(tmcfg,\\n\\t\\tprivval.LoadOrGenFilePV(tmcfg.PrivValidatorKeyFile(), tmcfg.PrivValidatorStateFile()),\\n\\t\\tnodeKey,\\n\\t\\tproxy.NewLocalClientCreator(app),\\n\\t\\tnode.DefaultGenesisDocProviderFunc(tmcfg),\\n\\t\\tnode.DefaultDBProvider,\\n\\t\\tnode.DefaultMetricsProvider(tmcfg.Instrumentation),\\n\\t\\tnodeLogger,\\n\\t)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\treturn n.Start()\\n}\",\n \"func (instance *DBSyncSlave) init() {\\n\\tif nil != instance {\\n\\t\\tif len(instance.Config.Uuid) > 0 {\\n\\t\\t\\tinstance.UID = instance.Config.Uuid\\n\\t\\t} else {\\n\\t\\t\\tinstance.UID, _ = lygo_sys.ID()\\n\\t\\t}\\n\\t\\tif nil == instance.client {\\n\\t\\t\\tinstance.client = lygo_nio.NewNioClient(instance.Config.Host(), instance.Config.Port())\\n\\t\\t\\tinstance.client.OnConnect(instance.doConnect)\\n\\t\\t\\tinstance.client.OnDisconnect(instance.doDisconnect)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (node *DataNode) Init() error {\\n\\tctx := context.Background()\\n\\n\\treq := &datapb.RegisterNodeRequest{\\n\\t\\tBase: &commonpb.MsgBase{\\n\\t\\t\\tSourceID: node.NodeID,\\n\\t\\t},\\n\\t\\tAddress: &commonpb.Address{\\n\\t\\t\\tIp: Params.IP,\\n\\t\\t\\tPort: int64(Params.Port),\\n\\t\\t},\\n\\t}\\n\\n\\tresp, err := node.dataService.RegisterNode(ctx, req)\\n\\tif err != nil {\\n\\t\\treturn fmt.Errorf(\\\"Register node failed: %v\\\", err)\\n\\t}\\n\\tif resp.Status.ErrorCode != commonpb.ErrorCode_Success {\\n\\t\\treturn fmt.Errorf(\\\"Receive error when registering data node, msg: %s\\\", resp.Status.Reason)\\n\\t}\\n\\n\\tselect {\\n\\tcase <-time.After(RPCConnectionTimeout):\\n\\t\\treturn errors.New(\\\"Get DmChannels failed in 30 seconds\\\")\\n\\tcase <-node.watchDm:\\n\\t\\tlog.Debug(\\\"insert channel names set\\\")\\n\\t}\\n\\n\\tfor _, kv := range resp.InitParams.StartParams {\\n\\t\\tswitch kv.Key {\\n\\t\\tcase \\\"DDChannelName\\\":\\n\\t\\t\\tParams.DDChannelNames = []string{kv.Value}\\n\\t\\tcase \\\"SegmentStatisticsChannelName\\\":\\n\\t\\t\\tParams.SegmentStatisticsChannelName = kv.Value\\n\\t\\tcase \\\"TimeTickChannelName\\\":\\n\\t\\t\\tParams.TimeTickChannelName = kv.Value\\n\\t\\tcase \\\"CompleteFlushChannelName\\\":\\n\\t\\t\\tParams.CompleteFlushChannelName = kv.Value\\n\\t\\tdefault:\\n\\t\\t\\treturn fmt.Errorf(\\\"Invalid key: %v\\\", kv.Key)\\n\\t\\t}\\n\\t}\\n\\n\\treplica := newReplica()\\n\\n\\tvar alloc allocatorInterface = newAllocator(node.masterService)\\n\\n\\tchanSize := 100\\n\\tflushChan := make(chan *flushMsg, chanSize)\\n\\tnode.flushChan = flushChan\\n\\tnode.dataSyncService = newDataSyncService(node.ctx, flushChan, replica, alloc, node.msFactory)\\n\\tnode.dataSyncService.init()\\n\\tnode.metaService = newMetaService(node.ctx, replica, node.masterService)\\n\\tnode.replica = replica\\n\\n\\treturn nil\\n}\",\n \"func MakeMaster(files []string, nReduce int) *Master {\\n\\tm := Master{}\\n\\n\\t// Your code here.\\n\\tm.init()\\n\\n\\tm.server()\\n\\treturn &m\\n}\",\n \"func initConsumer() sarama.Consumer {\\n\\tsarama.Logger = log.New(os.Stdout, \\\"\\\", log.Ltime)\\n\\n\\tconfig := sarama.NewConfig()\\n\\tconfig.ClientID = CLIENTID\\n\\tconfig.Consumer.Return.Errors = true\\n\\n\\tbrokers := []string{BROKERS}\\n\\n\\tmaster, err := sarama.NewConsumer(brokers, config)\\n\\tif err != nil {\\n\\t\\tfmt.Println(\\\"error create master consumer: \\\")\\n\\t\\tpanic(err)\\n\\t}\\n\\n\\treturn master\\n}\",\n \"func (b *ClusterNodesBuilder) Master(value int) *ClusterNodesBuilder {\\n\\tb.master = &value\\n\\treturn b\\n}\",\n \"func newNodes(c *Client) *nodes {\\n\\treturn &nodes{c}\\n}\",\n \"func newSwimCluster(size int) *swimCluster {\\n\\tvar nodes []*Node\\n\\tvar channels []*tchannel.Channel\\n\\tfor i := 0; i < size; i++ {\\n\\t\\tch, err := tchannel.NewChannel(\\\"test\\\", nil)\\n\\t\\tif err != nil {\\n\\t\\t\\tpanic(err)\\n\\t\\t}\\n\\n\\t\\tif err := ch.ListenAndServe(\\\"127.0.0.1:0\\\"); err != nil {\\n\\t\\t\\tpanic(err)\\n\\t\\t}\\n\\t\\tchannels = append(channels, ch)\\n\\n\\t\\thostport := ch.PeerInfo().HostPort\\n\\t\\tnode := NewNode(\\\"test\\\", hostport, ch.GetSubChannel(\\\"test\\\"), nil)\\n\\n\\t\\tnodes = append(nodes, node)\\n\\t}\\n\\treturn &swimCluster{nodes: nodes, channels: channels}\\n}\",\n \"func main() {\\n\\trouter := mux.NewRouter()\\n\\t\\n\\t//initial nodes can be added form the command line \\n\\tif len(os.Args) > 1 {\\n\\t\\tnodeEndpoints := strings.Split(os.Args[1], \\\",\\\")\\n\\t\\tfor ind, node := range nodeEndpoints {\\n\\t\\t\\tcounternodes[node] = strconv.Itoa(ind) \\n\\t\\t}\\n\\t} \\n\\n\\n\\tfmt.Println(\\\"master node started on : 8000\\\")\\n\\trouter.HandleFunc(\\\"/items\\\", UpdateCount).Methods(\\\"POST\\\")\\n\\trouter.HandleFunc(\\\"/items/{id}/count\\\", GetCount).Methods(\\\"GET\\\")\\n\\trouter.HandleFunc(\\\"/ping\\\", CheckStatus).Methods(\\\"GET\\\")\\n\\trouter.HandleFunc(\\\"/addnode\\\", AddCounterNode).Methods(\\\"POST\\\")\\n\\trouter.HandleFunc(\\\"/removenode\\\", RemoveCounterNode).Methods(\\\"POST\\\")\\n\\trouter.HandleFunc(\\\"/syncnode/{nodeid}\\\", SyncCounterNode).Methods(\\\"POST\\\")\\n\\tlog.Fatal(http.ListenAndServe(\\\":8000\\\", router))\\n}\",\n \"func InitNetwork(nodes []Node, myself int) (network Network, err error) {\\n\\trC := make(chan Message, 65535) //Increased for TS\\n\\tsC := make(chan Message, 65535) //Increased for TS\\n\\tccC := make(chan *net.TCPConn, 65535)\\n\\tnetwork = Network{\\n\\t\\tNodes: []Node{},\\n\\t\\tConnections: map[int]*net.TCPConn{},\\n\\t\\tClientConns: []*net.TCPConn{},\\n\\t\\tReceiveChan: rC,\\n\\t\\tSendChan: sC,\\n\\t\\tClientConnChan: ccC,\\n\\t}\\n\\n\\tfor _, node := range nodes {\\n\\t\\tif node.ID == myself {\\n\\t\\t\\tfmt.Printf(\\\"You are number %v\\\\n\\\", myself)\\n\\t\\t\\tnetwork.Myself = node\\n\\t\\t\\tTCPsocket := network.Myself.IP + \\\":\\\" + strconv.Itoa(network.Myself.Port)\\n\\t\\t\\tnetwork.Myself.TCPaddr, err = net.ResolveTCPAddr(\\\"tcp\\\", TCPsocket)\\n\\t\\t} else {\\n\\t\\t\\tTCPsocket := node.IP + \\\":\\\" + strconv.Itoa(node.Port)\\n\\t\\t\\taddr, _ := net.ResolveTCPAddr(\\\"tcp\\\", TCPsocket)\\n\\t\\t\\tnetwork.Nodes = append(network.Nodes, Node{\\n\\t\\t\\t\\tID: node.ID,\\n\\t\\t\\t\\tIP: node.IP,\\n\\t\\t\\t\\tPort: node.Port,\\n\\t\\t\\t\\tTCPaddr: addr,\\n\\t\\t\\t})\\n\\t\\t}\\n\\t}\\n\\treturn network, err\\n}\",\n \"func (m *Master) Build() {\\n\\toutChannel := make(chan [2]string, 100)\\n\\n\\tvar channels [][]chan [2]string\\n\\tfor i := 0; i < len(m.workers); i++ {\\n\\t\\tvar newChannels []chan [2]string\\n\\t\\tfor j := 0; j < len(m.workers[i]); j++ {\\n\\t\\t\\tnewChannels = append(newChannels, make(chan [2]string, 100))\\n\\t\\t}\\n\\t\\tchannels = append(channels, newChannels)\\n\\t}\\n\\tfor j := 0; j < len(m.workers[0]); j++ {\\n\\t\\tm.workers[0][j].init(1, channels[0][j], channels[1])\\n\\t}\\n\\tfor i := 1; i < len(m.workers)-1; i++ {\\n\\t\\tfor j := 0; j < len(m.workers[i]); j++ {\\n\\t\\t\\tm.workers[i][j].init(len(m.workers[i-1]), channels[i][j], channels[i+1])\\n\\t\\t}\\n\\t}\\n\\tlast := len(m.workers) - 1\\n\\tfor j := 0; j < len(m.workers[last]); j++ {\\n\\t\\tm.workers[last][j].init(len(m.workers[last-1]), channels[last][j], []chan [2]string{outChannel})\\n\\t}\\n\\n\\tm.input.init(channels[0])\\n\\n\\tm.output.init(len(m.workers[last]), outChannel)\\n\\n\\tm.output.numUpstream = len(m.workers[last])\\n\\tm.output.inChannel = outChannel\\n\\tm.output.endChannel = make(chan int)\\n}\",\n \"func NewNODES(config configuration.CONFIGURATION) *NODES_IMPL {\\r\\n client := new(NODES_IMPL)\\r\\n client.config = config\\r\\n return client\\r\\n}\",\n \"func NewMasterConn(c net.Conn) (m Master, e error) {\\n\\tdefer func() {\\n\\t\\tif e != nil {\\n\\t\\t\\tc.Close()\\n\\t\\t}\\n\\t}()\\n\\n\\tgobCon := gobplexer.NetConnection(c)\\n\\trootConnector := gobplexer.MultiplexConnector(gobCon)\\n\\tkeptAlive, err := gobplexer.KeepaliveConnector(rootConnector,\\n\\t\\tpingInterval, pingMaxDelay)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tconnector := gobplexer.MultiplexConnector(keptAlive)\\n\\tif conn, err := connector.Connect(); err != nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"connect for info: %s\\\", err)\\n\\t} else if infoObj, err := conn.Receive(); err != nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"read info: %s\\\", err)\\n\\t} else if info, ok := infoObj.(SlaveInfo); !ok {\\n\\t\\treturn nil, fmt.Errorf(\\\"invalid info type: %T\\\", infoObj)\\n\\t} else {\\n\\t\\tdoneChan := make(chan struct{})\\n\\t\\tgo func() {\\n\\t\\t\\t// The other end leaves this sub-connection open so we\\n\\t\\t\\t// can poll from it to see when the connection dies.\\n\\t\\t\\tconn.Receive()\\n\\t\\t\\tc.Close()\\n\\t\\t\\tclose(doneChan)\\n\\t\\t}()\\n\\t\\treturn &masterConn{\\n\\t\\t\\tconnector: connector,\\n\\t\\t\\tdoneChan: doneChan,\\n\\t\\t\\tinfo: info,\\n\\t\\t}, nil\\n\\t}\\n}\",\n \"func initServer(ctx context.Context, n *Node) error {\\n\\n\\tif n.index < int32(len(n.config.Nodes)) {\\n\\n\\t\\tle := n.config.Nodes[n.index]\\n\\t\\tvar listener net.Listener\\n\\n\\t\\terr := backoff.Retry(\\n\\t\\t\\tfunc() error {\\n\\t\\t\\t\\tvar err error\\n\\t\\t\\t\\tlistener, err = net.Listen(\\\"tcp\\\", le)\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t},\\n\\t\\t\\tbackoff.WithMaxRetries(backoff.NewExponentialBackOff(), 3),\\n\\t\\t)\\n\\n\\t\\t// listener, err := net.Listen(\\\"tcp\\\", le)\\n\\t\\tif err != nil {\\n\\t\\t\\terr = raftErrorf(err, \\\"failed to acquire local TCP socket for gRPC\\\")\\n\\t\\t\\tn.logger.Errorw(\\\"initServer failed (some other application or previous instance still using socket?)\\\",\\n\\t\\t\\t\\traftErrKeyword, err)\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\ts := &raftServer{\\n\\t\\t\\tnode: n,\\n\\t\\t\\tlocalListener: listener,\\n\\t\\t\\tlocalAddr: le,\\n\\t\\t}\\n\\n\\t\\tn.messaging.server = s\\n\\t\\tn.logger.Debugw(\\\"listener acquired local node address\\\", s.logKV()...)\\n\\n\\t} else {\\n\\n\\t\\terr := raftErrorf(\\n\\t\\t\\tRaftErrorServerNotSetup, \\\"LocalNodeIndex in out of bounds of cluster Nodes configuration\\\")\\n\\t\\tn.logger.Errorw(\\\"initServer failed\\\", raftErrKeyword, err)\\n\\t\\treturn err\\n\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func (agent *ActionAgent) InitMaster(ctx context.Context) (string, error) {\\n\\tif err := agent.lock(ctx); err != nil {\\n\\t\\treturn \\\"\\\", err\\n\\t}\\n\\tdefer agent.unlock()\\n\\n\\t// Initializing as master implies undoing any previous \\\"do not replicate\\\".\\n\\tagent.setSlaveStopped(false)\\n\\n\\t// we need to insert something in the binlogs, so we can get the\\n\\t// current position. Let's just use the mysqlctl.CreateReparentJournal commands.\\n\\tcmds := mysqlctl.CreateReparentJournal()\\n\\tif err := agent.MysqlDaemon.ExecuteSuperQueryList(ctx, cmds); err != nil {\\n\\t\\treturn \\\"\\\", err\\n\\t}\\n\\n\\t// get the current replication position\\n\\tpos, err := agent.MysqlDaemon.MasterPosition()\\n\\tif err != nil {\\n\\t\\treturn \\\"\\\", err\\n\\t}\\n\\n\\t// If using semi-sync, we need to enable it before going read-write.\\n\\tif err := agent.fixSemiSync(topodatapb.TabletType_MASTER); err != nil {\\n\\t\\treturn \\\"\\\", err\\n\\t}\\n\\n\\t// Set the server read-write, from now on we can accept real\\n\\t// client writes. Note that if semi-sync replication is enabled,\\n\\t// we'll still need some slaves to be able to commit transactions.\\n\\tstartTime := time.Now()\\n\\tif err := agent.MysqlDaemon.SetReadOnly(false); err != nil {\\n\\t\\treturn \\\"\\\", err\\n\\t}\\n\\tagent.setExternallyReparentedTime(startTime)\\n\\n\\t// Change our type to master if not already\\n\\tif _, err := agent.TopoServer.UpdateTabletFields(ctx, agent.TabletAlias, func(tablet *topodatapb.Tablet) error {\\n\\t\\ttablet.Type = topodatapb.TabletType_MASTER\\n\\t\\treturn nil\\n\\t}); err != nil {\\n\\t\\treturn \\\"\\\", err\\n\\t}\\n\\n\\t// and refresh our state\\n\\tagent.initReplication = true\\n\\tif err := agent.refreshTablet(ctx, \\\"InitMaster\\\"); err != nil {\\n\\t\\treturn \\\"\\\", err\\n\\t}\\n\\treturn mysql.EncodePosition(pos), nil\\n}\",\n \"func NewMasterNode(seed []byte) (*Node, error) {\\n\\t// Check if seed has valid size\\n\\tif len(seed) < minSeedSize || len(seed) > maxSeedSize {\\n\\t\\treturn nil, errors.New(\\\"NewMasterNode: invalid seed size\\\")\\n\\t}\\n\\n\\t// Generate HMAC-SHA512 with hardcoded seed as Key\\n\\th := hmac.New(hasher.SHA2_512.New, []byte(\\\"Bitcoin seed\\\"))\\n\\n\\t// Data: H(seed)\\n\\th.Write(seed)\\n\\taux := h.Sum(nil)\\n\\n\\t// Validate Private Key\\n\\terr := validatePrivateKey(aux[:keySize])\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\t// Export Key and Chain Code from aux\\n\\tnode := &Node{\\n\\t\\tKey: aux[:keySize],\\n\\t\\tCode: aux[keySize:],\\n\\t}\\n\\treturn node, nil\\n}\",\n \"func (m *Master) server() {\\n\\trpc.Register(m)\\n\\trpc.HandleHTTP()\\n\\tos.Create(\\\"mr-socket\\\")\\n\\n\\tl, e := net.Listen(\\\"tcp\\\", \\\"0.0.0.0:8080\\\")\\n\\tif e != nil {\\n\\t\\tlog.Fatal(\\\"listen error:\\\", e)\\n\\t}\\n\\tlog.Printf(\\\"Server is running at %s\\\\n\\\", l.Addr().String())\\n\\tgo http.Serve(l, nil)\\n}\",\n \"func init() {\\n\\n\\t//Welcome Message\\n\\tfmt.Println(\\\"------------------------------------------------------------------\\\")\\n\\tfmt.Println(\\\"Starting Natyla...\\\")\\n\\tfmt.Println(\\\"Version: 1.02\\\")\\n\\n\\t//Set the thread quantity based on the number of CPU's\\n\\tcoreNum := runtime.NumCPU()\\n\\n\\tfmt.Println(\\\"Number of cores: \\\", coreNum)\\n\\n\\t//read the config file\\n\\treadConfig()\\n\\n\\t//create the data directory\\n\\tcreateDataDir()\\n\\n\\t//set max memory form config\\n\\tmaxMemBytes, _ = config[\\\"memory\\\"].(json.Number).Int64()\\n\\tfmt.Println(\\\"Max memory defined as: \\\", maxMemBytes/1024/1024, \\\" Mbytes\\\")\\n\\n\\truntime.GOMAXPROCS(coreNum)\\n\\n\\t//Create a new doble-linked list to act as LRU\\n\\tlruList = list.New()\\n\\n\\t//Create the channels\\n\\tlisChan = make(chan int, 1)\\n\\tLRUChan = make(chan int, 1)\\n\\tcollectionChan = make(chan int, 1)\\n\\n\\tcollections = make(map[string]collectionChannel)\\n\\n\\t//Read collections from disk\\n\\tnRead := readAllFromDisk()\\n\\tfmt.Println(\\\"Read\\\", nRead, \\\"entries from disk\\\")\\n\\n\\tfmt.Println(\\\"Ready, API Listening on http://localhost:8080, Telnet on port 8081\\\")\\n\\tfmt.Println(\\\"------------------------------------------------------------------\\\")\\n}\",\n \"func (n *Node) Init() {\\n\\tn.NodeNet.Init()\\n\\n\\tn.NodeNet.Logger = n.Logger\\n\\tn.NodeBC.Logger = n.Logger\\n\\n\\tn.NodeBC.MinterAddress = n.MinterAddress\\n\\n\\tn.NodeBC.DBConn = n.DBConn\\n\\n\\t// Nodes list storage\\n\\tn.NodeNet.SetExtraManager(NodesListStorage{n.DBConn, n.SessionID})\\n\\t// load list of nodes from config\\n\\tn.NodeNet.SetNodes([]net.NodeAddr{}, true)\\n\\n\\tn.InitClient()\\n\\n\\trand.Seed(time.Now().UTC().UnixNano())\\n}\",\n \"func StartRPCClient(spawnChannel chan int, somechan chan bool,job *Job) {\\n\\tfmt.Print(\\\"\\\\n> Initating connection with master\\\")\\n\\tclient, err := rpc.Dial(\\\"tcp\\\", \\\"0.0.0.0:12345\\\")\\n\\tif err != nil {\\n\\t log.Fatal(err)\\n\\t}\\n\\n\\tl := string(\\\"Test String\\\")\\n\\n\\terr = client.Call(\\\"Master.EstConnection\\\", l, &job)\\n\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n\\tfmt.Printf(\\\"\\\\n> Pusblising on mapper spawn channel\\\")\\n\\tspawnChannel <- job.NMappers\\n\\tsomechan <- true\\n\\tclose(spawnChannel)\\n\\tclose(somechan)\\n}\",\n \"func (zk *ZookeeperMaster) Init() error {\\n\\tzk.isMaster = false\\n\\t//create connection to zookeeper\\n\\tzk.client = zkclient.NewZkClient(zk.zkHosts)\\n\\tif err := zk.client.ConnectEx(time.Second * 10); err != nil {\\n\\t\\treturn fmt.Errorf(\\\"Init failed when connect zk, %s\\\", err.Error())\\n\\t}\\n\\treturn nil\\n}\",\n \"func TcpManagerInit() *TcpManager {\\n\\tm := &TcpManager{\\n\\t\\tbind: make(chan *TcpClient, 10),\\n\\t\\tunbind: make(chan *TcpClient, 10),\\n\\t\\tclose: make(chan *TcpClient, 10),\\n\\t\\tbindClients: util.NewConcMap(),\\n\\t\\tunbindClients: util.NewConcMap(),\\n\\t}\\n\\tants.Submit(m.Run)\\n\\treturn m\\n}\",\n \"func (m *Master) Connect(a *ConnectArgs, r *ConnectRes) error {\\n\\tm.mu.Lock()\\n\\tdefer m.mu.Unlock()\\n\\n\\tm.idSeq++\\n\\ts := &MasterSlave{\\n\\t\\tid: m.idSeq,\\n\\t\\tprocs: a.Procs,\\n\\t\\tlastSync: time.Now(),\\n\\t}\\n\\tm.slaves[s.id] = s\\n\\tr.ID = s.id\\n\\t// Give the slave initial corpus.\\n\\tfor _, a := range m.corpus.m {\\n\\t\\tr.Corpus = append(r.Corpus, MasterInput{a.data, a.meta, execCorpus, !a.user, true})\\n\\t}\\n\\treturn nil\\n}\",\n \"func init() {\\n\\tbackendQueue = make(chan *Backend, 10) \\t//channel at a size of 10\\n\\t\\t\\t\\t\\t\\t//This is a buffered channel.\\n\\t\\t\\t\\t\\t\\t//This means that it can hold 10 Backends before it starts to block\\n}\",\n \"func init() {\\n\\t// Reset commands, so `pegnetnode` is the only h\\n\\tpcmd.RootCmd.ResetCommands()\\n\\tpcmd.RootCmd.Flags().Bool(\\\"mock\\\", false, \\\"Do not actually connect to discord\\\")\\n\\tpcmd.RootCmd.Run = func(cmd *cobra.Command, args []string) {\\n\\t\\tdiscordNode.Run(cmd, args)\\n\\t}\\n}\",\n \"func newHub(id string, redis *predis.Client) *hub {\\n\\th := &hub{\\n\\t\\tid: id,\\n\\t\\tredis: redis,\\n\\t\\tclients: make(map[string]*client),\\n\\t\\tinboundc: make(chan *Message),\\n\\t\\tpeerc: make(chan *Message),\\n\\t\\tmasterc: make(chan []byte),\\n\\t\\tregisterc: make(chan *client),\\n\\t\\tunregisterc: make(chan *client),\\n\\t}\\n\\n\\th.presence = newPresence(h.id, h.redis)\\n\\th.transport = newTransport(h.id, h.redis, h.masterc, h.peerc)\\n\\n\\treturn h\\n}\",\n \"func newResponseNode(model string, hash string, version *big.Int, sim *backends.SimulatedBackend) {\\n\\topts := mqtt.NewClientOptions().AddBroker(\\\"tcp://localhost:1883\\\")\\n\\tclient := mqtt.NewClient(opts)\\n\\ttoken := client.Connect()\\n\\tif token.Wait() && token.Error() != nil {\\n\\t\\tlog.Fatalln(token.Error())\\n\\t}\\n\\n\\tvar messageHandler mqtt.MessageHandler = func(client mqtt.Client, msg mqtt.Message) {\\n\\t\\tcontract, _ := contracts.NewVerifier(common.HexToAddress(string(msg.Payload())), sim)\\n\\t\\tsendResponse(sim, contract, hash, version)\\n\\t}\\n\\ttoken = client.Subscribe(model, 0, messageHandler)\\n\\tif token.Wait() && token.Error() != nil {\\n\\t\\tlog.Fatalln(token.Error())\\n\\t}\\n}\",\n \"func ConnectNodes(config *utils.Config) {\\n\\tnodes := config.Nodes\\n\\tip := config.Master.Ip\\n\\tport := config.Master.Port\\n\\tCONN := ip + \\\":\\\" + port\\n\\n//connect to master server for all nodes and then connect to each other\\n\\tfor j := range nodes {\\n\\t\\t//dial into master server\\n\\t\\tconn, err := net.Dial(\\\"tcp\\\", CONN)\\n\\t\\tutils.Error(err)\\n\\t\\tnodes[j].Conns = append(nodes[j].Conns, conn)\\n\\t}\\n\\tfor i := range nodes {\\n\\t\\t//have it connect to all nodes including itself\\n\\t\\tfor _, serverNode := range nodes {\\n\\t\\t\\tip := serverNode.Ip\\n\\t\\t\\tport := serverNode.Port\\n\\t\\t\\tCONN := ip + \\\":\\\" + port\\n\\t\\t\\t//connect to all other nodes\\n\\t\\t\\tconn, err := net.Dial(\\\"tcp\\\", CONN)\\n\\t\\t\\tutils.Error(err)\\n\\t\\t\\tnodes[i].Conns = append(nodes[i].Conns, conn)\\n\\t\\t}\\n\\t}\\n}\",\n \"func handleSlaveConnection(c net.Conn, msgchan chan Msg, addchan chan Slave) {\\n\\n\\tlog.Printf(\\\"Handling new slave connection...\\\\n\\\")\\n\\tslaveReader := bufio.NewReader(c)\\n\\t//get number of files\\n\\tbuff1, _, _ := slaveReader.ReadLine() //get number of original files\\n\\tbuff2, _, _ := slaveReader.ReadLine() //get number of replicated files\\n\\tsize, _ := strconv.Atoi(string(buff1))\\n\\trsize, _ := strconv.Atoi(string(buff2))\\n\\tlog.Printf(\\\"Size: %d\\\\nRSize: %d\\\\n\\\", size, rsize)\\n\\t//create new slave\\n\\tnewClient := Slave{\\n\\t\\tconnection: c,\\n\\t\\tchunks: make([]string, 0, size),\\n\\t\\trchunks: make([]string, 0, rsize),\\n\\t\\tchannel: make(chan string, 2),\\n\\t\\tresponse: \\\"nr\\\"}\\n\\tnewMsg := Msg{\\n\\t\\tconnection: c}\\n\\t//receive original file names from slave\\n\\tfor i := 0; i < size; i++ {\\n\\t\\tname, _, _ := slaveReader.ReadLine() //get Name of chunks\\n\\t\\tnewClient.chunks = append(newClient.chunks, string(name))\\n\\t\\tlog.Printf(\\\"Chunk # %d , Name: %s \\\\n\\\", i, string(name))\\n\\t}\\n\\t//receive replicated files names from slave\\n\\tfor i := 0; i < rsize; i++ {\\n\\t\\tname, _, _ := slaveReader.ReadLine() //get Name of chunks\\n\\t\\tnewClient.rchunks = append(newClient.rchunks, string(name))\\n\\t\\tlog.Printf(\\\"RChunk # %d , Name: %s \\\\n\\\", i, string(name))\\n\\t}\\n\\tlog.Print(newClient)\\n\\t//sending new slave information to master thread\\n\\taddchan <- newClient\\n\\n\\tcommand := \\\"nil\\\"\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase x := <-newClient.channel:\\n\\t\\t\\tcommand = x\\n\\t\\t\\tfmt.Println(\\\"setting new command: \\\" + command)\\n\\t\\tdefault:\\n\\n\\t\\t\\tc.Write([]byte(command + \\\"\\\\n\\\"))\\n\\n\\t\\t\\tcc, _, err := slaveReader.ReadLine()\\n\\t\\t\\tresponse := string(cc)\\n\\t\\t\\t//check for disconnectivity\\n\\t\\t\\tif response == \\\"\\\" || err != nil {\\n\\t\\t\\t\\tlog.Println(\\\"Slave disconnected...\\\")\\n\\t\\t\\t\\tnewMsg.msg = \\\"rmv\\\"\\n\\t\\t\\t\\tmsgchan <- newMsg\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t\\t//Parse reponse\\n\\t\\t\\tprsResp := strings.Split(response, \\\":\\\")\\n\\t\\t\\tlog.Print(prsResp[0])\\n\\t\\t\\t//set response of not found\\n\\t\\t\\tif prsResp[0] == \\\"not\\\" {\\n\\t\\t\\t\\tcommand = \\\"nil\\\"\\n\\t\\t\\t\\tnewMsg.msg = response\\n\\t\\t\\t\\tmsgchan <- newMsg\\n\\t\\t\\t} else if prsResp[0] == \\\"done\\\" {\\n\\t\\t\\t\\tcommand = \\\"nil\\\"\\n\\t\\t\\t\\tnewMsg.msg = response\\n\\t\\t\\t\\tmsgchan <- newMsg\\n\\t\\t\\t} else if prsResp[0] == \\\"nil\\\" {\\n\\t\\t\\t\\tcommand = \\\"nil\\\"\\n\\t\\t\\t}\\n\\t\\t\\ttime.Sleep(1 * time.Second)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (n *Node) Start() error {\\n\\tgo n.mainLoop()\\n\\t// Wait until fully initialized\\n\\t<-n.initializedChan\\n\\treturn n.connect(NodeInfo{Ip: \\\"127.0.0.1\\\", Port: n.listenPort})\\n}\",\n \"func init(){\\n\\tskeleton.RegisterChanRPC(reflect.TypeOf(&msg.Hello{}), handleHello)\\n}\",\n \"func doStart(server common.Server, cfg *config.Config) (err error) {\\n\\tdebug.SetMaxThreads(20000)\\n\\n\\ts, ok := server.(*DataNode)\\n\\tif !ok {\\n\\t\\treturn errors.New(\\\"Invalid Node Type!\\\")\\n\\t}\\n\\n\\ts.stopC = make(chan bool, 0)\\n\\n\\t// parse the config file\\n\\tif err = s.parseConfig(cfg); err != nil {\\n\\t\\treturn\\n\\t}\\n\\n\\texporter.Init(ModuleName, cfg)\\n\\ts.registerMetrics()\\n\\ts.register(cfg)\\n\\n\\t//parse the smux config\\n\\tif err = s.parseSmuxConfig(cfg); err != nil {\\n\\t\\treturn\\n\\t}\\n\\t//connection pool must be created before initSpaceManager\\n\\ts.initConnPool()\\n\\n\\t// init limit\\n\\tinitRepairLimit(s, cfg)\\n\\n\\t// start the raft server\\n\\tif err = s.startRaftServer(cfg); err != nil {\\n\\t\\treturn\\n\\t}\\n\\n\\t// create space manager (disk, partition, etc.)\\n\\tif err = s.startSpaceManager(cfg); err != nil {\\n\\t\\treturn\\n\\t}\\n\\n\\t// check local partition compare with master ,if lack,then not start\\n\\tif err = s.checkLocalPartitionMatchWithMaster(); err != nil {\\n\\t\\tlog.LogError(err)\\n\\t\\texporter.Warning(err.Error())\\n\\t\\treturn\\n\\t}\\n\\n\\t// tcp listening & tcp connection pool\\n\\tif err = s.startTCPService(); err != nil {\\n\\t\\treturn\\n\\t}\\n\\n\\t//smux listening & smux connection pool\\n\\tif err = s.startSmuxService(cfg); err != nil {\\n\\t\\treturn\\n\\t}\\n\\n\\tgo s.registerHandler()\\n\\n\\tgo s.startUpdateNodeInfo()\\n\\n\\treturn\\n}\",\n \"func MakeMaster(files []string, nReduce int) *Master {\\n\\tnMap := len(files)\\n\\tm := NewMaster(files, max(nMap, nReduce), masterTimeout, nReduce)\\n\\n\\t// Your code here.\\n\\tm.server()\\n\\treturn m\\n}\",\n \"func Initialize(configFileName string) error {\\n\\n\\tif err := readConfigJSON(configFileName); err != nil {\\n\\t\\treturn fmt.Errorf(\\\"initialize error: %v\\\", err)\\n\\t}\\n\\n\\tmanager = &ManagerNode{\\n\\t\\tManagerNodeID: ManagerNodeID(config.ManagerNodeID),\\n\\t\\tTopicMap: make(map[string]*Topic),\\n\\t\\tManagerPeers: make(map[ManagerNodeID]string),\\n\\t\\tBrokerNodes: make(map[BrokerNodeID]string),\\n\\t\\tTopicMutex: &sync.Mutex{},\\n\\t\\tManagerMutex: &sync.Mutex{},\\n\\t\\tBrokerMutex: &sync.Mutex{},\\n\\t\\tMU: &sync.Mutex{},\\n\\t}\\n\\n\\tcache, err := lru.New(cacheSize)\\n\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\tmanager.TransactionCache = cache\\n\\n\\tlogger = govec.InitGoVector(string(manager.ManagerNodeID), fmt.Sprintf(\\\"%v-logfile\\\", manager.ManagerNodeID), govec.GetDefaultConfig())\\n\\tloggerOptions = govec.GetDefaultLogOptions()\\n\\n\\tgo func() {\\n\\t\\ttime.Sleep(time.Duration(100) * time.Millisecond)\\n\\t\\tif len(config.PeerManagerNodeIP) != 0 {\\n\\t\\t\\tif err := manager.registerPeerRequest(config.PeerManagerNodeIP); err != nil {\\n\\t\\t\\t\\tfmt.Println(err)\\n\\t\\t\\t\\tos.Exit(1)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}()\\n\\n\\tvar emptylist []string\\n\\tring = hashring.New(emptylist)\\n\\tspawnRPCServer()\\n\\treturn nil\\n}\",\n \"func createChannel() Channel {\\n\\tchannel := channelStruct{}\\n\\treturn &channel\\n}\",\n \"func (n *NodeConn) Init(arg interface {}) (interface {}) {\\n\\tn.ComplexComm.Init(c.ComplexCommInit{numChan:2})\\n\\treturn n\\n}\",\n \"func main(){\\n\\tmc := master.LoadConfig()\\n\\terrList := master.Start(mc.Num_instances, mc.Selection_config, mc.Ports)\\n\\tfor i, err := range errList {\\n\\t\\tlog.Println(\\\"ERR: \\\", i, \\\"th master terminated with error: \\\", err)\\n\\t}\\n\\n}\",\n \"func guildCreate(s *discordgo.Session, event *discordgo.GuildCreate) {\\n\\n\\tif event.Guild.Unavailable {\\n\\t\\treturn\\n\\t}\\n\\n\\tfor _, channel := range event.Guild.Channels {\\n\\t\\tif channel.ID == event.Guild.ID {\\n\\t\\t\\t_, _ = s.ChannelMessageSend(channel.ID, \\\"primitive-gobot is ready!\\\")\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}\\n}\",\n \"func MakeMaster(files []string, nReduce int) *Master {\\n\\tm := Master{}\\n\\n\\t// Your code here.\\n\\tm.nReduce = nReduce\\n\\tm.files = files\\n\\tm.nMap = len(files)\\n\\tm.mapStates = make([]mapState, m.nMap)\\n\\tm.reduceStates = make([]reduceState, m.nReduce)\\n\\tm.server()\\n\\treturn &m\\n}\",\n \"func init() {\\n\\tSBC = data.NewBlockChain()\\n\\tid, _ := strconv.ParseInt(os.Args[1], 10, 32)\\n\\tPeers = data.NewPeerList( /*Register()*/ int32(id), 32) // Uses port number as ID since TA server is down\\n\\tprivateKey, publicKey = client.GenerateKeyPair()\\n\\tifStarted = false\\n\\tmpt.Initial()\\n\\tclientBalanceMap = make(map[string]int32)\\n\\tpendingTransaction = make(map[string]string)\\n\\ttransactionMpt.Initial()\\n\\tclientBalanceMap[string(client.PublicKeyToBytes(publicKey))] = 1000\\n\\thighestblockTransaction = 0\\n}\",\n \"func MakeMaster(files []string, nReduce int) *Master {\\n\\tm := Master{}\\n\\tm.files = files\\n\\tm.record = map[string]*record{}\\n\\tm.tasks = map[int][]*record{}\\n\\tm.reduceTasks = map[int]*record{}\\n\\tm.nReduce = nReduce\\n\\tm.phase = TaskMapType\\n\\t// Your code here.\\n\\n\\tm.server()\\n\\treturn &m\\n}\",\n \"func (c *Client) init() {\\n\\tif c.domains == nil {\\n\\t\\tc.domains = map[int]string{}\\n\\t}\\n\\tif c.cfg == nil {\\n\\t\\tc.cfg = manager.NewAtomicConfig(tg.Config{})\\n\\t}\\n\\tc.ready = tdsync.NewResetReady()\\n\\tc.restart = make(chan struct{})\\n\\tc.migration = make(chan struct{}, 1)\\n\\tc.sessions = map[int]*pool.SyncSession{}\\n\\tc.subConns = map[int]CloseInvoker{}\\n\\tc.invoker = chainMiddlewares(InvokeFunc(c.invokeDirect), c.mw...)\\n\\tc.tg = tg.NewClient(c.invoker)\\n}\",\n \"func NewConnectionToNodes(cycle int, nodes ...string) (Connection, error){\\n disqueConn, err := connectToFirstAvailableNode(nodes...); if err != nil {\\n return Connection{Cycle: cycle, Nodes: nodes}, err\\n }\\n\\n return Connection{disqueConn, cycle, nodes}, nil\\n}\",\n \"func InitNode(absPath string, metaData MetaData) {\\n\\tfmt.Println(\\\"Initiating Node.JS project\\\")\\n\\n\\t// Create the new directory\\n\\tfmt.Println(\\\"Making Directories\\\")\\n\\tos.Mkdir(path.Join(absPath, \\\"src\\\"), 0777)\\n\\tos.Mkdir(path.Join(absPath, \\\"test\\\"), 0777)\\n\\tos.Mkdir(path.Join(absPath, \\\".circleci\\\"), 0777)\\n\\n\\t// Get node version\\n\\tnodev, err := runCmd(\\\"node\\\", \\\"-v\\\")\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n\\t// Write .nvmrc\\n\\tioutil.WriteFile(path.Join(absPath, \\\".nvmrc\\\"), []byte(nodev), 0666)\\n\\n\\t// node version comes out like v10.9.0, so we need to trim the leading 'v'\\n\\tnodev = nodev[1:]\\n\\n\\tfmt.Println(\\\"Getting Dependency Versions\\\")\\n\\tchaiv, err := runCmd(\\\"npm\\\", \\\"show\\\", \\\"chai\\\", \\\"version\\\")\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n\\tmochav, err := runCmd(\\\"npm\\\", \\\"show\\\", \\\"mocha\\\", \\\"version\\\")\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n\\teslintv, err := runCmd(\\\"npm\\\", \\\"show\\\", \\\"eslint\\\", \\\"version\\\")\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n\\tnycv, err := runCmd(\\\"npm\\\", \\\"show\\\", \\\"nyc\\\", \\\"version\\\")\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n\\tpInfo := packageInfo{\\n\\t\\tName: metaData.Name,\\n\\t\\tAuthor: metaData.Author,\\n\\t\\tNodeVersion: nodev,\\n\\t\\tChaiVersion: chaiv,\\n\\t\\tMochaVersion: mochav,\\n\\t\\tESLintVersion: eslintv,\\n\\t\\tNYCVersion: nycv,\\n\\t}\\n\\n\\t// Initiate the project\\n\\terr = createFileFromTemplate(templates.PackageJSON(), path.Join(absPath, \\\"package.json\\\"), pInfo)\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n\\tnewFile, err := os.Create(path.Join(absPath, \\\"src\\\", \\\"index.js\\\"))\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\tnewFile.Close()\\n\\n\\tfmt.Println(\\\"Installing dependencies\\\")\\n\\t_, err = runCmdFromDir(absPath, \\\"npm\\\", \\\"install\\\")\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n\\terr = ioutil.WriteFile(path.Join(absPath, \\\".eslintrc.js\\\"), []byte(templates.ESLintRC()), 0666)\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n\\tfmt.Println(\\\"Setting up CircleCI\\\")\\n\\terr = createFileFromTemplate(templates.CircleNode(), path.Join(absPath, \\\".circleci\\\", \\\"config.yml\\\"), pInfo)\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n\\tfmt.Println(\\\"Fetching .gitignore\\\")\\n\\tresp, err := http.Get(\\\"https://raw.githubusercontent.com/github/gitignore/master/Node.gitignore\\\")\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\tdefer resp.Body.Close()\\n\\tbody, err := ioutil.ReadAll(resp.Body)\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\tioutil.WriteFile(path.Join(absPath, \\\".gitignore\\\"), body, 0666)\\n\\n\\terr = createFileFromTemplate(templates.ComposeNode(), path.Join(absPath, \\\"docker-compose.yml\\\"), pInfo)\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n}\",\n \"func (p *Pupil) setupEventChannel(eventChan chan []byte) {\\n\\tvar err error\\n\\tif p.sock, err = respondent.NewSocket(); err != nil {\\n\\t\\tlog.Fatal(\\\"Couldn't open the event port\\\")\\n\\t}\\n\\tp.sock.AddTransport(tcp.NewTransport())\\n\\tlog.Printf(\\\"Dialing into the master at %s\\\\n\\\", p.MasterEventURL)\\n\\tif err = p.sock.Dial(p.MasterEventURL); err != nil {\\n\\t\\tlog.Fatalf(\\\"Couldn't connect to the master's event port at - %s\\\\n\\\", p.MasterEventURL)\\n\\t}\\n\\tlog.Printf(\\\"pupil ready to receive events from the master\\\")\\n}\",\n \"func MakeMaster(files []string, nReduce int) *Master {\\n\\tdelete()\\n\\tm := Master {\\n\\t\\tmu: sync.RWMutex{},\\n\\t\\tM: len(files),\\n\\t\\tR: nReduce,\\n\\t\\tidleTasks: [2]chan Task{make(chan Task, len(files)), make(chan Task, nReduce)},\\n\\t\\tinProgress: [2]map[Task]bool{make(map[Task]bool), make(map[Task]bool)},\\n\\t\\tcompletedTasks: [2]chan Task{make(chan Task, len(files)), make(chan Task, nReduce)},\\n\\t}\\n\\n\\n\\t// Your code here.\\n\\tfor i, file := range files {\\n\\t\\ttask := Task{Type: \\\"map\\\", Filename: file, TaskNum: i, NReduce: nReduce}\\n\\t\\tm.idleTasks[0] <- task\\n\\t}\\n\\n\\tfor i:=0; i<nReduce ; i++ {\\n\\t\\tm.idleTasks[1] <- Task{\\n\\t\\t\\tType: \\\"reduce\\\",\\n\\t\\t\\tFilename: \\\"\\\",\\n\\t\\t\\tTaskNum: i,\\n\\t\\t\\tNReduce: nReduce,\\n\\t\\t}\\n\\t}\\n\\n\\tm.server()\\n\\treturn &m\\n}\",\n \"func Connect(token string) error {\\n\\tdg, err := discordgo.New(\\\"Bot \\\" + token)\\n\\tif err != nil {\\n\\t\\tfmt.Println(\\\"error creating Discord session,\\\", err)\\n\\t\\treturn err\\n\\t}\\n\\tdg.AddHandler(manager)\\n\\tchannels, _ := dg.GuildChannels(\\\"675106841436356628\\\")\\n\\n\\tfor _, v := range channels {\\n\\t\\tfmt.Printf(\\\"Channel id: %s Channel name: %s\\\\n\\\", v.ID, v.Name)\\n\\t}\\n\\n\\t// This function sends message every hour concurrently.\\n\\tgo func() {\\n\\t\\tfor range time.NewTicker(time.Hour).C {\\n\\t\\t\\t_, err := dg.ChannelMessageSend(\\\"675109890204762143\\\", \\\"dont forget washing ur hands!\\\")\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tlog.Println(\\\"couldn't send ticker message\\\", err)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}()\\n\\n\\terr = dg.Open()\\n\\tif err != nil {\\n\\t\\tfmt.Println(\\\"error opening connection,\\\", err)\\n\\t\\treturn err\\n\\t}\\n\\t// Wait here until CTRL-C or other term signal is received.\\n\\tfmt.Println(\\\"Bot is now running. Press CTRL-C to exit.\\\")\\n\\tsc := make(chan os.Signal, 1)\\n\\tsignal.Notify(sc, syscall.SIGINT, syscall.SIGTERM, os.Interrupt, os.Kill)\\n\\t<-sc\\n\\t// Cleanly close down the Discord session.\\n\\tdg.Close()\\n\\treturn nil\\n}\",\n \"func init() {\\n\\tbinlogplayer.RegisterClientFactory(\\\"gorpc\\\", func() binlogplayer.Client {\\n\\t\\treturn &client{}\\n\\t})\\n}\",\n \"func InitiateAndStartQmlGrpcServer() {\\n\\tvar err error\\n\\n\\tQmlServerObject.logger.WithFields(logrus.Fields{\\n\\t\\t\\\"ID\\\": \\\"56b6419f-d714-4ab0-be62-f3c7f08b9558\\\",\\n\\t}).Info(\\\"Mother Server tries to start\\\")\\n\\n\\t// Find first non allocated port from defined start port\\n\\t// TODO\\n\\n\\tQmlServerObject.logger.WithFields(logrus.Fields{\\n\\t\\t\\\"common_config.QmlServer_port): \\\": common_config.QmlServer_port,\\n\\t\\t\\\"ID\\\": \\\"8f904ace-9d24-452b-891a-5b8e5c247ba2\\\",\\n\\t}).Info(\\\"Start listening on:\\\")\\n\\tlis, err = net.Listen(\\\"tcp\\\", string(common_config.QmlServer_port))\\n\\n\\tif err != nil {\\n\\t\\tQmlServerObject.logger.WithFields(logrus.Fields{\\n\\t\\t\\t\\\"err: \\\": err,\\n\\t\\t\\t\\\"ID\\\": \\\"0fbf0f08-6114-4cd8-9992-6a387955fb5f\\\",\\n\\t\\t}).Fatal(\\\"failed to listen:\\\")\\n\\n\\t} else {\\n\\t\\tQmlServerObject.logger.WithFields(logrus.Fields{\\n\\t\\t\\t\\\"common_config.QmlServer_port): \\\": common_config.QmlServer_port,\\n\\t\\t\\t\\\"ID\\\": \\\"93496c07-2b6c-4edc-a1f9-3fd555fa1201\\\",\\n\\t\\t}).Info(\\\"Success in listening on port:\\\")\\n\\n\\t}\\n\\n\\t// Creates a new RegisterMotherServer gRPC server\\n\\tgo func() {\\n\\t\\tQmlServerObject.logger.WithFields(logrus.Fields{\\n\\t\\t\\t\\\"ID\\\": \\\"ebc26735-9d13-4b13-91b8-20999cd5e254\\\",\\n\\t\\t}).Info(\\\"Starting QML gRPC Server\\\")\\n\\n\\t\\tregisterQmlGrpcServer = grpc.NewServer()\\n\\t\\tqml_server_grpc_api.RegisterQmlGrpcServicesServer(registerQmlGrpcServer, &QMLgRrpServer_struct{})\\n\\n\\t\\tQmlServerObject.logger.WithFields(logrus.Fields{\\n\\t\\t\\t\\\"common_config.QmlServer_port): \\\": common_config.QmlServer_port,\\n\\t\\t\\t\\\"ID\\\": \\\"cfed87c4-55aa-4cd1-980a-a15eb75ab6fb\\\",\\n\\t\\t}).Info(\\\"registerQmlGrpcServer for QMLs gRPC Server started\\\")\\n\\n\\t\\tregisterQmlGrpcServer.Serve(lis)\\n\\t}()\\n}\",\n \"func (n *miniNode) Init() Nodes { return Nodes{} }\",\n \"func (s *Server) SetMaster(host string, config toolkit.M) error {\\n\\tif s.masterClient != nil {\\n s.masterClient.Call(\\\"unfollow\\\", toolkit.M{}.Set(\\\"nodeid\\\", s.masterClient.Host), nil)\\n\\t\\ts.masterClient.Close()\\n\\t}\\n \\n s.masterHost = host\\n\\tif host==\\\"\\\"{\\n return nil \\n }\\n \\n masterClient := NewClient(s.masterHost, config)\\n\\te := masterClient.Connect()\\n\\tif e != nil {\\n\\t\\treturn errors.New(\\\"Server.SetMaster: \\\" + e.Error())\\n\\t}\\n\\n\\te = masterClient.Call(\\\"follow\\\", toolkit.M{}.Set(\\\"nodeid\\\", s.Host), nil)\\n\\tif e != nil {\\n\\t\\treturn errors.New(\\\"Server.SetMaster.Follow: \\\" + e.Error())\\n\\t}\\n s.Log.AddLog(toolkit.Sprintf(\\\"Server %s is now following %s\\\", s.Host, host), \\\"INFO\\\") \\t\\n\\treturn nil\\n}\",\n \"func MakeMaster(files []string, nReduce int) *Master {\\n\\tm := Master{}\\n\\n\\t// Your code here.\\n\\tm.ReduceTask = make(map[int]*ReduceTaskStatus)\\n\\tm.MapTask = make(map[int]*MapTaskStatus)\\n\\tm.inputFileList = files\\n\\tm.nReduce = nReduce\\n\\tm.State = Map\\n\\tfor i, _ := range files {\\n\\t\\tm.MapTask[i] = &MapTaskStatus{\\n\\t\\t\\tStatus: UnInit,\\n\\t\\t}\\n\\t}\\n\\n\\tm.server()\\n\\treturn &m\\n}\",\n \"func (c *Cluster) SetMaster(opts *pg.Options) error {\\n\\tconn, err := newConnection(opts, c.conf.ConnPingTimeout, c.conf.ConnCheckDelay)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tc.manager.master = conn\\n\\treturn nil\\n}\",\n \"func InitRing(myIp string, myId int) {\\n\\tfmt.Println(\\\"\\\\n------------------------------------------------------------------------------\\\")\\n\\tfmt.Println(\\\"Test 1: creating/join chord ring ...\\\")\\n\\tstart1 := time.Now()\\n\\n\\t// scan for ring\\n\\tfmt.Println(\\\"\\\\nScanning for ring ...\\\")\\n\\tipInRing, _ := chord.CheckRing()\\n\\tringSize := len(ipInRing)\\n\\tfmt.Println(\\\"Ring scan completed!\\\\nNodes in ring: \\\", ipInRing, \\\"\\\\nRing size: \\\", ringSize)\\n\\n\\t// init node\\n\\tfmt.Println(\\\"\\\\nCreating node ...\\\")\\n\\tchord.ChordNode = &chord.Node{\\n\\t\\tIdentifier: myId,\\n\\t\\tIP: myIp,\\n\\t}\\n\\tfmt.Println(\\\"\\\\nActivating node ...\\\")\\n\\tgo node_listen(myIp)\\n\\n\\t// create / join ring\\n\\tif ringSize == 0 {\\n\\t\\t// Ring does NOT exists => CREATE ring\\n\\t\\tfmt.Println(\\\"\\\\nRing does NOT exists!\\\\nCreating new ring at \\\", myIp)\\n\\t\\tchord.ChordNode.CreateNodeAndJoin(nil)\\n\\t\\tfmt.Println(\\\"New ring successfully created!\\\")\\n\\t} else {\\n\\t\\t// Ring EXISTS => JOIN ring\\n\\t\\tfmt.Println(\\\"\\\\nRing does EXISTS!\\\")\\n\\t\\tremoteIp := ipInRing[0]\\n\\t\\tremoteId := chord.Hash(remoteIp)\\n\\t\\tremoteNode := &chord.RemoteNode{\\n\\t\\t\\tIdentifier: remoteId,\\n\\t\\t\\tIP: remoteIp,\\n\\t\\t}\\n\\n\\t\\tchord.ChordNode.IP = myIp\\n\\t\\tchord.ChordNode.Identifier = myId\\n\\n\\t\\tfmt.Println(\\\"Joining ring via \\\", remoteId, \\\"(\\\", remoteIp, \\\")\\\")\\n\\t\\tchord.ChordNode.CreateNodeAndJoin(remoteNode)\\n\\t\\tfmt.Println(\\\"Node \\\", myId, \\\" successfully joined ring!\\\")\\n\\t}\\n\\n\\tend1 := time.Now()\\n\\tduration1 := end1.Sub(start1)\\n\\tfmt.Println(\\\"Test 1 COMPLETED!!!\\\\nDuration \\\", duration1)\\n\\tfmt.Println(\\\"------------------------------------------------------------------------------\\\\n \\\")\\n\\tchord.ChordNode.PrintNode()\\n}\",\n \"func MakeMaster(filePath string, nReduce int) *Master {\\n\\n\\tWriteDataIntoLists(filePath)\\n\\n\\t// fmt.Println(courseList)\\n\\t// fmt.Println(roomList)\\n\\t// fmt.Println(timeSlotList)\\n\\n\\tvar firstGeneration []Chrom\\n\\tfirstGeneration = CreateFirstGeneration(courseList, timeSlotList, roomList)\\n\\t//fmt.Println(len(firstGeneration))\\n\\t//PrintGeneration(firstGeneration)\\n\\t// for _, chrom := range firstGeneration {\\n\\t// \\tfor _, gene := range chrom.genes {\\n\\t// \\t\\tPrintGene(gene)\\n\\t// \\t}\\n\\t// }\\n\\n\\tbestFitValue := float64(0)\\n\\tbestChromId := 0\\n\\n\\tfor _, chrom := range firstGeneration {\\n\\t\\tif chrom.FitnessScore > bestFitValue {\\n\\t\\t\\tbestChromId = chrom.Id\\n\\t\\t\\tbestFitValue = chrom.FitnessScore\\n\\t\\t}\\n\\t}\\n\\n\\tprevGeneration = firstGeneration\\n\\n\\tbestChromInPrevGen := GetBestChromFromGen(prevGeneration)\\n\\twipGen = append(wipGen, bestChromInPrevGen)\\n\\tfmt.Println(\\\"------------------------------\\\")\\n\\tPrintGeneration(firstGeneration)\\n\\tfmt.Println(\\\"bestFitValue in initial generation is \\\", bestFitValue, \\\" chrom id is \\\", bestChromId)\\n\\n\\tm := Master{}\\n\\n\\tgo Monitor()\\n\\tm.server()\\n\\treturn &m\\n}\",\n \"func connectToMaster(u url.URL, done chan error) {\\n\\tdefer func() {\\n\\t\\tdone <- errors.New(\\\"Channel Closed\\\")\\n\\t}()\\n\\n\\tlog.Printf(\\\"connecting to %s\\\", u.String())\\n\\n\\tconn, _, err := websocket.DefaultDialer.Dial(u.String(), nil)\\n\\tif err != nil {\\n\\t\\tlog.Println(\\\"dial:\\\", err)\\n\\t\\treturn\\n\\t}\\n\\tlog.Println(\\\"connect to master: SUCCESS\\\")\\n\\tslave := &BackupSlave{conn: conn, send: make(chan []byte, 256)}\\n\\tgo slave.writeBackupSlavePump()\\n\\tslave.readBackupSlavePump()\\n\\n}\",\n \"func New(APIaddr string, requiredUserAgent string, requiredPassword string, nodeParams node.NodeParams, loadStartTime time.Time) (*Server, error) {\\n\\t// Wait for the node to be done loading.\\n\\tsrv, errChan := NewAsync(APIaddr, requiredUserAgent, requiredPassword, nodeParams, loadStartTime)\\n\\tif err := <-errChan; err != nil {\\n\\t\\t// Error occurred during async load. Close all modules.\\n\\t\\tif build.Release == \\\"standard\\\" {\\n\\t\\t\\tfmt.Println(\\\"ERROR:\\\", err)\\n\\t\\t}\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn srv, nil\\n}\",\n \"func Genesis() {\\n\\tserver.listen()\\n\\tserver.managePeers()\\n}\",\n \"func main() {\\n\\tnode := node.New(\\\"modbus\\\")\\n\\tconfig := NewConfig()\\n\\n\\tnode.OnConfig(updatedConfig(config))\\n\\twait := node.WaitForFirstConfig()\\n\\n\\terr := node.Connect()\\n\\tif err != nil {\\n\\t\\tlogrus.Error(err)\\n\\t\\treturn\\n\\t}\\n\\tlogrus.Info(\\\"Waiting for config from server\\\")\\n\\terr = wait()\\n\\tif err != nil {\\n\\t\\tlogrus.Error(err)\\n\\t\\treturn\\n\\t}\\n\\n\\tmodbusConnection := &Modbus{}\\n\\tlogrus.Infof(\\\"Connecting to modbus device: %s\\\", config.Device)\\n\\terr = modbusConnection.Connect()\\n\\n\\tif err != nil {\\n\\t\\tlogrus.Error(\\\"error connecting to modbus: \\\", err)\\n\\t\\treturn\\n\\t}\\n\\n\\tdefer modbusConnection.Close()\\n\\n\\tresults, _ := modbusConnection.ReadInputRegister(214)\\n\\tlog.Println(\\\"REG_HC_TEMP_IN1: \\\", results)\\n\\tresults, _ = modbusConnection.ReadInputRegister(215)\\n\\tlog.Println(\\\"REG_HC_TEMP_IN2: \\\", results)\\n\\tresults, _ = modbusConnection.ReadInputRegister(216)\\n\\tlog.Println(\\\"REG_HC_TEMP_IN3: \\\", results)\\n\\tresults, _ = modbusConnection.ReadInputRegister(217)\\n\\tlog.Println(\\\"REG_HC_TEMP_IN4: \\\", results)\\n\\tresults, _ = modbusConnection.ReadInputRegister(218)\\n\\tlog.Println(\\\"REG_HC_TEMP_IN5: \\\", binary.BigEndian.Uint16(results))\\n\\tresults, _ = modbusConnection.ReadInputRegister(207)\\n\\tlog.Println(\\\"REG_HC_TEMP_LVL: \\\", results)\\n\\tresults, _ = modbusConnection.ReadInputRegister(301)\\n\\tlog.Println(\\\"REG_DAMPER_PWM: \\\", results)\\n\\tresults, _ = modbusConnection.ReadInputRegister(204)\\n\\tlog.Println(\\\"REG_HC_WC_SIGNAL: \\\", results)\\n\\tresults, _ = modbusConnection.ReadInputRegister(209)\\n\\tlog.Println(\\\"REG_HC_TEMP_LVL1-5: \\\", results)\\n\\tresults, _ = modbusConnection.ReadInputRegister(101)\\n\\tlog.Println(\\\"100 REG_FAN_SPEED_LEVEL: \\\", results)\\n\\n\\t// connection := basenode.Connect()\\n\\tdev := &devices.Device{\\n\\t\\tName: \\\"modbusDevice\\\",\\n\\t\\tType: \\\"sensor\\\", // TODO if we add modbus write support we need to have another type\\n\\t\\tID: devices.ID{ID: \\\"1\\\"},\\n\\t\\tOnline: true,\\n\\t\\tTraits: []string{},\\n\\t\\tState: make(devices.State),\\n\\t}\\n\\n\\tnode.AddOrUpdate(dev)\\n\\n\\t// node.SetState(registers)\\n\\n\\t// This worker recives all incomming commands\\n\\tticker := time.NewTicker(30 * time.Second)\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase <-ticker.C:\\n\\t\\t\\tif len(config.Registers) == 0 {\\n\\t\\t\\t\\tlogrus.Info(\\\"no configured registers to poll yet\\\")\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tfetchRegisters(config.Registers, modbusConnection)\\n\\n\\t\\t\\tnewState := make(devices.State)\\n\\t\\t\\tfor _, v := range config.Registers {\\n\\t\\t\\t\\tnewState[v.Name] = v.Value\\n\\t\\t\\t}\\n\\t\\t\\tnode.UpdateState(dev.ID.ID, newState)\\n\\t\\tcase <-node.Stopped():\\n\\t\\t\\tticker.Stop()\\n\\t\\t\\tlog.Println(\\\"Stopping modbus node\\\")\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}\\n}\",\n \"func (m *Master) Start() error {\\n\\treturn m.start(\\\"-masterCfg\\\", join(m.masterRoot, \\\"master.cfg\\\"), \\\"-raftCfg\\\", join(m.masterRoot, \\\"raft.cfg\\\"))\\n}\",\n \"func init() {\\n\\tiHub = NewHub()\\n}\",\n \"func MakeMaster(files []string, nReduce int) *Master {\\n\\tm := Master{}\\n\\tm.nMap = len(files)\\n\\tm.ReduceOutNum = nReduce\\n\\tm.nReduce = 0\\n\\t// Your code here.\\n\\t// init task\\n\\tm.mapTasks = make([]Task, 0)\\n\\tm.reduceTasks = make([]Task, 0)\\n\\tm.reduceTaskFileLists = make([][]string, m.ReduceOutNum)\\n\\tm.hasGenerateReduceTasks = false\\n\\tinitMapTaskNum := len(files)\\n\\tfor i := 0; i < initMapTaskNum; i++ {\\n\\t\\tm.mapTasks = append(m.mapTasks, Task{Id: i, State: GENERATED, TaskKind: MAPTASK, MapTaskFile: files[i]})\\n\\t}\\n\\n\\tm.server()\\n\\treturn &m\\n}\",\n \"func startNodeCommunication(nodeAddress string, bc *Blockchain) {\\n\\tlistener, err := net.Listen(protocol, nodeAddress)\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\tdefer listener.Close()\\n\\n\\tfor {\\n\\t\\tconn, err := listener.Accept()\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Printf(\\\"Error: %s\\\\n\\\", err)\\n\\t\\t}\\n\\t\\tgo handleConnection(conn, bc)\\n\\t}\\n}\",\n \"func initClientReader(player *models.Player, host string) {\\n\\taddr := net.JoinHostPort(host, sendPort)\\n\\tlog.Printf(\\\"[Reader] Client is making a connection to %s\\\", addr)\\n\\n\\tconn, err := net.Dial(\\\"tcp\\\", addr)\\n\\tif err != nil {\\n\\t\\tlog.Fatal(err)\\n\\t}\\n\\n\\tlog.Printf(\\\"[Reader] Client is connected\\\")\\n\\n\\tgo addNewPlayer(player.Scene, conn)\\n}\",\n \"func MakeMaster(files []string, nReduce int) *Master {\\n\\tm := Master{\\n\\t\\tnReduce: nReduce,\\n\\t\\tmapTask: []Task{},\\n\\t\\tmasterState: newMaster,\\n\\t\\tend: false,\\n\\t}\\n\\n\\t// Your code here.\\n\\n\\tfor i, file := range files {\\n\\t\\tm.mapTask = append(m.mapTask, Task{\\n\\t\\t\\tType_: mapTask,\\n\\t\\t\\tId: i,\\n\\t\\t\\tFilename: file,\\n\\t\\t\\tState: initialState,\\n\\t\\t\\tNReduce: m.nReduce,\\n\\t\\t})\\n\\t}\\n\\n\\tgo m.server()\\n\\treturn &m\\n}\",\n \"func InitRedis() {\\n\\tclient = redis.NewClient(&redis.Options{\\n\\t\\tAddr: \\\"localhost:6379\\\", //default port of redis-server; lo-host when same machine\\n\\t})\\n\\n\\ttileClient = redis.NewClient(&redis.Options{\\n\\t\\tAddr: \\\"127.0.0.1:9851\\\",\\n\\t\\t// OnConnect: func(conn *redis.Conn) error {\\n\\t\\t//something here if needed on connect\\n\\t\\t// },\\n\\t})\\n\\n}\",\n \"func (e *Engine) becomeMaster() {\\n\\te.syncClient.disable()\\n\\te.notifier.SetSource(config.SourceServer)\\n\\n\\tif err := e.lbInterface.Up(); err != nil {\\n\\t\\tlog.Fatalf(\\\"Failed to bring LB interface up: %v\\\", err)\\n\\t}\\n}\",\n \"func createNodes(clusterSpec *ClusterSpec, role string, suffixNumberStart int, count int) error {\\n\\tfor suffix := suffixNumberStart; suffix < suffixNumberStart+count; suffix++ {\\n\\t\\tcontainerID := \\\"\\\"\\n\\t\\tvar err error\\n\\t\\tif role == \\\"agent\\\" {\\n\\t\\t\\tcontainerID, err = createWorker(clusterSpec, suffix)\\n\\t\\t} else if role == \\\"server\\\" {\\n\\t\\t\\tcontainerID, err = createServer(clusterSpec)\\n\\t\\t}\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Errorf(\\\"Failed to create %s-node\\\", role)\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\tlog.Infof(\\\"Created %s-node with ID %s\\\", role, containerID)\\n\\t}\\n\\treturn nil\\n}\",\n \"func MakeMaster(files []string, nReduce int) *Master {\\n\\tm := Master{}\\n\\tm.inputFiles = files\\n\\tm.nReduceTasks = nReduce\\n\\tm.init()\\n\\n\\tm.server()\\n\\treturn &m\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.66622347","0.64293945","0.6145258","0.60843116","0.597381","0.5962286","0.5953004","0.5896927","0.5833437","0.5825309","0.5784566","0.57775766","0.5761488","0.5743756","0.5732949","0.57158387","0.56984013","0.567924","0.56664616","0.5651798","0.56275845","0.5612432","0.56040823","0.559667","0.5552994","0.5542132","0.55356544","0.5530437","0.5521687","0.55215704","0.5497209","0.5467055","0.5459234","0.5457239","0.5420649","0.5407911","0.54068696","0.54032975","0.538186","0.53771824","0.5369971","0.53543395","0.53487563","0.5348469","0.53416467","0.5339597","0.5327963","0.5320998","0.53204054","0.5315996","0.5300286","0.5285585","0.5275063","0.5258566","0.5257299","0.52562886","0.524225","0.52305627","0.52220064","0.52101004","0.52074796","0.5205314","0.5202509","0.5198643","0.51969546","0.51957834","0.51909006","0.51877606","0.51835555","0.5182104","0.5176219","0.5174071","0.5173699","0.5172164","0.5168719","0.51661956","0.5149521","0.51465636","0.51383805","0.51346475","0.5132236","0.51249546","0.51221496","0.51190037","0.51183265","0.5117316","0.5115932","0.5114561","0.51095945","0.51070625","0.5106652","0.51034975","0.5102346","0.5101894","0.51018083","0.50941557","0.5090593","0.5089912","0.5088521","0.5087975"],"string":"[\n \"0.66622347\",\n \"0.64293945\",\n \"0.6145258\",\n \"0.60843116\",\n \"0.597381\",\n \"0.5962286\",\n \"0.5953004\",\n \"0.5896927\",\n \"0.5833437\",\n \"0.5825309\",\n \"0.5784566\",\n \"0.57775766\",\n \"0.5761488\",\n \"0.5743756\",\n \"0.5732949\",\n \"0.57158387\",\n \"0.56984013\",\n \"0.567924\",\n \"0.56664616\",\n \"0.5651798\",\n \"0.56275845\",\n \"0.5612432\",\n \"0.56040823\",\n \"0.559667\",\n \"0.5552994\",\n \"0.5542132\",\n \"0.55356544\",\n \"0.5530437\",\n \"0.5521687\",\n \"0.55215704\",\n \"0.5497209\",\n \"0.5467055\",\n \"0.5459234\",\n \"0.5457239\",\n \"0.5420649\",\n \"0.5407911\",\n \"0.54068696\",\n \"0.54032975\",\n \"0.538186\",\n \"0.53771824\",\n \"0.5369971\",\n \"0.53543395\",\n \"0.53487563\",\n \"0.5348469\",\n \"0.53416467\",\n \"0.5339597\",\n \"0.5327963\",\n \"0.5320998\",\n \"0.53204054\",\n \"0.5315996\",\n \"0.5300286\",\n \"0.5285585\",\n \"0.5275063\",\n \"0.5258566\",\n \"0.5257299\",\n \"0.52562886\",\n \"0.524225\",\n \"0.52305627\",\n \"0.52220064\",\n \"0.52101004\",\n \"0.52074796\",\n \"0.5205314\",\n \"0.5202509\",\n \"0.5198643\",\n \"0.51969546\",\n \"0.51957834\",\n \"0.51909006\",\n \"0.51877606\",\n \"0.51835555\",\n \"0.5182104\",\n \"0.5176219\",\n \"0.5174071\",\n \"0.5173699\",\n \"0.5172164\",\n \"0.5168719\",\n \"0.51661956\",\n \"0.5149521\",\n \"0.51465636\",\n \"0.51383805\",\n \"0.51346475\",\n \"0.5132236\",\n \"0.51249546\",\n \"0.51221496\",\n \"0.51190037\",\n \"0.51183265\",\n \"0.5117316\",\n \"0.5115932\",\n \"0.5114561\",\n \"0.51095945\",\n \"0.51070625\",\n \"0.5106652\",\n \"0.51034975\",\n \"0.5102346\",\n \"0.5101894\",\n \"0.51018083\",\n \"0.50941557\",\n \"0.5090593\",\n \"0.5089912\",\n \"0.5088521\",\n \"0.5087975\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.60488987"},"document_rank":{"kind":"string","value":"4"}}},{"rowIdx":990,"cells":{"query":{"kind":"string","value":"sends a message to every connected worker"},"document":{"kind":"string","value":"func (m *Master) Broadcast(msg *WorkerMessage) {\n\tm.nodeMu.RLock()\n\tlogger.Debug(\"Broadcast(%v): to %v nodes\", *msg, len(m.NodeHandles))\n\tfor _, nh := range m.NodeHandles {\n\t\tnh.BroadcastChan <- msg\n\t}\n\tm.nodeMu.RUnlock()\n\tlogger.Debug(\"Broadcast(): done\")\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func handleMessages(){\r\n\tfor{\r\n\t\t// get next message from broadcast channel\r\n\t\tmsg := <- broadcast\r\n\r\n\t\t// send message to each currently connected client\r\n\t\tfor client := range clients{\r\n\t\t\terr := client.WriteJSON(msg)\r\n\r\n\t\t\tif err != nil{\r\n\t\t\t\tlog.Println(\"@ handleMessages()\");\r\n\t\t\t\tlog.Printf(\"error: %v\", err)\r\n\t\t\t\tclient.Close()\r\n\t\t\t\tdelete(clients, client)\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}","func (this Client) emit(message interface{}) {\n mu.Lock()\n for _, client := range clients {\n websocket.JSON.Send(client.Websocket, message)\n }\n mu.Unlock()\n}","func (s *Websocket) broadcast(msg models.Message) {\n\ts.hmu.RLock()\n\n\tfor _, receiver := range s.hub {\n\t\tif err := receiver.Conn.WriteJSON(msg); err != nil {\n\t\t\ts.logger.Errorf(\"error sending message: %v\", err)\n\t\t\tcontinue\n\t\t}\n\t}\n\n\ts.history = append(s.history, msg)\n\tif err := s.historyRepo.Add(msg); err != nil {\n\t\ts.logger.Errorf(\"error writing history to db: %v\", err)\n\t}\n\n\ts.hmu.RUnlock()\n}","func handleMessages() {\n\tfor {\n\t\tmsg := <-broadcaster\n\n\t\tstoreInRedis(msg)\n\t\tmessageClients(msg)\n\t}\n}","func (h *Hub) run() {\n\tfor {\n\t\tselect {\n\t\t// register a new client to a specific ws connection\n\t\tcase client := <-h.register:\n\t\t\th.clients[client] = true\n\t\t\tclient.send <- &Message{\n\t\t\t\tbroadcast: []byte(fmt.Sprintf(`{\"id\": \"%s\"}`, client.key)),\n\t\t\t}\n\t\t// de-register existing client\n\t\tcase client := <-h.unregister:\n\t\t\tif _, ok := h.clients[client]; ok {\n\t\t\t\tdelete(h.clients, client)\n\t\t\t\tclose(client.send)\n\t\t\t}\n\t\t// send message to each client\n\t\tcase message := <-h.broadcast:\n\t\t\tfor client := range h.clients {\n\t\t\t\t// don't send to creator of the broadcast\n\t\t\t\tif client.key == message.senderKey {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tselect {\n\t\t\t\tcase client.send <- message:\n\t\t\t\tdefault:\n\t\t\t\t\tclose(client.send)\n\t\t\t\t\tdelete(h.clients, client)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}","func worker() {\n\tworker, err := zmq4.NewSocket(zmq4.DEALER)\n\tif err != nil {\n\t\tlog.Fatalln(err)\n\t}\n\n\tdefer worker.Close()\n\tworker.Connect(\"inproc://backend\")\n\n\tfor {\n\t\tmsg, err := worker.RecvMessage(0)\n\t\tif err != nil {\n\t\t\tlog.Println(err)\n\t\t}\n\n\t\tid, content := pop(msg)\n\n\t\treplies := rand.Intn(5)\n\t\tfor reply := 0; reply < replies; reply++ {\n\t\t\ttime.Sleep(time.Duration(rand.Intn(1000)+1) * time.Millisecond)\n\t\t\tworker.SendMessage(id, content)\n\t\t}\n\t}\n}","func SendWorker(ch chan RemoteCommandMessage, broadlink broadlinkrm.Broadlink, wg *sync.WaitGroup) {\n\tfor msg := range ch {\n\t\tfor _, cmd := range msg.commands {\n\t\t\tswitch cmd.commandType {\n\t\t\tcase SendCommand:\n\t\t\t\terr := broadlink.Execute(cmd.target, cmd.data)\n\t\t\t\tif err != nil {\n\t\t\t\t\tlog.Printf(\"Error executing command: %v\", err)\n\t\t\t\t}\n\t\t\tcase Pause:\n\t\t\t\tinterval, err := strconv.Atoi(cmd.data)\n\t\t\t\tif err != nil {\n\t\t\t\t\tlog.Printf(\"Error processing pause interval (%v): %v\", cmd.data, err)\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\ttime.Sleep(time.Duration(interval) * time.Millisecond)\n\t\t\tcase shutdown:\n\t\t\t\twg.Done()\n\t\t\t\tlog.Print(\"SendWorker terminated\")\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n}","func (server *Server) Broadcast(msg string) {\n\tfor _, socket := range server.connections {\n\t\tgo func(ws *websocket.Conn) {\n\t\t\twebsocket.Message.Send(ws, msg)\n\t\t}(socket)\n\t}\n}","func broadcastMessage(msg protocol.Message) {\n\tencoded := msg.Encode()\n\tfor _, c := range clientHolder.GetClients() {\n\t\tc.conn.Write(encoded)\n\t}\n}","func Worker() {\n\tlog.Println(\"Starting listening for messages to publish to datawarehouse\")\n\tfor {\n\t\tdataToPublish := <- DatawarehouseChannel\n\t\tpublishToDW(dataToPublish.TopicId, dataToPublish.Data, dataToPublish.Info)\n\t\ttime.Sleep(300*time.Second)\n\t}\n}","func (w *websocketPeer) sendHandler() {\n\tdefer close(w.writerDone)\n\tfor msg := range w.wr {\n\t\tif msg == nil {\n\t\t\treturn\n\t\t}\n\t\tb, err := w.serializer.Serialize(msg.(wamp.Message))\n\t\tif err != nil {\n\t\t\tw.log.Print(err)\n\t\t}\n\n\t\tif err = w.conn.WriteMessage(w.payloadType, b); err != nil {\n\t\t\tif !wamp.IsGoodbyeAck(msg) {\n\t\t\t\tw.log.Print(err)\n\t\t\t}\n\t\t}\n\t}\n}","func handleMessages() {\n\tfor {\n\t\tmsg := <-broadcast // grab next msg for broadcast\n\t\tfor client := range clients { // send to all clients\n\t\t\terr := client.WriteJSON(msg)\n\t\t\tif err != nil {\n\t\t\t\tlog.Printf(\"error: %v\", err)\n\t\t\t\tclient.Close()\n\t\t\t\tdelete(clients, client)\n\t\t\t}\n\t\t}\n\t}\n}","func (c *connection) sendLoop() {\n\tc.group.Add(1)\n\tvar id int\n\tfor msg := range c.out {\n\t\ttime.Sleep(0)\n\t\tid = int(msg[0])\n\t\tif id == c.myId {\n\t\t\tc.in <- msg\n\t\t} else {\n\t\t\tif id >= len(c.peers) {\n\t\t\t\tgo func() {\n\t\t\t\t\ttime.Sleep(time.Millisecond * 500)\n\t\t\t\t\tc.out <- msg\n\t\t\t\t}()\n\t\t\t} else {\n\t\t\t\tmsg[0] = 1\n\n\t\t\t\twrite(c.peers[id].conn, msg)\n\t\t\t}\n\t\t}\n\t}\n\tc.running = false\n\tc.group.Done()\n\tc.group.Wait()\n\tclose(c.in)\n}","func (si ServerInstance) SendAll(message Message) {\n\t\n\tsi.clientsMutex.Lock()\n\t\n\tfor id, conn := range si.Clients {\n\t\tencoder := gob.NewEncoder(conn)\n\t\tif err := encoder.Encode(message); err != nil {\n\t\t\tfmt.Printf(\n\t\t\t\t\"Server Error (message encoding ): encoding message = [%v] for sending to client with id = [%v], error = [%v]\\n\",\n\t\t\t\tmessage, id, err)\n\t\t}\n\t}\n\t\n\tsi.clientsMutex.Unlock()\n}","func wsChanSend() {\n\tlog.Println(\"wschan running...\")\n\ti := 1\n\tfor {\n\t\t// send stuff to clients\n\t\t// TODO: solve multiple clients connecting\n\t\twsChan <- \"test: \" + strconv.Itoa(i)\n\t\ti++\n\t}\n}","func handleMessages() {\n\tfor {\n\t\t// Grab the next message from the broadcast channel\n\t\tmsg := <-broadcast\n\n\t\t// Send it out to every client that is currently connected\n\t\tfor client := range clients {\n\t\t\terr := client.WriteJSON(msg)\n\t\t\tif err != nil {\n\t\t\t\tlog.Printf(\"error: %v\", err)\n\t\t\t\tclient.Close()\n\t\t\t\tdelete(clients, client)\n\t\t\t}\n\t\t}\n\t}\n}","func (c *client) write() {\n\tfor {\n\t\ttoWrite := <-c.send\n\t\t_ = c.conn.WriteMessage(websocket.BinaryMessage, toWrite)\n\t}\n}","func broadcast(message string) {\n\tfor _, socket := range server.Sockets() {\n\t\tsocket.Write(message)\n\t}\n}","func (c *Client) listenWrite() {\n for {\n select {\n\n // send message to the client\n case msg := <-c.ch:\n websocket.JSON.Send(c.ws, msg)\n\n // receive done request\n case <-c.doneCh:\n c.grid.Del(c)\n c.doneCh <- true // for listenRead method\n return\n }\n }\n}","func broadcastMessage(currentConn *WebSocketConnection, kind, message string) {\n\tfor _, eachConn := range connections {\n\t\tif eachConn == currentConn {\n\t\t\tcontinue\n\t\t}\n\n\t\t//for every connection other than itself, use the WriteJSON method provided by websocket to publish new messages\n\t\teachConn.WriteJSON(SocketResponse{\n\t\t\tFrom: currentConn.Username,\n\t\t\tType: kind,\n\t\t\tMessage: message,\n\t\t})\n\t}\n}","func broadcast(msg string) {\n\tisBroadcasted[msg] = false\n\tbroadcastMsg := &Message{}\n\tbroadcastMsg.Broadcast = msg\n\tfor _, conn := range connections{\n\t\tgo send(broadcastMsg, conn)\n\t}\n}","func (w *Worker) write() {\n\tvar id = w.ID\n\n\tw.Swarm.Logchan.Info <- \"Worker [\" + id + \"] started listening to write channel.\"\n\nloop:\n\tfor {\n\t\tw.Swarm.Logchan.Info <- \"Worker [\" + id + \"] listening to write...\"\n\t\tselect {\n\t\tcase <-w.killedWrite:\n\t\t\tbreak loop\n\n\t\tcase data := <-w.WriteData:\n\t\t\tw.Swarm.Logchan.Message <- string(log.NewMessage(id, data, false).JSON())\n\t\t\tw.Writer.WriteString(data)\n\t\t\tw.Writer.Flush()\n\t\t}\n\t}\n\n\tw.Swarm.Logchan.Info <- \"Worker [\" + id + \"] write channel closed.\"\n}","func (r *Repeater) broadcast(message []byte) error {\n\t// TODO: 1. multithreading 2. asynchronous sending\n\th := r.Hub()\n\tfor client := range h.clients {\n\t\tselect {\n\t\tcase client.send <- message:\n\t\tdefault:\n\t\t\tclose(client.send)\n\t\t\tdelete(h.clients, client)\n\t\t}\n\t}\n\n\treturn nil\n}","func (h *Hub) run() {\n\tfor {\n\t\tselect {\n\t\tcase client := <-h.register:\n\t\t\th.clients[client] = true\n\t\tcase client := <-h.unregister:\n\t\t\tif _, ok := h.clients[client]; ok {\n\t\t\t\tdelete(h.clients, client)\n\t\t\t\tclose(client.send)\n\t\t\t}\n\t\tcase message := <-h.broadcast:\n\t\t\tfor client := range h.clients {\n\t\t\t\tselect {\n\t\t\t\tcase client.send <- message:\n\t\t\t\tdefault:\n\t\t\t\t\tclose(client.send)\n\t\t\t\t\tdelete(h.clients, client)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}","func (m *Manager) enrichWorker(workerID int, jobs <-chan *RawMessage, results chan<- result) {\n\tfor j := range jobs {\n\t\tlog.Printf(\"worker %+v started job %+v\", workerID, j.UUID)\n\t\tenrichedItem, err := m.enricher.EnrichMessage(j, time.Now().UTC())\n\t\t// quit app if error isn't nil\n\t\tif err != nil {\n\t\t\tos.Exit(1)\n\t\t}\n\t\ttime.Sleep(time.Second)\n\t\tlog.Printf(\"worker %+v finished job %+v\", workerID, j.UUID)\n\t\tresults <- result{id: workerID, enrichedItem: enrichedItem}\n\t}\n}","func (c *Channel) SendLoop() {\n\tfor msg := range c.Messages {\n\t\tif !c.Alive {\n\t\t\treturn\n\t\t}\n\t\tc.LogF(\"Sending msg `%s` to `%d` members in `%s`\", msg, len(c.Members), c.GetName())\n\t\tfor _, v := range c.Members {\n\t\t\tv.Write(msg)\n\t\t}\n\t}\n}","func (lbc *loadBalancerController) worker() {\n\tfor {\n\t\tkey, _ := lbc.queue.Get()\n\t\tglog.Infof(\"Sync triggered by service %v\", key)\n\t\tif err := lbc.sync(false); err != nil {\n\t\t\tglog.Infof(\"Requeuing %v because of error: %v\", key, err)\n\t\t\tlbc.queue.Add(key)\n\t\t} else {\n\t\t\tlbc.queue.Done(key)\n\t\t}\n\t}\n}","func (this User) broadcast(message interface{}) {\n mu.Lock()\n for _, client := range clients {\n if client.User.Id != this.Id {\n websocket.JSON.Send(client.Websocket, message)\n }\n }\n mu.Unlock()\n}","func (room *Room) broadcastToClientsInRoom(message []byte) {\n\tfor client := range room.clients {\n\t\tclient.send <- message\n\t}\n}","func (h *hub) run() {\n for {\n select{\n case s := <- h.register:\n // fmt.Println(\"wild client has appeared in the brush!\")\n clients := h.channels[s.channel]\n if clients == nil {\n clients = make(map[*client]bool)\n h.channels[s.channel] = clients\n }\n h.channels[s.channel][s.client] = true\n //send the latest data for room (empty string if new room)\n //s.client.send <- []byte(contents[s.channel])\n case s := <- h.unregister:\n clients := h.channels[s.channel]\n if clients != nil {\n if _, ok := clients[s.client]; ok{\n delete(clients, s.client)\n close(s.client.send)\n if len(clients) == 0 {\n delete(h.channels, s.channel)\n if len(contents[s.channel]) != 0 {\n //delete contents for channel if no more clients using it.\n delete(contents, s.channel)\n }\n }\n }\n }\n case m := <- h.broadcast:\n clients := h.channels[m.channel]\n // fmt.Println(\"broadcasting message to \", clients, \"data is: \", string(m.data))\n for c := range clients {\n fmt.Println(\"broadcasting message to \", c, \"data is: \", string(m.data))\n select {\n case c.send <- m.data:\n contents[m.channel] = string(m.data)\n default:\n close(c.send)\n delete(clients, c)\n if len(clients) == 0 {\n delete(h.channels, m.channel)\n if len(contents[m.channel]) != 0 {\n //delete contents for channel if no more clients using it.\n delete(contents, m.channel)\n }\n }\n }\n }\n }\n }\n}","func (w *Worker) Work() {\n\tfor {\n\t\tselect {\n\t\tcase <-w.done:\n\t\t\treturn\n\t\tdefault:\n\t\t\tevent := <-w.channel\n\t\t\tw.writeToBuffer(event)\n\t\t}\n\t}\n}","func worker(clients <-chan api.Client) {\n\tfor c := range clients {\n\t\tlog.Printf(\"Fetching metrics from %s\", c.GetHost())\n\t\terr := c.FetchInventoryMetrics()\n\t\tif err != nil {\n\t\t\tlog.Printf(\"Error updating %s: %v\", c.GetHost(), err)\n\t\t}\n\t}\n}","func (s *Server) Run() {\n\tfor {\n\t\tselect {\n\t\tcase msg := <-s.broadcast:\n\t\t\tfor conn, m := range s.clients {\n\t\t\t\tm.Lock()\n\t\t\t\tconn.WriteMessage(websocket.TextMessage, msg)\n\t\t\t\tm.Unlock()\n\t\t\t}\n\t\tcase conn := <-s.add:\n\t\t\ts.clients[conn] = new(sync.Mutex)\n\t\t\tgo s.listen(conn)\n\t\tcase conn := <-s.del:\n\t\t\tif _, ok := s.clients[conn]; ok {\n\t\t\t\tdelete(s.clients, conn)\n\t\t\t}\n\t\t}\n\t}\n}","func broadcastMessage(payload _message, logMessage string) {\n\tfor _, v := range peers {\n\t\t// fmt.Println(\"Sending to\", v)\n\t\tgo sendToAddr(payload, v, logMessage)\n\t}\n}","func (g *game) broadcast(msg []byte) {\n\tfor i := 0; i < len(g.Players); i++ {\n\t\tif g.Players[i].Connection != nil {\n\t\t\tg.Players[i].Connection.Outbound <- msg\n\t\t}\n\t}\n}","func (h *hub) update() {\n\t//send each channel its client state\n\tfor c := range h.connections {\n\t\tmsg := c.client.GetMessage()\n\t\tc.ws.WriteMessage(websocket.BinaryMessage, msg)\n\t}\n}","func SendToWorker(job *lib.JobRequest) {\n\tworkChannel <- job\n}","func (h *Hub) SendAll(messageType int, data []byte) {\n\tlogger.Info.Println(\"message delivered to all:\", string(data), \"message type:\", messageType)\n\tfor client, _ := range h.Clients {\n\t\tclient.WriteMessage(messageType, data)\n\t}\n}","func (s *senderQueue) send(incoming []byte) {\n\tdefer s.wg.Done()\n\tdefer s.workers.Release()\n\n\tlogging.Debug(s.logger).Log(logging.MessageKey(), \"Sending message...\")\n\n\terr := s.connection.WriteMessage(websocket.BinaryMessage, incoming)\n\tif err != nil {\n\t\tlogging.Error(s.logger, emperror.Context(err)...).\n\t\t\tLog(logging.MessageKey(), \"Failed to send message\",\n\t\t\t\tlogging.ErrorKey(), err.Error(),\n\t\t\t\t\"msg\", string(incoming))\n\t\treturn\n\t}\n\n\tlogging.Debug(s.logger).Log(logging.MessageKey(), \"Message Sent\")\n}","func sendLoop() {\n\tif currentWebsocket == nil {\n\t\tcolorLog(\"[INFO] BW: No connection, wait for it.\\n\")\n\t\tcmd := <-connectChannel\n\t\tif \"QUIT\" == cmd.Action {\n\t\t\treturn\n\t\t}\n\t}\n\n\tfor {\n\t\tnext, ok := <-toBrowserChannel\n\t\tif !ok {\n\t\t\tcolorLog(\"[WARN] BW: Send channel was closed.\\n\")\n\t\t\tbreak\n\t\t}\n\n\t\tif \"QUIT\" == next.Action {\n\t\t\tbreak\n\t\t}\n\n\t\tif currentWebsocket == nil {\n\t\t\tcolorLog(\"[INFO] BW: No connection, wait for it.\\n\")\n\t\t\tcmd := <-connectChannel\n\t\t\tif \"QUIT\" == cmd.Action {\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\twebsocket.JSON.Send(currentWebsocket, &next)\n\t\tcolorLog(\"[SUCC] BW: Sent %v.\\n\", next)\n\t}\n\n\tcolorLog(\"[WARN] BW: Exit send loop.\\n\")\n}","func (s *Server) Fire(data []byte) error {\n\tfor _, w := range s.workers {\n\t\t_, err := w.Write(data)\n\n\t\treturn err\n\t}\n\n\treturn nil\n}","func MsgServer(ws *websocket.Conn) {\r\n\tvar message string\r\n\t// all.(ws)\r\n\talive := true\r\n\tallconnections = append(allconnections, ws)\r\n\tfor {\r\n\t\twebsocket.Message.Receive(ws, &message)\r\n\t\tfor i, aWs := range allconnections {\r\n\r\n\t\t\tif _, err := aWs.Write([]byte(message)); err != nil {\r\n\t\t\t\tlog.Println(\"Error!!: \", err)\r\n\t\t\t\taWs.Close()\r\n\t\t\t\tallconnections = remove(allconnections, i)\r\n\t\t\t\talive = false\r\n\r\n\t\t\t}\r\n\r\n\t\t}\r\n\t\tlog.Println(\"I hope I didn't crash: \")\r\n\t\tif !alive {\r\n\t\t\tbreak\r\n\t\t}\r\n\t}\r\n}","func (broker *Broker) Serve(w http.ResponseWriter, flusher http.Flusher) {\n\tmessageChan := make(chan *msg.Msg)\n\tbroker.newClients <- messageChan\n\n\tnotify := w.(http.CloseNotifier).CloseNotify()\n\tgo func() {\n\t\t<-notify\n\t\tclose(messageChan)\n\t}()\n\n\tdefer func() {\n\t\tbroker.closingClients <- messageChan\n\t}()\n\n\tfor _, obj := range broker.cache {\n\t\tsendMsg(w, flusher, msg.New(\"add\", obj))\n\t}\n\n\tpingTicker := time.NewTicker(5 * time.Second)\n\nloop:\n\tfor {\n\t\tselect {\n\t\tcase <-pingTicker.C:\n\t\t\tsendText(w, flusher, \"event: ping\")\n\t\tcase m, open := <-messageChan:\n\t\t\tif !open {\n\t\t\t\tbreak loop\n\t\t\t}\n\t\t\tsendMsg(w, flusher, m)\n\t\t}\n\t}\n}","func (r *Room) BroadcastAll(msg []byte) {\n\tfor _, client := range r.Clients {\n\t\tclient.WriteMessage(msg)\n\t}\n}","func broadcast(channels []chan message, msg message) {\n\tfor _, channel := range channels {\n\t\tchannel <- msg\n\t}\n}","func (h *adminHub) Broadcast(message []byte) error {\n\th.RLock()\n\tdefer h.RUnlock()\n\tmsg := NewQueuedMessage(message, true)\n\tfor _, c := range h.connections {\n\t\terr := c.Send(msg)\n\t\tif err != nil {\n\t\t\tlogger.ERROR.Println(err)\n\t\t}\n\t}\n\treturn nil\n}","func (w *WSHandler) Serve() {\n\tfor {\n\t\tc := w.GetConnection()\n\t\tCONNS[c] = true\n\t\tc.ReadMessage()\n\t}\n}","func (s *Websocket) system(text string) {\n\tmsg := models.Message{\n\t\tID: 0,\n\t\tSender: \"system\",\n\t\tReceiver: \"\",\n\t\tText: text,\n\t\tCreatedAt: time.Now(),\n\t}\n\n\ts.hmu.RLock()\n\n\tfor _, receiver := range s.hub {\n\t\tif err := receiver.Conn.WriteJSON(msg); err != nil {\n\t\t\ts.logger.Errorf(\"error sending message: %v\", err)\n\t\t\tcontinue\n\t\t}\n\t}\n\n\ts.hmu.RUnlock()\n}","func worker(id int, games <-chan Game) {\n\tfmt.Printf(\"Worker initialised ID:%v\\n\", id)\n\tfor g := range games {\n\t\tfmt.Printf(\"Worker running ID:%v\\n\", id)\n\t\tplayGame(g)\n\t\tfmt.Printf(\"Worker complete ID:%v\\n\", id)\n\t}\n}","func (h *mysqlMetricStore) sendmessage() {\n\th.lock.Lock()\n\tdefer h.lock.Unlock()\n\tvar caches = new(MonitorMessageList)\n\tfor _, v := range h.PathCache {\n\t\t_, avg, max := calculate(&v.ResTime)\n\t\tmm := MonitorMessage{\n\t\t\tServiceID: h.ServiceID,\n\t\t\tPort: h.Port,\n\t\t\tMessageType: \"mysql\",\n\t\t\tKey: v.Key,\n\t\t\tHostName: h.HostName,\n\t\t\tCount: v.Count,\n\t\t\tAbnormalCount: v.UnusualCount,\n\t\t\tAverageTime: Round(avg, 2),\n\t\t\tMaxTime: Round(max, 2),\n\t\t\tCumulativeTime: Round(avg*float64(v.Count), 2),\n\t\t}\n\t\tcaches.Add(&mm)\n\t}\n\tsort.Sort(caches)\n\tif caches.Len() > 20 {\n\t\th.monitorMessageManage.Send(caches.Pop(20))\n\t\treturn\n\t}\n\th.monitorMessageManage.Send(caches)\n}","func (c *Client) writePump() {\n\tfor {\n\t\tmessage, ok := <-c.send\n\t\tfmt.Println(\"new messsage incoming\")\n\n\t\tif !ok {\n\t\t\t// The hub closed the channel.\n\t\t\tfmt.Println(\"error in message\")\n\t\t\tc.conn.WriteMessage(websocket.CloseMessage, []byte{})\n\t\t\treturn\n\t\t}\n\n\t\tc.conn.WriteMessage(websocket.TextMessage, message)\n\t\tfmt.Println(\"sent message!\")\n\t}\n}","func (server *Server) send(client *Client) {\n\tdefer client.socket.Close()\n\tencoder := json.NewEncoder(client.socket)\n\tfor {\n\t\tselect {\n\t\tcase job, ok := <-client.data:\n\t\t\tif !ok {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tencoder.Encode(job)\n\t\t}\n\t}\n}","func (c *Client) Send(ch <-chan *Message) error {\n\tfor msg := range ch {\n\t\t_, err := io.WriteString(c.conn, msg.Content)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}","func (c *Client) writePump() {\n\tticker := time.NewTicker(pingPeriod)\n\tdefer func() {\n\t\tticker.Stop()\n\t\tc.conn.Close()\n\t}()\n\tfor {\n\t\tselect {\n\t\tcase message, ok := <-c.send:\n\t\t\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\n\t\t\tif !ok {\n\t\t\t\t// The hub closed the channel.\n\t\t\t\tc.conn.WriteMessage(websocket.CloseMessage, []byte{})\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tw, err := c.conn.NextWriter(websocket.TextMessage)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tw.Write(message)\n\n\t\t\t//// Add queued chat messages to the current websocket message.\n\t\t\t//n := len(c.send)\n\t\t\t//for i := 0; i < n; i++ {\n\t\t\t//\tw.Write(newline)\n\t\t\t//\tw.Write(<-c.send)\n\t\t\t//}\n\n\t\t\tif err := w.Close(); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\tcase <-ticker.C:\n\t\t\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\n\t\t\tif err := c.conn.WriteMessage(websocket.PingMessage, nil); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n}","func (r *Room) broadcastMsg(msg string) {\n\tr.RLock()\n\tdefer r.RUnlock()\n\tfor _, wc := range r.clients {\n\t\tgo func(wc chan<- string) {\n\t\t\twc <- msg\n\t\t}(wc)\n\t}\n}","func (h *Hub) SendToAll(data []byte) {\n\th.mux.Lock()\n\tdefer h.mux.Unlock()\n\tfor conn := range h.conns {\n\t\th.Send(conn, data, websocket.TextMessage)\n\t}\n}","func (broker *Broker) Run() {\n\tfor {\n\t\tselect {\n\t\tcase client := <-broker.Register:\n\t\t\tbroker.Clients[client] = true\n\t\t\tlog.Printf(\"Broker room %s: connect, size %d \", broker.Name, len(broker.Clients))\n\n\t\t\tfor client := range broker.Clients {\n\t\t\t\tclient.Conn.WriteMessage(1, []byte(\"Connected\"))\n\t\t\t}\n\t\t\tbreak\n\t\tcase client := <-broker.Unregister:\n\t\t\tdelete(broker.Clients, client)\n\t\t\tlog.Printf(\"Broker room %s: disconnect, size %d \", broker.Name, len(broker.Clients))\n\t\t\tif len(broker.Clients) == 0 && broker.Room.Status != \"ongoing\" {\n\t\t\t\tdatastore.DeleteGame(broker.Room.RoomCode)\n\t\t\t}\n\n\t\t\tfor client := range broker.Clients {\n\t\t\t\tclient.Conn.WriteMessage(1, []byte(\"Disconnected\"))\n\t\t\t}\n\t\t\tbreak\n\t\tcase move := <-broker.Broadcast:\n\t\t\tlog.Printf(\"Broker room %s, Move received: %+v\\n\", broker.Name, move)\n\t\t\t// Process move according to game rules and update state\n\t\t\tbroker.Room = rules.ProcessRules(move, broker.Room)\n\t\t\t// Save game state after the move is processed\n\t\t\tdatastore.UpdateGame(broker.Room)\n\n\t\t\tfor client := range broker.Clients {\n\t\t\t\tif err := client.Conn.WriteJSON(broker.Room); err != nil {\n\t\t\t\t\tlog.Println(err)\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}","func (s *Server) Worker(queue *Queue, srv Server_SubscribeServer) {\n\t// temp imitate unsibscribe\n\tvar exit = make(chan (struct{}))\n\ttime.AfterFunc(time.Second*10, func() { exit <- struct{}{} })\n\n\tfor {\n\t\tselect {\n\t\tcase <-exit:\n\t\t\tfmt.Println(\"Exit\")\n\t\t\ts.wg.Done()\n\t\t\treturn\n\t\tdefault:\n\t\t\tif queue.messages.Len() > 0 {\n\t\t\t\tel := queue.messages.Back()\n\t\t\t\tval := el.Value\n\n\t\t\t\tmessage, ok := val.(*Message)\n\t\t\t\tif ok {\n\t\t\t\t\tresp := &SubscribeResponse{QueueName: queue.queueName, Message: message}\n\n\t\t\t\t\tif err := srv.Send(resp); err != nil {\n\t\t\t\t\t\tfmt.Println(err)\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tqueue.messages.Remove(el)\n\t\t\t}\n\t\t}\n\t}\n\n}","func (b *base) broadcast(message *socket.RawMessage) {\n\tfor i := range b.connections {\n\t\tsocket.SendQueueMessageSocketID(*message, b.connections[i].socketID)\n\t}\n\tlog.Printf(\"[Match] -> Message %d broadcasted, Match: %s\", message.MessageType, b.info.ID)\n}","func (c *client) send() {\nLoop:\n\tfor {\n\t\tmsg, err := readInput(c.Conn, \"\")\n\t\tif err != nil {\n\t\t\tpanic(err)\n\t\t}\n\n\t\tif msg == \"/quit\" {\n\t\t\tc.close()\n\t\t\tlog.Printf(\"%v has left..\", c.Name)\n\t\t\tbreak Loop\n\t\t}\n\n\t\t// Check if the message is a command.\n\t\tif c.command(msg) {\n\t\t\t// If the client is currently not connected to a room\n\t\t\tif c.Room == \"\"{\n\t\t\t\tlog.Printf(\"Error: \" + c.Name + \" is not in a room\")\n\t\t\t\twriteFormattedMsg(c.Conn, \"You are currently not in a room, please join a room.\")\n\t\t\t}else {\n\t\t\t\t// Client is connected to a room and the input is a regular message.\n\t\t\t\tlog.Printf(\"send: msg: %v from: %s\", msg, c.Name)\n\t\t\t\tsend := time.Now().Format(customTime) + \" * (\" + c.Name + \"): \\\"\" + msg + \"\\\"\"\n\n\t\t\t\t// Add message to the chat rooms history.\n\t\t\t\troomList[c.Room].history = append(roomList[c.Room].history, send)\n\n\t\t\t\t// Send out message to all clients connected to the current room.\n\t\t\t\tfor _, v := range roomList {\n\t\t\t\t\tfor k := range v.members {\n\t\t\t\t\t\tif k == c.Conn.RemoteAddr().String() {\n\t\t\t\t\t\t\tv.messages <- send\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}","func (s *Server) broadcast(ctx context.Context) {\n\tfor res := range s.Broadcast {\n\t\ts.Clients.Broadcast(res)\n\t}\n}","func (c *ControlConsumer) Send(message *ControlMessage) error {\n\n\tfor _, channel := range c.Channels {\n\t\tchannel <- message\n\t}\n\n\treturn nil\n}","func (c *Client) writePump() {\n\tticker := time.NewTicker(pingPeriod)\n\tdefer func() {\n\t\tticker.Stop()\n\t\tc.ws.Close()\n\t}()\n\tfor {\n\t\tselect {\n\t\tcase message, ok := <-c.send:\n\t\t\t// spew.Dump(c.clientID)\n\t\t\tc.ws.SetWriteDeadline(time.Now().Add(writeWait))\n\t\t\tif !ok {\n\t\t\t\t// The hub closed the channel.\n\t\t\t\tc.ws.WriteMessage(websocket.CloseMessage, []byte{})\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tw, err := c.ws.NextWriter(websocket.TextMessage)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tw.Write(message)\n\n\t\t\t// Add queued chat messages to the current websocket message.\n\t\t\tn := len(c.send)\n\t\t\tfor i := 0; i < n; i++ {\n\t\t\t\tw.Write(newline)\n\t\t\t\tw.Write(<-c.send)\n\t\t\t}\n\n\t\t\tif err := w.Close(); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\tcase <-ticker.C:\n\t\t\tc.ws.SetWriteDeadline(time.Now().Add(writeWait))\n\t\t\tif err := c.ws.WriteMessage(websocket.PingMessage, nil); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n}","func (c *Client) writePump() {\n\tticker := time.NewTicker(pingPeriod)\n\tdefer func() {\n\t\tticker.Stop()\n\t\tc.conn.Close()\n\t}()\n\tfor {\n\t\tselect {\n\t\tcase message, ok := <-c.send:\n\t\t\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\n\t\t\tif !ok {\n\t\t\t\t// The hub closed the channel.\n\t\t\t\tc.conn.WriteMessage(websocket.CloseMessage, []byte{})\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tw, err := c.conn.NextWriter(websocket.TextMessage)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tw.Write(message)\n\n\t\t\t// Add queued chat messages to the current websocket message.\n\t\t\tn := len(c.send)\n\t\t\tfor i := 0; i < n; i++ {\n\t\t\t\tw.Write(newline)\n\t\t\t\tw.Write(<-c.send)\n\t\t\t}\n\n\t\t\tif err := w.Close(); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\tcase <-ticker.C:\n\t\t\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\n\t\t\tif err := c.conn.WriteMessage(websocket.PingMessage, nil); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n}","func (c *MultiClusterController) worker() {\n\tfor c.processNextWorkItem() {\n\t}\n}","func worker(worker int){\n\t// Recibir string del channel\n\tvalor := <- recursos\n\n\t//Imprimir el valor\n\tfmt.Printf(\"Worker: %d : %s\\n\", worker, valor)\n\n\t//Poner el string de regreso\n\trecursos <- valor\n}","func (m *ConnManager) Broadcast(conn *websocket.Conn, msg *Message) {\n\tm.Foreach(func(k, v interface{}) {\n\t\tif c, ok := v.(*websocket.Conn); ok && c != conn {\n\t\t\tif err := websocket.JSON.Send(c, msg); err != nil {\n\t\t\t\tfmt.Println(\"Send msg error: \", err)\n\t\t\t}\n\t\t}\n\t})\n}","func (s *Subscriber) writeMessage() {\n ticker := time.NewTicker(pingPeriod)\n defer func() {\n ticker.Stop()\n s.close()\n }()\n for {\n select {\n case m, ok := <- s.send:\n if !ok {\n s.write(websocket.CloseMessage, []byte{})\n return\n }\n if err := s.write(websocket.TextMessage, m); err != nil {\n return\n }\n case <-ticker.C:\n if err := s.write(websocket.PingMessage, []byte{}); err != nil {\n return\n }\n }\n }\n}","func sendMessageAll(conn net.Conn, mess string) {\n\tfor key := range connMap {\n\t\tif connMap[key] != conn {\n\t\t\tconnMap[key].Write([]byte(\"TCCHAT_BCAST\\t\" + userMap[conn] + \"\\t\" + mess + \"\\n\"))\n\t\t}\n\t}\n}","func (a *API) Notify(userID uint, msg *model.Message) {\n\tif clients, ok := a.getClients(userID); ok {\n\t\tgo func() {\n\t\t\tfor _, c := range clients {\n\t\t\t\tc.write <- msg\n\t\t\t}\n\t\t}()\n\t}\n}","func websocketEventLoop(s *state.State) {\n\tfor {\n\t\tdata := <-s.Data\n\t\tfor client := range clients {\n\t\t\t// send data in separate go routine\n\t\t\tgo func(s *state.State, clients map[*websocket.Conn]bool, client *websocket.Conn, data []byte) {\n\t\t\t\terr := client.WriteMessage(websocket.TextMessage, data)\n\t\t\t\tif err != nil {\n\t\t\t\t\ts.Log.Warnln(\"[websocket] error sending message to client\", err)\n\t\t\t\t\tdelete(clients, client)\n\t\t\t\t}\n\t\t\t}(s, clients, client, data)\n\t\t}\n\t}\n}","func (w *Worker) Run() {\n\tconn := w.Pool.Get()\n\tdefer conn.Close()\n\n\tvar msgs = make([]Impression, 0, w.Size)\n\ttick := time.NewTicker(w.Interval)\n\n\tw.verbose(\"active\")\n\n\tfor {\n\t\tselect {\n\t\tcase msg := <-w.Queue:\n\t\t\tw.verbose(\"buffer (%d/%d) %v\", len(msgs), w.Size, msg)\n\t\t\tmsgs = append(msgs, msg)\n\t\t\tif len(msgs) >= w.Size {\n\t\t\t\tw.verbose(\"exceeded %d messages – flushing\", w.Size)\n\t\t\t\tw.send(conn, msgs)\n\t\t\t\tmsgs = make([]Impression, 0, w.Size)\n\t\t\t}\n\t\tcase <-tick.C:\n\t\t\tif len(msgs) > 0 {\n\t\t\t\tw.verbose(\"interval reached - flushing %d\", len(msgs))\n\t\t\t\tw.send(conn, msgs)\n\t\t\t\tmsgs = make([]Impression, 0, w.Size)\n\t\t\t} else {\n\t\t\t\tw.verbose(\"interval reached – nothing to send\")\n\t\t\t}\n\t\tcase <-w.quit:\n\t\t\ttick.Stop()\n\t\t\tw.verbose(\"exit requested – draining msgs\")\n\t\t\t// drain the msg channel.\n\t\t\tfor msg := range w.Queue {\n\t\t\t\tw.verbose(\"buffer (%d/%d) %v\", len(msgs), w.Size, msg)\n\t\t\t\tmsgs = append(msgs, msg)\n\t\t\t}\n\t\t\tw.verbose(\"exit requested – flushing %d\", len(msgs))\n\t\t\tw.send(conn, msgs)\n\t\t\tw.verbose(\"exit\")\n\t\t\tw.shutdown <- struct{}{}\n\t\t\treturn\n\t\t}\n\t}\n}","func (r *Room) SendBroadcast(msg Message) {\n\tfor _, client := range r.clients {\n\t\tclient.WriteMessage(msg)\n\t}\n}","func runWorker(ch <-chan func()) {\n\tfor {\n\t\tf := <-ch\n\t\tf()\n\t}\n}","func (c *Client) writePump() {\n\tticker := time.NewTicker(pingPeriod)\n\tdefer func() {\n\t\tticker.Stop()\n\t\tfmt.Println(\"Closing writePump\")\n\t}()\n\tfor {\n\t\tselect {\n\t\tcase message, ok := <-c.send:\n\t\t\tif !c.isAlive {\n\t\t\t\tfmt.Printf(\"Channel closed\")\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\n\t\t\tif !ok {\n\t\t\t\t// The hub closed the channel.\n\t\t\t\tc.conn.WriteMessage(websocket.CloseMessage, []byte{})\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tw, err := c.conn.NextWriter(websocket.TextMessage)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tw.Write(message)\n\n\t\t\t// Add queued chat messages to the current websocket message.\n\t\t\tn := len(c.send)\n\t\t\tfor i := 0; i < n; i++ {\n\t\t\t\tw.Write(newline)\n\t\t\t\tw.Write(<-c.send)\n\t\t\t}\n\n\t\t\tif err := w.Close(); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\tcase <-ticker.C:\n\t\t\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\n\t\t\tif err := c.conn.WriteMessage(websocket.PingMessage, nil); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n}","func (c *Connection) writePump() {\n\tticker := time.NewTicker(pingPeriod)\n\tdefer func() {\n\t\tticker.Stop()\n\t\tc.conn.Close()\n\t}()\n\tfor {\n\t\tselect {\n\t\tcase message, ok := <-c.send:\n\t\t\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\n\t\t\tif !ok {\n\t\t\t\t// The hub closed the channel.\n\t\t\t\tc.conn.WriteMessage(websocket.CloseMessage, []byte{})\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tw, err := c.conn.NextWriter(websocket.TextMessage)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tw.Write(message)\n\n\t\t\t// Add queued chat messages to the current websocket message.\n\t\t\tn := len(c.send)\n\t\t\tfor i := 0; i < n; i++ {\n\t\t\t\tw.Write(<-c.send)\n\t\t\t}\n\n\t\t\tif err := w.Close(); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\tcase <-ticker.C:\n\t\t\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\n\t\t\tif err := c.conn.WriteMessage(websocket.PingMessage, nil); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n}","func worker() {\n\tgo func() {\n\t\tfor {\n\t\t\tselect {\n\t\t\tcase job := <-jobs:\n\t\t\t\tupdate(job)\n\t\t\t}\n\t\t}\n\t}()\n}","func (c *Client) Run() {\n\tfor {\n\t\tselect {\n\t\tcase conn := <-c.register:\n\t\t\tc.connections[conn] = true\n\t\t\tgo conn.writePump()\n\t\t\tgo conn.readPump()\n\t\tcase conn := <-c.unregister:\n\t\t\tif _, ok := c.connections[conn]; ok {\n\t\t\t\tdelete(c.connections, conn)\n\t\t\t\tclose(conn.send)\n\t\t\t\tif len(c.connections) <= 0 {\n\t\t\t\t\tc.hub.unregister <- c.id\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t}\n\t\tcase incomingMessage := <-c.outbox:\n\t\t\tc.hub.messages <- incomingMessage\n\t\tcase outcomingMessage := <-c.inbox:\n\t\t\tfor conn := range c.connections {\n\t\t\t\tmsgBytes, err := outcomingMessage.GetData()\n\t\t\t\tif err != nil {\n\t\t\t\t\tlog.Println(\"invalid message data\")\n\t\t\t\t} else {\n\t\t\t\t\tconn.send <- msgBytes\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\t}\n}","func ws_SendMsg(ws *websocket.Conn, send_channel SendChannel) {\n\tfor {\n\t\tselect {\n\t\tcase send_msg := <-send_channel.containers:\n\t\t\tlog.Printf(\"[%s] containers sendMessage= \", __FILE__, send_msg)\n\t\t\twebsocket.JSON.Send(ws, send_msg)\n\t\tcase send_msg := <-send_channel.updateinfo:\n\t\t\tlog.Printf(\"[%s] update sendMessage=\", __FILE__, send_msg)\n\t\t}\n\t}\n}","func echo() {\n\tfor {\n\t\tval := <-broadcast\n\t\t// latlong := fmt.Sprintf(\"%f %f %s\", val.Lat, val.Long)\n\t\t// send to every client that is currently connected\n\t\tfor client := range clients {\n\t\t\terr := client.WriteMessage(websocket.TextMessage, []byte(val))\n\t\t\tif err != nil {\n\t\t\t\tlog.Printf(\"Websocket error: %s\", err)\n\t\t\t\tclient.Close()\n\t\t\t\tdelete(clients, client)\n\t\t\t}\n\t\t}\n\t}\n}","func runMessaging(ctx context.Context, wg *sync.WaitGroup, n *Node) {\n\n\tdefer wg.Done()\n\n\tfor _, client := range n.messaging.clients {\n\t\twg.Add(1)\n\t\tgo client.run(ctx, wg, n)\n\t}\n\n\twg.Add(1)\n\tgo n.messaging.server.run(ctx, wg, n)\n\n}","func (c *UserClientWS) writePump() {\n\tticker := time.NewTicker(pingPeriod)\n\tdefer func() {\n\t\tticker.Stop()\n\t\tc.conn.Close()\n\t}()\n\tfor {\n\t\tselect {\n\t\tcase message, ok := <-c.send:\n\t\t\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\n\t\t\tif !ok {\n\t\t\t\t// The hub closed the channel.\n\t\t\t\tc.conn.WriteMessage(websocket.CloseMessage, []byte{})\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tw, err := c.conn.NextWriter(websocket.TextMessage)\n\t\t\tif err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tw.Write(message)\n\n\t\t\t// Add queued chat messages to the current websocket message.\n\t\t\t/*n := len(c.send)\n\t\t\tfor i := 0; i < n; i++ {\n\t\t\t\tw.Write(newline)\n\t\t\t\tw.Write(<-c.send)\n\t\t\t}*/\n\n\t\t\tif err := w.Close(); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\tcase <-ticker.C:\n\t\t\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\n\t\t\tif err := c.conn.WriteMessage(websocket.PingMessage, nil); err != nil {\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n}","func (s *TCPServer) broadcast(msg *Msg) {\n\tlog.Printf(\"p2p server: broadcasting %s message to peers\\n\", msg.Mtype)\n\tfor _, p := range s.peers {\n\t\tselect {\n\t\tcase p.in <- msg:\n\t\tdefault:\n\t\t\tbreak\n\t\t}\n\t}\n}","func (hub *Hub) Run() () {\n\tfor {\n\t\tselect {\n\t\t\tcase conn := <- hub.Register:\n\t\t\t\tif oldConn, ok := hub.Clients[conn.Id]; ok {\n\t\t\t\t\t_ = oldConn.Conn.Close()\n\t\t\t\t}\n\t\t\t\thub.Clients[conn.Id] = conn\n\t\t\t\tfmt.Println(\"registering a client \" + conn.Id)\n\n\t\t\tcase conn := <- hub.Unregister:\n\t\t\t\tif oldConn, ok := hub.Clients[conn.Id]; ok {\n\t\t\t\t\t_ = oldConn.Conn.Close()\n\t\t\t\t}\n\n\t\t\tcase messageToSend := <- hub.Broadcast:\n\t\t\t\t/*\n\t\t\t\t\tfirst look for the client connection from the dictionary\n\t\t\t\t\tif there is such connection send to the user\n\t\t\t\t */\n\t\t\t\tif conn, ok := hub.Clients[messageToSend.ReceiverId]; ok {\n\t\t\t\t\t/*\n\t\t\t\t\t\tconvert the message to byte and send byte to the receiver connection\n\t\t\t\t\t */\n\t\t\t\t\tif messageByte, err := messageToSend.ConvertToByte(); err != nil {\n\t\t\t\t\t\tselect {\n\t\t\t\t\t\t\tcase conn.Send <- messageByte:\n\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t/*\n\t\t\t\t\t\t\t\t\tthis means, an error has occurred while sending a message\n\t\t\t\t\t\t\t\t\t\twhich indicates that the client connection is no more valid\n\t\t\t\t\t\t\t\t\t\tthen remove it from the dictionary\n\t\t\t\t\t\t\t\t */\n\t\t\t\t\t\t\t\tclose(conn.Send)\n\t\t\t\t\t\t\t\tdelete(hub.Clients, conn.Id)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\n\t}\n}","func (r *Room) broadcastMsg(msg string) {\n\tr.RLock()\n\tdefer r.RUnlock()\n\tfor _, cc := range r.clients {\n\t\tgo func(ch chan<- string) {\n\t\t\tch <- msg\n\t\t}(cc)\n\t}\n}","func (client *wsClient) writeMessages() {\n\tdefer client.conn.Close()\n\tdefer log.Println(\"writeMessages exiting\")\n\tfor {\n\t\t// Read a message from the outbound channel\n\t\tmsg := <-client.outboundMsgs\n\t\t// Send message to the browser\n\t\terr := client.conn.WriteMessage(websocket.TextMessage, msg)\n\t\tif err != nil {\n\t\t\tlog.Println(\"writeMessages: \", err)\n\t\t\treturn\n\t\t}\n\t}\n}","func sendAll(count int, c chan int64) {\n\tfor i :=0; i < count; i++ {\n\t\tc <- 1\n\t}\n}","func (h *wsHub) send(message []byte) {\n\th.broadcast <- message\n}","func workerTask() {\n\tworker, err := zmq4.NewSocket(zmq4.REQ)\n\tif err != nil {\n\t\tlog.Fatalln(err)\n\t}\n\n\tdefer worker.Close()\n\tworker.Connect(\"ipc://backend.ipc\")\n\tworker.SendMessage(WorkerReady)\n\n\tfor {\n\n\t\tmsg, err := worker.RecvMessage(0)\n\t\tif err != nil {\n\t\t\tlog.Fatalln(err)\n\t\t}\n\n\t\tmsg[len(msg)-1] = \"OK\"\n\t\tworker.SendMessage(msg)\n\t}\n\n}","func (c *client) write() {\n\tfor msg := range c.send {\n\t\tif err := c.socket.WriteMessage(websocket.TextMessage, msg); err != nil {\n\t\t\tbreak\n\t\t}\n\t}\n\tc.socket.Close()\n}","func Worker(conn *websocket.Conn, user *models.User) {\n\n\tg, _ := game.GetGameByID(*user.GameID)\n\n\tdefer game.DeleteGame(g)\n\tplayer := g.Player1\n\n\tif g.Player1 == user {\n\t\tplayer = g.Player2\n\t}\n\n\tif player == nil {\n\t\treturn\n\t}\n\n\tfor {\n\n\t\tmt, message, err := conn.ReadMessage()\n\t\tif err != nil {\n\t\t\tlog.Printf(\"JSON Parse error user %s info: %#v\", err, user.UserID)\n\t\t\t//delete(clients, ws)\n\t\t\tif g.State == models.RUNNING {\n\t\t\t\tresp := models.GameResp{}\n\t\t\t\tresp.Type = \"opponentLeft\"\n\t\t\t\tplayer.Conn.WriteJSON(resp)\n\t\t\t\tconn.Close()\n\t\t\t\tg.State = models.ABANDONED\n\t\t\t}\n\t\t\tgame.DeleteUser(user)\n\n\t\t\tbreak\n\t\t}\n\t\tlog.Printf(\"message %s\", string(message))\n\t\t/*send the data received to player 2*/\n\t\tif player == nil {\n\t\t\tlog.Println(\"nil player\")\n\t\t} else {\n\t\t\tlog.Printf(\"sending message to %s\", player.UserID)\n\t\t\tplayer.Conn.WriteMessage(mt, []byte(message))\n\t\t}\n\t}\n\n}","func (s *Socket) WriteMsg() {\r\n\tfor {\r\n\t\tselect {\r\n\t\tcase data := <-s.WriteChan:\r\n\t\t\tpref := intToBytes(len(data))\r\n\t\t\tvar buffer bytes.Buffer\r\n\t\t\tbuffer.Write(pref)\r\n\t\t\tbuffer.Write(data)\r\n\t\t\t_, err := s.Conn.Write(buffer.Bytes())\r\n\t\t\tif err != nil {\r\n\t\t\t\tfmt.Println(\"Send Error,\", err)\r\n\t\t\t}\r\n\t\tcase <-s.Ctx.Done():\r\n\t\t\tfmt.Println(\"Quit WriteMsg()\")\r\n\t\t\treturn\r\n\t\t}\r\n\t}\r\n}","func (c *Client) worker(workerID string) {\n\tc.wg.Add(1)\n\n\ttimeout := make(chan bool, 1)\n\tloopControl := true\n\n\tgo func() {\n\t\tfor {\n\t\t\tif c.run == false {\n\t\t\t\ttimeout <- true\n\t\t\t\tbreak\n\t\t\t}\n\t\t\ttime.Sleep(time.Second)\n\t\t}\n\t}()\n\n\tmq, err := rabbitmq.NewClient(c.mqConfig)\n\tif err != nil {\n\t\tc.log.Sugar().Errorw(\"rabbitmq connect failed\", \"worker_id\", workerID, \"error\", err.Error())\n\t\t<-c.register\n\t\tc.wg.Done()\n\t\ttime.Sleep(time.Millisecond * 5)\n\t\treturn\n\t}\n\tdefer mq.Close()\n\n\tmsgs, err := mq.Consume(\"async_ff_telemetry_queue\", \"\", false, false, false, false, nil)\n\tif err != nil {\n\t\tc.log.Sugar().Errorw(\"queue declare failed\", \"worker_id\", workerID, \"error\", err.Error())\n\t\t<-c.register\n\t\tc.wg.Done()\n\t\ttime.Sleep(time.Millisecond * 5)\n\t\treturn\n\t}\n\n\tc.log.Sugar().Debugw(\"worker started\", \"worker_id\", workerID)\n\n\tfor loopControl {\n\t\tselect {\n\t\tcase <-timeout:\n\t\t\tloopControl = false\n\t\tcase task := <-msgs:\n\t\t\tstart := time.Now().Unix()\n\t\t\tstate := \"good\"\n\n\t\t\tif len(task.Body) < 1 {\n\t\t\t\tstate = \"badmq\"\n\t\t\t\tloopControl = false\n\t\t\t\tc.log.Sugar().Errorw(\"message queue failed\", \"worker_id\", workerID)\n\t\t\t} else {\n\t\t\t\tif err := c.process(&task); err != nil {\n\t\t\t\t\tstate = \"bad\"\n\t\t\t\t\tc.log.Sugar().Errorw(\"task process failed\", \"worker_id\", workerID, \"error\", err.Error())\n\t\t\t\t}\n\t\t\t}\n\n\t\t\ttask.Ack(false)\n\n\t\t\tc.log.Sugar().Debugw(\"telemetry processed\", \"worker_id\", workerID)\n\n\t\t\tc.prometheus.IncTelemetryProcessCount(state)\n\t\t\tc.prometheus.ObserveProcessDuration(start)\n\t\t}\n\t}\n\n\tc.log.Sugar().Debugw(\"worker stopped\", \"worker_id\", workerID)\n\n\t<-c.register\n\tc.wg.Done()\n}","func (client *Client) sendMessage(msg interface{}) {\n\tstr, err := json.Marshal(msg)\n\tif err != nil {\n\t\tfmt.Println(err)\n\t}\n\ts := string(str)\n\tmetrics.SendMessage(len(s))\n\tclient.socketTx <- s\n}","func (s *remoteSealer) notifyWork() {\n\twork := s.currentWork\n\tblob, _ := json.Marshal(work)\n\ts.reqWG.Add(len(s.notifyURLs))\n\tfor _, url := range s.notifyURLs {\n\t\tgo s.sendNotification(s.notifyCtx, url, blob, work)\n\t}\n}","func (h *Hub) Run() {\n\tfor {\n\t\tselect {\n\t\tcase client := <-h.register:\n\t\t\th.clients[client] = true\n\t\tcase client := <-h.unregister:\n\t\t\tif _, ok := h.clients[client]; ok {\n\t\t\t\tdelete(h.clients, client)\n\t\t\t\tclose(client.send)\n\t\t\t}\n\t\tcase message := <-h.broadcast:\n\t\t\tfor client := range h.clients {\n\t\t\t\tselect {\n\t\t\t\tcase client.send <- message:\n\t\t\t\tdefault:\n\t\t\t\t\tclose(client.send)\n\t\t\t\t\tdelete(h.clients, client)\n\t\t\t\t}\n\t\t\t}\n\t\tcase message := <-h.onMessage:\n\t\t\tvar msg Msg\n\t\t\tjson.NewDecoder(bytes.NewReader(message)).Decode(msg)\n\t\t\tvar fns = h.listeners[msg.Type]\n\n\t\t\tfor _, fn := range fns {\n\t\t\t\tfn(msg.Data)\n\t\t\t}\n\t\t}\n\t}\n}","func (ls *LogStreamer) worker(ctx context.Context, id int) {\n\tls.logger.Debug(\"[LogStreamer/Worker#%d] Worker is starting...\", id)\n\n\tctx, setStat, done := status.AddSimpleItem(ctx, fmt.Sprintf(\"Log Streamer Worker %d\", id))\n\tdefer done()\n\tsetStat(\"🏃 Starting...\")\n\n\tfor {\n\t\tsetStat(\"⌚️ Waiting for chunk\")\n\n\t\t// Get the next chunk (pointer) from the queue. This will block\n\t\t// until something is returned.\n\t\tchunk := <-ls.queue\n\n\t\t// If the next chunk is nil, then there is no more work to do\n\t\tif chunk == nil {\n\t\t\tbreak\n\t\t}\n\n\t\tsetStat(\"📨 Passing chunk to callback\")\n\n\t\t// Upload the chunk\n\t\terr := ls.callback(ctx, chunk)\n\t\tif err != nil {\n\t\t\tatomic.AddInt32(&ls.chunksFailedCount, 1)\n\n\t\t\tls.logger.Error(\"Giving up on uploading chunk %d, this will result in only a partial build log on Buildkite\", chunk.Order)\n\t\t}\n\n\t\t// Signal to the chunkWaitGroup that this one is done\n\t\tls.chunkWaitGroup.Done()\n\t}\n\n\tls.logger.Debug(\"[LogStreamer/Worker#%d] Worker has shutdown\", id)\n}","func WsSend(channel, message string) (err error) {\n\tfor cs, _ := range ActiveClients[channel] {\n\t\terr = websocket.Message.Send(cs.websocket, message)\n\t\tif err != nil {\n\t\t\tlog.Println(channel, \"Could not send message to \", cs.clientIP, err.Error())\n\t\t}\n\t}\n\treturn\n}","func (tcp *Server) Broadcast(msgId int64, data []byte) {\n\tfor _, client := range tcp.clients {\n\t\tclient.AsyncSend(msgId, data)\n\t}\n}","func (s *Server) SendAll(msg *Message) {\n\ts.sendAllCh <- msg\n}"],"string":"[\n \"func handleMessages(){\\r\\n\\tfor{\\r\\n\\t\\t// get next message from broadcast channel\\r\\n\\t\\tmsg := <- broadcast\\r\\n\\r\\n\\t\\t// send message to each currently connected client\\r\\n\\t\\tfor client := range clients{\\r\\n\\t\\t\\terr := client.WriteJSON(msg)\\r\\n\\r\\n\\t\\t\\tif err != nil{\\r\\n\\t\\t\\t\\tlog.Println(\\\"@ handleMessages()\\\");\\r\\n\\t\\t\\t\\tlog.Printf(\\\"error: %v\\\", err)\\r\\n\\t\\t\\t\\tclient.Close()\\r\\n\\t\\t\\t\\tdelete(clients, client)\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\\r\\n}\",\n \"func (this Client) emit(message interface{}) {\\n mu.Lock()\\n for _, client := range clients {\\n websocket.JSON.Send(client.Websocket, message)\\n }\\n mu.Unlock()\\n}\",\n \"func (s *Websocket) broadcast(msg models.Message) {\\n\\ts.hmu.RLock()\\n\\n\\tfor _, receiver := range s.hub {\\n\\t\\tif err := receiver.Conn.WriteJSON(msg); err != nil {\\n\\t\\t\\ts.logger.Errorf(\\\"error sending message: %v\\\", err)\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t}\\n\\n\\ts.history = append(s.history, msg)\\n\\tif err := s.historyRepo.Add(msg); err != nil {\\n\\t\\ts.logger.Errorf(\\\"error writing history to db: %v\\\", err)\\n\\t}\\n\\n\\ts.hmu.RUnlock()\\n}\",\n \"func handleMessages() {\\n\\tfor {\\n\\t\\tmsg := <-broadcaster\\n\\n\\t\\tstoreInRedis(msg)\\n\\t\\tmessageClients(msg)\\n\\t}\\n}\",\n \"func (h *Hub) run() {\\n\\tfor {\\n\\t\\tselect {\\n\\t\\t// register a new client to a specific ws connection\\n\\t\\tcase client := <-h.register:\\n\\t\\t\\th.clients[client] = true\\n\\t\\t\\tclient.send <- &Message{\\n\\t\\t\\t\\tbroadcast: []byte(fmt.Sprintf(`{\\\"id\\\": \\\"%s\\\"}`, client.key)),\\n\\t\\t\\t}\\n\\t\\t// de-register existing client\\n\\t\\tcase client := <-h.unregister:\\n\\t\\t\\tif _, ok := h.clients[client]; ok {\\n\\t\\t\\t\\tdelete(h.clients, client)\\n\\t\\t\\t\\tclose(client.send)\\n\\t\\t\\t}\\n\\t\\t// send message to each client\\n\\t\\tcase message := <-h.broadcast:\\n\\t\\t\\tfor client := range h.clients {\\n\\t\\t\\t\\t// don't send to creator of the broadcast\\n\\t\\t\\t\\tif client.key == message.senderKey {\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tselect {\\n\\t\\t\\t\\tcase client.send <- message:\\n\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\tclose(client.send)\\n\\t\\t\\t\\t\\tdelete(h.clients, client)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func worker() {\\n\\tworker, err := zmq4.NewSocket(zmq4.DEALER)\\n\\tif err != nil {\\n\\t\\tlog.Fatalln(err)\\n\\t}\\n\\n\\tdefer worker.Close()\\n\\tworker.Connect(\\\"inproc://backend\\\")\\n\\n\\tfor {\\n\\t\\tmsg, err := worker.RecvMessage(0)\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Println(err)\\n\\t\\t}\\n\\n\\t\\tid, content := pop(msg)\\n\\n\\t\\treplies := rand.Intn(5)\\n\\t\\tfor reply := 0; reply < replies; reply++ {\\n\\t\\t\\ttime.Sleep(time.Duration(rand.Intn(1000)+1) * time.Millisecond)\\n\\t\\t\\tworker.SendMessage(id, content)\\n\\t\\t}\\n\\t}\\n}\",\n \"func SendWorker(ch chan RemoteCommandMessage, broadlink broadlinkrm.Broadlink, wg *sync.WaitGroup) {\\n\\tfor msg := range ch {\\n\\t\\tfor _, cmd := range msg.commands {\\n\\t\\t\\tswitch cmd.commandType {\\n\\t\\t\\tcase SendCommand:\\n\\t\\t\\t\\terr := broadlink.Execute(cmd.target, cmd.data)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\tlog.Printf(\\\"Error executing command: %v\\\", err)\\n\\t\\t\\t\\t}\\n\\t\\t\\tcase Pause:\\n\\t\\t\\t\\tinterval, err := strconv.Atoi(cmd.data)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\tlog.Printf(\\\"Error processing pause interval (%v): %v\\\", cmd.data, err)\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttime.Sleep(time.Duration(interval) * time.Millisecond)\\n\\t\\t\\tcase shutdown:\\n\\t\\t\\t\\twg.Done()\\n\\t\\t\\t\\tlog.Print(\\\"SendWorker terminated\\\")\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (server *Server) Broadcast(msg string) {\\n\\tfor _, socket := range server.connections {\\n\\t\\tgo func(ws *websocket.Conn) {\\n\\t\\t\\twebsocket.Message.Send(ws, msg)\\n\\t\\t}(socket)\\n\\t}\\n}\",\n \"func broadcastMessage(msg protocol.Message) {\\n\\tencoded := msg.Encode()\\n\\tfor _, c := range clientHolder.GetClients() {\\n\\t\\tc.conn.Write(encoded)\\n\\t}\\n}\",\n \"func Worker() {\\n\\tlog.Println(\\\"Starting listening for messages to publish to datawarehouse\\\")\\n\\tfor {\\n\\t\\tdataToPublish := <- DatawarehouseChannel\\n\\t\\tpublishToDW(dataToPublish.TopicId, dataToPublish.Data, dataToPublish.Info)\\n\\t\\ttime.Sleep(300*time.Second)\\n\\t}\\n}\",\n \"func (w *websocketPeer) sendHandler() {\\n\\tdefer close(w.writerDone)\\n\\tfor msg := range w.wr {\\n\\t\\tif msg == nil {\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tb, err := w.serializer.Serialize(msg.(wamp.Message))\\n\\t\\tif err != nil {\\n\\t\\t\\tw.log.Print(err)\\n\\t\\t}\\n\\n\\t\\tif err = w.conn.WriteMessage(w.payloadType, b); err != nil {\\n\\t\\t\\tif !wamp.IsGoodbyeAck(msg) {\\n\\t\\t\\t\\tw.log.Print(err)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func handleMessages() {\\n\\tfor {\\n\\t\\tmsg := <-broadcast // grab next msg for broadcast\\n\\t\\tfor client := range clients { // send to all clients\\n\\t\\t\\terr := client.WriteJSON(msg)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tlog.Printf(\\\"error: %v\\\", err)\\n\\t\\t\\t\\tclient.Close()\\n\\t\\t\\t\\tdelete(clients, client)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (c *connection) sendLoop() {\\n\\tc.group.Add(1)\\n\\tvar id int\\n\\tfor msg := range c.out {\\n\\t\\ttime.Sleep(0)\\n\\t\\tid = int(msg[0])\\n\\t\\tif id == c.myId {\\n\\t\\t\\tc.in <- msg\\n\\t\\t} else {\\n\\t\\t\\tif id >= len(c.peers) {\\n\\t\\t\\t\\tgo func() {\\n\\t\\t\\t\\t\\ttime.Sleep(time.Millisecond * 500)\\n\\t\\t\\t\\t\\tc.out <- msg\\n\\t\\t\\t\\t}()\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tmsg[0] = 1\\n\\n\\t\\t\\t\\twrite(c.peers[id].conn, msg)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tc.running = false\\n\\tc.group.Done()\\n\\tc.group.Wait()\\n\\tclose(c.in)\\n}\",\n \"func (si ServerInstance) SendAll(message Message) {\\n\\t\\n\\tsi.clientsMutex.Lock()\\n\\t\\n\\tfor id, conn := range si.Clients {\\n\\t\\tencoder := gob.NewEncoder(conn)\\n\\t\\tif err := encoder.Encode(message); err != nil {\\n\\t\\t\\tfmt.Printf(\\n\\t\\t\\t\\t\\\"Server Error (message encoding ): encoding message = [%v] for sending to client with id = [%v], error = [%v]\\\\n\\\",\\n\\t\\t\\t\\tmessage, id, err)\\n\\t\\t}\\n\\t}\\n\\t\\n\\tsi.clientsMutex.Unlock()\\n}\",\n \"func wsChanSend() {\\n\\tlog.Println(\\\"wschan running...\\\")\\n\\ti := 1\\n\\tfor {\\n\\t\\t// send stuff to clients\\n\\t\\t// TODO: solve multiple clients connecting\\n\\t\\twsChan <- \\\"test: \\\" + strconv.Itoa(i)\\n\\t\\ti++\\n\\t}\\n}\",\n \"func handleMessages() {\\n\\tfor {\\n\\t\\t// Grab the next message from the broadcast channel\\n\\t\\tmsg := <-broadcast\\n\\n\\t\\t// Send it out to every client that is currently connected\\n\\t\\tfor client := range clients {\\n\\t\\t\\terr := client.WriteJSON(msg)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tlog.Printf(\\\"error: %v\\\", err)\\n\\t\\t\\t\\tclient.Close()\\n\\t\\t\\t\\tdelete(clients, client)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (c *client) write() {\\n\\tfor {\\n\\t\\ttoWrite := <-c.send\\n\\t\\t_ = c.conn.WriteMessage(websocket.BinaryMessage, toWrite)\\n\\t}\\n}\",\n \"func broadcast(message string) {\\n\\tfor _, socket := range server.Sockets() {\\n\\t\\tsocket.Write(message)\\n\\t}\\n}\",\n \"func (c *Client) listenWrite() {\\n for {\\n select {\\n\\n // send message to the client\\n case msg := <-c.ch:\\n websocket.JSON.Send(c.ws, msg)\\n\\n // receive done request\\n case <-c.doneCh:\\n c.grid.Del(c)\\n c.doneCh <- true // for listenRead method\\n return\\n }\\n }\\n}\",\n \"func broadcastMessage(currentConn *WebSocketConnection, kind, message string) {\\n\\tfor _, eachConn := range connections {\\n\\t\\tif eachConn == currentConn {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\t//for every connection other than itself, use the WriteJSON method provided by websocket to publish new messages\\n\\t\\teachConn.WriteJSON(SocketResponse{\\n\\t\\t\\tFrom: currentConn.Username,\\n\\t\\t\\tType: kind,\\n\\t\\t\\tMessage: message,\\n\\t\\t})\\n\\t}\\n}\",\n \"func broadcast(msg string) {\\n\\tisBroadcasted[msg] = false\\n\\tbroadcastMsg := &Message{}\\n\\tbroadcastMsg.Broadcast = msg\\n\\tfor _, conn := range connections{\\n\\t\\tgo send(broadcastMsg, conn)\\n\\t}\\n}\",\n \"func (w *Worker) write() {\\n\\tvar id = w.ID\\n\\n\\tw.Swarm.Logchan.Info <- \\\"Worker [\\\" + id + \\\"] started listening to write channel.\\\"\\n\\nloop:\\n\\tfor {\\n\\t\\tw.Swarm.Logchan.Info <- \\\"Worker [\\\" + id + \\\"] listening to write...\\\"\\n\\t\\tselect {\\n\\t\\tcase <-w.killedWrite:\\n\\t\\t\\tbreak loop\\n\\n\\t\\tcase data := <-w.WriteData:\\n\\t\\t\\tw.Swarm.Logchan.Message <- string(log.NewMessage(id, data, false).JSON())\\n\\t\\t\\tw.Writer.WriteString(data)\\n\\t\\t\\tw.Writer.Flush()\\n\\t\\t}\\n\\t}\\n\\n\\tw.Swarm.Logchan.Info <- \\\"Worker [\\\" + id + \\\"] write channel closed.\\\"\\n}\",\n \"func (r *Repeater) broadcast(message []byte) error {\\n\\t// TODO: 1. multithreading 2. asynchronous sending\\n\\th := r.Hub()\\n\\tfor client := range h.clients {\\n\\t\\tselect {\\n\\t\\tcase client.send <- message:\\n\\t\\tdefault:\\n\\t\\t\\tclose(client.send)\\n\\t\\t\\tdelete(h.clients, client)\\n\\t\\t}\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func (h *Hub) run() {\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase client := <-h.register:\\n\\t\\t\\th.clients[client] = true\\n\\t\\tcase client := <-h.unregister:\\n\\t\\t\\tif _, ok := h.clients[client]; ok {\\n\\t\\t\\t\\tdelete(h.clients, client)\\n\\t\\t\\t\\tclose(client.send)\\n\\t\\t\\t}\\n\\t\\tcase message := <-h.broadcast:\\n\\t\\t\\tfor client := range h.clients {\\n\\t\\t\\t\\tselect {\\n\\t\\t\\t\\tcase client.send <- message:\\n\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\tclose(client.send)\\n\\t\\t\\t\\t\\tdelete(h.clients, client)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (m *Manager) enrichWorker(workerID int, jobs <-chan *RawMessage, results chan<- result) {\\n\\tfor j := range jobs {\\n\\t\\tlog.Printf(\\\"worker %+v started job %+v\\\", workerID, j.UUID)\\n\\t\\tenrichedItem, err := m.enricher.EnrichMessage(j, time.Now().UTC())\\n\\t\\t// quit app if error isn't nil\\n\\t\\tif err != nil {\\n\\t\\t\\tos.Exit(1)\\n\\t\\t}\\n\\t\\ttime.Sleep(time.Second)\\n\\t\\tlog.Printf(\\\"worker %+v finished job %+v\\\", workerID, j.UUID)\\n\\t\\tresults <- result{id: workerID, enrichedItem: enrichedItem}\\n\\t}\\n}\",\n \"func (c *Channel) SendLoop() {\\n\\tfor msg := range c.Messages {\\n\\t\\tif !c.Alive {\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tc.LogF(\\\"Sending msg `%s` to `%d` members in `%s`\\\", msg, len(c.Members), c.GetName())\\n\\t\\tfor _, v := range c.Members {\\n\\t\\t\\tv.Write(msg)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (lbc *loadBalancerController) worker() {\\n\\tfor {\\n\\t\\tkey, _ := lbc.queue.Get()\\n\\t\\tglog.Infof(\\\"Sync triggered by service %v\\\", key)\\n\\t\\tif err := lbc.sync(false); err != nil {\\n\\t\\t\\tglog.Infof(\\\"Requeuing %v because of error: %v\\\", key, err)\\n\\t\\t\\tlbc.queue.Add(key)\\n\\t\\t} else {\\n\\t\\t\\tlbc.queue.Done(key)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (this User) broadcast(message interface{}) {\\n mu.Lock()\\n for _, client := range clients {\\n if client.User.Id != this.Id {\\n websocket.JSON.Send(client.Websocket, message)\\n }\\n }\\n mu.Unlock()\\n}\",\n \"func (room *Room) broadcastToClientsInRoom(message []byte) {\\n\\tfor client := range room.clients {\\n\\t\\tclient.send <- message\\n\\t}\\n}\",\n \"func (h *hub) run() {\\n for {\\n select{\\n case s := <- h.register:\\n // fmt.Println(\\\"wild client has appeared in the brush!\\\")\\n clients := h.channels[s.channel]\\n if clients == nil {\\n clients = make(map[*client]bool)\\n h.channels[s.channel] = clients\\n }\\n h.channels[s.channel][s.client] = true\\n //send the latest data for room (empty string if new room)\\n //s.client.send <- []byte(contents[s.channel])\\n case s := <- h.unregister:\\n clients := h.channels[s.channel]\\n if clients != nil {\\n if _, ok := clients[s.client]; ok{\\n delete(clients, s.client)\\n close(s.client.send)\\n if len(clients) == 0 {\\n delete(h.channels, s.channel)\\n if len(contents[s.channel]) != 0 {\\n //delete contents for channel if no more clients using it.\\n delete(contents, s.channel)\\n }\\n }\\n }\\n }\\n case m := <- h.broadcast:\\n clients := h.channels[m.channel]\\n // fmt.Println(\\\"broadcasting message to \\\", clients, \\\"data is: \\\", string(m.data))\\n for c := range clients {\\n fmt.Println(\\\"broadcasting message to \\\", c, \\\"data is: \\\", string(m.data))\\n select {\\n case c.send <- m.data:\\n contents[m.channel] = string(m.data)\\n default:\\n close(c.send)\\n delete(clients, c)\\n if len(clients) == 0 {\\n delete(h.channels, m.channel)\\n if len(contents[m.channel]) != 0 {\\n //delete contents for channel if no more clients using it.\\n delete(contents, m.channel)\\n }\\n }\\n }\\n }\\n }\\n }\\n}\",\n \"func (w *Worker) Work() {\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase <-w.done:\\n\\t\\t\\treturn\\n\\t\\tdefault:\\n\\t\\t\\tevent := <-w.channel\\n\\t\\t\\tw.writeToBuffer(event)\\n\\t\\t}\\n\\t}\\n}\",\n \"func worker(clients <-chan api.Client) {\\n\\tfor c := range clients {\\n\\t\\tlog.Printf(\\\"Fetching metrics from %s\\\", c.GetHost())\\n\\t\\terr := c.FetchInventoryMetrics()\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Printf(\\\"Error updating %s: %v\\\", c.GetHost(), err)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (s *Server) Run() {\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase msg := <-s.broadcast:\\n\\t\\t\\tfor conn, m := range s.clients {\\n\\t\\t\\t\\tm.Lock()\\n\\t\\t\\t\\tconn.WriteMessage(websocket.TextMessage, msg)\\n\\t\\t\\t\\tm.Unlock()\\n\\t\\t\\t}\\n\\t\\tcase conn := <-s.add:\\n\\t\\t\\ts.clients[conn] = new(sync.Mutex)\\n\\t\\t\\tgo s.listen(conn)\\n\\t\\tcase conn := <-s.del:\\n\\t\\t\\tif _, ok := s.clients[conn]; ok {\\n\\t\\t\\t\\tdelete(s.clients, conn)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func broadcastMessage(payload _message, logMessage string) {\\n\\tfor _, v := range peers {\\n\\t\\t// fmt.Println(\\\"Sending to\\\", v)\\n\\t\\tgo sendToAddr(payload, v, logMessage)\\n\\t}\\n}\",\n \"func (g *game) broadcast(msg []byte) {\\n\\tfor i := 0; i < len(g.Players); i++ {\\n\\t\\tif g.Players[i].Connection != nil {\\n\\t\\t\\tg.Players[i].Connection.Outbound <- msg\\n\\t\\t}\\n\\t}\\n}\",\n \"func (h *hub) update() {\\n\\t//send each channel its client state\\n\\tfor c := range h.connections {\\n\\t\\tmsg := c.client.GetMessage()\\n\\t\\tc.ws.WriteMessage(websocket.BinaryMessage, msg)\\n\\t}\\n}\",\n \"func SendToWorker(job *lib.JobRequest) {\\n\\tworkChannel <- job\\n}\",\n \"func (h *Hub) SendAll(messageType int, data []byte) {\\n\\tlogger.Info.Println(\\\"message delivered to all:\\\", string(data), \\\"message type:\\\", messageType)\\n\\tfor client, _ := range h.Clients {\\n\\t\\tclient.WriteMessage(messageType, data)\\n\\t}\\n}\",\n \"func (s *senderQueue) send(incoming []byte) {\\n\\tdefer s.wg.Done()\\n\\tdefer s.workers.Release()\\n\\n\\tlogging.Debug(s.logger).Log(logging.MessageKey(), \\\"Sending message...\\\")\\n\\n\\terr := s.connection.WriteMessage(websocket.BinaryMessage, incoming)\\n\\tif err != nil {\\n\\t\\tlogging.Error(s.logger, emperror.Context(err)...).\\n\\t\\t\\tLog(logging.MessageKey(), \\\"Failed to send message\\\",\\n\\t\\t\\t\\tlogging.ErrorKey(), err.Error(),\\n\\t\\t\\t\\t\\\"msg\\\", string(incoming))\\n\\t\\treturn\\n\\t}\\n\\n\\tlogging.Debug(s.logger).Log(logging.MessageKey(), \\\"Message Sent\\\")\\n}\",\n \"func sendLoop() {\\n\\tif currentWebsocket == nil {\\n\\t\\tcolorLog(\\\"[INFO] BW: No connection, wait for it.\\\\n\\\")\\n\\t\\tcmd := <-connectChannel\\n\\t\\tif \\\"QUIT\\\" == cmd.Action {\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}\\n\\n\\tfor {\\n\\t\\tnext, ok := <-toBrowserChannel\\n\\t\\tif !ok {\\n\\t\\t\\tcolorLog(\\\"[WARN] BW: Send channel was closed.\\\\n\\\")\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\n\\t\\tif \\\"QUIT\\\" == next.Action {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\n\\t\\tif currentWebsocket == nil {\\n\\t\\t\\tcolorLog(\\\"[INFO] BW: No connection, wait for it.\\\\n\\\")\\n\\t\\t\\tcmd := <-connectChannel\\n\\t\\t\\tif \\\"QUIT\\\" == cmd.Action {\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twebsocket.JSON.Send(currentWebsocket, &next)\\n\\t\\tcolorLog(\\\"[SUCC] BW: Sent %v.\\\\n\\\", next)\\n\\t}\\n\\n\\tcolorLog(\\\"[WARN] BW: Exit send loop.\\\\n\\\")\\n}\",\n \"func (s *Server) Fire(data []byte) error {\\n\\tfor _, w := range s.workers {\\n\\t\\t_, err := w.Write(data)\\n\\n\\t\\treturn err\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func MsgServer(ws *websocket.Conn) {\\r\\n\\tvar message string\\r\\n\\t// all.(ws)\\r\\n\\talive := true\\r\\n\\tallconnections = append(allconnections, ws)\\r\\n\\tfor {\\r\\n\\t\\twebsocket.Message.Receive(ws, &message)\\r\\n\\t\\tfor i, aWs := range allconnections {\\r\\n\\r\\n\\t\\t\\tif _, err := aWs.Write([]byte(message)); err != nil {\\r\\n\\t\\t\\t\\tlog.Println(\\\"Error!!: \\\", err)\\r\\n\\t\\t\\t\\taWs.Close()\\r\\n\\t\\t\\t\\tallconnections = remove(allconnections, i)\\r\\n\\t\\t\\t\\talive = false\\r\\n\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t}\\r\\n\\t\\tlog.Println(\\\"I hope I didn't crash: \\\")\\r\\n\\t\\tif !alive {\\r\\n\\t\\t\\tbreak\\r\\n\\t\\t}\\r\\n\\t}\\r\\n}\",\n \"func (broker *Broker) Serve(w http.ResponseWriter, flusher http.Flusher) {\\n\\tmessageChan := make(chan *msg.Msg)\\n\\tbroker.newClients <- messageChan\\n\\n\\tnotify := w.(http.CloseNotifier).CloseNotify()\\n\\tgo func() {\\n\\t\\t<-notify\\n\\t\\tclose(messageChan)\\n\\t}()\\n\\n\\tdefer func() {\\n\\t\\tbroker.closingClients <- messageChan\\n\\t}()\\n\\n\\tfor _, obj := range broker.cache {\\n\\t\\tsendMsg(w, flusher, msg.New(\\\"add\\\", obj))\\n\\t}\\n\\n\\tpingTicker := time.NewTicker(5 * time.Second)\\n\\nloop:\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase <-pingTicker.C:\\n\\t\\t\\tsendText(w, flusher, \\\"event: ping\\\")\\n\\t\\tcase m, open := <-messageChan:\\n\\t\\t\\tif !open {\\n\\t\\t\\t\\tbreak loop\\n\\t\\t\\t}\\n\\t\\t\\tsendMsg(w, flusher, m)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (r *Room) BroadcastAll(msg []byte) {\\n\\tfor _, client := range r.Clients {\\n\\t\\tclient.WriteMessage(msg)\\n\\t}\\n}\",\n \"func broadcast(channels []chan message, msg message) {\\n\\tfor _, channel := range channels {\\n\\t\\tchannel <- msg\\n\\t}\\n}\",\n \"func (h *adminHub) Broadcast(message []byte) error {\\n\\th.RLock()\\n\\tdefer h.RUnlock()\\n\\tmsg := NewQueuedMessage(message, true)\\n\\tfor _, c := range h.connections {\\n\\t\\terr := c.Send(msg)\\n\\t\\tif err != nil {\\n\\t\\t\\tlogger.ERROR.Println(err)\\n\\t\\t}\\n\\t}\\n\\treturn nil\\n}\",\n \"func (w *WSHandler) Serve() {\\n\\tfor {\\n\\t\\tc := w.GetConnection()\\n\\t\\tCONNS[c] = true\\n\\t\\tc.ReadMessage()\\n\\t}\\n}\",\n \"func (s *Websocket) system(text string) {\\n\\tmsg := models.Message{\\n\\t\\tID: 0,\\n\\t\\tSender: \\\"system\\\",\\n\\t\\tReceiver: \\\"\\\",\\n\\t\\tText: text,\\n\\t\\tCreatedAt: time.Now(),\\n\\t}\\n\\n\\ts.hmu.RLock()\\n\\n\\tfor _, receiver := range s.hub {\\n\\t\\tif err := receiver.Conn.WriteJSON(msg); err != nil {\\n\\t\\t\\ts.logger.Errorf(\\\"error sending message: %v\\\", err)\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t}\\n\\n\\ts.hmu.RUnlock()\\n}\",\n \"func worker(id int, games <-chan Game) {\\n\\tfmt.Printf(\\\"Worker initialised ID:%v\\\\n\\\", id)\\n\\tfor g := range games {\\n\\t\\tfmt.Printf(\\\"Worker running ID:%v\\\\n\\\", id)\\n\\t\\tplayGame(g)\\n\\t\\tfmt.Printf(\\\"Worker complete ID:%v\\\\n\\\", id)\\n\\t}\\n}\",\n \"func (h *mysqlMetricStore) sendmessage() {\\n\\th.lock.Lock()\\n\\tdefer h.lock.Unlock()\\n\\tvar caches = new(MonitorMessageList)\\n\\tfor _, v := range h.PathCache {\\n\\t\\t_, avg, max := calculate(&v.ResTime)\\n\\t\\tmm := MonitorMessage{\\n\\t\\t\\tServiceID: h.ServiceID,\\n\\t\\t\\tPort: h.Port,\\n\\t\\t\\tMessageType: \\\"mysql\\\",\\n\\t\\t\\tKey: v.Key,\\n\\t\\t\\tHostName: h.HostName,\\n\\t\\t\\tCount: v.Count,\\n\\t\\t\\tAbnormalCount: v.UnusualCount,\\n\\t\\t\\tAverageTime: Round(avg, 2),\\n\\t\\t\\tMaxTime: Round(max, 2),\\n\\t\\t\\tCumulativeTime: Round(avg*float64(v.Count), 2),\\n\\t\\t}\\n\\t\\tcaches.Add(&mm)\\n\\t}\\n\\tsort.Sort(caches)\\n\\tif caches.Len() > 20 {\\n\\t\\th.monitorMessageManage.Send(caches.Pop(20))\\n\\t\\treturn\\n\\t}\\n\\th.monitorMessageManage.Send(caches)\\n}\",\n \"func (c *Client) writePump() {\\n\\tfor {\\n\\t\\tmessage, ok := <-c.send\\n\\t\\tfmt.Println(\\\"new messsage incoming\\\")\\n\\n\\t\\tif !ok {\\n\\t\\t\\t// The hub closed the channel.\\n\\t\\t\\tfmt.Println(\\\"error in message\\\")\\n\\t\\t\\tc.conn.WriteMessage(websocket.CloseMessage, []byte{})\\n\\t\\t\\treturn\\n\\t\\t}\\n\\n\\t\\tc.conn.WriteMessage(websocket.TextMessage, message)\\n\\t\\tfmt.Println(\\\"sent message!\\\")\\n\\t}\\n}\",\n \"func (server *Server) send(client *Client) {\\n\\tdefer client.socket.Close()\\n\\tencoder := json.NewEncoder(client.socket)\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase job, ok := <-client.data:\\n\\t\\t\\tif !ok {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t\\tencoder.Encode(job)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (c *Client) Send(ch <-chan *Message) error {\\n\\tfor msg := range ch {\\n\\t\\t_, err := io.WriteString(c.conn, msg.Content)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t}\\n\\treturn nil\\n}\",\n \"func (c *Client) writePump() {\\n\\tticker := time.NewTicker(pingPeriod)\\n\\tdefer func() {\\n\\t\\tticker.Stop()\\n\\t\\tc.conn.Close()\\n\\t}()\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase message, ok := <-c.send:\\n\\t\\t\\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\\n\\t\\t\\tif !ok {\\n\\t\\t\\t\\t// The hub closed the channel.\\n\\t\\t\\t\\tc.conn.WriteMessage(websocket.CloseMessage, []byte{})\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\n\\t\\t\\tw, err := c.conn.NextWriter(websocket.TextMessage)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t\\tw.Write(message)\\n\\n\\t\\t\\t//// Add queued chat messages to the current websocket message.\\n\\t\\t\\t//n := len(c.send)\\n\\t\\t\\t//for i := 0; i < n; i++ {\\n\\t\\t\\t//\\tw.Write(newline)\\n\\t\\t\\t//\\tw.Write(<-c.send)\\n\\t\\t\\t//}\\n\\n\\t\\t\\tif err := w.Close(); err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\tcase <-ticker.C:\\n\\t\\t\\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\\n\\t\\t\\tif err := c.conn.WriteMessage(websocket.PingMessage, nil); err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (r *Room) broadcastMsg(msg string) {\\n\\tr.RLock()\\n\\tdefer r.RUnlock()\\n\\tfor _, wc := range r.clients {\\n\\t\\tgo func(wc chan<- string) {\\n\\t\\t\\twc <- msg\\n\\t\\t}(wc)\\n\\t}\\n}\",\n \"func (h *Hub) SendToAll(data []byte) {\\n\\th.mux.Lock()\\n\\tdefer h.mux.Unlock()\\n\\tfor conn := range h.conns {\\n\\t\\th.Send(conn, data, websocket.TextMessage)\\n\\t}\\n}\",\n \"func (broker *Broker) Run() {\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase client := <-broker.Register:\\n\\t\\t\\tbroker.Clients[client] = true\\n\\t\\t\\tlog.Printf(\\\"Broker room %s: connect, size %d \\\", broker.Name, len(broker.Clients))\\n\\n\\t\\t\\tfor client := range broker.Clients {\\n\\t\\t\\t\\tclient.Conn.WriteMessage(1, []byte(\\\"Connected\\\"))\\n\\t\\t\\t}\\n\\t\\t\\tbreak\\n\\t\\tcase client := <-broker.Unregister:\\n\\t\\t\\tdelete(broker.Clients, client)\\n\\t\\t\\tlog.Printf(\\\"Broker room %s: disconnect, size %d \\\", broker.Name, len(broker.Clients))\\n\\t\\t\\tif len(broker.Clients) == 0 && broker.Room.Status != \\\"ongoing\\\" {\\n\\t\\t\\t\\tdatastore.DeleteGame(broker.Room.RoomCode)\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor client := range broker.Clients {\\n\\t\\t\\t\\tclient.Conn.WriteMessage(1, []byte(\\\"Disconnected\\\"))\\n\\t\\t\\t}\\n\\t\\t\\tbreak\\n\\t\\tcase move := <-broker.Broadcast:\\n\\t\\t\\tlog.Printf(\\\"Broker room %s, Move received: %+v\\\\n\\\", broker.Name, move)\\n\\t\\t\\t// Process move according to game rules and update state\\n\\t\\t\\tbroker.Room = rules.ProcessRules(move, broker.Room)\\n\\t\\t\\t// Save game state after the move is processed\\n\\t\\t\\tdatastore.UpdateGame(broker.Room)\\n\\n\\t\\t\\tfor client := range broker.Clients {\\n\\t\\t\\t\\tif err := client.Conn.WriteJSON(broker.Room); err != nil {\\n\\t\\t\\t\\t\\tlog.Println(err)\\n\\t\\t\\t\\t\\treturn\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (s *Server) Worker(queue *Queue, srv Server_SubscribeServer) {\\n\\t// temp imitate unsibscribe\\n\\tvar exit = make(chan (struct{}))\\n\\ttime.AfterFunc(time.Second*10, func() { exit <- struct{}{} })\\n\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase <-exit:\\n\\t\\t\\tfmt.Println(\\\"Exit\\\")\\n\\t\\t\\ts.wg.Done()\\n\\t\\t\\treturn\\n\\t\\tdefault:\\n\\t\\t\\tif queue.messages.Len() > 0 {\\n\\t\\t\\t\\tel := queue.messages.Back()\\n\\t\\t\\t\\tval := el.Value\\n\\n\\t\\t\\t\\tmessage, ok := val.(*Message)\\n\\t\\t\\t\\tif ok {\\n\\t\\t\\t\\t\\tresp := &SubscribeResponse{QueueName: queue.queueName, Message: message}\\n\\n\\t\\t\\t\\t\\tif err := srv.Send(resp); err != nil {\\n\\t\\t\\t\\t\\t\\tfmt.Println(err)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tqueue.messages.Remove(el)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n}\",\n \"func (b *base) broadcast(message *socket.RawMessage) {\\n\\tfor i := range b.connections {\\n\\t\\tsocket.SendQueueMessageSocketID(*message, b.connections[i].socketID)\\n\\t}\\n\\tlog.Printf(\\\"[Match] -> Message %d broadcasted, Match: %s\\\", message.MessageType, b.info.ID)\\n}\",\n \"func (c *client) send() {\\nLoop:\\n\\tfor {\\n\\t\\tmsg, err := readInput(c.Conn, \\\"\\\")\\n\\t\\tif err != nil {\\n\\t\\t\\tpanic(err)\\n\\t\\t}\\n\\n\\t\\tif msg == \\\"/quit\\\" {\\n\\t\\t\\tc.close()\\n\\t\\t\\tlog.Printf(\\\"%v has left..\\\", c.Name)\\n\\t\\t\\tbreak Loop\\n\\t\\t}\\n\\n\\t\\t// Check if the message is a command.\\n\\t\\tif c.command(msg) {\\n\\t\\t\\t// If the client is currently not connected to a room\\n\\t\\t\\tif c.Room == \\\"\\\"{\\n\\t\\t\\t\\tlog.Printf(\\\"Error: \\\" + c.Name + \\\" is not in a room\\\")\\n\\t\\t\\t\\twriteFormattedMsg(c.Conn, \\\"You are currently not in a room, please join a room.\\\")\\n\\t\\t\\t}else {\\n\\t\\t\\t\\t// Client is connected to a room and the input is a regular message.\\n\\t\\t\\t\\tlog.Printf(\\\"send: msg: %v from: %s\\\", msg, c.Name)\\n\\t\\t\\t\\tsend := time.Now().Format(customTime) + \\\" * (\\\" + c.Name + \\\"): \\\\\\\"\\\" + msg + \\\"\\\\\\\"\\\"\\n\\n\\t\\t\\t\\t// Add message to the chat rooms history.\\n\\t\\t\\t\\troomList[c.Room].history = append(roomList[c.Room].history, send)\\n\\n\\t\\t\\t\\t// Send out message to all clients connected to the current room.\\n\\t\\t\\t\\tfor _, v := range roomList {\\n\\t\\t\\t\\t\\tfor k := range v.members {\\n\\t\\t\\t\\t\\t\\tif k == c.Conn.RemoteAddr().String() {\\n\\t\\t\\t\\t\\t\\t\\tv.messages <- send\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (s *Server) broadcast(ctx context.Context) {\\n\\tfor res := range s.Broadcast {\\n\\t\\ts.Clients.Broadcast(res)\\n\\t}\\n}\",\n \"func (c *ControlConsumer) Send(message *ControlMessage) error {\\n\\n\\tfor _, channel := range c.Channels {\\n\\t\\tchannel <- message\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func (c *Client) writePump() {\\n\\tticker := time.NewTicker(pingPeriod)\\n\\tdefer func() {\\n\\t\\tticker.Stop()\\n\\t\\tc.ws.Close()\\n\\t}()\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase message, ok := <-c.send:\\n\\t\\t\\t// spew.Dump(c.clientID)\\n\\t\\t\\tc.ws.SetWriteDeadline(time.Now().Add(writeWait))\\n\\t\\t\\tif !ok {\\n\\t\\t\\t\\t// The hub closed the channel.\\n\\t\\t\\t\\tc.ws.WriteMessage(websocket.CloseMessage, []byte{})\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\n\\t\\t\\tw, err := c.ws.NextWriter(websocket.TextMessage)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t\\tw.Write(message)\\n\\n\\t\\t\\t// Add queued chat messages to the current websocket message.\\n\\t\\t\\tn := len(c.send)\\n\\t\\t\\tfor i := 0; i < n; i++ {\\n\\t\\t\\t\\tw.Write(newline)\\n\\t\\t\\t\\tw.Write(<-c.send)\\n\\t\\t\\t}\\n\\n\\t\\t\\tif err := w.Close(); err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\tcase <-ticker.C:\\n\\t\\t\\tc.ws.SetWriteDeadline(time.Now().Add(writeWait))\\n\\t\\t\\tif err := c.ws.WriteMessage(websocket.PingMessage, nil); err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (c *Client) writePump() {\\n\\tticker := time.NewTicker(pingPeriod)\\n\\tdefer func() {\\n\\t\\tticker.Stop()\\n\\t\\tc.conn.Close()\\n\\t}()\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase message, ok := <-c.send:\\n\\t\\t\\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\\n\\t\\t\\tif !ok {\\n\\t\\t\\t\\t// The hub closed the channel.\\n\\t\\t\\t\\tc.conn.WriteMessage(websocket.CloseMessage, []byte{})\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\n\\t\\t\\tw, err := c.conn.NextWriter(websocket.TextMessage)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t\\tw.Write(message)\\n\\n\\t\\t\\t// Add queued chat messages to the current websocket message.\\n\\t\\t\\tn := len(c.send)\\n\\t\\t\\tfor i := 0; i < n; i++ {\\n\\t\\t\\t\\tw.Write(newline)\\n\\t\\t\\t\\tw.Write(<-c.send)\\n\\t\\t\\t}\\n\\n\\t\\t\\tif err := w.Close(); err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\tcase <-ticker.C:\\n\\t\\t\\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\\n\\t\\t\\tif err := c.conn.WriteMessage(websocket.PingMessage, nil); err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (c *MultiClusterController) worker() {\\n\\tfor c.processNextWorkItem() {\\n\\t}\\n}\",\n \"func worker(worker int){\\n\\t// Recibir string del channel\\n\\tvalor := <- recursos\\n\\n\\t//Imprimir el valor\\n\\tfmt.Printf(\\\"Worker: %d : %s\\\\n\\\", worker, valor)\\n\\n\\t//Poner el string de regreso\\n\\trecursos <- valor\\n}\",\n \"func (m *ConnManager) Broadcast(conn *websocket.Conn, msg *Message) {\\n\\tm.Foreach(func(k, v interface{}) {\\n\\t\\tif c, ok := v.(*websocket.Conn); ok && c != conn {\\n\\t\\t\\tif err := websocket.JSON.Send(c, msg); err != nil {\\n\\t\\t\\t\\tfmt.Println(\\\"Send msg error: \\\", err)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t})\\n}\",\n \"func (s *Subscriber) writeMessage() {\\n ticker := time.NewTicker(pingPeriod)\\n defer func() {\\n ticker.Stop()\\n s.close()\\n }()\\n for {\\n select {\\n case m, ok := <- s.send:\\n if !ok {\\n s.write(websocket.CloseMessage, []byte{})\\n return\\n }\\n if err := s.write(websocket.TextMessage, m); err != nil {\\n return\\n }\\n case <-ticker.C:\\n if err := s.write(websocket.PingMessage, []byte{}); err != nil {\\n return\\n }\\n }\\n }\\n}\",\n \"func sendMessageAll(conn net.Conn, mess string) {\\n\\tfor key := range connMap {\\n\\t\\tif connMap[key] != conn {\\n\\t\\t\\tconnMap[key].Write([]byte(\\\"TCCHAT_BCAST\\\\t\\\" + userMap[conn] + \\\"\\\\t\\\" + mess + \\\"\\\\n\\\"))\\n\\t\\t}\\n\\t}\\n}\",\n \"func (a *API) Notify(userID uint, msg *model.Message) {\\n\\tif clients, ok := a.getClients(userID); ok {\\n\\t\\tgo func() {\\n\\t\\t\\tfor _, c := range clients {\\n\\t\\t\\t\\tc.write <- msg\\n\\t\\t\\t}\\n\\t\\t}()\\n\\t}\\n}\",\n \"func websocketEventLoop(s *state.State) {\\n\\tfor {\\n\\t\\tdata := <-s.Data\\n\\t\\tfor client := range clients {\\n\\t\\t\\t// send data in separate go routine\\n\\t\\t\\tgo func(s *state.State, clients map[*websocket.Conn]bool, client *websocket.Conn, data []byte) {\\n\\t\\t\\t\\terr := client.WriteMessage(websocket.TextMessage, data)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\ts.Log.Warnln(\\\"[websocket] error sending message to client\\\", err)\\n\\t\\t\\t\\t\\tdelete(clients, client)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}(s, clients, client, data)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (w *Worker) Run() {\\n\\tconn := w.Pool.Get()\\n\\tdefer conn.Close()\\n\\n\\tvar msgs = make([]Impression, 0, w.Size)\\n\\ttick := time.NewTicker(w.Interval)\\n\\n\\tw.verbose(\\\"active\\\")\\n\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase msg := <-w.Queue:\\n\\t\\t\\tw.verbose(\\\"buffer (%d/%d) %v\\\", len(msgs), w.Size, msg)\\n\\t\\t\\tmsgs = append(msgs, msg)\\n\\t\\t\\tif len(msgs) >= w.Size {\\n\\t\\t\\t\\tw.verbose(\\\"exceeded %d messages – flushing\\\", w.Size)\\n\\t\\t\\t\\tw.send(conn, msgs)\\n\\t\\t\\t\\tmsgs = make([]Impression, 0, w.Size)\\n\\t\\t\\t}\\n\\t\\tcase <-tick.C:\\n\\t\\t\\tif len(msgs) > 0 {\\n\\t\\t\\t\\tw.verbose(\\\"interval reached - flushing %d\\\", len(msgs))\\n\\t\\t\\t\\tw.send(conn, msgs)\\n\\t\\t\\t\\tmsgs = make([]Impression, 0, w.Size)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tw.verbose(\\\"interval reached – nothing to send\\\")\\n\\t\\t\\t}\\n\\t\\tcase <-w.quit:\\n\\t\\t\\ttick.Stop()\\n\\t\\t\\tw.verbose(\\\"exit requested – draining msgs\\\")\\n\\t\\t\\t// drain the msg channel.\\n\\t\\t\\tfor msg := range w.Queue {\\n\\t\\t\\t\\tw.verbose(\\\"buffer (%d/%d) %v\\\", len(msgs), w.Size, msg)\\n\\t\\t\\t\\tmsgs = append(msgs, msg)\\n\\t\\t\\t}\\n\\t\\t\\tw.verbose(\\\"exit requested – flushing %d\\\", len(msgs))\\n\\t\\t\\tw.send(conn, msgs)\\n\\t\\t\\tw.verbose(\\\"exit\\\")\\n\\t\\t\\tw.shutdown <- struct{}{}\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}\\n}\",\n \"func (r *Room) SendBroadcast(msg Message) {\\n\\tfor _, client := range r.clients {\\n\\t\\tclient.WriteMessage(msg)\\n\\t}\\n}\",\n \"func runWorker(ch <-chan func()) {\\n\\tfor {\\n\\t\\tf := <-ch\\n\\t\\tf()\\n\\t}\\n}\",\n \"func (c *Client) writePump() {\\n\\tticker := time.NewTicker(pingPeriod)\\n\\tdefer func() {\\n\\t\\tticker.Stop()\\n\\t\\tfmt.Println(\\\"Closing writePump\\\")\\n\\t}()\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase message, ok := <-c.send:\\n\\t\\t\\tif !c.isAlive {\\n\\t\\t\\t\\tfmt.Printf(\\\"Channel closed\\\")\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\n\\t\\t\\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\\n\\t\\t\\tif !ok {\\n\\t\\t\\t\\t// The hub closed the channel.\\n\\t\\t\\t\\tc.conn.WriteMessage(websocket.CloseMessage, []byte{})\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\n\\t\\t\\tw, err := c.conn.NextWriter(websocket.TextMessage)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t\\tw.Write(message)\\n\\n\\t\\t\\t// Add queued chat messages to the current websocket message.\\n\\t\\t\\tn := len(c.send)\\n\\t\\t\\tfor i := 0; i < n; i++ {\\n\\t\\t\\t\\tw.Write(newline)\\n\\t\\t\\t\\tw.Write(<-c.send)\\n\\t\\t\\t}\\n\\n\\t\\t\\tif err := w.Close(); err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\tcase <-ticker.C:\\n\\t\\t\\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\\n\\t\\t\\tif err := c.conn.WriteMessage(websocket.PingMessage, nil); err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (c *Connection) writePump() {\\n\\tticker := time.NewTicker(pingPeriod)\\n\\tdefer func() {\\n\\t\\tticker.Stop()\\n\\t\\tc.conn.Close()\\n\\t}()\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase message, ok := <-c.send:\\n\\t\\t\\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\\n\\t\\t\\tif !ok {\\n\\t\\t\\t\\t// The hub closed the channel.\\n\\t\\t\\t\\tc.conn.WriteMessage(websocket.CloseMessage, []byte{})\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\n\\t\\t\\tw, err := c.conn.NextWriter(websocket.TextMessage)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t\\tw.Write(message)\\n\\n\\t\\t\\t// Add queued chat messages to the current websocket message.\\n\\t\\t\\tn := len(c.send)\\n\\t\\t\\tfor i := 0; i < n; i++ {\\n\\t\\t\\t\\tw.Write(<-c.send)\\n\\t\\t\\t}\\n\\n\\t\\t\\tif err := w.Close(); err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\tcase <-ticker.C:\\n\\t\\t\\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\\n\\t\\t\\tif err := c.conn.WriteMessage(websocket.PingMessage, nil); err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func worker() {\\n\\tgo func() {\\n\\t\\tfor {\\n\\t\\t\\tselect {\\n\\t\\t\\tcase job := <-jobs:\\n\\t\\t\\t\\tupdate(job)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}()\\n}\",\n \"func (c *Client) Run() {\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase conn := <-c.register:\\n\\t\\t\\tc.connections[conn] = true\\n\\t\\t\\tgo conn.writePump()\\n\\t\\t\\tgo conn.readPump()\\n\\t\\tcase conn := <-c.unregister:\\n\\t\\t\\tif _, ok := c.connections[conn]; ok {\\n\\t\\t\\t\\tdelete(c.connections, conn)\\n\\t\\t\\t\\tclose(conn.send)\\n\\t\\t\\t\\tif len(c.connections) <= 0 {\\n\\t\\t\\t\\t\\tc.hub.unregister <- c.id\\n\\t\\t\\t\\t\\treturn\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\tcase incomingMessage := <-c.outbox:\\n\\t\\t\\tc.hub.messages <- incomingMessage\\n\\t\\tcase outcomingMessage := <-c.inbox:\\n\\t\\t\\tfor conn := range c.connections {\\n\\t\\t\\t\\tmsgBytes, err := outcomingMessage.GetData()\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\tlog.Println(\\\"invalid message data\\\")\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tconn.send <- msgBytes\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t}\\n}\",\n \"func ws_SendMsg(ws *websocket.Conn, send_channel SendChannel) {\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase send_msg := <-send_channel.containers:\\n\\t\\t\\tlog.Printf(\\\"[%s] containers sendMessage= \\\", __FILE__, send_msg)\\n\\t\\t\\twebsocket.JSON.Send(ws, send_msg)\\n\\t\\tcase send_msg := <-send_channel.updateinfo:\\n\\t\\t\\tlog.Printf(\\\"[%s] update sendMessage=\\\", __FILE__, send_msg)\\n\\t\\t}\\n\\t}\\n}\",\n \"func echo() {\\n\\tfor {\\n\\t\\tval := <-broadcast\\n\\t\\t// latlong := fmt.Sprintf(\\\"%f %f %s\\\", val.Lat, val.Long)\\n\\t\\t// send to every client that is currently connected\\n\\t\\tfor client := range clients {\\n\\t\\t\\terr := client.WriteMessage(websocket.TextMessage, []byte(val))\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tlog.Printf(\\\"Websocket error: %s\\\", err)\\n\\t\\t\\t\\tclient.Close()\\n\\t\\t\\t\\tdelete(clients, client)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func runMessaging(ctx context.Context, wg *sync.WaitGroup, n *Node) {\\n\\n\\tdefer wg.Done()\\n\\n\\tfor _, client := range n.messaging.clients {\\n\\t\\twg.Add(1)\\n\\t\\tgo client.run(ctx, wg, n)\\n\\t}\\n\\n\\twg.Add(1)\\n\\tgo n.messaging.server.run(ctx, wg, n)\\n\\n}\",\n \"func (c *UserClientWS) writePump() {\\n\\tticker := time.NewTicker(pingPeriod)\\n\\tdefer func() {\\n\\t\\tticker.Stop()\\n\\t\\tc.conn.Close()\\n\\t}()\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase message, ok := <-c.send:\\n\\t\\t\\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\\n\\t\\t\\tif !ok {\\n\\t\\t\\t\\t// The hub closed the channel.\\n\\t\\t\\t\\tc.conn.WriteMessage(websocket.CloseMessage, []byte{})\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\n\\t\\t\\tw, err := c.conn.NextWriter(websocket.TextMessage)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t\\tw.Write(message)\\n\\n\\t\\t\\t// Add queued chat messages to the current websocket message.\\n\\t\\t\\t/*n := len(c.send)\\n\\t\\t\\tfor i := 0; i < n; i++ {\\n\\t\\t\\t\\tw.Write(newline)\\n\\t\\t\\t\\tw.Write(<-c.send)\\n\\t\\t\\t}*/\\n\\n\\t\\t\\tif err := w.Close(); err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\tcase <-ticker.C:\\n\\t\\t\\tc.conn.SetWriteDeadline(time.Now().Add(writeWait))\\n\\t\\t\\tif err := c.conn.WriteMessage(websocket.PingMessage, nil); err != nil {\\n\\t\\t\\t\\treturn\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (s *TCPServer) broadcast(msg *Msg) {\\n\\tlog.Printf(\\\"p2p server: broadcasting %s message to peers\\\\n\\\", msg.Mtype)\\n\\tfor _, p := range s.peers {\\n\\t\\tselect {\\n\\t\\tcase p.in <- msg:\\n\\t\\tdefault:\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n}\",\n \"func (hub *Hub) Run() () {\\n\\tfor {\\n\\t\\tselect {\\n\\t\\t\\tcase conn := <- hub.Register:\\n\\t\\t\\t\\tif oldConn, ok := hub.Clients[conn.Id]; ok {\\n\\t\\t\\t\\t\\t_ = oldConn.Conn.Close()\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\thub.Clients[conn.Id] = conn\\n\\t\\t\\t\\tfmt.Println(\\\"registering a client \\\" + conn.Id)\\n\\n\\t\\t\\tcase conn := <- hub.Unregister:\\n\\t\\t\\t\\tif oldConn, ok := hub.Clients[conn.Id]; ok {\\n\\t\\t\\t\\t\\t_ = oldConn.Conn.Close()\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tcase messageToSend := <- hub.Broadcast:\\n\\t\\t\\t\\t/*\\n\\t\\t\\t\\t\\tfirst look for the client connection from the dictionary\\n\\t\\t\\t\\t\\tif there is such connection send to the user\\n\\t\\t\\t\\t */\\n\\t\\t\\t\\tif conn, ok := hub.Clients[messageToSend.ReceiverId]; ok {\\n\\t\\t\\t\\t\\t/*\\n\\t\\t\\t\\t\\t\\tconvert the message to byte and send byte to the receiver connection\\n\\t\\t\\t\\t\\t */\\n\\t\\t\\t\\t\\tif messageByte, err := messageToSend.ConvertToByte(); err != nil {\\n\\t\\t\\t\\t\\t\\tselect {\\n\\t\\t\\t\\t\\t\\t\\tcase conn.Send <- messageByte:\\n\\t\\t\\t\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\t\\t\\t\\t/*\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tthis means, an error has occurred while sending a message\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\twhich indicates that the client connection is no more valid\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tthen remove it from the dictionary\\n\\t\\t\\t\\t\\t\\t\\t\\t */\\n\\t\\t\\t\\t\\t\\t\\t\\tclose(conn.Send)\\n\\t\\t\\t\\t\\t\\t\\t\\tdelete(hub.Clients, conn.Id)\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (r *Room) broadcastMsg(msg string) {\\n\\tr.RLock()\\n\\tdefer r.RUnlock()\\n\\tfor _, cc := range r.clients {\\n\\t\\tgo func(ch chan<- string) {\\n\\t\\t\\tch <- msg\\n\\t\\t}(cc)\\n\\t}\\n}\",\n \"func (client *wsClient) writeMessages() {\\n\\tdefer client.conn.Close()\\n\\tdefer log.Println(\\\"writeMessages exiting\\\")\\n\\tfor {\\n\\t\\t// Read a message from the outbound channel\\n\\t\\tmsg := <-client.outboundMsgs\\n\\t\\t// Send message to the browser\\n\\t\\terr := client.conn.WriteMessage(websocket.TextMessage, msg)\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Println(\\\"writeMessages: \\\", err)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}\\n}\",\n \"func sendAll(count int, c chan int64) {\\n\\tfor i :=0; i < count; i++ {\\n\\t\\tc <- 1\\n\\t}\\n}\",\n \"func (h *wsHub) send(message []byte) {\\n\\th.broadcast <- message\\n}\",\n \"func workerTask() {\\n\\tworker, err := zmq4.NewSocket(zmq4.REQ)\\n\\tif err != nil {\\n\\t\\tlog.Fatalln(err)\\n\\t}\\n\\n\\tdefer worker.Close()\\n\\tworker.Connect(\\\"ipc://backend.ipc\\\")\\n\\tworker.SendMessage(WorkerReady)\\n\\n\\tfor {\\n\\n\\t\\tmsg, err := worker.RecvMessage(0)\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Fatalln(err)\\n\\t\\t}\\n\\n\\t\\tmsg[len(msg)-1] = \\\"OK\\\"\\n\\t\\tworker.SendMessage(msg)\\n\\t}\\n\\n}\",\n \"func (c *client) write() {\\n\\tfor msg := range c.send {\\n\\t\\tif err := c.socket.WriteMessage(websocket.TextMessage, msg); err != nil {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\tc.socket.Close()\\n}\",\n \"func Worker(conn *websocket.Conn, user *models.User) {\\n\\n\\tg, _ := game.GetGameByID(*user.GameID)\\n\\n\\tdefer game.DeleteGame(g)\\n\\tplayer := g.Player1\\n\\n\\tif g.Player1 == user {\\n\\t\\tplayer = g.Player2\\n\\t}\\n\\n\\tif player == nil {\\n\\t\\treturn\\n\\t}\\n\\n\\tfor {\\n\\n\\t\\tmt, message, err := conn.ReadMessage()\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Printf(\\\"JSON Parse error user %s info: %#v\\\", err, user.UserID)\\n\\t\\t\\t//delete(clients, ws)\\n\\t\\t\\tif g.State == models.RUNNING {\\n\\t\\t\\t\\tresp := models.GameResp{}\\n\\t\\t\\t\\tresp.Type = \\\"opponentLeft\\\"\\n\\t\\t\\t\\tplayer.Conn.WriteJSON(resp)\\n\\t\\t\\t\\tconn.Close()\\n\\t\\t\\t\\tg.State = models.ABANDONED\\n\\t\\t\\t}\\n\\t\\t\\tgame.DeleteUser(user)\\n\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tlog.Printf(\\\"message %s\\\", string(message))\\n\\t\\t/*send the data received to player 2*/\\n\\t\\tif player == nil {\\n\\t\\t\\tlog.Println(\\\"nil player\\\")\\n\\t\\t} else {\\n\\t\\t\\tlog.Printf(\\\"sending message to %s\\\", player.UserID)\\n\\t\\t\\tplayer.Conn.WriteMessage(mt, []byte(message))\\n\\t\\t}\\n\\t}\\n\\n}\",\n \"func (s *Socket) WriteMsg() {\\r\\n\\tfor {\\r\\n\\t\\tselect {\\r\\n\\t\\tcase data := <-s.WriteChan:\\r\\n\\t\\t\\tpref := intToBytes(len(data))\\r\\n\\t\\t\\tvar buffer bytes.Buffer\\r\\n\\t\\t\\tbuffer.Write(pref)\\r\\n\\t\\t\\tbuffer.Write(data)\\r\\n\\t\\t\\t_, err := s.Conn.Write(buffer.Bytes())\\r\\n\\t\\t\\tif err != nil {\\r\\n\\t\\t\\t\\tfmt.Println(\\\"Send Error,\\\", err)\\r\\n\\t\\t\\t}\\r\\n\\t\\tcase <-s.Ctx.Done():\\r\\n\\t\\t\\tfmt.Println(\\\"Quit WriteMsg()\\\")\\r\\n\\t\\t\\treturn\\r\\n\\t\\t}\\r\\n\\t}\\r\\n}\",\n \"func (c *Client) worker(workerID string) {\\n\\tc.wg.Add(1)\\n\\n\\ttimeout := make(chan bool, 1)\\n\\tloopControl := true\\n\\n\\tgo func() {\\n\\t\\tfor {\\n\\t\\t\\tif c.run == false {\\n\\t\\t\\t\\ttimeout <- true\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t\\ttime.Sleep(time.Second)\\n\\t\\t}\\n\\t}()\\n\\n\\tmq, err := rabbitmq.NewClient(c.mqConfig)\\n\\tif err != nil {\\n\\t\\tc.log.Sugar().Errorw(\\\"rabbitmq connect failed\\\", \\\"worker_id\\\", workerID, \\\"error\\\", err.Error())\\n\\t\\t<-c.register\\n\\t\\tc.wg.Done()\\n\\t\\ttime.Sleep(time.Millisecond * 5)\\n\\t\\treturn\\n\\t}\\n\\tdefer mq.Close()\\n\\n\\tmsgs, err := mq.Consume(\\\"async_ff_telemetry_queue\\\", \\\"\\\", false, false, false, false, nil)\\n\\tif err != nil {\\n\\t\\tc.log.Sugar().Errorw(\\\"queue declare failed\\\", \\\"worker_id\\\", workerID, \\\"error\\\", err.Error())\\n\\t\\t<-c.register\\n\\t\\tc.wg.Done()\\n\\t\\ttime.Sleep(time.Millisecond * 5)\\n\\t\\treturn\\n\\t}\\n\\n\\tc.log.Sugar().Debugw(\\\"worker started\\\", \\\"worker_id\\\", workerID)\\n\\n\\tfor loopControl {\\n\\t\\tselect {\\n\\t\\tcase <-timeout:\\n\\t\\t\\tloopControl = false\\n\\t\\tcase task := <-msgs:\\n\\t\\t\\tstart := time.Now().Unix()\\n\\t\\t\\tstate := \\\"good\\\"\\n\\n\\t\\t\\tif len(task.Body) < 1 {\\n\\t\\t\\t\\tstate = \\\"badmq\\\"\\n\\t\\t\\t\\tloopControl = false\\n\\t\\t\\t\\tc.log.Sugar().Errorw(\\\"message queue failed\\\", \\\"worker_id\\\", workerID)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif err := c.process(&task); err != nil {\\n\\t\\t\\t\\t\\tstate = \\\"bad\\\"\\n\\t\\t\\t\\t\\tc.log.Sugar().Errorw(\\\"task process failed\\\", \\\"worker_id\\\", workerID, \\\"error\\\", err.Error())\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\ttask.Ack(false)\\n\\n\\t\\t\\tc.log.Sugar().Debugw(\\\"telemetry processed\\\", \\\"worker_id\\\", workerID)\\n\\n\\t\\t\\tc.prometheus.IncTelemetryProcessCount(state)\\n\\t\\t\\tc.prometheus.ObserveProcessDuration(start)\\n\\t\\t}\\n\\t}\\n\\n\\tc.log.Sugar().Debugw(\\\"worker stopped\\\", \\\"worker_id\\\", workerID)\\n\\n\\t<-c.register\\n\\tc.wg.Done()\\n}\",\n \"func (client *Client) sendMessage(msg interface{}) {\\n\\tstr, err := json.Marshal(msg)\\n\\tif err != nil {\\n\\t\\tfmt.Println(err)\\n\\t}\\n\\ts := string(str)\\n\\tmetrics.SendMessage(len(s))\\n\\tclient.socketTx <- s\\n}\",\n \"func (s *remoteSealer) notifyWork() {\\n\\twork := s.currentWork\\n\\tblob, _ := json.Marshal(work)\\n\\ts.reqWG.Add(len(s.notifyURLs))\\n\\tfor _, url := range s.notifyURLs {\\n\\t\\tgo s.sendNotification(s.notifyCtx, url, blob, work)\\n\\t}\\n}\",\n \"func (h *Hub) Run() {\\n\\tfor {\\n\\t\\tselect {\\n\\t\\tcase client := <-h.register:\\n\\t\\t\\th.clients[client] = true\\n\\t\\tcase client := <-h.unregister:\\n\\t\\t\\tif _, ok := h.clients[client]; ok {\\n\\t\\t\\t\\tdelete(h.clients, client)\\n\\t\\t\\t\\tclose(client.send)\\n\\t\\t\\t}\\n\\t\\tcase message := <-h.broadcast:\\n\\t\\t\\tfor client := range h.clients {\\n\\t\\t\\t\\tselect {\\n\\t\\t\\t\\tcase client.send <- message:\\n\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\tclose(client.send)\\n\\t\\t\\t\\t\\tdelete(h.clients, client)\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\tcase message := <-h.onMessage:\\n\\t\\t\\tvar msg Msg\\n\\t\\t\\tjson.NewDecoder(bytes.NewReader(message)).Decode(msg)\\n\\t\\t\\tvar fns = h.listeners[msg.Type]\\n\\n\\t\\t\\tfor _, fn := range fns {\\n\\t\\t\\t\\tfn(msg.Data)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (ls *LogStreamer) worker(ctx context.Context, id int) {\\n\\tls.logger.Debug(\\\"[LogStreamer/Worker#%d] Worker is starting...\\\", id)\\n\\n\\tctx, setStat, done := status.AddSimpleItem(ctx, fmt.Sprintf(\\\"Log Streamer Worker %d\\\", id))\\n\\tdefer done()\\n\\tsetStat(\\\"🏃 Starting...\\\")\\n\\n\\tfor {\\n\\t\\tsetStat(\\\"⌚️ Waiting for chunk\\\")\\n\\n\\t\\t// Get the next chunk (pointer) from the queue. This will block\\n\\t\\t// until something is returned.\\n\\t\\tchunk := <-ls.queue\\n\\n\\t\\t// If the next chunk is nil, then there is no more work to do\\n\\t\\tif chunk == nil {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\n\\t\\tsetStat(\\\"📨 Passing chunk to callback\\\")\\n\\n\\t\\t// Upload the chunk\\n\\t\\terr := ls.callback(ctx, chunk)\\n\\t\\tif err != nil {\\n\\t\\t\\tatomic.AddInt32(&ls.chunksFailedCount, 1)\\n\\n\\t\\t\\tls.logger.Error(\\\"Giving up on uploading chunk %d, this will result in only a partial build log on Buildkite\\\", chunk.Order)\\n\\t\\t}\\n\\n\\t\\t// Signal to the chunkWaitGroup that this one is done\\n\\t\\tls.chunkWaitGroup.Done()\\n\\t}\\n\\n\\tls.logger.Debug(\\\"[LogStreamer/Worker#%d] Worker has shutdown\\\", id)\\n}\",\n \"func WsSend(channel, message string) (err error) {\\n\\tfor cs, _ := range ActiveClients[channel] {\\n\\t\\terr = websocket.Message.Send(cs.websocket, message)\\n\\t\\tif err != nil {\\n\\t\\t\\tlog.Println(channel, \\\"Could not send message to \\\", cs.clientIP, err.Error())\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\",\n \"func (tcp *Server) Broadcast(msgId int64, data []byte) {\\n\\tfor _, client := range tcp.clients {\\n\\t\\tclient.AsyncSend(msgId, data)\\n\\t}\\n}\",\n \"func (s *Server) SendAll(msg *Message) {\\n\\ts.sendAllCh <- msg\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6683119","0.66107297","0.6527772","0.64723986","0.64621276","0.64592254","0.64288116","0.64274037","0.6404339","0.6387626","0.6385022","0.63430643","0.62988806","0.6289499","0.6284704","0.62429345","0.6237176","0.62246853","0.6220611","0.62152636","0.62107724","0.6188203","0.6145242","0.6139642","0.61143434","0.61128443","0.60748124","0.6048376","0.6046685","0.60456914","0.60389274","0.60296196","0.6016741","0.6014323","0.6006023","0.6005027","0.6003027","0.5979912","0.5961824","0.5956678","0.5943965","0.59347427","0.5933835","0.5932359","0.5931599","0.59312373","0.5929317","0.59215724","0.59172827","0.59142476","0.59110934","0.5910548","0.59105396","0.58923525","0.58773994","0.58685666","0.5866035","0.5863875","0.5861842","0.5853176","0.584627","0.58330846","0.5828725","0.5826037","0.5801187","0.579863","0.5797533","0.5796435","0.57956207","0.57952815","0.5793834","0.5791517","0.5790564","0.5786417","0.5785801","0.57843965","0.5761132","0.5760728","0.5742378","0.5740169","0.5739339","0.5735414","0.5728407","0.5725174","0.57228625","0.572061","0.57076263","0.57075876","0.5707127","0.56984466","0.56975186","0.5694521","0.5693716","0.5687227","0.56780326","0.5674358","0.5671931","0.5668662","0.56664217","0.56635284"],"string":"[\n \"0.6683119\",\n \"0.66107297\",\n \"0.6527772\",\n \"0.64723986\",\n \"0.64621276\",\n \"0.64592254\",\n \"0.64288116\",\n \"0.64274037\",\n \"0.6404339\",\n \"0.6387626\",\n \"0.6385022\",\n \"0.63430643\",\n \"0.62988806\",\n \"0.6289499\",\n \"0.6284704\",\n \"0.62429345\",\n \"0.6237176\",\n \"0.62246853\",\n \"0.6220611\",\n \"0.62152636\",\n \"0.62107724\",\n \"0.6188203\",\n \"0.6145242\",\n \"0.6139642\",\n \"0.61143434\",\n \"0.61128443\",\n \"0.60748124\",\n \"0.6048376\",\n \"0.6046685\",\n \"0.60456914\",\n \"0.60389274\",\n \"0.60296196\",\n \"0.6016741\",\n \"0.6014323\",\n \"0.6006023\",\n \"0.6005027\",\n \"0.6003027\",\n \"0.5979912\",\n \"0.5961824\",\n \"0.5956678\",\n \"0.5943965\",\n \"0.59347427\",\n \"0.5933835\",\n \"0.5932359\",\n \"0.5931599\",\n \"0.59312373\",\n \"0.5929317\",\n \"0.59215724\",\n \"0.59172827\",\n \"0.59142476\",\n \"0.59110934\",\n \"0.5910548\",\n \"0.59105396\",\n \"0.58923525\",\n \"0.58773994\",\n \"0.58685666\",\n \"0.5866035\",\n \"0.5863875\",\n \"0.5861842\",\n \"0.5853176\",\n \"0.584627\",\n \"0.58330846\",\n \"0.5828725\",\n \"0.5826037\",\n \"0.5801187\",\n \"0.579863\",\n \"0.5797533\",\n \"0.5796435\",\n \"0.57956207\",\n \"0.57952815\",\n \"0.5793834\",\n \"0.5791517\",\n \"0.5790564\",\n \"0.5786417\",\n \"0.5785801\",\n \"0.57843965\",\n \"0.5761132\",\n \"0.5760728\",\n \"0.5742378\",\n \"0.5740169\",\n \"0.5739339\",\n \"0.5735414\",\n \"0.5728407\",\n \"0.5725174\",\n \"0.57228625\",\n \"0.572061\",\n \"0.57076263\",\n \"0.57075876\",\n \"0.5707127\",\n \"0.56984466\",\n \"0.56975186\",\n \"0.5694521\",\n \"0.5693716\",\n \"0.5687227\",\n \"0.56780326\",\n \"0.5674358\",\n \"0.5671931\",\n \"0.5668662\",\n \"0.56664217\",\n \"0.56635284\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6004114"},"document_rank":{"kind":"string","value":"36"}}},{"rowIdx":991,"cells":{"query":{"kind":"string","value":"remove node handles from the map used to store them as they disconnect"},"document":{"kind":"string","value":"func (m *Master) RemoveNodeOnDeath(nh *NodeHandle) {\n\tlogger.Debug(\"RemoveNodeOnDeath(%v)\", nh.NodeId)\n\t<-nh.Con.DiedChan\n\tm.nodeMu.Lock()\n\tdelete(m.NodeHandles, nh.NodeId)\n\tm.nodeMu.Unlock()\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func cbRemoveConnection(hConn C.MQHCONN) {\n\t// Remove all of the hObj values for this hconn\n\tkey := makePartialKey(hConn)\n\tmapLock()\n\tfor k, _ := range cbMap {\n\t\tif strings.HasPrefix(k, key) {\n\t\t\tdelete(cbMap, k)\n\t\t}\n\t}\n\tmapUnlock()\n}","func (g *Graph) cleanNodes() {\n\tcleaned := []*Node{}\n\n\tfor _, node := range g.Nodes {\n\t\tif node.Kind == \"cm\" || node.Kind == \"secret\" {\n\t\t\t_, isSource := g.linkSources[node.Uid]\n\t\t\tif !isSource {\n\t\t\t\t_, isTarget := g.linkTargets[node.Uid]\n\t\t\t\tif !isTarget {\n\t\t\t\t\t// this node is a cm or secret and is not linked to\n\t\t\t\t\t// anything else\n\t\t\t\t\tdelete(g.nodeMap, node.Uid)\n\t\t\t\t\tdelete(g.nameMap, nodeTitle(node.Kind, node.Name))\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcleaned = append(cleaned, node)\n\t}\n\tg.Nodes = cleaned\n}","func (m *mapReact) Clean() {\n\tm.ro.Lock()\n\tm.ma = make(map[SenderDetachCloser]bool)\n\tm.ro.Unlock()\n}","func keepNodes(s *srvNodeInfo) {\n\tfor {\n\t\ttime.Sleep(time.Second * time.Duration(DefaultDuration))\n\t\tkillNodes := make([]int32, 0)\n\t\tnmmu.Lock()\n\t\tfor k, eni := range s.nodeMap {\n\t\t\tsub := time.Now().Sub(eni.LastAlive) / time.Second\n\t\t\tif sub > time.Duration(MaxDurationCount*DefaultDuration) {\n\t\t\t\tkillNodes = append(killNodes, k)\n\t\t\t}\n\t\t}\n\n\t\tif len(killNodes) > 0 {\n\t\t\t// remove nodes\n\t\t\t// flush nodelist\n\t\t\tlog.Printf(\"Kill Nodes by SynerexServer Timeout %#v\", killNodes)\n\t\t\tfor _, k := range killNodes {\n\t\t\t\t// we need to remove k from sxProfile\n\t\t\t\tni := s.nodeMap[k]\n\t\t\t\tif ni.NodeType == nodepb.NodeType_SERVER { // remove server from sxProfile\n\t\t\t\t\tfor jj, sv := range sxProfile {\n\t\t\t\t\t\tif sv.NodeId == k {\n\t\t\t\t\t\t\tsxProfile = append(sxProfile[:jj], sxProfile[jj+1:]...)\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tdelete(s.nodeMap, k)\n\t\t\t}\n\t\t\t// we need to notify killed nodes to synerex server to clean channels\n\t\t\taddPendingNodesToServers(killNodes)\n\t\t}\n\t\tnmmu.Unlock()\n\t\tif len(killNodes) > 0 {\n\t\t\tsaveNodeMap(s)\n\t\t}\n\t}\n}","func (e *Entry) remove(c connection.Connection) {\n\te.connSync.Lock()\n\tdefer e.connSync.Unlock()\n\tif _, ok := e.idle[c.String()]; ok {\n\t\tc.Remove(e.listener[c.String()])\n\t\tdelete(e.idle, c.String())\n\t\tdelete(e.listener, c.String())\n\t}\n\treturn\n}","func (h *MapInt16ToUint32) Clear() {\n\tfor i, e := range h.slots {\n\t\tif e != nil {\n\t\t\tfor e != nil {\n\t\t\t\tn := e.next\n\t\t\t\th.free(e)\n\t\t\t\te = n\n\t\t\t}\n\t\t\th.slots[i] = nil\n\t\t}\n\t}\n\th.used = 0\n}","func (pm partitionMap) cleanup() {\n\tfor ns, partitions := range pm {\n\t\tfor i := range partitions.Replicas {\n\t\t\tfor j := range partitions.Replicas[i] {\n\t\t\t\tpartitions.Replicas[i][j] = nil\n\t\t\t}\n\t\t\tpartitions.Replicas[i] = nil\n\t\t}\n\n\t\tpartitions.Replicas = nil\n\t\tpartitions.regimes = nil\n\n\t\tdelete(pm, ns)\n\t}\n}","func (o *Overlay) nodeDelete(tok *Token) {\n\ttni, ok := o.instances[tok.ID()]\n\tif !ok {\n\t\tlog.Lvlf2(\"Node %x already gone\", tok.ID())\n\t\treturn\n\t}\n\tlog.Lvl4(\"Closing node\", tok.ID())\n\terr := tni.closeDispatch()\n\tif err != nil {\n\t\tlog.Error(\"Error while closing node:\", err)\n\t}\n\tdelete(o.instances, tok.ID())\n\t// mark it done !\n\to.instancesInfo[tok.ID()] = true\n}","func DisconnectNodes(parent, child Node) {\n\tparent.DelChild(child)\n\tchild.DelParent(parent)\n}","func (h *MapInt16ToUint8) Clear() {\n\tfor i, e := range h.slots {\n\t\tif e != nil {\n\t\t\tfor e != nil {\n\t\t\t\tn := e.next\n\t\t\t\th.free(e)\n\t\t\t\te = n\n\t\t\t}\n\t\t\th.slots[i] = nil\n\t\t}\n\t}\n\th.used = 0\n}","func (h *MapInt16ToUint) Clear() {\n\tfor i, e := range h.slots {\n\t\tif e != nil {\n\t\t\tfor e != nil {\n\t\t\t\tn := e.next\n\t\t\t\th.free(e)\n\t\t\t\te = n\n\t\t\t}\n\t\t\th.slots[i] = nil\n\t\t}\n\t}\n\th.used = 0\n}","func (h *MapInt16ToUint16) Clear() {\n\tfor i, e := range h.slots {\n\t\tif e != nil {\n\t\t\tfor e != nil {\n\t\t\t\tn := e.next\n\t\t\t\th.free(e)\n\t\t\t\te = n\n\t\t\t}\n\t\t\th.slots[i] = nil\n\t\t}\n\t}\n\th.used = 0\n}","func delExternalClientBlackholeFromNodes(nodes []v1.Node, routingTable, externalV4, externalV6 string, useV4 bool) {\n\tfor _, node := range nodes {\n\t\tif useV4 {\n\t\t\tout, err := runCommand(containerRuntime, \"exec\", node.Name, \"ip\", \"route\", \"del\", \"blackhole\", externalV4, \"table\", routingTable)\n\t\t\tframework.ExpectNoError(err, fmt.Sprintf(\"failed to delete blackhole route to %s on node %s table %s, out: %s\", externalV4, node.Name, routingTable, out))\n\t\t\tcontinue\n\t\t}\n\t\tout, err := runCommand(containerRuntime, \"exec\", node.Name, \"ip\", \"route\", \"del\", \"blackhole\", externalV6, \"table\", routingTable)\n\t\tframework.ExpectNoError(err, fmt.Sprintf(\"failed to delete blackhole route to %s on node %s table %s, out: %s\", externalV6, node.Name, routingTable, out))\n\t}\n}","func (n *notifs) ListenSmapChanged() {\n\tif !n.p.ClusterStarted() {\n\t\treturn\n\t}\n\tsmap := n.p.owner.smap.get()\n\tif n.smapVer >= smap.Version {\n\t\treturn\n\t}\n\tn.smapVer = smap.Version\n\n\tn.nls.RLock()\n\tif n.nls.len() == 0 {\n\t\tn.nls.RUnlock()\n\t\treturn\n\t}\n\tvar (\n\t\tremnl = make(map[string]nl.Listener)\n\t\tremid = make(cos.StrKVs)\n\t)\n\tfor uuid, nl := range n.nls.m {\n\t\tnl.RLock()\n\t\tfor sid := range nl.ActiveNotifiers() {\n\t\t\tif node := smap.GetActiveNode(sid); node == nil {\n\t\t\t\tremnl[uuid] = nl\n\t\t\t\tremid[uuid] = sid\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tnl.RUnlock()\n\t}\n\tn.nls.RUnlock()\n\tif len(remnl) == 0 {\n\t\treturn\n\t}\n\tnow := time.Now().UnixNano()\n\tfor uuid, nl := range remnl {\n\t\ts := fmt.Sprintf(\"%s: stop waiting for %s\", n.p.si, nl)\n\t\tsid := remid[uuid]\n\t\terr := &errNodeNotFound{s, sid, n.p.si, smap}\n\t\tnl.Lock()\n\t\tnl.AddErr(err)\n\t\tnl.SetAborted()\n\t\tnl.Unlock()\n\t}\n\tn.fin.Lock()\n\tfor uuid, nl := range remnl {\n\t\tdebug.Assert(nl.UUID() == uuid)\n\t\tn.fin.add(nl, true /*locked*/)\n\t}\n\tn.fin.Unlock()\n\tn.nls.Lock()\n\tfor _, nl := range remnl {\n\t\tn.del(nl, true /*locked*/)\n\t}\n\tn.nls.Unlock()\n\n\tfor uuid, nl := range remnl {\n\t\tnl.Callback(nl, now)\n\t\t// cleanup\n\t\tdelete(remnl, uuid)\n\t\tdelete(remid, uuid)\n\t}\n}","func (s *nodeSet) remove(tn *treeNode) {\n\tif nPtr, has := s.itemMap[tn]; has {\n\t\tremoveNode(nPtr)\n\t\tdelete(s.itemMap, tn)\n\t}\n}","func (h *TunnelHandler) Clean() {\n\th.mu.Lock()\n\tremoved := make([]string, 0, len(h.tunnels))\n\tfor id, tunnel := range h.tunnels {\n\t\tselect {\n\t\tcase <-tunnel.chDone:\n\t\t\tremoved = append(removed, id)\n\t\tdefault:\n\t\t}\n\t}\n\th.mu.Unlock()\n\n\tfor _, id := range removed {\n\t\th.remove(id)\n\t}\n}","func (w *wlockMap) unregister(ino uint64) {\n\tw.Lock()\n\tdefer w.Unlock()\n\n\tr := w.inodeLocks[ino]\n\tr.refCnt--\n\tif r.refCnt == 0 {\n\t\tdelete(w.inodeLocks, ino)\n\t}\n}","func (pm *Map) Clear() {\n\tpm.root.decref()\n\tpm.root = nil\n}","func (h *MapInt16ToUint64) Clear() {\n\tfor i, e := range h.slots {\n\t\tif e != nil {\n\t\t\tfor e != nil {\n\t\t\t\tn := e.next\n\t\t\t\th.free(e)\n\t\t\t\te = n\n\t\t\t}\n\t\t\th.slots[i] = nil\n\t\t}\n\t}\n\th.used = 0\n}","func (diffStore *utxoDiffStore) clearOldEntries() {\n\tdiffStore.mtx.HighPriorityWriteLock()\n\tdefer diffStore.mtx.HighPriorityWriteUnlock()\n\n\tvirtualBlueScore := diffStore.dag.VirtualBlueScore()\n\tminBlueScore := virtualBlueScore - maxBlueScoreDifferenceToKeepLoaded\n\tif maxBlueScoreDifferenceToKeepLoaded > virtualBlueScore {\n\t\tminBlueScore = 0\n\t}\n\n\ttips := diffStore.dag.virtual.tips()\n\n\ttoRemove := make(map[*blockNode]struct{})\n\tfor node := range diffStore.loaded {\n\t\tif node.blueScore < minBlueScore && !tips.contains(node) {\n\t\t\ttoRemove[node] = struct{}{}\n\t\t}\n\t}\n\tfor node := range toRemove {\n\t\tdelete(diffStore.loaded, node)\n\t}\n}","func removeEdgesFrom(node string, graph map[edge]struct{}) {\n\tfor edge := range graph {\n\t\tif edge.from == node {\n\t\t\tdelete(graph, edge)\n\t\t}\n\t}\n}","func (s *nodeSet) clear() {\n\ts.head.right = s.tail\n\ts.tail.left = s.head\n\ts.itemMap = make(map[*treeNode]*doubleListNode)\n}","func (w *Widget) ClearMappings(app gowid.IApp) {\n\tfor k := range w.kmap {\n\t\tdelete(w.kmap, k)\n\t}\n}","func (h *MapInt16ToUint8) Remove(k int16) {\n\tp := &h.slots[int(k)&h.mask]\n\tvar parent *entryInt16ToUint8\n\tfor e := *p; e != nil; e = e.next {\n\t\tif e.k == k {\n\t\t\tif parent == nil { // head\n\t\t\t\tif e.next == nil { // last in chain\n\t\t\t\t\th.used--\n\t\t\t\t}\n\t\t\t\t*p = e.next\n\t\t\t} else {\n\t\t\t\tparent.next = e.next\n\t\t\t}\n\t\t\th.free(e)\n\t\t\treturn\n\t\t}\n\t\tparent = e\n\t}\n}","func (hm *MyHashMap) Remove(key int) {\n\tvar prev *Node\n\tentry := hm.Arrays[hm.HashFunc(key)]\n\tfor entry != nil && entry.Key != key {\n\t\tprev = entry\n\t\tentry = entry.Next\n\t}\n\n\tif entry == nil {\n\t\treturn\n\t}\n\n\tif prev == nil {\n\t\thm.Arrays[hm.HashFunc(key)] = entry.Next\n\t} else {\n\t\tprev.Next = entry.Next\n\t}\n\n\treturn\n}","func (h *MapInt16ToUint32) Remove(k int16) {\n\tp := &h.slots[int(k)&h.mask]\n\tvar parent *entryInt16ToUint32\n\tfor e := *p; e != nil; e = e.next {\n\t\tif e.k == k {\n\t\t\tif parent == nil { // head\n\t\t\t\tif e.next == nil { // last in chain\n\t\t\t\t\th.used--\n\t\t\t\t}\n\t\t\t\t*p = e.next\n\t\t\t} else {\n\t\t\t\tparent.next = e.next\n\t\t\t}\n\t\t\th.free(e)\n\t\t\treturn\n\t\t}\n\t\tparent = e\n\t}\n}","func (this *MyHashMap) Remove(key int) {\n\thashCode := key % 1111\n\ttemp := &Node{\n\t\t0,\n\t\t0,\n\t\tthis.buckets[hashCode],\n\t}\n\tpre := temp\n\tcur := temp.Next\n\tfor cur != nil {\n\t\tif cur.K == key {\n\t\t\tpre.Next = cur.Next\n\t\t\tbreak\n\t\t}\n\t\tpre, cur = cur, cur.Next\n\t}\n\tthis.buckets[hashCode] = temp.Next\n}","func deletePathMap(pathMapsPtr *[]n.ApplicationGatewayURLPathMap, resourceID *string) *[]n.ApplicationGatewayURLPathMap {\n\tpathMaps := *pathMapsPtr\n\tdeleteIdx := -1\n\tfor idx, pathMap := range pathMaps {\n\t\tif *pathMap.ID == *resourceID {\n\t\t\tklog.V(5).Infof(\"[brownfield] Deleting %s\", *resourceID)\n\t\t\tdeleteIdx = idx\n\t\t}\n\t}\n\n\tif deleteIdx != -1 {\n\t\tpathMaps[deleteIdx] = pathMaps[len(pathMaps)-1]\n\t\t*pathMapsPtr = pathMaps[:len(pathMaps)-1]\n\t}\n\n\treturn pathMapsPtr\n}","func (this *MyHashMap) Remove(key int) {\n\tkey = this.hash(key)\n\tif this.ht[key] == nil {\n\t\treturn\n\t}\n\tif this.ht[key].k == key {\n\t\tthis.ht[key] = this.ht[key].next\n\t\treturn\n\t}\n\tfor node := this.ht[key]; node.next != nil; node = node.next {\n\t\tif node.next.k == key {\n\t\t\tnode.next = node.next.next\n\t\t\treturn\n\t\t}\n\t}\n}","func (this *MyHashMap) Remove(key int) {\n\ti := this.hashKey(key)\n\tnode := &this.list[i]\n\n\tif node.key == key {\n\n\t\tif node.next == nil {\n\t\t\t*node = LinkNode{\n\t\t\t\tvalue: -1,\n\t\t\t}\n\t\t} else {\n\t\t\t*node = *node.next\n\t\t}\n\n\t} else {\n\n\t\tupNode := node\n\n\t\tfor node.next != nil {\n\t\t\tupNode = node\n\t\t\tnode = node.next\n\t\t\tif node.key == key {\n\t\t\t\tupNode.next = node.next\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t}\n\t}\n}","func (server *Server) remove(client *client) {\n\tserver.clientMutex.Lock()\n\tdefer server.clientMutex.Unlock()\n\n\t// remove the connections from the clients array\n\tfor i, check := range server.clients {\n\t\tif check == client {\n\t\t\tserver.clients = append(server.clients[:i], server.clients[i+1:]...)\n\t\t\tserver.clientIDs = append(server.clientIDs[:i], server.clientIDs[i+1:]...)\n\t\t}\n\t}\n\n\tclient.dataStreamer.CloseConnection()\n}","func (c *RpcClusterClient) clear(addrs []string) {\n\tc.Lock()\n\tvar rm []*poolWeightClient\n\tfor _, cli := range c.clients {\n\t\tvar has_cli bool\n\t\tfor _, addr := range addrs {\n\t\t\tif cli.endpoint == addr {\n\t\t\t\thas_cli = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif !has_cli {\n\t\t\trm = append(rm, cli)\n\t\t} else if cli.errcnt > 0 {\n\t\t\t/*\n\t\t\t\tif cli.weight >= errWeight*uint64(cli.errcnt) {\n\t\t\t\t\tcli.weight -= errWeight * uint64(cli.errcnt)\n\t\t\t\t\tcli.errcnt = 0\n\t\t\t\t\tif c.Len() >= minHeapSize {\n\t\t\t\t\t\t// cli will and only up, so it's ok here.\n\t\t\t\t\t\theap.Fix(c, cli.index)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t*/\n\t\t}\n\t}\n\n\tfor _, cli := range rm {\n\t\t// p will up, down, or not move, so append it to rm list.\n\t\tc.Debugf(\"remove cli: %s\", cli.endpoint)\n\n\t\theap.Remove(c, cli.index)\n\t\tcli.pool.Close()\n\t}\n\tc.Unlock()\n}","func (e *entry) remove() {\n\te.prev.next = e.next\n\te.next.prev = e.prev\n\te.prev = nil\n\te.next = nil\n}","func (h *MapInt16ToInt8) Remove(k int16) {\n\tp := &h.slots[int(k)&h.mask]\n\tvar parent *entryInt16ToInt8\n\tfor e := *p; e != nil; e = e.next {\n\t\tif e.k == k {\n\t\t\tif parent == nil { // head\n\t\t\t\tif e.next == nil { // last in chain\n\t\t\t\t\th.used--\n\t\t\t\t}\n\t\t\t\t*p = e.next\n\t\t\t} else {\n\t\t\t\tparent.next = e.next\n\t\t\t}\n\t\t\th.free(e)\n\t\t\treturn\n\t\t}\n\t\tparent = e\n\t}\n}","func userDisconnect(username string) {\n\tfor key := range connMap {\n\t\tconnMap[key].Write([]byte(\"TCCHAT_USEROUT\\t\" + username + \"\\n\"))\n\t}\n\n\tvar temp = connMap[username] // Temporary copy of the connection associated to *username in connMap\n\tdelete(connMap, username) // Delete the connection associated to *username in connMap\n\tdelete(userMap, temp) // Delete the username associated to the previously deleted connection in userMap\n\tserverShutdown(temp) // Check whether or not to shutdown the server\n}","func (n *notifier) removeFD(fd int32) {\n\tn.mu.Lock()\n\tdefer n.mu.Unlock()\n\n\t// Remove from map, then from epoll object.\n\tn.waitFD(fd, n.fdMap[fd], 0)\n\tdelete(n.fdMap, fd)\n}","func (msh *Mesh) handleOrphanBlocks(blk *types.Block) {\n\tmsh.mutex.Lock()\n\tdefer msh.mutex.Unlock()\n\tif _, ok := msh.orphanBlocks[blk.Layer()]; !ok {\n\t\tmsh.orphanBlocks[blk.Layer()] = make(map[types.BlockID]struct{})\n\t}\n\tmsh.orphanBlocks[blk.Layer()][blk.ID()] = struct{}{}\n\tmsh.With().Debug(\"added block to orphans\", blk.ID())\n\tfor _, b := range append(blk.ForDiff, append(blk.AgainstDiff, blk.NeutralDiff...)...) {\n\t\tfor layerID, layermap := range msh.orphanBlocks {\n\t\t\tif _, has := layermap[b]; has {\n\t\t\t\tmsh.With().Debug(\"delete block from orphans\", b)\n\t\t\t\tdelete(layermap, b)\n\t\t\t\tif len(layermap) == 0 {\n\t\t\t\t\tdelete(msh.orphanBlocks, layerID)\n\t\t\t\t}\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t}\n}","func (h *MapInt16ToInt16) Clear() {\n\tfor i, e := range h.slots {\n\t\tif e != nil {\n\t\t\tfor e != nil {\n\t\t\t\tn := e.next\n\t\t\t\th.free(e)\n\t\t\t\te = n\n\t\t\t}\n\t\t\th.slots[i] = nil\n\t\t}\n\t}\n\th.used = 0\n}","func removeDisconnected(clients []Client) []Client {\n\tj := 0\n\tfor i, client := range clients {\n\t\tselect {\n\t\tcase <-client.DisconnectCh():\n\t\t\t// Unset in backing array.\n\t\t\tclients[i] = nil\n\t\tdefault:\n\t\t\tclients[j] = client\n\t\t\tj++\n\t\t}\n\t}\n\treturn clients[:j]\n}","func (hs *PeerHandleMapSync) Delete(name string) {\n\ths.Lock()\n\t// TODO-WORKSHOP-STEP-5: This code should remove the handle from the PeerHandleMap based on the key name\n\ths.Unlock()\n\tfmt.Println(\"UserHandle Removed for \", name)\n}","func (n *node) nodeRemove() {\n\tn.evalTotal = n.evalTotal - n.entry.eval\n\tn.occupied = false\n\tparent := n.parent\n\tfor parent != nil {\n\t\tparent.evalTotal = parent.evalTotal - n.entry.eval\n\t\tparent = parent.parent\n\t}\n}","func (f *freeClientPool) disconnect(address string) {\n\tf.lock.Lock()\n\tdefer f.lock.Unlock()\n\n\tif f.closed {\n\t\treturn\n\t}\n\te := f.addressMap[address]\n\tnow := f.clock.Now()\n\tif !e.connected {\n\t\tlog.Debug(\"Client already disconnected\", \"address\", address)\n\t\treturn\n\t}\n\n\tf.connPool.Remove(e.index)\n\tf.calcLogUsage(e, now)\n\te.connected = false\n\tf.disconnPool.Push(e, -e.logUsage)\n\tlog.Debug(\"Client disconnected\", \"address\", address)\n}","func (m *mru) evict() {\n\tif len(m.hash) == 0 {\n\t\treturn\n\t}\n\tif len(m.hash) == 1 {\n\t\tnode := m.head\n\t\tm.head = nil\n\t\tm.last = nil\n\t\tdelete(m.hash, node.key)\n\t\treturn\n\t}\n\tdelete(m.hash, m.head.key)\n\tm.head.next.previous = nil\n\tm.head = m.head.next\n}","func (h *MapInt16ToInt8) Clear() {\n\tfor i, e := range h.slots {\n\t\tif e != nil {\n\t\t\tfor e != nil {\n\t\t\t\tn := e.next\n\t\t\t\th.free(e)\n\t\t\t\te = n\n\t\t\t}\n\t\t\th.slots[i] = nil\n\t\t}\n\t}\n\th.used = 0\n}","func (h *MapInt16ToUint) Remove(k int16) {\n\tp := &h.slots[int(k)&h.mask]\n\tvar parent *entryInt16ToUint\n\tfor e := *p; e != nil; e = e.next {\n\t\tif e.k == k {\n\t\t\tif parent == nil { // head\n\t\t\t\tif e.next == nil { // last in chain\n\t\t\t\t\th.used--\n\t\t\t\t}\n\t\t\t\t*p = e.next\n\t\t\t} else {\n\t\t\t\tparent.next = e.next\n\t\t\t}\n\t\t\th.free(e)\n\t\t\treturn\n\t\t}\n\t\tparent = e\n\t}\n}","func (h *MapInt16ToUint16) Remove(k int16) {\n\tp := &h.slots[int(k)&h.mask]\n\tvar parent *entryInt16ToUint16\n\tfor e := *p; e != nil; e = e.next {\n\t\tif e.k == k {\n\t\t\tif parent == nil { // head\n\t\t\t\tif e.next == nil { // last in chain\n\t\t\t\t\th.used--\n\t\t\t\t}\n\t\t\t\t*p = e.next\n\t\t\t} else {\n\t\t\t\tparent.next = e.next\n\t\t\t}\n\t\t\th.free(e)\n\t\t\treturn\n\t\t}\n\t\tparent = e\n\t}\n}","func (h *MapInt16ToUint64) Remove(k int16) {\n\tp := &h.slots[int(k)&h.mask]\n\tvar parent *entryInt16ToUint64\n\tfor e := *p; e != nil; e = e.next {\n\t\tif e.k == k {\n\t\t\tif parent == nil { // head\n\t\t\t\tif e.next == nil { // last in chain\n\t\t\t\t\th.used--\n\t\t\t\t}\n\t\t\t\t*p = e.next\n\t\t\t} else {\n\t\t\t\tparent.next = e.next\n\t\t\t}\n\t\t\th.free(e)\n\t\t\treturn\n\t\t}\n\t\tparent = e\n\t}\n}","func (h *MapInt16ToInt32) Clear() {\n\tfor i, e := range h.slots {\n\t\tif e != nil {\n\t\t\tfor e != nil {\n\t\t\t\tn := e.next\n\t\t\t\th.free(e)\n\t\t\t\te = n\n\t\t\t}\n\t\t\th.slots[i] = nil\n\t\t}\n\t}\n\th.used = 0\n}","func (em edgeMap) remove(from, to *Vertex) error {\n\temMu.Lock()\n\tdefer emMu.Unlock()\n\n\tif em == nil {\n\t\tem = make(edgeMap)\n\t}\n\tif !em.containsLocked(from, to) {\n\t\treturn fmt.Errorf(\"edge (%s, %s) not found\", from.Label, to.Label)\n\t}\n\tdelete(em[from.Label], to.Label)\n\treturn nil\n}","func RemoveCounterNode(w http.ResponseWriter, r *http.Request) {\n\t//params := mux.Vars(r)\n\tvar node CounterNode\n\t_ = json.NewDecoder(r.Body).Decode(&node)\n\tdelete(counternodes, node.EndPoint)\n\tfmt.Println(\"node removed : \" + node.EndPoint + \" : \" + node.ID)\n\t\n\tw.WriteHeader(http.StatusOK)\n}","func (h *MapInt16ToInt32) Remove(k int16) {\n\tp := &h.slots[int(k)&h.mask]\n\tvar parent *entryInt16ToInt32\n\tfor e := *p; e != nil; e = e.next {\n\t\tif e.k == k {\n\t\t\tif parent == nil { // head\n\t\t\t\tif e.next == nil { // last in chain\n\t\t\t\t\th.used--\n\t\t\t\t}\n\t\t\t\t*p = e.next\n\t\t\t} else {\n\t\t\t\tparent.next = e.next\n\t\t\t}\n\t\t\th.free(e)\n\t\t\treturn\n\t\t}\n\t\tparent = e\n\t}\n}","func (this *MyHashMap) Remove(key int) {\n\tindex := this.nodeIndex(key)\n\tv := this.table[index]\n\tif v == nil {\n\t\treturn\n\t}\n\tif v.key == key {\n\t\tthis.table[index] = v.next\n\t\tthis.size--\n\t\treturn\n\t}\n\tfor v != nil && v.next != nil {\n\t\tif v.next.key == key {\n\t\t\tv.next = v.next.next\n\t\t\tthis.size--\n\t\t\treturn\n\t\t}\n\t\tv = v.next\n\t}\n}","func (r *Registry) Clean(d time.Duration) {\n\tnow := clock.SyncedTime()\n\n\tfor _, v := range r.NodesView() {\n\t\tv.cMutex.Lock()\n\t\t// loop over the conflicts\n\t\tfor id, c := range v.Conflicts {\n\t\t\tif c.Timestamp.Add(d).Before(now) {\n\t\t\t\tdelete(v.Conflicts, id)\n\t\t\t}\n\t\t}\n\t\tv.cMutex.Unlock()\n\n\t\tv.tMutex.Lock()\n\t\t// loop over the timestamps\n\t\tfor id, t := range v.Timestamps {\n\t\t\tif t.Timestamp.Add(d).Before(now) {\n\t\t\t\tdelete(v.Timestamps, id)\n\t\t\t}\n\t\t}\n\t\tv.tMutex.Unlock()\n\t}\n}","func (s *SignalMonkey) Remove(fn *SignalHandler) {\n\ts.mutex.Lock()\n\tdefer s.mutex.Unlock()\n\tfor i, x := range s.handlers {\n\t\tif x.ID == fn.ID {\n\t\t\t// Delete preserving order from here:\n\t\t\t// https://code.google.com/p/go-wiki/wiki/SliceTricks\n\t\t\tcopy(s.handlers[i:], s.handlers[i+1:])\n\t\t\ts.handlers[len(s.handlers)-1] = nil // or the zero value of T\n\t\t\ts.handlers = s.handlers[:len(s.handlers)-1]\n\t\t}\n\t}\n}","func (h *MapInt16ToInt) Clear() {\n\tfor i, e := range h.slots {\n\t\tif e != nil {\n\t\t\tfor e != nil {\n\t\t\t\tn := e.next\n\t\t\t\th.free(e)\n\t\t\t\te = n\n\t\t\t}\n\t\t\th.slots[i] = nil\n\t\t}\n\t}\n\th.used = 0\n}","func removeMasterQueue(conn *connection) {\n for e := masterQueue.Front(); e != nil; e = e.Next() {\n curr := e.Value.(*connection)\n if curr == conn {\n masterQueue.Remove(e)\n return\n }\n }\n}","func (cache *Cache) removeNodeInfoFromList(name string) {\n\tni, ok := cache.nodes[name]\n\tif !ok {\n\t\tklog.Errorf(\"No NodeInfo with name %v found in the cache\", name)\n\t\treturn\n\t}\n\n\tif ni.prev != nil {\n\t\tni.prev.next = ni.next\n\t}\n\tif ni.next != nil {\n\t\tni.next.prev = ni.prev\n\t}\n\t// if the removed item was at the head, we must update the head.\n\tif ni == cache.headNode {\n\t\tcache.headNode = ni.next\n\t}\n\n\tdelete(cache.nodes, name)\n}","func removeRBDLocks(instance *ec2.Instance) {\n\taddress, found := hosts[instance.InstanceId]\n\tif !found {\n\t\tglog.Errorf(\"The instance: %s was not found in the hosts map\", instance.InstanceId)\n\t\treturn\n\t}\n\tglog.Infof(\"Instance: %s, address: %s, state: %s, checking for locks\", instance.InstanceId, address, instance.State.Name)\n\n\tvar deleted = false\n\n\tfor i := 0; i < 3; i++ {\n\t\terr := rbdClient.UnlockClient(address)\n\t\tif err != nil {\n\t\t\tglog.Errorf(\"Failed to unlock the images, attempting again if possible\")\n\t\t\t<-time.After(time.Duration(5) * time.Second)\n\t\t}\n\t\tdeleted = true\n\t}\n\n\tif !deleted {\n\t\tglog.Errorf(\"Failed to unlock any images that could have been held by client: %s\", address)\n\t}\n\n\t// step: delete from the hosts map\n\tdelete(hosts, instance.InstanceId)\n}","func (self *NodeInfoMaps) WatchNodeInfoMap() {\n\t_, _, ch, err := self.zk.GetZkConn().ChildrenW(\"/yundis/nodes\")\n\tif err != nil {\n\t\tlog.Errorf(\"Can not watch path /yundis/nodes, err:%s\", err)\n\t}\n\tgo func() {\n\t\tfor {\n\t\t\tevent := <-ch\n\t\t\tlog.Infof(\"node list change, %+v\", event)\n\t\t\tchildren, _, ch1, err1 := self.zk.GetZkConn().ChildrenW(\"/yundis/nodes\")\n\t\t\tif err1 == nil {\n\t\t\t\tch = ch1\n\t\t\t\t//handle the node list change event\n\t\t\t\tlog.Infof(\"node list changed : %s\", children)\n\t\t\t\tinfoMap := self.getNodeInfoMapFromZk()\n\t\t\t\t//change the slotinfo state.\n\t\t\t\tlog.Info(\"The node list changed, begin to change the affected slot's info.\")\n\t\t\t\tself.SetNodeInfoMap(infoMap) //refresh nodeinfo map by new zk data.\n\t\t\t\tself.ModifySlotState(infoMap)\n\t\t\t\tlog.Info(\"Refresh nodeinfo map by new zk data.\")\n\t\t\t} else {\n\t\t\t\tlog.Errorf(\"Can not watching the children of /yundis/nodes, err:%s\", err1)\n\t\t\t\tbreak\n\t\t\t}\n\t\t\ttime.Sleep(time.Second)\n\t\t}\n\t}()\n}","func (h *MapInt16ToInt64) Remove(k int16) {\n\tp := &h.slots[int(k)&h.mask]\n\tvar parent *entryInt16ToInt64\n\tfor e := *p; e != nil; e = e.next {\n\t\tif e.k == k {\n\t\t\tif parent == nil { // head\n\t\t\t\tif e.next == nil { // last in chain\n\t\t\t\t\th.used--\n\t\t\t\t}\n\t\t\t\t*p = e.next\n\t\t\t} else {\n\t\t\t\tparent.next = e.next\n\t\t\t}\n\t\t\th.free(e)\n\t\t\treturn\n\t\t}\n\t\tparent = e\n\t}\n}","func (server *TcpServer) disconnect(client *Client) {\n\tserver.mutex.Lock()\n\tdefer server.mutex.Unlock()\n\tfor i, check := range server.clients {\n\t\tif check == client {\n\t\t\tserver.clients = append(server.clients[:i], server.clients[i+1:]...)\n\t\t}\n\t}\n\tclient.Close()\n}","func (r *Raft) removeNode(id uint64) {\n\t// Your Code Here (3A).\n}","func (r *Raft) removeNode(id uint64) {\n\t// Your Code Here (3A).\n}","func (h *MapInt16ToInt) Remove(k int16) {\n\tp := &h.slots[int(k)&h.mask]\n\tvar parent *entryInt16ToInt\n\tfor e := *p; e != nil; e = e.next {\n\t\tif e.k == k {\n\t\t\tif parent == nil { // head\n\t\t\t\tif e.next == nil { // last in chain\n\t\t\t\t\th.used--\n\t\t\t\t}\n\t\t\t\t*p = e.next\n\t\t\t} else {\n\t\t\t\tparent.next = e.next\n\t\t\t}\n\t\t\th.free(e)\n\t\t\treturn\n\t\t}\n\t\tparent = e\n\t}\n}","func (h *MapInt16ToInt64) Clear() {\n\tfor i, e := range h.slots {\n\t\tif e != nil {\n\t\t\tfor e != nil {\n\t\t\t\tn := e.next\n\t\t\t\th.free(e)\n\t\t\t\te = n\n\t\t\t}\n\t\t\th.slots[i] = nil\n\t\t}\n\t}\n\th.used = 0\n}","func (m *manager) Unsubscribe(nh datapath.NodeHandler) {\n\tm.nodeHandlersMu.Lock()\n\tdelete(m.nodeHandlers, nh)\n\tm.nodeHandlersMu.Unlock()\n}","func (h *MapInt16ToInt16) Remove(k int16) {\n\tp := &h.slots[int(k)&h.mask]\n\tvar parent *entryInt16ToInt16\n\tfor e := *p; e != nil; e = e.next {\n\t\tif e.k == k {\n\t\t\tif parent == nil { // head\n\t\t\t\tif e.next == nil { // last in chain\n\t\t\t\t\th.used--\n\t\t\t\t}\n\t\t\t\t*p = e.next\n\t\t\t} else {\n\t\t\t\tparent.next = e.next\n\t\t\t}\n\t\t\th.free(e)\n\t\t\treturn\n\t\t}\n\t\tparent = e\n\t}\n}","func (h *clientHub) Remove(c ClientConn) error {\n\th.Lock()\n\tdefer h.Unlock()\n\n\tuid := c.UID()\n\tuser := c.User()\n\n\tdelete(h.conns, uid)\n\n\t// try to find connection to delete, return early if not found.\n\tif _, ok := h.users[user]; !ok {\n\t\treturn nil\n\t}\n\tif _, ok := h.users[user][uid]; !ok {\n\t\treturn nil\n\t}\n\n\t// actually remove connection from hub.\n\tdelete(h.users[user], uid)\n\n\t// clean up users map if it's needed.\n\tif len(h.users[user]) == 0 {\n\t\tdelete(h.users, user)\n\t}\n\n\treturn nil\n}","func (server *Server) RemoveClient(socket *websocket.Conn) {\n\tfor i, client := range server.connections {\n\t\tif client == socket {\n\t\t\tserver.connections = append(server.connections[:i], server.connections[i+1:]...)\n\t\t\tsocket.Close()\n\t\t\tbreak\n\t\t}\n\t}\n}","func (e *neighborEntry) removeLocked() {\n\te.mu.neigh.UpdatedAt = e.cache.nic.stack.clock.NowMonotonic()\n\te.dispatchRemoveEventLocked()\n\t// Set state to unknown to invalidate this entry if it's cached in a Route.\n\te.setStateLocked(Unknown)\n\te.cancelTimerLocked()\n\t// TODO(https://gvisor.dev/issues/5583): test the case where this function is\n\t// called during resolution; that can happen in at least these scenarios:\n\t//\n\t//\t- manual address removal during resolution\n\t//\n\t//\t- neighbor cache eviction during resolution\n\te.notifyCompletionLocked(&tcpip.ErrAborted{})\n}","func closeAndRemove(f *Flamingo, conn *connection) {\n (*conn.conn).Close()\n f.cmdR.Lock()\n delete(f.cmdR.m,conn.cid)\n f.cmdR.Unlock()\n}","func (item *MapItem) Remove() {\n\tnext := item.next\n\tprev := item.prev\n\tnext.prev = prev\n\tprev.next = next\n}","func (c *HttpClusterClient) clear(addrs []string) {\n\tc.Lock()\n\tvar rm []*httpWeightClient\n\tfor _, cli := range c.clients {\n\t\tvar has_cli bool\n\t\tfor _, addr := range addrs {\n\t\t\tif cli.endpoint == addr {\n\t\t\t\thas_cli = true\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif !has_cli {\n\t\t\trm = append(rm, cli)\n\t\t} else if cli.errcnt > 0 {\n\t\t\t/*\n\t\t\t\tif cli.weight >= errWeight*uint64(cli.errcnt) {\n\t\t\t\t\tcli.weight -= errWeight * uint64(cli.errcnt)\n\t\t\t\t\tcli.errcnt = 0\n\t\t\t\t\tif c.Len() >= minHeapSize {\n\t\t\t\t\t\theap.Fix(c, cli.index)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t*/\n\t\t}\n\t}\n\n\tfor _, cli := range rm {\n\t\t// p will up, down, or not move, so append it to rm list.\n\t\theap.Remove(c, cli.index)\n\t}\n\tc.Unlock()\n}","func (c *HashRing) RemoveNode(elt string) {\n\tc.Lock()\n\tdefer c.Unlock()\n\n\tweight := c.weights[elt]\n\tfor i := 0; i < c.numberOfCubes*weight; i++ {\n\t\tdelete(c.ring, c.generateHash(c.generateKey(elt, i)))\n\t}\n\tdelete(c.members, elt)\n\tdelete(c.weights, elt)\n\tc.updateSortedRing()\n}","func d18disconnectBranch(node *d18nodeT, index int) {\n\t// Remove element by swapping with the last element to prevent gaps in array\n\tnode.branch[index] = node.branch[node.count-1]\n\tnode.branch[node.count-1].data = nil\n\tnode.branch[node.count-1].child = nil\n\tnode.count--\n}","func unRegisterTrackerInstance(connStr string) {\n\tmanagedLock.Lock()\n\tdefer managedLock.Unlock()\n\tif managedTrackerInstance[connStr] == nil {\n\t\tlogger.Info(\"tracker instance not exists\")\n\t} else {\n\t\tdelete(managedTrackerInstance, connStr)\n\t}\n}","func clearMap(store map[string]interface{}) {\n\tfor k := range store {\n\t\tdelete(store, k)\n\t}\n}","func RemoveFromCircle(node node.Node, circle *treemap.Map) {\n\n\t//Generate a string identifier for redis node\n\tnodeStr := \"localhost:\" + strconv.Itoa(node.Port)\n\n\t//use this string identifier for removing the node from the treemap\n\tcircle.Remove(Hashcode(nodeStr))\n\tfmt.Println(\"Removed Node\", nodeStr, \"Hashcode\", Hashcode(nodeStr))\n}","func (m MessageDescriptorMap) Cleanup() (deleted []string) {\n\tfor id, descriptor := range m {\n\t\tif !descriptor.Touched() {\n\t\t\tdelete(m, id)\n\t\t\tdeleted = append(deleted, id)\n\t\t}\n\t}\n\treturn\n}","func d3disconnectBranch(node *d3nodeT, index int) {\n\t// Remove element by swapping with the last element to prevent gaps in array\n\tnode.branch[index] = node.branch[node.count-1]\n\tnode.branch[node.count-1].data = nil\n\tnode.branch[node.count-1].child = nil\n\tnode.count--\n}","func (n *Node) RemoveDups1() {\n\t// i'm pretty sure this doesn't count as a temp buffer i'm not holding\n\t// data to move from one stop to another\n\tm := make(map[int]struct{})\n\tfor n.Next != nil {\n\t\tif _, ok := m[n.Data]; ok {\n\t\t\t// pointers is needed to make sure data is overwritten\n\t\t\t*n = *deleteNode(n, n.Data)\n\t\t} else {\n\t\t\tm[n.Data] = struct{}{}\n\t\t\tn = n.Next\n\t\t}\n\t}\n}","func (r *Raft) removeNode(id uint64) {\n\tif _, ok := r.Prs[id]; ok {\n\t\tdelete(r.Prs, id)\n\t\tif r.State == StateLeader {\n\t\t\tr.leaderCommit()\n\t\t}\n\t}\n\tr.PendingConfIndex = None\n}","func (n *NeighborsTable) Del(nodeID NodeID) {\n\tn.m.Del(uint64(nodeID))\n}","func d13disconnectBranch(node *d13nodeT, index int) {\n\t// Remove element by swapping with the last element to prevent gaps in array\n\tnode.branch[index] = node.branch[node.count-1]\n\tnode.branch[node.count-1].data = nil\n\tnode.branch[node.count-1].child = nil\n\tnode.count--\n}","func (hm *MyHashMap) Remove(key int) {\n\tidx := key % len(hm.HMap)\n\tcur, prev := hm.HMap[idx], &HMListNode{Next: hm.HMap[idx]}\n\tfor cur != nil {\n\t\tif cur.Key == key {\n\t\t\tif cur == hm.HMap[idx] {\n\t\t\t\thm.HMap[idx] = cur.Next\n\t\t\t} else {\n\t\t\t\tprev.Next = cur.Next\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\t\tprev, cur = cur, cur.Next\n\t}\n\n}","func removeNode(n *doc.Node) {\n\t// Check if this node exists.\n\tfor i, v := range localNodes {\n\t\tif n.ImportPath == v.ImportPath {\n\t\t\tlocalNodes = append(localNodes[:i], localNodes[i+1:]...)\n\t\t\treturn\n\t\t}\n\t}\n}","func (DummyStore) DeleteMap(key string, fields ...string) error { return nil }","func (s *Server) removeClient(c *Client) {\n\tc.conn.Close()\n\tfor i, cl := range s.clients {\n\t\tif cl == c {\n\t\t\ts.clients = append(s.clients[0:i], s.clients[i+1:]...)\n\t\t\tlog.Println(\"Client disconnected, \" + strconv.Itoa(len(s.clients)) + \" active clients\")\n\t\t\treturn\n\t\t}\n\t}\n}","func (tp *Tapestry) RemoveKeysAtNode(t *testing.T, node *Node) {\n\tfor key := range node.blobstore.blobs {\n\n\t\t// delete from Blobs\n\t\tdelete(tp.Blobs, key)\n\n\t\t// delete from Keys\n\t\ttp.RemoveKey(t, key)\n\t}\n}","func (ns Nodes) Remove() {\n\n}","func disconnect(a, b *PathNode) {\n\tif a != nil {\n\t\tif a.AdjL == b {\n\t\t\ta.AdjL = nil\n\t\t}\n\t\tif a.AdjR == b {\n\t\t\ta.AdjR = nil\n\t\t}\n\t\tif a.AdjU == b {\n\t\t\ta.AdjU = nil\n\t\t}\n\t\tif a.AdjD == b {\n\t\t\ta.AdjD = nil\n\t\t}\n\t}\n\tif b != nil {\n\t\tif b.AdjL == a {\n\t\t\tb.AdjL = nil\n\t\t}\n\t\tif b.AdjR == a {\n\t\t\tb.AdjR = nil\n\t\t}\n\t\tif b.AdjU == a {\n\t\t\tb.AdjU = nil\n\t\t}\n\t\tif b.AdjD == a {\n\t\t\tb.AdjD = nil\n\t\t}\n\t}\n}","func (s *Switch) Disconnect(peer p2pcrypto.PublicKey) {\n\ts.inpeersMutex.Lock()\n\tif _, ok := s.inpeers[peer]; ok {\n\t\tdelete(s.inpeers, peer)\n\t\ts.inpeersMutex.Unlock()\n\t\ts.publishDelPeer(peer)\n\t\tmetrics.InboundPeers.Add(-1)\n\t\treturn\n\t}\n\ts.inpeersMutex.Unlock()\n\n\ts.outpeersMutex.Lock()\n\tif _, ok := s.outpeers[peer]; ok {\n\t\tdelete(s.outpeers, peer)\n\t} else {\n\t\ts.outpeersMutex.Unlock()\n\t\treturn\n\t}\n\ts.outpeersMutex.Unlock()\n\ts.publishDelPeer(peer)\n\tmetrics.OutboundPeers.Add(-1)\n\n\t// todo: don't remove if we know this is a valid peer for later\n\t// s.discovery.Remove(peer) // address doesn't matter because we only check dhtid\n\n\tselect {\n\tcase s.morePeersReq <- struct{}{}:\n\tcase <-s.shutdownCtx.Done():\n\t}\n}","func d12disconnectBranch(node *d12nodeT, index int) {\n\t// Remove element by swapping with the last element to prevent gaps in array\n\tnode.branch[index] = node.branch[node.count-1]\n\tnode.branch[node.count-1].data = nil\n\tnode.branch[node.count-1].child = nil\n\tnode.count--\n}","func PrivateHandleRemove(rtype uint16) {\n\trtypestr, ok := TypeToString[rtype]\n\tif ok {\n\t\tdelete(TypeToRR, rtype)\n\t\tdelete(TypeToString, rtype)\n\t\tdelete(StringToType, rtypestr)\n\t}\n}","func (m *metricMap) Reset() {\n\tm.mtx.Lock()\n\tdefer m.mtx.Unlock()\n\n\tfor h := range m.metrics {\n\t\tdelete(m.metrics, h)\n\t}\n}","func removeNode(node *doubleListNode) {\n\tnode.right.left, node.left.right = node.left, node.right\n}","func (p *prober) setNodes(added nodeMap, removed nodeMap) {\n\tp.Lock()\n\tdefer p.Unlock()\n\n\tfor _, n := range removed {\n\t\tfor elem := range n.Addresses() {\n\t\t\tp.RemoveIP(elem.IP)\n\t\t}\n\t}\n\n\tfor _, n := range added {\n\t\tfor elem, primary := range n.Addresses() {\n\t\t\t_, addr := resolveIP(&n, elem, \"icmp\", primary)\n\t\t\tif addr == nil {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tip := ipString(elem.IP)\n\t\t\tresult := &models.ConnectivityStatus{}\n\t\t\tresult.Status = \"Connection timed out\"\n\t\t\tp.AddIPAddr(addr)\n\t\t\tp.nodes[ip] = n\n\n\t\t\tif p.results[ip] == nil {\n\t\t\t\tp.results[ip] = &models.PathStatus{\n\t\t\t\t\tIP: elem.IP,\n\t\t\t\t}\n\t\t\t}\n\t\t\tp.results[ip].Icmp = result\n\t\t}\n\t}\n}","func RemoveAllSubscriptionsOnConnect(clientID string) {\n\tsubs := new(map[string]uint8)\n\tkey := fmt.Sprintf(\"chatterbox.client-subs.%s\", clientID)\n\tGlobalRedisClient.Fetch(key, subs)\n\n\tGlobalRedisClient.Delete(key)\n\n\tGlobalSubsLock.Lock()\n\tfor topic := range *subs {\n\t\tdelete(GlobalSubs[topic], clientID)\n\t}\n\tGlobalSubsLock.Unlock()\n\n}","func (plugin *RouteConfigurator) clearMapping() {\n\tplugin.rtIndexes.Clear()\n\tplugin.rtCachedIndexes.Clear()\n}","func (this *BlockSyncMgr) delNode(nodeId uint64) {\n\tthis.lock.Lock()\n\tdefer this.lock.Unlock()\n\tdelete(this.nodeWeights, nodeId)\n\tlog.Infof(\"delNode:%d\", nodeId)\n\tif len(this.nodeWeights) == 0 {\n\t\tlog.Warnf(\"no sync nodes\")\n\t}\n\tlog.Infof(\"OnDelNode:%d\", nodeId)\n}","func (manager *syncerManager) garbageCollectSyncer() {\n\tmanager.mu.Lock()\n\tdefer manager.mu.Unlock()\n\tfor key, syncer := range manager.syncerMap {\n\t\tif syncer.IsStopped() && !syncer.IsShuttingDown() {\n\t\t\tdelete(manager.syncerMap, key)\n\t\t}\n\t}\n}"],"string":"[\n \"func cbRemoveConnection(hConn C.MQHCONN) {\\n\\t// Remove all of the hObj values for this hconn\\n\\tkey := makePartialKey(hConn)\\n\\tmapLock()\\n\\tfor k, _ := range cbMap {\\n\\t\\tif strings.HasPrefix(k, key) {\\n\\t\\t\\tdelete(cbMap, k)\\n\\t\\t}\\n\\t}\\n\\tmapUnlock()\\n}\",\n \"func (g *Graph) cleanNodes() {\\n\\tcleaned := []*Node{}\\n\\n\\tfor _, node := range g.Nodes {\\n\\t\\tif node.Kind == \\\"cm\\\" || node.Kind == \\\"secret\\\" {\\n\\t\\t\\t_, isSource := g.linkSources[node.Uid]\\n\\t\\t\\tif !isSource {\\n\\t\\t\\t\\t_, isTarget := g.linkTargets[node.Uid]\\n\\t\\t\\t\\tif !isTarget {\\n\\t\\t\\t\\t\\t// this node is a cm or secret and is not linked to\\n\\t\\t\\t\\t\\t// anything else\\n\\t\\t\\t\\t\\tdelete(g.nodeMap, node.Uid)\\n\\t\\t\\t\\t\\tdelete(g.nameMap, nodeTitle(node.Kind, node.Name))\\n\\t\\t\\t\\t\\tcontinue\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcleaned = append(cleaned, node)\\n\\t}\\n\\tg.Nodes = cleaned\\n}\",\n \"func (m *mapReact) Clean() {\\n\\tm.ro.Lock()\\n\\tm.ma = make(map[SenderDetachCloser]bool)\\n\\tm.ro.Unlock()\\n}\",\n \"func keepNodes(s *srvNodeInfo) {\\n\\tfor {\\n\\t\\ttime.Sleep(time.Second * time.Duration(DefaultDuration))\\n\\t\\tkillNodes := make([]int32, 0)\\n\\t\\tnmmu.Lock()\\n\\t\\tfor k, eni := range s.nodeMap {\\n\\t\\t\\tsub := time.Now().Sub(eni.LastAlive) / time.Second\\n\\t\\t\\tif sub > time.Duration(MaxDurationCount*DefaultDuration) {\\n\\t\\t\\t\\tkillNodes = append(killNodes, k)\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif len(killNodes) > 0 {\\n\\t\\t\\t// remove nodes\\n\\t\\t\\t// flush nodelist\\n\\t\\t\\tlog.Printf(\\\"Kill Nodes by SynerexServer Timeout %#v\\\", killNodes)\\n\\t\\t\\tfor _, k := range killNodes {\\n\\t\\t\\t\\t// we need to remove k from sxProfile\\n\\t\\t\\t\\tni := s.nodeMap[k]\\n\\t\\t\\t\\tif ni.NodeType == nodepb.NodeType_SERVER { // remove server from sxProfile\\n\\t\\t\\t\\t\\tfor jj, sv := range sxProfile {\\n\\t\\t\\t\\t\\t\\tif sv.NodeId == k {\\n\\t\\t\\t\\t\\t\\t\\tsxProfile = append(sxProfile[:jj], sxProfile[jj+1:]...)\\n\\t\\t\\t\\t\\t\\t\\tbreak\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tdelete(s.nodeMap, k)\\n\\t\\t\\t}\\n\\t\\t\\t// we need to notify killed nodes to synerex server to clean channels\\n\\t\\t\\taddPendingNodesToServers(killNodes)\\n\\t\\t}\\n\\t\\tnmmu.Unlock()\\n\\t\\tif len(killNodes) > 0 {\\n\\t\\t\\tsaveNodeMap(s)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (e *Entry) remove(c connection.Connection) {\\n\\te.connSync.Lock()\\n\\tdefer e.connSync.Unlock()\\n\\tif _, ok := e.idle[c.String()]; ok {\\n\\t\\tc.Remove(e.listener[c.String()])\\n\\t\\tdelete(e.idle, c.String())\\n\\t\\tdelete(e.listener, c.String())\\n\\t}\\n\\treturn\\n}\",\n \"func (h *MapInt16ToUint32) Clear() {\\n\\tfor i, e := range h.slots {\\n\\t\\tif e != nil {\\n\\t\\t\\tfor e != nil {\\n\\t\\t\\t\\tn := e.next\\n\\t\\t\\t\\th.free(e)\\n\\t\\t\\t\\te = n\\n\\t\\t\\t}\\n\\t\\t\\th.slots[i] = nil\\n\\t\\t}\\n\\t}\\n\\th.used = 0\\n}\",\n \"func (pm partitionMap) cleanup() {\\n\\tfor ns, partitions := range pm {\\n\\t\\tfor i := range partitions.Replicas {\\n\\t\\t\\tfor j := range partitions.Replicas[i] {\\n\\t\\t\\t\\tpartitions.Replicas[i][j] = nil\\n\\t\\t\\t}\\n\\t\\t\\tpartitions.Replicas[i] = nil\\n\\t\\t}\\n\\n\\t\\tpartitions.Replicas = nil\\n\\t\\tpartitions.regimes = nil\\n\\n\\t\\tdelete(pm, ns)\\n\\t}\\n}\",\n \"func (o *Overlay) nodeDelete(tok *Token) {\\n\\ttni, ok := o.instances[tok.ID()]\\n\\tif !ok {\\n\\t\\tlog.Lvlf2(\\\"Node %x already gone\\\", tok.ID())\\n\\t\\treturn\\n\\t}\\n\\tlog.Lvl4(\\\"Closing node\\\", tok.ID())\\n\\terr := tni.closeDispatch()\\n\\tif err != nil {\\n\\t\\tlog.Error(\\\"Error while closing node:\\\", err)\\n\\t}\\n\\tdelete(o.instances, tok.ID())\\n\\t// mark it done !\\n\\to.instancesInfo[tok.ID()] = true\\n}\",\n \"func DisconnectNodes(parent, child Node) {\\n\\tparent.DelChild(child)\\n\\tchild.DelParent(parent)\\n}\",\n \"func (h *MapInt16ToUint8) Clear() {\\n\\tfor i, e := range h.slots {\\n\\t\\tif e != nil {\\n\\t\\t\\tfor e != nil {\\n\\t\\t\\t\\tn := e.next\\n\\t\\t\\t\\th.free(e)\\n\\t\\t\\t\\te = n\\n\\t\\t\\t}\\n\\t\\t\\th.slots[i] = nil\\n\\t\\t}\\n\\t}\\n\\th.used = 0\\n}\",\n \"func (h *MapInt16ToUint) Clear() {\\n\\tfor i, e := range h.slots {\\n\\t\\tif e != nil {\\n\\t\\t\\tfor e != nil {\\n\\t\\t\\t\\tn := e.next\\n\\t\\t\\t\\th.free(e)\\n\\t\\t\\t\\te = n\\n\\t\\t\\t}\\n\\t\\t\\th.slots[i] = nil\\n\\t\\t}\\n\\t}\\n\\th.used = 0\\n}\",\n \"func (h *MapInt16ToUint16) Clear() {\\n\\tfor i, e := range h.slots {\\n\\t\\tif e != nil {\\n\\t\\t\\tfor e != nil {\\n\\t\\t\\t\\tn := e.next\\n\\t\\t\\t\\th.free(e)\\n\\t\\t\\t\\te = n\\n\\t\\t\\t}\\n\\t\\t\\th.slots[i] = nil\\n\\t\\t}\\n\\t}\\n\\th.used = 0\\n}\",\n \"func delExternalClientBlackholeFromNodes(nodes []v1.Node, routingTable, externalV4, externalV6 string, useV4 bool) {\\n\\tfor _, node := range nodes {\\n\\t\\tif useV4 {\\n\\t\\t\\tout, err := runCommand(containerRuntime, \\\"exec\\\", node.Name, \\\"ip\\\", \\\"route\\\", \\\"del\\\", \\\"blackhole\\\", externalV4, \\\"table\\\", routingTable)\\n\\t\\t\\tframework.ExpectNoError(err, fmt.Sprintf(\\\"failed to delete blackhole route to %s on node %s table %s, out: %s\\\", externalV4, node.Name, routingTable, out))\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tout, err := runCommand(containerRuntime, \\\"exec\\\", node.Name, \\\"ip\\\", \\\"route\\\", \\\"del\\\", \\\"blackhole\\\", externalV6, \\\"table\\\", routingTable)\\n\\t\\tframework.ExpectNoError(err, fmt.Sprintf(\\\"failed to delete blackhole route to %s on node %s table %s, out: %s\\\", externalV6, node.Name, routingTable, out))\\n\\t}\\n}\",\n \"func (n *notifs) ListenSmapChanged() {\\n\\tif !n.p.ClusterStarted() {\\n\\t\\treturn\\n\\t}\\n\\tsmap := n.p.owner.smap.get()\\n\\tif n.smapVer >= smap.Version {\\n\\t\\treturn\\n\\t}\\n\\tn.smapVer = smap.Version\\n\\n\\tn.nls.RLock()\\n\\tif n.nls.len() == 0 {\\n\\t\\tn.nls.RUnlock()\\n\\t\\treturn\\n\\t}\\n\\tvar (\\n\\t\\tremnl = make(map[string]nl.Listener)\\n\\t\\tremid = make(cos.StrKVs)\\n\\t)\\n\\tfor uuid, nl := range n.nls.m {\\n\\t\\tnl.RLock()\\n\\t\\tfor sid := range nl.ActiveNotifiers() {\\n\\t\\t\\tif node := smap.GetActiveNode(sid); node == nil {\\n\\t\\t\\t\\tremnl[uuid] = nl\\n\\t\\t\\t\\tremid[uuid] = sid\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tnl.RUnlock()\\n\\t}\\n\\tn.nls.RUnlock()\\n\\tif len(remnl) == 0 {\\n\\t\\treturn\\n\\t}\\n\\tnow := time.Now().UnixNano()\\n\\tfor uuid, nl := range remnl {\\n\\t\\ts := fmt.Sprintf(\\\"%s: stop waiting for %s\\\", n.p.si, nl)\\n\\t\\tsid := remid[uuid]\\n\\t\\terr := &errNodeNotFound{s, sid, n.p.si, smap}\\n\\t\\tnl.Lock()\\n\\t\\tnl.AddErr(err)\\n\\t\\tnl.SetAborted()\\n\\t\\tnl.Unlock()\\n\\t}\\n\\tn.fin.Lock()\\n\\tfor uuid, nl := range remnl {\\n\\t\\tdebug.Assert(nl.UUID() == uuid)\\n\\t\\tn.fin.add(nl, true /*locked*/)\\n\\t}\\n\\tn.fin.Unlock()\\n\\tn.nls.Lock()\\n\\tfor _, nl := range remnl {\\n\\t\\tn.del(nl, true /*locked*/)\\n\\t}\\n\\tn.nls.Unlock()\\n\\n\\tfor uuid, nl := range remnl {\\n\\t\\tnl.Callback(nl, now)\\n\\t\\t// cleanup\\n\\t\\tdelete(remnl, uuid)\\n\\t\\tdelete(remid, uuid)\\n\\t}\\n}\",\n \"func (s *nodeSet) remove(tn *treeNode) {\\n\\tif nPtr, has := s.itemMap[tn]; has {\\n\\t\\tremoveNode(nPtr)\\n\\t\\tdelete(s.itemMap, tn)\\n\\t}\\n}\",\n \"func (h *TunnelHandler) Clean() {\\n\\th.mu.Lock()\\n\\tremoved := make([]string, 0, len(h.tunnels))\\n\\tfor id, tunnel := range h.tunnels {\\n\\t\\tselect {\\n\\t\\tcase <-tunnel.chDone:\\n\\t\\t\\tremoved = append(removed, id)\\n\\t\\tdefault:\\n\\t\\t}\\n\\t}\\n\\th.mu.Unlock()\\n\\n\\tfor _, id := range removed {\\n\\t\\th.remove(id)\\n\\t}\\n}\",\n \"func (w *wlockMap) unregister(ino uint64) {\\n\\tw.Lock()\\n\\tdefer w.Unlock()\\n\\n\\tr := w.inodeLocks[ino]\\n\\tr.refCnt--\\n\\tif r.refCnt == 0 {\\n\\t\\tdelete(w.inodeLocks, ino)\\n\\t}\\n}\",\n \"func (pm *Map) Clear() {\\n\\tpm.root.decref()\\n\\tpm.root = nil\\n}\",\n \"func (h *MapInt16ToUint64) Clear() {\\n\\tfor i, e := range h.slots {\\n\\t\\tif e != nil {\\n\\t\\t\\tfor e != nil {\\n\\t\\t\\t\\tn := e.next\\n\\t\\t\\t\\th.free(e)\\n\\t\\t\\t\\te = n\\n\\t\\t\\t}\\n\\t\\t\\th.slots[i] = nil\\n\\t\\t}\\n\\t}\\n\\th.used = 0\\n}\",\n \"func (diffStore *utxoDiffStore) clearOldEntries() {\\n\\tdiffStore.mtx.HighPriorityWriteLock()\\n\\tdefer diffStore.mtx.HighPriorityWriteUnlock()\\n\\n\\tvirtualBlueScore := diffStore.dag.VirtualBlueScore()\\n\\tminBlueScore := virtualBlueScore - maxBlueScoreDifferenceToKeepLoaded\\n\\tif maxBlueScoreDifferenceToKeepLoaded > virtualBlueScore {\\n\\t\\tminBlueScore = 0\\n\\t}\\n\\n\\ttips := diffStore.dag.virtual.tips()\\n\\n\\ttoRemove := make(map[*blockNode]struct{})\\n\\tfor node := range diffStore.loaded {\\n\\t\\tif node.blueScore < minBlueScore && !tips.contains(node) {\\n\\t\\t\\ttoRemove[node] = struct{}{}\\n\\t\\t}\\n\\t}\\n\\tfor node := range toRemove {\\n\\t\\tdelete(diffStore.loaded, node)\\n\\t}\\n}\",\n \"func removeEdgesFrom(node string, graph map[edge]struct{}) {\\n\\tfor edge := range graph {\\n\\t\\tif edge.from == node {\\n\\t\\t\\tdelete(graph, edge)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (s *nodeSet) clear() {\\n\\ts.head.right = s.tail\\n\\ts.tail.left = s.head\\n\\ts.itemMap = make(map[*treeNode]*doubleListNode)\\n}\",\n \"func (w *Widget) ClearMappings(app gowid.IApp) {\\n\\tfor k := range w.kmap {\\n\\t\\tdelete(w.kmap, k)\\n\\t}\\n}\",\n \"func (h *MapInt16ToUint8) Remove(k int16) {\\n\\tp := &h.slots[int(k)&h.mask]\\n\\tvar parent *entryInt16ToUint8\\n\\tfor e := *p; e != nil; e = e.next {\\n\\t\\tif e.k == k {\\n\\t\\t\\tif parent == nil { // head\\n\\t\\t\\t\\tif e.next == nil { // last in chain\\n\\t\\t\\t\\t\\th.used--\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t*p = e.next\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tparent.next = e.next\\n\\t\\t\\t}\\n\\t\\t\\th.free(e)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tparent = e\\n\\t}\\n}\",\n \"func (hm *MyHashMap) Remove(key int) {\\n\\tvar prev *Node\\n\\tentry := hm.Arrays[hm.HashFunc(key)]\\n\\tfor entry != nil && entry.Key != key {\\n\\t\\tprev = entry\\n\\t\\tentry = entry.Next\\n\\t}\\n\\n\\tif entry == nil {\\n\\t\\treturn\\n\\t}\\n\\n\\tif prev == nil {\\n\\t\\thm.Arrays[hm.HashFunc(key)] = entry.Next\\n\\t} else {\\n\\t\\tprev.Next = entry.Next\\n\\t}\\n\\n\\treturn\\n}\",\n \"func (h *MapInt16ToUint32) Remove(k int16) {\\n\\tp := &h.slots[int(k)&h.mask]\\n\\tvar parent *entryInt16ToUint32\\n\\tfor e := *p; e != nil; e = e.next {\\n\\t\\tif e.k == k {\\n\\t\\t\\tif parent == nil { // head\\n\\t\\t\\t\\tif e.next == nil { // last in chain\\n\\t\\t\\t\\t\\th.used--\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t*p = e.next\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tparent.next = e.next\\n\\t\\t\\t}\\n\\t\\t\\th.free(e)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tparent = e\\n\\t}\\n}\",\n \"func (this *MyHashMap) Remove(key int) {\\n\\thashCode := key % 1111\\n\\ttemp := &Node{\\n\\t\\t0,\\n\\t\\t0,\\n\\t\\tthis.buckets[hashCode],\\n\\t}\\n\\tpre := temp\\n\\tcur := temp.Next\\n\\tfor cur != nil {\\n\\t\\tif cur.K == key {\\n\\t\\t\\tpre.Next = cur.Next\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tpre, cur = cur, cur.Next\\n\\t}\\n\\tthis.buckets[hashCode] = temp.Next\\n}\",\n \"func deletePathMap(pathMapsPtr *[]n.ApplicationGatewayURLPathMap, resourceID *string) *[]n.ApplicationGatewayURLPathMap {\\n\\tpathMaps := *pathMapsPtr\\n\\tdeleteIdx := -1\\n\\tfor idx, pathMap := range pathMaps {\\n\\t\\tif *pathMap.ID == *resourceID {\\n\\t\\t\\tklog.V(5).Infof(\\\"[brownfield] Deleting %s\\\", *resourceID)\\n\\t\\t\\tdeleteIdx = idx\\n\\t\\t}\\n\\t}\\n\\n\\tif deleteIdx != -1 {\\n\\t\\tpathMaps[deleteIdx] = pathMaps[len(pathMaps)-1]\\n\\t\\t*pathMapsPtr = pathMaps[:len(pathMaps)-1]\\n\\t}\\n\\n\\treturn pathMapsPtr\\n}\",\n \"func (this *MyHashMap) Remove(key int) {\\n\\tkey = this.hash(key)\\n\\tif this.ht[key] == nil {\\n\\t\\treturn\\n\\t}\\n\\tif this.ht[key].k == key {\\n\\t\\tthis.ht[key] = this.ht[key].next\\n\\t\\treturn\\n\\t}\\n\\tfor node := this.ht[key]; node.next != nil; node = node.next {\\n\\t\\tif node.next.k == key {\\n\\t\\t\\tnode.next = node.next.next\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}\\n}\",\n \"func (this *MyHashMap) Remove(key int) {\\n\\ti := this.hashKey(key)\\n\\tnode := &this.list[i]\\n\\n\\tif node.key == key {\\n\\n\\t\\tif node.next == nil {\\n\\t\\t\\t*node = LinkNode{\\n\\t\\t\\t\\tvalue: -1,\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\t*node = *node.next\\n\\t\\t}\\n\\n\\t} else {\\n\\n\\t\\tupNode := node\\n\\n\\t\\tfor node.next != nil {\\n\\t\\t\\tupNode = node\\n\\t\\t\\tnode = node.next\\n\\t\\t\\tif node.key == key {\\n\\t\\t\\t\\tupNode.next = node.next\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t}\\n}\",\n \"func (server *Server) remove(client *client) {\\n\\tserver.clientMutex.Lock()\\n\\tdefer server.clientMutex.Unlock()\\n\\n\\t// remove the connections from the clients array\\n\\tfor i, check := range server.clients {\\n\\t\\tif check == client {\\n\\t\\t\\tserver.clients = append(server.clients[:i], server.clients[i+1:]...)\\n\\t\\t\\tserver.clientIDs = append(server.clientIDs[:i], server.clientIDs[i+1:]...)\\n\\t\\t}\\n\\t}\\n\\n\\tclient.dataStreamer.CloseConnection()\\n}\",\n \"func (c *RpcClusterClient) clear(addrs []string) {\\n\\tc.Lock()\\n\\tvar rm []*poolWeightClient\\n\\tfor _, cli := range c.clients {\\n\\t\\tvar has_cli bool\\n\\t\\tfor _, addr := range addrs {\\n\\t\\t\\tif cli.endpoint == addr {\\n\\t\\t\\t\\thas_cli = true\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif !has_cli {\\n\\t\\t\\trm = append(rm, cli)\\n\\t\\t} else if cli.errcnt > 0 {\\n\\t\\t\\t/*\\n\\t\\t\\t\\tif cli.weight >= errWeight*uint64(cli.errcnt) {\\n\\t\\t\\t\\t\\tcli.weight -= errWeight * uint64(cli.errcnt)\\n\\t\\t\\t\\t\\tcli.errcnt = 0\\n\\t\\t\\t\\t\\tif c.Len() >= minHeapSize {\\n\\t\\t\\t\\t\\t\\t// cli will and only up, so it's ok here.\\n\\t\\t\\t\\t\\t\\theap.Fix(c, cli.index)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t*/\\n\\t\\t}\\n\\t}\\n\\n\\tfor _, cli := range rm {\\n\\t\\t// p will up, down, or not move, so append it to rm list.\\n\\t\\tc.Debugf(\\\"remove cli: %s\\\", cli.endpoint)\\n\\n\\t\\theap.Remove(c, cli.index)\\n\\t\\tcli.pool.Close()\\n\\t}\\n\\tc.Unlock()\\n}\",\n \"func (e *entry) remove() {\\n\\te.prev.next = e.next\\n\\te.next.prev = e.prev\\n\\te.prev = nil\\n\\te.next = nil\\n}\",\n \"func (h *MapInt16ToInt8) Remove(k int16) {\\n\\tp := &h.slots[int(k)&h.mask]\\n\\tvar parent *entryInt16ToInt8\\n\\tfor e := *p; e != nil; e = e.next {\\n\\t\\tif e.k == k {\\n\\t\\t\\tif parent == nil { // head\\n\\t\\t\\t\\tif e.next == nil { // last in chain\\n\\t\\t\\t\\t\\th.used--\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t*p = e.next\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tparent.next = e.next\\n\\t\\t\\t}\\n\\t\\t\\th.free(e)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tparent = e\\n\\t}\\n}\",\n \"func userDisconnect(username string) {\\n\\tfor key := range connMap {\\n\\t\\tconnMap[key].Write([]byte(\\\"TCCHAT_USEROUT\\\\t\\\" + username + \\\"\\\\n\\\"))\\n\\t}\\n\\n\\tvar temp = connMap[username] // Temporary copy of the connection associated to *username in connMap\\n\\tdelete(connMap, username) // Delete the connection associated to *username in connMap\\n\\tdelete(userMap, temp) // Delete the username associated to the previously deleted connection in userMap\\n\\tserverShutdown(temp) // Check whether or not to shutdown the server\\n}\",\n \"func (n *notifier) removeFD(fd int32) {\\n\\tn.mu.Lock()\\n\\tdefer n.mu.Unlock()\\n\\n\\t// Remove from map, then from epoll object.\\n\\tn.waitFD(fd, n.fdMap[fd], 0)\\n\\tdelete(n.fdMap, fd)\\n}\",\n \"func (msh *Mesh) handleOrphanBlocks(blk *types.Block) {\\n\\tmsh.mutex.Lock()\\n\\tdefer msh.mutex.Unlock()\\n\\tif _, ok := msh.orphanBlocks[blk.Layer()]; !ok {\\n\\t\\tmsh.orphanBlocks[blk.Layer()] = make(map[types.BlockID]struct{})\\n\\t}\\n\\tmsh.orphanBlocks[blk.Layer()][blk.ID()] = struct{}{}\\n\\tmsh.With().Debug(\\\"added block to orphans\\\", blk.ID())\\n\\tfor _, b := range append(blk.ForDiff, append(blk.AgainstDiff, blk.NeutralDiff...)...) {\\n\\t\\tfor layerID, layermap := range msh.orphanBlocks {\\n\\t\\t\\tif _, has := layermap[b]; has {\\n\\t\\t\\t\\tmsh.With().Debug(\\\"delete block from orphans\\\", b)\\n\\t\\t\\t\\tdelete(layermap, b)\\n\\t\\t\\t\\tif len(layermap) == 0 {\\n\\t\\t\\t\\t\\tdelete(msh.orphanBlocks, layerID)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func (h *MapInt16ToInt16) Clear() {\\n\\tfor i, e := range h.slots {\\n\\t\\tif e != nil {\\n\\t\\t\\tfor e != nil {\\n\\t\\t\\t\\tn := e.next\\n\\t\\t\\t\\th.free(e)\\n\\t\\t\\t\\te = n\\n\\t\\t\\t}\\n\\t\\t\\th.slots[i] = nil\\n\\t\\t}\\n\\t}\\n\\th.used = 0\\n}\",\n \"func removeDisconnected(clients []Client) []Client {\\n\\tj := 0\\n\\tfor i, client := range clients {\\n\\t\\tselect {\\n\\t\\tcase <-client.DisconnectCh():\\n\\t\\t\\t// Unset in backing array.\\n\\t\\t\\tclients[i] = nil\\n\\t\\tdefault:\\n\\t\\t\\tclients[j] = client\\n\\t\\t\\tj++\\n\\t\\t}\\n\\t}\\n\\treturn clients[:j]\\n}\",\n \"func (hs *PeerHandleMapSync) Delete(name string) {\\n\\ths.Lock()\\n\\t// TODO-WORKSHOP-STEP-5: This code should remove the handle from the PeerHandleMap based on the key name\\n\\ths.Unlock()\\n\\tfmt.Println(\\\"UserHandle Removed for \\\", name)\\n}\",\n \"func (n *node) nodeRemove() {\\n\\tn.evalTotal = n.evalTotal - n.entry.eval\\n\\tn.occupied = false\\n\\tparent := n.parent\\n\\tfor parent != nil {\\n\\t\\tparent.evalTotal = parent.evalTotal - n.entry.eval\\n\\t\\tparent = parent.parent\\n\\t}\\n}\",\n \"func (f *freeClientPool) disconnect(address string) {\\n\\tf.lock.Lock()\\n\\tdefer f.lock.Unlock()\\n\\n\\tif f.closed {\\n\\t\\treturn\\n\\t}\\n\\te := f.addressMap[address]\\n\\tnow := f.clock.Now()\\n\\tif !e.connected {\\n\\t\\tlog.Debug(\\\"Client already disconnected\\\", \\\"address\\\", address)\\n\\t\\treturn\\n\\t}\\n\\n\\tf.connPool.Remove(e.index)\\n\\tf.calcLogUsage(e, now)\\n\\te.connected = false\\n\\tf.disconnPool.Push(e, -e.logUsage)\\n\\tlog.Debug(\\\"Client disconnected\\\", \\\"address\\\", address)\\n}\",\n \"func (m *mru) evict() {\\n\\tif len(m.hash) == 0 {\\n\\t\\treturn\\n\\t}\\n\\tif len(m.hash) == 1 {\\n\\t\\tnode := m.head\\n\\t\\tm.head = nil\\n\\t\\tm.last = nil\\n\\t\\tdelete(m.hash, node.key)\\n\\t\\treturn\\n\\t}\\n\\tdelete(m.hash, m.head.key)\\n\\tm.head.next.previous = nil\\n\\tm.head = m.head.next\\n}\",\n \"func (h *MapInt16ToInt8) Clear() {\\n\\tfor i, e := range h.slots {\\n\\t\\tif e != nil {\\n\\t\\t\\tfor e != nil {\\n\\t\\t\\t\\tn := e.next\\n\\t\\t\\t\\th.free(e)\\n\\t\\t\\t\\te = n\\n\\t\\t\\t}\\n\\t\\t\\th.slots[i] = nil\\n\\t\\t}\\n\\t}\\n\\th.used = 0\\n}\",\n \"func (h *MapInt16ToUint) Remove(k int16) {\\n\\tp := &h.slots[int(k)&h.mask]\\n\\tvar parent *entryInt16ToUint\\n\\tfor e := *p; e != nil; e = e.next {\\n\\t\\tif e.k == k {\\n\\t\\t\\tif parent == nil { // head\\n\\t\\t\\t\\tif e.next == nil { // last in chain\\n\\t\\t\\t\\t\\th.used--\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t*p = e.next\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tparent.next = e.next\\n\\t\\t\\t}\\n\\t\\t\\th.free(e)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tparent = e\\n\\t}\\n}\",\n \"func (h *MapInt16ToUint16) Remove(k int16) {\\n\\tp := &h.slots[int(k)&h.mask]\\n\\tvar parent *entryInt16ToUint16\\n\\tfor e := *p; e != nil; e = e.next {\\n\\t\\tif e.k == k {\\n\\t\\t\\tif parent == nil { // head\\n\\t\\t\\t\\tif e.next == nil { // last in chain\\n\\t\\t\\t\\t\\th.used--\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t*p = e.next\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tparent.next = e.next\\n\\t\\t\\t}\\n\\t\\t\\th.free(e)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tparent = e\\n\\t}\\n}\",\n \"func (h *MapInt16ToUint64) Remove(k int16) {\\n\\tp := &h.slots[int(k)&h.mask]\\n\\tvar parent *entryInt16ToUint64\\n\\tfor e := *p; e != nil; e = e.next {\\n\\t\\tif e.k == k {\\n\\t\\t\\tif parent == nil { // head\\n\\t\\t\\t\\tif e.next == nil { // last in chain\\n\\t\\t\\t\\t\\th.used--\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t*p = e.next\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tparent.next = e.next\\n\\t\\t\\t}\\n\\t\\t\\th.free(e)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tparent = e\\n\\t}\\n}\",\n \"func (h *MapInt16ToInt32) Clear() {\\n\\tfor i, e := range h.slots {\\n\\t\\tif e != nil {\\n\\t\\t\\tfor e != nil {\\n\\t\\t\\t\\tn := e.next\\n\\t\\t\\t\\th.free(e)\\n\\t\\t\\t\\te = n\\n\\t\\t\\t}\\n\\t\\t\\th.slots[i] = nil\\n\\t\\t}\\n\\t}\\n\\th.used = 0\\n}\",\n \"func (em edgeMap) remove(from, to *Vertex) error {\\n\\temMu.Lock()\\n\\tdefer emMu.Unlock()\\n\\n\\tif em == nil {\\n\\t\\tem = make(edgeMap)\\n\\t}\\n\\tif !em.containsLocked(from, to) {\\n\\t\\treturn fmt.Errorf(\\\"edge (%s, %s) not found\\\", from.Label, to.Label)\\n\\t}\\n\\tdelete(em[from.Label], to.Label)\\n\\treturn nil\\n}\",\n \"func RemoveCounterNode(w http.ResponseWriter, r *http.Request) {\\n\\t//params := mux.Vars(r)\\n\\tvar node CounterNode\\n\\t_ = json.NewDecoder(r.Body).Decode(&node)\\n\\tdelete(counternodes, node.EndPoint)\\n\\tfmt.Println(\\\"node removed : \\\" + node.EndPoint + \\\" : \\\" + node.ID)\\n\\t\\n\\tw.WriteHeader(http.StatusOK)\\n}\",\n \"func (h *MapInt16ToInt32) Remove(k int16) {\\n\\tp := &h.slots[int(k)&h.mask]\\n\\tvar parent *entryInt16ToInt32\\n\\tfor e := *p; e != nil; e = e.next {\\n\\t\\tif e.k == k {\\n\\t\\t\\tif parent == nil { // head\\n\\t\\t\\t\\tif e.next == nil { // last in chain\\n\\t\\t\\t\\t\\th.used--\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t*p = e.next\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tparent.next = e.next\\n\\t\\t\\t}\\n\\t\\t\\th.free(e)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tparent = e\\n\\t}\\n}\",\n \"func (this *MyHashMap) Remove(key int) {\\n\\tindex := this.nodeIndex(key)\\n\\tv := this.table[index]\\n\\tif v == nil {\\n\\t\\treturn\\n\\t}\\n\\tif v.key == key {\\n\\t\\tthis.table[index] = v.next\\n\\t\\tthis.size--\\n\\t\\treturn\\n\\t}\\n\\tfor v != nil && v.next != nil {\\n\\t\\tif v.next.key == key {\\n\\t\\t\\tv.next = v.next.next\\n\\t\\t\\tthis.size--\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tv = v.next\\n\\t}\\n}\",\n \"func (r *Registry) Clean(d time.Duration) {\\n\\tnow := clock.SyncedTime()\\n\\n\\tfor _, v := range r.NodesView() {\\n\\t\\tv.cMutex.Lock()\\n\\t\\t// loop over the conflicts\\n\\t\\tfor id, c := range v.Conflicts {\\n\\t\\t\\tif c.Timestamp.Add(d).Before(now) {\\n\\t\\t\\t\\tdelete(v.Conflicts, id)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tv.cMutex.Unlock()\\n\\n\\t\\tv.tMutex.Lock()\\n\\t\\t// loop over the timestamps\\n\\t\\tfor id, t := range v.Timestamps {\\n\\t\\t\\tif t.Timestamp.Add(d).Before(now) {\\n\\t\\t\\t\\tdelete(v.Timestamps, id)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tv.tMutex.Unlock()\\n\\t}\\n}\",\n \"func (s *SignalMonkey) Remove(fn *SignalHandler) {\\n\\ts.mutex.Lock()\\n\\tdefer s.mutex.Unlock()\\n\\tfor i, x := range s.handlers {\\n\\t\\tif x.ID == fn.ID {\\n\\t\\t\\t// Delete preserving order from here:\\n\\t\\t\\t// https://code.google.com/p/go-wiki/wiki/SliceTricks\\n\\t\\t\\tcopy(s.handlers[i:], s.handlers[i+1:])\\n\\t\\t\\ts.handlers[len(s.handlers)-1] = nil // or the zero value of T\\n\\t\\t\\ts.handlers = s.handlers[:len(s.handlers)-1]\\n\\t\\t}\\n\\t}\\n}\",\n \"func (h *MapInt16ToInt) Clear() {\\n\\tfor i, e := range h.slots {\\n\\t\\tif e != nil {\\n\\t\\t\\tfor e != nil {\\n\\t\\t\\t\\tn := e.next\\n\\t\\t\\t\\th.free(e)\\n\\t\\t\\t\\te = n\\n\\t\\t\\t}\\n\\t\\t\\th.slots[i] = nil\\n\\t\\t}\\n\\t}\\n\\th.used = 0\\n}\",\n \"func removeMasterQueue(conn *connection) {\\n for e := masterQueue.Front(); e != nil; e = e.Next() {\\n curr := e.Value.(*connection)\\n if curr == conn {\\n masterQueue.Remove(e)\\n return\\n }\\n }\\n}\",\n \"func (cache *Cache) removeNodeInfoFromList(name string) {\\n\\tni, ok := cache.nodes[name]\\n\\tif !ok {\\n\\t\\tklog.Errorf(\\\"No NodeInfo with name %v found in the cache\\\", name)\\n\\t\\treturn\\n\\t}\\n\\n\\tif ni.prev != nil {\\n\\t\\tni.prev.next = ni.next\\n\\t}\\n\\tif ni.next != nil {\\n\\t\\tni.next.prev = ni.prev\\n\\t}\\n\\t// if the removed item was at the head, we must update the head.\\n\\tif ni == cache.headNode {\\n\\t\\tcache.headNode = ni.next\\n\\t}\\n\\n\\tdelete(cache.nodes, name)\\n}\",\n \"func removeRBDLocks(instance *ec2.Instance) {\\n\\taddress, found := hosts[instance.InstanceId]\\n\\tif !found {\\n\\t\\tglog.Errorf(\\\"The instance: %s was not found in the hosts map\\\", instance.InstanceId)\\n\\t\\treturn\\n\\t}\\n\\tglog.Infof(\\\"Instance: %s, address: %s, state: %s, checking for locks\\\", instance.InstanceId, address, instance.State.Name)\\n\\n\\tvar deleted = false\\n\\n\\tfor i := 0; i < 3; i++ {\\n\\t\\terr := rbdClient.UnlockClient(address)\\n\\t\\tif err != nil {\\n\\t\\t\\tglog.Errorf(\\\"Failed to unlock the images, attempting again if possible\\\")\\n\\t\\t\\t<-time.After(time.Duration(5) * time.Second)\\n\\t\\t}\\n\\t\\tdeleted = true\\n\\t}\\n\\n\\tif !deleted {\\n\\t\\tglog.Errorf(\\\"Failed to unlock any images that could have been held by client: %s\\\", address)\\n\\t}\\n\\n\\t// step: delete from the hosts map\\n\\tdelete(hosts, instance.InstanceId)\\n}\",\n \"func (self *NodeInfoMaps) WatchNodeInfoMap() {\\n\\t_, _, ch, err := self.zk.GetZkConn().ChildrenW(\\\"/yundis/nodes\\\")\\n\\tif err != nil {\\n\\t\\tlog.Errorf(\\\"Can not watch path /yundis/nodes, err:%s\\\", err)\\n\\t}\\n\\tgo func() {\\n\\t\\tfor {\\n\\t\\t\\tevent := <-ch\\n\\t\\t\\tlog.Infof(\\\"node list change, %+v\\\", event)\\n\\t\\t\\tchildren, _, ch1, err1 := self.zk.GetZkConn().ChildrenW(\\\"/yundis/nodes\\\")\\n\\t\\t\\tif err1 == nil {\\n\\t\\t\\t\\tch = ch1\\n\\t\\t\\t\\t//handle the node list change event\\n\\t\\t\\t\\tlog.Infof(\\\"node list changed : %s\\\", children)\\n\\t\\t\\t\\tinfoMap := self.getNodeInfoMapFromZk()\\n\\t\\t\\t\\t//change the slotinfo state.\\n\\t\\t\\t\\tlog.Info(\\\"The node list changed, begin to change the affected slot's info.\\\")\\n\\t\\t\\t\\tself.SetNodeInfoMap(infoMap) //refresh nodeinfo map by new zk data.\\n\\t\\t\\t\\tself.ModifySlotState(infoMap)\\n\\t\\t\\t\\tlog.Info(\\\"Refresh nodeinfo map by new zk data.\\\")\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tlog.Errorf(\\\"Can not watching the children of /yundis/nodes, err:%s\\\", err1)\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t\\ttime.Sleep(time.Second)\\n\\t\\t}\\n\\t}()\\n}\",\n \"func (h *MapInt16ToInt64) Remove(k int16) {\\n\\tp := &h.slots[int(k)&h.mask]\\n\\tvar parent *entryInt16ToInt64\\n\\tfor e := *p; e != nil; e = e.next {\\n\\t\\tif e.k == k {\\n\\t\\t\\tif parent == nil { // head\\n\\t\\t\\t\\tif e.next == nil { // last in chain\\n\\t\\t\\t\\t\\th.used--\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t*p = e.next\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tparent.next = e.next\\n\\t\\t\\t}\\n\\t\\t\\th.free(e)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tparent = e\\n\\t}\\n}\",\n \"func (server *TcpServer) disconnect(client *Client) {\\n\\tserver.mutex.Lock()\\n\\tdefer server.mutex.Unlock()\\n\\tfor i, check := range server.clients {\\n\\t\\tif check == client {\\n\\t\\t\\tserver.clients = append(server.clients[:i], server.clients[i+1:]...)\\n\\t\\t}\\n\\t}\\n\\tclient.Close()\\n}\",\n \"func (r *Raft) removeNode(id uint64) {\\n\\t// Your Code Here (3A).\\n}\",\n \"func (r *Raft) removeNode(id uint64) {\\n\\t// Your Code Here (3A).\\n}\",\n \"func (h *MapInt16ToInt) Remove(k int16) {\\n\\tp := &h.slots[int(k)&h.mask]\\n\\tvar parent *entryInt16ToInt\\n\\tfor e := *p; e != nil; e = e.next {\\n\\t\\tif e.k == k {\\n\\t\\t\\tif parent == nil { // head\\n\\t\\t\\t\\tif e.next == nil { // last in chain\\n\\t\\t\\t\\t\\th.used--\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t*p = e.next\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tparent.next = e.next\\n\\t\\t\\t}\\n\\t\\t\\th.free(e)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tparent = e\\n\\t}\\n}\",\n \"func (h *MapInt16ToInt64) Clear() {\\n\\tfor i, e := range h.slots {\\n\\t\\tif e != nil {\\n\\t\\t\\tfor e != nil {\\n\\t\\t\\t\\tn := e.next\\n\\t\\t\\t\\th.free(e)\\n\\t\\t\\t\\te = n\\n\\t\\t\\t}\\n\\t\\t\\th.slots[i] = nil\\n\\t\\t}\\n\\t}\\n\\th.used = 0\\n}\",\n \"func (m *manager) Unsubscribe(nh datapath.NodeHandler) {\\n\\tm.nodeHandlersMu.Lock()\\n\\tdelete(m.nodeHandlers, nh)\\n\\tm.nodeHandlersMu.Unlock()\\n}\",\n \"func (h *MapInt16ToInt16) Remove(k int16) {\\n\\tp := &h.slots[int(k)&h.mask]\\n\\tvar parent *entryInt16ToInt16\\n\\tfor e := *p; e != nil; e = e.next {\\n\\t\\tif e.k == k {\\n\\t\\t\\tif parent == nil { // head\\n\\t\\t\\t\\tif e.next == nil { // last in chain\\n\\t\\t\\t\\t\\th.used--\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t*p = e.next\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tparent.next = e.next\\n\\t\\t\\t}\\n\\t\\t\\th.free(e)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tparent = e\\n\\t}\\n}\",\n \"func (h *clientHub) Remove(c ClientConn) error {\\n\\th.Lock()\\n\\tdefer h.Unlock()\\n\\n\\tuid := c.UID()\\n\\tuser := c.User()\\n\\n\\tdelete(h.conns, uid)\\n\\n\\t// try to find connection to delete, return early if not found.\\n\\tif _, ok := h.users[user]; !ok {\\n\\t\\treturn nil\\n\\t}\\n\\tif _, ok := h.users[user][uid]; !ok {\\n\\t\\treturn nil\\n\\t}\\n\\n\\t// actually remove connection from hub.\\n\\tdelete(h.users[user], uid)\\n\\n\\t// clean up users map if it's needed.\\n\\tif len(h.users[user]) == 0 {\\n\\t\\tdelete(h.users, user)\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func (server *Server) RemoveClient(socket *websocket.Conn) {\\n\\tfor i, client := range server.connections {\\n\\t\\tif client == socket {\\n\\t\\t\\tserver.connections = append(server.connections[:i], server.connections[i+1:]...)\\n\\t\\t\\tsocket.Close()\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n}\",\n \"func (e *neighborEntry) removeLocked() {\\n\\te.mu.neigh.UpdatedAt = e.cache.nic.stack.clock.NowMonotonic()\\n\\te.dispatchRemoveEventLocked()\\n\\t// Set state to unknown to invalidate this entry if it's cached in a Route.\\n\\te.setStateLocked(Unknown)\\n\\te.cancelTimerLocked()\\n\\t// TODO(https://gvisor.dev/issues/5583): test the case where this function is\\n\\t// called during resolution; that can happen in at least these scenarios:\\n\\t//\\n\\t//\\t- manual address removal during resolution\\n\\t//\\n\\t//\\t- neighbor cache eviction during resolution\\n\\te.notifyCompletionLocked(&tcpip.ErrAborted{})\\n}\",\n \"func closeAndRemove(f *Flamingo, conn *connection) {\\n (*conn.conn).Close()\\n f.cmdR.Lock()\\n delete(f.cmdR.m,conn.cid)\\n f.cmdR.Unlock()\\n}\",\n \"func (item *MapItem) Remove() {\\n\\tnext := item.next\\n\\tprev := item.prev\\n\\tnext.prev = prev\\n\\tprev.next = next\\n}\",\n \"func (c *HttpClusterClient) clear(addrs []string) {\\n\\tc.Lock()\\n\\tvar rm []*httpWeightClient\\n\\tfor _, cli := range c.clients {\\n\\t\\tvar has_cli bool\\n\\t\\tfor _, addr := range addrs {\\n\\t\\t\\tif cli.endpoint == addr {\\n\\t\\t\\t\\thas_cli = true\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif !has_cli {\\n\\t\\t\\trm = append(rm, cli)\\n\\t\\t} else if cli.errcnt > 0 {\\n\\t\\t\\t/*\\n\\t\\t\\t\\tif cli.weight >= errWeight*uint64(cli.errcnt) {\\n\\t\\t\\t\\t\\tcli.weight -= errWeight * uint64(cli.errcnt)\\n\\t\\t\\t\\t\\tcli.errcnt = 0\\n\\t\\t\\t\\t\\tif c.Len() >= minHeapSize {\\n\\t\\t\\t\\t\\t\\theap.Fix(c, cli.index)\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t*/\\n\\t\\t}\\n\\t}\\n\\n\\tfor _, cli := range rm {\\n\\t\\t// p will up, down, or not move, so append it to rm list.\\n\\t\\theap.Remove(c, cli.index)\\n\\t}\\n\\tc.Unlock()\\n}\",\n \"func (c *HashRing) RemoveNode(elt string) {\\n\\tc.Lock()\\n\\tdefer c.Unlock()\\n\\n\\tweight := c.weights[elt]\\n\\tfor i := 0; i < c.numberOfCubes*weight; i++ {\\n\\t\\tdelete(c.ring, c.generateHash(c.generateKey(elt, i)))\\n\\t}\\n\\tdelete(c.members, elt)\\n\\tdelete(c.weights, elt)\\n\\tc.updateSortedRing()\\n}\",\n \"func d18disconnectBranch(node *d18nodeT, index int) {\\n\\t// Remove element by swapping with the last element to prevent gaps in array\\n\\tnode.branch[index] = node.branch[node.count-1]\\n\\tnode.branch[node.count-1].data = nil\\n\\tnode.branch[node.count-1].child = nil\\n\\tnode.count--\\n}\",\n \"func unRegisterTrackerInstance(connStr string) {\\n\\tmanagedLock.Lock()\\n\\tdefer managedLock.Unlock()\\n\\tif managedTrackerInstance[connStr] == nil {\\n\\t\\tlogger.Info(\\\"tracker instance not exists\\\")\\n\\t} else {\\n\\t\\tdelete(managedTrackerInstance, connStr)\\n\\t}\\n}\",\n \"func clearMap(store map[string]interface{}) {\\n\\tfor k := range store {\\n\\t\\tdelete(store, k)\\n\\t}\\n}\",\n \"func RemoveFromCircle(node node.Node, circle *treemap.Map) {\\n\\n\\t//Generate a string identifier for redis node\\n\\tnodeStr := \\\"localhost:\\\" + strconv.Itoa(node.Port)\\n\\n\\t//use this string identifier for removing the node from the treemap\\n\\tcircle.Remove(Hashcode(nodeStr))\\n\\tfmt.Println(\\\"Removed Node\\\", nodeStr, \\\"Hashcode\\\", Hashcode(nodeStr))\\n}\",\n \"func (m MessageDescriptorMap) Cleanup() (deleted []string) {\\n\\tfor id, descriptor := range m {\\n\\t\\tif !descriptor.Touched() {\\n\\t\\t\\tdelete(m, id)\\n\\t\\t\\tdeleted = append(deleted, id)\\n\\t\\t}\\n\\t}\\n\\treturn\\n}\",\n \"func d3disconnectBranch(node *d3nodeT, index int) {\\n\\t// Remove element by swapping with the last element to prevent gaps in array\\n\\tnode.branch[index] = node.branch[node.count-1]\\n\\tnode.branch[node.count-1].data = nil\\n\\tnode.branch[node.count-1].child = nil\\n\\tnode.count--\\n}\",\n \"func (n *Node) RemoveDups1() {\\n\\t// i'm pretty sure this doesn't count as a temp buffer i'm not holding\\n\\t// data to move from one stop to another\\n\\tm := make(map[int]struct{})\\n\\tfor n.Next != nil {\\n\\t\\tif _, ok := m[n.Data]; ok {\\n\\t\\t\\t// pointers is needed to make sure data is overwritten\\n\\t\\t\\t*n = *deleteNode(n, n.Data)\\n\\t\\t} else {\\n\\t\\t\\tm[n.Data] = struct{}{}\\n\\t\\t\\tn = n.Next\\n\\t\\t}\\n\\t}\\n}\",\n \"func (r *Raft) removeNode(id uint64) {\\n\\tif _, ok := r.Prs[id]; ok {\\n\\t\\tdelete(r.Prs, id)\\n\\t\\tif r.State == StateLeader {\\n\\t\\t\\tr.leaderCommit()\\n\\t\\t}\\n\\t}\\n\\tr.PendingConfIndex = None\\n}\",\n \"func (n *NeighborsTable) Del(nodeID NodeID) {\\n\\tn.m.Del(uint64(nodeID))\\n}\",\n \"func d13disconnectBranch(node *d13nodeT, index int) {\\n\\t// Remove element by swapping with the last element to prevent gaps in array\\n\\tnode.branch[index] = node.branch[node.count-1]\\n\\tnode.branch[node.count-1].data = nil\\n\\tnode.branch[node.count-1].child = nil\\n\\tnode.count--\\n}\",\n \"func (hm *MyHashMap) Remove(key int) {\\n\\tidx := key % len(hm.HMap)\\n\\tcur, prev := hm.HMap[idx], &HMListNode{Next: hm.HMap[idx]}\\n\\tfor cur != nil {\\n\\t\\tif cur.Key == key {\\n\\t\\t\\tif cur == hm.HMap[idx] {\\n\\t\\t\\t\\thm.HMap[idx] = cur.Next\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tprev.Next = cur.Next\\n\\t\\t\\t}\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tprev, cur = cur, cur.Next\\n\\t}\\n\\n}\",\n \"func removeNode(n *doc.Node) {\\n\\t// Check if this node exists.\\n\\tfor i, v := range localNodes {\\n\\t\\tif n.ImportPath == v.ImportPath {\\n\\t\\t\\tlocalNodes = append(localNodes[:i], localNodes[i+1:]...)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}\\n}\",\n \"func (DummyStore) DeleteMap(key string, fields ...string) error { return nil }\",\n \"func (s *Server) removeClient(c *Client) {\\n\\tc.conn.Close()\\n\\tfor i, cl := range s.clients {\\n\\t\\tif cl == c {\\n\\t\\t\\ts.clients = append(s.clients[0:i], s.clients[i+1:]...)\\n\\t\\t\\tlog.Println(\\\"Client disconnected, \\\" + strconv.Itoa(len(s.clients)) + \\\" active clients\\\")\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}\\n}\",\n \"func (tp *Tapestry) RemoveKeysAtNode(t *testing.T, node *Node) {\\n\\tfor key := range node.blobstore.blobs {\\n\\n\\t\\t// delete from Blobs\\n\\t\\tdelete(tp.Blobs, key)\\n\\n\\t\\t// delete from Keys\\n\\t\\ttp.RemoveKey(t, key)\\n\\t}\\n}\",\n \"func (ns Nodes) Remove() {\\n\\n}\",\n \"func disconnect(a, b *PathNode) {\\n\\tif a != nil {\\n\\t\\tif a.AdjL == b {\\n\\t\\t\\ta.AdjL = nil\\n\\t\\t}\\n\\t\\tif a.AdjR == b {\\n\\t\\t\\ta.AdjR = nil\\n\\t\\t}\\n\\t\\tif a.AdjU == b {\\n\\t\\t\\ta.AdjU = nil\\n\\t\\t}\\n\\t\\tif a.AdjD == b {\\n\\t\\t\\ta.AdjD = nil\\n\\t\\t}\\n\\t}\\n\\tif b != nil {\\n\\t\\tif b.AdjL == a {\\n\\t\\t\\tb.AdjL = nil\\n\\t\\t}\\n\\t\\tif b.AdjR == a {\\n\\t\\t\\tb.AdjR = nil\\n\\t\\t}\\n\\t\\tif b.AdjU == a {\\n\\t\\t\\tb.AdjU = nil\\n\\t\\t}\\n\\t\\tif b.AdjD == a {\\n\\t\\t\\tb.AdjD = nil\\n\\t\\t}\\n\\t}\\n}\",\n \"func (s *Switch) Disconnect(peer p2pcrypto.PublicKey) {\\n\\ts.inpeersMutex.Lock()\\n\\tif _, ok := s.inpeers[peer]; ok {\\n\\t\\tdelete(s.inpeers, peer)\\n\\t\\ts.inpeersMutex.Unlock()\\n\\t\\ts.publishDelPeer(peer)\\n\\t\\tmetrics.InboundPeers.Add(-1)\\n\\t\\treturn\\n\\t}\\n\\ts.inpeersMutex.Unlock()\\n\\n\\ts.outpeersMutex.Lock()\\n\\tif _, ok := s.outpeers[peer]; ok {\\n\\t\\tdelete(s.outpeers, peer)\\n\\t} else {\\n\\t\\ts.outpeersMutex.Unlock()\\n\\t\\treturn\\n\\t}\\n\\ts.outpeersMutex.Unlock()\\n\\ts.publishDelPeer(peer)\\n\\tmetrics.OutboundPeers.Add(-1)\\n\\n\\t// todo: don't remove if we know this is a valid peer for later\\n\\t// s.discovery.Remove(peer) // address doesn't matter because we only check dhtid\\n\\n\\tselect {\\n\\tcase s.morePeersReq <- struct{}{}:\\n\\tcase <-s.shutdownCtx.Done():\\n\\t}\\n}\",\n \"func d12disconnectBranch(node *d12nodeT, index int) {\\n\\t// Remove element by swapping with the last element to prevent gaps in array\\n\\tnode.branch[index] = node.branch[node.count-1]\\n\\tnode.branch[node.count-1].data = nil\\n\\tnode.branch[node.count-1].child = nil\\n\\tnode.count--\\n}\",\n \"func PrivateHandleRemove(rtype uint16) {\\n\\trtypestr, ok := TypeToString[rtype]\\n\\tif ok {\\n\\t\\tdelete(TypeToRR, rtype)\\n\\t\\tdelete(TypeToString, rtype)\\n\\t\\tdelete(StringToType, rtypestr)\\n\\t}\\n}\",\n \"func (m *metricMap) Reset() {\\n\\tm.mtx.Lock()\\n\\tdefer m.mtx.Unlock()\\n\\n\\tfor h := range m.metrics {\\n\\t\\tdelete(m.metrics, h)\\n\\t}\\n}\",\n \"func removeNode(node *doubleListNode) {\\n\\tnode.right.left, node.left.right = node.left, node.right\\n}\",\n \"func (p *prober) setNodes(added nodeMap, removed nodeMap) {\\n\\tp.Lock()\\n\\tdefer p.Unlock()\\n\\n\\tfor _, n := range removed {\\n\\t\\tfor elem := range n.Addresses() {\\n\\t\\t\\tp.RemoveIP(elem.IP)\\n\\t\\t}\\n\\t}\\n\\n\\tfor _, n := range added {\\n\\t\\tfor elem, primary := range n.Addresses() {\\n\\t\\t\\t_, addr := resolveIP(&n, elem, \\\"icmp\\\", primary)\\n\\t\\t\\tif addr == nil {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\tip := ipString(elem.IP)\\n\\t\\t\\tresult := &models.ConnectivityStatus{}\\n\\t\\t\\tresult.Status = \\\"Connection timed out\\\"\\n\\t\\t\\tp.AddIPAddr(addr)\\n\\t\\t\\tp.nodes[ip] = n\\n\\n\\t\\t\\tif p.results[ip] == nil {\\n\\t\\t\\t\\tp.results[ip] = &models.PathStatus{\\n\\t\\t\\t\\t\\tIP: elem.IP,\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tp.results[ip].Icmp = result\\n\\t\\t}\\n\\t}\\n}\",\n \"func RemoveAllSubscriptionsOnConnect(clientID string) {\\n\\tsubs := new(map[string]uint8)\\n\\tkey := fmt.Sprintf(\\\"chatterbox.client-subs.%s\\\", clientID)\\n\\tGlobalRedisClient.Fetch(key, subs)\\n\\n\\tGlobalRedisClient.Delete(key)\\n\\n\\tGlobalSubsLock.Lock()\\n\\tfor topic := range *subs {\\n\\t\\tdelete(GlobalSubs[topic], clientID)\\n\\t}\\n\\tGlobalSubsLock.Unlock()\\n\\n}\",\n \"func (plugin *RouteConfigurator) clearMapping() {\\n\\tplugin.rtIndexes.Clear()\\n\\tplugin.rtCachedIndexes.Clear()\\n}\",\n \"func (this *BlockSyncMgr) delNode(nodeId uint64) {\\n\\tthis.lock.Lock()\\n\\tdefer this.lock.Unlock()\\n\\tdelete(this.nodeWeights, nodeId)\\n\\tlog.Infof(\\\"delNode:%d\\\", nodeId)\\n\\tif len(this.nodeWeights) == 0 {\\n\\t\\tlog.Warnf(\\\"no sync nodes\\\")\\n\\t}\\n\\tlog.Infof(\\\"OnDelNode:%d\\\", nodeId)\\n}\",\n \"func (manager *syncerManager) garbageCollectSyncer() {\\n\\tmanager.mu.Lock()\\n\\tdefer manager.mu.Unlock()\\n\\tfor key, syncer := range manager.syncerMap {\\n\\t\\tif syncer.IsStopped() && !syncer.IsShuttingDown() {\\n\\t\\t\\tdelete(manager.syncerMap, key)\\n\\t\\t}\\n\\t}\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5977338","0.57795995","0.5744829","0.56060827","0.54988384","0.5470038","0.54184693","0.5405626","0.53601146","0.53557134","0.5353138","0.53511405","0.53385425","0.53376305","0.52991736","0.52857304","0.52746004","0.52491444","0.5248946","0.52391887","0.52211666","0.52195567","0.5209824","0.52014446","0.51987416","0.51982033","0.51917416","0.5179001","0.5176059","0.5171977","0.51643246","0.5162018","0.51465076","0.5126317","0.5117718","0.51108706","0.5109058","0.51070607","0.51065844","0.5101831","0.51010126","0.51004946","0.509531","0.5092984","0.5091884","0.50872815","0.5080025","0.5076365","0.507338","0.507075","0.5067663","0.5063134","0.5061824","0.50589395","0.50588167","0.50572026","0.5049489","0.5045787","0.5024168","0.5022134","0.5021074","0.5013752","0.5013752","0.5007843","0.50078243","0.5006375","0.49937114","0.49878728","0.49867862","0.49805558","0.49793577","0.4977946","0.49704283","0.4954854","0.4946381","0.49382722","0.49192566","0.49184486","0.4918102","0.49158877","0.4908569","0.49070686","0.48898733","0.48898673","0.48801115","0.48787758","0.48746744","0.48702085","0.4866678","0.4849541","0.48399064","0.48375878","0.4835021","0.48277363","0.4810372","0.48093614","0.4805234","0.48040715","0.48027307","0.4797449","0.47941026"],"string":"[\n \"0.5977338\",\n \"0.57795995\",\n \"0.5744829\",\n \"0.56060827\",\n \"0.54988384\",\n \"0.5470038\",\n \"0.54184693\",\n \"0.5405626\",\n \"0.53601146\",\n \"0.53557134\",\n \"0.5353138\",\n \"0.53511405\",\n \"0.53385425\",\n \"0.53376305\",\n \"0.52991736\",\n \"0.52857304\",\n \"0.52746004\",\n \"0.52491444\",\n \"0.5248946\",\n \"0.52391887\",\n \"0.52211666\",\n \"0.52195567\",\n \"0.5209824\",\n \"0.52014446\",\n \"0.51987416\",\n \"0.51982033\",\n \"0.51917416\",\n \"0.5179001\",\n \"0.5176059\",\n \"0.5171977\",\n \"0.51643246\",\n \"0.5162018\",\n \"0.51465076\",\n \"0.5126317\",\n \"0.5117718\",\n \"0.51108706\",\n \"0.5109058\",\n \"0.51070607\",\n \"0.51065844\",\n \"0.5101831\",\n \"0.51010126\",\n \"0.51004946\",\n \"0.509531\",\n \"0.5092984\",\n \"0.5091884\",\n \"0.50872815\",\n \"0.5080025\",\n \"0.5076365\",\n \"0.507338\",\n \"0.507075\",\n \"0.5067663\",\n \"0.5063134\",\n \"0.5061824\",\n \"0.50589395\",\n \"0.50588167\",\n \"0.50572026\",\n \"0.5049489\",\n \"0.5045787\",\n \"0.5024168\",\n \"0.5022134\",\n \"0.5021074\",\n \"0.5013752\",\n \"0.5013752\",\n \"0.5007843\",\n \"0.50078243\",\n \"0.5006375\",\n \"0.49937114\",\n \"0.49878728\",\n \"0.49867862\",\n \"0.49805558\",\n \"0.49793577\",\n \"0.4977946\",\n \"0.49704283\",\n \"0.4954854\",\n \"0.4946381\",\n \"0.49382722\",\n \"0.49192566\",\n \"0.49184486\",\n \"0.4918102\",\n \"0.49158877\",\n \"0.4908569\",\n \"0.49070686\",\n \"0.48898733\",\n \"0.48898673\",\n \"0.48801115\",\n \"0.48787758\",\n \"0.48746744\",\n \"0.48702085\",\n \"0.4866678\",\n \"0.4849541\",\n \"0.48399064\",\n \"0.48375878\",\n \"0.4835021\",\n \"0.48277363\",\n \"0.4810372\",\n \"0.48093614\",\n \"0.4805234\",\n \"0.48040715\",\n \"0.48027307\",\n \"0.4797449\",\n \"0.47941026\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":992,"cells":{"query":{"kind":"string","value":"/ The function NewObjectLength calls NewUnaryFunctionBase to create a function named OBJECT_LENGTH with an expression as input."},"document":{"kind":"string","value":"func NewObjectLength(operand Expression) Function {\n\trv := &ObjectLength{\n\t\t*NewUnaryFunctionBase(\"object_length\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func (this *ObjectLength) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectLength(operands[0])\n\t}\n}","func (this *ObjectLength) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectLength(operands[0])\n\t}\n}","func (o *FakeObject) Length() int { return reflect.ValueOf(o.Value).Len() }","func (String) Length(c *compiler.Compiler, this compiler.Expression) (expression compiler.Expression) {\n\texpression = c.NewExpression()\n\texpression.Type = Integer{}\n\texpression.Go.WriteString(`ctx.CountString(`)\n\texpression.Go.WriteB(this.Go)\n\texpression.Go.WriteString(`)`)\n\treturn expression\n}","func (this *ObjectLength) Apply(context Context, arg value.Value) (value.Value, error) {\n\tif arg.Type() == value.MISSING {\n\t\treturn value.MISSING_VALUE, nil\n\t} else if arg.Type() != value.OBJECT {\n\t\treturn value.NULL_VALUE, nil\n\t}\n\n\toa := arg.Actual().(map[string]interface{})\n\treturn value.NewValue(float64(len(oa))), nil\n}","func (this *ObjectLength) Apply(context Context, arg value.Value) (value.Value, error) {\n\tif arg.Type() == value.MISSING {\n\t\treturn value.MISSING_VALUE, nil\n\t} else if arg.Type() != value.OBJECT {\n\t\treturn value.NULL_VALUE, nil\n\t}\n\n\toa := arg.Actual().(map[string]interface{})\n\treturn value.NewValue(float64(len(oa))), nil\n}","func builtinLen(args ...Object) (Object, error) {\n\tif len(args) != 1 {\n\t\treturn nil, ErrWrongNumArguments\n\t}\n\tswitch arg := args[0].(type) {\n\tcase *Array:\n\t\treturn &Int{Value: int64(len(arg.Value))}, nil\n\tcase *String:\n\t\treturn &Int{Value: int64(len(arg.Value))}, nil\n\tcase *Bytes:\n\t\treturn &Int{Value: int64(len(arg.Value))}, nil\n\tcase *Map:\n\t\treturn &Int{Value: int64(len(arg.Value))}, nil\n\tdefault:\n\t\treturn nil, ErrInvalidArgumentType{\n\t\t\tName: \"first\",\n\t\t\tExpected: \"array/string/bytes/map\",\n\t\t\tFound: arg.TypeName(),\n\t\t}\n\t}\n}","func (object Object) Length() int {\n\treturn len(object)\n}","func BlobLength32() LengthTypeInstance {\n return &blobLength32{}\n}","func (this *ObjectLength) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.UnaryEval(this, item, context)\n}","func (this *ObjectLength) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.UnaryEval(this, item, context)\n}","func EvalLength(ev *Evaluator, node *ast.CallExpr) (r *ISEXP) {\n\tTRACE := ev.Trace\n\tif TRACE {\n\t\tprintln(\"Length\")\n\t}\n\tex := node.Args[0]\n\tswitch ex.(type) {\n\tcase *ast.IndexExpr:\n\t\titerator := EvalIndexExpressionToIterator(ev, ex.(*ast.IndexExpr).Index)\n\t\treturn &ISEXP{ValuePos: node.Fun.Pos(), Integer: iterator.Length()}\n\tdefault:\n\t\tval := EvalExpr(ev, node.Args[0])\n\t\treturn &ISEXP{ValuePos: node.Fun.Pos(), Integer: val.Length()}\n\t}\n}","func BlobLength64() LengthTypeInstance {\n return &blobLength64{}\n}","func (sequence Sequence) Length(c *Compiler, this Expression) (expression Expression) {\n\treturn SequenceLength(c, this)\n}","func BlobLength16() LengthTypeInstance {\n return &blobLength16{}\n}","func (b *Builder) Length() *Builder {\n\tb.p.RegisterTransformation(impl.Length())\n\treturn b\n}","func Len(obj string, length int, a ...any) {\n\tl := len(obj)\n\n\tif l != length {\n\t\tdefMsg := fmt.Sprintf(assertionMsg+\": got '%d', want '%d'\", l, length)\n\t\tDefault().reportAssertionFault(defMsg, a...)\n\t}\n}","func len(v Type) int32 {}","func BlobLength8() LengthTypeInstance {\n return &blobLength8{}\n}","func NewObjectNames(operand Expression) Function {\n\trv := &ObjectNames{\n\t\t*NewUnaryFunctionBase(\"object_names\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func NewObjectNames(operand Expression) Function {\n\trv := &ObjectNames{\n\t\t*NewUnaryFunctionBase(\"object_names\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func (p Path) Length(reference, value interface{}) Path { return p.with(Length, reference, value) }","func JSONObjLen(conn redis.Conn, key, path string) (res interface{}, err error) {\n\tname, args, _ := CommandBuilder(\"JSON.OBJLEN\", key, path)\n\treturn conn.Do(name, args...)\n}","func ClosureNewObject(sizeofClosure uint32, object *Object) *Closure {\n\tc_sizeof_closure := (C.guint)(sizeofClosure)\n\n\tc_object := (*C.GObject)(C.NULL)\n\tif object != nil {\n\t\tc_object = (*C.GObject)(object.ToC())\n\t}\n\n\tretC := C.g_closure_new_object(c_sizeof_closure, c_object)\n\tretGo := ClosureNewFromC(unsafe.Pointer(retC))\n\n\treturn retGo\n}","func (this *ObjectRemove) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectRemove(operands[0], operands[1])\n\t}\n}","func NewRawDataLength(val int) RawDataLengthField {\n\treturn RawDataLengthField{quickfix.FIXInt(val)}\n}","func (s *TestSuite) Len(object interface{}, length int, msgAndArgs ...interface{}) {\n\ts.Require().Len(object, length, msgAndArgs...)\n}","func (this *ObjectLength) Type() value.Type { return value.NUMBER }","func (this *ObjectLength) Type() value.Type { return value.NUMBER }","func Length(min int, max int) BuiltInFieldRule {\n\treturn newLengthRule(MsgInvalidLengthFormat, &min, &max)\n}","func (g *mapGen) genLen() {\n\tg.P(\"func (x *\", g.typeName, \") Len() int {\")\n\t// invalid map\n\tg.P(\"if x.m == nil {\")\n\tg.P(\"return 0\")\n\tg.P(\"}\")\n\t// valid map\n\tg.P(\"return len(*x.m)\")\n\tg.P(\"}\")\n\tg.P()\n}","func length(i Instruction, ls *LuaState) {\n\ta, b, _ := i.ABC()\n\ta += 1\n\tb += 1\n\n\tluaLen(ls, b)\n\tluaReplace(ls, a)\n}","func (jz *Jzon) Length() (l int, err error) {\n\tif jz.Type == JzTypeArr {\n\t\treturn len(jz.data.([]*Jzon)), nil\n\t}\n\n\tif jz.Type == JzTypeObj {\n\t\treturn len(jz.data.(map[string]*Jzon)), nil\n\t}\n\n\treturn -1, errors.New(\"expect node of type JzTypeArr or JzTypeObj\" +\n\t\t\", but the real type is \" + typeStrings[jz.Type])\n}","func rcLength(p *TCompiler, code *TCode) (*value.Value, error) {\n\tvb := p.regGet(code.B)\n\tva := value.NewIntPtr(vb.Length())\n\tp.regSet(code.A, va)\n\tp.moveNext()\n\treturn va, nil\n}","func (gdt *Vector3) Length() Real {\n\targ0 := gdt.getBase()\n\n\tret := C.go_godot_vector3_length(GDNative.api, arg0)\n\n\treturn Real(ret)\n}","func (o Args) Len() int { return len(o) }","func LengthModifier(i interface{}) (interface{}, error) {\n\tswitch v := i.(type) {\n\tcase string:\n\t\treturn len(v), nil\n\tcase float64:\n\t\t// TODO: this is not counting decimal portion\n\t\t// (probably because float error can make it really long for some values)\n\t\treturn getIntLength(int(v)), nil\n\tcase int:\n\t\treturn getIntLength(v), nil\n\tcase int64:\n\t\treturn getInt64Length(v), nil\n\tcase map[string]interface{}:\n\t\treturn len(v), nil\n\tcase []interface{}:\n\t\treturn len(v), nil\n\tcase []string:\n\t\treturn len(v), nil\n\tcase []int:\n\t\treturn len(v), nil\n\tcase []float64:\n\t\treturn len(v), nil\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"Invalid type (%v) for len()\", reflect.TypeOf(i))\n\t}\n}","func Vec3Length(a Vec3) float32","func (this *ObjectAdd) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectAdd(operands[0], operands[1], operands[2])\n\t}\n}","func NewBodyLength(val int) BodyLengthField {\n\treturn BodyLengthField{quickfix.FIXInt(val)}\n}","func (f *Fs) newObjectSizeAndNameOnly(o fs.Object, moName string, size int64) *Object {\n\treturn &Object{\n\t\tObject: o,\n\t\tf: f,\n\t\tmo: nil,\n\t\tmoName: moName,\n\t\tsize: size,\n\t\tmeta: nil,\n\t}\n}","func (n Number) Length() int {\n\treturn 0\n}","func (fn *formulaFuncs) LEN(argsList *list.List) formulaArg {\n\tif argsList.Len() != 1 {\n\t\treturn newErrorFormulaArg(formulaErrorVALUE, \"LEN requires 1 string argument\")\n\t}\n\treturn newStringFormulaArg(strconv.Itoa(utf8.RuneCountInString(argsList.Front().Value.(formulaArg).String)))\n}","func (this *ObjectLength) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectLength) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (*FunctionLength) Name() string {\n\treturn \"function-length\"\n}","func (a *Assertions) Len(object interface{}, length int, msgAndArgs ...interface{}) bool {\n\treturn Len(a.t, object, length, msgAndArgs...)\n}","func (this *ObjectUnwrap) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectUnwrap(operands[0])\n\t}\n}","func LengthOfValue(value interface{}) (int, error) {\n\tv := reflect.ValueOf(value)\n\tswitch v.Kind() {\n\tcase reflect.String, reflect.Slice, reflect.Map, reflect.Array:\n\t\treturn v.Len(), nil\n\t}\n\treturn 0, fmt.Errorf(\"cannot get the length of %v\", v.Kind())\n}","func (t *dataType) Length(n int) *dataType {\n\tt.str.Length(n)\n\treturn t\n}","func (this *ObjectNames) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectNames(operands[0])\n\t}\n}","func (this *ObjectNames) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectNames(operands[0])\n\t}\n}","func (_AccessIndexor *AccessIndexorCaller) GetContentObjectsLength(opts *bind.CallOpts) (*big.Int, error) {\n\tvar out []interface{}\n\terr := _AccessIndexor.contract.Call(opts, &out, \"getContentObjectsLength\")\n\n\tif err != nil {\n\t\treturn *new(*big.Int), err\n\t}\n\n\tout0 := *abi.ConvertType(out[0], new(*big.Int)).(**big.Int)\n\n\treturn out0, err\n\n}","func (f *PingFrame) Length(_ protocol.VersionNumber) protocol.ByteCount {\n\treturn 1\n}","func (s newrelicByName) Len() int { return len(s) }","func NewFileObject(obj *swift.ObjectOpenFile) (f *FileObject, err error) {\n\tf = &FileObject{obj: obj, loc: 0}\n\tf.length, err = obj.Length()\n\treturn f, err\n}","func TestLen(t *testing.T) {\n\tv := New(1)\n\tv.Set(0, 2) // has length 2\n\tif v.Len() != 2 {\n\t\tt.Error(\"Len returned a wrong length\")\n\t}\n}","func NewObjectAdd(first, second, third Expression) Function {\n\trv := &ObjectAdd{\n\t\t*NewTernaryFunctionBase(\"object_add\", first, second, third),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func NewLuaObject(L *lua.State, idx int) *LuaObject {\n tp := L.LTypename(idx)\n L.PushValue(idx)\n ref := L.Ref(lua.LUA_REGISTRYINDEX)\n return &LuaObject{L, ref, tp}\n}","func (t CreatableRenewers38) Size(version int16) int32 {\n\tvar sz int32\n\tsz += sizeof.String(t.PrincipalType) // PrincipalType\n\tsz += sizeof.String(t.PrincipalName) // PrincipalName\n\treturn sz\n}","func Len(scope common.Scope, args ...interface{}) interface{} {\n\tif s, ok := args[0].(string); ok {\n\t\treturn int64(len(s))\n\t}\n\treturn 0\n}","func (t DescribedDelegationTokenRenewer41) Size(version int16) int32 {\n\tvar sz int32\n\tsz += sizeof.String(t.PrincipalType) // PrincipalType\n\tsz += sizeof.String(t.PrincipalName) // PrincipalName\n\treturn sz\n}","func NewSignatureLength(val int) SignatureLengthField {\n\treturn SignatureLengthField{quickfix.FIXInt(val)}\n}","func fnLen(ctx Context, doc *JDoc, params []string) interface{} {\n\tstats := ctx.Value(EelTotalStats).(*ServiceStats)\n\tif params == nil || len(params) != 1 {\n\t\tctx.Log().Error(\"error_type\", \"func_len\", \"op\", \"len\", \"cause\", \"wrong_number_of_parameters\", \"params\", params)\n\t\tstats.IncErrors()\n\t\tAddError(ctx, SyntaxError{fmt.Sprintf(\"wrong number of parameters in call to len function\"), \"len\", params})\n\t\treturn nil\n\t}\n\tvar obj interface{}\n\terr := json.Unmarshal([]byte(extractStringParam(params[0])), &obj)\n\tif err != nil {\n\t\treturn len(extractStringParam(params[0]))\n\t}\n\tswitch obj.(type) {\n\tcase []interface{}:\n\t\treturn len(obj.([]interface{}))\n\tcase map[string]interface{}:\n\t\treturn len(obj.(map[string]interface{}))\n\t}\n\treturn 0\n}","func (d commandDefault) strlen(str string) string {\n\treturn markerLength + strconv.Itoa(len(str))\n}","func (_BaseAccessControlGroup *BaseAccessControlGroupCaller) GetContentObjectsLength(opts *bind.CallOpts) (*big.Int, error) {\n\tvar out []interface{}\n\terr := _BaseAccessControlGroup.contract.Call(opts, &out, \"getContentObjectsLength\")\n\n\tif err != nil {\n\t\treturn *new(*big.Int), err\n\t}\n\n\tout0 := *abi.ConvertType(out[0], new(*big.Int)).(**big.Int)\n\n\treturn out0, err\n\n}","func (this *ObjectPut) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectPut(operands[0], operands[1], operands[2])\n\t}\n}","func NewObjectRemove(first, second Expression) Function {\n\trv := &ObjectRemove{\n\t\t*NewBinaryFunctionBase(\"object_remove\", first, second),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func Argsize(t *Type) int","func (b *Base) GetObjectSize(req *GetObjectSizeReq) (*GetObjectSizeResp, error) {\n\treturn nil, ErrFunctionNotSupported\n}","func (jbobject *JavaLangCharSequence) Length() int {\n\tjret, err := jbobject.CallMethod(javabind.GetEnv(), \"length\", javabind.Int)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn jret.(int)\n}","func NewPattern(length int) Pattern {\n return Pattern{ length }\n}","func (_BaseAccessWallet *BaseAccessWalletCaller) GetContentObjectsLength(opts *bind.CallOpts) (*big.Int, error) {\n\tvar out []interface{}\n\terr := _BaseAccessWallet.contract.Call(opts, &out, \"getContentObjectsLength\")\n\n\tif err != nil {\n\t\treturn *new(*big.Int), err\n\t}\n\n\tout0 := *abi.ConvertType(out[0], new(*big.Int)).(**big.Int)\n\n\treturn out0, err\n\n}","func (node *GoValueNode) Length() (int, error) {\n\tif node.IsArray() || node.IsMap() || node.IsString() {\n\n\t\treturn node.thisValue.Len(), nil\n\t}\n\n\treturn 0, fmt.Errorf(\"this node identified as \\\"%s\\\" is not referencing an array, slice, map or string\", node.IdentifiedAs())\n}","func (hm HashMap) Len(ctx context.Context) (int64, error) {\n\treq := newRequest(\"*2\\r\\n$4\\r\\nHLEN\\r\\n$\")\n\treq.addString(hm.name)\n\treturn hm.c.cmdInt(ctx, req)\n}","func (a *Arguments) Len() int {\n\treturn len(a.exprs)\n}","func CompactLength() LengthTypeInstance {\n return &compactLength{}\n}","func (jbobject *JavaNioCharBuffer) Length() int {\n\tjret, err := jbobject.CallMethod(javabind.GetEnv(), \"length\", javabind.Int)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn jret.(int)\n}","func Lenf(t TestingT, object interface{}, length int, msg string, args ...interface{}) bool {\n\tif h, ok := t.(tHelper); ok {\n\t\th.Helper()\n\t}\n\treturn Len(t, object, length, append([]interface{}{msg}, args...)...)\n}","func (*testObject) MaxHeaderLength() uint16 {\n\treturn 0\n}","func (f *PathResponseFrame) Length(_ protocol.VersionNumber) protocol.ByteCount {\n\treturn 1 + 8\n}","func (self *Rectangle) Size1O(output *Point) *Point{\n return &Point{self.Object.Call(\"size\", output)}\n}","func Sizeof(objs ...interface{}) (sz uint64) {\n\tfor i := range objs {\n\t\tsz += sizeofInternal(reflect.ValueOf(objs[i]), false, 0)\n\t}\n\treturn\n}","func Sizeof(objs ...interface{}) (sz uint64) {\n\tfor i := range objs {\n\t\tsz += sizeofInternal(reflect.ValueOf(objs[i]), false, 0)\n\t}\n\treturn\n}","func length(v interface{}) (int, error) {\n\tswitch val := v.(type) {\n\tcase string:\n\t\treturn len(val), nil\n\tcase []interface{}:\n\t\treturn len(val), nil\n\tcase map[string]interface{}:\n\t\treturn len(val), nil\n\tdefault:\n\t\treturn -1, errors.New(\"invalid type for length\")\n\t}\n}","func (p *PathOptions) length(b *sql.Builder) {\n\tswitch {\n\tcase b.Dialect() == dialect.Postgres:\n\t\tb.WriteString(\"JSONB_ARRAY_LENGTH(\")\n\t\tp.pgTextPath(b)\n\t\tb.WriteByte(')')\n\tcase b.Dialect() == dialect.MySQL:\n\t\tp.mysqlFunc(\"JSON_LENGTH\", b)\n\tdefault:\n\t\tp.mysqlFunc(\"JSON_ARRAY_LENGTH\", b)\n\t}\n}","func (com *hornComponent) Length() int {\n\treturn 222\n}","func (this *Dcmp0_Chunk_LiteralBody) LenLiteral() (v int, err error) {\n\tif (this._f_lenLiteral) {\n\t\treturn this.lenLiteral, nil\n\t}\n\ttmp20, err := this.LenLiteralDiv2()\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\tthis.lenLiteral = int((tmp20 * 2))\n\tthis._f_lenLiteral = true\n\treturn this.lenLiteral, nil\n}","func (t *BaseType) GetLength(v *Value) int32 {\n\treturn -1\n}","func (obj object) Len() int {\n\treturn len(obj.keys)\n}","func Length(i interface{}) (l int, ok bool) {\n\tv, k := preprocess(i)\n\tswitch k {\n\tcase reflect.Map, reflect.Array, reflect.Slice, reflect.String:\n\t\treturn v.Len(), true\n\t}\n\treturn 0, false\n}","func (objs objectList) Len() int { return len(objs) }","func (a Vector3) Length() float32 {\n\treturn float32(math.Sqrt(float64(a.X*a.X + a.Y*a.Y + a.Z*a.Z)))\n}","func (f *Fields) Len() int","func (v Vector3) Length() float64 {\n\treturn math.Sqrt(math.Pow(float64(v.X), 2) + math.Pow(float64(v.Y), 2) + math.Pow(float64(v.Z), 2))\n}","func (radius *RADIUS) Len() (int, error) {\n\tn := radiusMinimumRecordSizeInBytes\n\tfor _, v := range radius.Attributes {\n\t\talen, err := attributeValueLength(v.Value)\n\t\tif err != nil {\n\t\t\treturn 0, err\n\t\t}\n\t\tn += int(alen) + 2 // Added Type and Length\n\t}\n\treturn n, nil\n}","func (m *CommandLineOptions) GetMaxObjNameLen() uint64 {\n\tif m != nil {\n\t\treturn m.MaxObjNameLen\n\t}\n\treturn 0\n}","func (geom Geometry) Length() float64 {\n\tlength := C.OGR_G_Length(geom.cval)\n\treturn float64(length)\n}","func (a *AdditionalGUTI) GetLen() (len uint16) {}"],"string":"[\n \"func (this *ObjectLength) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectLength(operands[0])\\n\\t}\\n}\",\n \"func (this *ObjectLength) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectLength(operands[0])\\n\\t}\\n}\",\n \"func (o *FakeObject) Length() int { return reflect.ValueOf(o.Value).Len() }\",\n \"func (String) Length(c *compiler.Compiler, this compiler.Expression) (expression compiler.Expression) {\\n\\texpression = c.NewExpression()\\n\\texpression.Type = Integer{}\\n\\texpression.Go.WriteString(`ctx.CountString(`)\\n\\texpression.Go.WriteB(this.Go)\\n\\texpression.Go.WriteString(`)`)\\n\\treturn expression\\n}\",\n \"func (this *ObjectLength) Apply(context Context, arg value.Value) (value.Value, error) {\\n\\tif arg.Type() == value.MISSING {\\n\\t\\treturn value.MISSING_VALUE, nil\\n\\t} else if arg.Type() != value.OBJECT {\\n\\t\\treturn value.NULL_VALUE, nil\\n\\t}\\n\\n\\toa := arg.Actual().(map[string]interface{})\\n\\treturn value.NewValue(float64(len(oa))), nil\\n}\",\n \"func (this *ObjectLength) Apply(context Context, arg value.Value) (value.Value, error) {\\n\\tif arg.Type() == value.MISSING {\\n\\t\\treturn value.MISSING_VALUE, nil\\n\\t} else if arg.Type() != value.OBJECT {\\n\\t\\treturn value.NULL_VALUE, nil\\n\\t}\\n\\n\\toa := arg.Actual().(map[string]interface{})\\n\\treturn value.NewValue(float64(len(oa))), nil\\n}\",\n \"func builtinLen(args ...Object) (Object, error) {\\n\\tif len(args) != 1 {\\n\\t\\treturn nil, ErrWrongNumArguments\\n\\t}\\n\\tswitch arg := args[0].(type) {\\n\\tcase *Array:\\n\\t\\treturn &Int{Value: int64(len(arg.Value))}, nil\\n\\tcase *String:\\n\\t\\treturn &Int{Value: int64(len(arg.Value))}, nil\\n\\tcase *Bytes:\\n\\t\\treturn &Int{Value: int64(len(arg.Value))}, nil\\n\\tcase *Map:\\n\\t\\treturn &Int{Value: int64(len(arg.Value))}, nil\\n\\tdefault:\\n\\t\\treturn nil, ErrInvalidArgumentType{\\n\\t\\t\\tName: \\\"first\\\",\\n\\t\\t\\tExpected: \\\"array/string/bytes/map\\\",\\n\\t\\t\\tFound: arg.TypeName(),\\n\\t\\t}\\n\\t}\\n}\",\n \"func (object Object) Length() int {\\n\\treturn len(object)\\n}\",\n \"func BlobLength32() LengthTypeInstance {\\n return &blobLength32{}\\n}\",\n \"func (this *ObjectLength) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.UnaryEval(this, item, context)\\n}\",\n \"func (this *ObjectLength) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.UnaryEval(this, item, context)\\n}\",\n \"func EvalLength(ev *Evaluator, node *ast.CallExpr) (r *ISEXP) {\\n\\tTRACE := ev.Trace\\n\\tif TRACE {\\n\\t\\tprintln(\\\"Length\\\")\\n\\t}\\n\\tex := node.Args[0]\\n\\tswitch ex.(type) {\\n\\tcase *ast.IndexExpr:\\n\\t\\titerator := EvalIndexExpressionToIterator(ev, ex.(*ast.IndexExpr).Index)\\n\\t\\treturn &ISEXP{ValuePos: node.Fun.Pos(), Integer: iterator.Length()}\\n\\tdefault:\\n\\t\\tval := EvalExpr(ev, node.Args[0])\\n\\t\\treturn &ISEXP{ValuePos: node.Fun.Pos(), Integer: val.Length()}\\n\\t}\\n}\",\n \"func BlobLength64() LengthTypeInstance {\\n return &blobLength64{}\\n}\",\n \"func (sequence Sequence) Length(c *Compiler, this Expression) (expression Expression) {\\n\\treturn SequenceLength(c, this)\\n}\",\n \"func BlobLength16() LengthTypeInstance {\\n return &blobLength16{}\\n}\",\n \"func (b *Builder) Length() *Builder {\\n\\tb.p.RegisterTransformation(impl.Length())\\n\\treturn b\\n}\",\n \"func Len(obj string, length int, a ...any) {\\n\\tl := len(obj)\\n\\n\\tif l != length {\\n\\t\\tdefMsg := fmt.Sprintf(assertionMsg+\\\": got '%d', want '%d'\\\", l, length)\\n\\t\\tDefault().reportAssertionFault(defMsg, a...)\\n\\t}\\n}\",\n \"func len(v Type) int32 {}\",\n \"func BlobLength8() LengthTypeInstance {\\n return &blobLength8{}\\n}\",\n \"func NewObjectNames(operand Expression) Function {\\n\\trv := &ObjectNames{\\n\\t\\t*NewUnaryFunctionBase(\\\"object_names\\\", operand),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func NewObjectNames(operand Expression) Function {\\n\\trv := &ObjectNames{\\n\\t\\t*NewUnaryFunctionBase(\\\"object_names\\\", operand),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func (p Path) Length(reference, value interface{}) Path { return p.with(Length, reference, value) }\",\n \"func JSONObjLen(conn redis.Conn, key, path string) (res interface{}, err error) {\\n\\tname, args, _ := CommandBuilder(\\\"JSON.OBJLEN\\\", key, path)\\n\\treturn conn.Do(name, args...)\\n}\",\n \"func ClosureNewObject(sizeofClosure uint32, object *Object) *Closure {\\n\\tc_sizeof_closure := (C.guint)(sizeofClosure)\\n\\n\\tc_object := (*C.GObject)(C.NULL)\\n\\tif object != nil {\\n\\t\\tc_object = (*C.GObject)(object.ToC())\\n\\t}\\n\\n\\tretC := C.g_closure_new_object(c_sizeof_closure, c_object)\\n\\tretGo := ClosureNewFromC(unsafe.Pointer(retC))\\n\\n\\treturn retGo\\n}\",\n \"func (this *ObjectRemove) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectRemove(operands[0], operands[1])\\n\\t}\\n}\",\n \"func NewRawDataLength(val int) RawDataLengthField {\\n\\treturn RawDataLengthField{quickfix.FIXInt(val)}\\n}\",\n \"func (s *TestSuite) Len(object interface{}, length int, msgAndArgs ...interface{}) {\\n\\ts.Require().Len(object, length, msgAndArgs...)\\n}\",\n \"func (this *ObjectLength) Type() value.Type { return value.NUMBER }\",\n \"func (this *ObjectLength) Type() value.Type { return value.NUMBER }\",\n \"func Length(min int, max int) BuiltInFieldRule {\\n\\treturn newLengthRule(MsgInvalidLengthFormat, &min, &max)\\n}\",\n \"func (g *mapGen) genLen() {\\n\\tg.P(\\\"func (x *\\\", g.typeName, \\\") Len() int {\\\")\\n\\t// invalid map\\n\\tg.P(\\\"if x.m == nil {\\\")\\n\\tg.P(\\\"return 0\\\")\\n\\tg.P(\\\"}\\\")\\n\\t// valid map\\n\\tg.P(\\\"return len(*x.m)\\\")\\n\\tg.P(\\\"}\\\")\\n\\tg.P()\\n}\",\n \"func length(i Instruction, ls *LuaState) {\\n\\ta, b, _ := i.ABC()\\n\\ta += 1\\n\\tb += 1\\n\\n\\tluaLen(ls, b)\\n\\tluaReplace(ls, a)\\n}\",\n \"func (jz *Jzon) Length() (l int, err error) {\\n\\tif jz.Type == JzTypeArr {\\n\\t\\treturn len(jz.data.([]*Jzon)), nil\\n\\t}\\n\\n\\tif jz.Type == JzTypeObj {\\n\\t\\treturn len(jz.data.(map[string]*Jzon)), nil\\n\\t}\\n\\n\\treturn -1, errors.New(\\\"expect node of type JzTypeArr or JzTypeObj\\\" +\\n\\t\\t\\\", but the real type is \\\" + typeStrings[jz.Type])\\n}\",\n \"func rcLength(p *TCompiler, code *TCode) (*value.Value, error) {\\n\\tvb := p.regGet(code.B)\\n\\tva := value.NewIntPtr(vb.Length())\\n\\tp.regSet(code.A, va)\\n\\tp.moveNext()\\n\\treturn va, nil\\n}\",\n \"func (gdt *Vector3) Length() Real {\\n\\targ0 := gdt.getBase()\\n\\n\\tret := C.go_godot_vector3_length(GDNative.api, arg0)\\n\\n\\treturn Real(ret)\\n}\",\n \"func (o Args) Len() int { return len(o) }\",\n \"func LengthModifier(i interface{}) (interface{}, error) {\\n\\tswitch v := i.(type) {\\n\\tcase string:\\n\\t\\treturn len(v), nil\\n\\tcase float64:\\n\\t\\t// TODO: this is not counting decimal portion\\n\\t\\t// (probably because float error can make it really long for some values)\\n\\t\\treturn getIntLength(int(v)), nil\\n\\tcase int:\\n\\t\\treturn getIntLength(v), nil\\n\\tcase int64:\\n\\t\\treturn getInt64Length(v), nil\\n\\tcase map[string]interface{}:\\n\\t\\treturn len(v), nil\\n\\tcase []interface{}:\\n\\t\\treturn len(v), nil\\n\\tcase []string:\\n\\t\\treturn len(v), nil\\n\\tcase []int:\\n\\t\\treturn len(v), nil\\n\\tcase []float64:\\n\\t\\treturn len(v), nil\\n\\tdefault:\\n\\t\\treturn nil, fmt.Errorf(\\\"Invalid type (%v) for len()\\\", reflect.TypeOf(i))\\n\\t}\\n}\",\n \"func Vec3Length(a Vec3) float32\",\n \"func (this *ObjectAdd) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectAdd(operands[0], operands[1], operands[2])\\n\\t}\\n}\",\n \"func NewBodyLength(val int) BodyLengthField {\\n\\treturn BodyLengthField{quickfix.FIXInt(val)}\\n}\",\n \"func (f *Fs) newObjectSizeAndNameOnly(o fs.Object, moName string, size int64) *Object {\\n\\treturn &Object{\\n\\t\\tObject: o,\\n\\t\\tf: f,\\n\\t\\tmo: nil,\\n\\t\\tmoName: moName,\\n\\t\\tsize: size,\\n\\t\\tmeta: nil,\\n\\t}\\n}\",\n \"func (n Number) Length() int {\\n\\treturn 0\\n}\",\n \"func (fn *formulaFuncs) LEN(argsList *list.List) formulaArg {\\n\\tif argsList.Len() != 1 {\\n\\t\\treturn newErrorFormulaArg(formulaErrorVALUE, \\\"LEN requires 1 string argument\\\")\\n\\t}\\n\\treturn newStringFormulaArg(strconv.Itoa(utf8.RuneCountInString(argsList.Front().Value.(formulaArg).String)))\\n}\",\n \"func (this *ObjectLength) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectLength) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (*FunctionLength) Name() string {\\n\\treturn \\\"function-length\\\"\\n}\",\n \"func (a *Assertions) Len(object interface{}, length int, msgAndArgs ...interface{}) bool {\\n\\treturn Len(a.t, object, length, msgAndArgs...)\\n}\",\n \"func (this *ObjectUnwrap) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectUnwrap(operands[0])\\n\\t}\\n}\",\n \"func LengthOfValue(value interface{}) (int, error) {\\n\\tv := reflect.ValueOf(value)\\n\\tswitch v.Kind() {\\n\\tcase reflect.String, reflect.Slice, reflect.Map, reflect.Array:\\n\\t\\treturn v.Len(), nil\\n\\t}\\n\\treturn 0, fmt.Errorf(\\\"cannot get the length of %v\\\", v.Kind())\\n}\",\n \"func (t *dataType) Length(n int) *dataType {\\n\\tt.str.Length(n)\\n\\treturn t\\n}\",\n \"func (this *ObjectNames) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectNames(operands[0])\\n\\t}\\n}\",\n \"func (this *ObjectNames) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectNames(operands[0])\\n\\t}\\n}\",\n \"func (_AccessIndexor *AccessIndexorCaller) GetContentObjectsLength(opts *bind.CallOpts) (*big.Int, error) {\\n\\tvar out []interface{}\\n\\terr := _AccessIndexor.contract.Call(opts, &out, \\\"getContentObjectsLength\\\")\\n\\n\\tif err != nil {\\n\\t\\treturn *new(*big.Int), err\\n\\t}\\n\\n\\tout0 := *abi.ConvertType(out[0], new(*big.Int)).(**big.Int)\\n\\n\\treturn out0, err\\n\\n}\",\n \"func (f *PingFrame) Length(_ protocol.VersionNumber) protocol.ByteCount {\\n\\treturn 1\\n}\",\n \"func (s newrelicByName) Len() int { return len(s) }\",\n \"func NewFileObject(obj *swift.ObjectOpenFile) (f *FileObject, err error) {\\n\\tf = &FileObject{obj: obj, loc: 0}\\n\\tf.length, err = obj.Length()\\n\\treturn f, err\\n}\",\n \"func TestLen(t *testing.T) {\\n\\tv := New(1)\\n\\tv.Set(0, 2) // has length 2\\n\\tif v.Len() != 2 {\\n\\t\\tt.Error(\\\"Len returned a wrong length\\\")\\n\\t}\\n}\",\n \"func NewObjectAdd(first, second, third Expression) Function {\\n\\trv := &ObjectAdd{\\n\\t\\t*NewTernaryFunctionBase(\\\"object_add\\\", first, second, third),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func NewLuaObject(L *lua.State, idx int) *LuaObject {\\n tp := L.LTypename(idx)\\n L.PushValue(idx)\\n ref := L.Ref(lua.LUA_REGISTRYINDEX)\\n return &LuaObject{L, ref, tp}\\n}\",\n \"func (t CreatableRenewers38) Size(version int16) int32 {\\n\\tvar sz int32\\n\\tsz += sizeof.String(t.PrincipalType) // PrincipalType\\n\\tsz += sizeof.String(t.PrincipalName) // PrincipalName\\n\\treturn sz\\n}\",\n \"func Len(scope common.Scope, args ...interface{}) interface{} {\\n\\tif s, ok := args[0].(string); ok {\\n\\t\\treturn int64(len(s))\\n\\t}\\n\\treturn 0\\n}\",\n \"func (t DescribedDelegationTokenRenewer41) Size(version int16) int32 {\\n\\tvar sz int32\\n\\tsz += sizeof.String(t.PrincipalType) // PrincipalType\\n\\tsz += sizeof.String(t.PrincipalName) // PrincipalName\\n\\treturn sz\\n}\",\n \"func NewSignatureLength(val int) SignatureLengthField {\\n\\treturn SignatureLengthField{quickfix.FIXInt(val)}\\n}\",\n \"func fnLen(ctx Context, doc *JDoc, params []string) interface{} {\\n\\tstats := ctx.Value(EelTotalStats).(*ServiceStats)\\n\\tif params == nil || len(params) != 1 {\\n\\t\\tctx.Log().Error(\\\"error_type\\\", \\\"func_len\\\", \\\"op\\\", \\\"len\\\", \\\"cause\\\", \\\"wrong_number_of_parameters\\\", \\\"params\\\", params)\\n\\t\\tstats.IncErrors()\\n\\t\\tAddError(ctx, SyntaxError{fmt.Sprintf(\\\"wrong number of parameters in call to len function\\\"), \\\"len\\\", params})\\n\\t\\treturn nil\\n\\t}\\n\\tvar obj interface{}\\n\\terr := json.Unmarshal([]byte(extractStringParam(params[0])), &obj)\\n\\tif err != nil {\\n\\t\\treturn len(extractStringParam(params[0]))\\n\\t}\\n\\tswitch obj.(type) {\\n\\tcase []interface{}:\\n\\t\\treturn len(obj.([]interface{}))\\n\\tcase map[string]interface{}:\\n\\t\\treturn len(obj.(map[string]interface{}))\\n\\t}\\n\\treturn 0\\n}\",\n \"func (d commandDefault) strlen(str string) string {\\n\\treturn markerLength + strconv.Itoa(len(str))\\n}\",\n \"func (_BaseAccessControlGroup *BaseAccessControlGroupCaller) GetContentObjectsLength(opts *bind.CallOpts) (*big.Int, error) {\\n\\tvar out []interface{}\\n\\terr := _BaseAccessControlGroup.contract.Call(opts, &out, \\\"getContentObjectsLength\\\")\\n\\n\\tif err != nil {\\n\\t\\treturn *new(*big.Int), err\\n\\t}\\n\\n\\tout0 := *abi.ConvertType(out[0], new(*big.Int)).(**big.Int)\\n\\n\\treturn out0, err\\n\\n}\",\n \"func (this *ObjectPut) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectPut(operands[0], operands[1], operands[2])\\n\\t}\\n}\",\n \"func NewObjectRemove(first, second Expression) Function {\\n\\trv := &ObjectRemove{\\n\\t\\t*NewBinaryFunctionBase(\\\"object_remove\\\", first, second),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func Argsize(t *Type) int\",\n \"func (b *Base) GetObjectSize(req *GetObjectSizeReq) (*GetObjectSizeResp, error) {\\n\\treturn nil, ErrFunctionNotSupported\\n}\",\n \"func (jbobject *JavaLangCharSequence) Length() int {\\n\\tjret, err := jbobject.CallMethod(javabind.GetEnv(), \\\"length\\\", javabind.Int)\\n\\tif err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\treturn jret.(int)\\n}\",\n \"func NewPattern(length int) Pattern {\\n return Pattern{ length }\\n}\",\n \"func (_BaseAccessWallet *BaseAccessWalletCaller) GetContentObjectsLength(opts *bind.CallOpts) (*big.Int, error) {\\n\\tvar out []interface{}\\n\\terr := _BaseAccessWallet.contract.Call(opts, &out, \\\"getContentObjectsLength\\\")\\n\\n\\tif err != nil {\\n\\t\\treturn *new(*big.Int), err\\n\\t}\\n\\n\\tout0 := *abi.ConvertType(out[0], new(*big.Int)).(**big.Int)\\n\\n\\treturn out0, err\\n\\n}\",\n \"func (node *GoValueNode) Length() (int, error) {\\n\\tif node.IsArray() || node.IsMap() || node.IsString() {\\n\\n\\t\\treturn node.thisValue.Len(), nil\\n\\t}\\n\\n\\treturn 0, fmt.Errorf(\\\"this node identified as \\\\\\\"%s\\\\\\\" is not referencing an array, slice, map or string\\\", node.IdentifiedAs())\\n}\",\n \"func (hm HashMap) Len(ctx context.Context) (int64, error) {\\n\\treq := newRequest(\\\"*2\\\\r\\\\n$4\\\\r\\\\nHLEN\\\\r\\\\n$\\\")\\n\\treq.addString(hm.name)\\n\\treturn hm.c.cmdInt(ctx, req)\\n}\",\n \"func (a *Arguments) Len() int {\\n\\treturn len(a.exprs)\\n}\",\n \"func CompactLength() LengthTypeInstance {\\n return &compactLength{}\\n}\",\n \"func (jbobject *JavaNioCharBuffer) Length() int {\\n\\tjret, err := jbobject.CallMethod(javabind.GetEnv(), \\\"length\\\", javabind.Int)\\n\\tif err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\treturn jret.(int)\\n}\",\n \"func Lenf(t TestingT, object interface{}, length int, msg string, args ...interface{}) bool {\\n\\tif h, ok := t.(tHelper); ok {\\n\\t\\th.Helper()\\n\\t}\\n\\treturn Len(t, object, length, append([]interface{}{msg}, args...)...)\\n}\",\n \"func (*testObject) MaxHeaderLength() uint16 {\\n\\treturn 0\\n}\",\n \"func (f *PathResponseFrame) Length(_ protocol.VersionNumber) protocol.ByteCount {\\n\\treturn 1 + 8\\n}\",\n \"func (self *Rectangle) Size1O(output *Point) *Point{\\n return &Point{self.Object.Call(\\\"size\\\", output)}\\n}\",\n \"func Sizeof(objs ...interface{}) (sz uint64) {\\n\\tfor i := range objs {\\n\\t\\tsz += sizeofInternal(reflect.ValueOf(objs[i]), false, 0)\\n\\t}\\n\\treturn\\n}\",\n \"func Sizeof(objs ...interface{}) (sz uint64) {\\n\\tfor i := range objs {\\n\\t\\tsz += sizeofInternal(reflect.ValueOf(objs[i]), false, 0)\\n\\t}\\n\\treturn\\n}\",\n \"func length(v interface{}) (int, error) {\\n\\tswitch val := v.(type) {\\n\\tcase string:\\n\\t\\treturn len(val), nil\\n\\tcase []interface{}:\\n\\t\\treturn len(val), nil\\n\\tcase map[string]interface{}:\\n\\t\\treturn len(val), nil\\n\\tdefault:\\n\\t\\treturn -1, errors.New(\\\"invalid type for length\\\")\\n\\t}\\n}\",\n \"func (p *PathOptions) length(b *sql.Builder) {\\n\\tswitch {\\n\\tcase b.Dialect() == dialect.Postgres:\\n\\t\\tb.WriteString(\\\"JSONB_ARRAY_LENGTH(\\\")\\n\\t\\tp.pgTextPath(b)\\n\\t\\tb.WriteByte(')')\\n\\tcase b.Dialect() == dialect.MySQL:\\n\\t\\tp.mysqlFunc(\\\"JSON_LENGTH\\\", b)\\n\\tdefault:\\n\\t\\tp.mysqlFunc(\\\"JSON_ARRAY_LENGTH\\\", b)\\n\\t}\\n}\",\n \"func (com *hornComponent) Length() int {\\n\\treturn 222\\n}\",\n \"func (this *Dcmp0_Chunk_LiteralBody) LenLiteral() (v int, err error) {\\n\\tif (this._f_lenLiteral) {\\n\\t\\treturn this.lenLiteral, nil\\n\\t}\\n\\ttmp20, err := this.LenLiteralDiv2()\\n\\tif err != nil {\\n\\t\\treturn 0, err\\n\\t}\\n\\tthis.lenLiteral = int((tmp20 * 2))\\n\\tthis._f_lenLiteral = true\\n\\treturn this.lenLiteral, nil\\n}\",\n \"func (t *BaseType) GetLength(v *Value) int32 {\\n\\treturn -1\\n}\",\n \"func (obj object) Len() int {\\n\\treturn len(obj.keys)\\n}\",\n \"func Length(i interface{}) (l int, ok bool) {\\n\\tv, k := preprocess(i)\\n\\tswitch k {\\n\\tcase reflect.Map, reflect.Array, reflect.Slice, reflect.String:\\n\\t\\treturn v.Len(), true\\n\\t}\\n\\treturn 0, false\\n}\",\n \"func (objs objectList) Len() int { return len(objs) }\",\n \"func (a Vector3) Length() float32 {\\n\\treturn float32(math.Sqrt(float64(a.X*a.X + a.Y*a.Y + a.Z*a.Z)))\\n}\",\n \"func (f *Fields) Len() int\",\n \"func (v Vector3) Length() float64 {\\n\\treturn math.Sqrt(math.Pow(float64(v.X), 2) + math.Pow(float64(v.Y), 2) + math.Pow(float64(v.Z), 2))\\n}\",\n \"func (radius *RADIUS) Len() (int, error) {\\n\\tn := radiusMinimumRecordSizeInBytes\\n\\tfor _, v := range radius.Attributes {\\n\\t\\talen, err := attributeValueLength(v.Value)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn 0, err\\n\\t\\t}\\n\\t\\tn += int(alen) + 2 // Added Type and Length\\n\\t}\\n\\treturn n, nil\\n}\",\n \"func (m *CommandLineOptions) GetMaxObjNameLen() uint64 {\\n\\tif m != nil {\\n\\t\\treturn m.MaxObjNameLen\\n\\t}\\n\\treturn 0\\n}\",\n \"func (geom Geometry) Length() float64 {\\n\\tlength := C.OGR_G_Length(geom.cval)\\n\\treturn float64(length)\\n}\",\n \"func (a *AdditionalGUTI) GetLen() (len uint16) {}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6523122","0.6523122","0.5879528","0.585225","0.57606673","0.57606673","0.57047075","0.56010866","0.5507508","0.5425705","0.5425705","0.5403266","0.53994787","0.53820825","0.5202233","0.5193633","0.5174063","0.5164767","0.5130811","0.5112785","0.5112785","0.51125306","0.51115525","0.5045999","0.5038918","0.5018331","0.49812493","0.4955568","0.4955568","0.4924533","0.48879114","0.48660207","0.48533323","0.48517218","0.48263907","0.48063627","0.48034155","0.4792094","0.4780229","0.47770116","0.47691065","0.47645834","0.47495502","0.47464165","0.47464165","0.47339308","0.47307196","0.47216335","0.47206673","0.47175813","0.47097516","0.47097516","0.4685058","0.46848637","0.4682387","0.46581316","0.46441278","0.46273196","0.46230918","0.4620884","0.45957115","0.45686087","0.45605862","0.45568487","0.45346886","0.4529132","0.4521522","0.45186362","0.45169815","0.44896385","0.44877398","0.44843918","0.44839975","0.4482648","0.44656578","0.4464855","0.44646165","0.44629568","0.4455946","0.4453374","0.4453191","0.44392055","0.44374666","0.44374666","0.44315565","0.44302744","0.44215858","0.4419121","0.44136137","0.44115245","0.4408191","0.43909854","0.43904725","0.43728906","0.43645683","0.4360508","0.43554425","0.4351833","0.4349061"],"string":"[\n \"0.6523122\",\n \"0.6523122\",\n \"0.5879528\",\n \"0.585225\",\n \"0.57606673\",\n \"0.57606673\",\n \"0.57047075\",\n \"0.56010866\",\n \"0.5507508\",\n \"0.5425705\",\n \"0.5425705\",\n \"0.5403266\",\n \"0.53994787\",\n \"0.53820825\",\n \"0.5202233\",\n \"0.5193633\",\n \"0.5174063\",\n \"0.5164767\",\n \"0.5130811\",\n \"0.5112785\",\n \"0.5112785\",\n \"0.51125306\",\n \"0.51115525\",\n \"0.5045999\",\n \"0.5038918\",\n \"0.5018331\",\n \"0.49812493\",\n \"0.4955568\",\n \"0.4955568\",\n \"0.4924533\",\n \"0.48879114\",\n \"0.48660207\",\n \"0.48533323\",\n \"0.48517218\",\n \"0.48263907\",\n \"0.48063627\",\n \"0.48034155\",\n \"0.4792094\",\n \"0.4780229\",\n \"0.47770116\",\n \"0.47691065\",\n \"0.47645834\",\n \"0.47495502\",\n \"0.47464165\",\n \"0.47464165\",\n \"0.47339308\",\n \"0.47307196\",\n \"0.47216335\",\n \"0.47206673\",\n \"0.47175813\",\n \"0.47097516\",\n \"0.47097516\",\n \"0.4685058\",\n \"0.46848637\",\n \"0.4682387\",\n \"0.46581316\",\n \"0.46441278\",\n \"0.46273196\",\n \"0.46230918\",\n \"0.4620884\",\n \"0.45957115\",\n \"0.45686087\",\n \"0.45605862\",\n \"0.45568487\",\n \"0.45346886\",\n \"0.4529132\",\n \"0.4521522\",\n \"0.45186362\",\n \"0.45169815\",\n \"0.44896385\",\n \"0.44877398\",\n \"0.44843918\",\n \"0.44839975\",\n \"0.4482648\",\n \"0.44656578\",\n \"0.4464855\",\n \"0.44646165\",\n \"0.44629568\",\n \"0.4455946\",\n \"0.4453374\",\n \"0.4453191\",\n \"0.44392055\",\n \"0.44374666\",\n \"0.44374666\",\n \"0.44315565\",\n \"0.44302744\",\n \"0.44215858\",\n \"0.4419121\",\n \"0.44136137\",\n \"0.44115245\",\n \"0.4408191\",\n \"0.43909854\",\n \"0.43904725\",\n \"0.43728906\",\n \"0.43645683\",\n \"0.4360508\",\n \"0.43554425\",\n \"0.4351833\",\n \"0.4349061\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.84461415"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":993,"cells":{"query":{"kind":"string","value":"/ It calls the VisitFunction method by passing in the receiver to and returns the interface. It is a visitor pattern."},"document":{"kind":"string","value":"func (this *ObjectLength) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func (this *NowStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (e FunctionCallExpression) Visit(env Environment) Value {\n\treturn NoneValue()\n}","func (i *InterfaceSet) Visit(n ast.Node) (w ast.Visitor) {\n\tswitch n := n.(type) {\n\tcase *ast.TypeSpec:\n\t\tif data, ok := n.Type.(*ast.InterfaceType); ok {\n\t\t\tr := InterfaceInfo{\n\t\t\t\tMethods: []*Method{},\n\t\t\t}\n\t\t\tmethods := data.Methods.List\n\t\t\tr.Name = n.Name.Name\n\t\t\tr.Doc = n.Doc.Text()\n\n\t\t\tfor _, m := range methods {\n\t\t\t\tfor _, name := range m.Names {\n\t\t\t\t\tr.Methods = append(r.Methods, &Method{\n\t\t\t\t\t\tMethodName: name.Name,\n\t\t\t\t\t\tDoc: m.Doc.Text(),\n\t\t\t\t\t\tParams: getParamList(m.Type.(*ast.FuncType).Params),\n\t\t\t\t\t\tResult: getParamList(m.Type.(*ast.FuncType).Results),\n\t\t\t\t\t})\n\t\t\t\t}\n\n\t\t\t}\n\t\t\ti.Interfaces = append(i.Interfaces, r)\n\t\t}\n\t}\n\treturn i\n}","func FuncInterface(_ T1) {}","func (this *ExecuteFunction) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitExecuteFunction(this)\n}","func (this *ObjectValues) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectValues) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectUnwrap) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (r *Resolver) Visitor() generated.VisitorResolver { return &visitorResolver{r} }","func (this *ObjectInnerValues) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (f VisitorFunc) Visit(node Node, visitType int) error {\n\treturn f(node, visitType)\n}","func (this *ObjectNames) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectNames) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ClockStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *NowMillis) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (statement *FunctionCall) Accept(visitor StatementVisitor) {\n\tvisitor.VisitFunctionCall(statement)\n}","func (this *ObjectRemove) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *DateDiffStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectPairs) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectPairs) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectAdd) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectInnerPairs) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectPut) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (v Value) AsFunction() Callable {\n\treturn v.iface.(Callable)\n}","func (bf *BuiltInFunc) Call(interpreter *Interpreter, args ...interface{}) interface{} {\n\t// we actually omit the `interpreter` because we already known how\n\t// to convert it into a go function.\n\treturn bf.call(bf.instance, args...)\n}","func (this *ClockMillis) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (statement *NativeCall) Accept(visitor StatementVisitor) {\n\tvisitor.VisitNativeCall(statement)\n}","func (this *DatePartStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func Visit(node Node, visitor func(Node)) {\n\tReplace(node, func(n Node) Node { visitor(n); return n })\n}","func (n *Interface) Walk(v walker.Visitor) {\n\tif v.EnterNode(n) == false {\n\t\treturn\n\t}\n\n\tif n.InterfaceName != nil {\n\t\tvv := v.GetChildrenVisitor(\"InterfaceName\")\n\t\tn.InterfaceName.Walk(vv)\n\t}\n\n\tif n.Extends != nil {\n\t\tvv := v.GetChildrenVisitor(\"Extends\")\n\t\tn.Extends.Walk(vv)\n\t}\n\n\tif n.Stmts != nil {\n\t\tvv := v.GetChildrenVisitor(\"Stmts\")\n\t\tfor _, nn := range n.Stmts {\n\t\t\tif nn != nil {\n\t\t\t\tnn.Walk(vv)\n\t\t\t}\n\t\t}\n\t}\n\n\tv.LeaveNode(n)\n}","func (this *Element) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitElement(this)\n}","func (*Base) Visit(p ASTPass, node *ast.Node, ctx Context) {\n\n\tf := *(*node).OpenFodder()\n\tp.Fodder(p, &f, ctx)\n\t*(*node).OpenFodder() = f\n\n\tswitch node := (*node).(type) {\n\tcase *ast.Apply:\n\t\tp.Apply(p, node, ctx)\n\tcase *ast.ApplyBrace:\n\t\tp.ApplyBrace(p, node, ctx)\n\tcase *ast.Array:\n\t\tp.Array(p, node, ctx)\n\tcase *ast.ArrayComp:\n\t\tp.ArrayComp(p, node, ctx)\n\tcase *ast.Assert:\n\t\tp.Assert(p, node, ctx)\n\tcase *ast.Binary:\n\t\tp.Binary(p, node, ctx)\n\tcase *ast.Conditional:\n\t\tp.Conditional(p, node, ctx)\n\tcase *ast.Dollar:\n\t\tp.Dollar(p, node, ctx)\n\tcase *ast.Error:\n\t\tp.Error(p, node, ctx)\n\tcase *ast.Function:\n\t\tp.Function(p, node, ctx)\n\tcase *ast.Import:\n\t\tp.Import(p, node, ctx)\n\tcase *ast.ImportStr:\n\t\tp.ImportStr(p, node, ctx)\n\tcase *ast.ImportBin:\n\t\tp.ImportBin(p, node, ctx)\n\tcase *ast.Index:\n\t\tp.Index(p, node, ctx)\n\tcase *ast.InSuper:\n\t\tp.InSuper(p, node, ctx)\n\tcase *ast.LiteralBoolean:\n\t\tp.LiteralBoolean(p, node, ctx)\n\tcase *ast.LiteralNull:\n\t\tp.LiteralNull(p, node, ctx)\n\tcase *ast.LiteralNumber:\n\t\tp.LiteralNumber(p, node, ctx)\n\tcase *ast.LiteralString:\n\t\tp.LiteralString(p, node, ctx)\n\tcase *ast.Local:\n\t\tp.Local(p, node, ctx)\n\tcase *ast.Object:\n\t\tp.Object(p, node, ctx)\n\tcase *ast.ObjectComp:\n\t\tp.ObjectComp(p, node, ctx)\n\tcase *ast.Parens:\n\t\tp.Parens(p, node, ctx)\n\tcase *ast.Self:\n\t\tp.Self(p, node, ctx)\n\tcase *ast.Slice:\n\t\tp.Slice(p, node, ctx)\n\tcase *ast.SuperIndex:\n\t\tp.SuperIndex(p, node, ctx)\n\tcase *ast.Unary:\n\t\tp.Unary(p, node, ctx)\n\tcase *ast.Var:\n\t\tp.Var(p, node, ctx)\n\t}\n}","func (this *StrToZoneName) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func Visit(visitor func(funcName string, backend TemplateFunc)) {\n\tlock.Lock()\n\tdefer lock.Unlock()\n\n\tfor funcName, backend := range backends {\n\t\tvisitor(funcName, backend)\n\t}\n}","func (this *DateDiffMillis) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *StrToUTC) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (u Unary) Accept(interpreter *Interpreter) Object {\n\treturn interpreter.visitUnary(u)\n}","func (v *FuncVisitor) Visit(node ast.Node) ast.Visitor {\n\tswitch n := node.(type) {\n\tcase *ast.FuncDecl:\n\t\tif n.Body == nil {\n\t\t\t// Do not count declarations of assembly functions.\n\t\t\tbreak\n\t\t}\n\t\tstart := v.fset.Position(n.Pos())\n\t\tend := v.fset.Position(n.End())\n\n\t\tfe := &FuncExtent{\n\t\t\tName: v.signature(n),\n\t\t\tDecl: n,\n\t\t\tstartLine: start.Line,\n\t\t\tstartCol: start.Column,\n\t\t\tendLine: end.Line,\n\t\t\tendCol: end.Column,\n\t\t\tOffset: start.Offset,\n\t\t\tEnd: end.Offset,\n\t\t}\n\t\tv.funcs = append(v.funcs, fe)\n\t}\n\treturn v\n}","func (this *DateAddStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *MillisToStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *Mod) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitMod(this)\n}","func (this *StrToMillis) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (b Binary) Accept(interpreter *Interpreter) Object {\n\treturn interpreter.visitBinary(b)\n}","func (this *MillisToUTC) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (v visitor) Visit(n ast.Node) ast.Visitor {\n\tif n == nil {\n\t\treturn nil\n\t}\n\n\tif ShouldPrintAbstractSyntaxTree {\n\t\tfmt.Printf(\"%s%T\\n\", strings.Repeat(\"\\t\", int(v)), n)\n\t\tfmt.Printf(\"%d\", v)\n\n\t\treturn v + 1\n\t}\n\n\tswitch d := n.(type) {\n\tcase *ast.Ident:\n\t\tif d.Obj == nil {\n\t\t\treturn v + 1\n\t\t}\n\n\t\tif d.Obj.Kind == ast.Typ {\n\t\t\tresult := parseStruct(d)\n\n\t\t\tfor i := range result {\n\t\t\t\t_, ok := Result[CurrentFile].StructScanResult[result[i].Name]\n\t\t\t\tif !ok {\n\t\t\t\t\tResult[CurrentFile].StructScanResult[result[i].Name] = result[i]\n\t\t\t\t}\n\t\t\t}\n\t\t} else if d.Obj.Kind == ast.Con || d.Obj.Kind == ast.Var {\n\t\t\tresult := parseConstantsAndVariables(d)\n\n\t\t\tfor i := range result {\n\t\t\t\t_, ok := Result[CurrentFile].ScanResult[result[i].Name]\n\t\t\t\tif !ok {\n\t\t\t\t\tResult[CurrentFile].ScanResult[result[i].Name] = result[i]\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\tdefault:\n\t\tbreak\n\t}\n\n\treturn v + 1\n}","func (p Passengers) Visit(visitor func(Passenger)) {\n\tfor _, one := range p {\n\t\tvisitor(one)\n\t}\n}","func (p Passengers) Visit(visitor func(Passenger)) {\n\tfor _, one := range p {\n\t\tvisitor(one)\n\t}\n}","func (this *MillisToZoneName) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *DateTruncStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (x AstSlice) Interface() interface{} { return asInterface(x.X, x.X == nil) }","func (p *Parser) Interface() interface{} {\n\treturn p.data\n}","func (*FuncExpr) iCallable() {}","func (this *DateAddMillis) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (c *CallExpr) accept(v ExprVisitor) {\n\tv.VisitCall(c)\n}","func (this *DatePartMillis) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (f *Function) Call(arg interface{}) {\n\tf.input <- arg\n}","func (f WalkFunc) Walk(ctx context.Context, call *Call, path string) Node { return f(path) }","func (l *List) Visit(f func(n *Node)) {\n\tp := l.head\n\tfor p != nil {\n\t\tf(p)\n\t\tp = p.next\n\t}\n}","func Replace(node Node, visitor func(Node) Node) {\n\tswitch n := node.(type) {\n\tcase *Abort:\n\tcase *API:\n\t\tfor i, c := range n.Enums {\n\t\t\tn.Enums[i] = visitor(c).(*Enum)\n\t\t}\n\t\tfor i, c := range n.Definitions {\n\t\t\tn.Definitions[i] = visitor(c).(*Definition)\n\t\t}\n\t\tfor i, c := range n.Classes {\n\t\t\tn.Classes[i] = visitor(c).(*Class)\n\t\t}\n\t\tfor i, c := range n.Pseudonyms {\n\t\t\tn.Pseudonyms[i] = visitor(c).(*Pseudonym)\n\t\t}\n\t\tfor i, c := range n.Externs {\n\t\t\tn.Externs[i] = visitor(c).(*Function)\n\t\t}\n\t\tfor i, c := range n.Subroutines {\n\t\t\tn.Subroutines[i] = visitor(c).(*Function)\n\t\t}\n\t\tfor i, c := range n.Functions {\n\t\t\tn.Functions[i] = visitor(c).(*Function)\n\t\t}\n\t\tfor i, c := range n.Methods {\n\t\t\tn.Methods[i] = visitor(c).(*Function)\n\t\t}\n\t\tfor i, c := range n.Globals {\n\t\t\tn.Globals[i] = visitor(c).(*Global)\n\t\t}\n\t\tfor i, c := range n.StaticArrays {\n\t\t\tn.StaticArrays[i] = visitor(c).(*StaticArray)\n\t\t}\n\t\tfor i, c := range n.Maps {\n\t\t\tn.Maps[i] = visitor(c).(*Map)\n\t\t}\n\t\tfor i, c := range n.Pointers {\n\t\t\tn.Pointers[i] = visitor(c).(*Pointer)\n\t\t}\n\t\tfor i, c := range n.Slices {\n\t\t\tn.Slices[i] = visitor(c).(*Slice)\n\t\t}\n\t\tfor i, c := range n.References {\n\t\t\tn.References[i] = visitor(c).(*Reference)\n\t\t}\n\t\tfor i, c := range n.Signatures {\n\t\t\tn.Signatures[i] = visitor(c).(*Signature)\n\t\t}\n\tcase *ArrayAssign:\n\t\tn.To = visitor(n.To).(*ArrayIndex)\n\t\tn.Value = visitor(n.Value).(Expression)\n\tcase *ArrayIndex:\n\t\tn.Array = visitor(n.Array).(Expression)\n\t\tn.Index = visitor(n.Index).(Expression)\n\tcase *ArrayInitializer:\n\t\tn.Array = visitor(n.Array).(Type)\n\t\tfor i, c := range n.Values {\n\t\t\tn.Values[i] = visitor(c).(Expression)\n\t\t}\n\tcase *Slice:\n\t\tn.To = visitor(n.To).(Type)\n\tcase *SliceIndex:\n\t\tn.Slice = visitor(n.Slice).(Expression)\n\t\tn.Index = visitor(n.Index).(Expression)\n\tcase *SliceAssign:\n\t\tn.To = visitor(n.To).(*SliceIndex)\n\t\tn.Value = visitor(n.Value).(Expression)\n\tcase *Assert:\n\t\tn.Condition = visitor(n.Condition).(Expression)\n\tcase *Assign:\n\t\tn.LHS = visitor(n.LHS).(Expression)\n\t\tn.RHS = visitor(n.RHS).(Expression)\n\tcase *Annotation:\n\t\tfor i, c := range n.Arguments {\n\t\t\tn.Arguments[i] = visitor(c).(Expression)\n\t\t}\n\tcase *Block:\n\t\tfor i, c := range n.Statements {\n\t\t\tn.Statements[i] = visitor(c).(Statement)\n\t\t}\n\tcase BoolValue:\n\tcase *BinaryOp:\n\t\tif n.LHS != nil {\n\t\t\tn.LHS = visitor(n.LHS).(Expression)\n\t\t}\n\t\tif n.RHS != nil {\n\t\t\tn.RHS = visitor(n.RHS).(Expression)\n\t\t}\n\tcase *BitTest:\n\t\tn.Bitfield = visitor(n.Bitfield).(Expression)\n\t\tn.Bits = visitor(n.Bits).(Expression)\n\tcase *UnaryOp:\n\t\tn.Expression = visitor(n.Expression).(Expression)\n\tcase *Branch:\n\t\tn.Condition = visitor(n.Condition).(Expression)\n\t\tn.True = visitor(n.True).(*Block)\n\t\tif n.False != nil {\n\t\t\tn.False = visitor(n.False).(*Block)\n\t\t}\n\tcase *Builtin:\n\tcase *Reference:\n\t\tn.To = visitor(n.To).(Type)\n\tcase *Call:\n\t\tn.Type = visitor(n.Type).(Type)\n\t\tn.Target = visitor(n.Target).(*Callable)\n\t\tfor i, a := range n.Arguments {\n\t\t\tn.Arguments[i] = visitor(a).(Expression)\n\t\t}\n\tcase *Callable:\n\t\tif n.Object != nil {\n\t\t\tn.Object = visitor(n.Object).(Expression)\n\t\t}\n\t\tn.Function = visitor(n.Function).(*Function)\n\tcase *Case:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tfor i, c := range n.Conditions {\n\t\t\tn.Conditions[i] = visitor(c).(Expression)\n\t\t}\n\t\tn.Block = visitor(n.Block).(*Block)\n\tcase *Cast:\n\t\tn.Object = visitor(n.Object).(Expression)\n\t\tn.Type = visitor(n.Type).(Type)\n\tcase *Class:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tfor i, f := range n.Fields {\n\t\t\tn.Fields[i] = visitor(f).(*Field)\n\t\t}\n\t\tfor i, m := range n.Methods {\n\t\t\tn.Methods[i] = visitor(m).(*Function)\n\t\t}\n\tcase *ClassInitializer:\n\t\tfor i, f := range n.Fields {\n\t\t\tn.Fields[i] = visitor(f).(*FieldInitializer)\n\t\t}\n\tcase *Choice:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tfor i, c := range n.Conditions {\n\t\t\tn.Conditions[i] = visitor(c).(Expression)\n\t\t}\n\t\tn.Expression = visitor(n.Expression).(Expression)\n\tcase *Definition:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tn.Expression = visitor(n.Expression).(Expression)\n\tcase *DefinitionUsage:\n\t\tn.Expression = visitor(n.Expression).(Expression)\n\t\tn.Definition = visitor(n.Definition).(*Definition)\n\tcase *DeclareLocal:\n\t\tn.Local = visitor(n.Local).(*Local)\n\t\tif n.Local.Value != nil {\n\t\t\tn.Local.Value = visitor(n.Local.Value).(Expression)\n\t\t}\n\tcase Documentation:\n\tcase *Enum:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tfor i, e := range n.Entries {\n\t\t\tn.Entries[i] = visitor(e).(*EnumEntry)\n\t\t}\n\tcase *EnumEntry:\n\tcase *Fence:\n\t\tif n.Statement != nil {\n\t\t\tn.Statement = visitor(n.Statement).(Statement)\n\t\t}\n\tcase *Field:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tn.Type = visitor(n.Type).(Type)\n\t\tif n.Default != nil {\n\t\t\tn.Default = visitor(n.Default).(Expression)\n\t\t}\n\tcase *FieldInitializer:\n\t\tn.Value = visitor(n.Value).(Expression)\n\tcase Float32Value:\n\tcase Float64Value:\n\tcase *Function:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tif n.Return != nil {\n\t\t\tn.Return = visitor(n.Return).(*Parameter)\n\t\t}\n\t\tfor i, c := range n.FullParameters {\n\t\t\tn.FullParameters[i] = visitor(c).(*Parameter)\n\t\t}\n\t\tif n.Block != nil {\n\t\t\tn.Block = visitor(n.Block).(*Block)\n\t\t}\n\t\tn.Signature = visitor(n.Signature).(*Signature)\n\tcase *Global:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\tcase *StaticArray:\n\t\tn.ValueType = visitor(n.ValueType).(Type)\n\t\tn.SizeExpr = visitor(n.SizeExpr).(Expression)\n\tcase *Signature:\n\tcase Int8Value:\n\tcase Int16Value:\n\tcase Int32Value:\n\tcase Int64Value:\n\tcase *Iteration:\n\t\tn.Iterator = visitor(n.Iterator).(*Local)\n\t\tn.From = visitor(n.From).(Expression)\n\t\tn.To = visitor(n.To).(Expression)\n\t\tn.Block = visitor(n.Block).(*Block)\n\tcase *MapIteration:\n\t\tn.IndexIterator = visitor(n.IndexIterator).(*Local)\n\t\tn.KeyIterator = visitor(n.KeyIterator).(*Local)\n\t\tn.ValueIterator = visitor(n.ValueIterator).(*Local)\n\t\tn.Map = visitor(n.Map).(Expression)\n\t\tn.Block = visitor(n.Block).(*Block)\n\tcase Invalid:\n\tcase *Length:\n\t\tn.Object = visitor(n.Object).(Expression)\n\tcase *Local:\n\t\tn.Type = visitor(n.Type).(Type)\n\tcase *Map:\n\t\tn.KeyType = visitor(n.KeyType).(Type)\n\t\tn.ValueType = visitor(n.ValueType).(Type)\n\tcase *MapAssign:\n\t\tn.To = visitor(n.To).(*MapIndex)\n\t\tn.Value = visitor(n.Value).(Expression)\n\tcase *MapContains:\n\t\tn.Key = visitor(n.Key).(Expression)\n\t\tn.Map = visitor(n.Map).(Expression)\n\tcase *MapIndex:\n\t\tn.Map = visitor(n.Map).(Expression)\n\t\tn.Index = visitor(n.Index).(Expression)\n\tcase *MapRemove:\n\t\tn.Map = visitor(n.Map).(Expression)\n\t\tn.Key = visitor(n.Key).(Expression)\n\tcase *MapClear:\n\t\tn.Map = visitor(n.Map).(Expression)\n\tcase *Member:\n\t\tn.Object = visitor(n.Object).(Expression)\n\t\tn.Field = visitor(n.Field).(*Field)\n\tcase *MessageValue:\n\t\tfor i, a := range n.Arguments {\n\t\t\tn.Arguments[i] = visitor(a).(*FieldInitializer)\n\t\t}\n\tcase *New:\n\t\tn.Type = visitor(n.Type).(*Reference)\n\tcase *Parameter:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tn.Type = visitor(n.Type).(Type)\n\tcase *Pointer:\n\t\tn.To = visitor(n.To).(Type)\n\tcase *Pseudonym:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tn.To = visitor(n.To).(Type)\n\t\tfor i, m := range n.Methods {\n\t\t\tn.Methods[i] = visitor(m).(*Function)\n\t\t}\n\tcase *Return:\n\t\tif n.Value != nil {\n\t\t\tn.Value = visitor(n.Value).(Expression)\n\t\t}\n\tcase *Select:\n\t\tn.Value = visitor(n.Value).(Expression)\n\t\tfor i, c := range n.Choices {\n\t\t\tn.Choices[i] = visitor(c).(*Choice)\n\t\t}\n\t\tif n.Default != nil {\n\t\t\tn.Default = visitor(n.Default).(Expression)\n\t\t}\n\tcase StringValue:\n\tcase *Switch:\n\t\tn.Value = visitor(n.Value).(Expression)\n\t\tfor i, c := range n.Cases {\n\t\t\tn.Cases[i] = visitor(c).(*Case)\n\t\t}\n\t\tif n.Default != nil {\n\t\t\tn.Default = visitor(n.Default).(*Block)\n\t\t}\n\tcase Uint8Value:\n\tcase Uint16Value:\n\tcase Uint32Value:\n\tcase Uint64Value:\n\tcase *Unknown:\n\tcase *Clone:\n\t\tn.Slice = visitor(n.Slice).(Expression)\n\tcase *Copy:\n\t\tn.Src = visitor(n.Src).(Expression)\n\t\tn.Dst = visitor(n.Dst).(Expression)\n\tcase *Create:\n\t\tn.Type = visitor(n.Type).(*Reference)\n\t\tn.Initializer = visitor(n.Initializer).(*ClassInitializer)\n\tcase *Ignore:\n\tcase *Make:\n\t\tn.Type = visitor(n.Type).(*Slice)\n\t\tn.Size = visitor(n.Size).(Expression)\n\tcase Null:\n\tcase *PointerRange:\n\t\tn.Pointer = visitor(n.Pointer).(Expression)\n\t\tn.Range = visitor(n.Range).(*BinaryOp)\n\tcase *Read:\n\t\tn.Slice = visitor(n.Slice).(Expression)\n\tcase *SliceContains:\n\t\tn.Value = visitor(n.Value).(Expression)\n\t\tn.Slice = visitor(n.Slice).(Expression)\n\tcase *SliceRange:\n\t\tn.Slice = visitor(n.Slice).(Expression)\n\t\tn.Range = visitor(n.Range).(*BinaryOp)\n\tcase *Write:\n\t\tn.Slice = visitor(n.Slice).(Expression)\n\tdefault:\n\t\tpanic(fmt.Errorf(\"Unsupported semantic node type %T\", n))\n\t}\n}","func (r *fakeResourceResult) Visit(fn resource.VisitorFunc) error {\n\tfor _, info := range r.Infos {\n\t\terr := fn(info, nil)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}","func (h *MapInt16ToInt) Visit(fn func(int16, int)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func FuncInterfaceCompatible(_ T1) {}","func (b *Binary) Accept(v Visitor) {\n\tv.VisitBinary(b)\n}","func (s *InterfaceStep) Interface() interface{} {\n\treturn s.value\n}","func (h *MapInt16ToInt8) Visit(fn func(int16, int8)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func (s *Sequenced) Accept(v Visitor) {\n\tv.VisitSequenced(s)\n}","func testVisitors(methodCalled *string) (*SimpleVisitor, []*SimpleVisitor) {\n\tv := &SimpleVisitor{\n\t\tDoVisitEnumNode: func(*EnumNode) error {\n\t\t\t*methodCalled = \"*EnumNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitEnumValueNode: func(*EnumValueNode) error {\n\t\t\t*methodCalled = \"*EnumValueNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitFieldDeclNode: func(FieldDeclNode) error {\n\t\t\t*methodCalled = \"FieldDeclNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitFieldNode: func(*FieldNode) error {\n\t\t\t*methodCalled = \"*FieldNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitGroupNode: func(*GroupNode) error {\n\t\t\t*methodCalled = \"*GroupNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitOneofNode: func(*OneofNode) error {\n\t\t\t*methodCalled = \"*OneofNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitMapTypeNode: func(*MapTypeNode) error {\n\t\t\t*methodCalled = \"*MapTypeNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitMapFieldNode: func(*MapFieldNode) error {\n\t\t\t*methodCalled = \"*MapFieldNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitFileNode: func(*FileNode) error {\n\t\t\t*methodCalled = \"*FileNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitSyntaxNode: func(*SyntaxNode) error {\n\t\t\t*methodCalled = \"*SyntaxNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitImportNode: func(*ImportNode) error {\n\t\t\t*methodCalled = \"*ImportNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitPackageNode: func(*PackageNode) error {\n\t\t\t*methodCalled = \"*PackageNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitIdentValueNode: func(IdentValueNode) error {\n\t\t\t*methodCalled = \"IdentValueNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitIdentNode: func(*IdentNode) error {\n\t\t\t*methodCalled = \"*IdentNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitCompoundIdentNode: func(*CompoundIdentNode) error {\n\t\t\t*methodCalled = \"*CompoundIdentNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitKeywordNode: func(*KeywordNode) error {\n\t\t\t*methodCalled = \"*KeywordNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitMessageDeclNode: func(MessageDeclNode) error {\n\t\t\t*methodCalled = \"MessageDeclNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitMessageNode: func(*MessageNode) error {\n\t\t\t*methodCalled = \"*MessageNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitExtendNode: func(*ExtendNode) error {\n\t\t\t*methodCalled = \"*ExtendNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitNode: func(Node) error {\n\t\t\t*methodCalled = \"Node\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitTerminalNode: func(TerminalNode) error {\n\t\t\t*methodCalled = \"TerminalNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitCompositeNode: func(CompositeNode) error {\n\t\t\t*methodCalled = \"CompositeNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitRuneNode: func(*RuneNode) error {\n\t\t\t*methodCalled = \"*RuneNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitEmptyDeclNode: func(*EmptyDeclNode) error {\n\t\t\t*methodCalled = \"*EmptyDeclNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitOptionNode: func(*OptionNode) error {\n\t\t\t*methodCalled = \"*OptionNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitOptionNameNode: func(*OptionNameNode) error {\n\t\t\t*methodCalled = \"*OptionNameNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitFieldReferenceNode: func(*FieldReferenceNode) error {\n\t\t\t*methodCalled = \"*FieldReferenceNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitCompactOptionsNode: func(*CompactOptionsNode) error {\n\t\t\t*methodCalled = \"*CompactOptionsNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitExtensionRangeNode: func(*ExtensionRangeNode) error {\n\t\t\t*methodCalled = \"*ExtensionRangeNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitRangeNode: func(*RangeNode) error {\n\t\t\t*methodCalled = \"*RangeNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitReservedNode: func(*ReservedNode) error {\n\t\t\t*methodCalled = \"*ReservedNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitServiceNode: func(*ServiceNode) error {\n\t\t\t*methodCalled = \"*ServiceNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitRPCNode: func(*RPCNode) error {\n\t\t\t*methodCalled = \"*RPCNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitRPCTypeNode: func(*RPCTypeNode) error {\n\t\t\t*methodCalled = \"*RPCTypeNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitValueNode: func(ValueNode) error {\n\t\t\t*methodCalled = \"ValueNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitStringValueNode: func(StringValueNode) error {\n\t\t\t*methodCalled = \"StringValueNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitStringLiteralNode: func(*StringLiteralNode) error {\n\t\t\t*methodCalled = \"*StringLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitCompoundStringLiteralNode: func(*CompoundStringLiteralNode) error {\n\t\t\t*methodCalled = \"*CompoundStringLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitIntValueNode: func(IntValueNode) error {\n\t\t\t*methodCalled = \"IntValueNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitUintLiteralNode: func(*UintLiteralNode) error {\n\t\t\t*methodCalled = \"*UintLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitPositiveUintLiteralNode: func(*PositiveUintLiteralNode) error {\n\t\t\t*methodCalled = \"*PositiveUintLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitNegativeIntLiteralNode: func(*NegativeIntLiteralNode) error {\n\t\t\t*methodCalled = \"*NegativeIntLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitFloatValueNode: func(FloatValueNode) error {\n\t\t\t*methodCalled = \"FloatValueNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitFloatLiteralNode: func(*FloatLiteralNode) error {\n\t\t\t*methodCalled = \"*FloatLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitSpecialFloatLiteralNode: func(*SpecialFloatLiteralNode) error {\n\t\t\t*methodCalled = \"*SpecialFloatLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitSignedFloatLiteralNode: func(*SignedFloatLiteralNode) error {\n\t\t\t*methodCalled = \"*SignedFloatLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitArrayLiteralNode: func(*ArrayLiteralNode) error {\n\t\t\t*methodCalled = \"*ArrayLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitMessageLiteralNode: func(*MessageLiteralNode) error {\n\t\t\t*methodCalled = \"*MessageLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitMessageFieldNode: func(*MessageFieldNode) error {\n\t\t\t*methodCalled = \"*MessageFieldNode\"\n\t\t\treturn nil\n\t\t},\n\t}\n\tothers := []*SimpleVisitor{\n\t\t{\n\t\t\tDoVisitEnumNode: v.DoVisitEnumNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitEnumValueNode: v.DoVisitEnumValueNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitFieldDeclNode: v.DoVisitFieldDeclNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitFieldNode: v.DoVisitFieldNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitGroupNode: v.DoVisitGroupNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitOneofNode: v.DoVisitOneofNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitMapTypeNode: v.DoVisitMapTypeNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitMapFieldNode: v.DoVisitMapFieldNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitFileNode: v.DoVisitFileNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitSyntaxNode: v.DoVisitSyntaxNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitImportNode: v.DoVisitImportNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitPackageNode: v.DoVisitPackageNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitIdentValueNode: v.DoVisitIdentValueNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitIdentNode: v.DoVisitIdentNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitCompoundIdentNode: v.DoVisitCompoundIdentNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitKeywordNode: v.DoVisitKeywordNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitMessageDeclNode: v.DoVisitMessageDeclNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitMessageNode: v.DoVisitMessageNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitExtendNode: v.DoVisitExtendNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitNode: v.DoVisitNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitTerminalNode: v.DoVisitTerminalNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitCompositeNode: v.DoVisitCompositeNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitRuneNode: v.DoVisitRuneNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitEmptyDeclNode: v.DoVisitEmptyDeclNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitOptionNode: v.DoVisitOptionNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitOptionNameNode: v.DoVisitOptionNameNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitFieldReferenceNode: v.DoVisitFieldReferenceNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitCompactOptionsNode: v.DoVisitCompactOptionsNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitExtensionRangeNode: v.DoVisitExtensionRangeNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitRangeNode: v.DoVisitRangeNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitReservedNode: v.DoVisitReservedNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitServiceNode: v.DoVisitServiceNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitRPCNode: v.DoVisitRPCNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitRPCTypeNode: v.DoVisitRPCTypeNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitValueNode: v.DoVisitValueNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitStringValueNode: v.DoVisitStringValueNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitStringLiteralNode: v.DoVisitStringLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitCompoundStringLiteralNode: v.DoVisitCompoundStringLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitIntValueNode: v.DoVisitIntValueNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitUintLiteralNode: v.DoVisitUintLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitPositiveUintLiteralNode: v.DoVisitPositiveUintLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitNegativeIntLiteralNode: v.DoVisitNegativeIntLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitFloatValueNode: v.DoVisitFloatValueNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitFloatLiteralNode: v.DoVisitFloatLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitSpecialFloatLiteralNode: v.DoVisitSpecialFloatLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitSignedFloatLiteralNode: v.DoVisitSignedFloatLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitArrayLiteralNode: v.DoVisitArrayLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitMessageLiteralNode: v.DoVisitMessageLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitMessageFieldNode: v.DoVisitMessageFieldNode,\n\t\t},\n\t}\n\treturn v, others\n}","func _[T interface{ ~func(string) int }](f T) int {\n\treturn f(\"hello\")\n}","func VisitedFunctions(prog *ssa.Program, packs []*ssa.Package, isOvl isOverloaded) (seen, usesGR map[*ssa.Function]bool) {\n\tvisit := visitor{\n\t\tprog: prog,\n\t\tpacks: packs, // new\n\t\tseen: make(map[*ssa.Function]bool),\n\t\tusesGR: make(map[*ssa.Function]bool),\n\t}\n\tvisit.program(isOvl)\n\t//fmt.Printf(\"DEBUG VisitedFunctions.usesGR %v\\n\", visit.usesGR)\n\t//fmt.Printf(\"DEBUG VisitedFunctions.seen %v\\n\", visit.seen)\n\treturn visit.seen, visit.usesGR\n}","func (h *MapInt16ToInt32) Visit(fn func(int16, int32)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func (x *fastReflection_Evidence) Interface() protoreflect.ProtoMessage {\n\treturn (*Evidence)(x)\n}","func (f *functionQuery) Evaluate(t iterator) interface{} {\n\treturn f.Func(f.Input, t)\n}","func Visit(node Node, visitor func(node Node, next func() error) error) error {\n\tif reflect.ValueOf(node).IsNil() { // Workaround for Go's typed nil interfaces.\n\t\treturn nil\n\t}\n\treturn visitor(node, func() error {\n\t\tfor _, child := range node.children() {\n\t\t\tif err := Visit(child, visitor); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\treturn nil\n\t})\n}","func (x *fastReflection_Output) Interface() protoreflect.ProtoMessage {\n\treturn (*Output)(x)\n}","func (i I) I() I { return i }","func (rf RendererFunc) Render(w io.Writer, v interface{}) error { return rf(w, v) }","func (v Variable) Accept(interpreter *Interpreter) Object {\n\treturn interpreter.visitVariable(v)\n}","func (*Base) Function(p ASTPass, node *ast.Function, ctx Context) {\n\tp.Parameters(p, &node.ParenLeftFodder, &node.Parameters, &node.ParenRightFodder, ctx)\n\tp.Visit(p, &node.Body, ctx)\n}","func (t *FileTree) VisitorFn(fn func(file.Reference)) func(node.Node) {\n\treturn func(node node.Node) {\n\t\tfn(t.fileByPathID(node.ID()))\n\t}\n}","func execNewInterface(_ int, p *gop.Context) {\n\targs := p.GetArgs(2)\n\tret := types.NewInterface(args[0].([]*types.Func), args[1].([]*types.Named))\n\tp.Ret(2, ret)\n}","func (h *MapInt16ToUint8) Visit(fn func(int16, uint8)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func FuncInterfaceCompatible2(_ io.Writer) {}","func (h *MapInt16ToInt16) Visit(fn func(int16, int16)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func Function(sig *CallSignature) Type {\n\treturn Type{functionImpl{sig: sig}}\n}","func (mi *ModifierInvocation) Visit(ctx *parser.ModifierInvocationContext) {\n\tmi.Start = ctx.GetStart()\n\tmi.Stop = ctx.GetStop()\n\tmi.Identifier = ctx.Identifier().GetText()\n\n\tif ctx.ExpressionList() != nil {\n\t\texpList := ctx.ExpressionList().(*parser.ExpressionListContext)\n\n\t\tfor _, exprCtx := range expList.AllExpression() {\n\t\t\texpression := NewExpression()\n\t\t\texpression.Visit(exprCtx.(*parser.ExpressionContext))\n\n\t\t\tmi.Expressions = append(mi.Expressions, expression)\n\t\t}\n\t}\n}","func (x *fastReflection_Input) Interface() protoreflect.ProtoMessage {\n\treturn (*Input)(x)\n}","func (a Assign) Accept(interpreter *Interpreter) Object {\n\treturn interpreter.visitAssign(a)\n}","func (h *MapInt16ToUint) Visit(fn func(int16, uint)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func (_Contract *ContractCallerSession) InterfaceImplementer(node [32]byte, interfaceID [4]byte) (common.Address, error) {\n\treturn _Contract.Contract.InterfaceImplementer(&_Contract.CallOpts, node, interfaceID)\n}","func (h *MapInt16ToUint32) Visit(fn func(int16, uint32)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func (g Grouping) Accept(interpreter *Interpreter) Object {\n\treturn interpreter.visitGrouping(g)\n}","func Interface(ifname string) func(*NetworkTap) error {\n\treturn func(filterdev *NetworkTap) error {\n\t\terr := filterdev.SetInterface(int(filterdev.device.Fd()), ifname)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\treturn nil\n\t}\n}","func (f *FlagSet) Visit(fn func(*Flag)) {\n\tfor _, flag := range sortFlags(f.actual) {\n\t\tfn(flag)\n\t}\n}","func (_Contract *ContractFilterer) FilterInterfaceChanged(opts *bind.FilterOpts, node [][32]byte, interfaceID [][4]byte) (*ContractInterfaceChangedIterator, error) {\n\n\tvar nodeRule []interface{}\n\tfor _, nodeItem := range node {\n\t\tnodeRule = append(nodeRule, nodeItem)\n\t}\n\tvar interfaceIDRule []interface{}\n\tfor _, interfaceIDItem := range interfaceID {\n\t\tinterfaceIDRule = append(interfaceIDRule, interfaceIDItem)\n\t}\n\n\tlogs, sub, err := _Contract.contract.FilterLogs(opts, \"InterfaceChanged\", nodeRule, interfaceIDRule)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &ContractInterfaceChangedIterator{contract: _Contract.contract, event: \"InterfaceChanged\", logs: logs, sub: sub}, nil\n}","func (f *FlagSet) Visit(fn func(*Flag)) {\n\tif len(f.actual) == 0 {\n\t\treturn\n\t}\n\n\tvar flags []*Flag\n\tif f.SortFlags {\n\t\tif len(f.actual) != len(f.sortedActual) {\n\t\t\tf.sortedActual = sortFlags(f.actual)\n\t\t}\n\t\tflags = f.sortedActual\n\t} else {\n\t\tflags = f.orderedActual\n\t}\n\n\tfor _, flag := range flags {\n\t\tfn(flag)\n\t}\n}","func (x *fastReflection_EventRetire) Interface() protoreflect.ProtoMessage {\n\treturn (*EventRetire)(x)\n}","func execmInterfaceMethod(_ int, p *gop.Context) {\n\targs := p.GetArgs(2)\n\tret := args[0].(*types.Interface).Method(args[1].(int))\n\tp.Ret(2, ret)\n}","func (lambda PresenterFunc) Render(message interface{}) error {\n\treturn lambda(message)\n}","func underlyingInterface(w v1alpha1.ExecutableWorkflow, node v1alpha1.ExecutableNode) (*core.TypedInterface, error) {\n\tiface := &core.TypedInterface{}\n\tif node.GetTaskID() != nil {\n\t\tt, err := w.GetTask(*node.GetTaskID())\n\t\tif err != nil {\n\t\t\t// Should never happen\n\t\t\treturn nil, err\n\t\t}\n\n\t\tiface.Outputs = t.CoreTask().GetInterface().Outputs\n\t} else if wfNode := node.GetWorkflowNode(); wfNode != nil {\n\t\tif wfRef := wfNode.GetSubWorkflowRef(); wfRef != nil {\n\t\t\tt := w.FindSubWorkflow(*wfRef)\n\t\t\tif t == nil {\n\t\t\t\t// Should never happen\n\t\t\t\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \"Couldn't find subworkflow [%v].\", wfRef)\n\t\t\t}\n\n\t\t\tiface.Outputs = t.GetOutputs().VariableMap\n\t\t} else {\n\t\t\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \"Unknown interface\")\n\t\t}\n\t} else if node.GetBranchNode() != nil {\n\t\tif ifBlock := node.GetBranchNode().GetIf(); ifBlock != nil && ifBlock.GetThenNode() != nil {\n\t\t\tbn, found := w.GetNode(*ifBlock.GetThenNode())\n\t\t\tif !found {\n\t\t\t\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \"Couldn't find branch node [%v]\",\n\t\t\t\t\t*ifBlock.GetThenNode())\n\t\t\t}\n\n\t\t\treturn underlyingInterface(w, bn)\n\t\t}\n\n\t\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \"Empty branch detected.\")\n\t} else {\n\t\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \"Unknown interface.\")\n\t}\n\n\treturn iface, nil\n}"],"string":"[\n \"func (this *NowStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (e FunctionCallExpression) Visit(env Environment) Value {\\n\\treturn NoneValue()\\n}\",\n \"func (i *InterfaceSet) Visit(n ast.Node) (w ast.Visitor) {\\n\\tswitch n := n.(type) {\\n\\tcase *ast.TypeSpec:\\n\\t\\tif data, ok := n.Type.(*ast.InterfaceType); ok {\\n\\t\\t\\tr := InterfaceInfo{\\n\\t\\t\\t\\tMethods: []*Method{},\\n\\t\\t\\t}\\n\\t\\t\\tmethods := data.Methods.List\\n\\t\\t\\tr.Name = n.Name.Name\\n\\t\\t\\tr.Doc = n.Doc.Text()\\n\\n\\t\\t\\tfor _, m := range methods {\\n\\t\\t\\t\\tfor _, name := range m.Names {\\n\\t\\t\\t\\t\\tr.Methods = append(r.Methods, &Method{\\n\\t\\t\\t\\t\\t\\tMethodName: name.Name,\\n\\t\\t\\t\\t\\t\\tDoc: m.Doc.Text(),\\n\\t\\t\\t\\t\\t\\tParams: getParamList(m.Type.(*ast.FuncType).Params),\\n\\t\\t\\t\\t\\t\\tResult: getParamList(m.Type.(*ast.FuncType).Results),\\n\\t\\t\\t\\t\\t})\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\ti.Interfaces = append(i.Interfaces, r)\\n\\t\\t}\\n\\t}\\n\\treturn i\\n}\",\n \"func FuncInterface(_ T1) {}\",\n \"func (this *ExecuteFunction) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitExecuteFunction(this)\\n}\",\n \"func (this *ObjectValues) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectValues) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectUnwrap) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (r *Resolver) Visitor() generated.VisitorResolver { return &visitorResolver{r} }\",\n \"func (this *ObjectInnerValues) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (f VisitorFunc) Visit(node Node, visitType int) error {\\n\\treturn f(node, visitType)\\n}\",\n \"func (this *ObjectNames) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectNames) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ClockStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *NowMillis) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (statement *FunctionCall) Accept(visitor StatementVisitor) {\\n\\tvisitor.VisitFunctionCall(statement)\\n}\",\n \"func (this *ObjectRemove) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *DateDiffStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectPairs) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectPairs) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectAdd) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectInnerPairs) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectPut) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (v Value) AsFunction() Callable {\\n\\treturn v.iface.(Callable)\\n}\",\n \"func (bf *BuiltInFunc) Call(interpreter *Interpreter, args ...interface{}) interface{} {\\n\\t// we actually omit the `interpreter` because we already known how\\n\\t// to convert it into a go function.\\n\\treturn bf.call(bf.instance, args...)\\n}\",\n \"func (this *ClockMillis) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (statement *NativeCall) Accept(visitor StatementVisitor) {\\n\\tvisitor.VisitNativeCall(statement)\\n}\",\n \"func (this *DatePartStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func Visit(node Node, visitor func(Node)) {\\n\\tReplace(node, func(n Node) Node { visitor(n); return n })\\n}\",\n \"func (n *Interface) Walk(v walker.Visitor) {\\n\\tif v.EnterNode(n) == false {\\n\\t\\treturn\\n\\t}\\n\\n\\tif n.InterfaceName != nil {\\n\\t\\tvv := v.GetChildrenVisitor(\\\"InterfaceName\\\")\\n\\t\\tn.InterfaceName.Walk(vv)\\n\\t}\\n\\n\\tif n.Extends != nil {\\n\\t\\tvv := v.GetChildrenVisitor(\\\"Extends\\\")\\n\\t\\tn.Extends.Walk(vv)\\n\\t}\\n\\n\\tif n.Stmts != nil {\\n\\t\\tvv := v.GetChildrenVisitor(\\\"Stmts\\\")\\n\\t\\tfor _, nn := range n.Stmts {\\n\\t\\t\\tif nn != nil {\\n\\t\\t\\t\\tnn.Walk(vv)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tv.LeaveNode(n)\\n}\",\n \"func (this *Element) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitElement(this)\\n}\",\n \"func (*Base) Visit(p ASTPass, node *ast.Node, ctx Context) {\\n\\n\\tf := *(*node).OpenFodder()\\n\\tp.Fodder(p, &f, ctx)\\n\\t*(*node).OpenFodder() = f\\n\\n\\tswitch node := (*node).(type) {\\n\\tcase *ast.Apply:\\n\\t\\tp.Apply(p, node, ctx)\\n\\tcase *ast.ApplyBrace:\\n\\t\\tp.ApplyBrace(p, node, ctx)\\n\\tcase *ast.Array:\\n\\t\\tp.Array(p, node, ctx)\\n\\tcase *ast.ArrayComp:\\n\\t\\tp.ArrayComp(p, node, ctx)\\n\\tcase *ast.Assert:\\n\\t\\tp.Assert(p, node, ctx)\\n\\tcase *ast.Binary:\\n\\t\\tp.Binary(p, node, ctx)\\n\\tcase *ast.Conditional:\\n\\t\\tp.Conditional(p, node, ctx)\\n\\tcase *ast.Dollar:\\n\\t\\tp.Dollar(p, node, ctx)\\n\\tcase *ast.Error:\\n\\t\\tp.Error(p, node, ctx)\\n\\tcase *ast.Function:\\n\\t\\tp.Function(p, node, ctx)\\n\\tcase *ast.Import:\\n\\t\\tp.Import(p, node, ctx)\\n\\tcase *ast.ImportStr:\\n\\t\\tp.ImportStr(p, node, ctx)\\n\\tcase *ast.ImportBin:\\n\\t\\tp.ImportBin(p, node, ctx)\\n\\tcase *ast.Index:\\n\\t\\tp.Index(p, node, ctx)\\n\\tcase *ast.InSuper:\\n\\t\\tp.InSuper(p, node, ctx)\\n\\tcase *ast.LiteralBoolean:\\n\\t\\tp.LiteralBoolean(p, node, ctx)\\n\\tcase *ast.LiteralNull:\\n\\t\\tp.LiteralNull(p, node, ctx)\\n\\tcase *ast.LiteralNumber:\\n\\t\\tp.LiteralNumber(p, node, ctx)\\n\\tcase *ast.LiteralString:\\n\\t\\tp.LiteralString(p, node, ctx)\\n\\tcase *ast.Local:\\n\\t\\tp.Local(p, node, ctx)\\n\\tcase *ast.Object:\\n\\t\\tp.Object(p, node, ctx)\\n\\tcase *ast.ObjectComp:\\n\\t\\tp.ObjectComp(p, node, ctx)\\n\\tcase *ast.Parens:\\n\\t\\tp.Parens(p, node, ctx)\\n\\tcase *ast.Self:\\n\\t\\tp.Self(p, node, ctx)\\n\\tcase *ast.Slice:\\n\\t\\tp.Slice(p, node, ctx)\\n\\tcase *ast.SuperIndex:\\n\\t\\tp.SuperIndex(p, node, ctx)\\n\\tcase *ast.Unary:\\n\\t\\tp.Unary(p, node, ctx)\\n\\tcase *ast.Var:\\n\\t\\tp.Var(p, node, ctx)\\n\\t}\\n}\",\n \"func (this *StrToZoneName) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func Visit(visitor func(funcName string, backend TemplateFunc)) {\\n\\tlock.Lock()\\n\\tdefer lock.Unlock()\\n\\n\\tfor funcName, backend := range backends {\\n\\t\\tvisitor(funcName, backend)\\n\\t}\\n}\",\n \"func (this *DateDiffMillis) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *StrToUTC) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (u Unary) Accept(interpreter *Interpreter) Object {\\n\\treturn interpreter.visitUnary(u)\\n}\",\n \"func (v *FuncVisitor) Visit(node ast.Node) ast.Visitor {\\n\\tswitch n := node.(type) {\\n\\tcase *ast.FuncDecl:\\n\\t\\tif n.Body == nil {\\n\\t\\t\\t// Do not count declarations of assembly functions.\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tstart := v.fset.Position(n.Pos())\\n\\t\\tend := v.fset.Position(n.End())\\n\\n\\t\\tfe := &FuncExtent{\\n\\t\\t\\tName: v.signature(n),\\n\\t\\t\\tDecl: n,\\n\\t\\t\\tstartLine: start.Line,\\n\\t\\t\\tstartCol: start.Column,\\n\\t\\t\\tendLine: end.Line,\\n\\t\\t\\tendCol: end.Column,\\n\\t\\t\\tOffset: start.Offset,\\n\\t\\t\\tEnd: end.Offset,\\n\\t\\t}\\n\\t\\tv.funcs = append(v.funcs, fe)\\n\\t}\\n\\treturn v\\n}\",\n \"func (this *DateAddStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *MillisToStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *Mod) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitMod(this)\\n}\",\n \"func (this *StrToMillis) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (b Binary) Accept(interpreter *Interpreter) Object {\\n\\treturn interpreter.visitBinary(b)\\n}\",\n \"func (this *MillisToUTC) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (v visitor) Visit(n ast.Node) ast.Visitor {\\n\\tif n == nil {\\n\\t\\treturn nil\\n\\t}\\n\\n\\tif ShouldPrintAbstractSyntaxTree {\\n\\t\\tfmt.Printf(\\\"%s%T\\\\n\\\", strings.Repeat(\\\"\\\\t\\\", int(v)), n)\\n\\t\\tfmt.Printf(\\\"%d\\\", v)\\n\\n\\t\\treturn v + 1\\n\\t}\\n\\n\\tswitch d := n.(type) {\\n\\tcase *ast.Ident:\\n\\t\\tif d.Obj == nil {\\n\\t\\t\\treturn v + 1\\n\\t\\t}\\n\\n\\t\\tif d.Obj.Kind == ast.Typ {\\n\\t\\t\\tresult := parseStruct(d)\\n\\n\\t\\t\\tfor i := range result {\\n\\t\\t\\t\\t_, ok := Result[CurrentFile].StructScanResult[result[i].Name]\\n\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\tResult[CurrentFile].StructScanResult[result[i].Name] = result[i]\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} else if d.Obj.Kind == ast.Con || d.Obj.Kind == ast.Var {\\n\\t\\t\\tresult := parseConstantsAndVariables(d)\\n\\n\\t\\t\\tfor i := range result {\\n\\t\\t\\t\\t_, ok := Result[CurrentFile].ScanResult[result[i].Name]\\n\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\tResult[CurrentFile].ScanResult[result[i].Name] = result[i]\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\tdefault:\\n\\t\\tbreak\\n\\t}\\n\\n\\treturn v + 1\\n}\",\n \"func (p Passengers) Visit(visitor func(Passenger)) {\\n\\tfor _, one := range p {\\n\\t\\tvisitor(one)\\n\\t}\\n}\",\n \"func (p Passengers) Visit(visitor func(Passenger)) {\\n\\tfor _, one := range p {\\n\\t\\tvisitor(one)\\n\\t}\\n}\",\n \"func (this *MillisToZoneName) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *DateTruncStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (x AstSlice) Interface() interface{} { return asInterface(x.X, x.X == nil) }\",\n \"func (p *Parser) Interface() interface{} {\\n\\treturn p.data\\n}\",\n \"func (*FuncExpr) iCallable() {}\",\n \"func (this *DateAddMillis) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (c *CallExpr) accept(v ExprVisitor) {\\n\\tv.VisitCall(c)\\n}\",\n \"func (this *DatePartMillis) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (f *Function) Call(arg interface{}) {\\n\\tf.input <- arg\\n}\",\n \"func (f WalkFunc) Walk(ctx context.Context, call *Call, path string) Node { return f(path) }\",\n \"func (l *List) Visit(f func(n *Node)) {\\n\\tp := l.head\\n\\tfor p != nil {\\n\\t\\tf(p)\\n\\t\\tp = p.next\\n\\t}\\n}\",\n \"func Replace(node Node, visitor func(Node) Node) {\\n\\tswitch n := node.(type) {\\n\\tcase *Abort:\\n\\tcase *API:\\n\\t\\tfor i, c := range n.Enums {\\n\\t\\t\\tn.Enums[i] = visitor(c).(*Enum)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Definitions {\\n\\t\\t\\tn.Definitions[i] = visitor(c).(*Definition)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Classes {\\n\\t\\t\\tn.Classes[i] = visitor(c).(*Class)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Pseudonyms {\\n\\t\\t\\tn.Pseudonyms[i] = visitor(c).(*Pseudonym)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Externs {\\n\\t\\t\\tn.Externs[i] = visitor(c).(*Function)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Subroutines {\\n\\t\\t\\tn.Subroutines[i] = visitor(c).(*Function)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Functions {\\n\\t\\t\\tn.Functions[i] = visitor(c).(*Function)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Methods {\\n\\t\\t\\tn.Methods[i] = visitor(c).(*Function)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Globals {\\n\\t\\t\\tn.Globals[i] = visitor(c).(*Global)\\n\\t\\t}\\n\\t\\tfor i, c := range n.StaticArrays {\\n\\t\\t\\tn.StaticArrays[i] = visitor(c).(*StaticArray)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Maps {\\n\\t\\t\\tn.Maps[i] = visitor(c).(*Map)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Pointers {\\n\\t\\t\\tn.Pointers[i] = visitor(c).(*Pointer)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Slices {\\n\\t\\t\\tn.Slices[i] = visitor(c).(*Slice)\\n\\t\\t}\\n\\t\\tfor i, c := range n.References {\\n\\t\\t\\tn.References[i] = visitor(c).(*Reference)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Signatures {\\n\\t\\t\\tn.Signatures[i] = visitor(c).(*Signature)\\n\\t\\t}\\n\\tcase *ArrayAssign:\\n\\t\\tn.To = visitor(n.To).(*ArrayIndex)\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\tcase *ArrayIndex:\\n\\t\\tn.Array = visitor(n.Array).(Expression)\\n\\t\\tn.Index = visitor(n.Index).(Expression)\\n\\tcase *ArrayInitializer:\\n\\t\\tn.Array = visitor(n.Array).(Type)\\n\\t\\tfor i, c := range n.Values {\\n\\t\\t\\tn.Values[i] = visitor(c).(Expression)\\n\\t\\t}\\n\\tcase *Slice:\\n\\t\\tn.To = visitor(n.To).(Type)\\n\\tcase *SliceIndex:\\n\\t\\tn.Slice = visitor(n.Slice).(Expression)\\n\\t\\tn.Index = visitor(n.Index).(Expression)\\n\\tcase *SliceAssign:\\n\\t\\tn.To = visitor(n.To).(*SliceIndex)\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\tcase *Assert:\\n\\t\\tn.Condition = visitor(n.Condition).(Expression)\\n\\tcase *Assign:\\n\\t\\tn.LHS = visitor(n.LHS).(Expression)\\n\\t\\tn.RHS = visitor(n.RHS).(Expression)\\n\\tcase *Annotation:\\n\\t\\tfor i, c := range n.Arguments {\\n\\t\\t\\tn.Arguments[i] = visitor(c).(Expression)\\n\\t\\t}\\n\\tcase *Block:\\n\\t\\tfor i, c := range n.Statements {\\n\\t\\t\\tn.Statements[i] = visitor(c).(Statement)\\n\\t\\t}\\n\\tcase BoolValue:\\n\\tcase *BinaryOp:\\n\\t\\tif n.LHS != nil {\\n\\t\\t\\tn.LHS = visitor(n.LHS).(Expression)\\n\\t\\t}\\n\\t\\tif n.RHS != nil {\\n\\t\\t\\tn.RHS = visitor(n.RHS).(Expression)\\n\\t\\t}\\n\\tcase *BitTest:\\n\\t\\tn.Bitfield = visitor(n.Bitfield).(Expression)\\n\\t\\tn.Bits = visitor(n.Bits).(Expression)\\n\\tcase *UnaryOp:\\n\\t\\tn.Expression = visitor(n.Expression).(Expression)\\n\\tcase *Branch:\\n\\t\\tn.Condition = visitor(n.Condition).(Expression)\\n\\t\\tn.True = visitor(n.True).(*Block)\\n\\t\\tif n.False != nil {\\n\\t\\t\\tn.False = visitor(n.False).(*Block)\\n\\t\\t}\\n\\tcase *Builtin:\\n\\tcase *Reference:\\n\\t\\tn.To = visitor(n.To).(Type)\\n\\tcase *Call:\\n\\t\\tn.Type = visitor(n.Type).(Type)\\n\\t\\tn.Target = visitor(n.Target).(*Callable)\\n\\t\\tfor i, a := range n.Arguments {\\n\\t\\t\\tn.Arguments[i] = visitor(a).(Expression)\\n\\t\\t}\\n\\tcase *Callable:\\n\\t\\tif n.Object != nil {\\n\\t\\t\\tn.Object = visitor(n.Object).(Expression)\\n\\t\\t}\\n\\t\\tn.Function = visitor(n.Function).(*Function)\\n\\tcase *Case:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Conditions {\\n\\t\\t\\tn.Conditions[i] = visitor(c).(Expression)\\n\\t\\t}\\n\\t\\tn.Block = visitor(n.Block).(*Block)\\n\\tcase *Cast:\\n\\t\\tn.Object = visitor(n.Object).(Expression)\\n\\t\\tn.Type = visitor(n.Type).(Type)\\n\\tcase *Class:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tfor i, f := range n.Fields {\\n\\t\\t\\tn.Fields[i] = visitor(f).(*Field)\\n\\t\\t}\\n\\t\\tfor i, m := range n.Methods {\\n\\t\\t\\tn.Methods[i] = visitor(m).(*Function)\\n\\t\\t}\\n\\tcase *ClassInitializer:\\n\\t\\tfor i, f := range n.Fields {\\n\\t\\t\\tn.Fields[i] = visitor(f).(*FieldInitializer)\\n\\t\\t}\\n\\tcase *Choice:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Conditions {\\n\\t\\t\\tn.Conditions[i] = visitor(c).(Expression)\\n\\t\\t}\\n\\t\\tn.Expression = visitor(n.Expression).(Expression)\\n\\tcase *Definition:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tn.Expression = visitor(n.Expression).(Expression)\\n\\tcase *DefinitionUsage:\\n\\t\\tn.Expression = visitor(n.Expression).(Expression)\\n\\t\\tn.Definition = visitor(n.Definition).(*Definition)\\n\\tcase *DeclareLocal:\\n\\t\\tn.Local = visitor(n.Local).(*Local)\\n\\t\\tif n.Local.Value != nil {\\n\\t\\t\\tn.Local.Value = visitor(n.Local.Value).(Expression)\\n\\t\\t}\\n\\tcase Documentation:\\n\\tcase *Enum:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tfor i, e := range n.Entries {\\n\\t\\t\\tn.Entries[i] = visitor(e).(*EnumEntry)\\n\\t\\t}\\n\\tcase *EnumEntry:\\n\\tcase *Fence:\\n\\t\\tif n.Statement != nil {\\n\\t\\t\\tn.Statement = visitor(n.Statement).(Statement)\\n\\t\\t}\\n\\tcase *Field:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tn.Type = visitor(n.Type).(Type)\\n\\t\\tif n.Default != nil {\\n\\t\\t\\tn.Default = visitor(n.Default).(Expression)\\n\\t\\t}\\n\\tcase *FieldInitializer:\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\tcase Float32Value:\\n\\tcase Float64Value:\\n\\tcase *Function:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tif n.Return != nil {\\n\\t\\t\\tn.Return = visitor(n.Return).(*Parameter)\\n\\t\\t}\\n\\t\\tfor i, c := range n.FullParameters {\\n\\t\\t\\tn.FullParameters[i] = visitor(c).(*Parameter)\\n\\t\\t}\\n\\t\\tif n.Block != nil {\\n\\t\\t\\tn.Block = visitor(n.Block).(*Block)\\n\\t\\t}\\n\\t\\tn.Signature = visitor(n.Signature).(*Signature)\\n\\tcase *Global:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\tcase *StaticArray:\\n\\t\\tn.ValueType = visitor(n.ValueType).(Type)\\n\\t\\tn.SizeExpr = visitor(n.SizeExpr).(Expression)\\n\\tcase *Signature:\\n\\tcase Int8Value:\\n\\tcase Int16Value:\\n\\tcase Int32Value:\\n\\tcase Int64Value:\\n\\tcase *Iteration:\\n\\t\\tn.Iterator = visitor(n.Iterator).(*Local)\\n\\t\\tn.From = visitor(n.From).(Expression)\\n\\t\\tn.To = visitor(n.To).(Expression)\\n\\t\\tn.Block = visitor(n.Block).(*Block)\\n\\tcase *MapIteration:\\n\\t\\tn.IndexIterator = visitor(n.IndexIterator).(*Local)\\n\\t\\tn.KeyIterator = visitor(n.KeyIterator).(*Local)\\n\\t\\tn.ValueIterator = visitor(n.ValueIterator).(*Local)\\n\\t\\tn.Map = visitor(n.Map).(Expression)\\n\\t\\tn.Block = visitor(n.Block).(*Block)\\n\\tcase Invalid:\\n\\tcase *Length:\\n\\t\\tn.Object = visitor(n.Object).(Expression)\\n\\tcase *Local:\\n\\t\\tn.Type = visitor(n.Type).(Type)\\n\\tcase *Map:\\n\\t\\tn.KeyType = visitor(n.KeyType).(Type)\\n\\t\\tn.ValueType = visitor(n.ValueType).(Type)\\n\\tcase *MapAssign:\\n\\t\\tn.To = visitor(n.To).(*MapIndex)\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\tcase *MapContains:\\n\\t\\tn.Key = visitor(n.Key).(Expression)\\n\\t\\tn.Map = visitor(n.Map).(Expression)\\n\\tcase *MapIndex:\\n\\t\\tn.Map = visitor(n.Map).(Expression)\\n\\t\\tn.Index = visitor(n.Index).(Expression)\\n\\tcase *MapRemove:\\n\\t\\tn.Map = visitor(n.Map).(Expression)\\n\\t\\tn.Key = visitor(n.Key).(Expression)\\n\\tcase *MapClear:\\n\\t\\tn.Map = visitor(n.Map).(Expression)\\n\\tcase *Member:\\n\\t\\tn.Object = visitor(n.Object).(Expression)\\n\\t\\tn.Field = visitor(n.Field).(*Field)\\n\\tcase *MessageValue:\\n\\t\\tfor i, a := range n.Arguments {\\n\\t\\t\\tn.Arguments[i] = visitor(a).(*FieldInitializer)\\n\\t\\t}\\n\\tcase *New:\\n\\t\\tn.Type = visitor(n.Type).(*Reference)\\n\\tcase *Parameter:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tn.Type = visitor(n.Type).(Type)\\n\\tcase *Pointer:\\n\\t\\tn.To = visitor(n.To).(Type)\\n\\tcase *Pseudonym:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tn.To = visitor(n.To).(Type)\\n\\t\\tfor i, m := range n.Methods {\\n\\t\\t\\tn.Methods[i] = visitor(m).(*Function)\\n\\t\\t}\\n\\tcase *Return:\\n\\t\\tif n.Value != nil {\\n\\t\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\t\\t}\\n\\tcase *Select:\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\t\\tfor i, c := range n.Choices {\\n\\t\\t\\tn.Choices[i] = visitor(c).(*Choice)\\n\\t\\t}\\n\\t\\tif n.Default != nil {\\n\\t\\t\\tn.Default = visitor(n.Default).(Expression)\\n\\t\\t}\\n\\tcase StringValue:\\n\\tcase *Switch:\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\t\\tfor i, c := range n.Cases {\\n\\t\\t\\tn.Cases[i] = visitor(c).(*Case)\\n\\t\\t}\\n\\t\\tif n.Default != nil {\\n\\t\\t\\tn.Default = visitor(n.Default).(*Block)\\n\\t\\t}\\n\\tcase Uint8Value:\\n\\tcase Uint16Value:\\n\\tcase Uint32Value:\\n\\tcase Uint64Value:\\n\\tcase *Unknown:\\n\\tcase *Clone:\\n\\t\\tn.Slice = visitor(n.Slice).(Expression)\\n\\tcase *Copy:\\n\\t\\tn.Src = visitor(n.Src).(Expression)\\n\\t\\tn.Dst = visitor(n.Dst).(Expression)\\n\\tcase *Create:\\n\\t\\tn.Type = visitor(n.Type).(*Reference)\\n\\t\\tn.Initializer = visitor(n.Initializer).(*ClassInitializer)\\n\\tcase *Ignore:\\n\\tcase *Make:\\n\\t\\tn.Type = visitor(n.Type).(*Slice)\\n\\t\\tn.Size = visitor(n.Size).(Expression)\\n\\tcase Null:\\n\\tcase *PointerRange:\\n\\t\\tn.Pointer = visitor(n.Pointer).(Expression)\\n\\t\\tn.Range = visitor(n.Range).(*BinaryOp)\\n\\tcase *Read:\\n\\t\\tn.Slice = visitor(n.Slice).(Expression)\\n\\tcase *SliceContains:\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\t\\tn.Slice = visitor(n.Slice).(Expression)\\n\\tcase *SliceRange:\\n\\t\\tn.Slice = visitor(n.Slice).(Expression)\\n\\t\\tn.Range = visitor(n.Range).(*BinaryOp)\\n\\tcase *Write:\\n\\t\\tn.Slice = visitor(n.Slice).(Expression)\\n\\tdefault:\\n\\t\\tpanic(fmt.Errorf(\\\"Unsupported semantic node type %T\\\", n))\\n\\t}\\n}\",\n \"func (r *fakeResourceResult) Visit(fn resource.VisitorFunc) error {\\n\\tfor _, info := range r.Infos {\\n\\t\\terr := fn(info, nil)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t}\\n\\treturn nil\\n}\",\n \"func (h *MapInt16ToInt) Visit(fn func(int16, int)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func FuncInterfaceCompatible(_ T1) {}\",\n \"func (b *Binary) Accept(v Visitor) {\\n\\tv.VisitBinary(b)\\n}\",\n \"func (s *InterfaceStep) Interface() interface{} {\\n\\treturn s.value\\n}\",\n \"func (h *MapInt16ToInt8) Visit(fn func(int16, int8)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (s *Sequenced) Accept(v Visitor) {\\n\\tv.VisitSequenced(s)\\n}\",\n \"func testVisitors(methodCalled *string) (*SimpleVisitor, []*SimpleVisitor) {\\n\\tv := &SimpleVisitor{\\n\\t\\tDoVisitEnumNode: func(*EnumNode) error {\\n\\t\\t\\t*methodCalled = \\\"*EnumNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitEnumValueNode: func(*EnumValueNode) error {\\n\\t\\t\\t*methodCalled = \\\"*EnumValueNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitFieldDeclNode: func(FieldDeclNode) error {\\n\\t\\t\\t*methodCalled = \\\"FieldDeclNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitFieldNode: func(*FieldNode) error {\\n\\t\\t\\t*methodCalled = \\\"*FieldNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitGroupNode: func(*GroupNode) error {\\n\\t\\t\\t*methodCalled = \\\"*GroupNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitOneofNode: func(*OneofNode) error {\\n\\t\\t\\t*methodCalled = \\\"*OneofNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitMapTypeNode: func(*MapTypeNode) error {\\n\\t\\t\\t*methodCalled = \\\"*MapTypeNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitMapFieldNode: func(*MapFieldNode) error {\\n\\t\\t\\t*methodCalled = \\\"*MapFieldNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitFileNode: func(*FileNode) error {\\n\\t\\t\\t*methodCalled = \\\"*FileNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitSyntaxNode: func(*SyntaxNode) error {\\n\\t\\t\\t*methodCalled = \\\"*SyntaxNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitImportNode: func(*ImportNode) error {\\n\\t\\t\\t*methodCalled = \\\"*ImportNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitPackageNode: func(*PackageNode) error {\\n\\t\\t\\t*methodCalled = \\\"*PackageNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitIdentValueNode: func(IdentValueNode) error {\\n\\t\\t\\t*methodCalled = \\\"IdentValueNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitIdentNode: func(*IdentNode) error {\\n\\t\\t\\t*methodCalled = \\\"*IdentNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitCompoundIdentNode: func(*CompoundIdentNode) error {\\n\\t\\t\\t*methodCalled = \\\"*CompoundIdentNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitKeywordNode: func(*KeywordNode) error {\\n\\t\\t\\t*methodCalled = \\\"*KeywordNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitMessageDeclNode: func(MessageDeclNode) error {\\n\\t\\t\\t*methodCalled = \\\"MessageDeclNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitMessageNode: func(*MessageNode) error {\\n\\t\\t\\t*methodCalled = \\\"*MessageNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitExtendNode: func(*ExtendNode) error {\\n\\t\\t\\t*methodCalled = \\\"*ExtendNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitNode: func(Node) error {\\n\\t\\t\\t*methodCalled = \\\"Node\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitTerminalNode: func(TerminalNode) error {\\n\\t\\t\\t*methodCalled = \\\"TerminalNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitCompositeNode: func(CompositeNode) error {\\n\\t\\t\\t*methodCalled = \\\"CompositeNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitRuneNode: func(*RuneNode) error {\\n\\t\\t\\t*methodCalled = \\\"*RuneNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitEmptyDeclNode: func(*EmptyDeclNode) error {\\n\\t\\t\\t*methodCalled = \\\"*EmptyDeclNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitOptionNode: func(*OptionNode) error {\\n\\t\\t\\t*methodCalled = \\\"*OptionNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitOptionNameNode: func(*OptionNameNode) error {\\n\\t\\t\\t*methodCalled = \\\"*OptionNameNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitFieldReferenceNode: func(*FieldReferenceNode) error {\\n\\t\\t\\t*methodCalled = \\\"*FieldReferenceNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitCompactOptionsNode: func(*CompactOptionsNode) error {\\n\\t\\t\\t*methodCalled = \\\"*CompactOptionsNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitExtensionRangeNode: func(*ExtensionRangeNode) error {\\n\\t\\t\\t*methodCalled = \\\"*ExtensionRangeNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitRangeNode: func(*RangeNode) error {\\n\\t\\t\\t*methodCalled = \\\"*RangeNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitReservedNode: func(*ReservedNode) error {\\n\\t\\t\\t*methodCalled = \\\"*ReservedNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitServiceNode: func(*ServiceNode) error {\\n\\t\\t\\t*methodCalled = \\\"*ServiceNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitRPCNode: func(*RPCNode) error {\\n\\t\\t\\t*methodCalled = \\\"*RPCNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitRPCTypeNode: func(*RPCTypeNode) error {\\n\\t\\t\\t*methodCalled = \\\"*RPCTypeNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitValueNode: func(ValueNode) error {\\n\\t\\t\\t*methodCalled = \\\"ValueNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitStringValueNode: func(StringValueNode) error {\\n\\t\\t\\t*methodCalled = \\\"StringValueNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitStringLiteralNode: func(*StringLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*StringLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitCompoundStringLiteralNode: func(*CompoundStringLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*CompoundStringLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitIntValueNode: func(IntValueNode) error {\\n\\t\\t\\t*methodCalled = \\\"IntValueNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitUintLiteralNode: func(*UintLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*UintLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitPositiveUintLiteralNode: func(*PositiveUintLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*PositiveUintLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitNegativeIntLiteralNode: func(*NegativeIntLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*NegativeIntLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitFloatValueNode: func(FloatValueNode) error {\\n\\t\\t\\t*methodCalled = \\\"FloatValueNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitFloatLiteralNode: func(*FloatLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*FloatLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitSpecialFloatLiteralNode: func(*SpecialFloatLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*SpecialFloatLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitSignedFloatLiteralNode: func(*SignedFloatLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*SignedFloatLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitArrayLiteralNode: func(*ArrayLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*ArrayLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitMessageLiteralNode: func(*MessageLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*MessageLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitMessageFieldNode: func(*MessageFieldNode) error {\\n\\t\\t\\t*methodCalled = \\\"*MessageFieldNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t}\\n\\tothers := []*SimpleVisitor{\\n\\t\\t{\\n\\t\\t\\tDoVisitEnumNode: v.DoVisitEnumNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitEnumValueNode: v.DoVisitEnumValueNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitFieldDeclNode: v.DoVisitFieldDeclNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitFieldNode: v.DoVisitFieldNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitGroupNode: v.DoVisitGroupNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitOneofNode: v.DoVisitOneofNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitMapTypeNode: v.DoVisitMapTypeNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitMapFieldNode: v.DoVisitMapFieldNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitFileNode: v.DoVisitFileNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitSyntaxNode: v.DoVisitSyntaxNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitImportNode: v.DoVisitImportNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitPackageNode: v.DoVisitPackageNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitIdentValueNode: v.DoVisitIdentValueNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitIdentNode: v.DoVisitIdentNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitCompoundIdentNode: v.DoVisitCompoundIdentNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitKeywordNode: v.DoVisitKeywordNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitMessageDeclNode: v.DoVisitMessageDeclNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitMessageNode: v.DoVisitMessageNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitExtendNode: v.DoVisitExtendNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitNode: v.DoVisitNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitTerminalNode: v.DoVisitTerminalNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitCompositeNode: v.DoVisitCompositeNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitRuneNode: v.DoVisitRuneNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitEmptyDeclNode: v.DoVisitEmptyDeclNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitOptionNode: v.DoVisitOptionNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitOptionNameNode: v.DoVisitOptionNameNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitFieldReferenceNode: v.DoVisitFieldReferenceNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitCompactOptionsNode: v.DoVisitCompactOptionsNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitExtensionRangeNode: v.DoVisitExtensionRangeNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitRangeNode: v.DoVisitRangeNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitReservedNode: v.DoVisitReservedNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitServiceNode: v.DoVisitServiceNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitRPCNode: v.DoVisitRPCNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitRPCTypeNode: v.DoVisitRPCTypeNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitValueNode: v.DoVisitValueNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitStringValueNode: v.DoVisitStringValueNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitStringLiteralNode: v.DoVisitStringLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitCompoundStringLiteralNode: v.DoVisitCompoundStringLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitIntValueNode: v.DoVisitIntValueNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitUintLiteralNode: v.DoVisitUintLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitPositiveUintLiteralNode: v.DoVisitPositiveUintLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitNegativeIntLiteralNode: v.DoVisitNegativeIntLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitFloatValueNode: v.DoVisitFloatValueNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitFloatLiteralNode: v.DoVisitFloatLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitSpecialFloatLiteralNode: v.DoVisitSpecialFloatLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitSignedFloatLiteralNode: v.DoVisitSignedFloatLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitArrayLiteralNode: v.DoVisitArrayLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitMessageLiteralNode: v.DoVisitMessageLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitMessageFieldNode: v.DoVisitMessageFieldNode,\\n\\t\\t},\\n\\t}\\n\\treturn v, others\\n}\",\n \"func _[T interface{ ~func(string) int }](f T) int {\\n\\treturn f(\\\"hello\\\")\\n}\",\n \"func VisitedFunctions(prog *ssa.Program, packs []*ssa.Package, isOvl isOverloaded) (seen, usesGR map[*ssa.Function]bool) {\\n\\tvisit := visitor{\\n\\t\\tprog: prog,\\n\\t\\tpacks: packs, // new\\n\\t\\tseen: make(map[*ssa.Function]bool),\\n\\t\\tusesGR: make(map[*ssa.Function]bool),\\n\\t}\\n\\tvisit.program(isOvl)\\n\\t//fmt.Printf(\\\"DEBUG VisitedFunctions.usesGR %v\\\\n\\\", visit.usesGR)\\n\\t//fmt.Printf(\\\"DEBUG VisitedFunctions.seen %v\\\\n\\\", visit.seen)\\n\\treturn visit.seen, visit.usesGR\\n}\",\n \"func (h *MapInt16ToInt32) Visit(fn func(int16, int32)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (x *fastReflection_Evidence) Interface() protoreflect.ProtoMessage {\\n\\treturn (*Evidence)(x)\\n}\",\n \"func (f *functionQuery) Evaluate(t iterator) interface{} {\\n\\treturn f.Func(f.Input, t)\\n}\",\n \"func Visit(node Node, visitor func(node Node, next func() error) error) error {\\n\\tif reflect.ValueOf(node).IsNil() { // Workaround for Go's typed nil interfaces.\\n\\t\\treturn nil\\n\\t}\\n\\treturn visitor(node, func() error {\\n\\t\\tfor _, child := range node.children() {\\n\\t\\t\\tif err := Visit(child, visitor); err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn nil\\n\\t})\\n}\",\n \"func (x *fastReflection_Output) Interface() protoreflect.ProtoMessage {\\n\\treturn (*Output)(x)\\n}\",\n \"func (i I) I() I { return i }\",\n \"func (rf RendererFunc) Render(w io.Writer, v interface{}) error { return rf(w, v) }\",\n \"func (v Variable) Accept(interpreter *Interpreter) Object {\\n\\treturn interpreter.visitVariable(v)\\n}\",\n \"func (*Base) Function(p ASTPass, node *ast.Function, ctx Context) {\\n\\tp.Parameters(p, &node.ParenLeftFodder, &node.Parameters, &node.ParenRightFodder, ctx)\\n\\tp.Visit(p, &node.Body, ctx)\\n}\",\n \"func (t *FileTree) VisitorFn(fn func(file.Reference)) func(node.Node) {\\n\\treturn func(node node.Node) {\\n\\t\\tfn(t.fileByPathID(node.ID()))\\n\\t}\\n}\",\n \"func execNewInterface(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(2)\\n\\tret := types.NewInterface(args[0].([]*types.Func), args[1].([]*types.Named))\\n\\tp.Ret(2, ret)\\n}\",\n \"func (h *MapInt16ToUint8) Visit(fn func(int16, uint8)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func FuncInterfaceCompatible2(_ io.Writer) {}\",\n \"func (h *MapInt16ToInt16) Visit(fn func(int16, int16)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func Function(sig *CallSignature) Type {\\n\\treturn Type{functionImpl{sig: sig}}\\n}\",\n \"func (mi *ModifierInvocation) Visit(ctx *parser.ModifierInvocationContext) {\\n\\tmi.Start = ctx.GetStart()\\n\\tmi.Stop = ctx.GetStop()\\n\\tmi.Identifier = ctx.Identifier().GetText()\\n\\n\\tif ctx.ExpressionList() != nil {\\n\\t\\texpList := ctx.ExpressionList().(*parser.ExpressionListContext)\\n\\n\\t\\tfor _, exprCtx := range expList.AllExpression() {\\n\\t\\t\\texpression := NewExpression()\\n\\t\\t\\texpression.Visit(exprCtx.(*parser.ExpressionContext))\\n\\n\\t\\t\\tmi.Expressions = append(mi.Expressions, expression)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (x *fastReflection_Input) Interface() protoreflect.ProtoMessage {\\n\\treturn (*Input)(x)\\n}\",\n \"func (a Assign) Accept(interpreter *Interpreter) Object {\\n\\treturn interpreter.visitAssign(a)\\n}\",\n \"func (h *MapInt16ToUint) Visit(fn func(int16, uint)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (_Contract *ContractCallerSession) InterfaceImplementer(node [32]byte, interfaceID [4]byte) (common.Address, error) {\\n\\treturn _Contract.Contract.InterfaceImplementer(&_Contract.CallOpts, node, interfaceID)\\n}\",\n \"func (h *MapInt16ToUint32) Visit(fn func(int16, uint32)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (g Grouping) Accept(interpreter *Interpreter) Object {\\n\\treturn interpreter.visitGrouping(g)\\n}\",\n \"func Interface(ifname string) func(*NetworkTap) error {\\n\\treturn func(filterdev *NetworkTap) error {\\n\\t\\terr := filterdev.SetInterface(int(filterdev.device.Fd()), ifname)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\treturn nil\\n\\t}\\n}\",\n \"func (f *FlagSet) Visit(fn func(*Flag)) {\\n\\tfor _, flag := range sortFlags(f.actual) {\\n\\t\\tfn(flag)\\n\\t}\\n}\",\n \"func (_Contract *ContractFilterer) FilterInterfaceChanged(opts *bind.FilterOpts, node [][32]byte, interfaceID [][4]byte) (*ContractInterfaceChangedIterator, error) {\\n\\n\\tvar nodeRule []interface{}\\n\\tfor _, nodeItem := range node {\\n\\t\\tnodeRule = append(nodeRule, nodeItem)\\n\\t}\\n\\tvar interfaceIDRule []interface{}\\n\\tfor _, interfaceIDItem := range interfaceID {\\n\\t\\tinterfaceIDRule = append(interfaceIDRule, interfaceIDItem)\\n\\t}\\n\\n\\tlogs, sub, err := _Contract.contract.FilterLogs(opts, \\\"InterfaceChanged\\\", nodeRule, interfaceIDRule)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn &ContractInterfaceChangedIterator{contract: _Contract.contract, event: \\\"InterfaceChanged\\\", logs: logs, sub: sub}, nil\\n}\",\n \"func (f *FlagSet) Visit(fn func(*Flag)) {\\n\\tif len(f.actual) == 0 {\\n\\t\\treturn\\n\\t}\\n\\n\\tvar flags []*Flag\\n\\tif f.SortFlags {\\n\\t\\tif len(f.actual) != len(f.sortedActual) {\\n\\t\\t\\tf.sortedActual = sortFlags(f.actual)\\n\\t\\t}\\n\\t\\tflags = f.sortedActual\\n\\t} else {\\n\\t\\tflags = f.orderedActual\\n\\t}\\n\\n\\tfor _, flag := range flags {\\n\\t\\tfn(flag)\\n\\t}\\n}\",\n \"func (x *fastReflection_EventRetire) Interface() protoreflect.ProtoMessage {\\n\\treturn (*EventRetire)(x)\\n}\",\n \"func execmInterfaceMethod(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(2)\\n\\tret := args[0].(*types.Interface).Method(args[1].(int))\\n\\tp.Ret(2, ret)\\n}\",\n \"func (lambda PresenterFunc) Render(message interface{}) error {\\n\\treturn lambda(message)\\n}\",\n \"func underlyingInterface(w v1alpha1.ExecutableWorkflow, node v1alpha1.ExecutableNode) (*core.TypedInterface, error) {\\n\\tiface := &core.TypedInterface{}\\n\\tif node.GetTaskID() != nil {\\n\\t\\tt, err := w.GetTask(*node.GetTaskID())\\n\\t\\tif err != nil {\\n\\t\\t\\t// Should never happen\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\n\\t\\tiface.Outputs = t.CoreTask().GetInterface().Outputs\\n\\t} else if wfNode := node.GetWorkflowNode(); wfNode != nil {\\n\\t\\tif wfRef := wfNode.GetSubWorkflowRef(); wfRef != nil {\\n\\t\\t\\tt := w.FindSubWorkflow(*wfRef)\\n\\t\\t\\tif t == nil {\\n\\t\\t\\t\\t// Should never happen\\n\\t\\t\\t\\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \\\"Couldn't find subworkflow [%v].\\\", wfRef)\\n\\t\\t\\t}\\n\\n\\t\\t\\tiface.Outputs = t.GetOutputs().VariableMap\\n\\t\\t} else {\\n\\t\\t\\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \\\"Unknown interface\\\")\\n\\t\\t}\\n\\t} else if node.GetBranchNode() != nil {\\n\\t\\tif ifBlock := node.GetBranchNode().GetIf(); ifBlock != nil && ifBlock.GetThenNode() != nil {\\n\\t\\t\\tbn, found := w.GetNode(*ifBlock.GetThenNode())\\n\\t\\t\\tif !found {\\n\\t\\t\\t\\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \\\"Couldn't find branch node [%v]\\\",\\n\\t\\t\\t\\t\\t*ifBlock.GetThenNode())\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn underlyingInterface(w, bn)\\n\\t\\t}\\n\\n\\t\\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \\\"Empty branch detected.\\\")\\n\\t} else {\\n\\t\\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \\\"Unknown interface.\\\")\\n\\t}\\n\\n\\treturn iface, nil\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.60175425","0.5906299","0.59027874","0.5845828","0.5825935","0.5819577","0.5819577","0.580104","0.5785162","0.5777933","0.5703701","0.56876904","0.56876904","0.5627525","0.5536116","0.549273","0.5463964","0.5434355","0.54164505","0.54164505","0.5402595","0.5397546","0.53573","0.5347492","0.5327222","0.5282537","0.52577364","0.52453923","0.5236527","0.51695585","0.5169153","0.51691335","0.5150039","0.5100336","0.5098669","0.5096844","0.5092909","0.5025056","0.5013577","0.5006477","0.4981647","0.4977761","0.49491403","0.49481136","0.49135387","0.4902572","0.4902572","0.48868135","0.48798364","0.48651856","0.48479375","0.48444048","0.48257497","0.48061544","0.47927007","0.4789761","0.47619694","0.47598982","0.47561255","0.47533038","0.47495225","0.47481802","0.47395724","0.47342122","0.47313806","0.4717683","0.47168908","0.46870023","0.46790814","0.4676445","0.4658523","0.46575442","0.46539652","0.46523747","0.46460128","0.46418434","0.46396607","0.46377394","0.46143577","0.46142966","0.46093234","0.46074614","0.46003863","0.45997134","0.45860335","0.4582408","0.4575352","0.45601138","0.45586434","0.45583653","0.4555357","0.45495585","0.4543396","0.45388633","0.4532948","0.45328376","0.45314434","0.45284674","0.45211044"],"string":"[\n \"0.60175425\",\n \"0.5906299\",\n \"0.59027874\",\n \"0.5845828\",\n \"0.5825935\",\n \"0.5819577\",\n \"0.5819577\",\n \"0.580104\",\n \"0.5785162\",\n \"0.5777933\",\n \"0.5703701\",\n \"0.56876904\",\n \"0.56876904\",\n \"0.5627525\",\n \"0.5536116\",\n \"0.549273\",\n \"0.5463964\",\n \"0.5434355\",\n \"0.54164505\",\n \"0.54164505\",\n \"0.5402595\",\n \"0.5397546\",\n \"0.53573\",\n \"0.5347492\",\n \"0.5327222\",\n \"0.5282537\",\n \"0.52577364\",\n \"0.52453923\",\n \"0.5236527\",\n \"0.51695585\",\n \"0.5169153\",\n \"0.51691335\",\n \"0.5150039\",\n \"0.5100336\",\n \"0.5098669\",\n \"0.5096844\",\n \"0.5092909\",\n \"0.5025056\",\n \"0.5013577\",\n \"0.5006477\",\n \"0.4981647\",\n \"0.4977761\",\n \"0.49491403\",\n \"0.49481136\",\n \"0.49135387\",\n \"0.4902572\",\n \"0.4902572\",\n \"0.48868135\",\n \"0.48798364\",\n \"0.48651856\",\n \"0.48479375\",\n \"0.48444048\",\n \"0.48257497\",\n \"0.48061544\",\n \"0.47927007\",\n \"0.4789761\",\n \"0.47619694\",\n \"0.47598982\",\n \"0.47561255\",\n \"0.47533038\",\n \"0.47495225\",\n \"0.47481802\",\n \"0.47395724\",\n \"0.47342122\",\n \"0.47313806\",\n \"0.4717683\",\n \"0.47168908\",\n \"0.46870023\",\n \"0.46790814\",\n \"0.4676445\",\n \"0.4658523\",\n \"0.46575442\",\n \"0.46539652\",\n \"0.46523747\",\n \"0.46460128\",\n \"0.46418434\",\n \"0.46396607\",\n \"0.46377394\",\n \"0.46143577\",\n \"0.46142966\",\n \"0.46093234\",\n \"0.46074614\",\n \"0.46003863\",\n \"0.45997134\",\n \"0.45860335\",\n \"0.4582408\",\n \"0.4575352\",\n \"0.45601138\",\n \"0.45586434\",\n \"0.45583653\",\n \"0.4555357\",\n \"0.45495585\",\n \"0.4543396\",\n \"0.45388633\",\n \"0.4532948\",\n \"0.45328376\",\n \"0.45314434\",\n \"0.45284674\",\n \"0.45211044\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.54699755"},"document_rank":{"kind":"string","value":"17"}}},{"rowIdx":994,"cells":{"query":{"kind":"string","value":"/ It returns a value type NUMBER."},"document":{"kind":"string","value":"func (this *ObjectLength) Type() value.Type { return value.NUMBER }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func (v Value) Number() (Number, error) {\n\tr := bytes.NewReader(v.bytes)\n\treturn byteReaderToNumber(v.dataType, r)\n}","func getNumber(v interface{}) (int64, error) {\n\tswitch v := v.(type) {\n\tcase int:\n\t\treturn int64(v), nil\n\tcase int8:\n\t\treturn int64(v), nil\n\tcase int16:\n\t\treturn int64(v), nil\n\tcase int32:\n\t\treturn int64(v), nil\n\tcase int64:\n\t\treturn v, nil\n\tcase uint:\n\t\treturn int64(v), nil\n\tcase uint8:\n\t\treturn int64(v), nil\n\tcase uint16:\n\t\treturn int64(v), nil\n\tcase uint32:\n\t\treturn int64(v), nil\n\tcase uint64:\n\t\treturn int64(v), nil\n\tcase []byte:\n\t\treturn parseString(string(v))\n\tcase string:\n\t\treturn parseString(v)\n\tcase sqltypes.Value:\n\t\treturn parseValue(v.Type(), v.Raw())\n\tcase *querypb.BindVariable:\n\t\treturn parseValue(v.Type, v.Value)\n\t}\n\treturn 0, fmt.Errorf(\"getNumber: unexpected type for %v: %T\", v, v)\n}","func (v *Value) Number() (float64, error) {\n\tif v.kind == kindNumber {\n\t\treturn v.numberContent, nil\n\t}\n\treturn 0.0, errors.New(\"JSON value is not a number\")\n}","func getNumber(e Expr) (float64, error) {\n\tswitch n := e.(type) {\n\tcase *NumberLiteral:\n\t\treturn n.Val, nil\n\tcase *NilLiteral:\n\t\treturn 0, nil\n\tdefault:\n\t\treturn 0, fmt.Errorf(\"Literal is not a number: %v\", n)\n\t}\n}","func NumberVal(v *big.Rat) cty.Value {\n\treturn cty.CapsuleVal(Number, v)\n}","func (p *parser) number() Node {\n\ttoken := p.expect(TokenNumber)\n\tnum, err := newNumber(token.pos, token.val)\n\tif err != nil {\n\t\tp.error(err)\n\t}\n\treturn num\n}","func (u *sqlSymUnion) numVal() *NumVal {\n\treturn u.val.(*NumVal)\n}","func (u *sqlSymUnion) numVal() *NumVal {\n\treturn u.val.(*NumVal)\n}","func (u *sqlSymUnion) numVal() *NumVal {\n\treturn u.val.(*NumVal)\n}","func (u *sqlSymUnion) numVal() *NumVal {\n\treturn u.val.(*NumVal)\n}","func (v *JSONValue) Number() float64 {\n\tv.parseNumber()\n\treturn v.valNumber\n}","func ToNumber(v Value) (int64, float64, NumberType) {\n\tswitch v.iface.(type) {\n\tcase int64:\n\t\treturn v.AsInt(), 0, IsInt\n\tcase float64:\n\t\treturn 0, v.AsFloat(), IsFloat\n\tcase string:\n\t\ts := v.AsString()\n\t\treturn StringToNumber(strings.TrimSpace(s))\n\t}\n\treturn 0, 0, NaN\n}","func (n SNumber) ToNum() float64 {\n\treturn float64(n)\n}","func (n Number) Value() (driver.Value, error) {\n\treturn string(n), nil\n}","func (v Value) NumberType() ValueType {\n\tswitch v.iface.(type) {\n\tcase int64:\n\t\treturn IntType\n\tcase float64:\n\t\treturn FloatType\n\t}\n\treturn UnknownType\n}","func ToNumberValue(v Value) (Value, NumberType) {\n\tswitch v.NumberType() {\n\tcase IntType:\n\t\treturn v, IsInt\n\tcase FloatType:\n\t\treturn v, IsFloat\n\t}\n\tif s, ok := v.TryString(); ok {\n\t\tn, f, tp := StringToNumber(strings.TrimSpace(s))\n\t\tswitch tp {\n\t\tcase IsInt:\n\t\t\treturn IntValue(n), IsInt\n\t\tcase IsFloat:\n\t\t\treturn FloatValue(f), IsFloat\n\t\t}\n\t}\n\treturn v, NaN\n}","func Number() {\n\tfmt.Println(232, reflect.TypeOf(232))\n\tfmt.Println(232.67, reflect.TypeOf(232.67))\n}","func lvalNum(x int64) *lval {\n\tv := new(lval)\n\tv.ltype = lvalNumType\n\tv.num = x\n\treturn v\n}","func NumberIntVal(v int64) cty.Value {\n\tbr := big.NewRat(v, 1)\n\treturn cty.CapsuleVal(Number, br)\n}","func (j *JSONData) Number() *float64 {\n\tif j != nil && j.value != nil {\n\t\tif float, ok := (*j.value).(float64); ok {\n\t\t\treturn &float\n\t\t}\n\t}\n\treturn nil\n}","func NewNumber(value float64) *Value {\n\treturn &Value{kind: kindNumber, numberContent: value}\n}","func (rt *operatorRuntime) numVal(op func(float64) interface{}, vs parser.Scope,\n\tis map[string]interface{}, tid uint64) (interface{}, error) {\n\n\tvar ret interface{}\n\n\terrorutil.AssertTrue(len(rt.node.Children) == 1,\n\t\tfmt.Sprint(\"Operation requires 1 operand\", rt.node))\n\n\tres, err := rt.node.Children[0].Runtime.Eval(vs, is, tid)\n\tif err == nil {\n\n\t\t// Check if the value is a number\n\n\t\tresNum, ok := res.(float64)\n\n\t\tif !ok {\n\n\t\t\t// Produce a runtime error if the value is not a number\n\n\t\t\treturn nil, rt.erp.NewRuntimeError(util.ErrNotANumber,\n\t\t\t\trt.errorDetailString(rt.node.Children[0].Token, res), rt.node.Children[0])\n\t\t}\n\n\t\tret = op(resNum)\n\t}\n\n\treturn ret, err\n}","func (v Value10) Get() any { return int(v) }","func (t Token) Numberlike() float64 {\n\treturn float64(t)\n}","func (l *lexer) getNumber() float64 {\n\tvalueEndIndex := l.pos + 1\n\tfor valueEndIndex < len(l.input) {\n\t\tch := l.input[valueEndIndex]\n\t\tif ch >= '0' && ch <= '9' {\n\t\t\tvalueEndIndex++\n\t\t\tcontinue\n\t\t}\n\t\tbreak\n\t}\n\tvalue, err := strconv.ParseFloat(l.input[l.pos:valueEndIndex], 64)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\tl.pos = valueEndIndex\n\treturn value\n}","func ToNumber(o Value) (*Number, error) {\n\tswitch p := o.(type) {\n\tcase *Number:\n\t\treturn p, nil\n\tcase *Character:\n\t\treturn Integer(int(p.Value)), nil\n\tcase *Boolean:\n\t\tif p.Value {\n\t\t\treturn One, nil\n\t\t}\n\t\treturn Zero, nil\n\tcase *String:\n\t\tf, err := strconv.ParseFloat(p.Value, 64)\n\t\tif err == nil {\n\t\t\treturn Float(f), nil\n\t\t}\n\t}\n\treturn nil, NewError(ArgumentErrorKey, \"cannot convert to an number: \", o)\n}","func (f Number) Native(context.Context) interface{} {\n\treturn float64(f)\n}","func (n Int64String) Value() (driver.Value, error) {\n\tif n == 0 {\n\t\treturn nil, nil\n\t}\n\treturn float64(n), nil\n}","func (e *Expect) Number(value float64) *Number {\n\topChain := e.chain.enter(\"Number()\")\n\tdefer opChain.leave()\n\n\treturn newNumber(opChain, value)\n}","func (l *NumberLiteral) Type() Type {\n\treturn l.ExprType\n}","func (p *Parser) number() {\n\tnum, _ := strconv.Atoi(p.previous.Literal)\n\tp.emitConstant(IntVal(num))\n}","func (this *DateAddMillis) Type() value.Type { return value.NUMBER }","func readNumber(pt *pathtokenizer, tokenType *int, token *string) (v float64, err error) {\n\tif *tokenType != scanNum {\n\t\treturn 0, fmt.Errorf(\"this token is not a Number but %d\", *tokenType)\n\t}\n\tv, err = strconv.ParseFloat(*token, 64) // parse float64\n\t*tokenType, *token = pt.get() // read next token\n\treturn\n}","func (p *parser) number(val string) float64 {\n\tn, err := strconv.ParseInt(val, 0, 64)\n\tf := float64(n)\n\tif err != nil {\n\t\tf, err = strconv.ParseFloat(val, 64)\n\t}\n\tif err != nil {\n\t\tp.errorf(\"error parsing number: %s\", err)\n\t}\n\treturn f\n}","func AllocNumber(val float64, numtype int) *GoJSON {\n\tchild := new(GoJSON)\n\n\tif numtype == JSON_INT {\n\t\tchild.Valint = int64(val)\n\t\tchild.Jsontype = JSON_INT\n\t} else if numtype == JSON_UINT {\n\t\tchild.Valuint = uint64(val)\n\t\tchild.Jsontype = JSON_UINT\n\t} else {\n\t\tchild.Valdouble = val\n\t\tchild.Jsontype = JSON_DOUBLE\n\t}\n\n\treturn child\n}","func (n NullNumeric) Value() (driver.Value, error) {\n\tif !n.Valid {\n\t\treturn nil, nil\n\t}\n\treturn n.Numeric.Value()\n}","func (l *Lexer) Number() float64 {\n\ts := l.pos // l.start is reset through the multiple scans\n\tif l.Peek() == '-' {\n\t\tl.pos += l.width\n\t}\n\tl.Scan(unicode.IsDigit)\n\tif l.Next() == \".\" {\n\t\tl.Scan(unicode.IsDigit)\n\t} else {\n\t\tl.Rewind()\n\t}\n\tif c := l.Next(); c == \"e\" || c == \"E\" {\n\t\tif l.Peek() == '-' || l.Peek() == '+' {\n\t\t\tl.pos += l.width\n\t\t}\n\t\tl.Scan(unicode.IsDigit)\n\t} else {\n\t\tl.Rewind()\n\t}\n\tl.start = s\n\tn, err := strconv.ParseFloat(l.Input[s:l.pos], 64)\n\tif err != nil {\n\t\t// This might be a bad idea in the long run.\n\t\treturn 0\n\t}\n\treturn n\n}","func (*BigInt) Type() types.Type {\n\treturn types.Number\n}","func (p *Parser) number(tok token.Token) (expr value.Expr, str string) {\n\tvar err error\n\ttext := tok.Text\n\tswitch tok.Type {\n\tcase token.Identifier:\n\t\texpr = p.variable(text)\n\tcase token.String:\n\t\t// TODO\n\t\tstr = \"<token.String>\"\n\tcase token.Number, token.Rational:\n\t\texpr, err = value.Parse(p.context.Config(), text)\n\tcase token.LeftParen:\n\t\texpr = p.expr(p.next())\n\t\ttok := p.next()\n\t\tif tok.Type != token.RightParen {\n\t\t\tp.errorf(\"expected right paren, found %s\", tok)\n\t\t}\n\t}\n\tif err != nil {\n\t\tp.errorf(\"%s: %s\", text, err)\n\t}\n\treturn expr, str\n}","func Num(x Value) Value {\n\tif v, ok := x.(*ratVal); ok {\n\t\tx = v.Value\n\t}\n\treturn constant.Num(x)\n}","func (number Number) Value() (value driver.Value, err error) {\n\tif number == \"\" {\n\t\treturn \"\", nil\n\t}\n\n\tif err = number.Validate(); err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn number.String(), nil\n}","func convertNumber(n json.Number) (interface{}, error) {\n\t// Attempt to convert to an int64 first\n\tif i, err := n.Int64(); err == nil {\n\t\treturn i, nil\n\t}\n\t// Return a float64 (default json.Decode() behavior)\n\t// An overflow will return an error\n\treturn n.Float64()\n}","func (l *Lexer) readNumber() (token.TokenType, string) {\n\tposition := l.position\n\tdecimals := 0\n\tfor isDigit(l.ch) || l.ch == '.' {\n\t\tif l.ch == '.' {\n\t\t\tif decimals > 0 {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tdecimals++\n\t\t}\n\t\tl.readChar()\n\t}\n\tif decimals > 0 {\n\t\treturn token.FLOAT, l.input[position:l.position]\n\t}\n\n\treturn token.INT, l.input[position:l.position]\n}","func (v Value10) Int() int { return int(v) }","func numberType(f func(...Expression) Expression) func(...Expression) (Expression, error) {\n\n\treturn func(args ...Expression) (Expression, error) {\n\t\tfor _, arg := range args {\n\t\t\tif _, ok := arg.(Number); !ok {\n\t\t\t\treturn nil, errors.New(fmt.Sprintf(\"Type Error: Recieved %T, Expected Number\", arg))\n\t\t\t}\n\t\t}\n\t\treturn f(args...), nil\n\t}\n}","func (me TSAFPTPortugueseVatNumber) ToXsdtInteger() xsdt.Integer { return xsdt.Integer(me) }","func IntValue(n int64) Value {\n\treturn Value{iface: n}\n}","func (Integer) Type() types.Type {\n\treturn types.Number\n}","func (p *parser) parseNumber() (num *tree.NumberExpr) {\n\tswitch p.tok {\n\tcase token.NUMBERFLOAT, token.NUMBERHEX:\n\t\tnum = &tree.NumberExpr{NumberToken: p.token()}\n\tdefault:\n\t\tp.error(p.off, \"'\"+token.NUMBERFLOAT.String()+\"' expected\")\n\t}\n\tp.next()\n\treturn\n}","func (s *Scanner) scanNumber() Token {\n\tline, offset := s.line, s.lineOffset\n\tvar buf bytes.Buffer\n\tbuf.WriteByte(s.read())\n\tfor {\n\t\tif ch := s.read(); ch == eof {\n\t\t\tbreak\n\t\t} else if isNumber(ch) {\n\t\t\tbuf.WriteByte(ch)\n\t\t} else {\n\t\t\ts.unread()\n\t\t\tbreak\n\t\t}\n\t}\n\treturn Token{tpe: NUMBER, val: buf.String(), line: line, offset: offset}\n}","func (s *Scanner) number() {\n\tfor s.isDigit(s.peek()) {\n\t\ts.advance()\n\t}\n\tif s.peek() == '.' && s.isDigit(s.peekNext()) {\n\t\ts.advance()\n\t\tfor s.isDigit(s.peek()) {\n\t\t\ts.advance()\n\t\t}\n\t}\n\t// this seems a bit convoluted just to cast []byte into []rune\n\tliteral := []rune(string(s.source[s.start:s.current]))\n\ts.addToken(token.NUMBER, literal)\n}","func (p *Parser) number(tok scan.Token) (expr value.Expr, str string) {\n\tvar err error\n\ttext := tok.Text\n\tswitch tok.Type {\n\tcase scan.Identifier:\n\t\texpr = p.index(p.variable(text))\n\tcase scan.String:\n\t\tstr = value.ParseString(text)\n\tcase scan.Number, scan.Rational, scan.Complex:\n\t\texpr, err = value.Parse(p.context.Config(), text)\n\tcase scan.LeftParen:\n\t\texpr = p.expr()\n\t\ttok := p.next()\n\t\tif tok.Type != scan.RightParen {\n\t\t\tp.errorf(\"expected right paren, found %s\", tok)\n\t\t}\n\t}\n\tif err != nil {\n\t\tp.errorf(\"%s: %s\", text, err)\n\t}\n\treturn expr, str\n}","func (t *Type) Val() *Type","func AsNumber(f Field) uint32 {\n\tv, _ := f.(uint32)\n\treturn v\n}","func (this *DateTruncMillis) Type() value.Type { return value.NUMBER }","func execmNumberInt64(_ int, p *gop.Context) {\n\targs := p.GetArgs(1)\n\tret, ret1 := args[0].(json.Number).Int64()\n\tp.Ret(1, ret, ret1)\n}","func IntValue(obj Value) int {\n\tif p, ok := obj.(*Number); ok {\n\t\treturn int(p.Value)\n\t}\n\treturn 0\n}","func GetNumber(data []byte, keys ...string) (val float64, offset int, err error) {\n\tv, t, offset, e := Get(data, keys...)\n\n\tif e != nil {\n\t\treturn 0, offset, e\n\t}\n\n\tif t != Number {\n\t\treturn 0, offset, fmt.Errorf(\"Value is not a number: %s\", string(v))\n\t}\n\n\tval, err = strconv.ParseFloat(string(v), 64)\n\treturn\n}","func processNumber(i interface{}) uint64 {\n\tvar n uint64\n\tswitch v := i.(type) {\n\tcase uint64:\n\t\tn = v\n\tcase string:\n\t\ts := strings.Split(v, \".\")\n\t\tn, _ = strconv.ParseUint(s[0], 10, 64)\n\tcase float64:\n\t\tn = uint64(v)\n\t}\n\treturn n\n}","func (v *Value) GetNum() *string {\n\tret := C.zj_GetNumStr(v.V)\n\tif ret == nil {\n\t\treturn nil\n\t}\n\tretStr := C.GoString(ret)\n\treturn &retStr\n}","func (self ValueKind) IsNumber() bool {\n\treturn bool(C.wasm_valkind_is_num(C.wasm_valkind_t(self)))\n}","func (n *Number) Int() *big.Int {\n\tif !n.isInteger {\n\t\treturn nil\n\t}\n\treturn &n.integer\n}","func (*Base) LiteralNumber(p ASTPass, node *ast.LiteralNumber, ctx Context) {\n}","func (this *DatePartStr) Type() value.Type { return value.NUMBER }","func readNumericToken(r *bufio.Reader) tok.Token {\n\tliteral, ok := readNumericLiteral(r)\n\tif !ok {\n\t\treturn tok.Token{TokenType: tok.Invalid, Literal: literal}\n\t}\n\n\tif ok := validateNumericLiteral(literal); !ok {\n\t\treturn tok.Token{TokenType: tok.Invalid, Literal: literal}\n\t}\n\n\ttokType := numericLiteralTokenType(literal)\n\n\treturn tok.Token{TokenType: tokType, Literal: literal}\n}","func eeNumInt(v int) (n eeNum) {\r\n\t*n.int() = v\r\n\treturn\r\n}","func (v Int) Native() interface{} {\n\treturn int64(v)\n}","func (a *Argument) Number() float64 {\n\treturn float64(a.state.CheckNumber(a.number))\n}","func (v Value2) Get() any { return int(v) }","func (this *DatePartMillis) Type() value.Type { return value.NUMBER }","func (d DecimalObj) Value() (driver.Value, error) {\n\tif !d.Valid {\n\t\treturn nil, nil\n\t}\n\treturn d.Number.Value()\n}","func (lx *Lexer) numeralLiteral() Token {\n\tlx.token.Type = IntegerLiteral\n\tlx.token.Sub = Decimal\n\n\tdefer func() {\n\t\terr := recover()\n\t\tif err == nil {\n\t\t\treturn\n\t\t}\n\n\t\t// FIXME: Show more helpful messages\n\t\tmsg := fmt.Sprintf(\"`%s` Illegal syntax of %s %s.\\n%s\",\n\t\t\tlx.token.Value(),\n\t\t\tlx.token.Sub,\n\t\t\tlx.token.Type,\n\t\t\terr,\n\t\t)\n\n\t\tpanic(lx.errf(msg))\n\t}()\n\n\tr, e := lx.peekChar()\n\tif e != nil {\n\t\tpanic(\"End of file nothing to read here\")\n\t}\n\n\tif r > '0' && r <= '9' {\n\t\tlx.consume()\n\t\tlx.separatedByUnderscore(IsNonZeroDigit, false)\n\t} else if r != '.' {\n\t\tlx.consume()\n\t\tp, _ := lx.peekChar()\n\t\tswitch {\n\t\tcase IsRuneIn(p, \"Xx\"):\n\t\t\tlx.token.Sub = Hex\n\t\t\tlx.consume()\n\n\t\t\t// 0x.BEEF is a valid float literal\n\t\t\t// but 0x is invalid integer literal\n\t\t\tif p, _ := lx.peekChar(); p != '.' {\n\t\t\t\tlx.separatedByUnderscore(IsHexDigit, true)\n\t\t\t}\n\n\t\tcase IsRuneIn(p, \"Bb\"):\n\t\t\tlx.token.Sub = Binary\n\t\t\tlx.consume()\n\t\t\tlx.separatedByUnderscore(IsBinaryDigit, true)\n\t\tcase IsDigit(p):\n\t\t\tif IsOctalDigit(p) {\n\t\t\t\tlx.token.Sub = Octal\n\t\t\t\tlx.separatedByUnderscore(IsOctalDigit, true)\n\t\t\t} else {\n\t\t\t\tpanic(\"Integer are too large.\")\n\t\t\t}\n\t\t}\n\t}\n\n\treturn lx.returnAndReset()\n}","func (n SStr) ToNum() float64 {\n\tv, _ := strconv.ParseFloat(string(n), 64)\n\treturn v\n}","func (i *Number) AsInt() int {\n\treturn int(i.value)\n}","func ParseNumber(f float64) *types.TypedValue {\n\tw := &wrappers.DoubleValue{Value: f}\n\tbs, err := proto.Marshal(w)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\treturn &types.TypedValue{\n\t\tType: string(TypeNumber),\n\t\tValue: bs,\n\t}\n}","func (n NullInt64) Value() (driver.Value, error) {\n\tif n == 0 {\n\t\treturn nil, nil\n\t}\n\treturn int64(n), nil\n}","func (v Value) Integer() int {\n\tswitch v.Typ {\n\tdefault:\n\t\tn, _ := strconv.ParseInt(v.String(), 10, 64)\n\t\treturn int(n)\n\tcase ':':\n\t\treturn v.IntegerV\n\t}\n}","func ParseNumberVal(s string) (cty.Value, error) {\n\t// The parsing done by big.Rat.SetString is more liberal than we want in\n\t// that it permits giving two numbers separated by a slash to give the\n\t// value as a fraction. We'll pre-screen the given string to make sure\n\t// it's using the subset of Rat number syntax we're expecting, and then\n\t// delegate to big.Rat.SetString only if it is.\n\n\tfor _, c := range s {\n\t\tif !((c >= '0' && c <= '9') || c == '.' || c == '-' || c == 'e' || c == 'E') {\n\t\t\treturn cty.NilVal, errors.New(\"invalid number syntax\")\n\t\t}\n\t}\n\n\tbr := new(big.Rat)\n\t_, ok := br.SetString(s)\n\tif !ok {\n\t\treturn cty.NilVal, errors.New(\"invalid number syntax\")\n\t}\n\treturn cty.CapsuleVal(Number, br), nil\n}","func (p Packet) ValueNumbers() ([]Number, error) {\n\tr := make([]Number, len(p.DataTypes))\n\n\tvar err error\n\treader := bytes.NewReader(p.Bytes)\n\tfor i, t := range p.DataTypes {\n\t\tr[i], err = byteReaderToNumber(t, reader)\n\t\tif err != nil {\n\t\t\treturn []Number{}, err\n\t\t}\n\t}\n\treturn r, nil\n}","func NewValue(s string, native bool) (*Value, error) {\n\tvar err error\n\tv := Value{\n\t\tnative: native,\n\t}\n\tmatches := valueRegex.FindStringSubmatch(s)\n\tif matches == nil {\n\t\treturn nil, fmt.Errorf(\"Invalid Number: %s\", s)\n\t}\n\tif len(matches[2])+len(matches[4]) > 32 {\n\t\treturn nil, fmt.Errorf(\"Overlong Number: %s\", s)\n\t}\n\tif matches[1] == \"-\" {\n\t\tv.negative = true\n\t}\n\tif len(matches[4]) == 0 {\n\t\tif v.num, err = strconv.ParseUint(matches[2], 10, 64); err != nil {\n\t\t\treturn nil, fmt.Errorf(\"Invalid Number: %s Reason: %s\", s, err.Error())\n\t\t}\n\t\tv.offset = 0\n\t} else {\n\t\tif v.num, err = strconv.ParseUint(matches[2]+matches[4], 10, 64); err != nil {\n\t\t\treturn nil, fmt.Errorf(\"Invalid Number: %s Reason: %s\", s, err.Error())\n\t\t}\n\t\tv.offset = -int64(len(matches[4]))\n\t}\n\tif len(matches[5]) > 0 {\n\t\texp, err := strconv.ParseInt(matches[7], 10, 64)\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"Invalid Number: %s %s\", s, err.Error())\n\t\t}\n\t\tif matches[6] == \"-\" {\n\t\t\tv.offset -= exp\n\t\t} else {\n\t\t\tv.offset += exp\n\t\t}\n\t}\n\tif v.IsNative() && len(matches[3]) > 0 {\n\t\tv.offset += 6\n\t}\n\treturn &v, v.canonicalise()\n}","func (p *PSParser) parseNumber() (PSObject, error) {\n\tisFloat := false\n\tallowSigns := true\n\tnumStr := \"\"\n\tfor {\n\t\tcommon.Log.Trace(\"Parsing number \\\"%s\\\"\", numStr)\n\t\tbb, err := p.reader.Peek(1)\n\t\tif err == io.EOF {\n\t\t\t// GH: EOF handling. Handle EOF like end of line. Can happen with\n\t\t\t// encoded object streams that the object is at the end.\n\t\t\t// In other cases, we will get the EOF error elsewhere at any rate.\n\t\t\tbreak // Handle like EOF\n\t\t}\n\t\tif err != nil {\n\t\t\tcommon.Log.Debug(\"PS ERROR: %s\", err)\n\t\t\treturn nil, err\n\t\t}\n\t\tif allowSigns && (bb[0] == '-' || bb[0] == '+') {\n\t\t\t// Only appear in the beginning, otherwise serves as a delimiter.\n\t\t\tb, _ := p.reader.ReadByte()\n\t\t\tnumStr += string(b)\n\t\t\tallowSigns = false // Only allowed in beginning, and after e (exponential).\n\t\t} else if pdfcore.IsDecimalDigit(bb[0]) {\n\t\t\tb, _ := p.reader.ReadByte()\n\t\t\tnumStr += string(b)\n\t\t} else if bb[0] == '.' {\n\t\t\tb, _ := p.reader.ReadByte()\n\t\t\tnumStr += string(b)\n\t\t\tisFloat = true\n\t\t} else if bb[0] == 'e' {\n\t\t\t// Exponential number format.\n\t\t\t// TODO: Is this supported in PS?\n\t\t\tb, _ := p.reader.ReadByte()\n\t\t\tnumStr += string(b)\n\t\t\tisFloat = true\n\t\t\tallowSigns = true\n\t\t} else {\n\t\t\tbreak\n\t\t}\n\t}\n\n\tif isFloat {\n\t\tfVal, err := strconv.ParseFloat(numStr, 64)\n\t\to := MakeReal(fVal)\n\t\treturn o, err\n\t}\n\tintVal, err := strconv.ParseInt(numStr, 10, 64)\n\to := MakeInteger(int(intVal))\n\treturn o, err\n}","func (n SNumber) ToInt() int {\n\treturn int(n)\n}","func (vl LongValue) GetType() int {\n\treturn ParticleType.INTEGER\n}","func (vl LongValue) GetType() int {\n\treturn ParticleType.INTEGER\n}","func (o *IncomeSummaryFieldNumber) GetValue() float64 {\n\tif o == nil {\n\t\tvar ret float64\n\t\treturn ret\n\t}\n\n\treturn o.Value\n}","func (n Number) Int() int {\n\tif n == 0 {\n\t\treturn 0\n\t}\n\treturn int(math.Round(float64(n)))\n}","func ToNumber(v interface{}) (f float64, err error) {\n\tswitch i := v.(type) {\n\tcase string:\n\t\tf, err = strconv.ParseFloat(i, 64)\n\tcase int:\n\t\tf = float64(i)\n\tcase int8:\n\t\tf = float64(i)\n\tcase int16:\n\t\tf = float64(i)\n\tcase int32:\n\t\tf = float64(i)\n\tcase int64:\n\t\tf = float64(i)\n\tcase uint:\n\t\tf = float64(i)\n\tcase uint8:\n\t\tf = float64(i)\n\tcase uint16:\n\t\tf = float64(i)\n\tcase uint32:\n\t\tf = float64(i)\n\tcase uint64:\n\t\tf = float64(i)\n\tcase float32:\n\t\tf = float64(i)\n\tcase float64:\n\t\tf = i\n\tdefault:\n\t\terr = errors.New(\"NaN\")\n\t}\n\treturn\n}","func (s *Scanner) scanNumber() (RichToken, error) {\n\toffs := s.srcPos.Offset\n\tstartCol := s.srcPos.Column\n\ttok := NUMBER\n\tch := s.ch\n\tvar err error\n\n\t// if ch is -, move on to next digit\n\tif ch == '-' {\n\t\tch, err = s.next()\n\t}\n\n\tif ch == '0' {\n\t\tif isDecimal(s.peek()) {\n\t\t\treturn RichToken{}, fmt.Errorf(\"Column %d, Line %d: 0 cannot be followed by digit without . or exponent\",\n\t\t\t\ts.srcPos.Column, s.srcPos.Line)\n\t\t}\n\n\t\tch, err = s.next()\n\t}\n\n\t// can only have one 0, or arbitrary number of decimals\n\tif ch != '0' {\n\t\tfor isDecimal(ch) {\n\t\t\tch, err = s.next()\n\t\t}\n\t}\n\n\tif err != nil {\n\t\treturn RichToken{}, err\n\t}\n\n\t// can only have one ., following by arbitrary number of decimals\n\tif ch == '.' {\n\t\tch, err = s.next()\n\n\t\tif err != nil {\n\t\t\treturn RichToken{}, err\n\t\t} else if !isDecimal(ch) {\n\t\t\t// must have at least one decimal\n\t\t\treturn RichToken{}, fmt.Errorf(\"Column %d, Line %d: . must be followed by at least one digit\",\n\t\t\t\ts.srcPos.Column, s.srcPos.Line)\n\t\t}\n\n\t\tfor isDecimal(ch) {\n\t\t\tch, err = s.next()\n\n\t\t\tif err != nil {\n\t\t\t\treturn RichToken{}, err\n\t\t\t}\n\t\t}\n\t}\n\n\t// can have e or E\n\tif ch == 'e' || ch == 'E' {\n\t\tch, err = s.next()\n\n\t\tif err != nil {\n\t\t\treturn RichToken{}, err\n\t\t}\n\n\t\t// exponent has optional sign\n\t\tif ch == '+' || ch == '-' {\n\t\t\tch, err = s.next()\n\n\t\t\tif err != nil {\n\t\t\t\treturn RichToken{}, err\n\t\t\t}\n\t\t}\n\n\t\t// must have at least one decimal\n\t\tif !isDecimal(ch) {\n\t\t\treturn RichToken{}, fmt.Errorf(\"Column %d, Line %d: e or E must be followed by at least one digit\",\n\t\t\t\ts.srcPos.Column, s.srcPos.Line)\n\t\t}\n\n\t\t// exponent followed by arbitrary number of decimals\n\t\tfor isDecimal(ch) {\n\t\t\tch, err = s.next()\n\n\t\t\tif err != nil {\n\t\t\t\treturn RichToken{}, err\n\t\t\t}\n\t\t}\n\t}\n\n\treturn RichToken{\n\t\tpos: Position{\n\t\t\tOffset: offs,\n\t\t\tColumn: startCol,\n\t\t\tLine: s.srcPos.Line,\n\t\t},\n\t\ttok: tok,\n\t\tlit: string(s.src[offs:s.srcPos.Offset]),\n\t}, nil\n}","func Number(in string) (out string, err error) {\n\tf := func(r rune) bool {\n\t\treturn !unicode.IsNumber(r)\n\t}\n\n\tout = strings.Join(strings.FieldsFunc(in, f), \"\")\n\tswitch {\n\tcase len(out) == 11 && out[0] == '1' && out[1] >= '2' && out[4] >= '2':\n\t\treturn out[1:], nil\n\tcase len(out) == 11 && out[0] > '1':\n\t\treturn \"\", fmt.Errorf(\"invalid number: %s\", in)\n\tcase len(out) < 10 || out[0] <= '1' || out[3] <= '1' || len(out) > 11:\n\t\treturn \"\", fmt.Errorf(\"invalid number: %s\", in)\n\t}\n\n\treturn out, nil\n}","func (f *Feature) Number(x Example) float64 {\n\tif f.Kind != Feature_NUMERICAL {\n\t\treturn math.NaN()\n\t}\n\treturn numerify(x.GetExampleValue(f.Name))\n}","func (n NullMoney) Value() (driver.Value, error) {\n\tif n == 0.0 {\n\t\treturn nil, nil\n\t}\n\treturn float64(n), nil\n}","func Number(x string) (geometry.Number, error) {\n\tn, err := strconv.ParseFloat(x, 64)\n\tif err != nil {\n\t\treturn 0, ErrBadNumber\n\t}\n\treturn geometry.Number(n), nil\n}","func lexNumber(l *lexer) stateFn {\r\nLoop:\r\n\tfor {\r\n\t\tswitch r := l.next(); {\r\n\t\tcase isDigit(r):\r\n\t\tcase r == '.':\r\n\t\t\treturn lexFloat\r\n\t\tdefault:\r\n\t\t\tl.backup()\r\n\t\t\tl.emit(TokInt)\r\n\t\t\tbreak Loop\r\n\t\t}\r\n\t}\r\n\treturn lexAny\r\n}","func (lex *Lexer) NextNumberLit() {\n\tlex.nextWithSpecificMode(scanner.ScanNumberLit)\n}","func (ns Int64) Value() (driver.Value, error) {\n\tif !ns.Valid {\n\t\treturn nil, nil\n\t}\n\treturn ns.Int64, nil\n}","func (d *Document) Number(f float64) Node {\n\tid := uint(len(d.nodes))\n\tn := d.grow()\n\tn.reset(vNumber|infRoot, numjson.FormatFloat(f, 64), n.values[:0])\n\treturn d.Node(id)\n}","func (this *Mod) Type() value.Type { return value.NUMBER }","func (vl IntegerValue) GetType() int {\n\treturn ParticleType.INTEGER\n}","func (vl IntegerValue) GetType() int {\n\treturn ParticleType.INTEGER\n}"],"string":"[\n \"func (v Value) Number() (Number, error) {\\n\\tr := bytes.NewReader(v.bytes)\\n\\treturn byteReaderToNumber(v.dataType, r)\\n}\",\n \"func getNumber(v interface{}) (int64, error) {\\n\\tswitch v := v.(type) {\\n\\tcase int:\\n\\t\\treturn int64(v), nil\\n\\tcase int8:\\n\\t\\treturn int64(v), nil\\n\\tcase int16:\\n\\t\\treturn int64(v), nil\\n\\tcase int32:\\n\\t\\treturn int64(v), nil\\n\\tcase int64:\\n\\t\\treturn v, nil\\n\\tcase uint:\\n\\t\\treturn int64(v), nil\\n\\tcase uint8:\\n\\t\\treturn int64(v), nil\\n\\tcase uint16:\\n\\t\\treturn int64(v), nil\\n\\tcase uint32:\\n\\t\\treturn int64(v), nil\\n\\tcase uint64:\\n\\t\\treturn int64(v), nil\\n\\tcase []byte:\\n\\t\\treturn parseString(string(v))\\n\\tcase string:\\n\\t\\treturn parseString(v)\\n\\tcase sqltypes.Value:\\n\\t\\treturn parseValue(v.Type(), v.Raw())\\n\\tcase *querypb.BindVariable:\\n\\t\\treturn parseValue(v.Type, v.Value)\\n\\t}\\n\\treturn 0, fmt.Errorf(\\\"getNumber: unexpected type for %v: %T\\\", v, v)\\n}\",\n \"func (v *Value) Number() (float64, error) {\\n\\tif v.kind == kindNumber {\\n\\t\\treturn v.numberContent, nil\\n\\t}\\n\\treturn 0.0, errors.New(\\\"JSON value is not a number\\\")\\n}\",\n \"func getNumber(e Expr) (float64, error) {\\n\\tswitch n := e.(type) {\\n\\tcase *NumberLiteral:\\n\\t\\treturn n.Val, nil\\n\\tcase *NilLiteral:\\n\\t\\treturn 0, nil\\n\\tdefault:\\n\\t\\treturn 0, fmt.Errorf(\\\"Literal is not a number: %v\\\", n)\\n\\t}\\n}\",\n \"func NumberVal(v *big.Rat) cty.Value {\\n\\treturn cty.CapsuleVal(Number, v)\\n}\",\n \"func (p *parser) number() Node {\\n\\ttoken := p.expect(TokenNumber)\\n\\tnum, err := newNumber(token.pos, token.val)\\n\\tif err != nil {\\n\\t\\tp.error(err)\\n\\t}\\n\\treturn num\\n}\",\n \"func (u *sqlSymUnion) numVal() *NumVal {\\n\\treturn u.val.(*NumVal)\\n}\",\n \"func (u *sqlSymUnion) numVal() *NumVal {\\n\\treturn u.val.(*NumVal)\\n}\",\n \"func (u *sqlSymUnion) numVal() *NumVal {\\n\\treturn u.val.(*NumVal)\\n}\",\n \"func (u *sqlSymUnion) numVal() *NumVal {\\n\\treturn u.val.(*NumVal)\\n}\",\n \"func (v *JSONValue) Number() float64 {\\n\\tv.parseNumber()\\n\\treturn v.valNumber\\n}\",\n \"func ToNumber(v Value) (int64, float64, NumberType) {\\n\\tswitch v.iface.(type) {\\n\\tcase int64:\\n\\t\\treturn v.AsInt(), 0, IsInt\\n\\tcase float64:\\n\\t\\treturn 0, v.AsFloat(), IsFloat\\n\\tcase string:\\n\\t\\ts := v.AsString()\\n\\t\\treturn StringToNumber(strings.TrimSpace(s))\\n\\t}\\n\\treturn 0, 0, NaN\\n}\",\n \"func (n SNumber) ToNum() float64 {\\n\\treturn float64(n)\\n}\",\n \"func (n Number) Value() (driver.Value, error) {\\n\\treturn string(n), nil\\n}\",\n \"func (v Value) NumberType() ValueType {\\n\\tswitch v.iface.(type) {\\n\\tcase int64:\\n\\t\\treturn IntType\\n\\tcase float64:\\n\\t\\treturn FloatType\\n\\t}\\n\\treturn UnknownType\\n}\",\n \"func ToNumberValue(v Value) (Value, NumberType) {\\n\\tswitch v.NumberType() {\\n\\tcase IntType:\\n\\t\\treturn v, IsInt\\n\\tcase FloatType:\\n\\t\\treturn v, IsFloat\\n\\t}\\n\\tif s, ok := v.TryString(); ok {\\n\\t\\tn, f, tp := StringToNumber(strings.TrimSpace(s))\\n\\t\\tswitch tp {\\n\\t\\tcase IsInt:\\n\\t\\t\\treturn IntValue(n), IsInt\\n\\t\\tcase IsFloat:\\n\\t\\t\\treturn FloatValue(f), IsFloat\\n\\t\\t}\\n\\t}\\n\\treturn v, NaN\\n}\",\n \"func Number() {\\n\\tfmt.Println(232, reflect.TypeOf(232))\\n\\tfmt.Println(232.67, reflect.TypeOf(232.67))\\n}\",\n \"func lvalNum(x int64) *lval {\\n\\tv := new(lval)\\n\\tv.ltype = lvalNumType\\n\\tv.num = x\\n\\treturn v\\n}\",\n \"func NumberIntVal(v int64) cty.Value {\\n\\tbr := big.NewRat(v, 1)\\n\\treturn cty.CapsuleVal(Number, br)\\n}\",\n \"func (j *JSONData) Number() *float64 {\\n\\tif j != nil && j.value != nil {\\n\\t\\tif float, ok := (*j.value).(float64); ok {\\n\\t\\t\\treturn &float\\n\\t\\t}\\n\\t}\\n\\treturn nil\\n}\",\n \"func NewNumber(value float64) *Value {\\n\\treturn &Value{kind: kindNumber, numberContent: value}\\n}\",\n \"func (rt *operatorRuntime) numVal(op func(float64) interface{}, vs parser.Scope,\\n\\tis map[string]interface{}, tid uint64) (interface{}, error) {\\n\\n\\tvar ret interface{}\\n\\n\\terrorutil.AssertTrue(len(rt.node.Children) == 1,\\n\\t\\tfmt.Sprint(\\\"Operation requires 1 operand\\\", rt.node))\\n\\n\\tres, err := rt.node.Children[0].Runtime.Eval(vs, is, tid)\\n\\tif err == nil {\\n\\n\\t\\t// Check if the value is a number\\n\\n\\t\\tresNum, ok := res.(float64)\\n\\n\\t\\tif !ok {\\n\\n\\t\\t\\t// Produce a runtime error if the value is not a number\\n\\n\\t\\t\\treturn nil, rt.erp.NewRuntimeError(util.ErrNotANumber,\\n\\t\\t\\t\\trt.errorDetailString(rt.node.Children[0].Token, res), rt.node.Children[0])\\n\\t\\t}\\n\\n\\t\\tret = op(resNum)\\n\\t}\\n\\n\\treturn ret, err\\n}\",\n \"func (v Value10) Get() any { return int(v) }\",\n \"func (t Token) Numberlike() float64 {\\n\\treturn float64(t)\\n}\",\n \"func (l *lexer) getNumber() float64 {\\n\\tvalueEndIndex := l.pos + 1\\n\\tfor valueEndIndex < len(l.input) {\\n\\t\\tch := l.input[valueEndIndex]\\n\\t\\tif ch >= '0' && ch <= '9' {\\n\\t\\t\\tvalueEndIndex++\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tbreak\\n\\t}\\n\\tvalue, err := strconv.ParseFloat(l.input[l.pos:valueEndIndex], 64)\\n\\tif err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\tl.pos = valueEndIndex\\n\\treturn value\\n}\",\n \"func ToNumber(o Value) (*Number, error) {\\n\\tswitch p := o.(type) {\\n\\tcase *Number:\\n\\t\\treturn p, nil\\n\\tcase *Character:\\n\\t\\treturn Integer(int(p.Value)), nil\\n\\tcase *Boolean:\\n\\t\\tif p.Value {\\n\\t\\t\\treturn One, nil\\n\\t\\t}\\n\\t\\treturn Zero, nil\\n\\tcase *String:\\n\\t\\tf, err := strconv.ParseFloat(p.Value, 64)\\n\\t\\tif err == nil {\\n\\t\\t\\treturn Float(f), nil\\n\\t\\t}\\n\\t}\\n\\treturn nil, NewError(ArgumentErrorKey, \\\"cannot convert to an number: \\\", o)\\n}\",\n \"func (f Number) Native(context.Context) interface{} {\\n\\treturn float64(f)\\n}\",\n \"func (n Int64String) Value() (driver.Value, error) {\\n\\tif n == 0 {\\n\\t\\treturn nil, nil\\n\\t}\\n\\treturn float64(n), nil\\n}\",\n \"func (e *Expect) Number(value float64) *Number {\\n\\topChain := e.chain.enter(\\\"Number()\\\")\\n\\tdefer opChain.leave()\\n\\n\\treturn newNumber(opChain, value)\\n}\",\n \"func (l *NumberLiteral) Type() Type {\\n\\treturn l.ExprType\\n}\",\n \"func (p *Parser) number() {\\n\\tnum, _ := strconv.Atoi(p.previous.Literal)\\n\\tp.emitConstant(IntVal(num))\\n}\",\n \"func (this *DateAddMillis) Type() value.Type { return value.NUMBER }\",\n \"func readNumber(pt *pathtokenizer, tokenType *int, token *string) (v float64, err error) {\\n\\tif *tokenType != scanNum {\\n\\t\\treturn 0, fmt.Errorf(\\\"this token is not a Number but %d\\\", *tokenType)\\n\\t}\\n\\tv, err = strconv.ParseFloat(*token, 64) // parse float64\\n\\t*tokenType, *token = pt.get() // read next token\\n\\treturn\\n}\",\n \"func (p *parser) number(val string) float64 {\\n\\tn, err := strconv.ParseInt(val, 0, 64)\\n\\tf := float64(n)\\n\\tif err != nil {\\n\\t\\tf, err = strconv.ParseFloat(val, 64)\\n\\t}\\n\\tif err != nil {\\n\\t\\tp.errorf(\\\"error parsing number: %s\\\", err)\\n\\t}\\n\\treturn f\\n}\",\n \"func AllocNumber(val float64, numtype int) *GoJSON {\\n\\tchild := new(GoJSON)\\n\\n\\tif numtype == JSON_INT {\\n\\t\\tchild.Valint = int64(val)\\n\\t\\tchild.Jsontype = JSON_INT\\n\\t} else if numtype == JSON_UINT {\\n\\t\\tchild.Valuint = uint64(val)\\n\\t\\tchild.Jsontype = JSON_UINT\\n\\t} else {\\n\\t\\tchild.Valdouble = val\\n\\t\\tchild.Jsontype = JSON_DOUBLE\\n\\t}\\n\\n\\treturn child\\n}\",\n \"func (n NullNumeric) Value() (driver.Value, error) {\\n\\tif !n.Valid {\\n\\t\\treturn nil, nil\\n\\t}\\n\\treturn n.Numeric.Value()\\n}\",\n \"func (l *Lexer) Number() float64 {\\n\\ts := l.pos // l.start is reset through the multiple scans\\n\\tif l.Peek() == '-' {\\n\\t\\tl.pos += l.width\\n\\t}\\n\\tl.Scan(unicode.IsDigit)\\n\\tif l.Next() == \\\".\\\" {\\n\\t\\tl.Scan(unicode.IsDigit)\\n\\t} else {\\n\\t\\tl.Rewind()\\n\\t}\\n\\tif c := l.Next(); c == \\\"e\\\" || c == \\\"E\\\" {\\n\\t\\tif l.Peek() == '-' || l.Peek() == '+' {\\n\\t\\t\\tl.pos += l.width\\n\\t\\t}\\n\\t\\tl.Scan(unicode.IsDigit)\\n\\t} else {\\n\\t\\tl.Rewind()\\n\\t}\\n\\tl.start = s\\n\\tn, err := strconv.ParseFloat(l.Input[s:l.pos], 64)\\n\\tif err != nil {\\n\\t\\t// This might be a bad idea in the long run.\\n\\t\\treturn 0\\n\\t}\\n\\treturn n\\n}\",\n \"func (*BigInt) Type() types.Type {\\n\\treturn types.Number\\n}\",\n \"func (p *Parser) number(tok token.Token) (expr value.Expr, str string) {\\n\\tvar err error\\n\\ttext := tok.Text\\n\\tswitch tok.Type {\\n\\tcase token.Identifier:\\n\\t\\texpr = p.variable(text)\\n\\tcase token.String:\\n\\t\\t// TODO\\n\\t\\tstr = \\\"<token.String>\\\"\\n\\tcase token.Number, token.Rational:\\n\\t\\texpr, err = value.Parse(p.context.Config(), text)\\n\\tcase token.LeftParen:\\n\\t\\texpr = p.expr(p.next())\\n\\t\\ttok := p.next()\\n\\t\\tif tok.Type != token.RightParen {\\n\\t\\t\\tp.errorf(\\\"expected right paren, found %s\\\", tok)\\n\\t\\t}\\n\\t}\\n\\tif err != nil {\\n\\t\\tp.errorf(\\\"%s: %s\\\", text, err)\\n\\t}\\n\\treturn expr, str\\n}\",\n \"func Num(x Value) Value {\\n\\tif v, ok := x.(*ratVal); ok {\\n\\t\\tx = v.Value\\n\\t}\\n\\treturn constant.Num(x)\\n}\",\n \"func (number Number) Value() (value driver.Value, err error) {\\n\\tif number == \\\"\\\" {\\n\\t\\treturn \\\"\\\", nil\\n\\t}\\n\\n\\tif err = number.Validate(); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\treturn number.String(), nil\\n}\",\n \"func convertNumber(n json.Number) (interface{}, error) {\\n\\t// Attempt to convert to an int64 first\\n\\tif i, err := n.Int64(); err == nil {\\n\\t\\treturn i, nil\\n\\t}\\n\\t// Return a float64 (default json.Decode() behavior)\\n\\t// An overflow will return an error\\n\\treturn n.Float64()\\n}\",\n \"func (l *Lexer) readNumber() (token.TokenType, string) {\\n\\tposition := l.position\\n\\tdecimals := 0\\n\\tfor isDigit(l.ch) || l.ch == '.' {\\n\\t\\tif l.ch == '.' {\\n\\t\\t\\tif decimals > 0 {\\n\\t\\t\\t\\tbreak\\n\\t\\t\\t}\\n\\t\\t\\tdecimals++\\n\\t\\t}\\n\\t\\tl.readChar()\\n\\t}\\n\\tif decimals > 0 {\\n\\t\\treturn token.FLOAT, l.input[position:l.position]\\n\\t}\\n\\n\\treturn token.INT, l.input[position:l.position]\\n}\",\n \"func (v Value10) Int() int { return int(v) }\",\n \"func numberType(f func(...Expression) Expression) func(...Expression) (Expression, error) {\\n\\n\\treturn func(args ...Expression) (Expression, error) {\\n\\t\\tfor _, arg := range args {\\n\\t\\t\\tif _, ok := arg.(Number); !ok {\\n\\t\\t\\t\\treturn nil, errors.New(fmt.Sprintf(\\\"Type Error: Recieved %T, Expected Number\\\", arg))\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn f(args...), nil\\n\\t}\\n}\",\n \"func (me TSAFPTPortugueseVatNumber) ToXsdtInteger() xsdt.Integer { return xsdt.Integer(me) }\",\n \"func IntValue(n int64) Value {\\n\\treturn Value{iface: n}\\n}\",\n \"func (Integer) Type() types.Type {\\n\\treturn types.Number\\n}\",\n \"func (p *parser) parseNumber() (num *tree.NumberExpr) {\\n\\tswitch p.tok {\\n\\tcase token.NUMBERFLOAT, token.NUMBERHEX:\\n\\t\\tnum = &tree.NumberExpr{NumberToken: p.token()}\\n\\tdefault:\\n\\t\\tp.error(p.off, \\\"'\\\"+token.NUMBERFLOAT.String()+\\\"' expected\\\")\\n\\t}\\n\\tp.next()\\n\\treturn\\n}\",\n \"func (s *Scanner) scanNumber() Token {\\n\\tline, offset := s.line, s.lineOffset\\n\\tvar buf bytes.Buffer\\n\\tbuf.WriteByte(s.read())\\n\\tfor {\\n\\t\\tif ch := s.read(); ch == eof {\\n\\t\\t\\tbreak\\n\\t\\t} else if isNumber(ch) {\\n\\t\\t\\tbuf.WriteByte(ch)\\n\\t\\t} else {\\n\\t\\t\\ts.unread()\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\treturn Token{tpe: NUMBER, val: buf.String(), line: line, offset: offset}\\n}\",\n \"func (s *Scanner) number() {\\n\\tfor s.isDigit(s.peek()) {\\n\\t\\ts.advance()\\n\\t}\\n\\tif s.peek() == '.' && s.isDigit(s.peekNext()) {\\n\\t\\ts.advance()\\n\\t\\tfor s.isDigit(s.peek()) {\\n\\t\\t\\ts.advance()\\n\\t\\t}\\n\\t}\\n\\t// this seems a bit convoluted just to cast []byte into []rune\\n\\tliteral := []rune(string(s.source[s.start:s.current]))\\n\\ts.addToken(token.NUMBER, literal)\\n}\",\n \"func (p *Parser) number(tok scan.Token) (expr value.Expr, str string) {\\n\\tvar err error\\n\\ttext := tok.Text\\n\\tswitch tok.Type {\\n\\tcase scan.Identifier:\\n\\t\\texpr = p.index(p.variable(text))\\n\\tcase scan.String:\\n\\t\\tstr = value.ParseString(text)\\n\\tcase scan.Number, scan.Rational, scan.Complex:\\n\\t\\texpr, err = value.Parse(p.context.Config(), text)\\n\\tcase scan.LeftParen:\\n\\t\\texpr = p.expr()\\n\\t\\ttok := p.next()\\n\\t\\tif tok.Type != scan.RightParen {\\n\\t\\t\\tp.errorf(\\\"expected right paren, found %s\\\", tok)\\n\\t\\t}\\n\\t}\\n\\tif err != nil {\\n\\t\\tp.errorf(\\\"%s: %s\\\", text, err)\\n\\t}\\n\\treturn expr, str\\n}\",\n \"func (t *Type) Val() *Type\",\n \"func AsNumber(f Field) uint32 {\\n\\tv, _ := f.(uint32)\\n\\treturn v\\n}\",\n \"func (this *DateTruncMillis) Type() value.Type { return value.NUMBER }\",\n \"func execmNumberInt64(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(1)\\n\\tret, ret1 := args[0].(json.Number).Int64()\\n\\tp.Ret(1, ret, ret1)\\n}\",\n \"func IntValue(obj Value) int {\\n\\tif p, ok := obj.(*Number); ok {\\n\\t\\treturn int(p.Value)\\n\\t}\\n\\treturn 0\\n}\",\n \"func GetNumber(data []byte, keys ...string) (val float64, offset int, err error) {\\n\\tv, t, offset, e := Get(data, keys...)\\n\\n\\tif e != nil {\\n\\t\\treturn 0, offset, e\\n\\t}\\n\\n\\tif t != Number {\\n\\t\\treturn 0, offset, fmt.Errorf(\\\"Value is not a number: %s\\\", string(v))\\n\\t}\\n\\n\\tval, err = strconv.ParseFloat(string(v), 64)\\n\\treturn\\n}\",\n \"func processNumber(i interface{}) uint64 {\\n\\tvar n uint64\\n\\tswitch v := i.(type) {\\n\\tcase uint64:\\n\\t\\tn = v\\n\\tcase string:\\n\\t\\ts := strings.Split(v, \\\".\\\")\\n\\t\\tn, _ = strconv.ParseUint(s[0], 10, 64)\\n\\tcase float64:\\n\\t\\tn = uint64(v)\\n\\t}\\n\\treturn n\\n}\",\n \"func (v *Value) GetNum() *string {\\n\\tret := C.zj_GetNumStr(v.V)\\n\\tif ret == nil {\\n\\t\\treturn nil\\n\\t}\\n\\tretStr := C.GoString(ret)\\n\\treturn &retStr\\n}\",\n \"func (self ValueKind) IsNumber() bool {\\n\\treturn bool(C.wasm_valkind_is_num(C.wasm_valkind_t(self)))\\n}\",\n \"func (n *Number) Int() *big.Int {\\n\\tif !n.isInteger {\\n\\t\\treturn nil\\n\\t}\\n\\treturn &n.integer\\n}\",\n \"func (*Base) LiteralNumber(p ASTPass, node *ast.LiteralNumber, ctx Context) {\\n}\",\n \"func (this *DatePartStr) Type() value.Type { return value.NUMBER }\",\n \"func readNumericToken(r *bufio.Reader) tok.Token {\\n\\tliteral, ok := readNumericLiteral(r)\\n\\tif !ok {\\n\\t\\treturn tok.Token{TokenType: tok.Invalid, Literal: literal}\\n\\t}\\n\\n\\tif ok := validateNumericLiteral(literal); !ok {\\n\\t\\treturn tok.Token{TokenType: tok.Invalid, Literal: literal}\\n\\t}\\n\\n\\ttokType := numericLiteralTokenType(literal)\\n\\n\\treturn tok.Token{TokenType: tokType, Literal: literal}\\n}\",\n \"func eeNumInt(v int) (n eeNum) {\\r\\n\\t*n.int() = v\\r\\n\\treturn\\r\\n}\",\n \"func (v Int) Native() interface{} {\\n\\treturn int64(v)\\n}\",\n \"func (a *Argument) Number() float64 {\\n\\treturn float64(a.state.CheckNumber(a.number))\\n}\",\n \"func (v Value2) Get() any { return int(v) }\",\n \"func (this *DatePartMillis) Type() value.Type { return value.NUMBER }\",\n \"func (d DecimalObj) Value() (driver.Value, error) {\\n\\tif !d.Valid {\\n\\t\\treturn nil, nil\\n\\t}\\n\\treturn d.Number.Value()\\n}\",\n \"func (lx *Lexer) numeralLiteral() Token {\\n\\tlx.token.Type = IntegerLiteral\\n\\tlx.token.Sub = Decimal\\n\\n\\tdefer func() {\\n\\t\\terr := recover()\\n\\t\\tif err == nil {\\n\\t\\t\\treturn\\n\\t\\t}\\n\\n\\t\\t// FIXME: Show more helpful messages\\n\\t\\tmsg := fmt.Sprintf(\\\"`%s` Illegal syntax of %s %s.\\\\n%s\\\",\\n\\t\\t\\tlx.token.Value(),\\n\\t\\t\\tlx.token.Sub,\\n\\t\\t\\tlx.token.Type,\\n\\t\\t\\terr,\\n\\t\\t)\\n\\n\\t\\tpanic(lx.errf(msg))\\n\\t}()\\n\\n\\tr, e := lx.peekChar()\\n\\tif e != nil {\\n\\t\\tpanic(\\\"End of file nothing to read here\\\")\\n\\t}\\n\\n\\tif r > '0' && r <= '9' {\\n\\t\\tlx.consume()\\n\\t\\tlx.separatedByUnderscore(IsNonZeroDigit, false)\\n\\t} else if r != '.' {\\n\\t\\tlx.consume()\\n\\t\\tp, _ := lx.peekChar()\\n\\t\\tswitch {\\n\\t\\tcase IsRuneIn(p, \\\"Xx\\\"):\\n\\t\\t\\tlx.token.Sub = Hex\\n\\t\\t\\tlx.consume()\\n\\n\\t\\t\\t// 0x.BEEF is a valid float literal\\n\\t\\t\\t// but 0x is invalid integer literal\\n\\t\\t\\tif p, _ := lx.peekChar(); p != '.' {\\n\\t\\t\\t\\tlx.separatedByUnderscore(IsHexDigit, true)\\n\\t\\t\\t}\\n\\n\\t\\tcase IsRuneIn(p, \\\"Bb\\\"):\\n\\t\\t\\tlx.token.Sub = Binary\\n\\t\\t\\tlx.consume()\\n\\t\\t\\tlx.separatedByUnderscore(IsBinaryDigit, true)\\n\\t\\tcase IsDigit(p):\\n\\t\\t\\tif IsOctalDigit(p) {\\n\\t\\t\\t\\tlx.token.Sub = Octal\\n\\t\\t\\t\\tlx.separatedByUnderscore(IsOctalDigit, true)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tpanic(\\\"Integer are too large.\\\")\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn lx.returnAndReset()\\n}\",\n \"func (n SStr) ToNum() float64 {\\n\\tv, _ := strconv.ParseFloat(string(n), 64)\\n\\treturn v\\n}\",\n \"func (i *Number) AsInt() int {\\n\\treturn int(i.value)\\n}\",\n \"func ParseNumber(f float64) *types.TypedValue {\\n\\tw := &wrappers.DoubleValue{Value: f}\\n\\tbs, err := proto.Marshal(w)\\n\\tif err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\treturn &types.TypedValue{\\n\\t\\tType: string(TypeNumber),\\n\\t\\tValue: bs,\\n\\t}\\n}\",\n \"func (n NullInt64) Value() (driver.Value, error) {\\n\\tif n == 0 {\\n\\t\\treturn nil, nil\\n\\t}\\n\\treturn int64(n), nil\\n}\",\n \"func (v Value) Integer() int {\\n\\tswitch v.Typ {\\n\\tdefault:\\n\\t\\tn, _ := strconv.ParseInt(v.String(), 10, 64)\\n\\t\\treturn int(n)\\n\\tcase ':':\\n\\t\\treturn v.IntegerV\\n\\t}\\n}\",\n \"func ParseNumberVal(s string) (cty.Value, error) {\\n\\t// The parsing done by big.Rat.SetString is more liberal than we want in\\n\\t// that it permits giving two numbers separated by a slash to give the\\n\\t// value as a fraction. We'll pre-screen the given string to make sure\\n\\t// it's using the subset of Rat number syntax we're expecting, and then\\n\\t// delegate to big.Rat.SetString only if it is.\\n\\n\\tfor _, c := range s {\\n\\t\\tif !((c >= '0' && c <= '9') || c == '.' || c == '-' || c == 'e' || c == 'E') {\\n\\t\\t\\treturn cty.NilVal, errors.New(\\\"invalid number syntax\\\")\\n\\t\\t}\\n\\t}\\n\\n\\tbr := new(big.Rat)\\n\\t_, ok := br.SetString(s)\\n\\tif !ok {\\n\\t\\treturn cty.NilVal, errors.New(\\\"invalid number syntax\\\")\\n\\t}\\n\\treturn cty.CapsuleVal(Number, br), nil\\n}\",\n \"func (p Packet) ValueNumbers() ([]Number, error) {\\n\\tr := make([]Number, len(p.DataTypes))\\n\\n\\tvar err error\\n\\treader := bytes.NewReader(p.Bytes)\\n\\tfor i, t := range p.DataTypes {\\n\\t\\tr[i], err = byteReaderToNumber(t, reader)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn []Number{}, err\\n\\t\\t}\\n\\t}\\n\\treturn r, nil\\n}\",\n \"func NewValue(s string, native bool) (*Value, error) {\\n\\tvar err error\\n\\tv := Value{\\n\\t\\tnative: native,\\n\\t}\\n\\tmatches := valueRegex.FindStringSubmatch(s)\\n\\tif matches == nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"Invalid Number: %s\\\", s)\\n\\t}\\n\\tif len(matches[2])+len(matches[4]) > 32 {\\n\\t\\treturn nil, fmt.Errorf(\\\"Overlong Number: %s\\\", s)\\n\\t}\\n\\tif matches[1] == \\\"-\\\" {\\n\\t\\tv.negative = true\\n\\t}\\n\\tif len(matches[4]) == 0 {\\n\\t\\tif v.num, err = strconv.ParseUint(matches[2], 10, 64); err != nil {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"Invalid Number: %s Reason: %s\\\", s, err.Error())\\n\\t\\t}\\n\\t\\tv.offset = 0\\n\\t} else {\\n\\t\\tif v.num, err = strconv.ParseUint(matches[2]+matches[4], 10, 64); err != nil {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"Invalid Number: %s Reason: %s\\\", s, err.Error())\\n\\t\\t}\\n\\t\\tv.offset = -int64(len(matches[4]))\\n\\t}\\n\\tif len(matches[5]) > 0 {\\n\\t\\texp, err := strconv.ParseInt(matches[7], 10, 64)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"Invalid Number: %s %s\\\", s, err.Error())\\n\\t\\t}\\n\\t\\tif matches[6] == \\\"-\\\" {\\n\\t\\t\\tv.offset -= exp\\n\\t\\t} else {\\n\\t\\t\\tv.offset += exp\\n\\t\\t}\\n\\t}\\n\\tif v.IsNative() && len(matches[3]) > 0 {\\n\\t\\tv.offset += 6\\n\\t}\\n\\treturn &v, v.canonicalise()\\n}\",\n \"func (p *PSParser) parseNumber() (PSObject, error) {\\n\\tisFloat := false\\n\\tallowSigns := true\\n\\tnumStr := \\\"\\\"\\n\\tfor {\\n\\t\\tcommon.Log.Trace(\\\"Parsing number \\\\\\\"%s\\\\\\\"\\\", numStr)\\n\\t\\tbb, err := p.reader.Peek(1)\\n\\t\\tif err == io.EOF {\\n\\t\\t\\t// GH: EOF handling. Handle EOF like end of line. Can happen with\\n\\t\\t\\t// encoded object streams that the object is at the end.\\n\\t\\t\\t// In other cases, we will get the EOF error elsewhere at any rate.\\n\\t\\t\\tbreak // Handle like EOF\\n\\t\\t}\\n\\t\\tif err != nil {\\n\\t\\t\\tcommon.Log.Debug(\\\"PS ERROR: %s\\\", err)\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\tif allowSigns && (bb[0] == '-' || bb[0] == '+') {\\n\\t\\t\\t// Only appear in the beginning, otherwise serves as a delimiter.\\n\\t\\t\\tb, _ := p.reader.ReadByte()\\n\\t\\t\\tnumStr += string(b)\\n\\t\\t\\tallowSigns = false // Only allowed in beginning, and after e (exponential).\\n\\t\\t} else if pdfcore.IsDecimalDigit(bb[0]) {\\n\\t\\t\\tb, _ := p.reader.ReadByte()\\n\\t\\t\\tnumStr += string(b)\\n\\t\\t} else if bb[0] == '.' {\\n\\t\\t\\tb, _ := p.reader.ReadByte()\\n\\t\\t\\tnumStr += string(b)\\n\\t\\t\\tisFloat = true\\n\\t\\t} else if bb[0] == 'e' {\\n\\t\\t\\t// Exponential number format.\\n\\t\\t\\t// TODO: Is this supported in PS?\\n\\t\\t\\tb, _ := p.reader.ReadByte()\\n\\t\\t\\tnumStr += string(b)\\n\\t\\t\\tisFloat = true\\n\\t\\t\\tallowSigns = true\\n\\t\\t} else {\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\n\\tif isFloat {\\n\\t\\tfVal, err := strconv.ParseFloat(numStr, 64)\\n\\t\\to := MakeReal(fVal)\\n\\t\\treturn o, err\\n\\t}\\n\\tintVal, err := strconv.ParseInt(numStr, 10, 64)\\n\\to := MakeInteger(int(intVal))\\n\\treturn o, err\\n}\",\n \"func (n SNumber) ToInt() int {\\n\\treturn int(n)\\n}\",\n \"func (vl LongValue) GetType() int {\\n\\treturn ParticleType.INTEGER\\n}\",\n \"func (vl LongValue) GetType() int {\\n\\treturn ParticleType.INTEGER\\n}\",\n \"func (o *IncomeSummaryFieldNumber) GetValue() float64 {\\n\\tif o == nil {\\n\\t\\tvar ret float64\\n\\t\\treturn ret\\n\\t}\\n\\n\\treturn o.Value\\n}\",\n \"func (n Number) Int() int {\\n\\tif n == 0 {\\n\\t\\treturn 0\\n\\t}\\n\\treturn int(math.Round(float64(n)))\\n}\",\n \"func ToNumber(v interface{}) (f float64, err error) {\\n\\tswitch i := v.(type) {\\n\\tcase string:\\n\\t\\tf, err = strconv.ParseFloat(i, 64)\\n\\tcase int:\\n\\t\\tf = float64(i)\\n\\tcase int8:\\n\\t\\tf = float64(i)\\n\\tcase int16:\\n\\t\\tf = float64(i)\\n\\tcase int32:\\n\\t\\tf = float64(i)\\n\\tcase int64:\\n\\t\\tf = float64(i)\\n\\tcase uint:\\n\\t\\tf = float64(i)\\n\\tcase uint8:\\n\\t\\tf = float64(i)\\n\\tcase uint16:\\n\\t\\tf = float64(i)\\n\\tcase uint32:\\n\\t\\tf = float64(i)\\n\\tcase uint64:\\n\\t\\tf = float64(i)\\n\\tcase float32:\\n\\t\\tf = float64(i)\\n\\tcase float64:\\n\\t\\tf = i\\n\\tdefault:\\n\\t\\terr = errors.New(\\\"NaN\\\")\\n\\t}\\n\\treturn\\n}\",\n \"func (s *Scanner) scanNumber() (RichToken, error) {\\n\\toffs := s.srcPos.Offset\\n\\tstartCol := s.srcPos.Column\\n\\ttok := NUMBER\\n\\tch := s.ch\\n\\tvar err error\\n\\n\\t// if ch is -, move on to next digit\\n\\tif ch == '-' {\\n\\t\\tch, err = s.next()\\n\\t}\\n\\n\\tif ch == '0' {\\n\\t\\tif isDecimal(s.peek()) {\\n\\t\\t\\treturn RichToken{}, fmt.Errorf(\\\"Column %d, Line %d: 0 cannot be followed by digit without . or exponent\\\",\\n\\t\\t\\t\\ts.srcPos.Column, s.srcPos.Line)\\n\\t\\t}\\n\\n\\t\\tch, err = s.next()\\n\\t}\\n\\n\\t// can only have one 0, or arbitrary number of decimals\\n\\tif ch != '0' {\\n\\t\\tfor isDecimal(ch) {\\n\\t\\t\\tch, err = s.next()\\n\\t\\t}\\n\\t}\\n\\n\\tif err != nil {\\n\\t\\treturn RichToken{}, err\\n\\t}\\n\\n\\t// can only have one ., following by arbitrary number of decimals\\n\\tif ch == '.' {\\n\\t\\tch, err = s.next()\\n\\n\\t\\tif err != nil {\\n\\t\\t\\treturn RichToken{}, err\\n\\t\\t} else if !isDecimal(ch) {\\n\\t\\t\\t// must have at least one decimal\\n\\t\\t\\treturn RichToken{}, fmt.Errorf(\\\"Column %d, Line %d: . must be followed by at least one digit\\\",\\n\\t\\t\\t\\ts.srcPos.Column, s.srcPos.Line)\\n\\t\\t}\\n\\n\\t\\tfor isDecimal(ch) {\\n\\t\\t\\tch, err = s.next()\\n\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn RichToken{}, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// can have e or E\\n\\tif ch == 'e' || ch == 'E' {\\n\\t\\tch, err = s.next()\\n\\n\\t\\tif err != nil {\\n\\t\\t\\treturn RichToken{}, err\\n\\t\\t}\\n\\n\\t\\t// exponent has optional sign\\n\\t\\tif ch == '+' || ch == '-' {\\n\\t\\t\\tch, err = s.next()\\n\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn RichToken{}, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// must have at least one decimal\\n\\t\\tif !isDecimal(ch) {\\n\\t\\t\\treturn RichToken{}, fmt.Errorf(\\\"Column %d, Line %d: e or E must be followed by at least one digit\\\",\\n\\t\\t\\t\\ts.srcPos.Column, s.srcPos.Line)\\n\\t\\t}\\n\\n\\t\\t// exponent followed by arbitrary number of decimals\\n\\t\\tfor isDecimal(ch) {\\n\\t\\t\\tch, err = s.next()\\n\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn RichToken{}, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn RichToken{\\n\\t\\tpos: Position{\\n\\t\\t\\tOffset: offs,\\n\\t\\t\\tColumn: startCol,\\n\\t\\t\\tLine: s.srcPos.Line,\\n\\t\\t},\\n\\t\\ttok: tok,\\n\\t\\tlit: string(s.src[offs:s.srcPos.Offset]),\\n\\t}, nil\\n}\",\n \"func Number(in string) (out string, err error) {\\n\\tf := func(r rune) bool {\\n\\t\\treturn !unicode.IsNumber(r)\\n\\t}\\n\\n\\tout = strings.Join(strings.FieldsFunc(in, f), \\\"\\\")\\n\\tswitch {\\n\\tcase len(out) == 11 && out[0] == '1' && out[1] >= '2' && out[4] >= '2':\\n\\t\\treturn out[1:], nil\\n\\tcase len(out) == 11 && out[0] > '1':\\n\\t\\treturn \\\"\\\", fmt.Errorf(\\\"invalid number: %s\\\", in)\\n\\tcase len(out) < 10 || out[0] <= '1' || out[3] <= '1' || len(out) > 11:\\n\\t\\treturn \\\"\\\", fmt.Errorf(\\\"invalid number: %s\\\", in)\\n\\t}\\n\\n\\treturn out, nil\\n}\",\n \"func (f *Feature) Number(x Example) float64 {\\n\\tif f.Kind != Feature_NUMERICAL {\\n\\t\\treturn math.NaN()\\n\\t}\\n\\treturn numerify(x.GetExampleValue(f.Name))\\n}\",\n \"func (n NullMoney) Value() (driver.Value, error) {\\n\\tif n == 0.0 {\\n\\t\\treturn nil, nil\\n\\t}\\n\\treturn float64(n), nil\\n}\",\n \"func Number(x string) (geometry.Number, error) {\\n\\tn, err := strconv.ParseFloat(x, 64)\\n\\tif err != nil {\\n\\t\\treturn 0, ErrBadNumber\\n\\t}\\n\\treturn geometry.Number(n), nil\\n}\",\n \"func lexNumber(l *lexer) stateFn {\\r\\nLoop:\\r\\n\\tfor {\\r\\n\\t\\tswitch r := l.next(); {\\r\\n\\t\\tcase isDigit(r):\\r\\n\\t\\tcase r == '.':\\r\\n\\t\\t\\treturn lexFloat\\r\\n\\t\\tdefault:\\r\\n\\t\\t\\tl.backup()\\r\\n\\t\\t\\tl.emit(TokInt)\\r\\n\\t\\t\\tbreak Loop\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\treturn lexAny\\r\\n}\",\n \"func (lex *Lexer) NextNumberLit() {\\n\\tlex.nextWithSpecificMode(scanner.ScanNumberLit)\\n}\",\n \"func (ns Int64) Value() (driver.Value, error) {\\n\\tif !ns.Valid {\\n\\t\\treturn nil, nil\\n\\t}\\n\\treturn ns.Int64, nil\\n}\",\n \"func (d *Document) Number(f float64) Node {\\n\\tid := uint(len(d.nodes))\\n\\tn := d.grow()\\n\\tn.reset(vNumber|infRoot, numjson.FormatFloat(f, 64), n.values[:0])\\n\\treturn d.Node(id)\\n}\",\n \"func (this *Mod) Type() value.Type { return value.NUMBER }\",\n \"func (vl IntegerValue) GetType() int {\\n\\treturn ParticleType.INTEGER\\n}\",\n \"func (vl IntegerValue) GetType() int {\\n\\treturn ParticleType.INTEGER\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.70115584","0.6969048","0.6674587","0.66428035","0.6590476","0.65527546","0.64667314","0.64667314","0.64667314","0.64667314","0.63752025","0.63733643","0.6349295","0.629919","0.62977487","0.62339395","0.61801726","0.6162864","0.6155927","0.6140079","0.6071112","0.59743387","0.5972055","0.59460396","0.5890514","0.5802353","0.5730379","0.57238716","0.57128626","0.5708427","0.5703323","0.5702209","0.56894594","0.5688472","0.56862766","0.5629518","0.5628191","0.5615868","0.560862","0.56066746","0.56024617","0.55752665","0.5557112","0.5553645","0.5530039","0.55238134","0.55227566","0.5506542","0.548853","0.54769737","0.54720235","0.5460816","0.5433414","0.54315597","0.5429698","0.5423063","0.5417632","0.54170835","0.54163283","0.54158217","0.54091567","0.538903","0.53675133","0.5362096","0.53612256","0.53593856","0.5356899","0.5353848","0.5350605","0.53496027","0.5349367","0.5331807","0.5323824","0.5316089","0.53157616","0.5315325","0.53103894","0.5306329","0.53048944","0.52937984","0.5288532","0.52840537","0.5283257","0.5283257","0.5267216","0.5260384","0.52592754","0.52590483","0.5257478","0.5254974","0.52533257","0.5253218","0.5250494","0.5236827","0.522828","0.522713","0.52253157","0.5220617","0.5220617"],"string":"[\n \"0.70115584\",\n \"0.6969048\",\n \"0.6674587\",\n \"0.66428035\",\n \"0.6590476\",\n \"0.65527546\",\n \"0.64667314\",\n \"0.64667314\",\n \"0.64667314\",\n \"0.64667314\",\n \"0.63752025\",\n \"0.63733643\",\n \"0.6349295\",\n \"0.629919\",\n \"0.62977487\",\n \"0.62339395\",\n \"0.61801726\",\n \"0.6162864\",\n \"0.6155927\",\n \"0.6140079\",\n \"0.6071112\",\n \"0.59743387\",\n \"0.5972055\",\n \"0.59460396\",\n \"0.5890514\",\n \"0.5802353\",\n \"0.5730379\",\n \"0.57238716\",\n \"0.57128626\",\n \"0.5708427\",\n \"0.5703323\",\n \"0.5702209\",\n \"0.56894594\",\n \"0.5688472\",\n \"0.56862766\",\n \"0.5629518\",\n \"0.5628191\",\n \"0.5615868\",\n \"0.560862\",\n \"0.56066746\",\n \"0.56024617\",\n \"0.55752665\",\n \"0.5557112\",\n \"0.5553645\",\n \"0.5530039\",\n \"0.55238134\",\n \"0.55227566\",\n \"0.5506542\",\n \"0.548853\",\n \"0.54769737\",\n \"0.54720235\",\n \"0.5460816\",\n \"0.5433414\",\n \"0.54315597\",\n \"0.5429698\",\n \"0.5423063\",\n \"0.5417632\",\n \"0.54170835\",\n \"0.54163283\",\n \"0.54158217\",\n \"0.54091567\",\n \"0.538903\",\n \"0.53675133\",\n \"0.5362096\",\n \"0.53612256\",\n \"0.53593856\",\n \"0.5356899\",\n \"0.5353848\",\n \"0.5350605\",\n \"0.53496027\",\n \"0.5349367\",\n \"0.5331807\",\n \"0.5323824\",\n \"0.5316089\",\n \"0.53157616\",\n \"0.5315325\",\n \"0.53103894\",\n \"0.5306329\",\n \"0.53048944\",\n \"0.52937984\",\n \"0.5288532\",\n \"0.52840537\",\n \"0.5283257\",\n \"0.5283257\",\n \"0.5267216\",\n \"0.5260384\",\n \"0.52592754\",\n \"0.52590483\",\n \"0.5257478\",\n \"0.5254974\",\n \"0.52533257\",\n \"0.5253218\",\n \"0.5250494\",\n \"0.5236827\",\n \"0.522828\",\n \"0.522713\",\n \"0.52253157\",\n \"0.5220617\",\n \"0.5220617\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.55151886"},"document_rank":{"kind":"string","value":"48"}}},{"rowIdx":995,"cells":{"query":{"kind":"string","value":"/ Calls the Eval method for unary functions and passes in the receiver, current item and current context."},"document":{"kind":"string","value":"func (this *ObjectLength) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.UnaryEval(this, item, context)\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func (fn NoArgFunc) Eval(ctx *Context, r Row) (interface{}, error) {\n\treturn fn.Logic(ctx, r)\n}","func (bp *BinaryPlus) Eval() float64 {\n\treturn bp.left.(Eval).Eval() + bp.right.(Eval).Eval()\n}","func (ast *Unary) Eval(env *Env, ctx *Codegen, gen *ssa.Generator) (\n\tssa.Value, bool, error) {\n\texpr, ok, err := ast.Expr.Eval(env, ctx, gen)\n\tif err != nil || !ok {\n\t\treturn ssa.Undefined, ok, err\n\t}\n\tswitch val := expr.ConstValue.(type) {\n\tcase bool:\n\t\tswitch ast.Type {\n\t\tcase UnaryNot:\n\t\t\treturn gen.Constant(!val, types.Bool), true, nil\n\t\tdefault:\n\t\t\treturn ssa.Undefined, false, ctx.Errorf(ast.Expr,\n\t\t\t\t\"invalid unary expression: %s%T\", ast.Type, val)\n\t\t}\n\tcase int32:\n\t\tswitch ast.Type {\n\t\tcase UnaryMinus:\n\t\t\treturn gen.Constant(-val, types.Int32), true, nil\n\t\tdefault:\n\t\t\treturn ssa.Undefined, false, ctx.Errorf(ast.Expr,\n\t\t\t\t\"Unary.Eval: '%s%T' not implemented yet\", ast.Type, val)\n\t\t}\n\tdefault:\n\t\treturn ssa.Undefined, false, ctx.Errorf(ast.Expr,\n\t\t\t\"invalid value %s%T\", ast.Type, val)\n\t}\n}","func Eval(ctx context.Context, e Expr, vs Values) (interface{}, error) {\r\n\tfn, err := FuncOf(ctx, e, vs)\r\n\tif err != nil {\r\n\t\treturn nil, err\r\n\t}\r\n\treturn fn.Call(ctx, vs)\r\n}","func (f *function) Eval(a *Apl) (Value, error) {\n\tvar err error\n\tvar l, r Value\n\n\t// The right argument must be evaluated first.\n\t// Otherwise this A←1⋄A+(A←2) evaluates to 3,\n\t// but it should evaluate to 4.\n\tr, err = f.right.Eval(a)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif f.left != nil {\n\n\t\t// Special case for modified assignments.\n\t\t// Defer evaluation of the left argument.\n\t\tif d, ok := f.Function.(*derived); ok && d.op == \"←\" {\n\t\t\tl = assignment{f.left}\n\t\t} else {\n\t\t\tl, err = f.left.Eval(a)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t}\n\n\t// Special case: the last function in a selective assignment uses Select instead of Call.\n\tif _, ok := f.right.(numVar); ok && f.selection {\n\t\tif d, ok := f.Function.(*derived); ok == true {\n\t\t\treturn d.Select(a, l, r)\n\t\t} else if p, ok := f.Function.(Primitive); ok == false {\n\t\t\treturn nil, fmt.Errorf(\"cannot use %T in selective assignment\", f.Function)\n\t\t} else {\n\t\t\treturn p.Select(a, l, r)\n\t\t}\n\t}\n\treturn f.Function.Call(a, l, r)\n}","func Eval(txApp *sysl.Application, assign Scope, e *sysl.Expr) *sysl.Value {\n\tswitch x := e.Expr.(type) {\n\tcase *sysl.Expr_Transform_:\n\t\treturn evalTransform(txApp, assign, x, e)\n\tcase *sysl.Expr_Binexpr:\n\t\treturn evalBinExpr(txApp, assign, x.Binexpr)\n\tcase *sysl.Expr_Call_:\n\t\treturn evalCall(txApp, assign, x)\n\tcase *sysl.Expr_Name:\n\t\treturn evalName(assign, x)\n\tcase *sysl.Expr_GetAttr_:\n\t\treturn evalGetAttr(txApp, assign, x)\n\tcase *sysl.Expr_Ifelse:\n\t\treturn evalIfelse(txApp, assign, x)\n\tcase *sysl.Expr_Literal:\n\t\treturn x.Literal\n\tcase *sysl.Expr_Set:\n\t\treturn evalSet(txApp, assign, x)\n\tcase *sysl.Expr_List_:\n\t\treturn evalList(txApp, assign, x)\n\tcase *sysl.Expr_Unexpr:\n\t\treturn evalUnaryFunc(x.Unexpr.Op, Eval(txApp, assign, x.Unexpr.Arg))\n\tdefault:\n\t\tlogrus.Warnf(\"Skipping Expr of type %T\\n\", x)\n\t\treturn nil\n\t}\n}","func (op *OpMinus) Eval(x, y float32) float32 {\n\treturn op.LeftChild.Eval(x, y) - op.RightChild.Eval(x, y)\n}","func (op *OpPlus) Eval(x, y float32) float32 {\n\treturn op.LeftChild.Eval(x, y) + op.RightChild.Eval(x, y)\n}","func (op *OpPlus) Eval(x, y float32) float32 {\n\treturn op.LeftChild.Eval(x, y) + op.RightChild.Eval(x, y)\n}","func (e *Exp) Eval() float64 {\n\te.init()\n\tresult, _ := e.eval(e.opTree)\n\treturn result\n}","func (f *FunctionLike) Eval(env types.Env) (types.Expr, error) {\n\treturn nil, fmt.Errorf(\"interpreterTypes.FunctionLike: cannot eval a function-like: %s\", f)\n}","func (form *Form) Eval(scope Scope, args ...interface{}) interface{} {\n\treturn form.Fn(scope, args...)\n}","func (op *OpX) Eval(x, y float32) float32 {\n\treturn x\n}","func (op *OpX) Eval(x, y float32) float32 {\n\treturn x\n}","func ExampleEval() {\n\tfmt.Println(Eval(\"5\"))\n\tfmt.Println(Eval(\"1 + 2\"))\n\tfmt.Println(Eval(\"1 - 2 + 3\"))\n\tfmt.Println(Eval(\"3 * ( 3 + 1 * 3 ) / 2\"))\n\tfmt.Println(Eval(\"3 * ( ( 3 + 1 ) * 3 ) / 2\"))\n\t//OutPut:\n\t//5\n\t//3\n\t//2\n\t//9\n\t//18\n}","func (this *ObjectUnwrap) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.UnaryEval(this, item, context)\n}","func (rt *invalidRuntime) Eval(vs parser.Scope, is map[string]interface{}, tid uint64) (interface{}, error) {\n\t_, err := rt.baseRuntime.Eval(vs, is, tid)\n\tif err == nil {\n\t\terr = rt.erp.NewRuntimeError(util.ErrInvalidConstruct, fmt.Sprintf(\"Unknown node: %s\", rt.node.Name), rt.node)\n\t}\n\treturn nil, err\n}","func (this *Not) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.UnaryEval(this, item, context)\n}","func (rt *voidRuntime) Eval(vs parser.Scope, is map[string]interface{}, tid uint64) (interface{}, error) {\n\treturn rt.baseRuntime.Eval(vs, is, tid)\n}","func (le ListExpr) Eval(scope Scope) (interface{}, error) {\n\tif len(le.List) == 0 {\n\t\treturn le.List, nil\n\t}\n\n\tval, err := le.List[0].Eval(scope)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif macroFn, ok := val.(MacroFunc); ok {\n\t\tvar name string\n\t\tif sym, ok := le.List[0].(SymbolExpr); ok {\n\t\t\tname = sym.Symbol\n\t\t}\n\t\treturn macroFn(scope, name, le.List[1:])\n\t}\n\n\targs := []interface{}{}\n\tfor i := 1; i < len(le.List); i++ {\n\t\targ, err := le.List[i].Eval(scope)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\targs = append(args, arg)\n\t}\n\n\tif scopedFn, ok := val.(ScopedFunc); ok {\n\t\treturn scopedFn(scope, args...)\n\t}\n\n\treturn reflection.Call(val, args...)\n}","func (o Nil) Eval(*Vm) (Object, error) { return o, nil }","func Eval(node ast.Node, env *object.Environment, stop <-chan struct{}) object.Object {\n\tselect {\n\tcase <-stop:\n\t\treturn ConstNil\n\tdefault:\n\t}\n\n\tswitch node := node.(type) {\n\t// statements\n\tcase *ast.Program:\n\t\treturn evalProgram(node, env, stop)\n\tcase *ast.LetStatement:\n\t\tval := Eval(node.Value, env, stop)\n\t\tif isError(val) {\n\t\t\treturn val\n\t\t}\n\t\tenv.Set(node.Name.Value, val)\n\tcase *ast.ReturnStatement:\n\t\tval := Eval(node.Value, env, stop)\n\t\tif isError(val) {\n\t\t\treturn val\n\t\t}\n\t\treturn &object.ReturnValue{Value: val}\n\tcase *ast.BlockStatement:\n\t\treturn evalBlockStatement(node, env, stop)\n\tcase *ast.ExpressionStatement:\n\t\treturn Eval(node.Expression, env, stop)\n\n\t\t// expressions\n\tcase *ast.PrefixExpression:\n\t\tright := Eval(node.Right, env, stop)\n\t\tif isError(right) {\n\t\t\treturn right\n\t\t}\n\t\treturn evalPrefixExpr(node.Token, right)\n\tcase *ast.InfixExpression:\n\t\tif node.Operator == token.Assign {\n\t\t\treturn evalAssign(node, env, stop)\n\t\t}\n\n\t\tleft := Eval(node.Left, env, stop)\n\t\tif isError(left) {\n\t\t\treturn left\n\t\t}\n\t\tright := Eval(node.Right, env, stop)\n\t\tif isError(right) {\n\t\t\treturn right\n\t\t}\n\t\treturn evalInfixExpr(node.Token, left, right)\n\tcase *ast.IndexExpression:\n\t\tleft := Eval(node.Left, env, stop)\n\t\tif isError(left) {\n\t\t\treturn left\n\t\t}\n\n\t\tindex := Eval(node.Index, env, stop)\n\t\tif isError(index) {\n\t\t\treturn index\n\t\t}\n\t\treturn evalIndexExpr(node.Token, left, index)\n\tcase *ast.IfExpression:\n\t\treturn evalIfExpr(node, env, stop)\n\tcase *ast.WhileExpression:\n\t\treturn evalWhileExpr(node, env, stop)\n\tcase *ast.CallExpression:\n\t\tfunction := Eval(node.Func, env, stop)\n\t\tif isError(function) {\n\t\t\treturn function\n\t\t}\n\n\t\targs, err := evalExpressions(node.Args, env, stop)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\treturn doFunction(node.Token, function, args, stop)\n\n\t\t// literals\n\tcase *ast.IntegerLiteral:\n\t\treturn &object.Integer{Value: node.Value}\n\tcase *ast.FloatLiteral:\n\t\treturn &object.Float{Value: node.Value}\n\tcase *ast.BooleanLiteral:\n\t\treturn boolToBoolean(node.Value)\n\tcase *ast.NilLiteral:\n\t\treturn ConstNil\n\tcase *ast.FunctionLiteral:\n\t\treturn &object.Function{Params: node.Params, Body: node.Body, Env: env}\n\tcase *ast.StringLiteral:\n\t\treturn &object.String{Value: node.Value}\n\tcase *ast.ArrayLiteral:\n\t\telems, err := evalExpressions(node.Elements, env, stop)\n\t\tif len(elems) == 1 && err != nil {\n\t\t\treturn err\n\t\t}\n\t\treturn &object.Array{Elements: elems}\n\tcase *ast.Identifier:\n\t\treturn evalIdentifier(node, env)\n\tcase *ast.AccessIdentifier:\n\t\treturn evalAccessIdentifier(node, env)\n\t}\n\treturn nil\n}","func (inst *hiddenInstance) Eval(expr ast.Expr) Value {\n\tv := inst.Value()\n\treturn v.Context().BuildExpr(expr, Scope(v), InferBuiltins(true))\n}","func (a *AddActivity) Eval(context activity.Context) (done bool, err error) {\n\n\t//mv := context.GetInput(ivMessage)\n\tnum1, _ := context.GetInput(ivNum1).(int)\n\tnum2, _ := context.GetInput(ivNum2).(int)\n\n\tactivityLog.Info(fmt.Sprintf(\"Num1: %d, Num2: %d\", num1, num2))\n\tactivityLog.Info(fmt.Sprintf(\"Addition is : %d\", num1+num2))\n\tcontext.SetOutput(ovAddition, num1+num2)\n\n\treturn true, nil\n}","func (o Args) Eval(*Vm) (Object, error) { return o, nil }","func (n *NotLikeOp) Evaluate(left, right EvalResult) (EvalResult, error) {\n\tpanic(\"implement me\")\n}","func eval(list []*Item) int {\n\n\tvar stack *Item\n\n\tfor _, node := range list {\n\n\t\tif node.Typ == Number {\n\t\t\tstack = stack.Push(node)\n\t\t\tcontinue\n\t\t}\n\n\t\tvar left, right *Item\n\n\t\tstack, right = stack.Pop()\n\t\tstack, left = stack.Pop()\n\n\t\tvar val int\n\t\tswitch node.Operation {\n\t\tcase \"+\":\n\t\t\tval = left.Value + right.Value\n\t\tcase \"-\":\n\t\t\tval = left.Value - right.Value\n\t\tcase \"/\":\n\t\t\t// Watch for div-by-zero\n\t\t\tval = left.Value / right.Value\n\t\tcase \"*\":\n\t\t\tval = left.Value * right.Value\n\t\t}\n\t\tstack = stack.Push(&Item{Typ: Number, Value: val})\n\t}\n\n\treturn stack.Value\n}","func (e *BinExpr) Eval(ctx context.Context, local Scope) (_ Value, err error) {\n\ta, err := e.a.Eval(ctx, local)\n\tif err != nil {\n\t\treturn nil, WrapContextErr(err, e, local)\n\t}\n\n\tb, err := e.b.Eval(ctx, local)\n\tif err != nil {\n\t\treturn nil, WrapContextErr(err, e, local)\n\t}\n\tval, err := e.eval(ctx, a, b, local)\n\tif err != nil {\n\t\treturn nil, WrapContextErr(err, e, local)\n\t}\n\treturn val, nil\n}","func (m *Message) Eval(vm *VM, locals Interface) (result Interface) {\n\treturn m.Send(vm, locals, locals)\n}","func eval(sc *scope, e sexpr) sexpr {\n\te = transform(sc, e)\n\tswitch e := e.(type) {\n\tcase cons: // a function to evaluate\n\t\tcons := e\n\t\tcar := eval(sc, cons.car)\n\t\tif !isFunction(car) && !isPrimitive(car) {\n\t\t\tpanic(\"Attempted application on non-function\")\n\t\t}\n\t\tcdr := cons.cdr\n\t\targs := flatten(cdr)\n\t\tif isPrimitive(car) {\n\t\t\treturn (car.(primitive))(sc, args)\n\t\t}\n\t\tf := car.(function)\n\t\t// This is a function - evaluate all arguments\n\t\tfor i, a := range args {\n\t\t\targs[i] = eval(sc, a)\n\t\t}\n\t\treturn f(sc, args)\n\tcase sym:\n\t\treturn sc.lookup(e)\n\t}\n\treturn e\n}","func (p *Qlang) Eval(expr string) (err error) {\n\n\treturn p.Exec([]byte(expr), \"\")\n}","func (mr *MockExpressionNodeMockRecorder) Eval() *gomock.Call {\n\tmr.mock.ctrl.T.Helper()\n\treturn mr.mock.ctrl.RecordCallWithMethodType(mr.mock, \"Eval\", reflect.TypeOf((*MockExpressionNode)(nil).Eval))\n}","func (this *Self) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn item, nil\n}","func (n *NotInOp) Evaluate(left, right EvalResult) (EvalResult, error) {\n\tpanic(\"implement me\")\n}","func (f *Function) Eval(inputs ...interface{}) (args.Const, error) {\n\tlenInputs := len(inputs)\n\tif lenInputs != f.numVars {\n\t\treturn nil, errors.New(\"Number of inputs is not equal to the number of variables in function\")\n\t}\n\n\tvar operand1 args.Const\n\tvar operand2 args.Const\n\tvar operandStack []args.Const\n\n\ti := 0\n\tfor i < len(f.Args) {\n\t\tif f.typeInput(i) == args.Constant || f.typeInput(i) == args.Variable {\n\t\t\tvariable, err := f.getVar(i)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\n\t\t\tif lenInputs != 0 {\n\t\t\t\toperand, err := variable.Eval(inputs[f.varNum[variable]])\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\n\t\t\t\toperandStack = append(operandStack, operand)\n\t\t\t} else {\n\t\t\t\t// If length inputs is 0, then all variables must be constant.\n\t\t\t\t// This code assumes variable is a constant and so uses 0 as an input\n\t\t\t\t// to MustEval as it will never fail as the input does not matter for constants\n\t\t\t\toperandStack = append(operandStack, variable.MustEval(0))\n\t\t\t}\n\t\t} else if f.typeInput(i) == args.Operation {\n\t\t\toperation, err := f.getOp(i)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\n\t\t\tif h, ok := unaryFuncs[operation]; ok {\n\t\t\t\tif len(operandStack) == 0 {\n\t\t\t\t\treturn nil, errors.New(\"Not enough operands\")\n\t\t\t\t}\n\n\t\t\t\toperand1, operandStack = operandStack[len(operandStack)-1], operandStack[:len(operandStack)-1]\n\t\t\t\tresult, err := h(operand1)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\n\t\t\t\toperandStack = append(operandStack, result)\n\t\t\t} else if h, ok := binaryFuncs[operation]; ok {\n\t\t\t\tif len(operandStack) < 2 {\n\t\t\t\t\treturn nil, errors.New(\"Not enough operands\")\n\t\t\t\t}\n\n\t\t\t\toperand2, operandStack = operandStack[len(operandStack)-1], operandStack[:len(operandStack)-1]\n\t\t\t\toperand1, operandStack = operandStack[len(operandStack)-1], operandStack[:len(operandStack)-1]\n\t\t\t\tresult, err := h(operand1, operand2)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\n\t\t\t\toperandStack = append(operandStack, result)\n\t\t\t} else {\n\t\t\t\treturn nil, errors.New(\"Operation not supported\")\n\t\t\t}\n\t\t}\n\t\ti++\n\t}\n\n\tif len(operandStack) > 1 {\n\t\treturn nil, errors.New(\"To many operands left over after calculation\")\n\t}\n\n\treturn operandStack[0], nil\n}","func (op *OpSine) Eval(x, y float32) float32 {\n\treturn float32(math.Sin(float64(op.Child.Eval(x, y))))\n}","func (b *Builder) Eval(desc string, f predicate.TransformFunc) *Builder {\n\tb.p.RegisterTransformation(impl.Eval(desc, f))\n\treturn b\n}","func (e *Evaluator) Eval(expr string) (interface{}, error) {\n\tn := e.n.Copy()\n\t_expr, err := xpath.Compile(expr)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"expr cannot compile: %w\", err)\n\t}\n\n\tv := _expr.Evaluate(n)\n\tswitch v := v.(type) {\n\tcase *xpath.NodeIterator:\n\t\tns := nodes(v)\n\t\tvs := make([]interface{}, 0, len(ns))\n\t\tfor i := range ns {\n\t\t\tswitch n := ns[i].(type) {\n\t\t\tcase attr:\n\t\t\t\tvs = append(vs, n.val)\n\t\t\t}\n\t\t}\n\t\tif len(vs) == len(ns) {\n\t\t\treturn vs, nil\n\t\t}\n\t\treturn ns, nil\n\t}\n\n\treturn v, nil\n}","func (rt *baseRuntime) Eval(vs parser.Scope, is map[string]interface{}, tid uint64) (interface{}, error) {\n\tvar err error\n\n\terrorutil.AssertTrue(rt.validated, \"Runtime component has not been validated - please call Validate() before Eval()\")\n\n\tif rt.erp.Debugger != nil {\n\t\terr = rt.erp.Debugger.VisitState(rt.node, vs, tid)\n\t\trt.erp.Debugger.SetLockingState(rt.erp.MutexeOwners, rt.erp.MutexLog)\n\t\trt.erp.Debugger.SetThreadPool(rt.erp.Processor.ThreadPool())\n\t}\n\n\treturn nil, err\n}","func (n *NotRegexpOp) Evaluate(left, right EvalResult) (EvalResult, error) {\n\tpanic(\"implement me\")\n}","func (s *Subtraction) Evaluate(left, right EvalResult) (EvalResult, error) {\n\treturn subtractNumericWithError(left, right)\n}","func (this *ObjectValues) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.UnaryEval(this, item, context)\n}","func (this *ObjectValues) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.UnaryEval(this, item, context)\n}","func (c *Context) Eval(script string) (*Value, error) {\n\t// When PHP compiles code with a non-NULL return value expected, it simply\n\t// prepends a `return` call to the code, thus breaking simple scripts that\n\t// would otherwise work. Thus, we need to wrap the code in a closure, and\n\t// call it immediately.\n\ts := C.CString(\"call_user_func(function(){\" + script + \"});\")\n\tdefer C.free(unsafe.Pointer(s))\n\n\tvptr, err := C.context_eval(c.context, s)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"Error executing script '%s' in context\", script)\n\t}\n\n\tval, err := NewValueFromPtr(vptr)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn val, nil\n}","func (f *CallExpression) Evaluate(ctx *Context) Value {\n\tcallable := f.Callable.Evaluate(ctx)\n\n\tif callable.Type == vtVariable {\n\t\tcallable = callable.Evaluate(ctx)\n\t}\n\n\tif callable.isCallable() {\n\t\tnewCtx := NewContext(\"\", nil)\n\t\targs := f.Args.EvaluateAll(ctx)\n\t\treturn callable.callable().Execute(newCtx, &args)\n\t}\n\n\tpanic(NewNotCallableError(callable))\n}","func (lscript *Scripting) Eval(luacmd string, arguments ...interface{}) (*ScriptingReturnValues, error) {\n\targs := asScriptingArgs(arguments...)\n\tlargs := forLua(args)\n\tfor _, larg := range largs {\n\t\tlscript.Push(larg)\n\t}\n\tvar r *ScriptingReturnValues\n\terr := lscript.DoString(luacmd)\n\tif err != nil {\n\t\tT().P(\"script\", \"lua\").Errorf(\"scripting error: %s\", err.Error())\n\t} else {\n\t\tif err == nil {\n\t\t\tT().P(\"lua\", \"eval\").Debugf(\"%d return values on the stack\", lscript.GetTop())\n\t\t\tr = lscript.returnFromScripting(lscript.GetTop()) // return all values on the stack\n\t\t}\n\t}\n\treturn r, err\n}","func (e *binaryExprEvaluator) eval(lhs, rhs interface{}) interface{} {\n\tswitch e.op {\n\tcase ADD:\n\t\treturn lhs.(float64) + rhs.(float64)\n\tcase SUB:\n\t\treturn lhs.(float64) - rhs.(float64)\n\tcase MUL:\n\t\treturn lhs.(float64) * rhs.(float64)\n\tcase DIV:\n\t\trhs := rhs.(float64)\n\t\tif rhs == 0 {\n\t\t\treturn float64(0)\n\t\t}\n\t\treturn lhs.(float64) / rhs\n\tdefault:\n\t\t// TODO: Validate operation & data types.\n\t\tpanic(\"invalid operation: \" + e.op.String())\n\t}\n}","func (p *Qlang) SafeEval(expr string) (err error) {\n\n\treturn p.SafeExec([]byte(expr), \"\")\n}","func Eval(input string, context map[string]interface{}) float64 {\n\tnode, err := Parse(input)\n\tif err != nil {\n\t\tpanic(err)\n\t}\n\texpr := &expression{node, context}\n\treturn expr.eval(expr.ast)\n}","func (op *OpAtan) Eval(x, y float32) float32 {\n\treturn float32(math.Atan(float64(op.Child.Eval(x, y))))\n}","func (op *OpMult) Eval(x, y float32) float32 {\n\treturn op.LeftChild.Eval(x, y) * op.RightChild.Eval(x, y)\n}","func (i *InOp) Evaluate(left, right EvalResult) (EvalResult, error) {\n\tpanic(\"implement me\")\n}","func prepareEvalInfixExp(opfStack, opftStack, opfdStack, argsStack *Stack) {\n\t// current token is function stop\n\tfor opftStack.Peek().(efp.Token) != opfStack.Peek().(efp.Token) {\n\t\t// calculate trigger\n\t\ttopOpt := opftStack.Peek().(efp.Token)\n\t\tif err := calculate(opfdStack, topOpt); err != nil {\n\t\t\targsStack.Peek().(*list.List).PushBack(newErrorFormulaArg(err.Error(), err.Error()))\n\t\t\topftStack.Pop()\n\t\t\tcontinue\n\t\t}\n\t\topftStack.Pop()\n\t}\n\targument := true\n\tif opftStack.Len() > 2 && opfdStack.Len() == 1 {\n\t\ttopOpt := opftStack.Pop()\n\t\tif opftStack.Peek().(efp.Token).TType == efp.TokenTypeOperatorInfix {\n\t\t\targument = false\n\t\t}\n\t\topftStack.Push(topOpt)\n\t}\n\t// push opfd to args\n\tif argument && opfdStack.Len() > 0 {\n\t\targsStack.Peek().(*list.List).PushBack(opfdStack.Pop().(formulaArg))\n\t}\n}","func (e PackageExpr) Eval(_ rel.Scope) (rel.Value, error) {\n\treturn e.a.Eval(stdScope())\n}","func (p *prog) Eval(input any) (v ref.Val, det *EvalDetails, err error) {\n\t// Configure error recovery for unexpected panics during evaluation. Note, the use of named\n\t// return values makes it possible to modify the error response during the recovery\n\t// function.\n\tdefer func() {\n\t\tif r := recover(); r != nil {\n\t\t\tswitch t := r.(type) {\n\t\t\tcase interpreter.EvalCancelledError:\n\t\t\t\terr = t\n\t\t\tdefault:\n\t\t\t\terr = fmt.Errorf(\"internal error: %v\", r)\n\t\t\t}\n\t\t}\n\t}()\n\t// Build a hierarchical activation if there are default vars set.\n\tvar vars interpreter.Activation\n\tswitch v := input.(type) {\n\tcase interpreter.Activation:\n\t\tvars = v\n\tcase map[string]any:\n\t\tvars = activationPool.Setup(v)\n\t\tdefer activationPool.Put(vars)\n\tdefault:\n\t\treturn nil, nil, fmt.Errorf(\"invalid input, wanted Activation or map[string]any, got: (%T)%v\", input, input)\n\t}\n\tif p.defaultVars != nil {\n\t\tvars = interpreter.NewHierarchicalActivation(p.defaultVars, vars)\n\t}\n\tv = p.interpretable.Eval(vars)\n\t// The output of an internal Eval may have a value (`v`) that is a types.Err. This step\n\t// translates the CEL value to a Go error response. This interface does not quite match the\n\t// RPC signature which allows for multiple errors to be returned, but should be sufficient.\n\tif types.IsError(v) {\n\t\terr = v.(*types.Err)\n\t}\n\treturn\n}","func (this *ObjectAdd) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.TernaryEval(this, item, context)\n}","func (op *OpSin) Eval(x, y float32) float32 {\n\treturn float32(math.Sin(float64(op.Child.Eval(x, y))))\n}","func (l *LikeOp) Evaluate(left, right EvalResult) (EvalResult, error) {\n\tpanic(\"implement me\")\n}","func (e *ExpressionAtom) Evaluate(dataContext IDataContext, memory *WorkingMemory) (reflect.Value, error) {\n\tif e.Evaluated == true {\n\t\treturn e.Value, nil\n\t}\n\tif e.Variable != nil {\n\t\tval, err := e.Variable.Evaluate(dataContext, memory)\n\t\tif err != nil {\n\t\t\treturn reflect.Value{}, err\n\t\t}\n\t\te.Value = val\n\t\te.Evaluated = true\n\t\treturn val, err\n\t}\n\tif e.FunctionCall != nil {\n\t\tvalueNode := dataContext.Get(\"DEFUNC\")\n\t\targs, err := e.FunctionCall.EvaluateArgumentList(dataContext, memory)\n\t\tif err != nil {\n\t\t\treturn reflect.Value{}, err\n\t\t}\n\t\tret, err := valueNode.CallFunction(e.FunctionCall.FunctionName, args...)\n\t\tif err != nil {\n\t\t\treturn reflect.Value{}, err\n\t\t}\n\t\te.Value = ret\n\t\te.Evaluated = true\n\t\treturn ret, err\n\t}\n\tpanic(\"should not be reached\")\n}","func (this *ObjectRemove) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.BinaryEval(this, item, context)\n}","func (s *ScriptReal) Eval(c Scripter, keys []string, args ...interface{}) *redis.Cmd {\n\treturn s.script.Eval(c, keys, args...)\n}","func (this *ObjectInnerValues) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.UnaryEval(this, item, context)\n}","func (p Primitive) Eval(a *Apl) (Value, error) {\n\treturn p, nil\n}","func (this *Element) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.BinaryEval(this, item, context)\n}","func (op *OpY) Eval(x, y float32) float32 {\n\treturn y\n}","func (op *OpY) Eval(x, y float32) float32 {\n\treturn y\n}","func (s *String) Eval(_, _ *Scope) (Value, error) {\n\treturn s, nil\n}","func (ev *Evaler) Eval(name, text string, n *parse.Chunk, ports []*Port) error {\n\top, err := ev.Compile(n)\n\tif err != nil {\n\t\treturn err\n\t}\n\tec := NewTopEvalCtx(ev, name, text, ports)\n\treturn ec.PEval(op)\n}","func TestEval(t *testing.T) {\n\tany := `.+`\n\ttestCases := []struct {\n\t\tname string\n\t\tquery string\n\t\twantErr string\n\t\twant []values.Value\n\t}{\n\t\t{\n\t\t\tname: \"string interpolation\",\n\t\t\tquery: `\n\t\t\t\tstr = \"str\"\n\t\t\t\ting = \"ing\"\n\t\t\t\t\"str + ing = ${str+ing}\"`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewString(\"str + ing = string\"),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"string interpolation missing field\",\n\t\t\tquery: `\n\t\t\t\tr = makeRecord(o: {a: \"foo\", b: 42})\n\t\t\t\t\"r._value = ${r._value}\"`,\n\t\t\twantErr: any,\n\t\t},\n\t\t{\n\t\t\tname: \"string interpolation non-string type\",\n\t\t\tquery: `\n\t\t\t\tr = makeRecord(o: {a: \"foo\", b: 42})\n\t\t\t\t\"r._value = ${r.b}\"`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewString(\"r._value = 42\"),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"string interpolation wrong type\",\n\t\t\tquery: `\n\t\t\t\tr = makeRecord(o: {a: \"foo\", b: 42})\n\t\t\t\t\"r = ${r}\"`,\n\t\t\twantErr: any,\n\t\t},\n\t\t{\n\t\t\tname: \"call builtin function\",\n\t\t\tquery: \"six()\",\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewFloat(6.0),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"call function with fail\",\n\t\t\tquery: \"fail()\",\n\t\t\twantErr: any,\n\t\t},\n\t\t{\n\t\t\tname: \"call function with duplicate args\",\n\t\t\tquery: \"plusOne(x:1.0, x:2.0)\",\n\t\t\twantErr: any,\n\t\t},\n\t\t{\n\t\t\tname: \"binary expressions\",\n\t\t\tquery: `\n\t\t\tsix_value = six()\n\t\t\tnine_value = nine()\n\n\t\t\tfortyTwo() == six_value * nine_value\n\t\t\t`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewBool(false),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"logical expressions short circuit\",\n\t\t\tquery: `\n six_value = six()\n nine_value = nine()\n\n not (fortyTwo() == six_value * nine_value) or fail()\n\t\t\t`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewBool(true),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"function\",\n\t\t\tquery: `\n plusSix = (r) => r + six()\n plusSix(r:1.0) == 7.0 or fail()\n\t\t\t`,\n\t\t},\n\t\t{\n\t\t\tname: \"function block\",\n\t\t\tquery: `\n f = (r) => {\n r1 = 1.0 + r\n return (r + r1) / r\n }\n f(r:1.0) == 3.0 or fail()\n\t\t\t`,\n\t\t},\n\t\t{\n\t\t\tname: \"function block polymorphic\",\n\t\t\tquery: `\n f = (r) => {\n r2 = r * r\n return r2 / r\n }\n f(r:2.0) == 2.0 or fail()\n f(r:2) == 2 or fail()\n\t\t\t`,\n\t\t},\n\t\t{\n\t\t\tname: \"function with default param\",\n\t\t\tquery: `\n addN = (r,n=4) => r + n\n addN(r:2) == 6 or fail()\n addN(r:3,n:1) == 4 or fail()\n\t\t\t`,\n\t\t},\n\t\t{\n\t\t\tname: \"scope closing\",\n\t\t\tquery: `\n\t\t\tx = 5\n plusX = (r) => r + x\n plusX(r:2) == 7 or fail()\n\t\t\t`,\n\t\t},\n\t\t{\n\t\t\tname: \"nested scope mutations not visible outside\",\n\t\t\tquery: `\n\t\t\tx = 5\n xinc = () => {\n x = x + 1\n return x\n }\n xinc() == 6 or fail()\n x == 5 or fail()\n\t\t\t`,\n\t\t},\n\t\t// TODO(jsternberg): This test seems to not\n\t\t// infer the type constraints correctly for m.a,\n\t\t// but it doesn't fail.\n\t\t{\n\t\t\tname: \"return map from func\",\n\t\t\tquery: `\n toMap = (a,b) => ({\n a: a,\n b: b,\n })\n m = toMap(a:1, b:false)\n m.a == 1 or fail()\n not m.b or fail()\n\t\t\t`,\n\t\t},\n\t\t{\n\t\t\tname: \"pipe expression\",\n\t\t\tquery: `\n\t\t\tadd = (a=<-,b) => a + b\n\t\t\tone = 1\n\t\t\tone |> add(b:2) == 3 or fail()\n\t\t\t`,\n\t\t},\n\t\t{\n\t\t\tname: \"ignore pipe default\",\n\t\t\tquery: `\n\t\t\tadd = (a=<-,b) => a + b\n\t\t\tadd(a:1, b:2) == 3 or fail()\n\t\t\t`,\n\t\t},\n\t\t{\n\t\t\tname: \"pipe expression function\",\n\t\t\tquery: `\n\t\t\tadd = (a=<-,b) => a + b\n\t\t\tsix() |> add(b:2.0) == 8.0 or fail()\n\t\t\t`,\n\t\t},\n\t\t{\n\t\t\tname: \"pipe builtin function\",\n\t\t\tquery: `\n\t\t\tsix() |> plusOne() == 7.0 or fail()\n\t\t\t`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewBool(true),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"regex match\",\n\t\t\tquery: `\n\t\t\t\"abba\" =~ /^a.*a$/ or fail()\n\t\t\t`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewBool(true),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"regex not match\",\n\t\t\tquery: `\n\t\t\t\"abc\" =~ /^a.*a$/ and fail()\n\t\t\t`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewBool(false),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"not regex match\",\n\t\t\tquery: `\n\t\t\t\"abc\" !~ /^a.*a$/ or fail()\n\t\t\t`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewBool(true),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"not regex not match\",\n\t\t\tquery: `\n\t\t\t\"abba\" !~ /^a.*a$/ and fail()\n\t\t\t`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewBool(false),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"options metadata\",\n\t\t\tquery: `\n\t\t\toption task = {\n\t\t\t\tname: \"foo\",\n\t\t\t\trepeat: 100,\n\t\t\t}\n\t\t\ttask.name == \"foo\" or fail()\n\t\t\ttask.repeat == 100 or fail()\n\t\t\t`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewBool(true),\n\t\t\t\tvalues.NewBool(true),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"query with side effects\",\n\t\t\tquery: `sideEffect() == 0 or fail()`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewInt(0),\n\t\t\t\tvalues.NewBool(true),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"array index expression\",\n\t\t\tquery: `\n\t\t\t\ta = [1, 2, 3]\n\t\t\t\tx = a[1]\n\t\t\t\tx == 2 or fail()\n\t\t\t`,\n\t\t},\n\t\t{\n\t\t\tname: \"dict expression\",\n\t\t\tquery: `\n\t\t\t\tm = [\"a\" + \"b\": 0, \"c\" + \"d\": 1]\n\t\t\t\tx = get(dict: m, key: \"ab\", default: 2)\n\t\t\t\ty = get(dict: m, key: \"cd\", default: 2)\n\t\t\t\tz = get(dict: m, key: \"ef\", default: 2)\n\t\t\t\tx == 0 and y == 1 and z == 2 or fail()\n\t\t\t`,\n\t\t},\n\t\t{\n\t\t\tname: \"empy dictionary\",\n\t\t\tquery: `\n\t\t\t\tm0 = [:]\n\t\t\t\tm1 = insert(dict: m0, key: \"a\", value: 0)\n\t\t\t\tm2 = insert(dict: m0, key: 0, value: \"a\")\n\t\t\t\tv1 = get(dict: m1, key: \"a\", default: -1)\n\t\t\t\tv2 = get(dict: m2, key: 0, default: \"b\")\n\t\t\t\tv1 == 0 and v2 == \"a\" or fail()\n\t\t\t`,\n\t\t},\n\t\t{\n\t\t\tname: \"array index expression out of bounds low\",\n\t\t\tquery: `\n\t\t\t\ta = [1, 2, 3]\n\t\t\t\ti = -1\n\t\t\t\tx = a[i]\n\t\t\t`,\n\t\t\twantErr: any,\n\t\t},\n\t\t{\n\t\t\tname: \"array index expression out of bounds high\",\n\t\t\tquery: `\n\t\t\t\ta = [1, 2, 3]\n\t\t\t\ti = 3\n\t\t\t\tx = a[i]\n\t\t\t`,\n\t\t\twantErr: any,\n\t\t},\n\t\t{\n\t\t\tname: \"array with complex index expression\",\n\t\t\tquery: `\n\t\t\t\tf = () => ({l: 0, m: 1, n: 2})\n\t\t\t\ta = [1, 2, 3]\n\t\t\t\tx = a[f().l]\n\t\t\t\ty = a[f().m]\n\t\t\t\tz = a[f().n]\n\t\t\t\tx == 1 or fail()\n\t\t\t\ty == 2 or fail()\n\t\t\t\tz == 3 or fail()\n\t\t\t`,\n\t\t},\n\t\t{\n\t\t\tname: \"short circuit logical and\",\n\t\t\tquery: `\n false and fail()\n `,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewBool(false),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"short circuit logical or\",\n\t\t\tquery: `\n true or fail()\n `,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewBool(true),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"no short circuit logical and\",\n\t\t\tquery: `\n true and fail()\n `,\n\t\t\twantErr: any,\n\t\t},\n\t\t{\n\t\t\tname: \"no short circuit logical or\",\n\t\t\tquery: `\n false or fail()\n `,\n\t\t\twantErr: any,\n\t\t},\n\t\t{\n\t\t\tname: \"conditional true\",\n\t\t\tquery: `\n\t\t\t\tif 1 != 0 then 10 else 100\n\t\t\t`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewInt(10),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"conditional false\",\n\t\t\tquery: `\n\t\t\t\tif 1 == 0 then 10 else 100\n\t\t\t`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewInt(100),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"conditional in function\",\n\t\t\tquery: `\n\t\t\t\tf = (t, c, a) => if t then c else a\n\t\t\t\t{\n\t\t\t\t\tv1: f(t: false, c: 30, a: 300),\n\t\t\t\t\tv2: f(t: true, c: \"cats\", a: \"dogs\"),\n\t\t\t\t}\n\t\t\t`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewObjectWithValues(map[string]values.Value{\n\t\t\t\t\t\"v1\": values.NewInt(300),\n\t\t\t\t\t\"v2\": values.NewString(\"cats\"),\n\t\t\t\t}),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"exists\",\n\t\t\tquery: `hasValue(o: makeRecord(o: {value: 1}))`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewBool(true),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"exists null\",\n\t\t\tquery: `hasValue(o: makeRecord(o: {val: 2}))`,\n\t\t\twant: []values.Value{\n\t\t\t\tvalues.NewBool(false),\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\tname: \"invalid function parameter\",\n\t\t\tquery: `from(bucket: \"telegraf\") |> window(every: 0s)`,\n\t\t\twantErr: `error calling function \"window\" @\\d+:\\d+-\\d+:\\d+: window function requires at least one of \"every\" or \"period\" to be set and non-zero`,\n\t\t},\n\t\t{\n\t\t\t// tests that we don't nest error messages when\n\t\t\t// a function call fails and gets piped into another\n\t\t\t// function.\n\t\t\tname: \"nested function error\",\n\t\t\tquery: `from(bucket: \"telegraf\") |> window(every: 0s) |> mean()`,\n\t\t\twantErr: `error calling function \"window\" @\\d+:\\d+-\\d+:\\d+: window function requires at least one of \"every\" or \"period\" to be set and non-zero`,\n\t\t},\n\t}\n\n\tfor _, tc := range testCases {\n\t\ttc := tc\n\t\tt.Run(tc.name, func(t *testing.T) {\n\t\t\tsrc := prelude + tc.query\n\n\t\t\tctx, deps := dependency.Inject(context.Background(), dependenciestest.Default())\n\t\t\tdefer deps.Finish()\n\n\t\t\tsideEffects, _, err := runtime.Eval(ctx, src)\n\t\t\tif err != nil {\n\t\t\t\tif tc.wantErr == \"\" {\n\t\t\t\t\tt.Fatalf(\"unexpected error: %s\", err)\n\t\t\t\t}\n\n\t\t\t\t// We expect an error, so it should be a non-internal Flux error.\n\t\t\t\tif code := flux.ErrorCode(err); code == codes.Internal || code == codes.Unknown {\n\t\t\t\t\tt.Errorf(\"expected non-internal error code, got %s\", code)\n\t\t\t\t}\n\n\t\t\t\tre := regexp.MustCompile(tc.wantErr)\n\t\t\t\tif got := err.Error(); !re.MatchString(got) {\n\t\t\t\t\tt.Errorf(\"expected error to match pattern %q, but error was %q\", tc.wantErr, got)\n\t\t\t\t}\n\t\t\t\treturn\n\t\t\t} else if tc.wantErr != \"\" {\n\t\t\t\tt.Fatal(\"expected error\")\n\t\t\t}\n\n\t\t\tvs := getSideEffectsValues(sideEffects)\n\t\t\tif tc.want != nil && !cmp.Equal(tc.want, vs, semantictest.CmpOptions...) {\n\t\t\t\tt.Fatalf(\"unexpected side effect values -want/+got: \\n%s\", cmp.Diff(tc.want, vs, semantictest.CmpOptions...))\n\t\t\t}\n\t\t})\n\t}\n}","func (ev *Evaler) Eval(name, text string, n *parse.Chunk, ports []*Port) error {\n\top, err := ev.Compile(name, text, n)\n\tif err != nil {\n\t\treturn err\n\t}\n\tec := NewTopEvalCtx(ev, name, text, ports)\n\treturn ec.PEval(op)\n}","func (e *Evaluator) Eval(expr *tipb.Expr) (types.Datum, error) {\n\tswitch expr.GetTp() {\n\tcase tipb.ExprType_Null:\n\t\treturn types.Datum{}, nil\n\tcase tipb.ExprType_Int64:\n\t\treturn e.evalInt(expr.Val)\n\tcase tipb.ExprType_Uint64:\n\t\treturn e.evalUint(expr.Val)\n\tcase tipb.ExprType_String:\n\t\treturn e.evalString(expr.Val)\n\tcase tipb.ExprType_Bytes:\n\t\treturn types.NewBytesDatum(expr.Val), nil\n\tcase tipb.ExprType_Float32:\n\t\treturn e.evalFloat(expr.Val, true)\n\tcase tipb.ExprType_Float64:\n\t\treturn e.evalFloat(expr.Val, false)\n\tcase tipb.ExprType_MysqlDecimal:\n\t\treturn e.evalDecimal(expr.Val)\n\tcase tipb.ExprType_MysqlDuration:\n\t\treturn e.evalDuration(expr.Val)\n\tcase tipb.ExprType_ColumnRef:\n\t\treturn e.evalColumnRef(expr.Val)\n\tcase tipb.ExprType_LT:\n\t\treturn e.evalLT(expr)\n\tcase tipb.ExprType_LE:\n\t\treturn e.evalLE(expr)\n\tcase tipb.ExprType_EQ:\n\t\treturn e.evalEQ(expr)\n\tcase tipb.ExprType_NE:\n\t\treturn e.evalNE(expr)\n\tcase tipb.ExprType_GE:\n\t\treturn e.evalGE(expr)\n\tcase tipb.ExprType_GT:\n\t\treturn e.evalGT(expr)\n\tcase tipb.ExprType_NullEQ:\n\t\treturn e.evalNullEQ(expr)\n\tcase tipb.ExprType_And:\n\t\treturn e.evalAnd(expr)\n\tcase tipb.ExprType_Or:\n\t\treturn e.evalOr(expr)\n\tcase tipb.ExprType_Like:\n\t\treturn e.evalLike(expr)\n\tcase tipb.ExprType_Not:\n\t\treturn e.evalNot(expr)\n\tcase tipb.ExprType_In:\n\t\treturn e.evalIn(expr)\n\tcase tipb.ExprType_Plus, tipb.ExprType_Div:\n\t\treturn e.evalArithmetic(expr)\n\t}\n\treturn types.Datum{}, nil\n}","func (this *Mod) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.BinaryEval(this, item, context)\n}","func (this *NowStr) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.Eval(this, item, context)\n}","func (*Base) Unary(p ASTPass, node *ast.Unary, ctx Context) {\n\tp.Visit(p, &node.Expr, ctx)\n}","func (i *IntNode) Eval(m memory.M) dragonscript.Value {\n\treturn dragonscript.Integer(i.value)\n}","func (this *ObjectNames) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.UnaryEval(this, item, context)\n}","func (this *ObjectNames) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.UnaryEval(this, item, context)\n}","func (op *OpDiv) Eval(x, y float32) float32 {\n\treturn op.LeftChild.Eval(x, y) / op.RightChild.Eval(x, y)\n}","func (e *Not) Eval(ctx *sql.Context, row sql.Row) (interface{}, error) {\n\tv, err := e.Child.Eval(ctx, row)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif v == nil {\n\t\treturn nil, nil\n\t}\n\n\treturn !v.(bool), nil\n}","func (l *ListType) eval() Value {\n\treturn l\n}","func eval(x interface{}, env map[string]interface{}) interface{} {\r\n if str, ok := isSymbol(x); ok { // variable reference\r\n\treturn env[str]\r\n }\r\n l, ok := isList(x)\r\n if !ok { // constant literal\r\n\treturn x\r\n }\r\n if len(l) == 0 {\r\n\tpanic(\"empty list\")\r\n }\r\n if str, ok := isSymbol(l[0]); ok {\r\n\tswitch (str) {\r\n\tcase \"quote\": // (quote exp)\r\n\t return l[1]\r\n\tcase \"if\": // (if test conseq alt)\r\n\t test := l[1]\r\n\t conseq := l[2]\r\n\t alt := l[3]\r\n\t r := eval(test, env)\r\n\t if b, ok := isFalse(r); ok && !b {\r\n\t\treturn eval(alt, env)\r\n\t } else {\r\n\t\treturn eval(conseq, env)\r\n\t }\r\n\tcase \"define\": // (define var exp)\r\n\t car := l[1]\r\n\t cdr := l[2]\r\n\t if str, ok = isSymbol(car); ok {\r\n\t\tenv[str] = eval(cdr, env)\r\n\t\treturn env[str]\r\n\t } else {\r\n\t\tpanic(\"define needs a symbol\")\r\n\t }\r\n\tdefault: // (proc arg...)\r\n\t car := eval(l[0], env)\r\n\t proc, ok := car.(func([]interface{})interface{})\r\n\t if !ok {\r\n\t\tpanic(\"not a procedure\")\r\n\t }\r\n args := makeArgs(l[1:], env)\r\n return proc(args)\r\n\t}\r\n }\r\n return nil\r\n}","func (e *Not) Eval(ctx *sql.Context, row sql.Row) (interface{}, error) {\n\tv, err := e.Child.Eval(ctx, row)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif v == nil {\n\t\treturn nil, nil\n\t}\n\n\tb, ok := v.(bool)\n\tif !ok {\n\t\tb, err = types.ConvertToBool(v)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\treturn !b, nil\n}","func (op *OpCos) Eval(x, y float32) float32 {\n\treturn float32(math.Cos(float64(op.Child.Eval(x, y))))\n}","func evaluateExpression(c *Context, exp interface{}) interface{} {\r\n var val interface{}\r\n\r\n // fmt.Printf(\"Evaluating type %T, \\n\", exp)\r\n switch t := exp.(type) {\r\n case int:\r\n // fmt.Printf(\"Returning int %d\\n\", t)\r\n val = t\r\n case *Integer:\r\n val = t.Number\r\n case *StringPrimitive:\r\n val = t.str\r\n case string:\r\n val = t\r\n case []interface{}:\r\n val = t\r\n case *InfixExpression:\r\n // fmt.Printf(\"Evaluating infix expresison %T l: %T, r:%T\\n\", t,t.leftNode.Exp, t.rightNode.Exp)\r\n //Get the value of the left node and right\r\n lVal := evaluateExpression(c, t.leftNode.Exp)\r\n rVal := evaluateExpression(c, t.rightNode.Exp)\r\n\r\n\r\n //then apply the correct infix operator to the values\r\n val = evaluateInfixExpression(c, t.opType, lVal, rVal)\r\n\r\n case *Identifier:\r\n // fmt.Printf(\"Was identifier returning %v\\n\", t.id)\r\n if(t.id == \"nil\") {\r\n val = NewNil(0)\r\n } else {\r\n // fmt.Printf(\"Posssible indeitEifer %T\\n\", c.values[t.id])\r\n val = evaluateExpression(c, c.values[t.id])\r\n }\r\n case *CallExpression:\r\n // fmt.Printf(\"Evaluation call to %s\\n\",t.callee)\r\n\r\n //get declaration of call\r\n callDec := c.lookup(t.callee).(*FuncDeclaration)\r\n if(callDec.returnType == \"\") { //no rreturn type = unit\r\n val = &UnitType{}\r\n } else { //Evaluate the expression of the body for a value\r\n //This should produce a value and will execute all\r\n //of the code of the body as well\r\n for i, _ := range callDec.paramNodes {\r\n paramDec := callDec.paramNodes[i].Exp.(*Param)\r\n paramValue := t.paramNodes[i].Exp\r\n c.values[paramDec.id] = evaluateExpression(c, paramValue)\r\n val = c.values[paramDec.id]\r\n }\r\n\r\n }\r\n\r\n if(t.callee == \"printi\") {\r\n invokePrintI(c, t)\r\n } else if(t.callee == \"print\") {\r\n invokePrint(c, t)\r\n } else if(t.callee == \"not\") {\r\n invokeNot(c, t)\r\n } else { //Regular other user defined function do your thing!\r\n //invoke the body\r\n //Get the declaration of the calling function so we can execute it\r\n callDec := c.lookup(t.callee).(*FuncDeclaration)\r\n // fmt.Printf(\"Invoking random func \\n\")\r\n evaluateExpression(c, callDec.body.Exp)\r\n }\r\n case *IfThenElseExpression:\r\n condition := evaluateExpression(c, t.condNode.Exp).(bool)\r\n // fmt.Printf(\"Cond was %v \\n\", condition)\r\n //If else is nil then its an IfThen Exp\r\n if(t.elseNode == nil) {\r\n val = &UnitType{}\r\n if(condition) { //if the condition is true evaluatie the code inside\r\n evaluateExpression(c, t.thenNode.Exp)\r\n }\r\n } else { //otherwise its and ifThenElse\r\n if(condition) {\r\n val = evaluateExpression(c, t.thenNode.Exp)\r\n } else {\r\n val = evaluateExpression(c, t.elseNode.Exp)\r\n }\r\n }\r\n case *SeqExpression:\r\n // Value is equivalent to the last node of the seqence expression\r\n if(len(t.nodes) == 0) {\r\n val = &UnitType{}\r\n } else {\r\n // fmt.Printf(\"Seq type was %T\\n\", t.nodes[len(t.nodes)-1].Exp)\r\n val = evaluateExpression(c, t.nodes[len(t.nodes)-1].Exp)\r\n }\r\n case *Nil:\r\n val = NewNil(0)\r\n case *ArrayExp:\r\n arrType := getType(c, c.lookup(t.typeId)).(*Identifier)\r\n val = c.lookup(arrType.id)\r\n case *ForExpression:\r\n val = &UnitType{}\r\n case *LetExpression:\r\n if(len(t.exps) == 0) {\r\n val = &UnitType{}\r\n } else {\r\n // fmt.Printf(\"%T is last exp type\\n\", t.exps[len(t.exps)-1].Exp)\r\n // val = getType(c, t.exps[len(t.exps)-1].Exp)\r\n }\r\n case *Assignment:\r\n val = &UnitType{}\r\n case *RecordExp:\r\n var slc []interface{}\r\n for _, fcNode := range t.fieldCreateNodes {\r\n if b, isABinding := fcNode.Exp.(*Binding); isABinding {\r\n slc = append(slc, evaluateExpression(c, b.exp.Exp))\r\n }\r\n }\r\n val = slc\r\n default:\r\n fmt.Fprintf(os.Stderr, \"Could not evaluate exp %T\\n\", t)\r\n os.Exit(4)\r\n }\r\n\r\n return val\r\n}","func (da *DateArith) Eval(ctx context.Context, args map[interface{}]interface{}) (interface{}, error) {\n\tt, years, months, days, durations, err := da.evalArgs(ctx, args)\n\tif t.IsZero() || err != nil {\n\t\treturn nil, errors.Trace(err)\n\t}\n\n\tif !da.isAdd() {\n\t\tyears, months, days, durations = -years, -months, -days, -durations\n\t}\n\tt.Time = t.Time.Add(durations)\n\tt.Time = t.Time.AddDate(int(years), int(months), int(days))\n\n\t// \"2011-11-11 10:10:20.000000\" outputs \"2011-11-11 10:10:20\".\n\tif t.Time.Nanosecond() == 0 {\n\t\tt.Fsp = 0\n\t}\n\n\treturn t, nil\n}","func Eval(node ast.Node, env *object.Environment) object.Object {\n\tswitch node := node.(type) {\n\n\t// Statements\n\tcase *ast.RootNode:\n\t\treturn evalRootNode(node, env)\n\n\tcase *ast.BlockStatement:\n\t\treturn evalBlockStmt(node, env)\n\n\tcase *ast.ExpressionStatement:\n\t\treturn Eval(node.Expression, env)\n\n\tcase *ast.ReturnStatement:\n\t\tval := Eval(node.ReturnValue, env)\n\t\tif isError(val) {\n\t\t\treturn val\n\t\t}\n\t\treturn &object.ReturnValue{Value: val}\n\n\tcase *ast.LetStatement:\n\t\tval := Eval(node.Value, env)\n\t\tif isError(val) {\n\t\t\treturn val\n\t\t}\n\t\tenv.Set(node.Name.Value, val)\n\n\tcase *ast.ConstStatement:\n\t\tval := Eval(node.Value, env)\n\t\tif isError(val) {\n\t\t\treturn val\n\t\t}\n\t\tenv.Set(node.Name.Value, val)\n\n\t// Expressions\n\tcase *ast.IntegerLiteral:\n\t\treturn &object.Integer{Value: node.Value}\n\n\tcase *ast.StringLiteral:\n\t\treturn &object.String{Value: node.Value}\n\n\tcase *ast.Boolean:\n\t\treturn nativeBoolToBooleanObj(node.Value)\n\n\tcase *ast.PrefixExpression:\n\t\tright := Eval(node.Right, env)\n\t\tif isError(right) {\n\t\t\treturn right\n\t\t}\n\t\treturn evalPrefixExpr(node.Operator, right, node.Token.Line)\n\n\tcase *ast.InfixExpression:\n\t\tleft := Eval(node.Left, env)\n\t\tif isError(left) {\n\t\t\treturn left\n\t\t}\n\t\tright := Eval(node.Right, env)\n\t\tif isError(right) {\n\t\t\treturn right\n\t\t}\n\t\treturn evalInfixExpr(node.Operator, left, right, node.Token.Line)\n\n\tcase *ast.PostfixExpression:\n\t\treturn evalPostfixExpr(env, node.Operator, node)\n\n\tcase *ast.IfExpression:\n\t\treturn evalIfExpr(node, env)\n\n\tcase *ast.Identifier:\n\t\treturn evalIdentifier(node, env)\n\n\tcase *ast.FunctionLiteral:\n\t\tparams := node.Parameters\n\t\tbody := node.Body\n\t\treturn &object.Function{\n\t\t\tParameters: params,\n\t\t\tBody: body,\n\t\t\tEnv: env,\n\t\t}\n\n\tcase *ast.CallExpression:\n\t\tfn := Eval(node.Function, env)\n\t\tif isError(fn) {\n\t\t\treturn fn\n\t\t}\n\t\targs := evalExprs(node.Arguments, env)\n\t\tif len(args) == 1 && isError(args[0]) {\n\t\t\treturn args[0]\n\t\t}\n\t\treturn applyFunction(fn, args, node.Token.Line)\n\n\tcase *ast.ArrayLiteral:\n\t\telements := evalExprs(node.Elements, env)\n\t\tif len(elements) == 1 && isError(elements[0]) {\n\t\t\treturn elements[0]\n\t\t}\n\t\treturn &object.Array{Elements: elements}\n\n\tcase *ast.IndexExpression:\n\t\tleft := Eval(node.Left, env)\n\t\tif isError(left) {\n\t\t\treturn left\n\t\t}\n\t\tindex := Eval(node.Index, env)\n\t\tif isError(index) {\n\t\t\treturn index\n\t\t}\n\t\treturn evalIndexExpr(left, index, node.Token.Line)\n\n\tcase *ast.HashLiteral:\n\t\treturn evalHashLiteral(node, env)\n\t}\n\n\treturn nil\n}","func Evaluate(item interface{}, passedContext interface{}) map[string]float64 {\n\t//fmt.Fprintf(os.Stderr, \"eval:: %v %T\\n\", item, item)\n\n\tif item != nil {\n\t\tswitch passedContext.(type) {\n\t\tcase *DimContext:\n\t\t\t{\n\t\t\t\t//fmt.Fprintf(os.Stderr, \"here before processMember %v\\n\", item)\n\t\t\t\tprocessMember(item, passedContext)\n\t\t\t\t//fmt.Fprintf(os.Stderr, \"here after processMember %v %T\\n\", item, item)\n\t\t\t}\n\t\t}\n\t\tswitch v := item.(type) {\n\t\tcase hasResults:\n\t\t\t{\n\t\t\t\treturn v.Results()\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}","func (sf *ScalarFunction) Eval(row chunk.Row) (d types.Datum, err error) {\n\tvar (\n\t\tres interface{}\n\t\tisNull bool\n\t)\n\tswitch tp, evalType := sf.GetType(), sf.GetType().EvalType(); evalType {\n\tcase types.ETInt:\n\t\tvar intRes int64\n\t\tintRes, isNull, err = sf.EvalInt(sf.GetCtx(), row)\n\t\tif mysql.HasUnsignedFlag(tp.Flag) {\n\t\t\tres = uint64(intRes)\n\t\t} else {\n\t\t\tres = intRes\n\t\t}\n\tcase types.ETString:\n\t\tres, isNull, err = sf.EvalString(sf.GetCtx(), row)\n\t}\n\n\tif isNull || err != nil {\n\t\td.SetNull()\n\t\treturn d, err\n\t}\n\td.SetValue(res, sf.RetType)\n\treturn\n}","func (s server) Eval(ctx context.Context, req *entity.Request) (*entity.Result, error) {\n\tlog.Printf(\"Received a request: %+v\\n\", req)\n\tresult := &entity.Result{}\n\tres, err := s.usecase.Eval(req.Value)\n\tif err != nil {\n\t\treturn result, err\n\t}\n\tresult.Value = strconv.FormatFloat(res, 'G', -1, 64)\n\treturn result, nil\n}","func execEval(_ int, p *gop.Context) {\n\targs := p.GetArgs(4)\n\tret, ret1 := types.Eval(args[0].(*token.FileSet), args[1].(*types.Package), token.Pos(args[2].(int)), args[3].(string))\n\tp.Ret(4, ret, ret1)\n}","func (p Polynomial) Eval(arg int) ed25519.Scalar {\n\tx := ed25519.New_scalar(*big.NewInt(int64(arg)))\n\tresult := p.coeffs[0].Add(p.coeffs[1].Mul(x))\n\tx_pow := x.Copy()\n\tfor i := 2; i < len(p.coeffs); i++ {\n\t\tx_pow = x_pow.Mul(x)\n\t\tresult = result.Add(p.coeffs[i].Mul(x_pow))\n\t}\n\treturn result\n}","func (s Scope) Eval(ctx context.Context, local Scope) (Value, error) {\n\ttuple := NewTuple()\n\tfor e := s.Enumerator(); e.MoveNext(); {\n\t\tname, expr := e.Current()\n\t\tvalue, err := expr.Eval(ctx, local)\n\t\tif err != nil {\n\t\t\treturn nil, WrapContextErr(err, expr, local)\n\t\t}\n\t\ttuple = tuple.With(name, value)\n\t}\n\treturn tuple, nil\n}","func (t *Check) Eval(r, s string) (bool, error) {\n\treturn false, errors.New(\"Not implemented\")\n}","func (r *Rule) Eval(devices *devices.List, rules map[string]bool) (bool, error) {\n\treturn eval(r.Expression(), devices, rules, r.ast)\n}","func lvalCall(e *LEnv, f *LVal, a *LVal) *LVal {\n\t//If it is a builtin function, return the result of running that function\n\tif f.Builtin != nil {\n\t\treturn f.Builtin(e, a)\n\t}\n\n\t//Bind the arguments that were passed into the function\n\tfor len(a.Cell) > 0 {\n\t\tif len(f.Formals.Cell) == 0 {\n\t\t\treturn lvalErr(\"Function passed too many arguments\")\n\t\t}\n\n\t\tsym := lvalPop(f.Formals, 0)\n\n\t\tif sym.Sym == \"&\" {\n\t\t\tif len(f.Formals.Cell) != 1 {\n\t\t\t\treturn lvalErr(\"Symbol & not followed by a single symbol.\")\n\t\t\t}\n\n\t\t\tnsym := lvalPop(f.Formals, 0)\n\t\t\tlenvPut(f.Env, nsym, builtinList(e, a))\n\t\t}\n\n\t\tval := lvalPop(a, 0)\n\n\t\tlenvPut(f.Env, sym, val)\n\t}\n\n\tif len(f.Formals.Cell) == 0 {\n\t\tf.Env.Par = e\n\n\t\treturn builtinEval(f.Env, lvalAdd(lvalSexpr(), lvalCopy(f.Body)))\n\t} else {\n\t\treturn lvalCopy(f)\n\t}\n}","func unary(typ int, op string, od1 *expr) *expr {\n\treturn &expr{\n\t\tsexp: append(exprlist{atomic(typ, op)}, od1),\n\t}\n}","func (f UnFunc) Apply(ctx context.Context, data interface{}) (interface{}, error) {\n\treturn f(ctx, data)\n}","func (ev *evaluator) eval(expr Expr) model.Value {\n\t// This is the top-level evaluation method.\n\t// Thus, we check for timeout/cancellation here.\n\tif err := contextDone(ev.ctx, \"expression evaluation\"); err != nil {\n\t\tev.error(err)\n\t}\n\n\tswitch e := expr.(type) {\n\tcase *AggregateExpr:\n\t\tvector := ev.evalVector(e.Expr)\n\t\treturn ev.aggregation(e.Op, e.Grouping, e.Without, e.KeepCommonLabels, e.Param, vector)\n\n\tcase *BinaryExpr:\n\t\tlhs := ev.evalOneOf(e.LHS, model.ValScalar, model.ValVector)\n\t\trhs := ev.evalOneOf(e.RHS, model.ValScalar, model.ValVector)\n\n\t\tswitch lt, rt := lhs.Type(), rhs.Type(); {\n\t\tcase lt == model.ValScalar && rt == model.ValScalar:\n\t\t\treturn &model.Scalar{\n\t\t\t\tValue: scalarBinop(e.Op, lhs.(*model.Scalar).Value, rhs.(*model.Scalar).Value),\n\t\t\t\tTimestamp: ev.Timestamp,\n\t\t\t}\n\n\t\tcase lt == model.ValVector && rt == model.ValVector:\n\t\t\tswitch e.Op {\n\t\t\tcase itemLAND:\n\t\t\t\treturn ev.vectorAnd(lhs.(vector), rhs.(vector), e.VectorMatching)\n\t\t\tcase itemLOR:\n\t\t\t\treturn ev.vectorOr(lhs.(vector), rhs.(vector), e.VectorMatching)\n\t\t\tcase itemLUnless:\n\t\t\t\treturn ev.vectorUnless(lhs.(vector), rhs.(vector), e.VectorMatching)\n\t\t\tdefault:\n\t\t\t\treturn ev.vectorBinop(e.Op, lhs.(vector), rhs.(vector), e.VectorMatching, e.ReturnBool)\n\t\t\t}\n\t\tcase lt == model.ValVector && rt == model.ValScalar:\n\t\t\treturn ev.vectorScalarBinop(e.Op, lhs.(vector), rhs.(*model.Scalar), false, e.ReturnBool)\n\n\t\tcase lt == model.ValScalar && rt == model.ValVector:\n\t\t\treturn ev.vectorScalarBinop(e.Op, rhs.(vector), lhs.(*model.Scalar), true, e.ReturnBool)\n\t\t}\n\n\tcase *Call:\n\t\treturn e.Func.Call(ev, e.Args)\n\n\tcase *MatrixSelector:\n\t\treturn ev.matrixSelector(e)\n\n\tcase *NumberLiteral:\n\t\treturn &model.Scalar{Value: e.Val, Timestamp: ev.Timestamp}\n\n\tcase *ParenExpr:\n\t\treturn ev.eval(e.Expr)\n\n\tcase *StringLiteral:\n\t\treturn &model.String{Value: e.Val, Timestamp: ev.Timestamp}\n\n\tcase *UnaryExpr:\n\t\tse := ev.evalOneOf(e.Expr, model.ValScalar, model.ValVector)\n\t\t// Only + and - are possible operators.\n\t\tif e.Op == itemSUB {\n\t\t\tswitch v := se.(type) {\n\t\t\tcase *model.Scalar:\n\t\t\t\tv.Value = -v.Value\n\t\t\tcase vector:\n\t\t\t\tfor i, sv := range v {\n\t\t\t\t\tv[i].Value = -sv.Value\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn se\n\n\tcase *VectorSelector:\n\t\treturn ev.vectorSelector(e)\n\t}\n\tpanic(fmt.Errorf(\"unhandled expression of type: %T\", expr))\n}","func (m *MockExpressionNode) Eval() func(backend.Row) (core.Value, error) {\n\tm.ctrl.T.Helper()\n\tret := m.ctrl.Call(m, \"Eval\")\n\tret0, _ := ret[0].(func(backend.Row) (core.Value, error))\n\treturn ret0\n}","func (o NotOperator) Evaluate(ctx interface{}) (bool, error) {\n\t// fmt.Println(\"Not.Evaluate()\")\n\tresult, err := o.Operand.Evaluate(ctx)\n\treturn !result, err\n}","func evaluate(arg1 *vector.Vector, oper *vector.Vector, arg2 *vector.Vector) *vector.Vector {\n\t//Store the operator in a temp string, to save typing it out\n\tvar operS string\n\toperS = oper.At(0).(string)\n\tvar val1, val2 int \n\tvar err1, err2 os.Error\n\tval1, err1 = strconv.Atoi(arg1.At(0).(string))\n\tval2, err2 = strconv.Atoi(arg2.At(0).(string))\n\t//screens for consecutive operators\n\tif(err1 != nil || err2 != nil){\n\t\tfmt.Println(\"expr: syntax error\")\n\t\tos.Exit(-2)\n\t}\n\tvar result int = -1\n\t//Evaluate based on the operator\n\tif operS == \"+\" {\n\t\tresult = val1 + val2\n\t} else if operS == \"-\" {\n\t\tresult = val1 - val2\n\t} else if operS == \"/\" {\n\t\tresult = val1 / val2\n\t} else if operS == \"*\" {\n\t\tresult = val1 * val2\n\t} else if operS == \"%\" {\n\t\tresult = val1 % val2\n\t}\n\t//Clear the arg1 vector and add the result to it, then return\n\t//(saves memory by not creating a new vector)\n\targ1.Cut(0, arg1.Len())\n\targ1.Push(strconv.Itoa(result))\n\treturn arg1\n}"],"string":"[\n \"func (fn NoArgFunc) Eval(ctx *Context, r Row) (interface{}, error) {\\n\\treturn fn.Logic(ctx, r)\\n}\",\n \"func (bp *BinaryPlus) Eval() float64 {\\n\\treturn bp.left.(Eval).Eval() + bp.right.(Eval).Eval()\\n}\",\n \"func (ast *Unary) Eval(env *Env, ctx *Codegen, gen *ssa.Generator) (\\n\\tssa.Value, bool, error) {\\n\\texpr, ok, err := ast.Expr.Eval(env, ctx, gen)\\n\\tif err != nil || !ok {\\n\\t\\treturn ssa.Undefined, ok, err\\n\\t}\\n\\tswitch val := expr.ConstValue.(type) {\\n\\tcase bool:\\n\\t\\tswitch ast.Type {\\n\\t\\tcase UnaryNot:\\n\\t\\t\\treturn gen.Constant(!val, types.Bool), true, nil\\n\\t\\tdefault:\\n\\t\\t\\treturn ssa.Undefined, false, ctx.Errorf(ast.Expr,\\n\\t\\t\\t\\t\\\"invalid unary expression: %s%T\\\", ast.Type, val)\\n\\t\\t}\\n\\tcase int32:\\n\\t\\tswitch ast.Type {\\n\\t\\tcase UnaryMinus:\\n\\t\\t\\treturn gen.Constant(-val, types.Int32), true, nil\\n\\t\\tdefault:\\n\\t\\t\\treturn ssa.Undefined, false, ctx.Errorf(ast.Expr,\\n\\t\\t\\t\\t\\\"Unary.Eval: '%s%T' not implemented yet\\\", ast.Type, val)\\n\\t\\t}\\n\\tdefault:\\n\\t\\treturn ssa.Undefined, false, ctx.Errorf(ast.Expr,\\n\\t\\t\\t\\\"invalid value %s%T\\\", ast.Type, val)\\n\\t}\\n}\",\n \"func Eval(ctx context.Context, e Expr, vs Values) (interface{}, error) {\\r\\n\\tfn, err := FuncOf(ctx, e, vs)\\r\\n\\tif err != nil {\\r\\n\\t\\treturn nil, err\\r\\n\\t}\\r\\n\\treturn fn.Call(ctx, vs)\\r\\n}\",\n \"func (f *function) Eval(a *Apl) (Value, error) {\\n\\tvar err error\\n\\tvar l, r Value\\n\\n\\t// The right argument must be evaluated first.\\n\\t// Otherwise this A←1⋄A+(A←2) evaluates to 3,\\n\\t// but it should evaluate to 4.\\n\\tr, err = f.right.Eval(a)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tif f.left != nil {\\n\\n\\t\\t// Special case for modified assignments.\\n\\t\\t// Defer evaluation of the left argument.\\n\\t\\tif d, ok := f.Function.(*derived); ok && d.op == \\\"←\\\" {\\n\\t\\t\\tl = assignment{f.left}\\n\\t\\t} else {\\n\\t\\t\\tl, err = f.left.Eval(a)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Special case: the last function in a selective assignment uses Select instead of Call.\\n\\tif _, ok := f.right.(numVar); ok && f.selection {\\n\\t\\tif d, ok := f.Function.(*derived); ok == true {\\n\\t\\t\\treturn d.Select(a, l, r)\\n\\t\\t} else if p, ok := f.Function.(Primitive); ok == false {\\n\\t\\t\\treturn nil, fmt.Errorf(\\\"cannot use %T in selective assignment\\\", f.Function)\\n\\t\\t} else {\\n\\t\\t\\treturn p.Select(a, l, r)\\n\\t\\t}\\n\\t}\\n\\treturn f.Function.Call(a, l, r)\\n}\",\n \"func Eval(txApp *sysl.Application, assign Scope, e *sysl.Expr) *sysl.Value {\\n\\tswitch x := e.Expr.(type) {\\n\\tcase *sysl.Expr_Transform_:\\n\\t\\treturn evalTransform(txApp, assign, x, e)\\n\\tcase *sysl.Expr_Binexpr:\\n\\t\\treturn evalBinExpr(txApp, assign, x.Binexpr)\\n\\tcase *sysl.Expr_Call_:\\n\\t\\treturn evalCall(txApp, assign, x)\\n\\tcase *sysl.Expr_Name:\\n\\t\\treturn evalName(assign, x)\\n\\tcase *sysl.Expr_GetAttr_:\\n\\t\\treturn evalGetAttr(txApp, assign, x)\\n\\tcase *sysl.Expr_Ifelse:\\n\\t\\treturn evalIfelse(txApp, assign, x)\\n\\tcase *sysl.Expr_Literal:\\n\\t\\treturn x.Literal\\n\\tcase *sysl.Expr_Set:\\n\\t\\treturn evalSet(txApp, assign, x)\\n\\tcase *sysl.Expr_List_:\\n\\t\\treturn evalList(txApp, assign, x)\\n\\tcase *sysl.Expr_Unexpr:\\n\\t\\treturn evalUnaryFunc(x.Unexpr.Op, Eval(txApp, assign, x.Unexpr.Arg))\\n\\tdefault:\\n\\t\\tlogrus.Warnf(\\\"Skipping Expr of type %T\\\\n\\\", x)\\n\\t\\treturn nil\\n\\t}\\n}\",\n \"func (op *OpMinus) Eval(x, y float32) float32 {\\n\\treturn op.LeftChild.Eval(x, y) - op.RightChild.Eval(x, y)\\n}\",\n \"func (op *OpPlus) Eval(x, y float32) float32 {\\n\\treturn op.LeftChild.Eval(x, y) + op.RightChild.Eval(x, y)\\n}\",\n \"func (op *OpPlus) Eval(x, y float32) float32 {\\n\\treturn op.LeftChild.Eval(x, y) + op.RightChild.Eval(x, y)\\n}\",\n \"func (e *Exp) Eval() float64 {\\n\\te.init()\\n\\tresult, _ := e.eval(e.opTree)\\n\\treturn result\\n}\",\n \"func (f *FunctionLike) Eval(env types.Env) (types.Expr, error) {\\n\\treturn nil, fmt.Errorf(\\\"interpreterTypes.FunctionLike: cannot eval a function-like: %s\\\", f)\\n}\",\n \"func (form *Form) Eval(scope Scope, args ...interface{}) interface{} {\\n\\treturn form.Fn(scope, args...)\\n}\",\n \"func (op *OpX) Eval(x, y float32) float32 {\\n\\treturn x\\n}\",\n \"func (op *OpX) Eval(x, y float32) float32 {\\n\\treturn x\\n}\",\n \"func ExampleEval() {\\n\\tfmt.Println(Eval(\\\"5\\\"))\\n\\tfmt.Println(Eval(\\\"1 + 2\\\"))\\n\\tfmt.Println(Eval(\\\"1 - 2 + 3\\\"))\\n\\tfmt.Println(Eval(\\\"3 * ( 3 + 1 * 3 ) / 2\\\"))\\n\\tfmt.Println(Eval(\\\"3 * ( ( 3 + 1 ) * 3 ) / 2\\\"))\\n\\t//OutPut:\\n\\t//5\\n\\t//3\\n\\t//2\\n\\t//9\\n\\t//18\\n}\",\n \"func (this *ObjectUnwrap) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.UnaryEval(this, item, context)\\n}\",\n \"func (rt *invalidRuntime) Eval(vs parser.Scope, is map[string]interface{}, tid uint64) (interface{}, error) {\\n\\t_, err := rt.baseRuntime.Eval(vs, is, tid)\\n\\tif err == nil {\\n\\t\\terr = rt.erp.NewRuntimeError(util.ErrInvalidConstruct, fmt.Sprintf(\\\"Unknown node: %s\\\", rt.node.Name), rt.node)\\n\\t}\\n\\treturn nil, err\\n}\",\n \"func (this *Not) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.UnaryEval(this, item, context)\\n}\",\n \"func (rt *voidRuntime) Eval(vs parser.Scope, is map[string]interface{}, tid uint64) (interface{}, error) {\\n\\treturn rt.baseRuntime.Eval(vs, is, tid)\\n}\",\n \"func (le ListExpr) Eval(scope Scope) (interface{}, error) {\\n\\tif len(le.List) == 0 {\\n\\t\\treturn le.List, nil\\n\\t}\\n\\n\\tval, err := le.List[0].Eval(scope)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tif macroFn, ok := val.(MacroFunc); ok {\\n\\t\\tvar name string\\n\\t\\tif sym, ok := le.List[0].(SymbolExpr); ok {\\n\\t\\t\\tname = sym.Symbol\\n\\t\\t}\\n\\t\\treturn macroFn(scope, name, le.List[1:])\\n\\t}\\n\\n\\targs := []interface{}{}\\n\\tfor i := 1; i < len(le.List); i++ {\\n\\t\\targ, err := le.List[i].Eval(scope)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t\\targs = append(args, arg)\\n\\t}\\n\\n\\tif scopedFn, ok := val.(ScopedFunc); ok {\\n\\t\\treturn scopedFn(scope, args...)\\n\\t}\\n\\n\\treturn reflection.Call(val, args...)\\n}\",\n \"func (o Nil) Eval(*Vm) (Object, error) { return o, nil }\",\n \"func Eval(node ast.Node, env *object.Environment, stop <-chan struct{}) object.Object {\\n\\tselect {\\n\\tcase <-stop:\\n\\t\\treturn ConstNil\\n\\tdefault:\\n\\t}\\n\\n\\tswitch node := node.(type) {\\n\\t// statements\\n\\tcase *ast.Program:\\n\\t\\treturn evalProgram(node, env, stop)\\n\\tcase *ast.LetStatement:\\n\\t\\tval := Eval(node.Value, env, stop)\\n\\t\\tif isError(val) {\\n\\t\\t\\treturn val\\n\\t\\t}\\n\\t\\tenv.Set(node.Name.Value, val)\\n\\tcase *ast.ReturnStatement:\\n\\t\\tval := Eval(node.Value, env, stop)\\n\\t\\tif isError(val) {\\n\\t\\t\\treturn val\\n\\t\\t}\\n\\t\\treturn &object.ReturnValue{Value: val}\\n\\tcase *ast.BlockStatement:\\n\\t\\treturn evalBlockStatement(node, env, stop)\\n\\tcase *ast.ExpressionStatement:\\n\\t\\treturn Eval(node.Expression, env, stop)\\n\\n\\t\\t// expressions\\n\\tcase *ast.PrefixExpression:\\n\\t\\tright := Eval(node.Right, env, stop)\\n\\t\\tif isError(right) {\\n\\t\\t\\treturn right\\n\\t\\t}\\n\\t\\treturn evalPrefixExpr(node.Token, right)\\n\\tcase *ast.InfixExpression:\\n\\t\\tif node.Operator == token.Assign {\\n\\t\\t\\treturn evalAssign(node, env, stop)\\n\\t\\t}\\n\\n\\t\\tleft := Eval(node.Left, env, stop)\\n\\t\\tif isError(left) {\\n\\t\\t\\treturn left\\n\\t\\t}\\n\\t\\tright := Eval(node.Right, env, stop)\\n\\t\\tif isError(right) {\\n\\t\\t\\treturn right\\n\\t\\t}\\n\\t\\treturn evalInfixExpr(node.Token, left, right)\\n\\tcase *ast.IndexExpression:\\n\\t\\tleft := Eval(node.Left, env, stop)\\n\\t\\tif isError(left) {\\n\\t\\t\\treturn left\\n\\t\\t}\\n\\n\\t\\tindex := Eval(node.Index, env, stop)\\n\\t\\tif isError(index) {\\n\\t\\t\\treturn index\\n\\t\\t}\\n\\t\\treturn evalIndexExpr(node.Token, left, index)\\n\\tcase *ast.IfExpression:\\n\\t\\treturn evalIfExpr(node, env, stop)\\n\\tcase *ast.WhileExpression:\\n\\t\\treturn evalWhileExpr(node, env, stop)\\n\\tcase *ast.CallExpression:\\n\\t\\tfunction := Eval(node.Func, env, stop)\\n\\t\\tif isError(function) {\\n\\t\\t\\treturn function\\n\\t\\t}\\n\\n\\t\\targs, err := evalExpressions(node.Args, env, stop)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\n\\t\\treturn doFunction(node.Token, function, args, stop)\\n\\n\\t\\t// literals\\n\\tcase *ast.IntegerLiteral:\\n\\t\\treturn &object.Integer{Value: node.Value}\\n\\tcase *ast.FloatLiteral:\\n\\t\\treturn &object.Float{Value: node.Value}\\n\\tcase *ast.BooleanLiteral:\\n\\t\\treturn boolToBoolean(node.Value)\\n\\tcase *ast.NilLiteral:\\n\\t\\treturn ConstNil\\n\\tcase *ast.FunctionLiteral:\\n\\t\\treturn &object.Function{Params: node.Params, Body: node.Body, Env: env}\\n\\tcase *ast.StringLiteral:\\n\\t\\treturn &object.String{Value: node.Value}\\n\\tcase *ast.ArrayLiteral:\\n\\t\\telems, err := evalExpressions(node.Elements, env, stop)\\n\\t\\tif len(elems) == 1 && err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\treturn &object.Array{Elements: elems}\\n\\tcase *ast.Identifier:\\n\\t\\treturn evalIdentifier(node, env)\\n\\tcase *ast.AccessIdentifier:\\n\\t\\treturn evalAccessIdentifier(node, env)\\n\\t}\\n\\treturn nil\\n}\",\n \"func (inst *hiddenInstance) Eval(expr ast.Expr) Value {\\n\\tv := inst.Value()\\n\\treturn v.Context().BuildExpr(expr, Scope(v), InferBuiltins(true))\\n}\",\n \"func (a *AddActivity) Eval(context activity.Context) (done bool, err error) {\\n\\n\\t//mv := context.GetInput(ivMessage)\\n\\tnum1, _ := context.GetInput(ivNum1).(int)\\n\\tnum2, _ := context.GetInput(ivNum2).(int)\\n\\n\\tactivityLog.Info(fmt.Sprintf(\\\"Num1: %d, Num2: %d\\\", num1, num2))\\n\\tactivityLog.Info(fmt.Sprintf(\\\"Addition is : %d\\\", num1+num2))\\n\\tcontext.SetOutput(ovAddition, num1+num2)\\n\\n\\treturn true, nil\\n}\",\n \"func (o Args) Eval(*Vm) (Object, error) { return o, nil }\",\n \"func (n *NotLikeOp) Evaluate(left, right EvalResult) (EvalResult, error) {\\n\\tpanic(\\\"implement me\\\")\\n}\",\n \"func eval(list []*Item) int {\\n\\n\\tvar stack *Item\\n\\n\\tfor _, node := range list {\\n\\n\\t\\tif node.Typ == Number {\\n\\t\\t\\tstack = stack.Push(node)\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tvar left, right *Item\\n\\n\\t\\tstack, right = stack.Pop()\\n\\t\\tstack, left = stack.Pop()\\n\\n\\t\\tvar val int\\n\\t\\tswitch node.Operation {\\n\\t\\tcase \\\"+\\\":\\n\\t\\t\\tval = left.Value + right.Value\\n\\t\\tcase \\\"-\\\":\\n\\t\\t\\tval = left.Value - right.Value\\n\\t\\tcase \\\"/\\\":\\n\\t\\t\\t// Watch for div-by-zero\\n\\t\\t\\tval = left.Value / right.Value\\n\\t\\tcase \\\"*\\\":\\n\\t\\t\\tval = left.Value * right.Value\\n\\t\\t}\\n\\t\\tstack = stack.Push(&Item{Typ: Number, Value: val})\\n\\t}\\n\\n\\treturn stack.Value\\n}\",\n \"func (e *BinExpr) Eval(ctx context.Context, local Scope) (_ Value, err error) {\\n\\ta, err := e.a.Eval(ctx, local)\\n\\tif err != nil {\\n\\t\\treturn nil, WrapContextErr(err, e, local)\\n\\t}\\n\\n\\tb, err := e.b.Eval(ctx, local)\\n\\tif err != nil {\\n\\t\\treturn nil, WrapContextErr(err, e, local)\\n\\t}\\n\\tval, err := e.eval(ctx, a, b, local)\\n\\tif err != nil {\\n\\t\\treturn nil, WrapContextErr(err, e, local)\\n\\t}\\n\\treturn val, nil\\n}\",\n \"func (m *Message) Eval(vm *VM, locals Interface) (result Interface) {\\n\\treturn m.Send(vm, locals, locals)\\n}\",\n \"func eval(sc *scope, e sexpr) sexpr {\\n\\te = transform(sc, e)\\n\\tswitch e := e.(type) {\\n\\tcase cons: // a function to evaluate\\n\\t\\tcons := e\\n\\t\\tcar := eval(sc, cons.car)\\n\\t\\tif !isFunction(car) && !isPrimitive(car) {\\n\\t\\t\\tpanic(\\\"Attempted application on non-function\\\")\\n\\t\\t}\\n\\t\\tcdr := cons.cdr\\n\\t\\targs := flatten(cdr)\\n\\t\\tif isPrimitive(car) {\\n\\t\\t\\treturn (car.(primitive))(sc, args)\\n\\t\\t}\\n\\t\\tf := car.(function)\\n\\t\\t// This is a function - evaluate all arguments\\n\\t\\tfor i, a := range args {\\n\\t\\t\\targs[i] = eval(sc, a)\\n\\t\\t}\\n\\t\\treturn f(sc, args)\\n\\tcase sym:\\n\\t\\treturn sc.lookup(e)\\n\\t}\\n\\treturn e\\n}\",\n \"func (p *Qlang) Eval(expr string) (err error) {\\n\\n\\treturn p.Exec([]byte(expr), \\\"\\\")\\n}\",\n \"func (mr *MockExpressionNodeMockRecorder) Eval() *gomock.Call {\\n\\tmr.mock.ctrl.T.Helper()\\n\\treturn mr.mock.ctrl.RecordCallWithMethodType(mr.mock, \\\"Eval\\\", reflect.TypeOf((*MockExpressionNode)(nil).Eval))\\n}\",\n \"func (this *Self) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn item, nil\\n}\",\n \"func (n *NotInOp) Evaluate(left, right EvalResult) (EvalResult, error) {\\n\\tpanic(\\\"implement me\\\")\\n}\",\n \"func (f *Function) Eval(inputs ...interface{}) (args.Const, error) {\\n\\tlenInputs := len(inputs)\\n\\tif lenInputs != f.numVars {\\n\\t\\treturn nil, errors.New(\\\"Number of inputs is not equal to the number of variables in function\\\")\\n\\t}\\n\\n\\tvar operand1 args.Const\\n\\tvar operand2 args.Const\\n\\tvar operandStack []args.Const\\n\\n\\ti := 0\\n\\tfor i < len(f.Args) {\\n\\t\\tif f.typeInput(i) == args.Constant || f.typeInput(i) == args.Variable {\\n\\t\\t\\tvariable, err := f.getVar(i)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\n\\t\\t\\tif lenInputs != 0 {\\n\\t\\t\\t\\toperand, err := variable.Eval(inputs[f.varNum[variable]])\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\toperandStack = append(operandStack, operand)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t// If length inputs is 0, then all variables must be constant.\\n\\t\\t\\t\\t// This code assumes variable is a constant and so uses 0 as an input\\n\\t\\t\\t\\t// to MustEval as it will never fail as the input does not matter for constants\\n\\t\\t\\t\\toperandStack = append(operandStack, variable.MustEval(0))\\n\\t\\t\\t}\\n\\t\\t} else if f.typeInput(i) == args.Operation {\\n\\t\\t\\toperation, err := f.getOp(i)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t}\\n\\n\\t\\t\\tif h, ok := unaryFuncs[operation]; ok {\\n\\t\\t\\t\\tif len(operandStack) == 0 {\\n\\t\\t\\t\\t\\treturn nil, errors.New(\\\"Not enough operands\\\")\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\toperand1, operandStack = operandStack[len(operandStack)-1], operandStack[:len(operandStack)-1]\\n\\t\\t\\t\\tresult, err := h(operand1)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\toperandStack = append(operandStack, result)\\n\\t\\t\\t} else if h, ok := binaryFuncs[operation]; ok {\\n\\t\\t\\t\\tif len(operandStack) < 2 {\\n\\t\\t\\t\\t\\treturn nil, errors.New(\\\"Not enough operands\\\")\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\toperand2, operandStack = operandStack[len(operandStack)-1], operandStack[:len(operandStack)-1]\\n\\t\\t\\t\\toperand1, operandStack = operandStack[len(operandStack)-1], operandStack[:len(operandStack)-1]\\n\\t\\t\\t\\tresult, err := h(operand1, operand2)\\n\\t\\t\\t\\tif err != nil {\\n\\t\\t\\t\\t\\treturn nil, err\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\toperandStack = append(operandStack, result)\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn nil, errors.New(\\\"Operation not supported\\\")\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ti++\\n\\t}\\n\\n\\tif len(operandStack) > 1 {\\n\\t\\treturn nil, errors.New(\\\"To many operands left over after calculation\\\")\\n\\t}\\n\\n\\treturn operandStack[0], nil\\n}\",\n \"func (op *OpSine) Eval(x, y float32) float32 {\\n\\treturn float32(math.Sin(float64(op.Child.Eval(x, y))))\\n}\",\n \"func (b *Builder) Eval(desc string, f predicate.TransformFunc) *Builder {\\n\\tb.p.RegisterTransformation(impl.Eval(desc, f))\\n\\treturn b\\n}\",\n \"func (e *Evaluator) Eval(expr string) (interface{}, error) {\\n\\tn := e.n.Copy()\\n\\t_expr, err := xpath.Compile(expr)\\n\\tif err != nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"expr cannot compile: %w\\\", err)\\n\\t}\\n\\n\\tv := _expr.Evaluate(n)\\n\\tswitch v := v.(type) {\\n\\tcase *xpath.NodeIterator:\\n\\t\\tns := nodes(v)\\n\\t\\tvs := make([]interface{}, 0, len(ns))\\n\\t\\tfor i := range ns {\\n\\t\\t\\tswitch n := ns[i].(type) {\\n\\t\\t\\tcase attr:\\n\\t\\t\\t\\tvs = append(vs, n.val)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif len(vs) == len(ns) {\\n\\t\\t\\treturn vs, nil\\n\\t\\t}\\n\\t\\treturn ns, nil\\n\\t}\\n\\n\\treturn v, nil\\n}\",\n \"func (rt *baseRuntime) Eval(vs parser.Scope, is map[string]interface{}, tid uint64) (interface{}, error) {\\n\\tvar err error\\n\\n\\terrorutil.AssertTrue(rt.validated, \\\"Runtime component has not been validated - please call Validate() before Eval()\\\")\\n\\n\\tif rt.erp.Debugger != nil {\\n\\t\\terr = rt.erp.Debugger.VisitState(rt.node, vs, tid)\\n\\t\\trt.erp.Debugger.SetLockingState(rt.erp.MutexeOwners, rt.erp.MutexLog)\\n\\t\\trt.erp.Debugger.SetThreadPool(rt.erp.Processor.ThreadPool())\\n\\t}\\n\\n\\treturn nil, err\\n}\",\n \"func (n *NotRegexpOp) Evaluate(left, right EvalResult) (EvalResult, error) {\\n\\tpanic(\\\"implement me\\\")\\n}\",\n \"func (s *Subtraction) Evaluate(left, right EvalResult) (EvalResult, error) {\\n\\treturn subtractNumericWithError(left, right)\\n}\",\n \"func (this *ObjectValues) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.UnaryEval(this, item, context)\\n}\",\n \"func (this *ObjectValues) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.UnaryEval(this, item, context)\\n}\",\n \"func (c *Context) Eval(script string) (*Value, error) {\\n\\t// When PHP compiles code with a non-NULL return value expected, it simply\\n\\t// prepends a `return` call to the code, thus breaking simple scripts that\\n\\t// would otherwise work. Thus, we need to wrap the code in a closure, and\\n\\t// call it immediately.\\n\\ts := C.CString(\\\"call_user_func(function(){\\\" + script + \\\"});\\\")\\n\\tdefer C.free(unsafe.Pointer(s))\\n\\n\\tvptr, err := C.context_eval(c.context, s)\\n\\tif err != nil {\\n\\t\\treturn nil, fmt.Errorf(\\\"Error executing script '%s' in context\\\", script)\\n\\t}\\n\\n\\tval, err := NewValueFromPtr(vptr)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\treturn val, nil\\n}\",\n \"func (f *CallExpression) Evaluate(ctx *Context) Value {\\n\\tcallable := f.Callable.Evaluate(ctx)\\n\\n\\tif callable.Type == vtVariable {\\n\\t\\tcallable = callable.Evaluate(ctx)\\n\\t}\\n\\n\\tif callable.isCallable() {\\n\\t\\tnewCtx := NewContext(\\\"\\\", nil)\\n\\t\\targs := f.Args.EvaluateAll(ctx)\\n\\t\\treturn callable.callable().Execute(newCtx, &args)\\n\\t}\\n\\n\\tpanic(NewNotCallableError(callable))\\n}\",\n \"func (lscript *Scripting) Eval(luacmd string, arguments ...interface{}) (*ScriptingReturnValues, error) {\\n\\targs := asScriptingArgs(arguments...)\\n\\tlargs := forLua(args)\\n\\tfor _, larg := range largs {\\n\\t\\tlscript.Push(larg)\\n\\t}\\n\\tvar r *ScriptingReturnValues\\n\\terr := lscript.DoString(luacmd)\\n\\tif err != nil {\\n\\t\\tT().P(\\\"script\\\", \\\"lua\\\").Errorf(\\\"scripting error: %s\\\", err.Error())\\n\\t} else {\\n\\t\\tif err == nil {\\n\\t\\t\\tT().P(\\\"lua\\\", \\\"eval\\\").Debugf(\\\"%d return values on the stack\\\", lscript.GetTop())\\n\\t\\t\\tr = lscript.returnFromScripting(lscript.GetTop()) // return all values on the stack\\n\\t\\t}\\n\\t}\\n\\treturn r, err\\n}\",\n \"func (e *binaryExprEvaluator) eval(lhs, rhs interface{}) interface{} {\\n\\tswitch e.op {\\n\\tcase ADD:\\n\\t\\treturn lhs.(float64) + rhs.(float64)\\n\\tcase SUB:\\n\\t\\treturn lhs.(float64) - rhs.(float64)\\n\\tcase MUL:\\n\\t\\treturn lhs.(float64) * rhs.(float64)\\n\\tcase DIV:\\n\\t\\trhs := rhs.(float64)\\n\\t\\tif rhs == 0 {\\n\\t\\t\\treturn float64(0)\\n\\t\\t}\\n\\t\\treturn lhs.(float64) / rhs\\n\\tdefault:\\n\\t\\t// TODO: Validate operation & data types.\\n\\t\\tpanic(\\\"invalid operation: \\\" + e.op.String())\\n\\t}\\n}\",\n \"func (p *Qlang) SafeEval(expr string) (err error) {\\n\\n\\treturn p.SafeExec([]byte(expr), \\\"\\\")\\n}\",\n \"func Eval(input string, context map[string]interface{}) float64 {\\n\\tnode, err := Parse(input)\\n\\tif err != nil {\\n\\t\\tpanic(err)\\n\\t}\\n\\texpr := &expression{node, context}\\n\\treturn expr.eval(expr.ast)\\n}\",\n \"func (op *OpAtan) Eval(x, y float32) float32 {\\n\\treturn float32(math.Atan(float64(op.Child.Eval(x, y))))\\n}\",\n \"func (op *OpMult) Eval(x, y float32) float32 {\\n\\treturn op.LeftChild.Eval(x, y) * op.RightChild.Eval(x, y)\\n}\",\n \"func (i *InOp) Evaluate(left, right EvalResult) (EvalResult, error) {\\n\\tpanic(\\\"implement me\\\")\\n}\",\n \"func prepareEvalInfixExp(opfStack, opftStack, opfdStack, argsStack *Stack) {\\n\\t// current token is function stop\\n\\tfor opftStack.Peek().(efp.Token) != opfStack.Peek().(efp.Token) {\\n\\t\\t// calculate trigger\\n\\t\\ttopOpt := opftStack.Peek().(efp.Token)\\n\\t\\tif err := calculate(opfdStack, topOpt); err != nil {\\n\\t\\t\\targsStack.Peek().(*list.List).PushBack(newErrorFormulaArg(err.Error(), err.Error()))\\n\\t\\t\\topftStack.Pop()\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\topftStack.Pop()\\n\\t}\\n\\targument := true\\n\\tif opftStack.Len() > 2 && opfdStack.Len() == 1 {\\n\\t\\ttopOpt := opftStack.Pop()\\n\\t\\tif opftStack.Peek().(efp.Token).TType == efp.TokenTypeOperatorInfix {\\n\\t\\t\\targument = false\\n\\t\\t}\\n\\t\\topftStack.Push(topOpt)\\n\\t}\\n\\t// push opfd to args\\n\\tif argument && opfdStack.Len() > 0 {\\n\\t\\targsStack.Peek().(*list.List).PushBack(opfdStack.Pop().(formulaArg))\\n\\t}\\n}\",\n \"func (e PackageExpr) Eval(_ rel.Scope) (rel.Value, error) {\\n\\treturn e.a.Eval(stdScope())\\n}\",\n \"func (p *prog) Eval(input any) (v ref.Val, det *EvalDetails, err error) {\\n\\t// Configure error recovery for unexpected panics during evaluation. Note, the use of named\\n\\t// return values makes it possible to modify the error response during the recovery\\n\\t// function.\\n\\tdefer func() {\\n\\t\\tif r := recover(); r != nil {\\n\\t\\t\\tswitch t := r.(type) {\\n\\t\\t\\tcase interpreter.EvalCancelledError:\\n\\t\\t\\t\\terr = t\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\terr = fmt.Errorf(\\\"internal error: %v\\\", r)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}()\\n\\t// Build a hierarchical activation if there are default vars set.\\n\\tvar vars interpreter.Activation\\n\\tswitch v := input.(type) {\\n\\tcase interpreter.Activation:\\n\\t\\tvars = v\\n\\tcase map[string]any:\\n\\t\\tvars = activationPool.Setup(v)\\n\\t\\tdefer activationPool.Put(vars)\\n\\tdefault:\\n\\t\\treturn nil, nil, fmt.Errorf(\\\"invalid input, wanted Activation or map[string]any, got: (%T)%v\\\", input, input)\\n\\t}\\n\\tif p.defaultVars != nil {\\n\\t\\tvars = interpreter.NewHierarchicalActivation(p.defaultVars, vars)\\n\\t}\\n\\tv = p.interpretable.Eval(vars)\\n\\t// The output of an internal Eval may have a value (`v`) that is a types.Err. This step\\n\\t// translates the CEL value to a Go error response. This interface does not quite match the\\n\\t// RPC signature which allows for multiple errors to be returned, but should be sufficient.\\n\\tif types.IsError(v) {\\n\\t\\terr = v.(*types.Err)\\n\\t}\\n\\treturn\\n}\",\n \"func (this *ObjectAdd) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.TernaryEval(this, item, context)\\n}\",\n \"func (op *OpSin) Eval(x, y float32) float32 {\\n\\treturn float32(math.Sin(float64(op.Child.Eval(x, y))))\\n}\",\n \"func (l *LikeOp) Evaluate(left, right EvalResult) (EvalResult, error) {\\n\\tpanic(\\\"implement me\\\")\\n}\",\n \"func (e *ExpressionAtom) Evaluate(dataContext IDataContext, memory *WorkingMemory) (reflect.Value, error) {\\n\\tif e.Evaluated == true {\\n\\t\\treturn e.Value, nil\\n\\t}\\n\\tif e.Variable != nil {\\n\\t\\tval, err := e.Variable.Evaluate(dataContext, memory)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn reflect.Value{}, err\\n\\t\\t}\\n\\t\\te.Value = val\\n\\t\\te.Evaluated = true\\n\\t\\treturn val, err\\n\\t}\\n\\tif e.FunctionCall != nil {\\n\\t\\tvalueNode := dataContext.Get(\\\"DEFUNC\\\")\\n\\t\\targs, err := e.FunctionCall.EvaluateArgumentList(dataContext, memory)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn reflect.Value{}, err\\n\\t\\t}\\n\\t\\tret, err := valueNode.CallFunction(e.FunctionCall.FunctionName, args...)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn reflect.Value{}, err\\n\\t\\t}\\n\\t\\te.Value = ret\\n\\t\\te.Evaluated = true\\n\\t\\treturn ret, err\\n\\t}\\n\\tpanic(\\\"should not be reached\\\")\\n}\",\n \"func (this *ObjectRemove) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.BinaryEval(this, item, context)\\n}\",\n \"func (s *ScriptReal) Eval(c Scripter, keys []string, args ...interface{}) *redis.Cmd {\\n\\treturn s.script.Eval(c, keys, args...)\\n}\",\n \"func (this *ObjectInnerValues) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.UnaryEval(this, item, context)\\n}\",\n \"func (p Primitive) Eval(a *Apl) (Value, error) {\\n\\treturn p, nil\\n}\",\n \"func (this *Element) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.BinaryEval(this, item, context)\\n}\",\n \"func (op *OpY) Eval(x, y float32) float32 {\\n\\treturn y\\n}\",\n \"func (op *OpY) Eval(x, y float32) float32 {\\n\\treturn y\\n}\",\n \"func (s *String) Eval(_, _ *Scope) (Value, error) {\\n\\treturn s, nil\\n}\",\n \"func (ev *Evaler) Eval(name, text string, n *parse.Chunk, ports []*Port) error {\\n\\top, err := ev.Compile(n)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tec := NewTopEvalCtx(ev, name, text, ports)\\n\\treturn ec.PEval(op)\\n}\",\n \"func TestEval(t *testing.T) {\\n\\tany := `.+`\\n\\ttestCases := []struct {\\n\\t\\tname string\\n\\t\\tquery string\\n\\t\\twantErr string\\n\\t\\twant []values.Value\\n\\t}{\\n\\t\\t{\\n\\t\\t\\tname: \\\"string interpolation\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\tstr = \\\"str\\\"\\n\\t\\t\\t\\ting = \\\"ing\\\"\\n\\t\\t\\t\\t\\\"str + ing = ${str+ing}\\\"`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewString(\\\"str + ing = string\\\"),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"string interpolation missing field\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\tr = makeRecord(o: {a: \\\"foo\\\", b: 42})\\n\\t\\t\\t\\t\\\"r._value = ${r._value}\\\"`,\\n\\t\\t\\twantErr: any,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"string interpolation non-string type\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\tr = makeRecord(o: {a: \\\"foo\\\", b: 42})\\n\\t\\t\\t\\t\\\"r._value = ${r.b}\\\"`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewString(\\\"r._value = 42\\\"),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"string interpolation wrong type\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\tr = makeRecord(o: {a: \\\"foo\\\", b: 42})\\n\\t\\t\\t\\t\\\"r = ${r}\\\"`,\\n\\t\\t\\twantErr: any,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"call builtin function\\\",\\n\\t\\t\\tquery: \\\"six()\\\",\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewFloat(6.0),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"call function with fail\\\",\\n\\t\\t\\tquery: \\\"fail()\\\",\\n\\t\\t\\twantErr: any,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"call function with duplicate args\\\",\\n\\t\\t\\tquery: \\\"plusOne(x:1.0, x:2.0)\\\",\\n\\t\\t\\twantErr: any,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"binary expressions\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\tsix_value = six()\\n\\t\\t\\tnine_value = nine()\\n\\n\\t\\t\\tfortyTwo() == six_value * nine_value\\n\\t\\t\\t`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewBool(false),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"logical expressions short circuit\\\",\\n\\t\\t\\tquery: `\\n six_value = six()\\n nine_value = nine()\\n\\n not (fortyTwo() == six_value * nine_value) or fail()\\n\\t\\t\\t`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewBool(true),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"function\\\",\\n\\t\\t\\tquery: `\\n plusSix = (r) => r + six()\\n plusSix(r:1.0) == 7.0 or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"function block\\\",\\n\\t\\t\\tquery: `\\n f = (r) => {\\n r1 = 1.0 + r\\n return (r + r1) / r\\n }\\n f(r:1.0) == 3.0 or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"function block polymorphic\\\",\\n\\t\\t\\tquery: `\\n f = (r) => {\\n r2 = r * r\\n return r2 / r\\n }\\n f(r:2.0) == 2.0 or fail()\\n f(r:2) == 2 or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"function with default param\\\",\\n\\t\\t\\tquery: `\\n addN = (r,n=4) => r + n\\n addN(r:2) == 6 or fail()\\n addN(r:3,n:1) == 4 or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"scope closing\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\tx = 5\\n plusX = (r) => r + x\\n plusX(r:2) == 7 or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"nested scope mutations not visible outside\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\tx = 5\\n xinc = () => {\\n x = x + 1\\n return x\\n }\\n xinc() == 6 or fail()\\n x == 5 or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t// TODO(jsternberg): This test seems to not\\n\\t\\t// infer the type constraints correctly for m.a,\\n\\t\\t// but it doesn't fail.\\n\\t\\t{\\n\\t\\t\\tname: \\\"return map from func\\\",\\n\\t\\t\\tquery: `\\n toMap = (a,b) => ({\\n a: a,\\n b: b,\\n })\\n m = toMap(a:1, b:false)\\n m.a == 1 or fail()\\n not m.b or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"pipe expression\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\tadd = (a=<-,b) => a + b\\n\\t\\t\\tone = 1\\n\\t\\t\\tone |> add(b:2) == 3 or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"ignore pipe default\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\tadd = (a=<-,b) => a + b\\n\\t\\t\\tadd(a:1, b:2) == 3 or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"pipe expression function\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\tadd = (a=<-,b) => a + b\\n\\t\\t\\tsix() |> add(b:2.0) == 8.0 or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"pipe builtin function\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\tsix() |> plusOne() == 7.0 or fail()\\n\\t\\t\\t`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewBool(true),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"regex match\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\\"abba\\\" =~ /^a.*a$/ or fail()\\n\\t\\t\\t`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewBool(true),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"regex not match\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\\"abc\\\" =~ /^a.*a$/ and fail()\\n\\t\\t\\t`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewBool(false),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"not regex match\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\\"abc\\\" !~ /^a.*a$/ or fail()\\n\\t\\t\\t`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewBool(true),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"not regex not match\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\\"abba\\\" !~ /^a.*a$/ and fail()\\n\\t\\t\\t`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewBool(false),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"options metadata\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\toption task = {\\n\\t\\t\\t\\tname: \\\"foo\\\",\\n\\t\\t\\t\\trepeat: 100,\\n\\t\\t\\t}\\n\\t\\t\\ttask.name == \\\"foo\\\" or fail()\\n\\t\\t\\ttask.repeat == 100 or fail()\\n\\t\\t\\t`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewBool(true),\\n\\t\\t\\t\\tvalues.NewBool(true),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"query with side effects\\\",\\n\\t\\t\\tquery: `sideEffect() == 0 or fail()`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewInt(0),\\n\\t\\t\\t\\tvalues.NewBool(true),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"array index expression\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\ta = [1, 2, 3]\\n\\t\\t\\t\\tx = a[1]\\n\\t\\t\\t\\tx == 2 or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"dict expression\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\tm = [\\\"a\\\" + \\\"b\\\": 0, \\\"c\\\" + \\\"d\\\": 1]\\n\\t\\t\\t\\tx = get(dict: m, key: \\\"ab\\\", default: 2)\\n\\t\\t\\t\\ty = get(dict: m, key: \\\"cd\\\", default: 2)\\n\\t\\t\\t\\tz = get(dict: m, key: \\\"ef\\\", default: 2)\\n\\t\\t\\t\\tx == 0 and y == 1 and z == 2 or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"empy dictionary\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\tm0 = [:]\\n\\t\\t\\t\\tm1 = insert(dict: m0, key: \\\"a\\\", value: 0)\\n\\t\\t\\t\\tm2 = insert(dict: m0, key: 0, value: \\\"a\\\")\\n\\t\\t\\t\\tv1 = get(dict: m1, key: \\\"a\\\", default: -1)\\n\\t\\t\\t\\tv2 = get(dict: m2, key: 0, default: \\\"b\\\")\\n\\t\\t\\t\\tv1 == 0 and v2 == \\\"a\\\" or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"array index expression out of bounds low\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\ta = [1, 2, 3]\\n\\t\\t\\t\\ti = -1\\n\\t\\t\\t\\tx = a[i]\\n\\t\\t\\t`,\\n\\t\\t\\twantErr: any,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"array index expression out of bounds high\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\ta = [1, 2, 3]\\n\\t\\t\\t\\ti = 3\\n\\t\\t\\t\\tx = a[i]\\n\\t\\t\\t`,\\n\\t\\t\\twantErr: any,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"array with complex index expression\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\tf = () => ({l: 0, m: 1, n: 2})\\n\\t\\t\\t\\ta = [1, 2, 3]\\n\\t\\t\\t\\tx = a[f().l]\\n\\t\\t\\t\\ty = a[f().m]\\n\\t\\t\\t\\tz = a[f().n]\\n\\t\\t\\t\\tx == 1 or fail()\\n\\t\\t\\t\\ty == 2 or fail()\\n\\t\\t\\t\\tz == 3 or fail()\\n\\t\\t\\t`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"short circuit logical and\\\",\\n\\t\\t\\tquery: `\\n false and fail()\\n `,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewBool(false),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"short circuit logical or\\\",\\n\\t\\t\\tquery: `\\n true or fail()\\n `,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewBool(true),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"no short circuit logical and\\\",\\n\\t\\t\\tquery: `\\n true and fail()\\n `,\\n\\t\\t\\twantErr: any,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"no short circuit logical or\\\",\\n\\t\\t\\tquery: `\\n false or fail()\\n `,\\n\\t\\t\\twantErr: any,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"conditional true\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\tif 1 != 0 then 10 else 100\\n\\t\\t\\t`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewInt(10),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"conditional false\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\tif 1 == 0 then 10 else 100\\n\\t\\t\\t`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewInt(100),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"conditional in function\\\",\\n\\t\\t\\tquery: `\\n\\t\\t\\t\\tf = (t, c, a) => if t then c else a\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tv1: f(t: false, c: 30, a: 300),\\n\\t\\t\\t\\t\\tv2: f(t: true, c: \\\"cats\\\", a: \\\"dogs\\\"),\\n\\t\\t\\t\\t}\\n\\t\\t\\t`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewObjectWithValues(map[string]values.Value{\\n\\t\\t\\t\\t\\t\\\"v1\\\": values.NewInt(300),\\n\\t\\t\\t\\t\\t\\\"v2\\\": values.NewString(\\\"cats\\\"),\\n\\t\\t\\t\\t}),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"exists\\\",\\n\\t\\t\\tquery: `hasValue(o: makeRecord(o: {value: 1}))`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewBool(true),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"exists null\\\",\\n\\t\\t\\tquery: `hasValue(o: makeRecord(o: {val: 2}))`,\\n\\t\\t\\twant: []values.Value{\\n\\t\\t\\t\\tvalues.NewBool(false),\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tname: \\\"invalid function parameter\\\",\\n\\t\\t\\tquery: `from(bucket: \\\"telegraf\\\") |> window(every: 0s)`,\\n\\t\\t\\twantErr: `error calling function \\\"window\\\" @\\\\d+:\\\\d+-\\\\d+:\\\\d+: window function requires at least one of \\\"every\\\" or \\\"period\\\" to be set and non-zero`,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\t// tests that we don't nest error messages when\\n\\t\\t\\t// a function call fails and gets piped into another\\n\\t\\t\\t// function.\\n\\t\\t\\tname: \\\"nested function error\\\",\\n\\t\\t\\tquery: `from(bucket: \\\"telegraf\\\") |> window(every: 0s) |> mean()`,\\n\\t\\t\\twantErr: `error calling function \\\"window\\\" @\\\\d+:\\\\d+-\\\\d+:\\\\d+: window function requires at least one of \\\"every\\\" or \\\"period\\\" to be set and non-zero`,\\n\\t\\t},\\n\\t}\\n\\n\\tfor _, tc := range testCases {\\n\\t\\ttc := tc\\n\\t\\tt.Run(tc.name, func(t *testing.T) {\\n\\t\\t\\tsrc := prelude + tc.query\\n\\n\\t\\t\\tctx, deps := dependency.Inject(context.Background(), dependenciestest.Default())\\n\\t\\t\\tdefer deps.Finish()\\n\\n\\t\\t\\tsideEffects, _, err := runtime.Eval(ctx, src)\\n\\t\\t\\tif err != nil {\\n\\t\\t\\t\\tif tc.wantErr == \\\"\\\" {\\n\\t\\t\\t\\t\\tt.Fatalf(\\\"unexpected error: %s\\\", err)\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// We expect an error, so it should be a non-internal Flux error.\\n\\t\\t\\t\\tif code := flux.ErrorCode(err); code == codes.Internal || code == codes.Unknown {\\n\\t\\t\\t\\t\\tt.Errorf(\\\"expected non-internal error code, got %s\\\", code)\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tre := regexp.MustCompile(tc.wantErr)\\n\\t\\t\\t\\tif got := err.Error(); !re.MatchString(got) {\\n\\t\\t\\t\\t\\tt.Errorf(\\\"expected error to match pattern %q, but error was %q\\\", tc.wantErr, got)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn\\n\\t\\t\\t} else if tc.wantErr != \\\"\\\" {\\n\\t\\t\\t\\tt.Fatal(\\\"expected error\\\")\\n\\t\\t\\t}\\n\\n\\t\\t\\tvs := getSideEffectsValues(sideEffects)\\n\\t\\t\\tif tc.want != nil && !cmp.Equal(tc.want, vs, semantictest.CmpOptions...) {\\n\\t\\t\\t\\tt.Fatalf(\\\"unexpected side effect values -want/+got: \\\\n%s\\\", cmp.Diff(tc.want, vs, semantictest.CmpOptions...))\\n\\t\\t\\t}\\n\\t\\t})\\n\\t}\\n}\",\n \"func (ev *Evaler) Eval(name, text string, n *parse.Chunk, ports []*Port) error {\\n\\top, err := ev.Compile(name, text, n)\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\tec := NewTopEvalCtx(ev, name, text, ports)\\n\\treturn ec.PEval(op)\\n}\",\n \"func (e *Evaluator) Eval(expr *tipb.Expr) (types.Datum, error) {\\n\\tswitch expr.GetTp() {\\n\\tcase tipb.ExprType_Null:\\n\\t\\treturn types.Datum{}, nil\\n\\tcase tipb.ExprType_Int64:\\n\\t\\treturn e.evalInt(expr.Val)\\n\\tcase tipb.ExprType_Uint64:\\n\\t\\treturn e.evalUint(expr.Val)\\n\\tcase tipb.ExprType_String:\\n\\t\\treturn e.evalString(expr.Val)\\n\\tcase tipb.ExprType_Bytes:\\n\\t\\treturn types.NewBytesDatum(expr.Val), nil\\n\\tcase tipb.ExprType_Float32:\\n\\t\\treturn e.evalFloat(expr.Val, true)\\n\\tcase tipb.ExprType_Float64:\\n\\t\\treturn e.evalFloat(expr.Val, false)\\n\\tcase tipb.ExprType_MysqlDecimal:\\n\\t\\treturn e.evalDecimal(expr.Val)\\n\\tcase tipb.ExprType_MysqlDuration:\\n\\t\\treturn e.evalDuration(expr.Val)\\n\\tcase tipb.ExprType_ColumnRef:\\n\\t\\treturn e.evalColumnRef(expr.Val)\\n\\tcase tipb.ExprType_LT:\\n\\t\\treturn e.evalLT(expr)\\n\\tcase tipb.ExprType_LE:\\n\\t\\treturn e.evalLE(expr)\\n\\tcase tipb.ExprType_EQ:\\n\\t\\treturn e.evalEQ(expr)\\n\\tcase tipb.ExprType_NE:\\n\\t\\treturn e.evalNE(expr)\\n\\tcase tipb.ExprType_GE:\\n\\t\\treturn e.evalGE(expr)\\n\\tcase tipb.ExprType_GT:\\n\\t\\treturn e.evalGT(expr)\\n\\tcase tipb.ExprType_NullEQ:\\n\\t\\treturn e.evalNullEQ(expr)\\n\\tcase tipb.ExprType_And:\\n\\t\\treturn e.evalAnd(expr)\\n\\tcase tipb.ExprType_Or:\\n\\t\\treturn e.evalOr(expr)\\n\\tcase tipb.ExprType_Like:\\n\\t\\treturn e.evalLike(expr)\\n\\tcase tipb.ExprType_Not:\\n\\t\\treturn e.evalNot(expr)\\n\\tcase tipb.ExprType_In:\\n\\t\\treturn e.evalIn(expr)\\n\\tcase tipb.ExprType_Plus, tipb.ExprType_Div:\\n\\t\\treturn e.evalArithmetic(expr)\\n\\t}\\n\\treturn types.Datum{}, nil\\n}\",\n \"func (this *Mod) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.BinaryEval(this, item, context)\\n}\",\n \"func (this *NowStr) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.Eval(this, item, context)\\n}\",\n \"func (*Base) Unary(p ASTPass, node *ast.Unary, ctx Context) {\\n\\tp.Visit(p, &node.Expr, ctx)\\n}\",\n \"func (i *IntNode) Eval(m memory.M) dragonscript.Value {\\n\\treturn dragonscript.Integer(i.value)\\n}\",\n \"func (this *ObjectNames) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.UnaryEval(this, item, context)\\n}\",\n \"func (this *ObjectNames) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.UnaryEval(this, item, context)\\n}\",\n \"func (op *OpDiv) Eval(x, y float32) float32 {\\n\\treturn op.LeftChild.Eval(x, y) / op.RightChild.Eval(x, y)\\n}\",\n \"func (e *Not) Eval(ctx *sql.Context, row sql.Row) (interface{}, error) {\\n\\tv, err := e.Child.Eval(ctx, row)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\tif v == nil {\\n\\t\\treturn nil, nil\\n\\t}\\n\\n\\treturn !v.(bool), nil\\n}\",\n \"func (l *ListType) eval() Value {\\n\\treturn l\\n}\",\n \"func eval(x interface{}, env map[string]interface{}) interface{} {\\r\\n if str, ok := isSymbol(x); ok { // variable reference\\r\\n\\treturn env[str]\\r\\n }\\r\\n l, ok := isList(x)\\r\\n if !ok { // constant literal\\r\\n\\treturn x\\r\\n }\\r\\n if len(l) == 0 {\\r\\n\\tpanic(\\\"empty list\\\")\\r\\n }\\r\\n if str, ok := isSymbol(l[0]); ok {\\r\\n\\tswitch (str) {\\r\\n\\tcase \\\"quote\\\": // (quote exp)\\r\\n\\t return l[1]\\r\\n\\tcase \\\"if\\\": // (if test conseq alt)\\r\\n\\t test := l[1]\\r\\n\\t conseq := l[2]\\r\\n\\t alt := l[3]\\r\\n\\t r := eval(test, env)\\r\\n\\t if b, ok := isFalse(r); ok && !b {\\r\\n\\t\\treturn eval(alt, env)\\r\\n\\t } else {\\r\\n\\t\\treturn eval(conseq, env)\\r\\n\\t }\\r\\n\\tcase \\\"define\\\": // (define var exp)\\r\\n\\t car := l[1]\\r\\n\\t cdr := l[2]\\r\\n\\t if str, ok = isSymbol(car); ok {\\r\\n\\t\\tenv[str] = eval(cdr, env)\\r\\n\\t\\treturn env[str]\\r\\n\\t } else {\\r\\n\\t\\tpanic(\\\"define needs a symbol\\\")\\r\\n\\t }\\r\\n\\tdefault: // (proc arg...)\\r\\n\\t car := eval(l[0], env)\\r\\n\\t proc, ok := car.(func([]interface{})interface{})\\r\\n\\t if !ok {\\r\\n\\t\\tpanic(\\\"not a procedure\\\")\\r\\n\\t }\\r\\n args := makeArgs(l[1:], env)\\r\\n return proc(args)\\r\\n\\t}\\r\\n }\\r\\n return nil\\r\\n}\",\n \"func (e *Not) Eval(ctx *sql.Context, row sql.Row) (interface{}, error) {\\n\\tv, err := e.Child.Eval(ctx, row)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tif v == nil {\\n\\t\\treturn nil, nil\\n\\t}\\n\\n\\tb, ok := v.(bool)\\n\\tif !ok {\\n\\t\\tb, err = types.ConvertToBool(v)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\t}\\n\\n\\treturn !b, nil\\n}\",\n \"func (op *OpCos) Eval(x, y float32) float32 {\\n\\treturn float32(math.Cos(float64(op.Child.Eval(x, y))))\\n}\",\n \"func evaluateExpression(c *Context, exp interface{}) interface{} {\\r\\n var val interface{}\\r\\n\\r\\n // fmt.Printf(\\\"Evaluating type %T, \\\\n\\\", exp)\\r\\n switch t := exp.(type) {\\r\\n case int:\\r\\n // fmt.Printf(\\\"Returning int %d\\\\n\\\", t)\\r\\n val = t\\r\\n case *Integer:\\r\\n val = t.Number\\r\\n case *StringPrimitive:\\r\\n val = t.str\\r\\n case string:\\r\\n val = t\\r\\n case []interface{}:\\r\\n val = t\\r\\n case *InfixExpression:\\r\\n // fmt.Printf(\\\"Evaluating infix expresison %T l: %T, r:%T\\\\n\\\", t,t.leftNode.Exp, t.rightNode.Exp)\\r\\n //Get the value of the left node and right\\r\\n lVal := evaluateExpression(c, t.leftNode.Exp)\\r\\n rVal := evaluateExpression(c, t.rightNode.Exp)\\r\\n\\r\\n\\r\\n //then apply the correct infix operator to the values\\r\\n val = evaluateInfixExpression(c, t.opType, lVal, rVal)\\r\\n\\r\\n case *Identifier:\\r\\n // fmt.Printf(\\\"Was identifier returning %v\\\\n\\\", t.id)\\r\\n if(t.id == \\\"nil\\\") {\\r\\n val = NewNil(0)\\r\\n } else {\\r\\n // fmt.Printf(\\\"Posssible indeitEifer %T\\\\n\\\", c.values[t.id])\\r\\n val = evaluateExpression(c, c.values[t.id])\\r\\n }\\r\\n case *CallExpression:\\r\\n // fmt.Printf(\\\"Evaluation call to %s\\\\n\\\",t.callee)\\r\\n\\r\\n //get declaration of call\\r\\n callDec := c.lookup(t.callee).(*FuncDeclaration)\\r\\n if(callDec.returnType == \\\"\\\") { //no rreturn type = unit\\r\\n val = &UnitType{}\\r\\n } else { //Evaluate the expression of the body for a value\\r\\n //This should produce a value and will execute all\\r\\n //of the code of the body as well\\r\\n for i, _ := range callDec.paramNodes {\\r\\n paramDec := callDec.paramNodes[i].Exp.(*Param)\\r\\n paramValue := t.paramNodes[i].Exp\\r\\n c.values[paramDec.id] = evaluateExpression(c, paramValue)\\r\\n val = c.values[paramDec.id]\\r\\n }\\r\\n\\r\\n }\\r\\n\\r\\n if(t.callee == \\\"printi\\\") {\\r\\n invokePrintI(c, t)\\r\\n } else if(t.callee == \\\"print\\\") {\\r\\n invokePrint(c, t)\\r\\n } else if(t.callee == \\\"not\\\") {\\r\\n invokeNot(c, t)\\r\\n } else { //Regular other user defined function do your thing!\\r\\n //invoke the body\\r\\n //Get the declaration of the calling function so we can execute it\\r\\n callDec := c.lookup(t.callee).(*FuncDeclaration)\\r\\n // fmt.Printf(\\\"Invoking random func \\\\n\\\")\\r\\n evaluateExpression(c, callDec.body.Exp)\\r\\n }\\r\\n case *IfThenElseExpression:\\r\\n condition := evaluateExpression(c, t.condNode.Exp).(bool)\\r\\n // fmt.Printf(\\\"Cond was %v \\\\n\\\", condition)\\r\\n //If else is nil then its an IfThen Exp\\r\\n if(t.elseNode == nil) {\\r\\n val = &UnitType{}\\r\\n if(condition) { //if the condition is true evaluatie the code inside\\r\\n evaluateExpression(c, t.thenNode.Exp)\\r\\n }\\r\\n } else { //otherwise its and ifThenElse\\r\\n if(condition) {\\r\\n val = evaluateExpression(c, t.thenNode.Exp)\\r\\n } else {\\r\\n val = evaluateExpression(c, t.elseNode.Exp)\\r\\n }\\r\\n }\\r\\n case *SeqExpression:\\r\\n // Value is equivalent to the last node of the seqence expression\\r\\n if(len(t.nodes) == 0) {\\r\\n val = &UnitType{}\\r\\n } else {\\r\\n // fmt.Printf(\\\"Seq type was %T\\\\n\\\", t.nodes[len(t.nodes)-1].Exp)\\r\\n val = evaluateExpression(c, t.nodes[len(t.nodes)-1].Exp)\\r\\n }\\r\\n case *Nil:\\r\\n val = NewNil(0)\\r\\n case *ArrayExp:\\r\\n arrType := getType(c, c.lookup(t.typeId)).(*Identifier)\\r\\n val = c.lookup(arrType.id)\\r\\n case *ForExpression:\\r\\n val = &UnitType{}\\r\\n case *LetExpression:\\r\\n if(len(t.exps) == 0) {\\r\\n val = &UnitType{}\\r\\n } else {\\r\\n // fmt.Printf(\\\"%T is last exp type\\\\n\\\", t.exps[len(t.exps)-1].Exp)\\r\\n // val = getType(c, t.exps[len(t.exps)-1].Exp)\\r\\n }\\r\\n case *Assignment:\\r\\n val = &UnitType{}\\r\\n case *RecordExp:\\r\\n var slc []interface{}\\r\\n for _, fcNode := range t.fieldCreateNodes {\\r\\n if b, isABinding := fcNode.Exp.(*Binding); isABinding {\\r\\n slc = append(slc, evaluateExpression(c, b.exp.Exp))\\r\\n }\\r\\n }\\r\\n val = slc\\r\\n default:\\r\\n fmt.Fprintf(os.Stderr, \\\"Could not evaluate exp %T\\\\n\\\", t)\\r\\n os.Exit(4)\\r\\n }\\r\\n\\r\\n return val\\r\\n}\",\n \"func (da *DateArith) Eval(ctx context.Context, args map[interface{}]interface{}) (interface{}, error) {\\n\\tt, years, months, days, durations, err := da.evalArgs(ctx, args)\\n\\tif t.IsZero() || err != nil {\\n\\t\\treturn nil, errors.Trace(err)\\n\\t}\\n\\n\\tif !da.isAdd() {\\n\\t\\tyears, months, days, durations = -years, -months, -days, -durations\\n\\t}\\n\\tt.Time = t.Time.Add(durations)\\n\\tt.Time = t.Time.AddDate(int(years), int(months), int(days))\\n\\n\\t// \\\"2011-11-11 10:10:20.000000\\\" outputs \\\"2011-11-11 10:10:20\\\".\\n\\tif t.Time.Nanosecond() == 0 {\\n\\t\\tt.Fsp = 0\\n\\t}\\n\\n\\treturn t, nil\\n}\",\n \"func Eval(node ast.Node, env *object.Environment) object.Object {\\n\\tswitch node := node.(type) {\\n\\n\\t// Statements\\n\\tcase *ast.RootNode:\\n\\t\\treturn evalRootNode(node, env)\\n\\n\\tcase *ast.BlockStatement:\\n\\t\\treturn evalBlockStmt(node, env)\\n\\n\\tcase *ast.ExpressionStatement:\\n\\t\\treturn Eval(node.Expression, env)\\n\\n\\tcase *ast.ReturnStatement:\\n\\t\\tval := Eval(node.ReturnValue, env)\\n\\t\\tif isError(val) {\\n\\t\\t\\treturn val\\n\\t\\t}\\n\\t\\treturn &object.ReturnValue{Value: val}\\n\\n\\tcase *ast.LetStatement:\\n\\t\\tval := Eval(node.Value, env)\\n\\t\\tif isError(val) {\\n\\t\\t\\treturn val\\n\\t\\t}\\n\\t\\tenv.Set(node.Name.Value, val)\\n\\n\\tcase *ast.ConstStatement:\\n\\t\\tval := Eval(node.Value, env)\\n\\t\\tif isError(val) {\\n\\t\\t\\treturn val\\n\\t\\t}\\n\\t\\tenv.Set(node.Name.Value, val)\\n\\n\\t// Expressions\\n\\tcase *ast.IntegerLiteral:\\n\\t\\treturn &object.Integer{Value: node.Value}\\n\\n\\tcase *ast.StringLiteral:\\n\\t\\treturn &object.String{Value: node.Value}\\n\\n\\tcase *ast.Boolean:\\n\\t\\treturn nativeBoolToBooleanObj(node.Value)\\n\\n\\tcase *ast.PrefixExpression:\\n\\t\\tright := Eval(node.Right, env)\\n\\t\\tif isError(right) {\\n\\t\\t\\treturn right\\n\\t\\t}\\n\\t\\treturn evalPrefixExpr(node.Operator, right, node.Token.Line)\\n\\n\\tcase *ast.InfixExpression:\\n\\t\\tleft := Eval(node.Left, env)\\n\\t\\tif isError(left) {\\n\\t\\t\\treturn left\\n\\t\\t}\\n\\t\\tright := Eval(node.Right, env)\\n\\t\\tif isError(right) {\\n\\t\\t\\treturn right\\n\\t\\t}\\n\\t\\treturn evalInfixExpr(node.Operator, left, right, node.Token.Line)\\n\\n\\tcase *ast.PostfixExpression:\\n\\t\\treturn evalPostfixExpr(env, node.Operator, node)\\n\\n\\tcase *ast.IfExpression:\\n\\t\\treturn evalIfExpr(node, env)\\n\\n\\tcase *ast.Identifier:\\n\\t\\treturn evalIdentifier(node, env)\\n\\n\\tcase *ast.FunctionLiteral:\\n\\t\\tparams := node.Parameters\\n\\t\\tbody := node.Body\\n\\t\\treturn &object.Function{\\n\\t\\t\\tParameters: params,\\n\\t\\t\\tBody: body,\\n\\t\\t\\tEnv: env,\\n\\t\\t}\\n\\n\\tcase *ast.CallExpression:\\n\\t\\tfn := Eval(node.Function, env)\\n\\t\\tif isError(fn) {\\n\\t\\t\\treturn fn\\n\\t\\t}\\n\\t\\targs := evalExprs(node.Arguments, env)\\n\\t\\tif len(args) == 1 && isError(args[0]) {\\n\\t\\t\\treturn args[0]\\n\\t\\t}\\n\\t\\treturn applyFunction(fn, args, node.Token.Line)\\n\\n\\tcase *ast.ArrayLiteral:\\n\\t\\telements := evalExprs(node.Elements, env)\\n\\t\\tif len(elements) == 1 && isError(elements[0]) {\\n\\t\\t\\treturn elements[0]\\n\\t\\t}\\n\\t\\treturn &object.Array{Elements: elements}\\n\\n\\tcase *ast.IndexExpression:\\n\\t\\tleft := Eval(node.Left, env)\\n\\t\\tif isError(left) {\\n\\t\\t\\treturn left\\n\\t\\t}\\n\\t\\tindex := Eval(node.Index, env)\\n\\t\\tif isError(index) {\\n\\t\\t\\treturn index\\n\\t\\t}\\n\\t\\treturn evalIndexExpr(left, index, node.Token.Line)\\n\\n\\tcase *ast.HashLiteral:\\n\\t\\treturn evalHashLiteral(node, env)\\n\\t}\\n\\n\\treturn nil\\n}\",\n \"func Evaluate(item interface{}, passedContext interface{}) map[string]float64 {\\n\\t//fmt.Fprintf(os.Stderr, \\\"eval:: %v %T\\\\n\\\", item, item)\\n\\n\\tif item != nil {\\n\\t\\tswitch passedContext.(type) {\\n\\t\\tcase *DimContext:\\n\\t\\t\\t{\\n\\t\\t\\t\\t//fmt.Fprintf(os.Stderr, \\\"here before processMember %v\\\\n\\\", item)\\n\\t\\t\\t\\tprocessMember(item, passedContext)\\n\\t\\t\\t\\t//fmt.Fprintf(os.Stderr, \\\"here after processMember %v %T\\\\n\\\", item, item)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tswitch v := item.(type) {\\n\\t\\tcase hasResults:\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn v.Results()\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn nil\\n}\",\n \"func (sf *ScalarFunction) Eval(row chunk.Row) (d types.Datum, err error) {\\n\\tvar (\\n\\t\\tres interface{}\\n\\t\\tisNull bool\\n\\t)\\n\\tswitch tp, evalType := sf.GetType(), sf.GetType().EvalType(); evalType {\\n\\tcase types.ETInt:\\n\\t\\tvar intRes int64\\n\\t\\tintRes, isNull, err = sf.EvalInt(sf.GetCtx(), row)\\n\\t\\tif mysql.HasUnsignedFlag(tp.Flag) {\\n\\t\\t\\tres = uint64(intRes)\\n\\t\\t} else {\\n\\t\\t\\tres = intRes\\n\\t\\t}\\n\\tcase types.ETString:\\n\\t\\tres, isNull, err = sf.EvalString(sf.GetCtx(), row)\\n\\t}\\n\\n\\tif isNull || err != nil {\\n\\t\\td.SetNull()\\n\\t\\treturn d, err\\n\\t}\\n\\td.SetValue(res, sf.RetType)\\n\\treturn\\n}\",\n \"func (s server) Eval(ctx context.Context, req *entity.Request) (*entity.Result, error) {\\n\\tlog.Printf(\\\"Received a request: %+v\\\\n\\\", req)\\n\\tresult := &entity.Result{}\\n\\tres, err := s.usecase.Eval(req.Value)\\n\\tif err != nil {\\n\\t\\treturn result, err\\n\\t}\\n\\tresult.Value = strconv.FormatFloat(res, 'G', -1, 64)\\n\\treturn result, nil\\n}\",\n \"func execEval(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(4)\\n\\tret, ret1 := types.Eval(args[0].(*token.FileSet), args[1].(*types.Package), token.Pos(args[2].(int)), args[3].(string))\\n\\tp.Ret(4, ret, ret1)\\n}\",\n \"func (p Polynomial) Eval(arg int) ed25519.Scalar {\\n\\tx := ed25519.New_scalar(*big.NewInt(int64(arg)))\\n\\tresult := p.coeffs[0].Add(p.coeffs[1].Mul(x))\\n\\tx_pow := x.Copy()\\n\\tfor i := 2; i < len(p.coeffs); i++ {\\n\\t\\tx_pow = x_pow.Mul(x)\\n\\t\\tresult = result.Add(p.coeffs[i].Mul(x_pow))\\n\\t}\\n\\treturn result\\n}\",\n \"func (s Scope) Eval(ctx context.Context, local Scope) (Value, error) {\\n\\ttuple := NewTuple()\\n\\tfor e := s.Enumerator(); e.MoveNext(); {\\n\\t\\tname, expr := e.Current()\\n\\t\\tvalue, err := expr.Eval(ctx, local)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn nil, WrapContextErr(err, expr, local)\\n\\t\\t}\\n\\t\\ttuple = tuple.With(name, value)\\n\\t}\\n\\treturn tuple, nil\\n}\",\n \"func (t *Check) Eval(r, s string) (bool, error) {\\n\\treturn false, errors.New(\\\"Not implemented\\\")\\n}\",\n \"func (r *Rule) Eval(devices *devices.List, rules map[string]bool) (bool, error) {\\n\\treturn eval(r.Expression(), devices, rules, r.ast)\\n}\",\n \"func lvalCall(e *LEnv, f *LVal, a *LVal) *LVal {\\n\\t//If it is a builtin function, return the result of running that function\\n\\tif f.Builtin != nil {\\n\\t\\treturn f.Builtin(e, a)\\n\\t}\\n\\n\\t//Bind the arguments that were passed into the function\\n\\tfor len(a.Cell) > 0 {\\n\\t\\tif len(f.Formals.Cell) == 0 {\\n\\t\\t\\treturn lvalErr(\\\"Function passed too many arguments\\\")\\n\\t\\t}\\n\\n\\t\\tsym := lvalPop(f.Formals, 0)\\n\\n\\t\\tif sym.Sym == \\\"&\\\" {\\n\\t\\t\\tif len(f.Formals.Cell) != 1 {\\n\\t\\t\\t\\treturn lvalErr(\\\"Symbol & not followed by a single symbol.\\\")\\n\\t\\t\\t}\\n\\n\\t\\t\\tnsym := lvalPop(f.Formals, 0)\\n\\t\\t\\tlenvPut(f.Env, nsym, builtinList(e, a))\\n\\t\\t}\\n\\n\\t\\tval := lvalPop(a, 0)\\n\\n\\t\\tlenvPut(f.Env, sym, val)\\n\\t}\\n\\n\\tif len(f.Formals.Cell) == 0 {\\n\\t\\tf.Env.Par = e\\n\\n\\t\\treturn builtinEval(f.Env, lvalAdd(lvalSexpr(), lvalCopy(f.Body)))\\n\\t} else {\\n\\t\\treturn lvalCopy(f)\\n\\t}\\n}\",\n \"func unary(typ int, op string, od1 *expr) *expr {\\n\\treturn &expr{\\n\\t\\tsexp: append(exprlist{atomic(typ, op)}, od1),\\n\\t}\\n}\",\n \"func (f UnFunc) Apply(ctx context.Context, data interface{}) (interface{}, error) {\\n\\treturn f(ctx, data)\\n}\",\n \"func (ev *evaluator) eval(expr Expr) model.Value {\\n\\t// This is the top-level evaluation method.\\n\\t// Thus, we check for timeout/cancellation here.\\n\\tif err := contextDone(ev.ctx, \\\"expression evaluation\\\"); err != nil {\\n\\t\\tev.error(err)\\n\\t}\\n\\n\\tswitch e := expr.(type) {\\n\\tcase *AggregateExpr:\\n\\t\\tvector := ev.evalVector(e.Expr)\\n\\t\\treturn ev.aggregation(e.Op, e.Grouping, e.Without, e.KeepCommonLabels, e.Param, vector)\\n\\n\\tcase *BinaryExpr:\\n\\t\\tlhs := ev.evalOneOf(e.LHS, model.ValScalar, model.ValVector)\\n\\t\\trhs := ev.evalOneOf(e.RHS, model.ValScalar, model.ValVector)\\n\\n\\t\\tswitch lt, rt := lhs.Type(), rhs.Type(); {\\n\\t\\tcase lt == model.ValScalar && rt == model.ValScalar:\\n\\t\\t\\treturn &model.Scalar{\\n\\t\\t\\t\\tValue: scalarBinop(e.Op, lhs.(*model.Scalar).Value, rhs.(*model.Scalar).Value),\\n\\t\\t\\t\\tTimestamp: ev.Timestamp,\\n\\t\\t\\t}\\n\\n\\t\\tcase lt == model.ValVector && rt == model.ValVector:\\n\\t\\t\\tswitch e.Op {\\n\\t\\t\\tcase itemLAND:\\n\\t\\t\\t\\treturn ev.vectorAnd(lhs.(vector), rhs.(vector), e.VectorMatching)\\n\\t\\t\\tcase itemLOR:\\n\\t\\t\\t\\treturn ev.vectorOr(lhs.(vector), rhs.(vector), e.VectorMatching)\\n\\t\\t\\tcase itemLUnless:\\n\\t\\t\\t\\treturn ev.vectorUnless(lhs.(vector), rhs.(vector), e.VectorMatching)\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\treturn ev.vectorBinop(e.Op, lhs.(vector), rhs.(vector), e.VectorMatching, e.ReturnBool)\\n\\t\\t\\t}\\n\\t\\tcase lt == model.ValVector && rt == model.ValScalar:\\n\\t\\t\\treturn ev.vectorScalarBinop(e.Op, lhs.(vector), rhs.(*model.Scalar), false, e.ReturnBool)\\n\\n\\t\\tcase lt == model.ValScalar && rt == model.ValVector:\\n\\t\\t\\treturn ev.vectorScalarBinop(e.Op, rhs.(vector), lhs.(*model.Scalar), true, e.ReturnBool)\\n\\t\\t}\\n\\n\\tcase *Call:\\n\\t\\treturn e.Func.Call(ev, e.Args)\\n\\n\\tcase *MatrixSelector:\\n\\t\\treturn ev.matrixSelector(e)\\n\\n\\tcase *NumberLiteral:\\n\\t\\treturn &model.Scalar{Value: e.Val, Timestamp: ev.Timestamp}\\n\\n\\tcase *ParenExpr:\\n\\t\\treturn ev.eval(e.Expr)\\n\\n\\tcase *StringLiteral:\\n\\t\\treturn &model.String{Value: e.Val, Timestamp: ev.Timestamp}\\n\\n\\tcase *UnaryExpr:\\n\\t\\tse := ev.evalOneOf(e.Expr, model.ValScalar, model.ValVector)\\n\\t\\t// Only + and - are possible operators.\\n\\t\\tif e.Op == itemSUB {\\n\\t\\t\\tswitch v := se.(type) {\\n\\t\\t\\tcase *model.Scalar:\\n\\t\\t\\t\\tv.Value = -v.Value\\n\\t\\t\\tcase vector:\\n\\t\\t\\t\\tfor i, sv := range v {\\n\\t\\t\\t\\t\\tv[i].Value = -sv.Value\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn se\\n\\n\\tcase *VectorSelector:\\n\\t\\treturn ev.vectorSelector(e)\\n\\t}\\n\\tpanic(fmt.Errorf(\\\"unhandled expression of type: %T\\\", expr))\\n}\",\n \"func (m *MockExpressionNode) Eval() func(backend.Row) (core.Value, error) {\\n\\tm.ctrl.T.Helper()\\n\\tret := m.ctrl.Call(m, \\\"Eval\\\")\\n\\tret0, _ := ret[0].(func(backend.Row) (core.Value, error))\\n\\treturn ret0\\n}\",\n \"func (o NotOperator) Evaluate(ctx interface{}) (bool, error) {\\n\\t// fmt.Println(\\\"Not.Evaluate()\\\")\\n\\tresult, err := o.Operand.Evaluate(ctx)\\n\\treturn !result, err\\n}\",\n \"func evaluate(arg1 *vector.Vector, oper *vector.Vector, arg2 *vector.Vector) *vector.Vector {\\n\\t//Store the operator in a temp string, to save typing it out\\n\\tvar operS string\\n\\toperS = oper.At(0).(string)\\n\\tvar val1, val2 int \\n\\tvar err1, err2 os.Error\\n\\tval1, err1 = strconv.Atoi(arg1.At(0).(string))\\n\\tval2, err2 = strconv.Atoi(arg2.At(0).(string))\\n\\t//screens for consecutive operators\\n\\tif(err1 != nil || err2 != nil){\\n\\t\\tfmt.Println(\\\"expr: syntax error\\\")\\n\\t\\tos.Exit(-2)\\n\\t}\\n\\tvar result int = -1\\n\\t//Evaluate based on the operator\\n\\tif operS == \\\"+\\\" {\\n\\t\\tresult = val1 + val2\\n\\t} else if operS == \\\"-\\\" {\\n\\t\\tresult = val1 - val2\\n\\t} else if operS == \\\"/\\\" {\\n\\t\\tresult = val1 / val2\\n\\t} else if operS == \\\"*\\\" {\\n\\t\\tresult = val1 * val2\\n\\t} else if operS == \\\"%\\\" {\\n\\t\\tresult = val1 % val2\\n\\t}\\n\\t//Clear the arg1 vector and add the result to it, then return\\n\\t//(saves memory by not creating a new vector)\\n\\targ1.Cut(0, arg1.Len())\\n\\targ1.Push(strconv.Itoa(result))\\n\\treturn arg1\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.65601635","0.62554264","0.610906","0.6098628","0.60711527","0.6037241","0.5988044","0.5928711","0.5928711","0.58814615","0.587307","0.58361375","0.5803793","0.5803793","0.5791637","0.5744556","0.57429147","0.5731631","0.5702675","0.5695341","0.56899124","0.5676062","0.56697935","0.56211776","0.5592483","0.55849653","0.558394","0.5576499","0.5535295","0.5528006","0.55279297","0.55061173","0.54976064","0.54953825","0.5475016","0.54588026","0.5454834","0.5397715","0.5373656","0.53727204","0.5368078","0.5363978","0.5363978","0.53551155","0.5354837","0.5352133","0.53508174","0.5330089","0.53097206","0.5306045","0.5288367","0.528527","0.5282669","0.52825105","0.5278601","0.5274988","0.5264876","0.5263729","0.5260502","0.5253249","0.52510667","0.52458805","0.52344036","0.52322716","0.5227688","0.5227688","0.52232075","0.5196801","0.51947314","0.5179887","0.5176868","0.51663756","0.5158357","0.51531756","0.51372516","0.5130771","0.5130771","0.51301783","0.5125869","0.5124272","0.512265","0.5111888","0.511074","0.51081043","0.51079035","0.5107867","0.5105482","0.5097828","0.50875163","0.50613976","0.50544703","0.5051202","0.50444084","0.50313026","0.50251466","0.50213575","0.5020417","0.5013555","0.50101","0.5006659","0.50044125"],"string":"[\n \"0.65601635\",\n \"0.62554264\",\n \"0.610906\",\n \"0.6098628\",\n \"0.60711527\",\n \"0.6037241\",\n \"0.5988044\",\n \"0.5928711\",\n \"0.5928711\",\n \"0.58814615\",\n \"0.587307\",\n \"0.58361375\",\n \"0.5803793\",\n \"0.5803793\",\n \"0.5791637\",\n \"0.5744556\",\n \"0.57429147\",\n \"0.5731631\",\n \"0.5702675\",\n \"0.5695341\",\n \"0.56899124\",\n \"0.5676062\",\n \"0.56697935\",\n \"0.56211776\",\n \"0.5592483\",\n \"0.55849653\",\n \"0.558394\",\n \"0.5576499\",\n \"0.5535295\",\n \"0.5528006\",\n \"0.55279297\",\n \"0.55061173\",\n \"0.54976064\",\n \"0.54953825\",\n \"0.5475016\",\n \"0.54588026\",\n \"0.5454834\",\n \"0.5397715\",\n \"0.5373656\",\n \"0.53727204\",\n \"0.5368078\",\n \"0.5363978\",\n \"0.5363978\",\n \"0.53551155\",\n \"0.5354837\",\n \"0.5352133\",\n \"0.53508174\",\n \"0.5330089\",\n \"0.53097206\",\n \"0.5306045\",\n \"0.5288367\",\n \"0.528527\",\n \"0.5282669\",\n \"0.52825105\",\n \"0.5278601\",\n \"0.5274988\",\n \"0.5264876\",\n \"0.5263729\",\n \"0.5260502\",\n \"0.5253249\",\n \"0.52510667\",\n \"0.52458805\",\n \"0.52344036\",\n \"0.52322716\",\n \"0.5227688\",\n \"0.5227688\",\n \"0.52232075\",\n \"0.5196801\",\n \"0.51947314\",\n \"0.5179887\",\n \"0.5176868\",\n \"0.51663756\",\n \"0.5158357\",\n \"0.51531756\",\n \"0.51372516\",\n \"0.5130771\",\n \"0.5130771\",\n \"0.51301783\",\n \"0.5125869\",\n \"0.5124272\",\n \"0.512265\",\n \"0.5111888\",\n \"0.511074\",\n \"0.51081043\",\n \"0.51079035\",\n \"0.5107867\",\n \"0.5105482\",\n \"0.5097828\",\n \"0.50875163\",\n \"0.50613976\",\n \"0.50544703\",\n \"0.5051202\",\n \"0.50444084\",\n \"0.50313026\",\n \"0.50251466\",\n \"0.50213575\",\n \"0.5020417\",\n \"0.5013555\",\n \"0.50101\",\n \"0.5006659\",\n \"0.50044125\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":996,"cells":{"query":{"kind":"string","value":"/ This method returns the length of the object. If the type of input is missing then return a missing value, and if not an object return a null value. Convert it to a valid Go type. Cast it to a map from string to interface and return its length by using the len function by casting it to float64."},"document":{"kind":"string","value":"func (this *ObjectLength) Apply(context Context, arg value.Value) (value.Value, error) {\n\tif arg.Type() == value.MISSING {\n\t\treturn value.MISSING_VALUE, nil\n\t} else if arg.Type() != value.OBJECT {\n\t\treturn value.NULL_VALUE, nil\n\t}\n\n\toa := arg.Actual().(map[string]interface{})\n\treturn value.NewValue(float64(len(oa))), nil\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func (o *FakeObject) Length() int { return reflect.ValueOf(o.Value).Len() }","func length(v interface{}) (int, error) {\n\tswitch val := v.(type) {\n\tcase string:\n\t\treturn len(val), nil\n\tcase []interface{}:\n\t\treturn len(val), nil\n\tcase map[string]interface{}:\n\t\treturn len(val), nil\n\tdefault:\n\t\treturn -1, errors.New(\"invalid type for length\")\n\t}\n}","func (p MapStringToFloat64Ptrs) Len() int {\n\treturn len(p)\n}","func (i StringHashMap[T, V]) Len() int {\n\t// DEBUG:\n\tif len(i.hashToKey) != len(i.hashToVal) {\n\t\tpanic(\"hashToKey and hashToVal have different lengths\")\n\t}\n\treturn len(i.hashToKey)\n}","func (e *EventDTO) Size() int {\n\tsize := 1024\n\tif e.Properties == nil {\n\t\treturn size\n\t}\n\n\tfor key, value := range e.Properties {\n\t\tsize += len(key)\n\t\tswitch typedValue := value.(type) {\n\t\tcase string:\n\t\t\tsize += len(typedValue)\n\t\tdefault:\n\t\t}\n\t}\n\treturn size\n}","func (d *Data) Len() int {\n\tif d.Value == nil {\n\t\treturn 0\n\t}\n\tif d.IsSlice() {\n\t\treturn d.ValueOf().Len()\n\t}\n\tif n, ok := d.IsKeys(); ok {\n\t\treturn n\n\t}\n\n\treturn 1\n}","func (that *StrAnyMap) Size() int {\n\tthat.mu.RLock()\n\tlength := len(that.data)\n\tthat.mu.RUnlock()\n\treturn length\n}","func SizeOf(val reflect.Value) int64 {\n\ttk := val.Type().Kind()\n\n\tif tk == reflect.Ptr {\n\t\tif val.IsNil() {\n\t\t\treturn 0\n\t\t}\n\t\tval = val.Elem()\n\t\treturn SizeOf(val)\n\t}\n\n\tif tk == reflect.Slice {\n\t\tvar size int64 = 0\n\t\tfor i := 0; i < val.Len(); i++ {\n\t\t\tsize += SizeOf(val.Index(i))\n\t\t}\n\t\treturn size\n\t} else if tk == reflect.Struct {\n\t\tvar size int64 = 0\n\t\tfor i := 0; i < val.Type().NumField(); i++ {\n\t\t\tsize += SizeOf(val.Field(i))\n\t\t}\n\t\treturn size\n\n\t} else if tk == reflect.Map {\n\t\tvar size int64 = 0\n\t\tkeys := val.MapKeys()\n\t\tfor i := 0; i < len(keys); i++ {\n\t\t\tsize += SizeOf(keys[i])\n\t\t\tsize += SizeOf(val.MapIndex(keys[i]))\n\t\t}\n\t\treturn size\n\t}\n\n\tswitch val.Type().Name() {\n\tcase \"BOOLEAN\":\n\t\treturn 1\n\tcase \"INT32\":\n\t\treturn 4\n\tcase \"INT64\":\n\t\treturn 8\n\tcase \"INT96\":\n\t\treturn 12\n\tcase \"FLOAT\":\n\t\treturn 4\n\tcase \"DOUBLE\":\n\t\treturn 8\n\tcase \"BYTE_ARRAY\":\n\t\treturn int64(val.Len())\n\tcase \"FIXED_LEN_BYTE_ARRAY\":\n\t\treturn int64(val.Len())\n\tcase \"UTF8\":\n\t\treturn int64(val.Len())\n\tcase \"INT_8\":\n\t\treturn 4\n\tcase \"INT_16\":\n\t\treturn 4\n\tcase \"INT_32\":\n\t\treturn 4\n\tcase \"INT_64\":\n\t\treturn 8\n\tcase \"UINT_8\":\n\t\treturn 4\n\tcase \"UINT_16\":\n\t\treturn 4\n\tcase \"UINT_32\":\n\t\treturn 4\n\tcase \"UINT_64\":\n\t\treturn 8\n\tcase \"DATE\":\n\t\treturn 4\n\tcase \"TIME_MILLIS\":\n\t\treturn 4\n\tcase \"TIME_MICROS\":\n\t\treturn 8\n\tcase \"TIMESTAMP_MILLIS\":\n\t\treturn 8\n\tcase \"TIMESTAMP_MICROS\":\n\t\treturn 8\n\tcase \"INTERVAL\":\n\t\treturn 12\n\tcase \"DECIMAL\":\n\t\treturn int64(val.Len())\n\t}\n\n\treturn 4\n}","func (s *sortMap) Len() int {\n\treturn reflect.ValueOf(s.data).Len()\n}","func (obj object) Len() int {\n\treturn len(obj.keys)\n}","func (object Object) Length() int {\n\treturn len(object)\n}","func (o *Object) Size() int64 {\n\terr := o.readMetaData(context.TODO())\n\tif err != nil {\n\t\tfs.Logf(o, \"Failed to read metadata: %v\", err)\n\t\treturn 0\n\t}\n\treturn o.size\n}","func Length(i interface{}) (l int, ok bool) {\n\tv, k := preprocess(i)\n\tswitch k {\n\tcase reflect.Map, reflect.Array, reflect.Slice, reflect.String:\n\t\treturn v.Len(), true\n\t}\n\treturn 0, false\n}","func Size(d interface{}) int {\n\treturn size(reflect.ValueOf(d))\n}","func (o *Object) Size() int64 {\n\tctx := context.TODO()\n\terr := o.readMetaData(ctx)\n\tif err != nil {\n\t\tfs.Logf(o, \"Failed to read metadata: %v\", err)\n\t\treturn 0\n\t}\n\treturn o.size\n}","func (pmap *PropertyMap) Size() int {\n\tif pmap == nil {\n\t\treturn 0\n\t}\n\treturn len(pmap.m)\n}","func (node *GoValueNode) Length() (int, error) {\n\tif node.IsArray() || node.IsMap() || node.IsString() {\n\n\t\treturn node.thisValue.Len(), nil\n\t}\n\n\treturn 0, fmt.Errorf(\"this node identified as \\\"%s\\\" is not referencing an array, slice, map or string\", node.IdentifiedAs())\n}","func LengthOfValue(value interface{}) (int, error) {\n\tv := reflect.ValueOf(value)\n\tswitch v.Kind() {\n\tcase reflect.String, reflect.Slice, reflect.Map, reflect.Array:\n\t\treturn v.Len(), nil\n\t}\n\treturn 0, fmt.Errorf(\"cannot get the length of %v\", v.Kind())\n}","func (k *K) Len() int {\n\tif k.Type < K0 || k.Type >= KFUNC {\n\t\treturn 1\n\t} else if k.Type >= K0 && k.Type <= KT {\n\t\treturn reflect.ValueOf(k.Data).Len()\n\t} else if k.Type == XD {\n\t\treturn k.Data.(Dict).Key.Len()\n\t} else if k.Type == XT {\n\t\treturn k.Data.(Table).Data[0].Len()\n\t} else {\n\t\treturn -1\n\t}\n}","func (hm *HashMap) Len() int {\n\treturn hm.np.elemNum()\n}","func Length(i interface{}) (l int, ok bool) {\n\tswitch i := i.(type) {\n\tcase string:\n\t\treturn len(i), true\n\tcase []interface{}:\n\t\treturn len(i), true\n\tcase map[string]interface{}:\n\t\treturn len(i), true\n\tcase []int64:\n\t\treturn len(i), true\n\tcase []float64:\n\t\treturn len(i), true\n\tcase []bool:\n\t\treturn len(i), true\n\tcase map[string]float64:\n\t\treturn len(i), true\n\tcase map[string]string:\n\t\treturn len(i), true\n\tcase map[string]bool:\n\t\treturn len(i), true\n\tdefault:\n\t\treturn 0, false\n\t}\n}","func (self *Map) Len() int {\n\treturn len(self.MapNative())\n}","func (m Map) Length() int {\n\treturn len(m)\n}","func (i IntHashMap[T, V]) Len() int {\n\t// DEBUG:\n\tif len(i.hashToKey) != len(i.hashToVal) {\n\t\tpanic(\"hashToKey and hashToVal have different lengths\")\n\t}\n\treturn len(i.hashToKey)\n}","func GetSize(i interface{}) (int, error) {\n\tb := new(bytes.Buffer)\n if err := json.NewEncoder(b).Encode(i); err != nil {\n\t\treturn 0, fmt.Errorf(\"Failed to encode object of type (%T): %v\", i, err)\n\t}\n\treturn b.Len(), nil\n}","func (o *Object) Size() int64 {\n\tif o.meta == nil {\n\t\treturn o.size\n\t}\n\treturn o.meta.Size\n}","func (o *Object) Size() int64 {\n\treturn o.size\n}","func Len(m Map) int {\n\treturn m.count()\n}","func (m *OrderedMap[K, V]) Len() int {\n\tif m == nil {\n\t\treturn 0\n\t}\n\treturn m.len\n}","func (hm HashMap) Len(ctx context.Context) (int64, error) {\n\treq := newRequest(\"*2\\r\\n$4\\r\\nHLEN\\r\\n$\")\n\treq.addString(hm.name)\n\treturn hm.c.cmdInt(ctx, req)\n}","func (d *MetadataAsDictionary) Size() int {\n\tif d.metadata != nil {\n\t\treturn len(d.metadata)\n\t}\n\n\treturn len(d.source)\n}","func Len(val Value) (int, error) {\n\tif val == nil {\n\t\treturn 0, nil\n\t}\n\tr := reflect.Indirect(reflect.ValueOf(val))\n\tswitch r.Kind() {\n\tcase reflect.Slice, reflect.Array, reflect.Map:\n\t\treturn r.Len(), nil\n\t}\n\treturn 0, fmt.Errorf(`stick: could not get Length of %s \"%v\"`, r.Kind(), val)\n}","func (v *Value) Size() JSONSize {\n\treturn JSONSize(C.zj_SizeOf(v.V))\n}","func (o *Object) Size() int64 {\n\treturn o.bytes\n}","func (m *Map[K, V]) Len() int {\n\tm.mu.RLock()\n\tdefer m.mu.RUnlock()\n\n\treturn len(m.inner)\n}","func (jz *Jzon) Length() (l int, err error) {\n\tif jz.Type == JzTypeArr {\n\t\treturn len(jz.data.([]*Jzon)), nil\n\t}\n\n\tif jz.Type == JzTypeObj {\n\t\treturn len(jz.data.(map[string]*Jzon)), nil\n\t}\n\n\treturn -1, errors.New(\"expect node of type JzTypeArr or JzTypeObj\" +\n\t\t\", but the real type is \" + typeStrings[jz.Type])\n}","func (this *ExDomain) Size() int {\n\treturn len(this.Values) // assumes no mappings to false\n}","func (this *ObjectLength) Type() value.Type { return value.NUMBER }","func (this *ObjectLength) Type() value.Type { return value.NUMBER }","func (sm *ScanMap) Length() int {\n\treturn len(sm.hashMap)\n}","func (tt Map) Len() int {\n\treturn len(tt)\n}","func (m Map) Len() int {\n\treturn m.n\n}","func (f DFields) Len() int { return len(f) }","func sizeof(v reflect.Value, t reflect.Type) int {\n\tswitch t.Kind() {\n\tcase reflect.Array:\n\t\tif s := sizeof(v, t.Elem()); s >= 0 {\n\t\t\treturn s * t.Len()\n\t\t}\n\n\tcase reflect.Struct:\n\t\tsum := 0\n\t\tfor i, n := 0, t.NumField(); i < n; i++ {\n\t\t\ts := dataSize(v.Field(i))\n\t\t\tif s < 0 {\n\t\t\t\treturn -1\n\t\t\t}\n\t\t\tsum += s\n\t\t}\n\t\treturn sum\n\n\tcase reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uint,\n\t\treflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64, reflect.Int,\n\t\treflect.Float32, reflect.Float64, reflect.Complex64, reflect.Complex128,\n\t\treflect.Uintptr, reflect.Ptr:\n\t\treturn int(t.Size())\n\n\tcase reflect.String:\n\t\treturn len(v.String())\n\n\tcase reflect.Map:\n\t\tsum := 0\n\t\tfor _, mapKey := range v.MapKeys() {\n\t\t\tkeySize := dataSize(mapKey)\n\t\t\tvalueSize := dataSize(v.MapIndex(mapKey))\n\t\t\tif keySize < 0 || valueSize < 0 {\n\t\t\t\treturn -1\n\t\t\t}\n\t\t\tsum += keySize + valueSize\n\t\t}\n\t\treturn sum\n\t}\n\n\treturn -1\n}","func (geom Geometry) Length() float64 {\n\tlength := C.OGR_G_Length(geom.cval)\n\treturn float64(length)\n}","func (v valuer) Len() int {\n\treturn len(v.data)\n}","func size(v interface{}) int {\n\treturn dataSize(reflect.Indirect(reflect.ValueOf(v)))\n}","func fnLen(ctx Context, doc *JDoc, params []string) interface{} {\n\tstats := ctx.Value(EelTotalStats).(*ServiceStats)\n\tif params == nil || len(params) != 1 {\n\t\tctx.Log().Error(\"error_type\", \"func_len\", \"op\", \"len\", \"cause\", \"wrong_number_of_parameters\", \"params\", params)\n\t\tstats.IncErrors()\n\t\tAddError(ctx, SyntaxError{fmt.Sprintf(\"wrong number of parameters in call to len function\"), \"len\", params})\n\t\treturn nil\n\t}\n\tvar obj interface{}\n\terr := json.Unmarshal([]byte(extractStringParam(params[0])), &obj)\n\tif err != nil {\n\t\treturn len(extractStringParam(params[0]))\n\t}\n\tswitch obj.(type) {\n\tcase []interface{}:\n\t\treturn len(obj.([]interface{}))\n\tcase map[string]interface{}:\n\t\treturn len(obj.(map[string]interface{}))\n\t}\n\treturn 0\n}","func Size(v interface{}) int {\n\treturn dataSize(reflect.Indirect(reflect.ValueOf(v)))\n}","func (fm *FieldModelMapInt32OptionalBytes) Size() int {\n if (fm.buffer.Offset() + fm.FBEOffset() + fm.FBESize()) > fm.buffer.Size() {\n return 0\n }\n\n fbeMapOffset := int(fbe.ReadUInt32(fm.buffer.Data(), fm.buffer.Offset() + fm.FBEOffset()))\n if (fbeMapOffset == 0) || ((fm.buffer.Offset() + fbeMapOffset + 4) > fm.buffer.Size()) {\n return 0\n }\n\n fbeMapSize := int(fbe.ReadUInt32(fm.buffer.Data(), fm.buffer.Offset() + fbeMapOffset))\n return fbeMapSize\n}","func (m *Map) Len() int {\n\treturn int(m.len)\n}","func (o Object) Size() Size {\n\treturn o.size\n}","func (t colType) length() (int64, bool) {\n\tif !t.valid ||\n\t\tt.options&hasPrec != 0 || t.options&hasScale != 0 {\n\t\treturn 0, false\n\t}\n\n\t// long types\n\tif t.options&isLong != 0 {\n\t\tif t.dataType == longCharType {\n\t\t\treturn int64(t.size / 2), true\n\t\t}\n\t\tif t.encodingProps.scanType == reflect.TypeOf(\"\") {\n\t\t\treturn int64(t.size), true\n\t\t}\n\t\treturn math.MaxInt32, true\n\t}\n\n\treturn int64(t.size), t.options&hasLength != 0\n}","func (f Floats) Len() int {\n\tw, h := f.Size()\n\treturn w * h\n}","func (wm *W3CMap) Length() int {\n\tif wm == nil {\n\t\treturn 0\n\t}\n\treturn len(wm.forNode.HTMLNode().Attr)\n}","func ilen(data interface{}) (int, error) {\n\n\tswitch data.(type) {\n\tcase []float64:\n\t\treturn len(data.([]float64)), nil\n\tcase []string:\n\t\treturn len(data.([]string)), nil\n\tcase []int64:\n\t\treturn len(data.([]int64)), nil\n\tcase []int32:\n\t\treturn len(data.([]int32)), nil\n\tcase []float32:\n\t\treturn len(data.([]float32)), nil\n\tcase []int16:\n\t\treturn len(data.([]int16)), nil\n\tcase []int8:\n\t\treturn len(data.([]int8)), nil\n\tcase []uint64:\n\t\treturn len(data.([]uint64)), nil\n\tcase []time.Time:\n\t\treturn len(data.([]time.Time)), nil\n\tdefault:\n\t\treturn 0, fmt.Errorf(\"Unknown data type\")\n\t}\n}","func (m *TMap) Length() int {\n\treturn m.root.Length()\n}","func (mm Uint64Uint64Map) Size() int {\n\treturn len(mm)\n}","func (m *OrderedMap[K,V]) Len() int {\n\treturn len(m.mp)\n}","func (v *Value) len(params ...interface{}) (interface{}, error) {\n\tif len(params) != 0 {\n\t\treturn nil, newParamLenErr(len(params), 0)\n\t}\n\n\treturn len(*v), nil\n}","func (m *Mapping) Len() int { return len(m.Pairs) }","func (m *mapReact) Length() int {\n\tvar l int\n\tm.ro.RLock()\n\tl = len(m.ma)\n\tm.ro.RUnlock()\n\treturn l\n}","func (f *Fields) Len() int","func len(v Type) int32 {}","func Sizeof(objs ...interface{}) (sz uint64) {\n\tfor i := range objs {\n\t\tsz += sizeofInternal(reflect.ValueOf(objs[i]), false, 0)\n\t}\n\treturn\n}","func Sizeof(objs ...interface{}) (sz uint64) {\n\tfor i := range objs {\n\t\tsz += sizeofInternal(reflect.ValueOf(objs[i]), false, 0)\n\t}\n\treturn\n}","func (s *Int64Map) Len() int {\n\treturn int(atomic.LoadInt64(&s.length))\n}","func (hm HashMap) Len() uint32 {\n\treturn hm.len\n}","func (radius *RADIUS) Len() (int, error) {\n\tn := radiusMinimumRecordSizeInBytes\n\tfor _, v := range radius.Attributes {\n\t\talen, err := attributeValueLength(v.Value)\n\t\tif err != nil {\n\t\t\treturn 0, err\n\t\t}\n\t\tn += int(alen) + 2 // Added Type and Length\n\t}\n\treturn n, nil\n}","func (m LoyaltyPoints) Len() int64 {\n\treturn AssetTypeLen\n}","func (sp DiscreteObjectSpace) Size() int {\n\treturn len(sp.Objects)\n}","func CalcLength(val interface{}) int {\n\tif val == nil {\n\t\treturn -1\n\t}\n\n\t// string length\n\tif str, ok := val.(string); ok {\n\t\treturn len(str)\n\t}\n\treturn ValueLen(reflect.ValueOf(val))\n}","func size(v Type) int32 {}","func (m *MapStringUint64) Len() int {\n\tm.mu.RLock()\n\tl := len(m.m)\n\tm.mu.RUnlock()\n\treturn l\n}","func (p *SliceOfMap) Len() int {\n\tif p == nil {\n\t\treturn 0\n\t}\n\treturn len(*p)\n}","func (c *StringValueMap) Len() int {\n\treturn len(c.value)\n}","func (f CFields) Len() int { return len(f) }","func (m Map) Len() (n int) {\n\treturn len(m)\n}","func lengthdict(interpreter *Interpreter) {\n\tdictionary := interpreter.Pop().(Dictionary)\n\tinterpreter.Push(float64(len(dictionary)))\n}","func (m *HashMap) Len() int {\n\tm.lock.RLock()\n\tdefer m.lock.RUnlock()\n\treturn len(m.data)\n}","func (fi *FastIntegerHashMap) Len() uint64 {\n\treturn fi.count\n}","func nodeLen(data interface{}) int {\n\tif data == nil {\n\t\treturn 0\n\t}\n\tswitch d := data.(type) {\n\tcase []interface{}:\n\t\treturn len(d)\n\tcase map[string]interface{}:\n\t\treturn len(d)\n\tcase string, int, float64, bool:\n\t\treturn 1\n\t}\n\treturn 0\n}","func (s *SliceOfFloat64) Len() int {\n\treturn len(s.items)\n}","func (m OrderedMap[K, V]) Len() int {\n\treturn len(m.items)\n}","func (this ActivityStreamsImageProperty) Len() (length int) {\n\treturn len(this.properties)\n}","func (b *byWidth) Len() int {\n\treturn len(b.Values)\n}","func (m *OrderedMap) Len() int { return len(m.m) }","func (tt PMap) Len() int {\n\treturn len(tt)\n}","func (h Handle) Len() int {\n\tl := 8 + 8 + 4 + len(h.Type) + len(h.Name)\n\tif h.MD != nil {\n\t\tswitch h.MD.(type) {\n\t\tcase *AlpcPortInfo:\n\t\t\tl += 16\n\t\tcase *MutantInfo:\n\t\t\tl += 5\n\t\tcase *FileInfo:\n\t\t\tl++\n\t\t}\n\t}\n\treturn l\n}","func (h *MapInt16ToInt64) Size() int {\n\treturn h.size\n}","func (t *Map) Len() int {\n\treturn t.keys.Len()\n}","func (t *Struct) Size() int32 {\n\tret := int32(0)\n\tfor _, field := range t.Fields {\n\t\tret += field.Size()\n\t}\n\treturn ret\n}","func LengthModifier(i interface{}) (interface{}, error) {\n\tswitch v := i.(type) {\n\tcase string:\n\t\treturn len(v), nil\n\tcase float64:\n\t\t// TODO: this is not counting decimal portion\n\t\t// (probably because float error can make it really long for some values)\n\t\treturn getIntLength(int(v)), nil\n\tcase int:\n\t\treturn getIntLength(v), nil\n\tcase int64:\n\t\treturn getInt64Length(v), nil\n\tcase map[string]interface{}:\n\t\treturn len(v), nil\n\tcase []interface{}:\n\t\treturn len(v), nil\n\tcase []string:\n\t\treturn len(v), nil\n\tcase []int:\n\t\treturn len(v), nil\n\tcase []float64:\n\t\treturn len(v), nil\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"Invalid type (%v) for len()\", reflect.TypeOf(i))\n\t}\n}","func (d Datapoints) Len() int { return len(d) }","func JSONObjLen(conn redis.Conn, key, path string) (res interface{}, err error) {\n\tname, args, _ := CommandBuilder(\"JSON.OBJLEN\", key, path)\n\treturn conn.Do(name, args...)\n}","func (cm *CMap) Size() int {\n\treturn len(cm.Entries)\n}","func (info *Metadata) Length() int {\n\treturn info.length\n}","func (v Value) Len() int {\n\treturn len(v.val)\n}","func (s *f64) Len() int {\n\treturn len(s.buffer)\n}"],"string":"[\n \"func (o *FakeObject) Length() int { return reflect.ValueOf(o.Value).Len() }\",\n \"func length(v interface{}) (int, error) {\\n\\tswitch val := v.(type) {\\n\\tcase string:\\n\\t\\treturn len(val), nil\\n\\tcase []interface{}:\\n\\t\\treturn len(val), nil\\n\\tcase map[string]interface{}:\\n\\t\\treturn len(val), nil\\n\\tdefault:\\n\\t\\treturn -1, errors.New(\\\"invalid type for length\\\")\\n\\t}\\n}\",\n \"func (p MapStringToFloat64Ptrs) Len() int {\\n\\treturn len(p)\\n}\",\n \"func (i StringHashMap[T, V]) Len() int {\\n\\t// DEBUG:\\n\\tif len(i.hashToKey) != len(i.hashToVal) {\\n\\t\\tpanic(\\\"hashToKey and hashToVal have different lengths\\\")\\n\\t}\\n\\treturn len(i.hashToKey)\\n}\",\n \"func (e *EventDTO) Size() int {\\n\\tsize := 1024\\n\\tif e.Properties == nil {\\n\\t\\treturn size\\n\\t}\\n\\n\\tfor key, value := range e.Properties {\\n\\t\\tsize += len(key)\\n\\t\\tswitch typedValue := value.(type) {\\n\\t\\tcase string:\\n\\t\\t\\tsize += len(typedValue)\\n\\t\\tdefault:\\n\\t\\t}\\n\\t}\\n\\treturn size\\n}\",\n \"func (d *Data) Len() int {\\n\\tif d.Value == nil {\\n\\t\\treturn 0\\n\\t}\\n\\tif d.IsSlice() {\\n\\t\\treturn d.ValueOf().Len()\\n\\t}\\n\\tif n, ok := d.IsKeys(); ok {\\n\\t\\treturn n\\n\\t}\\n\\n\\treturn 1\\n}\",\n \"func (that *StrAnyMap) Size() int {\\n\\tthat.mu.RLock()\\n\\tlength := len(that.data)\\n\\tthat.mu.RUnlock()\\n\\treturn length\\n}\",\n \"func SizeOf(val reflect.Value) int64 {\\n\\ttk := val.Type().Kind()\\n\\n\\tif tk == reflect.Ptr {\\n\\t\\tif val.IsNil() {\\n\\t\\t\\treturn 0\\n\\t\\t}\\n\\t\\tval = val.Elem()\\n\\t\\treturn SizeOf(val)\\n\\t}\\n\\n\\tif tk == reflect.Slice {\\n\\t\\tvar size int64 = 0\\n\\t\\tfor i := 0; i < val.Len(); i++ {\\n\\t\\t\\tsize += SizeOf(val.Index(i))\\n\\t\\t}\\n\\t\\treturn size\\n\\t} else if tk == reflect.Struct {\\n\\t\\tvar size int64 = 0\\n\\t\\tfor i := 0; i < val.Type().NumField(); i++ {\\n\\t\\t\\tsize += SizeOf(val.Field(i))\\n\\t\\t}\\n\\t\\treturn size\\n\\n\\t} else if tk == reflect.Map {\\n\\t\\tvar size int64 = 0\\n\\t\\tkeys := val.MapKeys()\\n\\t\\tfor i := 0; i < len(keys); i++ {\\n\\t\\t\\tsize += SizeOf(keys[i])\\n\\t\\t\\tsize += SizeOf(val.MapIndex(keys[i]))\\n\\t\\t}\\n\\t\\treturn size\\n\\t}\\n\\n\\tswitch val.Type().Name() {\\n\\tcase \\\"BOOLEAN\\\":\\n\\t\\treturn 1\\n\\tcase \\\"INT32\\\":\\n\\t\\treturn 4\\n\\tcase \\\"INT64\\\":\\n\\t\\treturn 8\\n\\tcase \\\"INT96\\\":\\n\\t\\treturn 12\\n\\tcase \\\"FLOAT\\\":\\n\\t\\treturn 4\\n\\tcase \\\"DOUBLE\\\":\\n\\t\\treturn 8\\n\\tcase \\\"BYTE_ARRAY\\\":\\n\\t\\treturn int64(val.Len())\\n\\tcase \\\"FIXED_LEN_BYTE_ARRAY\\\":\\n\\t\\treturn int64(val.Len())\\n\\tcase \\\"UTF8\\\":\\n\\t\\treturn int64(val.Len())\\n\\tcase \\\"INT_8\\\":\\n\\t\\treturn 4\\n\\tcase \\\"INT_16\\\":\\n\\t\\treturn 4\\n\\tcase \\\"INT_32\\\":\\n\\t\\treturn 4\\n\\tcase \\\"INT_64\\\":\\n\\t\\treturn 8\\n\\tcase \\\"UINT_8\\\":\\n\\t\\treturn 4\\n\\tcase \\\"UINT_16\\\":\\n\\t\\treturn 4\\n\\tcase \\\"UINT_32\\\":\\n\\t\\treturn 4\\n\\tcase \\\"UINT_64\\\":\\n\\t\\treturn 8\\n\\tcase \\\"DATE\\\":\\n\\t\\treturn 4\\n\\tcase \\\"TIME_MILLIS\\\":\\n\\t\\treturn 4\\n\\tcase \\\"TIME_MICROS\\\":\\n\\t\\treturn 8\\n\\tcase \\\"TIMESTAMP_MILLIS\\\":\\n\\t\\treturn 8\\n\\tcase \\\"TIMESTAMP_MICROS\\\":\\n\\t\\treturn 8\\n\\tcase \\\"INTERVAL\\\":\\n\\t\\treturn 12\\n\\tcase \\\"DECIMAL\\\":\\n\\t\\treturn int64(val.Len())\\n\\t}\\n\\n\\treturn 4\\n}\",\n \"func (s *sortMap) Len() int {\\n\\treturn reflect.ValueOf(s.data).Len()\\n}\",\n \"func (obj object) Len() int {\\n\\treturn len(obj.keys)\\n}\",\n \"func (object Object) Length() int {\\n\\treturn len(object)\\n}\",\n \"func (o *Object) Size() int64 {\\n\\terr := o.readMetaData(context.TODO())\\n\\tif err != nil {\\n\\t\\tfs.Logf(o, \\\"Failed to read metadata: %v\\\", err)\\n\\t\\treturn 0\\n\\t}\\n\\treturn o.size\\n}\",\n \"func Length(i interface{}) (l int, ok bool) {\\n\\tv, k := preprocess(i)\\n\\tswitch k {\\n\\tcase reflect.Map, reflect.Array, reflect.Slice, reflect.String:\\n\\t\\treturn v.Len(), true\\n\\t}\\n\\treturn 0, false\\n}\",\n \"func Size(d interface{}) int {\\n\\treturn size(reflect.ValueOf(d))\\n}\",\n \"func (o *Object) Size() int64 {\\n\\tctx := context.TODO()\\n\\terr := o.readMetaData(ctx)\\n\\tif err != nil {\\n\\t\\tfs.Logf(o, \\\"Failed to read metadata: %v\\\", err)\\n\\t\\treturn 0\\n\\t}\\n\\treturn o.size\\n}\",\n \"func (pmap *PropertyMap) Size() int {\\n\\tif pmap == nil {\\n\\t\\treturn 0\\n\\t}\\n\\treturn len(pmap.m)\\n}\",\n \"func (node *GoValueNode) Length() (int, error) {\\n\\tif node.IsArray() || node.IsMap() || node.IsString() {\\n\\n\\t\\treturn node.thisValue.Len(), nil\\n\\t}\\n\\n\\treturn 0, fmt.Errorf(\\\"this node identified as \\\\\\\"%s\\\\\\\" is not referencing an array, slice, map or string\\\", node.IdentifiedAs())\\n}\",\n \"func LengthOfValue(value interface{}) (int, error) {\\n\\tv := reflect.ValueOf(value)\\n\\tswitch v.Kind() {\\n\\tcase reflect.String, reflect.Slice, reflect.Map, reflect.Array:\\n\\t\\treturn v.Len(), nil\\n\\t}\\n\\treturn 0, fmt.Errorf(\\\"cannot get the length of %v\\\", v.Kind())\\n}\",\n \"func (k *K) Len() int {\\n\\tif k.Type < K0 || k.Type >= KFUNC {\\n\\t\\treturn 1\\n\\t} else if k.Type >= K0 && k.Type <= KT {\\n\\t\\treturn reflect.ValueOf(k.Data).Len()\\n\\t} else if k.Type == XD {\\n\\t\\treturn k.Data.(Dict).Key.Len()\\n\\t} else if k.Type == XT {\\n\\t\\treturn k.Data.(Table).Data[0].Len()\\n\\t} else {\\n\\t\\treturn -1\\n\\t}\\n}\",\n \"func (hm *HashMap) Len() int {\\n\\treturn hm.np.elemNum()\\n}\",\n \"func Length(i interface{}) (l int, ok bool) {\\n\\tswitch i := i.(type) {\\n\\tcase string:\\n\\t\\treturn len(i), true\\n\\tcase []interface{}:\\n\\t\\treturn len(i), true\\n\\tcase map[string]interface{}:\\n\\t\\treturn len(i), true\\n\\tcase []int64:\\n\\t\\treturn len(i), true\\n\\tcase []float64:\\n\\t\\treturn len(i), true\\n\\tcase []bool:\\n\\t\\treturn len(i), true\\n\\tcase map[string]float64:\\n\\t\\treturn len(i), true\\n\\tcase map[string]string:\\n\\t\\treturn len(i), true\\n\\tcase map[string]bool:\\n\\t\\treturn len(i), true\\n\\tdefault:\\n\\t\\treturn 0, false\\n\\t}\\n}\",\n \"func (self *Map) Len() int {\\n\\treturn len(self.MapNative())\\n}\",\n \"func (m Map) Length() int {\\n\\treturn len(m)\\n}\",\n \"func (i IntHashMap[T, V]) Len() int {\\n\\t// DEBUG:\\n\\tif len(i.hashToKey) != len(i.hashToVal) {\\n\\t\\tpanic(\\\"hashToKey and hashToVal have different lengths\\\")\\n\\t}\\n\\treturn len(i.hashToKey)\\n}\",\n \"func GetSize(i interface{}) (int, error) {\\n\\tb := new(bytes.Buffer)\\n if err := json.NewEncoder(b).Encode(i); err != nil {\\n\\t\\treturn 0, fmt.Errorf(\\\"Failed to encode object of type (%T): %v\\\", i, err)\\n\\t}\\n\\treturn b.Len(), nil\\n}\",\n \"func (o *Object) Size() int64 {\\n\\tif o.meta == nil {\\n\\t\\treturn o.size\\n\\t}\\n\\treturn o.meta.Size\\n}\",\n \"func (o *Object) Size() int64 {\\n\\treturn o.size\\n}\",\n \"func Len(m Map) int {\\n\\treturn m.count()\\n}\",\n \"func (m *OrderedMap[K, V]) Len() int {\\n\\tif m == nil {\\n\\t\\treturn 0\\n\\t}\\n\\treturn m.len\\n}\",\n \"func (hm HashMap) Len(ctx context.Context) (int64, error) {\\n\\treq := newRequest(\\\"*2\\\\r\\\\n$4\\\\r\\\\nHLEN\\\\r\\\\n$\\\")\\n\\treq.addString(hm.name)\\n\\treturn hm.c.cmdInt(ctx, req)\\n}\",\n \"func (d *MetadataAsDictionary) Size() int {\\n\\tif d.metadata != nil {\\n\\t\\treturn len(d.metadata)\\n\\t}\\n\\n\\treturn len(d.source)\\n}\",\n \"func Len(val Value) (int, error) {\\n\\tif val == nil {\\n\\t\\treturn 0, nil\\n\\t}\\n\\tr := reflect.Indirect(reflect.ValueOf(val))\\n\\tswitch r.Kind() {\\n\\tcase reflect.Slice, reflect.Array, reflect.Map:\\n\\t\\treturn r.Len(), nil\\n\\t}\\n\\treturn 0, fmt.Errorf(`stick: could not get Length of %s \\\"%v\\\"`, r.Kind(), val)\\n}\",\n \"func (v *Value) Size() JSONSize {\\n\\treturn JSONSize(C.zj_SizeOf(v.V))\\n}\",\n \"func (o *Object) Size() int64 {\\n\\treturn o.bytes\\n}\",\n \"func (m *Map[K, V]) Len() int {\\n\\tm.mu.RLock()\\n\\tdefer m.mu.RUnlock()\\n\\n\\treturn len(m.inner)\\n}\",\n \"func (jz *Jzon) Length() (l int, err error) {\\n\\tif jz.Type == JzTypeArr {\\n\\t\\treturn len(jz.data.([]*Jzon)), nil\\n\\t}\\n\\n\\tif jz.Type == JzTypeObj {\\n\\t\\treturn len(jz.data.(map[string]*Jzon)), nil\\n\\t}\\n\\n\\treturn -1, errors.New(\\\"expect node of type JzTypeArr or JzTypeObj\\\" +\\n\\t\\t\\\", but the real type is \\\" + typeStrings[jz.Type])\\n}\",\n \"func (this *ExDomain) Size() int {\\n\\treturn len(this.Values) // assumes no mappings to false\\n}\",\n \"func (this *ObjectLength) Type() value.Type { return value.NUMBER }\",\n \"func (this *ObjectLength) Type() value.Type { return value.NUMBER }\",\n \"func (sm *ScanMap) Length() int {\\n\\treturn len(sm.hashMap)\\n}\",\n \"func (tt Map) Len() int {\\n\\treturn len(tt)\\n}\",\n \"func (m Map) Len() int {\\n\\treturn m.n\\n}\",\n \"func (f DFields) Len() int { return len(f) }\",\n \"func sizeof(v reflect.Value, t reflect.Type) int {\\n\\tswitch t.Kind() {\\n\\tcase reflect.Array:\\n\\t\\tif s := sizeof(v, t.Elem()); s >= 0 {\\n\\t\\t\\treturn s * t.Len()\\n\\t\\t}\\n\\n\\tcase reflect.Struct:\\n\\t\\tsum := 0\\n\\t\\tfor i, n := 0, t.NumField(); i < n; i++ {\\n\\t\\t\\ts := dataSize(v.Field(i))\\n\\t\\t\\tif s < 0 {\\n\\t\\t\\t\\treturn -1\\n\\t\\t\\t}\\n\\t\\t\\tsum += s\\n\\t\\t}\\n\\t\\treturn sum\\n\\n\\tcase reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uint,\\n\\t\\treflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64, reflect.Int,\\n\\t\\treflect.Float32, reflect.Float64, reflect.Complex64, reflect.Complex128,\\n\\t\\treflect.Uintptr, reflect.Ptr:\\n\\t\\treturn int(t.Size())\\n\\n\\tcase reflect.String:\\n\\t\\treturn len(v.String())\\n\\n\\tcase reflect.Map:\\n\\t\\tsum := 0\\n\\t\\tfor _, mapKey := range v.MapKeys() {\\n\\t\\t\\tkeySize := dataSize(mapKey)\\n\\t\\t\\tvalueSize := dataSize(v.MapIndex(mapKey))\\n\\t\\t\\tif keySize < 0 || valueSize < 0 {\\n\\t\\t\\t\\treturn -1\\n\\t\\t\\t}\\n\\t\\t\\tsum += keySize + valueSize\\n\\t\\t}\\n\\t\\treturn sum\\n\\t}\\n\\n\\treturn -1\\n}\",\n \"func (geom Geometry) Length() float64 {\\n\\tlength := C.OGR_G_Length(geom.cval)\\n\\treturn float64(length)\\n}\",\n \"func (v valuer) Len() int {\\n\\treturn len(v.data)\\n}\",\n \"func size(v interface{}) int {\\n\\treturn dataSize(reflect.Indirect(reflect.ValueOf(v)))\\n}\",\n \"func fnLen(ctx Context, doc *JDoc, params []string) interface{} {\\n\\tstats := ctx.Value(EelTotalStats).(*ServiceStats)\\n\\tif params == nil || len(params) != 1 {\\n\\t\\tctx.Log().Error(\\\"error_type\\\", \\\"func_len\\\", \\\"op\\\", \\\"len\\\", \\\"cause\\\", \\\"wrong_number_of_parameters\\\", \\\"params\\\", params)\\n\\t\\tstats.IncErrors()\\n\\t\\tAddError(ctx, SyntaxError{fmt.Sprintf(\\\"wrong number of parameters in call to len function\\\"), \\\"len\\\", params})\\n\\t\\treturn nil\\n\\t}\\n\\tvar obj interface{}\\n\\terr := json.Unmarshal([]byte(extractStringParam(params[0])), &obj)\\n\\tif err != nil {\\n\\t\\treturn len(extractStringParam(params[0]))\\n\\t}\\n\\tswitch obj.(type) {\\n\\tcase []interface{}:\\n\\t\\treturn len(obj.([]interface{}))\\n\\tcase map[string]interface{}:\\n\\t\\treturn len(obj.(map[string]interface{}))\\n\\t}\\n\\treturn 0\\n}\",\n \"func Size(v interface{}) int {\\n\\treturn dataSize(reflect.Indirect(reflect.ValueOf(v)))\\n}\",\n \"func (fm *FieldModelMapInt32OptionalBytes) Size() int {\\n if (fm.buffer.Offset() + fm.FBEOffset() + fm.FBESize()) > fm.buffer.Size() {\\n return 0\\n }\\n\\n fbeMapOffset := int(fbe.ReadUInt32(fm.buffer.Data(), fm.buffer.Offset() + fm.FBEOffset()))\\n if (fbeMapOffset == 0) || ((fm.buffer.Offset() + fbeMapOffset + 4) > fm.buffer.Size()) {\\n return 0\\n }\\n\\n fbeMapSize := int(fbe.ReadUInt32(fm.buffer.Data(), fm.buffer.Offset() + fbeMapOffset))\\n return fbeMapSize\\n}\",\n \"func (m *Map) Len() int {\\n\\treturn int(m.len)\\n}\",\n \"func (o Object) Size() Size {\\n\\treturn o.size\\n}\",\n \"func (t colType) length() (int64, bool) {\\n\\tif !t.valid ||\\n\\t\\tt.options&hasPrec != 0 || t.options&hasScale != 0 {\\n\\t\\treturn 0, false\\n\\t}\\n\\n\\t// long types\\n\\tif t.options&isLong != 0 {\\n\\t\\tif t.dataType == longCharType {\\n\\t\\t\\treturn int64(t.size / 2), true\\n\\t\\t}\\n\\t\\tif t.encodingProps.scanType == reflect.TypeOf(\\\"\\\") {\\n\\t\\t\\treturn int64(t.size), true\\n\\t\\t}\\n\\t\\treturn math.MaxInt32, true\\n\\t}\\n\\n\\treturn int64(t.size), t.options&hasLength != 0\\n}\",\n \"func (f Floats) Len() int {\\n\\tw, h := f.Size()\\n\\treturn w * h\\n}\",\n \"func (wm *W3CMap) Length() int {\\n\\tif wm == nil {\\n\\t\\treturn 0\\n\\t}\\n\\treturn len(wm.forNode.HTMLNode().Attr)\\n}\",\n \"func ilen(data interface{}) (int, error) {\\n\\n\\tswitch data.(type) {\\n\\tcase []float64:\\n\\t\\treturn len(data.([]float64)), nil\\n\\tcase []string:\\n\\t\\treturn len(data.([]string)), nil\\n\\tcase []int64:\\n\\t\\treturn len(data.([]int64)), nil\\n\\tcase []int32:\\n\\t\\treturn len(data.([]int32)), nil\\n\\tcase []float32:\\n\\t\\treturn len(data.([]float32)), nil\\n\\tcase []int16:\\n\\t\\treturn len(data.([]int16)), nil\\n\\tcase []int8:\\n\\t\\treturn len(data.([]int8)), nil\\n\\tcase []uint64:\\n\\t\\treturn len(data.([]uint64)), nil\\n\\tcase []time.Time:\\n\\t\\treturn len(data.([]time.Time)), nil\\n\\tdefault:\\n\\t\\treturn 0, fmt.Errorf(\\\"Unknown data type\\\")\\n\\t}\\n}\",\n \"func (m *TMap) Length() int {\\n\\treturn m.root.Length()\\n}\",\n \"func (mm Uint64Uint64Map) Size() int {\\n\\treturn len(mm)\\n}\",\n \"func (m *OrderedMap[K,V]) Len() int {\\n\\treturn len(m.mp)\\n}\",\n \"func (v *Value) len(params ...interface{}) (interface{}, error) {\\n\\tif len(params) != 0 {\\n\\t\\treturn nil, newParamLenErr(len(params), 0)\\n\\t}\\n\\n\\treturn len(*v), nil\\n}\",\n \"func (m *Mapping) Len() int { return len(m.Pairs) }\",\n \"func (m *mapReact) Length() int {\\n\\tvar l int\\n\\tm.ro.RLock()\\n\\tl = len(m.ma)\\n\\tm.ro.RUnlock()\\n\\treturn l\\n}\",\n \"func (f *Fields) Len() int\",\n \"func len(v Type) int32 {}\",\n \"func Sizeof(objs ...interface{}) (sz uint64) {\\n\\tfor i := range objs {\\n\\t\\tsz += sizeofInternal(reflect.ValueOf(objs[i]), false, 0)\\n\\t}\\n\\treturn\\n}\",\n \"func Sizeof(objs ...interface{}) (sz uint64) {\\n\\tfor i := range objs {\\n\\t\\tsz += sizeofInternal(reflect.ValueOf(objs[i]), false, 0)\\n\\t}\\n\\treturn\\n}\",\n \"func (s *Int64Map) Len() int {\\n\\treturn int(atomic.LoadInt64(&s.length))\\n}\",\n \"func (hm HashMap) Len() uint32 {\\n\\treturn hm.len\\n}\",\n \"func (radius *RADIUS) Len() (int, error) {\\n\\tn := radiusMinimumRecordSizeInBytes\\n\\tfor _, v := range radius.Attributes {\\n\\t\\talen, err := attributeValueLength(v.Value)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn 0, err\\n\\t\\t}\\n\\t\\tn += int(alen) + 2 // Added Type and Length\\n\\t}\\n\\treturn n, nil\\n}\",\n \"func (m LoyaltyPoints) Len() int64 {\\n\\treturn AssetTypeLen\\n}\",\n \"func (sp DiscreteObjectSpace) Size() int {\\n\\treturn len(sp.Objects)\\n}\",\n \"func CalcLength(val interface{}) int {\\n\\tif val == nil {\\n\\t\\treturn -1\\n\\t}\\n\\n\\t// string length\\n\\tif str, ok := val.(string); ok {\\n\\t\\treturn len(str)\\n\\t}\\n\\treturn ValueLen(reflect.ValueOf(val))\\n}\",\n \"func size(v Type) int32 {}\",\n \"func (m *MapStringUint64) Len() int {\\n\\tm.mu.RLock()\\n\\tl := len(m.m)\\n\\tm.mu.RUnlock()\\n\\treturn l\\n}\",\n \"func (p *SliceOfMap) Len() int {\\n\\tif p == nil {\\n\\t\\treturn 0\\n\\t}\\n\\treturn len(*p)\\n}\",\n \"func (c *StringValueMap) Len() int {\\n\\treturn len(c.value)\\n}\",\n \"func (f CFields) Len() int { return len(f) }\",\n \"func (m Map) Len() (n int) {\\n\\treturn len(m)\\n}\",\n \"func lengthdict(interpreter *Interpreter) {\\n\\tdictionary := interpreter.Pop().(Dictionary)\\n\\tinterpreter.Push(float64(len(dictionary)))\\n}\",\n \"func (m *HashMap) Len() int {\\n\\tm.lock.RLock()\\n\\tdefer m.lock.RUnlock()\\n\\treturn len(m.data)\\n}\",\n \"func (fi *FastIntegerHashMap) Len() uint64 {\\n\\treturn fi.count\\n}\",\n \"func nodeLen(data interface{}) int {\\n\\tif data == nil {\\n\\t\\treturn 0\\n\\t}\\n\\tswitch d := data.(type) {\\n\\tcase []interface{}:\\n\\t\\treturn len(d)\\n\\tcase map[string]interface{}:\\n\\t\\treturn len(d)\\n\\tcase string, int, float64, bool:\\n\\t\\treturn 1\\n\\t}\\n\\treturn 0\\n}\",\n \"func (s *SliceOfFloat64) Len() int {\\n\\treturn len(s.items)\\n}\",\n \"func (m OrderedMap[K, V]) Len() int {\\n\\treturn len(m.items)\\n}\",\n \"func (this ActivityStreamsImageProperty) Len() (length int) {\\n\\treturn len(this.properties)\\n}\",\n \"func (b *byWidth) Len() int {\\n\\treturn len(b.Values)\\n}\",\n \"func (m *OrderedMap) Len() int { return len(m.m) }\",\n \"func (tt PMap) Len() int {\\n\\treturn len(tt)\\n}\",\n \"func (h Handle) Len() int {\\n\\tl := 8 + 8 + 4 + len(h.Type) + len(h.Name)\\n\\tif h.MD != nil {\\n\\t\\tswitch h.MD.(type) {\\n\\t\\tcase *AlpcPortInfo:\\n\\t\\t\\tl += 16\\n\\t\\tcase *MutantInfo:\\n\\t\\t\\tl += 5\\n\\t\\tcase *FileInfo:\\n\\t\\t\\tl++\\n\\t\\t}\\n\\t}\\n\\treturn l\\n}\",\n \"func (h *MapInt16ToInt64) Size() int {\\n\\treturn h.size\\n}\",\n \"func (t *Map) Len() int {\\n\\treturn t.keys.Len()\\n}\",\n \"func (t *Struct) Size() int32 {\\n\\tret := int32(0)\\n\\tfor _, field := range t.Fields {\\n\\t\\tret += field.Size()\\n\\t}\\n\\treturn ret\\n}\",\n \"func LengthModifier(i interface{}) (interface{}, error) {\\n\\tswitch v := i.(type) {\\n\\tcase string:\\n\\t\\treturn len(v), nil\\n\\tcase float64:\\n\\t\\t// TODO: this is not counting decimal portion\\n\\t\\t// (probably because float error can make it really long for some values)\\n\\t\\treturn getIntLength(int(v)), nil\\n\\tcase int:\\n\\t\\treturn getIntLength(v), nil\\n\\tcase int64:\\n\\t\\treturn getInt64Length(v), nil\\n\\tcase map[string]interface{}:\\n\\t\\treturn len(v), nil\\n\\tcase []interface{}:\\n\\t\\treturn len(v), nil\\n\\tcase []string:\\n\\t\\treturn len(v), nil\\n\\tcase []int:\\n\\t\\treturn len(v), nil\\n\\tcase []float64:\\n\\t\\treturn len(v), nil\\n\\tdefault:\\n\\t\\treturn nil, fmt.Errorf(\\\"Invalid type (%v) for len()\\\", reflect.TypeOf(i))\\n\\t}\\n}\",\n \"func (d Datapoints) Len() int { return len(d) }\",\n \"func JSONObjLen(conn redis.Conn, key, path string) (res interface{}, err error) {\\n\\tname, args, _ := CommandBuilder(\\\"JSON.OBJLEN\\\", key, path)\\n\\treturn conn.Do(name, args...)\\n}\",\n \"func (cm *CMap) Size() int {\\n\\treturn len(cm.Entries)\\n}\",\n \"func (info *Metadata) Length() int {\\n\\treturn info.length\\n}\",\n \"func (v Value) Len() int {\\n\\treturn len(v.val)\\n}\",\n \"func (s *f64) Len() int {\\n\\treturn len(s.buffer)\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6576737","0.641415","0.6306101","0.6094734","0.60418206","0.6018301","0.5996876","0.59715265","0.5953909","0.5932843","0.590009","0.5885789","0.5872587","0.58563036","0.58299994","0.57967377","0.57810503","0.576028","0.5746586","0.57231796","0.5718099","0.57130563","0.5712192","0.57087547","0.56960803","0.5650257","0.5621568","0.561032","0.5605109","0.55665344","0.55663556","0.5564296","0.5555391","0.5552163","0.5544846","0.55388975","0.55151737","0.55142874","0.55142874","0.5507523","0.5505992","0.5501291","0.550112","0.54994816","0.5495123","0.54892087","0.54853606","0.54722005","0.54714847","0.5469408","0.5469076","0.54653263","0.5453398","0.5427858","0.5427081","0.5424623","0.5411553","0.54099095","0.5407363","0.5405828","0.5396861","0.5395147","0.5390425","0.5381282","0.5378466","0.5378466","0.5377639","0.53730893","0.5373045","0.53711814","0.53625077","0.5336773","0.53339994","0.5330068","0.53290534","0.5307847","0.53043723","0.52982235","0.5295901","0.5295243","0.5291098","0.52894986","0.5288736","0.52838606","0.5281311","0.5280893","0.5269588","0.52664614","0.52635926","0.52607536","0.5234855","0.5226513","0.5221009","0.5217836","0.52177435","0.5216008","0.52087706","0.5207614","0.51922244"],"string":"[\n \"0.6576737\",\n \"0.641415\",\n \"0.6306101\",\n \"0.6094734\",\n \"0.60418206\",\n \"0.6018301\",\n \"0.5996876\",\n \"0.59715265\",\n \"0.5953909\",\n \"0.5932843\",\n \"0.590009\",\n \"0.5885789\",\n \"0.5872587\",\n \"0.58563036\",\n \"0.58299994\",\n \"0.57967377\",\n \"0.57810503\",\n \"0.576028\",\n \"0.5746586\",\n \"0.57231796\",\n \"0.5718099\",\n \"0.57130563\",\n \"0.5712192\",\n \"0.57087547\",\n \"0.56960803\",\n \"0.5650257\",\n \"0.5621568\",\n \"0.561032\",\n \"0.5605109\",\n \"0.55665344\",\n \"0.55663556\",\n \"0.5564296\",\n \"0.5555391\",\n \"0.5552163\",\n \"0.5544846\",\n \"0.55388975\",\n \"0.55151737\",\n \"0.55142874\",\n \"0.55142874\",\n \"0.5507523\",\n \"0.5505992\",\n \"0.5501291\",\n \"0.550112\",\n \"0.54994816\",\n \"0.5495123\",\n \"0.54892087\",\n \"0.54853606\",\n \"0.54722005\",\n \"0.54714847\",\n \"0.5469408\",\n \"0.5469076\",\n \"0.54653263\",\n \"0.5453398\",\n \"0.5427858\",\n \"0.5427081\",\n \"0.5424623\",\n \"0.5411553\",\n \"0.54099095\",\n \"0.5407363\",\n \"0.5405828\",\n \"0.5396861\",\n \"0.5395147\",\n \"0.5390425\",\n \"0.5381282\",\n \"0.5378466\",\n \"0.5378466\",\n \"0.5377639\",\n \"0.53730893\",\n \"0.5373045\",\n \"0.53711814\",\n \"0.53625077\",\n \"0.5336773\",\n \"0.53339994\",\n \"0.5330068\",\n \"0.53290534\",\n \"0.5307847\",\n \"0.53043723\",\n \"0.52982235\",\n \"0.5295901\",\n \"0.5295243\",\n \"0.5291098\",\n \"0.52894986\",\n \"0.5288736\",\n \"0.52838606\",\n \"0.5281311\",\n \"0.5280893\",\n \"0.5269588\",\n \"0.52664614\",\n \"0.52635926\",\n \"0.52607536\",\n \"0.5234855\",\n \"0.5226513\",\n \"0.5221009\",\n \"0.5217836\",\n \"0.52177435\",\n \"0.5216008\",\n \"0.52087706\",\n \"0.5207614\",\n \"0.51922244\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.596643"},"document_rank":{"kind":"string","value":"9"}}},{"rowIdx":997,"cells":{"query":{"kind":"string","value":"/ The constructor returns a NewObjectLength with the an operand cast to a Function as the FunctionConstructor."},"document":{"kind":"string","value":"func (this *ObjectLength) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectLength(operands[0])\n\t}\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func (this *ObjectAdd) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectAdd(operands[0], operands[1], operands[2])\n\t}\n}","func (this *ObjectRemove) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectRemove(operands[0], operands[1])\n\t}\n}","func (this *ObjectUnwrap) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectUnwrap(operands[0])\n\t}\n}","func (this *ObjectPut) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectPut(operands[0], operands[1], operands[2])\n\t}\n}","func (this *ObjectValues) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectValues(operands[0])\n\t}\n}","func (this *ObjectValues) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectValues(operands[0])\n\t}\n}","func (this *ObjectNames) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectNames(operands[0])\n\t}\n}","func (this *ObjectNames) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectNames(operands[0])\n\t}\n}","func (this *DateAddMillis) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewDateAddMillis(operands[0], operands[1], operands[2])\n\t}\n}","func (this *DateAddStr) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewDateAddStr(operands[0], operands[1], operands[2])\n\t}\n}","func NewObjectLength(operand Expression) Function {\n\trv := &ObjectLength{\n\t\t*NewUnaryFunctionBase(\"object_length\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func NewObjectLength(operand Expression) Function {\n\trv := &ObjectLength{\n\t\t*NewUnaryFunctionBase(\"object_length\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func (this *DateDiffMillis) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewDateDiffMillis(operands[0], operands[1], operands[2])\n\t}\n}","func (this *DateDiffStr) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewDateDiffStr(operands[0], operands[1], operands[2])\n\t}\n}","func (this *Mod) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewMod(operands[0], operands[1])\n\t}\n}","func (this *ObjectInnerValues) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectInnerValues(operands[0])\n\t}\n}","func (this *ObjectPairs) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectPairs(operands[0])\n\t}\n}","func (this *ObjectPairs) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectPairs(operands[0])\n\t}\n}","func NewConstructor(x interface{}) (*Constructor, error) {\n\tif x == nil {\n\t\treturn nil, kerror.New(kerror.EViolation, \"function expected, nil given\")\n\t}\n\tft := reflect.TypeOf(x)\n\tfv := reflect.ValueOf(x)\n\tif ft.Kind() != reflect.Func {\n\t\treturn nil, kerror.Newf(kerror.EViolation, \"function expected, %s given\", ft)\n\t}\n\tif fv.IsNil() {\n\t\treturn nil, kerror.New(kerror.EViolation, \"function expected, nil given\")\n\t}\n\tc := &Constructor{\n\t\tfunction: fv,\n\t}\n\tnumIn := ft.NumIn()\n\tif ft.IsVariadic() {\n\t\tnumIn--\n\t}\n\tc.inTypes = make([]reflect.Type, numIn)\n\tfor i := 0; i < numIn; i++ {\n\t\tc.inTypes[i] = ft.In(i)\n\t}\n\tswitch ft.NumOut() {\n\tdefault:\n\t\treturn nil, kerror.Newf(kerror.EViolation, \"function %s is not a constructor\", ft)\n\tcase 1:\n\t\tc.t = ft.Out(0)\n\t\tc.objectOutIndex = 0\n\t\tc.destructorOutIndex = -1\n\t\tc.errorOutIndex = -1\n\tcase 2:\n\t\tif ft.Out(1) != errorType {\n\t\t\treturn nil, kerror.Newf(kerror.EViolation, \"function %s is not a constructor\", ft)\n\t\t}\n\t\tc.t = ft.Out(0)\n\t\tc.objectOutIndex = 0\n\t\tc.destructorOutIndex = -1\n\t\tc.errorOutIndex = 1\n\tcase 3:\n\t\tif ft.Out(1) != destructorType || ft.Out(2) != errorType {\n\t\t\treturn nil, kerror.Newf(kerror.EViolation, \"function %s is not a constructor\", ft)\n\t\t}\n\t\tc.t = ft.Out(0)\n\t\tc.objectOutIndex = 0\n\t\tc.destructorOutIndex = 1\n\t\tc.errorOutIndex = 2\n\t}\n\treturn c, nil\n}","func (this *NowMillis) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function { return _NOW_MILLIS }\n}","func (this *DateTruncStr) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewDateTruncStr(operands[0], operands[1])\n\t}\n}","func (this *DatePartStr) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewDatePartStr(operands[0], operands[1])\n\t}\n}","func (this *StrToMillis) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewStrToMillis(operands[0])\n\t}\n}","func (this *DatePartMillis) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewDatePartMillis(operands[0], operands[1])\n\t}\n}","func (this *StrToZoneName) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewStrToZoneName(operands[0], operands[1])\n\t}\n}","func (this *Element) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewElement(operands[0], operands[1])\n\t}\n}","func (this *ObjectInnerPairs) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectInnerPairs(operands[0])\n\t}\n}","func (this *DateTruncMillis) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewDateTruncMillis(operands[0], operands[1])\n\t}\n}","func (this *NowStr) Constructor() FunctionConstructor { return NewNowStr }","func (this *ClockMillis) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function { return _CLOCK_MILLIS }\n}","func Function(args ...Type) *Operator {\n\treturn &Operator{functionName, args}\n}","func New(spec *Spec) Function {\n\tf := Function{\n\t\tspec: spec,\n\t}\n\treturn f\n}","func (this *StrToUTC) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewStrToUTC(operands[0])\n\t}\n}","func (this *Not) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewNot(operands[0])\n\t}\n}","func (f Function) New(ctx string) error {\n\treturn f.unsafeWrap(errors.New(ctx), ctx, \"\")\n}","func NewFunction(retType types.WaccType, ident *Ident, params ParamList,\n\tstats Statement, pos errors.Position) *Function {\n\tfn := &Function{\n\t\tretType: retType,\n\t\tident: ident,\n\t\tparams: params,\n\t\tpos: pos,\n\t}\n\tswitch st := stats.(type) {\n\tcase StatMultiple:\n\t\tfn.stats = st\n\tdefault:\n\t\tfn.stats = StatMultiple{st}\n\t}\n\treturn fn\n}","func (this *MillisToStr) Constructor() FunctionConstructor { return NewMillisToStr }","func NewFunction(name string, typ semantic.Type, call func(args Object) (Value, error), sideEffect bool) Function {\n\treturn &function{\n\t\tname: name,\n\t\tt: typ,\n\t\tcall: call,\n\t\thasSideEffect: sideEffect,\n\t}\n}","func NewFunction(ctx sctx.Context, funcName string, retType *types.FieldType, args ...Expression) (Expression, error) {\n\treturn newFunctionImpl(ctx, true, funcName, retType, args...)\n}","func tcNew(n *ir.UnaryExpr) ir.Node {\n\tif n.X == nil {\n\t\t// Fatalf because the OCALL above checked for us,\n\t\t// so this must be an internally-generated mistake.\n\t\tbase.Fatalf(\"missing argument to new\")\n\t}\n\tl := n.X\n\tl = typecheck(l, ctxType)\n\tt := l.Type()\n\tif t == nil {\n\t\tn.SetType(nil)\n\t\treturn n\n\t}\n\tn.X = l\n\tn.SetType(types.NewPtr(t))\n\treturn n\n}","func NewFunc(name string, typ Type) *Func {\n\treturn &Func{object: object{scope: nil, name: name, typ: typ}}\n}","func NewFunction(ifunc IFunction, name string) IQueryField {\n\treturn &SFunctionFieldBase{\n\t\tIFunction: ifunc,\n\t\talias: name,\n\t}\n}","func (this *ClockStr) Constructor() FunctionConstructor { return NewClockStr }","func newFunction(p *Package, fl *File, f *ast.FuncDecl) *Function {\n\tres := &Function{\n\t\tpkg: p,\n\t\tfile: fl,\n\t\tfn: f,\n\t\tname: nameFromIdent(f.Name),\n\t\tdef: getFunc(p, fl, f.Type).(*FuncType),\n\t}\n\n\tif res.fn.Recv != nil {\n\t\tn := \"\"\n\t\tif res.fn.Recv.List[0].Names != nil {\n\t\t\tn = nameFromIdent(res.fn.Recv.List[0].Names[0])\n\t\t}\n\t\tres.receiver = newVariableFromExpr(res.pkg, res.file, n, res.fn.Recv.List[0].Type)\n\t\tvar def Definition\n\t\tvar def2 *StarType\n\t\tdef = res.receiver.def\n\t\tdef2, res.receiverPointer = def.(*StarType)\n\t\tif res.receiverPointer {\n\t\t\tdef = def2.Target()\n\t\t}\n\t\tres.receiverClass = def.String()\n\t}\n\treturn res\n}","func (this *MillisToZoneName) Constructor() FunctionConstructor { return NewMillisToZoneName }","func NewFunction(name, cname, comment, member string, typ Type) *Function {\n\tfunctionName := UpperFirstCharacter(name)\n\treceiverType := TrimLanguagePrefix(cname)\n\treceiverName := CommonReceiverName(receiverType)\n\n\tf := &Function{\n\t\tIncludeFiles: NewIncludeFiles(),\n\t\tName: functionName,\n\t\tCName: cname,\n\t\tComment: comment,\n\t\tParameters: []FunctionParameter{ // TODO(go-clang): this might not be needed if the receiver code is refactored: https://github.com/go-clang/gen/issues/52\n\t\t\t{\n\t\t\t\tName: receiverName,\n\t\t\t\tCName: cname,\n\t\t\t\tType: Type{\n\t\t\t\t\tGoName: receiverType,\n\t\t\t\t},\n\t\t\t},\n\t\t},\n\t\tReturnType: typ,\n\t\tReceiver: Receiver{\n\t\t\tName: receiverName,\n\t\t\tType: Type{\n\t\t\t\tGoName: receiverType,\n\t\t\t},\n\t\t},\n\t\tMember: &FunctionParameter{\n\t\t\tName: member,\n\t\t\tType: typ,\n\t\t},\n\t}\n\n\treturn f\n}","func (this *MillisToUTC) Constructor() FunctionConstructor { return NewMillisToUTC }","func NewFunction(fnLit *ast.FunctionLiteral, env *Environment) *Function {\n\treturn &Function{\n\t\tParameters: fnLit.Parameters,\n\t\tBody: fnLit.Body,\n\t\tEnv: env,\n\t}\n}","func Constructor() MapSum {\n\treturn MapSum{}\n}","func execNewFunc(_ int, p *gop.Context) {\n\targs := p.GetArgs(4)\n\tret := types.NewFunc(token.Pos(args[0].(int)), args[1].(*types.Package), args[2].(string), args[3].(*types.Signature))\n\tp.Ret(4, ret)\n}","func NewFunction(config *truce.HTTP, function truce.Function) (*Function, error) {\n\tif function.Transports.HTTP == nil {\n\t\treturn nil, nil\n\t}\n\n\ttransport := *function.Transports.HTTP\n\n\tb := &Function{\n\t\tDefinition: function,\n\t\tQuery: map[string]QueryParam{},\n\t}\n\n\ttype argument struct {\n\t\tvariable string\n\t\tposVariable string\n\t\ttyp string\n\t}\n\n\tvar (\n\t\tpathMappings = map[string]string{}\n\t\targs = map[string]argument{}\n\t)\n\n\tfor i, field := range function.Arguments {\n\t\targs[field.Name] = argument{\n\t\t\ttyp: string(field.Type),\n\t\t\tposVariable: fmt.Sprintf(\"v%d\", i),\n\t\t\tvariable: field.Name,\n\t\t}\n\t}\n\n\tif function.Return.Present && function.Return.Name != \"\" {\n\t\tb.HasReturn = true\n\t\tb.ReturnType = string(function.Return.Type)\n\n\t\tif len(b.ReturnType) < 1 {\n\t\t\treturn nil, errors.New(\"return type cannot be empty\")\n\t\t}\n\n\t\tif b.ReturnType[0] == '*' {\n\t\t\tb.ReturnType = b.ReturnType[1:]\n\t\t\tb.ReturnIsPtr = true\n\t\t}\n\t}\n\n\tb.Method = transport.Method\n\n\t// Sort the arguments by name for consistent positional ordering.\n\tvar argVals []truce.ArgumentValue\n\tfor _, arg := range transport.Arguments {\n\t\targVals = append(argVals, arg)\n\t}\n\tsort.Slice(argVals, func(i, j int) bool {\n\t\treturn argVals[i].Name < argVals[j].Name\n\t})\n\n\tvar qpos int\n\tfor _, arg := range argVals {\n\t\ta, ok := args[arg.Name]\n\n\t\tswitch arg.From {\n\t\tcase \"body\":\n\t\t\tif !ok {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tb.BodyVar = a.posVariable\n\t\t\tb.BodyType = a.typ\n\t\tcase \"path\":\n\t\t\tif !ok {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tpathMappings[arg.Var] = args[arg.Name].variable\n\t\tcase \"query\":\n\t\t\tif !ok {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tb.Query[arg.Var] = QueryParam{\n\t\t\t\tPos: qpos,\n\t\t\t\tQueryVar: arg.Var,\n\t\t\t\tGoVar: a.posVariable,\n\t\t\t\tType: a.typ,\n\t\t\t}\n\n\t\t\tqpos++\n\t\tcase \"static\":\n\t\t\t// TODO(georgemac)\n\t\t}\n\t}\n\n\tfor _, part := range strings.Split(config.Prefix, \"/\") {\n\t\tif part == \"\" {\n\t\t\tcontinue\n\t\t}\n\n\t\tb.Path = append(b.Path, Element{Type: \"static\", Value: part})\n\t}\n\n\tb.Path = append(b.Path, parsePath(pathMappings, transport.Path)...)\n\n\treturn b, nil\n}","func NewConstructor(o Options) func(http.Handler) http.Handler {\n\tif o.Timeout <= 0 {\n\t\treturn xhttp.NilConstructor\n\t}\n\n\t// nolint: typecheck\n\tif o.TimedOut == nil {\n\t\to.TimedOut = defaultTimedOut\n\t}\n\n\treturn func(next http.Handler) http.Handler {\n\t\treturn &timeoutHandler{\n\t\t\ttimeout: o.Timeout,\n\t\t\ttimedOut: o.TimedOut,\n\t\t\tnext: next,\n\t\t}\n\t}\n}","func (o *FakeObject) New(args ...interface{}) Object { return o.Invoke(args) }","func (er *expressionRewriter) newFunction(funcName string, retType *types.FieldType, args ...expression.Expression) (expression.Expression, error) {\n\ttrace_util_0.Count(_expression_rewriter_00000, 275)\n\tif er.disableFoldCounter > 0 {\n\t\ttrace_util_0.Count(_expression_rewriter_00000, 277)\n\t\treturn expression.NewFunctionBase(er.ctx, funcName, retType, args...)\n\t}\n\ttrace_util_0.Count(_expression_rewriter_00000, 276)\n\treturn expression.NewFunction(er.ctx, funcName, retType, args...)\n}","func (s *Prototype) Constructor() Value { return s.constructor }","func NewFunction(ctx openedge.Context, cfg FunctionInfo) *Function {\n\tf := &Function{\n\t\tcfg: cfg,\n\t\tctx: ctx,\n\t\tids: make(chan string, cfg.Instance.Max),\n\t\tlog: logger.WithField(\"function\", cfg.Name),\n\t}\n\tfor index := 1; index <= cfg.Instance.Max; index++ {\n\t\tf.ids <- fmt.Sprintf(\"f%d\", index)\n\t}\n\tpc := pool.NewDefaultPoolConfig()\n\tpc.MinIdle = cfg.Instance.Min\n\tpc.MaxIdle = cfg.Instance.Max\n\tpc.MaxTotal = cfg.Instance.Max\n\tpc.MinEvictableIdleTime = cfg.Instance.IdleTime\n\tpc.TimeBetweenEvictionRuns = cfg.Instance.EvictTime\n\tf.pool = pool.NewObjectPool(context.Background(), newFactory(f), pc)\n\treturn f\n}","func newInstance0(frame *rtda.Frame) {\n\tvars := frame.LocalVars()\n\tconstructorObj := vars.GetRef(0)\n\targArrObj := vars.GetRef(1)\n\n\tgoConstructor := getExtra(constructorObj)\n\tgoClass := goConstructor.Class()\n\tobj := goClass.NewObj()\n\tstack := frame.OperandStack()\n\tstack.PushRef(obj)\n\n\t// call <init>\n\targs := actualConstructorArgs(obj, argArrObj, goConstructor)\n\tframe.Thread().InvokeMethodWithShim(goConstructor, args)\n}","func New() *Compiler {\n\tmainScope := CompilationScope{\n\t\tinstructions: code.Instructions{},\n\t\tlastInstruction: EmittedInstruction{},\n\t\tpreviousInstruction: EmittedInstruction{},\n\t}\n\ttable := NewSymbolTable()\n\tfor i, fn := range object.GetBuiltins() {\n\t\ttable.DefineBuiltin(i, fn.Name)\n\t}\n\treturn &Compiler{\n\t\tconstants: []object.Object{},\n\t\tscopes: []CompilationScope{mainScope},\n\t\tscopeIndex: 0,\n\t\tsymbolTable: table,\n\t}\n}","func NewCommand(cmd uint32, count int) Command {\n\treturn Command((cmd & 0x7) | (uint32(count) << 3))\n}","func New(chainFunc ...interface{}) *Chain {\n\tc := &Chain{}\n\tc.Add(chainFunc...)\n\treturn c\n}","func TermConstructor(t TermT) TermConstructorT {\n\treturn TermConstructorT(C.yices_term_constructor(C.term_t(t)))\n}","func NewConstructor() *Constructor {\n\treturn &Constructor{}\n}","func NewFunction0(name string, sqlType Type, logic EvalLogic) Function0 {\n\tfn := func() Expression {\n\t\treturn NoArgFunc{name, sqlType, logic}\n\t}\n\n\treturn Function0{Name: name, Fn: fn}\n}","func NewConstructor() Constructor {\n\treturn func(ctx context.Context, cmw configmap.Watcher) *controller.Impl {\n\t\treturn NewController(ctx, cmw)\n\t}\n}","func Constructor() MapSum {\n \n}","func Constructor() MyStack {\n\treturn MyStack{New(), New(), 1}\n}","func Constructor() MapSum {\n\treturn MapSum{\n\t\troot: &TrieNode{},\n\t}\n}","func ClosureNew(f interface{}) *C.GClosure {\n\tclosure := C._g_closure_new()\n\tclosures.Lock()\n\tclosures.m[closure] = reflect.ValueOf(f)\n\tclosures.Unlock()\n\treturn closure\n}","func (sf *ScalarFunction) Clone() Expression {\n\tc := &ScalarFunction{\n\t\tFuncName: sf.FuncName,\n\t\tRetType: sf.RetType,\n\t\tFunction: sf.Function.Clone(),\n\t}\n\treturn c\n}","func Function(sig *CallSignature) Type {\n\treturn Type{functionImpl{sig: sig}}\n}","func newFunctionImpl(ctx sctx.Context, fold bool, funcName string, retType *types.FieldType, args ...Expression) (Expression, error) {\n\tif retType == nil {\n\t\treturn nil, errors.Errorf(\"RetType cannot be nil for ScalarFunction.\")\n\t}\n\tfc, ok := funcs[funcName]\n\tif !ok {\n\t\tdb := ctx.GetSessionVars().CurrentDB\n\t\tif db == \"\" {\n\t\t\treturn nil, errors.Trace(ErrNoDB)\n\t\t}\n\n\t\treturn nil, errFunctionNotExists.GenWithStackByArgs(\"FUNCTION\", db+\".\"+funcName)\n\t}\n\tfuncArgs := make([]Expression, len(args))\n\tcopy(funcArgs, args)\n\tf, err := fc.getFunction(ctx, funcArgs)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif builtinRetTp := f.getRetTp(); builtinRetTp.Tp != mysql.TypeUnspecified || retType.Tp == mysql.TypeUnspecified {\n\t\tretType = builtinRetTp\n\t}\n\tsf := &ScalarFunction{\n\t\tFuncName: model.NewCIStr(funcName),\n\t\tRetType: retType,\n\t\tFunction: f,\n\t}\n\treturn sf, nil\n}","func NewSelf() Function {\n\trv := &Self{\n\t\t*NewNullaryFunctionBase(\"self\"),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func Constructor() Trie {\n\treturn Trie{100, false, [26]*Trie{}}\n}","func (c *Constructor) Create(a ...reflect.Value) (reflect.Value, kdone.Destructor, error) {\n\tif c == nil {\n\t\treturn reflect.Value{}, kdone.Noop, nil\n\t}\n\tif len(a) != len(c.inTypes) {\n\t\treturn reflect.Value{}, nil, kerror.Newf(kerror.EViolation,\n\t\t\t\"%s constructor expects %d argument(s), %d given\",\n\t\t\tc.t, len(c.inTypes), len(a))\n\t}\n\tfor i, v := range a {\n\t\tif v.Type() != c.inTypes[i] {\n\t\t\treturn reflect.Value{}, nil, kerror.Newf(kerror.EViolation,\n\t\t\t\t\"%s constructor expects argument %d to be of %s type, %s given\",\n\t\t\t\tc.t, i+1, c.inTypes[i], v.Type())\n\t\t}\n\t}\n\tout := c.function.Call(a)\n\tobj := out[c.objectOutIndex]\n\tvar dtor kdone.Destructor = kdone.Noop\n\tif c.destructorOutIndex >= 0 {\n\t\tif v := out[c.destructorOutIndex].Interface(); v != nil {\n\t\t\tdtor = v.(kdone.Destructor)\n\t\t}\n\t}\n\tvar err error\n\tif c.errorOutIndex >= 0 {\n\t\tif v := out[c.errorOutIndex].Interface(); v != nil {\n\t\t\terr = v.(error)\n\t\t}\n\t}\n\treturn obj, dtor, err\n}","func New(length int) func() *Float32s {\r\n\treturn func() *Float32s {\r\n\t\tresult := make(Float32s, length)\r\n\t\tfor i := 0; i < length; i++ {\r\n\t\t\tresult[i] = randFloat32()\r\n\t\t}\r\n\t\treturn &result\r\n\t}\r\n}","func NewFunctionCall(callee Expression, arguments []Expression, trailing *TrailingFunction, metadata *Metadata) *FunctionCall {\n\treturn &FunctionCall{callee, arguments, trailing, metadata}\n}","func ClosureNewObject(sizeofClosure uint32, object *Object) *Closure {\n\tc_sizeof_closure := (C.guint)(sizeofClosure)\n\n\tc_object := (*C.GObject)(C.NULL)\n\tif object != nil {\n\t\tc_object = (*C.GObject)(object.ToC())\n\t}\n\n\tretC := C.g_closure_new_object(c_sizeof_closure, c_object)\n\tretGo := ClosureNewFromC(unsafe.Pointer(retC))\n\n\treturn retGo\n}","func NewFunc(name string, nestDepth uint32) *FuncInfo {\n\tif name != \"\" {\n\t\treturn &FuncInfo{name: name}\n\t}\n\treturn &FuncInfo{closure: &printer.ReservedExpr{}}\n}","func NewFunctionBase(ctx sctx.Context, funcName string, retType *types.FieldType, args ...Expression) (Expression, error) {\n\treturn newFunctionImpl(ctx, false, funcName, retType, args...)\n}","func NewOperator(kind string, in, out reflect.Type, f func(ctx context.Context, field string, object interface{}) (interface{}, error)) Operator {\n\treturn &operator{\n\t\tkind: kind,\n\t\tin: in,\n\t\tout: out,\n\t\tf: f,\n\t}\n}","func New(fn interface{}, validateFunc func(*FunctionCache) error) (*GenericFunc, error) {\n\tcache := &FunctionCache{}\n\tcache.FnValue = reflect.ValueOf(fn)\n\n\tif cache.FnValue.Kind() != reflect.Func {\n\t\treturn nil, errors.New(\"GenericFunc.New: fn is not a function\")\n\t}\n\n\tcache.FnType = cache.FnValue.Type()\n\tnumTypesIn := cache.FnType.NumIn()\n\tcache.TypesIn = make([]reflect.Type, numTypesIn)\n\tfor i := 0; i < numTypesIn; i++ {\n\t\tcache.TypesIn[i] = cache.FnType.In(i)\n\t}\n\n\tnumTypesOut := cache.FnType.NumOut()\n\tcache.TypesOut = make([]reflect.Type, numTypesOut)\n\tfor i := 0; i < numTypesOut; i++ {\n\t\tcache.TypesOut[i] = cache.FnType.Out(i)\n\t}\n\tif err := validateFunc(cache); err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn &GenericFunc{Cache: cache}, nil\n}","func Constructor() Trie {\n\treturn Trie{\n\t\tnext: [26]*Trie{},\n\t}\n}","func NewFunction(f func(float64) float64) *Function {\n\treturn &Function{\n\t\tF: f,\n\t\tSamples: 50,\n\t\tLineStyle: plotter.DefaultLineStyle,\n\t}\n}","func NewFunctionCall(name string, params []Expression, returnType Type) Expression {\n\treturn &functionCall{\n\t\tname: name,\n\t\tparams: params,\n\t\treturnType: returnType,\n\t}\n}","func NewCurry(fn interface{}) (*Curry, error) {\n\ttyp := reflect.TypeOf(fn)\n\n\tif typ.Kind() != reflect.Func {\n\t\treturn nil, fmt.Errorf(\"Handler is not a function!\")\n\t}\n\n\tc := &Curry{\n\t\tname: getFunctionName(fn),\n\t\tfnType: typ,\n\t\tfn: fn,\n\t}\n\n\treturn c, nil\n}","func New() Object {\n\treturn Object{}\n}","func new_(e interface{}) func() Event {\n\ttyp := reflect.TypeOf(e)\n\treturn func() Event {\n\t\treturn reflect.New(typ).Interface().(Event)\n\t}\n}","func NewFunctionCall(name string, context string, args ...interface{}) FunctionCall {\n\treturn FunctionCall{name, context, args}\n}","func NewLambda(vs []Argument, u bool, as []Argument, e Expression, t types.Type) Lambda {\n\treturn Lambda{as, e, t, vs, u}\n}","func Constructor() MinStack {\r\n\treturn MinStack{}\r\n}","func Constructor() MinStack {\n\treturn MinStack{atoms: []atom{}}\n}","func New(hashFunc func(i interface{}) int64) *rbTree {\n\treturn &rbTree{hashFunc: hashFunc}\n}","func NewFunction(pkg, name string,\n\tparams, ret, block []jen.Code) *Function {\n\treturn &Function{\n\t\tqual: jen.Qual(pkg, name),\n\t\tname: name,\n\t\tparams: params,\n\t\tret: ret,\n\t\tblock: block,\n\t}\n}","func Constructor() TwoSum {\n\treturn TwoSum{data: map[int]int{}}\n}","func NewMapper(m func(srcPtr interface{}, destPtr interface{}) error) Mapper {\n return funcMapper(m)\n}","func Constructor() MinStack {\n\treturn MinStack{}\n}","func Constructor() MinStack {\n\treturn MinStack{}\n}","func Constructor() MinStack {\n\treturn MinStack{}\n}","func Constructor() MinStack {\n\treturn MinStack{}\n}"],"string":"[\n \"func (this *ObjectAdd) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectAdd(operands[0], operands[1], operands[2])\\n\\t}\\n}\",\n \"func (this *ObjectRemove) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectRemove(operands[0], operands[1])\\n\\t}\\n}\",\n \"func (this *ObjectUnwrap) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectUnwrap(operands[0])\\n\\t}\\n}\",\n \"func (this *ObjectPut) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectPut(operands[0], operands[1], operands[2])\\n\\t}\\n}\",\n \"func (this *ObjectValues) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectValues(operands[0])\\n\\t}\\n}\",\n \"func (this *ObjectValues) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectValues(operands[0])\\n\\t}\\n}\",\n \"func (this *ObjectNames) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectNames(operands[0])\\n\\t}\\n}\",\n \"func (this *ObjectNames) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectNames(operands[0])\\n\\t}\\n}\",\n \"func (this *DateAddMillis) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewDateAddMillis(operands[0], operands[1], operands[2])\\n\\t}\\n}\",\n \"func (this *DateAddStr) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewDateAddStr(operands[0], operands[1], operands[2])\\n\\t}\\n}\",\n \"func NewObjectLength(operand Expression) Function {\\n\\trv := &ObjectLength{\\n\\t\\t*NewUnaryFunctionBase(\\\"object_length\\\", operand),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func NewObjectLength(operand Expression) Function {\\n\\trv := &ObjectLength{\\n\\t\\t*NewUnaryFunctionBase(\\\"object_length\\\", operand),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func (this *DateDiffMillis) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewDateDiffMillis(operands[0], operands[1], operands[2])\\n\\t}\\n}\",\n \"func (this *DateDiffStr) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewDateDiffStr(operands[0], operands[1], operands[2])\\n\\t}\\n}\",\n \"func (this *Mod) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewMod(operands[0], operands[1])\\n\\t}\\n}\",\n \"func (this *ObjectInnerValues) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectInnerValues(operands[0])\\n\\t}\\n}\",\n \"func (this *ObjectPairs) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectPairs(operands[0])\\n\\t}\\n}\",\n \"func (this *ObjectPairs) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectPairs(operands[0])\\n\\t}\\n}\",\n \"func NewConstructor(x interface{}) (*Constructor, error) {\\n\\tif x == nil {\\n\\t\\treturn nil, kerror.New(kerror.EViolation, \\\"function expected, nil given\\\")\\n\\t}\\n\\tft := reflect.TypeOf(x)\\n\\tfv := reflect.ValueOf(x)\\n\\tif ft.Kind() != reflect.Func {\\n\\t\\treturn nil, kerror.Newf(kerror.EViolation, \\\"function expected, %s given\\\", ft)\\n\\t}\\n\\tif fv.IsNil() {\\n\\t\\treturn nil, kerror.New(kerror.EViolation, \\\"function expected, nil given\\\")\\n\\t}\\n\\tc := &Constructor{\\n\\t\\tfunction: fv,\\n\\t}\\n\\tnumIn := ft.NumIn()\\n\\tif ft.IsVariadic() {\\n\\t\\tnumIn--\\n\\t}\\n\\tc.inTypes = make([]reflect.Type, numIn)\\n\\tfor i := 0; i < numIn; i++ {\\n\\t\\tc.inTypes[i] = ft.In(i)\\n\\t}\\n\\tswitch ft.NumOut() {\\n\\tdefault:\\n\\t\\treturn nil, kerror.Newf(kerror.EViolation, \\\"function %s is not a constructor\\\", ft)\\n\\tcase 1:\\n\\t\\tc.t = ft.Out(0)\\n\\t\\tc.objectOutIndex = 0\\n\\t\\tc.destructorOutIndex = -1\\n\\t\\tc.errorOutIndex = -1\\n\\tcase 2:\\n\\t\\tif ft.Out(1) != errorType {\\n\\t\\t\\treturn nil, kerror.Newf(kerror.EViolation, \\\"function %s is not a constructor\\\", ft)\\n\\t\\t}\\n\\t\\tc.t = ft.Out(0)\\n\\t\\tc.objectOutIndex = 0\\n\\t\\tc.destructorOutIndex = -1\\n\\t\\tc.errorOutIndex = 1\\n\\tcase 3:\\n\\t\\tif ft.Out(1) != destructorType || ft.Out(2) != errorType {\\n\\t\\t\\treturn nil, kerror.Newf(kerror.EViolation, \\\"function %s is not a constructor\\\", ft)\\n\\t\\t}\\n\\t\\tc.t = ft.Out(0)\\n\\t\\tc.objectOutIndex = 0\\n\\t\\tc.destructorOutIndex = 1\\n\\t\\tc.errorOutIndex = 2\\n\\t}\\n\\treturn c, nil\\n}\",\n \"func (this *NowMillis) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function { return _NOW_MILLIS }\\n}\",\n \"func (this *DateTruncStr) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewDateTruncStr(operands[0], operands[1])\\n\\t}\\n}\",\n \"func (this *DatePartStr) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewDatePartStr(operands[0], operands[1])\\n\\t}\\n}\",\n \"func (this *StrToMillis) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewStrToMillis(operands[0])\\n\\t}\\n}\",\n \"func (this *DatePartMillis) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewDatePartMillis(operands[0], operands[1])\\n\\t}\\n}\",\n \"func (this *StrToZoneName) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewStrToZoneName(operands[0], operands[1])\\n\\t}\\n}\",\n \"func (this *Element) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewElement(operands[0], operands[1])\\n\\t}\\n}\",\n \"func (this *ObjectInnerPairs) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectInnerPairs(operands[0])\\n\\t}\\n}\",\n \"func (this *DateTruncMillis) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewDateTruncMillis(operands[0], operands[1])\\n\\t}\\n}\",\n \"func (this *NowStr) Constructor() FunctionConstructor { return NewNowStr }\",\n \"func (this *ClockMillis) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function { return _CLOCK_MILLIS }\\n}\",\n \"func Function(args ...Type) *Operator {\\n\\treturn &Operator{functionName, args}\\n}\",\n \"func New(spec *Spec) Function {\\n\\tf := Function{\\n\\t\\tspec: spec,\\n\\t}\\n\\treturn f\\n}\",\n \"func (this *StrToUTC) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewStrToUTC(operands[0])\\n\\t}\\n}\",\n \"func (this *Not) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewNot(operands[0])\\n\\t}\\n}\",\n \"func (f Function) New(ctx string) error {\\n\\treturn f.unsafeWrap(errors.New(ctx), ctx, \\\"\\\")\\n}\",\n \"func NewFunction(retType types.WaccType, ident *Ident, params ParamList,\\n\\tstats Statement, pos errors.Position) *Function {\\n\\tfn := &Function{\\n\\t\\tretType: retType,\\n\\t\\tident: ident,\\n\\t\\tparams: params,\\n\\t\\tpos: pos,\\n\\t}\\n\\tswitch st := stats.(type) {\\n\\tcase StatMultiple:\\n\\t\\tfn.stats = st\\n\\tdefault:\\n\\t\\tfn.stats = StatMultiple{st}\\n\\t}\\n\\treturn fn\\n}\",\n \"func (this *MillisToStr) Constructor() FunctionConstructor { return NewMillisToStr }\",\n \"func NewFunction(name string, typ semantic.Type, call func(args Object) (Value, error), sideEffect bool) Function {\\n\\treturn &function{\\n\\t\\tname: name,\\n\\t\\tt: typ,\\n\\t\\tcall: call,\\n\\t\\thasSideEffect: sideEffect,\\n\\t}\\n}\",\n \"func NewFunction(ctx sctx.Context, funcName string, retType *types.FieldType, args ...Expression) (Expression, error) {\\n\\treturn newFunctionImpl(ctx, true, funcName, retType, args...)\\n}\",\n \"func tcNew(n *ir.UnaryExpr) ir.Node {\\n\\tif n.X == nil {\\n\\t\\t// Fatalf because the OCALL above checked for us,\\n\\t\\t// so this must be an internally-generated mistake.\\n\\t\\tbase.Fatalf(\\\"missing argument to new\\\")\\n\\t}\\n\\tl := n.X\\n\\tl = typecheck(l, ctxType)\\n\\tt := l.Type()\\n\\tif t == nil {\\n\\t\\tn.SetType(nil)\\n\\t\\treturn n\\n\\t}\\n\\tn.X = l\\n\\tn.SetType(types.NewPtr(t))\\n\\treturn n\\n}\",\n \"func NewFunc(name string, typ Type) *Func {\\n\\treturn &Func{object: object{scope: nil, name: name, typ: typ}}\\n}\",\n \"func NewFunction(ifunc IFunction, name string) IQueryField {\\n\\treturn &SFunctionFieldBase{\\n\\t\\tIFunction: ifunc,\\n\\t\\talias: name,\\n\\t}\\n}\",\n \"func (this *ClockStr) Constructor() FunctionConstructor { return NewClockStr }\",\n \"func newFunction(p *Package, fl *File, f *ast.FuncDecl) *Function {\\n\\tres := &Function{\\n\\t\\tpkg: p,\\n\\t\\tfile: fl,\\n\\t\\tfn: f,\\n\\t\\tname: nameFromIdent(f.Name),\\n\\t\\tdef: getFunc(p, fl, f.Type).(*FuncType),\\n\\t}\\n\\n\\tif res.fn.Recv != nil {\\n\\t\\tn := \\\"\\\"\\n\\t\\tif res.fn.Recv.List[0].Names != nil {\\n\\t\\t\\tn = nameFromIdent(res.fn.Recv.List[0].Names[0])\\n\\t\\t}\\n\\t\\tres.receiver = newVariableFromExpr(res.pkg, res.file, n, res.fn.Recv.List[0].Type)\\n\\t\\tvar def Definition\\n\\t\\tvar def2 *StarType\\n\\t\\tdef = res.receiver.def\\n\\t\\tdef2, res.receiverPointer = def.(*StarType)\\n\\t\\tif res.receiverPointer {\\n\\t\\t\\tdef = def2.Target()\\n\\t\\t}\\n\\t\\tres.receiverClass = def.String()\\n\\t}\\n\\treturn res\\n}\",\n \"func (this *MillisToZoneName) Constructor() FunctionConstructor { return NewMillisToZoneName }\",\n \"func NewFunction(name, cname, comment, member string, typ Type) *Function {\\n\\tfunctionName := UpperFirstCharacter(name)\\n\\treceiverType := TrimLanguagePrefix(cname)\\n\\treceiverName := CommonReceiverName(receiverType)\\n\\n\\tf := &Function{\\n\\t\\tIncludeFiles: NewIncludeFiles(),\\n\\t\\tName: functionName,\\n\\t\\tCName: cname,\\n\\t\\tComment: comment,\\n\\t\\tParameters: []FunctionParameter{ // TODO(go-clang): this might not be needed if the receiver code is refactored: https://github.com/go-clang/gen/issues/52\\n\\t\\t\\t{\\n\\t\\t\\t\\tName: receiverName,\\n\\t\\t\\t\\tCName: cname,\\n\\t\\t\\t\\tType: Type{\\n\\t\\t\\t\\t\\tGoName: receiverType,\\n\\t\\t\\t\\t},\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\tReturnType: typ,\\n\\t\\tReceiver: Receiver{\\n\\t\\t\\tName: receiverName,\\n\\t\\t\\tType: Type{\\n\\t\\t\\t\\tGoName: receiverType,\\n\\t\\t\\t},\\n\\t\\t},\\n\\t\\tMember: &FunctionParameter{\\n\\t\\t\\tName: member,\\n\\t\\t\\tType: typ,\\n\\t\\t},\\n\\t}\\n\\n\\treturn f\\n}\",\n \"func (this *MillisToUTC) Constructor() FunctionConstructor { return NewMillisToUTC }\",\n \"func NewFunction(fnLit *ast.FunctionLiteral, env *Environment) *Function {\\n\\treturn &Function{\\n\\t\\tParameters: fnLit.Parameters,\\n\\t\\tBody: fnLit.Body,\\n\\t\\tEnv: env,\\n\\t}\\n}\",\n \"func Constructor() MapSum {\\n\\treturn MapSum{}\\n}\",\n \"func execNewFunc(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(4)\\n\\tret := types.NewFunc(token.Pos(args[0].(int)), args[1].(*types.Package), args[2].(string), args[3].(*types.Signature))\\n\\tp.Ret(4, ret)\\n}\",\n \"func NewFunction(config *truce.HTTP, function truce.Function) (*Function, error) {\\n\\tif function.Transports.HTTP == nil {\\n\\t\\treturn nil, nil\\n\\t}\\n\\n\\ttransport := *function.Transports.HTTP\\n\\n\\tb := &Function{\\n\\t\\tDefinition: function,\\n\\t\\tQuery: map[string]QueryParam{},\\n\\t}\\n\\n\\ttype argument struct {\\n\\t\\tvariable string\\n\\t\\tposVariable string\\n\\t\\ttyp string\\n\\t}\\n\\n\\tvar (\\n\\t\\tpathMappings = map[string]string{}\\n\\t\\targs = map[string]argument{}\\n\\t)\\n\\n\\tfor i, field := range function.Arguments {\\n\\t\\targs[field.Name] = argument{\\n\\t\\t\\ttyp: string(field.Type),\\n\\t\\t\\tposVariable: fmt.Sprintf(\\\"v%d\\\", i),\\n\\t\\t\\tvariable: field.Name,\\n\\t\\t}\\n\\t}\\n\\n\\tif function.Return.Present && function.Return.Name != \\\"\\\" {\\n\\t\\tb.HasReturn = true\\n\\t\\tb.ReturnType = string(function.Return.Type)\\n\\n\\t\\tif len(b.ReturnType) < 1 {\\n\\t\\t\\treturn nil, errors.New(\\\"return type cannot be empty\\\")\\n\\t\\t}\\n\\n\\t\\tif b.ReturnType[0] == '*' {\\n\\t\\t\\tb.ReturnType = b.ReturnType[1:]\\n\\t\\t\\tb.ReturnIsPtr = true\\n\\t\\t}\\n\\t}\\n\\n\\tb.Method = transport.Method\\n\\n\\t// Sort the arguments by name for consistent positional ordering.\\n\\tvar argVals []truce.ArgumentValue\\n\\tfor _, arg := range transport.Arguments {\\n\\t\\targVals = append(argVals, arg)\\n\\t}\\n\\tsort.Slice(argVals, func(i, j int) bool {\\n\\t\\treturn argVals[i].Name < argVals[j].Name\\n\\t})\\n\\n\\tvar qpos int\\n\\tfor _, arg := range argVals {\\n\\t\\ta, ok := args[arg.Name]\\n\\n\\t\\tswitch arg.From {\\n\\t\\tcase \\\"body\\\":\\n\\t\\t\\tif !ok {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\tb.BodyVar = a.posVariable\\n\\t\\t\\tb.BodyType = a.typ\\n\\t\\tcase \\\"path\\\":\\n\\t\\t\\tif !ok {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\tpathMappings[arg.Var] = args[arg.Name].variable\\n\\t\\tcase \\\"query\\\":\\n\\t\\t\\tif !ok {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\n\\t\\t\\tb.Query[arg.Var] = QueryParam{\\n\\t\\t\\t\\tPos: qpos,\\n\\t\\t\\t\\tQueryVar: arg.Var,\\n\\t\\t\\t\\tGoVar: a.posVariable,\\n\\t\\t\\t\\tType: a.typ,\\n\\t\\t\\t}\\n\\n\\t\\t\\tqpos++\\n\\t\\tcase \\\"static\\\":\\n\\t\\t\\t// TODO(georgemac)\\n\\t\\t}\\n\\t}\\n\\n\\tfor _, part := range strings.Split(config.Prefix, \\\"/\\\") {\\n\\t\\tif part == \\\"\\\" {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tb.Path = append(b.Path, Element{Type: \\\"static\\\", Value: part})\\n\\t}\\n\\n\\tb.Path = append(b.Path, parsePath(pathMappings, transport.Path)...)\\n\\n\\treturn b, nil\\n}\",\n \"func NewConstructor(o Options) func(http.Handler) http.Handler {\\n\\tif o.Timeout <= 0 {\\n\\t\\treturn xhttp.NilConstructor\\n\\t}\\n\\n\\t// nolint: typecheck\\n\\tif o.TimedOut == nil {\\n\\t\\to.TimedOut = defaultTimedOut\\n\\t}\\n\\n\\treturn func(next http.Handler) http.Handler {\\n\\t\\treturn &timeoutHandler{\\n\\t\\t\\ttimeout: o.Timeout,\\n\\t\\t\\ttimedOut: o.TimedOut,\\n\\t\\t\\tnext: next,\\n\\t\\t}\\n\\t}\\n}\",\n \"func (o *FakeObject) New(args ...interface{}) Object { return o.Invoke(args) }\",\n \"func (er *expressionRewriter) newFunction(funcName string, retType *types.FieldType, args ...expression.Expression) (expression.Expression, error) {\\n\\ttrace_util_0.Count(_expression_rewriter_00000, 275)\\n\\tif er.disableFoldCounter > 0 {\\n\\t\\ttrace_util_0.Count(_expression_rewriter_00000, 277)\\n\\t\\treturn expression.NewFunctionBase(er.ctx, funcName, retType, args...)\\n\\t}\\n\\ttrace_util_0.Count(_expression_rewriter_00000, 276)\\n\\treturn expression.NewFunction(er.ctx, funcName, retType, args...)\\n}\",\n \"func (s *Prototype) Constructor() Value { return s.constructor }\",\n \"func NewFunction(ctx openedge.Context, cfg FunctionInfo) *Function {\\n\\tf := &Function{\\n\\t\\tcfg: cfg,\\n\\t\\tctx: ctx,\\n\\t\\tids: make(chan string, cfg.Instance.Max),\\n\\t\\tlog: logger.WithField(\\\"function\\\", cfg.Name),\\n\\t}\\n\\tfor index := 1; index <= cfg.Instance.Max; index++ {\\n\\t\\tf.ids <- fmt.Sprintf(\\\"f%d\\\", index)\\n\\t}\\n\\tpc := pool.NewDefaultPoolConfig()\\n\\tpc.MinIdle = cfg.Instance.Min\\n\\tpc.MaxIdle = cfg.Instance.Max\\n\\tpc.MaxTotal = cfg.Instance.Max\\n\\tpc.MinEvictableIdleTime = cfg.Instance.IdleTime\\n\\tpc.TimeBetweenEvictionRuns = cfg.Instance.EvictTime\\n\\tf.pool = pool.NewObjectPool(context.Background(), newFactory(f), pc)\\n\\treturn f\\n}\",\n \"func newInstance0(frame *rtda.Frame) {\\n\\tvars := frame.LocalVars()\\n\\tconstructorObj := vars.GetRef(0)\\n\\targArrObj := vars.GetRef(1)\\n\\n\\tgoConstructor := getExtra(constructorObj)\\n\\tgoClass := goConstructor.Class()\\n\\tobj := goClass.NewObj()\\n\\tstack := frame.OperandStack()\\n\\tstack.PushRef(obj)\\n\\n\\t// call <init>\\n\\targs := actualConstructorArgs(obj, argArrObj, goConstructor)\\n\\tframe.Thread().InvokeMethodWithShim(goConstructor, args)\\n}\",\n \"func New() *Compiler {\\n\\tmainScope := CompilationScope{\\n\\t\\tinstructions: code.Instructions{},\\n\\t\\tlastInstruction: EmittedInstruction{},\\n\\t\\tpreviousInstruction: EmittedInstruction{},\\n\\t}\\n\\ttable := NewSymbolTable()\\n\\tfor i, fn := range object.GetBuiltins() {\\n\\t\\ttable.DefineBuiltin(i, fn.Name)\\n\\t}\\n\\treturn &Compiler{\\n\\t\\tconstants: []object.Object{},\\n\\t\\tscopes: []CompilationScope{mainScope},\\n\\t\\tscopeIndex: 0,\\n\\t\\tsymbolTable: table,\\n\\t}\\n}\",\n \"func NewCommand(cmd uint32, count int) Command {\\n\\treturn Command((cmd & 0x7) | (uint32(count) << 3))\\n}\",\n \"func New(chainFunc ...interface{}) *Chain {\\n\\tc := &Chain{}\\n\\tc.Add(chainFunc...)\\n\\treturn c\\n}\",\n \"func TermConstructor(t TermT) TermConstructorT {\\n\\treturn TermConstructorT(C.yices_term_constructor(C.term_t(t)))\\n}\",\n \"func NewConstructor() *Constructor {\\n\\treturn &Constructor{}\\n}\",\n \"func NewFunction0(name string, sqlType Type, logic EvalLogic) Function0 {\\n\\tfn := func() Expression {\\n\\t\\treturn NoArgFunc{name, sqlType, logic}\\n\\t}\\n\\n\\treturn Function0{Name: name, Fn: fn}\\n}\",\n \"func NewConstructor() Constructor {\\n\\treturn func(ctx context.Context, cmw configmap.Watcher) *controller.Impl {\\n\\t\\treturn NewController(ctx, cmw)\\n\\t}\\n}\",\n \"func Constructor() MapSum {\\n \\n}\",\n \"func Constructor() MyStack {\\n\\treturn MyStack{New(), New(), 1}\\n}\",\n \"func Constructor() MapSum {\\n\\treturn MapSum{\\n\\t\\troot: &TrieNode{},\\n\\t}\\n}\",\n \"func ClosureNew(f interface{}) *C.GClosure {\\n\\tclosure := C._g_closure_new()\\n\\tclosures.Lock()\\n\\tclosures.m[closure] = reflect.ValueOf(f)\\n\\tclosures.Unlock()\\n\\treturn closure\\n}\",\n \"func (sf *ScalarFunction) Clone() Expression {\\n\\tc := &ScalarFunction{\\n\\t\\tFuncName: sf.FuncName,\\n\\t\\tRetType: sf.RetType,\\n\\t\\tFunction: sf.Function.Clone(),\\n\\t}\\n\\treturn c\\n}\",\n \"func Function(sig *CallSignature) Type {\\n\\treturn Type{functionImpl{sig: sig}}\\n}\",\n \"func newFunctionImpl(ctx sctx.Context, fold bool, funcName string, retType *types.FieldType, args ...Expression) (Expression, error) {\\n\\tif retType == nil {\\n\\t\\treturn nil, errors.Errorf(\\\"RetType cannot be nil for ScalarFunction.\\\")\\n\\t}\\n\\tfc, ok := funcs[funcName]\\n\\tif !ok {\\n\\t\\tdb := ctx.GetSessionVars().CurrentDB\\n\\t\\tif db == \\\"\\\" {\\n\\t\\t\\treturn nil, errors.Trace(ErrNoDB)\\n\\t\\t}\\n\\n\\t\\treturn nil, errFunctionNotExists.GenWithStackByArgs(\\\"FUNCTION\\\", db+\\\".\\\"+funcName)\\n\\t}\\n\\tfuncArgs := make([]Expression, len(args))\\n\\tcopy(funcArgs, args)\\n\\tf, err := fc.getFunction(ctx, funcArgs)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\tif builtinRetTp := f.getRetTp(); builtinRetTp.Tp != mysql.TypeUnspecified || retType.Tp == mysql.TypeUnspecified {\\n\\t\\tretType = builtinRetTp\\n\\t}\\n\\tsf := &ScalarFunction{\\n\\t\\tFuncName: model.NewCIStr(funcName),\\n\\t\\tRetType: retType,\\n\\t\\tFunction: f,\\n\\t}\\n\\treturn sf, nil\\n}\",\n \"func NewSelf() Function {\\n\\trv := &Self{\\n\\t\\t*NewNullaryFunctionBase(\\\"self\\\"),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func Constructor() Trie {\\n\\treturn Trie{100, false, [26]*Trie{}}\\n}\",\n \"func (c *Constructor) Create(a ...reflect.Value) (reflect.Value, kdone.Destructor, error) {\\n\\tif c == nil {\\n\\t\\treturn reflect.Value{}, kdone.Noop, nil\\n\\t}\\n\\tif len(a) != len(c.inTypes) {\\n\\t\\treturn reflect.Value{}, nil, kerror.Newf(kerror.EViolation,\\n\\t\\t\\t\\\"%s constructor expects %d argument(s), %d given\\\",\\n\\t\\t\\tc.t, len(c.inTypes), len(a))\\n\\t}\\n\\tfor i, v := range a {\\n\\t\\tif v.Type() != c.inTypes[i] {\\n\\t\\t\\treturn reflect.Value{}, nil, kerror.Newf(kerror.EViolation,\\n\\t\\t\\t\\t\\\"%s constructor expects argument %d to be of %s type, %s given\\\",\\n\\t\\t\\t\\tc.t, i+1, c.inTypes[i], v.Type())\\n\\t\\t}\\n\\t}\\n\\tout := c.function.Call(a)\\n\\tobj := out[c.objectOutIndex]\\n\\tvar dtor kdone.Destructor = kdone.Noop\\n\\tif c.destructorOutIndex >= 0 {\\n\\t\\tif v := out[c.destructorOutIndex].Interface(); v != nil {\\n\\t\\t\\tdtor = v.(kdone.Destructor)\\n\\t\\t}\\n\\t}\\n\\tvar err error\\n\\tif c.errorOutIndex >= 0 {\\n\\t\\tif v := out[c.errorOutIndex].Interface(); v != nil {\\n\\t\\t\\terr = v.(error)\\n\\t\\t}\\n\\t}\\n\\treturn obj, dtor, err\\n}\",\n \"func New(length int) func() *Float32s {\\r\\n\\treturn func() *Float32s {\\r\\n\\t\\tresult := make(Float32s, length)\\r\\n\\t\\tfor i := 0; i < length; i++ {\\r\\n\\t\\t\\tresult[i] = randFloat32()\\r\\n\\t\\t}\\r\\n\\t\\treturn &result\\r\\n\\t}\\r\\n}\",\n \"func NewFunctionCall(callee Expression, arguments []Expression, trailing *TrailingFunction, metadata *Metadata) *FunctionCall {\\n\\treturn &FunctionCall{callee, arguments, trailing, metadata}\\n}\",\n \"func ClosureNewObject(sizeofClosure uint32, object *Object) *Closure {\\n\\tc_sizeof_closure := (C.guint)(sizeofClosure)\\n\\n\\tc_object := (*C.GObject)(C.NULL)\\n\\tif object != nil {\\n\\t\\tc_object = (*C.GObject)(object.ToC())\\n\\t}\\n\\n\\tretC := C.g_closure_new_object(c_sizeof_closure, c_object)\\n\\tretGo := ClosureNewFromC(unsafe.Pointer(retC))\\n\\n\\treturn retGo\\n}\",\n \"func NewFunc(name string, nestDepth uint32) *FuncInfo {\\n\\tif name != \\\"\\\" {\\n\\t\\treturn &FuncInfo{name: name}\\n\\t}\\n\\treturn &FuncInfo{closure: &printer.ReservedExpr{}}\\n}\",\n \"func NewFunctionBase(ctx sctx.Context, funcName string, retType *types.FieldType, args ...Expression) (Expression, error) {\\n\\treturn newFunctionImpl(ctx, false, funcName, retType, args...)\\n}\",\n \"func NewOperator(kind string, in, out reflect.Type, f func(ctx context.Context, field string, object interface{}) (interface{}, error)) Operator {\\n\\treturn &operator{\\n\\t\\tkind: kind,\\n\\t\\tin: in,\\n\\t\\tout: out,\\n\\t\\tf: f,\\n\\t}\\n}\",\n \"func New(fn interface{}, validateFunc func(*FunctionCache) error) (*GenericFunc, error) {\\n\\tcache := &FunctionCache{}\\n\\tcache.FnValue = reflect.ValueOf(fn)\\n\\n\\tif cache.FnValue.Kind() != reflect.Func {\\n\\t\\treturn nil, errors.New(\\\"GenericFunc.New: fn is not a function\\\")\\n\\t}\\n\\n\\tcache.FnType = cache.FnValue.Type()\\n\\tnumTypesIn := cache.FnType.NumIn()\\n\\tcache.TypesIn = make([]reflect.Type, numTypesIn)\\n\\tfor i := 0; i < numTypesIn; i++ {\\n\\t\\tcache.TypesIn[i] = cache.FnType.In(i)\\n\\t}\\n\\n\\tnumTypesOut := cache.FnType.NumOut()\\n\\tcache.TypesOut = make([]reflect.Type, numTypesOut)\\n\\tfor i := 0; i < numTypesOut; i++ {\\n\\t\\tcache.TypesOut[i] = cache.FnType.Out(i)\\n\\t}\\n\\tif err := validateFunc(cache); err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\n\\treturn &GenericFunc{Cache: cache}, nil\\n}\",\n \"func Constructor() Trie {\\n\\treturn Trie{\\n\\t\\tnext: [26]*Trie{},\\n\\t}\\n}\",\n \"func NewFunction(f func(float64) float64) *Function {\\n\\treturn &Function{\\n\\t\\tF: f,\\n\\t\\tSamples: 50,\\n\\t\\tLineStyle: plotter.DefaultLineStyle,\\n\\t}\\n}\",\n \"func NewFunctionCall(name string, params []Expression, returnType Type) Expression {\\n\\treturn &functionCall{\\n\\t\\tname: name,\\n\\t\\tparams: params,\\n\\t\\treturnType: returnType,\\n\\t}\\n}\",\n \"func NewCurry(fn interface{}) (*Curry, error) {\\n\\ttyp := reflect.TypeOf(fn)\\n\\n\\tif typ.Kind() != reflect.Func {\\n\\t\\treturn nil, fmt.Errorf(\\\"Handler is not a function!\\\")\\n\\t}\\n\\n\\tc := &Curry{\\n\\t\\tname: getFunctionName(fn),\\n\\t\\tfnType: typ,\\n\\t\\tfn: fn,\\n\\t}\\n\\n\\treturn c, nil\\n}\",\n \"func New() Object {\\n\\treturn Object{}\\n}\",\n \"func new_(e interface{}) func() Event {\\n\\ttyp := reflect.TypeOf(e)\\n\\treturn func() Event {\\n\\t\\treturn reflect.New(typ).Interface().(Event)\\n\\t}\\n}\",\n \"func NewFunctionCall(name string, context string, args ...interface{}) FunctionCall {\\n\\treturn FunctionCall{name, context, args}\\n}\",\n \"func NewLambda(vs []Argument, u bool, as []Argument, e Expression, t types.Type) Lambda {\\n\\treturn Lambda{as, e, t, vs, u}\\n}\",\n \"func Constructor() MinStack {\\r\\n\\treturn MinStack{}\\r\\n}\",\n \"func Constructor() MinStack {\\n\\treturn MinStack{atoms: []atom{}}\\n}\",\n \"func New(hashFunc func(i interface{}) int64) *rbTree {\\n\\treturn &rbTree{hashFunc: hashFunc}\\n}\",\n \"func NewFunction(pkg, name string,\\n\\tparams, ret, block []jen.Code) *Function {\\n\\treturn &Function{\\n\\t\\tqual: jen.Qual(pkg, name),\\n\\t\\tname: name,\\n\\t\\tparams: params,\\n\\t\\tret: ret,\\n\\t\\tblock: block,\\n\\t}\\n}\",\n \"func Constructor() TwoSum {\\n\\treturn TwoSum{data: map[int]int{}}\\n}\",\n \"func NewMapper(m func(srcPtr interface{}, destPtr interface{}) error) Mapper {\\n return funcMapper(m)\\n}\",\n \"func Constructor() MinStack {\\n\\treturn MinStack{}\\n}\",\n \"func Constructor() MinStack {\\n\\treturn MinStack{}\\n}\",\n \"func Constructor() MinStack {\\n\\treturn MinStack{}\\n}\",\n \"func Constructor() MinStack {\\n\\treturn MinStack{}\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7275384","0.69671285","0.6962341","0.68921953","0.6845353","0.6845353","0.68416286","0.68416286","0.6744794","0.6708235","0.6654913","0.6654913","0.66427934","0.6617833","0.6557411","0.6531051","0.65282565","0.65282565","0.6448263","0.6430938","0.642644","0.6416298","0.6379176","0.6367499","0.6366126","0.62883306","0.62635535","0.62385595","0.6231371","0.62291867","0.6165766","0.6147356","0.6105036","0.6083122","0.6003783","0.5977542","0.5927735","0.5885979","0.58768934","0.5810873","0.57859194","0.5747765","0.5736086","0.57057744","0.56806284","0.55061185","0.5496205","0.5493704","0.5482538","0.54738533","0.54588","0.5443965","0.54094404","0.5387287","0.5387196","0.5361126","0.53487706","0.53166324","0.5306954","0.52919453","0.52906483","0.52859384","0.52840936","0.52802795","0.52708143","0.52690405","0.5266685","0.526243","0.52523154","0.52483165","0.5243988","0.52162164","0.5211306","0.5206393","0.5202841","0.5189611","0.51715684","0.5158675","0.5157257","0.5144621","0.5138274","0.51364094","0.512137","0.5120366","0.51169324","0.5115708","0.5115569","0.51068395","0.5095257","0.5093496","0.5088127","0.50878847","0.50815326","0.5076853","0.507033","0.5065051","0.5065051","0.5065051","0.5065051"],"string":"[\n \"0.7275384\",\n \"0.69671285\",\n \"0.6962341\",\n \"0.68921953\",\n \"0.6845353\",\n \"0.6845353\",\n \"0.68416286\",\n \"0.68416286\",\n \"0.6744794\",\n \"0.6708235\",\n \"0.6654913\",\n \"0.6654913\",\n \"0.66427934\",\n \"0.6617833\",\n \"0.6557411\",\n \"0.6531051\",\n \"0.65282565\",\n \"0.65282565\",\n \"0.6448263\",\n \"0.6430938\",\n \"0.642644\",\n \"0.6416298\",\n \"0.6379176\",\n \"0.6367499\",\n \"0.6366126\",\n \"0.62883306\",\n \"0.62635535\",\n \"0.62385595\",\n \"0.6231371\",\n \"0.62291867\",\n \"0.6165766\",\n \"0.6147356\",\n \"0.6105036\",\n \"0.6083122\",\n \"0.6003783\",\n \"0.5977542\",\n \"0.5927735\",\n \"0.5885979\",\n \"0.58768934\",\n \"0.5810873\",\n \"0.57859194\",\n \"0.5747765\",\n \"0.5736086\",\n \"0.57057744\",\n \"0.56806284\",\n \"0.55061185\",\n \"0.5496205\",\n \"0.5493704\",\n \"0.5482538\",\n \"0.54738533\",\n \"0.54588\",\n \"0.5443965\",\n \"0.54094404\",\n \"0.5387287\",\n \"0.5387196\",\n \"0.5361126\",\n \"0.53487706\",\n \"0.53166324\",\n \"0.5306954\",\n \"0.52919453\",\n \"0.52906483\",\n \"0.52859384\",\n \"0.52840936\",\n \"0.52802795\",\n \"0.52708143\",\n \"0.52690405\",\n \"0.5266685\",\n \"0.526243\",\n \"0.52523154\",\n \"0.52483165\",\n \"0.5243988\",\n \"0.52162164\",\n \"0.5211306\",\n \"0.5206393\",\n \"0.5202841\",\n \"0.5189611\",\n \"0.51715684\",\n \"0.5158675\",\n \"0.5157257\",\n \"0.5144621\",\n \"0.5138274\",\n \"0.51364094\",\n \"0.512137\",\n \"0.5120366\",\n \"0.51169324\",\n \"0.5115708\",\n \"0.5115569\",\n \"0.51068395\",\n \"0.5095257\",\n \"0.5093496\",\n \"0.5088127\",\n \"0.50878847\",\n \"0.50815326\",\n \"0.5076853\",\n \"0.507033\",\n \"0.5065051\",\n \"0.5065051\",\n \"0.5065051\",\n \"0.5065051\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.79440147"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":998,"cells":{"query":{"kind":"string","value":"/ The function NewObjectNames calls NewUnaryFunctionBase to create a function named OBJECT_NAMES with an expression as input."},"document":{"kind":"string","value":"func NewObjectNames(operand Expression) Function {\n\trv := &ObjectNames{\n\t\t*NewUnaryFunctionBase(\"object_names\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func (this *ObjectNames) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectNames(operands[0])\n\t}\n}","func (this *ObjectNames) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectNames(operands[0])\n\t}\n}","func (s Obj_value) NewName(n int32) (capnp.TextList, error) {\n\ts.Struct.SetUint16(4, 0)\n\tl, err := capnp.NewTextList(s.Struct.Segment(), n)\n\tif err != nil {\n\t\treturn capnp.TextList{}, err\n\t}\n\terr = s.Struct.SetPtr(0, l.List.ToPtr())\n\treturn l, err\n}","func execNewNamed(_ int, p *gop.Context) {\n\targs := p.GetArgs(3)\n\tret := types.NewNamed(args[0].(*types.TypeName), args[1].(types.Type), args[2].([]*types.Func))\n\tp.Ret(3, ret)\n}","func NewObjectValues(operand Expression) Function {\n\trv := &ObjectValues{\n\t\t*NewUnaryFunctionBase(\"object_values\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func NewObjectValues(operand Expression) Function {\n\trv := &ObjectValues{\n\t\t*NewUnaryFunctionBase(\"object_values\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func InitNames() {\n\tsyscall.Syscall(gpInitNames, 0, 0, 0, 0)\n}","func Names(v interface{}) []string {\n\treturn New(v).Names()\n}","func createList(arg string) []string {\n\tvar retObject = []string{arg}\n\treturn retObject\n}","func NewNameIn(vs ...string) predicate.User {\n\treturn predicate.User(sql.FieldIn(FieldNewName, vs...))\n}","func NewNameIn(vs ...string) predicate.User {\n\tv := make([]interface{}, len(vs))\n\tfor i := range v {\n\t\tv[i] = vs[i]\n\t}\n\treturn predicate.User(func(s *sql.Selector) {\n\t\t// if not arguments were provided, append the FALSE constants,\n\t\t// since we can't apply \"IN ()\". This will make this predicate falsy.\n\t\tif len(v) == 0 {\n\t\t\ts.Where(sql.False())\n\t\t\treturn\n\t\t}\n\t\ts.Where(sql.In(s.C(FieldNewName), v...))\n\t})\n}","func RegisterObject(name string, f NewObjectFct) {\n\tObjectList[name] = f\n}","func NewNameGTE(v string) predicate.User {\n\treturn predicate.User(sql.FieldGTE(FieldNewName, v))\n}","func NewOperationNamesStorage(\n\tsession cassandra.Session,\n\twriteCacheTTL time.Duration,\n\tmetricsFactory metrics.Factory,\n\tlogger *zap.Logger,\n) *OperationNamesStorage {\n\treturn &OperationNamesStorage{\n\t\tsession: session,\n\t\tInsertStmt: insertOperationName,\n\t\tQueryStmt: queryOperationNames,\n\t\tmetrics: casMetrics.NewTable(metricsFactory, \"OperationNames\"),\n\t\twriteCacheTTL: writeCacheTTL,\n\t\tlogger: logger,\n\t\toperationNames: cache.NewLRUWithOptions(\n\t\t\t100000,\n\t\t\t&cache.Options{\n\t\t\t\tTTL: writeCacheTTL,\n\t\t\t\tInitialCapacity: 0000,\n\t\t\t}),\n\t}\n}","func newnamel(pos src.XPos, s *types.Sym) *Node {\n\tif s == nil {\n\t\tFatalf(\"newnamel nil\")\n\t}\n\n\tvar x struct {\n\t\tn Node\n\t\tm Name\n\t\tp Param\n\t}\n\tn := &x.n\n\tn.Name = &x.m\n\tn.Name.Param = &x.p\n\n\tn.Op = ONAME\n\tn.Pos = pos\n\tn.Orig = n\n\n\tn.Sym = s\n\treturn n\n}","func objToNames(obj interface{}, names []string, tag string) []string {\n\tvar typ reflect.Type\n\n\tif sf, ok := obj.(reflect.StructField); ok {\n\t\ttyp = sf.Type\n\t} else {\n\t\ttyp = reflect.TypeOf(obj)\n\t\tif typ.Kind() == reflect.Ptr {\n\t\t\ttyp = typ.Elem()\n\t\t}\n\t}\n\n\tfor i := 0; i < typ.NumField(); i++ {\n\t\tfield := typ.Field(i)\n\n\t\tif field.Type.Kind() == reflect.Struct {\n\t\t\tnames = objToNames(field, names, tag)\n\t\t\tcontinue\n\t\t}\n\n\t\t// If tag is passed to the function, we only append if the field is tagged and that it matches tag.\n\t\tif tag == \"\" || field.Tag.Get(tag) != \"\" {\n\t\t\tnames = append(names, field.Name)\n\t\t}\n\t}\n\n\treturn names\n}","func NewObject(t ...[2]*Term) Object {\n\tobj := newobject(len(t))\n\tfor i := range t {\n\t\tobj.Insert(t[i][0], t[i][1])\n\t}\n\treturn obj\n}","func NewObjectRemove(first, second Expression) Function {\n\trv := &ObjectRemove{\n\t\t*NewBinaryFunctionBase(\"object_remove\", first, second),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func NewObjectLength(operand Expression) Function {\n\trv := &ObjectLength{\n\t\t*NewUnaryFunctionBase(\"object_length\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func NewObjectLength(operand Expression) Function {\n\trv := &ObjectLength{\n\t\t*NewUnaryFunctionBase(\"object_length\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func GetNewRegisteredUserNames(miscTable *db.Table) ([]string, error) {\n\tnewRegisteredUserNames := []string{}\n\terr := miscTable.GetObj(keyNewRegisteredUsers, &newRegisteredUserNames)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn newRegisteredUserNames, nil\n}","func (s *BasePlSqlParserListener) EnterRename_object(ctx *Rename_objectContext) {}","func InitNames() {\n\tC.glowInitNames(gpInitNames)\n}","func newname(s *types.Sym) *Node {\n\tn := newnamel(lineno, s)\n\tn.Name.Curfn = Curfn\n\treturn n\n}","func NewObjectPairs(operand Expression) Function {\n\trv := &ObjectPairs{\n\t\t*NewUnaryFunctionBase(\"object_pairs\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func NewObjectPairs(operand Expression) Function {\n\trv := &ObjectPairs{\n\t\t*NewUnaryFunctionBase(\"object_pairs\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func NewActionNames() *ActionNames {\n\tv := &ActionNames{}\n\treturn v\n}","func NewObjectAdd(first, second, third Expression) Function {\n\trv := &ObjectAdd{\n\t\t*NewTernaryFunctionBase(\"object_add\", first, second, third),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func (*Object) Name() string { return \"object\" }","func NamesFrom(list []string) Names {\n\tn := []Name{}\n\tfor _, v := range list {\n\t\tn = append(n, Name(v))\n\t}\n\treturn Names(n)\n}","func NNames(w http.ResponseWriter) error {\n\tv, err := getProperty(\"NNames\")\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tprop := Property{\n\t\tProperty: \"NNames\",\n\t\tValue: fmt.Sprint(v.Value().(uint32)),\n\t}\n\n\treturn share.JSONResponse(prop, w)\n}","func FieldArgNames(obj any, allArgs map[string]reflect.Value) {\n\tfieldArgNamesStruct(obj, \"\", false, allArgs)\n}","func execNewTypeName(_ int, p *gop.Context) {\n\targs := p.GetArgs(4)\n\tret := types.NewTypeName(token.Pos(args[0].(int)), args[1].(*types.Package), args[2].(string), args[3].(types.Type))\n\tp.Ret(4, ret)\n}","func (this *ObjectNames) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.UnaryEval(this, item, context)\n}","func (this *ObjectNames) Evaluate(item value.Value, context Context) (value.Value, error) {\n\treturn this.UnaryEval(this, item, context)\n}","func GenerateLabels(object CommonInterface) map[string]string {\n\tkind := object.GroupVersionKind().Kind\n\tgroup := object.GroupVersionKind().Group\n\tname := object.GetName()\n\tkey := strings.ToLower(kind) + \".\" + group + \"/name\"\n\tlabels := make(map[string]string)\n\tlabels[key] = name\n\treturn labels\n}","func GenerateLabels(object CommonInterface) map[string]string {\n\tkind := object.GroupVersionKind().Kind\n\tgroup := object.GroupVersionKind().Group\n\tname := object.GetName()\n\tkey := strings.ToLower(kind) + \".\" + group + \"/name\"\n\tlabels := make(map[string]string)\n\tlabels[key] = name\n\treturn labels\n}","func NewGNames(\n\tcfg config.Config,\n\tvf verifier.Verifier,\n\tfc facet.Facet,\n) GNames {\n\treturn gnames{\n\t\tcfg: cfg,\n\t\tvf: vf,\n\t\tfacet: fc,\n\t\tmatcher: matcher.New(cfg.MatcherURL),\n\t}\n}","func Names() []string {\n\t// TODO eliminate duplicates\n\tvar names []string\n\tfor _, f := range factories {\n\t\tnames = append(names, f.Names()...)\n\t}\n\treturn names\n}","func UConverterOpenStandardNames(arg1 string, arg2 string, arg3 *UErrorCode) (_swig_ret X_UEnumeration)","func NewLiteral(value Object) Expression {\n\treturn &literal{value: value}\n}","func (e *Enforcer) GetAllNamedObjects(ctx context.Context, ptype string) ([]string, error) {\n\tres, err := e.client.remoteClient.GetAllNamedObjects(ctx, &pb.SimpleGetRequest{\n\t\tEnforcerHandler: e.handler,\n\t\tPType: ptype,\n\t})\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn res.Array, nil\n}","func NewNameGTE(v string) predicate.User {\n\treturn predicate.User(func(s *sql.Selector) {\n\t\ts.Where(sql.GTE(s.C(FieldNewName), v))\n\t})\n}","func NewtnsnamesParser(input antlr.TokenStream) *tnsnamesParser {\n\tthis := new(tnsnamesParser)\n\tdeserializer := antlr.NewATNDeserializer(nil)\n\tdeserializedATN := deserializer.DeserializeFromUInt16(parserATN)\n\tdecisionToDFA := make([]*antlr.DFA, len(deserializedATN.DecisionToState))\n\tfor index, ds := range deserializedATN.DecisionToState {\n\t\tdecisionToDFA[index] = antlr.NewDFA(ds, index)\n\t}\n\tthis.BaseParser = antlr.NewBaseParser(input)\n\n\tthis.Interpreter = antlr.NewParserATNSimulator(this, deserializedATN, decisionToDFA, antlr.NewPredictionContextCache())\n\tthis.RuleNames = ruleNames\n\tthis.LiteralNames = literalNames\n\tthis.SymbolicNames = symbolicNames\n\tthis.GrammarFileName = \"tnsnamesParser.g4\"\n\n\treturn this\n}","func (this *ObjectNames) Apply(context Context, arg value.Value) (value.Value, error) {\n\tif arg.Type() == value.MISSING {\n\t\treturn value.MISSING_VALUE, nil\n\t} else if arg.Type() != value.OBJECT {\n\t\treturn value.NULL_VALUE, nil\n\t}\n\n\toa := arg.Actual().(map[string]interface{})\n\tkeys := make(sort.StringSlice, 0, len(oa))\n\tfor key, _ := range oa {\n\t\tkeys = append(keys, key)\n\t}\n\n\tsort.Sort(keys)\n\tra := make([]interface{}, len(keys))\n\tfor i, k := range keys {\n\t\tra[i] = k\n\t}\n\n\treturn value.NewValue(ra), nil\n}","func NewObjectInnerValues(operand Expression) Function {\n\trv := &ObjectInnerValues{\n\t\t*NewUnaryFunctionBase(\"object_innervalues\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func mustGetNames(objects []runtime.Object) []string {\n\tvar names []string\n\tfor _, obj := range objects {\n\t\tmetaAccessor, err := meta.Accessor(obj)\n\t\tif err != nil {\n\t\t\tframework.Failf(\"error getting accessor for %T: %v\", obj, err)\n\t\t}\n\t\tname := metaAccessor.GetName()\n\t\tnames = append(names, name)\n\t}\n\tsort.Strings(names)\n\treturn names\n}","func VisitObjectStrings(obj interface{}, visitor func(string) string) {\n\tvisitValue(reflect.ValueOf(obj), visitor)\n}","func (g *grpc) objectNamed(name string) generator.Object {\n\tg.gen.RecordTypeUse(name)\n\treturn g.gen.ObjectNamed(name)\n}","func newObjectList() *ObjectList {\n\treturn &ObjectList{\n\t\tObjectIDs: make([]int, 0, 200),\n\t}\n}","func (s *BasePlSqlParserListener) EnterObject_name(ctx *Object_nameContext) {}","func NewNameArray(sVars ...string) PDFArray {\n\n\ta := PDFArray{}\n\n\tfor _, s := range sVars {\n\t\ta = append(a, PDFName(s))\n\t}\n\n\treturn a\n}","func Names(v interface{}, prev ...string) [][]string {\n\tval := reflect.ValueOf(v)\n\treturn names(val, prev)\n}","func InitNames() {\n C.glowInitNames(gpInitNames)\n}","func UConverterOpenAllNames(arg1 *UErrorCode) (_swig_ret X_UEnumeration)","func NewNameContains(v string) predicate.User {\n\treturn predicate.User(sql.FieldContains(FieldNewName, v))\n}","func (r *Registry) RegisteredObjects() map[string]client.Object {\n\tout := make(map[string]client.Object, len(r.nameToObject))\n\tfor name, object := range r.nameToObject {\n\t\tout[name] = object.obj\n\t}\n\treturn out\n}","func TestIsValidObjectName(t *testing.T) {\n\ttestCases := []struct {\n\t\tobjectName string\n\t\tshouldPass bool\n\t}{\n\t\t// cases which should pass the test.\n\t\t// passing in valid object name.\n\t\t{\"object\", true},\n\t\t{\"The Shining Script <v1>.pdf\", true},\n\t\t{\"Cost Benefit Analysis (2009-2010).pptx\", true},\n\t\t{\"117Gn8rfHL2ACARPAhaFd0AGzic9pUbIA/5OCn5A\", true},\n\t\t{\"SHØRT\", true},\n\t\t{\"There are far too many object names, and far too few bucket names!\", true},\n\t\t// cases for which test should fail.\n\t\t// passing invalid object names.\n\t\t{\"\", false},\n\t\t{string([]byte{0xff, 0xfe, 0xfd}), false},\n\t}\n\n\tfor i, testCase := range testCases {\n\t\tisValidObjectName := IsValidObjectName(testCase.objectName)\n\t\tif testCase.shouldPass && !isValidObjectName {\n\t\t\tt.Errorf(\"Test case %d: Expected \\\"%s\\\" to be a valid object name\", i+1, testCase.objectName)\n\t\t}\n\t\tif !testCase.shouldPass && isValidObjectName {\n\t\t\tt.Errorf(\"Test case %d: Expected object name \\\"%s\\\" to be invalid\", i+1, testCase.objectName)\n\t\t}\n\t}\n}","func ClosureNewObject(sizeofClosure uint32, object *Object) *Closure {\n\tc_sizeof_closure := (C.guint)(sizeofClosure)\n\n\tc_object := (*C.GObject)(C.NULL)\n\tif object != nil {\n\t\tc_object = (*C.GObject)(object.ToC())\n\t}\n\n\tretC := C.g_closure_new_object(c_sizeof_closure, c_object)\n\tretGo := ClosureNewFromC(unsafe.Pointer(retC))\n\n\treturn retGo\n}","func CloneTableNames(n TableNames) TableNames {\n\tres := make(TableNames, 0, len(n))\n\tfor _, x := range n {\n\t\tres = append(res, CloneTableName(x))\n\t}\n\treturn res\n}","func getSwiftObjectNames(t *testing.T, osClient *gophercloud.ServiceClient, container string) (objectNames []string) {\n\t_ = objects.List(osClient, container, nil).EachPage(func(page pagination.Page) (bool, error) {\n\t\t// Get a slice of object names\n\t\tnames, err := objects.ExtractNames(page)\n\t\tif err != nil {\n\t\t\tt.Fatalf(\"Error extracting object names from page: %s\", err)\n\t\t}\n\t\tfor _, object := range names {\n\t\t\tobjectNames = append(objectNames, object)\n\t\t}\n\n\t\treturn true, nil\n\t})\n\treturn\n}","func (a *Client) ReplaceInstancesObjectsObjectNameDefinitions(params *ReplaceInstancesObjectsObjectNameDefinitionsParams) (*ReplaceInstancesObjectsObjectNameDefinitionsOK, error) {\n\t// TODO: Validate the params before sending\n\tif params == nil {\n\t\tparams = NewReplaceInstancesObjectsObjectNameDefinitionsParams()\n\t}\n\n\tresult, err := a.transport.Submit(&runtime.ClientOperation{\n\t\tID: \"replaceInstancesObjectsObjectNameDefinitions\",\n\t\tMethod: \"PUT\",\n\t\tPathPattern: \"/instances/objects/{objectName}/definitions\",\n\t\tProducesMediaTypes: []string{\"\"},\n\t\tConsumesMediaTypes: []string{\"\"},\n\t\tSchemes: []string{\"https\"},\n\t\tParams: params,\n\t\tReader: &ReplaceInstancesObjectsObjectNameDefinitionsReader{formats: a.formats},\n\t\tContext: params.Context,\n\t\tClient: params.HTTPClient,\n\t})\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn result.(*ReplaceInstancesObjectsObjectNameDefinitionsOK), nil\n\n}","func (o *Object) Rename(n, m string) {\n\tfor _, nat := range *o {\n\t\tif nat.Name == n {\n\t\t\tnat.Name = m\n\t\t\treturn\n\t\t}\n\t}\n}","func (*unifinames) Name() string { return \"unifi-names\" }","func NewSlice(a ...Name) []Name {\n\treturn a\n}","func NewLuaObjectFromName(L *lua.State, path string) *LuaObject {\n Lookup(L, path, 0)\n return NewLuaObject(L, -1)\n}","func NewLuaObject(L *lua.State, idx int) *LuaObject {\n tp := L.LTypename(idx)\n L.PushValue(idx)\n ref := L.Ref(lua.LUA_REGISTRYINDEX)\n return &LuaObject{L, ref, tp}\n}","func (f *Fs) newObjectSizeAndNameOnly(o fs.Object, moName string, size int64) *Object {\n\treturn &Object{\n\t\tObject: o,\n\t\tf: f,\n\t\tmo: nil,\n\t\tmoName: moName,\n\t\tsize: size,\n\t\tmeta: nil,\n\t}\n}","func objectName(u *unstructured.Unstructured) string {\n\treturn strings.ToLower(fmt.Sprintf(\"%s-%s\", u.GetKind(), strings.Replace(u.GetName(), \":\", \"-\", -1)))\n}","func (n *LibPcreRegexp) SubexpNames() []string {\n\treturn n.namedGroups\n}","func (s *BasePlSqlParserListener) ExitRename_object(ctx *Rename_objectContext) {}","func ObjectName(obj *Object) (string, error) {\n\taccessor, err := meta.Accessor(obj)\n\tif err != nil {\n\t\treturn \"\", fmt.Errorf(\"failed to get metadata accessor from object: %v\", err)\n\t}\n\treturn accessor.GetName(), nil\n}","func NewObjectUnwrap(operand Expression) Function {\n\trv := &ObjectUnwrap{\n\t\t*NewUnaryFunctionBase(\"object_unwrap\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func NewObjectInnerPairs(operand Expression) Function {\n\trv := &ObjectInnerPairs{\n\t\t*NewUnaryFunctionBase(\"object_innerpairs\", operand),\n\t}\n\n\trv.expr = rv\n\treturn rv\n}","func makeNames(fullMethod string) (names api.Names) {\n\t// Strip the leading slash. It should always be present in practice.\n\tif len(fullMethod) > 0 && fullMethod[0] == '/' {\n\t\tfullMethod = fullMethod[1:]\n\t}\n\n\t// Parse the slash separated service and method name. The separating slash\n\t// should always be present in practice.\n\tif slashIndex := strings.Index(fullMethod, \"/\"); slashIndex != -1 {\n\t\tnames.RawService = fullMethod[0:slashIndex]\n\t\tnames.Method = fullMethod[slashIndex+1:]\n\t}\n\n\tnames.Service = serviceReplacer.Replace(names.RawService)\n\tnames.MetricKey = append(names.MetricKey, strings.Split(names.Service, \".\")...)\n\tnames.MetricKey = append(names.MetricKey, methodMetricKeyReplacer.Replace(names.Method))\n\tfor i := range names.MetricKey {\n\t\tnames.MetricKey[i] = metricKey(names.MetricKey[i])\n\t}\n\treturn names\n}","func (l Lambda) ArgumentNames() []string {\n\treturn argumentsToNames(l.arguments)\n}","func NewNameContains(v string) predicate.User {\n\treturn predicate.User(func(s *sql.Selector) {\n\t\ts.Where(sql.Contains(s.C(FieldNewName), v))\n\t})\n}","func NewName(v string) predicate.User {\n\treturn predicate.User(func(s *sql.Selector) {\n\t\ts.Where(sql.EQ(s.C(FieldNewName), v))\n\t})\n}","func IncludeNamesFilter(names ...string) factory.EventFilterFunc {\n\tnameSet := sets.NewString(names...)\n\treturn func(obj interface{}) bool {\n\t\tmetaObj := obj.(metav1.Object)\n\t\treturn nameSet.Has(metaObj.GetName())\n\t}\n}","func NewName(v string) predicate.User {\n\treturn predicate.User(sql.FieldEQ(FieldNewName, v))\n}","func NewObjectExpression() *ObjectExpression {\n\treturn &ObjectExpression{\n\t\tprops: make(map[string]Expression),\n\t}\n}","func NewCardNames() *CardNames {\n\tcounts := make(map[string]int)\n\treturn &CardNames{Counts: counts}\n}","func NewObjectDependencies(\n\tobj interface{},\n) (ObjectDependency, ObjectDependencies) {\n\tdeps := make(ObjectDependencies)\n\tvirtual := obj.(*cisapiv1.VirtualServer)\n\t// TODO => dep can be replaced with internal DS rqkey\n\tkey := ObjectDependency{\n\t\tKind: VirtualServer,\n\t\tName: virtual.ObjectMeta.Name,\n\t\tNamespace: virtual.ObjectMeta.Namespace,\n\t}\n\n\tdeps[key] = 1\n\tfor _, pool := range virtual.Spec.Pools {\n\t\tdep := ObjectDependency{\n\t\t\tKind: RuleDep,\n\t\t\tNamespace: virtual.ObjectMeta.Namespace,\n\t\t\tName: virtual.Spec.Host + pool.Path,\n\t\t\tService: pool.Service,\n\t\t}\n\t\tdeps[dep]++\n\t}\n\treturn key, deps\n}","func addStrings(s *scope, name string, obj pyObject, f func(string)) {\n\tif obj != nil && obj != None {\n\t\tl, ok := asList(obj)\n\t\tif !ok {\n\t\t\ts.Error(\"Argument %s must be a list, not %s\", name, obj.Type())\n\t\t}\n\t\tfor _, li := range l {\n\t\t\tstr, ok := li.(pyString)\n\t\t\tif !ok && li != None {\n\t\t\t\ts.Error(\"%s must be strings\", name)\n\t\t\t}\n\t\t\tif str != \"\" && li != None {\n\t\t\t\tf(string(str))\n\t\t\t}\n\t\t}\n\t}\n}","func getNames(sub pkix.Name) []Name {\n\t// anonymous func for finding the max of a list of integer\n\tmax := func(v1 int, vn ...int) (max int) {\n\t\tmax = v1\n\t\tfor i := 0; i < len(vn); i++ {\n\t\t\tif vn[i] > max {\n\t\t\t\tmax = vn[i]\n\t\t\t}\n\t\t}\n\t\treturn max\n\t}\n\n\tnc := len(sub.Country)\n\tnorg := len(sub.Organization)\n\tnou := len(sub.OrganizationalUnit)\n\tnl := len(sub.Locality)\n\tnp := len(sub.Province)\n\n\tn := max(nc, norg, nou, nl, np)\n\n\tnames := make([]Name, n)\n\tfor i := range names {\n\t\tif i < nc {\n\t\t\tnames[i].C = sub.Country[i]\n\t\t}\n\t\tif i < norg {\n\t\t\tnames[i].O = sub.Organization[i]\n\t\t}\n\t\tif i < nou {\n\t\t\tnames[i].OU = sub.OrganizationalUnit[i]\n\t\t}\n\t\tif i < nl {\n\t\t\tnames[i].L = sub.Locality[i]\n\t\t}\n\t\tif i < np {\n\t\t\tnames[i].ST = sub.Province[i]\n\t\t}\n\t}\n\treturn names\n}","func (o *objectSet) nameMatches(nameRegex string) *objectSet {\n\tret := &objectSet{}\n\tfor k, v := range o.objMap {\n\t\t_, _, objName := object.FromHash(k)\n\t\tm, err := regexp.MatchString(nameRegex, objName)\n\t\tif err != nil && m {\n\t\t\tret.append(v)\n\t\t}\n\t}\n\treturn ret\n}","func setPatchNames(patches []string, jsonPatches []kustomize.PatchJSON6902) ([]string, []kustomize.PatchJSON6902) {\n\tfixedPatches := make([]string, len(patches))\n\tfixedJSONPatches := make([]kustomize.PatchJSON6902, len(jsonPatches))\n\tfor i, patch := range patches {\n\t\t// insert the generated name metadata\n\t\tfixedPatches[i] = fmt.Sprintf(\"metadata:\\nname: %s\\n%s\", kubeadm.ObjectName, patch)\n\t}\n\tfor i, patch := range jsonPatches {\n\t\t// insert the generated name metadata\n\t\tpatch.Name = kubeadm.ObjectName\n\t\tfixedJSONPatches[i] = patch\n\t}\n\treturn fixedPatches, fixedJSONPatches\n}","func (n *piName) FreeNames() []Name {\n\treturn []Name{n}\n}","func NewListName(val string) ListNameField {\n\treturn ListNameField{quickfix.FIXString(val)}\n}","func execNewPkgName(_ int, p *gop.Context) {\n\targs := p.GetArgs(4)\n\tret := types.NewPkgName(token.Pos(args[0].(int)), args[1].(*types.Package), args[2].(string), args[3].(*types.Package))\n\tp.Ret(4, ret)\n}","func New(e *eme.EMECipher, longNames bool, raw64 bool) *NameTransform {\n\tb64 := base64.URLEncoding\n\tif raw64 {\n\t\tb64 = base64.RawURLEncoding\n\t}\n\treturn &NameTransform{\n\t\temeCipher: e,\n\t\tlongNames: longNames,\n\t\tB64: b64,\n\t}\n}","func NewFunctionCall(name string, params []Expression, returnType Type) Expression {\n\treturn &functionCall{\n\t\tname: name,\n\t\tparams: params,\n\t\treturnType: returnType,\n\t}\n}","func (t *targetrunner) renameObject(w http.ResponseWriter, r *http.Request, msg *cmn.ActionMsg) {\n\tapitems, err := t.checkRESTItems(w, r, 2, false, cmn.Version, cmn.Objects)\n\tif err != nil {\n\t\treturn\n\t}\n\tbucket, objNameFrom := apitems[0], apitems[1]\n\tbck, err := newBckFromQuery(bucket, r.URL.Query())\n\tif err != nil {\n\t\tt.invalmsghdlr(w, r, err.Error(), http.StatusBadRequest)\n\t\treturn\n\t}\n\tlom := &cluster.LOM{T: t, ObjName: objNameFrom}\n\tif err = lom.Init(bck.Bck); err != nil {\n\t\tt.invalmsghdlr(w, r, err.Error())\n\t\treturn\n\t}\n\tif lom.Bck().IsRemote() {\n\t\tt.invalmsghdlr(w, r, fmt.Sprintf(\"%s: cannot rename object from remote bucket\", lom))\n\t\treturn\n\t}\n\tif lom.Bck().Props.EC.Enabled {\n\t\tt.invalmsghdlr(w, r, fmt.Sprintf(\"%s: cannot rename erasure-coded object\", lom))\n\t\treturn\n\t}\n\n\tbuf, slab := t.gmm.Alloc()\n\tri := &replicInfo{smap: t.owner.smap.get(), t: t, bckTo: lom.Bck(), buf: buf, localOnly: false, finalize: true}\n\tcopied, err := ri.copyObject(lom, msg.Name /* new object name */)\n\tslab.Free(buf)\n\tif err != nil {\n\t\tt.invalmsghdlr(w, r, err.Error())\n\t\treturn\n\t}\n\tif copied {\n\t\tlom.Lock(true)\n\t\tif err = lom.Remove(); err != nil {\n\t\t\tt.invalmsghdlr(w, r, err.Error())\n\t\t}\n\t\tlom.Unlock(true)\n\t}\n}","func (e *Enforcer) GetAllNamedObjects(ptype string) []string {\n\treturn e.model.GetValuesForFieldInPolicy(\"p\", ptype, 1)\n}","func (a *Client) GetInstancesObjectsObjectNameDefinitions(params *GetInstancesObjectsObjectNameDefinitionsParams) (*GetInstancesObjectsObjectNameDefinitionsOK, error) {\n\t// TODO: Validate the params before sending\n\tif params == nil {\n\t\tparams = NewGetInstancesObjectsObjectNameDefinitionsParams()\n\t}\n\n\tresult, err := a.transport.Submit(&runtime.ClientOperation{\n\t\tID: \"getInstancesObjectsObjectNameDefinitions\",\n\t\tMethod: \"GET\",\n\t\tPathPattern: \"/instances/objects/{objectName}/definitions\",\n\t\tProducesMediaTypes: []string{\"\"},\n\t\tConsumesMediaTypes: []string{\"\"},\n\t\tSchemes: []string{\"https\"},\n\t\tParams: params,\n\t\tReader: &GetInstancesObjectsObjectNameDefinitionsReader{formats: a.formats},\n\t\tContext: params.Context,\n\t\tClient: params.HTTPClient,\n\t})\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn result.(*GetInstancesObjectsObjectNameDefinitionsOK), nil\n\n}","func (m *MockIDistributedEnforcer) GetAllNamedObjects(arg0 string) []string {\n\tm.ctrl.T.Helper()\n\tret := m.ctrl.Call(m, \"GetAllNamedObjects\", arg0)\n\tret0, _ := ret[0].([]string)\n\treturn ret0\n}","func (b *JSONSupportGeneratorBuilder) Names(value *NamesCalculator) *JSONSupportGeneratorBuilder {\n\tb.names = value\n\treturn b\n}","func NewFunctionCall(name string, context string, args ...interface{}) FunctionCall {\n\treturn FunctionCall{name, context, args}\n}","func SetIterationNames(names []string) CustomizeIterationFunc {\n\treturn func(fxt *TestFixture, idx int) error {\n\t\tif len(fxt.Iterations) != len(names) {\n\t\t\treturn errs.Errorf(\"number of names (%d) must match number of iterations to create (%d)\", len(names), len(fxt.Iterations))\n\t\t}\n\t\tfxt.Iterations[idx].Name = names[idx]\n\t\treturn nil\n\t}\n}"],"string":"[\n \"func (this *ObjectNames) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectNames(operands[0])\\n\\t}\\n}\",\n \"func (this *ObjectNames) Constructor() FunctionConstructor {\\n\\treturn func(operands ...Expression) Function {\\n\\t\\treturn NewObjectNames(operands[0])\\n\\t}\\n}\",\n \"func (s Obj_value) NewName(n int32) (capnp.TextList, error) {\\n\\ts.Struct.SetUint16(4, 0)\\n\\tl, err := capnp.NewTextList(s.Struct.Segment(), n)\\n\\tif err != nil {\\n\\t\\treturn capnp.TextList{}, err\\n\\t}\\n\\terr = s.Struct.SetPtr(0, l.List.ToPtr())\\n\\treturn l, err\\n}\",\n \"func execNewNamed(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(3)\\n\\tret := types.NewNamed(args[0].(*types.TypeName), args[1].(types.Type), args[2].([]*types.Func))\\n\\tp.Ret(3, ret)\\n}\",\n \"func NewObjectValues(operand Expression) Function {\\n\\trv := &ObjectValues{\\n\\t\\t*NewUnaryFunctionBase(\\\"object_values\\\", operand),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func NewObjectValues(operand Expression) Function {\\n\\trv := &ObjectValues{\\n\\t\\t*NewUnaryFunctionBase(\\\"object_values\\\", operand),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func InitNames() {\\n\\tsyscall.Syscall(gpInitNames, 0, 0, 0, 0)\\n}\",\n \"func Names(v interface{}) []string {\\n\\treturn New(v).Names()\\n}\",\n \"func createList(arg string) []string {\\n\\tvar retObject = []string{arg}\\n\\treturn retObject\\n}\",\n \"func NewNameIn(vs ...string) predicate.User {\\n\\treturn predicate.User(sql.FieldIn(FieldNewName, vs...))\\n}\",\n \"func NewNameIn(vs ...string) predicate.User {\\n\\tv := make([]interface{}, len(vs))\\n\\tfor i := range v {\\n\\t\\tv[i] = vs[i]\\n\\t}\\n\\treturn predicate.User(func(s *sql.Selector) {\\n\\t\\t// if not arguments were provided, append the FALSE constants,\\n\\t\\t// since we can't apply \\\"IN ()\\\". This will make this predicate falsy.\\n\\t\\tif len(v) == 0 {\\n\\t\\t\\ts.Where(sql.False())\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\ts.Where(sql.In(s.C(FieldNewName), v...))\\n\\t})\\n}\",\n \"func RegisterObject(name string, f NewObjectFct) {\\n\\tObjectList[name] = f\\n}\",\n \"func NewNameGTE(v string) predicate.User {\\n\\treturn predicate.User(sql.FieldGTE(FieldNewName, v))\\n}\",\n \"func NewOperationNamesStorage(\\n\\tsession cassandra.Session,\\n\\twriteCacheTTL time.Duration,\\n\\tmetricsFactory metrics.Factory,\\n\\tlogger *zap.Logger,\\n) *OperationNamesStorage {\\n\\treturn &OperationNamesStorage{\\n\\t\\tsession: session,\\n\\t\\tInsertStmt: insertOperationName,\\n\\t\\tQueryStmt: queryOperationNames,\\n\\t\\tmetrics: casMetrics.NewTable(metricsFactory, \\\"OperationNames\\\"),\\n\\t\\twriteCacheTTL: writeCacheTTL,\\n\\t\\tlogger: logger,\\n\\t\\toperationNames: cache.NewLRUWithOptions(\\n\\t\\t\\t100000,\\n\\t\\t\\t&cache.Options{\\n\\t\\t\\t\\tTTL: writeCacheTTL,\\n\\t\\t\\t\\tInitialCapacity: 0000,\\n\\t\\t\\t}),\\n\\t}\\n}\",\n \"func newnamel(pos src.XPos, s *types.Sym) *Node {\\n\\tif s == nil {\\n\\t\\tFatalf(\\\"newnamel nil\\\")\\n\\t}\\n\\n\\tvar x struct {\\n\\t\\tn Node\\n\\t\\tm Name\\n\\t\\tp Param\\n\\t}\\n\\tn := &x.n\\n\\tn.Name = &x.m\\n\\tn.Name.Param = &x.p\\n\\n\\tn.Op = ONAME\\n\\tn.Pos = pos\\n\\tn.Orig = n\\n\\n\\tn.Sym = s\\n\\treturn n\\n}\",\n \"func objToNames(obj interface{}, names []string, tag string) []string {\\n\\tvar typ reflect.Type\\n\\n\\tif sf, ok := obj.(reflect.StructField); ok {\\n\\t\\ttyp = sf.Type\\n\\t} else {\\n\\t\\ttyp = reflect.TypeOf(obj)\\n\\t\\tif typ.Kind() == reflect.Ptr {\\n\\t\\t\\ttyp = typ.Elem()\\n\\t\\t}\\n\\t}\\n\\n\\tfor i := 0; i < typ.NumField(); i++ {\\n\\t\\tfield := typ.Field(i)\\n\\n\\t\\tif field.Type.Kind() == reflect.Struct {\\n\\t\\t\\tnames = objToNames(field, names, tag)\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\t// If tag is passed to the function, we only append if the field is tagged and that it matches tag.\\n\\t\\tif tag == \\\"\\\" || field.Tag.Get(tag) != \\\"\\\" {\\n\\t\\t\\tnames = append(names, field.Name)\\n\\t\\t}\\n\\t}\\n\\n\\treturn names\\n}\",\n \"func NewObject(t ...[2]*Term) Object {\\n\\tobj := newobject(len(t))\\n\\tfor i := range t {\\n\\t\\tobj.Insert(t[i][0], t[i][1])\\n\\t}\\n\\treturn obj\\n}\",\n \"func NewObjectRemove(first, second Expression) Function {\\n\\trv := &ObjectRemove{\\n\\t\\t*NewBinaryFunctionBase(\\\"object_remove\\\", first, second),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func NewObjectLength(operand Expression) Function {\\n\\trv := &ObjectLength{\\n\\t\\t*NewUnaryFunctionBase(\\\"object_length\\\", operand),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func NewObjectLength(operand Expression) Function {\\n\\trv := &ObjectLength{\\n\\t\\t*NewUnaryFunctionBase(\\\"object_length\\\", operand),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func GetNewRegisteredUserNames(miscTable *db.Table) ([]string, error) {\\n\\tnewRegisteredUserNames := []string{}\\n\\terr := miscTable.GetObj(keyNewRegisteredUsers, &newRegisteredUserNames)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn newRegisteredUserNames, nil\\n}\",\n \"func (s *BasePlSqlParserListener) EnterRename_object(ctx *Rename_objectContext) {}\",\n \"func InitNames() {\\n\\tC.glowInitNames(gpInitNames)\\n}\",\n \"func newname(s *types.Sym) *Node {\\n\\tn := newnamel(lineno, s)\\n\\tn.Name.Curfn = Curfn\\n\\treturn n\\n}\",\n \"func NewObjectPairs(operand Expression) Function {\\n\\trv := &ObjectPairs{\\n\\t\\t*NewUnaryFunctionBase(\\\"object_pairs\\\", operand),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func NewObjectPairs(operand Expression) Function {\\n\\trv := &ObjectPairs{\\n\\t\\t*NewUnaryFunctionBase(\\\"object_pairs\\\", operand),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func NewActionNames() *ActionNames {\\n\\tv := &ActionNames{}\\n\\treturn v\\n}\",\n \"func NewObjectAdd(first, second, third Expression) Function {\\n\\trv := &ObjectAdd{\\n\\t\\t*NewTernaryFunctionBase(\\\"object_add\\\", first, second, third),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func (*Object) Name() string { return \\\"object\\\" }\",\n \"func NamesFrom(list []string) Names {\\n\\tn := []Name{}\\n\\tfor _, v := range list {\\n\\t\\tn = append(n, Name(v))\\n\\t}\\n\\treturn Names(n)\\n}\",\n \"func NNames(w http.ResponseWriter) error {\\n\\tv, err := getProperty(\\\"NNames\\\")\\n\\tif err != nil {\\n\\t\\treturn err\\n\\t}\\n\\n\\tprop := Property{\\n\\t\\tProperty: \\\"NNames\\\",\\n\\t\\tValue: fmt.Sprint(v.Value().(uint32)),\\n\\t}\\n\\n\\treturn share.JSONResponse(prop, w)\\n}\",\n \"func FieldArgNames(obj any, allArgs map[string]reflect.Value) {\\n\\tfieldArgNamesStruct(obj, \\\"\\\", false, allArgs)\\n}\",\n \"func execNewTypeName(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(4)\\n\\tret := types.NewTypeName(token.Pos(args[0].(int)), args[1].(*types.Package), args[2].(string), args[3].(types.Type))\\n\\tp.Ret(4, ret)\\n}\",\n \"func (this *ObjectNames) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.UnaryEval(this, item, context)\\n}\",\n \"func (this *ObjectNames) Evaluate(item value.Value, context Context) (value.Value, error) {\\n\\treturn this.UnaryEval(this, item, context)\\n}\",\n \"func GenerateLabels(object CommonInterface) map[string]string {\\n\\tkind := object.GroupVersionKind().Kind\\n\\tgroup := object.GroupVersionKind().Group\\n\\tname := object.GetName()\\n\\tkey := strings.ToLower(kind) + \\\".\\\" + group + \\\"/name\\\"\\n\\tlabels := make(map[string]string)\\n\\tlabels[key] = name\\n\\treturn labels\\n}\",\n \"func GenerateLabels(object CommonInterface) map[string]string {\\n\\tkind := object.GroupVersionKind().Kind\\n\\tgroup := object.GroupVersionKind().Group\\n\\tname := object.GetName()\\n\\tkey := strings.ToLower(kind) + \\\".\\\" + group + \\\"/name\\\"\\n\\tlabels := make(map[string]string)\\n\\tlabels[key] = name\\n\\treturn labels\\n}\",\n \"func NewGNames(\\n\\tcfg config.Config,\\n\\tvf verifier.Verifier,\\n\\tfc facet.Facet,\\n) GNames {\\n\\treturn gnames{\\n\\t\\tcfg: cfg,\\n\\t\\tvf: vf,\\n\\t\\tfacet: fc,\\n\\t\\tmatcher: matcher.New(cfg.MatcherURL),\\n\\t}\\n}\",\n \"func Names() []string {\\n\\t// TODO eliminate duplicates\\n\\tvar names []string\\n\\tfor _, f := range factories {\\n\\t\\tnames = append(names, f.Names()...)\\n\\t}\\n\\treturn names\\n}\",\n \"func UConverterOpenStandardNames(arg1 string, arg2 string, arg3 *UErrorCode) (_swig_ret X_UEnumeration)\",\n \"func NewLiteral(value Object) Expression {\\n\\treturn &literal{value: value}\\n}\",\n \"func (e *Enforcer) GetAllNamedObjects(ctx context.Context, ptype string) ([]string, error) {\\n\\tres, err := e.client.remoteClient.GetAllNamedObjects(ctx, &pb.SimpleGetRequest{\\n\\t\\tEnforcerHandler: e.handler,\\n\\t\\tPType: ptype,\\n\\t})\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn res.Array, nil\\n}\",\n \"func NewNameGTE(v string) predicate.User {\\n\\treturn predicate.User(func(s *sql.Selector) {\\n\\t\\ts.Where(sql.GTE(s.C(FieldNewName), v))\\n\\t})\\n}\",\n \"func NewtnsnamesParser(input antlr.TokenStream) *tnsnamesParser {\\n\\tthis := new(tnsnamesParser)\\n\\tdeserializer := antlr.NewATNDeserializer(nil)\\n\\tdeserializedATN := deserializer.DeserializeFromUInt16(parserATN)\\n\\tdecisionToDFA := make([]*antlr.DFA, len(deserializedATN.DecisionToState))\\n\\tfor index, ds := range deserializedATN.DecisionToState {\\n\\t\\tdecisionToDFA[index] = antlr.NewDFA(ds, index)\\n\\t}\\n\\tthis.BaseParser = antlr.NewBaseParser(input)\\n\\n\\tthis.Interpreter = antlr.NewParserATNSimulator(this, deserializedATN, decisionToDFA, antlr.NewPredictionContextCache())\\n\\tthis.RuleNames = ruleNames\\n\\tthis.LiteralNames = literalNames\\n\\tthis.SymbolicNames = symbolicNames\\n\\tthis.GrammarFileName = \\\"tnsnamesParser.g4\\\"\\n\\n\\treturn this\\n}\",\n \"func (this *ObjectNames) Apply(context Context, arg value.Value) (value.Value, error) {\\n\\tif arg.Type() == value.MISSING {\\n\\t\\treturn value.MISSING_VALUE, nil\\n\\t} else if arg.Type() != value.OBJECT {\\n\\t\\treturn value.NULL_VALUE, nil\\n\\t}\\n\\n\\toa := arg.Actual().(map[string]interface{})\\n\\tkeys := make(sort.StringSlice, 0, len(oa))\\n\\tfor key, _ := range oa {\\n\\t\\tkeys = append(keys, key)\\n\\t}\\n\\n\\tsort.Sort(keys)\\n\\tra := make([]interface{}, len(keys))\\n\\tfor i, k := range keys {\\n\\t\\tra[i] = k\\n\\t}\\n\\n\\treturn value.NewValue(ra), nil\\n}\",\n \"func NewObjectInnerValues(operand Expression) Function {\\n\\trv := &ObjectInnerValues{\\n\\t\\t*NewUnaryFunctionBase(\\\"object_innervalues\\\", operand),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func mustGetNames(objects []runtime.Object) []string {\\n\\tvar names []string\\n\\tfor _, obj := range objects {\\n\\t\\tmetaAccessor, err := meta.Accessor(obj)\\n\\t\\tif err != nil {\\n\\t\\t\\tframework.Failf(\\\"error getting accessor for %T: %v\\\", obj, err)\\n\\t\\t}\\n\\t\\tname := metaAccessor.GetName()\\n\\t\\tnames = append(names, name)\\n\\t}\\n\\tsort.Strings(names)\\n\\treturn names\\n}\",\n \"func VisitObjectStrings(obj interface{}, visitor func(string) string) {\\n\\tvisitValue(reflect.ValueOf(obj), visitor)\\n}\",\n \"func (g *grpc) objectNamed(name string) generator.Object {\\n\\tg.gen.RecordTypeUse(name)\\n\\treturn g.gen.ObjectNamed(name)\\n}\",\n \"func newObjectList() *ObjectList {\\n\\treturn &ObjectList{\\n\\t\\tObjectIDs: make([]int, 0, 200),\\n\\t}\\n}\",\n \"func (s *BasePlSqlParserListener) EnterObject_name(ctx *Object_nameContext) {}\",\n \"func NewNameArray(sVars ...string) PDFArray {\\n\\n\\ta := PDFArray{}\\n\\n\\tfor _, s := range sVars {\\n\\t\\ta = append(a, PDFName(s))\\n\\t}\\n\\n\\treturn a\\n}\",\n \"func Names(v interface{}, prev ...string) [][]string {\\n\\tval := reflect.ValueOf(v)\\n\\treturn names(val, prev)\\n}\",\n \"func InitNames() {\\n C.glowInitNames(gpInitNames)\\n}\",\n \"func UConverterOpenAllNames(arg1 *UErrorCode) (_swig_ret X_UEnumeration)\",\n \"func NewNameContains(v string) predicate.User {\\n\\treturn predicate.User(sql.FieldContains(FieldNewName, v))\\n}\",\n \"func (r *Registry) RegisteredObjects() map[string]client.Object {\\n\\tout := make(map[string]client.Object, len(r.nameToObject))\\n\\tfor name, object := range r.nameToObject {\\n\\t\\tout[name] = object.obj\\n\\t}\\n\\treturn out\\n}\",\n \"func TestIsValidObjectName(t *testing.T) {\\n\\ttestCases := []struct {\\n\\t\\tobjectName string\\n\\t\\tshouldPass bool\\n\\t}{\\n\\t\\t// cases which should pass the test.\\n\\t\\t// passing in valid object name.\\n\\t\\t{\\\"object\\\", true},\\n\\t\\t{\\\"The Shining Script <v1>.pdf\\\", true},\\n\\t\\t{\\\"Cost Benefit Analysis (2009-2010).pptx\\\", true},\\n\\t\\t{\\\"117Gn8rfHL2ACARPAhaFd0AGzic9pUbIA/5OCn5A\\\", true},\\n\\t\\t{\\\"SHØRT\\\", true},\\n\\t\\t{\\\"There are far too many object names, and far too few bucket names!\\\", true},\\n\\t\\t// cases for which test should fail.\\n\\t\\t// passing invalid object names.\\n\\t\\t{\\\"\\\", false},\\n\\t\\t{string([]byte{0xff, 0xfe, 0xfd}), false},\\n\\t}\\n\\n\\tfor i, testCase := range testCases {\\n\\t\\tisValidObjectName := IsValidObjectName(testCase.objectName)\\n\\t\\tif testCase.shouldPass && !isValidObjectName {\\n\\t\\t\\tt.Errorf(\\\"Test case %d: Expected \\\\\\\"%s\\\\\\\" to be a valid object name\\\", i+1, testCase.objectName)\\n\\t\\t}\\n\\t\\tif !testCase.shouldPass && isValidObjectName {\\n\\t\\t\\tt.Errorf(\\\"Test case %d: Expected object name \\\\\\\"%s\\\\\\\" to be invalid\\\", i+1, testCase.objectName)\\n\\t\\t}\\n\\t}\\n}\",\n \"func ClosureNewObject(sizeofClosure uint32, object *Object) *Closure {\\n\\tc_sizeof_closure := (C.guint)(sizeofClosure)\\n\\n\\tc_object := (*C.GObject)(C.NULL)\\n\\tif object != nil {\\n\\t\\tc_object = (*C.GObject)(object.ToC())\\n\\t}\\n\\n\\tretC := C.g_closure_new_object(c_sizeof_closure, c_object)\\n\\tretGo := ClosureNewFromC(unsafe.Pointer(retC))\\n\\n\\treturn retGo\\n}\",\n \"func CloneTableNames(n TableNames) TableNames {\\n\\tres := make(TableNames, 0, len(n))\\n\\tfor _, x := range n {\\n\\t\\tres = append(res, CloneTableName(x))\\n\\t}\\n\\treturn res\\n}\",\n \"func getSwiftObjectNames(t *testing.T, osClient *gophercloud.ServiceClient, container string) (objectNames []string) {\\n\\t_ = objects.List(osClient, container, nil).EachPage(func(page pagination.Page) (bool, error) {\\n\\t\\t// Get a slice of object names\\n\\t\\tnames, err := objects.ExtractNames(page)\\n\\t\\tif err != nil {\\n\\t\\t\\tt.Fatalf(\\\"Error extracting object names from page: %s\\\", err)\\n\\t\\t}\\n\\t\\tfor _, object := range names {\\n\\t\\t\\tobjectNames = append(objectNames, object)\\n\\t\\t}\\n\\n\\t\\treturn true, nil\\n\\t})\\n\\treturn\\n}\",\n \"func (a *Client) ReplaceInstancesObjectsObjectNameDefinitions(params *ReplaceInstancesObjectsObjectNameDefinitionsParams) (*ReplaceInstancesObjectsObjectNameDefinitionsOK, error) {\\n\\t// TODO: Validate the params before sending\\n\\tif params == nil {\\n\\t\\tparams = NewReplaceInstancesObjectsObjectNameDefinitionsParams()\\n\\t}\\n\\n\\tresult, err := a.transport.Submit(&runtime.ClientOperation{\\n\\t\\tID: \\\"replaceInstancesObjectsObjectNameDefinitions\\\",\\n\\t\\tMethod: \\\"PUT\\\",\\n\\t\\tPathPattern: \\\"/instances/objects/{objectName}/definitions\\\",\\n\\t\\tProducesMediaTypes: []string{\\\"\\\"},\\n\\t\\tConsumesMediaTypes: []string{\\\"\\\"},\\n\\t\\tSchemes: []string{\\\"https\\\"},\\n\\t\\tParams: params,\\n\\t\\tReader: &ReplaceInstancesObjectsObjectNameDefinitionsReader{formats: a.formats},\\n\\t\\tContext: params.Context,\\n\\t\\tClient: params.HTTPClient,\\n\\t})\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn result.(*ReplaceInstancesObjectsObjectNameDefinitionsOK), nil\\n\\n}\",\n \"func (o *Object) Rename(n, m string) {\\n\\tfor _, nat := range *o {\\n\\t\\tif nat.Name == n {\\n\\t\\t\\tnat.Name = m\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}\\n}\",\n \"func (*unifinames) Name() string { return \\\"unifi-names\\\" }\",\n \"func NewSlice(a ...Name) []Name {\\n\\treturn a\\n}\",\n \"func NewLuaObjectFromName(L *lua.State, path string) *LuaObject {\\n Lookup(L, path, 0)\\n return NewLuaObject(L, -1)\\n}\",\n \"func NewLuaObject(L *lua.State, idx int) *LuaObject {\\n tp := L.LTypename(idx)\\n L.PushValue(idx)\\n ref := L.Ref(lua.LUA_REGISTRYINDEX)\\n return &LuaObject{L, ref, tp}\\n}\",\n \"func (f *Fs) newObjectSizeAndNameOnly(o fs.Object, moName string, size int64) *Object {\\n\\treturn &Object{\\n\\t\\tObject: o,\\n\\t\\tf: f,\\n\\t\\tmo: nil,\\n\\t\\tmoName: moName,\\n\\t\\tsize: size,\\n\\t\\tmeta: nil,\\n\\t}\\n}\",\n \"func objectName(u *unstructured.Unstructured) string {\\n\\treturn strings.ToLower(fmt.Sprintf(\\\"%s-%s\\\", u.GetKind(), strings.Replace(u.GetName(), \\\":\\\", \\\"-\\\", -1)))\\n}\",\n \"func (n *LibPcreRegexp) SubexpNames() []string {\\n\\treturn n.namedGroups\\n}\",\n \"func (s *BasePlSqlParserListener) ExitRename_object(ctx *Rename_objectContext) {}\",\n \"func ObjectName(obj *Object) (string, error) {\\n\\taccessor, err := meta.Accessor(obj)\\n\\tif err != nil {\\n\\t\\treturn \\\"\\\", fmt.Errorf(\\\"failed to get metadata accessor from object: %v\\\", err)\\n\\t}\\n\\treturn accessor.GetName(), nil\\n}\",\n \"func NewObjectUnwrap(operand Expression) Function {\\n\\trv := &ObjectUnwrap{\\n\\t\\t*NewUnaryFunctionBase(\\\"object_unwrap\\\", operand),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func NewObjectInnerPairs(operand Expression) Function {\\n\\trv := &ObjectInnerPairs{\\n\\t\\t*NewUnaryFunctionBase(\\\"object_innerpairs\\\", operand),\\n\\t}\\n\\n\\trv.expr = rv\\n\\treturn rv\\n}\",\n \"func makeNames(fullMethod string) (names api.Names) {\\n\\t// Strip the leading slash. It should always be present in practice.\\n\\tif len(fullMethod) > 0 && fullMethod[0] == '/' {\\n\\t\\tfullMethod = fullMethod[1:]\\n\\t}\\n\\n\\t// Parse the slash separated service and method name. The separating slash\\n\\t// should always be present in practice.\\n\\tif slashIndex := strings.Index(fullMethod, \\\"/\\\"); slashIndex != -1 {\\n\\t\\tnames.RawService = fullMethod[0:slashIndex]\\n\\t\\tnames.Method = fullMethod[slashIndex+1:]\\n\\t}\\n\\n\\tnames.Service = serviceReplacer.Replace(names.RawService)\\n\\tnames.MetricKey = append(names.MetricKey, strings.Split(names.Service, \\\".\\\")...)\\n\\tnames.MetricKey = append(names.MetricKey, methodMetricKeyReplacer.Replace(names.Method))\\n\\tfor i := range names.MetricKey {\\n\\t\\tnames.MetricKey[i] = metricKey(names.MetricKey[i])\\n\\t}\\n\\treturn names\\n}\",\n \"func (l Lambda) ArgumentNames() []string {\\n\\treturn argumentsToNames(l.arguments)\\n}\",\n \"func NewNameContains(v string) predicate.User {\\n\\treturn predicate.User(func(s *sql.Selector) {\\n\\t\\ts.Where(sql.Contains(s.C(FieldNewName), v))\\n\\t})\\n}\",\n \"func NewName(v string) predicate.User {\\n\\treturn predicate.User(func(s *sql.Selector) {\\n\\t\\ts.Where(sql.EQ(s.C(FieldNewName), v))\\n\\t})\\n}\",\n \"func IncludeNamesFilter(names ...string) factory.EventFilterFunc {\\n\\tnameSet := sets.NewString(names...)\\n\\treturn func(obj interface{}) bool {\\n\\t\\tmetaObj := obj.(metav1.Object)\\n\\t\\treturn nameSet.Has(metaObj.GetName())\\n\\t}\\n}\",\n \"func NewName(v string) predicate.User {\\n\\treturn predicate.User(sql.FieldEQ(FieldNewName, v))\\n}\",\n \"func NewObjectExpression() *ObjectExpression {\\n\\treturn &ObjectExpression{\\n\\t\\tprops: make(map[string]Expression),\\n\\t}\\n}\",\n \"func NewCardNames() *CardNames {\\n\\tcounts := make(map[string]int)\\n\\treturn &CardNames{Counts: counts}\\n}\",\n \"func NewObjectDependencies(\\n\\tobj interface{},\\n) (ObjectDependency, ObjectDependencies) {\\n\\tdeps := make(ObjectDependencies)\\n\\tvirtual := obj.(*cisapiv1.VirtualServer)\\n\\t// TODO => dep can be replaced with internal DS rqkey\\n\\tkey := ObjectDependency{\\n\\t\\tKind: VirtualServer,\\n\\t\\tName: virtual.ObjectMeta.Name,\\n\\t\\tNamespace: virtual.ObjectMeta.Namespace,\\n\\t}\\n\\n\\tdeps[key] = 1\\n\\tfor _, pool := range virtual.Spec.Pools {\\n\\t\\tdep := ObjectDependency{\\n\\t\\t\\tKind: RuleDep,\\n\\t\\t\\tNamespace: virtual.ObjectMeta.Namespace,\\n\\t\\t\\tName: virtual.Spec.Host + pool.Path,\\n\\t\\t\\tService: pool.Service,\\n\\t\\t}\\n\\t\\tdeps[dep]++\\n\\t}\\n\\treturn key, deps\\n}\",\n \"func addStrings(s *scope, name string, obj pyObject, f func(string)) {\\n\\tif obj != nil && obj != None {\\n\\t\\tl, ok := asList(obj)\\n\\t\\tif !ok {\\n\\t\\t\\ts.Error(\\\"Argument %s must be a list, not %s\\\", name, obj.Type())\\n\\t\\t}\\n\\t\\tfor _, li := range l {\\n\\t\\t\\tstr, ok := li.(pyString)\\n\\t\\t\\tif !ok && li != None {\\n\\t\\t\\t\\ts.Error(\\\"%s must be strings\\\", name)\\n\\t\\t\\t}\\n\\t\\t\\tif str != \\\"\\\" && li != None {\\n\\t\\t\\t\\tf(string(str))\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\",\n \"func getNames(sub pkix.Name) []Name {\\n\\t// anonymous func for finding the max of a list of integer\\n\\tmax := func(v1 int, vn ...int) (max int) {\\n\\t\\tmax = v1\\n\\t\\tfor i := 0; i < len(vn); i++ {\\n\\t\\t\\tif vn[i] > max {\\n\\t\\t\\t\\tmax = vn[i]\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn max\\n\\t}\\n\\n\\tnc := len(sub.Country)\\n\\tnorg := len(sub.Organization)\\n\\tnou := len(sub.OrganizationalUnit)\\n\\tnl := len(sub.Locality)\\n\\tnp := len(sub.Province)\\n\\n\\tn := max(nc, norg, nou, nl, np)\\n\\n\\tnames := make([]Name, n)\\n\\tfor i := range names {\\n\\t\\tif i < nc {\\n\\t\\t\\tnames[i].C = sub.Country[i]\\n\\t\\t}\\n\\t\\tif i < norg {\\n\\t\\t\\tnames[i].O = sub.Organization[i]\\n\\t\\t}\\n\\t\\tif i < nou {\\n\\t\\t\\tnames[i].OU = sub.OrganizationalUnit[i]\\n\\t\\t}\\n\\t\\tif i < nl {\\n\\t\\t\\tnames[i].L = sub.Locality[i]\\n\\t\\t}\\n\\t\\tif i < np {\\n\\t\\t\\tnames[i].ST = sub.Province[i]\\n\\t\\t}\\n\\t}\\n\\treturn names\\n}\",\n \"func (o *objectSet) nameMatches(nameRegex string) *objectSet {\\n\\tret := &objectSet{}\\n\\tfor k, v := range o.objMap {\\n\\t\\t_, _, objName := object.FromHash(k)\\n\\t\\tm, err := regexp.MatchString(nameRegex, objName)\\n\\t\\tif err != nil && m {\\n\\t\\t\\tret.append(v)\\n\\t\\t}\\n\\t}\\n\\treturn ret\\n}\",\n \"func setPatchNames(patches []string, jsonPatches []kustomize.PatchJSON6902) ([]string, []kustomize.PatchJSON6902) {\\n\\tfixedPatches := make([]string, len(patches))\\n\\tfixedJSONPatches := make([]kustomize.PatchJSON6902, len(jsonPatches))\\n\\tfor i, patch := range patches {\\n\\t\\t// insert the generated name metadata\\n\\t\\tfixedPatches[i] = fmt.Sprintf(\\\"metadata:\\\\nname: %s\\\\n%s\\\", kubeadm.ObjectName, patch)\\n\\t}\\n\\tfor i, patch := range jsonPatches {\\n\\t\\t// insert the generated name metadata\\n\\t\\tpatch.Name = kubeadm.ObjectName\\n\\t\\tfixedJSONPatches[i] = patch\\n\\t}\\n\\treturn fixedPatches, fixedJSONPatches\\n}\",\n \"func (n *piName) FreeNames() []Name {\\n\\treturn []Name{n}\\n}\",\n \"func NewListName(val string) ListNameField {\\n\\treturn ListNameField{quickfix.FIXString(val)}\\n}\",\n \"func execNewPkgName(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(4)\\n\\tret := types.NewPkgName(token.Pos(args[0].(int)), args[1].(*types.Package), args[2].(string), args[3].(*types.Package))\\n\\tp.Ret(4, ret)\\n}\",\n \"func New(e *eme.EMECipher, longNames bool, raw64 bool) *NameTransform {\\n\\tb64 := base64.URLEncoding\\n\\tif raw64 {\\n\\t\\tb64 = base64.RawURLEncoding\\n\\t}\\n\\treturn &NameTransform{\\n\\t\\temeCipher: e,\\n\\t\\tlongNames: longNames,\\n\\t\\tB64: b64,\\n\\t}\\n}\",\n \"func NewFunctionCall(name string, params []Expression, returnType Type) Expression {\\n\\treturn &functionCall{\\n\\t\\tname: name,\\n\\t\\tparams: params,\\n\\t\\treturnType: returnType,\\n\\t}\\n}\",\n \"func (t *targetrunner) renameObject(w http.ResponseWriter, r *http.Request, msg *cmn.ActionMsg) {\\n\\tapitems, err := t.checkRESTItems(w, r, 2, false, cmn.Version, cmn.Objects)\\n\\tif err != nil {\\n\\t\\treturn\\n\\t}\\n\\tbucket, objNameFrom := apitems[0], apitems[1]\\n\\tbck, err := newBckFromQuery(bucket, r.URL.Query())\\n\\tif err != nil {\\n\\t\\tt.invalmsghdlr(w, r, err.Error(), http.StatusBadRequest)\\n\\t\\treturn\\n\\t}\\n\\tlom := &cluster.LOM{T: t, ObjName: objNameFrom}\\n\\tif err = lom.Init(bck.Bck); err != nil {\\n\\t\\tt.invalmsghdlr(w, r, err.Error())\\n\\t\\treturn\\n\\t}\\n\\tif lom.Bck().IsRemote() {\\n\\t\\tt.invalmsghdlr(w, r, fmt.Sprintf(\\\"%s: cannot rename object from remote bucket\\\", lom))\\n\\t\\treturn\\n\\t}\\n\\tif lom.Bck().Props.EC.Enabled {\\n\\t\\tt.invalmsghdlr(w, r, fmt.Sprintf(\\\"%s: cannot rename erasure-coded object\\\", lom))\\n\\t\\treturn\\n\\t}\\n\\n\\tbuf, slab := t.gmm.Alloc()\\n\\tri := &replicInfo{smap: t.owner.smap.get(), t: t, bckTo: lom.Bck(), buf: buf, localOnly: false, finalize: true}\\n\\tcopied, err := ri.copyObject(lom, msg.Name /* new object name */)\\n\\tslab.Free(buf)\\n\\tif err != nil {\\n\\t\\tt.invalmsghdlr(w, r, err.Error())\\n\\t\\treturn\\n\\t}\\n\\tif copied {\\n\\t\\tlom.Lock(true)\\n\\t\\tif err = lom.Remove(); err != nil {\\n\\t\\t\\tt.invalmsghdlr(w, r, err.Error())\\n\\t\\t}\\n\\t\\tlom.Unlock(true)\\n\\t}\\n}\",\n \"func (e *Enforcer) GetAllNamedObjects(ptype string) []string {\\n\\treturn e.model.GetValuesForFieldInPolicy(\\\"p\\\", ptype, 1)\\n}\",\n \"func (a *Client) GetInstancesObjectsObjectNameDefinitions(params *GetInstancesObjectsObjectNameDefinitionsParams) (*GetInstancesObjectsObjectNameDefinitionsOK, error) {\\n\\t// TODO: Validate the params before sending\\n\\tif params == nil {\\n\\t\\tparams = NewGetInstancesObjectsObjectNameDefinitionsParams()\\n\\t}\\n\\n\\tresult, err := a.transport.Submit(&runtime.ClientOperation{\\n\\t\\tID: \\\"getInstancesObjectsObjectNameDefinitions\\\",\\n\\t\\tMethod: \\\"GET\\\",\\n\\t\\tPathPattern: \\\"/instances/objects/{objectName}/definitions\\\",\\n\\t\\tProducesMediaTypes: []string{\\\"\\\"},\\n\\t\\tConsumesMediaTypes: []string{\\\"\\\"},\\n\\t\\tSchemes: []string{\\\"https\\\"},\\n\\t\\tParams: params,\\n\\t\\tReader: &GetInstancesObjectsObjectNameDefinitionsReader{formats: a.formats},\\n\\t\\tContext: params.Context,\\n\\t\\tClient: params.HTTPClient,\\n\\t})\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn result.(*GetInstancesObjectsObjectNameDefinitionsOK), nil\\n\\n}\",\n \"func (m *MockIDistributedEnforcer) GetAllNamedObjects(arg0 string) []string {\\n\\tm.ctrl.T.Helper()\\n\\tret := m.ctrl.Call(m, \\\"GetAllNamedObjects\\\", arg0)\\n\\tret0, _ := ret[0].([]string)\\n\\treturn ret0\\n}\",\n \"func (b *JSONSupportGeneratorBuilder) Names(value *NamesCalculator) *JSONSupportGeneratorBuilder {\\n\\tb.names = value\\n\\treturn b\\n}\",\n \"func NewFunctionCall(name string, context string, args ...interface{}) FunctionCall {\\n\\treturn FunctionCall{name, context, args}\\n}\",\n \"func SetIterationNames(names []string) CustomizeIterationFunc {\\n\\treturn func(fxt *TestFixture, idx int) error {\\n\\t\\tif len(fxt.Iterations) != len(names) {\\n\\t\\t\\treturn errs.Errorf(\\\"number of names (%d) must match number of iterations to create (%d)\\\", len(names), len(fxt.Iterations))\\n\\t\\t}\\n\\t\\tfxt.Iterations[idx].Name = names[idx]\\n\\t\\treturn nil\\n\\t}\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.58631206","0.58631206","0.5818655","0.5258608","0.5123252","0.5123252","0.50969934","0.5032237","0.50116974","0.5003598","0.49712798","0.48637605","0.48614097","0.4857428","0.48428673","0.4813975","0.48088303","0.4790116","0.478159","0.478159","0.47766036","0.4755525","0.47224835","0.47171596","0.47112864","0.47112864","0.4705204","0.4694117","0.46838522","0.46733025","0.46570423","0.4647531","0.4644537","0.46311185","0.46311185","0.46196118","0.46196118","0.46177626","0.46132615","0.46020743","0.45829603","0.45678264","0.45461628","0.45407197","0.45389766","0.45360643","0.45280933","0.45241615","0.45132384","0.45014986","0.45002106","0.44986975","0.44884658","0.44849864","0.4468415","0.44632208","0.44623184","0.44584042","0.44497758","0.44382828","0.4434107","0.44134033","0.4406137","0.44021538","0.43966252","0.438765","0.43843558","0.43735844","0.4363224","0.43632093","0.43620384","0.4353397","0.43489394","0.4343304","0.43261543","0.43088523","0.43066993","0.43056569","0.43054876","0.42953077","0.42924753","0.42914975","0.4289419","0.42845523","0.428279","0.42779234","0.42585278","0.42527956","0.4248512","0.42462602","0.42201364","0.42196143","0.4219444","0.42172572","0.4215325","0.42120495","0.42098132","0.42085797","0.41999185"],"string":"[\n \"0.58631206\",\n \"0.58631206\",\n \"0.5818655\",\n \"0.5258608\",\n \"0.5123252\",\n \"0.5123252\",\n \"0.50969934\",\n \"0.5032237\",\n \"0.50116974\",\n \"0.5003598\",\n \"0.49712798\",\n \"0.48637605\",\n \"0.48614097\",\n \"0.4857428\",\n \"0.48428673\",\n \"0.4813975\",\n \"0.48088303\",\n \"0.4790116\",\n \"0.478159\",\n \"0.478159\",\n \"0.47766036\",\n \"0.4755525\",\n \"0.47224835\",\n \"0.47171596\",\n \"0.47112864\",\n \"0.47112864\",\n \"0.4705204\",\n \"0.4694117\",\n \"0.46838522\",\n \"0.46733025\",\n \"0.46570423\",\n \"0.4647531\",\n \"0.4644537\",\n \"0.46311185\",\n \"0.46311185\",\n \"0.46196118\",\n \"0.46196118\",\n \"0.46177626\",\n \"0.46132615\",\n \"0.46020743\",\n \"0.45829603\",\n \"0.45678264\",\n \"0.45461628\",\n \"0.45407197\",\n \"0.45389766\",\n \"0.45360643\",\n \"0.45280933\",\n \"0.45241615\",\n \"0.45132384\",\n \"0.45014986\",\n \"0.45002106\",\n \"0.44986975\",\n \"0.44884658\",\n \"0.44849864\",\n \"0.4468415\",\n \"0.44632208\",\n \"0.44623184\",\n \"0.44584042\",\n \"0.44497758\",\n \"0.44382828\",\n \"0.4434107\",\n \"0.44134033\",\n \"0.4406137\",\n \"0.44021538\",\n \"0.43966252\",\n \"0.438765\",\n \"0.43843558\",\n \"0.43735844\",\n \"0.4363224\",\n \"0.43632093\",\n \"0.43620384\",\n \"0.4353397\",\n \"0.43489394\",\n \"0.4343304\",\n \"0.43261543\",\n \"0.43088523\",\n \"0.43066993\",\n \"0.43056569\",\n \"0.43054876\",\n \"0.42953077\",\n \"0.42924753\",\n \"0.42914975\",\n \"0.4289419\",\n \"0.42845523\",\n \"0.428279\",\n \"0.42779234\",\n \"0.42585278\",\n \"0.42527956\",\n \"0.4248512\",\n \"0.42462602\",\n \"0.42201364\",\n \"0.42196143\",\n \"0.4219444\",\n \"0.42172572\",\n \"0.4215325\",\n \"0.42120495\",\n \"0.42098132\",\n \"0.42085797\",\n \"0.41999185\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.8870936"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":999,"cells":{"query":{"kind":"string","value":"/ It calls the VisitFunction method by passing in the receiver to and returns the interface. It is a visitor pattern."},"document":{"kind":"string","value":"func (this *ObjectNames) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["func (this *NowStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (e FunctionCallExpression) Visit(env Environment) Value {\n\treturn NoneValue()\n}","func (i *InterfaceSet) Visit(n ast.Node) (w ast.Visitor) {\n\tswitch n := n.(type) {\n\tcase *ast.TypeSpec:\n\t\tif data, ok := n.Type.(*ast.InterfaceType); ok {\n\t\t\tr := InterfaceInfo{\n\t\t\t\tMethods: []*Method{},\n\t\t\t}\n\t\t\tmethods := data.Methods.List\n\t\t\tr.Name = n.Name.Name\n\t\t\tr.Doc = n.Doc.Text()\n\n\t\t\tfor _, m := range methods {\n\t\t\t\tfor _, name := range m.Names {\n\t\t\t\t\tr.Methods = append(r.Methods, &Method{\n\t\t\t\t\t\tMethodName: name.Name,\n\t\t\t\t\t\tDoc: m.Doc.Text(),\n\t\t\t\t\t\tParams: getParamList(m.Type.(*ast.FuncType).Params),\n\t\t\t\t\t\tResult: getParamList(m.Type.(*ast.FuncType).Results),\n\t\t\t\t\t})\n\t\t\t\t}\n\n\t\t\t}\n\t\t\ti.Interfaces = append(i.Interfaces, r)\n\t\t}\n\t}\n\treturn i\n}","func FuncInterface(_ T1) {}","func (this *ExecuteFunction) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitExecuteFunction(this)\n}","func (this *ObjectValues) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectValues) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectUnwrap) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (r *Resolver) Visitor() generated.VisitorResolver { return &visitorResolver{r} }","func (this *ObjectInnerValues) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (f VisitorFunc) Visit(node Node, visitType int) error {\n\treturn f(node, visitType)\n}","func (this *ClockStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *NowMillis) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (statement *FunctionCall) Accept(visitor StatementVisitor) {\n\tvisitor.VisitFunctionCall(statement)\n}","func (this *ObjectLength) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectLength) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectRemove) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *DateDiffStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectPairs) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectPairs) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectAdd) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectInnerPairs) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *ObjectPut) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (v Value) AsFunction() Callable {\n\treturn v.iface.(Callable)\n}","func (bf *BuiltInFunc) Call(interpreter *Interpreter, args ...interface{}) interface{} {\n\t// we actually omit the `interpreter` because we already known how\n\t// to convert it into a go function.\n\treturn bf.call(bf.instance, args...)\n}","func (this *ClockMillis) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (statement *NativeCall) Accept(visitor StatementVisitor) {\n\tvisitor.VisitNativeCall(statement)\n}","func (this *DatePartStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func Visit(node Node, visitor func(Node)) {\n\tReplace(node, func(n Node) Node { visitor(n); return n })\n}","func (*Base) Visit(p ASTPass, node *ast.Node, ctx Context) {\n\n\tf := *(*node).OpenFodder()\n\tp.Fodder(p, &f, ctx)\n\t*(*node).OpenFodder() = f\n\n\tswitch node := (*node).(type) {\n\tcase *ast.Apply:\n\t\tp.Apply(p, node, ctx)\n\tcase *ast.ApplyBrace:\n\t\tp.ApplyBrace(p, node, ctx)\n\tcase *ast.Array:\n\t\tp.Array(p, node, ctx)\n\tcase *ast.ArrayComp:\n\t\tp.ArrayComp(p, node, ctx)\n\tcase *ast.Assert:\n\t\tp.Assert(p, node, ctx)\n\tcase *ast.Binary:\n\t\tp.Binary(p, node, ctx)\n\tcase *ast.Conditional:\n\t\tp.Conditional(p, node, ctx)\n\tcase *ast.Dollar:\n\t\tp.Dollar(p, node, ctx)\n\tcase *ast.Error:\n\t\tp.Error(p, node, ctx)\n\tcase *ast.Function:\n\t\tp.Function(p, node, ctx)\n\tcase *ast.Import:\n\t\tp.Import(p, node, ctx)\n\tcase *ast.ImportStr:\n\t\tp.ImportStr(p, node, ctx)\n\tcase *ast.ImportBin:\n\t\tp.ImportBin(p, node, ctx)\n\tcase *ast.Index:\n\t\tp.Index(p, node, ctx)\n\tcase *ast.InSuper:\n\t\tp.InSuper(p, node, ctx)\n\tcase *ast.LiteralBoolean:\n\t\tp.LiteralBoolean(p, node, ctx)\n\tcase *ast.LiteralNull:\n\t\tp.LiteralNull(p, node, ctx)\n\tcase *ast.LiteralNumber:\n\t\tp.LiteralNumber(p, node, ctx)\n\tcase *ast.LiteralString:\n\t\tp.LiteralString(p, node, ctx)\n\tcase *ast.Local:\n\t\tp.Local(p, node, ctx)\n\tcase *ast.Object:\n\t\tp.Object(p, node, ctx)\n\tcase *ast.ObjectComp:\n\t\tp.ObjectComp(p, node, ctx)\n\tcase *ast.Parens:\n\t\tp.Parens(p, node, ctx)\n\tcase *ast.Self:\n\t\tp.Self(p, node, ctx)\n\tcase *ast.Slice:\n\t\tp.Slice(p, node, ctx)\n\tcase *ast.SuperIndex:\n\t\tp.SuperIndex(p, node, ctx)\n\tcase *ast.Unary:\n\t\tp.Unary(p, node, ctx)\n\tcase *ast.Var:\n\t\tp.Var(p, node, ctx)\n\t}\n}","func (this *Element) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitElement(this)\n}","func (n *Interface) Walk(v walker.Visitor) {\n\tif v.EnterNode(n) == false {\n\t\treturn\n\t}\n\n\tif n.InterfaceName != nil {\n\t\tvv := v.GetChildrenVisitor(\"InterfaceName\")\n\t\tn.InterfaceName.Walk(vv)\n\t}\n\n\tif n.Extends != nil {\n\t\tvv := v.GetChildrenVisitor(\"Extends\")\n\t\tn.Extends.Walk(vv)\n\t}\n\n\tif n.Stmts != nil {\n\t\tvv := v.GetChildrenVisitor(\"Stmts\")\n\t\tfor _, nn := range n.Stmts {\n\t\t\tif nn != nil {\n\t\t\t\tnn.Walk(vv)\n\t\t\t}\n\t\t}\n\t}\n\n\tv.LeaveNode(n)\n}","func (this *StrToZoneName) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func Visit(visitor func(funcName string, backend TemplateFunc)) {\n\tlock.Lock()\n\tdefer lock.Unlock()\n\n\tfor funcName, backend := range backends {\n\t\tvisitor(funcName, backend)\n\t}\n}","func (this *DateDiffMillis) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *StrToUTC) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (u Unary) Accept(interpreter *Interpreter) Object {\n\treturn interpreter.visitUnary(u)\n}","func (v *FuncVisitor) Visit(node ast.Node) ast.Visitor {\n\tswitch n := node.(type) {\n\tcase *ast.FuncDecl:\n\t\tif n.Body == nil {\n\t\t\t// Do not count declarations of assembly functions.\n\t\t\tbreak\n\t\t}\n\t\tstart := v.fset.Position(n.Pos())\n\t\tend := v.fset.Position(n.End())\n\n\t\tfe := &FuncExtent{\n\t\t\tName: v.signature(n),\n\t\t\tDecl: n,\n\t\t\tstartLine: start.Line,\n\t\t\tstartCol: start.Column,\n\t\t\tendLine: end.Line,\n\t\t\tendCol: end.Column,\n\t\t\tOffset: start.Offset,\n\t\t\tEnd: end.Offset,\n\t\t}\n\t\tv.funcs = append(v.funcs, fe)\n\t}\n\treturn v\n}","func (this *DateAddStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *MillisToStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *Mod) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitMod(this)\n}","func (this *StrToMillis) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (b Binary) Accept(interpreter *Interpreter) Object {\n\treturn interpreter.visitBinary(b)\n}","func (this *MillisToUTC) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (v visitor) Visit(n ast.Node) ast.Visitor {\n\tif n == nil {\n\t\treturn nil\n\t}\n\n\tif ShouldPrintAbstractSyntaxTree {\n\t\tfmt.Printf(\"%s%T\\n\", strings.Repeat(\"\\t\", int(v)), n)\n\t\tfmt.Printf(\"%d\", v)\n\n\t\treturn v + 1\n\t}\n\n\tswitch d := n.(type) {\n\tcase *ast.Ident:\n\t\tif d.Obj == nil {\n\t\t\treturn v + 1\n\t\t}\n\n\t\tif d.Obj.Kind == ast.Typ {\n\t\t\tresult := parseStruct(d)\n\n\t\t\tfor i := range result {\n\t\t\t\t_, ok := Result[CurrentFile].StructScanResult[result[i].Name]\n\t\t\t\tif !ok {\n\t\t\t\t\tResult[CurrentFile].StructScanResult[result[i].Name] = result[i]\n\t\t\t\t}\n\t\t\t}\n\t\t} else if d.Obj.Kind == ast.Con || d.Obj.Kind == ast.Var {\n\t\t\tresult := parseConstantsAndVariables(d)\n\n\t\t\tfor i := range result {\n\t\t\t\t_, ok := Result[CurrentFile].ScanResult[result[i].Name]\n\t\t\t\tif !ok {\n\t\t\t\t\tResult[CurrentFile].ScanResult[result[i].Name] = result[i]\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\tdefault:\n\t\tbreak\n\t}\n\n\treturn v + 1\n}","func (p Passengers) Visit(visitor func(Passenger)) {\n\tfor _, one := range p {\n\t\tvisitor(one)\n\t}\n}","func (p Passengers) Visit(visitor func(Passenger)) {\n\tfor _, one := range p {\n\t\tvisitor(one)\n\t}\n}","func (this *MillisToZoneName) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (this *DateTruncStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (x AstSlice) Interface() interface{} { return asInterface(x.X, x.X == nil) }","func (p *Parser) Interface() interface{} {\n\treturn p.data\n}","func (*FuncExpr) iCallable() {}","func (this *DateAddMillis) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (c *CallExpr) accept(v ExprVisitor) {\n\tv.VisitCall(c)\n}","func (this *DatePartMillis) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}","func (f *Function) Call(arg interface{}) {\n\tf.input <- arg\n}","func (l *List) Visit(f func(n *Node)) {\n\tp := l.head\n\tfor p != nil {\n\t\tf(p)\n\t\tp = p.next\n\t}\n}","func (f WalkFunc) Walk(ctx context.Context, call *Call, path string) Node { return f(path) }","func (r *fakeResourceResult) Visit(fn resource.VisitorFunc) error {\n\tfor _, info := range r.Infos {\n\t\terr := fn(info, nil)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}","func Replace(node Node, visitor func(Node) Node) {\n\tswitch n := node.(type) {\n\tcase *Abort:\n\tcase *API:\n\t\tfor i, c := range n.Enums {\n\t\t\tn.Enums[i] = visitor(c).(*Enum)\n\t\t}\n\t\tfor i, c := range n.Definitions {\n\t\t\tn.Definitions[i] = visitor(c).(*Definition)\n\t\t}\n\t\tfor i, c := range n.Classes {\n\t\t\tn.Classes[i] = visitor(c).(*Class)\n\t\t}\n\t\tfor i, c := range n.Pseudonyms {\n\t\t\tn.Pseudonyms[i] = visitor(c).(*Pseudonym)\n\t\t}\n\t\tfor i, c := range n.Externs {\n\t\t\tn.Externs[i] = visitor(c).(*Function)\n\t\t}\n\t\tfor i, c := range n.Subroutines {\n\t\t\tn.Subroutines[i] = visitor(c).(*Function)\n\t\t}\n\t\tfor i, c := range n.Functions {\n\t\t\tn.Functions[i] = visitor(c).(*Function)\n\t\t}\n\t\tfor i, c := range n.Methods {\n\t\t\tn.Methods[i] = visitor(c).(*Function)\n\t\t}\n\t\tfor i, c := range n.Globals {\n\t\t\tn.Globals[i] = visitor(c).(*Global)\n\t\t}\n\t\tfor i, c := range n.StaticArrays {\n\t\t\tn.StaticArrays[i] = visitor(c).(*StaticArray)\n\t\t}\n\t\tfor i, c := range n.Maps {\n\t\t\tn.Maps[i] = visitor(c).(*Map)\n\t\t}\n\t\tfor i, c := range n.Pointers {\n\t\t\tn.Pointers[i] = visitor(c).(*Pointer)\n\t\t}\n\t\tfor i, c := range n.Slices {\n\t\t\tn.Slices[i] = visitor(c).(*Slice)\n\t\t}\n\t\tfor i, c := range n.References {\n\t\t\tn.References[i] = visitor(c).(*Reference)\n\t\t}\n\t\tfor i, c := range n.Signatures {\n\t\t\tn.Signatures[i] = visitor(c).(*Signature)\n\t\t}\n\tcase *ArrayAssign:\n\t\tn.To = visitor(n.To).(*ArrayIndex)\n\t\tn.Value = visitor(n.Value).(Expression)\n\tcase *ArrayIndex:\n\t\tn.Array = visitor(n.Array).(Expression)\n\t\tn.Index = visitor(n.Index).(Expression)\n\tcase *ArrayInitializer:\n\t\tn.Array = visitor(n.Array).(Type)\n\t\tfor i, c := range n.Values {\n\t\t\tn.Values[i] = visitor(c).(Expression)\n\t\t}\n\tcase *Slice:\n\t\tn.To = visitor(n.To).(Type)\n\tcase *SliceIndex:\n\t\tn.Slice = visitor(n.Slice).(Expression)\n\t\tn.Index = visitor(n.Index).(Expression)\n\tcase *SliceAssign:\n\t\tn.To = visitor(n.To).(*SliceIndex)\n\t\tn.Value = visitor(n.Value).(Expression)\n\tcase *Assert:\n\t\tn.Condition = visitor(n.Condition).(Expression)\n\tcase *Assign:\n\t\tn.LHS = visitor(n.LHS).(Expression)\n\t\tn.RHS = visitor(n.RHS).(Expression)\n\tcase *Annotation:\n\t\tfor i, c := range n.Arguments {\n\t\t\tn.Arguments[i] = visitor(c).(Expression)\n\t\t}\n\tcase *Block:\n\t\tfor i, c := range n.Statements {\n\t\t\tn.Statements[i] = visitor(c).(Statement)\n\t\t}\n\tcase BoolValue:\n\tcase *BinaryOp:\n\t\tif n.LHS != nil {\n\t\t\tn.LHS = visitor(n.LHS).(Expression)\n\t\t}\n\t\tif n.RHS != nil {\n\t\t\tn.RHS = visitor(n.RHS).(Expression)\n\t\t}\n\tcase *BitTest:\n\t\tn.Bitfield = visitor(n.Bitfield).(Expression)\n\t\tn.Bits = visitor(n.Bits).(Expression)\n\tcase *UnaryOp:\n\t\tn.Expression = visitor(n.Expression).(Expression)\n\tcase *Branch:\n\t\tn.Condition = visitor(n.Condition).(Expression)\n\t\tn.True = visitor(n.True).(*Block)\n\t\tif n.False != nil {\n\t\t\tn.False = visitor(n.False).(*Block)\n\t\t}\n\tcase *Builtin:\n\tcase *Reference:\n\t\tn.To = visitor(n.To).(Type)\n\tcase *Call:\n\t\tn.Type = visitor(n.Type).(Type)\n\t\tn.Target = visitor(n.Target).(*Callable)\n\t\tfor i, a := range n.Arguments {\n\t\t\tn.Arguments[i] = visitor(a).(Expression)\n\t\t}\n\tcase *Callable:\n\t\tif n.Object != nil {\n\t\t\tn.Object = visitor(n.Object).(Expression)\n\t\t}\n\t\tn.Function = visitor(n.Function).(*Function)\n\tcase *Case:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tfor i, c := range n.Conditions {\n\t\t\tn.Conditions[i] = visitor(c).(Expression)\n\t\t}\n\t\tn.Block = visitor(n.Block).(*Block)\n\tcase *Cast:\n\t\tn.Object = visitor(n.Object).(Expression)\n\t\tn.Type = visitor(n.Type).(Type)\n\tcase *Class:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tfor i, f := range n.Fields {\n\t\t\tn.Fields[i] = visitor(f).(*Field)\n\t\t}\n\t\tfor i, m := range n.Methods {\n\t\t\tn.Methods[i] = visitor(m).(*Function)\n\t\t}\n\tcase *ClassInitializer:\n\t\tfor i, f := range n.Fields {\n\t\t\tn.Fields[i] = visitor(f).(*FieldInitializer)\n\t\t}\n\tcase *Choice:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tfor i, c := range n.Conditions {\n\t\t\tn.Conditions[i] = visitor(c).(Expression)\n\t\t}\n\t\tn.Expression = visitor(n.Expression).(Expression)\n\tcase *Definition:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tn.Expression = visitor(n.Expression).(Expression)\n\tcase *DefinitionUsage:\n\t\tn.Expression = visitor(n.Expression).(Expression)\n\t\tn.Definition = visitor(n.Definition).(*Definition)\n\tcase *DeclareLocal:\n\t\tn.Local = visitor(n.Local).(*Local)\n\t\tif n.Local.Value != nil {\n\t\t\tn.Local.Value = visitor(n.Local.Value).(Expression)\n\t\t}\n\tcase Documentation:\n\tcase *Enum:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tfor i, e := range n.Entries {\n\t\t\tn.Entries[i] = visitor(e).(*EnumEntry)\n\t\t}\n\tcase *EnumEntry:\n\tcase *Fence:\n\t\tif n.Statement != nil {\n\t\t\tn.Statement = visitor(n.Statement).(Statement)\n\t\t}\n\tcase *Field:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tn.Type = visitor(n.Type).(Type)\n\t\tif n.Default != nil {\n\t\t\tn.Default = visitor(n.Default).(Expression)\n\t\t}\n\tcase *FieldInitializer:\n\t\tn.Value = visitor(n.Value).(Expression)\n\tcase Float32Value:\n\tcase Float64Value:\n\tcase *Function:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tif n.Return != nil {\n\t\t\tn.Return = visitor(n.Return).(*Parameter)\n\t\t}\n\t\tfor i, c := range n.FullParameters {\n\t\t\tn.FullParameters[i] = visitor(c).(*Parameter)\n\t\t}\n\t\tif n.Block != nil {\n\t\t\tn.Block = visitor(n.Block).(*Block)\n\t\t}\n\t\tn.Signature = visitor(n.Signature).(*Signature)\n\tcase *Global:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\tcase *StaticArray:\n\t\tn.ValueType = visitor(n.ValueType).(Type)\n\t\tn.SizeExpr = visitor(n.SizeExpr).(Expression)\n\tcase *Signature:\n\tcase Int8Value:\n\tcase Int16Value:\n\tcase Int32Value:\n\tcase Int64Value:\n\tcase *Iteration:\n\t\tn.Iterator = visitor(n.Iterator).(*Local)\n\t\tn.From = visitor(n.From).(Expression)\n\t\tn.To = visitor(n.To).(Expression)\n\t\tn.Block = visitor(n.Block).(*Block)\n\tcase *MapIteration:\n\t\tn.IndexIterator = visitor(n.IndexIterator).(*Local)\n\t\tn.KeyIterator = visitor(n.KeyIterator).(*Local)\n\t\tn.ValueIterator = visitor(n.ValueIterator).(*Local)\n\t\tn.Map = visitor(n.Map).(Expression)\n\t\tn.Block = visitor(n.Block).(*Block)\n\tcase Invalid:\n\tcase *Length:\n\t\tn.Object = visitor(n.Object).(Expression)\n\tcase *Local:\n\t\tn.Type = visitor(n.Type).(Type)\n\tcase *Map:\n\t\tn.KeyType = visitor(n.KeyType).(Type)\n\t\tn.ValueType = visitor(n.ValueType).(Type)\n\tcase *MapAssign:\n\t\tn.To = visitor(n.To).(*MapIndex)\n\t\tn.Value = visitor(n.Value).(Expression)\n\tcase *MapContains:\n\t\tn.Key = visitor(n.Key).(Expression)\n\t\tn.Map = visitor(n.Map).(Expression)\n\tcase *MapIndex:\n\t\tn.Map = visitor(n.Map).(Expression)\n\t\tn.Index = visitor(n.Index).(Expression)\n\tcase *MapRemove:\n\t\tn.Map = visitor(n.Map).(Expression)\n\t\tn.Key = visitor(n.Key).(Expression)\n\tcase *MapClear:\n\t\tn.Map = visitor(n.Map).(Expression)\n\tcase *Member:\n\t\tn.Object = visitor(n.Object).(Expression)\n\t\tn.Field = visitor(n.Field).(*Field)\n\tcase *MessageValue:\n\t\tfor i, a := range n.Arguments {\n\t\t\tn.Arguments[i] = visitor(a).(*FieldInitializer)\n\t\t}\n\tcase *New:\n\t\tn.Type = visitor(n.Type).(*Reference)\n\tcase *Parameter:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tn.Type = visitor(n.Type).(Type)\n\tcase *Pointer:\n\t\tn.To = visitor(n.To).(Type)\n\tcase *Pseudonym:\n\t\tfor i, c := range n.Annotations {\n\t\t\tn.Annotations[i] = visitor(c).(*Annotation)\n\t\t}\n\t\tn.To = visitor(n.To).(Type)\n\t\tfor i, m := range n.Methods {\n\t\t\tn.Methods[i] = visitor(m).(*Function)\n\t\t}\n\tcase *Return:\n\t\tif n.Value != nil {\n\t\t\tn.Value = visitor(n.Value).(Expression)\n\t\t}\n\tcase *Select:\n\t\tn.Value = visitor(n.Value).(Expression)\n\t\tfor i, c := range n.Choices {\n\t\t\tn.Choices[i] = visitor(c).(*Choice)\n\t\t}\n\t\tif n.Default != nil {\n\t\t\tn.Default = visitor(n.Default).(Expression)\n\t\t}\n\tcase StringValue:\n\tcase *Switch:\n\t\tn.Value = visitor(n.Value).(Expression)\n\t\tfor i, c := range n.Cases {\n\t\t\tn.Cases[i] = visitor(c).(*Case)\n\t\t}\n\t\tif n.Default != nil {\n\t\t\tn.Default = visitor(n.Default).(*Block)\n\t\t}\n\tcase Uint8Value:\n\tcase Uint16Value:\n\tcase Uint32Value:\n\tcase Uint64Value:\n\tcase *Unknown:\n\tcase *Clone:\n\t\tn.Slice = visitor(n.Slice).(Expression)\n\tcase *Copy:\n\t\tn.Src = visitor(n.Src).(Expression)\n\t\tn.Dst = visitor(n.Dst).(Expression)\n\tcase *Create:\n\t\tn.Type = visitor(n.Type).(*Reference)\n\t\tn.Initializer = visitor(n.Initializer).(*ClassInitializer)\n\tcase *Ignore:\n\tcase *Make:\n\t\tn.Type = visitor(n.Type).(*Slice)\n\t\tn.Size = visitor(n.Size).(Expression)\n\tcase Null:\n\tcase *PointerRange:\n\t\tn.Pointer = visitor(n.Pointer).(Expression)\n\t\tn.Range = visitor(n.Range).(*BinaryOp)\n\tcase *Read:\n\t\tn.Slice = visitor(n.Slice).(Expression)\n\tcase *SliceContains:\n\t\tn.Value = visitor(n.Value).(Expression)\n\t\tn.Slice = visitor(n.Slice).(Expression)\n\tcase *SliceRange:\n\t\tn.Slice = visitor(n.Slice).(Expression)\n\t\tn.Range = visitor(n.Range).(*BinaryOp)\n\tcase *Write:\n\t\tn.Slice = visitor(n.Slice).(Expression)\n\tdefault:\n\t\tpanic(fmt.Errorf(\"Unsupported semantic node type %T\", n))\n\t}\n}","func (h *MapInt16ToInt) Visit(fn func(int16, int)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func FuncInterfaceCompatible(_ T1) {}","func (b *Binary) Accept(v Visitor) {\n\tv.VisitBinary(b)\n}","func (s *InterfaceStep) Interface() interface{} {\n\treturn s.value\n}","func (h *MapInt16ToInt8) Visit(fn func(int16, int8)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func (s *Sequenced) Accept(v Visitor) {\n\tv.VisitSequenced(s)\n}","func testVisitors(methodCalled *string) (*SimpleVisitor, []*SimpleVisitor) {\n\tv := &SimpleVisitor{\n\t\tDoVisitEnumNode: func(*EnumNode) error {\n\t\t\t*methodCalled = \"*EnumNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitEnumValueNode: func(*EnumValueNode) error {\n\t\t\t*methodCalled = \"*EnumValueNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitFieldDeclNode: func(FieldDeclNode) error {\n\t\t\t*methodCalled = \"FieldDeclNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitFieldNode: func(*FieldNode) error {\n\t\t\t*methodCalled = \"*FieldNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitGroupNode: func(*GroupNode) error {\n\t\t\t*methodCalled = \"*GroupNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitOneofNode: func(*OneofNode) error {\n\t\t\t*methodCalled = \"*OneofNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitMapTypeNode: func(*MapTypeNode) error {\n\t\t\t*methodCalled = \"*MapTypeNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitMapFieldNode: func(*MapFieldNode) error {\n\t\t\t*methodCalled = \"*MapFieldNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitFileNode: func(*FileNode) error {\n\t\t\t*methodCalled = \"*FileNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitSyntaxNode: func(*SyntaxNode) error {\n\t\t\t*methodCalled = \"*SyntaxNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitImportNode: func(*ImportNode) error {\n\t\t\t*methodCalled = \"*ImportNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitPackageNode: func(*PackageNode) error {\n\t\t\t*methodCalled = \"*PackageNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitIdentValueNode: func(IdentValueNode) error {\n\t\t\t*methodCalled = \"IdentValueNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitIdentNode: func(*IdentNode) error {\n\t\t\t*methodCalled = \"*IdentNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitCompoundIdentNode: func(*CompoundIdentNode) error {\n\t\t\t*methodCalled = \"*CompoundIdentNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitKeywordNode: func(*KeywordNode) error {\n\t\t\t*methodCalled = \"*KeywordNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitMessageDeclNode: func(MessageDeclNode) error {\n\t\t\t*methodCalled = \"MessageDeclNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitMessageNode: func(*MessageNode) error {\n\t\t\t*methodCalled = \"*MessageNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitExtendNode: func(*ExtendNode) error {\n\t\t\t*methodCalled = \"*ExtendNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitNode: func(Node) error {\n\t\t\t*methodCalled = \"Node\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitTerminalNode: func(TerminalNode) error {\n\t\t\t*methodCalled = \"TerminalNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitCompositeNode: func(CompositeNode) error {\n\t\t\t*methodCalled = \"CompositeNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitRuneNode: func(*RuneNode) error {\n\t\t\t*methodCalled = \"*RuneNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitEmptyDeclNode: func(*EmptyDeclNode) error {\n\t\t\t*methodCalled = \"*EmptyDeclNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitOptionNode: func(*OptionNode) error {\n\t\t\t*methodCalled = \"*OptionNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitOptionNameNode: func(*OptionNameNode) error {\n\t\t\t*methodCalled = \"*OptionNameNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitFieldReferenceNode: func(*FieldReferenceNode) error {\n\t\t\t*methodCalled = \"*FieldReferenceNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitCompactOptionsNode: func(*CompactOptionsNode) error {\n\t\t\t*methodCalled = \"*CompactOptionsNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitExtensionRangeNode: func(*ExtensionRangeNode) error {\n\t\t\t*methodCalled = \"*ExtensionRangeNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitRangeNode: func(*RangeNode) error {\n\t\t\t*methodCalled = \"*RangeNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitReservedNode: func(*ReservedNode) error {\n\t\t\t*methodCalled = \"*ReservedNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitServiceNode: func(*ServiceNode) error {\n\t\t\t*methodCalled = \"*ServiceNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitRPCNode: func(*RPCNode) error {\n\t\t\t*methodCalled = \"*RPCNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitRPCTypeNode: func(*RPCTypeNode) error {\n\t\t\t*methodCalled = \"*RPCTypeNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitValueNode: func(ValueNode) error {\n\t\t\t*methodCalled = \"ValueNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitStringValueNode: func(StringValueNode) error {\n\t\t\t*methodCalled = \"StringValueNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitStringLiteralNode: func(*StringLiteralNode) error {\n\t\t\t*methodCalled = \"*StringLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitCompoundStringLiteralNode: func(*CompoundStringLiteralNode) error {\n\t\t\t*methodCalled = \"*CompoundStringLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitIntValueNode: func(IntValueNode) error {\n\t\t\t*methodCalled = \"IntValueNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitUintLiteralNode: func(*UintLiteralNode) error {\n\t\t\t*methodCalled = \"*UintLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitPositiveUintLiteralNode: func(*PositiveUintLiteralNode) error {\n\t\t\t*methodCalled = \"*PositiveUintLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitNegativeIntLiteralNode: func(*NegativeIntLiteralNode) error {\n\t\t\t*methodCalled = \"*NegativeIntLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitFloatValueNode: func(FloatValueNode) error {\n\t\t\t*methodCalled = \"FloatValueNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitFloatLiteralNode: func(*FloatLiteralNode) error {\n\t\t\t*methodCalled = \"*FloatLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitSpecialFloatLiteralNode: func(*SpecialFloatLiteralNode) error {\n\t\t\t*methodCalled = \"*SpecialFloatLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitSignedFloatLiteralNode: func(*SignedFloatLiteralNode) error {\n\t\t\t*methodCalled = \"*SignedFloatLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitArrayLiteralNode: func(*ArrayLiteralNode) error {\n\t\t\t*methodCalled = \"*ArrayLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitMessageLiteralNode: func(*MessageLiteralNode) error {\n\t\t\t*methodCalled = \"*MessageLiteralNode\"\n\t\t\treturn nil\n\t\t},\n\t\tDoVisitMessageFieldNode: func(*MessageFieldNode) error {\n\t\t\t*methodCalled = \"*MessageFieldNode\"\n\t\t\treturn nil\n\t\t},\n\t}\n\tothers := []*SimpleVisitor{\n\t\t{\n\t\t\tDoVisitEnumNode: v.DoVisitEnumNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitEnumValueNode: v.DoVisitEnumValueNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitFieldDeclNode: v.DoVisitFieldDeclNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitFieldNode: v.DoVisitFieldNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitGroupNode: v.DoVisitGroupNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitOneofNode: v.DoVisitOneofNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitMapTypeNode: v.DoVisitMapTypeNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitMapFieldNode: v.DoVisitMapFieldNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitFileNode: v.DoVisitFileNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitSyntaxNode: v.DoVisitSyntaxNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitImportNode: v.DoVisitImportNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitPackageNode: v.DoVisitPackageNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitIdentValueNode: v.DoVisitIdentValueNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitIdentNode: v.DoVisitIdentNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitCompoundIdentNode: v.DoVisitCompoundIdentNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitKeywordNode: v.DoVisitKeywordNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitMessageDeclNode: v.DoVisitMessageDeclNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitMessageNode: v.DoVisitMessageNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitExtendNode: v.DoVisitExtendNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitNode: v.DoVisitNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitTerminalNode: v.DoVisitTerminalNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitCompositeNode: v.DoVisitCompositeNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitRuneNode: v.DoVisitRuneNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitEmptyDeclNode: v.DoVisitEmptyDeclNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitOptionNode: v.DoVisitOptionNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitOptionNameNode: v.DoVisitOptionNameNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitFieldReferenceNode: v.DoVisitFieldReferenceNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitCompactOptionsNode: v.DoVisitCompactOptionsNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitExtensionRangeNode: v.DoVisitExtensionRangeNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitRangeNode: v.DoVisitRangeNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitReservedNode: v.DoVisitReservedNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitServiceNode: v.DoVisitServiceNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitRPCNode: v.DoVisitRPCNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitRPCTypeNode: v.DoVisitRPCTypeNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitValueNode: v.DoVisitValueNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitStringValueNode: v.DoVisitStringValueNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitStringLiteralNode: v.DoVisitStringLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitCompoundStringLiteralNode: v.DoVisitCompoundStringLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitIntValueNode: v.DoVisitIntValueNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitUintLiteralNode: v.DoVisitUintLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitPositiveUintLiteralNode: v.DoVisitPositiveUintLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitNegativeIntLiteralNode: v.DoVisitNegativeIntLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitFloatValueNode: v.DoVisitFloatValueNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitFloatLiteralNode: v.DoVisitFloatLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitSpecialFloatLiteralNode: v.DoVisitSpecialFloatLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitSignedFloatLiteralNode: v.DoVisitSignedFloatLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitArrayLiteralNode: v.DoVisitArrayLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitMessageLiteralNode: v.DoVisitMessageLiteralNode,\n\t\t},\n\t\t{\n\t\t\tDoVisitMessageFieldNode: v.DoVisitMessageFieldNode,\n\t\t},\n\t}\n\treturn v, others\n}","func _[T interface{ ~func(string) int }](f T) int {\n\treturn f(\"hello\")\n}","func VisitedFunctions(prog *ssa.Program, packs []*ssa.Package, isOvl isOverloaded) (seen, usesGR map[*ssa.Function]bool) {\n\tvisit := visitor{\n\t\tprog: prog,\n\t\tpacks: packs, // new\n\t\tseen: make(map[*ssa.Function]bool),\n\t\tusesGR: make(map[*ssa.Function]bool),\n\t}\n\tvisit.program(isOvl)\n\t//fmt.Printf(\"DEBUG VisitedFunctions.usesGR %v\\n\", visit.usesGR)\n\t//fmt.Printf(\"DEBUG VisitedFunctions.seen %v\\n\", visit.seen)\n\treturn visit.seen, visit.usesGR\n}","func (h *MapInt16ToInt32) Visit(fn func(int16, int32)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func (x *fastReflection_Evidence) Interface() protoreflect.ProtoMessage {\n\treturn (*Evidence)(x)\n}","func (f *functionQuery) Evaluate(t iterator) interface{} {\n\treturn f.Func(f.Input, t)\n}","func Visit(node Node, visitor func(node Node, next func() error) error) error {\n\tif reflect.ValueOf(node).IsNil() { // Workaround for Go's typed nil interfaces.\n\t\treturn nil\n\t}\n\treturn visitor(node, func() error {\n\t\tfor _, child := range node.children() {\n\t\t\tif err := Visit(child, visitor); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\treturn nil\n\t})\n}","func (x *fastReflection_Output) Interface() protoreflect.ProtoMessage {\n\treturn (*Output)(x)\n}","func (i I) I() I { return i }","func (rf RendererFunc) Render(w io.Writer, v interface{}) error { return rf(w, v) }","func (v Variable) Accept(interpreter *Interpreter) Object {\n\treturn interpreter.visitVariable(v)\n}","func (*Base) Function(p ASTPass, node *ast.Function, ctx Context) {\n\tp.Parameters(p, &node.ParenLeftFodder, &node.Parameters, &node.ParenRightFodder, ctx)\n\tp.Visit(p, &node.Body, ctx)\n}","func (t *FileTree) VisitorFn(fn func(file.Reference)) func(node.Node) {\n\treturn func(node node.Node) {\n\t\tfn(t.fileByPathID(node.ID()))\n\t}\n}","func execNewInterface(_ int, p *gop.Context) {\n\targs := p.GetArgs(2)\n\tret := types.NewInterface(args[0].([]*types.Func), args[1].([]*types.Named))\n\tp.Ret(2, ret)\n}","func (h *MapInt16ToUint8) Visit(fn func(int16, uint8)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func FuncInterfaceCompatible2(_ io.Writer) {}","func (h *MapInt16ToInt16) Visit(fn func(int16, int16)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func Function(sig *CallSignature) Type {\n\treturn Type{functionImpl{sig: sig}}\n}","func (mi *ModifierInvocation) Visit(ctx *parser.ModifierInvocationContext) {\n\tmi.Start = ctx.GetStart()\n\tmi.Stop = ctx.GetStop()\n\tmi.Identifier = ctx.Identifier().GetText()\n\n\tif ctx.ExpressionList() != nil {\n\t\texpList := ctx.ExpressionList().(*parser.ExpressionListContext)\n\n\t\tfor _, exprCtx := range expList.AllExpression() {\n\t\t\texpression := NewExpression()\n\t\t\texpression.Visit(exprCtx.(*parser.ExpressionContext))\n\n\t\t\tmi.Expressions = append(mi.Expressions, expression)\n\t\t}\n\t}\n}","func (x *fastReflection_Input) Interface() protoreflect.ProtoMessage {\n\treturn (*Input)(x)\n}","func (a Assign) Accept(interpreter *Interpreter) Object {\n\treturn interpreter.visitAssign(a)\n}","func (h *MapInt16ToUint) Visit(fn func(int16, uint)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func (h *MapInt16ToUint32) Visit(fn func(int16, uint32)) {\n\tfor _, e := range h.slots {\n\t\tfor ; e != nil; e = e.next {\n\t\t\tfn(e.k, e.v)\n\t\t}\n\t}\n}","func (_Contract *ContractCallerSession) InterfaceImplementer(node [32]byte, interfaceID [4]byte) (common.Address, error) {\n\treturn _Contract.Contract.InterfaceImplementer(&_Contract.CallOpts, node, interfaceID)\n}","func (g Grouping) Accept(interpreter *Interpreter) Object {\n\treturn interpreter.visitGrouping(g)\n}","func Interface(ifname string) func(*NetworkTap) error {\n\treturn func(filterdev *NetworkTap) error {\n\t\terr := filterdev.SetInterface(int(filterdev.device.Fd()), ifname)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\treturn nil\n\t}\n}","func (f *FlagSet) Visit(fn func(*Flag)) {\n\tfor _, flag := range sortFlags(f.actual) {\n\t\tfn(flag)\n\t}\n}","func (_Contract *ContractFilterer) FilterInterfaceChanged(opts *bind.FilterOpts, node [][32]byte, interfaceID [][4]byte) (*ContractInterfaceChangedIterator, error) {\n\n\tvar nodeRule []interface{}\n\tfor _, nodeItem := range node {\n\t\tnodeRule = append(nodeRule, nodeItem)\n\t}\n\tvar interfaceIDRule []interface{}\n\tfor _, interfaceIDItem := range interfaceID {\n\t\tinterfaceIDRule = append(interfaceIDRule, interfaceIDItem)\n\t}\n\n\tlogs, sub, err := _Contract.contract.FilterLogs(opts, \"InterfaceChanged\", nodeRule, interfaceIDRule)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &ContractInterfaceChangedIterator{contract: _Contract.contract, event: \"InterfaceChanged\", logs: logs, sub: sub}, nil\n}","func (f *FlagSet) Visit(fn func(*Flag)) {\n\tif len(f.actual) == 0 {\n\t\treturn\n\t}\n\n\tvar flags []*Flag\n\tif f.SortFlags {\n\t\tif len(f.actual) != len(f.sortedActual) {\n\t\t\tf.sortedActual = sortFlags(f.actual)\n\t\t}\n\t\tflags = f.sortedActual\n\t} else {\n\t\tflags = f.orderedActual\n\t}\n\n\tfor _, flag := range flags {\n\t\tfn(flag)\n\t}\n}","func (x *fastReflection_EventRetire) Interface() protoreflect.ProtoMessage {\n\treturn (*EventRetire)(x)\n}","func execmInterfaceMethod(_ int, p *gop.Context) {\n\targs := p.GetArgs(2)\n\tret := args[0].(*types.Interface).Method(args[1].(int))\n\tp.Ret(2, ret)\n}","func (lambda PresenterFunc) Render(message interface{}) error {\n\treturn lambda(message)\n}","func underlyingInterface(w v1alpha1.ExecutableWorkflow, node v1alpha1.ExecutableNode) (*core.TypedInterface, error) {\n\tiface := &core.TypedInterface{}\n\tif node.GetTaskID() != nil {\n\t\tt, err := w.GetTask(*node.GetTaskID())\n\t\tif err != nil {\n\t\t\t// Should never happen\n\t\t\treturn nil, err\n\t\t}\n\n\t\tiface.Outputs = t.CoreTask().GetInterface().Outputs\n\t} else if wfNode := node.GetWorkflowNode(); wfNode != nil {\n\t\tif wfRef := wfNode.GetSubWorkflowRef(); wfRef != nil {\n\t\t\tt := w.FindSubWorkflow(*wfRef)\n\t\t\tif t == nil {\n\t\t\t\t// Should never happen\n\t\t\t\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \"Couldn't find subworkflow [%v].\", wfRef)\n\t\t\t}\n\n\t\t\tiface.Outputs = t.GetOutputs().VariableMap\n\t\t} else {\n\t\t\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \"Unknown interface\")\n\t\t}\n\t} else if node.GetBranchNode() != nil {\n\t\tif ifBlock := node.GetBranchNode().GetIf(); ifBlock != nil && ifBlock.GetThenNode() != nil {\n\t\t\tbn, found := w.GetNode(*ifBlock.GetThenNode())\n\t\t\tif !found {\n\t\t\t\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \"Couldn't find branch node [%v]\",\n\t\t\t\t\t*ifBlock.GetThenNode())\n\t\t\t}\n\n\t\t\treturn underlyingInterface(w, bn)\n\t\t}\n\n\t\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \"Empty branch detected.\")\n\t} else {\n\t\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \"Unknown interface.\")\n\t}\n\n\treturn iface, nil\n}"],"string":"[\n \"func (this *NowStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (e FunctionCallExpression) Visit(env Environment) Value {\\n\\treturn NoneValue()\\n}\",\n \"func (i *InterfaceSet) Visit(n ast.Node) (w ast.Visitor) {\\n\\tswitch n := n.(type) {\\n\\tcase *ast.TypeSpec:\\n\\t\\tif data, ok := n.Type.(*ast.InterfaceType); ok {\\n\\t\\t\\tr := InterfaceInfo{\\n\\t\\t\\t\\tMethods: []*Method{},\\n\\t\\t\\t}\\n\\t\\t\\tmethods := data.Methods.List\\n\\t\\t\\tr.Name = n.Name.Name\\n\\t\\t\\tr.Doc = n.Doc.Text()\\n\\n\\t\\t\\tfor _, m := range methods {\\n\\t\\t\\t\\tfor _, name := range m.Names {\\n\\t\\t\\t\\t\\tr.Methods = append(r.Methods, &Method{\\n\\t\\t\\t\\t\\t\\tMethodName: name.Name,\\n\\t\\t\\t\\t\\t\\tDoc: m.Doc.Text(),\\n\\t\\t\\t\\t\\t\\tParams: getParamList(m.Type.(*ast.FuncType).Params),\\n\\t\\t\\t\\t\\t\\tResult: getParamList(m.Type.(*ast.FuncType).Results),\\n\\t\\t\\t\\t\\t})\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\ti.Interfaces = append(i.Interfaces, r)\\n\\t\\t}\\n\\t}\\n\\treturn i\\n}\",\n \"func FuncInterface(_ T1) {}\",\n \"func (this *ExecuteFunction) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitExecuteFunction(this)\\n}\",\n \"func (this *ObjectValues) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectValues) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectUnwrap) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (r *Resolver) Visitor() generated.VisitorResolver { return &visitorResolver{r} }\",\n \"func (this *ObjectInnerValues) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (f VisitorFunc) Visit(node Node, visitType int) error {\\n\\treturn f(node, visitType)\\n}\",\n \"func (this *ClockStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *NowMillis) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (statement *FunctionCall) Accept(visitor StatementVisitor) {\\n\\tvisitor.VisitFunctionCall(statement)\\n}\",\n \"func (this *ObjectLength) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectLength) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectRemove) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *DateDiffStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectPairs) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectPairs) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectAdd) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectInnerPairs) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *ObjectPut) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (v Value) AsFunction() Callable {\\n\\treturn v.iface.(Callable)\\n}\",\n \"func (bf *BuiltInFunc) Call(interpreter *Interpreter, args ...interface{}) interface{} {\\n\\t// we actually omit the `interpreter` because we already known how\\n\\t// to convert it into a go function.\\n\\treturn bf.call(bf.instance, args...)\\n}\",\n \"func (this *ClockMillis) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (statement *NativeCall) Accept(visitor StatementVisitor) {\\n\\tvisitor.VisitNativeCall(statement)\\n}\",\n \"func (this *DatePartStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func Visit(node Node, visitor func(Node)) {\\n\\tReplace(node, func(n Node) Node { visitor(n); return n })\\n}\",\n \"func (*Base) Visit(p ASTPass, node *ast.Node, ctx Context) {\\n\\n\\tf := *(*node).OpenFodder()\\n\\tp.Fodder(p, &f, ctx)\\n\\t*(*node).OpenFodder() = f\\n\\n\\tswitch node := (*node).(type) {\\n\\tcase *ast.Apply:\\n\\t\\tp.Apply(p, node, ctx)\\n\\tcase *ast.ApplyBrace:\\n\\t\\tp.ApplyBrace(p, node, ctx)\\n\\tcase *ast.Array:\\n\\t\\tp.Array(p, node, ctx)\\n\\tcase *ast.ArrayComp:\\n\\t\\tp.ArrayComp(p, node, ctx)\\n\\tcase *ast.Assert:\\n\\t\\tp.Assert(p, node, ctx)\\n\\tcase *ast.Binary:\\n\\t\\tp.Binary(p, node, ctx)\\n\\tcase *ast.Conditional:\\n\\t\\tp.Conditional(p, node, ctx)\\n\\tcase *ast.Dollar:\\n\\t\\tp.Dollar(p, node, ctx)\\n\\tcase *ast.Error:\\n\\t\\tp.Error(p, node, ctx)\\n\\tcase *ast.Function:\\n\\t\\tp.Function(p, node, ctx)\\n\\tcase *ast.Import:\\n\\t\\tp.Import(p, node, ctx)\\n\\tcase *ast.ImportStr:\\n\\t\\tp.ImportStr(p, node, ctx)\\n\\tcase *ast.ImportBin:\\n\\t\\tp.ImportBin(p, node, ctx)\\n\\tcase *ast.Index:\\n\\t\\tp.Index(p, node, ctx)\\n\\tcase *ast.InSuper:\\n\\t\\tp.InSuper(p, node, ctx)\\n\\tcase *ast.LiteralBoolean:\\n\\t\\tp.LiteralBoolean(p, node, ctx)\\n\\tcase *ast.LiteralNull:\\n\\t\\tp.LiteralNull(p, node, ctx)\\n\\tcase *ast.LiteralNumber:\\n\\t\\tp.LiteralNumber(p, node, ctx)\\n\\tcase *ast.LiteralString:\\n\\t\\tp.LiteralString(p, node, ctx)\\n\\tcase *ast.Local:\\n\\t\\tp.Local(p, node, ctx)\\n\\tcase *ast.Object:\\n\\t\\tp.Object(p, node, ctx)\\n\\tcase *ast.ObjectComp:\\n\\t\\tp.ObjectComp(p, node, ctx)\\n\\tcase *ast.Parens:\\n\\t\\tp.Parens(p, node, ctx)\\n\\tcase *ast.Self:\\n\\t\\tp.Self(p, node, ctx)\\n\\tcase *ast.Slice:\\n\\t\\tp.Slice(p, node, ctx)\\n\\tcase *ast.SuperIndex:\\n\\t\\tp.SuperIndex(p, node, ctx)\\n\\tcase *ast.Unary:\\n\\t\\tp.Unary(p, node, ctx)\\n\\tcase *ast.Var:\\n\\t\\tp.Var(p, node, ctx)\\n\\t}\\n}\",\n \"func (this *Element) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitElement(this)\\n}\",\n \"func (n *Interface) Walk(v walker.Visitor) {\\n\\tif v.EnterNode(n) == false {\\n\\t\\treturn\\n\\t}\\n\\n\\tif n.InterfaceName != nil {\\n\\t\\tvv := v.GetChildrenVisitor(\\\"InterfaceName\\\")\\n\\t\\tn.InterfaceName.Walk(vv)\\n\\t}\\n\\n\\tif n.Extends != nil {\\n\\t\\tvv := v.GetChildrenVisitor(\\\"Extends\\\")\\n\\t\\tn.Extends.Walk(vv)\\n\\t}\\n\\n\\tif n.Stmts != nil {\\n\\t\\tvv := v.GetChildrenVisitor(\\\"Stmts\\\")\\n\\t\\tfor _, nn := range n.Stmts {\\n\\t\\t\\tif nn != nil {\\n\\t\\t\\t\\tnn.Walk(vv)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tv.LeaveNode(n)\\n}\",\n \"func (this *StrToZoneName) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func Visit(visitor func(funcName string, backend TemplateFunc)) {\\n\\tlock.Lock()\\n\\tdefer lock.Unlock()\\n\\n\\tfor funcName, backend := range backends {\\n\\t\\tvisitor(funcName, backend)\\n\\t}\\n}\",\n \"func (this *DateDiffMillis) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *StrToUTC) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (u Unary) Accept(interpreter *Interpreter) Object {\\n\\treturn interpreter.visitUnary(u)\\n}\",\n \"func (v *FuncVisitor) Visit(node ast.Node) ast.Visitor {\\n\\tswitch n := node.(type) {\\n\\tcase *ast.FuncDecl:\\n\\t\\tif n.Body == nil {\\n\\t\\t\\t// Do not count declarations of assembly functions.\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tstart := v.fset.Position(n.Pos())\\n\\t\\tend := v.fset.Position(n.End())\\n\\n\\t\\tfe := &FuncExtent{\\n\\t\\t\\tName: v.signature(n),\\n\\t\\t\\tDecl: n,\\n\\t\\t\\tstartLine: start.Line,\\n\\t\\t\\tstartCol: start.Column,\\n\\t\\t\\tendLine: end.Line,\\n\\t\\t\\tendCol: end.Column,\\n\\t\\t\\tOffset: start.Offset,\\n\\t\\t\\tEnd: end.Offset,\\n\\t\\t}\\n\\t\\tv.funcs = append(v.funcs, fe)\\n\\t}\\n\\treturn v\\n}\",\n \"func (this *DateAddStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *MillisToStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *Mod) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitMod(this)\\n}\",\n \"func (this *StrToMillis) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (b Binary) Accept(interpreter *Interpreter) Object {\\n\\treturn interpreter.visitBinary(b)\\n}\",\n \"func (this *MillisToUTC) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (v visitor) Visit(n ast.Node) ast.Visitor {\\n\\tif n == nil {\\n\\t\\treturn nil\\n\\t}\\n\\n\\tif ShouldPrintAbstractSyntaxTree {\\n\\t\\tfmt.Printf(\\\"%s%T\\\\n\\\", strings.Repeat(\\\"\\\\t\\\", int(v)), n)\\n\\t\\tfmt.Printf(\\\"%d\\\", v)\\n\\n\\t\\treturn v + 1\\n\\t}\\n\\n\\tswitch d := n.(type) {\\n\\tcase *ast.Ident:\\n\\t\\tif d.Obj == nil {\\n\\t\\t\\treturn v + 1\\n\\t\\t}\\n\\n\\t\\tif d.Obj.Kind == ast.Typ {\\n\\t\\t\\tresult := parseStruct(d)\\n\\n\\t\\t\\tfor i := range result {\\n\\t\\t\\t\\t_, ok := Result[CurrentFile].StructScanResult[result[i].Name]\\n\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\tResult[CurrentFile].StructScanResult[result[i].Name] = result[i]\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} else if d.Obj.Kind == ast.Con || d.Obj.Kind == ast.Var {\\n\\t\\t\\tresult := parseConstantsAndVariables(d)\\n\\n\\t\\t\\tfor i := range result {\\n\\t\\t\\t\\t_, ok := Result[CurrentFile].ScanResult[result[i].Name]\\n\\t\\t\\t\\tif !ok {\\n\\t\\t\\t\\t\\tResult[CurrentFile].ScanResult[result[i].Name] = result[i]\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\tdefault:\\n\\t\\tbreak\\n\\t}\\n\\n\\treturn v + 1\\n}\",\n \"func (p Passengers) Visit(visitor func(Passenger)) {\\n\\tfor _, one := range p {\\n\\t\\tvisitor(one)\\n\\t}\\n}\",\n \"func (p Passengers) Visit(visitor func(Passenger)) {\\n\\tfor _, one := range p {\\n\\t\\tvisitor(one)\\n\\t}\\n}\",\n \"func (this *MillisToZoneName) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (this *DateTruncStr) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (x AstSlice) Interface() interface{} { return asInterface(x.X, x.X == nil) }\",\n \"func (p *Parser) Interface() interface{} {\\n\\treturn p.data\\n}\",\n \"func (*FuncExpr) iCallable() {}\",\n \"func (this *DateAddMillis) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (c *CallExpr) accept(v ExprVisitor) {\\n\\tv.VisitCall(c)\\n}\",\n \"func (this *DatePartMillis) Accept(visitor Visitor) (interface{}, error) {\\n\\treturn visitor.VisitFunction(this)\\n}\",\n \"func (f *Function) Call(arg interface{}) {\\n\\tf.input <- arg\\n}\",\n \"func (l *List) Visit(f func(n *Node)) {\\n\\tp := l.head\\n\\tfor p != nil {\\n\\t\\tf(p)\\n\\t\\tp = p.next\\n\\t}\\n}\",\n \"func (f WalkFunc) Walk(ctx context.Context, call *Call, path string) Node { return f(path) }\",\n \"func (r *fakeResourceResult) Visit(fn resource.VisitorFunc) error {\\n\\tfor _, info := range r.Infos {\\n\\t\\terr := fn(info, nil)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t}\\n\\treturn nil\\n}\",\n \"func Replace(node Node, visitor func(Node) Node) {\\n\\tswitch n := node.(type) {\\n\\tcase *Abort:\\n\\tcase *API:\\n\\t\\tfor i, c := range n.Enums {\\n\\t\\t\\tn.Enums[i] = visitor(c).(*Enum)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Definitions {\\n\\t\\t\\tn.Definitions[i] = visitor(c).(*Definition)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Classes {\\n\\t\\t\\tn.Classes[i] = visitor(c).(*Class)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Pseudonyms {\\n\\t\\t\\tn.Pseudonyms[i] = visitor(c).(*Pseudonym)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Externs {\\n\\t\\t\\tn.Externs[i] = visitor(c).(*Function)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Subroutines {\\n\\t\\t\\tn.Subroutines[i] = visitor(c).(*Function)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Functions {\\n\\t\\t\\tn.Functions[i] = visitor(c).(*Function)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Methods {\\n\\t\\t\\tn.Methods[i] = visitor(c).(*Function)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Globals {\\n\\t\\t\\tn.Globals[i] = visitor(c).(*Global)\\n\\t\\t}\\n\\t\\tfor i, c := range n.StaticArrays {\\n\\t\\t\\tn.StaticArrays[i] = visitor(c).(*StaticArray)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Maps {\\n\\t\\t\\tn.Maps[i] = visitor(c).(*Map)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Pointers {\\n\\t\\t\\tn.Pointers[i] = visitor(c).(*Pointer)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Slices {\\n\\t\\t\\tn.Slices[i] = visitor(c).(*Slice)\\n\\t\\t}\\n\\t\\tfor i, c := range n.References {\\n\\t\\t\\tn.References[i] = visitor(c).(*Reference)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Signatures {\\n\\t\\t\\tn.Signatures[i] = visitor(c).(*Signature)\\n\\t\\t}\\n\\tcase *ArrayAssign:\\n\\t\\tn.To = visitor(n.To).(*ArrayIndex)\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\tcase *ArrayIndex:\\n\\t\\tn.Array = visitor(n.Array).(Expression)\\n\\t\\tn.Index = visitor(n.Index).(Expression)\\n\\tcase *ArrayInitializer:\\n\\t\\tn.Array = visitor(n.Array).(Type)\\n\\t\\tfor i, c := range n.Values {\\n\\t\\t\\tn.Values[i] = visitor(c).(Expression)\\n\\t\\t}\\n\\tcase *Slice:\\n\\t\\tn.To = visitor(n.To).(Type)\\n\\tcase *SliceIndex:\\n\\t\\tn.Slice = visitor(n.Slice).(Expression)\\n\\t\\tn.Index = visitor(n.Index).(Expression)\\n\\tcase *SliceAssign:\\n\\t\\tn.To = visitor(n.To).(*SliceIndex)\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\tcase *Assert:\\n\\t\\tn.Condition = visitor(n.Condition).(Expression)\\n\\tcase *Assign:\\n\\t\\tn.LHS = visitor(n.LHS).(Expression)\\n\\t\\tn.RHS = visitor(n.RHS).(Expression)\\n\\tcase *Annotation:\\n\\t\\tfor i, c := range n.Arguments {\\n\\t\\t\\tn.Arguments[i] = visitor(c).(Expression)\\n\\t\\t}\\n\\tcase *Block:\\n\\t\\tfor i, c := range n.Statements {\\n\\t\\t\\tn.Statements[i] = visitor(c).(Statement)\\n\\t\\t}\\n\\tcase BoolValue:\\n\\tcase *BinaryOp:\\n\\t\\tif n.LHS != nil {\\n\\t\\t\\tn.LHS = visitor(n.LHS).(Expression)\\n\\t\\t}\\n\\t\\tif n.RHS != nil {\\n\\t\\t\\tn.RHS = visitor(n.RHS).(Expression)\\n\\t\\t}\\n\\tcase *BitTest:\\n\\t\\tn.Bitfield = visitor(n.Bitfield).(Expression)\\n\\t\\tn.Bits = visitor(n.Bits).(Expression)\\n\\tcase *UnaryOp:\\n\\t\\tn.Expression = visitor(n.Expression).(Expression)\\n\\tcase *Branch:\\n\\t\\tn.Condition = visitor(n.Condition).(Expression)\\n\\t\\tn.True = visitor(n.True).(*Block)\\n\\t\\tif n.False != nil {\\n\\t\\t\\tn.False = visitor(n.False).(*Block)\\n\\t\\t}\\n\\tcase *Builtin:\\n\\tcase *Reference:\\n\\t\\tn.To = visitor(n.To).(Type)\\n\\tcase *Call:\\n\\t\\tn.Type = visitor(n.Type).(Type)\\n\\t\\tn.Target = visitor(n.Target).(*Callable)\\n\\t\\tfor i, a := range n.Arguments {\\n\\t\\t\\tn.Arguments[i] = visitor(a).(Expression)\\n\\t\\t}\\n\\tcase *Callable:\\n\\t\\tif n.Object != nil {\\n\\t\\t\\tn.Object = visitor(n.Object).(Expression)\\n\\t\\t}\\n\\t\\tn.Function = visitor(n.Function).(*Function)\\n\\tcase *Case:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Conditions {\\n\\t\\t\\tn.Conditions[i] = visitor(c).(Expression)\\n\\t\\t}\\n\\t\\tn.Block = visitor(n.Block).(*Block)\\n\\tcase *Cast:\\n\\t\\tn.Object = visitor(n.Object).(Expression)\\n\\t\\tn.Type = visitor(n.Type).(Type)\\n\\tcase *Class:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tfor i, f := range n.Fields {\\n\\t\\t\\tn.Fields[i] = visitor(f).(*Field)\\n\\t\\t}\\n\\t\\tfor i, m := range n.Methods {\\n\\t\\t\\tn.Methods[i] = visitor(m).(*Function)\\n\\t\\t}\\n\\tcase *ClassInitializer:\\n\\t\\tfor i, f := range n.Fields {\\n\\t\\t\\tn.Fields[i] = visitor(f).(*FieldInitializer)\\n\\t\\t}\\n\\tcase *Choice:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tfor i, c := range n.Conditions {\\n\\t\\t\\tn.Conditions[i] = visitor(c).(Expression)\\n\\t\\t}\\n\\t\\tn.Expression = visitor(n.Expression).(Expression)\\n\\tcase *Definition:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tn.Expression = visitor(n.Expression).(Expression)\\n\\tcase *DefinitionUsage:\\n\\t\\tn.Expression = visitor(n.Expression).(Expression)\\n\\t\\tn.Definition = visitor(n.Definition).(*Definition)\\n\\tcase *DeclareLocal:\\n\\t\\tn.Local = visitor(n.Local).(*Local)\\n\\t\\tif n.Local.Value != nil {\\n\\t\\t\\tn.Local.Value = visitor(n.Local.Value).(Expression)\\n\\t\\t}\\n\\tcase Documentation:\\n\\tcase *Enum:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tfor i, e := range n.Entries {\\n\\t\\t\\tn.Entries[i] = visitor(e).(*EnumEntry)\\n\\t\\t}\\n\\tcase *EnumEntry:\\n\\tcase *Fence:\\n\\t\\tif n.Statement != nil {\\n\\t\\t\\tn.Statement = visitor(n.Statement).(Statement)\\n\\t\\t}\\n\\tcase *Field:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tn.Type = visitor(n.Type).(Type)\\n\\t\\tif n.Default != nil {\\n\\t\\t\\tn.Default = visitor(n.Default).(Expression)\\n\\t\\t}\\n\\tcase *FieldInitializer:\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\tcase Float32Value:\\n\\tcase Float64Value:\\n\\tcase *Function:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tif n.Return != nil {\\n\\t\\t\\tn.Return = visitor(n.Return).(*Parameter)\\n\\t\\t}\\n\\t\\tfor i, c := range n.FullParameters {\\n\\t\\t\\tn.FullParameters[i] = visitor(c).(*Parameter)\\n\\t\\t}\\n\\t\\tif n.Block != nil {\\n\\t\\t\\tn.Block = visitor(n.Block).(*Block)\\n\\t\\t}\\n\\t\\tn.Signature = visitor(n.Signature).(*Signature)\\n\\tcase *Global:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\tcase *StaticArray:\\n\\t\\tn.ValueType = visitor(n.ValueType).(Type)\\n\\t\\tn.SizeExpr = visitor(n.SizeExpr).(Expression)\\n\\tcase *Signature:\\n\\tcase Int8Value:\\n\\tcase Int16Value:\\n\\tcase Int32Value:\\n\\tcase Int64Value:\\n\\tcase *Iteration:\\n\\t\\tn.Iterator = visitor(n.Iterator).(*Local)\\n\\t\\tn.From = visitor(n.From).(Expression)\\n\\t\\tn.To = visitor(n.To).(Expression)\\n\\t\\tn.Block = visitor(n.Block).(*Block)\\n\\tcase *MapIteration:\\n\\t\\tn.IndexIterator = visitor(n.IndexIterator).(*Local)\\n\\t\\tn.KeyIterator = visitor(n.KeyIterator).(*Local)\\n\\t\\tn.ValueIterator = visitor(n.ValueIterator).(*Local)\\n\\t\\tn.Map = visitor(n.Map).(Expression)\\n\\t\\tn.Block = visitor(n.Block).(*Block)\\n\\tcase Invalid:\\n\\tcase *Length:\\n\\t\\tn.Object = visitor(n.Object).(Expression)\\n\\tcase *Local:\\n\\t\\tn.Type = visitor(n.Type).(Type)\\n\\tcase *Map:\\n\\t\\tn.KeyType = visitor(n.KeyType).(Type)\\n\\t\\tn.ValueType = visitor(n.ValueType).(Type)\\n\\tcase *MapAssign:\\n\\t\\tn.To = visitor(n.To).(*MapIndex)\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\tcase *MapContains:\\n\\t\\tn.Key = visitor(n.Key).(Expression)\\n\\t\\tn.Map = visitor(n.Map).(Expression)\\n\\tcase *MapIndex:\\n\\t\\tn.Map = visitor(n.Map).(Expression)\\n\\t\\tn.Index = visitor(n.Index).(Expression)\\n\\tcase *MapRemove:\\n\\t\\tn.Map = visitor(n.Map).(Expression)\\n\\t\\tn.Key = visitor(n.Key).(Expression)\\n\\tcase *MapClear:\\n\\t\\tn.Map = visitor(n.Map).(Expression)\\n\\tcase *Member:\\n\\t\\tn.Object = visitor(n.Object).(Expression)\\n\\t\\tn.Field = visitor(n.Field).(*Field)\\n\\tcase *MessageValue:\\n\\t\\tfor i, a := range n.Arguments {\\n\\t\\t\\tn.Arguments[i] = visitor(a).(*FieldInitializer)\\n\\t\\t}\\n\\tcase *New:\\n\\t\\tn.Type = visitor(n.Type).(*Reference)\\n\\tcase *Parameter:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tn.Type = visitor(n.Type).(Type)\\n\\tcase *Pointer:\\n\\t\\tn.To = visitor(n.To).(Type)\\n\\tcase *Pseudonym:\\n\\t\\tfor i, c := range n.Annotations {\\n\\t\\t\\tn.Annotations[i] = visitor(c).(*Annotation)\\n\\t\\t}\\n\\t\\tn.To = visitor(n.To).(Type)\\n\\t\\tfor i, m := range n.Methods {\\n\\t\\t\\tn.Methods[i] = visitor(m).(*Function)\\n\\t\\t}\\n\\tcase *Return:\\n\\t\\tif n.Value != nil {\\n\\t\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\t\\t}\\n\\tcase *Select:\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\t\\tfor i, c := range n.Choices {\\n\\t\\t\\tn.Choices[i] = visitor(c).(*Choice)\\n\\t\\t}\\n\\t\\tif n.Default != nil {\\n\\t\\t\\tn.Default = visitor(n.Default).(Expression)\\n\\t\\t}\\n\\tcase StringValue:\\n\\tcase *Switch:\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\t\\tfor i, c := range n.Cases {\\n\\t\\t\\tn.Cases[i] = visitor(c).(*Case)\\n\\t\\t}\\n\\t\\tif n.Default != nil {\\n\\t\\t\\tn.Default = visitor(n.Default).(*Block)\\n\\t\\t}\\n\\tcase Uint8Value:\\n\\tcase Uint16Value:\\n\\tcase Uint32Value:\\n\\tcase Uint64Value:\\n\\tcase *Unknown:\\n\\tcase *Clone:\\n\\t\\tn.Slice = visitor(n.Slice).(Expression)\\n\\tcase *Copy:\\n\\t\\tn.Src = visitor(n.Src).(Expression)\\n\\t\\tn.Dst = visitor(n.Dst).(Expression)\\n\\tcase *Create:\\n\\t\\tn.Type = visitor(n.Type).(*Reference)\\n\\t\\tn.Initializer = visitor(n.Initializer).(*ClassInitializer)\\n\\tcase *Ignore:\\n\\tcase *Make:\\n\\t\\tn.Type = visitor(n.Type).(*Slice)\\n\\t\\tn.Size = visitor(n.Size).(Expression)\\n\\tcase Null:\\n\\tcase *PointerRange:\\n\\t\\tn.Pointer = visitor(n.Pointer).(Expression)\\n\\t\\tn.Range = visitor(n.Range).(*BinaryOp)\\n\\tcase *Read:\\n\\t\\tn.Slice = visitor(n.Slice).(Expression)\\n\\tcase *SliceContains:\\n\\t\\tn.Value = visitor(n.Value).(Expression)\\n\\t\\tn.Slice = visitor(n.Slice).(Expression)\\n\\tcase *SliceRange:\\n\\t\\tn.Slice = visitor(n.Slice).(Expression)\\n\\t\\tn.Range = visitor(n.Range).(*BinaryOp)\\n\\tcase *Write:\\n\\t\\tn.Slice = visitor(n.Slice).(Expression)\\n\\tdefault:\\n\\t\\tpanic(fmt.Errorf(\\\"Unsupported semantic node type %T\\\", n))\\n\\t}\\n}\",\n \"func (h *MapInt16ToInt) Visit(fn func(int16, int)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func FuncInterfaceCompatible(_ T1) {}\",\n \"func (b *Binary) Accept(v Visitor) {\\n\\tv.VisitBinary(b)\\n}\",\n \"func (s *InterfaceStep) Interface() interface{} {\\n\\treturn s.value\\n}\",\n \"func (h *MapInt16ToInt8) Visit(fn func(int16, int8)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (s *Sequenced) Accept(v Visitor) {\\n\\tv.VisitSequenced(s)\\n}\",\n \"func testVisitors(methodCalled *string) (*SimpleVisitor, []*SimpleVisitor) {\\n\\tv := &SimpleVisitor{\\n\\t\\tDoVisitEnumNode: func(*EnumNode) error {\\n\\t\\t\\t*methodCalled = \\\"*EnumNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitEnumValueNode: func(*EnumValueNode) error {\\n\\t\\t\\t*methodCalled = \\\"*EnumValueNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitFieldDeclNode: func(FieldDeclNode) error {\\n\\t\\t\\t*methodCalled = \\\"FieldDeclNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitFieldNode: func(*FieldNode) error {\\n\\t\\t\\t*methodCalled = \\\"*FieldNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitGroupNode: func(*GroupNode) error {\\n\\t\\t\\t*methodCalled = \\\"*GroupNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitOneofNode: func(*OneofNode) error {\\n\\t\\t\\t*methodCalled = \\\"*OneofNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitMapTypeNode: func(*MapTypeNode) error {\\n\\t\\t\\t*methodCalled = \\\"*MapTypeNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitMapFieldNode: func(*MapFieldNode) error {\\n\\t\\t\\t*methodCalled = \\\"*MapFieldNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitFileNode: func(*FileNode) error {\\n\\t\\t\\t*methodCalled = \\\"*FileNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitSyntaxNode: func(*SyntaxNode) error {\\n\\t\\t\\t*methodCalled = \\\"*SyntaxNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitImportNode: func(*ImportNode) error {\\n\\t\\t\\t*methodCalled = \\\"*ImportNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitPackageNode: func(*PackageNode) error {\\n\\t\\t\\t*methodCalled = \\\"*PackageNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitIdentValueNode: func(IdentValueNode) error {\\n\\t\\t\\t*methodCalled = \\\"IdentValueNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitIdentNode: func(*IdentNode) error {\\n\\t\\t\\t*methodCalled = \\\"*IdentNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitCompoundIdentNode: func(*CompoundIdentNode) error {\\n\\t\\t\\t*methodCalled = \\\"*CompoundIdentNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitKeywordNode: func(*KeywordNode) error {\\n\\t\\t\\t*methodCalled = \\\"*KeywordNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitMessageDeclNode: func(MessageDeclNode) error {\\n\\t\\t\\t*methodCalled = \\\"MessageDeclNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitMessageNode: func(*MessageNode) error {\\n\\t\\t\\t*methodCalled = \\\"*MessageNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitExtendNode: func(*ExtendNode) error {\\n\\t\\t\\t*methodCalled = \\\"*ExtendNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitNode: func(Node) error {\\n\\t\\t\\t*methodCalled = \\\"Node\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitTerminalNode: func(TerminalNode) error {\\n\\t\\t\\t*methodCalled = \\\"TerminalNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitCompositeNode: func(CompositeNode) error {\\n\\t\\t\\t*methodCalled = \\\"CompositeNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitRuneNode: func(*RuneNode) error {\\n\\t\\t\\t*methodCalled = \\\"*RuneNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitEmptyDeclNode: func(*EmptyDeclNode) error {\\n\\t\\t\\t*methodCalled = \\\"*EmptyDeclNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitOptionNode: func(*OptionNode) error {\\n\\t\\t\\t*methodCalled = \\\"*OptionNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitOptionNameNode: func(*OptionNameNode) error {\\n\\t\\t\\t*methodCalled = \\\"*OptionNameNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitFieldReferenceNode: func(*FieldReferenceNode) error {\\n\\t\\t\\t*methodCalled = \\\"*FieldReferenceNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitCompactOptionsNode: func(*CompactOptionsNode) error {\\n\\t\\t\\t*methodCalled = \\\"*CompactOptionsNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitExtensionRangeNode: func(*ExtensionRangeNode) error {\\n\\t\\t\\t*methodCalled = \\\"*ExtensionRangeNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitRangeNode: func(*RangeNode) error {\\n\\t\\t\\t*methodCalled = \\\"*RangeNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitReservedNode: func(*ReservedNode) error {\\n\\t\\t\\t*methodCalled = \\\"*ReservedNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitServiceNode: func(*ServiceNode) error {\\n\\t\\t\\t*methodCalled = \\\"*ServiceNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitRPCNode: func(*RPCNode) error {\\n\\t\\t\\t*methodCalled = \\\"*RPCNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitRPCTypeNode: func(*RPCTypeNode) error {\\n\\t\\t\\t*methodCalled = \\\"*RPCTypeNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitValueNode: func(ValueNode) error {\\n\\t\\t\\t*methodCalled = \\\"ValueNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitStringValueNode: func(StringValueNode) error {\\n\\t\\t\\t*methodCalled = \\\"StringValueNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitStringLiteralNode: func(*StringLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*StringLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitCompoundStringLiteralNode: func(*CompoundStringLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*CompoundStringLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitIntValueNode: func(IntValueNode) error {\\n\\t\\t\\t*methodCalled = \\\"IntValueNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitUintLiteralNode: func(*UintLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*UintLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitPositiveUintLiteralNode: func(*PositiveUintLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*PositiveUintLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitNegativeIntLiteralNode: func(*NegativeIntLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*NegativeIntLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitFloatValueNode: func(FloatValueNode) error {\\n\\t\\t\\t*methodCalled = \\\"FloatValueNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitFloatLiteralNode: func(*FloatLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*FloatLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitSpecialFloatLiteralNode: func(*SpecialFloatLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*SpecialFloatLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitSignedFloatLiteralNode: func(*SignedFloatLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*SignedFloatLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitArrayLiteralNode: func(*ArrayLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*ArrayLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitMessageLiteralNode: func(*MessageLiteralNode) error {\\n\\t\\t\\t*methodCalled = \\\"*MessageLiteralNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t\\tDoVisitMessageFieldNode: func(*MessageFieldNode) error {\\n\\t\\t\\t*methodCalled = \\\"*MessageFieldNode\\\"\\n\\t\\t\\treturn nil\\n\\t\\t},\\n\\t}\\n\\tothers := []*SimpleVisitor{\\n\\t\\t{\\n\\t\\t\\tDoVisitEnumNode: v.DoVisitEnumNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitEnumValueNode: v.DoVisitEnumValueNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitFieldDeclNode: v.DoVisitFieldDeclNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitFieldNode: v.DoVisitFieldNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitGroupNode: v.DoVisitGroupNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitOneofNode: v.DoVisitOneofNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitMapTypeNode: v.DoVisitMapTypeNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitMapFieldNode: v.DoVisitMapFieldNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitFileNode: v.DoVisitFileNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitSyntaxNode: v.DoVisitSyntaxNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitImportNode: v.DoVisitImportNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitPackageNode: v.DoVisitPackageNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitIdentValueNode: v.DoVisitIdentValueNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitIdentNode: v.DoVisitIdentNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitCompoundIdentNode: v.DoVisitCompoundIdentNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitKeywordNode: v.DoVisitKeywordNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitMessageDeclNode: v.DoVisitMessageDeclNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitMessageNode: v.DoVisitMessageNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitExtendNode: v.DoVisitExtendNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitNode: v.DoVisitNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitTerminalNode: v.DoVisitTerminalNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitCompositeNode: v.DoVisitCompositeNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitRuneNode: v.DoVisitRuneNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitEmptyDeclNode: v.DoVisitEmptyDeclNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitOptionNode: v.DoVisitOptionNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitOptionNameNode: v.DoVisitOptionNameNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitFieldReferenceNode: v.DoVisitFieldReferenceNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitCompactOptionsNode: v.DoVisitCompactOptionsNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitExtensionRangeNode: v.DoVisitExtensionRangeNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitRangeNode: v.DoVisitRangeNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitReservedNode: v.DoVisitReservedNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitServiceNode: v.DoVisitServiceNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitRPCNode: v.DoVisitRPCNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitRPCTypeNode: v.DoVisitRPCTypeNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitValueNode: v.DoVisitValueNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitStringValueNode: v.DoVisitStringValueNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitStringLiteralNode: v.DoVisitStringLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitCompoundStringLiteralNode: v.DoVisitCompoundStringLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitIntValueNode: v.DoVisitIntValueNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitUintLiteralNode: v.DoVisitUintLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitPositiveUintLiteralNode: v.DoVisitPositiveUintLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitNegativeIntLiteralNode: v.DoVisitNegativeIntLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitFloatValueNode: v.DoVisitFloatValueNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitFloatLiteralNode: v.DoVisitFloatLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitSpecialFloatLiteralNode: v.DoVisitSpecialFloatLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitSignedFloatLiteralNode: v.DoVisitSignedFloatLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitArrayLiteralNode: v.DoVisitArrayLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitMessageLiteralNode: v.DoVisitMessageLiteralNode,\\n\\t\\t},\\n\\t\\t{\\n\\t\\t\\tDoVisitMessageFieldNode: v.DoVisitMessageFieldNode,\\n\\t\\t},\\n\\t}\\n\\treturn v, others\\n}\",\n \"func _[T interface{ ~func(string) int }](f T) int {\\n\\treturn f(\\\"hello\\\")\\n}\",\n \"func VisitedFunctions(prog *ssa.Program, packs []*ssa.Package, isOvl isOverloaded) (seen, usesGR map[*ssa.Function]bool) {\\n\\tvisit := visitor{\\n\\t\\tprog: prog,\\n\\t\\tpacks: packs, // new\\n\\t\\tseen: make(map[*ssa.Function]bool),\\n\\t\\tusesGR: make(map[*ssa.Function]bool),\\n\\t}\\n\\tvisit.program(isOvl)\\n\\t//fmt.Printf(\\\"DEBUG VisitedFunctions.usesGR %v\\\\n\\\", visit.usesGR)\\n\\t//fmt.Printf(\\\"DEBUG VisitedFunctions.seen %v\\\\n\\\", visit.seen)\\n\\treturn visit.seen, visit.usesGR\\n}\",\n \"func (h *MapInt16ToInt32) Visit(fn func(int16, int32)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (x *fastReflection_Evidence) Interface() protoreflect.ProtoMessage {\\n\\treturn (*Evidence)(x)\\n}\",\n \"func (f *functionQuery) Evaluate(t iterator) interface{} {\\n\\treturn f.Func(f.Input, t)\\n}\",\n \"func Visit(node Node, visitor func(node Node, next func() error) error) error {\\n\\tif reflect.ValueOf(node).IsNil() { // Workaround for Go's typed nil interfaces.\\n\\t\\treturn nil\\n\\t}\\n\\treturn visitor(node, func() error {\\n\\t\\tfor _, child := range node.children() {\\n\\t\\t\\tif err := Visit(child, visitor); err != nil {\\n\\t\\t\\t\\treturn err\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn nil\\n\\t})\\n}\",\n \"func (x *fastReflection_Output) Interface() protoreflect.ProtoMessage {\\n\\treturn (*Output)(x)\\n}\",\n \"func (i I) I() I { return i }\",\n \"func (rf RendererFunc) Render(w io.Writer, v interface{}) error { return rf(w, v) }\",\n \"func (v Variable) Accept(interpreter *Interpreter) Object {\\n\\treturn interpreter.visitVariable(v)\\n}\",\n \"func (*Base) Function(p ASTPass, node *ast.Function, ctx Context) {\\n\\tp.Parameters(p, &node.ParenLeftFodder, &node.Parameters, &node.ParenRightFodder, ctx)\\n\\tp.Visit(p, &node.Body, ctx)\\n}\",\n \"func (t *FileTree) VisitorFn(fn func(file.Reference)) func(node.Node) {\\n\\treturn func(node node.Node) {\\n\\t\\tfn(t.fileByPathID(node.ID()))\\n\\t}\\n}\",\n \"func execNewInterface(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(2)\\n\\tret := types.NewInterface(args[0].([]*types.Func), args[1].([]*types.Named))\\n\\tp.Ret(2, ret)\\n}\",\n \"func (h *MapInt16ToUint8) Visit(fn func(int16, uint8)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func FuncInterfaceCompatible2(_ io.Writer) {}\",\n \"func (h *MapInt16ToInt16) Visit(fn func(int16, int16)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func Function(sig *CallSignature) Type {\\n\\treturn Type{functionImpl{sig: sig}}\\n}\",\n \"func (mi *ModifierInvocation) Visit(ctx *parser.ModifierInvocationContext) {\\n\\tmi.Start = ctx.GetStart()\\n\\tmi.Stop = ctx.GetStop()\\n\\tmi.Identifier = ctx.Identifier().GetText()\\n\\n\\tif ctx.ExpressionList() != nil {\\n\\t\\texpList := ctx.ExpressionList().(*parser.ExpressionListContext)\\n\\n\\t\\tfor _, exprCtx := range expList.AllExpression() {\\n\\t\\t\\texpression := NewExpression()\\n\\t\\t\\texpression.Visit(exprCtx.(*parser.ExpressionContext))\\n\\n\\t\\t\\tmi.Expressions = append(mi.Expressions, expression)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (x *fastReflection_Input) Interface() protoreflect.ProtoMessage {\\n\\treturn (*Input)(x)\\n}\",\n \"func (a Assign) Accept(interpreter *Interpreter) Object {\\n\\treturn interpreter.visitAssign(a)\\n}\",\n \"func (h *MapInt16ToUint) Visit(fn func(int16, uint)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (h *MapInt16ToUint32) Visit(fn func(int16, uint32)) {\\n\\tfor _, e := range h.slots {\\n\\t\\tfor ; e != nil; e = e.next {\\n\\t\\t\\tfn(e.k, e.v)\\n\\t\\t}\\n\\t}\\n}\",\n \"func (_Contract *ContractCallerSession) InterfaceImplementer(node [32]byte, interfaceID [4]byte) (common.Address, error) {\\n\\treturn _Contract.Contract.InterfaceImplementer(&_Contract.CallOpts, node, interfaceID)\\n}\",\n \"func (g Grouping) Accept(interpreter *Interpreter) Object {\\n\\treturn interpreter.visitGrouping(g)\\n}\",\n \"func Interface(ifname string) func(*NetworkTap) error {\\n\\treturn func(filterdev *NetworkTap) error {\\n\\t\\terr := filterdev.SetInterface(int(filterdev.device.Fd()), ifname)\\n\\t\\tif err != nil {\\n\\t\\t\\treturn err\\n\\t\\t}\\n\\t\\treturn nil\\n\\t}\\n}\",\n \"func (f *FlagSet) Visit(fn func(*Flag)) {\\n\\tfor _, flag := range sortFlags(f.actual) {\\n\\t\\tfn(flag)\\n\\t}\\n}\",\n \"func (_Contract *ContractFilterer) FilterInterfaceChanged(opts *bind.FilterOpts, node [][32]byte, interfaceID [][4]byte) (*ContractInterfaceChangedIterator, error) {\\n\\n\\tvar nodeRule []interface{}\\n\\tfor _, nodeItem := range node {\\n\\t\\tnodeRule = append(nodeRule, nodeItem)\\n\\t}\\n\\tvar interfaceIDRule []interface{}\\n\\tfor _, interfaceIDItem := range interfaceID {\\n\\t\\tinterfaceIDRule = append(interfaceIDRule, interfaceIDItem)\\n\\t}\\n\\n\\tlogs, sub, err := _Contract.contract.FilterLogs(opts, \\\"InterfaceChanged\\\", nodeRule, interfaceIDRule)\\n\\tif err != nil {\\n\\t\\treturn nil, err\\n\\t}\\n\\treturn &ContractInterfaceChangedIterator{contract: _Contract.contract, event: \\\"InterfaceChanged\\\", logs: logs, sub: sub}, nil\\n}\",\n \"func (f *FlagSet) Visit(fn func(*Flag)) {\\n\\tif len(f.actual) == 0 {\\n\\t\\treturn\\n\\t}\\n\\n\\tvar flags []*Flag\\n\\tif f.SortFlags {\\n\\t\\tif len(f.actual) != len(f.sortedActual) {\\n\\t\\t\\tf.sortedActual = sortFlags(f.actual)\\n\\t\\t}\\n\\t\\tflags = f.sortedActual\\n\\t} else {\\n\\t\\tflags = f.orderedActual\\n\\t}\\n\\n\\tfor _, flag := range flags {\\n\\t\\tfn(flag)\\n\\t}\\n}\",\n \"func (x *fastReflection_EventRetire) Interface() protoreflect.ProtoMessage {\\n\\treturn (*EventRetire)(x)\\n}\",\n \"func execmInterfaceMethod(_ int, p *gop.Context) {\\n\\targs := p.GetArgs(2)\\n\\tret := args[0].(*types.Interface).Method(args[1].(int))\\n\\tp.Ret(2, ret)\\n}\",\n \"func (lambda PresenterFunc) Render(message interface{}) error {\\n\\treturn lambda(message)\\n}\",\n \"func underlyingInterface(w v1alpha1.ExecutableWorkflow, node v1alpha1.ExecutableNode) (*core.TypedInterface, error) {\\n\\tiface := &core.TypedInterface{}\\n\\tif node.GetTaskID() != nil {\\n\\t\\tt, err := w.GetTask(*node.GetTaskID())\\n\\t\\tif err != nil {\\n\\t\\t\\t// Should never happen\\n\\t\\t\\treturn nil, err\\n\\t\\t}\\n\\n\\t\\tiface.Outputs = t.CoreTask().GetInterface().Outputs\\n\\t} else if wfNode := node.GetWorkflowNode(); wfNode != nil {\\n\\t\\tif wfRef := wfNode.GetSubWorkflowRef(); wfRef != nil {\\n\\t\\t\\tt := w.FindSubWorkflow(*wfRef)\\n\\t\\t\\tif t == nil {\\n\\t\\t\\t\\t// Should never happen\\n\\t\\t\\t\\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \\\"Couldn't find subworkflow [%v].\\\", wfRef)\\n\\t\\t\\t}\\n\\n\\t\\t\\tiface.Outputs = t.GetOutputs().VariableMap\\n\\t\\t} else {\\n\\t\\t\\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \\\"Unknown interface\\\")\\n\\t\\t}\\n\\t} else if node.GetBranchNode() != nil {\\n\\t\\tif ifBlock := node.GetBranchNode().GetIf(); ifBlock != nil && ifBlock.GetThenNode() != nil {\\n\\t\\t\\tbn, found := w.GetNode(*ifBlock.GetThenNode())\\n\\t\\t\\tif !found {\\n\\t\\t\\t\\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \\\"Couldn't find branch node [%v]\\\",\\n\\t\\t\\t\\t\\t*ifBlock.GetThenNode())\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn underlyingInterface(w, bn)\\n\\t\\t}\\n\\n\\t\\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \\\"Empty branch detected.\\\")\\n\\t} else {\\n\\t\\treturn nil, errors.Errorf(errors.IllegalStateError, node.GetID(), \\\"Unknown interface.\\\")\\n\\t}\\n\\n\\treturn iface, nil\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.601801","0.59070253","0.59054166","0.58446676","0.58266926","0.5820728","0.5820728","0.5802115","0.57868934","0.577937","0.57069504","0.5627799","0.5535857","0.5494115","0.5471187","0.5471187","0.5465064","0.5435572","0.54174775","0.54174775","0.5403646","0.5398771","0.535826","0.53455204","0.5325374","0.5281957","0.52587587","0.5246482","0.52396625","0.5171417","0.51708597","0.51699823","0.5150497","0.5102451","0.5098949","0.50967133","0.50936455","0.5027757","0.5014371","0.50071734","0.49832156","0.4978006","0.49501696","0.4947642","0.49169374","0.4905309","0.4905309","0.4886982","0.48809353","0.4865095","0.48484156","0.4842497","0.48256105","0.4806719","0.47928524","0.478826","0.47633818","0.47612065","0.47563323","0.4756313","0.47518948","0.47470203","0.47409767","0.47342384","0.47334284","0.47197035","0.4717382","0.46857443","0.4679505","0.46787944","0.46590173","0.46579817","0.4657036","0.4652146","0.46448997","0.46417892","0.46409145","0.46362963","0.461541","0.46128434","0.46116787","0.46064425","0.46029806","0.45986757","0.45887613","0.4581343","0.45772165","0.45628566","0.4561018","0.45593852","0.4557327","0.4549671","0.45452303","0.45387414","0.45345315","0.45330152","0.45300865","0.45288858","0.45200968"],"string":"[\n \"0.601801\",\n \"0.59070253\",\n \"0.59054166\",\n \"0.58446676\",\n \"0.58266926\",\n \"0.5820728\",\n \"0.5820728\",\n \"0.5802115\",\n \"0.57868934\",\n \"0.577937\",\n \"0.57069504\",\n \"0.5627799\",\n \"0.5535857\",\n \"0.5494115\",\n \"0.5471187\",\n \"0.5471187\",\n \"0.5465064\",\n \"0.5435572\",\n \"0.54174775\",\n \"0.54174775\",\n \"0.5403646\",\n \"0.5398771\",\n \"0.535826\",\n \"0.53455204\",\n \"0.5325374\",\n \"0.5281957\",\n \"0.52587587\",\n \"0.5246482\",\n \"0.52396625\",\n \"0.5171417\",\n \"0.51708597\",\n \"0.51699823\",\n \"0.5150497\",\n \"0.5102451\",\n \"0.5098949\",\n \"0.50967133\",\n \"0.50936455\",\n \"0.5027757\",\n \"0.5014371\",\n \"0.50071734\",\n \"0.49832156\",\n \"0.4978006\",\n \"0.49501696\",\n \"0.4947642\",\n \"0.49169374\",\n \"0.4905309\",\n \"0.4905309\",\n \"0.4886982\",\n \"0.48809353\",\n \"0.4865095\",\n \"0.48484156\",\n \"0.4842497\",\n \"0.48256105\",\n \"0.4806719\",\n \"0.47928524\",\n \"0.478826\",\n \"0.47633818\",\n \"0.47612065\",\n \"0.47563323\",\n \"0.4756313\",\n \"0.47518948\",\n \"0.47470203\",\n \"0.47409767\",\n \"0.47342384\",\n \"0.47334284\",\n \"0.47197035\",\n \"0.4717382\",\n \"0.46857443\",\n \"0.4679505\",\n \"0.46787944\",\n \"0.46590173\",\n \"0.46579817\",\n \"0.4657036\",\n \"0.4652146\",\n \"0.46448997\",\n \"0.46417892\",\n \"0.46409145\",\n \"0.46362963\",\n \"0.461541\",\n \"0.46128434\",\n \"0.46116787\",\n \"0.46064425\",\n \"0.46029806\",\n \"0.45986757\",\n \"0.45887613\",\n \"0.4581343\",\n \"0.45772165\",\n \"0.45628566\",\n \"0.4561018\",\n \"0.45593852\",\n \"0.4557327\",\n \"0.4549671\",\n \"0.45452303\",\n \"0.45387414\",\n \"0.45345315\",\n \"0.45330152\",\n \"0.45300865\",\n \"0.45288858\",\n \"0.45200968\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.56891"},"document_rank":{"kind":"string","value":"12"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":9,"numItemsPerPage":100,"numTotalItems":107511,"offset":900,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4MDc0NDAzNiwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1nby12MSIsImV4cCI6MTc4MDc0NzYzNiwiaXNzIjoiaHR0cHM6Ly9odWdnaW5nZmFjZS5jbyJ9.TOcw8YdfsnQ3zavpgcH9E_e91-6kLSbVggojwlraWcs4e0OJomYcAccdNcjvnMQnXFIdgDfS9oULzF7CpN8FDw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":107511,"numBytesParquet":1880180349}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
query stringlengths 7 3.85k | document stringlengths 11 430k | metadata dict | negatives listlengths 0 101 | negative_scores listlengths 0 101 | document_score stringlengths 3 10 | document_rank stringclasses 102
values |
|---|---|---|---|---|---|---|
LockedCoins returns the set of coins that are not spendable (i.e. locked), defined as the vesting coins that are not delegated. | func (plva PermanentLockedAccount) LockedCoins(_ sdk.Context) sdk.Coins {
return plva.BaseVestingAccount.LockedCoinsFromVesting(plva.OriginalVesting)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (pva PeriodicVestingAccount) LockedCoins(ctx sdk.Context) sdk.Coins {\n\treturn pva.BaseVestingAccount.LockedCoinsFromVesting(pva.GetVestingCoins(ctx.BlockTime()))\n}",
"func (dva DelayedVestingAccount) LockedCoins(ctx sdk.Context) sdk.Coins {\n\treturn dva.BaseVestingAccount.LockedCoinsFromVesting(dva.GetV... | [
"0.75121504",
"0.74375194",
"0.74270487",
"0.7414589",
"0.68385124",
"0.6392496",
"0.61917114",
"0.6113071",
"0.58873636",
"0.58075583",
"0.56814134",
"0.56528914",
"0.56135285",
"0.5559344",
"0.5548731",
"0.54984355",
"0.5480376",
"0.54703814",
"0.5414903",
"0.5400289",
"0.5... | 0.73147166 | 4 |
TrackDelegation tracks a desired delegation amount by setting the appropriate values for the amount of delegated vesting, delegated free, and reducing the overall amount of base coins. | func (plva *PermanentLockedAccount) TrackDelegation(blockTime time.Time, balance, amount sdk.Coins) {
plva.BaseVestingAccount.TrackDelegation(balance, plva.OriginalVesting, amount)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (bva *BaseVestingAccount) TrackDelegation(balance, vestingCoins, amount sdk.Coins) {\n\tfor _, coin := range amount {\n\t\tbaseAmt := balance.AmountOf(coin.Denom)\n\t\tvestingAmt := vestingCoins.AmountOf(coin.Denom)\n\t\tdelVestingAmt := bva.DelegatedVesting.AmountOf(coin.Denom)\n\n\t\t// Panic if the delegat... | [
"0.8186424",
"0.78992194",
"0.7826971",
"0.7759204",
"0.7720231",
"0.7715642",
"0.68331814",
"0.61249405",
"0.57603174",
"0.57438606",
"0.5540563",
"0.5494072",
"0.5373377",
"0.5255798",
"0.5181217",
"0.5127807",
"0.5004754",
"0.49716696",
"0.48736444",
"0.47637394",
"0.47572... | 0.76592255 | 6 |
GetStartTime returns zero since a permanent locked vesting account has no start time. | func (plva PermanentLockedAccount) GetStartTime() int64 {
return 0
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (dva DelayedVestingAccount) GetStartTime() int64 {\n\treturn 0\n}",
"func (va ClawbackVestingAccount) GetStartTime() int64 {\n\treturn va.StartTime\n}",
"func (cva ContinuousVestingAccount) GetStartTime() int64 {\n\treturn cva.StartTime\n}",
"func (pva PeriodicVestingAccount) GetStartTime() int64 {\n\tr... | [
"0.7989411",
"0.77213776",
"0.76390874",
"0.7605982",
"0.7384329",
"0.7244314",
"0.7236585",
"0.7189344",
"0.7175738",
"0.7171928",
"0.7160729",
"0.7008172",
"0.69832927",
"0.6975663",
"0.69752145",
"0.695411",
"0.69208306",
"0.69165504",
"0.6912835",
"0.6835436",
"0.6752777"... | 0.82880247 | 0 |
GetEndTime returns a vesting account's end time, we return 0 to denote that a permanently locked vesting account has no end time. | func (plva PermanentLockedAccount) GetEndTime() int64 {
return 0
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (bva BaseVestingAccount) GetEndTime() int64 {\n\treturn bva.EndTime\n}",
"func (o *ApplianceSetupInfoAllOf) GetEndTime() time.Time {\n\tif o == nil || o.EndTime == nil {\n\t\tvar ret time.Time\n\t\treturn ret\n\t}\n\treturn *o.EndTime\n}",
"func (o *ApplianceClusterInstallPhase) GetEndTime() time.Time {\n... | [
"0.8592755",
"0.7491895",
"0.7327237",
"0.73128647",
"0.7202728",
"0.71574676",
"0.7140883",
"0.7082313",
"0.7063966",
"0.7059457",
"0.69634634",
"0.6931381",
"0.6890082",
"0.67958534",
"0.6728343",
"0.67127305",
"0.67088944",
"0.6631116",
"0.6616934",
"0.6547994",
"0.6525623... | 0.8543022 | 1 |
Validate checks for errors on the account fields | func (plva PermanentLockedAccount) Validate() error {
if plva.EndTime > 0 {
return errors.New("permanently vested accounts cannot have an end-time")
}
return plva.BaseVestingAccount.Validate()
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (account *Account) Validate() (map[string]interface{}, bool) {\n\n\tif !strings.Contains(account.Phone, \"+\") {\n\t\treturn u.Message(false, \"Phone Number address is required\"), false\n\t}\n\n\tif len(account.UserName) < 3 {\n\t\treturn u.Message(false, \"Username is required\"), false\n\t}\n\n\t//PhoneNum... | [
"0.6950377",
"0.6660194",
"0.6604518",
"0.660115",
"0.6589453",
"0.6474401",
"0.6469365",
"0.6463922",
"0.64215875",
"0.63889915",
"0.6362919",
"0.63358384",
"0.6252108",
"0.62329525",
"0.6229978",
"0.61784095",
"0.61675555",
"0.61494285",
"0.6107046",
"0.6084981",
"0.6062506... | 0.0 | -1 |
NewClawbackVestingAccount returns a new ClawbackVestingAccount | func NewClawbackVestingAccount(baseAcc *authtypes.BaseAccount, funder sdk.AccAddress, originalVesting sdk.Coins, startTime int64, lockupPeriods, vestingPeriods Periods) *ClawbackVestingAccount {
// copy and align schedules to avoid mutating inputs
lp := make(Periods, len(lockupPeriods))
copy(lp, lockupPeriods)
vp :... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func MakeNewAccount(name string) (*MyAccount, error) {\n\tkeys, err := NewKeypair()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn &MyAccount{\n\t\tFields: make(map[string]string),\n\t\tKeys: keys,\n\t\tName: name,\n\t}, nil\n}",
"func (c *CoinTest) newAccount(stub shim.ChaincodeStubInterface, args... | [
"0.63165385",
"0.62145144",
"0.6156019",
"0.6112193",
"0.60393506",
"0.6007511",
"0.5856643",
"0.58285093",
"0.58285093",
"0.5770267",
"0.56909066",
"0.561485",
"0.551723",
"0.5479558",
"0.54709643",
"0.54680747",
"0.5435082",
"0.54297704",
"0.5414012",
"0.54114395",
"0.54044... | 0.75940603 | 0 |
GetVestedCoins returns the total number of vested coins. If no coins are vested, nil is returned. | func (va ClawbackVestingAccount) GetVestedCoins(blockTime time.Time) sdk.Coins {
// It's likely that one or the other schedule will be nearly trivial,
// so there should be little overhead in recomputing the conjunction each time.
coins := coinsMin(va.GetUnlockedOnly(blockTime), va.GetVestedOnly(blockTime))
if coin... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (plva PermanentLockedAccount) GetVestedCoins(_ time.Time) sdk.Coins {\n\treturn nil\n}",
"func (pva PeriodicVestingAccount) GetVestedCoins(blockTime time.Time) sdk.Coins {\n\tcoins := ReadSchedule(pva.StartTime, pva.EndTime, pva.VestingPeriods, pva.OriginalVesting, blockTime.Unix())\n\tif coins.IsZero() {\n... | [
"0.74722266",
"0.73172396",
"0.72161824",
"0.706704",
"0.6925188",
"0.6750736",
"0.67176706",
"0.66681737",
"0.6615126",
"0.660531",
"0.64609796",
"0.5631008",
"0.5568076",
"0.55106115",
"0.54429114",
"0.5325035",
"0.52657974",
"0.5237786",
"0.51828796",
"0.51632583",
"0.5131... | 0.72799873 | 2 |
GetVestingCoins returns the total number of vesting coins. If no coins are vesting, nil is returned. | func (va ClawbackVestingAccount) GetVestingCoins(blockTime time.Time) sdk.Coins {
return va.OriginalVesting.Sub(va.GetVestedCoins(blockTime))
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (vva ValidatorVestingAccount) GetVestingCoins(blockTime time.Time) sdk.Coins {\n\treturn vva.OriginalVesting.Sub(vva.GetVestedCoins(blockTime))\n}",
"func (cva ContinuousVestingAccount) GetVestingCoins(blockTime time.Time) sdk.Coins {\n\treturn cva.OriginalVesting.Sub(cva.GetVestedCoins(blockTime))\n}",
"... | [
"0.74396104",
"0.726373",
"0.714508",
"0.7126855",
"0.7010945",
"0.670897",
"0.66787076",
"0.66363263",
"0.6620459",
"0.65084815",
"0.6413031",
"0.5598332",
"0.55388",
"0.5478214",
"0.5397174",
"0.535151",
"0.53034747",
"0.5291319",
"0.5265547",
"0.5263068",
"0.52396154",
"... | 0.72693485 | 1 |
LockedCoins returns the set of coins that are not spendable (i.e. locked), defined as the vesting coins that are not delegated. | func (va ClawbackVestingAccount) LockedCoins(ctx sdk.Context) sdk.Coins {
return va.BaseVestingAccount.LockedCoinsFromVesting(va.GetVestingCoins(ctx.BlockTime()))
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (pva PeriodicVestingAccount) LockedCoins(ctx sdk.Context) sdk.Coins {\n\treturn pva.BaseVestingAccount.LockedCoinsFromVesting(pva.GetVestingCoins(ctx.BlockTime()))\n}",
"func (dva DelayedVestingAccount) LockedCoins(ctx sdk.Context) sdk.Coins {\n\treturn dva.BaseVestingAccount.LockedCoinsFromVesting(dva.GetV... | [
"0.75121504",
"0.74375194",
"0.74270487",
"0.73147166",
"0.68385124",
"0.6392496",
"0.61917114",
"0.6113071",
"0.58873636",
"0.58075583",
"0.56814134",
"0.56528914",
"0.56135285",
"0.5559344",
"0.5548731",
"0.54984355",
"0.5480376",
"0.54703814",
"0.5414903",
"0.5400289",
"0.... | 0.7414589 | 3 |
TrackDelegation tracks a desired delegation amount by setting the appropriate values for the amount of delegated vesting, delegated free, and reducing the overall amount of base coins. | func (va *ClawbackVestingAccount) TrackDelegation(blockTime time.Time, balance, amount sdk.Coins) {
va.BaseVestingAccount.TrackDelegation(balance, va.GetVestingCoins(blockTime), amount)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (bva *BaseVestingAccount) TrackDelegation(balance, vestingCoins, amount sdk.Coins) {\n\tfor _, coin := range amount {\n\t\tbaseAmt := balance.AmountOf(coin.Denom)\n\t\tvestingAmt := vestingCoins.AmountOf(coin.Denom)\n\t\tdelVestingAmt := bva.DelegatedVesting.AmountOf(coin.Denom)\n\n\t\t// Panic if the delegat... | [
"0.8186424",
"0.78992194",
"0.7826971",
"0.7759204",
"0.7720231",
"0.76592255",
"0.68331814",
"0.61249405",
"0.57603174",
"0.57438606",
"0.5540563",
"0.5494072",
"0.5373377",
"0.5255798",
"0.5181217",
"0.5127807",
"0.5004754",
"0.49716696",
"0.48736444",
"0.47637394",
"0.4757... | 0.7715642 | 5 |
GetStartTime returns the time when vesting starts for a periodic vesting account. | func (va ClawbackVestingAccount) GetStartTime() int64 {
return va.StartTime
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (pva PeriodicVestingAccount) GetStartTime() int64 {\n\treturn pva.StartTime\n}",
"func (dva DelayedVestingAccount) GetStartTime() int64 {\n\treturn 0\n}",
"func (cva ContinuousVestingAccount) GetStartTime() int64 {\n\treturn cva.StartTime\n}",
"func GetStartTime() time.Time {\n\treturn startAtTime\n}",
... | [
"0.7675311",
"0.7655725",
"0.7410766",
"0.72879225",
"0.7022617",
"0.6954567",
"0.6840737",
"0.6801517",
"0.6740562",
"0.66733193",
"0.6625888",
"0.6578882",
"0.65752226",
"0.656922",
"0.6512452",
"0.64991933",
"0.6462216",
"0.6451606",
"0.64373773",
"0.6424162",
"0.64052635"... | 0.7509543 | 2 |
GetVestingPeriods returns vesting periods associated with periodic vesting account. | func (va ClawbackVestingAccount) GetVestingPeriods() Periods {
return va.VestingPeriods
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (pva PeriodicVestingAccount) GetVestingPeriods() Periods {\n\treturn pva.VestingPeriods\n}",
"func NewPeriodicVestingAccount(baseAcc *authtypes.BaseAccount, originalVesting sdk.Coins, startTime int64, periods Periods) *PeriodicVestingAccount {\n\tendTime := startTime\n\tfor _, p := range periods {\n\t\tendT... | [
"0.82607967",
"0.53933996",
"0.51751536",
"0.5136177",
"0.5023484",
"0.49357113",
"0.4917464",
"0.47208306",
"0.47143596",
"0.45715773",
"0.45275274",
"0.45155838",
"0.44273278",
"0.44169536",
"0.44071308",
"0.43515027",
"0.42970163",
"0.41897523",
"0.41696903",
"0.41315487",
... | 0.8009713 | 1 |
coinEq returns whether two Coins are equal. The IsEqual() method can panic. | func coinEq(a, b sdk.Coins) bool {
return a.IsAllLTE(b) && b.IsAllLTE(a)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (coin Coin) IsEqual(other Coin) bool {\n\treturn coin.Amount.Equal(other.Amount)\n}",
"func (v Coin) Equal(o Coin) bool {\n\treturn v.Amount.Equal(o.Amount) &&\n\t\tv.CoinIdentifier.Equal(o.CoinIdentifier)\n}",
"func (n *Uint256) Eq(n2 *Uint256) bool {\n\treturn n.n[0] == n2.n[0] && n.n[1] == n2.n[1] && n... | [
"0.70465946",
"0.6923523",
"0.60608363",
"0.60347974",
"0.6028179",
"0.60094017",
"0.5901305",
"0.58853287",
"0.58778554",
"0.5840299",
"0.58085173",
"0.5762222",
"0.5661418",
"0.5580482",
"0.5563641",
"0.5520213",
"0.54485756",
"0.5405266",
"0.54030937",
"0.5394832",
"0.5368... | 0.74850535 | 0 |
Validate checks for errors on the account fields | func (va ClawbackVestingAccount) Validate() error {
if va.GetStartTime() >= va.GetEndTime() {
return errors.New("vesting start-time must be before end-time")
}
lockupEnd := va.StartTime
lockupCoins := sdk.NewCoins()
for _, p := range va.LockupPeriods {
lockupEnd += p.Length
lockupCoins = lockupCoins.Add(p.A... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (account *Account) Validate() (map[string]interface{}, bool) {\n\n\tif !strings.Contains(account.Phone, \"+\") {\n\t\treturn u.Message(false, \"Phone Number address is required\"), false\n\t}\n\n\tif len(account.UserName) < 3 {\n\t\treturn u.Message(false, \"Username is required\"), false\n\t}\n\n\t//PhoneNum... | [
"0.6950377",
"0.6660194",
"0.6604518",
"0.660115",
"0.6589453",
"0.6474401",
"0.6469365",
"0.6463922",
"0.64215875",
"0.63889915",
"0.6362919",
"0.63358384",
"0.6252108",
"0.62329525",
"0.6229978",
"0.61784095",
"0.61675555",
"0.61494285",
"0.6107046",
"0.6084981",
"0.6062506... | 0.5430431 | 71 |
MarshalYAML returns the YAML representation of a ClawbackVestingAccount. | func (va ClawbackVestingAccount) MarshalYAML() (interface{}, error) {
accAddr, err := sdk.AccAddressFromBech32(va.Address)
if err != nil {
return nil, err
}
out := vestingAccountYAML{
Address: accAddr,
AccountNumber: va.AccountNumber,
PubKey: getPKString(va),
Sequence: va.Se... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (bva BaseVestingAccount) MarshalYAML() (interface{}, error) {\n\taccAddr, err := sdk.AccAddressFromBech32(bva.Address)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tout := vestingAccountYAML{\n\t\tAddress: accAddr,\n\t\tAccountNumber: bva.AccountNumber,\n\t\tPubKey: getPKString(bva),... | [
"0.81687456",
"0.8013179",
"0.78075606",
"0.77150255",
"0.63062006",
"0.6222024",
"0.61517715",
"0.6118727",
"0.60633063",
"0.60269654",
"0.5953029",
"0.5952517",
"0.5855554",
"0.5855083",
"0.5827823",
"0.5779316",
"0.5734564",
"0.571303",
"0.5689044",
"0.5630494",
"0.5589824... | 0.848191 | 0 |
NewClawbackGrantAction returns an AddGrantAction for a ClawbackVestingAccount. | func NewClawbackGrantAction(
funderAddress string,
sk StakingKeeper,
grantStartTime int64,
grantLockupPeriods, grantVestingPeriods []Period,
grantCoins sdk.Coins,
) exported.AddGrantAction {
return clawbackGrantAction{
funderAddress: funderAddress,
sk: sk,
grantStartTime: grantSt... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func NewClawbackAction(requestor, dest sdk.AccAddress, ak AccountKeeper, bk BankKeeper, sk StakingKeeper) exported.ClawbackAction {\n\treturn clawbackAction{\n\t\trequestor: requestor,\n\t\tdest: dest,\n\t\tak: ak,\n\t\tbk: bk,\n\t\tsk: sk,\n\t}\n}",
"func NewClawbackRewardAction(ak Acc... | [
"0.64638203",
"0.61863166",
"0.5534939",
"0.529289",
"0.5087931",
"0.50345194",
"0.47454304",
"0.46657106",
"0.4555626",
"0.4545793",
"0.45320782",
"0.44856998",
"0.4456182",
"0.4451843",
"0.43959028",
"0.43657944",
"0.43611333",
"0.4357266",
"0.43521774",
"0.43518445",
"0.43... | 0.7976986 | 0 |
AddToAccount implements the exported.AddGrantAction interface. It checks that rawAccount is a ClawbackVestingAccount with the same funder and adds the described Grant to it. | func (cga clawbackGrantAction) AddToAccount(ctx sdk.Context, rawAccount exported.VestingAccount) error {
cva, ok := rawAccount.(*ClawbackVestingAccount)
if !ok {
return sdkerrors.Wrapf(sdkerrors.ErrNotSupported,
"account %s must be a ClawbackVestingAccount, got %T",
rawAccount.GetAddress(), rawAccount)
}
if... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (pga periodicGrantAction) AddToAccount(ctx sdk.Context, rawAccount exported.VestingAccount) error {\n\tpva, ok := rawAccount.(*PeriodicVestingAccount)\n\tif !ok {\n\t\treturn sdkerrors.Wrapf(sdkerrors.ErrNotSupported,\n\t\t\t\"account %s must be a PeriodicVestingAccount, got %T\",\n\t\t\trawAccount.GetAddress... | [
"0.70387936",
"0.6084376",
"0.58506024",
"0.5656218",
"0.5626727",
"0.5414569",
"0.5300817",
"0.51898015",
"0.511495",
"0.50976485",
"0.5083623",
"0.5055534",
"0.49965897",
"0.48901007",
"0.48723358",
"0.48572427",
"0.48206356",
"0.4800977",
"0.4778801",
"0.47696823",
"0.4769... | 0.7568594 | 0 |
addGrant merges a new clawback vesting grant into an existing ClawbackVestingAccount. | func (va *ClawbackVestingAccount) addGrant(ctx sdk.Context, sk StakingKeeper, grantStartTime int64, grantLockupPeriods, grantVestingPeriods []Period, grantCoins sdk.Coins) {
// how much is really delegated?
bondedAmt := sk.GetDelegatorBonded(ctx, va.GetAddress())
unbondingAmt := sk.GetDelegatorUnbonding(ctx, va.GetA... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (pva *PeriodicVestingAccount) AddGrant(ctx sdk.Context, action exported.AddGrantAction) error {\n\treturn action.AddToAccount(ctx, pva)\n}",
"func (pva *PeriodicVestingAccount) addGrant(ctx sdk.Context, sk StakingKeeper, grantStartTime int64, grantVestingPeriods []Period, grantCoins sdk.Coins) {\n\t// how m... | [
"0.7331163",
"0.7113666",
"0.55019873",
"0.5447035",
"0.54171383",
"0.539944",
"0.53757775",
"0.528504",
"0.5252317",
"0.52441466",
"0.52223444",
"0.5207451",
"0.5137339",
"0.51206416",
"0.50980806",
"0.5086144",
"0.49832323",
"0.49606624",
"0.4951147",
"0.49187273",
"0.48713... | 0.73836535 | 0 |
GetFunder implements the exported.ClawbackVestingAccountI interface. | func (va ClawbackVestingAccount) GetFunder() sdk.AccAddress {
addr, err := sdk.AccAddressFromBech32(va.FunderAddress)
if err != nil {
panic(err)
}
return addr
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (svc *Service) GetFundsForProposalByFunder(req client.GetFundsForProposalByFunderRequest, reply *client.GetFundsForProposalByFunderReply) error {\n\t// Validate parameters\n\terr := req.Funder.Err()\n\tif err != nil {\n\t\treturn errors.New(\"invalid funder address\")\n\t}\n\n\tamount := svc.proposalMaster.Pr... | [
"0.52361333",
"0.5219271",
"0.5107116",
"0.49333978",
"0.48144346",
"0.47565222",
"0.47532547",
"0.46947348",
"0.46947348",
"0.46947348",
"0.46271998",
"0.46200928",
"0.45988363",
"0.4598473",
"0.45913786",
"0.4580138",
"0.45723897",
"0.4563494",
"0.45597363",
"0.45284525",
"... | 0.82736015 | 0 |
GetUnlockedOnly implements the exported.ClawbackVestingAccountI interface. It returns the unlocking schedule at blockTIme. Like GetVestedCoins, but only for the lockup component. | func (va ClawbackVestingAccount) GetUnlockedOnly(blockTime time.Time) sdk.Coins {
return ReadSchedule(va.StartTime, va.EndTime, va.LockupPeriods, va.OriginalVesting, blockTime.Unix())
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (va ClawbackVestingAccount) GetVestedOnly(blockTime time.Time) sdk.Coins {\n\treturn ReadSchedule(va.StartTime, va.EndTime, va.VestingPeriods, va.OriginalVesting, blockTime.Unix())\n}",
"func (_Constants *ConstantsCallerSession) UnstakeLockPeriod() (*big.Int, error) {\n\treturn _Constants.Contract.UnstakeLo... | [
"0.67690635",
"0.5902726",
"0.5877758",
"0.5756858",
"0.5283301",
"0.5265267",
"0.5147104",
"0.5132386",
"0.5092646",
"0.50746304",
"0.50555545",
"0.50017166",
"0.49906853",
"0.49503067",
"0.49447116",
"0.49404284",
"0.4913754",
"0.49131387",
"0.4903401",
"0.4901039",
"0.4900... | 0.8647829 | 0 |
GetVestedOnly implements the exported.ClawbackVestingAccountI interface. It returns the vesting schedule and blockTime. Like GetVestedCoins, but only for the vesting (in the clawback sense) component. | func (va ClawbackVestingAccount) GetVestedOnly(blockTime time.Time) sdk.Coins {
return ReadSchedule(va.StartTime, va.EndTime, va.VestingPeriods, va.OriginalVesting, blockTime.Unix())
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (va ClawbackVestingAccount) GetVestedCoins(blockTime time.Time) sdk.Coins {\n\t// It's likely that one or the other schedule will be nearly trivial,\n\t// so there should be little overhead in recomputing the conjunction each time.\n\tcoins := coinsMin(va.GetUnlockedOnly(blockTime), va.GetVestedOnly(blockTime... | [
"0.67785037",
"0.67503226",
"0.66144603",
"0.6596947",
"0.65359217",
"0.6487381",
"0.64839846",
"0.64474326",
"0.64271235",
"0.64212775",
"0.6202558",
"0.61998135",
"0.6146275",
"0.5791093",
"0.52322394",
"0.50997275",
"0.5037106",
"0.5030548",
"0.49749142",
"0.49297792",
"0.... | 0.8709211 | 0 |
computeClawback removes all future vesting events from the account, returns the total sum of these events. When removing the future vesting events, the lockup schedule will also have to be capped to keep the total sums the same. (But future unlocking events might be preserved if they unlock currently vested coins.) If ... | func (va *ClawbackVestingAccount) computeClawback(clawbackTime int64) sdk.Coins {
// Compute the truncated vesting schedule and amounts.
// Work with the schedule as the primary data and recompute derived fields, e.g. OriginalVesting.
vestTime := va.StartTime
totalVested := sdk.NewCoins()
totalUnvested := sdk.NewC... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (va *ClawbackVestingAccount) clawback(ctx sdk.Context, dest sdk.AccAddress, ak AccountKeeper, bk BankKeeper, sk StakingKeeper) error {\n\t// Compute the clawback based on the account state only, and update account\n\ttoClawBack := va.computeClawback(ctx.BlockTime().Unix())\n\tif toClawBack.IsZero() {\n\t\tret... | [
"0.6719768",
"0.5626019",
"0.5324699",
"0.52189773",
"0.5140744",
"0.50596994",
"0.5059033",
"0.504977",
"0.48822775",
"0.48712832",
"0.4870118",
"0.48615333",
"0.48471743",
"0.4828697",
"0.48089796",
"0.4786879",
"0.47522268",
"0.4720129",
"0.47145593",
"0.47144145",
"0.4701... | 0.80608404 | 0 |
updateDelegation returns an account with its delegation bookkeeping modified for clawback, given the current disposition of the account's bank and staking state. Also returns the modified amount to claw back. Computation steps: first, compute the total amount in bonded and unbonding states, used for BaseAccount bookkee... | func (va *ClawbackVestingAccount) updateDelegation(encumbered, toClawBack, bonded, unbonding, unbonded sdk.Coins) sdk.Coins {
delegated := bonded.Add(unbonding...)
oldDelegated := va.DelegatedVesting.Add(va.DelegatedFree...)
slashed := oldDelegated.Sub(coinsMin(delegated, oldDelegated))
total := delegated.Add(unbon... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (k Keeper) TransferDelegation(ctx sdk.Context, valAddr sdk.ValAddress, fromDelegator, toDelegator sdk.AccAddress, shares sdk.Dec) (sdk.Dec, error) {\n\t// Redelegations link a delegation to it's previous validator so slashes are propagated to the new validator.\n\t// If the delegation is transferred to a new ... | [
"0.63843423",
"0.6348469",
"0.63280714",
"0.6127292",
"0.6099896",
"0.59851784",
"0.5903084",
"0.5901659",
"0.58393365",
"0.57900774",
"0.5761572",
"0.5679458",
"0.5625733",
"0.562472",
"0.55934227",
"0.5562052",
"0.55510765",
"0.5547109",
"0.55152845",
"0.55124575",
"0.54277... | 0.8535179 | 0 |
NewClawbackAction returns an exported.ClawbackAction for ClawbackVestingAccount. | func NewClawbackAction(requestor, dest sdk.AccAddress, ak AccountKeeper, bk BankKeeper, sk StakingKeeper) exported.ClawbackAction {
return clawbackAction{
requestor: requestor,
dest: dest,
ak: ak,
bk: bk,
sk: sk,
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func NewClawbackGrantAction(\n\tfunderAddress string,\n\tsk StakingKeeper,\n\tgrantStartTime int64,\n\tgrantLockupPeriods, grantVestingPeriods []Period,\n\tgrantCoins sdk.Coins,\n) exported.AddGrantAction {\n\treturn clawbackGrantAction{\n\t\tfunderAddress: funderAddress,\n\t\tsk: sk,\n\t\tg... | [
"0.734408",
"0.724161",
"0.60927427",
"0.5704581",
"0.54267293",
"0.5386312",
"0.51870364",
"0.5036263",
"0.50139284",
"0.49548915",
"0.4951062",
"0.49484608",
"0.4876492",
"0.48602346",
"0.4833887",
"0.48318735",
"0.48297027",
"0.47833982",
"0.4767467",
"0.47623938",
"0.4719... | 0.8150347 | 0 |
TakeFromAccount implements the exported.ClawbackAction interface. It returns an error if the account is not at ClawbackVestingAccount or if the funder does not match. | func (ca clawbackAction) TakeFromAccount(ctx sdk.Context, rawAccount exported.VestingAccount) error {
cva, ok := rawAccount.(*ClawbackVestingAccount)
if !ok {
return sdkerrors.Wrapf(sdkerrors.ErrNotSupported, "clawback expects *ClawbackVestingAccount, got %T", rawAccount)
}
if ca.requestor.String() != cva.FunderA... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (va *ClawbackVestingAccount) clawback(ctx sdk.Context, dest sdk.AccAddress, ak AccountKeeper, bk BankKeeper, sk StakingKeeper) error {\n\t// Compute the clawback based on the account state only, and update account\n\ttoClawBack := va.computeClawback(ctx.BlockTime().Unix())\n\tif toClawBack.IsZero() {\n\t\tret... | [
"0.6373067",
"0.61946815",
"0.52225226",
"0.5115219",
"0.5063567",
"0.50280553",
"0.50247216",
"0.5002626",
"0.49813092",
"0.49658814",
"0.4900447",
"0.48946452",
"0.48875058",
"0.48761022",
"0.48605388",
"0.48496777",
"0.48311484",
"0.48254326",
"0.48169035",
"0.48071176",
"... | 0.8336627 | 0 |
Clawback transfers unvested tokens in a ClawbackVestingAccount to dest. Future vesting events are removed. Unstaked tokens are simply sent. Unbonding and staked tokens are transferred with their staking state intact. Account state is updated to reflect the removals. | func (va *ClawbackVestingAccount) clawback(ctx sdk.Context, dest sdk.AccAddress, ak AccountKeeper, bk BankKeeper, sk StakingKeeper) error {
// Compute the clawback based on the account state only, and update account
toClawBack := va.computeClawback(ctx.BlockTime().Unix())
if toClawBack.IsZero() {
return nil
}
ad... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (_SweetToken *SweetTokenTransactor) Transfer(opts *bind.TransactOpts, dst common.Address, wad *big.Int) (*types.Transaction, error) {\n\treturn _SweetToken.contract.Transact(opts, \"transfer\", dst, wad)\n}",
"func (_SweetToken *SweetTokenSession) Transfer(dst common.Address, wad *big.Int) (*types.Transacti... | [
"0.59044206",
"0.58445424",
"0.58438736",
"0.5824221",
"0.5764436",
"0.5750469",
"0.5714623",
"0.5655064",
"0.5607176",
"0.5605843",
"0.55872256",
"0.5583866",
"0.556326",
"0.55429995",
"0.5541394",
"0.5541394",
"0.55385965",
"0.5532491",
"0.552686",
"0.55218875",
"0.5501367"... | 0.61959475 | 0 |
distributeReward adds the reward to the future vesting schedule in proportion to the future vesting staking tokens. | func (va ClawbackVestingAccount) distributeReward(ctx sdk.Context, ak AccountKeeper, bondDenom string, reward sdk.Coins) {
now := ctx.BlockTime().Unix()
t := va.StartTime
firstUnvestedPeriod := 0
unvestedTokens := sdk.ZeroInt()
for i, period := range va.VestingPeriods {
t += period.Length
if t <= now {
firs... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (_BondedECDSAKeep *BondedECDSAKeepTransactor) DistributeETHReward(opts *bind.TransactOpts) (*types.Transaction, error) {\n\treturn _BondedECDSAKeep.contract.Transact(opts, \"distributeETHReward\")\n}",
"func (_BondedECDSAKeep *BondedECDSAKeepTransactorSession) DistributeETHReward() (*types.Transaction, erro... | [
"0.6758821",
"0.64290905",
"0.6397762",
"0.63100404",
"0.60241735",
"0.59990525",
"0.59793544",
"0.5928813",
"0.585137",
"0.57938814",
"0.5633375",
"0.5522693",
"0.54059565",
"0.537793",
"0.5369064",
"0.5322376",
"0.5290096",
"0.52899516",
"0.5289859",
"0.52838886",
"0.528256... | 0.7879191 | 0 |
scaleCoins scales the given coins, rounding down. | func scaleCoins(coins sdk.Coins, scale sdk.Dec) sdk.Coins {
scaledCoins := sdk.NewCoins()
for _, coin := range coins {
amt := coin.Amount.ToDec().Mul(scale).TruncateInt() // round down
scaledCoins = scaledCoins.Add(sdk.NewCoin(coin.Denom, amt))
}
return scaledCoins
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (blk *Block) Scale(sx, sy float64) {\n\tops := contentstream.NewContentCreator().\n\t\tScale(sx, sy).\n\t\tOperations()\n\n\t*blk.contents = append(*ops, *blk.contents...)\n\tblk.contents.WrapIfNeeded()\n\n\tblk.width *= sx\n\tblk.height *= sy\n}",
"func (k Keeper) MintCoins(ctx sdk.Context, newCoins sdk.Co... | [
"0.53646266",
"0.5312407",
"0.5284086",
"0.5185207",
"0.51215756",
"0.50750524",
"0.5065373",
"0.50019264",
"0.49968642",
"0.49823198",
"0.49739826",
"0.48987997",
"0.4869174",
"0.48599055",
"0.4815493",
"0.48011187",
"0.47879016",
"0.47696072",
"0.47589323",
"0.47524524",
"0... | 0.8575942 | 0 |
intMin returns the minimum of its arguments. | func intMin(a, b sdk.Int) sdk.Int {
if a.GT(b) {
return b
}
return a
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func MinInt(a ...int) int {\n\tswitch len(a) {\n\tcase 0:\n\t\treturn 0\n\tcase 1:\n\t\treturn a[0]\n\tcase 2:\n\t\tif a[0] > a[1] {\n\t\t\treturn a[1]\n\t\t} else {\n\t\t\treturn a[0]\n\t\t}\n\tdefault:\n\t\tmin := math.MaxInt32\n\t\tfor _, i := range a {\n\t\t\tif i < min {\n\t\t\t\tmin = i\n\t\t\t}\n\t\t}\n\t\t... | [
"0.84761566",
"0.83848757",
"0.83676636",
"0.8266599",
"0.8205421",
"0.8192152",
"0.8164177",
"0.8159744",
"0.8159744",
"0.8159744",
"0.81228924",
"0.80882347",
"0.8054223",
"0.8054223",
"0.8051462",
"0.8035539",
"0.80338305",
"0.80289274",
"0.80289274",
"0.80289274",
"0.8028... | 0.78345966 | 36 |
NewClawbackRewardAction returns an exported.RewardAction for a ClawbackVestingAccount. | func NewClawbackRewardAction(ak AccountKeeper, bk BankKeeper, sk StakingKeeper) exported.RewardAction {
return clawbackRewardAction{
ak: ak,
bk: bk,
sk: sk,
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func NewClawbackAction(requestor, dest sdk.AccAddress, ak AccountKeeper, bk BankKeeper, sk StakingKeeper) exported.ClawbackAction {\n\treturn clawbackAction{\n\t\trequestor: requestor,\n\t\tdest: dest,\n\t\tak: ak,\n\t\tbk: bk,\n\t\tsk: sk,\n\t}\n}",
"func NewClawbackGrantAction(\n\tfun... | [
"0.7404201",
"0.6953166",
"0.5464461",
"0.53948647",
"0.5364549",
"0.52774936",
"0.5242982",
"0.51873976",
"0.5161824",
"0.51156837",
"0.5114475",
"0.5087842",
"0.5044298",
"0.4955228",
"0.49131867",
"0.48881137",
"0.4860685",
"0.48492974",
"0.48389384",
"0.48261693",
"0.4807... | 0.8147421 | 0 |
ProcessReward implements the exported.RewardAction interface. | func (cra clawbackRewardAction) ProcessReward(ctx sdk.Context, reward sdk.Coins, rawAccount exported.VestingAccount) error {
cva, ok := rawAccount.(*ClawbackVestingAccount)
if !ok {
return sdkerrors.Wrapf(sdkerrors.ErrNotSupported, "expected *ClawbackVestingAccount, got %T", rawAccount)
}
cva.postReward(ctx, rewa... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (vi *votedInfo) CalculateReward(multiplier, divider *big.Int, period int) {\n\tif multiplier.Sign() == 0 || period == 0 {\n\t\treturn\n\t}\n\tif divider.Sign() == 0 || vi.totalBondedDelegation.Sign() == 0 {\n\t\treturn\n\t}\n\t// reward = multiplier * period * bondedDelegation / (divider * totalBondedDelegati... | [
"0.6228627",
"0.6163718",
"0.60478336",
"0.603172",
"0.6024607",
"0.5981112",
"0.5969014",
"0.59682953",
"0.59496",
"0.59159184",
"0.5895051",
"0.5894164",
"0.5851955",
"0.5822973",
"0.57389563",
"0.56443095",
"0.5625199",
"0.5603768",
"0.5591688",
"0.55578643",
"0.5497458",
... | 0.78040135 | 0 |
PostReward implements the exported.ClawbackVestingAccountI interface. | func (va *ClawbackVestingAccount) PostReward(ctx sdk.Context, reward sdk.Coins, action exported.RewardAction) error {
return action.ProcessReward(ctx, reward, va)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (va ClawbackVestingAccount) postReward(ctx sdk.Context, reward sdk.Coins, ak AccountKeeper, bk BankKeeper, sk StakingKeeper) {\n\t// Find the scheduled amount of vested and unvested staking tokens\n\tbondDenom := sk.BondDenom(ctx)\n\tvested := ReadSchedule(va.StartTime, va.EndTime, va.VestingPeriods, va.Origi... | [
"0.7498109",
"0.6607101",
"0.5900165",
"0.574824",
"0.5748048",
"0.5657382",
"0.5594524",
"0.5589504",
"0.55825084",
"0.54884845",
"0.54612577",
"0.525241",
"0.5206265",
"0.5183272",
"0.5154278",
"0.5114508",
"0.510423",
"0.5094205",
"0.5076016",
"0.5053601",
"0.5036061",
"... | 0.85944164 | 0 |
postReward encumbers a previouslydeposited reward according to the current vesting apportionment of staking. Note that rewards might be unvested, but are unlocked. | func (va ClawbackVestingAccount) postReward(ctx sdk.Context, reward sdk.Coins, ak AccountKeeper, bk BankKeeper, sk StakingKeeper) {
// Find the scheduled amount of vested and unvested staking tokens
bondDenom := sk.BondDenom(ctx)
vested := ReadSchedule(va.StartTime, va.EndTime, va.VestingPeriods, va.OriginalVesting,... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (va *ClawbackVestingAccount) PostReward(ctx sdk.Context, reward sdk.Coins, action exported.RewardAction) error {\n\treturn action.ProcessReward(ctx, reward, va)\n}",
"func (va ClawbackVestingAccount) distributeReward(ctx sdk.Context, ak AccountKeeper, bondDenom string, reward sdk.Coins) {\n\tnow := ctx.Bloc... | [
"0.7543883",
"0.6046861",
"0.59213",
"0.5888484",
"0.569692",
"0.5377273",
"0.53159016",
"0.51158017",
"0.5068981",
"0.49706677",
"0.49703842",
"0.49670628",
"0.49598822",
"0.49169713",
"0.49141806",
"0.49058503",
"0.49056473",
"0.48940882",
"0.48806125",
"0.4861055",
"0.4859... | 0.7991568 | 0 |
handle first http connect, and convert connect to websocket | func (ws *WS)HandleConn(conn net.Conn, authConn *AuthConns, dealmsg func([]byte)bool){
defer conn.Close()
buf := make([]byte, 1024)
bufChan := make(chan []byte, 10)
defer close(bufChan)
go ws.HandleWS(bufChan, authConn, dealmsg)
for{
_, err := conn.Read(buf)
if err != nil{
if err != io.EOF{ //if client ws ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func serveWebSocket(w http.ResponseWriter, r *http.Request){\n if r.Method != \"GET\" {\n http.Error(w, \"Method not allowed\", 405)\n return\n }\n ws, err := upgrader.Upgrade(w, r, nil)\n if err != nil {\n log.Println(err)\n return\n }\n c := &Connection{send: make(ch... | [
"0.6909302",
"0.68113315",
"0.6766838",
"0.6753222",
"0.6626202",
"0.66035175",
"0.6556864",
"0.6526347",
"0.65038013",
"0.64528245",
"0.64516246",
"0.6439596",
"0.6414564",
"0.6411506",
"0.6399498",
"0.63830733",
"0.6383055",
"0.63786024",
"0.63679075",
"0.6355151",
"0.63472... | 0.58464557 | 97 |
NewDiamond builds a new diamond instance. The default diamond gets populated with a random KSUID as diamondID. Default diamond has cnflicts handling enabled. | func NewDiamond(repo string, stores context2.Stores, opts ...DiamondOption) *Diamond {
diamond := defaultDiamond(repo, stores)
for _, apply := range opts {
apply(diamond)
}
if diamond.deconflicter == nil {
// points to the appropriate metadata path rendering function from model,
// depending on the conflicts... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func CreateDiamond(repo string, stores context2.Stores, opts ...DiamondOption) (model.DiamondDescriptor, error) {\n\tvar err error\n\td := NewDiamond(repo, stores, opts...)\n\n\tdefer func(t0 time.Time) {\n\t\tif d.MetricsEnabled() {\n\t\t\td.m.Usage.UsedAll(t0, \"CreateDiamond\")(err)\n\t\t}\n\t}(time.Now())\n\n\... | [
"0.6531112",
"0.6350572",
"0.62973064",
"0.58797884",
"0.5780172",
"0.5770052",
"0.5733969",
"0.5599219",
"0.55495274",
"0.5385128",
"0.52965933",
"0.5290076",
"0.5282357",
"0.5248779",
"0.5212722",
"0.5211248",
"0.51848173",
"0.51848173",
"0.5163079",
"0.51546043",
"0.509076... | 0.76206434 | 0 |
basenameKeyFilter applies a filter on results from some iterator (e.g. the KeysPrefix store function). This is useful to filter out items located deeper in the metadata tree, but for which the simple separator rule cannot be applied. | func basenameKeyFilter(filter string) func([]string, string, error) ([]string, string, error) {
return func(keys []string, next string, err error) ([]string, string, error) {
if err != nil {
return keys, next, err
}
filtered := make([]string, 0, len(keys))
for _, key := range keys {
if !strings.HasPrefix... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func KeyHasSuffix(v string) predicate.Blob {\n\treturn predicate.Blob(\n\t\tfunc(s *sql.Selector) {\n\t\t\ts.Where(sql.HasSuffix(s.C(FieldKey), v))\n\t\t},\n\t)\n}",
"func KeyHasPrefix(v string) predicate.Blob {\n\treturn predicate.Blob(\n\t\tfunc(s *sql.Selector) {\n\t\t\ts.Where(sql.HasPrefix(s.C(FieldKey), v)... | [
"0.52340424",
"0.4928137",
"0.4894693",
"0.4847061",
"0.47071567",
"0.46861228",
"0.4669897",
"0.46603027",
"0.46325058",
"0.4622332",
"0.46086925",
"0.4532329",
"0.45094556",
"0.44940478",
"0.4484004",
"0.44813517",
"0.4467792",
"0.44648084",
"0.44573885",
"0.4454603",
"0.44... | 0.81313115 | 0 |
write a plain text message | func writeString(w http.ResponseWriter, body string, status int) {
writeBody(w, []byte(body), status, "text/plain")
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func writePlainText(statusCode int, text string, w http.ResponseWriter) {\n\tw.Header().Set(\"Content-Type\", \"text/plain\")\n\tw.WriteHeader(statusCode)\n\tfmt.Fprintln(w, text)\n}",
"func (s *Status) WriteText(w http.ResponseWriter) error {\n\tw.Header().Set(\"Content-Type\", \"text/plain\")\n\tw.WriteHeader(... | [
"0.6655747",
"0.632213",
"0.6149622",
"0.6030877",
"0.60090363",
"0.5999739",
"0.59934056",
"0.5987086",
"0.5954685",
"0.59016705",
"0.5841889",
"0.58273524",
"0.58256876",
"0.5818543",
"0.5768177",
"0.57515097",
"0.5703201",
"0.5698121",
"0.56870776",
"0.56831807",
"0.567638... | 0.6367332 | 1 |
NewRolloutBlockLister returns a new RolloutBlockLister. | func NewRolloutBlockLister(indexer cache.Indexer) RolloutBlockLister {
return &rolloutBlockLister{indexer: indexer}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (s rolloutBlockNamespaceLister) Get(name string) (*v1alpha1.RolloutBlock, error) {\n\tobj, exists, err := s.indexer.GetByKey(s.namespace + \"/\" + name)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif !exists {\n\t\treturn nil, errors.NewNotFound(v1alpha1.Resource(\"rolloutblock\"), name)\n\t}\n\treturn ob... | [
"0.6314954",
"0.6238325",
"0.6161388",
"0.61283696",
"0.5824281",
"0.55151194",
"0.520106",
"0.51907414",
"0.5156084",
"0.5144187",
"0.51403826",
"0.5134927",
"0.50486195",
"0.5025212",
"0.5025212",
"0.5023222",
"0.5006356",
"0.49875388",
"0.49786118",
"0.49344215",
"0.493307... | 0.84841317 | 0 |
List lists all RolloutBlocks in the indexer. | func (s *rolloutBlockLister) List(selector labels.Selector) (ret []*v1alpha1.RolloutBlock, err error) {
err = cache.ListAll(s.indexer, selector, func(m interface{}) {
ret = append(ret, m.(*v1alpha1.RolloutBlock))
})
return ret, err
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (s rolloutBlockNamespaceLister) List(selector labels.Selector) (ret []*v1alpha1.RolloutBlock, err error) {\n\terr = cache.ListAllByNamespace(s.indexer, s.namespace, selector, func(m interface{}) {\n\t\tret = append(ret, m.(*v1alpha1.RolloutBlock))\n\t})\n\treturn ret, err\n}",
"func (s *rolloutBlockLister) ... | [
"0.7311063",
"0.6322645",
"0.60686725",
"0.60537857",
"0.58911",
"0.552953",
"0.5229831",
"0.5191888",
"0.51698",
"0.51621276",
"0.515386",
"0.5137676",
"0.5080767",
"0.50736266",
"0.5053302",
"0.50126654",
"0.4932627",
"0.4914542",
"0.4912257",
"0.49045357",
"0.49037486",
... | 0.76020056 | 0 |
RolloutBlocks returns an object that can list and get RolloutBlocks. | func (s *rolloutBlockLister) RolloutBlocks(namespace string) RolloutBlockNamespaceLister {
return rolloutBlockNamespaceLister{indexer: s.indexer, namespace: namespace}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func NewRolloutBlockLister(indexer cache.Indexer) RolloutBlockLister {\n\treturn &rolloutBlockLister{indexer: indexer}\n}",
"func (l *LessonTut) Blocks() []*BlockTut { return l.blocks }",
"func (s rolloutBlockNamespaceLister) Get(name string) (*v1alpha1.RolloutBlock, error) {\n\tobj, exists, err := s.indexer.G... | [
"0.66517174",
"0.61137074",
"0.6060496",
"0.602393",
"0.5799248",
"0.57554275",
"0.575131",
"0.5643157",
"0.5598307",
"0.5551497",
"0.55365604",
"0.55362105",
"0.5523253",
"0.55167264",
"0.5508807",
"0.54773945",
"0.54551417",
"0.5453782",
"0.54265654",
"0.54017013",
"0.53818... | 0.7300363 | 0 |
List lists all RolloutBlocks in the indexer for a given namespace. | func (s rolloutBlockNamespaceLister) List(selector labels.Selector) (ret []*v1alpha1.RolloutBlock, err error) {
err = cache.ListAllByNamespace(s.indexer, s.namespace, selector, func(m interface{}) {
ret = append(ret, m.(*v1alpha1.RolloutBlock))
})
return ret, err
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (s *rolloutBlockLister) List(selector labels.Selector) (ret []*v1alpha1.RolloutBlock, err error) {\n\terr = cache.ListAll(s.indexer, selector, func(m interface{}) {\n\t\tret = append(ret, m.(*v1alpha1.RolloutBlock))\n\t})\n\treturn ret, err\n}",
"func (s *rolloutBlockLister) RolloutBlocks(namespace string) ... | [
"0.70668423",
"0.6486759",
"0.59354115",
"0.58971703",
"0.58813244",
"0.5809516",
"0.5714969",
"0.56303203",
"0.55635107",
"0.5493994",
"0.5447972",
"0.54354554",
"0.54354066",
"0.5417491",
"0.53622055",
"0.5223752",
"0.5200587",
"0.51956224",
"0.5188562",
"0.51839614",
"0.51... | 0.81074965 | 0 |
Get retrieves the RolloutBlock from the indexer for a given namespace and name. | func (s rolloutBlockNamespaceLister) Get(name string) (*v1alpha1.RolloutBlock, error) {
obj, exists, err := s.indexer.GetByKey(s.namespace + "/" + name)
if err != nil {
return nil, err
}
if !exists {
return nil, errors.NewNotFound(v1alpha1.Resource("rolloutblock"), name)
}
return obj.(*v1alpha1.RolloutBlock),... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (s beeNamespaceLister) Get(name string) (*v1beta1.Bee, error) {\n\tobj, exists, err := s.indexer.GetByKey(s.namespace + \"/\" + name)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif !exists {\n\t\treturn nil, errors.NewNotFound(v1beta1.Resource(\"bee\"), name)\n\t}\n\treturn obj.(*v1beta1.Bee), nil\n}",
... | [
"0.6030591",
"0.59331393",
"0.5855316",
"0.5818759",
"0.5671234",
"0.56690836",
"0.5618589",
"0.55901265",
"0.5538037",
"0.55035794",
"0.548112",
"0.54450256",
"0.5436534",
"0.54056436",
"0.539699",
"0.53958815",
"0.53886515",
"0.5377897",
"0.5372501",
"0.53640854",
"0.535776... | 0.80333996 | 0 |
AddCopy creates a new QuarksSecrets controller to watch for the user defined secrets. | func AddCopy(ctx context.Context, config *config.Config, mgr manager.Manager) error {
ctx = ctxlog.NewContextWithRecorder(ctx, "copy-reconciler", mgr.GetEventRecorderFor("copy-recorder"))
log := ctxlog.ExtractLogger(ctx)
r := NewCopyReconciler(ctx, config, mgr, credsgen.NewInMemoryGenerator(log), controllerutil.SetC... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func add(mgr manager.Manager, r reconcile.Reconciler) error {\n\n \t// minimumRefreshRate = os.Getenv(\"MINIMUM_REFRESH_RATE\")\n\n\t// Create a new controller\n\tc, err := controller.New(\"vaultsecret-controller\", mgr, controller.Options{Reconciler: r})\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// Watch for c... | [
"0.61047924",
"0.58078575",
"0.55848235",
"0.5407227",
"0.5254048",
"0.5200474",
"0.51375145",
"0.49901083",
"0.49053696",
"0.48901126",
"0.4862202",
"0.4833981",
"0.48101637",
"0.48065236",
"0.47915724",
"0.47563052",
"0.47331327",
"0.47252765",
"0.47191927",
"0.46923995",
"... | 0.8458819 | 0 |
listQuarksSecretsReconciles lists all Quarks Secrets associated with the a particular secret. | func listQuarksSecretsReconciles(ctx context.Context, client crc.Client, secret *corev1.Secret, namespace string) ([]reconcile.Request, error) {
quarksSecretList := &qsv1a1.QuarksSecretList{}
err := client.List(ctx, quarksSecretList, crc.InNamespace(namespace))
if err != nil {
return nil, errors.Wrap(err, "failed ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (s Secrets) List(ctx context.Context, maxResults int32) ([]string, error) {\n\tvers, err := s.Ops.Secrets().List(ctx, maxResults)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tout := make([]string, 0, len(vers))\n\tfor _, ver := range vers {\n\t\tout = append(out, ver.ID)\n\t}\n\treturn out, nil\n}",
"fun... | [
"0.57259434",
"0.5530794",
"0.5380004",
"0.53071386",
"0.5273651",
"0.5255789",
"0.52251434",
"0.52205926",
"0.5210257",
"0.51597595",
"0.51561975",
"0.5152343",
"0.51374936",
"0.51229763",
"0.5094752",
"0.50841784",
"0.50665426",
"0.50590277",
"0.4997374",
"0.4994975",
"0.49... | 0.833262 | 0 |
CreateOrder cria um novo contato | func Create(responseWriter http.ResponseWriter, request *http.Request) {
fmt.Println("[ CreateOrder ]")
body, _ := json.Marshal(request.Body)
fmt.Println("[ CreateOrder ] Body=" + string(body))
//params := mux.Vars(request)
var orderEntity OrderEntity
_ = json.NewDecoder(request.Body).Decode(&orderEntity)
var r... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (company *Company) CreateOrder(id, color, quantity, dueDate, fulfilledQuantity int) *Order {\n\torder := &Order{\n\t\tkey: keyConfiguration.NewKey(),\n\t\tid: id,\n\t\tcolor: color,\n\t\tquantity: quantity,\n\t\tdueDate: dueDate,\n\t\tfulfilledQuanti... | [
"0.7995825",
"0.7714538",
"0.76843715",
"0.7665126",
"0.7629189",
"0.7612207",
"0.75953907",
"0.7582923",
"0.7548065",
"0.7545327",
"0.75202197",
"0.7519648",
"0.75073755",
"0.74967855",
"0.749028",
"0.7485679",
"0.746166",
"0.7416033",
"0.74129796",
"0.73773503",
"0.73278636... | 0.7286142 | 22 |
Closures Creamos una funcion tabla que recibe un entero y a su vez retorna una funcion que retorna un entero | func Tabla(valor int) func() int {
numero := valor
secuencia := 0
return func() int {
secuencia++
return numero * secuencia
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func Tabla(valor int) func() int {\n\tnumero := valor //la primera ejecucion va a ejecutar linea57 y 58\n\tsecuencia := 0\n\treturn func() int { //cuando se llama y se asigna a una variable, la variable solo toma la parte que se retorna.\n\t\tsecuencia++\n\t\treturn numero * secuencia\n\t}\n\n}",
"func Tabla(val... | [
"0.61445713",
"0.59035116",
"0.54191124",
"0.5237038",
"0.52154064",
"0.5208149",
"0.5103757",
"0.5103272",
"0.5053731",
"0.50382227",
"0.5018528",
"0.50136447",
"0.5009777",
"0.5006587",
"0.5002946",
"0.49952084",
"0.49399126",
"0.49373722",
"0.48772338",
"0.48347634",
"0.48... | 0.5859927 | 2 |
RecoverPanics wraps http.Handler to recover and log panics. | func RecoverPanics(handler http.Handler) http.Handler {
return http.HandlerFunc(func(w http.ResponseWriter, req *http.Request) {
defer func() {
if x := recover(); x != nil {
w.WriteHeader(http.StatusInternalServerError)
fmt.Fprint(w, "apis panic. Look in log for details.")
glog.Infof("APIServer panic'... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func RecoverPanics(handler http.Handler) http.Handler {\n\treturn http.HandlerFunc(func(w http.ResponseWriter, req *http.Request) {\n\t\tdefer func() {\n\t\t\tif x := recover(); x != nil {\n\t\t\t\thttp.Error(w, \"apis panic. Look in log for details.\", http.StatusInternalServerError)\n\t\t\t\tglog.Errorf(\"APISer... | [
"0.73594993",
"0.7038121",
"0.7008406",
"0.6885905",
"0.6658655",
"0.6547491",
"0.64594406",
"0.64355105",
"0.6379547",
"0.63791853",
"0.63632184",
"0.63296616",
"0.631733",
"0.630849",
"0.6275611",
"0.6274496",
"0.6261786",
"0.62580246",
"0.6256298",
"0.6241197",
"0.6223762"... | 0.74536425 | 0 |
Simple CORS implementation that wraps an http Handler For a more detailed implementation use or implement CORS at your proxy layer Pass nil for allowedMethods and allowedHeaders to use the defaults | func CORS(handler http.Handler, alloweedOriginPatterns []*regexp.Regexp, allowedMethods, allowedHeaders []string, allowCredentials string) http.Handler {
return http.HandlerFunc(func(w http.ResponseWriter, req *http.Request) {
origin := req.Header.Get("Origin")
if origin != "" {
allowed := false
for _, patte... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func AllowCORS(h http.Handler) http.Handler {\n return http.HandlerFunc(func(w http.ResponseWriter, r *http.Request) {\n if origin := r.Header.Get(\"Origin\"); origin != \"\" {\n w.Header().Set(\"Access-Control-Allow-Origin\", origin)\n if r.Method == \"OPTIONS\" && r.Header.Get(\"Access-Control-Requ... | [
"0.76304674",
"0.73658764",
"0.73056734",
"0.7282161",
"0.71808046",
"0.714095",
"0.71343446",
"0.7124745",
"0.7118615",
"0.71138436",
"0.7107819",
"0.70997053",
"0.70225453",
"0.700575",
"0.70035934",
"0.6915656",
"0.69056773",
"0.6897148",
"0.6897042",
"0.68887126",
"0.6873... | 0.71452546 | 5 |
Opts returns a redisconn.Opts object with the configured options applied. | func (cfg ClientConfig) Opts() redisconn.Opts {
opts := redisconn.Opts{}
cfg.Options.ApplyOpts(&opts)
return opts
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func GetRedisOpts(driver *dipper.Driver) *Options {\n\tif conn, ok := dipper.GetMapData(driver.Options, \"data.connection\"); ok {\n\t\tdefer delete(conn.(map[string]interface{}), \"Password\")\n\t}\n\tif tls, ok := dipper.GetMapData(driver.Options, \"data.connection.TLS\"); ok {\n\t\tdefer delete(tls.(map[string]... | [
"0.69560456",
"0.65203357",
"0.6464695",
"0.60208565",
"0.6006148",
"0.5755672",
"0.5684365",
"0.56654674",
"0.5618213",
"0.55474895",
"0.54999447",
"0.5461396",
"0.5443127",
"0.54348564",
"0.5417129",
"0.5403839",
"0.5378627",
"0.5340202",
"0.53303003",
"0.53119975",
"0.5279... | 0.7253291 | 0 |
Opts returns a rediscluster.Opts object with the configured options applied. | func (cfg ClusterConfig) Opts() rediscluster.Opts {
opts := rediscluster.Opts{}
cfg.Options.ApplyOpts(&opts.HostOpts)
cfg.Cluster.ApplyOpts(&opts)
return opts
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (cfg ClientConfig) Opts() redisconn.Opts {\n\topts := redisconn.Opts{}\n\tcfg.Options.ApplyOpts(&opts)\n\treturn opts\n}",
"func GetRedisOpts(driver *dipper.Driver) *Options {\n\tif conn, ok := dipper.GetMapData(driver.Options, \"data.connection\"); ok {\n\t\tdefer delete(conn.(map[string]interface{}), \"Pa... | [
"0.6970594",
"0.6281927",
"0.59078234",
"0.5868081",
"0.5761447",
"0.56771445",
"0.56171125",
"0.55353045",
"0.5506973",
"0.5471589",
"0.54695356",
"0.54681355",
"0.54206634",
"0.5406276",
"0.5379113",
"0.53657633",
"0.5356025",
"0.5337401",
"0.52826387",
"0.52810746",
"0.523... | 0.73391664 | 0 |
ApplyOpts applies any values set in o to opts, if a value is not set on o, then we don't update opts and allow redispipe to use its defaults. | func (o Opts) ApplyOpts(opts *redisconn.Opts) {
if o.DB != nil {
opts.DB = *o.DB
}
if o.WritePause > 0 {
opts.WritePause = o.WritePause
}
if o.ReconnectPause > 0 {
opts.ReconnectPause = o.ReconnectPause
}
if o.TCPKeepAlive > 0 {
opts.TCPKeepAlive = o.TCPKeepAlive
}
o.Timeouts.ApplyOpts(opts)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (o *Options) Apply(opts ...Option) error {\n\tfor i, opt := range opts {\n\t\tif err := opt(o); err != nil {\n\t\t\treturn fmt.Errorf(\"option %d failed: %s\", i, err)\n\t\t}\n\t}\n\treturn nil\n}",
"func (o *Options) Apply() {\n\tif o == nil {\n\t\treturn\n\t}\n\tif len(o.ShowHiddenMetricsForVersion) > 0 {... | [
"0.6115144",
"0.6088725",
"0.59637165",
"0.58984965",
"0.5830588",
"0.5801298",
"0.57815975",
"0.5702999",
"0.565666",
"0.56555563",
"0.5646621",
"0.56115735",
"0.5607685",
"0.55613136",
"0.544665",
"0.54299736",
"0.53732026",
"0.5360941",
"0.53602225",
"0.5359189",
"0.534636... | 0.608243 | 2 |
ApplyOpts applies any values set in t to opts, if a value is not set on t, then we don't update opts and allow redispipe to use its defaults. | func (t Timeouts) ApplyOpts(opts *redisconn.Opts) {
if t.Dial > 0 {
opts.DialTimeout = t.Dial
}
if t.IO > 0 {
opts.IOTimeout = t.IO
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (o Opts) ApplyOpts(opts *redisconn.Opts) {\n\n\tif o.DB != nil {\n\t\topts.DB = *o.DB\n\t}\n\tif o.WritePause > 0 {\n\t\topts.WritePause = o.WritePause\n\t}\n\tif o.ReconnectPause > 0 {\n\t\topts.ReconnectPause = o.ReconnectPause\n\t}\n\tif o.TCPKeepAlive > 0 {\n\t\topts.TCPKeepAlive = o.TCPKeepAlive\n\t}\n\t... | [
"0.62161744",
"0.60801",
"0.5962653",
"0.58972675",
"0.5862883",
"0.5759934",
"0.5752782",
"0.57467747",
"0.547668",
"0.5474911",
"0.5289025",
"0.5288125",
"0.52854234",
"0.52022785",
"0.5182077",
"0.5168935",
"0.51122046",
"0.5102658",
"0.5087273",
"0.50831145",
"0.5053145",... | 0.62208015 | 0 |
ApplyOpts applies any values set in o to opts, if a value is not set on o, then we don't update opts and allow redispipe to use its defaults. | func (o ClusterOpts) ApplyOpts(opts *rediscluster.Opts) {
if o.Name != "" {
opts.Name = o.Name
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (o *Options) Apply(opts ...Option) error {\n\tfor i, opt := range opts {\n\t\tif err := opt(o); err != nil {\n\t\t\treturn fmt.Errorf(\"option %d failed: %s\", i, err)\n\t\t}\n\t}\n\treturn nil\n}",
"func (o *Options) Apply() {\n\tif o == nil {\n\t\treturn\n\t}\n\tif len(o.ShowHiddenMetricsForVersion) > 0 {... | [
"0.6115116",
"0.60880756",
"0.60818255",
"0.5963018",
"0.58978915",
"0.5830136",
"0.5801093",
"0.5780717",
"0.5702616",
"0.5656612",
"0.5655646",
"0.564559",
"0.56109065",
"0.5607306",
"0.5561439",
"0.544544",
"0.5429387",
"0.5372531",
"0.5360312",
"0.53601557",
"0.5357337",
... | 0.49006703 | 39 |
VersionString returns a TLS version string. | func VersionString(value uint16) string {
if str, found := tlsVersionString[value]; found {
return str
}
return fmt.Sprintf("TLS_VERSION_UNKNOWN_%d", value)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func VersionString() string {\n\treturn C.GoString(C.LZ4_versionString())\n}",
"func TLSVersion(ver uint16) string {\n\tswitch ver {\n\tcase tls.VersionTLS10:\n\t\treturn \"1.0\"\n\tcase tls.VersionTLS11:\n\t\treturn \"1.1\"\n\tcase tls.VersionTLS12:\n\t\treturn \"1.2\"\n\t}\n\treturn fmt.Sprintf(\"Unknown [%x]\... | [
"0.74643797",
"0.7188609",
"0.70724016",
"0.70276886",
"0.6924166",
"0.6852171",
"0.68485165",
"0.68244296",
"0.6796393",
"0.6793432",
"0.67549765",
"0.67549765",
"0.6725175",
"0.6683086",
"0.6674843",
"0.66420186",
"0.6634001",
"0.6576915",
"0.65724236",
"0.6564921",
"0.6546... | 0.77363867 | 0 |
CipherSuiteString returns the TLS cipher suite as a string. | func CipherSuiteString(value uint16) string {
if str, found := tlsCipherSuiteString[value]; found {
return str
}
return fmt.Sprintf("TLS_CIPHER_SUITE_UNKNOWN_%d", value)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func CipherSuiteName(suite uint16) string {\n\tswitch suite {\n\tcase tls.TLS_RSA_WITH_RC4_128_SHA:\n\t\treturn \"TLS_RSA_WITH_RC4_128_SHA\"\n\tcase tls.TLS_RSA_WITH_3DES_EDE_CBC_SHA:\n\t\treturn \"TLS_RSA_WITH_3DES_EDE_CBC_SHA\"\n\tcase tls.TLS_RSA_WITH_AES_128_CBC_SHA:\n\t\treturn \"TLS_RSA_WITH_AES_128_CBC_SHA\... | [
"0.69200236",
"0.6264078",
"0.60463476",
"0.553764",
"0.552981",
"0.55205077",
"0.5297108",
"0.52549493",
"0.521741",
"0.5183919",
"0.51783603",
"0.51552385",
"0.5096407",
"0.50740904",
"0.5053442",
"0.49669608",
"0.49222544",
"0.49079034",
"0.4856489",
"0.48283112",
"0.47250... | 0.77113676 | 0 |
New creates a new engine with given options. Options can change the timeout, register a signal, execute a prehook callback and many other behaviours. | func New(ctx context.Context, options ...Option) (*Engine, error) {
e := &Engine{}
e.parent = ctx
e.init()
for _, o := range options {
if err := o.apply(e); err != nil {
return nil, err
}
}
return e, nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func New(opts ...Option) *Engine {\n\toptions := defaultEngineOptions()\n\n\tfor _, opt := range opts {\n\t\topt.apply(&options)\n\t}\n\n\te := &Engine{\n\t\tsimStepper: options.simStepper,\n\t}\n\n\te.World = NewWorld()\n\n\treturn e\n}",
"func NewEngine(cfg *config.Config, options ...func(*Engine)) *Engine {\n... | [
"0.67921555",
"0.669759",
"0.6473409",
"0.6158667",
"0.6096818",
"0.5842643",
"0.58255535",
"0.57950187",
"0.57940483",
"0.57030845",
"0.5669355",
"0.56626093",
"0.5661552",
"0.5651985",
"0.5622525",
"0.559433",
"0.5591475",
"0.55850506",
"0.55799",
"0.55681443",
"0.5546847",... | 0.6813927 | 0 |
launch will start given hook. | func (e *Engine) launch(h Hook) {
e.wait.Add(1)
go func() {
defer e.wait.Done()
runtime := &HookRuntime{}
// Wait for an event to notify this goroutine that a shutdown is required.
// It could either be from engine's context or during Hook startup if an error has occurred.
// NOTE: If HookRuntime retur... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func Launch(actions []actloop.Action, logger *log.Logger) (stop func()) {\n\tloop := actloop.NewActLoop(actions, logger)\n\tgo loop.Run(time.Second*2, time.Minute*5, notifyReady)\n\treturn loop.Cancel\n}",
"func Launch(addr, localDir, filename string,\n\targs []string, logDir string, retry int) error {\n\n\tfiel... | [
"0.5877089",
"0.5779476",
"0.5759628",
"0.57347715",
"0.56235826",
"0.5620141",
"0.56181556",
"0.5604568",
"0.5598416",
"0.5588178",
"0.5450167",
"0.5426442",
"0.54139924",
"0.53387564",
"0.5329647",
"0.5309052",
"0.52930015",
"0.52812076",
"0.5246368",
"0.52041054",
"0.51378... | 0.73184854 | 0 |
init configures default parameters for engine. | func (e *Engine) init() {
e.mutex.Lock()
defer e.mutex.Unlock()
if e.ctx == nil || e.cancel == nil {
e.ctx, e.cancel = context.WithCancel(e.parent)
}
if e.timeout == 0 {
e.timeout = DefaultTimeout
}
if len(e.signals) == 0 && !e.noSignal {
e.signals = Signals
}
if e.interrupt == nil {
e.interrupt =... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (eng *Engine) Init(cfg string) error {\n\treturn nil\n}",
"func Init(eng *en.RealEngine) {\n\tengine = *eng\n}",
"func (engine *Engine) Init(options types.EngineOpts) {\n\t// 将线程数设置为CPU数\n\t// runtime.GOMAXPROCS(runtime.NumCPU())\n\t// runtime.GOMAXPROCS(128)\n\n\t// 初始化初始参数\n\tif engine.initialized {\n\t... | [
"0.7221774",
"0.66383153",
"0.6604026",
"0.6536726",
"0.6430138",
"0.6430138",
"0.62999934",
"0.62854785",
"0.62300193",
"0.62171",
"0.62102425",
"0.61965305",
"0.6160467",
"0.6122625",
"0.61147517",
"0.6108825",
"0.6103406",
"0.6101473",
"0.60721517",
"0.6070308",
"0.6061238... | 0.6992129 | 1 |
Start will launch the engine and start registered hooks. It will block until every hooks has shutdown, gracefully or with force... | func (e *Engine) Start() error {
e.init()
go e.waitShutdownNotification()
for _, h := range e.hooks {
e.launch(h)
}
e.wait.Wait()
if e.afterShutdown != nil {
e.afterShutdown()
}
e.mutex.Lock()
defer e.mutex.Unlock()
return e.cause
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (e *EngineConfig) Start() error {\n\tlogger.Info(\"Engine: Starting...\")\n\n\t// Todo document RunnerType for engine configuration\n\trunnerType := config.GetRunnerType()\n\te.Init(runnerType == \"DIRECT\")\n\n\tactionRunner := e.actionRunner.(interface{})\n\n\tif managedRunner, ok := actionRunner.(util.Mana... | [
"0.70842016",
"0.70279807",
"0.6923318",
"0.6841361",
"0.6739894",
"0.6596409",
"0.6575987",
"0.6469447",
"0.64490694",
"0.6430585",
"0.64055973",
"0.6379535",
"0.6339723",
"0.6337157",
"0.6315934",
"0.6285416",
"0.62843764",
"0.6270798",
"0.62603813",
"0.62498593",
"0.622291... | 0.78836673 | 0 |
Stop will shutdown engine. | func (e *Engine) Stop() error {
e.mutex.Lock()
defer e.mutex.Unlock()
if e.interrupt != nil {
select {
case e.interrupt <- os.Interrupt:
default:
}
}
return nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (e *Engine) Stop() error {\n\tclose(e.stop)\n\treturn nil\n}",
"func (e *Engine) Stop() {\n\te.running = false\n}",
"func (e *Engine) Stop() {\n\tif atomic.CompareAndSwapInt32(&e.stopping, 0, 1) {\n\t\te.wg.Wait()\n\t\te.running = 0\n\t\te.stopping = 0\n\t}\n}",
"func (e *Engine) Stop() error {\n\te.sto... | [
"0.8119374",
"0.8024512",
"0.7673363",
"0.7569195",
"0.7498961",
"0.74496645",
"0.729721",
"0.7241718",
"0.72293586",
"0.71640617",
"0.7073136",
"0.70670533",
"0.7035117",
"0.70122164",
"0.6990118",
"0.69852245",
"0.6978263",
"0.6965461",
"0.6890941",
"0.6878703",
"0.6846897"... | 0.74494004 | 6 |
NEW: This method is only available in solanacore v1.7 or newer. Please use getConfirmedBlocks for solanacore v1.6 GetBlocks returns a list of confirmed blocks between two slots Max range allowed is 500,000 slot | func (c *RpcClient) GetBlocks(ctx context.Context, startSlot uint64, endSlot uint64) (GetBlocksResponse, error) {
return c.processGetBlocks(c.Call(ctx, "getBlocks", startSlot, endSlot))
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (s *RpcClient) GetConfirmedBlocks(ctx context.Context, startSlot uint64, endSlot uint64) ([]uint64, error) {\n\tres := struct {\n\t\tGeneralResponse\n\t\tResult []uint64 `json:\"result\"`\n\t}{}\n\terr := s.request(ctx, \"getConfirmedBlocks\", []interface{}{startSlot, endSlot}, &res)\n\tif err != nil {\n\t\tr... | [
"0.78249013",
"0.6385375",
"0.62107474",
"0.6095312",
"0.60634947",
"0.6063101",
"0.59976745",
"0.5974859",
"0.59326327",
"0.58996063",
"0.5883632",
"0.5878408",
"0.58193696",
"0.5773688",
"0.57701415",
"0.57556033",
"0.572684",
"0.5716062",
"0.5714754",
"0.57055044",
"0.5696... | 0.6407925 | 1 |
NEW: This method is only available in solanacore v1.7 or newer. Please use getConfirmedBlocks for solanacore v1.6 GetBlocks returns a list of confirmed blocks between two slots Max range allowed is 500,000 slot | func (c *RpcClient) GetBlocksWithConfig(ctx context.Context, startSlot uint64, endSlot uint64, cfg GetBlocksConfig) (GetBlocksResponse, error) {
return c.processGetBlocks(c.Call(ctx, "getBlocks", startSlot, endSlot, cfg))
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (s *RpcClient) GetConfirmedBlocks(ctx context.Context, startSlot uint64, endSlot uint64) ([]uint64, error) {\n\tres := struct {\n\t\tGeneralResponse\n\t\tResult []uint64 `json:\"result\"`\n\t}{}\n\terr := s.request(ctx, \"getConfirmedBlocks\", []interface{}{startSlot, endSlot}, &res)\n\tif err != nil {\n\t\tr... | [
"0.7826052",
"0.6409298",
"0.63869226",
"0.62129146",
"0.6096529",
"0.6065399",
"0.6064389",
"0.59982294",
"0.59739965",
"0.5933728",
"0.590104",
"0.58848983",
"0.58794004",
"0.5818846",
"0.57752573",
"0.5755512",
"0.57286024",
"0.571757",
"0.5715281",
"0.5704689",
"0.5697877... | 0.57698154 | 15 |
initDNSServer creates an instance of the dnsforward.Server Please note that we must do it even if we don't start it so that we had access to the query log and the stats | func initDNSServer(baseDir string) {
err := os.MkdirAll(baseDir, 0755)
if err != nil {
log.Fatalf("Cannot create DNS data dir at %s: %s", baseDir, err)
}
dnsServer = dnsforward.NewServer(baseDir)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func runDNSServer() {\n\n\t// load the blocked domains\n\tblacklist := LoadBlacklistOrFail(blacklistPath)\n\tfmt.Printf(\"Loading list of %d blocked domains...\\n\", blacklist.Size())\n\n\t// make the custom handler function to reply to DNS queries\n\tupstream := getEnvOrDefault(\"UPSTREAM_DNS\", \"1.1.1.1:53\")\n... | [
"0.6577117",
"0.61836004",
"0.58856076",
"0.5873448",
"0.58571017",
"0.5849781",
"0.58205044",
"0.5788006",
"0.5765969",
"0.5757338",
"0.57560205",
"0.57468",
"0.5746392",
"0.57075214",
"0.5705852",
"0.56903404",
"0.5686891",
"0.56743336",
"0.5671335",
"0.5657342",
"0.5653865... | 0.7915286 | 0 |
checkIfBackupInNewOrProgress check whether there are backups created by this schedule still in New or InProgress state | func (c *scheduleReconciler) checkIfBackupInNewOrProgress(schedule *velerov1.Schedule) bool {
log := c.logger.WithField("schedule", kube.NamespaceAndName(schedule))
backupList := &velerov1.BackupList{}
options := &client.ListOptions{
Namespace: schedule.Namespace,
LabelSelector: labels.Set(map[string]string{
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (t *Task) hasBackupCompleted(backup *velero.Backup) (bool, []string) {\n\tcompleted := false\n\treasons := []string{}\n\tprogress := []string{}\n\n\tpvbs := t.getPodVolumeBackupsForBackup(backup)\n\n\tswitch backup.Status.Phase {\n\tcase velero.BackupPhaseNew:\n\t\tprogress = append(\n\t\t\tprogress,\n\t\t\tf... | [
"0.65107685",
"0.60924333",
"0.6047755",
"0.59358364",
"0.5879894",
"0.58064044",
"0.579322",
"0.5754999",
"0.546307",
"0.54417455",
"0.54404837",
"0.54389805",
"0.5420077",
"0.54141295",
"0.53390694",
"0.5332677",
"0.5270624",
"0.52638215",
"0.5197946",
"0.51915765",
"0.5188... | 0.8554207 | 0 |
ifDue check whether schedule is due to create a new backup. | func (c *scheduleReconciler) ifDue(schedule *velerov1.Schedule, cronSchedule cron.Schedule) bool {
isDue, nextRunTime := getNextRunTime(schedule, cronSchedule, c.clock.Now())
log := c.logger.WithField("schedule", kube.NamespaceAndName(schedule))
if !isDue {
log.WithField("nextRunTime", nextRunTime).Debug("Schedul... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (c *scheduleReconciler) checkIfBackupInNewOrProgress(schedule *velerov1.Schedule) bool {\n\tlog := c.logger.WithField(\"schedule\", kube.NamespaceAndName(schedule))\n\tbackupList := &velerov1.BackupList{}\n\toptions := &client.ListOptions{\n\t\tNamespace: schedule.Namespace,\n\t\tLabelSelector: labels.Set(map... | [
"0.5760196",
"0.5610772",
"0.52594167",
"0.5190598",
"0.51561713",
"0.5043613",
"0.4985795",
"0.4985035",
"0.49514583",
"0.4903711",
"0.49007374",
"0.4899634",
"0.48967138",
"0.48667654",
"0.485368",
"0.4840095",
"0.48217595",
"0.4819338",
"0.4814378",
"0.48026362",
"0.479245... | 0.7543842 | 0 |
submitBackup create a backup from schedule. | func (c *scheduleReconciler) submitBackup(ctx context.Context, schedule *velerov1.Schedule) error {
c.logger.WithField("schedule", schedule.Namespace+"/"+schedule.Name).Info("Schedule is due, going to submit backup.")
now := c.clock.Now()
// Don't attempt to "catch up" if there are any missed or failed runs - simpl... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func createBackup(w http.ResponseWriter, r *http.Request) {\n\tlogrus.Infof(\">>>>CreateBackup r=%s\", r)\n\n\tif RunningBackupAPIID != \"\" {\n\t\tlogrus.Infof(\"Another backup id %s is already running. Aborting.\", RunningBackupAPIID)\n\t\thttp.Error(w, fmt.Sprintf(\"Another backup id %s is already running. Abor... | [
"0.68177533",
"0.6513657",
"0.6345432",
"0.61539024",
"0.6150429",
"0.59448236",
"0.59301215",
"0.57305014",
"0.567647",
"0.56463933",
"0.56347996",
"0.55442417",
"0.5516464",
"0.5512978",
"0.54288435",
"0.54252183",
"0.5423092",
"0.53933567",
"0.53620535",
"0.5304515",
"0.53... | 0.78230155 | 0 |
GetUserList get user list from paas | func (m *publicUser) GetUserList(c *gin.Context) (int, interface{}) {
user := plugins.CurrentPlugin(c, m.config.LoginVersion)
userList, err := user.GetUserList(c, m.config.ConfigMap)
rspBody := metadata.LonginSystemUserListResult{}
if nil != err {
rspBody.Code = common.CCErrCommHTTPDoRequestFailed
rspBody.ErrMs... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func GetListUser(c *gin.Context) {\r\n\tvar usr []model.UserTemporary\r\n\tres := model.GetLUser(usr)\r\n\r\n\tutils.WrapAPIData(c, map[string]interface{}{\r\n\t\t\"Data\": res,\r\n\t}, http.StatusOK, \"success\")\r\n}",
"func getUserList() string {\n\tvar userlist string\n\tfmt.Println(len(Users))\n\tfor key, v... | [
"0.7359356",
"0.72904336",
"0.7077272",
"0.7028727",
"0.7027776",
"0.702073",
"0.70161134",
"0.6993351",
"0.6991551",
"0.6870929",
"0.6868621",
"0.68681204",
"0.68483824",
"0.6812991",
"0.67967814",
"0.6774643",
"0.6770087",
"0.6731464",
"0.67262626",
"0.6713845",
"0.6699844"... | 0.7338346 | 1 |
CgoEform Earth reference ellipsoids. E f o r m This function is part of the International Astronomical Union's SOFA (Standards of Fundamental Astronomy) software collection. Status: canonical. Given: n int ellipsoid identifier (Note 1) Returned: a double equatorial radius (meters, Note 2) f double flattening (Note 2) R... | func CgoEform(n int) (a, f float64, err en.ErrNum) {
var cA, cF C.double
var cStatus C.int
cStatus = C.iauEform(C.int(n), &cA, &cF)
switch int(cStatus) {
case 0:
case -1:
err = errEform.Set(-1)
default:
err = errEform.Set(0)
}
return float64(cA), float64(cF), err
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func GoEform(n int) (a, f float64, err en.ErrNum) {\n\n\t// Look up a and f for the specified reference ellipsoid.\n\tswitch n {\n\tcase WGS84:\n\t\ta = 6378137.0\n\t\tf = 1.0 / 298.257223563\n\tcase GRS80:\n\t\ta = 6378137.0\n\t\tf = 1.0 / 298.257222101\n\tcase WGS72:\n\t\ta = 6378135.0\n\t\tf = 1.0 / 298.26\n\td... | [
"0.74699134",
"0.53509736",
"0.5212823",
"0.5123355",
"0.49350253",
"0.49159133",
"0.4744874",
"0.46416277",
"0.4524783",
"0.4492814",
"0.4436879",
"0.44055137",
"0.43862936",
"0.43788657",
"0.43419313",
"0.43260568",
"0.43255433",
"0.43137696",
"0.4303726",
"0.42876762",
"0.... | 0.5603201 | 1 |
GoEform Earth reference ellipsoids. | func GoEform(n int) (a, f float64, err en.ErrNum) {
// Look up a and f for the specified reference ellipsoid.
switch n {
case WGS84:
a = 6378137.0
f = 1.0 / 298.257223563
case GRS80:
a = 6378137.0
f = 1.0 / 298.257222101
case WGS72:
a = 6378135.0
f = 1.0 / 298.26
default:
// Invalid identifier.
a... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func NewEllipsoid(radius, flattening float64) *Ellipsoid {\n\te := new(Ellipsoid)\n\tC.geod_init(&e.g, C.double(radius), C.double(flattening))\n\treturn e\n}",
"func (e *Ellipsoid) Inverse(\n\tlat1, lon1, lat2, lon2 float64,\n\ts12, azi1, azi2 *float64,\n) {\n\tC.geod_inverse(&e.g,\n\t\tC.double(lat1), C.double(... | [
"0.57555723",
"0.5633475",
"0.56043756",
"0.55265075",
"0.54089504",
"0.53410894",
"0.52664757",
"0.5026412",
"0.49845457",
"0.4889047",
"0.48806256",
"0.4879575",
"0.48052537",
"0.47927207",
"0.47134507",
"0.46969742",
"0.46880403",
"0.46797422",
"0.46588522",
"0.46408844",
... | 0.6615527 | 0 |
Register a new tunnel on this control connection | func (c *Control) registerTunnel(rawTunnelReq *msg.ReqTunnel) {
for _, proto := range strings.Split(rawTunnelReq.Protocol, "+") {
tunnelReq := *rawTunnelReq
tunnelReq.Protocol = proto
c.conn.Debug("Registering new tunnel")
t, err := NewTunnel(&tunnelReq, c)
if err != nil {
ack := &msg.NewTunnel{Error: er... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (na *Nagent) CreateTunnel(tun *netproto.Tunnel) error {\n\terr := na.validateMeta(tun.Kind, tun.ObjectMeta)\n\tif err != nil {\n\t\treturn err\n\t}\n\t// check if tunnel already exists\n\toldTun, err := na.FindTunnel(tun.ObjectMeta)\n\tif err == nil {\n\t\t// check if tunnel contents are same\n\t\tif !proto.E... | [
"0.6146846",
"0.61225635",
"0.5909397",
"0.56072223",
"0.5565189",
"0.5540766",
"0.5476352",
"0.54763263",
"0.54655796",
"0.5418362",
"0.53958005",
"0.5362109",
"0.5323186",
"0.5291799",
"0.52836424",
"0.526554",
"0.5163012",
"0.5159695",
"0.51567835",
"0.51567405",
"0.515555... | 0.73147064 | 0 |
Remove a proxy connection from the pool and return it If not proxy connections are in the pool, request one and wait until it is available Returns an error if we couldn't get a proxy because it took too long or the tunnel is closing | func (c *Control) GetProxy() (proxyConn conn.Conn, err error) {
// initial timeout is zero to try to get a proxy connection without asking for one
timeout := time.NewTimer(0)
// get a proxy connection. if we timeout, request one over the control channel
for proxyConn == nil {
var ok bool
select {
case proxyC... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (router *Router) GetTunnel() *Tunnel {\n\trouter.mu.Lock()\n\tdefer router.mu.Unlock()\n\n\t// Keep trying to find a healthy tunnel until the pool exhausted and\n\t// actively remove unhealthy tunnels from the pool.\n\tfor {\n\t\tif len(router.pool) < 1 {\n\t\t\treturn nil\n\t\t}\n\t\ti := rand.Intn(len(route... | [
"0.6022615",
"0.60019463",
"0.5842775",
"0.58329505",
"0.5832659",
"0.5711125",
"0.55737877",
"0.55508256",
"0.5519788",
"0.55154026",
"0.5507154",
"0.5496575",
"0.54928315",
"0.5485385",
"0.5482652",
"0.54800826",
"0.5476584",
"0.54401356",
"0.5434093",
"0.54271895",
"0.5416... | 0.67896104 | 0 |
Up20200929144301 adds Visual Studio Code as a workspace template. | func Up20200929144301(tx *sql.Tx) error {
client, err := getClient()
if err != nil {
return err
}
defer client.DB.Close()
migrationsRan, err := getRanSQLMigrations(client)
if err != nil {
return err
}
if _, ok := migrationsRan[20200929144301]; ok {
return nil
}
namespaces, err := client.ListOnepanelE... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func createWorkspace(client secrethub.ClientInterface, io ui.IO, org string, orgDescription string, progressPrinter progress.Printer) error {\n\tif org == \"\" {\n\t\tcreateWorkspace, err := ui.AskYesNo(io, \"Do you want to create a shared workspace for your team?\", ui.DefaultYes)\n\t\tif err != nil {\n\t\t\tretu... | [
"0.49752992",
"0.49527052",
"0.48761147",
"0.48284465",
"0.4793886",
"0.45810252",
"0.44825286",
"0.4462606",
"0.4437953",
"0.43855366",
"0.43842992",
"0.438213",
"0.43730313",
"0.43259045",
"0.43124765",
"0.42978927",
"0.42976612",
"0.42841607",
"0.42832598",
"0.42819938",
"... | 0.5603818 | 0 |
Down20200929144301 removes Visual Studio Code from workspace templates. | func Down20200929144301(tx *sql.Tx) error {
client, err := getClient()
if err != nil {
return err
}
namespaces, err := client.ListOnepanelEnabledNamespaces()
if err != nil {
return err
}
uid, err := uid2.GenerateUID(vscodeWorkspaceTemplateName, 30)
if err != nil {
return err
}
for _, namespace := range... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func Up20200929144301(tx *sql.Tx) error {\n\tclient, err := getClient()\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer client.DB.Close()\n\n\tmigrationsRan, err := getRanSQLMigrations(client)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tif _, ok := migrationsRan[20200929144301]; ok {\n\t\treturn nil\n\t}\n\n\tna... | [
"0.5403419",
"0.48610234",
"0.48188964",
"0.47880107",
"0.46502808",
"0.4624768",
"0.4575532",
"0.45335364",
"0.44752434",
"0.44420055",
"0.44269013",
"0.44095922",
"0.44063526",
"0.43804044",
"0.4365622",
"0.4359805",
"0.4350803",
"0.43353775",
"0.4305398",
"0.42996585",
"0.... | 0.5788403 | 0 |
WithLogger sets the logger to use. By default, it logs to the standard library logger. | func WithLogger(l goka.Logger) Option {
return func(s *Server) {
s.log = l
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func WithLogger(logger Logger) Option {\n\treturn loggerOption{Logger: logger}\n}",
"func WithLogger(l Logger) OptionFn {\n\treturn func(app *Application) {\n\t\tif l != nil {\n\t\t\tapp.logger = l\n\t\t\tapp.MustRegister(\"logger\", l)\n\t\t}\n\t}\n}",
"func WithLogger(l log.Logger) Option {\n\treturn func(o ... | [
"0.7840537",
"0.7794925",
"0.77942044",
"0.77463925",
"0.7745421",
"0.7726518",
"0.7726518",
"0.7713602",
"0.7698265",
"0.76704085",
"0.7669409",
"0.7656201",
"0.76350176",
"0.76218003",
"0.7616936",
"0.76035553",
"0.7575008",
"0.75647897",
"0.75019264",
"0.7490467",
"0.74822... | 0.73261267 | 29 |
GenerateModels parses the magmagenmeta key of the given swagger YAML file, copies the files that the target file depends on into the current working directory, shells out to `swagger generate models`, then cleans up the dependency files. | func GenerateModels(targetFilepath string, configFilepath string, rootDir string, specs map[string]MagmaSwaggerSpec) error {
absTargetFilepath, err := filepath.Abs(targetFilepath)
if err != nil {
return fmt.Errorf("target filepath %s is invalid: %w", targetFilepath, err)
}
tmpGenDir, err := ioutil.TempDir(".", "... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (g *Generator) Generate(context *common.Context, schema *schema.Schema) ([]common.Output, error) {\n\tmoduleName := strings.ToLower(schema.Title)\n\tvar outputs []common.Output\n\n\tfor _, def := range schema.Definitions {\n\t\t// create models only for objects\n\t\tif def.Type != nil {\n\t\t\tif t, ok := def... | [
"0.66913444",
"0.64157486",
"0.61856574",
"0.61356175",
"0.5997691",
"0.589548",
"0.57147914",
"0.56822777",
"0.56303346",
"0.5599357",
"0.5589933",
"0.55740947",
"0.5566793",
"0.5553001",
"0.55090463",
"0.5508715",
"0.5495265",
"0.54901445",
"0.5487085",
"0.5477915",
"0.5435... | 0.8132264 | 0 |
ParseSwaggerDependencyTree parses the entire dependency tree of a magma swagger spec file specified by the rootFilepath parameter. The returned value maps between the absolute specified dependency filepath and the parsed struct for the dependency file. | func ParseSwaggerDependencyTree(rootFilepath string, rootDir string) (map[string]MagmaSwaggerSpec, error) {
absRootFilepath, err := filepath.Abs(rootFilepath)
if err != nil {
return nil, fmt.Errorf("root filepath %s is invalid: %w", rootFilepath, err)
}
targetSpec, err := readSwaggerSpec(absRootFilepath)
if err... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (m *Matcher) GeneratorDependencyTree(manifestFilePath string) string {\n\tlog.Debug().Msgf(\"Executing: Generate dependencies.txt\")\n\tmaven, err := exec.LookPath(\"mvn\")\n\tif err != nil {\n\t\tlog.Fatal().Err(err).Msgf(\"Please make sure Maven is installed. Hint: Check same by executing: mvn --version \\n... | [
"0.44742846",
"0.4455825",
"0.43550068",
"0.43006805",
"0.4232624",
"0.41817617",
"0.40636328",
"0.40288898",
"0.39767098",
"0.39680606",
"0.39440867",
"0.3909975",
"0.38882518",
"0.38842115",
"0.38663462",
"0.3862431",
"0.38287383",
"0.38224056",
"0.3783585",
"0.37813827",
"... | 0.8142745 | 0 |
MarshalToYAML marshals a MagmaSwaggerSpec to a YAMLformatted string. | func (m *MagmaSwaggerSpec) MarshalToYAML() (string, error) {
d, err := yaml.Marshal(&m)
if err != nil {
return "", err
}
return string(d), nil
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (d LegacyDec) MarshalYAML() (interface{}, error) {\n\treturn d.String(), nil\n}",
"func (c *Components) MarshalYAML() (interface{}, error) {\n\tnb := high.NewNodeBuilder(c, c.low)\n\treturn nb.Render(), nil\n}",
"func (f Fixed8) MarshalYAML() (interface{}, error) {\n\treturn f.String(), nil\n}",
"func (... | [
"0.6445463",
"0.6326264",
"0.63029575",
"0.63027453",
"0.6261498",
"0.6249017",
"0.6187328",
"0.6172001",
"0.61505026",
"0.6124385",
"0.6124385",
"0.60929036",
"0.6092049",
"0.6075512",
"0.6065055",
"0.6051939",
"0.60301274",
"0.6030115",
"0.59681195",
"0.5957629",
"0.5953704... | 0.77819127 | 0 |
OK, nothing special here | func Hash(data []byte) [blake2b.Size]byte {
return blake2b.Sum512(data)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func curate(file *pe.File) []byte {\n\n\tm := make(map[string]interface{})\n\tfields := make([]string, 0)\n\n\tif file.HasDOSHdr {\n\t\tm[\"dos_header\"] = file.DOSHeader\n\t\tfields = append(fields, \"dos_header\")\n\t}\n\n\tif file.HasRichHdr {\n\t\tm[\"rich_header\"] = file.RichHeader\n\t\tfields = append(field... | [
"0.48523924",
"0.47066402",
"0.4516987",
"0.4516987",
"0.4516987",
"0.4516987",
"0.45057568",
"0.4504245",
"0.44656408",
"0.44644177",
"0.4460515",
"0.44400802",
"0.44385478",
"0.44224203",
"0.44211292",
"0.44093663",
"0.44025904",
"0.4399125",
"0.4385478",
"0.4383673",
"0.43... | 0.0 | -1 |
Compute and check the hash | func CheckHash(data []byte, target [blake2b.Size]byte) bool {
if Hash(data) == target {
return true
} else {
return false
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func computeHash(w http.ResponseWriter, req *http.Request) {\n\tvalues := req.URL.Query()\n\tdata := values.Get(\"data\")\n\tif data == \"\" {\n\t\tw.WriteHeader(http.StatusBadRequest)\n\t\tw.Write([]byte(\"400 - data param not present\"))\n\t\treturn\n\t}\n\tsalt := values.Get(\"salt\")\n\tif salt == \"\" {\n\t... | [
"0.69898987",
"0.6741546",
"0.67407966",
"0.6724998",
"0.6688802",
"0.6658574",
"0.66341126",
"0.6630911",
"0.66244596",
"0.66141754",
"0.66067123",
"0.6591132",
"0.65789235",
"0.6557145",
"0.65372247",
"0.6517661",
"0.6517661",
"0.6517661",
"0.64942336",
"0.6490384",
"0.6477... | 0.0 | -1 |
/ Starting Point : 1 Starting Point 2 : 1 | func ConvertXY(src int, dst int) int {
que := new(Queue)
visited := make(map[int]int)
que.Add([]int{src, 0})
for que.Len() != 0 {
node := que.Remove().([]int)
visited[node[0]] = 1
value := node[0]
steps := node[1]
if value == dst {
return steps
}
if _, ok := visited[value*2]; !ok && value < dst {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func firstStep(y int) {\n\tfmt.Println(\"1.1\", y)\n\ty = 52 // 1.4 assign y to 52\n\tfmt.Println(\"1.2\", y)\n}",
"func stepfrom(dir rune, x, y int) (sx, sy int) {\n\tswitch dir {\n\tcase 'N':\n\t\treturn x, y + 1\n\tcase 'S':\n\t\treturn x, y - 1\n\tcase 'W':\n\t\treturn x + 1, y\n\tcase 'E':\n\t\treturn x - 1... | [
"0.5825244",
"0.5791528",
"0.558185",
"0.55745775",
"0.55386",
"0.55188316",
"0.54899657",
"0.5474828",
"0.54533607",
"0.5444746",
"0.54436755",
"0.54403",
"0.5420142",
"0.5400024",
"0.5377683",
"0.5345384",
"0.5345",
"0.52899605",
"0.5273703",
"0.525066",
"0.5220603",
"0.5... | 0.0 | -1 |
/ Steps to convert 2 to 7: 3 | func maxSlidingWindows(arr []int, k int) {
size := len(arr)
for i := 0; i < size-k+1; i++ {
max := arr[i]
for j := 1; j < k; j++ {
if max < arr[i+j] {
max = arr[i+j]
}
}
fmt.Print(max, " ")
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func stepPerms(n int32) int32 {\n\tif n < 3 {\n\t\treturn n\n\t}\n\n\ta, b, c, current := 1, 2, 4, 0\n\n\tfor i := int32(3); i < n; i++ {\n\t\tcurrent = a + b + c\n\t\ta, b = b, c\n\t\tc = current\n\t}\n\n\treturn int32(c)\n}",
"func solve2(input string) string {\n\tlist := parseInput(input)\n\ti := 0\n\tn := 0\... | [
"0.56478983",
"0.54741895",
"0.54507023",
"0.543882",
"0.5436077",
"0.5412232",
"0.5351659",
"0.5347985",
"0.53406036",
"0.53287077",
"0.5303835",
"0.52942103",
"0.5291034",
"0.5268272",
"0.5268217",
"0.5260187",
"0.52593374",
"0.5203191",
"0.51988673",
"0.51940155",
"0.51879... | 0.0 | -1 |
/ 75 92 92 92 90 75 92 92 92 90 | func minOfMaxSlidingWindows(arr []int, k int) {
size := len(arr)
que := new(Queue)
minVal := math.MaxInt32
i := 0
for i < size {
// Remove out of range elements
if que.Len() > 0 && que.Front().(int) <= i-k {
que.Remove()
}
// Remove smaller values at left.
for que.Len() > 0 && arr[que.Back().(int)] <=... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func main() {\n\tvalues := []string{\"ABC\", \"ACB\", \"BAC\", \"BCA\", \"CAB\", \"CBA\"}\n\t// values := []string{\"to\", \"to\", \"top\", \"ton\", \"tom\"}\n\tfactor := []int{100, 10, 1}\n\n\t// 65x100 + 66x10 + 67x1 = 7227\n\thashKey := 0\n\tfor v := range values {\n\t\tbytes := []byte(values[v])\n\t\tf := 0\n\... | [
"0.58024555",
"0.5661549",
"0.5576845",
"0.5349433",
"0.5328527",
"0.5309565",
"0.53035676",
"0.5302726",
"0.52974",
"0.5284454",
"0.5270035",
"0.5224862",
"0.52078164",
"0.5188299",
"0.5173334",
"0.5172408",
"0.5172408",
"0.5172408",
"0.5172408",
"0.5172408",
"0.5172408",
... | 0.0 | -1 |
Min of max is: 75 | func maxOfMinSlidingWindows(arr []int, k int) {
size := len(arr)
que := new(Queue)
maxVal := math.MinInt32
i := 0
for i < size {
// Remove out of range elements
if que.Len() > 0 && que.Front().(int) <= i-k {
que.Remove()
}
// Remove smaller values at left.
for que.Len() > 0 && arr[que.Back().(int)] >=... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func MinMax(x, min, max int) int { return x }",
"func (p parseSpec) minMax() (int, int) {\n\tmaxVal := -math.MaxInt64\n\tminVal := math.MaxInt64\n\tfor _, v := range p {\n\t\tif v > maxVal {\n\t\t\tmaxVal = v\n\t\t} else if v < minVal {\n\t\t\tminVal = v\n\t\t}\n\t}\n\treturn minVal, maxVal\n}",
"func minmax(a... | [
"0.74028397",
"0.6915779",
"0.66241217",
"0.6616075",
"0.6559249",
"0.64556175",
"0.6428241",
"0.6380175",
"0.6302906",
"0.62899035",
"0.62846214",
"0.626812",
"0.6259294",
"0.6231927",
"0.62230694",
"0.6221588",
"0.62114716",
"0.6209669",
"0.62021357",
"0.61924946",
"0.61843... | 0.0 | -1 |
/ Max of min is: 59 | func firstNegSlidingWindows(arr []int, k int) {
size := len(arr)
que := new(Queue)
i := 0
for i < size {
// Remove out of range elements
if que.Len() > 0 && que.Front().(int) <= i-k {
que.Remove()
}
if arr[i] < 0 {
que.Add(i)
}
// window of size k
if i >= (k - 1) {
if que.Len() > 0 {
fmt.... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func normalizeMinutes(min int) (int, int) {\n\tflag := false\n\taddHours := 0\n\tif min < 0 {\n\t\tflag = !flag\n\t\tmin = -1 * min\n\t}\n\n\tif min >= 60 {\n\t\taddHours = min / 60\n\t\tmin = min % 60\n\t}\n\n\tif flag {\n\t\tif min > 0 {\n\t\t\tmin = 60 - min\n\t\t\taddHours += 1\n\t\t}\n\t\taddHours = -1 * addH... | [
"0.61662334",
"0.57398677",
"0.5701072",
"0.5669399",
"0.5604872",
"0.5507069",
"0.54734653",
"0.5398669",
"0.5395211",
"0.5355866",
"0.5341673",
"0.52995133",
"0.52645224",
"0.5257398",
"0.5246607",
"0.523801",
"0.5223781",
"0.5210974",
"0.5200304",
"0.5191768",
"0.51909083"... | 0.0 | -1 |
/ 2 2 6 14 14 NAN | func RottenFruitUtil(arr [][]int, maxCol int, maxRow int, currCol int, currRow int, traversed [][]int, day int) {
if currCol < 0 || currCol >= maxCol || currRow < 0 || currRow >= maxRow {
return
}
// Traversable and rot if not already rotten.
if traversed[currCol][currRow] <= day || arr[currCol][currRow] == 0 {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func NaN() float32 { return Float32frombits(uvnan) }",
"func fillNaNDense(m *mat.Dense) {\n\tr, c := m.Dims()\n\tfor i := 0; i < r; i++ {\n\t\tfor j := 0; j < c; j++ {\n\t\t\tm.Set(i, j, math.NaN())\n\t\t}\n\t}\n}",
"func (a *Array64) NaNSum(axis ...int) *Array64 {\n\tif a.valAxis(&axis, \"NaNSum\") {\n\t\tret... | [
"0.602442",
"0.58442634",
"0.5628861",
"0.56243914",
"0.55352783",
"0.55352783",
"0.55352783",
"0.55352783",
"0.5477595",
"0.5387952",
"0.5378903",
"0.5312592",
"0.52907044",
"0.52907044",
"0.52536094",
"0.5228146",
"0.5210892",
"0.5192936",
"0.5192836",
"0.5192836",
"0.51296... | 0.0 | -1 |
/ RottenFruit : 3 RottenFruit2 : 3 | func StepsOfKnightUtil(size int, currCol int, currRow int, traversed [][]int, dist int) {
// Range check
if currCol < 0 || currCol >= size || currRow < 0 || currRow >= size {
return
}
// Traverse if not already traversed.
if traversed[currCol][currRow] <= dist {
return
}
dir := [][]int{{-2, -1}, {-2, 1}, {... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func printTally(wrapped, dropped int64) {\n\tfmt.Println(\"\\n--------------------------------------\")\n\tfmt.Printf(\"%-10s : %02d\\n\", \"Total\", chocolateCount)\n\tfmt.Printf(\"%-10s : %02d\\n\", \"Wrapped\", wrapped)\n\tfmt.Printf(\"%-10s : %02d\\n\", \"Dropped\", dropped)\n\tfmt.Println(\"------------------... | [
"0.48526704",
"0.45791003",
"0.45148775",
"0.45120233",
"0.45096675",
"0.4484106",
"0.44114172",
"0.44073385",
"0.43790644",
"0.4351559",
"0.43006048",
"0.42932254",
"0.42848495",
"0.4264322",
"0.42597494",
"0.42453548",
"0.4244313",
"0.42309946",
"0.422844",
"0.4227956",
"0.... | 0.0 | -1 |
/ StepsOfKnight : 8 StepsOfKnight2 : 8 | func DistNearestFillUtil(arr [][]int, maxCol int, maxRow int, currCol int, currRow int, traversed [][]int, dist int) {
// Range check
if currCol < 0 || currCol >= maxCol || currRow < 0 || currRow >= maxRow {
return
}
// Traversable if there is a better distance.
if traversed[currCol][currRow] <= dist {
return... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func StepsOfKnightUtil(size int, currCol int, currRow int, traversed [][]int, dist int) {\n\t// Range check\n\tif currCol < 0 || currCol >= size || currRow < 0 || currRow >= size {\n\t\treturn\n\t}\n\n\t// Traverse if not already traversed.\n\tif traversed[currCol][currRow] <= dist {\n\t\treturn\n\t}\n\n\tdir := [... | [
"0.631437",
"0.6289041",
"0.5995027",
"0.5943802",
"0.58128786",
"0.5675189",
"0.5543537",
"0.55353135",
"0.55158156",
"0.5515774",
"0.54764587",
"0.54721206",
"0.5456247",
"0.5381262",
"0.5378672",
"0.53775716",
"0.53614694",
"0.5350701",
"0.53365123",
"0.53184175",
"0.52972... | 0.0 | -1 |
/ 0 1 0 0 1 0 0 1 0 1 1 1 2 1 0 2 2 2 1 0 3 3 2 1 0 | func findLargestIslandUtil(arr [][]int, maxCol int, maxRow int, currCol int, currRow int, traversed [][]bool) int {
dir := [][]int{{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}}
var x, y int
var sum = 1
// Traverse in all eight directions.
for i := 0; i < 8; i++ {
x = currCol + dir[i][0]
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func createSet(input [9]int8) int16 {\n\tvar used int16 = 0\n\tfor i := 0; i < 9; i++ {\n\t\tused += (1 << uint(input[i] - 1))\n\t}\n\treturn used;\n}",
"func duplicateZeros1(arr []int) {\n\tvar count int\n\tn := len(arr)\n\tfor _, v := range arr {\n\t\tif v == 0 {\n\t\t\tcount++\n\t\t}\n\t}\n\n\tfor i := n - 1;... | [
"0.5901486",
"0.57600516",
"0.5691947",
"0.56687385",
"0.5632322",
"0.56271887",
"0.5624384",
"0.5614425",
"0.5581852",
"0.557765",
"0.5537337",
"0.54688233",
"0.5465581",
"0.54486245",
"0.54246455",
"0.5421789",
"0.541518",
"0.54054135",
"0.5336431",
"0.5312148",
"0.52895814... | 0.0 | -1 |
/ Largest Island: 12 | func main() {
main1()
main2()
main3()
main4()
main5()
main6()
main7()
main8()
main9()
main10()
main11()
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func main() {\n\thighestStartingPoint := 0\n\thighestValue := 0\n\tfor i := 1; i < 1000000; i++ {\n\t\tlatz := collatz.From(i)\n\t\tif latz.Length > highestValue {\n\t\t\thighestStartingPoint = i\n\t\t\thighestValue = latz.Length\n\t\t}\n\t}\n\n\tfmt.Println(highestStartingPoint)\n}",
"func findLargestIslandUtil... | [
"0.66160476",
"0.64744246",
"0.618712",
"0.61700565",
"0.6037497",
"0.5992314",
"0.59851134",
"0.59376025",
"0.5864505",
"0.5848303",
"0.5829246",
"0.5827219",
"0.5810036",
"0.5801721",
"0.579599",
"0.57703656",
"0.57446194",
"0.5703196",
"0.57013416",
"0.56909364",
"0.568791... | 0.0 | -1 |
create a master node and initialize its channels | func NewMaster() *Master {
m := &Master{
subMap: map[string]*Submission{},
jobChan: make(chan *WorkerJob, 0),
NodeHandles: map[string]*NodeHandle{}}
http.Handle("/master/", websocket.Handler(func(ws *websocket.Conn) { m.Listen(ws) }))
return m
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func NewMasterNode() *MasterNode {\n\tcurrentNode := MasterNode{}\n\tcurrentNode.Slaves = make(map[*websocket.Conn]bool)\n\tcurrentNode.broadcast = make(chan []byte)\n\treturn ¤tNode\n}",
"func (n *MasterNode) StartMasterNode(host string, port int) {\n\t// Configure websocket route\n\thttp.HandleFunc(\"/ws... | [
"0.66622347",
"0.64293945",
"0.6145258",
"0.60843116",
"0.597381",
"0.5962286",
"0.5953004",
"0.5896927",
"0.5833437",
"0.5825309",
"0.5784566",
"0.57775766",
"0.5761488",
"0.5743756",
"0.5732949",
"0.57158387",
"0.56984013",
"0.567924",
"0.56664616",
"0.5651798",
"0.56275845... | 0.60488987 | 4 |
sends a message to every connected worker | func (m *Master) Broadcast(msg *WorkerMessage) {
m.nodeMu.RLock()
logger.Debug("Broadcast(%v): to %v nodes", *msg, len(m.NodeHandles))
for _, nh := range m.NodeHandles {
nh.BroadcastChan <- msg
}
m.nodeMu.RUnlock()
logger.Debug("Broadcast(): done")
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func handleMessages(){\r\n\tfor{\r\n\t\t// get next message from broadcast channel\r\n\t\tmsg := <- broadcast\r\n\r\n\t\t// send message to each currently connected client\r\n\t\tfor client := range clients{\r\n\t\t\terr := client.WriteJSON(msg)\r\n\r\n\t\t\tif err != nil{\r\n\t\t\t\tlog.Println(\"@ handleMessages... | [
"0.6683119",
"0.66107297",
"0.6527772",
"0.64723986",
"0.64621276",
"0.64592254",
"0.64288116",
"0.64274037",
"0.6404339",
"0.6387626",
"0.6385022",
"0.63430643",
"0.62988806",
"0.6289499",
"0.6284704",
"0.62429345",
"0.6237176",
"0.62246853",
"0.6220611",
"0.62152636",
"0.62... | 0.6004114 | 36 |
remove node handles from the map used to store them as they disconnect | func (m *Master) RemoveNodeOnDeath(nh *NodeHandle) {
logger.Debug("RemoveNodeOnDeath(%v)", nh.NodeId)
<-nh.Con.DiedChan
m.nodeMu.Lock()
delete(m.NodeHandles, nh.NodeId)
m.nodeMu.Unlock()
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func cbRemoveConnection(hConn C.MQHCONN) {\n\t// Remove all of the hObj values for this hconn\n\tkey := makePartialKey(hConn)\n\tmapLock()\n\tfor k, _ := range cbMap {\n\t\tif strings.HasPrefix(k, key) {\n\t\t\tdelete(cbMap, k)\n\t\t}\n\t}\n\tmapUnlock()\n}",
"func (g *Graph) cleanNodes() {\n\tcleaned := []*Node... | [
"0.5977338",
"0.57795995",
"0.5744829",
"0.56060827",
"0.54988384",
"0.5470038",
"0.54184693",
"0.5405626",
"0.53601146",
"0.53557134",
"0.5353138",
"0.53511405",
"0.53385425",
"0.53376305",
"0.52991736",
"0.52857304",
"0.52746004",
"0.52491444",
"0.5248946",
"0.52391887",
"0... | 0.0 | -1 |
/ The function NewObjectLength calls NewUnaryFunctionBase to create a function named OBJECT_LENGTH with an expression as input. | func NewObjectLength(operand Expression) Function {
rv := &ObjectLength{
*NewUnaryFunctionBase("object_length", operand),
}
rv.expr = rv
return rv
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (this *ObjectLength) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectLength(operands[0])\n\t}\n}",
"func (this *ObjectLength) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectLength(operands[... | [
"0.6523122",
"0.6523122",
"0.5879528",
"0.585225",
"0.57606673",
"0.57606673",
"0.57047075",
"0.56010866",
"0.5507508",
"0.5425705",
"0.5425705",
"0.5403266",
"0.53994787",
"0.53820825",
"0.5202233",
"0.5193633",
"0.5174063",
"0.5164767",
"0.5130811",
"0.5112785",
"0.5112785"... | 0.84461415 | 1 |
/ It calls the VisitFunction method by passing in the receiver to and returns the interface. It is a visitor pattern. | func (this *ObjectLength) Accept(visitor Visitor) (interface{}, error) {
return visitor.VisitFunction(this)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (this *NowStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}",
"func (e FunctionCallExpression) Visit(env Environment) Value {\n\treturn NoneValue()\n}",
"func (i *InterfaceSet) Visit(n ast.Node) (w ast.Visitor) {\n\tswitch n := n.(type) {\n\tcase *ast.TypeSpec:\n... | [
"0.60175425",
"0.5906299",
"0.59027874",
"0.5845828",
"0.5825935",
"0.5819577",
"0.5819577",
"0.580104",
"0.5785162",
"0.5777933",
"0.5703701",
"0.56876904",
"0.56876904",
"0.5627525",
"0.5536116",
"0.549273",
"0.5463964",
"0.5434355",
"0.54164505",
"0.54164505",
"0.5402595",... | 0.54699755 | 17 |
/ It returns a value type NUMBER. | func (this *ObjectLength) Type() value.Type { return value.NUMBER } | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (v Value) Number() (Number, error) {\n\tr := bytes.NewReader(v.bytes)\n\treturn byteReaderToNumber(v.dataType, r)\n}",
"func getNumber(v interface{}) (int64, error) {\n\tswitch v := v.(type) {\n\tcase int:\n\t\treturn int64(v), nil\n\tcase int8:\n\t\treturn int64(v), nil\n\tcase int16:\n\t\treturn int64(v),... | [
"0.70115584",
"0.6969048",
"0.6674587",
"0.66428035",
"0.6590476",
"0.65527546",
"0.64667314",
"0.64667314",
"0.64667314",
"0.64667314",
"0.63752025",
"0.63733643",
"0.6349295",
"0.629919",
"0.62977487",
"0.62339395",
"0.61801726",
"0.6162864",
"0.6155927",
"0.6140079",
"0.60... | 0.55151886 | 48 |
/ Calls the Eval method for unary functions and passes in the receiver, current item and current context. | func (this *ObjectLength) Evaluate(item value.Value, context Context) (value.Value, error) {
return this.UnaryEval(this, item, context)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (fn NoArgFunc) Eval(ctx *Context, r Row) (interface{}, error) {\n\treturn fn.Logic(ctx, r)\n}",
"func (bp *BinaryPlus) Eval() float64 {\n\treturn bp.left.(Eval).Eval() + bp.right.(Eval).Eval()\n}",
"func (ast *Unary) Eval(env *Env, ctx *Codegen, gen *ssa.Generator) (\n\tssa.Value, bool, error) {\n\texpr, ... | [
"0.65601635",
"0.62554264",
"0.610906",
"0.6098628",
"0.60711527",
"0.6037241",
"0.5988044",
"0.5928711",
"0.5928711",
"0.58814615",
"0.587307",
"0.58361375",
"0.5803793",
"0.5803793",
"0.5791637",
"0.5744556",
"0.57429147",
"0.5731631",
"0.5702675",
"0.5695341",
"0.56899124"... | 0.0 | -1 |
/ This method returns the length of the object. If the type of input is missing then return a missing value, and if not an object return a null value. Convert it to a valid Go type. Cast it to a map from string to interface and return its length by using the len function by casting it to float64. | func (this *ObjectLength) Apply(context Context, arg value.Value) (value.Value, error) {
if arg.Type() == value.MISSING {
return value.MISSING_VALUE, nil
} else if arg.Type() != value.OBJECT {
return value.NULL_VALUE, nil
}
oa := arg.Actual().(map[string]interface{})
return value.NewValue(float64(len(oa))), n... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (o *FakeObject) Length() int { return reflect.ValueOf(o.Value).Len() }",
"func length(v interface{}) (int, error) {\n\tswitch val := v.(type) {\n\tcase string:\n\t\treturn len(val), nil\n\tcase []interface{}:\n\t\treturn len(val), nil\n\tcase map[string]interface{}:\n\t\treturn len(val), nil\n\tdefault:\n\t... | [
"0.6576737",
"0.641415",
"0.6306101",
"0.6094734",
"0.60418206",
"0.6018301",
"0.5996876",
"0.59715265",
"0.5953909",
"0.5932843",
"0.590009",
"0.5885789",
"0.5872587",
"0.58563036",
"0.58299994",
"0.57967377",
"0.57810503",
"0.576028",
"0.5746586",
"0.57231796",
"0.5718099",... | 0.596643 | 9 |
/ The constructor returns a NewObjectLength with the an operand cast to a Function as the FunctionConstructor. | func (this *ObjectLength) Constructor() FunctionConstructor {
return func(operands ...Expression) Function {
return NewObjectLength(operands[0])
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (this *ObjectAdd) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectAdd(operands[0], operands[1], operands[2])\n\t}\n}",
"func (this *ObjectRemove) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewOb... | [
"0.7275384",
"0.69671285",
"0.6962341",
"0.68921953",
"0.6845353",
"0.6845353",
"0.68416286",
"0.68416286",
"0.6744794",
"0.6708235",
"0.6654913",
"0.6654913",
"0.66427934",
"0.6617833",
"0.6557411",
"0.6531051",
"0.65282565",
"0.65282565",
"0.6448263",
"0.6430938",
"0.642644... | 0.79440147 | 1 |
/ The function NewObjectNames calls NewUnaryFunctionBase to create a function named OBJECT_NAMES with an expression as input. | func NewObjectNames(operand Expression) Function {
rv := &ObjectNames{
*NewUnaryFunctionBase("object_names", operand),
}
rv.expr = rv
return rv
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (this *ObjectNames) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectNames(operands[0])\n\t}\n}",
"func (this *ObjectNames) Constructor() FunctionConstructor {\n\treturn func(operands ...Expression) Function {\n\t\treturn NewObjectNames(operands[0])\... | [
"0.58631206",
"0.58631206",
"0.5818655",
"0.5258608",
"0.5123252",
"0.5123252",
"0.50969934",
"0.5032237",
"0.50116974",
"0.5003598",
"0.49712798",
"0.48637605",
"0.48614097",
"0.4857428",
"0.48428673",
"0.4813975",
"0.48088303",
"0.4790116",
"0.478159",
"0.478159",
"0.477660... | 0.8870936 | 1 |
/ It calls the VisitFunction method by passing in the receiver to and returns the interface. It is a visitor pattern. | func (this *ObjectNames) Accept(visitor Visitor) (interface{}, error) {
return visitor.VisitFunction(this)
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"func (this *NowStr) Accept(visitor Visitor) (interface{}, error) {\n\treturn visitor.VisitFunction(this)\n}",
"func (e FunctionCallExpression) Visit(env Environment) Value {\n\treturn NoneValue()\n}",
"func (i *InterfaceSet) Visit(n ast.Node) (w ast.Visitor) {\n\tswitch n := n.(type) {\n\tcase *ast.TypeSpec:\n... | [
"0.601801",
"0.59070253",
"0.59054166",
"0.58446676",
"0.58266926",
"0.5820728",
"0.5820728",
"0.5802115",
"0.57868934",
"0.577937",
"0.57069504",
"0.5627799",
"0.5535857",
"0.5494115",
"0.5471187",
"0.5471187",
"0.5465064",
"0.5435572",
"0.54174775",
"0.54174775",
"0.5403646... | 0.56891 | 12 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.