Ada: linked list example in Naiditch's book -


in chapter 11: access types of book: rendez-vous ada naiditch (1995), naiditch gives rather complete example on how create linked list contains information restaurant. understand largely data structure following book's example. can understand information user entering in linked list exist during lifetime of program. author not storing information restaurant text files. what's use of linked list example if information entered user not stored after user exits program?

does make sense store user entered information in text file , read them linked list further operations on them? doing operations such adding or deleting entries disturb original text file linked list read @ start.

thank you.

ps: might have noted, trying real-life example of linked list , new data structure well.

as discussed here, 1995 example predates addition of containers predefined library of ada 2005. textbook example may guide understanding of concrete implementations encountered particular ada library. see 8.1 organization of containers overview.


Comments

Popular posts from this blog

apache - Remove .php and add trailing slash in url using htaccess not loading css -

javascript - jQuery show full size image on click -