search

Wollnashorn / Voronoi

Fast and lightweight implementation of the Fortune algorithm for generating Voronoi diagrams and Delaunay triangulations
MIT License
9 stars 3 forks source link

Examples fail to build #2

Closed BitBunch closed 9 months ago

BitBunch commented 9 months ago

When trying to build the examples, they fail with the following:

include\xtree(1075,27): error C2440: 'static_cast': cannot convert from 'Voronoi::SparseAllocator<_Newfirst>' to 'Voronoi::SparseAllocator<_Newfirst>'
        with
        [
            _Newfirst=std::_Tree_node<Voronoi::Diagram<Vector,std::_Array_const_iterator<Vector<float>,10000>>::Bisector,void *>
        ]
        and
        [
            _Newfirst=std::_Container_proxy
        ]

Environment:

Wollnashorn commented 9 months ago

Hi @BitBunch, thanks for the report! I assume the compilation errors only occur for debug builds, but not release builds. I will look into that and find a solution later today 🙂

BitBunch commented 9 months ago

Hi, thanks for the quick reply. Yes, only for Debug builds. forgot to add that. This looks very nice btw!

BitBunch commented 9 months ago

I tried your latest changes, debug now builds. However, running the example_simple project, generates an exception. Let me know if I can provide more info.

image image

Wollnashorn commented 9 months ago

It should now be fixed, I briefly tested it with MSVC, Clang and GCC. Thanks for your feedback, I appreciate that. Hope this little implementation is useful to you

BitBunch commented 9 months ago

That did it for me. Thanks for the quick responses.