Where communities thrive


  • Join over 1.5M+ people
  • Join over 100K+ communities
  • Free without limits
  • Create your own community
People
Repo info
Activity
  • Jan 31 2019 15:06

    ldionne on gh-pages

    Update benchmarks to 490dbf6 fo… (compare)

  • Jan 24 2019 07:47

    ldionne on gh-pages

    Update benchmarks to 490dbf6 fo… (compare)

  • Jan 23 2019 02:04
    pthom commented #432
  • Jan 18 2019 12:46

    ldionne on gh-pages

    Update benchmarks to 490dbf6 fo… (compare)

  • Jan 16 2019 22:27
    ricejasonf commented #434
  • Jan 05 2019 06:22
    ricejasonf commented #330
  • Jan 03 2019 11:40

    ldionne on gh-pages

    Update benchmarks to 490dbf6 fo… (compare)

  • Jan 02 2019 00:33
    ricejasonf closed #434
  • Jan 02 2019 00:33
    ricejasonf commented #434
  • Jan 02 2019 00:04
    ricejasonf opened #434
  • Dec 27 2018 13:11

    ldionne on gh-pages

    Update benchmarks to 490dbf6 fo… (compare)

  • Dec 22 2018 11:56
    pthom commented #432
  • Dec 22 2018 11:55
    pthom commented #432
  • Dec 21 2018 15:48
    pthom synchronize #432
  • Dec 21 2018 09:19
    sdebionne opened #433
  • Dec 21 2018 00:08
    ricejasonf commented #432
  • Dec 21 2018 00:03
    ricejasonf commented #432
  • Dec 20 2018 23:36
    pthom commented #432
  • Dec 20 2018 23:36
    pthom commented #432
  • Dec 20 2018 23:13
    ricejasonf commented #432
Barrett Adair
@badair
I'm exploring some ideas for a compile-time graph
Jason Rice
@ricejasonf
I think sort then group would be good unless there are only two keys then partition would be better
Barrett Adair
@badair
okay thanks
what if the types don't have an ordering though
Jason Rice
@ricejasonf
oh yeah :sweat_smile:
You could even use fold_left but it will be very slow
I'll take a hack at it later
Barrett Adair
@badair
I did it with fold_left like this
but it's probably a slow way to do it
Louis Dionne
@ldionne
@badair @ricejasonf For info, I’m trying to fix C++1z issues: boostorg/hana#361
Jason Rice
@ricejasonf
Sweet!
Barrett Adair
@badair
Is there a customization point for Hashable in the same way that you can define equal to satisfy Comparable?
Jason Rice
@ricejasonf
hana::hash_impl
Do you really need that?
Barrett Adair
@badair
is that part of the stable interface?
Jason Rice
@ricejasonf
yes
Barrett Adair
@badair
Yes I do
Barrett Adair
@badair
I don't see hash_impl in the documentation -- how do you customize it for your own type?
Jason Rice
@ricejasonf
watch my video :P
you specialize hash_impl for your datatype's tag
the public facing function is just hana::hash
Barrett Adair
@badair
I already did! Don't remember that part. Okay thanks
Jason Rice
@ricejasonf
I'm really curious about the use case you have for it
Barrett Adair
@badair
Let me back up then. Is there a type in Hana that's like hana::type but lets you store a value of that type inside? I didn't find one so I made one myself.
Jason Rice
@ricejasonf
Wouldn't that be just an instance of the value of that type?
Barrett Adair
@badair
Yeah. Does hana::type<T> have a member of type T?
bc that's what I need
Jason Rice
@ricejasonf
using Foo = typename my_type::type;
Do your As and Bs have run-time state?
Barrett Adair
@badair
yes
which is what makes Hana so perfect for my use case
Barrett Adair
@badair
this is what I ended up doing:
// todo this shouldn't be necessary
template<typename T>
struct type_v {
    T value;

    template<typename U>
    constexpr auto equal(U) const {
        return std::is_same<T, U>{};   
    }
};
Jason Rice
@ricejasonf
If it was me I would do hana::pair<hana::type<T>, hana::pair<T, V>>
Barrett Adair
@badair
I did that too
Jason Rice
@ricejasonf
was that no good?
Barrett Adair
@badair
I did both at the same time and made a TODO because I didn't implement Hashable
Jason Rice
@ricejasonf
Hashable is only used to decide what bucket a key/value will go in. It still uses Comparable to decide if the key is a match
Barrett Adair
@badair
Sure, but both are required if buckets are needed
Or, both are required
Jason Rice
@ricejasonf
The default for hana::hash is to just lift it to its hana::type
Barrett Adair
@badair
So by default everything is Hashable?
Jason Rice
@ricejasonf
yup :P
Barrett Adair
@badair
I was getting a weird error about something not being hashable
Jason Rice
@ricejasonf
oh.. maybe I am mistaken
I guess there are only implementations for IntregralConstant, type, and string... maybe others
Jason Rice
@ricejasonf
That means a group_by algorithm would have to return a value that is bothComparable and Hashable
If it was Orderable it could be sorted too
Pramod Srinivasan
@domarps
hey everyone, I just posted my issue about a boost python issue here : https://stackoverflow.com/questions/45576378/boost-python-importerror-undefined-symbol. It would be great if I can get feedback on how to resolve this issue.
Jason Rice
@ricejasonf
This is just a stab in the dark, but it appears that you are not actually linking the library. -L merely adds a directory for the compiler driver to search for libraries (I think).