(s)
| 4667 | return s < o ? 1 : s > o ? -1 : 0 |
| 4668 | } |
| 4669 | function hashIterable(s) { |
| 4670 | if (s.size === 1 / 0) return 0 |
| 4671 | var o = isOrdered(s), |
| 4672 | i = isKeyed(s), |
| 4673 | a = o ? 1 : 0 |
| 4674 | return murmurHashOfSize( |
| 4675 | s.__iterate( |
| 4676 | i |
| 4677 | ? o |
| 4678 | ? function (s, o) { |
| 4679 | a = (31 * a + hashMerge(hash(s), hash(o))) | 0 |
| 4680 | } |
| 4681 | : function (s, o) { |
| 4682 | a = (a + hashMerge(hash(s), hash(o))) | 0 |
| 4683 | } |
| 4684 | : o |
| 4685 | ? function (s) { |
| 4686 | a = (31 * a + hash(s)) | 0 |
| 4687 | } |
| 4688 | : function (s) { |
| 4689 | a = (a + hash(s)) | 0 |
| 4690 | } |
| 4691 | ), |
| 4692 | a |
| 4693 | ) |
| 4694 | } |
| 4695 | function murmurHashOfSize(s, o) { |
| 4696 | return ( |
| 4697 | (o = le(o, 3432918353)), |
no test coverage detected