Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>STL Map that comes with visual studio 2008 will give you O(log(n)) for each function call since it hides a tree structure beneath. With modern compiler (depending on implementation) , A switch statement will give you O(1) , the compiler translates it to some kind of lookup table. So in general , switch is faster.</p> <p><strong>However</strong> , consider the following facts:</p> <p>The difference between map and switch is that : Map can be built dynamically while switch can't. Map can contain any arbitrary type as a key while switch is very limited to c++ Primitive types (char , int , enum , etc...).</p> <p>By the way , you can use a hash map to achieve nearly O(1) dispatching (though , depending on the hash table implementation , it can sometimes be O(n) at worst case). Even though , switch will still be faster.</p> <p><strong>Edit</strong> </p> <p><em>I am writing the following only for fun and for the matter of the discussion</em></p> <p>I can suggest an nice optimization for you but it depends on the nature of your language and whether you can expect how your language will be used. </p> <p>When you write the code: You divide your tokens into two groups , one group will be of very High frequently used and the other of low frequently used. You also sort the high frequently used tokens. For the high frequently tokens you write an if-else series with the highest frequently used coming first. for the low frequently used , you write a switch statement.</p> <p>The idea is to use the CPU branch prediction in order to even avoid another level of indirection (assuming the condition checking in the if statement is nearly costless). in most cases the CPU will pick the correct branch without any level of indirection . They will be few cases however that the branch will go to the wrong place. Depending on the nature of your languege , Statisticly it may give a better performance.</p> <p><strong>Edit</strong> : Due to some comments below , Changed The sentence telling that compilers will allways translate a switch to LUT.</p>
    singulars
    1. This table or related slice is empty.
    1. POWhat is more efficient a switch case or an std::map
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USuser88637
    1. USuser88637
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POWhat is more efficient a switch case or an std::map
      singulars
      1. PTQuestion
    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
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    1. COThe compiler may convert it to a lookup table, but there is no requirement that it do so. If it doesn't, it will be O(N).
      singulars
      1. PO
      1. This table or related slice is empty.
    2. COAll parsers I've seen use a switch case. Is there a good reason for that?
      singulars
      1. PO
      1. USthe_drow
    3. COlike yossi1981 said, a switch statement is in most cases much faster. so if you have the choice (usually parsers (or more likely the tokenizer/lexer) follow a specific syntax, not made up in runtime) you should prefer a switch.
      singulars
      1. PO
      1. USIdan K
 

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