README
¶
Sema 
Sema is a simple semaphore implementation for Go (golang) using channels to control concurrent access to shared resources. (Go still lacks a user accessible semaphore implementation in the standard library)
Example
Install
go get github.com/brunotm/sema
Usage
package main
import (
"time"
"github.com/brunotm/sema"
)
func main() {
max := 100
s := sema.New(max)
s.Acquire()
defer s.Release()
// DO WORK...
// OR
if s.TryAcquire() {
defer s.Release()
// DO WORK...
}
// OR
if s.AcquireWithin(5 * time.Millisecond) {
defer s.Release()
// DO WORK...
}
}
Written by Bruno Moura brunotm@gmail.com
Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Sema ¶
type Sema chan struct{}
Sema provides a simple semaphore implementation using a channel
func New ¶
New creates a new semaphore with the given maximum capacity for concurrent access. Will panic if cap < 1
func (Sema) Acquire ¶
func (s Sema) Acquire()
Acquire the semaphore, will block if semaphore is full until any other holder release it. Will panic if semaphore is nil
func (Sema) AcquireWithin ¶
AcquireWithin the given timeout return true on success and false on failure Will panic if semaphore is nil
func (Sema) Release ¶
func (s Sema) Release()
Release the semaphore Will panic if called on a non acquired semaphore
func (Sema) TryAcquire ¶
TryAcquire the semaphore without blocking return true on success and false on failure. Will panic if semaphore is nil
Source Files