分享
 
 
 

集合基于数组的实现:ArrayBag.java

王朝java/jsp·作者佚名  2006-01-09
窄屏简体版  字體: |||超大  

/**

* @Author 陈伟兵

* @Msn:cwbnig1982@hotmail.com

* @E-mail:chenweibing1982@sohu.com

* @CreateTime 2004-11-30

* @Version:1.0

*/

package com.cwbnig.util;

import java.util.Random;

import java.util.Iterator;

public class ArrayBag implements BagADT

{

private static Random rand=new Random();

private final int DEFAULT_CAPACITY =100;

private final int NOT_FOUND=-1;

private int count;

private Object[] contents;

/**

* Create an empty bag using the default capacity

*/

public ArrayBag()

{

count=0;

contents=new Object[DEFAULT_CAPACITY];

}

/**

* Create an empty bag using the specified capacity

*/

public ArrayBag(int initialCapacity)

{

count=0;

contents=new Object[initialCapacity];

}

/**

* Returns the number of elements currentl in this bag

*/

public int size()

{

return count;

}

/**

* Returns true if this bag is empty and false otherwise

*/

public boolean isEmpty()

{

return(count==0);

}

/**

* Adds the speacified element to the bag,expanding the capacity of the array if necessary.

*/

public void add(Object element)

{

if(size()==contents.length)

{

expandCapacity();

}

contents[count]=element;

count++;

}

/**

* Creates a new array to store the contents of the bag with twice the capcity of the old one.

*/

public void expandCapacity()

{

Object[] larger=new Object[contents.length*2];

for(int index=0;index<contents.length;index++)

{

larger[index]=contents[index];

}

contents=larger;

}

/**

* Adds the contents of the parameter to this bag.

*/

public void addAll(BagADT bag)

{

Iterator scan=bag.iterator();

while(scan.hasNext())

{

add(scan.next());

}

}

/**

* Remove a random element from the bag and returns it.Throws and EmptyBagException if the bag is empty

*/

public Object removeRandom()throws EmptyBagException

{

if(isEmpty())

{

throw new EmptyBagException();

}

int choice=rand.nextInt(count);

Object result=contents[choice];

contents[choice]=contents[count-1];

contents[count-1]=null;

count--;

return result;

}

/**

* Removes one occurance of the specified element from the bag and returns it.

* Throws and EmptyBagException if the bag is empty and a NoSuchElementException if the target is not in the bag.

*/

public Object remove(Object target)throws EmptyBagException,NoSuchElementException

{

int search=NOT_FOUND;

if(isEmpty())

{

throw new EmptyBagException();

}

for(int index=0;index<count&&search==NOT_FOUND;index++)

{

search=index;

}

if(search==NOT_FOUND)

{

throw new NoSuchElementException();

}

Object result=contents[count-1];

contents[search]=contents[count-1];

contents[count-1]=null;

return result;

}

/**

* Returns a new bag that is the union of this bag and the parameter.

*/

public BagADT union(BagADT bag)

{

ArrayBag both=new ArrayBag();

for(int index=0;index<count;index++)

{

both.add(contents[index]);

}

Iterator scan=bag.iterator();

while(scan.hasNext())

{

both.add(scan.next());

}

return both;

}

/**

* Returns true if this bag contains the specified target element.

*/

public boolean contains(Object target)

{

int search=NOT_FOUND;

for(int index=0;index<count&&search==NOT_FOUND;index++)

{

if(contents[index].equals(target))

{

search=index;

}

}

return(search!=NOT_FOUND);

}

/**

* Returns true if this bag contains exactly the same elements as the parameter.

*/

public boolean equals(BagADT bag)

{

boolean result=false;

ArrayBag temp1=new ArrayBag();

ArrayBag temp2=new ArrayBag();

Object obj;

if(size()==bag.size())

{

temp1.addAll(this);

temp2.addAll(bag);

Iterator scan=bag.iterator();

while(scan.hasNext())

{

obj=scan.next();

if(temp1.contains(obj))

{

try

{

temp1.remove(obj);

temp2.remove(obj);

}

catch(EmptyBagException emptyE)

{

System.out.println("The current Bag is Empty!");

}

catch(NoSuchElementException nosuchE)

{

System.out.println("The current Bag has no such element!");

}

}

}

result=(temp1.isEmpty()&&temp2.isEmpty());

}

return result;

}

/**

* Returns an iterator for the elements currently in this bag

*/

public Iterator iterator()

{

return new ArrayIterator(contents,count);

}

/**

* Returns a string representation of this bag.

*/

public String toString()

{

String result="";

for(int index=0;index<count;index++)

{

result=result+contents[index].toString()+"\n";

}

return result;

}

}

 
 
 
免责声明:本文为网络用户发布,其观点仅代表作者个人观点,与本站无关,本站仅提供信息存储服务。文中陈述内容未经本站证实,其真实性、完整性、及时性本站不作任何保证或承诺,请读者仅作参考,并请自行核实相关内容。
2023年上半年GDP全球前十五强
 百态   2023-10-24
美众议院议长启动对拜登的弹劾调查
 百态   2023-09-13
上海、济南、武汉等多地出现不明坠落物
 探索   2023-09-06
印度或要将国名改为“巴拉特”
 百态   2023-09-06
男子为女友送行,买票不登机被捕
 百态   2023-08-20
手机地震预警功能怎么开?
 干货   2023-08-06
女子4年卖2套房花700多万做美容:不但没变美脸,面部还出现变形
 百态   2023-08-04
住户一楼被水淹 还冲来8头猪
 百态   2023-07-31
女子体内爬出大量瓜子状活虫
 百态   2023-07-25
地球连续35年收到神秘规律性信号,网友:不要回答!
 探索   2023-07-21
全球镓价格本周大涨27%
 探索   2023-07-09
钱都流向了那些不缺钱的人,苦都留给了能吃苦的人
 探索   2023-07-02
倩女手游刀客魅者强控制(强混乱强眩晕强睡眠)和对应控制抗性的关系
 百态   2020-08-20
美国5月9日最新疫情:美国确诊人数突破131万
 百态   2020-05-09
荷兰政府宣布将集体辞职
 干货   2020-04-30
倩女幽魂手游师徒任务情义春秋猜成语答案逍遥观:鹏程万里
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案神机营:射石饮羽
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案昆仑山:拔刀相助
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案天工阁:鬼斧神工
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案丝路古道:单枪匹马
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:与虎谋皮
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:李代桃僵
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案镇郊荒野:指鹿为马
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案金陵:小鸟依人
 干货   2019-11-12
倩女幽魂手游师徒任务情义春秋猜成语答案金陵:千金买邻
 干货   2019-11-12
 
推荐阅读
 
 
 
>>返回首頁<<
 
靜靜地坐在廢墟上,四周的荒凉一望無際,忽然覺得,淒涼也很美
© 2005- 王朝網路 版權所有