Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

5
  • @8bittree..thanks for the reply..my requirement would be to support 3 different versions simultaneously with a sinlge file.For that how can V1 know what is the info required to be read by it. Commented Oct 19, 2015 at 15:53
  • @user2954936 V1 reads in the entire file, parses it, and stores it in a dynamic data structure (perhaps a dictionary/map/associative array). Then, it only access the keys that it knows about. Keys from later versions still get put into the dictionary, but they're never accessed in V1. Alternatively, create a fixed data structure (such as a class or struct), then, as you're reading in the config file, look for terms that V1 knows about and load those into the struct, and skip by unrecognized things. Commented Oct 19, 2015 at 16:06
  • @8bittree..thanks for clarification..is there any way i could combine these versions to a single file say V and read the data according to the version. Commented Oct 19, 2015 at 16:29
  • @8bittree....I working on a design where somehow i could combine these versions to a single file say V and read the data according to the version.Lets say [A\A2] will be there in this common/combined file but it is there in V1 and in V3 but not in V2. How can that be found out,any suggestions. Commented Oct 19, 2015 at 16:35
  • @user2954936 I added a more in depth example. See if that helps. Commented Oct 19, 2015 at 17:33