2013-05-20 01:16:08 -04:00
|
|
|
/* word.c -- implements word.h */
|
|
|
|
#include "word.h"
|
|
|
|
|
2010-11-14 21:10:03 -05:00
|
|
|
/* word.c
|
2005-05-31 11:50:56 -04:00
|
|
|
*
|
2010-11-14 21:10:03 -05:00
|
|
|
* The routines in this file implement commands that work word or a
|
|
|
|
* paragraph at a time. There are all sorts of word mode commands. If I
|
|
|
|
* do any sentence mode commands, they are likely to be put in this file.
|
2005-05-31 11:50:56 -04:00
|
|
|
*
|
2010-11-14 21:10:03 -05:00
|
|
|
* Modified by Petri Kutvonen
|
2005-05-31 11:50:56 -04:00
|
|
|
*/
|
|
|
|
|
2010-11-14 21:10:03 -05:00
|
|
|
#include <stdio.h>
|
|
|
|
|
2013-05-28 03:10:16 -04:00
|
|
|
#include "basic.h"
|
2013-09-20 06:10:30 -04:00
|
|
|
#include "buffer.h"
|
2010-11-14 21:10:03 -05:00
|
|
|
#include "estruct.h"
|
|
|
|
#include "edef.h"
|
|
|
|
#include "line.h"
|
2013-09-18 02:25:39 -04:00
|
|
|
#include "log.h"
|
2013-05-28 00:37:04 -04:00
|
|
|
#include "random.h"
|
2013-05-28 01:18:47 -04:00
|
|
|
#include "region.h"
|
2013-09-20 06:10:30 -04:00
|
|
|
#include "window.h"
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* Word wrap on n-spaces. Back-over whatever precedes the point on the current
|
|
|
|
* line and stop on the first word-break or the beginning of the line. If we
|
|
|
|
* reach the beginning of the line, jump back to the end of the word and start
|
|
|
|
* a new line. Otherwise, break the line at the word-break, eat it, and jump
|
|
|
|
* back to the end of the word.
|
|
|
|
* Returns TRUE on success, FALSE on errors.
|
2005-09-30 19:34:11 -04:00
|
|
|
*
|
2010-11-14 21:10:03 -05:00
|
|
|
* @f: default flag.
|
|
|
|
* @n: numeric argument.
|
2005-05-31 11:50:56 -04:00
|
|
|
*/
|
2005-09-30 19:34:11 -04:00
|
|
|
int wrapword(int f, int n)
|
2005-05-31 11:50:56 -04:00
|
|
|
{
|
2010-02-27 05:38:22 -05:00
|
|
|
int cnt; /* size of word wrapped to next line */
|
|
|
|
int c; /* charector temporary */
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* backup from the <NL> 1 char */
|
|
|
|
if (!backchar(0, 1))
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* back up until we aren't in a word,
|
|
|
|
make sure there is a break in the line */
|
|
|
|
cnt = 0;
|
|
|
|
while (((c = lgetc(curwp->w_dotp, curwp->w_doto)) != ' ')
|
2005-09-30 18:26:09 -04:00
|
|
|
&& (c != '\t')) {
|
2005-05-31 11:50:56 -04:00
|
|
|
cnt++;
|
|
|
|
if (!backchar(0, 1))
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
/* if we make it to the beginning, start a new line */
|
|
|
|
if (curwp->w_doto == 0) {
|
|
|
|
gotoeol(FALSE, 0);
|
2010-08-29 06:03:55 -04:00
|
|
|
return lnewline();
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* delete the forward white space */
|
|
|
|
if (!forwdel(0, 1))
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* put in a end of line */
|
|
|
|
if (!lnewline())
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* and past the first word */
|
|
|
|
while (cnt-- > 0) {
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
2010-08-29 06:03:55 -04:00
|
|
|
return TRUE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Move the cursor backward by "n" words. All of the details of motion are
|
|
|
|
* performed by the "backchar" and "forwchar" routines. Error if you try to
|
|
|
|
* move beyond the buffers.
|
|
|
|
*/
|
2005-09-30 19:34:11 -04:00
|
|
|
int backword(int f, int n)
|
2005-05-31 11:50:56 -04:00
|
|
|
{
|
|
|
|
if (n < 0)
|
2010-08-29 06:03:55 -04:00
|
|
|
return forwword(f, -n);
|
2005-05-31 11:50:56 -04:00
|
|
|
if (backchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
while (n--) {
|
|
|
|
while (inword() == FALSE) {
|
|
|
|
if (backchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
while (inword() != FALSE) {
|
|
|
|
if (backchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
}
|
2010-08-29 06:03:55 -04:00
|
|
|
return forwchar(FALSE, 1);
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Move the cursor forward by the specified number of words. All of the motion
|
|
|
|
* is done by "forwchar". Error if you try and move beyond the buffer's end.
|
|
|
|
*/
|
2005-09-30 19:34:11 -04:00
|
|
|
int forwword(int f, int n)
|
2005-05-31 11:50:56 -04:00
|
|
|
{
|
|
|
|
if (n < 0)
|
2010-08-29 06:03:55 -04:00
|
|
|
return backword(f, -n);
|
2005-05-31 11:50:56 -04:00
|
|
|
while (n--) {
|
|
|
|
while (inword() == TRUE) {
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
while (inword() == FALSE) {
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
}
|
2010-08-29 06:03:55 -04:00
|
|
|
return TRUE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Move the cursor forward by the specified number of words. As you move,
|
|
|
|
* convert any characters to upper case. Error if you try and move beyond the
|
|
|
|
* end of the buffer. Bound to "M-U".
|
|
|
|
*/
|
2005-09-30 19:34:11 -04:00
|
|
|
int upperword(int f, int n)
|
2005-05-31 11:50:56 -04:00
|
|
|
{
|
2010-02-27 05:38:22 -05:00
|
|
|
int c;
|
2005-05-31 11:50:56 -04:00
|
|
|
|
2005-09-30 18:26:09 -04:00
|
|
|
if (curbp->b_mode & MDVIEW) /* don't allow this command if */
|
2010-08-29 06:03:55 -04:00
|
|
|
return rdonly(); /* we are in read only mode */
|
2005-05-31 11:50:56 -04:00
|
|
|
if (n < 0)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
while (n--) {
|
|
|
|
while (inword() == FALSE) {
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
while (inword() != FALSE) {
|
|
|
|
c = lgetc(curwp->w_dotp, curwp->w_doto);
|
|
|
|
#if PKCODE
|
|
|
|
if (islower(c)) {
|
|
|
|
#else
|
2005-09-30 18:26:09 -04:00
|
|
|
if (c >= 'a' && c <= 'z') {
|
2005-05-31 11:50:56 -04:00
|
|
|
#endif
|
2005-09-30 18:26:09 -04:00
|
|
|
c -= 'a' - 'A';
|
2005-05-31 11:50:56 -04:00
|
|
|
lputc(curwp->w_dotp, curwp->w_doto, c);
|
|
|
|
lchange(WFHARD);
|
|
|
|
}
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
}
|
2010-08-29 06:03:55 -04:00
|
|
|
return TRUE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Move the cursor forward by the specified number of words. As you move
|
|
|
|
* convert characters to lower case. Error if you try and move over the end of
|
|
|
|
* the buffer. Bound to "M-L".
|
|
|
|
*/
|
2005-09-30 19:34:11 -04:00
|
|
|
int lowerword(int f, int n)
|
2005-05-31 11:50:56 -04:00
|
|
|
{
|
2010-02-27 05:38:22 -05:00
|
|
|
int c;
|
2005-05-31 11:50:56 -04:00
|
|
|
|
2005-09-30 18:26:09 -04:00
|
|
|
if (curbp->b_mode & MDVIEW) /* don't allow this command if */
|
2010-08-29 06:03:55 -04:00
|
|
|
return rdonly(); /* we are in read only mode */
|
2005-05-31 11:50:56 -04:00
|
|
|
if (n < 0)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
while (n--) {
|
|
|
|
while (inword() == FALSE) {
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
while (inword() != FALSE) {
|
|
|
|
c = lgetc(curwp->w_dotp, curwp->w_doto);
|
|
|
|
#if PKCODE
|
|
|
|
if (isupper(c)) {
|
|
|
|
#else
|
2005-09-30 18:26:09 -04:00
|
|
|
if (c >= 'A' && c <= 'Z') {
|
2005-05-31 11:50:56 -04:00
|
|
|
#endif
|
2005-09-30 18:26:09 -04:00
|
|
|
c += 'a' - 'A';
|
2005-05-31 11:50:56 -04:00
|
|
|
lputc(curwp->w_dotp, curwp->w_doto, c);
|
|
|
|
lchange(WFHARD);
|
|
|
|
}
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
}
|
2010-08-29 06:03:55 -04:00
|
|
|
return TRUE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Move the cursor forward by the specified number of words. As you move
|
|
|
|
* convert the first character of the word to upper case, and subsequent
|
|
|
|
* characters to lower case. Error if you try and move past the end of the
|
|
|
|
* buffer. Bound to "M-C".
|
|
|
|
*/
|
2005-09-30 19:34:11 -04:00
|
|
|
int capword(int f, int n)
|
2005-05-31 11:50:56 -04:00
|
|
|
{
|
2010-02-27 05:38:22 -05:00
|
|
|
int c;
|
2005-05-31 11:50:56 -04:00
|
|
|
|
2005-09-30 18:26:09 -04:00
|
|
|
if (curbp->b_mode & MDVIEW) /* don't allow this command if */
|
2010-08-29 06:03:55 -04:00
|
|
|
return rdonly(); /* we are in read only mode */
|
2005-05-31 11:50:56 -04:00
|
|
|
if (n < 0)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
while (n--) {
|
|
|
|
while (inword() == FALSE) {
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
if (inword() != FALSE) {
|
|
|
|
c = lgetc(curwp->w_dotp, curwp->w_doto);
|
|
|
|
#if PKCODE
|
|
|
|
if (islower(c)) {
|
|
|
|
#else
|
2005-09-30 18:26:09 -04:00
|
|
|
if (c >= 'a' && c <= 'z') {
|
2005-05-31 11:50:56 -04:00
|
|
|
#endif
|
2005-09-30 18:26:09 -04:00
|
|
|
c -= 'a' - 'A';
|
2005-05-31 11:50:56 -04:00
|
|
|
lputc(curwp->w_dotp, curwp->w_doto, c);
|
|
|
|
lchange(WFHARD);
|
|
|
|
}
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
while (inword() != FALSE) {
|
|
|
|
c = lgetc(curwp->w_dotp, curwp->w_doto);
|
|
|
|
#if PKCODE
|
|
|
|
if (isupper(c)) {
|
|
|
|
#else
|
2005-09-30 18:26:09 -04:00
|
|
|
if (c >= 'A' && c <= 'Z') {
|
2005-05-31 11:50:56 -04:00
|
|
|
#endif
|
2005-09-30 18:26:09 -04:00
|
|
|
c += 'a' - 'A';
|
|
|
|
lputc(curwp->w_dotp, curwp->w_doto,
|
|
|
|
c);
|
2005-05-31 11:50:56 -04:00
|
|
|
lchange(WFHARD);
|
|
|
|
}
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-08-29 06:03:55 -04:00
|
|
|
return TRUE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Kill forward by "n" words. Remember the location of dot. Move forward by
|
|
|
|
* the right number of words. Put dot back where it was and issue the kill
|
|
|
|
* command for the right number of characters. With a zero argument, just
|
|
|
|
* kill one word and no whitespace. Bound to "M-D".
|
|
|
|
*/
|
2005-09-30 19:34:11 -04:00
|
|
|
int delfword(int f, int n)
|
2005-05-31 11:50:56 -04:00
|
|
|
{
|
2010-04-17 19:38:09 -04:00
|
|
|
struct line *dotp; /* original cursor line */
|
2010-02-27 05:38:22 -05:00
|
|
|
int doto; /* and row */
|
|
|
|
int c; /* temp char */
|
2005-05-31 11:50:56 -04:00
|
|
|
long size; /* # of chars to delete */
|
|
|
|
|
|
|
|
/* don't allow this command if we are in read only mode */
|
2005-09-30 18:26:09 -04:00
|
|
|
if (curbp->b_mode & MDVIEW)
|
2010-08-29 06:03:55 -04:00
|
|
|
return rdonly();
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* ignore the command if there is a negative argument */
|
|
|
|
if (n < 0)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* Clear the kill buffer if last command wasn't a kill */
|
2005-09-30 18:26:09 -04:00
|
|
|
if ((lastflag & CFKILL) == 0)
|
2005-05-31 11:50:56 -04:00
|
|
|
kdelete();
|
|
|
|
thisflag |= CFKILL; /* this command is a kill */
|
|
|
|
|
|
|
|
/* save the current cursor position */
|
|
|
|
dotp = curwp->w_dotp;
|
|
|
|
doto = curwp->w_doto;
|
|
|
|
|
|
|
|
/* figure out how many characters to give the axe */
|
|
|
|
size = 0;
|
|
|
|
|
|
|
|
/* get us into a word.... */
|
|
|
|
while (inword() == FALSE) {
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
++size;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (n == 0) {
|
|
|
|
/* skip one word, no whitespace! */
|
|
|
|
while (inword() == TRUE) {
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
++size;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* skip n words.... */
|
|
|
|
while (n--) {
|
2005-09-30 18:26:09 -04:00
|
|
|
|
2005-05-31 11:50:56 -04:00
|
|
|
/* if we are at EOL; skip to the beginning of the next */
|
|
|
|
while (curwp->w_doto == llength(curwp->w_dotp)) {
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
++size;
|
|
|
|
}
|
2005-09-30 18:26:09 -04:00
|
|
|
|
2005-05-31 11:50:56 -04:00
|
|
|
/* move forward till we are at the end of the word */
|
|
|
|
while (inword() == TRUE) {
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
++size;
|
|
|
|
}
|
2005-09-30 18:26:09 -04:00
|
|
|
|
2005-05-31 11:50:56 -04:00
|
|
|
/* if there are more words, skip the interword stuff */
|
|
|
|
if (n != 0)
|
|
|
|
while (inword() == FALSE) {
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
++size;
|
|
|
|
}
|
|
|
|
}
|
2005-09-30 18:26:09 -04:00
|
|
|
|
2005-05-31 11:50:56 -04:00
|
|
|
/* skip whitespace and newlines */
|
|
|
|
while ((curwp->w_doto == llength(curwp->w_dotp)) ||
|
2005-09-30 18:26:09 -04:00
|
|
|
((c = lgetc(curwp->w_dotp, curwp->w_doto)) == ' ')
|
|
|
|
|| (c == '\t')) {
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
|
|
|
break;
|
|
|
|
++size;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* restore the original position and delete the words */
|
|
|
|
curwp->w_dotp = dotp;
|
|
|
|
curwp->w_doto = doto;
|
2010-08-29 06:03:55 -04:00
|
|
|
return ldelete(size, TRUE);
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Kill backwards by "n" words. Move backwards by the desired number of words,
|
|
|
|
* counting the characters. When dot is finally moved to its resting place,
|
|
|
|
* fire off the kill command. Bound to "M-Rubout" and to "M-Backspace".
|
|
|
|
*/
|
2005-09-30 19:34:11 -04:00
|
|
|
int delbword(int f, int n)
|
2005-05-31 11:50:56 -04:00
|
|
|
{
|
|
|
|
long size;
|
|
|
|
|
|
|
|
/* don't allow this command if we are in read only mode */
|
2005-09-30 18:26:09 -04:00
|
|
|
if (curbp->b_mode & MDVIEW)
|
2010-08-29 06:03:55 -04:00
|
|
|
return rdonly();
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* ignore the command if there is a nonpositive argument */
|
|
|
|
if (n <= 0)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* Clear the kill buffer if last command wasn't a kill */
|
2005-09-30 18:26:09 -04:00
|
|
|
if ((lastflag & CFKILL) == 0)
|
2005-05-31 11:50:56 -04:00
|
|
|
kdelete();
|
|
|
|
thisflag |= CFKILL; /* this command is a kill */
|
|
|
|
|
|
|
|
if (backchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
size = 0;
|
|
|
|
while (n--) {
|
|
|
|
while (inword() == FALSE) {
|
|
|
|
if (backchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
++size;
|
|
|
|
}
|
|
|
|
while (inword() != FALSE) {
|
|
|
|
++size;
|
|
|
|
if (backchar(FALSE, 1) == FALSE)
|
|
|
|
goto bckdel;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (forwchar(FALSE, 1) == FALSE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2012-07-11 13:43:16 -04:00
|
|
|
bckdel:return ldelchar(size, TRUE);
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return TRUE if the character at dot is a character that is considered to be
|
|
|
|
* part of a word. The word character list is hard coded. Should be setable.
|
|
|
|
*/
|
2005-09-30 19:34:11 -04:00
|
|
|
int inword(void)
|
2005-05-31 11:50:56 -04:00
|
|
|
{
|
2010-02-27 05:38:22 -05:00
|
|
|
int c;
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
if (curwp->w_doto == llength(curwp->w_dotp))
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
c = lgetc(curwp->w_dotp, curwp->w_doto);
|
|
|
|
#if PKCODE
|
|
|
|
if (isletter(c))
|
|
|
|
#else
|
2005-09-30 18:26:09 -04:00
|
|
|
if (c >= 'a' && c <= 'z')
|
2010-08-29 06:03:55 -04:00
|
|
|
return TRUE;
|
2005-09-30 18:26:09 -04:00
|
|
|
if (c >= 'A' && c <= 'Z')
|
2005-05-31 11:50:56 -04:00
|
|
|
#endif
|
2010-08-29 06:03:55 -04:00
|
|
|
return TRUE;
|
2005-09-30 18:26:09 -04:00
|
|
|
if (c >= '0' && c <= '9')
|
2010-08-29 06:03:55 -04:00
|
|
|
return TRUE;
|
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
#if WORDPRO
|
2005-09-30 19:34:11 -04:00
|
|
|
/*
|
|
|
|
* Fill the current paragraph according to the current
|
|
|
|
* fill column
|
|
|
|
*
|
|
|
|
* f and n - deFault flag and Numeric argument
|
|
|
|
*/
|
|
|
|
int fillpara(int f, int n)
|
2005-05-31 11:50:56 -04:00
|
|
|
{
|
2012-07-11 13:43:16 -04:00
|
|
|
unicode_t c; /* current char during scan */
|
|
|
|
unicode_t wbuf[NSTRING];/* buffer for current word */
|
2010-02-27 05:38:22 -05:00
|
|
|
int wordlen; /* length of current word */
|
|
|
|
int clength; /* position on line during fill */
|
|
|
|
int i; /* index during word copy */
|
|
|
|
int newlength; /* tentative new line length */
|
|
|
|
int eopflag; /* Are we at the End-Of-Paragraph? */
|
|
|
|
int firstflag; /* first word? (needs no space) */
|
2010-04-17 19:38:09 -04:00
|
|
|
struct line *eopline; /* pointer to line just past EOP */
|
2010-02-27 05:38:22 -05:00
|
|
|
int dotflag; /* was the last char a period? */
|
2005-09-30 18:26:09 -04:00
|
|
|
|
|
|
|
if (curbp->b_mode & MDVIEW) /* don't allow this command if */
|
2010-08-29 06:03:55 -04:00
|
|
|
return rdonly(); /* we are in read only mode */
|
2005-05-31 11:50:56 -04:00
|
|
|
if (fillcol == 0) { /* no fill column set */
|
2013-09-18 02:25:39 -04:00
|
|
|
logwrite("No fill column set");
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
#if PKCODE
|
|
|
|
justflag = FALSE;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* record the pointer to the line just past the EOP */
|
|
|
|
gotoeop(FALSE, 1);
|
|
|
|
eopline = lforw(curwp->w_dotp);
|
|
|
|
|
|
|
|
/* and back top the beginning of the paragraph */
|
|
|
|
gotobop(FALSE, 1);
|
|
|
|
|
|
|
|
/* initialize various info */
|
|
|
|
clength = curwp->w_doto;
|
|
|
|
if (clength && curwp->w_dotp->l_text[0] == TAB)
|
|
|
|
clength = 8;
|
|
|
|
wordlen = 0;
|
|
|
|
dotflag = FALSE;
|
|
|
|
|
|
|
|
/* scan through lines, filling words */
|
|
|
|
firstflag = TRUE;
|
|
|
|
eopflag = FALSE;
|
|
|
|
while (!eopflag) {
|
2012-07-11 13:43:16 -04:00
|
|
|
int bytes = 1;
|
|
|
|
|
2005-05-31 11:50:56 -04:00
|
|
|
/* get the next character in the paragraph */
|
|
|
|
if (curwp->w_doto == llength(curwp->w_dotp)) {
|
|
|
|
c = ' ';
|
|
|
|
if (lforw(curwp->w_dotp) == eopline)
|
|
|
|
eopflag = TRUE;
|
|
|
|
} else
|
2012-07-11 13:43:16 -04:00
|
|
|
bytes = lgetchar(&c);
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* and then delete it */
|
2012-07-11 13:43:16 -04:00
|
|
|
ldelete(bytes, FALSE);
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* if not a separator, just add it in */
|
|
|
|
if (c != ' ' && c != '\t') {
|
2005-09-30 18:26:09 -04:00
|
|
|
dotflag = (c == '.'); /* was it a dot */
|
2005-05-31 11:50:56 -04:00
|
|
|
if (wordlen < NSTRING - 1)
|
|
|
|
wbuf[wordlen++] = c;
|
|
|
|
} else if (wordlen) {
|
|
|
|
/* at a word break with a word waiting */
|
|
|
|
/* calculate tentitive new length with word added */
|
|
|
|
newlength = clength + 1 + wordlen;
|
|
|
|
if (newlength <= fillcol) {
|
|
|
|
/* add word to current line */
|
|
|
|
if (!firstflag) {
|
2005-09-30 18:26:09 -04:00
|
|
|
linsert(1, ' '); /* the space */
|
2005-05-31 11:50:56 -04:00
|
|
|
++clength;
|
|
|
|
}
|
|
|
|
firstflag = FALSE;
|
|
|
|
} else {
|
|
|
|
/* start a new line */
|
|
|
|
lnewline();
|
|
|
|
clength = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* and add the word in in either case */
|
2005-09-30 18:26:09 -04:00
|
|
|
for (i = 0; i < wordlen; i++) {
|
2005-05-31 11:50:56 -04:00
|
|
|
linsert(1, wbuf[i]);
|
|
|
|
++clength;
|
|
|
|
}
|
|
|
|
if (dotflag) {
|
|
|
|
linsert(1, ' ');
|
|
|
|
++clength;
|
|
|
|
}
|
|
|
|
wordlen = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* and add a last newline for the end of our new paragraph */
|
|
|
|
lnewline();
|
2010-08-29 06:03:55 -04:00
|
|
|
return TRUE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
#if PKCODE
|
2005-09-30 19:34:11 -04:00
|
|
|
/* Fill the current paragraph according to the current
|
|
|
|
* fill column and cursor position
|
|
|
|
*
|
|
|
|
* int f, n; deFault flag and Numeric argument
|
|
|
|
*/
|
|
|
|
int justpara(int f, int n)
|
2005-05-31 11:50:56 -04:00
|
|
|
{
|
2012-07-11 13:43:16 -04:00
|
|
|
unicode_t c; /* current char durring scan */
|
|
|
|
unicode_t wbuf[NSTRING];/* buffer for current word */
|
2010-02-27 05:38:22 -05:00
|
|
|
int wordlen; /* length of current word */
|
|
|
|
int clength; /* position on line during fill */
|
|
|
|
int i; /* index during word copy */
|
|
|
|
int newlength; /* tentative new line length */
|
|
|
|
int eopflag; /* Are we at the End-Of-Paragraph? */
|
|
|
|
int firstflag; /* first word? (needs no space) */
|
2010-04-17 19:38:09 -04:00
|
|
|
struct line *eopline; /* pointer to line just past EOP */
|
2005-09-30 18:26:09 -04:00
|
|
|
int leftmarg; /* left marginal */
|
|
|
|
|
|
|
|
if (curbp->b_mode & MDVIEW) /* don't allow this command if */
|
2010-08-29 06:03:55 -04:00
|
|
|
return rdonly(); /* we are in read only mode */
|
2005-05-31 11:50:56 -04:00
|
|
|
if (fillcol == 0) { /* no fill column set */
|
2013-09-18 02:25:39 -04:00
|
|
|
logwrite("No fill column set");
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
justflag = TRUE;
|
|
|
|
leftmarg = curwp->w_doto;
|
2005-09-30 18:26:09 -04:00
|
|
|
if (leftmarg + 10 > fillcol) {
|
2005-05-31 11:50:56 -04:00
|
|
|
leftmarg = 0;
|
2013-09-18 02:25:39 -04:00
|
|
|
logwrite("Column too narrow");
|
2010-08-29 06:03:55 -04:00
|
|
|
return FALSE;
|
2005-09-30 18:26:09 -04:00
|
|
|
}
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* record the pointer to the line just past the EOP */
|
|
|
|
gotoeop(FALSE, 1);
|
|
|
|
eopline = lforw(curwp->w_dotp);
|
|
|
|
|
|
|
|
/* and back top the beginning of the paragraph */
|
|
|
|
gotobop(FALSE, 1);
|
|
|
|
|
|
|
|
/* initialize various info */
|
|
|
|
if (leftmarg < llength(curwp->w_dotp))
|
|
|
|
curwp->w_doto = leftmarg;
|
|
|
|
|
|
|
|
clength = curwp->w_doto;
|
|
|
|
if (clength && curwp->w_dotp->l_text[0] == TAB)
|
|
|
|
clength = 8;
|
|
|
|
|
|
|
|
wordlen = 0;
|
|
|
|
|
|
|
|
/* scan through lines, filling words */
|
|
|
|
firstflag = TRUE;
|
|
|
|
eopflag = FALSE;
|
|
|
|
while (!eopflag) {
|
2012-07-11 13:43:16 -04:00
|
|
|
int bytes = 1;
|
|
|
|
|
2005-05-31 11:50:56 -04:00
|
|
|
/* get the next character in the paragraph */
|
|
|
|
if (curwp->w_doto == llength(curwp->w_dotp)) {
|
|
|
|
c = ' ';
|
|
|
|
if (lforw(curwp->w_dotp) == eopline)
|
|
|
|
eopflag = TRUE;
|
|
|
|
} else
|
2012-07-11 13:43:16 -04:00
|
|
|
bytes = lgetchar(&c);
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* and then delete it */
|
2012-07-11 13:43:16 -04:00
|
|
|
ldelete(bytes, FALSE);
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* if not a separator, just add it in */
|
|
|
|
if (c != ' ' && c != '\t') {
|
|
|
|
if (wordlen < NSTRING - 1)
|
|
|
|
wbuf[wordlen++] = c;
|
|
|
|
} else if (wordlen) {
|
|
|
|
/* at a word break with a word waiting */
|
|
|
|
/* calculate tentitive new length with word added */
|
|
|
|
newlength = clength + 1 + wordlen;
|
|
|
|
if (newlength <= fillcol) {
|
|
|
|
/* add word to current line */
|
|
|
|
if (!firstflag) {
|
2005-09-30 18:26:09 -04:00
|
|
|
linsert(1, ' '); /* the space */
|
2005-05-31 11:50:56 -04:00
|
|
|
++clength;
|
|
|
|
}
|
|
|
|
firstflag = FALSE;
|
|
|
|
} else {
|
|
|
|
/* start a new line */
|
|
|
|
lnewline();
|
2005-09-30 18:26:09 -04:00
|
|
|
for (i = 0; i < leftmarg; i++)
|
2005-05-31 11:50:56 -04:00
|
|
|
linsert(1, ' ');
|
|
|
|
clength = leftmarg;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* and add the word in in either case */
|
2005-09-30 18:26:09 -04:00
|
|
|
for (i = 0; i < wordlen; i++) {
|
2005-05-31 11:50:56 -04:00
|
|
|
linsert(1, wbuf[i]);
|
|
|
|
++clength;
|
|
|
|
}
|
|
|
|
wordlen = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* and add a last newline for the end of our new paragraph */
|
|
|
|
lnewline();
|
|
|
|
|
|
|
|
forwword(FALSE, 1);
|
|
|
|
if (llength(curwp->w_dotp) > leftmarg)
|
|
|
|
curwp->w_doto = leftmarg;
|
|
|
|
else
|
|
|
|
curwp->w_doto = llength(curwp->w_dotp);
|
|
|
|
|
|
|
|
justflag = FALSE;
|
2010-08-29 06:03:55 -04:00
|
|
|
return TRUE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-09-30 19:34:11 -04:00
|
|
|
/*
|
|
|
|
* delete n paragraphs starting with the current one
|
|
|
|
*
|
|
|
|
* int f default flag
|
|
|
|
* int n # of paras to delete
|
|
|
|
*/
|
|
|
|
int killpara(int f, int n)
|
2005-05-31 11:50:56 -04:00
|
|
|
{
|
2010-02-27 05:38:22 -05:00
|
|
|
int status; /* returned status of functions */
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
while (n--) { /* for each paragraph to delete */
|
|
|
|
|
|
|
|
/* mark out the end and beginning of the para to delete */
|
|
|
|
gotoeop(FALSE, 1);
|
|
|
|
|
|
|
|
/* set the mark here */
|
|
|
|
curwp->w_markp = curwp->w_dotp;
|
|
|
|
curwp->w_marko = curwp->w_doto;
|
|
|
|
|
|
|
|
/* go to the beginning of the paragraph */
|
|
|
|
gotobop(FALSE, 1);
|
|
|
|
curwp->w_doto = 0; /* force us to the beginning of line */
|
2005-09-30 18:26:09 -04:00
|
|
|
|
2005-05-31 11:50:56 -04:00
|
|
|
/* and delete it */
|
|
|
|
if ((status = killregion(FALSE, 1)) != TRUE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return status;
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* and clean up the 2 extra lines */
|
|
|
|
ldelete(2L, TRUE);
|
|
|
|
}
|
2010-08-29 06:03:55 -04:00
|
|
|
return TRUE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-09-30 19:34:11 -04:00
|
|
|
/*
|
|
|
|
* wordcount: count the # of words in the marked region,
|
|
|
|
* along with average word sizes, # of chars, etc,
|
|
|
|
* and report on them.
|
|
|
|
*
|
|
|
|
* int f, n; ignored numeric arguments
|
|
|
|
*/
|
|
|
|
int wordcount(int f, int n)
|
2005-05-31 11:50:56 -04:00
|
|
|
{
|
2010-04-17 19:38:09 -04:00
|
|
|
struct line *lp; /* current line to scan */
|
2010-02-27 05:38:22 -05:00
|
|
|
int offset; /* current char to scan */
|
2005-05-31 11:50:56 -04:00
|
|
|
long size; /* size of region left to count */
|
2010-02-27 05:38:22 -05:00
|
|
|
int ch; /* current character to scan */
|
|
|
|
int wordflag; /* are we in a word now? */
|
|
|
|
int lastword; /* were we just in a word? */
|
2005-05-31 11:50:56 -04:00
|
|
|
long nwords; /* total # of words */
|
|
|
|
long nchars; /* total number of chars */
|
|
|
|
int nlines; /* total number of lines in region */
|
|
|
|
int avgch; /* average number of chars/word */
|
|
|
|
int status; /* status return code */
|
2010-07-10 00:46:27 -04:00
|
|
|
struct region region; /* region to look at */
|
2005-05-31 11:50:56 -04:00
|
|
|
|
|
|
|
/* make sure we have a region to count */
|
|
|
|
if ((status = getregion(®ion)) != TRUE)
|
2010-08-29 06:03:55 -04:00
|
|
|
return status;
|
2005-05-31 11:50:56 -04:00
|
|
|
lp = region.r_linep;
|
|
|
|
offset = region.r_offset;
|
|
|
|
size = region.r_size;
|
|
|
|
|
|
|
|
/* count up things */
|
|
|
|
lastword = FALSE;
|
|
|
|
nchars = 0L;
|
|
|
|
nwords = 0L;
|
|
|
|
nlines = 0;
|
|
|
|
while (size--) {
|
|
|
|
|
|
|
|
/* get the current character */
|
|
|
|
if (offset == llength(lp)) { /* end of line */
|
|
|
|
ch = '\n';
|
|
|
|
lp = lforw(lp);
|
|
|
|
offset = 0;
|
|
|
|
++nlines;
|
|
|
|
} else {
|
|
|
|
ch = lgetc(lp, offset);
|
|
|
|
++offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* and tabulate it */
|
|
|
|
wordflag = (
|
|
|
|
#if PKCODE
|
2005-09-30 18:26:09 -04:00
|
|
|
(isletter(ch)) ||
|
2005-05-31 11:50:56 -04:00
|
|
|
#else
|
2005-09-30 18:26:09 -04:00
|
|
|
(ch >= 'a' && ch <= 'z') ||
|
|
|
|
(ch >= 'A' && ch <= 'Z') ||
|
2005-05-31 11:50:56 -04:00
|
|
|
#endif
|
2005-09-30 18:26:09 -04:00
|
|
|
(ch >= '0' && ch <= '9'));
|
2005-05-31 11:50:56 -04:00
|
|
|
if (wordflag == TRUE && lastword == FALSE)
|
|
|
|
++nwords;
|
|
|
|
lastword = wordflag;
|
|
|
|
++nchars;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* and report on the info */
|
|
|
|
if (nwords > 0L)
|
2005-09-30 18:26:09 -04:00
|
|
|
avgch = (int) ((100L * nchars) / nwords);
|
2005-05-31 11:50:56 -04:00
|
|
|
else
|
|
|
|
avgch = 0;
|
|
|
|
|
2013-09-18 02:25:39 -04:00
|
|
|
logwrite("Words %D Chars %D Lines %d Avg chars/word %f",
|
2005-05-31 11:50:56 -04:00
|
|
|
nwords, nchars, nlines + 1, avgch);
|
2010-08-29 06:03:55 -04:00
|
|
|
return TRUE;
|
2005-05-31 11:50:56 -04:00
|
|
|
}
|
|
|
|
#endif
|