<p>I used the LINQ to SQL designer in Visual Studio to create an object model of a database.  Now, I want to add XML comments to each generated property but I can't figure out how to do it without erasing the properties the next time the dbml file is refreshed.</p>

<p>How can this be done?</p>

[{'answer_id': 37518, 'author': 'Shog9', 'author_id': 811, 'author_profile': 'https://Stackoverflow.com/users/811', 'pm_score': 2, 'selected': False, 'text': '<p>Yes. But never in dead code. That would be silly.</p>\n'}, {'answer_id': 37520, 'author': 'bernhardrusch', 'author_id': 3056, 'author_profile': 'https://Stackoverflow.com/users/3056', 'pm_score': 0, 'selected': False, 'text': "<p>Sure - e.g. if you want to traverse a tree structure what else would you use ?   </p>\n\n<p>Maybe you would like to have something like a maximum depth to be sure you're not writing an infinite loop. (if this makes sense in your example)</p>\n"}, {'answer_id': 37543, 'author': 'graham.reeds', 'author_id': 342, 'author_profile': 'https://Stackoverflow.com/users/342', 'pm_score': 0, 'selected': False, 'text': '<blockquote>\n  <p>Is there a way to determine at what\n  point I would encounter a stack\n  overflow?</p>\n</blockquote>\n\n<p>Depends how deep you go, and how large the actual recursion is. I take it you understand what recursion does?</p>\n'}, {'answer_id': 37548, 'author': 'Orion Edwards', 'author_id': 234, 'author_profile': 'https://Stackoverflow.com/users/234', 'pm_score': 4, 'selected': True, 'text': "<blockquote>\n  <p>Is there a way to determine at what point I would encounter a stack overflow?</p>\n</blockquote>\n\n<p>Not really. A stack overflow happens when you exhaust the stack space - however...</p>\n\n<ul>\n<li>The initial stack size can be changed programatically and may default to different amounts depending on your OS/compiler/etc</li>\n<li>How much of it is already used up depends on what your app (and the libraries your app uses) has previously done - this is often impossible to predict</li>\n<li>How much of the stack each call requires depends on what you do in your function. If you only allocate say 1 integer on the stack, you may be able to recurse an enourmous amount of times, but if you are allocating a 200k buffer on the stack, not so much.</li>\n</ul>\n\n<p>The only times I've ever hit one is in an infinite loop, or using the aforementioned 200k buffer. </p>\n\n<p>I find it far more prefereable for my app to just crash, than for it to loop forever using 100% CPU and have to be forcefully killed (this is a right PITA on a remote server over a bad connection as windows lacks SSH)</p>\n\n<p>A rough guideline: Do you think your recursive function is likely to call itself more than say 10,000 times consecutively? Or are you doing something dumb like allocating 200k buffers on the stack?</p>\n\n<p>If yes, worry about it.<br>\nIf no, carry on with more important things.</p>\n"}, {'answer_id': 37549, 'author': 'Niyaz', 'author_id': 184, 'author_profile': 'https://Stackoverflow.com/users/184', 'pm_score': 0, 'selected': False, 'text': '<p>Recursion is almost essential to traverse File structures like folder/directories.</p>\n\n<p>Traversing a tree like structure is very easy if recursion is used.</p>\n'}]
['https://Stackoverflow.com/questions/37519', 'https://Stackoverflow.com', 'https://Stackoverflow.com/users/3742/']