Sends for the fellow dear visitors:
Welcome to DongPad!
查看全部...
Tags:
Tags: F# DongPad
发现一个不错的音乐盒---8Box音乐盒,遂嵌入了进来,可以点击侧栏的音乐盒,来点音乐放松一下吧!小记一下!
Tags: DongPad
法国一位年轻人很穷,很苦。后来,他以推销装饰肖像画起家,在不到10年的时间里,迅速跻身于法国50大富翁之列,成为一位年轻的媒体大亨。不幸,他因患上前列腺癌,1998年去世。他去世后,法国的一份报纸刊登了他的一份遗嘱。在这份遗嘱里,他说:我曾经是一位穷人,在以一个富人的身份跨入天堂的门槛之前,我把自己成为富人的秘诀留下,谁若能通过回答“穷人最缺少的是什么”而猜中我成为富人的秘诀,他将能得到我的祝贺,我留在银行私人保险箱内的100 万法郎,将作为睿智地揭开贫穷之谜的人的奖金、也是我在天堂给予他的欢呼与掌声。遗嘱刊出之后,有18461个人寄来了自己的答案。这些答案,五花八门,应有尽有。绝大部分的人认为,穷人最缺少的当然是金钱了,有了钱就不会再是穷人了。另有一部分人认为,穷人之所以穷,最缺少的是机会,穷人之穷是穷在背时上面。又有一部分认为,穷人最缺少的是技能,一无所长所以才穷,有一技之长才能迅速致富。还有的人说,穷人最缺少的是帮助和关爱,是漂亮,是名牌衣服,是总统的职位等等。 在这位富翁逝世周年纪念日,他的律师和代理人在公证部门的监督下,打开了银行内的私人保险箱,公开了他致富的秘诀,他认为:穷人最缺少的是成为富人的野心。在所有答案中,有一位年仅九岁的女孩猜对了。为什么只有这位9岁的女孩想到穷人最缺少的是野心?她在接受100万法郎的颁奖之日,说“每次,我姐姐把她11岁的男朋友带回家时,总是警告我说不要有野心!不要有野心!于是我想,也许野心可以让人得到自己想得到的东西”。 谜底揭开之后,震动法国,并波及英美。一些新贵、富翁在就此话题谈论时,均毫不掩饰地承认:野心是永恒的“治穷”特效药,是所有奇迹的萌发点,穷人之所以穷,大多是因为他们有一种无可救药的弱点,也就是缺乏致富的野心。
from Jews’
在Visual Studio 2008 CSharp samples中有很多有价值的工具,而Expression Tree Visualizer就是其中的, 你可以下载,也可以通过更新再线samples版本得到 你将这个Expression Tree Visualizer程序编译运行,后将在 ...\LinqSamples\ExpressionTreeVisualizer\ExpressionTreeVisualizer\bin\Debug 中的.dll文件复制出来到 ...\Program Files\Microsoft Visual Studio 9.0\Common7\Packages\Debugger\Visualizers.中, 之后你就可以通过上面这两图的方式打开它 其实也和使用QueryVisualizer一样.
原文地址:worksguo,cnblogs.com
Visual Studio International Feature Pack 2.0 是对 1.0 版本( 1.0 版的产品名是 Microsoft Visual Studio International Pack 1.0 SR1) 的扩展,包含一组控件和类库,设计用来帮助.NET开发人员创建国际化程序。
点击链接 Visual Studio International Feature Pack 2.0 Beta (http://download.microsoft.com/download/7/7/0/770D7C6E-FEFE-466A-93A2-D69017C9DBFA/VSIPSetup.msi) 可以下载该软件包的所有组件
IQueryable is a very powerful feature that enables a variety of interesting deferred execution scenarios (like paging and composition based queries). As with all powerful features, you want to be careful with how you use it and make sure it is not abused. It is important to recognize that returning an IQueryable result from your repository enables calling code to append on chained operator methods to it, and so participate in the ultimate query execution. If you do not want to provide calling code this ability, then you should return back IList, List or IEnumerable results - which contain the results of a query that has already executed. For pagination scenarios this would require you to push the actual data pagination logic into the repository method being called. In this scenario we might update our FindUpcomingDinners() finder method to have a signature that either returned a PaginatedList: PaginatedList< Dinner> FindUpcomingDinners(int pageIndex, int pageSize) { } Or return back an IList, and use a “totalCount” out param to return the total count of Dinners: IList FindUpcomingDinners(int pageIndex, int pageSize, out int totalCount) { }
From the NerdDiner Pro!
在C#中,如果有一个方法我们不想继续使用,需要废弃的时候,可以在该方法前面加上一个[Obsolete]。例如:[Obsolete] public double GetArea(){ switch (_arg) { case CIRCLE: return _size * _size; case SQUARE: return _size * _size; case RIGHT_TRIANGLE: return _size * _size / 2; default: return 0; }}这时候,如果还有程序使用该方法,编译时会报如下警告信息:GetArea()方法已过时。From Terrylee's cnblogs!
Tags: DongPad 过时
Functional programming (FP) is the future of .NET programming, and F# is much more than just an FP language. Every professional .NET programmer needs to learn about FP, and there's no better way to do it than by learning F#--and no easier way to learn F# than from Foundations of F#.
If you're already familiar with FP, you'll find F# the language you've always dreamed of. And all .NET programmers will find F# an exciting real-world alternative to C# and Visual Basic. This book is likely to have many imitators, but few true competitors. Written by F# evangelist Rob Pickering, and tech reviewed by F#'s main designer, Don Syme, this is an elegant, comprehensive introduction to all aspects of the language and an incisive guide to using F# for real-world professional development. F# is the future of programming (not just on .NET), and the future is now.
Download by click here or here!
Powered By DongPad CopyRight 2008-2011, xhtml | css
Processed in 0.046 seconds(s) , 沪ICP备08111450号