# HG changeset patch
# User jwe
# Date 820979813 0
# Node ID 6f5e1c4dd4cb4832986426dc006636d4c6bd68ce
# Parent  bad55bbcaf46f0af5b0d1b241a6fd72de4afa0a9
[project @ 1996-01-07 01:56:53 by jwe]

diff --git a/liboctave/Array.cc b/liboctave/Array.cc
--- a/liboctave/Array.cc
+++ b/liboctave/Array.cc
@@ -91,8 +91,6 @@
 {
   rep = new ArrayRep<T> (n);
 
-  rep->count = 1;
-
   for (int i = 0; i < n; i++)
     rep->data[i] = val;
 
@@ -195,7 +193,6 @@
   int old_len = length ();
 
   rep = new ArrayRep<T> (n);
-  rep->count = 1;
 
   if (old_data && old_len > 0)
     {
@@ -227,7 +224,6 @@
   int old_len = length ();
 
   rep = new ArrayRep<T> (n);
-  rep->count = 1;
 
   int min_len = old_len < n ? old_len : n;
 
@@ -252,7 +248,6 @@
     {
       --rep->count;
       rep = new ArrayRep<T> (*rep);
-      rep->count = 1;
     }
   return rep->data;
 }
@@ -328,7 +323,6 @@
   int old_len = length ();
 
   rep = new ArrayRep<T> (r*c);
-  rep->count = 1;
 
   d1 = r;
   d2 = c;
@@ -367,7 +361,6 @@
   int old_len = length ();
 
   rep = new ArrayRep<T> (r*c);
-  rep->count = 1;
 
   d1 = r;
   d2 = c;
@@ -580,7 +573,6 @@
   int new_len = r < c ? r : c;
 
   rep = new ArrayRep<T> (new_len);
-  rep->count = 1;
 
   nr = r;
   nc = c;
@@ -617,7 +609,6 @@
   int new_len = r < c ? r : c;
 
   rep = new ArrayRep<T> (new_len);
-  rep->count = 1;
 
   nr = r;
   nc = c;