From 33012d9530c40817e1fc5230b3e663f7690b2e94 Mon Sep 17 00:00:00 2001
From: Alan Mishchenko <alanmi@berkeley.edu>
Date: Sun, 4 Sep 2005 08:01:00 -0700
Subject: Version abc50904

---
 src/misc/vec/vecInt.h | 41 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 41 insertions(+)

(limited to 'src/misc/vec/vecInt.h')

diff --git a/src/misc/vec/vecInt.h b/src/misc/vec/vecInt.h
index 793dd567..7556dd87 100644
--- a/src/misc/vec/vecInt.h
+++ b/src/misc/vec/vecInt.h
@@ -80,6 +80,26 @@ static inline Vec_Int_t * Vec_IntAlloc( int nCap )
     return p;
 }
 
+/**Function*************************************************************
+
+  Synopsis    [Allocates a vector with the given size and cleans it.]
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+static inline Vec_Int_t * Vec_IntStart( int nSize )
+{
+    Vec_Int_t * p;
+    p = Vec_IntAlloc( nSize );
+    p->nSize = nSize;
+    memset( p->pArray, 0, sizeof(int) * nSize );
+    return p;
+}
+
 /**Function*************************************************************
 
   Synopsis    [Creates the vector from an integer array of the given size.]
@@ -435,6 +455,27 @@ static inline void Vec_IntPushOrder( Vec_Int_t * p, int Entry )
     p->pArray[i+1] = Entry;
 }
 
+/**Function*************************************************************
+
+  Synopsis    []
+
+  Description []
+               
+  SideEffects []
+
+  SeeAlso     []
+
+***********************************************************************/
+static inline int Vec_IntPushUnique( Vec_Int_t * p, int Entry )
+{
+    int i;
+    for ( i = 0; i < p->nSize; i++ )
+        if ( p->pArray[i] == Entry )
+            return 1;
+    Vec_IntPush( p, Entry );
+    return 0;
+}
+
 /**Function*************************************************************
 
   Synopsis    [Returns the last entry and removes it from the list.]
-- 
cgit v1.2.3