(Practical Extraction and Report Language) is a high-level, general-purpose, interpreted, dynamic programming language. Stable release.
| embed.h (perl-5.28.2.tar.xz) | : | embed.h (perl-5.28.3.tar.xz) |
|---|
| | |
| skipping to change at line 1205 | | skipping to change at line 1205 |
|---|
| #define invlist_iternext S_invlist_iternext | | #define invlist_iternext S_invlist_iternext |
| #define invlist_set_len(a,b,c) S_invlist_set_len(aTHX_ a,b,c) | | #define invlist_set_len(a,b,c) S_invlist_set_len(aTHX_ a,b,c) |
| #define is_ssc_worth_it S_is_ssc_worth_it | | #define is_ssc_worth_it S_is_ssc_worth_it |
| #define join_exact(a,b,c,d,e,f,g) S_join_exact(aTHX_ a,b,c,d,e,f,g) | | #define join_exact(a,b,c,d,e,f,g) S_join_exact(aTHX_ a,b,c,d,e,f,g) |
| #define make_trie(a,b,c,d,e,f,g,h) S_make_trie(aTHX_ a,b,c,d,e,f,g,h) | | #define make_trie(a,b,c,d,e,f,g,h) S_make_trie(aTHX_ a,b,c,d,e,f,g,h) |
| #define new_regcurly S_new_regcurly | | #define new_regcurly S_new_regcurly |
| #define nextchar(a) S_nextchar(aTHX_ a) | | #define nextchar(a) S_nextchar(aTHX_ a) |
| #define output_or_return_posix_warnings(a,b,c) S_output_or_return_posix_warnings
(aTHX_ a,b,c) | | #define output_or_return_posix_warnings(a,b,c) S_output_or_return_posix_warnings
(aTHX_ a,b,c) |
| #define parse_lparen_question_flags(a) S_parse_lparen_question_flags(aTHX_ a) | | #define parse_lparen_question_flags(a) S_parse_lparen_question_flags(aTHX_ a) |
| #define populate_ANYOF_from_invlist(a,b) S_populate_ANYOF_from_invlist(aTH
X_ a,b) | | #define populate_ANYOF_from_invlist(a,b) S_populate_ANYOF_from_invlist(aTH
X_ a,b) |
|
| | #define rck_elide_nothing(a) S_rck_elide_nothing(aTHX_ a) |
| #define reg(a,b,c,d) S_reg(aTHX_ a,b,c,d) | | #define reg(a,b,c,d) S_reg(aTHX_ a,b,c,d) |
| #define reg2Lanode(a,b,c,d) S_reg2Lanode(aTHX_ a,b,c,d) | | #define reg2Lanode(a,b,c,d) S_reg2Lanode(aTHX_ a,b,c,d) |
| #define reg_node(a,b) S_reg_node(aTHX_ a,b) | | #define reg_node(a,b) S_reg_node(aTHX_ a,b) |
| #define reg_scan_name(a,b) S_reg_scan_name(aTHX_ a,b) | | #define reg_scan_name(a,b) S_reg_scan_name(aTHX_ a,b) |
| #define reg_skipcomment S_reg_skipcomment | | #define reg_skipcomment S_reg_skipcomment |
| #define reganode(a,b,c) S_reganode(aTHX_ a,b,c) | | #define reganode(a,b,c) S_reganode(aTHX_ a,b,c) |
| #define regatom(a,b,c) S_regatom(aTHX_ a,b,c) | | #define regatom(a,b,c) S_regatom(aTHX_ a,b,c) |
| #define regbranch(a,b,c,d) S_regbranch(aTHX_ a,b,c,d) | | #define regbranch(a,b,c,d) S_regbranch(aTHX_ a,b,c,d) |
| #define regclass(a,b,c,d,e,f,g,h,i,j) S_regclass(aTHX_ a,b,c,d,e,f,g,h,i,j) | | #define regclass(a,b,c,d,e,f,g,h,i,j) S_regclass(aTHX_ a,b,c,d,e,f,g,h,i,j) |
| #define regex_set_precedence S_regex_set_precedence | | #define regex_set_precedence S_regex_set_precedence |
| | |
| skipping to change at line 1234 | | skipping to change at line 1235 |
|---|
| #define ssc_anything(a) S_ssc_anything(aTHX_ a) | | #define ssc_anything(a) S_ssc_anything(aTHX_ a) |
| #define ssc_clear_locale S_ssc_clear_locale | | #define ssc_clear_locale S_ssc_clear_locale |
| #define ssc_cp_and(a,b) S_ssc_cp_and(aTHX_ a,b) | | #define ssc_cp_and(a,b) S_ssc_cp_and(aTHX_ a,b) |
| #define ssc_finalize(a,b) S_ssc_finalize(aTHX_ a,b) | | #define ssc_finalize(a,b) S_ssc_finalize(aTHX_ a,b) |
| #define ssc_init(a,b) S_ssc_init(aTHX_ a,b) | | #define ssc_init(a,b) S_ssc_init(aTHX_ a,b) |
| #define ssc_intersection(a,b,c) S_ssc_intersection(aTHX_ a,b,c) | | #define ssc_intersection(a,b,c) S_ssc_intersection(aTHX_ a,b,c) |
| #define ssc_is_anything S_ssc_is_anything | | #define ssc_is_anything S_ssc_is_anything |
| #define ssc_is_cp_posixl_init S_ssc_is_cp_posixl_init | | #define ssc_is_cp_posixl_init S_ssc_is_cp_posixl_init |
| #define ssc_or(a,b,c) S_ssc_or(aTHX_ a,b,c) | | #define ssc_or(a,b,c) S_ssc_or(aTHX_ a,b,c) |
| #define ssc_union(a,b,c) S_ssc_union(aTHX_ a,b,c) | | #define ssc_union(a,b,c) S_ssc_union(aTHX_ a,b,c) |
|
| #define study_chunk(a,b,c,d,e,f,g,h,i,j,k) S_study_chunk(aTHX_ a,b,c,d,e,f,g
,h,i,j,k) | | #define study_chunk(a,b,c,d,e,f,g,h,i,j,k,l) S_study_chunk(aTHX_ a,b,c,d,e,f,g
,h,i,j,k,l) |
| # endif | | # endif |
| # if defined(PERL_IN_REGCOMP_C) || defined (PERL_IN_DUMP_C) | | # if defined(PERL_IN_REGCOMP_C) || defined (PERL_IN_DUMP_C) |
| #define _invlist_dump(a,b,c,d) Perl__invlist_dump(aTHX_ a,b,c,d) | | #define _invlist_dump(a,b,c,d) Perl__invlist_dump(aTHX_ a,b,c,d) |
| # endif | | # endif |
| # if defined(PERL_IN_REGCOMP_C) || defined(PERL_IN_PERL_C) || defined(PERL_IN_U
TF8_C) | | # if defined(PERL_IN_REGCOMP_C) || defined(PERL_IN_PERL_C) || defined(PERL_IN_U
TF8_C) |
| #define _invlistEQ(a,b,c) Perl__invlistEQ(aTHX_ a,b,c) | | #define _invlistEQ(a,b,c) Perl__invlistEQ(aTHX_ a,b,c) |
| #define _new_invlist_C_array(a) Perl__new_invlist_C_array(aTHX_ a) | | #define _new_invlist_C_array(a) Perl__new_invlist_C_array(aTHX_ a) |
| # endif | | # endif |
| # if defined(PERL_IN_REGCOMP_C) || defined(PERL_IN_REGEXEC_C) | | # if defined(PERL_IN_REGCOMP_C) || defined(PERL_IN_REGEXEC_C) |
| #define _get_regclass_nonbitmap_data(a,b,c,d,e,f) Perl__get_regclass_nonbit
map_data(aTHX_ a,b,c,d,e,f) | | #define _get_regclass_nonbitmap_data(a,b,c,d,e,f) Perl__get_regclass_nonbit
map_data(aTHX_ a,b,c,d,e,f) |
| | | |
| End of changes. 2 change blocks. |
|---|
| 1 lines changed or deleted | | 2 lines changed or added |
|---|
"Fossies" - the Fresh Open Source Software Archive 