You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Clang processes one TU at a time while Mr. Docs accumulates data with each TU. For instance, if you compile 100 TUs and each produces 100 unique Info, then Mr. Docs stores 10,000 Info.
There are three broad classes of programs:
those which will fit into memory comfortably
those which are strained to fit into memory
those which simply do not fit into memory
We are targeting 1 now. We can target 2 by optimizing how much we store (for example, storing less). We have yet to do anything for 3, and it is unclear that we should attempt to do so now, although it is a reasonable long-term goal.
Yes. It's not a problem we have right now with our examples. We could measure things to see how it's going for now or test the limits by trying to generate documentation for something large, like LLVM.
.
The text was updated successfully, but these errors were encountered:
Clang processes one TU at a time while Mr. Docs accumulates data with each TU. For instance, if you compile 100 TUs and each produces 100 unique
Info
, then Mr. Docs stores 10,000Info
.There are three broad classes of programs:
We are targeting 1 now. We can target 2 by optimizing how much we store (for example, storing less). We have yet to do anything for 3, and it is unclear that we should attempt to do so now, although it is a reasonable long-term goal.
Yes. It's not a problem we have right now with our examples. We could measure things to see how it's going for now or test the limits by trying to generate documentation for something large, like LLVM.
.
The text was updated successfully, but these errors were encountered: