Search Results

Search found 47 results on 2 pages for 'deque'.

Page 1/2 | 1 2  | Next Page >

• STL deque accessing by index is O(1)?

  - by jasonline

  I've read that accessing elements by position index can be done in constant time in a STL deque. As far as I know, elements in a deque may be stored in several non-contiguous locations, eliminating safe access through pointer arithmetic. For example: abc-defghi-jkl-mnop The elements of the deque above consists of a single character. The set of…

  Read the article

• Reversing a circular deque without a sentinel

  - by SDLFunTimes

  Hey Stackoverflow I'm working on my homework and I'm trying to reverse a circular-linked deque without a sentinel. Here are my data structures: struct DLink { TYPE value; struct DLink * next; struct DLink * prev; }; struct cirListDeque { int size; struct DLink *back; }; Here's my approach to reversing the deque: void…

  Read the article

• Code golf: c++ deque->vector

  - by anon

  I'm coding in C++ What is the shortest function of: template<T> std::vector<T> make_copy(const deque<T>& d) { // your code here } ?

  Read the article

• std::deque: How do I get an iterator pointing to the element at a specified index?

  - by Ptah- Opener of the Mouth

  I have a std::deque, and I want to insert an element at a specified index (I'm aware that std::list would be better at this). The deque::insert() function takes an iterator to specify the location to insert. Given an index, how can I get an iterator pointing to that location, so that I can pass that iterator to insert()? For…

  Read the article

• A deque based on binary trees

  - by Greg Ros

  This is a simple immutable deque based on binary trees. What do you think about it? Does this kind of data structure, or possibly an improvement thereof, seem useful? How could I improve it, preferably without getting rid of its strengths? (Not in the sense of more operations, in the sense of different design) Does this sort of…

  Read the article

• Java code optimization on matrix windowing computes in more time

  - by rano

  I have a matrix which represents an image and I need to cycle over each pixel and for each one of those I have to compute the sum of all its neighbors, ie the pixels that belong to a window of radius rad centered on the pixel. I came up with three alternatives: The simplest way, the one that recomputes the window for each…

  Read the article

• Program crash on deque from queue

  - by SwedishGit

  My first question asked here, so please excuse if I fail to include something... I'm working on a homework project, which basically consists of creating a "Jukebox" (importing/exporting albums from txt files, creating and "playing" a playlist, etc.). I've become stuck on one point: When "playing" the playlist, which…

  Read the article

• What to choose to implement deque?

  - by atch

  What would you rather choose to implement deque: HashSet or LinkedList. And could you state cons and pros for both please? Thank you.

  Read the article

• Unable to deque messages from Topic after the listener listens the messages in spring jms

  - by sanjana

  I am sending the messages to Topic using oracle.jms.AQjmsFactory. The messages are stored in DB topic . Using DefaultMessageListenerContainer , the messages are being listen .But the problem is the messages are not dequeueing or deleting from the topic i.e., the messages are stucked in topic.

  Read the article

• C++ Unlocking a std::mutex before calling std::unique_lock wait

  - by Sant Kadog

  I have a multithreaded application (using std::thread) with a manager (class Tree) that executes some piece of code on different subtrees (embedded struct SubTree) in parallel. The basic idea is that each instance of SubTree has a deque that store objects. If the deque is empty, the thread waits until a new element is…

  Read the article

• Dequeue from messageQueue in the PeekCompleted Method

  - by Fraga

  i'm reading messages from MessageQueue using PeekCompleted, i do my process here and if everything go right, I need to remove it from the Queue! currenty i am using MyMessageQueue.Receive() and it works, but is this a reliable way of making sure each message will be processed right? MessageQueue MyMessageQueue; …

  Read the article

• Mistake in display and insert methods (double-ended queue)

  - by MANAL

  1) My problem when i make remove from right or left program will be remove true but when i call diplay method the content wrong like this I insert 12 43 65 23 and when make remove from left program will remove 12 but when call display method show like this 12 43 65 and when make remove from right program…

  Read the article

• How can I construct or return the underlying deque from a stack?

  - by BeeBand

  I want to be able to convert a std::stack< to a std::deque<. Is there a straightforward conversion?

  Read the article

• In C++, I want to implement a ring iterator for a deque that contains a personally defined class.

  - by George

  I have a function of a "Table" class that should add a player to the table. I decided that if the seat is taken, the function should try and go through all the seats and add the player to the next available seat. How do I implement this in my addPlayer function? int Table::addPlayer(Player player, int position)…

  Read the article

• Iterator not accessible because of private inheritance

  - by Bo Tian

  I've created a new class that composes std::deque by private inheritance, i.e, class B : private std::deque<A> { ... }; and in my source code I tried to use iterator of B, i.e., B::iterator it The compiler error is error C2247: 'std::deque<_Ty>::iterator' not accessible because 'B' uses…

  Read the article

• Template inheritence c++

  - by Chris Condy

  I have made a template singleton class, I have also made a data structure that is templated. My question is; how do I make my templated data structure inherit from a singleton so you can only have one float type of this structure? I have tested both seperate and have found no problems. Code provided…

  Read the article

• Unexpected performance curve from CPython merge sort

  - by vkazanov

  I have implemented a naive merge sorting algorithm in Python. Algorithm and test code is below: import time import random import matplotlib.pyplot as plt import math from collections import deque def sort(unsorted): if len(unsorted) <= 1: return unsorted to_merge =…

  Read the article

• Why does this class declaration not work on Visual Studio

  - by Roel

  So I'm trying to get some code that is written for gcc to compile on Visual Studio 2008. I have a problem that I have narrowed down to this: class value_t { public: typedef std::deque<value_t> sequence_t; typedef sequence_t::iterator iterator; }; This code…

  Read the article

• Inheritance classes in Scheme

  - by DreamWalker

  Now I research OOP-part of Scheme. I can define class in Scheme like this: (define (create-queue) (let ((mpty #t) (the-list '())) (define (enque value) (set! the-list (append the-list (list value))) (set! mpty #f) the-list) (define (deque) …

  Read the article

• Why does std queue not define a swap method specialisation

  - by Jamie Cook

  I've read that all stl containers provide a specialisation of the swap algorithm so as to avoid calling the copy constructor and two assignment operations that the default method uses. However, when I thought it would be nice to use a queue in some code I was working on I noticed…

  Read the article

• Need feedback on two member functions of a Table class in C++

  - by George

  int Table::addPlayer(Player player, int position) { deque<Player>::iterator it = playerList.begin()+position; deque<Player>::iterator itStart = playerList.begin()+postion; while(*it != "(empty seat)") { it++; if (it == playerList.end()) { it =…

  Read the article

• How do I optimize this postfix expression tree for speed?

  - by Peter Stewart

  Thanks to the help I received in this post: I have a nice, concise recursive function to traverse a tree in postfix order: deque <char*> d; void Node::postfix() { if (left != __nullptr) { left->postfix(); } if (right != __nullptr) {…

  Read the article

• logical or expression c++

  - by user1870181

  I have a problem using the Logical OR operator in C++. The problem is coming that the right-side expression is not evaluated if the left-side is true. I have two deque-s and I need to popLeft from them with a while, but if I can pop from the first…

  Read the article

• Manually manipulating ArrayList

  - by jsan

  I have an assignment where I have to create a deque, however I am not allowed to use any built-in classes or interfaces. I am implementing my deque using an array list. My problem is that when I have to, for instance, add to the beginning of the…

  Read the article

• How do you stop OgreBullet Capsule from falling over?

  - by Nathan Baggs

  I've just started implementing bullet into my Ogre project. I followed the install instructions here: http://www.ogre3d.org/tikiwiki/OgreBullet+Tutorial+1 And the rest if the tutorial here: http://www.ogre3d.org/tikiwiki/OgreBullet+Tutorial+2 …

  Read the article

1 2  | Next Page >