📄 deliveryorderdatabase.java
字号:
// Copyright 2002 Nokia Corporation.
//
// THIS SOURCE CODE IS PROVIDED 'AS IS', WITH NO WARRANTIES WHATSOEVER,
// EXPRESS OR IMPLIED, INCLUDING ANY WARRANTY OF MERCHANTABILITY, FITNESS
// FOR ANY PARTICULAR PURPOSE, OR ARISING FROM A COURSE OF DEALING, USAGE
// OR TRADE PRACTICE, RELATING TO THE SOURCE CODE OR ANY WARRANTY OTHERWISE
// ARISING OUT OF ANY PROPOSAL, SPECIFICATION, OR SAMPLE AND WITH NO
// OBLIGATION OF NOKIA TO PROVIDE THE LICENSEE WITH ANY MAINTENANCE OR
// SUPPORT. FURTHERMORE, NOKIA MAKES NO WARRANTY THAT EXERCISE OF THE
// RIGHTS GRANTED HEREUNDER DOES NOT INFRINGE OR MAY NOT CAUSE INFRINGEMENT
// OF ANY PATENT OR OTHER INTELLECTUAL PROPERTY RIGHTS OWNED OR CONTROLLED
// BY THIRD PARTIES
//
// Furthermore, information provided in this source code is preliminary,
// and may be changed substantially prior to final release. Nokia Corporation
// retains the right to make changes to this source code at
// any time, without notice. This source code is provided for informational
// purposes only.
//
// Nokia and Nokia Connecting People are registered trademarks of Nokia
// Corporation.
// Java and all Java-based marks are trademarks or registered trademarks of
// Sun Microsystems, Inc.
// Other product and company names mentioned herein may be trademarks or
// trade names of their respective owners.
//
// A non-exclusive, non-transferable, worldwide, limited license is hereby
// granted to the Licensee to download, print, reproduce and modify the
// source code. The licensee has the right to market, sell, distribute and
// make available the source code in original or modified form only when
// incorporated into the programs developed by the Licensee. No other
// license, express or implied, by estoppel or otherwise, to any other
// intellectual property rights is granted herein.
package example.delivery;
import java.util.*;
public class DeliveryOrderDatabase
{
private Map deliveryOrders = null;
private Random random;
public DeliveryOrderDatabase()
{
random = new Random();
// A TreeMap guarantees ascending ordering by the key.
// That's useful since DeliveryOrders should be processed
// in a time ordered manner. (A List could also be used.)
//
// The TreeMap class's implementation is not synchronized.
// It should be externally synchronized. The following is sufficient
// for this prototype, but note that "ConcurrentModificationException"
// notifications are never caught in this prototype. A more robust
// implementation would be needed for an implementation that
// scales to N potential users concurrently adding/deleting elements,
// but a more robust implementation would likely use a real database
// instead anyways.
//
deliveryOrders = Collections.synchronizedMap(new TreeMap());
}
public DeliveryOrder createDeliveryOrder(String description,
String senderAddress,
String recipientAddress,
String note)
{
String id = createDeliveryOrderId();
Date openedTime = new Date();
DeliveryOrder deliveryOrder =
new DeliveryOrder(
id,
DeliveryOrder.OPENED,
openedTime.toString(),
description,
senderAddress,
recipientAddress,
note
);
deliveryOrders.put(id, deliveryOrder);
return deliveryOrder;
}
private String createDeliveryOrderId()
{
Date current = new Date();
int num = random.nextInt();
if (num < 0)
{
num = -num;
}
return("" + current.getTime() + "_" + num);
}
// Return null if none found, else return DeliveryOrder
// assigned to courier.
protected synchronized DeliveryOrder getDeliveryJob(String courierName)
{
DeliveryOrder assignment = null; // default: no assignment to give
assignment = getExistingJob(courierName);
if (assignment == null)
{
assignment = getNewJob(courierName);
}
return assignment;
}
protected synchronized DeliveryOrder getExistingJob(String courierName)
{
Set keySet = deliveryOrders.keySet();
if (!keySet.isEmpty() && (courierName != null))
{
Iterator iterator = keySet.iterator();
while (iterator.hasNext())
{
String id = (String)iterator.next();
DeliveryOrder req = (DeliveryOrder)deliveryOrders.get(id);
if (req != null)
{
String name = req.getCourierName();
String status = req.getStatus();
if ((name!=null) &&
(CourierDatabase.canonicalForm(name).equals(
CourierDatabase.canonicalForm(courierName))))
{
if (status.equals(DeliveryOrder.ASSIGNED) ||
status.equals(DeliveryOrder.PICKEDUP) ||
status.equals(DeliveryOrder.COURIERCANCELLED))
{
return req;
}
}
}
}
}
return null; // no existing assignment found for this courier
}
protected synchronized DeliveryOrder getNewJob(String courierName)
{
Set keySet = deliveryOrders.keySet();
if (!keySet.isEmpty() && (courierName != null))
{
Iterator iterator = keySet.iterator();
while (iterator.hasNext())
{
String id = (String)iterator.next();
DeliveryOrder req = (DeliveryOrder)deliveryOrders.get(id);
if (req != null)
{
String status = req.getStatus();
if (status.equals(DeliveryOrder.OPENED))
{
// assign an OPENED request to a courier
req.setStatus(DeliveryOrder.ASSIGNED);
req.setCourierName(courierName);
deliveryOrders.remove(req.getId());
deliveryOrders.put(req.getId(), req);
return req;
}
}
}
}
return null; // no 'OPENED' assignments available
}
public void deleteDeliveryOrder(DeliveryOrder deliveryOrder)
{
deliveryOrders.remove(deliveryOrder.getId());
}
public DeliveryOrder getDeliveryOrder(String id)
{
return (DeliveryOrder)(deliveryOrders.get(id));
}
public Collection getAllDeliveryOrders()
{
return deliveryOrders.values();
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -