Databases
StackOverflow2013
Postsdbo
POOne more string implementation in C: advantages and disadvantages
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POOne more string implementation in C: advantages and disadvantages
    primarykey
    data
    text
    <p>After reading the article <a href="http://joelonsoftware.com/articles/fog0000000319.html" rel="nofollow noreferrer">"Back to Basics"</a> by Mr.Spolsky I have thought about string structure in C, that converges most of advantages of Pascal-style string (with length byte) and classic ASCIIZ-strings in C and reduces most of their disadvantages. The main demand is to make this new string effective in machine commands. (for this task I assume, that every character is single byte. Excuse me. :) ) </p> <p>My idea is to store strings (that also can contain zero bytes) in byte array of such structure:</p> <ul> <li><strong>0</strong> - length in bytes of string length presentation (value is 1 or more);</li> <li><strong>1..presLength+1</strong> - string length presentation (1 or more bytes; may have fixed length (that processes simpler, but determines string length limit) or not);</li> <li><strong>presLength+2..arrrayLength</strong> - string content.</li> </ul> <p>I expect this approach can solve most of the problems noticed by Mr.Spolsky, but suppose, that there are some lacks. I want to know you opinion. What do you think about it?</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USAlexander Pavloshchuk
    1. USAlexander Pavloshchuk
    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. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POOne more string implementation in C: advantages and disadvantages
      1. This table or related slice is empty.
      1. VTUpMod
    1. COJoel isn't actually writing about strings, you know. He uses them merely as an illustration, because any programmer will know them. But his main point is that you should avoid O(N*N) algorithms.
      singulars
      1. POOne more string implementation in C: advantages and disadvantages
      1. USMSalters
    2. CODid not understand a single thing to your representation, and not even the problem you are trying to solve. You want to solve the problem of making strcat() not an O(n*n) algorithm ? There are plenty of ways to do that. If you are planning about writing a real program, I suggest to use existing string structures provided by frameworks such as Qt, Gtkmm, WxWindows, MFC, std::lib . All of them can solve the strcat problems and many more, like unicode conversion and other tricky features.
      singulars
      1. POOne more string implementation in C: advantages and disadvantages
      1. USPhilippe F
    3. CO<i>You want to , solve the problem of making strcat() not an O(n*n) algorithm</i> Yes, this is one of the tasks. <i>If you are planning about writing a real program,</i> If I write a real program, I would not reinvent a bycicle, surely. This task is only a pure mind game. I think that comparsion of string implementation in C and Pascal is a good sample of different approaches, that has different advantages and disadvantages. And some disadvantages are generated by advantages.
      singulars
      1. POOne more string implementation in C: advantages and disadvantages
      1. USAlexander Pavloshchuk
 

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