Browse Prior Art Database

Searchable Initialization File

IP.com Disclosure Number: IPCOM000119096D
Original Publication Date: 1997-Nov-01
Included in the Prior Art Database: 2005-Apr-01
Document File: 4 page(s) / 107K

Publishing Venue

IBM

Related People

Stern, BA: AUTHOR

Abstract

Disclosed is a method for enumerating data objects stored as application sections of an Initialization (INI) file. The application sections are threaded together using a doubly linked list. An application program can use this file to store and retrieve persistent data objects created at run time without resorting to a more complex data base implementation.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Searchable Initialization File

      Disclosed is a method for enumerating data objects stored as
application sections of an Initialization (INI) file.  The
application sections are threaded together using a doubly linked
list.  An application program can use this file to store and retrieve
persistent data objects created at run time without resorting to a
more complex data base implementation.

      The basic structure of INI files is a series of independent
"application sections", each of which represents a data object
manipulated by a program.  An application section is composed as
shown below.
  <DataObjectName>
  KeyWord1=Value1
  KeyWord2=Value2

      The data object name uniquely identifies each application
section of the INI file.  Each key word is unique within the
application section and identifies a property of the data object.
The value represents the current state of the property.

      This invention augments this basic structure by adding a doubly
linked list which threads all of the otherwise independent
application sections together.  This is implemented by adding a
special index application section and by placing two chaining
key-word entries in each  data object application section.

      The index application section serves two purposes.  First, it
has a unique identifier which is the only application section
identifier which must be known by a program before it uses the INI
file. Second,  it has two chaining key word entries.  One entry
indicates the first currently existing application section added to
the linked list and has a value which is that section's data object
name.  The other entry  indicates the last currently existing
application section added to the  linked list and has a value which
is that section's data object name. In  the event that there are no
existing application sections representing  data objects, both of
these values will be the name of the special index  application
section, which indicates a null reference.

      The two chaining key-word entries added to each data object
application section thread those sections into the linked list.  The
"previous" key-word entry's value indicates the existing application
section added to the linked list immediately prior to the current
section.  The "following" key-word entry's value indicates the
existing application section added to the linked list immediately
after the current section.  In the event there is no preceding or no
following data  object application section, the corresponding entry
will have a value that is the name of the special index application
section, which indicates a null reference.

      When a new data object application section is added to the INI
file, it is placed on the linked list after the last section
previously added.  This last section is found by reading its
identifier i...