Bounded FIFO queue with exclusive access











up vote
0
down vote

favorite












What would you say to be the best structure/way of maintaining a bounded FIFO queue with a some kind of callback being executed upon element removal, when the queue is full? I was thinking of locking everything, while checking size and doing modifications manually, but is there a a better way?










share|improve this question


























    up vote
    0
    down vote

    favorite












    What would you say to be the best structure/way of maintaining a bounded FIFO queue with a some kind of callback being executed upon element removal, when the queue is full? I was thinking of locking everything, while checking size and doing modifications manually, but is there a a better way?










    share|improve this question
























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      What would you say to be the best structure/way of maintaining a bounded FIFO queue with a some kind of callback being executed upon element removal, when the queue is full? I was thinking of locking everything, while checking size and doing modifications manually, but is there a a better way?










      share|improve this question













      What would you say to be the best structure/way of maintaining a bounded FIFO queue with a some kind of callback being executed upon element removal, when the queue is full? I was thinking of locking everything, while checking size and doing modifications manually, but is there a a better way?







      queue thread-safety locking fifo






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked 2 days ago









      norbert23

      4316




      4316





























          active

          oldest

          votes











          Your Answer






          StackExchange.ifUsing("editor", function () {
          StackExchange.using("externalEditor", function () {
          StackExchange.using("snippets", function () {
          StackExchange.snippets.init();
          });
          });
          }, "code-snippets");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "1"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });














           

          draft saved


          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53417693%2fbounded-fifo-queue-with-exclusive-access%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown






























          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















           

          draft saved


          draft discarded



















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53417693%2fbounded-fifo-queue-with-exclusive-access%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Catalogne

          Violoncelliste

          Héron pourpré