meta user
network profile
| bio | website | henrik-schmid.de |
|---|---|---|
| location | Germany | |
| age | 50 | |
| visits | member for | 2 years, 5 months |
| seen | May 14 at 6:37 | |
| stats | profile views | 10 |
Software Developer (C++, C#) at Polytec GmbH
Pascal/Delphi 10yrs
C++ 10yrs
C# 5yrs
|
Nov 2 |
comment |
reversible, reflexive function with unique cardinality @aioobe - it should be searchable, so {1,7} must be found whether it's stored as 1, 7 or 7, 1. So a unique representation would at least be helpful. |
|
Nov 2 |
comment |
reversible, reflexive function with unique cardinality f(1,7) = 4294967303, f(5,3) = 12884901893 |
|
Nov 2 |
comment |
reversible, reflexive function with unique cardinality This representation of set is not unique. You could sort the elements, which then yields essentialy the solution in my answer. |
|
Nov 2 |
comment |
reversible, reflexive function with unique cardinality It's the shift operator. |
