Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>If you're just going to iterate over the <code>std::vector&lt;std::string&gt;</code> without adding or removing elements (during a single iteration), then why not just use a set of pointers/iterators for the duplicates:</p> <pre><code>std::vector&lt;std::string&gt; subtreePaths = //the ones you want to iterate for ... std::set&lt;std::vector&lt;std::string&gt;::const_iterator&gt; setUniquePaths; for(auto iterS=subtreePaths.begin(); iterS!=subtreePaths.end(); ++iterS) for(auto iterP=vecPaths.begin(); iterP!=vecPaths.end(); ++iterP) if(matches(*iterP, *iterS) &amp;&amp; setUniquePaths.insert(iterP).second) std::cout &lt;&lt; *iterP &lt;&lt; std::endl; //or whatever </code></pre> <p>(of course the <code>auto</code> is C++11, feel free to replace it by a corresponding iterator type for C++98/03 compliance).</p> <p>But maybe I misunderstood what you're actually trying to achieve.</p> <hr> <p><strong>EDIT:</strong> If you don't already have all your existing paths in the <code>vecPaths</code> vector and you actually want to somehow iterate over your real file system constructing the <code>vecPaths</code> vector with all the found (and duplicate-cleaned) paths, then my above aproach is of course rubbish, since it assumes a mere string-based iteration over a known vector of all paths.</p> <p>But if that's the case, you can just drop the vector completely and use a single <code>std::set&lt;std::string&gt;</code> to collect all the paths you encounter (being automatically unique now). No need for an additional vector.</p>
    singulars
    1. This table or related slice is empty.
    1. POHow to make a vector of unique path names memory-effectively
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USChristian Rau
    1. USChristian Rau
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COif I _drop the vector completely_ , will set be iterated alphabetically?
      singulars
      1. PO
      1. USBlackBada
    2. COI'd better just use set. It really iterates alphabetically [source](http://liveworkspace.org/code/a9010b9df09b1fc89b8685faefa649f0)
      singulars
      1. PO
      1. USBlackBada
    3. CO@DenisPavlyukov Yes, a `std::set` is guaranteed to be sorted (usually a binary search tree), in contrast to C++11's `std::unordered_set` (usually a hash table). But you have to be aware that the order is determined by the underlying character type of the strings, which will most probably sort all lower-case characters before all upper-case characters. But of course you can override this order by supplying a custom ordering predicate to `std::set`, which by default is just the `<` operator.
      singulars
      1. PO
      1. USChristian Rau
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload