/* -----------------------------------------------------------------------------
Copyright 2021 Kevin P. Barry

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

    http://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.
----------------------------------------------------------------------------- */

// Author: Kevin P. Barry [ta0kira@gmail.com]

define StateExecutor {
  multiplexStates (original,random) {
    HashedMap<Int,StateMachine> states <- HashedMap<Int,StateMachine>.new()
    CategoricalTree<Int> weights <- CategoricalTree<Int>.new()

    scoped {
      Int index <- 0
    } in traverse (original.defaultOrder() -> StateMachine state) {
      \ states.set(index,state)
      \ weights.setWeight(index,1)
    } update {
      index <- index+1
    }
    $Hidden[original]$

    while (weights.getTotal() > 0) {
      Int index <- weights.locate((random.generate()*weights.getTotal().asFloat()).asInt())
      scoped {
        optional StateMachine newState <- require(states.get(index)).transition()
      } in if (present(newState)) {
        \ states.set(index,require(newState))
      } else {
        \ states.remove(index)
        \ weights.setWeight(index,0)
      }
    }
  }
}