head 1.2; access; symbols perseant-exfatfs-base-20250801:1.2 perseant-exfatfs-base-20240630:1.2 cjep_sun2x:1.2.0.44 cjep_sun2x-base:1.2 cjep_staticlib_x-base1:1.2 cjep_staticlib_x:1.2.0.42 cjep_staticlib_x-base:1.2 phil-wifi-20200421:1.2 phil-wifi-20200411:1.2 phil-wifi-20200406:1.2 pgoyette-compat-merge-20190127:1.2 pgoyette-compat-20190127:1.2 pgoyette-compat-20190118:1.2 pgoyette-compat-1226:1.2 pgoyette-compat-1126:1.2 pgoyette-compat-1020:1.2 pgoyette-compat-0930:1.2 pgoyette-compat-0906:1.2 pgoyette-compat-0728:1.2 pgoyette-compat-0625:1.2 pgoyette-compat-0521:1.2 pgoyette-compat-0502:1.2 pgoyette-compat-0422:1.2 pgoyette-compat-0415:1.2 pgoyette-compat-0407:1.2 pgoyette-compat-0330:1.2 pgoyette-compat-0322:1.2 pgoyette-compat-0315:1.2 pgoyette-compat:1.2.0.40 pgoyette-compat-base:1.2 perseant-stdc-iso10646:1.2.0.38 perseant-stdc-iso10646-base:1.2 prg-localcount2-base3:1.2 prg-localcount2-base2:1.2 prg-localcount2-base1:1.2 prg-localcount2:1.2.0.36 prg-localcount2-base:1.2 pgoyette-localcount-20170426:1.2 bouyer-socketcan-base1:1.2 pgoyette-localcount-20170320:1.2 bouyer-socketcan:1.2.0.34 bouyer-socketcan-base:1.2 pgoyette-localcount-20170107:1.2 pgoyette-localcount-20161104:1.2 localcount-20160914:1.2 pgoyette-localcount-20160806:1.2 pgoyette-localcount-20160726:1.2 pgoyette-localcount:1.2.0.32 pgoyette-localcount-base:1.2 netbsd-5-2-3-RELEASE:1.2 netbsd-5-1-5-RELEASE:1.2 yamt-pagecache-base9:1.2 yamt-pagecache-tag8:1.2 tls-earlyentropy:1.2.0.28 tls-earlyentropy-base:1.2 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.2 riastradh-drm2-base3:1.2 netbsd-5-2-2-RELEASE:1.2 netbsd-5-1-4-RELEASE:1.2 netbsd-5-2-1-RELEASE:1.2 netbsd-5-1-3-RELEASE:1.2 agc-symver:1.2.0.30 agc-symver-base:1.2 tls-maxphys-base:1.2 yamt-pagecache-base8:1.2 netbsd-5-2:1.2.0.26 yamt-pagecache-base7:1.2 netbsd-5-2-RELEASE:1.2 netbsd-5-2-RC1:1.2 yamt-pagecache-base6:1.2 yamt-pagecache-base5:1.2 yamt-pagecache-base4:1.2 netbsd-5-1-2-RELEASE:1.2 netbsd-5-1-1-RELEASE:1.2 yamt-pagecache-base3:1.2 yamt-pagecache-base2:1.2 yamt-pagecache:1.2.0.24 yamt-pagecache-base:1.2 bouyer-quota2-nbase:1.2 bouyer-quota2:1.2.0.22 bouyer-quota2-base:1.2 matt-nb5-pq3:1.2.0.20 matt-nb5-pq3-base:1.2 netbsd-5-1:1.2.0.18 netbsd-5-1-RELEASE:1.2 netbsd-5-1-RC4:1.2 netbsd-5-1-RC3:1.2 netbsd-5-1-RC2:1.2 netbsd-5-1-RC1:1.2 netbsd-5-0-2-RELEASE:1.2 netbsd-5-0-1-RELEASE:1.2 jym-xensuspend-nbase:1.2 netbsd-5-0:1.2.0.16 netbsd-5-0-RELEASE:1.2 netbsd-5-0-RC4:1.2 netbsd-5-0-RC3:1.2 netbsd-5-0-RC2:1.2 jym-xensuspend:1.2.0.14 jym-xensuspend-base:1.2 netbsd-5-0-RC1:1.2 netbsd-5:1.2.0.12 netbsd-5-base:1.2 mjf-devfs2:1.2.0.10 mjf-devfs2-base:1.2 yamt-pf42-base4:1.2 yamt-pf42-base3:1.2 hpcarm-cleanup-nbase:1.2 yamt-pf42-base2:1.2 yamt-pf42:1.2.0.8 yamt-pf42-base:1.2 keiichi-mipv6:1.2.0.6 keiichi-mipv6-base:1.2 cube-autoconf:1.2.0.4 cube-autoconf-base:1.2 hpcarm-cleanup:1.2.0.2 hpcarm-cleanup-base:1.2 netbsd-1-3-PATCH003:1.1.1.1 netbsd-1-3-PATCH003-CANDIDATE2:1.1.1.1 netbsd-1-3-PATCH003-CANDIDATE1:1.1.1.1 netbsd-1-3-PATCH003-CANDIDATE0:1.1.1.1 netbsd-1-3-PATCH002:1.1.1.1 netbsd-1-3-PATCH001:1.1.1.1 netbsd-1-3-RELEASE:1.1.1.1 netbsd-1-3-BETA:1.1.1.1 netbsd-1-3:1.1.1.1.0.2 netbsd-1-3-base:1.1.1.1 netbsd-1-2-PATCH001:1.1.1.1 libg++-2-7-2:1.1.1.1 netbsd-1-2-RELEASE:1.1.1.1 netbsd-1-2-BETA:1.1.1.1 netbsd-1-2-base:1.1.1.1 netbsd-1-2:1.1.1.1.0.4 libg++-2-7-1:1.1.1.1 FSF:1.1.1; locks; strict; comment @# @; 1.2 date 98.12.12.23.50.53; author tv; state dead; branches; next 1.1; 1.1 date 96.03.09.00.01.01; author phil; state Exp; branches 1.1.1.1; next ; 1.1.1.1 date 96.03.09.00.01.01; author phil; state Exp; branches; next ; desc @@ 1.2 log @GC old gcc 2.7.2.2. @ text @// This may look like C code, but it is really -*- C++ -*- /* Copyright (C) 1988 Free Software Foundation written by Doug Lea (dl@@rocky.oswego.edu) This file is part of the GNU C++ Library. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; if not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ #ifdef __GNUG__ #pragma implementation #endif #include ".OSLSet.h" Pix OSLSet::seek( item) { for (Pix i = p.first(); i != 0; p.next(i)) { int cmp = CMP(item, p(i)); if (cmp == 0) return i; else if (cmp < 0) return 0; } return 0; } Pix OSLSet::add( item) { Pix i = p.first(); if (i == 0) { ++count; return p.prepend(item); } int cmp = CMP(item, p(i)); if (cmp == 0) return i; else if (cmp < 0) { ++count; return p.prepend(item); } else { Pix trail = i; p.next(i); for (;;) { if (i == 0) { ++count; return p.append(item); } cmp = CMP(item, p(i)); if (cmp == 0) return i; else if (cmp < 0) { ++count; return p.ins_after(trail, item); } else { trail = i; p.next(i); } } } } void OSLSet::del( item) { Pix i = p.first(); if (i == 0) return; int cmp = CMP(item, p(i)); if (cmp < 0) return; else if (cmp == 0) { --count; p.del_front(); } else { Pix trail = i; p.next(i); while (i != 0) { cmp = CMP(item, p(i)); if (cmp < 0) return; else if (cmp == 0) { --count; p.del_after(trail); return; } else { trail = i; p.next(i); } } } } int OSLSet::operator <= (OSLSet& b) { if (count > b.count) return 0; Pix i = first(); Pix j = b.first(); for (;;) { if (i == 0) return 1; else if (j == 0) return 0; int cmp = CMP(p(i), b.p(j)); if (cmp == 0) { next(i); b.next(j); } else if (cmp < 0) return 0; else b.next(j); } } int OSLSet::operator == (OSLSet& b) { if (count != b.count) return 0; if (count == 0) return 1; Pix i = p.first(); Pix j = b.p.first(); while (i != 0) { if (!EQ(p(i),b.p(j))) return 0; next(i); b.next(j); } return 1; } void OSLSet::operator |= (OSLSet& b) { if (&b == this || b.count == 0) return; else { Pix j = b.p.first(); Pix i = p.first(); Pix trail = 0; for (;;) { if (j == 0) return; else if (i == 0) { for (; j != 0; b.next(j)) { ++count; p.append(b.p(j)); } return; } int cmp = CMP(p(i), b.p(j)); if (cmp <= 0) { if (cmp == 0) b.next(j); trail = i; next(i); } else { ++count; if (trail == 0) trail = p.prepend(b.p(j)); else trail = p.ins_after(trail, b.p(j)); b.next(j); } } } } void OSLSet::operator -= (OSLSet& b) { if (&b == this) clear(); else if (count != 0 && b.count != 0) { Pix i = p.first(); Pix j = b.p.first(); Pix trail = 0; for (;;) { if (j == 0 || i == 0) return; int cmp = CMP(p(i), b.p(j)); if (cmp == 0) { --count; b.next(j); if (trail == 0) { p.del_front(); i = p.first(); } else { next(i); p.del_after(trail); } } else if (cmp < 0) { trail = i; next(i); } else b.next(j); } } } void OSLSet::operator &= (OSLSet& b) { if (b.count == 0) clear(); else if (&b != this && count != 0) { Pix i = p.first(); Pix j = b.p.first(); Pix trail = 0; for (;;) { if (i == 0) return; else if (j == 0) { if (trail == 0) { p.clear(); count = 0; } else { while (i != 0) { --count; next(i); p.del_after(trail); } } return; } int cmp = CMP(p(i), b.p(j)); if (cmp == 0) { trail = i; next(i); b.next(j); } else if (cmp < 0) { --count; if (trail == 0) { p.del_front(); i = p.first(); } else { next(i); p.del_after(trail); } } else b.next(j); } } } int OSLSet::OK() { int v = p.OK(); v &= count == p.length(); Pix trail = p.first(); if (trail == 0) v &= count == 0; else { Pix i = trail; next(i); while (i != 0) { v &= CMP(p(trail), p(i)) < 0; trail = i; next(i); } } if (!v) error("invariant failure"); return v; } @ 1.1 log @Initial revision @ text @@ 1.1.1.1 log @Import of libg++-2.7.1. @ text @@