cells-devel June 2004

cells-devel@common-lisp.net

3 participants
5 discussions

[cells-devel] Various announcements
by Kenny Tilton 20 Jun '04

20 Jun '04

-- I just uploaded ck200406.zip and .sig to the cells ftp area. contents next, but here's a scoop: "ck" is short for Code Kenny. Anything found in such an upload is simply my working code base. I have to back off the surprising amount of time it takes to worry about Cells/Cello qua open source projects (maintaining ASD files I do not use for actual work, sorting out things which break under Lispworks) and worry about making money for a while. FYI, the LPR files are text files one can read to see which files get loaded in which order, and which projects depend on which other projects. btw, if anyone sends in patches to make the code compatible with some other environment I will work those into my code base, i am just not going to push that myself at this point. -- I for one will be doing Cello under the Cells project on common-lisp.net until further notice. As I feared, too much overlap. -- the version of Cells in this zip is what I have been calling Cells II, because there was a fundamental re-working of some crucial internals. Vanilla semantics of Cells is unchanged, and edge cases should behave better. Internals themselves are insanely better. And for the first time I came up with a somewhat formal spec for Cells which guided the internals rewrite, which I will be sharing RSN. -- included also in the zip is Cells-LTk, derived from Peter Hersh's LTk. I started with the idea of wrapping LTk, but that was going to be a mess, so I just subsituted a widget framework based on Cells for the original. I will look next week at whether Cello can be simply given a Tk backend. -- the included Cello uses display lists for everything, and runs five times faster. This work has made FTGL (FreeType in OpenGL) misbehave quite a bit, but I have some ideas as to why. kenny -- Home? http://tilton-technology.com Cells? http://www.common-lisp.net/project/cells/ Cello? http://www.common-lisp.net/project/cello/ Why Lisp? http://alu.cliki.net/RtL%20Highlight%20Film Your Project Here! http://alu.cliki.net/Industry%20Application

1 0

[cells-devel] Update: Cells II, Cells/Tk, Cello
by Kenny Tilton 13 Jun '04

13 Jun '04

Cello has paused while OpenGL kicks my butt over "picking", in which one has OpenGL determine what in a scene has been clicked (actually, more generally) what in a scene is where. But I have had this working before, so I just have to figure out which monkey broke that. The real pause comes from: Cells/Tk. I think this will be a nice quicky alternative to Cello, and certainly not require so many libraries. Meanwhile, on "Notes From All Over" front, this laugher from the book I bought last night for Maya, the killer 3D animation and modeling app: Maya's architecture can be explained [in] a single line: "nodes with attributes which are connected" Small world, eh? :) And yes, they speak of the "dependency graph". kenny -- Home? http://tilton-technology.com Cells? http://www.common-lisp.net/project/cells/ Cello? http://www.common-lisp.net/project/cello/ Why Lisp? http://alu.cliki.net/RtL%20Highlight%20Film Your Project Here! http://alu.cliki.net/Industry%20Application

1 0

[cells-devel] Cells II Functional Requirements
by Kenny Tilton 08 Jun '04

08 Jun '04

Cells II seems to be OK, and is back at work running Cello as well as passing its regression tests. It will be released when I figure out whether to put everything up on the Cells or Cello project. I plan from here out to focus more on developing a commercial title (using Cello) than on porting Cello. This may mean I will not even look at OS X until the commercial title is ready to go and I want the OS X version (I will). This also means I want a very simple way to share my ongoing work on Cello/Cells and the easiest will be to have one cvs repository I update periodically. Anyway, for now, here is the spec which guided the Cells II rewrite: Suppose the application is at some steady state S in which all Cells (slots of instances) are either inputs (what I used to call c-variable) or have been computed from other Cells. Now the application polls a socket or OS event stream and gets a new input, which leads to some cell X being assigned a new value. Suppose also the new value for X is different from the prior value (according to a user-definable test). We now have not just a write operation but also a semantically meaningful change to X, so we also consider a new state S+ to have been established, with X being the only Cell to have reached state S+. Now suppose there exists some cell A which depends only on cell B which depends only on X. Suppose also that when cell B gets recomputed to reach state S+, the change test for B's new value indicates "no change". Let us then say B is dependent on the change to X but /unaffected/ by it. At this point, all data points other than X are obsolete. Formally: dX establishes state S+; X is by definition affected by dX, and reaches S+ trivially; all state unaffected by dX is considered to be at state S+; all other state is still at S. Cells is responsible for automatically ensuring all data points reach state S+ within these constraints: [] completeness: all non-lazy cells affected by X will be recomputed [] consistency: once state S+ exists, computations should involve values only from state S+. Note that this means state S++ cannot be allowed to arise during the transition from S to S+. [] effciency: only cells affected by X get recomputed, only once, and only those cells which change will be scheduled for output. [] useability: no re-entry of cell computation code, mainly so that programmers need not worry about it. kt

2 3

[cells-devel] defmodel
by Thomas F. Burdick 02 Jun '04

02 Jun '04

So, when I send my local changes to cells, I included a change to defmodel that removed :accessor, :reader, and :writer from the generated DEFCLASS, since DEFMODEL turns around and redefines them anyways. Well, it turns out that that tickles a buglet in some versions of SBCL, which causes it to emit scary-sounding warnings. I think it's fixed in 0.8.11, but it might be best to just forget that change.

2 1

[cells-devel] RTs for unbound cells
by Thomas F. Burdick 01 Jun '04

01 Jun '04

[ not sure if the c-l.net lists are back up yet, one way to find out ] My jerk of a boss is making me write regression tests today; sometimes being self-employed sucks. So, I added to the basic suite of RTs I had for unbound cells, which are attached below. Rather than translate them from using RT (a super light-weight test harness, included with SBCL), I just wrote a po man's RT at the top of the file. These also use md-slot-makunbound, which is new since my last patch: (defun md-slot-makunbound (self slot-spec) (setf (md-slot-value self slot-spec) +unbound+) (slot-makunbound self slot-spec)) Now, back to those lovely database RTs, oh boy! (in-package :cells) (defvar *tests* ()) (defmacro deftest (name form &rest values) "Po man's RT." (let ((test-name (intern (format nil "TEST ~A" name)))) `(progn (defun ,test-name () (let ((name ',name) (form ',form) (expected-values ',values) (actual-values (multiple-value-list (handler-case ,form (error (val) val))))) (assert (equal actual-values ',values) (actual-values) "Test ~S failed~% ~ Form: ~A~% ~ Expected values: ~{~S~^; ~}~% ~ Actual values: ~{~S~^; ~}" name form expected-values actual-values) ',name)) (pushnew ',name *tests*) ',name))) (defun do-test (name) (let ((test (intern (format nil "TEST ~A" name) (symbol-package name)))) (funcall test))) (defun do-tests () (every #'do-test (reverse *tests*))) (defmacro unbound-error-p (form) `(handler-case (progn ,form nil) (cell-unbound () t))) (defun make-cell-valid (self slot) (setf (c-state (md-slot-cell self slot)) :valid)) (defmodel unbound-values () ((val1 :initform (cv) :initarg val1 :accessor test-val1) (val2 :initform (cv) :initarg val2 :accessor test-val2))) (defmodel unbound-formulas (unbound-values) ((formula :initform (c? (^test-val1) (^test-val2)) :accessor test-formula) (lazy-formula :initform (c-formula (:lazy t) (^test-val1) (^test-val2)) :accessor test-lazy-formula))) (deftest unbound-values (let ((self (make-instance 'unbound-values))) (values (unbound-error-p (test-val1 self)) (unbound-error-p (test-val2 self)))) t t) (deftest md-slot-makunbound (let ((self (to-be (make-instance 'unbound-values 'val1 (cv nil) 'val2 (cv nil))))) (md-slot-makunbound self 'val1) (md-slot-makunbound self 'val2) (values (unbound-error-p (test-val1 self)) (unbound-error-p (test-val2 self)))) t t) (deftest formula-depends-on-unbound (let ((obj1 (to-be (make-instance 'unbound-formulas))) (obj2 (to-be (make-instance 'unbound-formulas)))) (values (unbound-error-p (test-formula obj1)) (unbound-error-p (test-lazy-formula obj1)) (unbound-error-p (test-lazy-formula obj2)) (unbound-error-p (test-formula obj2)))) t t t t) (deftest unbound-ok-for-unbound-formulas (unbound-error-p (progn (let ((self (to-be (make-instance 'unbound-formulas)))) (setf (test-val1 self) t (test-val2 self) t)) (let ((self (to-be (make-instance 'unbound-formulas)))) (setf (test-val2 self) t (test-val1 self) t)))) nil) (deftest unbound-errs-for-eager (let ((self (to-be (make-instance 'unbound-formulas 'val1 (cv 1) 'val2 (cv 2))))) (values (test-formula self) (unbound-error-p (md-slot-makunbound self 'val1)) (unbound-error-p (md-slot-makunbound self 'val2)))) 2 t t) (deftest unbound-ok-for-unchecked-lazy (let ((self (to-be (make-instance 'unbound-formulas 'val1 (cv 1) 'val2 (cv 2))))) (values (test-lazy-formula self) (unbound-error-p (md-slot-makunbound self 'val1)) (unbound-error-p (md-slot-makunbound self 'val2)))) 2 nil nil) #+test (do-tests)

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

cells-devel June 2004