电话中心管理软件代码Word格式.docx
- 文档编号:21382657
- 上传时间:2023-01-30
- 格式:DOCX
- 页数:85
- 大小:33.30KB
电话中心管理软件代码Word格式.docx
《电话中心管理软件代码Word格式.docx》由会员分享,可在线阅读,更多相关《电话中心管理软件代码Word格式.docx(85页珍藏版)》请在冰豆网上搜索。
Attributesattributes;
StringbaseUri;
intsiblingIndex;
protectedNode(StringbaseUri,Attributesattributes)
{
Validate.notNull(baseUri);
Validate.notNull(attributes);
this.childNodes=EMPTY_NODES;
this.baseUri=baseUri.trim();
this.attributes=attributes;
}
protectedNode(StringbaseUri){
this(baseUri,newAttributes());
protectedNode()
this.attributes=null;
publicabstractStringnodeName();
publicStringattr(StringattributeKey)
Validate.notNull(attributeKey);
if(this.attributes.hasKey(attributeKey))
returnthis.attributes.get(attributeKey);
if(attributeKey.toLower().startsWith("
abs:
"
))
returnabsUrl(attributeKey.substring("
.length()));
return"
;
publicAttributesattributes()
returnthis.attributes;
publicNodeattr(StringattributeKey,StringattributeValue)
this.attributes.put(attributeKey,attributeValue);
returnthis;
publicbooleanhasAttr(StringattributeKey)
if(attributeKey.startsWith("
)){
Stringkey=attributeKey.substring("
.length());
if((this.attributes.hasKey(key))&
&
(!
absUrl(key).equals("
)))
returntrue;
returnthis.attributes.hasKey(attributeKey);
publicNoderemoveAttr(StringattributeKey)
this.attributes.remove(attributeKey);
publicStringbaseUri()
returnthis.baseUri;
publicvoidsetBaseUri(finalStringbaseUri)
traverse(newNodeVisitor(){
publicvoidhead(Nodenode,intdepth){
node.baseUri=baseUri;
publicvoidtail(Nodenode,intdepth)
});
publicStringabsUrl(StringattributeKey)
Validate.notEmpty(attributeKey);
if(!
hasAttr(attributeKey)){
returnStringUtil.resolve(this.baseUri,attr(attributeKey));
publicNodechildNode(intindex)
return(Node)this.childNodes.get(index);
publicList<
childNodes()
returnCollections.unmodifiableList(this.childNodes);
childNodesCopy()
Listchildren=newArrayList(this.childNodes.size());
for(Nodenode:
this.childNodes){
children.add(node.clone());
returnchildren;
publicfinalintchildNodeSize()
returnthis.childNodes.size();
protectedNode[]childNodesAsArray(){
return(Node[])this.childNodes.toArray(newNode[childNodeSize()]);
publicNodeparent()
returnthis.parentNode;
publicfinalNodeparentNode()
publicDocumentownerDocument()
if((thisinstanceofDocument))
return(Document)this;
if(this.parentNode==null){
returnnull;
returnthis.parentNode.ownerDocument();
publicvoidremove()
Validate.notNull(this.parentNode);
this.parentNode.removeChild(this);
publicNodebefore(Stringhtml)
addSiblingHtml(this.siblingIndex,html);
publicNodebefore(Nodenode)
Validate.notNull(node);
this.parentNode.addChildren(this.siblingIndex,newNode[]{node});
publicNodeafter(Stringhtml)
addSiblingHtml(this.siblingIndex+1,html);
publicNodeafter(Nodenode)
this.parentNode.addChildren(this.siblingIndex+1,newNode[]{node});
privatevoidaddSiblingHtml(intindex,Stringhtml){
Validate.notNull(html);
Elementcontext=(parent()instanceofElement)?
(Element)parent():
null;
Listnodes=Parser.parseFragment(html,context,baseUri());
this.parentNode.addChildren(index,(Node[])nodes.toArray(newNode[nodes.size()]));
publicNodewrap(Stringhtml)
Validate.notEmpty(html);
ListwrapChildren=Parser.parseFragment(html,context,baseUri());
NodewrapNode=(Node)wrapChildren.get(0);
if((wrapNode==null)||(!
(wrapNodeinstanceofElement))){
Elementwrap=(Element)wrapNode;
Elementdeepest=getDeepChild(wrap);
this.parentNode.replaceChild(this,wrap);
deepest.addChildren(newNode[]{this});
if(wrapChildren.size()>
0){
for(inti=0;
i<
wrapChildren.size();
i++){
Noderemainder=(Node)wrapChildren.get(i);
remainder.parentNode.removeChild(remainder);
wrap.appendChild(remainder);
publicNodeunwrap()
NodefirstChild=this.childNodes.size()>
0?
(Node)this.childNodes.get(0):
this.parentNode.addChildren(this.siblingIndex,childNodesAsArray());
remove();
returnfirstChild;
privateElementgetDeepChild(Elementel){
Listchildren=el.children();
if(children.size()>
returngetDeepChild((Element)children.get(0));
returnel;
publicvoidreplaceWith(Nodein)
Validate.notNull(in);
this.parentNode.replaceChild(this,in);
protectedvoidsetParentNode(NodeparentNode){
if(this.parentNode!
=null)
this.parentNode=parentNode;
protectedvoidreplaceChild(Nodeout,Nodein){
Validate.isTrue(out.parentNode==this);
if(in.parentNode!
=null){
in.parentNode.removeChild(in);
intindex=out.siblingIndex;
this.childNodes.set(index,in);
in.parentNode=this;
in.setSiblingIndex(index);
out.parentNode=null;
protectedvoidremoveChild(Nodeout){
this.childNodes.remove(index);
reindexChildren(index);
protectedvoidaddChildren(Node[]children)
for(Nodechild:
children){
reparentChild(child);
ensureChildNodes();
this.childNodes.add(child);
child.setSiblingIndex(this.childNodes.size()-1);
protectedvoidaddChildren(intindex,Node[]children){
Validate.noNullElements(children);
for(inti=children.length-1;
i>
=0;
i--){
Nodein=children[i];
reparentChild(in);
this.childNodes.add(index,in);
protectedvoidensureChildNodes(){
if(this.childNodes==EMPTY_NODES)
this.childNodes=newArrayList(4);
protectedvoidreparentChild(Nodechild)
if(child.parentNode!
child.parentNode.removeChild(child);
child.setParentNode(this);
privatevoidreindexChildren(intstart){
for(inti=start;
this.childNodes.size();
i++)
((Node)this.childNodes.get(i)).setSiblingIndex(i);
siblingNodes()
returnCollections.emptyList();
Listnodes=this.parentNode.childNodes;
Listsiblings=newArrayList(nodes.size()-1);
nodes)
if(node!
=this)
siblings.add(node);
returnsiblings;
publicNodenextSibling()
Listsiblings=this.parentNode.childNodes;
intindex=this.siblingIndex+1;
if(siblings.size()>
index){
return(Node)siblings.get(index);
publicNodepreviousSibling()
if(this.siblingIndex>
return(Node)this.parentNode.childNodes.get(this.siblingIndex-1);
publicintsiblingIndex()
returnthis.siblingIndex;
protectedvoidsetSiblingIndex(intsiblingIndex){
this.siblingIndex=siblingIndex;
publicNodetraverse(NodeVisitornodeVisitor)
Validate.notNull(nodeVisitor);
NodeTraversortraversor=newNodeTraversor(nodeVisitor);
traversor.traverse(this);
publicStringouterHtml()
StringBuilderaccum=newStringBuilder(128);
outerHtml(accum);
returnaccum.toString();
protectedvoidouterHtml(StringBuilderaccum){
newNodeTraversor(newOuterHtmlVisitor(accum,getOutputSettings())).traverse(this);
Document.OutputSettingsgetOutputSettings()
returnownerDocument()!
=null?
ownerDocument().outputSettings():
newDocument("
).outputSettings();
abstractvoidouterHtmlHead(StringBuilderparamStringBuilder,intparamInt,Document.OutputSettingsparamOutputSettings);
abstractvoidouterHtmlTail(StringBuilderparamStringBuilder,intparamInt,Document.OutputSettingsparamOutputSettings);
publicStringtoString()
returnouterHtml();
protectedvoidindent(StringBuilderaccum,intdepth,Document.OutputSettingsout){
accum.append("
\n"
).append(StringUtil.padding(depth*out.indentAmount()));
publicbooleanequals(Objecto)
if(this==o)returntrue;
if((o==null)||(getClass()!
=o.getClass()))returnfalse;
Nodenode=(Node)o;
if(this.childNodes!
!
this.childNodes.equals(node.childNodes):
node.childNodes!
=null)returnfalse;
returnthis.attributes!
this.attributes.equals(node.attributes):
node.attribut
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 电话 中心 管理软件 代码
![提示](https://static.bdocx.com/images/bang_tan.gif)