当前位置: 首页>>代码示例>>Python>>正文


Python HashSet.contains方法代码示例

本文整理汇总了Python中java.util.HashSet.contains方法的典型用法代码示例。如果您正苦于以下问题:Python HashSet.contains方法的具体用法?Python HashSet.contains怎么用?Python HashSet.contains使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在java.util.HashSet的用法示例。


在下文中一共展示了HashSet.contains方法的13个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Python代码示例。

示例1: findMessages

# 需要导入模块: from java.util import HashSet [as 别名]
# 或者: from java.util.HashSet import contains [as 别名]
def findMessages(mc,custid,count):
    print 'findMessages() find ',count
    amsm = mc.getActiveMailboxStoreManager()
    ids = HashSet()
    msgs = HashSet()
    retries = 30
    while msgs.size() < count and retries > 0:
        for p in mc.getPartitionManager().listPartitions():
            if p.isReadOnly():
                continue
            print 'searching for messages to be stored in',p
            tm = amsm.findMessages([SearchConstraint(IActiveMailboxStoreManager.PROP_CUST_ID, SearchConstraintOperator.CONSTRAINT_EQUALS,int(custid))],p)
            if tm.size() > 0:
                msgs.addAll(filter(lambda x : not ids.contains(x.getMessageId()),tm))
                ids.addAll(map(lambda x : x.getMessageId(), tm))

        if msgs.size() < count:
            time.sleep(10)
        retries = retries - 1

        print 'findMessages found',msgs.size(),'ids',ids.size()

    if msgs.isEmpty():
        print 'Failed to find any messages in DB'
        raise Exception('Failed to find any messages in DB')

    if msgs.size() < count:
        print 'Warning, did not find all messages expected'

    return msgs
开发者ID:piyush76,项目名称:EMS,代码行数:32,代码来源:testUtils.py

示例2: getNodeObjects

# 需要导入模块: from java.util import HashSet [as 别名]
# 或者: from java.util.HashSet import contains [as 别名]
def getNodeObjects(api, filters):
	found = 0
	ndMap = {}
	ndSet = HashSet()
	lanSwitchCapability = "com.hp.nnm.capability.node.lanswitching"
	ipForwardingCapability = "com.hp.nnm.capability.node.ipforwarding"

	try:
		ndStub = api.getStub(NnmServicesEnum().Node)
		for filter in filters:
			allNodesArray = ndStub.getNodes(filter)
			allNodes = allNodesArray.getItem()
			if allNodes != None:
				found = 1
				logger.debug("Retrieved %s Node Objects" % (len(allNodes)))
				for i in range(len(allNodes)):
					if (notNull(allNodes[i].getId())
							and notNull(allNodes[i].getName())
							and notNull(allNodes[i].getCreated()) and notNull(allNodes[i].getModified())):
						## Don't add duplicate Nodes
						if ndSet.contains(allNodes[i].getId()):
							continue
						else:
							ndSet.add(allNodes[i].getId())

							# The capabilities com.hp.nnm.capability.node.lanswitching and
							# com.hp.nnm.capability.node.ipforwarding have replaced isLanSwitch and isIPv4Router respectively.
							isLanSwitch = 0
							isRouter = 0
							caps = allNodes[i].getCapabilities()
							if (notNull(caps)):
								for cap in caps:
									key = cap.getKey().strip()
									if (key == lanSwitchCapability):
										isLanSwitch = 1
									if (key == ipForwardingCapability):
										isRouter = 1

							ndMap[allNodes[i].getId()] = UNode(allNodes[i].getId(), allNodes[i].getName(), isRouter,
												isLanSwitch, allNodes[i].getSystemName(), allNodes[i].getSystemContact(),
												allNodes[i].getSystemDescription(), allNodes[i].getSystemLocation(), allNodes[i].getSystemObjectId(),
												allNodes[i].getLongName(), allNodes[i].getSnmpVersion(), allNodes[i].getDeviceModel(),
												allNodes[i].getDeviceVendor(), allNodes[i].getDeviceFamily(), allNodes[i].getDeviceDescription(),
												allNodes[i].getDeviceCategory(), '', '')
			else:
				break
	except:
		stacktrace = traceback.format_exception(sys.exc_info()[0], sys.exc_info()[1], sys.exc_info()[2])
		errMsg = 'Exception:\n %s' % stacktrace
		logger.error(errMsg)
		api.Framework.reportWarning(errMsg)
	if found:
		logger.debug('Created a dictionary of %d Node objects' % (len(ndMap)))
	else:
		errMsg = 'Did not find any Node objects'
		logger.debug(errMsg)
		api.Framework.reportWarning(errMsg)

	return ndMap
开发者ID:ddonnelly19,项目名称:dd-git,代码行数:61,代码来源:NNM_Integration_Utils.py

示例3: sliceSpaces

# 需要导入模块: from java.util import HashSet [as 别名]
# 或者: from java.util.HashSet import contains [as 别名]
 def sliceSpaces( spaces):
     checked = HashSet()
     slices = []
     for i, space in enumerate(spaces):
         if not checked.contains(space):
             current = MeshMaker.createNewVerticalSlice(spaces, i)
             checked.addAll(current.tiles)
             slices.append(current)
     return slices
开发者ID:beltsonata,项目名称:PyPyPy,代码行数:11,代码来源:topography.py

示例4: test_HashSet

# 需要导入模块: from java.util import HashSet [as 别名]
# 或者: from java.util.HashSet import contains [as 别名]
 def test_HashSet(self):
     """create HashSet in JVM (from the JavaSet)
     """
     hashSet = HashSet(self.javaSet)
     # print "created HashSet:", hashSet, type(hashSet)
     self.assertEqual(self.javaSet.size(),
                      hashSet.size(),
                      "HashSet has same size")
     elem0 = list(self.testSet)[0]
     self.assertTrue(hashSet.contains(elem0))
开发者ID:svn2github,项目名称:pylucene,代码行数:12,代码来源:test_Collections.py

示例5: lopUselessLeaves

# 需要导入模块: from java.util import HashSet [as 别名]
# 或者: from java.util.HashSet import contains [as 别名]
 def lopUselessLeaves(cls, pn):
     """ generated source for method lopUselessLeaves """
     usefulComponents = HashSet()
     toAdd = Stack()
     toAdd.add(pn.getTerminalProposition())
     usefulComponents.add(pn.getInitProposition())
     for goalProps in pn.getGoalPropositions().values():
         toAdd.addAll(goalProps)
     for legalProps in pn.getLegalPropositions().values():
         toAdd.addAll(legalProps)
     while not toAdd.isEmpty():
         if usefulComponents.contains(curComp):
             continue 
         usefulComponents.add(curComp)
         toAdd.addAll(curComp.getInputs())
     allComponents = ArrayList(pn.getComponents())
     for c in allComponents:
         if not usefulComponents.contains(c):
             pn.removeComponent(c)
开发者ID:hobson,项目名称:ggpy,代码行数:21,代码来源:OptimizingPropNetFactory.py

示例6: getProducibleVars

# 需要导入模块: from java.util import HashSet [as 别名]
# 或者: from java.util.HashSet import contains [as 别名]
 def getProducibleVars(self, sentence):
     """ generated source for method getProducibleVars """
     if not self.form.matches(sentence):
         raise RuntimeException("Sentence " + sentence + " does not match constant form")
     tuple_ = GdlUtils.getTupleFromSentence(sentence)
     candidateVars = HashSet()
     # Variables that appear multiple times go into multipleVars
     multipleVars = HashSet()
     # ...which, of course, means we have to spot non-candidate vars
     nonCandidateVars = HashSet()
     i = 0
     while i < len(tuple_):
         if isinstance(term, (GdlVariable,)) and not multipleVars.contains(term):
             if candidateVars.contains(var) or nonCandidateVars.contains(var):
                 multipleVars.add(var)
                 candidateVars.remove(var)
             elif self.dependentSlots.get(i):
                 candidateVars.add(var)
             else:
                 nonCandidateVars.add(var)
         i += 1
     return candidateVars
开发者ID:hobson,项目名称:ggpy,代码行数:24,代码来源:FunctionInfoImpl.py

示例7: getTopologicalOrdering

# 需要导入模块: from java.util import HashSet [as 别名]
# 或者: from java.util.HashSet import contains [as 别名]
 def getTopologicalOrdering(cls, forms, dependencyGraph, usingBase, usingInput):
     """ generated source for method getTopologicalOrdering """
     queue = LinkedList(forms)
     ordering = ArrayList(len(forms))
     alreadyOrdered = HashSet()
     while not queue.isEmpty():
         for dependency in dependencyGraph.get(curForm):
             if not dependency == curForm and not alreadyOrdered.contains(dependency):
                 readyToAdd = False
                 break
         if usingBase and (curForm.__name__ == cls.TRUE or curForm.__name__ == cls.NEXT or curForm.__name__ == cls.INIT):
             if not alreadyOrdered.contains(baseForm):
                 readyToAdd = False
         if usingInput and (curForm.__name__ == cls.DOES or curForm.__name__ == cls.LEGAL):
             if not alreadyOrdered.contains(inputForm):
                 readyToAdd = False
         if readyToAdd:
             ordering.add(curForm)
             alreadyOrdered.add(curForm)
         else:
             queue.add(curForm)
         ConcurrencyUtils.checkForInterruption()
     return ordering
开发者ID:hobson,项目名称:ggpy,代码行数:25,代码来源:OptimizingPropNetFactory.py

示例8: updateDomains

# 需要导入模块: from java.util import HashSet [as 别名]
# 或者: from java.util.HashSet import contains [as 别名]
 def updateDomains(self):
     """ generated source for method updateDomains """
     changedSomething = True
     itrNum = 0
     lastUpdatedDomains = HashSet(self.domains.values())
     while changedSomething:
         GamerLogger.log("StateMachine", "Beginning domain finding iteration: " + itrNum)
         changedSomething = False
         for d in domains.values():
             for ruleRef in d.ruleRefs:
                 for c in ruleRef.conditions:
                     if lastUpdatedDomains.contains(c.dom):
                         containsUpdatedDomain = True
                         break
                 if not containsUpdatedDomain:
                     continue 
                 rulesConsidered += 1
                 for instantiation in instantiations:
                     for t in ruleRef.productionTemplate:
                         if isinstance(t, (GdlConstant, )):
                             a.add(t)
                         else:
                             a.add(instantiation.get(var))
                     if not d.assignments.contains(a):
                         currUpdatedDomains.add(d)
                         d.assignments.add(a)
                         changedSomething = True
                         d.addAssignmentToIndex(a)
                 if len(instantiations) == 0:
                     findSatisfyingInstantiations(ruleRef)
                     for t in ruleRef.productionTemplate:
                         if isinstance(t, (GdlConstant, )):
                             a.add(t)
                         else:
                             isVar = True
                             break
                     if not isVar and not d.assignments.contains(a):
                         currUpdatedDomains.add(d)
                         d.assignments.add(a)
                         changedSomething = True
                         d.addAssignmentToIndex(a)
         itrNum += 1
         lastUpdatedDomains = currUpdatedDomains
         GamerLogger.log("StateMachine", "\tDone with iteration.  Considered " + rulesConsidered + " rules.")
开发者ID:hobson,项目名称:ggpy,代码行数:46,代码来源:PropNetFlattener.py

示例9: getIPAddressObjects

# 需要导入模块: from java.util import HashSet [as 别名]
# 或者: from java.util.HashSet import contains [as 别名]
def getIPAddressObjects(api, filters):
	found = 0
	ipMap = {}
	ipSet = HashSet()
	try:
		ipStub = api.getStub(NnmServicesEnum().IPAddress)
		for filter in filters:
			allIpsArray = ipStub.getIPAddresses(filter)
			allIps = allIpsArray.getItem()
			if allIps != None:
				found = 1
				logger.debug("Retrieved %s IPAddress Objects" % (len(allIps)))
				for i in range(len(allIps)):
					if (notNull(allIps[i].getId())
							and notNull(allIps[i].getHostedOnId())
							and notNull(allIps[i].getIpValue())
							and notNull(allIps[i].getCreated()) and notNull(allIps[i].getModified())):
						## Don't add duplicate IPs
						if ipSet.contains(allIps[i].getId()):
							logger.debug("########Found duplicate IP" + allIps[i].getIpValue())
							continue
						else:
							ipSet.add(allIps[i].getId())
							ipMap[allIps[i].getId()] = UIp(allIps[i].getId(), allIps[i].getHostedOnId(), allIps[i].getIpSubnetId(),
												allIps[i].getInInterfaceId(), allIps[i].getIpValue(), allIps[i].getPrefixLength(),
												allIps[i].getCreated(), allIps[i].getModified())
			else:
				break
	except:
		stacktrace = traceback.format_exception(sys.exc_info()[0], sys.exc_info()[1], sys.exc_info()[2])
		errMsg = 'Exception:\n %s' % stacktrace
		logger.error(errMsg)
		api.Framework.reportError(errMsg)
	if found:
		logger.debug('Created a dictionary of %d IPAddress objects' % (len(ipMap)))
	else:
		errMsg = 'Did not find any IPAddress objects'
		logger.debug(errMsg)
		api.Framework.reportError(errMsg)

	return ipMap
开发者ID:ddonnelly19,项目名称:dd-git,代码行数:43,代码来源:NNM_Integration_Utils.py

示例10: getTopologicalOrdering

# 需要导入模块: from java.util import HashSet [as 别名]
# 或者: from java.util.HashSet import contains [as 别名]
 def getTopologicalOrdering(cls, forms, dependencyGraph):
     """ generated source for method getTopologicalOrdering """
     # We want each form as a key of the dependency graph to
     # follow all the forms in the dependency graph, except maybe itself
     queue = LinkedList(forms)
     ordering = ArrayList(len(forms))
     alreadyOrdered = HashSet()
     while not queue.isEmpty():
         # Don't add if there are dependencies
         for dependency in dependencyGraph.get(curForm):
             if not dependency == curForm and not alreadyOrdered.contains(dependency):
                 readyToAdd = False
                 break
         # Add it
         if readyToAdd:
             ordering.add(curForm)
             alreadyOrdered.add(curForm)
         else:
             queue.add(curForm)
         # TODO: Add check for an infinite loop here
         # Or replace with code that does stratification of loops
     return ordering
开发者ID:hobson,项目名称:ggpy,代码行数:24,代码来源:GameFlow.py

示例11: asSequence

# 需要导入模块: from java.util import HashSet [as 别名]
# 或者: from java.util.HashSet import contains [as 别名]
def asSequence(nds):
  """ Take a list of nodes that are known to define a branch and return a list of nodes sorted by parent-child. """
  if 1 == len(nds) or 2 == len(nds):
    return nds  
  ends = []
  nds = HashSet(nds)
  for nd in nds:
    children = nd.getChildren().keySet()
    children.retainAll(nds)
    # If the parent is in the set,
    if nds.contains(nd.parent):
      # ... and does not have children in the set
      if 0 == children.size():
        # Then it's an end
        ends.append(nd)
    # Else if the parent is not in the set
    else:
      # ... but it has at least one child in the set
      if 1 == children.size():
        # then it's an end
        ends.append(nd)
  #print "ends:", len(ends)
  #print ends
  return Node.findPath(ends[0], ends[1])
开发者ID:Xeonus,项目名称:SemesterProject,代码行数:26,代码来源:getBackbone.py

示例12: and

# 需要导入模块: from java.util import HashSet [as 别名]
# 或者: from java.util.HashSet import contains [as 别名]

#.........这里部分代码省略.........
                cmdline = rs.getString('cmdline')
                path = rs.getString('path')
                params = rs.getString('params')
                owner = rs.getString('owner')
                startuptime = rs.getLong('startuptime')
                process = Process(hostid, pid, name, cmdline, path, params, owner, startuptime)
                self.processMap[process.getMapKey()] = process
            logger.debug(len(self.processMap), ' processes loaded.')
        finally:
            if rs:
                try:
                    rs.close()
                except:
                    pass
            self.conn.close(st)

    def getPreparedStatement(self, sql):
        st = self.conn.prepareStatement(sql)
        st.setString(1, self.hostID)
        st.setBoolean(2, not self.shouldIgnoreLocal)
        return st

    def getProcess(self, hostid, pid):
        """
        @type hostid :str
        @type pid    :int
        @rtype Process
        """
        if hostid and pid:
            return self.processMap.get(Process.buildMapKey(hostid, pid))

    def buildTcpConnTopology(self, rs, client, server):
        serverPortNum = rs.getInt(server + 'Port')
        if (self.requestedServices != None) and (not self.requestedServices.contains(serverPortNum)):
            return
        [_, serverProc] = self.createHostAndProc(rs, server)
        [clientHost, clientProc] = self.createHostAndProc(rs, client)

        #if not process involved in this tcp connection (hosts not support p2p or are unrichable)
        #we don't report connections between these hosts
        if (clientHost is None) or ((serverProc is None) and (clientProc is None)):
            return

        [serverPort, portName, prot] = self.createServerAddressOsh(rs, server)
        if prot == modeling.TCP_PROTOCOL:
            serviceType = 'TCP'
        else:
            serviceType = 'UDP'

        link = None
        if clientProc is not None and serverPort is not None:
            link = modeling.createLinkOSH('client_server', clientProc, serverPort)
        elif clientHost is not None and serverPort is not None:
            link = modeling.createLinkOSH('client_server', clientHost, serverPort)
        if not link:
            return
        link.setAttribute('clientserver_protocol',serviceType)
        if portName is not None:
            link.setAttribute('data_name', portName)
        link.setLongAttribute('clientserver_destport', serverPortNum)
        self.Framework.sendObject(serverPort)
        if clientProc is not None:
            self.Framework.sendObject(clientProc)
        self.Framework.sendObject(link)

        #server process and its link are interesting only if we have client connected to its server port
开发者ID:ddonnelly19,项目名称:dd-git,代码行数:70,代码来源:process_to_process.py

示例13: HashSet

# 需要导入模块: from java.util import HashSet [as 别名]
# 或者: from java.util.HashSet import contains [as 别名]
# find out which partitions are purging
cmd = "ls -alt /ems/shared/purge/*/*.log | awk {' print $9 }'"

pids = HashSet()
for line in os.popen(cmd):
    line = line.strip()
    if line.startswith("/ems/shared/purge/") and line.endswith(".log"):
        pid = int(line[len("/ems/shared/purge/"):line.rfind('/')])
        pids.add(pid)

purging = []
nonPurging = []
for p in pList:
    if ( p.getStorageType() == IStorageLocationManager.STORAGE_TYPE_DX ):
        continue
    if ( pids.contains(p.getId()) ):
        purging.append(p)
    else:
        nonPurging.append(p)

conn = mc.getDBConnection(ManagementContainer.AM_POOL_NAME)
needsRollback = True

try:
    # for each purging partition, set to 100%
    for p in purging:
        needsRollback = True
        if ( p.getMinFreePercent() != 100 ):
            p.setMinFreePercent(100)
            pMgr.updatePartition(p,conn)
            conn.commit()
开发者ID:piyush76,项目名称:EMS,代码行数:33,代码来源:partition_headroom.py


注:本文中的java.util.HashSet.contains方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。