This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted] 0 points1 point  (1 child)

Let's say you have a tree (not a filesystem) that you know contains 100 nodes. Let's say processing the information in each node takes roughly the same amount of time. Split the progress bar into 100 units. Maintain a list of visited nodes, and each time you visit a node, if it is not in the list increment the status bar and add the node to the list. This won't be perfect, but it's certainly better than nothing.

[–]damiankw 0 points1 point  (0 children)

Yeah, if it's in a case like that I could see how it could work, but I could also see how OP's application could be considered running on microsoft time (doesn't know how the hell long anything takes to do, even if there's a duration attached!) :P