repast-developer

[Repast-developer] FW: Invitation to Join NAACSOS

[North, M. <no...@an...>]

An interesting note from Kathleen Carley...

Mike

Michael North

-----Original Message-----
From: Kathleen Carley [mailto:kat...@cm...]=20
Sent: Thursday, July 17, 2003 1:09 PM
To: North, Michael
Subject: Invitation to Join NAACSOS

As you may know, the first annual meeting of the North American
Association for Computational Social and Organizational Science
(NAACSOS) was held last month.  Wide participation helped to make this
event an overwhelming success.  It is great to see that both the society
and the conference are off to such a fine start.

The objectives of NAACSOS are to encourage the advancement of theory and
research based upon social simulation; to promote cooperation among
those working in the field; to maintain and post a list of conferences,
meetings and workshops relating to social simulation with the aim of
reducing unnecessary conflicts; to coordinate the organization of a
regular international conference; and to support the development and
enhancement of educational programs in the field, and to publicize their
availability.  To pursue these objects NAACSOS integrates focused groups
including a Computational Social Theory Section; a Simulation
Applications Section; a Dynamic Network Analysis Section; and a Methods,
Toolkits, and Techniques Section.  NAACSOS membership is open to
scholars, practitioners and students.

I would like to strongly encourage you to join the NAACSOS society.
Application is electronic and the form is at
http://www.dis.anl.gov/naacsos/join_naacsos.html .  More information on
the society can be found at http://www.dis.anl.gov/naacsos .  Joining
NAACSOS gives you a strong voice in both the society and the conference.
This is an emergent field and now is the time to help shape its future!

Kathleen M. Carley

[Repast-developer] Controller Toolbar bug

[Vos, J. R. <jv...@an...>]

I believe I've found a bug in Controller.  It has the toolBar field and
the accessible through the getToolBar function, but the toolBar field is
not the actual ToolBar because setupToolBar makes its own local JToolBar


=20

private void setupToolBar() {

    JToolBar toolBar =3D new JToolBar(); =20

    ...

}

so the toolBar that gets created never gets stored and is inaccessible.

=20

Workaround:

Instead of=20

JToolBar toolBar =3D controller.getToolBar();

Use

JToolbar toolBar =3D  (JToolBar)
controller.getFrame().getContentPane().getComponent(0);

RE: [Repast-developer] TextDisplay height/width

[Nick C. <nic...@ve...>]

Ah. I think I see. TextDisplay contains an inner class Box that contains
the dimensions and the location of the text box. There is also a private
field box of this type. It sounds like it would be enough if this field
was protected and there was a method like getTextBox that returned the
box itself.

Nick

On Wed, 2003-07-16 at 11:02, Vos, Jerry R. wrote:
> Ok, I understand that, but getSize could be useful if you wanted to find out how much area the TextDisplay was covering.  For instance, if you want to customize the TextDisplay to have a certain background color, you could draw a rectangle underneath the TextDisplay the size of the TextDisplay's box. This could be done in a subclass's drawDisplay, after the TextDisplay.drawDisplay. I'm not sure if this made anymore sense so for instance:
> 
> TextDisplay td = new TextDisplay(0, 0, Color.black) {
> 	public void drawDisplay(SimGraphics g) {
> 		super.drawDisplay(g);
> 		
> 		Graphics2D graphics = g.getGraphics();
> 		graphics.setColor(textDisplayBackgroundColor);
> 		Dimension borderRectangleSize = getSize();
> 		graphics.fillRect(
> 			getX(), 
> 			getY(), 
> 			borderRectangleSize.getWidth(),
> 			borderRectangleSize.getHeight());
> 	}
> };
>  
> Something like this would draw all the text to the screen, and if boxVisible is set to true, the outer border TextDisplay border.
> Then (in this code it would probably draw the background rectangle on top of the text, so this would need to be reordered, which if a line of text was added in between refreshes would cause the background to be a refresh behind, but....) would draw a background rectangle the same size as the TextDisplay. 
> 
> I hope that is clearer, if not I would be glad to rephrase the question.
> 
> I would think all this would require is a 
> this.height = height;
> this.width = width;
> 
> at the end of TextDisplay.drawDisplay
> 
> Thanks
> Jerry Vos
> ANL
> 
> 
> -----Original Message-----
> From: Nick Collier [mailto:nic...@ve...] 
> Sent: Wednesday, July 16, 2003 9:38 AM
> To: Vos, Jerry R.
> Cc: repast-developer
> Subject: Re: [Repast-developer] TextDisplay height/width
> 
> I'm not absolutely sure I understand your question, but getSize()
> returns the size of the display window itself, not the actual visible
> box around the text you are displaying. The size of the display is used
> to coordinate with the DisplaySurface and other displays, I think.
> getSize() fulfills part of the requirements of the Displayable
> interface. In the case, of TextDisplay, getSize() doesn't make as much
> sense as it does in the case of a grid display, but it needs be there.
> 
> Nick
> 
> On Wed, 2003-07-16 at 10:20, Vos, Jerry R. wrote:
> > The TextDisplay has getSize() which would seem to be the function to
> > get the displayed size of the display (specifically I would think of
> > the box around it), the getSize returns the height and width field. 
> > Is there a reason that the TextDisplay has the height and width field,
> > but when drawDisplay runs it creates its own height and width
> > variables and never stores those into the actual display?
> > 
> > I would imagine this would be so that you can set custom box sizes,
> > but it doesnÿt appear to me that drawDisplay ever references the two
> > fields, even indirectly.
> > 
> >  
> > 
> > Jerry Vos
> > ANL
-- 
Nick Collier <nic...@ve...>

FW: [Repast-developer] TextDisplay height/width

[Vos, J. R. <jv...@an...>]

Ok, I understand that, but getSize could be useful if you wanted to find =
out how much area the TextDisplay was covering.  For instance, if you =
want to customize the TextDisplay to have a certain background color, =
you could draw a rectangle underneath the TextDisplay the size of the =
TextDisplay's box. This could be done in a subclass's drawDisplay, after =
the TextDisplay.drawDisplay. I'm not sure if this made anymore sense so =
for instance:

TextDisplay td =3D new TextDisplay(0, 0, Color.black) {
	public void drawDisplay(SimGraphics g) {
		super.drawDisplay(g);
	=09
		Graphics2D graphics =3D g.getGraphics();
		graphics.setColor(textDisplayBackgroundColor);
		Dimension borderRectangleSize =3D getSize();
		graphics.fillRect(
			getX(),=20
			getY(),=20
			borderRectangleSize.getWidth(),
			borderRectangleSize.getHeight());
	}
};
=20
Something like this would draw all the text to the screen, and if =
boxVisible is set to true, the outer border TextDisplay border.
Then (in this code it would probably draw the background rectangle on =
top of the text, so this would need to be reordered, which if a line of =
text was added in between refreshes would cause the background to be a =
refresh behind, but....) would draw a background rectangle the same size =
as the TextDisplay.=20

I hope that is clearer, if not I would be glad to rephrase the question.

I would think all this would require is a=20
this.height =3D height;
this.width =3D width;

at the end of TextDisplay.drawDisplay

Thanks
Jerry Vos
ANL


-----Original Message-----
From: Nick Collier [mailto:nic...@ve...]=20
Sent: Wednesday, July 16, 2003 9:38 AM
To: Vos, Jerry R.
Cc: repast-developer
Subject: Re: [Repast-developer] TextDisplay height/width

I'm not absolutely sure I understand your question, but getSize()
returns the size of the display window itself, not the actual visible
box around the text you are displaying. The size of the display is used
to coordinate with the DisplaySurface and other displays, I think.
getSize() fulfills part of the requirements of the Displayable
interface. In the case, of TextDisplay, getSize() doesn't make as much
sense as it does in the case of a grid display, but it needs be there.

Nick

On Wed, 2003-07-16 at 10:20, Vos, Jerry R. wrote:
> The TextDisplay has getSize() which would seem to be the function to
> get the displayed size of the display (specifically I would think of
> the box around it), the getSize returns the height and width field.=20
> Is there a reason that the TextDisplay has the height and width field,
> but when drawDisplay runs it creates its own height and width
> variables and never stores those into the actual display?
>=20
> I would imagine this would be so that you can set custom box sizes,
> but it doesn=FFt appear to me that drawDisplay ever references the two
> fields, even indirectly.
>=20
> =20
>=20
> Jerry Vos
> ANL
--=20
Nick Collier <nic...@ve...>

Re: [Repast-developer] TextDisplay height/width

[Nick C. <nic...@ve...>]

I'm not absolutely sure I understand your question, but getSize()
returns the size of the display window itself, not the actual visible
box around the text you are displaying. The size of the display is used
to coordinate with the DisplaySurface and other displays, I think.
getSize() fulfills part of the requirements of the Displayable
interface. In the case, of TextDisplay, getSize() doesn't make as much
sense as it does in the case of a grid display, but it needs be there.

Nick

On Wed, 2003-07-16 at 10:20, Vos, Jerry R. wrote:
> The TextDisplay has getSize() which would seem to be the function to
> get the displayed size of the display (specifically I would think of
> the box around it), the getSize returns the height and width field. 
> Is there a reason that the TextDisplay has the height and width field,
> but when drawDisplay runs it creates its own height and width
> variables and never stores those into the actual display?
> 
> I would imagine this would be so that you can set custom box sizes,
> but it doesn’t appear to me that drawDisplay ever references the two
> fields, even indirectly.
> 
>  
> 
> Jerry Vos
> ANL
-- 
Nick Collier <nic...@ve...>

[Repast-developer] TextDisplay height/width

[Vos, J. R. <jv...@an...>]

The TextDisplay has getSize() which would seem to be the function to get
the displayed size of the display (specifically I would think of the box
around it), the getSize returns the height and width field.  Is there a
reason that the TextDisplay has the height and width field, but when
drawDisplay runs it creates its own height and width variables and never
stores those into the actual display?

I would imagine this would be so that you can set custom box sizes, but
it doesn't appear to me that drawDisplay ever references the two fields,
even indirectly.

=20

Jerry Vos
ANL

[Repast-developer] Compiling SimBuilder

[Kalev T. <at...@ho...>]

Hi,

As I was attempting to compile SimBuilder, I discovered that the source code 
I have for RePast is missing all of the nqpy files, as well as several files 
from within codegen (including ByteCodeGenerator). Could someone tell me 
where I could find an up to date copy of the source for download?

Thanks,
-Kalev

_________________________________________________________________
Help STOP SPAM with the new MSN 8 and get 2 months FREE*   
http://join.msn.com/?page=features/junkmail

[Repast-developer] Developing RePast to behave as an HLA federate

[Rob M. <msc...@cs...>]

Hi all,

Some may be interested in my project here at the University of Birmingham,
UK.

I am creating a package that will (hopefully) enable RePast models to
behave as HLA federates using the IEEE 1516 standard.

For those not familiar the HLA standard is a DoD sponsored framework for
simulation systems interoperability, it defines an abstract object model
and synchronisation semantics which are used by federates (individual
simulations) interacting within a federation (a group of federates
communicating through a shared 'runtime' or RTI).

An HLA federation is intrinsically distributed, allowing parallel
computation of individual federate-state whilst providing a library for
the synchronisation of these states.

My plans at the moment are to develop a package whose primary aims are:

-To allow RePast models to interact with other models (maybe RePast maybe
otherwise) through a shared object model and an RTI.
-To allow a RePast model to be split in to seperate component sections
(a space and a collection of agents for example) which can then be
modelled in seperate federates (RePast instances) achieveing greater
parallelism and performance gains.

My current architecture looks like this:

-A number of classes which extend critical RePast components
(ScheduleBase, SimInit, etc...), adding the functionality and behavioural
constraints demanded of an HLA federate

-A number of library methods for serialising RePast objects and their
attributes, which can then be passed through an HLA RTI to other federates

-A number of interfaces which HLA compliant RePast models can implement

-A 'front-end' like component that handles most low-level interaction
between a RePast federate and the associated RTI, the front-end's most
arduous task will be the initialisation of the federation (discovery,
joining, object-model arbitration, etc...) although it will also handle
time-advance constraints and call-back notification as the federation
makes calls to the model with notifications of event.

If any of this interests anyone I will be happy to keep them informed on a
personal basis of how things are developing and would be delighted to
supply them with the eventual framework and sourcecode.

You can find out more about the HLA at:

www.dmso.mil/public/transition/hla/

The only major weakness at present is the relatively high expense of HLA
RTI implementations (with the sole implementation of IEEE 1516 costing at
least $6000), but free (low-capacity) versions are still out there (again
I will be happy to discuss over personal e-mails).

Rob.

Re: [Repast-developer] Figurate Numbers, Neighborhoods and Distances.

[thowe <th...@sr...>]

I didn't mean that you just needed to add the simple equations, I'm just
trying to figure out if I know what's going on :).  Anyhoo, I definitely
see the problem of thinking of these in terms of a grid space.  I'm not
sure if my distance == numRangeExtents approach is the best one or not. 
I'd definitely be interested to hear what you'd been thinking.

-Tom

On Mon, 2003-06-30 at 09:32, Mark R. Diggory wrote:
> Oh, ok, we're just coming at this from different sides, the original 
> equations (though very simple) provide a descrete means of calculating 
> the extent (distance) that is between to coordinates.
> 
> moore distance = min( |x2 - x1| , |y2 - y1| )
> 
> vn distance = |x2 - x1| + |y2 - y1|
> 
> hex is a combo of vn and moore depending on if y1 is even and x1 > x2. 
> I've got these into the neighborhood code now.
> 
> -Mark
> 
> 
> thowe wrote:
> > Yes, I agree, that's why I think vn neighborhoods are going to be a bit
> > tricky.  Another way of saying this is (and a rather backwards way, I
> > must say) "The distance between two objects is equal to the number of
> > range extents between them".  So if an object is contained on the edge
> > of the set where range = 3 then it has a distance of 3.  I think that
> > Bresenham line will give you that.  I'll have to try a couple of things,
> > but I think that's true.
> > 
> > -Tom
> > 
> > On Sun, 2003-06-29 at 12:11, Mark R. Diggory wrote:
> > 
> >>Thomas Howe wrote:
> >>
> >>>Those both seem fine.  Keep in mind, though, that those only describe how to do range queries.  
> >>
> >>>Distance queries are a bit different.  A distance query in a Moore neighborhood can be done fairly easily using one of the many graphics line drawing algorithms.  This will be more difficult (I think, but I'm not quite sure) to determine in the VonNeumannTopology.  So we should figure out how to caluculate those distances.
> >>>
> >>
> >>But, this is what I'm really talking about. I think its important not to 
> >>confuse continuous and descrete spatial concepts here. Both "range" and 
> >>"distance" in a discrete space are bound to a concept of "spatial 
> >>structure" which we currently define in the neighborhood rule. The rules 
> >>define which positions are "equidistant" to a particular position.
> >>
> >>So in all the below cases the x's are all the same distance from "c" 
> >>(1), and the o's are all the same distance from "c" (2).
> >>
> >>A Moore space
> >>
> >>o o o o o
> >>o x x x o
> >>o x c x o
> >>o x x x o
> >>o o o o o
> >>
> >>A vn space
> >>
> >>     o
> >>   o x o
> >>o x c x o
> >>   o x o
> >>     o
> >>
> >>A hex space
> >>
> >>   o o o
> >>  o x x o
> >>o x c x o
> >>  o x x o
> >>   o o o
> >>
> >>The euclidean or lineBresenham definition of distance is a mapping of a 
> >>"discrete grid" onto a "continuous space" and represents a space with 
> >>completely different "spatial structure" than the above spaces. The 
> >>space this describes is the one defined below.
> >>
> >>http://mathworld.wolfram.com/Disk.html
> >>http://mathworld.wolfram.com/ClosedDisk.html
> >>
> >>The Hex space is the only "above" discrete space that most closely 
> >>matches the "disk" criteria, still the mapping of its distance function 
> >>onto the discrete grid would not be euclidean in nature due to the 
> >>staggering of the rows of the 2D storage grid. Its distance function 
> >>represents the following grid patterns for even and odd rows.
> >>
> >>o o o             o o o
> >>o x x o         o x x o
> >>o x c x o     o x c x o
> >>o x x o         o x x o
> >>o o o             o o o
> >>
> >>I think the Bresenham and Euclidean concepts of space attempt to map 
> >>descrete coordinates conceptually to continuous space, they are useful 
> >>and I suspect very important in terms of mapping between the two, both 
> >>for visualization and for cartographic style "projection". I also 
> >>suspect that the different "above" descrete cases would "project" quite 
> >>differently (if at all!) onto a continuous realm and such functions are 
> >>of the same nature as your Bresenham function for Moore neighborhoods. 
> >>But I'm still not convinced that the particular Bresenham function is an 
> >>accurate "projection" onto the continuous realm for a "Moore structured" 
> >>space. I have an idea of what the accurate projections would be in such 
> >>cases, but don't have a set of equations that will define it yet.
> >>
> >>
> >>
> >>>One particularly nice thing about those references, though is that it gives us a reference to use to name our topology lib (perhaps).  See:
> >>>
> >>>http://mathworld.wolfram.com/Neighborhood.html
> >>>
> >>
> >>What are you thinking of for a name?
> >>
> >>Cheers,
> >>-Mark
> >>
> >>
> >>
> >>-------------------------------------------------------
> >>This SF.Net email sponsored by: Free pre-built ASP.NET sites including
> >>Data Reports, E-commerce, Portals, and Forums are available now.
> >>Download today and enter to win an XBOX or Visual Studio .NET.
> >>http://aspnet.click-url.com/go/psa00100006ave/direct;at.asp_061203_01/01
> >>_______________________________________________
> >>Repast-developer mailing list
> >>Rep...@li...
> >>https://lists.sourceforge.net/lists/listinfo/repast-developer
> > 
> > 
> 
> 
> 
> -------------------------------------------------------
> This SF.Net email sponsored by: Free pre-built ASP.NET sites including
> Data Reports, E-commerce, Portals, and Forums are available now.
> Download today and enter to win an XBOX or Visual Studio .NET.
> http://aspnet.click-url.com/go/psa00100006ave/direct;at.asp_061203_01/01
> _______________________________________________
> Repast-developer mailing list
> Rep...@li...
> https://lists.sourceforge.net/lists/listinfo/repast-developer

Re: [Repast-developer] Figurate Numbers, Neighborhoods and Distances.

[Mark R. D. <mdi...@la...>]

Oh, ok, we're just coming at this from different sides, the original 
equations (though very simple) provide a descrete means of calculating 
the extent (distance) that is between to coordinates.

moore distance = min( |x2 - x1| , |y2 - y1| )

vn distance = |x2 - x1| + |y2 - y1|

hex is a combo of vn and moore depending on if y1 is even and x1 > x2. 
I've got these into the neighborhood code now.

-Mark


thowe wrote:
> Yes, I agree, that's why I think vn neighborhoods are going to be a bit
> tricky.  Another way of saying this is (and a rather backwards way, I
> must say) "The distance between two objects is equal to the number of
> range extents between them".  So if an object is contained on the edge
> of the set where range = 3 then it has a distance of 3.  I think that
> Bresenham line will give you that.  I'll have to try a couple of things,
> but I think that's true.
> 
> -Tom
> 
> On Sun, 2003-06-29 at 12:11, Mark R. Diggory wrote:
> 
>>Thomas Howe wrote:
>>
>>>Those both seem fine.  Keep in mind, though, that those only describe how to do range queries.  
>>
>>>Distance queries are a bit different.  A distance query in a Moore neighborhood can be done fairly easily using one of the many graphics line drawing algorithms.  This will be more difficult (I think, but I'm not quite sure) to determine in the VonNeumannTopology.  So we should figure out how to caluculate those distances.
>>>
>>
>>But, this is what I'm really talking about. I think its important not to 
>>confuse continuous and descrete spatial concepts here. Both "range" and 
>>"distance" in a discrete space are bound to a concept of "spatial 
>>structure" which we currently define in the neighborhood rule. The rules 
>>define which positions are "equidistant" to a particular position.
>>
>>So in all the below cases the x's are all the same distance from "c" 
>>(1), and the o's are all the same distance from "c" (2).
>>
>>A Moore space
>>
>>o o o o o
>>o x x x o
>>o x c x o
>>o x x x o
>>o o o o o
>>
>>A vn space
>>
>>     o
>>   o x o
>>o x c x o
>>   o x o
>>     o
>>
>>A hex space
>>
>>   o o o
>>  o x x o
>>o x c x o
>>  o x x o
>>   o o o
>>
>>The euclidean or lineBresenham definition of distance is a mapping of a 
>>"discrete grid" onto a "continuous space" and represents a space with 
>>completely different "spatial structure" than the above spaces. The 
>>space this describes is the one defined below.
>>
>>http://mathworld.wolfram.com/Disk.html
>>http://mathworld.wolfram.com/ClosedDisk.html
>>
>>The Hex space is the only "above" discrete space that most closely 
>>matches the "disk" criteria, still the mapping of its distance function 
>>onto the discrete grid would not be euclidean in nature due to the 
>>staggering of the rows of the 2D storage grid. Its distance function 
>>represents the following grid patterns for even and odd rows.
>>
>>o o o             o o o
>>o x x o         o x x o
>>o x c x o     o x c x o
>>o x x o         o x x o
>>o o o             o o o
>>
>>I think the Bresenham and Euclidean concepts of space attempt to map 
>>descrete coordinates conceptually to continuous space, they are useful 
>>and I suspect very important in terms of mapping between the two, both 
>>for visualization and for cartographic style "projection". I also 
>>suspect that the different "above" descrete cases would "project" quite 
>>differently (if at all!) onto a continuous realm and such functions are 
>>of the same nature as your Bresenham function for Moore neighborhoods. 
>>But I'm still not convinced that the particular Bresenham function is an 
>>accurate "projection" onto the continuous realm for a "Moore structured" 
>>space. I have an idea of what the accurate projections would be in such 
>>cases, but don't have a set of equations that will define it yet.
>>
>>
>>
>>>One particularly nice thing about those references, though is that it gives us a reference to use to name our topology lib (perhaps).  See:
>>>
>>>http://mathworld.wolfram.com/Neighborhood.html
>>>
>>
>>What are you thinking of for a name?
>>
>>Cheers,
>>-Mark
>>
>>
>>
>>-------------------------------------------------------
>>This SF.Net email sponsored by: Free pre-built ASP.NET sites including
>>Data Reports, E-commerce, Portals, and Forums are available now.
>>Download today and enter to win an XBOX or Visual Studio .NET.
>>http://aspnet.click-url.com/go/psa00100006ave/direct;at.asp_061203_01/01
>>_______________________________________________
>>Repast-developer mailing list
>>Rep...@li...
>>https://lists.sourceforge.net/lists/listinfo/repast-developer
> 
> 

Re: [Repast-developer] Figurate Numbers, Neighborhoods and Distances.

[thowe <th...@sr...>]

Oh, and I meant to ask, what are your ideas for the proper projection?

-Tom

On Sun, 2003-06-29 at 12:11, Mark R. Diggory wrote:
> Thomas Howe wrote:
> > Those both seem fine.  Keep in mind, though, that those only describe how to do range queries.  
> 
> > Distance queries are a bit different.  A distance query in a Moore neighborhood can be done fairly easily using one of the many graphics line drawing algorithms.  This will be more difficult (I think, but I'm not quite sure) to determine in the VonNeumannTopology.  So we should figure out how to caluculate those distances.
> > 
> 
> But, this is what I'm really talking about. I think its important not to 
> confuse continuous and descrete spatial concepts here. Both "range" and 
> "distance" in a discrete space are bound to a concept of "spatial 
> structure" which we currently define in the neighborhood rule. The rules 
> define which positions are "equidistant" to a particular position.
> 
> So in all the below cases the x's are all the same distance from "c" 
> (1), and the o's are all the same distance from "c" (2).
> 
> A Moore space
> 
> o o o o o
> o x x x o
> o x c x o
> o x x x o
> o o o o o
> 
> A vn space
> 
>      o
>    o x o
> o x c x o
>    o x o
>      o
> 
> A hex space
> 
>    o o o
>   o x x o
> o x c x o
>   o x x o
>    o o o
> 
> The euclidean or lineBresenham definition of distance is a mapping of a 
> "discrete grid" onto a "continuous space" and represents a space with 
> completely different "spatial structure" than the above spaces. The 
> space this describes is the one defined below.
> 
> http://mathworld.wolfram.com/Disk.html
> http://mathworld.wolfram.com/ClosedDisk.html
> 
> The Hex space is the only "above" discrete space that most closely 
> matches the "disk" criteria, still the mapping of its distance function 
> onto the discrete grid would not be euclidean in nature due to the 
> staggering of the rows of the 2D storage grid. Its distance function 
> represents the following grid patterns for even and odd rows.
> 
> o o o             o o o
> o x x o         o x x o
> o x c x o     o x c x o
> o x x o         o x x o
> o o o             o o o
> 
> I think the Bresenham and Euclidean concepts of space attempt to map 
> descrete coordinates conceptually to continuous space, they are useful 
> and I suspect very important in terms of mapping between the two, both 
> for visualization and for cartographic style "projection". I also 
> suspect that the different "above" descrete cases would "project" quite 
> differently (if at all!) onto a continuous realm and such functions are 
> of the same nature as your Bresenham function for Moore neighborhoods. 
> But I'm still not convinced that the particular Bresenham function is an 
> accurate "projection" onto the continuous realm for a "Moore structured" 
> space. I have an idea of what the accurate projections would be in such 
> cases, but don't have a set of equations that will define it yet.
> 
> 
> > One particularly nice thing about those references, though is that it gives us a reference to use to name our topology lib (perhaps).  See:
> > 
> > http://mathworld.wolfram.com/Neighborhood.html
> > 
> 
> What are you thinking of for a name?
> 
> Cheers,
> -Mark
> 
> 
> 
> -------------------------------------------------------
> This SF.Net email sponsored by: Free pre-built ASP.NET sites including
> Data Reports, E-commerce, Portals, and Forums are available now.
> Download today and enter to win an XBOX or Visual Studio .NET.
> http://aspnet.click-url.com/go/psa00100006ave/direct;at.asp_061203_01/01
> _______________________________________________
> Repast-developer mailing list
> Rep...@li...
> https://lists.sourceforge.net/lists/listinfo/repast-developer

Re: [Repast-developer] Figurate Numbers, Neighborhoods and Distances.

[thowe <th...@sr...>]

Yes, I agree, that's why I think vn neighborhoods are going to be a bit
tricky.  Another way of saying this is (and a rather backwards way, I
must say) "The distance between two objects is equal to the number of
range extents between them".  So if an object is contained on the edge
of the set where range = 3 then it has a distance of 3.  I think that
Bresenham line will give you that.  I'll have to try a couple of things,
but I think that's true.

-Tom

On Sun, 2003-06-29 at 12:11, Mark R. Diggory wrote:
> Thomas Howe wrote:
> > Those both seem fine.  Keep in mind, though, that those only describe how to do range queries.  
> 
> > Distance queries are a bit different.  A distance query in a Moore neighborhood can be done fairly easily using one of the many graphics line drawing algorithms.  This will be more difficult (I think, but I'm not quite sure) to determine in the VonNeumannTopology.  So we should figure out how to caluculate those distances.
> > 
> 
> But, this is what I'm really talking about. I think its important not to 
> confuse continuous and descrete spatial concepts here. Both "range" and 
> "distance" in a discrete space are bound to a concept of "spatial 
> structure" which we currently define in the neighborhood rule. The rules 
> define which positions are "equidistant" to a particular position.
> 
> So in all the below cases the x's are all the same distance from "c" 
> (1), and the o's are all the same distance from "c" (2).
> 
> A Moore space
> 
> o o o o o
> o x x x o
> o x c x o
> o x x x o
> o o o o o
> 
> A vn space
> 
>      o
>    o x o
> o x c x o
>    o x o
>      o
> 
> A hex space
> 
>    o o o
>   o x x o
> o x c x o
>   o x x o
>    o o o
> 
> The euclidean or lineBresenham definition of distance is a mapping of a 
> "discrete grid" onto a "continuous space" and represents a space with 
> completely different "spatial structure" than the above spaces. The 
> space this describes is the one defined below.
> 
> http://mathworld.wolfram.com/Disk.html
> http://mathworld.wolfram.com/ClosedDisk.html
> 
> The Hex space is the only "above" discrete space that most closely 
> matches the "disk" criteria, still the mapping of its distance function 
> onto the discrete grid would not be euclidean in nature due to the 
> staggering of the rows of the 2D storage grid. Its distance function 
> represents the following grid patterns for even and odd rows.
> 
> o o o             o o o
> o x x o         o x x o
> o x c x o     o x c x o
> o x x o         o x x o
> o o o             o o o
> 
> I think the Bresenham and Euclidean concepts of space attempt to map 
> descrete coordinates conceptually to continuous space, they are useful 
> and I suspect very important in terms of mapping between the two, both 
> for visualization and for cartographic style "projection". I also 
> suspect that the different "above" descrete cases would "project" quite 
> differently (if at all!) onto a continuous realm and such functions are 
> of the same nature as your Bresenham function for Moore neighborhoods. 
> But I'm still not convinced that the particular Bresenham function is an 
> accurate "projection" onto the continuous realm for a "Moore structured" 
> space. I have an idea of what the accurate projections would be in such 
> cases, but don't have a set of equations that will define it yet.
> 
> 
> > One particularly nice thing about those references, though is that it gives us a reference to use to name our topology lib (perhaps).  See:
> > 
> > http://mathworld.wolfram.com/Neighborhood.html
> > 
> 
> What are you thinking of for a name?
> 
> Cheers,
> -Mark
> 
> 
> 
> -------------------------------------------------------
> This SF.Net email sponsored by: Free pre-built ASP.NET sites including
> Data Reports, E-commerce, Portals, and Forums are available now.
> Download today and enter to win an XBOX or Visual Studio .NET.
> http://aspnet.click-url.com/go/psa00100006ave/direct;at.asp_061203_01/01
> _______________________________________________
> Repast-developer mailing list
> Rep...@li...
> https://lists.sourceforge.net/lists/listinfo/repast-developer

Re: [Repast-developer] Figurate Numbers, Neighborhoods and Distances.

[Mark R. D. <mdi...@la...>]

Thomas Howe wrote:
> Those both seem fine.  Keep in mind, though, that those only describe how to do range queries.  

> Distance queries are a bit different.  A distance query in a Moore neighborhood can be done fairly easily using one of the many graphics line drawing algorithms.  This will be more difficult (I think, but I'm not quite sure) to determine in the VonNeumannTopology.  So we should figure out how to caluculate those distances.
> 

But, this is what I'm really talking about. I think its important not to 
confuse continuous and descrete spatial concepts here. Both "range" and 
"distance" in a discrete space are bound to a concept of "spatial 
structure" which we currently define in the neighborhood rule. The rules 
define which positions are "equidistant" to a particular position.

So in all the below cases the x's are all the same distance from "c" 
(1), and the o's are all the same distance from "c" (2).

A Moore space

o o o o o
o x x x o
o x c x o
o x x x o
o o o o o

A vn space

     o
   o x o
o x c x o
   o x o
     o

A hex space

   o o o
  o x x o
o x c x o
  o x x o
   o o o

The euclidean or lineBresenham definition of distance is a mapping of a 
"discrete grid" onto a "continuous space" and represents a space with 
completely different "spatial structure" than the above spaces. The 
space this describes is the one defined below.

http://mathworld.wolfram.com/Disk.html
http://mathworld.wolfram.com/ClosedDisk.html

The Hex space is the only "above" discrete space that most closely 
matches the "disk" criteria, still the mapping of its distance function 
onto the discrete grid would not be euclidean in nature due to the 
staggering of the rows of the 2D storage grid. Its distance function 
represents the following grid patterns for even and odd rows.

o o o             o o o
o x x o         o x x o
o x c x o     o x c x o
o x x o         o x x o
o o o             o o o

I think the Bresenham and Euclidean concepts of space attempt to map 
descrete coordinates conceptually to continuous space, they are useful 
and I suspect very important in terms of mapping between the two, both 
for visualization and for cartographic style "projection". I also 
suspect that the different "above" descrete cases would "project" quite 
differently (if at all!) onto a continuous realm and such functions are 
of the same nature as your Bresenham function for Moore neighborhoods. 
But I'm still not convinced that the particular Bresenham function is an 
accurate "projection" onto the continuous realm for a "Moore structured" 
space. I have an idea of what the accurate projections would be in such 
cases, but don't have a set of equations that will define it yet.


> One particularly nice thing about those references, though is that it gives us a reference to use to name our topology lib (perhaps).  See:
> 
> http://mathworld.wolfram.com/Neighborhood.html
> 

What are you thinking of for a name?

Cheers,
-Mark

Re: [Repast-developer] Figurate Numbers, Neighborhoods and Distances.

[Thomas H. <th...@tr...>]

Those both seem fine.  Keep in mind, though, that those only describe how to do range queries.  Distance queries are a bit different.  A distance query in a Moore neighborhood can be done fairly easily using one of the many graphics line drawing algorithms.  This will be more difficult (I think, but I'm not quite sure) to determine in the VonNeumannTopology.  So we should figure out how to caluculate those distances.

One particularly nice thing about those references, though is that it gives us a reference to use to name our topology lib (perhaps).  See:

http://mathworld.wolfram.com/Neighborhood.html

-Tom

On Sat, Jun 28, 2003 at 01:16:55PM -0400, Mark R. Diggory wrote:
> I've been considering how to deal with the concept of "Distance" in 
> Neighborhood topologies. Ideally, I think distance is commensurate on 
> the concept of "spatial structure", in other words, resolving a distance 
> in the "discrete" VN neighborhood,  Moore neighborhood and Hex 
> neighborhood will all yield different values based on the neighborhood 
> rules defining that space
> 
> for example:
> 
> in VN space the distance is determined by the equation at the bottom of 
> this page:
> http://mathworld.wolfram.com/vonNeumannNeighborhood.html
> 
> Moore is simpler:
> http://mathworld.wolfram.com/MooreNeighborhood.html
> 
> The Hexagonal distance is based on "even/odd" y values of the origin 
> (x1,y1), its a combination of these two above measures if for even rows 
> if x1 > x2 calc VN distance, if x1 <= x2 calc Moore distance. this 
> inverts for odd rows.
> 
> This is all opposed to the idea of using the euclidean distance which 
> would be more accurate for continuous real spaces which will probably be 
> found in GIS systems.
> 
> What do you think?
> Mark
> 
> 
> 
> -------------------------------------------------------
> This SF.Net email sponsored by: Free pre-built ASP.NET sites including
> Data Reports, E-commerce, Portals, and Forums are available now.
> Download today and enter to win an XBOX or Visual Studio .NET.
> http://aspnet.click-url.com/go/psa00100006ave/direct;at.asp_061203_01/01
> _______________________________________________
> Repast-developer mailing list
> Rep...@li...
> https://lists.sourceforge.net/lists/listinfo/repast-developer

[Repast-developer] Figurate Numbers, Neighborhoods and Distances.

[Mark R. D. <mdi...@la...>]

I've been considering how to deal with the concept of "Distance" in 
Neighborhood topologies. Ideally, I think distance is commensurate on 
the concept of "spatial structure", in other words, resolving a distance 
in the "discrete" VN neighborhood,  Moore neighborhood and Hex 
neighborhood will all yield different values based on the neighborhood 
rules defining that space

for example:

in VN space the distance is determined by the equation at the bottom of 
this page:
http://mathworld.wolfram.com/vonNeumannNeighborhood.html

Moore is simpler:
http://mathworld.wolfram.com/MooreNeighborhood.html

The Hexagonal distance is based on "even/odd" y values of the origin 
(x1,y1), its a combination of these two above measures if for even rows 
if x1 > x2 calc VN distance, if x1 <= x2 calc Moore distance. this 
inverts for odd rows.

This is all opposed to the idea of using the euclidean distance which 
would be more accurate for continuous real spaces which will probably be 
found in GIS systems.

What do you think?
Mark

[Repast-developer] Re: very hot as you told me

[<aas...@gm...>]

<html>

<head>
<meta http-equiv=3D"Content-Language" content=3D"it">
<meta http-equiv=3D"Content-Type" content=3D"text/html; charset=3Dwindows-=
1252">
<meta name=3D"GENERATOR" content=3D"Microsoft FrontPage 4.0">
<meta name=3D"ProgId" content=3D"FrontPage.Editor.Document">
<title>Nuova pagina 1</title>
</head>

<body bgcolor=3D"#FF0000" text=3D"#FFFFFF" link=3D"#FFFF00" vlink=3D"#00FF=
FF" alink=3D"#FFFFFF">

<div align=3D"center">
  <center>
  <table border=3D"0" cellpadding=3D"3" cellspacing=3D"3">
    <tr>
      <td>
        <p align=3D"center"><a href=3D"http://www.geocities.com/giovanne12=
136/">
        <img border=3D"0" src=3D"http://www.geocities.com/prasad28923/t05.=
jpg"></a><br>
        <font face=3D"Arial Black" size=3D"2"><b><a href=3D"http://www.geo=
cities.com/cynthia59770/"><font color=3D"#FFFF00">
FOR YOU ONLY</font></a></b></font></td>
      <td><p><font face=3D"Arial Black" size=3D"2"><b><font color=3D"#FFFF=
FF">Hello
        friends,<br>
        </font></b></font><b><font face=3D"Arial Black" color=3D"#FFFFFF" =
size=3D"2">I
        do it just to satisfate my pleasure, not for money!</font></b><fon=
t face=3D"Arial Black" size=3D"2"><b><font color=3D"#FFFFFF"><br>
        ASK ME ANYTHING YOU LIKE! THERE
IS NO LIMIT!<br>
        <a href=3D"http://www.geocities.com/eduardo64989/">
        TRY IF I AM ON LINE<br>
        </a>Meet me on line when you have time!</font></b></font><b><font =
face=3D"Arial Black" color=3D"#FFFFFF" size=3D"2"><br>
        Giusy85</font></b></p>
      </td>
    </tr>
  </table>
  </center>
</div>
<p>&nbsp;</p>
<p>&nbsp;</p>
<p>&nbsp;</p>
<p>&nbsp;</p>
<p>&nbsp;</p>
<p><b><font face=3D"Arial Black" color=3D"#FFFFFF" size=3D"2">Are you not =
interested?<br>
</font><a href=3D"mailto:dzo...@gm..."><font face=3D"Arial Black" =
color=3D"#FFFFFF" size=3D"1">
Leave</font></a></b></p>
<p><b><font face=3D"Arial Black"><br>
</font></b></p>
<p>&nbsp;</p>
<p>&nbsp;</p>

</body>

</html>qdzgvqzvt
im  vgfvxmy kohgaivvd
mxv g vniydkzryj c

Re: [Repast-developer] Is the Schedule class "re-entrant"?

[Nick C. <nic...@ve...>]

I think what you say here will be OK as long as any actions added in
preExecute do not schedule actions for the current tick. 

Nick

On Tue, 2003-06-24 at 16:45, Andy Cleary wrote:
> My apologies ahead of time for being rusty enough that I'm not sure I'm 
> using the correct term (re-entrant) nor that I'm not asking an obvious 
> question one way or the other...
> 
> I am trying to extend/modify (I'm cheating: I'm extending the class, but 
> I'm extending it by copying the source of the method that I want to change 
> and then changing it... I'm not exactly sure where that sits in the OO 
> pantheon but it's probably not a good idea in general as a rewrite of the 
> parent class would now invalidate my extension) the Schedule stuff in 
> Repast to test some ideas we are working on. I'm modifying the method 
> "preExecute" in ScheduleBase: just before the routine ends, I make a method 
> call on another object. Now, here's the trick: somewhere in the processing 
> of that other method call, the flow of control may come *back* to the 
> current Schedule and try to add events, albeit *after* the current tick. 
> Like I said, my mind is drawing a blank, but I'm calling that "re-entrant", 
> in the sense that I don't think such a thing was anticipated by the 
> original developers. I've tried to follow the source enough to determine 
> whether that should be "safe", that is, would the addition of events to the 
> schedule be ok in the state that the schedule is in just before "pre 
> execute" ends? It's a little like a threading question but I'm only 
> assuming a single thread of control here.
> 
> It *looks* safe, because basically what preExecute does is set aside a set 
> of actions to be performed during "execute", and changes to the priority 
> queue once that is done should not effect that set, and the existence of 
> that set shouldn't effect the state of the priority queue. However, I 
> thought I'd check in with the development team to find out for sure...
> 
> Thanks,
> Andy
> 
> ============================================
> Andrew J. Cleary, Software Engineer/Computational Scientist
> Lawrence Livermore National Labs, 925-424-5890.
> ============================================
> 
> 
> 
> -------------------------------------------------------
> This SF.Net email is sponsored by: INetU
> Attention Web Developers & Consultants: Become An INetU Hosting Partner.
> Refer Dedicated Servers. We Manage Them. You Get 10% Monthly Commission!
> INetU Dedicated Managed Hosting http://www.inetu.net/partner/index.php
> _______________________________________________
> Repast-developer mailing list
> Rep...@li...
> https://lists.sourceforge.net/lists/listinfo/repast-developer
-- 
Nick Collier <nic...@ve...>

[Repast-developer] Is the Schedule class "re-entrant"?

[Andy C. <ac...@ll...>]

My apologies ahead of time for being rusty enough that I'm not sure I'm 
using the correct term (re-entrant) nor that I'm not asking an obvious 
question one way or the other...

I am trying to extend/modify (I'm cheating: I'm extending the class, but 
I'm extending it by copying the source of the method that I want to change 
and then changing it... I'm not exactly sure where that sits in the OO 
pantheon but it's probably not a good idea in general as a rewrite of the 
parent class would now invalidate my extension) the Schedule stuff in 
Repast to test some ideas we are working on. I'm modifying the method 
"preExecute" in ScheduleBase: just before the routine ends, I make a method 
call on another object. Now, here's the trick: somewhere in the processing 
of that other method call, the flow of control may come *back* to the 
current Schedule and try to add events, albeit *after* the current tick. 
Like I said, my mind is drawing a blank, but I'm calling that "re-entrant", 
in the sense that I don't think such a thing was anticipated by the 
original developers. I've tried to follow the source enough to determine 
whether that should be "safe", that is, would the addition of events to the 
schedule be ok in the state that the schedule is in just before "pre 
execute" ends? It's a little like a threading question but I'm only 
assuming a single thread of control here.

It *looks* safe, because basically what preExecute does is set aside a set 
of actions to be performed during "execute", and changes to the priority 
queue once that is done should not effect that set, and the existence of 
that set shouldn't effect the state of the priority queue. However, I 
thought I'd check in with the development team to find out for sure...

Thanks,
Andy

============================================
Andrew J. Cleary, Software Engineer/Computational Scientist
Lawrence Livermore National Labs, 925-424-5890.
============================================

[Repast-developer] Display bug

[Vos, J. <jv...@an...>]

If you open a new display with the same title as one that is already open
the FrameFactory code crashes.  If you first close the display you can
reopen as many displays with the same title as you'd like, but if you don't
this code

FrameData data = (FrameData) dataMap.get(title);

if (data != null) {

      frame.setBounds(data.bounds);

data.frame = frame;

} else {

data = new FrameData(title, null, frame);

dataMap.put(title, data);

}

crashes with a null pointer exception at frame.setBounds(data.bounds);

oh and if you change it to 

if (data != null) 

      if (data.bounds != null)

            ...

you end up with two windows, one that doesn't work.

RE: [Repast-developer] probing properties of collection type

[Ivan L. <ila...@se...>]

Thanks guys...


-----Original Message-----
From: Mark R. Diggory [mailto:mdi...@la...]
Sent: Friday, June 20, 2003 5:59 PM
To: Gulyas Laszlo
Cc: Ivan Lazarevic; rep...@li...
Subject: Re: [Repast-developer] probing properties of collection type


Hey, I've got it in my source tree, its welcome to be integrated into
RePast. I can jar it up as well, if anyone wants it before then.
http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/repast-jellytag/repast-jelly-
taglibrary/common/src/java/org/mrd/repast/util/
-M.

Gulyas Laszlo wrote:

>Hi,
>
>Also, a while back Mark Diggory (mdi...@la...) had a
>prototype that could handle arrays, and so on. I don't know what has
>happened to it...
>
>HTH,
>
>gulya
>
>++++++++++++++++++++++++++++++++++++++
>If you can represent the individual elements as strings you can make the
>get/set methods for the collection return a string representation (e.g. "1
>2
>4 5 9") , you can then parse the String in to the individual elements in
>the
>set method. If they can't be represented as strings you'll have to do a
>custom approach.
>
>
>Nick
>
>
>----- Original Message -----
>From: "Ivan Lazarevic" <ila...@se...>
>To: <rep...@li...>
>Sent: Thursday, June 19, 2003 10:24 AM
>Subject: [Repast-developer] probing properties of collection type
>
>
>
>
>
>>I'm trying to use a probe dialog to display an object property which is
>>
>>
>a
>
>
>>collection. Is there a way to do this using the existing probing
>>
>>
>mechanism?
>
>
>>What I achieved so far is a probe dialog saying that my list in not
>>
>>
>empty,
>
>
>>but I couldn't show its members.
>>
>>It crossed my mind that I might have to define my own collection type,
>>
>>
>and
>
>
>>some access methods for it. But then again, what should be the accessor
>>method names, and where are the limits of this approach?
>>
>>Thanks,
>>Ivan Lazarevic
>>
>>
>>
>>
>>
>>
>>
>>-------------------------------------------------------
>>This SF.Net email is sponsored by: INetU
>>Attention Web Developers & Consultants: Become An INetU Hosting Partner.
>>Refer Dedicated Servers. We Manage Them. You Get 10% Monthly Commission!
>>INetU Dedicated Managed Hosting http://www.inetu.net/partner/index.php
>>_______________________________________________
>>Repast-developer mailing list
>>Rep...@li...
>>https://lists.sourceforge.net/lists/listinfo/repast-developer
>>
>>
>>
>
>
>
>
>


--
Mark Diggory
Software Developer
Harvard MIT Data Center
http://www.hmdc.harvard.edu

Re: [Repast-developer] topology prototype

[Mark R. D. <mdi...@la...>]

Gulyas Laszlo wrote:

>Great!
>
>I'll have a look as soon as I can have my hands on it (and can find the
>time).
>[Currently, I'm in Lyon for a couple of weeks at EU's Complex Systems
>"Thematic Institute". It's intended as a kind of temporary European SFI;
>we'll see how it goes. If it goes well, I won't have time for "outside"
>stuff.
>So far, the first few days were mild -- I even had time to work on my
>Harvard job! Do you copy, Mark? ;-))]
>
>Take care!
>
>Gulya
>  
>
You mean you havn't been working all this time? ;-)

-- 
Mark Diggory
Software Developer
Harvard MIT Data Center
http://www.hmdc.harvard.edu

Re: [Repast-developer] probing properties of collection type

[Mark R. D. <mdi...@la...>]

Hey, I've got it in my source tree, its welcome to be integrated into 
RePast. I can jar it up as well, if anyone wants it before then.
http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/repast-jellytag/repast-jelly-taglibrary/common/src/java/org/mrd/repast/util/
-M.

Gulyas Laszlo wrote:

>Hi,
>
>Also, a while back Mark Diggory (mdi...@la...) had a
>prototype that could handle arrays, and so on. I don't know what has
>happened to it...
>
>HTH,
>
>gulya
>
>++++++++++++++++++++++++++++++++++++++
>If you can represent the individual elements as strings you can make the
>get/set methods for the collection return a string representation (e.g. "1
>2
>4 5 9") , you can then parse the String in to the individual elements in
>the
>set method. If they can't be represented as strings you'll have to do a
>custom approach.
>
>
>Nick
>
>
>----- Original Message -----
>From: "Ivan Lazarevic" <ila...@se...>
>To: <rep...@li...>
>Sent: Thursday, June 19, 2003 10:24 AM
>Subject: [Repast-developer] probing properties of collection type
>
>
>
>  
>
>>I'm trying to use a probe dialog to display an object property which is
>>    
>>
>a
>  
>
>>collection. Is there a way to do this using the existing probing
>>    
>>
>mechanism?
>  
>
>>What I achieved so far is a probe dialog saying that my list in not
>>    
>>
>empty,
>  
>
>>but I couldn't show its members.
>>
>>It crossed my mind that I might have to define my own collection type,
>>    
>>
>and
>  
>
>>some access methods for it. But then again, what should be the accessor
>>method names, and where are the limits of this approach?
>>
>>Thanks,
>>Ivan Lazarevic
>>
>>
>>
>>
>>
>>
>>
>>-------------------------------------------------------
>>This SF.Net email is sponsored by: INetU
>>Attention Web Developers & Consultants: Become An INetU Hosting Partner.
>>Refer Dedicated Servers. We Manage Them. You Get 10% Monthly Commission!
>>INetU Dedicated Managed Hosting http://www.inetu.net/partner/index.php
>>_______________________________________________
>>Repast-developer mailing list
>>Rep...@li...
>>https://lists.sourceforge.net/lists/listinfo/repast-developer
>>
>>    
>>
>
>
>
>  
>


-- 
Mark Diggory
Software Developer
Harvard MIT Data Center
http://www.hmdc.harvard.edu

Re: [Repast-developer] probing properties of collection type

[Gulyas L. <gu...@om...>]

Hi,

Also, a while back Mark Diggory (mdi...@la...) had a
prototype that could handle arrays, and so on. I don't know what has
happened to it...

HTH,

gulya

++++++++++++++++++++++++++++++++++++++
If you can represent the individual elements as strings you can make the
get/set methods for the collection return a string representation (e.g. "1
2
4 5 9") , you can then parse the String in to the individual elements in
the
set method. If they can't be represented as strings you'll have to do a
custom approach.


Nick


----- Original Message -----
From: "Ivan Lazarevic" <ila...@se...>
To: <rep...@li...>
Sent: Thursday, June 19, 2003 10:24 AM
Subject: [Repast-developer] probing properties of collection type



> I'm trying to use a probe dialog to display an object property which is
a
> collection. Is there a way to do this using the existing probing
mechanism?
> What I achieved so far is a probe dialog saying that my list in not
empty,
> but I couldn't show its members.
>
> It crossed my mind that I might have to define my own collection type,
and
> some access methods for it. But then again, what should be the accessor
> method names, and where are the limits of this approach?
>
> Thanks,
> Ivan Lazarevic
>
>
>
>
>
>
>
> -------------------------------------------------------
> This SF.Net email is sponsored by: INetU
> Attention Web Developers & Consultants: Become An INetU Hosting Partner.
> Refer Dedicated Servers. We Manage Them. You Get 10% Monthly Commission!
> INetU Dedicated Managed Hosting http://www.inetu.net/partner/index.php
> _______________________________________________
> Repast-developer mailing list
> Rep...@li...
> https://lists.sourceforge.net/lists/listinfo/repast-developer
>



-- 
--
Laszlo Gulyas				las...@sz...
AI Laboratory				http://www.sztaki.hu/~gulyas/
Computer and Automation Research Inst.  H-1111, Budapest, Kende u. 13-17.
Hungarian Academy of Sciences		* 36 30 210-29-66

Re: [Repast-developer] CVS

[thowe <th...@sr...>]

I thought that I had moved everything over from the old web site.  Can
you please tell me where this info was?

Here's the info for now:
As anonymous:

cvs -d:pserver:ano...@re...:/cvsroot/repast login

(at the password prompt, just hit return)

cvs -z3 -d:pserver:ano...@re...:/cvsroot/repast co
repast

As a user:

cvs -z3 -d:ext:use...@re...:/cvsroot/repast co repast


Warning:  I am rapidly changing the code.  The base interfaces have
already changed dramatically.

For example, what is currently called RelationalTopology now looks like:

public List getRelations(Object element);
public List getRelations(Object element, double range);
public double distance(Object element1, Object element2);
public String getRelationType();
public void setRelationType(String type);

Which is different than before.  I'm trying to move this somewhere
closer to a metric space (as we talked about in October) after thinking
about some of Mark's code.  Then the graph/network stuff can come out of
that. (as well as the Discrete2DStuff).

Anyhoo, it will be changing.

-Tom


On Fri, 2003-06-20 at 07:30, Gulyas Laszlo wrote:
> Hi,
> 
> I'm notoriously bad at using CVS. So, I was a heavy user of the part of
> the old RePast site that told us ignorant users how to check out the
> source from CVS. Could somebody help?
> 
> Thx,
> 
> gulya

[Repast-developer] CVS

[Gulyas L. <gu...@om...>]

Hi,

I'm notoriously bad at using CVS. So, I was a heavy user of the part of
the old RePast site that told us ignorant users how to check out the
source from CVS. Could somebody help?

Thx,

gulya

-- 
--
Laszlo Gulyas				las...@sz...
AI Laboratory				http://www.sztaki.hu/~gulyas/
Computer and Automation Research Inst.  H-1111, Budapest, Kende u. 13-17.
Hungarian Academy of Sciences		* 36 30 210-29-66