Re: Easier access to PropertyInfo

Tech-Archive recommends: Repair Windows Errors & Optimize Windows Performance

Hi Marc,

thanks for your fast answer.

I want the user of the framework to be able to create a connection like
this:
graph.AddConnection(i.Input, o.Output);

A few options leap to mind:
Te simplest is just a half-way house is to handle the lookup inside the
method:
graph.AddConnection(i, "Input", o, "Output");
But of course it still isn't compiler-verified.


But it's easier than my current approach, so if everything fails, I'll do
it that way.

You could do various things involving delegates and lambdas, including
treating a lambda as the missing "infoof" operator, which would allow
you to refer to a property directy (and safely), but simply: they are
all quite complicated.

That said, you are also duplicating a lot of what Binding does (at least
for the UI).

I don't worry about complicated solutions for this problem, as long as the
usage for the user of the framework get's simpler :D.. But I'm sorry, I
forgot to mention that I'm using C# 2.0, so lambdas won't apply here I
think :(


You haven't really indicated how it would be *used* (i.e. end-to-end,
not just creation), which probably counts for a lot in terms of giving
the best reply...

Ok, so here's what the framework should be used for:

The (dev) user can creates a tree graph by adding custom nodes and creating
connections. The connections are made between properties of nodes. Those
properties are marked declarative by using an [Input] or [Output]
attribute.
The nodes transfers the data from inputs to outputs on update calls, and
the connection transports the data from one node's output tp the connected
input of another node.

In my current domain, the tree represents a query to a custom datamodel.
The creation of the query is supported by a UI.

After creating the query tree, the user sets an input collection and calls
evalute on the tree. Inside, the tree nodes and connections are sorted to
be evaluated in the correct order, and then their update methods are
called.

The result of the query is the output of the last node.

Bye,

Marco
.

Relevant Pages

  • TreeView Help Help Help
    ... Need help with tree View ... I have a treeview control on a form & I can populate the first level ... Batchid this is equal to Batch_ID from the other query ... Dim StrOrderKey As String ...
    (microsoft.public.access.formscoding)
  • Re: what is the correct data structure to use with this problem?
    ... I'm just stumped with how the tree should look... ... >false query and move to the next, retaining the fact that the false ... You save time in each rule evaluating P1 assuming ... >> queries) but I hope it clarifies. ...
    (comp.programming)
  • Re: Locking behavior involving table joins
    ... The SELECT would be quering old date and issuing shared row locks. ... If your JOIN is an all with no condition clause, you could still query all ... all of the other connections to complete their work before starting. ... > I have a connection that performs a join on TableA and TableB. ...
    (microsoft.public.sqlserver.server)
  • question about/problem with tree view
    ... I have a form with a tree on it. ... a query hits the database ... and then I iterate through the query results and each record returned ... I never really set the window state to maximized... ...
    (comp.lang.pascal.delphi.misc)
  • RE: HOW TO: Treeview, obtain the first node index in a sorted Tree
    ... query alphabetically and determine the associated with that first ... "Kevin McCartney" wrote: ... for it in the treeview to return its index. ... the tree and if it the text started with a Z it would appear at the bottom. ...
    (microsoft.public.access.formscoding)