Lines Matching refs:int8
46 func boolInt(b bool) int8 {
104 var piece_def = [10][4]int8{
105 [4]int8{E, E, E, SE},
106 [4]int8{SE, E, NE, E},
107 [4]int8{E, E, SE, SW},
108 [4]int8{E, E, SW, SE},
109 [4]int8{SE, E, NE, S},
110 [4]int8{E, E, SW, E},
111 [4]int8{E, SE, SE, NE},
112 [4]int8{E, SE, SE, W},
113 [4]int8{E, SE, E, E},
114 [4]int8{E, E, E, SW},
130 next_cell [10][50][12]int8
134 func rotate(dir int8) int8 { return (dir + 2) % PIVOT }
137 func flip(dir int8) int8 { return (PIVOT - dir) % PIVOT }
144 func shift(cell, dir int8) int8 {
210 func out_of_bounds(cell, dir int8) bool {
259 func calc_cell_indices(cell []int8, piece int, index int8) {
267 func cells_fit_on_board(cell []int8, piece int) bool {
278 func minimum_of_cells(cell []int8) int8 {
292 func first_empty_cell(cell []int8, minimum int8) int8 {
305 func bitmask_from_cells(cell []int8) uint64 {
316 func record_piece(piece int, minimum int8, first_empty int8, piece_mask uint64) {
325 func fill_contiguous_space(board []int8, index int8) {
356 func has_island(cell []int8, piece int) bool {
357 temp_board := make([]int8, 50)
366 fill_contiguous_space(temp_board, int8(i))
388 cell := make([]int8, 5)
391 calc_cell_indices(cell, piece, int8(index))
425 all_rows = [32]int8{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
428 bad_even_rows [32][32]int8
429 bad_odd_rows [32][32]int8
430 bad_even_triple [32768]int8
431 bad_odd_triple [32768]int8
434 func rows_bad(row1, row2 int8, even bool) int8 {
436 var row2_shift int8
497 for row1 := int8(0); row1 < 32; row1++ {
498 for row2 := int8(0); row2 < 32; row2++ {
528 func boardHasIslands(cell int8) int8 {
548 sol_nums [10]int8
550 solutions [2100][50]int8
569 func solve(depth, cell int8) {
578 for piece := int8(0); piece < 10; piece++ {
608 func pretty(b *[50]int8) {
618 func smallest_largest() (smallest, largest *[50]int8) {
