Home | Contact Us | FAQ | Search & Site Map | Link to Us
Sign In | Join | Other 45 Sites in Network
HomeAnnouncementsFree MagazinesWhite PapersSubmit Content
Discussion GroupsASP.NETWindows FormsLanguages.NET FrameworkVisual Studio.NET
Articles.NET FrameworkASP.NETToolsWindows Forms
.NET DirectoryOpen Source ProjectsUser GroupsWeb Resources
Related Topics
Visual Basic 6SQL ServerMS AccessOther DB ProductsMS Server ProductsMore Topics ...

.NET Forum / .NET Framework / CLR / September 2007

Tip: Looking for answers? Try searching our database.

reading registry

Thread view: 
Enable EMail Alerts  Start New Thread
Thread rating: 
AVL - 19 Sep 2007 13:30 GMT
hi,
i've a requirement to scan the registry keys programatically in a console
application  and read the data of the keys..
given a registry key, say,"HKEY_USERS". user should be able to scan the
subkeys of the given key recursively(i.e. all the subkeys of the given
subkeys etcc..) till the last indent level....

i've used a recursion to do so..but it's taking lot of time..
is there any efficient way to acheive it.....
Ashot Geodakov - 27 Sep 2007 01:57 GMT
> hi,
> i've a requirement to scan the registry keys programatically in a console
[quoted text clipped - 5 lines]
> i've used a recursion to do so..but it's taking lot of time..
> is there any efficient way to acheive it.....

Well, I guess your other option is not to use recursion...

Any recursive algorithm can be written without recursion - just use large
enough stack for your local variables.

Instead of (pseudocode):

void ReadBranch( Branch b )
{
 for each( Branch child in b.children )
   ReadBranch( child )
}

you can write something like (very approximately):

Branch b;
push b;

while( stack not empty )
{
  pop b;
  for each( Branch child in b.children )
    push child;
}
Günter Prossliner - 27 Sep 2007 10:53 GMT
Hello Ashot!

> Well, I guess your other option is not to use recursion...
>
> Any recursive algorithm can be written without recursion - just use
> large enough stack for your local variables.

Allthough this is right, the recrusion is not the problem in this case. The
cost of the function-calls are very small compared to the reading of the
Registry.

So an none-recrusive implementation will not run (noticable) faster in this
case.

@AVL: Scanning the whole registry takes time (just try to use the "Search"
Command of regedit.exe). All Nodes have to be loaded in this case. You may
need to adopt your algorithm (maybe you can skip some levels or cache parial
results in memory, ...) to get faster results.

Rate this thread:







Free Magazines

Get these publications absolutely FREE for up to 12 months. There are no hidden fees and no obligation. Simply choose a title, complete the application form and submit it. Read more ...

Oracle MagazineNetwork ComputingComputer WorldBio-IT WorldeWeekInformation WeekInfosecurity
 
Sign In
Join
My Latest Posts
My Monitored Threads
My Blog
My Photo Gallery
My Profile
My Homepage

Start New Thread
Enable EMail Alerts
Rate this Thread



©2008 Advenet LLC   Privacy Policy - Terms of Use
This website includes both content owned or controlled by Advenet as well as content owned or controlled by third parties.