Delphi 2010有没有分布类(Partial Class)这个特性?

ysai 2011-10-11 05:41:30

像C#中的Partial Class

有的话,语法是怎么样的?

...全文

133 10 打赏收藏转发到动态举报

写回复

用AI写文章

10 条回复

切换为时间正序

请发表友善的回复…

发表回复

亮剑_ 2011-10-12

打赏
举报

[Quote=引用 7 楼 ysai 的回复:]

Delphi Prism中就支持,可惜是.NET的
[/Quote]
Prism本来就是个Shell

ysai 2011-10-12

打赏
举报

Delphi Prism中就支持,可惜是.NET的

xmfan2000 2011-10-12

打赏
举报

[Quote=引用 5 楼 lhylhy 的回复:]

忽然想到，以后会不会有Partial Function？
[/Quote]

C#中貌似就有了。

lhy 2011-10-12

打赏
举报

忽然想到，以后会不会有Partial Function？

日立奔腾浪潮微软松下联想 2011-10-12

打赏
举报

Class Helper可以实现类似的特性，而且可以在不修改类源码的情况下给类打补丁。

iqyely 2011-10-12

打赏
举报

来关注下

xonln 2011-10-11

打赏
举报

如果Andser在这个公司的话，可能会支持这一特性的
不过，你可以用类的方式把大的函数分解

柯本 2011-10-11

打赏
举报

不同语言有不同特式

lhy 2011-10-11

打赏
举报

这种特性比较怪。

ysai 2011-10-11

打赏
举报

悲剧了不支持
http://www.prestwood.com/ASPSuite/KB/Document_View.asp?QID=101791

DIRegEx is a library of Delphi (Embarcadero / CodeGear / Borland) components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl 5.10, with just a few differences. This includes support for UTF-8 encoded strings and Unicode general category properties. DIRegEx offers two regular expression algorithms with their corresponding wrapper classes for easy usage: TDIPerlRegEx implements a matching algorithm with the same syntax and semantics as Perl. Consider this the standard algorithm which you are used to from Perl and JavaScript. It is very fast and supports the complete pattern syntax. You will very likely be using it most of the time. TDIDfaRegEx implements the DFA matching algorithm. Considerer this as a special purpose algorithm. If finds all possible matches and in particular, it finds the longest. It never needs to backtrack and supports partial matching much better, even for very long subject strings in several pieces. The DIRegEx Search Stream Demo ApplicationBoth classes descend from a common ancestor TDIRegEx which implements the complete functionality for working with regular expressions, regardless of which algorithm is currently in effect: Matching and extraction of matches / substrings from the source text. Searching for regular expressions within streams and memory buffers. To search within streams or files (of virtually unlimited size), use one of the specially optimized TDIRegExSearchStream class descendents. Replacements on full and partial matches / substrings. Listing of full and partial matches / substrings. Formatting of matches.

DIRegEx是Delphi中最快的正则表达式控件，因为属于商业收费控件，所以网上的学习教程几乎没有，所以只能参考DEMO学习了。 DIRegEx is a library of Delphi (Embarcadero / CodeGear / Borland) components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl 5.10, with just a few differences. This includes support for UTF-8 encoded strings and Unicode general category properties. DIRegEx offers two regular expression algorithms with their corresponding wrapper classes for easy usage: TDIPerlRegEx implements a matching algorithm with the same syntax and semantics as Perl. Consider this the standard algorithm which you are used to from Perl and javascript. It is very fast and supports the complete pattern syntax. You will very likely be using it most of the time. TDIDfaRegEx implements the DFA matching algorithm. Considerer this as a special purpose algorithm. If finds all possible matches and in particular, it finds the longest. It never needs to backtrack and supports partial matching much better, even for very long subject strings in several pieces. Both classes descend from a common ancestor TDIRegEx which implements the complete functionality for working with regular expressions, regardless of which algorithm is currently in effect: Matching and extraction of matches / substrings from the source text. Searching for regular expressions within streams and memory buffers. To search within streams or files (of virtually unlimited size), use one of the specially optimized TDIRegExSearchStream class descendents. Replacements on full and partial matches / substrings. Listing of full and partial matches / substrings. Formatting of matches.

需求是这样的，我在.net程序里操作数据时将一些字段数据加密了，这些数据是很多系统共用的，其中一delphi程序也需要用到，并且需要将数据解密，由于我在.net里加密的方式比较特殊，在delphi程序里解密比较繁琐且要消耗很多时间，所以不得不让sqlserver调用程序集的方式来解决问题。下面只是一个例子，贴出来共享。建立一个dll，class，代码如下：代码如下: namespace MyDll { public partial class MyClass { [SqlMethod] public static SqlString Ur

DIRegEx is a library of Delphi (Embarcadero / CodeGear / Borland) components and procedures that implement regular expression pattern matching using the same syntax and semantics as Perl 5.10, with just a few differences. This includes support for UTF-8 encoded strings and Unicode general category properties. DIRegEx offers two regular expression algorithms with their corresponding wrapper classes for easy usage: TDIPerlRegEx implements a matching algorithm with the same syntax and semantics as Perl. Consider this the standard algorithm which you are used to from Perl and JavaScript. It is very fast and supports the complete pattern syntax. You will very likely be using it most of the time. TDIDfaRegEx implements the DFA matching algorithm. Considerer this as a special purpose algorithm. If finds all possible matches and in particular, it finds the longest. It never needs to backtrack and supports partial matching much better, even for very long subject strings in several pieces. DIRegEx v8.6.8 for D4-XE10Both classes descend from a common ancestor TDIRegEx which implements the complete functionality for working with regular expressions, regardless of which algorithm is currently in effect: Matching and extraction of matches / substrings from the source text. Searching for regular expressions within streams and memory buffers. To search within streams or files (of virtually unlimited size), use one of the specially optimized TDIRegExSearchStream class descendents. Replacements on full and partial matches / substrings. Listing of full and partial matches / substrings. Formatting of matches.

语言基础/算法/系统设计

16,748

社区成员

33,247

社区内容

发帖

与我相关

我的任务

社区管理员

加入社区

近7日
近30日
至今

加载中

查看更多榜单

社区公告

暂无公告

试试用AI创作助手写篇文章吧

+ 用AI写文章