How do you idiomatically implement a nontrivial typestate pattern in Rust? [closed]

By -

I'm trying to build the FSM of a simple CPU, which consists of about 40 states, with loops, and many conditionals across many variables of the overall CPU state. This FSM operates like a simple Turing Machine; reading memory cells (think vector of u16), computing some results, and storing them back into memory.

My question is: how is this implemented idiomatically in Rust?

The way I've considered it, you would do something like this:

  1. Have a base enum representing the states.
  2. Have another enum for each state which represents transitions (but maybe all in the same enum?).
  3. Somehow you'd have to access the CPU state (value of all the different registers etc) to know how to emit the next state transition, but to be efficient about it, you'd need to be able to pass different subsets of the CPU state, yet somehow only mutate a single copy that represents the CPU state after the computation.
  4. You could probably build a vector of "state diffs" which you could apply all at once when you reach certain states, which would also be good for implementing a simple debugger.

I'm new to rust, so modelling these sort of complex compositional type problems still doesn't come very naturally.

If you want to see how things work so far, I have a repo here: https://github.com/ijustlovemath/lrc3



Comments

Post a Comment

Popular posts from this blog

Today Walkin 14th-Sept

By -
Image
14th Sept 2017 ( GO Through all List) Read Walkin details properly , Try to call company before attending if possible !!! ==================================== 1. Myntra through fresherworld (Call Based , Venue shared to shortlisted candidates) _____________________________ 2. Magna : Hiring for Client Harman : C++
Read more

Spring Elasticsearch Operations

By -
Elasticsearch Operations Spring Data Elasticsearch uses two interfaces to define the operations that can be called against an Elasticsearch index. These are ElasticsearchOperations and ReactiveElasticsearchOperations. Whereas the first is used with the classic synchronous implementations, the second one uses reactive infrastructure. The default implementations of the interfaces offer: Read/Write mapping support for domain types. A rich query and criteria api. Resource management and Exception translation. ElasticsearchTemplate The ElasticsearchTemplate is an implementation of the ElasticsearchOperations interface using the Transport Client. @Configuration public class TransportClientConfig extends ElasticsearchConfigurationSupport {   @Bean   public Client elasticsearchClient() throws UnknownHostException {                      Settings settings = Settings.builder().put("cluster.name", "elasticsearch")....
Read more

Hibernate Search - Elasticsearch with JSON manipulation

By -
Elasticsearch with JSON manipulation Elasticsearch ships with many features. It is possible that at some point, one feature you need will not be exposed by the Search DSL. To work around such limitations, Hibernate Search provides ways to: Transform the HTTP request sent to Elasticsearch for search queries. Read the raw JSON of the HTTP response received from Elasticsearch for search queries. Direct changes to the HTTP request may conflict with Hibernate Search features and be supported differently by different versions of Elasticsearch. Similarly, the content of the HTTP response may change depending on the version of Elasticsearch, depending on which Hibernate Search features are used, and even depending on how Hibernate Search features are implemented. Thus, features relying on direct access to HTTP requests or responses cannot be guaranteed to continue to work when upgrading Hibernate Search, even for micro upgrades (x.y.z to x.y.(z+1)). Use this at your own risk....
Read more