Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:perm1 (Results 1 - 4 of 4) sorted by null

/prebuilts/go/darwin-x86/test/bench/shootout/
fannkuch.c	50 Aint* perm1; local 63 perm1 = calloc(n, sizeof(*perm1)); 66 for( i=0 ; i<n ; ++i ) perm1[i] = i; /* initial (trivial) permu */ 71 for( i=0 ; i<n ; ++i ) printf("%d", (int)(1+perm1[i])); 81 if( ! (perm1[0]==0 || perm1[n1]==n1) ) { 83 for( i=1 ; i<n ; ++i ) { /* perm = perm1 */ 84 perm[i] = perm1[i]; 86 k = perm1[0]; /* cache perm[0] in k *     [all...]
fannkuch.go	54 perm1 := make([]int, n) 58 perm1[i] = i // initial (trivial) permutation 67 fmt.Printf("%d", 1+perm1[i]) 76 if perm1[0] != 0 && perm1[n1] != n1 { 78 for i := 1; i < n; i++ { // perm = perm1 79 perm[i] = perm1[i] 81 k := perm1[0] // cache perm[0] in k 102 perm0 := perm1[0] 104 perm1[i] = perm1[i+1     [all...]
/prebuilts/go/linux-x86/test/bench/shootout/
fannkuch.c	50 Aint* perm1; local 63 perm1 = calloc(n, sizeof(*perm1)); 66 for( i=0 ; i<n ; ++i ) perm1[i] = i; /* initial (trivial) permu */ 71 for( i=0 ; i<n ; ++i ) printf("%d", (int)(1+perm1[i])); 81 if( ! (perm1[0]==0 || perm1[n1]==n1) ) { 83 for( i=1 ; i<n ; ++i ) { /* perm = perm1 */ 84 perm[i] = perm1[i]; 86 k = perm1[0]; /* cache perm[0] in k *     [all...]
fannkuch.go	54 perm1 := make([]int, n) 58 perm1[i] = i // initial (trivial) permutation 67 fmt.Printf("%d", 1+perm1[i]) 76 if perm1[0] != 0 && perm1[n1] != n1 { 78 for i := 1; i < n; i++ { // perm = perm1 79 perm[i] = perm1[i] 81 k := perm1[0] // cache perm[0] in k 102 perm0 := perm1[0] 104 perm1[i] = perm1[i+1     [all...]

Completed in 69 milliseconds