GitHub - TeaEntityLab/fpGo: Monad, Functional Programming features for Golang (original) (raw)

fpGo

tag Go Report Card codecov Travis CI Build Status GoDoc

license stars forks

Monad, Functional Programming features for Golang

Active Branches:

For Generics version(>=go1.18):generics

go get github.com/TeaEntityLab/fpGo/v2

For NonGenerics version(<=go1.17):non-generics

go get github.com/TeaEntityLab/fpGo

Why

I love functional programing, Rx-style coding, and Optional usages.

However it's hard to implement them in Golang, and there're few libraries to achieve parts of them.

Thus I implemented fpGo. I hope you would like it :)

Features

Special thanks

Usage

Optional (IsPresent/IsNil, Or, Let)

var m MaybeDef[interface{}] var orVal int var boolVal bool

// IsPresent(), IsNil() m = Maybe.Just(1) boolVal = m.IsPresent() // true boolVal = m.IsNil() // false m = Maybe.Just(nil) boolVal = m.IsPresent() // false boolVal = m.IsNil() // true

// Or() m = Maybe.Just(1) fmt.Println((m.Or(3))) // 1 m = Maybe.Just(nil) fmt.Println((m.Or(3))) // 3

// Let() var letVal int letVal = 1 m = Maybe.Just(1) m.Let(func() { letVal = 2 }) fmt.Println(letVal) // letVal would be 2

letVal = 1 m = Maybe.Just(nil) m.Let(func() { letVal = 3 }) fmt.Println(letVal) // letVal would be still 1

MonadIO (RxObserver-like)

Example:

var m *MonadIODef[interface{}] var actualInt int

m = MonadIO.Just(1) actualInt = 0 m.Subscribe(Subscription[interface{}]{ OnNext: func(in interface{}) { actualInt, _ = Maybe.Just(in).ToInt() }, }) fmt.Println(actualInt) // actualInt would be 1

m = MonadIO.Just(1).FlatMap(func(in interface{}) *MonadIODef[interface{}] { v, _ := Maybe.Just(in).ToInt() return MonadIO.Just(v + 1) }) actualInt = 0 m.Subscribe(Subscription[interface{}]{ OnNext: func(in interface{}) { actualInt, _ = Maybe.Just(in).ToInt() }, }) fmt.Println(actualInt) // actualInt would be 2

Stream (inspired by Collection libs)

Example(Generics):

var s *StreamDef[int] var tempString = ""

s = StreamFromArray([]int{}).Append(1, 1).Extend(StreamFromArray([]int{2, 3, 4})) tempString = "" for _, v := range s.ToArray() { tempString += Maybe.Just(v).ToMaybe().ToString() } fmt.Println(tempString) // tempString would be "11234" s = s.Distinct() tempString = "" for _, v := range s.ToArray() { tempString += Maybe.Just(v).ToMaybe().ToString() } fmt.Println(tempString) // tempString would be "1234"

Example(Non-Generics/interface{}):

var s *StreamForInterfaceDef var tempString string

s = StreamForInterface.FromArrayInt([]int{}).Append(1, 1).Extend(StreamForInterface.FromArrayInt([]int{2, 3, 4})).Extend(StreamForInterface.FromArray([]interface{}{nil})).Extend(nil) tempString = "" for _, v := range s.ToArray() { tempString += Maybe.Just(v).ToMaybe().ToString() } fmt.Println(tempString) // tempString would be "11234" s = s.Distinct() tempString = "" for _, v := range s.ToArray() { tempString += Maybe.Just(v).ToMaybe().ToString() } fmt.Println(tempString) // tempString would be "1234" s = s.FilterNotNil() tempString = "" for _, v := range s.ToArray() { tempString += Maybe.Just(v).ToMaybe().ToString() } fmt.Println(tempString) // tempString would be "1234"

Queue(LinkedListQueue/ChannelQueue/BufferedChannelQueue/ConcurrentQueue) (inspired by Collection libs)

LinkedListQueue(Shift/Unshift/Push/Pop), ConcurrentQueue(inspired by Java)

Example:

var queue Queue[int] var stack Stack[int] var err error var result int

linkedListQueue := NewLinkedListQueueint queue = linkedListQueue stack = linkedListQueue concurrentQueue := NewConcurrentQueueint

// As a Queue, Put(val) in the TAIL and Take() in the HEAD err = queue.Offer(1) err = queue.Offer(2) err = queue.Offer(3) result, err = queue.Poll() // Result should be 1 result, err = queue.Poll() // Result should be 2 result, err = queue.Poll() // Result should be 3 result, err = queue.Poll() // Err: ErrQueueIsEmpty

// As a Stack, Push(val) & Pop() in the TAIL. err = stack.Push(1) err = stack.Push(2) err = stack.Push(3) result, err = stack.Pop() // Result should be 3 result, err = stack.Pop() // Result should be 2 result, err = stack.Pop() // Result should be 1 result, err = stack.Pop() // Err: ErrStackIsEmpty

BufferedChannelQueue(Offer/Take/TakeWithTimeout)

Example:

var err error var result int var timeout time.Duration

bufferedChannelQueue := NewBufferedChannelQueue[int](3, 10000, 100). SetLoadFromPoolDuration(time.Millisecond / 10). SetFreeNodeHookPoolIntervalDuration(1 * time.Millisecond)

err = queue.Offer(1) err = queue.Offer(2) err = queue.Offer(3) timeout = 1 * time.Millisecond result, err = bufferedChannelQueue.TakeWithTimeout(timeout) // Result should be 1 result, err = bufferedChannelQueue.TakeWithTimeout(timeout) // Result should be 2 result, err = bufferedChannelQueue.TakeWithTimeout(timeout) // Result should be 3

Actor (inspired by Akka/Erlang)

Actor common(send/receive/spawn/states)

Example:

actual := 0 // Channel for results resultChannel := make(chan interface{}, 1) // Message CMDs cmdSpawn := "spawn" cmdShutdown := "shutdown" // Testee actorRoot := Actor.New(func(self *ActorDef[interface{}], input interface{}) { // SPAWN: for ROOT if input == cmdSpawn { self.Spawn(func(self *ActorDef[interface{}], input interface{}) { // SHUTDOWN: for Children if input == cmdShutdown { self.Close() return }

  // INT cases: Children
  val, _ := Maybe.Just(input).ToInt()
  resultChannel <- val * 10
})
return

} // SHUTDOWN: for ROOT if input == cmdShutdown { for _, child := range self.children { child.Send(cmdShutdown) } self.Close()

close(resultChannel)
return

}

// INT cases: ROOT intVal, _ := Maybe.Just(input).ToInt() if intVal > 0 { for _, child := range self.children { child.Send(intVal) } } })

// Sequential Send messages(async) go func() { actorRoot.Send(cmdSpawn) actorRoot.Send(10) actorRoot.Send(cmdSpawn) actorRoot.Send(20) actorRoot.Send(cmdSpawn) actorRoot.Send(30) }()

i := 0 for val := range resultChannel { intVal, _ := Maybe.Just(val).ToInt() actual += intVal

i++ if i == 5 { go actorRoot.Send(cmdShutdown) } }

// Result would be 1400 (=1010+2010+2010+3010+3010+3010) fmt.Println(actual)

Actor Ask (inspired by Akka/Erlang)

actorRoot := Actor.New(func(self *ActorDef[interface{}], input interface{}) { // Ask cases: ROOT switch val := input.(type) { case *AskDef[interface{}, int]: intVal, _ := Maybe.Just(val.Message).ToInt()

    // NOTE If negative, hanging for testing Ask.timeout
    if intVal < 0 {
        break
    }

    val.Reply(intVal * 10)
    break
}

})

// var timer *time.Timer var timeout time.Duration timeout = 10 * time.Millisecond

// Normal cases // Result would be 10 actual = AskNewGenericsinterface{}, int.AskOnce(actorRoot) // Ask with Timeout // Result would be 20 actual, _ = AskNewGenericsinterface{}, int.AskOnceWithTimeout(actorRoot, timeout) // Ask channel // Result would be 30 ch := AskNewGenericsinterface{}, int.AskChannel(actorRoot) actual = <- ch close(ch)

// Timeout cases // Result would be 0 (zero value, timeout) actual, err = AskNewGenericsinterface{}, int.AskOnceWithTimeout(actorRoot, timeout)

Compose

Example:

var fn01 = func(args ...int) []int { val := args[0] return SliceOf(val + 1) } var fn02 = func(args ...int) []int { val := args[0] return SliceOf(val + 2) } var fn03 = func(args ...int) []int { val := args[0] return SliceOf(val + 3) }

// Result would be 6 result := Compose(fn01, fn02, fn03)((0))[0]