In perl.git, the branch blead has been updated <http://perl5.git.perl.org/perl.git/commitdiff/7e234f81b6d7325dd91edae7737f9bd69a91fc73?hp=e96513a272994fa40337538729c370cb2b01f9fd>
- Log ----------------------------------------------------------------- commit 7e234f81b6d7325dd91edae7737f9bd69a91fc73 Author: Father Chrysostomos <[email protected]> Date: Sun Sep 21 00:29:09 2014 -0700 Consistent spaces after dots in perlapi ----------------------------------------------------------------------- Summary of changes: op.c | 14 +++++++------- sv.c | 4 ++-- sv.h | 2 +- 3 files changed, 10 insertions(+), 10 deletions(-) diff --git a/op.c b/op.c index 7e7d667..3625bc3 100644 --- a/op.c +++ b/op.c @@ -1034,25 +1034,25 @@ Perl_op_refcnt_unlock(pTHX) =for apidoc op_sibling_splice A general function for editing the structure of an existing chain of -op_sibling nodes. By analogy with the perl-level splice() function, allows +op_sibling nodes. By analogy with the perl-level splice() function, allows you to delete zero or more sequential nodes, replacing them with zero or more different nodes. Performs the necessary op_first/op_last housekeeping on the parent node and op_sibling manipulation on the -children. The last deleted node will be marked as as the last node by +children. The last deleted node will be marked as as the last node by updating the op_sibling or op_lastsib field as appropriate. Note that op_next is not manipulated, and nodes are not freed; that is the -responsibility of the caller. It also won't create a new list op for an +responsibility of the caller. It also won't create a new list op for an empty list etc; use higher-level functions like op_append_elem() for that. parent is the parent node of the sibling chain. -start is the node preceding the first node to be spliced. Node(s) -following it will be deleted, and ops will be inserted after it. If it is +start is the node preceding the first node to be spliced. Node(s) +following it will be deleted, and ops will be inserted after it. If it is NULL, the first node onwards is deleted, and nodes are inserted at the beginning. -del_count is the number of nodes to delete. If zero, no nodes are deleted. +del_count is the number of nodes to delete. If zero, no nodes are deleted. If -1 or greater than or equal to the number of remaining kids, all remaining kids are deleted. @@ -1156,7 +1156,7 @@ Perl_op_sibling_splice(OP *parent, OP *start, int del_count, OP* insert) /* =for apidoc op_parent -returns the parent OP of o, if it has a parent. Returns NULL otherwise. +returns the parent OP of o, if it has a parent. Returns NULL otherwise. (Currently perl must be built with C<-DPERL_OP_PARENT> for this feature to work. diff --git a/sv.c b/sv.c index 2ff999f..4dede1a 100644 --- a/sv.c +++ b/sv.c @@ -4923,10 +4923,10 @@ Perl_sv_sethek(pTHX_ SV *const sv, const HEK *const hek) Tells an SV to use C<ptr> to find its string value. Normally the string is stored inside the SV, but sv_usepvn allows the SV to use an outside string. The C<ptr> should point to memory that was allocated -by L<Newx|perlclib/Memory Management and String Handling>. It must be +by L<Newx|perlclib/Memory Management and String Handling>. It must be the start of a Newx-ed block of memory, and not a pointer to the middle of it (beware of L<OOK|perlguts/Offsets> and copy-on-write), -and not be from a non-Newx memory allocator like C<malloc>. The +and not be from a non-Newx memory allocator like C<malloc>. The string length, C<len>, must be supplied. By default this function will C<Renew> (i.e. realloc, move) the memory pointed to by C<ptr>, so that pointer should not be freed or used by the programmer after diff --git a/sv.h b/sv.h index f198d99..7479624 100644 --- a/sv.h +++ b/sv.h @@ -1523,7 +1523,7 @@ Returns a pointer to the string in the SV, or a stringified form of the SV if the SV does not contain a string. The SV may cache the stringified version becoming C<SvPOK>. Handles 'get' magic. The C<len> variable will be set to the length of the string (this is a macro, so -don't use C<&len>). See also C<SvPVx> for a version which guarantees to +don't use C<&len>). See also C<SvPVx> for a version which guarantees to evaluate sv only once. Note that there is no guarantee that the return value of C<SvPV()> is -- Perl5 Master Repository
