assert(i>0&i<= currentsize) return Elementi-1] key; virtual void setKey(Kx, int ii ∥修改第个(从1开始)元素的key值 assert(i>0 &i<= Currentsize ) Element[i-1). key =X; virtual int Seq Search( const Kx) const;∥搜索 virtual bool Insert(KX, eel) /插入 virtual bool remove(K X, e& el); ∥删除 friend ostream& operator≤≤( ostream& out, const datalist<K, e>& outlist); /输出assert (i > 0 & i <= CurrentSize); return Element[i-1].key; } virtual void setKey (K x, int i) { //修改第 i个（从1开始）元素的key值 assert (i > 0 & i <= CurrentSize); Element[i-1].key = x; } virtual int SeqSearch (const K x) const; //搜索 virtual bool Insert (K x , E e1); //插入 virtual bool Remove (K x, E& e1); //删除 friend ostream& operator << (ostream& out, const dataList<K, E>& OutList); //输出 9