Source information adapter and method for use in generating a computer memory-resident hierarchical structure for original source information

• US 20040199516A1
• Filed: 05/17/2002
• Published: 10/07/2004
• Est. Priority Date: 10/31/2001
• Status: Abandoned Application

• Current Assignee: Metacyber Net
• Original Assignee: Metacyber Net
• Inventors: Duckett, Steven W., Thames, Joseph M.
• Application Number:
  US10/147,722
• Publication Number:
  US 20040199516A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 8/71 Version control security arrangements therefor G06F21/57; Configuration management
• CPC Class Codes: G06F 8/73 Program documentation

Abstract

A computer-based method for converts source information into a memory-resident aggregate database including (i) the source information, and (ii) at least one auto-generic annotation for the source information. The at least one auto-generic annotation was automatically assimilated from the characteristics of information in the source information. The memory-resident aggregate database is exploded into a hierarchical memory structure. A source information adapter includes a memory coupled to an information patcher. The information patcher generates a line patches hash containing information characterizing at least one patch from source information in the memory. A parser-hasher of the adapter also is coupled to the memory to access the line patches hash. The parser-hasher converts the source information into a memory-resident aggregate database including (i) the source information, and (ii) at least one auto-generic annotation for the source information.

Claims

1. A computer-based method for converting source information into a hierarchical memory structure comprising:

converting said source information into a memory-resident aggregate database including (i) said source information, and (ii) at least one auto-generic annotation for said source information, wherein said at least one auto-generic annotation was automatically assimilated from the characteristics of information in said source information; and

exploding said memory-resident aggregate database into said hierarchical memory structure.

2. The computer-based method of claim 1 wherein said hierarchical memory structure is stored in a non-volatile memory.

3. The computer-based method of claim 1 wherein said converting said source information into a memory-resident aggregate database further comprises:

identifying elements in a patch of said source information by parsing said patch.

4. The computer-based method of claim 3 wherein said converting said source information into a memory-resident aggregate database further comprises:

storing information characterizing at least one element of said elements in a hash of said memory-resident aggregate database.

5. The computer-based method of claim 3 wherein said converting said source information into a memory-resident aggregate database further comprises:

generating an auto-generic annotation for at least one element.

6. The computer-based method of claim 5 wherein said at least one element is a symbol.

7. The computer-based method of claim 5 wherein said at least one element is text.

8. The computer-based method of claim 5 wherein said at least one element is a line of text.

9. The computer-based method of claim 5 wherein said converting said source information into a memory-resident aggregate database further comprises:

storing said auto-generic annotation for said at least one element in a hash of said memory-resident aggregate database.

10. The computer-based method of claim 1 whereof said memory-resident aggregate database includes a plurality of hashes.

11. The computer-based method of claim 10 wherein said plurality of hashes comprises a patch hash including said source information divided into identifiable patches.

12. The computer-based method of claim 10 wherein said plurality of hashes comprises an annotation hash including said at least one auto-generic annotation.

13. The computer-based method of claim 10 wherein said plurality of hashes comprises a symbol hash including a symbol name of a name symbol referring to at least one element in said source information and a scope of said at least one name symbol.

14. The computer-based method of claim 13 wherein said plurality of hashes comprises a symbol reference statistics hash including statistics for at least one reference to said at least one name symbol.

15. The computer-based method of claim 14 wherein said symbol hash further comprises a reference key into said symbol reference statistics hash.

16. The computer-based method of claim 15 wherein said reference key includes a patch name, a line number, and a symbol line position.

17. The computer-based method of claim 1 wherein said converting said source information into a memory-resident aggregate database further comprises:

dividing said source information into a plurality of patches.

18. The computer-based method of claim 1 wherein said converting said source information into a memory-resident aggregate database further comprises:

parsing at least one of a plurality of patches comprising said source information to identify a source element wherein said source element is referred to by a name symbol.

19. The computer-based method of claim 18 wherein said converting said source information into a memory-resident aggregate database further comprises:

writing a symbol name of said name symbol and a scope of said name symbol to a symbol hash of said memory-resident aggregate database.

20. The computer-based method of claim 18 wherein said converting said source information into a memory-resident aggregate database further comprises:

generating an auto-generic annotation for said name symbol.

21. The computer-based method of claim 20 wherein said converting said source information into a memory-resident aggregate database further comprises

writing said auto-generic annotation to an annotation hash of said memory-resident aggregate database.

22. The computer-based method of claim 21 wherein said annotation hash further comprises a reference key.

23. The computer-based method of claim 22 wherein said reference key includes a patch name, a line number, and a line position.

24. The computer-based method of claim 1 wherein said converting said source information into a memory-resident aggregate database further comprises:

parsing at least one patch in a plurality of patches comprising said source information to identify a source element wherein said source element is referred to by a name symbol.

25. The computer-based method of claim 24 wherein said converting said source information into a memory-resident aggregate database further comprises:

writing statistics for references to said name symbol to a symbol reference statistics hash of said memory-resident aggregate database.

26. The computer-based method of claim 25 wherein said converting said source information into a memory-resident aggregate database further comprises:

generating an auto-generic annotation for said name symbol.

27. The computer-based method of claim 26 wherein said converting said source information into a memory-resident aggregate database further comprises

writing said auto-generic annotation for said name symbol to an annotation hash of said memory-resident aggregate database.

28. The computer-based method of claim 1 wherein said hierarchical memory structure comprises a metatree.

29. The computer-based method of claim 28 wherein said exploding further comprises:

storing patch text in a patch hash of said memory-resident aggregate database in a patch file in a patch subdirectory of said metatree.

30. The computer-based method of claim 28 wherein said exploding further comprises:

storing name symbol reference statistics in a symbol reference statistics hash of said memory-resident aggregate database in a symbol reference statistics hash file in said one patch subdirectory.

31. The computer-based method of claim 28 wherein said exploding further comprises:

storing name symbols in a symbol hash of said memory-resident aggregate database in symbol hash files in symbol scope subdirectories in said one patch subdirectory.

32. The computer-based method of claim 28 wherein said exploding further comprises:

storing an auto-generic annotation in an annotation hash of said memory-resident aggregate database in a generic annotation file in said one patch subdirectory.

33. A computer-based method for converting source information into a hierarchical memory structure comprising:

storing said source information and annotations for said source information in a plurality of hashes; and

exploding said plurality of hashes into hash files organized in a hierarchical memory structure.

34. The computer-based method of claim 33 wherein said plurality of hashes includes:

an annotation hash wherein said annotation hash includes said annotations.

35. The computer-based method of claim 34 wherein said annotation hash comprises an auto-generic annotation record.

36. The computer-based method of claim 34 wherein said annotation hash comprises at least one auto-generic variable description annotation record.

37. The computer-based method of claim 34 wherein said annotation hash comprises at least one auto-generic function call description annotation record.

38. The computer-based method of claim 34 wherein said annotation hash comprises at least one footnote description annotation record.

39. The computer-based method of claim 34 wherein said annotation hash includes a plurality of annotation records wherein each record comprises:

a key; and

annotation text corresponding to said key.

40. The computer-based method of claim 39 wherein said key includes a patch name, a line number, and a line position.

41. The computer-based method of claim 39 wherein said annotation text comprises footnote text describing a statement in said source information.

42. The computer-based method of claim 39 wherein said annotation text comprises a variable description.

43. The computer-based method of claim 39 wherein said annotation text comprises a function call description.

44. The computer-based method of claim 39 wherein said annotation text comprises a subroutine subtitle.

45. The computer-based method of claim 33 wherein said plurality of hashes includes:

a symbol hash wherein said symbol hash is a two-dimensional hash.

46. The computer-based method of claim 45 wherein said symbol hash includes a plurality of records and further wherein each record comprises a multi-element array.

47. The computer-based method of claim 46 wherein said multi-element array includes a symbol name of a name symbol in said source information.

48. The computer-based method of claim 47 wherein said multi-element array includes a scope of said name symbol in said source information.

49. The computer-based method of claim 48 wherein said symbol name and said scope are keys for said symbol hash.

50. The computer-based method of claim 33 wherein said plurality of hashes includes:

a symbol reference statistics hash wherein said symbol reference statistics hash includes statistics characterizing references to at least one name symbol referring to a source element in said source information.

51. A source information adapter comprising:

a memory;

an information patcher coupled to said memory wherein said information patcher generates a line patches hash containing information characterizing at least one patch from source information in said memory; and

a parser-hasher coupled to said memory to access said line patches hash, wherein said parser-hasher converts said source information into a memory-resident aggregate database including (i) said source information, and (ii) at least one auto-generic annotation for said source information, wherein said at least one auto-generic annotation was automatically assimilated from the characteristics of information in said source information.

52. A source information adapter comprising:

a memory;

an information patcher coupled to said memory wherein said information patcher generates a line patches hash containing information characterizing at least one patch from source information in said memory; and

a parser-hasher coupled to said memory to access said line patches hash, wherein said parser-hasher parses said at least one patch and generates (i) a symbol hash including a symbol name of a name symbol and (ii) an annotation hash containing an auto-generic annotation associated with said name symbol.

53. A computer program product including computer program code wherein execution of said computer program code results in a method for converting source information into a hierarchical memory structure comprising:

converting said source information into a memory-resident aggregate database including (i) said source information, and (ii) at least one auto-generic annotation for said source information, wherein said at least one auto-generic annotation was automatically assimilated from the characteristics of information in said source information; and

exploding said memory-resident aggregate database into said hierarchical memory structure.

54. A computer program product including computer program code wherein execution of said computer program code results in a method for converting source information into a hierarchical memory structure comprising:

storing said source information and annotations for said source information in a plurality of hashes; and

exploding said plurality of hashes into hash files organized in a hierarchical memory structure.