3279
|
1 # Copyright (C) 1996,1998 Auburn University. All Rights Reserved. |
3213
|
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 |
3284
|
17 # Software Foundation, 59 Temple Place, Suite 330, Boston, MA 02111 USA. |
3213
|
18 |
|
19 function names = sysgroupn(names,kind) |
|
20 # names = sysgroupn(names) |
|
21 # locate and mark duplicate names |
3228
|
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 |
3213
|
28 # |
|
29 # used internally in sysgroup |
|
30 |
|
31 # check for duplicate names |
3228
|
32 l = length(names); |
|
33 ii = 1; |
3236
|
34 while(ii <= l-1) |
3228
|
35 st1 = nth(names,ii); |
|
36 jj = ii+1; |
3236
|
37 while ( jj <= l) |
3228
|
38 st2 = nth(names,jj); |
|
39 if(strcmp(st1,st2)) |
|
40 suffix = ["_",num2str(jj)]; |
3236
|
41 warning("sysgroup: %s name(%d) = %s name(%d) = %s", ... |
|
42 kind,ii,kind,jj,st1); |
3228
|
43 strval = sprintf("%s%s",st2,suffix); |
|
44 names(jj) = strval; |
3236
|
45 warning("sysgroup: changed %s name %d to %s",kind,jj,strval); |
3228
|
46 # restart the check (just to be sure there's no further duplications) |
|
47 ii = 0; jj = l; |
|
48 endif |
|
49 jj = jj+1; |
|
50 endwhile |
|
51 ii = ii+1; |
|
52 endwhile |
3213
|
53 endfunction |