Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type AlternatingSchedule ¶
type AlternatingSchedule struct {
// contains filtered or unexported fields
}
AlternatingSchedule moves the LED from beginning to the end then moves from end to beginning again (i.e. the Knight Rider pattern :-))
func (*AlternatingSchedule) Next ¶
func (s *AlternatingSchedule) Next(count int) []bool
Next returns the next pattern
type BinarySchedule ¶
type BinarySchedule struct {
// contains filtered or unexported fields
}
BinarySchedule represents an increasing number as a set of bits
func (*BinarySchedule) Next ¶
func (s *BinarySchedule) Next(count int) []bool
Next returns the next pattern
type LinearSchedule ¶
type LinearSchedule struct {
// contains filtered or unexported fields
}
LinearSchedule moves the active LED from first to last and then starts from the beginning again
func (*LinearSchedule) Next ¶
func (ls *LinearSchedule) Next(count int) []bool
Next returns the next pattern
type RandomSchedule ¶
type RandomSchedule struct {
// contains filtered or unexported fields
}
RandomSchedule switches on a LED at random
func (*RandomSchedule) Next ¶
func (s *RandomSchedule) Next(count int) []bool
Next returns the next pattern
type ReverseBinarySchedule ¶
type ReverseBinarySchedule struct {
BinarySchedule
}
ReverseBinarySchedule represents an increasing number as a set of bits, but in the reverse order as BinarySchedule
func (*ReverseBinarySchedule) Next ¶
func (s *ReverseBinarySchedule) Next(count int) []bool
Next returns the next pattern
Source Files
Click to show internal directories.
Click to hide internal directories.