Actually there are several things going on. In general the database I'm trying to define would include not only the actual net list (ie a mapping between nets and pins), but also all the PCB junk that goes on.
The cyclic graph requires some type of mutability if I want to find the net that belongs to a node and also find the nodes that belong to a net, but I may have come up with something that works without mutability, which I described a while ago here: http://stackoverflow.com/questions/4580865/how-can-one-create-cyclic-and-immutable-data-structures-in-clojure-without-ext/10242730#10242730 . I haven't done much with that since I wrote it, so I'm not sure it'll work well. So far I'm overwhelmed at trying to think about how to capture all the features I've thought of. I guess I just need to start small. On Monday, August 11, 2014 7:58:02 AM UTC-7, Patrick Logan wrote: > > Space is one thing, but I would assume the net list should be able to > represent sequential logic, which implies a cyclic graph. -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
