1999-10-04 15:06:00 -07:00
|
|
|
/*
|
2005-03-19 08:40:18 -08:00
|
|
|
* Copyright (C) 2000-2005 Carsten Haitzler, Geoff Harrison and various contributors
|
2000-04-05 16:22:56 -07:00
|
|
|
*
|
1999-10-04 15:06:00 -07:00
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to
|
|
|
|
* deal in the Software without restriction, including without limitation the
|
|
|
|
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
|
|
|
* sell copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
2000-04-05 16:22:56 -07:00
|
|
|
*
|
1999-10-04 15:06:00 -07:00
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies of the Software, its documentation and marketing & publicity
|
|
|
|
* materials, and acknowledgment shall be given in the documentation, materials
|
|
|
|
* and software packages that this Software was used.
|
2000-04-05 16:22:56 -07:00
|
|
|
*
|
1999-10-04 15:06:00 -07:00
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
|
|
|
|
* IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
|
|
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
*/
|
1999-08-17 15:56:46 -07:00
|
|
|
#include "E.h"
|
2005-07-16 09:57:45 -07:00
|
|
|
#include "ewins.h"
|
1999-08-17 15:56:46 -07:00
|
|
|
|
|
|
|
EWin *
|
2005-06-30 05:50:47 -07:00
|
|
|
EwinFindByPtr(const EWin * ewin)
|
|
|
|
{
|
|
|
|
EWin *const *ewins;
|
|
|
|
int i, num;
|
|
|
|
|
|
|
|
ewins = EwinListGetAll(&num);
|
|
|
|
for (i = 0; i < num; i++)
|
|
|
|
{
|
|
|
|
if (ewin == ewins[i])
|
|
|
|
return ewins[i];
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
EWin *
|
|
|
|
EwinFindByFrame(Window win)
|
1999-08-17 15:56:46 -07:00
|
|
|
{
|
2004-03-26 13:21:47 -08:00
|
|
|
EWin *const *ewins;
|
1999-08-17 15:56:46 -07:00
|
|
|
int i, num;
|
|
|
|
|
2004-04-01 14:41:22 -08:00
|
|
|
ewins = EwinListGetAll(&num);
|
1999-08-17 15:56:46 -07:00
|
|
|
for (i = 0; i < num; i++)
|
2000-07-26 11:00:47 -07:00
|
|
|
{
|
2004-12-28 15:46:49 -08:00
|
|
|
if (win == EoGetWin(ewins[i]))
|
2004-03-26 13:21:47 -08:00
|
|
|
return ewins[i];
|
2000-07-26 11:00:47 -07:00
|
|
|
}
|
2005-01-25 13:58:28 -08:00
|
|
|
return NULL;
|
1999-08-17 15:56:46 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
EWin *
|
2005-06-30 05:50:47 -07:00
|
|
|
EwinFindByClient(Window win)
|
|
|
|
{
|
|
|
|
EWin *const *ewins;
|
|
|
|
int i, num;
|
|
|
|
|
|
|
|
ewins = EwinListGetAll(&num);
|
|
|
|
for (i = 0; i < num; i++)
|
|
|
|
{
|
|
|
|
if (win == ewins[i]->client.win)
|
|
|
|
return ewins[i];
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
EWin *
|
|
|
|
EwinFindByChildren(Window win)
|
1999-08-17 15:56:46 -07:00
|
|
|
{
|
2004-03-26 13:21:47 -08:00
|
|
|
EWin *const *ewins;
|
1999-08-17 15:56:46 -07:00
|
|
|
int i, j, num;
|
|
|
|
|
2004-04-01 14:41:22 -08:00
|
|
|
ewins = EwinListGetAll(&num);
|
1999-08-17 15:56:46 -07:00
|
|
|
for (i = 0; i < num; i++)
|
2000-07-26 11:00:47 -07:00
|
|
|
{
|
2003-05-22 12:15:03 -07:00
|
|
|
if ((win == ewins[i]->client.win) || (win == ewins[i]->win_container))
|
|
|
|
{
|
2004-03-26 13:21:47 -08:00
|
|
|
return ewins[i];
|
2003-05-22 12:15:03 -07:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
for (j = 0; j < ewins[i]->border->num_winparts; j++)
|
|
|
|
if (win == ewins[i]->bits[j].win)
|
|
|
|
{
|
2004-03-26 13:21:47 -08:00
|
|
|
return ewins[i];
|
2003-05-22 12:15:03 -07:00
|
|
|
}
|
|
|
|
}
|
2000-07-26 11:00:47 -07:00
|
|
|
}
|
2005-01-25 13:58:28 -08:00
|
|
|
return NULL;
|
1999-08-17 15:56:46 -07:00
|
|
|
}
|
|
|
|
|
2003-12-07 01:54:37 -08:00
|
|
|
EWin *
|
2005-06-30 05:50:47 -07:00
|
|
|
EwinFindByString(const char *match, int type)
|
2003-12-07 01:54:37 -08:00
|
|
|
{
|
|
|
|
EWin *ewin = NULL;
|
2004-03-26 13:21:47 -08:00
|
|
|
EWin *const *ewins;
|
2003-12-07 01:54:37 -08:00
|
|
|
int i, num, len;
|
|
|
|
char ewinid[FILEPATH_LEN_MAX];
|
2004-12-28 15:46:49 -08:00
|
|
|
const char *name;
|
2003-12-07 01:54:37 -08:00
|
|
|
|
|
|
|
len = strlen(match);
|
|
|
|
if (len <= 0)
|
2004-03-20 07:49:05 -08:00
|
|
|
goto done;
|
2003-12-07 01:54:37 -08:00
|
|
|
|
2004-04-01 14:41:22 -08:00
|
|
|
ewins = EwinListGetAll(&num);
|
2003-12-07 01:54:37 -08:00
|
|
|
if (ewins == NULL)
|
2004-03-20 07:49:05 -08:00
|
|
|
goto done;
|
2003-12-07 01:54:37 -08:00
|
|
|
|
|
|
|
for (i = 0; i < num; i++)
|
|
|
|
{
|
|
|
|
if (type == '+')
|
|
|
|
{
|
|
|
|
/* Match start of window ID */
|
|
|
|
sprintf(ewinid, "%x", (unsigned)ewins[i]->client.win);
|
|
|
|
if (strncmp(ewinid, match, len))
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
else if (type == '=')
|
|
|
|
{
|
|
|
|
/* Match name (substring) */
|
2004-12-28 15:46:49 -08:00
|
|
|
name = ewins[i]->icccm.wm_name;
|
|
|
|
if (!name)
|
|
|
|
continue;
|
|
|
|
if (!strstr(name, match))
|
2003-12-07 01:54:37 -08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
else
|
2004-03-20 07:49:05 -08:00
|
|
|
goto done;
|
2003-12-07 01:54:37 -08:00
|
|
|
|
|
|
|
ewin = ewins[i];
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2004-03-20 07:49:05 -08:00
|
|
|
done:
|
2005-01-25 13:58:28 -08:00
|
|
|
return ewin;
|
2003-12-07 01:54:37 -08:00
|
|
|
}
|
|
|
|
|
2005-05-29 10:52:03 -07:00
|
|
|
static EWin *
|
1999-08-17 15:56:46 -07:00
|
|
|
FindEwinByDecoration(Window win)
|
|
|
|
{
|
2004-03-26 13:21:47 -08:00
|
|
|
EWin *const *ewins;
|
1999-08-17 15:56:46 -07:00
|
|
|
int i, j, num;
|
|
|
|
|
2004-04-01 14:41:22 -08:00
|
|
|
ewins = EwinListGetAll(&num);
|
1999-08-17 15:56:46 -07:00
|
|
|
for (i = 0; i < num; i++)
|
2000-07-26 11:00:47 -07:00
|
|
|
{
|
2003-05-22 12:15:03 -07:00
|
|
|
for (j = 0; j < ewins[i]->border->num_winparts; j++)
|
|
|
|
{
|
|
|
|
if (win == ewins[i]->bits[j].win)
|
2004-03-26 13:21:47 -08:00
|
|
|
return ewins[i];
|
2003-05-22 12:15:03 -07:00
|
|
|
}
|
2000-07-26 11:00:47 -07:00
|
|
|
}
|
2004-03-26 13:21:47 -08:00
|
|
|
|
2005-01-25 13:58:28 -08:00
|
|
|
return NULL;
|
1999-08-17 15:56:46 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
ActionClass *
|
|
|
|
FindActionClass(Window win)
|
|
|
|
{
|
|
|
|
Button *b;
|
|
|
|
EWin *ewin;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
b = FindButton(win);
|
|
|
|
if (b)
|
2005-01-25 13:58:28 -08:00
|
|
|
return ButtonGetAClass(b);
|
2003-12-07 01:18:55 -08:00
|
|
|
|
1999-08-17 15:56:46 -07:00
|
|
|
ewin = FindEwinByDecoration(win);
|
|
|
|
if (ewin)
|
2000-07-26 11:00:47 -07:00
|
|
|
{
|
2003-05-22 12:15:03 -07:00
|
|
|
for (i = 0; i < ewin->border->num_winparts; i++)
|
|
|
|
if (win == ewin->bits[i].win)
|
2005-01-25 13:58:28 -08:00
|
|
|
return ewin->border->part[i].aclass;
|
2000-07-26 11:00:47 -07:00
|
|
|
}
|
2003-12-07 01:18:55 -08:00
|
|
|
|
2004-03-20 07:49:05 -08:00
|
|
|
for (i = 0; i < Conf.desks.num; i++)
|
2000-07-26 11:00:47 -07:00
|
|
|
{
|
2003-05-22 12:15:03 -07:00
|
|
|
ActionClass *ac;
|
|
|
|
|
2004-12-28 15:46:49 -08:00
|
|
|
if (win == DeskGetWin(i))
|
2003-05-22 12:15:03 -07:00
|
|
|
{
|
|
|
|
ac = FindItem("DESKBINDINGS", 0, LIST_FINDBY_NAME,
|
|
|
|
LIST_TYPE_ACLASS);
|
2005-01-25 13:58:28 -08:00
|
|
|
return ac;
|
2003-05-22 12:15:03 -07:00
|
|
|
}
|
2000-07-26 11:00:47 -07:00
|
|
|
}
|
2003-12-07 01:18:55 -08:00
|
|
|
|
2005-01-25 13:58:28 -08:00
|
|
|
return NULL;
|
1999-08-17 15:56:46 -07:00
|
|
|
}
|
|
|
|
|
1999-09-08 17:39:43 -07:00
|
|
|
Group **
|
|
|
|
ListWinGroups(EWin * ewin, char group_select, int *num)
|
|
|
|
{
|
|
|
|
Group **groups = NULL;
|
|
|
|
Group **groups2 = NULL;
|
|
|
|
int i, j, killed = 0;
|
|
|
|
|
|
|
|
switch (group_select)
|
2000-07-26 11:00:47 -07:00
|
|
|
{
|
2003-05-22 12:15:03 -07:00
|
|
|
case GROUP_SELECT_EWIN_ONLY:
|
|
|
|
groups = (Group **) Emalloc(sizeof(Group *) * ewin->num_groups);
|
|
|
|
groups =
|
|
|
|
(Group **) memcpy(groups, ewin->groups,
|
|
|
|
sizeof(Group *) * ewin->num_groups);
|
|
|
|
*num = ewin->num_groups;
|
|
|
|
break;
|
|
|
|
case GROUP_SELECT_ALL_EXCEPT_EWIN:
|
|
|
|
groups2 = (Group **) ListItemType(num, LIST_TYPE_GROUP);
|
|
|
|
if (groups2)
|
|
|
|
{
|
|
|
|
for (i = 0; i < (*num); i++)
|
|
|
|
{
|
|
|
|
for (j = 0; j < ewin->num_groups; j++)
|
|
|
|
{
|
|
|
|
if (ewin->groups[j] == groups2[i])
|
|
|
|
{
|
|
|
|
groups2[i] = NULL;
|
|
|
|
killed++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
groups = (Group **) Emalloc(sizeof(Group *) * (*num - killed));
|
|
|
|
j = 0;
|
|
|
|
for (i = 0; i < (*num); i++)
|
|
|
|
if (groups2[i])
|
|
|
|
groups[j++] = groups2[i];
|
|
|
|
(*num) -= killed;
|
|
|
|
Efree(groups2);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case GROUP_SELECT_ALL:
|
|
|
|
default:
|
|
|
|
groups = (Group **) ListItemType(num, LIST_TYPE_GROUP);
|
|
|
|
break;
|
2000-07-26 11:00:47 -07:00
|
|
|
}
|
1999-09-08 17:39:43 -07:00
|
|
|
|
|
|
|
return groups;
|
|
|
|
}
|
|
|
|
|
1999-08-17 15:56:46 -07:00
|
|
|
EWin **
|
1999-09-08 17:39:43 -07:00
|
|
|
ListWinGroupMembersForEwin(EWin * ewin, int action, char nogroup, int *num)
|
1999-08-17 15:56:46 -07:00
|
|
|
{
|
|
|
|
|
|
|
|
EWin **gwins = NULL;
|
1999-09-08 17:39:43 -07:00
|
|
|
int i, j, k, daddy_says_no_no;
|
|
|
|
char inlist;
|
1999-08-17 15:56:46 -07:00
|
|
|
|
|
|
|
if (ewin)
|
2000-07-26 11:00:47 -07:00
|
|
|
{
|
2003-05-22 12:15:03 -07:00
|
|
|
if (nogroup)
|
|
|
|
{
|
|
|
|
gwins = Emalloc(sizeof(EWin *));
|
|
|
|
gwins[0] = ewin;
|
|
|
|
*num = 1;
|
|
|
|
return gwins;
|
|
|
|
}
|
|
|
|
|
|
|
|
(*num) = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < ewin->num_groups; i++)
|
|
|
|
{
|
|
|
|
daddy_says_no_no = 0;
|
|
|
|
|
|
|
|
switch (action)
|
|
|
|
{
|
2004-12-28 15:46:49 -08:00
|
|
|
case GROUP_ACTION_SET_WINDOW_BORDER:
|
2003-05-22 12:15:03 -07:00
|
|
|
if (!ewin->groups[i]->cfg.set_border)
|
|
|
|
daddy_says_no_no = 1;
|
|
|
|
break;
|
2004-12-28 15:46:49 -08:00
|
|
|
case GROUP_ACTION_ICONIFY:
|
2003-05-22 12:15:03 -07:00
|
|
|
if (!ewin->groups[i]->cfg.iconify)
|
|
|
|
daddy_says_no_no = 1;
|
|
|
|
break;
|
2004-12-28 15:46:49 -08:00
|
|
|
case GROUP_ACTION_MOVE:
|
2003-05-22 12:15:03 -07:00
|
|
|
if (!ewin->groups[i]->cfg.move)
|
|
|
|
daddy_says_no_no = 1;
|
|
|
|
break;
|
2004-12-28 15:46:49 -08:00
|
|
|
case GROUP_ACTION_RAISE:
|
|
|
|
case GROUP_ACTION_LOWER:
|
|
|
|
case GROUP_ACTION_RAISE_LOWER:
|
2003-05-22 12:15:03 -07:00
|
|
|
if (!ewin->groups[i]->cfg.raise)
|
|
|
|
daddy_says_no_no = 1;
|
|
|
|
break;
|
2004-12-28 15:46:49 -08:00
|
|
|
case GROUP_ACTION_STICK:
|
2003-05-22 12:15:03 -07:00
|
|
|
if (!ewin->groups[i]->cfg.stick)
|
|
|
|
daddy_says_no_no = 1;
|
|
|
|
break;
|
2004-12-28 15:46:49 -08:00
|
|
|
case GROUP_ACTION_SHADE:
|
2003-05-22 12:15:03 -07:00
|
|
|
if (!ewin->groups[i]->cfg.shade)
|
|
|
|
daddy_says_no_no = 1;
|
|
|
|
break;
|
2004-12-28 15:46:49 -08:00
|
|
|
case GROUP_ACTION_KILL:
|
2003-05-22 12:15:03 -07:00
|
|
|
if (!ewin->groups[i]->cfg.kill)
|
|
|
|
daddy_says_no_no = 1;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!daddy_says_no_no)
|
|
|
|
{
|
|
|
|
gwins =
|
|
|
|
Erealloc(gwins,
|
|
|
|
sizeof(EWin *) * (*num +
|
|
|
|
ewin->groups[i]->num_members));
|
|
|
|
/* Check if a window is not already in the group */
|
|
|
|
for (k = 0; k < ewin->groups[i]->num_members; k++)
|
|
|
|
{
|
|
|
|
/* To get consistent behaviour, limit groups to a single desktop for now: */
|
2004-12-28 15:46:49 -08:00
|
|
|
if (EoGetDesk(ewin->groups[i]->members[k]) ==
|
|
|
|
EoGetDesk(ewin))
|
2003-05-22 12:15:03 -07:00
|
|
|
{
|
|
|
|
inlist = 0;
|
|
|
|
for (j = 0; j < (*num); j++)
|
|
|
|
{
|
|
|
|
if (gwins[j] == ewin->groups[i]->members[k])
|
|
|
|
inlist = 1;
|
|
|
|
}
|
|
|
|
/* If we do not have this one yet, add it to the result */
|
|
|
|
if (!inlist)
|
|
|
|
gwins[(*num)++] = ewin->groups[i]->members[k];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* and shrink the result to the correct size. */
|
|
|
|
gwins = Erealloc(gwins, sizeof(EWin *) * (*num));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((*num) == 0)
|
|
|
|
{
|
|
|
|
gwins = Emalloc(sizeof(EWin *));
|
|
|
|
gwins[0] = ewin;
|
|
|
|
*num = 1;
|
|
|
|
}
|
2005-01-25 13:58:28 -08:00
|
|
|
return gwins;
|
2000-07-26 11:00:47 -07:00
|
|
|
}
|
1999-08-17 15:56:46 -07:00
|
|
|
else
|
2000-07-26 11:00:47 -07:00
|
|
|
{
|
2003-05-22 12:15:03 -07:00
|
|
|
*num = 0;
|
2005-01-25 13:58:28 -08:00
|
|
|
return NULL;
|
2000-07-26 11:00:47 -07:00
|
|
|
}
|
1999-08-17 15:56:46 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
EWin **
|
2004-06-18 18:31:21 -07:00
|
|
|
EwinListTransients(EWin * ewin, int *num, int group)
|
1999-08-17 15:56:46 -07:00
|
|
|
{
|
2004-06-18 18:31:21 -07:00
|
|
|
EWin *const *ewins, **lst, *ew;
|
1999-08-17 15:56:46 -07:00
|
|
|
int i, j, n;
|
|
|
|
|
|
|
|
j = 0;
|
2004-06-18 18:31:21 -07:00
|
|
|
lst = NULL;
|
|
|
|
|
|
|
|
if (!ewin->has_transients)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
ewins = EwinListGetAll(&n);
|
|
|
|
|
|
|
|
/* Find regular transients */
|
|
|
|
for (i = 0; i < n; i++)
|
|
|
|
{
|
|
|
|
ew = ewins[i];
|
|
|
|
|
|
|
|
/* Skip self-reference */
|
|
|
|
if (ew == ewin)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (ew->client.transient_for == ewin->client.win)
|
|
|
|
{
|
|
|
|
lst = Erealloc(lst, (j + 1) * sizeof(EWin *));
|
|
|
|
lst[j++] = ew;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!group)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
/* Group transients (if ewin is not a transient) */
|
|
|
|
if (ewin->client.transient)
|
|
|
|
goto done;
|
|
|
|
|
1999-08-17 15:56:46 -07:00
|
|
|
for (i = 0; i < n; i++)
|
2000-07-26 11:00:47 -07:00
|
|
|
{
|
2004-06-18 18:31:21 -07:00
|
|
|
ew = ewins[i];
|
|
|
|
|
|
|
|
/* Skip self-reference */
|
|
|
|
if (ew == ewin)
|
2004-05-29 13:42:06 -07:00
|
|
|
continue;
|
2004-06-18 18:31:21 -07:00
|
|
|
|
|
|
|
if (ew->client.transient_for == VRoot.win &&
|
|
|
|
ew->client.group == ewin->client.group)
|
|
|
|
{
|
|
|
|
lst = Erealloc(lst, (j + 1) * sizeof(EWin *));
|
|
|
|
lst[j++] = ew;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
|
|
|
*num = j;
|
2005-01-25 13:58:28 -08:00
|
|
|
return lst;
|
2004-06-18 18:31:21 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
EWin **
|
|
|
|
EwinListTransientFor(EWin * ewin, int *num)
|
|
|
|
{
|
|
|
|
EWin *const *ewins, **lst, *ew;
|
|
|
|
int i, j, n;
|
|
|
|
|
|
|
|
j = 0;
|
|
|
|
lst = NULL;
|
|
|
|
|
|
|
|
if (!ewin->client.transient)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
ewins = EwinListGetAll(&n);
|
|
|
|
for (i = 0; i < n; i++)
|
|
|
|
{
|
|
|
|
ew = ewins[i];
|
|
|
|
|
|
|
|
/* Skip self-reference */
|
|
|
|
if (ew == ewin)
|
2004-05-29 13:42:06 -07:00
|
|
|
continue;
|
|
|
|
|
2004-06-18 18:31:21 -07:00
|
|
|
/* Regular parent or if root trans, top level group members */
|
|
|
|
if ((ewin->client.transient_for == ew->client.win) ||
|
|
|
|
(!ew->client.transient &&
|
|
|
|
ewin->client.transient_for == VRoot.win &&
|
|
|
|
ew->client.group == ewin->client.group))
|
|
|
|
{
|
|
|
|
lst = Erealloc(lst, (j + 1) * sizeof(EWin *));
|
|
|
|
lst[j++] = ew;
|
|
|
|
}
|
2000-07-26 11:00:47 -07:00
|
|
|
}
|
2004-06-18 18:31:21 -07:00
|
|
|
|
|
|
|
done:
|
1999-08-17 15:56:46 -07:00
|
|
|
*num = j;
|
2005-01-25 13:58:28 -08:00
|
|
|
return lst;
|
1999-08-17 15:56:46 -07:00
|
|
|
}
|