Type-safe generic data structures in plain-old C? -

-

I have done more C ++ programming than "plain old C" programming. One thing that I miss a lot when there are programming type-safe generic data structures in plain C, which are provided by templates in C ++.

For concretions, consider a general single link list. In C ++, this is a simple matter to define your template class, and then instantiate it for those types of methods instantly.

In C, I can think of some ways of implementing a common single link list:

  1. Type the linked list type and helpful processes once Use zero signals to move around one type of type system.
  2. Write preprocessor macros while taking the required types of names, to generate a type-specific version of the data structure and support processes.
  3. Use a more sophisticated, standalone tool for the codes of the required types. I do not like option 1, because it changes the type system, and can be worse than a specific type-specific implementation, a uniform representation of the data structure for all types, And for zero signals / castings, as far as I can see, an indication is needed that special implementation will be avoided for any element type.

    Option 2 does not require any additional equipment, but it feels somewhat frightening, and can give bad compressor errors inappropriately used.

    Option 3 Compared to Better Compiler Error Message Option 2, the special data structure code will be in extended form which can be opened in an editor and inspected by the programmer (as opposed to the code generated by preprocessor macros) . However, this option is the most weighty, one type of "poor-man template" I have used earlier in this approach, using a simple script for a specialist of "templated" version of some code.

    I want to do my future "low-level" projects in C. Instead of C, but are afraid of rewriting general data structures for each specific type.

    What do people have experience with this problem? Is there a good library of generic data structures and algorithms that do not go with option 1 (i.e. casting casting zero pointers, sacrificing the type of security and giving a level of disbelief)? Option 1 I see the approach taken by the most implementation of generic containers.

        • I do not think I would consider a safe type in one of these ways. Useful, but not secure type


Comments

Post a Comment

Popular posts from this blog

windows - Heroku throws SQLITE3 Read only exception -

-
After I deploy the app to Heroku, I have to run migration scripts and get this error message ... ITES \ padrino \ prophetmargin & gt; Heroku Rack AR: Rack mutated! SQLite3 :: ReadOnlyException: only one try to write database to read: CREATE TABLE "schema_migrations" ( "version" varchar (255) NOT NULL) /disk1/home/slugs/215264_925fd2c_65a3/mnt/.bundle/gems/gems/ padrino-core- is 0.9.11 / lib / padrino-core / cli / rake.rb: 9: in `init ' how can this be? I also tried to run Heroku dbpush SQLite: //db/my-db.db and that did not work Horoku sqlite3 but using postgres does not do. I'm not sure why you are receiving this error, however, as I have used sqlite3 in development and when pushing it into its travel, they do some magic which migrates to postgrads. I'm absolutely sure how Heroku does 'backwash' this database but it seems that this is happening to you because it's the SQLite db file which is obviously due to Heroku's
Read more

lex - Building a lexical Analyzer in Java -

-
I am currently learning lexical analysis in compiler design. To know how a lexical analyzer actually works, I am trying to build myself. I am planning to make it in Java The input to the lexical analyzer is a .tex file that is of the following format. \ section {script} {intro} \ section {Scope} arbitrary text \ section {relevance} uncontrolled text \ subdivision (profit) arbitrary text \ subsubsection {in real life} \ subdivision {Ingredient} \ end {document} The output of the lecture may be a table of contents with a page number in another file. 1 Introduction 1 1.1 Scope 1 1.2 Relevance 2 1.2.1 Benefits 2 1.2.1.1 Real life 2 1.2.2 loss 3 I hope that This problem is within the scope of Language Analysis Read the .exe file and check '\' and continue to check whether it is actually on search In the sectioning command is set to indicate whether or not a flag variable is the type of sectioning. I hope the above approach will work for the construction of Lexa
Read more

python - rename keys in a dictionary -

-
I want to change the names of keys in a dictionary which are ints, and I need them so that the inputs with key zero They can sort correctly. For example, my keys are like this: '1', '101', '11' and I may need them: '001', '101', '011' What is doing, but I know that there is a better way tmpDict = {} in the ADC for the old: t MpDict ['% 04d'% int (olden)] = addict [oldkey] New controlled = tmpDict You are going wrong about this if you want to draw entries on a line in a specific way, then you have to sort on the extraction. for sorted (D, key = int): print '% s:% R'% (k, d [k]) < / Div>
Read more