3437
|
1 ## Copyright (C) 1996, 1998 Auburn University. All rights reserved. |
|
2 ## |
|
3 ## This file is part of Octave. |
|
4 ## |
|
5 ## Octave is free software; you can redistribute it and/or modify it |
|
6 ## under the terms of the GNU General Public License as published by the |
|
7 ## Free Software Foundation; either version 2, or (at your option) any |
|
8 ## later version. |
|
9 ## |
|
10 ## Octave is distributed in the hope that it will be useful, but WITHOUT |
|
11 ## ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
12 ## FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
13 ## for more details. |
|
14 ## |
|
15 ## You should have received a copy of the GNU General Public License |
|
16 ## along with Octave; see the file COPYING. If not, write to the Free |
|
17 ## Software Foundation, 59 Temple Place, Suite 330, Boston, MA 02111 USA. |
|
18 |
|
19 ## -*- texinfo -*- |
3500
|
20 ## @deftypefn {Function File} {} __sysgroupn__ (@var{names}) |
3437
|
21 ## Locate and mark duplicate names |
|
22 ## inputs: |
|
23 ## names: list of signal names |
|
24 ## kind: kind of signal name (used for diagnostic message purposes only) |
|
25 ## outputs: |
|
26 ## returns names with unique suffixes added; diagnostic warning |
|
27 ## message is printed to inform the user of the new signal name |
|
28 ## |
|
29 ## used internally in sysgroup and elsewhere. |
|
30 ## @end deftypefn |
|
31 |
3438
|
32 function names = __sysgroupn__ (names, kind) |
3437
|
33 |
|
34 ## check for duplicate names |
|
35 l = length(names); |
|
36 ii = 1; |
|
37 while(ii <= l-1) |
|
38 st1 = nth(names,ii); |
|
39 jj = ii+1; |
|
40 while ( jj <= l) |
|
41 st2 = nth(names,jj); |
|
42 if(strcmp(st1,st2)) |
|
43 suffix = ["_",num2str(jj)]; |
|
44 warning("sysgroup: %s name(%d) = %s name(%d) = %s", ... |
|
45 kind,ii,kind,jj,st1); |
|
46 strval = sprintf("%s%s",st2,suffix); |
|
47 names(jj) = strval; |
|
48 warning("sysgroup: changed %s name %d to %s",kind,jj,strval); |
|
49 ## restart the check (just to be sure there's no further duplications) |
|
50 ii = 0; jj = l; |
|
51 endif |
|
52 jj = jj+1; |
|
53 endwhile |
|
54 ii = ii+1; |
|
55 endwhile |
|
56 endfunction |