Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

0 votes
506 views
in Technique[技术] by (71.8m points)

intersection - NetLogo two agentsets operations

I have two agentsets. Are there functions for finding:

  1. An agentset of agents that are present in both (intersection)
  2. An agentset of agents that are present in one and not the other

I'm finding it very difficult to implement this by hand, especially when it's needed inside of a triple ask

Ideal use would be similar to with syntax:

let cross set1 and-in set2
let uniq set1 with [color = red] not-in set2

Simple things like "Is agent A in the agentset X?" are problematic

See Question&Answers more detail:os

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome To Ask or Share your Answers For Others

1 Answer

0 votes
by (71.8m points)

For the first one you use the turtle-set primitive. For the second one you need the member? primitive, which also works on agentsets. As such:

to setup
  ca
  create-turtles 10 [set color red]
  create-turtles 10 [set color blue]
  let red-ones turtles with [color = red]
  let blue-ones turtles with [color = blue]

  ;join 2 agent sets
  let joinset (turtle-set red-ones blue-ones)
  show joinset

  let even-ones (turtles with [who mod 2 = 0])
  ;subtract even-ones from red-ones
  let subtractset red-ones with [not member? self even-ones]
  show subtractset
end

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

...