-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathquit_test.go
60 lines (53 loc) · 1.56 KB
/
quit_test.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
// Copyright 2019 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package emacs
import (
"log"
"math/big"
"time"
)
func ExampleEnv_ProcessInput() {
Export(mersennePrimeP, Doc("Return whether 2^N − 1 is probably prime."), Usage("N"))
}
func mersennePrimeP(e Env, n uint16) (bool, error) {
tick := time.NewTicker(100 * time.Millisecond)
defer tick.Stop()
// Start long-running operation in another goroutine. Note that we
// don’t pass any Env or Value values to the goroutine.
ch := make(chan bool)
go testMersennePrime(n, ch)
// Wait for either the operation to finish or the user to quit.
for {
select {
case r := <-ch:
return r, nil
case <-tick.C:
if err := e.ProcessInput(); err != nil {
log.Print("quitting")
return false, err // Emacs will ignore the return value
}
}
}
}
func testMersennePrime(n uint16, ch chan<- bool) {
x := big.NewInt(1)
x.Lsh(x, uint(n))
x.Sub(x, one)
ch <- x.ProbablyPrime(10)
log.Print("testMersennePrime finished")
}
var one = big.NewInt(1)
func init() {
ExampleEnv_ProcessInput()
}