Giter Club home page Giter Club logo

Comments (5)

cameron314 avatar cameron314 commented on May 17, 2024

Yep, this is possible, and supported. It should be thread-safe. If it's not, that's a huge bug which I'd love a reproducible test-case for! :-)

The elements are copied (or moved, if possible) into internal storage (just like std::vector, for example) during an enqueue, and moved back out during a dequeue. The internal bookkeeping makes the reservation of the slot to store the element in (and dequeue it afterwards) thread-safe. The code does not differentiate between primitive types like int and complex user types -- the only difference is that the constructor and destructor calls compile to no-ops for POD-types.

Note that boost::lockfree::queue has several restrictions, but it's usable from many threads at once, whereas mine has almost no restrictions except that it's usable only by a maximum of two threads (one producer and one consumer). Apples and oranges, I'm afraid.

from readerwriterqueue.

tbeu avatar tbeu commented on May 17, 2024

Thanks for the fast reply and explanation.

from readerwriterqueue.

cameron314 avatar cameron314 commented on May 17, 2024

Sure, no problem.

from readerwriterqueue.

tbeu avatar tbeu commented on May 17, 2024

Did you ever consider to apply for integration in boost::lockfree? I know that the review process for boost is cumbersome but I believe it is worth to try since this functionality (lockfree single producer/single consumer queue that works on non-primitive data types) really is missing.

My test application was a simple line-based text compare tool where two producer threads fill two queues and one consumer thread pops them and does the comparison.

from readerwriterqueue.

cameron314 avatar cameron314 commented on May 17, 2024

Hmm, no I hadn't. I'm not a super huge fan of Boost, mostly because I find it cumbersome to integrate into projects (it's got a lot of awesome stuff in it, but it's one heck of a dependency to pull in for small projects). If somebody else wants to integrate it into Boost that's fine by me, but I don't have the time to pursue it myself.

As far as I can tell, Boost's wait-free single-producer single-consumer queue does support non-primitive data types (just not dynamic resizing of the queue), though I'm not sure it supports move semantics.

from readerwriterqueue.

Related Issues (20)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.