RELOAD!

[Zomis/AdventOfCode] 4 commits. 2780 additions. 16 deletions.

@SimonForsberg Well thanks for sharing it even if you aren't proud

hey

Done almost no programming at work this week, check

Hey

What's up today?

Monking!

@SimonForsberg Hmm. So keep putting stuff in a Set and keep track of the size of it? So when you add in an element and the size remains the same then you have your duplicate?

@skiwi VS Community 2017 Version: 15.9

@Phrancis Hm, that should be a good version

@skiwi Works fine AFAICT, just took like an hour to install

@Phrancis good call checking size. Way more efficient than checking if the value exists. Especially on a set that large.

@bruglesco I have a feeling that the Set implementation probably already does this existence check when attempting to add a value, so it may not be that much more efficient

@Phrancis Then doing it twice is twice as inneficient

True

@bruglesco Depends on the implementation. Also, depending on the language the add method itself might return a specific value if the value existed already. I know Java does this.

Mathieu Guindon vs. Simon Forsberg: 11993 diff. Year: -244. Quarter: +105. Month: +10. Week: +5. Day: +5.

@SimonForsberg Looks like add() is a void method, returns None whether or not a new item was added

>>> foo = set()
>>> foo.add('foo')
>>> print(foo.add('bar'))
None
>>> print(foo.add('foo'))
None