I have two agentsets. Are there functions for finding:
- An agentset of agents that are present in both (intersection)
- 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 与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…