-110:\n # tryAgain = True\n\n # if not tryAgain:\n # count number of neighbors with sufficient RSSI\n for cm in connectedMotes:\n\n rssi = self._computeRSSI(mote, cm)\n mote.setRSSI(cm, rssi)\n cm.setRSSI(mote, rssi)\n\n # save the intial RSSI values for future use in the mobility models\n mote.initialRSSI[cm] = rssi\n cm.initialRSSI[mote] = rssi\n\n if self.settings.individualModulations == 1:\n if self.rssiToPdr(rssi, modulation=Modulation.Modulation().minimalCellModulation[SimSettings.SimSettings().modulationConfig]) > self.settings.stableNeighborPDR:\n # if rssi > Modulation.Modulation().modulationStableRSSI[Modulation.Modulation().minimalCellModulation[SimSettings.SimSettings().modulationConfig]]:\n # print rssi\n numStableNeighbors += 1\n stableNeighbors.append(cm.id)\n else:\n if rssi > self.STABLE_RSSI:\n # print rssi\n numStableNeighbors += 1\n\n # make sure it is connected to at least STABLE_NEIGHBORS motes\n # or connected to all the currently deployed motes when the number of deployed motes\n # are smaller than STABLE_NEIGHBORS\n if numStableNeighbors >= self.stable_neighbors or numStableNeighbors == len(connectedMotes):\n print 'For mote {0}, stable neighbors {1}'.format(mote.id, stableNeighbors)\n connected = True\n\n connectedMotes += [mote]\n\n # for each mote, compute PDR to each neighbors\n for mote in self.motes:\n for m in self.motes:\n if mote == m:\n continue\n\n # set the distance to all other motes\n distance = math.sqrt((m.x - mote.x) ** 2 + (m.y - mote.y) ** 2)\n m.set_distance(mote, distance)\n mote.set_distance(m, distance)\n # print 'mote %d to mote %d: %.4f' % (m.id, mote.id, distance)\n if self.settings.individualModulations == 1:\n rssi_value = mote.getRSSI(m)\n # for modulationTmp in Modulation.Modulation().modulations:\n # if self.settings.ilpfile is not None:\n # ## I am not going to set this as this should be set by the ILP\n # pass\n # else:\n # # if the rssi value is higher than the minimal signal value required for this neighbor, take that modulation\n # # and compute the PDR using that modulation\n # pass\n # # if rssi_value > Modulation.Modulation().modulationStableRSSI[modulationTmp]:\n # # pdr = self._computePDR(mote, m, modulation=modulationTmp)\n # # mote.setPDR(m, pdr)\n # # m.setPDR(mote, pdr)\n # # mote.setModulation(m, modulationTmp)\n # # m.setModulation(mote, modulationTmp)\n else:\n if mote.getRSSI(m) > mote.minRssi:\n pdr = self._computePDR(mote, m)\n mote.setPDR(m, pdr)\n m.setPDR(mote, pdr)","def getPeer(self):\n return \"Peer:PID:\" + str(self.transport.pid)","def topology(self):\n try:\n return self._topology\n except AttributeError:\n # If none exists, we need to create it\n pass\n # Cache the topology for easy returning later\n self._topology = topology = Topology()\n\n last_chain = None\n last_residue = None\n # Add each chain (separate 'system's) and residue\n for atom in self.atom_list:\n resid = '%d%s' % (atom.residue.idx, atom.residue.inscode)\n if atom.system != last_chain:\n chain = topology.addChain(atom.system)\n last_chain = atom.system\n last_residue = None\n if resid != last_residue:\n last_residue = resid\n residue = topology.addResidue(atom.residue.resname, chain, str(atom.residue.idx), atom.residue.inscode)\n if atom.type is not None and atom.type.atomic_number != 0:\n # This is the most reliable way of determining the element\n elem = element.Element.getByAtomicNumber(atom.type.atomic_number)\n else:\n # Figure it out from the mass\n elem = element.Element.getByMass(atom.mass)\n topology.addAtom(atom.name, elem, residue)\n\n # Add all of the bonds\n atoms = list(topology.atoms())\n # Assign atom indexes to make sure they're current\n self.atom_list.assign_indexes()\n for bond in self.bond_list:\n topology.addBond(atoms[bond.atom1.idx], atoms[bond.atom2.idx])\n\n # Add the periodic box if there is one\n if self.box_vectors is not None:\n topology.setUnitCellDimensions(self.boxLengths)\n\n return topology","def main_device(self):\n return self._main_device","def transportprotocol(self) :\n\t\ttry :\n\t\t\treturn self._transportprotocol\n\t\texcept Exception as e:\n\t\t\traise e","def protocol(self) -> pulumi.Output[Optional[str]]:\n return pulumi.get(self, \"protocol\")","def protocol(self) -> str:\n return self.__parameters.protocol","def socket(self):\n if not hasattr(self, \"_socket\"):\n # create a new one\n self._socket = self.context.socket(zmq.REQ)\n if hasattr(zmq, \"RECONNECT_IVL_MAX\"):\n self._socket.setsockopt(zmq.RECONNECT_IVL_MAX, 5000)\n\n self._set_tcp_keepalive()\n if self.master.startswith(\"tcp://[\"):\n # Hint PF type if bracket enclosed IPv6 address\n if hasattr(zmq, \"IPV6\"):\n self._socket.setsockopt(zmq.IPV6, 1)\n elif hasattr(zmq, \"IPV4ONLY\"):\n self._socket.setsockopt(zmq.IPV4ONLY, 0)\n self._socket.linger = self.linger\n if self.id_:\n self._socket.setsockopt(zmq.IDENTITY, self.id_)\n self._socket.connect(self.master)\n return self._socket","def init_comm(self, obj):\n comm = None\n if self.dynamic or self.renderer.widget_mode == 'live':\n comm = self.renderer.comms[self.renderer.mode][0](self)\n attach_streams(self, obj)\n return comm","def _build_network(self):\n pass","def kafka_get_connection(self):\n return self.kf_producer","def network(self) -> pulumi.Input[str]:\n return pulumi.get(self, \"network\")","def get_communities(self):\n return self._communities.values()","def __get_zmq_pub(self):\n print(\"Publishing to tcp://127.0.0.1:%d channel: tweets\" % self.port)\n context = zmq.Context()\n socket = context.socket(zmq.PUB)\n socket.bind(\"tcp://127.0.0.1:%d\" % self.port)\n return socket","def _get_protocol_type(self):\n return self.__protocol_type","def protocol(self) -> pulumi.Output[str]:\n return pulumi.get(self, \"protocol\")","def protocol(self) -> pulumi.Output[str]:\n return pulumi.get(self, \"protocol\")","def coordinator(self):\n return self._coordinator","def returnNetworkNode(self):\n\n networkNodes = cmds.ls(type=\"network\")\n for node in networkNodes:\n attrs = cmds.listAttr(node)\n if \"moduleName\" in attrs:\n if cmds.getAttr(node + \".moduleName\") == self.name:\n networkNode = node\n\n return networkNode","def protocol(self) -> str:\n return __name__","def socket(self):\n return self._socket","def build_socket(self):\n sock = socket(AF_UNIX, SOCK_SEQPACKET)\n sock.connect(self.my_id)\n\n return sock","def get_client_protocol(self, machine_id: str):\n peer = self.peer_registry.peers.get(machine_id)\n return peer.peer if peer is not None else None","def network_plugin(self) -> Optional[pulumi.Input[Union[str, 'NetworkPlugin']]]:\n return pulumi.get(self, \"network_plugin\")","def getNet(self):\n\t\treturn self.loader","def rpc(self):\n return self.interface.supervisor","def component_configuration():\n return ProtocolConfig(\"a_protocol\", \"an_author\", \"0.1.0\")","def remote_container(self):\n return pn_connection_remote_container(self._impl)","def device(self):\n return next(self.parameters()).device","def device(self):\n return next(self.parameters()).device","def device(self):\n return next(self.parameters()).device","def device(self):\n return next(self.parameters()).device"],"string":"[\n \"def get_comm() -> Communication:\\n return __default_comm\",\n \"def get_comm(self):\\n return self.comm\",\n \"def comm(self):\\n return self._comm\",\n \"def GetComm(self):\\n return _hypre.HypreParMatrix_GetComm(self)\",\n \"def topology(self):\\n return self._topology\",\n \"def object_communicator():\\n comm = MPI.COMM_WORLD\",\n \"def get_torch_default_comm():\\n try:\\n comm = dist.distributed_c10d._get_default_group()\\n return comm\\n except Exception as _:\\n pass\\n try:\\n comm = dist.distributed_c10d._default_pg\\n if comm is not None:\\n return comm\\n except Exception as _:\\n pass\\n raise RuntimeError(\\\"Unsupported PyTorch version\\\")\",\n \"def GetComm(self):\\n return _hypre.HypreParVector_GetComm(self)\",\n \"def comm_group(self):\\n return self._gcomm\",\n \"def network(self):\\n return self.__network\",\n \"def nc(self):\\n return self._syi.node_creator\",\n \"def build_topology(self):\\n# errstr = \\\"build_topology() is not implemented.\\\\n\\\"\\n# errstr += textwrap.dedent(self.build_topology.__doc__)\\n# raise NotImplementedError(errstr)\\n pass # May be a 1-compartment neuron. No need to abstract. \",\n \"def comm_port(self):\\r\\n return self._comm_port\",\n \"def get_network(self):\\n return self._network\",\n \"def _get_communities(self):\\n return self.__communities\",\n \"def network(self):\\n return self._network\",\n \"def network(self):\\n return self._network\",\n \"def network(self):\\n return self._network\",\n \"def _get_send_community(self):\\n return self.__send_community\",\n \"def protocol(self):\\n self._recv_protocol()\\n return self._protocol\",\n \"def get_topology_map(self):\\n # Get a row for the list\\n # make a list from the topology\\n master_slaves = [self._get_row(row) for row in self.topology]\\n return master_slaves[0]\",\n \"def get_network(self):\\n return self.get_ip_network()[-1]\",\n \"def current_build_proto(self):\\n return self._build_proto\",\n \"def community(self):\\n return self._community\",\n \"def network_interface(self): \\n return self._network_interface\",\n \"def get_graph_interface(self):\\n if self._graph_interface is None:\\n self._compute_graph_interface()\\n return self._graph_interface\",\n \"def topology(self):\\n return self._h5[TOPOLOGY][()]\",\n \"def get_connection(self):\\n\\n return self.REMOTE_CONNECTION\",\n \"def protocol(self) -> NetworkProtocol:\\n if hasattr(self, \\\"_protocol\\\"):\\n return self._protocol\\n _args: list[Arg] = []\\n _ctx = self._select(\\\"protocol\\\", _args)\\n return _ctx.execute_sync(NetworkProtocol)\",\n \"def get_distribution_operator(self):\\n return MPIDistributionIdentityOperator(self.comm)\",\n \"def topology_name(self):\\n return self._topology_name\",\n \"def network(self) -> str:\\n return pulumi.get(self, \\\"network\\\")\",\n \"def proto(self):\\n return self.sock.proto\",\n \"def getComputer(this):\\n comp_id = \\\"192.168.0.78\\\"\\n return comp_id\",\n \"def communities(self) -> pulumi.Input[Sequence[pulumi.Input[str]]]:\\n return pulumi.get(self, \\\"communities\\\")\",\n \"def protocol(self):\\n return helpers.get_protocol()\",\n \"def topology(self) -> List[Topology]:\\n return self._topology\",\n \"def get_synchronizer(self):\\n return self.synchronizer\",\n \"def make_comms(self,comm):\\n # For masters we let child_comm be the communicator used to message the node's \\n # children, and parent_comm be that used to message the node's parents.\\n\\n parent_rank = 0\\n\\n # Case (1)\\n if self.num_masters > 1:\\n self.make_comms_many(comm)\\n if self.is_master:\\n parent_comm = self.comm_masters\\n if self.comm_masters.Get_rank() == 0: # rank 0 is the super-master\\n child_comm = self.comm_masters\\n parent_rank = None\\n else:\\n child_comm = self.comm_block\\n # Case (2)\\n else:\\n self.make_comm_single(comm)\\n if self.is_master:\\n parent_comm = self.comm_block\\n child_comm = self.comm_block\\n parent_rank = None\\n\\n # Process initialization\\n from .MPIProcess import MPIWorker, MPIMaster\\n if self.is_master:\\n self.set_val_data()\\n num_sync_workers = self.get_num_sync_workers(child_comm)\\n self.process = MPIMaster( parent_comm, parent_rank=parent_rank, \\n data=self.data, child_comm=child_comm, num_epochs=self.num_epochs,\\n num_sync_workers=num_sync_workers, callbacks=self.callbacks )\\n else:\\n self.set_train_data()\\n self.process = MPIWorker( parent_comm=self.comm_block, parent_rank=parent_rank, \\n num_epochs=self.num_epochs, data=self.data, callbacks=self.callbacks )\",\n \"def device(self) -> torch.device:\\n for param in self.parameters():\\n return param.device\\n return get_device(\\\"cpu\\\")\",\n \"def network(self) -> pulumi.Output[str]:\\n return pulumi.get(self, \\\"network\\\")\",\n \"def getProtocol(self, _):\\r\\n return self._protocol\",\n \"def __str__(self):\\n\\n return \\\"Network: {0}\\\".format(self.topology)\",\n \"def network_client(self):\\n if not self.client:\\n self.client = get_client_from_cli_profile(NetworkManagementClient)\\n return self.client\",\n \"def protocol(self):\\n return self._protocol\",\n \"def get_network(self):\\n\\n # Find which nodes are input and which are output. We may want to store\\n # this info somewhere else (like in the genome)\\n\\n inputs = []\\n outputs = []\\n bias = []\\n edges = []\\n node_num = dict() #Map from node_id to zero index node number\\n\\n for i, node in enumerate(self.node_genes):\\n # Create mapping\\n node_num[node.node_id] = i\\n\\n # Store input and output node_numbers\\n if node.node_type is INPUT:\\n inputs.append(i)\\n elif node.node_type is OUTPUT:\\n outputs.append(i)\\n elif node.node_type is BIAS:\\n bias.append(i)\\n\\n # Create edge list.\\n for link in self.link_genes:\\n if link.enabled:\\n edges.append((node_num[link.to_node.node_id],\\n node_num[link.from_node.node_id], link.weight))\\n\\n\\n # Build an adjacency matrix for the network\\n n = len(node_num)\\n adj_matrix = np.zeros((n, n))\\n try:\\n for e in edges:\\n adj_matrix[e[:2]] = e[2]\\n except:\\n global GENOME\\n GENOME = self\\n print([node.node_id for node in self.node_genes])\\n print()\\n print('len(node_genes)', len(self.node_genes))\\n print('edge', e)\\n print('adj.shape', adj_matrix.shape)\\n sys.exit()\\n\\n return Network(adj_matrix, inputs, outputs, bias)\",\n \"def get_device(self):\\n return self.parent.get_device()\",\n \"def get_com(self):\\n return self.com\",\n \"def developer(self):\\n return self.proto.creator\",\n \"def protocol(self):\\n return self._host[CONF_PROTOCOL]\",\n \"def socket(self):\\n return self.__socket\",\n \"def device(self) -> torch.device:\\n return self._device\",\n \"def getPeerToPeerNetwork(self):\\r\\n raise NotImplementedError()\",\n \"def createPort(self):\\n return _libsbml.CompModelPlugin_createPort(self)\",\n \"def get_device(self):\\n raise NotImplementedError()\",\n \"def protocol(self) -> MessageProtocol:\\n return self._sender.protocol\",\n \"def device(self):\\n return torch.cuda.current_device()\",\n \"def interface(self):\\n return self.broker.interface(**{\\\"DeviceRouteID\\\": self.DeviceRouteID})\",\n \"def getProtocol(self, transport: Any) -> TCompactProtocol:\\n return TCompactProtocol.TCompactProtocol(transport)\",\n \"def buildNetwork(self):\\n\\n # create the network node for our module\\n self.networkNode = cmds.createNode(\\\"network\\\", name=self.modName)\\n\\n # create attributes\\n self.addAttributes()\\n\\n return self.networkNode\",\n \"def telescope(self):\\n return _coordsys.coordsys_telescope(self)\",\n \"def getPort(self, *args):\\n return _libsbml.CompModelPlugin_getPort(self, *args)\",\n \"def device(self):\\n return self.broker.device(**{\\\"VirtualNetworkMemberID\\\": self.VirtualNetworkMemberID})\",\n \"def masterPort(self):\\r\\n return self._masterPort\",\n \"def getConexion_police(self):\\n\\t\\t\\treturn self.policeConn\",\n \"def getProcessManager(self): \\n \\n return self.procmgr\",\n \"def get_chat(self) -> Optional[ChatNode]:\\n triples = self.agent_memory.get_triples(pred_text=\\\"chat_effect_\\\", obj=self.memid)\\n if triples:\\n chat_id, _, _ = triples[0]\\n return ChatNode(self.agent_memory, chat_id)\\n else:\\n return None\",\n \"def construct_mpi_topology(self, dico):\\n period = [True]*self.dim\\n\\n if dico is None:\\n comm = mpi.COMM_WORLD\\n else:\\n comm = dico.get('comm', mpi.COMM_WORLD)\\n self.mpi_topo = MPI_topology(self.dim, period, comm)\",\n \"def createTopology(self):\\n\\n # find DAG root\\n dagRoot = None\\n for mote in self.motes:\\n if mote.id == 0:\\n mote.role_setDagRoot()\\n dagRoot = mote\\n assert dagRoot\\n\\n if self.settings.mobilityModel == 'RPGM':\\n # put DAG root at center of area\\n dagRoot.setLocation(x=SimEngine.SimEngine().targets[0][0],\\n y=SimEngine.SimEngine().targets[0][1])\\n else:\\n # put DAG root at center of area\\n dagRoot.setLocation(x=self.squareSide/2,\\n y=self.squareSide/2)\\n\\n # reposition each mote until it is connected\\n connectedMotes = [dagRoot]\\n motes_shuffled = copy.copy(self.motes)\\n random.shuffle(motes_shuffled) # shuffle them around\\n\\n # for mote in self.motes:\\n for mote in motes_shuffled:\\n stableNeighbors = []\\n if mote in connectedMotes:\\n continue\\n\\n connected = False\\n while not connected:\\n # pick a random location\\n # mote.setLocation(x=self.squareSide*random.random(),\\n # y=self.squareSide*random.random())\\n #\\n # mote.setLocation(\\n # x=self.settings.squareSide * random.random(),\\n # y=self.settings.squareSide * random.random()\\n # )\\n\\n newX = None\\n newY = None\\n # if no topology is not given, build the topology yourself\\n if SimEngine.SimEngine().ilp_topology is None:\\n newX = self.settings.squareSide * random.random()\\n newY = self.settings.squareSide * random.random()\\n else:\\n # if no topology is given, use that topology\\n newX = SimEngine.SimEngine().ilp_topology[str(mote.id)]['x']\\n newY = SimEngine.SimEngine().ilp_topology[str(mote.id)]['y']\\n\\n mote.setLocation(\\n x=newX,\\n y=newY\\n )\\n\\n numStableNeighbors = 0\\n stableNeighbors = []\\n\\n # tryAgain = False\\n # for cm in connectedMotes:\\n # rssi = self._computeRSSI(mote, cm)\\n # if rssi > -110:\\n # tryAgain = True\\n\\n # if not tryAgain:\\n # count number of neighbors with sufficient RSSI\\n for cm in connectedMotes:\\n\\n rssi = self._computeRSSI(mote, cm)\\n mote.setRSSI(cm, rssi)\\n cm.setRSSI(mote, rssi)\\n\\n # save the intial RSSI values for future use in the mobility models\\n mote.initialRSSI[cm] = rssi\\n cm.initialRSSI[mote] = rssi\\n\\n if self.settings.individualModulations == 1:\\n if self.rssiToPdr(rssi, modulation=Modulation.Modulation().minimalCellModulation[SimSettings.SimSettings().modulationConfig]) > self.settings.stableNeighborPDR:\\n # if rssi > Modulation.Modulation().modulationStableRSSI[Modulation.Modulation().minimalCellModulation[SimSettings.SimSettings().modulationConfig]]:\\n # print rssi\\n numStableNeighbors += 1\\n stableNeighbors.append(cm.id)\\n else:\\n if rssi > self.STABLE_RSSI:\\n # print rssi\\n numStableNeighbors += 1\\n\\n # make sure it is connected to at least STABLE_NEIGHBORS motes\\n # or connected to all the currently deployed motes when the number of deployed motes\\n # are smaller than STABLE_NEIGHBORS\\n if numStableNeighbors >= self.stable_neighbors or numStableNeighbors == len(connectedMotes):\\n print 'For mote {0}, stable neighbors {1}'.format(mote.id, stableNeighbors)\\n connected = True\\n\\n connectedMotes += [mote]\\n\\n # for each mote, compute PDR to each neighbors\\n for mote in self.motes:\\n for m in self.motes:\\n if mote == m:\\n continue\\n\\n # set the distance to all other motes\\n distance = math.sqrt((m.x - mote.x) ** 2 + (m.y - mote.y) ** 2)\\n m.set_distance(mote, distance)\\n mote.set_distance(m, distance)\\n # print 'mote %d to mote %d: %.4f' % (m.id, mote.id, distance)\\n if self.settings.individualModulations == 1:\\n rssi_value = mote.getRSSI(m)\\n # for modulationTmp in Modulation.Modulation().modulations:\\n # if self.settings.ilpfile is not None:\\n # ## I am not going to set this as this should be set by the ILP\\n # pass\\n # else:\\n # # if the rssi value is higher than the minimal signal value required for this neighbor, take that modulation\\n # # and compute the PDR using that modulation\\n # pass\\n # # if rssi_value > Modulation.Modulation().modulationStableRSSI[modulationTmp]:\\n # # pdr = self._computePDR(mote, m, modulation=modulationTmp)\\n # # mote.setPDR(m, pdr)\\n # # m.setPDR(mote, pdr)\\n # # mote.setModulation(m, modulationTmp)\\n # # m.setModulation(mote, modulationTmp)\\n else:\\n if mote.getRSSI(m) > mote.minRssi:\\n pdr = self._computePDR(mote, m)\\n mote.setPDR(m, pdr)\\n m.setPDR(mote, pdr)\",\n \"def getPeer(self):\\n return \\\"Peer:PID:\\\" + str(self.transport.pid)\",\n \"def topology(self):\\n try:\\n return self._topology\\n except AttributeError:\\n # If none exists, we need to create it\\n pass\\n # Cache the topology for easy returning later\\n self._topology = topology = Topology()\\n\\n last_chain = None\\n last_residue = None\\n # Add each chain (separate 'system's) and residue\\n for atom in self.atom_list:\\n resid = '%d%s' % (atom.residue.idx, atom.residue.inscode)\\n if atom.system != last_chain:\\n chain = topology.addChain(atom.system)\\n last_chain = atom.system\\n last_residue = None\\n if resid != last_residue:\\n last_residue = resid\\n residue = topology.addResidue(atom.residue.resname, chain, str(atom.residue.idx), atom.residue.inscode)\\n if atom.type is not None and atom.type.atomic_number != 0:\\n # This is the most reliable way of determining the element\\n elem = element.Element.getByAtomicNumber(atom.type.atomic_number)\\n else:\\n # Figure it out from the mass\\n elem = element.Element.getByMass(atom.mass)\\n topology.addAtom(atom.name, elem, residue)\\n\\n # Add all of the bonds\\n atoms = list(topology.atoms())\\n # Assign atom indexes to make sure they're current\\n self.atom_list.assign_indexes()\\n for bond in self.bond_list:\\n topology.addBond(atoms[bond.atom1.idx], atoms[bond.atom2.idx])\\n\\n # Add the periodic box if there is one\\n if self.box_vectors is not None:\\n topology.setUnitCellDimensions(self.boxLengths)\\n\\n return topology\",\n \"def main_device(self):\\n return self._main_device\",\n \"def transportprotocol(self) :\\n\\t\\ttry :\\n\\t\\t\\treturn self._transportprotocol\\n\\t\\texcept Exception as e:\\n\\t\\t\\traise e\",\n \"def protocol(self) -> pulumi.Output[Optional[str]]:\\n return pulumi.get(self, \\\"protocol\\\")\",\n \"def protocol(self) -> str:\\n return self.__parameters.protocol\",\n \"def socket(self):\\n if not hasattr(self, \\\"_socket\\\"):\\n # create a new one\\n self._socket = self.context.socket(zmq.REQ)\\n if hasattr(zmq, \\\"RECONNECT_IVL_MAX\\\"):\\n self._socket.setsockopt(zmq.RECONNECT_IVL_MAX, 5000)\\n\\n self._set_tcp_keepalive()\\n if self.master.startswith(\\\"tcp://[\\\"):\\n # Hint PF type if bracket enclosed IPv6 address\\n if hasattr(zmq, \\\"IPV6\\\"):\\n self._socket.setsockopt(zmq.IPV6, 1)\\n elif hasattr(zmq, \\\"IPV4ONLY\\\"):\\n self._socket.setsockopt(zmq.IPV4ONLY, 0)\\n self._socket.linger = self.linger\\n if self.id_:\\n self._socket.setsockopt(zmq.IDENTITY, self.id_)\\n self._socket.connect(self.master)\\n return self._socket\",\n \"def init_comm(self, obj):\\n comm = None\\n if self.dynamic or self.renderer.widget_mode == 'live':\\n comm = self.renderer.comms[self.renderer.mode][0](self)\\n attach_streams(self, obj)\\n return comm\",\n \"def _build_network(self):\\n pass\",\n \"def kafka_get_connection(self):\\n return self.kf_producer\",\n \"def network(self) -> pulumi.Input[str]:\\n return pulumi.get(self, \\\"network\\\")\",\n \"def get_communities(self):\\n return self._communities.values()\",\n \"def __get_zmq_pub(self):\\n print(\\\"Publishing to tcp://127.0.0.1:%d channel: tweets\\\" % self.port)\\n context = zmq.Context()\\n socket = context.socket(zmq.PUB)\\n socket.bind(\\\"tcp://127.0.0.1:%d\\\" % self.port)\\n return socket\",\n \"def _get_protocol_type(self):\\n return self.__protocol_type\",\n \"def protocol(self) -> pulumi.Output[str]:\\n return pulumi.get(self, \\\"protocol\\\")\",\n \"def protocol(self) -> pulumi.Output[str]:\\n return pulumi.get(self, \\\"protocol\\\")\",\n \"def coordinator(self):\\n return self._coordinator\",\n \"def returnNetworkNode(self):\\n\\n networkNodes = cmds.ls(type=\\\"network\\\")\\n for node in networkNodes:\\n attrs = cmds.listAttr(node)\\n if \\\"moduleName\\\" in attrs:\\n if cmds.getAttr(node + \\\".moduleName\\\") == self.name:\\n networkNode = node\\n\\n return networkNode\",\n \"def protocol(self) -> str:\\n return __name__\",\n \"def socket(self):\\n return self._socket\",\n \"def build_socket(self):\\n sock = socket(AF_UNIX, SOCK_SEQPACKET)\\n sock.connect(self.my_id)\\n\\n return sock\",\n \"def get_client_protocol(self, machine_id: str):\\n peer = self.peer_registry.peers.get(machine_id)\\n return peer.peer if peer is not None else None\",\n \"def network_plugin(self) -> Optional[pulumi.Input[Union[str, 'NetworkPlugin']]]:\\n return pulumi.get(self, \\\"network_plugin\\\")\",\n \"def getNet(self):\\n\\t\\treturn self.loader\",\n \"def rpc(self):\\n return self.interface.supervisor\",\n \"def component_configuration():\\n return ProtocolConfig(\\\"a_protocol\\\", \\\"an_author\\\", \\\"0.1.0\\\")\",\n \"def remote_container(self):\\n return pn_connection_remote_container(self._impl)\",\n \"def device(self):\\n return next(self.parameters()).device\",\n \"def device(self):\\n return next(self.parameters()).device\",\n \"def device(self):\\n return next(self.parameters()).device\",\n \"def device(self):\\n return next(self.parameters()).device\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.72166127","0.6937673","0.66808903","0.65805095","0.65750676","0.6487292","0.62338114","0.62185067","0.5998818","0.5994917","0.59699655","0.5910966","0.5877223","0.5876523","0.58492416","0.58371776","0.58371776","0.58371776","0.58118683","0.5713875","0.5690591","0.56720567","0.5654453","0.564234","0.5592814","0.5585134","0.5558269","0.555408","0.55481493","0.55341876","0.5513632","0.55031043","0.5502711","0.54827654","0.5470818","0.54550695","0.54546356","0.54514533","0.540118","0.5383014","0.5380213","0.53729814","0.53728575","0.5362061","0.5323845","0.53048867","0.5294056","0.5288523","0.52826697","0.5264198","0.52624536","0.522741","0.52238095","0.5213549","0.5185357","0.51835614","0.5182384","0.518028","0.5173877","0.51714534","0.5161185","0.5153327","0.51513463","0.5147594","0.51425666","0.51420105","0.51385504","0.5135215","0.51191634","0.5111839","0.5111498","0.5105396","0.51016265","0.51008976","0.5095083","0.50938606","0.50924534","0.5088551","0.50865054","0.50861603","0.5084659","0.5078536","0.50754476","0.5071308","0.5071308","0.50698704","0.50456136","0.504455","0.5040594","0.5030093","0.5026416","0.50199133","0.5019446","0.50015","0.49968657","0.49966192","0.4994114","0.4994114","0.4994114","0.4994114"],"string":"[\n \"0.72166127\",\n \"0.6937673\",\n \"0.66808903\",\n \"0.65805095\",\n \"0.65750676\",\n \"0.6487292\",\n \"0.62338114\",\n \"0.62185067\",\n \"0.5998818\",\n \"0.5994917\",\n \"0.59699655\",\n \"0.5910966\",\n \"0.5877223\",\n \"0.5876523\",\n \"0.58492416\",\n \"0.58371776\",\n \"0.58371776\",\n \"0.58371776\",\n \"0.58118683\",\n \"0.5713875\",\n \"0.5690591\",\n \"0.56720567\",\n \"0.5654453\",\n \"0.564234\",\n \"0.5592814\",\n \"0.5585134\",\n \"0.5558269\",\n \"0.555408\",\n \"0.55481493\",\n \"0.55341876\",\n \"0.5513632\",\n \"0.55031043\",\n \"0.5502711\",\n \"0.54827654\",\n \"0.5470818\",\n \"0.54550695\",\n \"0.54546356\",\n \"0.54514533\",\n \"0.540118\",\n \"0.5383014\",\n \"0.5380213\",\n \"0.53729814\",\n \"0.53728575\",\n \"0.5362061\",\n \"0.5323845\",\n \"0.53048867\",\n \"0.5294056\",\n \"0.5288523\",\n \"0.52826697\",\n \"0.5264198\",\n \"0.52624536\",\n \"0.522741\",\n \"0.52238095\",\n \"0.5213549\",\n \"0.5185357\",\n \"0.51835614\",\n \"0.5182384\",\n \"0.518028\",\n \"0.5173877\",\n \"0.51714534\",\n \"0.5161185\",\n \"0.5153327\",\n \"0.51513463\",\n \"0.5147594\",\n \"0.51425666\",\n \"0.51420105\",\n \"0.51385504\",\n \"0.5135215\",\n \"0.51191634\",\n \"0.5111839\",\n \"0.5111498\",\n \"0.5105396\",\n \"0.51016265\",\n \"0.51008976\",\n \"0.5095083\",\n \"0.50938606\",\n \"0.50924534\",\n \"0.5088551\",\n \"0.50865054\",\n \"0.50861603\",\n \"0.5084659\",\n \"0.5078536\",\n \"0.50754476\",\n \"0.5071308\",\n \"0.5071308\",\n \"0.50698704\",\n \"0.50456136\",\n \"0.504455\",\n \"0.5040594\",\n \"0.5030093\",\n \"0.5026416\",\n \"0.50199133\",\n \"0.5019446\",\n \"0.50015\",\n \"0.49968657\",\n \"0.49966192\",\n \"0.4994114\",\n \"0.4994114\",\n \"0.4994114\",\n \"0.4994114\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.64308983"},"document_rank":{"kind":"string","value":"6"}}},{"rowIdx":6193,"cells":{"query":{"kind":"string","value":"returns ghost layer width."},"document":{"kind":"string","value":"def ghosts(self):\n return self.mesh.discretization.ghosts"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def get_width(self):\n\t\treturn len(self._background) if self._background else 0","def get_dimension_width(self):\n pass","def width(self) -> int:\n return self._obj[self.x_dim].size","def getWidth(self):\n return _libsbml.Dimensions_getWidth(self)","def getWidth(self):\n return self._image.width()","def get_width(self) -> int:\n return int(self._surface.get_width())","def width(self):\n self._updateExtents()\n return self._mWidth","def getWidth(self):\n return self.width","def getWidth(self):\n return self.width","def getWidth(self):\n return self._width","def width(self) -> int:\n return self._image_data.width","def getWidth(self) -> int:\n ...","def width(self):\n return (self.scene.shape[2] - self.size) // self.size + 1","def getWidth(self):\n return _tkCall(self.image.width)","def get_dimension_length(self):\n pass","def tileWidth(self):\n return self._tileWidth","def get_width(self):\r\n return self._width","def get_width(self):\r\n return self._width","def get_width(self):\r\n return self._width","def width(self):\n return _libsbml.Dimensions_width(self)","def width(self):\n return self.figure.scene.get_size()[0]","def getWidth(self):\n return DEFAULT_WIDTH","def get_width(self):\n return self.__width","def get_width(self):\n return self._width","def get_width(self):\n return self._width","def get_width(self):\n return self._width","def get_width(self):\n return self._width","def get_width ( self ):\n return self.width","def get_width(self):\n return self.width","def layer_size(self, layer_id): # -> int:\n ...","def getWidth(self):\n return len(self._data[0])","def width(self) -> int:\r\n return self.rect_uv.w","def getWidth(self):\n area = self.getArea()\n length = self.getLength()\n return area / length","def width(self) :\n return self.m_width","def width(self):\n return self.__width","def width(self):\n return self.__width","def width(self):\n return self.__width","def width(self):\n return self.__width","def width(self):\n return self.__width","def width(self):\n return self.__width","def width(self):\n return self.__width","def width(self):\n return self.__width","def width(self):\n return self.__width","def width(self):\n return self.__width","def width(self):\n return self.__width","def width(self):\n return self.__width","def width (self):\n return self._w","def width(self):\n return len(self.mine_map[0])","def getWidth(self):\n return constants.DEFAULT_WIDTH","def getWidth(self):\n return _libsbml.BoundingBox_getWidth(self)","def dimension_count(self):\n return self._dimensionCount","def width(self):\n return self.x.max() - self.x.min()","def getdim(self):\n return round(self.w() / self.c)","def width(self):\n return self.board.shape[1]","def get_grid_width(self):\n # replace with your code\n return self._width","def get_grid_width(self):\n # replace with your code\n return self._width","def width(self):\n return self._width","def width(self):\n return self._width","def width(self):\n return self._width","def width(self):\n return self._width","def width(self):\n return self._width","def width(self):\n return self._width","def width(self):\n return self._width","def width(self):\n return self._width","def width(self):\n return self._width","def width(self):\n return self._width","def width(self):\n return self._width","def width(self):\n return self._width","def width(self):\n return self._width","def dimension_size(self):\n return self._dim","def w(self):\n return self.width","def width(self):\n return self.get_delta_value(self.X_INDEX)","def size(self):\n return self.width","def size(self):\n return self.width","def size(self):\n return self.width","def size(self):\n return self.width","def size(self):\n return self.width","def size(self):\n return self.width","def size(self):\n return self.width","def get_dim(self, name):\n return len(self.root_group.dimensions[name])","def getWidth(self):\n\t\tif (self.position==[]):\n\t\t\treturn 0\n\t\treturn abs(self.position[1][0]-self.position[0][0])","def get_grid_width(self):\r\n # replace with your code\r\n return self._width","def w(self):\r\n return self.size.x","def get_size(self):\n return self._surf.get_size()","def GetWidth(self):\r\n\r\n return self._width","def GetWidth(self):\r\n\r\n return self._width","def dimension(self):\r\n a = 0\r\n for x in self.faces():\r\n if (len(x) > a):\r\n a = len(x) \r\n return a-1","def width(self) -> float:\n return self._width","def numPixels(self):\n\t\treturn self.size","def numPixels(self):\n\t\treturn self.size","def get_grid_width(self):\n # replace with your code\n return self._grid_width","def get_grid_width(self):\n # replace with your code\n return self._grid_width","def width(self):\n # type: () -> float\n return self._width","def getLength(self):\n return self.geometry.length","def dimension(self):\n\t\treturn self.d","def width(self):\n return self.maxx - self.minx","def get_layer_size(self, layer_ind):\n assert(layer_ind < self.num_layers)\n return self._layer_sizes[layer_ind]","def width(self):\n return self.i_node.distance(self.j_node)","def get_width(self):\n width = np.size(self.img, 0)\n return width","def zone_width(self):\n return self._zone_width","def size(self):\n return (self.width)"],"string":"[\n \"def get_width(self):\\n\\t\\treturn len(self._background) if self._background else 0\",\n \"def get_dimension_width(self):\\n pass\",\n \"def width(self) -> int:\\n return self._obj[self.x_dim].size\",\n \"def getWidth(self):\\n return _libsbml.Dimensions_getWidth(self)\",\n \"def getWidth(self):\\n return self._image.width()\",\n \"def get_width(self) -> int:\\n return int(self._surface.get_width())\",\n \"def width(self):\\n self._updateExtents()\\n return self._mWidth\",\n \"def getWidth(self):\\n return self.width\",\n \"def getWidth(self):\\n return self.width\",\n \"def getWidth(self):\\n return self._width\",\n \"def width(self) -> int:\\n return self._image_data.width\",\n \"def getWidth(self) -> int:\\n ...\",\n \"def width(self):\\n return (self.scene.shape[2] - self.size) // self.size + 1\",\n \"def getWidth(self):\\n return _tkCall(self.image.width)\",\n \"def get_dimension_length(self):\\n pass\",\n \"def tileWidth(self):\\n return self._tileWidth\",\n \"def get_width(self):\\r\\n return self._width\",\n \"def get_width(self):\\r\\n return self._width\",\n \"def get_width(self):\\r\\n return self._width\",\n \"def width(self):\\n return _libsbml.Dimensions_width(self)\",\n \"def width(self):\\n return self.figure.scene.get_size()[0]\",\n \"def getWidth(self):\\n return DEFAULT_WIDTH\",\n \"def get_width(self):\\n return self.__width\",\n \"def get_width(self):\\n return self._width\",\n \"def get_width(self):\\n return self._width\",\n \"def get_width(self):\\n return self._width\",\n \"def get_width(self):\\n return self._width\",\n \"def get_width ( self ):\\n return self.width\",\n \"def get_width(self):\\n return self.width\",\n \"def layer_size(self, layer_id): # -> int:\\n ...\",\n \"def getWidth(self):\\n return len(self._data[0])\",\n \"def width(self) -> int:\\r\\n return self.rect_uv.w\",\n \"def getWidth(self):\\n area = self.getArea()\\n length = self.getLength()\\n return area / length\",\n \"def width(self) :\\n return self.m_width\",\n \"def width(self):\\n return self.__width\",\n \"def width(self):\\n return self.__width\",\n \"def width(self):\\n return self.__width\",\n \"def width(self):\\n return self.__width\",\n \"def width(self):\\n return self.__width\",\n \"def width(self):\\n return self.__width\",\n \"def width(self):\\n return self.__width\",\n \"def width(self):\\n return self.__width\",\n \"def width(self):\\n return self.__width\",\n \"def width(self):\\n return self.__width\",\n \"def width(self):\\n return self.__width\",\n \"def width(self):\\n return self.__width\",\n \"def width (self):\\n return self._w\",\n \"def width(self):\\n return len(self.mine_map[0])\",\n \"def getWidth(self):\\n return constants.DEFAULT_WIDTH\",\n \"def getWidth(self):\\n return _libsbml.BoundingBox_getWidth(self)\",\n \"def dimension_count(self):\\n return self._dimensionCount\",\n \"def width(self):\\n return self.x.max() - self.x.min()\",\n \"def getdim(self):\\n return round(self.w() / self.c)\",\n \"def width(self):\\n return self.board.shape[1]\",\n \"def get_grid_width(self):\\n # replace with your code\\n return self._width\",\n \"def get_grid_width(self):\\n # replace with your code\\n return self._width\",\n \"def width(self):\\n return self._width\",\n \"def width(self):\\n return self._width\",\n \"def width(self):\\n return self._width\",\n \"def width(self):\\n return self._width\",\n \"def width(self):\\n return self._width\",\n \"def width(self):\\n return self._width\",\n \"def width(self):\\n return self._width\",\n \"def width(self):\\n return self._width\",\n \"def width(self):\\n return self._width\",\n \"def width(self):\\n return self._width\",\n \"def width(self):\\n return self._width\",\n \"def width(self):\\n return self._width\",\n \"def width(self):\\n return self._width\",\n \"def dimension_size(self):\\n return self._dim\",\n \"def w(self):\\n return self.width\",\n \"def width(self):\\n return self.get_delta_value(self.X_INDEX)\",\n \"def size(self):\\n return self.width\",\n \"def size(self):\\n return self.width\",\n \"def size(self):\\n return self.width\",\n \"def size(self):\\n return self.width\",\n \"def size(self):\\n return self.width\",\n \"def size(self):\\n return self.width\",\n \"def size(self):\\n return self.width\",\n \"def get_dim(self, name):\\n return len(self.root_group.dimensions[name])\",\n \"def getWidth(self):\\n\\t\\tif (self.position==[]):\\n\\t\\t\\treturn 0\\n\\t\\treturn abs(self.position[1][0]-self.position[0][0])\",\n \"def get_grid_width(self):\\r\\n # replace with your code\\r\\n return self._width\",\n \"def w(self):\\r\\n return self.size.x\",\n \"def get_size(self):\\n return self._surf.get_size()\",\n \"def GetWidth(self):\\r\\n\\r\\n return self._width\",\n \"def GetWidth(self):\\r\\n\\r\\n return self._width\",\n \"def dimension(self):\\r\\n a = 0\\r\\n for x in self.faces():\\r\\n if (len(x) > a):\\r\\n a = len(x) \\r\\n return a-1\",\n \"def width(self) -> float:\\n return self._width\",\n \"def numPixels(self):\\n\\t\\treturn self.size\",\n \"def numPixels(self):\\n\\t\\treturn self.size\",\n \"def get_grid_width(self):\\n # replace with your code\\n return self._grid_width\",\n \"def get_grid_width(self):\\n # replace with your code\\n return self._grid_width\",\n \"def width(self):\\n # type: () -> float\\n return self._width\",\n \"def getLength(self):\\n return self.geometry.length\",\n \"def dimension(self):\\n\\t\\treturn self.d\",\n \"def width(self):\\n return self.maxx - self.minx\",\n \"def get_layer_size(self, layer_ind):\\n assert(layer_ind < self.num_layers)\\n return self._layer_sizes[layer_ind]\",\n \"def width(self):\\n return self.i_node.distance(self.j_node)\",\n \"def get_width(self):\\n width = np.size(self.img, 0)\\n return width\",\n \"def zone_width(self):\\n return self._zone_width\",\n \"def size(self):\\n return (self.width)\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.74909455","0.73224","0.71234566","0.7045834","0.69717586","0.6938515","0.69376487","0.693364","0.693364","0.69244164","0.692004","0.68859637","0.6870889","0.6870504","0.6858993","0.6841644","0.68349195","0.68349195","0.68349195","0.6833873","0.68273956","0.6762272","0.67585415","0.67568374","0.67568374","0.67568374","0.67568374","0.674077","0.6720321","0.67189044","0.67145693","0.6695148","0.66685385","0.6666819","0.6666446","0.6666446","0.6666446","0.6666446","0.6666446","0.6666446","0.6666446","0.6666446","0.6666446","0.6666446","0.6666446","0.6666446","0.6665721","0.6663701","0.666361","0.6654473","0.66510254","0.6644691","0.66396534","0.66325045","0.6631628","0.6631628","0.6627472","0.6627472","0.6627472","0.6627472","0.6627472","0.6627472","0.6627472","0.6627472","0.6627472","0.6627472","0.6627472","0.6627472","0.6627472","0.66271824","0.66171646","0.6601387","0.6587966","0.6587966","0.6587966","0.6587966","0.6587966","0.6587966","0.6587966","0.6583706","0.6582437","0.6580969","0.6578992","0.65776366","0.65605956","0.65605956","0.6560368","0.6545597","0.65415007","0.65415007","0.6539639","0.6539639","0.65378845","0.65332687","0.65331274","0.6530725","0.6526173","0.65156776","0.65067047","0.65025216","0.65006715"],"string":"[\n \"0.74909455\",\n \"0.73224\",\n \"0.71234566\",\n \"0.7045834\",\n \"0.69717586\",\n \"0.6938515\",\n \"0.69376487\",\n \"0.693364\",\n \"0.693364\",\n \"0.69244164\",\n \"0.692004\",\n \"0.68859637\",\n \"0.6870889\",\n \"0.6870504\",\n \"0.6858993\",\n \"0.6841644\",\n \"0.68349195\",\n \"0.68349195\",\n \"0.68349195\",\n \"0.6833873\",\n \"0.68273956\",\n \"0.6762272\",\n \"0.67585415\",\n \"0.67568374\",\n \"0.67568374\",\n \"0.67568374\",\n \"0.67568374\",\n \"0.674077\",\n \"0.6720321\",\n \"0.67189044\",\n \"0.67145693\",\n \"0.6695148\",\n \"0.66685385\",\n \"0.6666819\",\n \"0.6666446\",\n \"0.6666446\",\n \"0.6666446\",\n \"0.6666446\",\n \"0.6666446\",\n \"0.6666446\",\n \"0.6666446\",\n \"0.6666446\",\n \"0.6666446\",\n \"0.6666446\",\n \"0.6666446\",\n \"0.6666446\",\n \"0.6665721\",\n \"0.6663701\",\n \"0.666361\",\n \"0.6654473\",\n \"0.66510254\",\n \"0.6644691\",\n \"0.66396534\",\n \"0.66325045\",\n \"0.6631628\",\n \"0.6631628\",\n \"0.6627472\",\n \"0.6627472\",\n \"0.6627472\",\n \"0.6627472\",\n \"0.6627472\",\n \"0.6627472\",\n \"0.6627472\",\n \"0.6627472\",\n \"0.6627472\",\n \"0.6627472\",\n \"0.6627472\",\n \"0.6627472\",\n \"0.6627472\",\n \"0.66271824\",\n \"0.66171646\",\n \"0.6601387\",\n \"0.6587966\",\n \"0.6587966\",\n \"0.6587966\",\n \"0.6587966\",\n \"0.6587966\",\n \"0.6587966\",\n \"0.6587966\",\n \"0.6583706\",\n \"0.6582437\",\n \"0.6580969\",\n \"0.6578992\",\n \"0.65776366\",\n \"0.65605956\",\n \"0.65605956\",\n \"0.6560368\",\n \"0.6545597\",\n \"0.65415007\",\n \"0.65415007\",\n \"0.6539639\",\n \"0.6539639\",\n \"0.65378845\",\n \"0.65332687\",\n \"0.65331274\",\n \"0.6530725\",\n \"0.6526173\",\n \"0.65156776\",\n \"0.65067047\",\n \"0.65025216\",\n \"0.65006715\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":6194,"cells":{"query":{"kind":"string","value":"returns id of the task that owns this topology"},"document":{"kind":"string","value":"def task_id(self):\n return self._mpis.task_id"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def task_id(self):\n return self._task_id","def task_id(self):\n return self._task_id","def task_id(self):\n return self._task_id","def task_id(self):\n return self._task_id","def taskid(self):\n raise NotImplementedError('Must be implemented by subclass.')","def task_id(self) -> str:\n return self.get_from_redis(\"task_id\")","def get_task_id(self):\n if self.task_id:\n return self.task_id\n return (f'{self.task_type}_{self.get_source_system().lower()}'\n f'.{self.get_source_subsystem().lower()}.{self.get_name().upper()}')","def getTaskZoneId(self):\n return self.getZoneId()","def _make_task_id(self, task):\n index = self._tasks.add(task)\n task_id = '{name}-{idx}'.format(name=task.name, idx=index)\n\n return task_id","def dst_task_id(self):\n return struct.unpack('<H', self.pkt.payload[2:4])[0]","def src_task_id(self):\n return struct.unpack('<H', self.pkt.payload[4:6])[0]","def dag_id(self):\n if self.parallelize_task:\n return f'{self.job_id_extension.get_parallel(self.job_id)}'\n else:\n return f'{self.job_id_extension.get_preparation(self.job_id)}'","def get_id(self):\n for id, thread in threading._active.items(): \n if thread is self: \n return id","def get_id(self):\n if hasattr(self, \"_thread_id\"):\n return self._thread_id\n for id, thread in threading._active.items():\n if thread is self:\n return id","def get_id(self):\n if hasattr(self, \"_thread_id\"):\n return self._thread_id\n for id, thread in threading._active.items():\n if thread is self:\n return id","def get_task_id(self, position):\n task_id = self.stn.get_task_id(position)\n if task_id:\n return task_id\n else:\n raise TaskNotFound","def get_task_uuid(self):\n\t\treturn call_sdk_function('PrlRunningTask_GetTaskUuid', self.handle)","def thread_id(self):\n return self._thread_id","def create_task_id():\n return str(int(round(time.time() * 10**9)))","def pool_id ( self ):\n return self._pool_id","def node_id(self) -> int:\r\n return self._node_id","def unique_id(self) -> str:\n return str(self.coordinator.gios.station_id)","def get_task_index(self):\n return self.task_index","def unique_id(self):\n return self._id","def unique_id(self):\n return self._id","def get_id(self):\n\n\t\treturn self.__id","def establish_id(self):\n if self.config.node_id is None:\n self.config.node_id = str(uuid4()).replace('-', '')\n return self.config.node_id","def _get_id(self):\n return self.id","def portlet_id(self):\n return id(self)","def id(self):\n\t\treturn self.__id","def get_id(self):\n pass","def get_id(self):\n pass","def get_id(self):\n pass","def get_id(self):\n pass","def identity(self):\n return self.id","def get_threadbased_id(guarantee_uniq=False):\n\n return '{}:{}:{}:{}'.format(platform.node(), os.getpid(), str(threading.get_ident()),uuid.uuid4().hex if guarantee_uniq else '')","def get_id(self):\n return self.__id","def get_id(self):\n return self.__id","def getid(self):\n return self.__id","def get_parent_id():\n return getattr(threadlocal, \"parent_id\", None)","def task(self) -> str:\n return self._task","def topology_name(self):\n return self._topology_name","def task(self):\n return self._task","def task(self):\n return self._task","def task(self):\n return self._task","def task(self):\n return self._task","def task(self):\n return self._task","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def _get_id(self):\n return self.__id","def get_target(self):\n task = self.task.get_task(self.task_id)\n if 'name' in task:\n return str(task['name'])\n return str(task)","def id(self):\n return self.__id","def draw_task(self):\n task = self.taskList[0]\n #for agentObj in self.agents:\n # agentObj.set_current_task(task)\n self.agent.set_current_task(task)\n del self.taskList[0]\n return task","def get_output_task(self, name='0'):\n port = self.get_output(name).other\n if port is None:\n return None\n return port.task","def _get_current_task():\r\n return current_task","def _get_current_task():\r\n return current_task","def getRunningId(self):\n return( int(self.id.split('.')[2]) )","def get_id(self):\n return self.id","def get_id(self):\n return self.id","def get_id(self):\n return self.id","def get_id(self):\n return self.id","def get_id(self):\n return self.id","def get_id(self):\n return self.id","def get_id(self):\n return self.id","def get_id(self):\n return self.id","def get_id(self):\n return self.id","def get_id(self):\n return self.id"],"string":"[\n \"def task_id(self):\\n return self._task_id\",\n \"def task_id(self):\\n return self._task_id\",\n \"def task_id(self):\\n return self._task_id\",\n \"def task_id(self):\\n return self._task_id\",\n \"def taskid(self):\\n raise NotImplementedError('Must be implemented by subclass.')\",\n \"def task_id(self) -> str:\\n return self.get_from_redis(\\\"task_id\\\")\",\n \"def get_task_id(self):\\n if self.task_id:\\n return self.task_id\\n return (f'{self.task_type}_{self.get_source_system().lower()}'\\n f'.{self.get_source_subsystem().lower()}.{self.get_name().upper()}')\",\n \"def getTaskZoneId(self):\\n return self.getZoneId()\",\n \"def _make_task_id(self, task):\\n index = self._tasks.add(task)\\n task_id = '{name}-{idx}'.format(name=task.name, idx=index)\\n\\n return task_id\",\n \"def dst_task_id(self):\\n return struct.unpack('<H', self.pkt.payload[2:4])[0]\",\n \"def src_task_id(self):\\n return struct.unpack('<H', self.pkt.payload[4:6])[0]\",\n \"def dag_id(self):\\n if self.parallelize_task:\\n return f'{self.job_id_extension.get_parallel(self.job_id)}'\\n else:\\n return f'{self.job_id_extension.get_preparation(self.job_id)}'\",\n \"def get_id(self):\\n for id, thread in threading._active.items(): \\n if thread is self: \\n return id\",\n \"def get_id(self):\\n if hasattr(self, \\\"_thread_id\\\"):\\n return self._thread_id\\n for id, thread in threading._active.items():\\n if thread is self:\\n return id\",\n \"def get_id(self):\\n if hasattr(self, \\\"_thread_id\\\"):\\n return self._thread_id\\n for id, thread in threading._active.items():\\n if thread is self:\\n return id\",\n \"def get_task_id(self, position):\\n task_id = self.stn.get_task_id(position)\\n if task_id:\\n return task_id\\n else:\\n raise TaskNotFound\",\n \"def get_task_uuid(self):\\n\\t\\treturn call_sdk_function('PrlRunningTask_GetTaskUuid', self.handle)\",\n \"def thread_id(self):\\n return self._thread_id\",\n \"def create_task_id():\\n return str(int(round(time.time() * 10**9)))\",\n \"def pool_id ( self ):\\n return self._pool_id\",\n \"def node_id(self) -> int:\\r\\n return self._node_id\",\n \"def unique_id(self) -> str:\\n return str(self.coordinator.gios.station_id)\",\n \"def get_task_index(self):\\n return self.task_index\",\n \"def unique_id(self):\\n return self._id\",\n \"def unique_id(self):\\n return self._id\",\n \"def get_id(self):\\n\\n\\t\\treturn self.__id\",\n \"def establish_id(self):\\n if self.config.node_id is None:\\n self.config.node_id = str(uuid4()).replace('-', '')\\n return self.config.node_id\",\n \"def _get_id(self):\\n return self.id\",\n \"def portlet_id(self):\\n return id(self)\",\n \"def id(self):\\n\\t\\treturn self.__id\",\n \"def get_id(self):\\n pass\",\n \"def get_id(self):\\n pass\",\n \"def get_id(self):\\n pass\",\n \"def get_id(self):\\n pass\",\n \"def identity(self):\\n return self.id\",\n \"def get_threadbased_id(guarantee_uniq=False):\\n\\n return '{}:{}:{}:{}'.format(platform.node(), os.getpid(), str(threading.get_ident()),uuid.uuid4().hex if guarantee_uniq else '')\",\n \"def get_id(self):\\n return self.__id\",\n \"def get_id(self):\\n return self.__id\",\n \"def getid(self):\\n return self.__id\",\n \"def get_parent_id():\\n return getattr(threadlocal, \\\"parent_id\\\", None)\",\n \"def task(self) -> str:\\n return self._task\",\n \"def topology_name(self):\\n return self._topology_name\",\n \"def task(self):\\n return self._task\",\n \"def task(self):\\n return self._task\",\n \"def task(self):\\n return self._task\",\n \"def task(self):\\n return self._task\",\n \"def task(self):\\n return self._task\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def _get_id(self):\\n return self.__id\",\n \"def get_target(self):\\n task = self.task.get_task(self.task_id)\\n if 'name' in task:\\n return str(task['name'])\\n return str(task)\",\n \"def id(self):\\n return self.__id\",\n \"def draw_task(self):\\n task = self.taskList[0]\\n #for agentObj in self.agents:\\n # agentObj.set_current_task(task)\\n self.agent.set_current_task(task)\\n del self.taskList[0]\\n return task\",\n \"def get_output_task(self, name='0'):\\n port = self.get_output(name).other\\n if port is None:\\n return None\\n return port.task\",\n \"def _get_current_task():\\r\\n return current_task\",\n \"def _get_current_task():\\r\\n return current_task\",\n \"def getRunningId(self):\\n return( int(self.id.split('.')[2]) )\",\n \"def get_id(self):\\n return self.id\",\n \"def get_id(self):\\n return self.id\",\n \"def get_id(self):\\n return self.id\",\n \"def get_id(self):\\n return self.id\",\n \"def get_id(self):\\n return self.id\",\n \"def get_id(self):\\n return self.id\",\n \"def get_id(self):\\n return self.id\",\n \"def get_id(self):\\n return self.id\",\n \"def get_id(self):\\n return self.id\",\n \"def get_id(self):\\n return self.id\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.75476515","0.75476515","0.75476515","0.75476515","0.7357828","0.72557056","0.7198645","0.6637944","0.6620676","0.65653884","0.6474","0.6436455","0.63189775","0.6293882","0.6293882","0.62764555","0.6194142","0.61492884","0.6114325","0.611248","0.60441566","0.604313","0.6041296","0.59985995","0.59985995","0.5988955","0.59788394","0.5969808","0.5941835","0.59410745","0.59353393","0.59353393","0.59353393","0.59353393","0.5932347","0.59316975","0.5930219","0.5930219","0.5929875","0.5927883","0.59134746","0.5911602","0.5897528","0.5897528","0.5897528","0.5897528","0.5897528","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854902","0.5854396","0.5852411","0.5829994","0.58296573","0.58276826","0.58276826","0.58250964","0.58201337","0.58201337","0.58201337","0.58201337","0.58201337","0.58201337","0.58201337","0.58201337","0.58201337","0.58201337"],"string":"[\n \"0.75476515\",\n \"0.75476515\",\n \"0.75476515\",\n \"0.75476515\",\n \"0.7357828\",\n \"0.72557056\",\n \"0.7198645\",\n \"0.6637944\",\n \"0.6620676\",\n \"0.65653884\",\n \"0.6474\",\n \"0.6436455\",\n \"0.63189775\",\n \"0.6293882\",\n \"0.6293882\",\n \"0.62764555\",\n \"0.6194142\",\n \"0.61492884\",\n \"0.6114325\",\n \"0.611248\",\n \"0.60441566\",\n \"0.604313\",\n \"0.6041296\",\n \"0.59985995\",\n \"0.59985995\",\n \"0.5988955\",\n \"0.59788394\",\n \"0.5969808\",\n \"0.5941835\",\n \"0.59410745\",\n \"0.59353393\",\n \"0.59353393\",\n \"0.59353393\",\n \"0.59353393\",\n \"0.5932347\",\n \"0.59316975\",\n \"0.5930219\",\n \"0.5930219\",\n \"0.5929875\",\n \"0.5927883\",\n \"0.59134746\",\n \"0.5911602\",\n \"0.5897528\",\n \"0.5897528\",\n \"0.5897528\",\n \"0.5897528\",\n \"0.5897528\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854902\",\n \"0.5854396\",\n \"0.5852411\",\n \"0.5829994\",\n \"0.58296573\",\n \"0.58276826\",\n \"0.58276826\",\n \"0.58250964\",\n \"0.58201337\",\n \"0.58201337\",\n \"0.58201337\",\n \"0.58201337\",\n \"0.58201337\",\n \"0.58201337\",\n \"0.58201337\",\n \"0.58201337\",\n \"0.58201337\",\n \"0.58201337\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.75019264"},"document_rank":{"kind":"string","value":"4"}}},{"rowIdx":6195,"cells":{"query":{"kind":"string","value":"Defines a 'plane' (1D) topology for a given mesh resolution. This function is to be used when topo/discretization features come from an external routine (e.g. scales or fftw)"},"document":{"kind":"string","value":"def plane_precomputed(cls, localres, global_start, cdir=None, **kwds):\n msg = 'parameter is not required for plane_precomputed'\n msg += ' topology construction.'\n assert 'dim' not in kwds, 'dim ' + msg\n assert 'shape ' not in kwds, 'shape ' + msg\n assert 'cutdir ' not in kwds, 'cutdir ' + msg\n # Local mesh :\n global_start = npw.asdimarray(global_start)\n localres = npw.asdimarray(localres)\n mesh = Mesh(kwds['domain'], kwds['discretization'],\n localres, global_start)\n # MPI layout\n domain = kwds['domain']\n cutdir = npw.zeros(domain.dimension, dtype=npw.bool)\n\n if cdir is not None:\n cutdir[cdir] = True\n else:\n if ORDER == 'C':\n cutdir[0] = True\n else:\n cutdir[-1] = True\n\n return cls(mesh=mesh, cutdir=cutdir, **kwds)"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def WritePlane(self):\n if not self.__train:\n print('ERROR: Must use Train before WritePlane')\n sys.exit(-1)\n if not self.__openPlaneO:\n print('ERROR: Must use OpenPlaneO before WritePlane')\n sys.exit(-1)\n\n # Defines angular dimensions\n self.__nc_RSoft_O.createDimension('type', self.__n_type)\n\n # Defines variables\n if self.__containsRadial:\n rad_plane_id = self.__nc_RSoft_O.createVariable(\\\n 'radial_plane', 'f4', \\\n ('type','radial_structure_functions'))\n rad_plane_id[:] = self.radial_plane\n if self.__containsAngular:\n ang_plane_id = self.__nc_RSoft_O.createVariable(\\\n 'angular_plane', 'f4', \\\n ('type','angular_structure_functions'))\n ang_plane_id[:] = self.angular_plane\n intercept_id_O = self.__nc_RSoft_O.createVariable(\\\n 'intercept', 'f4', ('type'))\n intercept_id_O[:] = self.intercept","def polyPlane(*args, axis: Union[List[float, float, float], bool]=None, createUVs: Union[int,\n bool]=1, height: Union[float, bool]=1.0, subdivisionsHeight: Union[int, bool]=0,\n subdivisionsWidth: Union[int, bool]=10, subdivisionsX: Union[int, bool]=5,\n subdivisionsY: Union[int, bool]=5, texture: Union[int, bool]=1, width:\n Union[float, bool]=1.0, caching: bool=True, constructionHistory: bool=True, name:\n AnyStr=\"\", nodeState: Union[int, bool]=0, object: bool=True, q=True, query=True,\n e=True, edit=True, **kwargs)->Union[List[AnyStr], Any]:\n pass","def _prepare_plane(self):\n verticies = [\n # main plane - note that the mainplane is scaled so the mat_plane\n # matrix will it transform to the correct coordinates\n -self.i_border[0]/self._scaling[0], self.i_border[1]/self._scaling[1],\n -self.i_border[0]/self._scaling[0], -(self.o_wh[1]-self.i_border[1])/self._scaling[1],\n (self.o_wh[0]-self.i_border[0])/self._scaling[0], -(self.o_wh[1]-self.i_border[1])/self._scaling[1],\n (self.o_wh[0]-self.i_border[0])/self._scaling[0], -(self.o_wh[1]-self.i_border[1])/self._scaling[1],\n (self.o_wh[0]-self.i_border[0])/self._scaling[0], self.i_border[1]/self._scaling[1],\n -self.i_border[0]/self._scaling[0], self.i_border[1]/self._scaling[1],\n\n # coord plane\n 0, 0,\n 0, -self.o_wh[1],\n self.o_wh[0], -self.o_wh[1],\n self.o_wh[0], -self.o_wh[1],\n self.o_wh[0], 0,\n 0, 0,\n\n # axes\n 0, -self.o_wh[1], self.o_wh[0], -self.o_wh[1], #x\n 0, 0, 0, -self.o_wh[1], #y\n ]\n\n colors = [\n 1.0, 1.0, 1.0, 1.0, # outer box XXX Remove outer box...\n 1.0, 1.0, 1.0, 1.0,\n 1.0, 1.0, 1.0, 1.0,\n 1.0, 1.0, 1.0, 1.0,\n 1.0, 1.0, 1.0, 1.0,\n 1.0, 1.0, 1.0, 1.0,\n .9, .9, .9, 9.0, # plot box\n .9, .9, .9, 9.0,\n .9, .9, .9, 9.0,\n .9, .9, .9, 9.0,\n .9, .9, .9, 9.0,\n .9, .9, .9, 9.0,\n 0.0, 0.0, 0.0, 1.0, #lines\n 0.0, 0.0, 0.0, 1.0,\n 0.0, 0.0, 0.0, 1.0,\n 0.0, 0.0, 0.0, 1.0,\n ]\n\n self._fonts = []\n for u in range(1, self._unit_count[0]+1):\n verticies.append(self._unit_w[0]*u)\n verticies.append(-self.o_wh[1]+0.02)\n verticies.append(self._unit_w[0]*u)\n verticies.append(-self.o_wh[1]-0.02)\n colors += [0.0, 0.0, 0.0, 1.0]\n colors += [0.0, 0.0, 0.0, 1.0]\n self._fonts.append([\n '{:.2f}'.format(u*(self.i_axis[0]/self._unit_count[0])-self.i_origin[0]),\n (self._unit_w[0]*u+self.i_border[0]-0.05)*self._scaling[0],\n (-self.o_wh[1]+(self.i_border[3])*0.5)\n ])\n for u in range(0, self._unit_count[1]):\n verticies.append(0.02)\n verticies.append(-self._unit_w[1]*u)\n verticies.append(-0.02)\n verticies.append(-self._unit_w[1]*u)\n colors += [0.0, 0.0, 0.0, 1.0]\n colors += [0.0, 0.0, 0.0, 1.0]\n self._fonts.append([\n '{:.2f}'.format(self.i_axis[1]-u*self.i_axis[1]/self._unit_count[1]-self.i_origin[1]),\n (0.025)*self._scaling[0],\n (-(self._unit_w[1])*u-self.i_border[1]+0.01)*self._scaling[1]\n ])\n\n self._draw_plane_indicies = (0, 12)\n self._draw_line_indicies = (12, 4+self._unit_count[0]*2+self._unit_count[1]*2)\n\n # convert data into valid data format\n verticies = numpy.array(verticies, dtype=numpy.float32)\n colors = numpy.array(colors, dtype=numpy.float32)\n\n self._plane_vao = util.VAO()\n self._plane_vbo = util.VBO(2)\n\n with self._plane_vao:\n # plane verticies\n with self._plane_vbo.get(0):\n glBufferData(GL_ARRAY_BUFFER, ArrayDatatype.arrayByteCount(verticies), verticies, GL_STATIC_DRAW)\n glVertexAttribPointer(self.plane_shader.attributeLocation('vertex_position'), 2, GL_FLOAT, GL_FALSE, 0, None)\n glEnableVertexAttribArray(0)\n\n # place vertex colors\n with self._plane_vbo.get(1):\n glBufferData(GL_ARRAY_BUFFER, ArrayDatatype.arrayByteCount(colors), colors, GL_STATIC_DRAW)\n glVertexAttribPointer(self.plane_shader.attributeLocation('vertex_color'), 4, GL_FLOAT, GL_FALSE, 0, None)\n glEnableVertexAttribArray(1)","def vplane(self, fig=None):\n #TODO more general multi-axis layout...\n figsize = (9, 6.5) # good for letter paper\n if fig is None: fig = plt.figure(figsize=figsize)\n else: fig.set_size_inches(*figsize)\n axkw = dict(frameon = True)\n left, width = 0.075, 0.6\n bh = 0.11\n pad = 0.04\n depth_ax = fig.add_axes((left, 6*pad+4.5*bh, width, bh*2), **axkw)\n axkw.update(dict(sharex = depth_ax))\n pitch_ax = fig.add_axes((left, 5*pad+3.5*bh, width, bh), **axkw)\n buoyancy_ax = fig.add_axes((left, 4*pad+2.5*bh, width, bh), **axkw)\n mass_ax = fig.add_axes((left, 3*pad + 1.5*bh, width, bh), **axkw)\n control_surface_ax = fig.add_axes((left, 2*pad + bh/2, width, bh), **axkw)\n control_mode_ax = fig.add_axes((left, pad, width, bh/2), **axkw)\n # TODO adjust scale and coverage for each axes\n # TODO do this again now that middle labels are removed\n\n self.plot_timeseries('depth', '-', axes=depth_ax)\n self.plot_timeseries('platform_pitch_angle', axes=pitch_ax)\n self.plot_timeseries('platform_mass_position', axes=mass_ax)\n self.plot_timeseries('platform_buoyancy_position', axes=buoyancy_ax)\n self.plot_timeseries('platform_elevator_angle', axes=control_surface_ax)\n # TODO Include another panel with VerticalControl mode (iff present)\n\n # TODO only if engineering data is requested...\n ### add to depth axes ###\n depth_science = {\n 'Depth_Keller/depth': 'c-',\n 'CTD_NeilBrown/depth': 'k-',\n 'Depth_MSI_US300/depth': 'm-'}\n for k, v in depth_science.items():\n try: self.plot_timeseries(k, v, axes=depth_ax)\n except: print('no {0}'.format(k))\n\n depth_engineering = {\n 'VerticalControl/smoothDepthInternal': 'r-',\n 'VerticalControl/depthCmd': 'g-',\n 'VerticalControl/depthErrorInternal': 'g:'}\n for k, v in depth_engineering.items():\n try: self.plot_timeseries(k, v, axes=depth_ax)\n except: print('no {0}'.format(k))\n # TODO only if sw debug flag is set \n depth_rate_engineering = {\n 'VerticalControl/depthRateCmd': 'gray',\n 'VerticalControl/depth_rate': 'gray', # XXX why same color?\n }\n for k, v in depth_rate_engineering.items():\n try: \n self.plot_timeseries(k, vi, axes=depth_ax, \n convert=oalib.make_multiplier(100))\n except: print('no {0}'.format(k))\n ### add to pitch axes ###\n pitch_engineering = {\n 'AHRS_sp3003D/platform_pitch_angle': 'k-', \n 'DVL_micro/platform_pitch_angle': 'm-',\n 'AHRS_3DMGX3/platform_pitch_angle': 'c-',\n 'InternalSim/platform_pitch_angle': ':r',\n }\n for k, v in pitch_engineering.items():\n try: self.plot_timeseries(k, v, axes=pitch_ax)\n except: print('no {0}'.format(k))\n ### add to mass axes ###\n mass_engineering = {\n 'VerticalControl/massPositionAction': 'g-', \n 'VerticalControl/massIntegralInternal': 'c-',\n 'MassServo/platform_mass_position': 'r-',\n #'VerticalControl/massPitchErrorInternal': ':r',\n }\n for k, v in mass_engineering.items():\n try: self.plot_timeseries(k, v, axes=mass_ax)\n except: print('no {0}'.format(k))\n ### add to buoyancy axes ###\n buoyancy_engineering = {\n 'VerticalControl/buoyancyAction': 'm-',\n 'BuoyancyServo/platform_buoyancy_position': 'b-',\n }\n for k, v in buoyancy_engineering.items():\n try: \n self.plot_timeseries(k, v,\n# convert=oalib.make_multiplier(-10), \n axes=buoyancy_ax)\n except: print('no {0}'.format(k))\n ### add to control surface axes ###\n control_surface_engineering = {\n 'VerticalControl/elevatorAngleAction': 'm-', \n 'VerticalControl/elevatorIntegralInternal': 'm:',\n 'ElevatorServo/platform_elevator_angle': 'c-',\n }\n for k, v in control_surface_engineering.items():\n try: \n self.plot_timeseries(k, v, convert = np.rad2deg, \n axes=control_surface_ax)\n except: print('no {0}'.format(k))\n \n\n # TODO only if supporting data is requested\n ### add other supporting data ###\n try: self.plot_timeseries('CTD_NeilBrown/depth', 'k-', axes=depth_ax)\n except: print('no CTD_NeilBrown/depth')\n try: self.plot_timeseries('Depth_MSI_US300', 'm-', axes=depth_ax)\n except: print('no Depth_MSI_US300')\n\n\n ### print additional information ###\n buoyancyNeutral = ('Config/Control/buoyancyNeutral',\n 'Config/Servo/buoyancyNeutral')\n for s in buoyancyNeutral:\n try:\n print('{0} = {1} {2}'.format(s, self[s+'/value'], self[s+'/units']))\n except:\n print('{0} not found'.format(s))\n \n# VertMd(0=N/A,1=Surf,2=Dep,3=DepRt,4=Pit0,5=Pit,6=PitRt,7=M&E,8=Flt),\n# VertHoldMd(0=N/A,1=Ms,2=El,3=Both)\n try:\n v, t = self.timeseries('VerticalControl/verticalMode')\n oalib.plot_date_blocks(t, v, axes=control_mode_ax, colormap=mpl.cm.jet)\n except: print('VerticalControl/verticalMode not found')\n\n depth_ax.invert_yaxis()\n for ax in fig.get_axes():\n ax.grid(True)\n try:\n ax.legend(loc='center left', bbox_to_anchor=(1, 0.5),\n fontsize='small')\n except:\n print('uncaught exception for legend...')\n for ax in fig.get_axes()[:-1]:\n plt.setp(ax.get_xticklabels(), visible=False)\n\n depth_ax.set_title(os.path.basename(self.filename))\n control_mode_ax.xaxis.set_major_formatter(mpl.dates.DateFormatter('%H:%M'))\n plt.setp(control_mode_ax.get_xticklabels(), rotation=30,\n fontsize='small')","def create_surface_plane(align_to = None, axis = 'x', width = 0.5, freeze_tm = True):\n axis_dict = {'x': (1, 0, 0), 'y': (0, 1, 0), 'z': (0, 0, 1)}\n res = pm.nurbsPlane(\n axis = axis_dict[axis],\n width = width,\n degree = 1,\n constructionHistory = False\n )[0]\n if align_to is not None:\n transformation.align(res, align_to)\n if freeze_tm:\n transformation.freeze_transform(res)\n return res","def test_create(self):\n f = azplugins.restrain.plane(group=hoomd.group.all(), point=(0,0,0), normal=(1,0,0), k=2.0)\n\n f.set_params(k=5.0)\n f.set_params(k=8)\n\n f.set_params(point=(0,0,1))\n f.set_params(point=[0,0,1])\n f.set_params(point=np.array([0,0,1]))\n\n f.set_params(normal=(0,0,1))\n f.set_params(normal=[0,0,1])\n f.set_params(normal=np.array([0,0,1]))\n\n f.set_params(point=(0,0,0), normal=(1,0,0), k=10.0)","def build_topology(self):\n# errstr = \"build_topology() is not implemented.\\n\"\n# errstr += textwrap.dedent(self.build_topology.__doc__)\n# raise NotImplementedError(errstr)\n pass # May be a 1-compartment neuron. No need to abstract. ","def create_plane(self):\n\n # First we calculate our point increment for both the x and y values\n inc_x = (self.xmax - self.xmin)/(self.xlen - 1)\n inc_y = (self.ymax - self.ymin)/(self.ylen - 1)\n\n # This for-loop will add every x-value with every y-value, saving the values column wise\n # i.e. (-10,-10), (-10,-9), (-10.-8),...,(-10,n) for n = our y-values.\n # store these combinations into a list, and add that to our plane. \n # The nested loop will then traverse again and will get the combinations for the next x-value.\n # The loop will continue until all x-values and y-value combinations are added to our plane.\n for y in range(0, self.ylen + 1):\n temp_list = []\n for x in range(0, self.xlen + 1):\n temp_list.append(self.f((self.xmin + x*inc_x) + (self.ymin + y*inc_y)*1j))\n self.plane.append(temp_list)","def plane(self):\n return plane(self.N, self.o)","def GetPlane(plane):\r\n pass","def plane(*args, length: float=0.0, name: AnyStr=\"\", position: List[float, float, float]=None,\n rotation: List[float, float, float]=None, size: float=0.0, width: float=0.0,\n **kwargs)->AnyStr:\n pass","def plane(self):\r\n from lsst.analysis import utils\r\n return utils.fitplane(self.points, self.z)","def SetPlaneMode(self, *args):\n return _ShapeUpgrade.ShapeUpgrade_ShapeConvertToBezier_SetPlaneMode(self, *args)","def build_topology(config):\n top_type = config['Metapopulation']['topology']\n assert top_type.lower() in ['moore', 'vonneumann', 'smallworld',\n 'complete', 'regular']\n\n if top_type.lower() == 'moore':\n return build_topology_moore(config)\n elif top_type.lower() == 'vonneumann':\n return build_topology_vonneumann(config)\n elif top_type.lower() == 'smallworld':\n return build_topology_smallworld(config)\n elif top_type.lower() == 'complete':\n return build_topology_complete(config)\n elif top_type.lower() == 'regular':\n return build_topology_regular(config)","def create_plot_plane_2d(axis=(1.0, 1.0), origin=(0.0,0.0), size=(2.0,2.0)):\n ft = ImageFont.truetype (FONT_RESOURCES_DIR+\"/courier.ttf\", 12)\n gl_font = GlFont('', ft)\n gl_font.color = [0.0, 0, 0, 1.0]\n gl_plot = PlotPlane2d(gl_font)\n gl_plot.i_axis = axis\n gl_plot.i_origin = origin\n gl_plot.o_wh = size\n gl_plot.i_axis_units = (axis[0]/10, axis[1]/10)\n\n gl_plot.prepare()\n return gl_plot","def nurbsPlane(*args, axis: Union[List[float, float, float], bool]=None, caching: bool=True,\n degree: Union[int, bool]=3, lengthRatio: Union[float, bool]=1.0, nodeState:\n Union[int, bool]=0, patchesU: Union[int, bool]=1, patchesV: Union[int, bool]=1,\n pivot: Union[List[float, float, float], bool]=None, width: Union[float,\n bool]=1.0, constructionHistory: bool=True, name: AnyStr=\"\", object: bool=True,\n polygon: int=0, q=True, query=True, e=True, edit=True,\n **kwargs)->Union[List[AnyStr], Any]:\n pass","def image_plane_mesh_grid_from(\r\n self,\r\n image_plane_data_grid: Grid2D,\r\n adapt_data: np.ndarray = None,\r\n settings=SettingsPixelization(),\r\n ):\r\n return None","def SetPlaneMode(self, *args):\n return _ShapeUpgrade.ShapeUpgrade_ConvertSurfaceToBezierBasis_SetPlaneMode(self, *args)","def p(self):\n return 'Plane'","def GetPlaneMode(self, *args):\n return _ShapeUpgrade.ShapeUpgrade_ShapeConvertToBezier_GetPlaneMode(self, *args)","def create_fixed_distance_to_plane_constraint():\n return FixedDistanceToPlaneConstraint()","def __init__(self):\n Page.__init__(self, u\"Paraboloide Elíptico<br><br>F(x,y)=(x, y, x<sup>2</sup>/a<sup>2</sup> + y<sup>2</sup>/b<sup>2</sup>)\")\n\n z = 0.5\n par = RevolutionPlot3D(lambda r, t: r ** 2 + z, (0, 1), (0, 2 * pi))\n\n x, y, z2, u, v, cose, sen, t = createVars(['x', 'y', 'z', 'u', 'v', 'cos', 'sen', 't'])\n\n mesh1 = Plot3D(lambda x, y, h: h * (x ** 2 + y ** 2 + z - .01), (-1, 1), (-1, 1))\n mesh1.addEqn(x**2+y**2 - z2**2 == 1)\n mesh1.addFunction(lambda x, y, h: h * (x ** 2 + y ** 2 + z + .01))\n mesh1.setLinesVisible(True)\n mesh1.setMeshVisible(False)\n mesh1.setBoundingBox(zrange=(-1, 1.5))\n par.setAmbientColor(_1(145, 61, 74))\n par.setDiffuseColor(_1(145, 61, 74))\n par.setSpecularColor(_1(145, 61, 74))\n baseplane = BasePlane()\n baseplane.setHeight(0)\n baseplane.setRange((-2, 2, 7))\n\n self.addChild(par)\n self.addChild(mesh1)\n self.addChild(baseplane)","def plane(self):\n return Plane(Point(0, self.evaluations.exposedWing.edges[2].point1.y, 0), Vector(0, 1, 0),\n hidden=True)","def network_topology(voxels, clusters, primaries, edges, mode='sphere'):\n # Define the arrays of node positions (barycenter of voxels in the cluster)\n pos = np.array([voxels[c].cpu().numpy().mean(0) for c in clusters])\n\n # Define the node features (label, color)\n n = len(clusters)\n node_labels = ['%d (%0.1f, %0.1f, %0.1f)' % (i, pos[i,0], pos[i,1], pos[i,2]) for i in range(n)]\n \n node_colors = ['#ff7f0e' if i in primaries else '#1f77b4' for i in range(n)]\n\n # Define the nodes and their connections\n graph_data = []\n edge_vertices = []\n if mode == 'sphere':\n # Define the node size\n logn = np.array([np.log(len(c)) for c in clusters])\n node_sizes = np.interp(logn, (logn.min(), logn.max()), (5, 50))\n \n # Define the nodes as sphere of radius proportional to the log of the cluster voxel content\n graph_data.append(go.Scatter3d(x = pos[:,0], y = pos[:,1], z = pos[:,2],\n name = 'clusters',\n mode = 'markers',\n marker = dict(\n symbol = 'circle',\n size = node_sizes,\n color = node_colors,\n colorscale = 'Viridis',\n line = dict(color='rgb(50,50,50)', width=0.5)\n ),\n text = node_labels,\n hoverinfo = 'text'\n ))\n\n # Define the edges center to center\n edge_vertices = np.concatenate([[pos[i], pos[j], [None, None, None]] for i, j in zip(edges[0], edges[1])])\n\n elif mode == 'hull':\n # For each cluster, add the convex hull of all its voxels\n graph_data += [go.Mesh3d(alphahull =10.0,\n name = '',\n x = voxels[c][:,0],\n y = voxels[c][:,1],\n z = voxels[c][:,2],\n color = node_colors[i],\n opacity = 0.3,\n text = node_labels[i],\n hoverinfo = 'text'\n ) for i, c in enumerate(clusters)]\n\n # Define the edges closest pixel to closest pixel\n import scipy as sp\n edge_vertices = []\n for i, j in zip(edges[0], edges[1]):\n vi, vj = voxels[clusters[i]], voxels[clusters[j]]\n d12 = sp.spatial.distance.cdist(vi, vj, 'euclidean')\n i1, i2 = np.unravel_index(np.argmin(d12), d12.shape)\n edge_vertices.append([vi[i1].cpu().numpy(), vj[i2].cpu().numpy(), [None, None, None]])\n \n edge_vertices = np.concatenate(edge_vertices)\n \n else:\n raise ValueError\n \n # Initialize a graph that contains the edges\n graph_data.append(go.Scatter3d(x = edge_vertices[:,0], y = edge_vertices[:,1], z = edge_vertices[:,2],\n mode = 'lines',\n name = 'edges',\n line = dict(\n color = 'rgba(50, 50, 50, 0.5)',\n width = 1\n ),\n hoverinfo = 'none'\n ))\n\n # Return\n return graph_data","def set_topology(self, mapsize = None, mapshape = 'planar', lattice = 'rect', mask = None, compname = None):\n self.mapshape = mapshape\n self.lattice = lattice\n \n #to set mask\n if mask == None: \n self.mask = np.ones([1,self.dim])\n else:\n self.mask = mask\n \n \n #to set map size\n if mapsize == None: \n tmp = int(round(np.sqrt(self.dlen)))\n self.nnodes = tmp\n self.mapsize = [int(3./5*self.nnodes), int(2./5*self.nnodes)]\n else:\n if len(mapsize)==2:\n if np.min(mapsize) == 1:\n self.mapsize = [1, np.max(mapsize)]\n else: \n self.mapsize = mapsize\n elif len(mapsize) == 1:\n #s = int (mapsize[0]/2)\n self.mapsize = [1 ,mapsize[0]]\n print 'input was considered as node numbers'\n print 'map size is [{0},{1}]'.format(s,s) \n self.nnodes = self.mapsize[0]*self.mapsize[1]\n \n # to set component names\n if compname == None: \n try:\n cc = list()\n for i in range(0,self.dim):\n cc.append ('Variable-'+ str(i+1))\n self.compname = np.asarray(cc)[np.newaxis,:]\n except:\n pass\n print 'no data yet: plesae first set trainign data to the SOM'\n else:\n try:\n dim = getattr(self,'dim')\n if len(compname) == dim:\n self.compname = np.asarray(compname)[np.newaxis,:]\n else:\n print 'compname should have the same size'\n except:\n pass\n print 'no data yet: plesae first set trainign data to the SOM'","def get_plane(dset, xaxis, yaxis, slices, **kw):\n\n # Build quad meshes from sorted grids\n xgrid = dset.dims[xaxis][0][indices[xaxis]]\n ygrid = dset.dims[yaxis][0][indices[yaxis]]\n xorder = np.argsort(xgrid)\n yorder = np.argsort(ygrid)\n xmesh, ymesh = quad_mesh(xgrid[xorder], ygrid[yorder], **kw)\n\n # Select and arrange data\n data = dset[slices]\n if xi < yi:\n data = data.T\n data = data[yorder]\n data = data[:, xorder]\n\n return xmesh, ymesh, data","def plot_mpr_topology(options, tags=None, cursor=None):\n options['cur_src'] = 'topo'\n options['prefix'] = \"mpr\"\n ################################################################################\n locs = options['locs']\n colors = options['color2'](pylab.linspace(0, 1, 101))\n ################################################################################\n circ_max = 5\n line_max = 10\n floor_factor = 2\n floor_skew = -0.25\n line_min = 1\n\n hosts = get_hosts(options)\n mprs = cursor.execute('''\n SELECT DISTINCT(host)\n FROM nhdp_mpr_selectors\n ''').fetchall()\n\n for q, (tag_key, tag_id, nhdp_hi, nhdp_ht, mpr_minpdr) in enumerate(tags):\n logging.info('tag_id=\\\"%s\\\" (%d/%d)', tag_id, q+1, len(tags))\n min_max_time = cursor.execute('''\n SELECT min(time), max(time)\n FROM nhdp_he\n WHERE tag=?\n ''',(tag_key,)).fetchone()\n fig2d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate')\n fig3d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate', ThreeD=True)\n if not q:\n fig3d_onlynodes = MyFig(options, xlabel='x Coordinate [m]', ylabel='y Coordinate [$m$]', ThreeD=True)\n\n min_x = min_y = min_z = numpy.infty\n max_x = max_y = max_z = 0\n\n # first draw the edges...\n for nr, (host) in enumerate(hosts):\n logging.info(' [%d/%d] drawing edges for host=%s', nr+1, len(hosts), host)\n try:\n host_xpos, host_ypos, host_zpos = locs[host]\n except KeyError:\n logging.warning('no position found for node %s', host)\n continue\n ################################################################################\n # host is the receiving router, i.e. in our case the MPR\n # src is the sending router, i.e. the MPR selector\n # We only want to draw an edge if it connects an MPR with its SELECTOR.\n #\n ################################################################################\n cursor.execute('''\n SELECT DISTINCT(src), pdr\n FROM eval_helloPDR AS pdr JOIN nhdp_mpr_selectors AS mpr\n ON pdr.host = mpr.host AND pdr.tx_if = mpr.mprselector\n WHERE pdr.tag_key=? AND pdr.host=? AND mpr.time BETWEEN ? AND ?\n ''', (tag_key, host, min_max_time[0], min_max_time[1]))\n for src, pdr in cursor.fetchall():\n try:\n src_xpos, src_ypos, src_zpos = locs[src]\n except KeyError:\n logging.warning('no position found for node %s', src)\n continue\n\n fig2d.ax.plot(\n [host_xpos+host_zpos*floor_skew*floor_factor, src_xpos+src_zpos*floor_skew*floor_factor],\n [host_ypos+host_zpos*floor_factor, src_ypos+src_zpos*floor_factor],\n linestyle='-', color=colors[pdr*100], linewidth=max(line_max*pdr, line_min), alpha=0.3)\n\n fig3d.ax.plot(\n [host_xpos, src_xpos],\n [host_ypos, src_ypos],\n [host_zpos, src_zpos],\n linestyle='-', color=colors[pdr*100], linewidth=max(line_max*pdr, line_min), alpha=0.3)\n\n # draw the nodes\n for host in hosts:\n logging.info(' [%d/%d] drawing node %s', nr+1, len(hosts), host)\n try:\n xpos, ypos, zpos = locs[host]\n except KeyError:\n logging.warning('no position found for node %s', host)\n continue\n\n max_x = max(xpos, max_x)\n max_y = max(ypos, max_y)\n min_x = min(xpos, min_x)\n min_y = min(ypos, min_y)\n max_z = max(zpos, max_z)\n min_z = max(zpos, min_z)\n if (host,) in mprs:\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='blue', ms=circ_max)\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color='blue', ms=circ_max)\n else:\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='black', ms=circ_max)\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color='black', ms=circ_max)\n if not q:\n color = 'black'\n if host.startswith('a6'):\n color = 'red'\n elif host.startswith('a3'):\n color = 'blue'\n elif host.startswith('a7'):\n color = 'orange'\n fig3d_onlynodes.ax.plot([xpos], [ypos], [zpos], 'o', color=color, ms=circ_max)\n fig2d.colorbar = fig2d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\n fig3d.colorbar = fig3d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\n drawBuildingContours(fig3d.ax, options)\n drawBuildingContours(fig3d_onlynodes.ax, options)\n\n alinspace = numpy.linspace(0, 1, 100)\n alinspace = numpy.vstack((alinspace, alinspace))\n for tax in [fig2d.colorbar, fig3d.colorbar]:\n tax.imshow(alinspace, aspect='auto', cmap=options['color2'])\n tax.set_xticks(pylab.linspace(0, 100, 5))\n tax.set_xticklabels(['$%.2f$' % l for l in pylab.linspace(0, 1, 5)], fontsize=0.8*options['fontsize'])\n tax.set_yticks([])\n tax.set_title('$PDR$', size=options['fontsize'])\n fig2d.ax.axis((min_x-10, max_x+10, min_y-10, max_y+10+max_z*floor_factor+10))\n fig2d.save('2d_topology_hi_%d_ht_%d_minpdr_%.2f' % (nhdp_hi, nhdp_ht, mpr_minpdr))\n fig3d.save('3d_topology_hi_%d_ht_%d_minpdr_%.2f' % (nhdp_hi, nhdp_ht, mpr_minpdr))\n if not q:\n fig3d_onlynodes.save('3d_topology_only_nodes_hi_%d_ht_%d_minpdr_%.2f' % (nhdp_hi, nhdp_ht, mpr_minpdr))","def cal_topology_feature(self):\n self.NPL()\n self.topo_efficiency_cal()\n self.efficiency_cal()\n self.cluster_cal()\n self.topo_diameter()\n self.spatial_diameter()","def ggpl_bone_structure(file_name):\n def planeStructure(beamSection, pillarSection, distancePillars, intersectHeights):\n fStructs = []\n \n \"\"\" createFinalStruct\n \n Questo metodo crea una pilastro senza travi\n \n @param startPoint: Il punto di intersezione del pilastro con la base del piano di lavoro\n @param height: L'altezza del pilastro\n @returns: Il pilastro\n \"\"\"\n def createFinalStruct(startPoint, height):\n pillar = CUBOID([pillarSection[0], pillarSection[1], height])\n return STRUCT([T(2)(startPoint), pillar])\n\n \"\"\" createFStruct\n \n Questo metodo crea la struttura portante con il pilastro e le travi di riferimento\n \n @param startPoint: Il punto di intersezione del pilastro con la base del piano di lavoro\n @param height: L'altezza del pilastro\n @param lengthBeam: La lunghezza delle travi\n @returns: Il pilastro\n \"\"\"\n def createFStruct(startPoint, height, lengthBeam):\n fStruct = []\n\n fStruct.append(createFinalStruct(startPoint, height))\n hPillar = 0\n for i in range(len(intersectHeights)):\n beam = CUBOID([beamSection[1], lengthBeam, beamSection[0]])\n hPillar += intersectHeights[i]\n fStruct.append(STRUCT([\n T(3)(hPillar),\n T(2)(pillarSection[1] + startPoint),\n beam\n ]))\n return STRUCT(fStruct)\n\n height = SUM(intersectHeights) + beamSection[1]\n\n startDistance = 0\n for iterator in range(len(distancePillars)):\n fStructs.append(createFStruct(startDistance, height, distancePillars[iterator]))\n\n startDistance = startDistance + pillarSection[1] + distancePillars[iterator]\n\n fStructs.append(createFinalStruct(startDistance, height))\n\n return STRUCT(fStructs)\n \n \"\"\" createTrasversalBeam\n \n Questa funzione crea le travi di collegamento tra una parete e l'altra\n \n @param beanSection: una tupla (bx,bz) che contiene la dimensione delle travi\n @param pillarSection: una tupla (px,py) che contiene la dimensione dei pilastri\n @param distancePillars: una lista di distanze relative tra un pilastro e l'altro\n @param intersectHeights: una lista di altezze relative che indicano la distranza tra una trave e l'altra sull'asse x\n @returns: la struttura base, che corrisponde ad una parete dell'edificio\n \"\"\"\n def createTrasversalBeam(distance, beamSection, pillarSection, distancePillars, intersectHeights):\n y = []\n for index in range(len(distancePillars)):\n y.append(pillarSection[1])\n y.append(- distancePillars[index])\n y.append(pillarSection[1])\n\n x = [\n - pillarSection[0],\n distance\n ]\n\n z = []\n for i in range(len(intersectHeights)):\n if i == 0:\n z.append(-intersectHeights[i])\n else:\n z.append(-intersectHeights[i] + beamSection[1])\n z.append(beamSection[1])\n\n return PROD([\n PROD([QUOTE(x), QUOTE(y)]),\n QUOTE(z)\n ])\n \n \"\"\" parseCSV\n \n Questo metodo prende in input un file_name che indica il file csv da parsare per avere le informazioni della struttura\n \n Argomenti:\n file_name (string): il file name del file csv\n \n Yields:\n transaction: il vettore di traslazione tra una parete e l'altra\n beanSection: una tupla (bx,bz) che contiene la dimensione delle travi\n pillarSection: una tupla (px,py) che contiene la dimensione dei pilastri\n distancePillars: una lista di distanze relative tra un pilastro e l'altro\n intersectHeights: una lista di altezze relative che indicano la distranza tra una trave e l'altra sull'asse x\n \"\"\"\n def parseCSV(file_name):\n odd = True\n transaction = None\n with open(file_name, 'rb') as csvfile:\n builderreader = csv.reader(csvfile)\n\n for row in builderreader:\n if odd:\n odd = False\n transaction = [float(row[0]), float(row[1]), float(row[2])]\n else:\n odd = True\n beamSection = [float(row[0]), float(row[1])]\n pillarSection = [float(row[2]), float(row[3])]\n\n distancePillars = []\n start_point = 5\n finish_point = int(row[4]) + start_point\n for index in range(start_point, finish_point):\n distancePillars.append(int(row[index]))\n\n intersectHeights = []\n start_point = finish_point + 1\n finish_point = int(row[finish_point]) + start_point\n for index in range(start_point, finish_point):\n intersectHeights.append(int(row[index]))\n\n yield transaction, beamSection, pillarSection, distancePillars, intersectHeights\n\n frames = []\n for transaction, beamSection, pillarSection, distancePillars, intersectHeights in parseCSV(file_name):\n frames.append(T(2)(transaction[1]))\n\n if transaction[0] != 0:\n frames.append(\n createTrasversalBeam(\n transaction[0], beamSection, pillarSection, distancePillars,intersectHeights\n )\n )\n\n frames.append(T([1, 3])([transaction[0], transaction[2]]))\n frames.append(\n planeStructure(beamSection, pillarSection, distancePillars, intersectHeights)\n )\n\n return STRUCT(frames)","def get_plane(\n self,\n pos=None,\n norm=None,\n plane=None,\n sx=None,\n sy=None,\n color=\"lightgray\",\n alpha=0.25,\n **kwargs,\n ):\n axes_pairs = dict(sagittal=(0, 1), horizontal=(2, 0), frontal=(2, 1))\n\n if pos is None:\n pos = self.root._mesh.centerOfMass()\n\n try:\n norm = norm or self.space.plane_normals[plane]\n except KeyError: # pragma: no cover\n raise ValueError( # pragma: no cover\n f\"Could not find normals for plane {plane}. Atlas space provides these normals: {self.space.plane_normals}\" # pragma: no cover\n )\n\n # Get plane width and height\n idx_pair = (\n axes_pairs[plane]\n if plane is not None\n else axes_pairs[\"horizontal\"]\n )\n\n bounds = self.root.bounds()\n root_bounds = [\n [bounds[0], bounds[1]],\n [bounds[2], bounds[3]],\n [bounds[4], bounds[5]],\n ]\n\n wh = [float(np.diff(root_bounds[i])) for i in idx_pair]\n if sx is None:\n sx = wh[0]\n if sy is None:\n sy = wh[1]\n\n # return plane\n return Actor(\n Plane(pos=pos, normal=norm, sx=sx, sy=sy, c=color, alpha=alpha),\n name=f\"Plane at {pos} norm: {norm}\",\n br_class=\"plane\",\n )","def __init__(self, **params):\n\n # Initialize topo\n Topo.__init__(self, **params)\n\n # Host and link configuration\n hostConfiguration = {'cpu': cpuShare()}\n linkConfiguration = {'bw': args.bandwidth, 'delay': delay(), 'max_queue_len': args.input_queue_size }\n \n # Create the actual topology\n client = self.add_host( 'client0', **hostConfiguration )\n \n switch = self.add_switch('switch0' )\n \n self.add_link( switch, client, port1=0, port2=0, **linkConfiguration )\n \n for i in range(1,args.servers+1):\n server = self.add_host( 'server%d' % i, **hostConfiguration )\n self.add_link( switch, server, port1=i, port2=0, **linkConfiguration )","def plane_2d(self, quantity, plane, pval, draw=False, fixed=None):\n self.log.info('Plotting plane')\n pval = int(pval)\n # x = np.arange(0, self.period, self.dx)\n # y = np.arange(0, self.period, self.dy)\n # z = np.arange(0, self.height + self.dz, self.dz)\n x = self.X\n y = self.Y\n z = self.Z\n # Get the scalar values\n freq = self.conf['Simulation']['params']['frequency']\n wvlgth = (consts.c / freq) * 1E9\n title = 'Frequency = {:.4E} Hz, Wavelength = {:.2f} nm'.format(\n freq, wvlgth)\n # Get the plane we wish to plot\n cs = self.get_plane(quantity, plane, pval)\n self.log.info('DATA SHAPE: %s' % str(cs.shape))\n show = self.conf['General']['show_plots']\n p = False\n sim_dir = os.path.expandvars(self.conf['General']['sim_dir'])\n if plane == 'yz' or plane == 'zy':\n labels = ('y [um]', 'z [um]', quantity, title)\n if self.conf['General']['save_plots']:\n p = os.path.join(sim_dir,\n '%s_plane_2d_yz_pval%s.png' % (quantity,\n str(pval)))\n self.heatmap2d(y, z, cs, labels, plane, pval,\n save_path=p, show=show, draw=draw, fixed=fixed)\n elif plane == 'xz' or plane == 'zx':\n labels = ('x [um]', 'z [um]', quantity, title)\n if self.conf['General']['save_plots']:\n p = os.path.join(sim_dir,\n '%s_plane_2d_xz_pval%s.png' % (quantity,\n str(pval)))\n self.heatmap2d(x, z, cs, labels, plane, pval,\n save_path=p, show=show, draw=draw, fixed=fixed)\n elif plane == 'xy' or plane == 'yx':\n labels = ('y [um]', 'x [um]', quantity, title)\n if self.conf['General']['save_plots']:\n p = os.path.join(sim_dir,\n '%s_plane_2d_xy_pval%s.png' % (quantity,\n str(pval)))\n self.heatmap2d(x, y, cs, labels, plane, pval,\n save_path=p, show=show, draw=draw, fixed=fixed)","def polyAutoProjection(*args, layoutMethod: Union[int, bool]=0, pivot: Union[List[float, float,\n float], bool]=None, pivotX: Union[float, bool]=0.0, pivotY: Union[float,\n bool]=0.0, pivotZ: Union[float, bool]=0.0, rotate: Union[List[float,\n float, float], bool]=None, rotateX: Union[float, bool]=0.0, rotateY:\n Union[float, bool]=0.0, rotateZ: Union[float, bool]=0.0, scale:\n Union[List[float, float, float], bool]=None, scaleX: Union[float,\n bool]=1.0, scaleY: Union[float, bool]=1.0, scaleZ: Union[float,\n bool]=1.0, translate: Union[List[float, float, float], bool]=None,\n translateX: Union[float, bool]=0.0, translateY: Union[float, bool]=0.0,\n translateZ: Union[float, bool]=0.0, caching: bool=True,\n constructionHistory: bool=True, createNewMap: bool=True,\n insertBeforeDeformers: bool=True, layout: Union[int, bool]=0, name:\n AnyStr=\"\", nodeState: Union[int, bool]=0, optimize: Union[int, bool]=0,\n percentageSpace: Union[float, bool]=0.0, planes: Union[int, bool]=6,\n projectBothDirections: bool=True, scaleMode: Union[int, bool]=0,\n skipIntersect: bool=True, uvSetName: AnyStr=\"\", worldSpace: bool=True,\n q=True, query=True, e=True, edit=True, **kwargs)->Union[AnyStr, Any]:\n pass","def plot_plane(unit_normal, x_array, y_array, fore):\n # print'unit normal = ', unit_normal\n z = (((unit_normal[0] * (fore[0] - x_array)) + (unit_normal[1] * (fore[1] - y_array))) / unit_normal[2]) + fore[2]\n # print 'plane numbers\\n', z\n return z","def _repr_(self):\n return \"Hyperbolic plane\"","def addPlaneToScene(self, foot, x, y):\r\n #research\r\n profprint()\r\n scene = slicer.mrmlScene\r\n # Create model node\r\n model = slicer.vtkMRMLModelNode()\r\n model.SetScene(scene)\r\n model.SetName(scene.GenerateUniqueName(\".ObturatorPlane\"))\r\n\r\n planeSource = vtk.vtkPlaneSource()\r\n foot-=25*(x+y)\r\n #planeSource.SetOrigin(np.array(foot))\r\n planeSource.SetOrigin(list(foot))\r\n planeSource.SetPoint1(np.array(foot)+50*x)\r\n planeSource.SetPoint2(np.array(foot)+50*y)\r\n planeSource.Update()\r\n model.SetAndObservePolyData(planeSource.GetOutput())\r\n\r\n # Create display node\r\n modelDisplay = slicer.vtkMRMLModelDisplayNode()\r\n modelDisplay.SetColor(1,1,0) # yellow\r\n modelDisplay.SetBackfaceCulling(0)\r\n modelDisplay.SetScene(scene)\r\n scene.AddNode(modelDisplay)\r\n model.SetAndObserveDisplayNodeID(modelDisplay.GetID())\r\n\r\n # Add to scene\r\n scene.AddNode(model)\r\n # transform = slicer.vtkMRMLLinearTransformNode()\r\n # scene.AddNode(transform)\r\n # model.SetAndObserveTransformNodeID(transform.GetID())\r\n #\r\n # vTransform = vtk.vtkTransform()\r\n # vTransform.Scale(50,50,50)\r\n # #vTransform.RotateX(30)\r\n # transform.SetAndObserveMatrixTransformToParent(vTransform.GetMatrix())\r","def show_plane(axis, plane, cmap=\"gray\", title=None):\n axis.imshow(plane, cmap=cmap)\n axis.set_xticks([])\n axis.set_yticks([])\n\n if title:\n axis.set_title(title)\n\n return None","def _make_exclusion_plane(args):\n cls_dict = _load_subset(args.cls_file, args.regions)\n\n ex_plane = planeplt.CLsExclusionPlane(interpolation=args.interpolation)\n cls_list = []\n if args.band_region:\n for sp in cls_dict[args.band_region]:\n sch, lsp = sp['scharm_mass'], sp['lsp_mass']\n low, high = sp['exp_d1s'], sp['exp_u1s']\n cls_list.append( (sch, lsp, low, high))\n ex_plane.add_band(cls_list)\n\n # add middle band\n def get_tup(x):\n return (x['scharm_mass'], x['lsp_mass'], x['cls_exp'])\n for conf_name, cls_list in sorted(cls_dict.items()):\n cls_tup = [get_tup(x) for x in cls_list]\n style = '-k' if conf_name == args.band_region else None\n ex_plane.add_config(cls_tup,conf_name, style=style, )\n\n ex_plane.save(args.output_plot)","def GetPlaneMode(self, *args):\n return _ShapeUpgrade.ShapeUpgrade_ConvertSurfaceToBezierBasis_GetPlaneMode(self, *args)","def get_plane_of_points(\n self,\n normal_vector=\"z\",\n planar_coordinate=None,\n ):\n # Get results vectors\n if (normal_vector == \"z\"):\n x_flat = self.floris.grid.x_sorted_inertial_frame[0, 0].flatten()\n y_flat = self.floris.grid.y_sorted_inertial_frame[0, 0].flatten()\n z_flat = self.floris.grid.z_sorted_inertial_frame[0, 0].flatten()\n else:\n x_flat = self.floris.grid.x_sorted[0, 0].flatten()\n y_flat = self.floris.grid.y_sorted[0, 0].flatten()\n z_flat = self.floris.grid.z_sorted[0, 0].flatten()\n u_flat = self.floris.flow_field.u_sorted[0, 0].flatten()\n v_flat = self.floris.flow_field.v_sorted[0, 0].flatten()\n w_flat = self.floris.flow_field.w_sorted[0, 0].flatten()\n\n # Create a df of these\n if normal_vector == \"z\":\n df = pd.DataFrame(\n {\n \"x1\": x_flat,\n \"x2\": y_flat,\n \"x3\": z_flat,\n \"u\": u_flat,\n \"v\": v_flat,\n \"w\": w_flat,\n }\n )\n if normal_vector == \"x\":\n df = pd.DataFrame(\n {\n \"x1\": y_flat,\n \"x2\": z_flat,\n \"x3\": x_flat,\n \"u\": u_flat,\n \"v\": v_flat,\n \"w\": w_flat,\n }\n )\n if normal_vector == \"y\":\n df = pd.DataFrame(\n {\n \"x1\": x_flat,\n \"x2\": z_flat,\n \"x3\": y_flat,\n \"u\": u_flat,\n \"v\": v_flat,\n \"w\": w_flat,\n }\n )\n\n # Subset to plane\n # TODO: Seems sloppy as need more than one plane in the z-direction for GCH\n if planar_coordinate is not None:\n df = df[np.isclose(df.x3, planar_coordinate)] # , atol=0.1, rtol=0.0)]\n\n # Drop duplicates\n # TODO is this still needed now that we setup a grid for just this plane?\n df = df.drop_duplicates()\n\n # Sort values of df to make sure plotting is acceptable\n df = df.sort_values([\"x2\", \"x1\"]).reset_index(drop=True)\n\n return df","def construct_mpi_topology(self, dico):\n period = [True]*self.dim\n\n if dico is None:\n comm = mpi.COMM_WORLD\n else:\n comm = dico.get('comm', mpi.COMM_WORLD)\n self.mpi_topo = MPI_topology(self.dim, period, comm)","def get_transformable_plane(self, x_range = None, y_range = None):\n plane_config = dict(self.plane_config)\n shift_val = ORIGIN\n if x_range is not None:\n x_min, x_max = x_range\n plane_config[\"x_radius\"] = x_max - x_min\n shift_val += (x_max+x_min)*RIGHT/2.\n if y_range is not None:\n y_min, y_max = y_range\n plane_config[\"y_radius\"] = y_max - y_min\n shift_val += (y_max+y_min)*UP/2.\n plane = ComplexPlane(**plane_config)\n plane.shift(shift_val)\n if self.use_multicolored_plane:\n self.paint_plane(plane)\n return plane","def plotWholeRoom(mesh):\r\n fig = plt.figure()\r\n ax = fig.gca(projection='3d')\r\n X = np.arange(0, mesh.xLength+mesh.meshsize, mesh.meshsize)\r\n Y = np.arange(0, mesh.yLength+mesh.meshsize, mesh.meshsize)\r\n X, Y = np.meshgrid(X,Y)\r\n numberOfXNodes = mesh.x_res#round(mesh.xLength/mesh.meshsize)+1\r\n numberOfYNodes = mesh.y_res#round(mesh.yLength/mesh.meshsize)+1\r\n Z = np.array([[mesh.grid[i,j].funcVal for i in range(numberOfYNodes)] for j in range(numberOfXNodes)])\r\n if mesh.y_res==2:\r\n print()\r\n surf = ax.plot_surface(X, Y, Z, rstride=1, cstride=1, cmap=cm.coolwarm,\r\n linewidth=0, antialiased=False)\r\n # add vmin=4, vmax=41, to define lower and upper value for the color-scheme\r\n # set limits for z-axis\r\n ax.set_zlim(np.amin(Z)-mesh.meshsize, np.amax(Z)+mesh.meshsize)\r\n # don't know what these two lines are for\r\n # x.zaxis.set_major_locator(LinearLocator(10))\r\n # ax.zaxis.set_major_formatter(FormatStrFormatter('%.02f'))\r\n # don't know what these two lines are for\r\n fig.colorbar(surf, shrink=0.5, aspect=5)\r\n plt.show() \r\n return fig","def plot_nhdp_hello_topology(options, tags=None, cursor=None):\n options['cur_src'] = 'topo'\n options['prefix'] = \"nhdp\"\n ################################################################################\n locs = options['locs']\n colors = options['color2'](pylab.linspace(0, 1, 101))\n ################################################################################\n circ_max = 5\n line_max = 10\n floor_factor = 2\n floor_skew = -0.25\n line_min = 1\n\n hosts = get_hosts(options)\n\n for q, (tag_key, tag_id, nhdp_hi, nhdp_ht, mpr_minpdr) in enumerate(tags):\n logging.info('tag_id=\\\"%s\\\" (%d/%d)', tag_id, q+1, len(tags))\n fig2d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate')\n fig3d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate', ThreeD=True)\n if not q:\n fig3d_onlynodes = MyFig(options, xlabel='x Coordinate [m]', ylabel='y Coordinate [$m$]', ThreeD=True)\n\n min_x = min_y = min_z = numpy.infty\n max_x = max_y = max_z = 0\n\n # draw the nodes\n for host in hosts:\n try:\n xpos, ypos, zpos = locs[host]\n except KeyError:\n logging.warning('no position found for node %s', host)\n continue\n\n max_x = max(xpos, max_x)\n max_y = max(ypos, max_y)\n min_x = min(xpos, min_x)\n min_y = min(ypos, min_y)\n max_z = max(zpos, max_z)\n min_z = max(zpos, min_z)\n\n fig2d.ax.plot(\n xpos+zpos*floor_skew*floor_factor,\n ypos+zpos*floor_factor,\n 'o', color='black', ms=circ_max)\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='black', ms=circ_max)\n if not q:\n color = 'black'\n if host.startswith('a6'):\n color = 'red'\n elif host.startswith('a3'):\n color = 'blue'\n elif host.startswith('a7'):\n color = 'orange'\n fig3d_onlynodes.ax.plot([xpos], [ypos], [zpos], 'o', color=color, ms=circ_max)\n fig2d.colorbar = fig2d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\n fig3d.colorbar = fig3d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\n drawBuildingContours(fig3d.ax, options)\n drawBuildingContours(fig3d_onlynodes.ax, options)\n\n alinspace = numpy.linspace(0, 1, 100)\n alinspace = numpy.vstack((alinspace, alinspace))\n for tax in [fig2d.colorbar, fig3d.colorbar]:\n tax.imshow(alinspace, aspect='auto', cmap=options['color2'])\n tax.set_xticks(pylab.linspace(0, 100, 5))\n tax.set_xticklabels(['$%.2f$' % l for l in pylab.linspace(0, 1, 5)], fontsize=0.8*options['fontsize'])\n tax.set_yticks([])\n tax.set_title('$PDR$', size=options['fontsize'])\n fig2d.ax.axis((min_x-10, max_x+10, min_y-10, max_y+10+max_z*floor_factor+10))\n fig2d.save('2d_%s' % (tag_id))\n fig3d.save('3d_%s' % (tag_id))\n if not q:\n fig3d_onlynodes.save('3d')","def automatic_partitioning():\n def draw_labels(labels_vector):\n labs = {node: labels_vector[i] for i, node in enumerate(router.graph.nodes())}\n coord = {touple: list(touple) for touple in router.graph.nodes()}\n nx.draw_networkx(router.graph, coord, labels=labs)\n plt.show()\n\n file_path = PROJECT_PATH + \"/geographycal_data/adjacency_matrix/Howgrp.txt\"\n router = Router(adjacency_metrix=file_path)\n draw_labels(router.louvain_clustering(router.graph, weight='weight'))","def plot_mpr_topology_per_mpr(options, tags=None, cursor=None):\n interval = 600\n options['cur_src'] = 'topo'\n options['prefix'] = \"mpr\"\n ################################################################################\n locs = options['locs']\n colors = options['color2'](pylab.linspace(0, 1, 101))\n ################################################################################\n circ_max = 5\n line_max = 10\n floor_factor = 2\n floor_skew = -0.25\n line_min = 1\n cur_time = cursor.execute('''\n SELECT min(time)\n FROM nhdp_mpr_selectors\n ''').fetchone()\n mprs = cursor.execute('''\n SELECT DISTINCT(host)\n FROM nhdp_mpr_selectors\n ''').fetchall()\n hosts = get_hosts(options)\n\n min_x = min_y = min_z = numpy.infty\n max_x = max_y = max_z = 0\n\n # first draw the edges...\n for i, (mpr,) in enumerate(mprs):\n logging.info('[%d/%d] plotting host=%s', i+1, len(mprs), mpr)\n fig2d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate')\n fig3d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate', ThreeD=True)\n try:\n host_xpos, host_ypos, host_zpos = locs[mpr]\n except KeyError:\n logging.warning('no position found for node %s', mpr)\n continue\n ################################################################################\n # host is the receiving router, i.e. in our case the MPR\n # src is the sending router, i.e. the MPR selector\n # We only want to draw an edge if it connects an MPR with its SELECTOR.\n #\n ################################################################################\n cursor.execute('''\n SELECT src, AVG(pdr)\n FROM eval_helloPDR AS pdr JOIN nhdp_mpr_selectors AS mpr\n ON pdr.host = mpr.host AND pdr.tx_if = mpr.mprselector\n WHERE pdr.host=?\n GROUP BY src\n ''', (mpr, ))\n\n for src, pdr in cursor.fetchall():\n try:\n src_xpos, src_ypos, src_zpos = locs[src]\n except KeyError:\n logging.warning('no position found for node %s', src)\n continue\n\n fig2d.ax.plot(\n [host_xpos+host_zpos*floor_skew*floor_factor, src_xpos+src_zpos*floor_skew*floor_factor],\n [host_ypos+host_zpos*floor_factor, src_ypos+src_zpos*floor_factor],\n linestyle='-', color=colors[pdr*100], linewidth=max(line_max*pdr, line_min), alpha=0.3)\n\n fig3d.ax.plot(\n [host_xpos, src_xpos],\n [host_ypos, src_ypos],\n [host_zpos, src_zpos],\n linestyle='-', color=colors[pdr*100], linewidth=max(line_max*pdr, line_min), alpha=0.3)\n\n # draw all other nodes\n for host in hosts:\n try:\n xpos, ypos, zpos = locs[host]\n except KeyError:\n logging.warning('no position found for node %s', host)\n continue\n\n max_x = max(xpos, max_x)\n max_y = max(ypos, max_y)\n min_x = min(xpos, min_x)\n min_y = min(ypos, min_y)\n max_z = max(zpos, max_z)\n min_z = max(zpos, min_z)\n if host == mpr:\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='blue', ms=circ_max)\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color='blue', ms=circ_max)\n else:\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='black', ms=circ_max)\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color='black', ms=circ_max)\n fig2d.colorbar = fig2d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\n fig3d.colorbar = fig3d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\n drawBuildingContours(fig3d.ax, options)\n alinspace = numpy.linspace(0, 1, 100)\n alinspace = numpy.vstack((alinspace, alinspace))\n for tax in [fig2d.colorbar, fig3d.colorbar]:\n tax.imshow(alinspace, aspect='auto', cmap=options['color2'])\n tax.set_xticks(pylab.linspace(0, 100, 5))\n tax.set_xticklabels(['$%.2f$' % l for l in pylab.linspace(0, 1, 5)], fontsize=0.8*options['fontsize'])\n tax.set_yticks([])\n tax.set_title('$PDR$', size=options['fontsize'])\n fig2d.ax.axis((min_x-10, max_x+10, min_y-10, max_y+10+max_z*floor_factor+10))\n fig2d.save('2d_topology_per_mpr_%s' % (mpr))\n fig3d.save('3d_topology_per_mpr_%s' % (mpr))","def ProjectToPlane(self):\n\n self.__do_essential_memebers_exist__()\n if self.element_type != \"tri\":\n raise ValueError(\"Project to plane is only applicable to triangles\")\n\n imesh = deepcopy(self)\n coordinates = []\n connectivities = []\n for counter, elem in enumerate(imesh.elements):\n\n elementCoordinates = imesh.points[elem,:]\n\n A = elementCoordinates[0,:]\n B = elementCoordinates[1,:]\n C = elementCoordinates[2,:]\n\n X = (B - A); X /= np.linalg.norm(X)\n Z = np.cross(X, C - A); Z /= np.linalg.norm(Z)\n Y = np.cross(Z, X)\n\n # PROJECT THE TRIANGLE TO THIS BASES\n a = [0., 0.]\n b = [np.linalg.norm((B - A)), 0.]\n c = [(C - A).dot(X), (C - A).dot(Y)]\n\n coordinates.append(a)\n coordinates.append(b)\n coordinates.append(c)\n\n elementConnectivity = [3 * counter, 3 * counter + 1, 3 * counter + 2]\n connectivities.append(elementConnectivity)\n\n coordinates = np.array(coordinates)\n connectivities = np.array(connectivities)\n imesh.points = coordinates\n imesh.elements = connectivities\n imesh.nelem = imesh.elements.shape[0]\n imesh.nnode = imesh.points.shape[0]\n\n return imesh","def topology(self, topo_file: str, *args: str):\n pass","def plot_mpr_topology_per_node(options, tags=None, cursor=None):\n interval = 600\n options['cur_src'] = 'topo'\n options['prefix'] = \"mpr\"\n ################################################################################\n locs = options['locs']\n colors = options['color2'](pylab.linspace(0, 1, 101))\n colors_mprs = ['green', 'red', 'cyan', 'magenta', 'yellow', 'grey']\n #colors_mprs = ['#222222', '#444444', '#666666', '#888888', '#aaaaaa', '#cccccc']\n ################################################################################\n circ_max = 5\n line_max = 10\n floor_factor = 2\n floor_skew = -0.25\n line_min = 1\n wait_time = 30\n measure_time = wait_time + 20\n draw_non_mpr_neighbors = False\n\n hosts = get_hosts(options)\n\n min_x = min_y = min_z = numpy.infty\n max_x = max_y = max_z = 0\n\n for q, (tag_key, tag_id, nhdp_hi, nhdp_ht, mpr_minpdr) in enumerate(tags):\n # first draw the edges...\n for host in hosts:\n logging.info(\"Plotting tag_id: %s host: %s\" % (tag_id, host))\n tx_if, = cursor.execute('''\n SELECT tx_if\n FROM he\n WHERE host=?\n ''',(host,)).fetchone()\n fig2d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate')\n fig3d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate', ThreeD=True)\n try:\n host_xpos, host_ypos, host_zpos = locs[host]\n except KeyError:\n logging.warning('no position found for node %s', host)\n continue\n ################################################################################\n # src is the receiving router, i.e. in our case the MPR\n # host is the sending router, i.e. the MPR selector\n # We only want to draw an edge if it connects a host with its MPR.\n #\n ################################################################################\n\n neighbors = cursor.execute('''\n SELECT DISTINCT(host)\n FROM rh\n WHERE prev = ?\n ''', (tx_if,)).fetchall()\n min_time, = cursor.execute('''\n SELECT min(time)\n FROM nhdp_he\n WHERE tag = ?\n ''',(tag_key,)).fetchone()\n mprs = cursor.execute('''\n SELECT pdr.host, AVG(pdr)\n FROM eval_helloPDR AS pdr JOIN nhdp_mpr_selectors AS mpr\n ON pdr.host = mpr.host AND pdr.tx_if = mpr.mprselector\n WHERE pdr.tx_if = ? AND pdr.tag_key = ? AND mpr.time BETWEEN ? AND ?\n GROUP BY pdr.host\n ''', (tx_if, tag_key, min_time + wait_time, min_time + measure_time)).fetchall()\n logging.info(\"Host is %s...\" % host)\n mpr_list = []\n for mpr, pdr in mprs:\n mpr_list.append(mpr)\n try:\n src_xpos, src_ypos, src_zpos = locs[mpr]\n except KeyError:\n logging.warning('no position found for node %s', mpr)\n continue\n\n fig2d.ax.plot(\n [host_xpos+host_zpos*floor_skew*floor_factor, src_xpos+src_zpos*floor_skew*floor_factor],\n [host_ypos+host_zpos*floor_factor, src_ypos+src_zpos*floor_factor],\n linestyle='-', color=colors[pdr*100], linewidth=max(line_max*pdr, line_min), alpha=0.3, label=tag_id)\n\n fig3d.ax.plot(\n [host_xpos, src_xpos],\n [host_ypos, src_ypos],\n [host_zpos, src_zpos],\n linestyle='-', color=colors[pdr*100], linewidth=max(line_max*pdr, line_min), alpha=0.3, label=tag_id)\n if draw_non_mpr_neighbors == True:\n for _host, in neighbors:\n try:\n src_xpos, src_ypos, src_zpos = locs[_host]\n except KeyError:\n logging.warning('no position found for node %s', _host)\n continue\n\n fig2d.ax.plot(\n [host_xpos+host_zpos*floor_skew*floor_factor, src_xpos+src_zpos*floor_skew*floor_factor],\n [host_ypos+host_zpos*floor_factor, src_ypos+src_zpos*floor_factor],\n linestyle='-', color='black', linewidth=line_min, alpha=0.3)\n\n fig3d.ax.plot(\n [host_xpos, src_xpos],\n [host_ypos, src_ypos],\n [host_zpos, src_zpos],\n linestyle='-', color='black', linewidth=line_min, alpha=0.3)\n # draw nodes\n color_idx = 0;\n skip_list = []\n n2_list = []\n for _host in hosts:\n if _host in skip_list:\n continue\n try:\n xpos, ypos, zpos = locs[_host]\n except KeyError:\n logging.warning('no position found for node %s', _host)\n continue\n\n max_x = max(xpos, max_x)\n max_y = max(ypos, max_y)\n min_x = min(xpos, min_x)\n min_y = min(ypos, min_y)\n max_z = max(zpos, max_z)\n min_z = max(zpos, min_z)\n if _host == host:\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='blue', ms=circ_max*2)\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color='blue', ms=circ_max*2)\n elif _host in mpr_list:\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color=colors_mprs[color_idx], ms=circ_max)\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color=colors_mprs[color_idx], ms=circ_max)\n mpr_tx_if, = cursor.execute('''\n SELECT tx_if\n FROM he\n WHERE host=? AND time BETWEEN ? AND ?\n ''',(_host, min_time + wait_time, min_time + measure_time)).fetchone()\n n2_ifs = list(pylab.flatten(cursor.execute('''\n SELECT DISTINCT(n2)\n FROM nhdp_mpr_n2\n WHERE host = ? AND time BETWEEN ? AND ?\n ''', (_host, min_time + wait_time, min_time + measure_time)).fetchall()))\n\n n2s = cursor.execute('''\n SELECT DISTINCT(host)\n FROM he\n WHERE tx_if IN (%s)\n ''' % ','.join('?'*len(n2_ifs)), n2_ifs).fetchall()\n #n2 = cursor.execute('''\n #SELECT DISTINCT(host)\n #FROM rh\n #WHERE prev = ? AND time BETWEEN ? AND ?\n #''', (mpr_tx_if, min_time + wait_time, min_time + measure_time)).fetchall()\n mpr_xpos, mpr_ypos, mpr_zpos = locs[_host]\n for __host, in n2s:\n __host = unicodedata.normalize('NFKD', __host).encode('ascii','ignore')\n if __host in n2_list:\n continue\n if __host in mpr_list or __host == host:\n continue\n n2_list.append(__host)\n skip_list.append(__host)\n try:\n _xpos, _ypos, _zpos = locs[__host]\n except KeyError:\n logging.warning('no position found for node %s', __host)\n continue\n max_x = max(_xpos, max_x)\n max_y = max(_ypos, max_y)\n min_x = min(_xpos, min_x)\n min_y = min(_ypos, min_y)\n max_z = max(_zpos, max_z)\n min_z = max(_zpos, min_z)\n fig3d.ax.plot([_xpos], [_ypos], [_zpos], 'o', color=colors_mprs[color_idx], ms=circ_max)\n fig2d.ax.plot(_xpos+_zpos*floor_skew*floor_factor,_ypos+_zpos*floor_factor,'o', color=colors_mprs[color_idx], ms=circ_max)\n\n n2_xpos, n2_ypos, n2_zpos = locs[__host]\n\n fig2d.ax.plot(\n [n2_xpos+n2_zpos*floor_skew*floor_factor, mpr_xpos+mpr_zpos*floor_skew*floor_factor],\n [n2_ypos+n2_zpos*floor_factor, mpr_ypos+mpr_zpos*floor_factor],\n linestyle='-', color=colors_mprs[color_idx], linewidth=line_min, alpha=0.3)\n\n fig3d.ax.plot(\n [n2_xpos, mpr_xpos],\n [n2_ypos, mpr_ypos],\n [n2_zpos, mpr_zpos],\n linestyle='-', color=colors_mprs[color_idx], linewidth=line_min, alpha=0.3)\n\n color_idx = color_idx + 1;\n if color_idx > 5:\n color_idx = 0\n else:\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='black', ms=circ_max)\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color='black', ms=circ_max)\n\n\n fig2d.colorbar = fig2d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\n fig3d.colorbar = fig3d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\n drawBuildingContours(fig3d.ax, options)\n alinspace = numpy.linspace(0, 1, 100)\n alinspace = numpy.vstack((alinspace, alinspace))\n for tax in [fig2d.colorbar, fig3d.colorbar]:\n tax.imshow(alinspace, aspect='auto', cmap=options['color2'])\n tax.set_xticks(pylab.linspace(0, 100, 5))\n tax.set_xticklabels(['$%.2f$' % l for l in pylab.linspace(0, 1, 5)], fontsize=0.8*options['fontsize'])\n tax.set_yticks([])\n tax.set_title('$PDR$', size=options['fontsize'])\n fig2d.ax.axis((min_x-10, max_x+10, min_y-10, max_y+10+max_z*floor_factor+10))\n logging.info(\"saving %s\" %(host))\n fig2d.save('2d_mpr_topology_%s' % (host))\n fig3d.save('3d_mpr_topology_%s' % (host))","def plot_sag_plane(self, P0=None, sag_pl=None):\n if P0 is None: P0 = np.array([0,0,0])\n if sag_pl is None: sag_pl = self.sp\n norm, d = sag_pl[:3], sag_pl[3]\n import matplotlib.pyplot as plt\n from mpl_toolkits.mplot3d import Axes3D\n plt.ion()\n # create x,y\n xypts = 10\n xrng = 300\n yrng = 130\n xrng_mesh = np.linspace(P0[0], P0[0]-xrng, xypts)\n yrng_mesh = np.linspace(P0[1]-yrng/2., P0[1]+yrng, xypts)\n xx, yy = np.meshgrid(xrng_mesh, yrng_mesh)\n # calculate corresponding z\n zz = -1 * (norm[0] * xx + norm[1] * yy + d) / norm[2]\n # plot the surface\n self.fig = plt.figure()\n self.fig_ax = self.fig.add_subplot(111, projection='3d')\n self.fig_ax.plot_wireframe(xx, yy, zz, color='gray')\n #ax.quiver(P0[0], P0[1], norm[0], norm[1])\n self.fig_ax.set_xlabel('X')\n self.fig_ax.set_ylabel('Y')\n self.fig_ax.set_zlabel('Z')\n self.fig_ax.set_zlim(P0[2]-xrng, P0[2]+yrng)\n plt.show()","def plane_generator():\n\n planarRadius = np.sqrt(N / (np.pi * pointDensity)) # <-- convert pointDensity into radius\n planarThreshold = planarRadius * np.sqrt(thresholdFrac)\n\n # distance function (law of cosines)\n def dist(rTheta1, rTheta2): # rThetai is a coordinate tuple: (r, theta)\n a, b = rTheta1[0], rTheta2[0]\n theta1, theta2 = rTheta1[1], rTheta2[1]\n return np.sqrt(a ** 2 + b ** 2 - 2 * a * b * np.cos(theta1 - theta2)) # <-- law of cosines\n\n # computes the adjacency matrices\n data_plane = []\n for r in range(num_graphs):\n\n # generates dictionary of positions for each node: node_pos = {node_i: (radius, theta)}\n node_pos = {}\n for i in range(N):\n rnd_angle = np.random.random() * 2 * np.pi\n rnd_radii = np.random.random() * planarRadius\n node_pos.update({i: (rnd_radii, rnd_angle)})\n\n Adj_Matrix = np.zeros((N, N))\n for i in range(N):\n for j in range(N):\n ij_dist = dist(node_pos[i], node_pos[j])\n if ij_dist < planarThreshold:\n Adj_Matrix[i, j] = 1 # nodes that are connected are assigned a 1 in the matrix\n\n data_plane.append(Adj_Matrix)\n\n return data_plane","def resMode(mode): \n if mode==0:\n makeMesh(r0x, r0y)\n elif mode==1:\n makeMesh(r1x, r1y)\n elif (mode==2):\n makeMesh(r2x, r2y)","def topo_plane_paramEval(self, param):\n # Create an empty numpy array with the same number as pixels as the real data.\n self.topo_plane_fit_data = np.zeros((self.y_res, self.x_res))\n for y in range(0, self.y_res): # Iterate over the y-axis pixels.\n for x in range(0, self.x_res): # Iterate over the x-axis pixels.\n self.topo_plane_fit_data[y, x] = param[0]*x + param[1]*y + param[2] # Generate plane value.\n return self.topo_plane_fit_data # Return entire array.","def load_plane(image):\n pixels = image.getPrimaryPixels()\n return pixels.getPlane(0, 0, 0)","def build_topology_moore(config):\n columns = config['MooreTopology']['width']\n rows = config['MooreTopology']['height']\n radius = config['MooreTopology']['radius']\n assert rows > 0 and columns > 0 and radius > 0\n\n periodic = config['MooreTopology']['periodic']\n\n top = nx.empty_graph()\n top.name = \"Moore Lattice: {r} rows, {c} columns, radius={rx}\".format(r=rows,\n c=columns,\n rx=radius)\n if periodic:\n top.name += ' with periodoc boundaries'\n\n top.add_nodes_from(list(range(rows * columns)))\n\n for node in top.nodes_iter():\n (myrow, mycol) = divmod(node, columns)\n top.node[node]['coords'] = (myrow, mycol)\n\n for r in range(myrow - radius, myrow + radius + 1):\n if periodic == False and (r < 0 or r >= rows):\n continue\n\n for c in range(mycol - radius, mycol + radius + 1):\n if periodic == False and (c < 0 or c >= columns):\n continue\n\n neighbor = (columns * (r % rows)) + (c % columns)\n\n if node != neighbor:\n top.add_edge(node, neighbor)\n\n return top","def mesh_slicer(self, plane, opt):\n\n # get plane coefficients\n a = plane[0]\n b = plane[1]\n c = plane[2]\n\n # create vtk plane object\n VTKplane = vtk.vtkPlane()\n # for now we choose the center point as the point of rotation\n VTKplane.SetOrigin(self.mesh_poly.GetCenter())\n VTKplane.SetNormal(a, b, c)\n VTKplane.SetOrigin(self.epi_apex_node)\n\n # create cutter\n cutEdges = vtk.vtkCutter()\n cutEdges.SetInputData(self.mesh_poly)\n cutEdges.SetCutFunction(VTKplane)\n cutEdges.GenerateCutScalarsOn()\n cutEdges.SetValue(0, 0.5)\n\n # create renderer\n ren = vtk.vtkRenderer()\n ren.SetBackground(0.0, 0.0, 0.0)\n\n # create mapper\n mapper = vtk.vtkPolyDataMapper()\n mapper.SetInputConnection(cutEdges.GetOutputPort())\n\n # create actor\n actor = vtk.vtkActor()\n actor.SetMapper(mapper)\n actor.GetProperty().SetColor(0.0, 0.0, 1.0)\n actor.GetProperty().SetLineWidth(2)\n\n # display apex point\n apexA = include_points(list(self.epi_apex_node), 1, 15, (0, 0, 1))\n\n if (opt == 'mesh'):\n meshMapper = vtk.vtkPolyDataMapper()\n meshMapper.SetInputData(self.mesh_poly)\n meshActor = vtk.vtkActor()\n meshActor.SetMapper(meshMapper)\n meshActor.GetProperty().SetColor(1.0, 0.0, 0.0)\n\n # generate renderer\n ren.AddActor(self.meshActor)\n ren.AddActor(actor)\n ren.AddActor(apexA)\n\n else:\n ren.AddActor(actor)\n ren.AddActor(apexA)\n\n # display\n vtk_show(ren)","def build_planar_mesh(cellWidth, x, y, geom_points, geom_edges,\n out_filename='base_mesh.nc', logger=None):\n\n with LoggingContext(__name__, logger=logger) as logger:\n\n da = xarray.DataArray(cellWidth,\n dims=['y', 'x'],\n coords={'y': y, 'x': x},\n name='cellWidth')\n cw_filename = 'cellWidthVsXY.nc'\n da.to_netcdf(cw_filename)\n\n logger.info('Step 1. Generate mesh with JIGSAW')\n jigsaw_driver(cellWidth, x, y, on_sphere=False,\n geom_points=geom_points, geom_edges=geom_edges,\n logger=logger)\n\n logger.info('Step 2. Convert triangles from jigsaw format to netcdf')\n jigsaw_to_netcdf(msh_filename='mesh-MESH.msh',\n output_name='mesh_triangles.nc', on_sphere=False)\n\n logger.info('Step 3. Convert from triangles to MPAS mesh')\n args = ['MpasMeshConverter.x',\n 'mesh_triangles.nc',\n out_filename]\n check_call(args=args, logger=logger)","def PlotAirplane():\n airplane = vtkInterface.PolyData(planefile)\n airplane.Plot()","def fig4():\n # fmt: off\n tpm = np.array([\n [0, 0, 0],\n [0, 0, 1],\n [1, 0, 1],\n [1, 0, 0],\n [1, 0, 0],\n [1, 1, 1],\n [1, 0, 1],\n [1, 1, 0],\n ])\n cm = np.array([\n [0, 1, 1],\n [1, 0, 1],\n [1, 1, 0],\n ])\n # fmt: on\n return Network(tpm, cm=cm, node_labels=LABELS[:tpm.shape[1]])","def createTopology(self):\n\n # find DAG root\n dagRoot = None\n for mote in self.motes:\n if mote.id == 0:\n mote.role_setDagRoot()\n dagRoot = mote\n assert dagRoot\n\n if self.settings.mobilityModel == 'RPGM':\n # put DAG root at center of area\n dagRoot.setLocation(x=SimEngine.SimEngine().targets[0][0],\n y=SimEngine.SimEngine().targets[0][1])\n else:\n # put DAG root at center of area\n dagRoot.setLocation(x=self.squareSide/2,\n y=self.squareSide/2)\n\n # reposition each mote until it is connected\n connectedMotes = [dagRoot]\n for mote in self.motes:\n if mote in connectedMotes:\n continue\n\n connected = False\n while not connected:\n # pick a random location\n mote.setLocation(x=self.squareSide*random.random(),\n y=self.squareSide*random.random())\n\n # if mote.id == 1:\n # mote.setLocation(\n # x=self.squareSide / 2.5 + 0.02,\n # y=self.squareSide / 2.5 + 0.3\n # )\n # elif mote.id == 2:\n # mote.setLocation(\n # x=self.squareSide / 2.5 + 0.3,\n # y=self.squareSide / 2.5 + 0.3\n # )\n #\n # elif mote.id == 3:\n # mote.setLocation(\n # x=self.squareSide / 2.5 + 0.1,\n # y=self.squareSide / 2.5 + 0.4\n # )\n\n # elif mote.id == 4:\n # mote.setLocation(\n # x=self.squareSide / 2.5 + 0.2,\n # y=self.squareSide / 2.5 + 0.65\n # )\n # else:\n\n mote.setLocation(\n x=self.settings.squareSide * random.random(),\n y=self.settings.squareSide * random.random()\n )\n\n numStableNeighbors = 0\n\n # count number of neighbors with sufficient RSSI\n for cm in connectedMotes:\n\n rssi = self._computeRSSI(mote, cm)\n mote.setRSSI(cm, rssi)\n cm.setRSSI(mote, rssi)\n\n # save the intial RSSI values for future use in the mobility models\n mote.initialRSSI[cm] = rssi\n cm.initialRSSI[mote] = rssi\n\n if rssi > self.STABLE_RSSI:\n numStableNeighbors += 1\n\n # make sure it is connected to at least stable_neighbors motes\n # or connected to all the currently deployed motes when the\n # number of deployed motes are smaller than stable_neighbors\n if (numStableNeighbors >= self.stable_neighbors or\n numStableNeighbors == len(connectedMotes)):\n print 'moteid %d, mote x %.4f, mote y %.4f: valid %s' % (mote.id, mote.x, mote.y , SimEngine.SimEngine().checkValidPosition(mote.x, mote.y, countSquare=True, placement=True))\n if self.settings.mobilityModel == 'RPGM' and SimEngine.SimEngine().checkValidPosition(mote.x, mote.y, countSquare=True, placement=True):\n connected = True\n elif self.settings.mobilityModel != 'RPGM':\n connected = True\n\n connectedMotes += [mote]\n\n # self.motes[3].setRSSI(self.motes[0], -96)\n # self.motes[0].setRSSI(self.motes[3], -96)\n\n # for each mote, compute PDR to each neighbors\n for mote in self.motes:\n for m in self.motes:\n if mote == m:\n continue\n if mote.getRSSI(m) > mote.minRssi:\n pdr = self._computePDR(mote, m)\n mote.setPDR(m, pdr)\n m.setPDR(mote, pdr)","def __init__(self, initial_surfaces):\n\n nsurf = len(initial_surfaces)\n nvert, nedge, ngroup, \\\n surf_ptrs, edge_ptrs, \\\n surf_group, edge_group \\\n = self._compute_topology(initial_surfaces)\n\n self._num = {\n 'surf': len(initial_surfaces),\n 'vert': nvert,\n 'edge': nedge,\n 'group': ngroup,\n }\n\n self._topo = {\n 'surf_ptrs': surf_ptrs,\n 'edge_ptrs': edge_ptrs,\n 'surf_group': surf_group,\n 'edge_group': edge_group,\n }\n\n self._mult = {\n 'vert': numpy.zeros(nvert, int),\n 'edge': numpy.zeros(nedge, int),\n 'diff_vert': numpy.zeros(nvert, int),\n 'diff_edge': numpy.zeros(nedge, int),\n }\n\n self._bspline = {\n 'order': 4 * numpy.ones(ngroup, int),\n 'num_cp': 4 * numpy.ones(ngroup, int),\n 'num_pt': 10 * numpy.ones(ngroup, int),\n }\n\n self._surf_indices = {\n 'df': numpy.zeros((nsurf, 2), int, 'F'),\n 'cp': numpy.zeros((nsurf, 2), int, 'F'),\n 'pt': numpy.zeros((nsurf, 2), int, 'F'),\n }\n\n self._edge_indices = {\n 'df': numpy.zeros((nedge, 2), int, 'F'),\n 'cp': numpy.zeros((nedge, 2), int, 'F'),\n 'pt': numpy.zeros((nedge, 2), int, 'F'),\n }\n\n self._str_indices = {\n 'cp': numpy.zeros((nsurf, 2), int, 'F'),\n 'pt': numpy.zeros((nsurf, 2), int, 'F'),\n }\n\n self._vert_indices = numpy.zeros(nvert, int)\n\n self._size = {\n 'df_str': 0,\n 'df': 0,\n 'cp': 0,\n 'cp_str': 0,\n 'pt_str': 0,\n 'pt': 0,\n }\n\n self.diff = {\n 'surf': numpy.zeros((nsurf, 3, 3), bool, 'F'),\n 'edge': numpy.zeros((nedge, 2), bool, 'F'),\n }\n\n self.hidden = numpy.zeros(nsurf, bool)\n\n self.jac = {\n 'd(df)/d(df_str)': None,\n 'd(cp)/d(df)': None,\n 'd(cp_str)/d(cp)': None,\n 'd(pt_str)/d(cp_str)': None,\n 'd(pt)/d(pt_str)': None,\n }\n\n self.vec = {\n 'df_str': None,\n 'df': None,\n 'cp': None,\n 'cp_str': None,\n 'pt_str': None,\n 'pt': None,\n }","def topology(self, topo_file: str, *args: str):\n self.scion_sh('topology', '-c', topo_file, '-d', *args)","def plane_OLS(x,y,z, print_distances=False):\n A = np.array([x, y]).T\n B = z.T\n\n #solve Ax=B\n p = np.matmul(np.matmul(linalg.inv(np.matmul(A.T, A)), A.T), B.T) #uses left pseudo-inverse {(A^T * A)^-1 * A^T} due to system being overconstrained (A doesn't have a true inverse)\n params = [-float(p[0]), -float(p[1]), 1.0] #c=1.0 by default\n bottom = np.sqrt(params[0]*params[0] + params[1]*params[1] + params[2]*params[2])\n for i in range(len(params)): params[i] = params[i]/bottom\n print(\"# - Normalized best-fit plane parameters: {0}\".format(params))\n if print_distances:\n for i in range(len(x)):\n print(plane_dist(x[i], y[i], z[i], params))\n return params","def __init__(self, constraints=[], infeasiblePoints=[], feasiblePoints=[], optimalPoint=None, costVector=None, zoom=1.0, frameTime=0.0): \n super(PacmanPlotLP, self).__init__(zoom, frameTime)\n\n xmin = 100000\n ymin = 100000\n xmax = -100000\n ymax = -100000\n\n for point in feasiblePoints:\n if point[0] < xmin:\n xmin = point[0]\n if point[0] > xmax:\n xmax = point[0]\n if point[1] < ymin:\n ymin = point[1]\n if point[1] > ymax:\n ymax = point[1]\n\n if len(feasiblePoints) == 0:\n for point in infeasiblePoints:\n if point[0] < xmin:\n xmin = point[0]\n if point[0] > xmax:\n xmax = point[0]\n if point[1] < ymin:\n ymin = point[1]\n if point[1] > ymax:\n ymax = point[1]\n\n xmin = int(math.floor(xmin)) - 3\n ymin = int(math.floor(ymin)) - 3\n xmax = int(math.ceil(xmax)) + 3\n ymax = int(math.ceil(ymax)) + 3\n width = xmax-xmin+1\n height = ymax-ymin+1\n\n# p = feasiblePoints[2]\n# print(\"p={}\".format(p))\n# print(\"feasible={}\".format(self.pointFeasible(p, constraints)))\n# g = self.cartesianToLayout(xmin, ymin, xmax, ymax, p)\n# print(\"g={}\".format(g))\n# gr = (int(round(g[0])), int(round(g[1])))\n# p2 = self.layoutToCartesian(xmin, ymin, xmax, ymax, gr)\n# print(\"p2={}\".format(p2))\n# print(\"p2 feasible={}\".format(self.pointFeasible(p2, constraints)))\n\n layoutLists = self.blankLayoutLists(width, height)\n\n self.addInfeasibleGhosts(layoutLists, constraints, xmin, ymin, xmax, ymax)\n\n layoutLists = self.changeBorderGhostsToWall(layoutLists)\n \n for point in infeasiblePoints:\n self.addCartesianPointToLayout(layoutLists, point, '.', xmin, ymin, xmax, ymax)\n\n for point in feasiblePoints:\n self.addCartesianPointToLayout(layoutLists, point, 'o', xmin, ymin, xmax, ymax)\n\n if optimalPoint is not None:\n self.addCartesianPointToLayout(layoutLists, optimalPoint, 'P', xmin, ymin, xmax, ymax)\n\n if graphicsUtils._canvas is not None:\n graphicsUtils.clear_screen()\n \n # Initialize GameStateData with blank board with axes \n self.width = width\n self.height = height\n\n self.zoom = min(30.0/self.width, 20.0/self.height)\n self.gridSize = graphicsDisplay.DEFAULT_GRID_SIZE * self.zoom\n\n maxNumGhosts = 10000\n layout = Layout(layoutLists)\n self.blankGameState = GameStateData()\n self.blankGameState.initialize(layout, maxNumGhosts)\n self.initialize(self.blankGameState)\n title = 'Pacman Plot LP'\n graphicsUtils.changeText(self.infoPane.scoreText, title)\n graphicsUtils.refresh()\n graphicsUtils.sleep(1)\n\n if costVector is not None:\n self.shadeCost(layoutLists, constraints, costVector, feasiblePoints, xmin, ymin, xmax, ymax)","def generateTopology():\n switches = {}\n interfaces = {}\n links = {}\n return (switches,links)","def __init__(self, n=1, cpu=.1, bw=10, delay=None,\n max_queue_size=None, **params):\n\n # Initialize topo\n Topo.__init__(self, **params)\n\n # Host and link configuration\n hconfig = {'cpu': cpu}\n lconfig = {'bw': bw, 'delay': delay,\n 'max_queue_size': max_queue_size }\n\n # Create the actual topology\n receiver = self.addHost('receiver')\n\n # Switch ports 1:uplink 2:hostlink 3:downlink\n uplink, hostlink, downlink = 1, 2, 3\n\n # The following template code creates a parking lot topology\n # TODO: Replace the template code to create a parking lot topology for any arbitrary N (>= 1)\n if n < 1: # network must have at least 1 host\n return -1\n\n s = [] # Python list of switches\n h = [] # Python list of hosts\n\n # dynamically add all hosts and switches to network backbone first\n for i in range(n):\n switch_name = 's%s' % (i+1)\n host_name = 'h%s' % (i+1)\n\n s.append( self.addSwitch(switch_name) ) # s[0] is switch1\n h.append( self.addHost(host_name) ) # h[0] is host1\n\n # Wire up clients\n self.addLink(h[i], s[i], port1=0, port2=hostlink, **lconfig)\n \n # link to previous switch\n if i > 0:\n self.addLink(s[i-1], s[i], port1=downlink, port2=uplink, **lconfig)\n\n \n # Wire up receiver to first switch\n self.addLink(receiver, s[0], port1=0, port2=uplink, **lconfig)\n\n '''\n # for N = 1\n # Begin: Template code\n s1 = self.addSwitch('s1')\n h1 = self.addHost('h1', **hconfig)\n\n # Wire up receiver\n self.addLink(receiver, s1, port1=0, port2=uplink, **lconfig)\n\n # Wire up clients\n self.addLink(h1, s1, port1=0, port2=hostlink, **lconfig)\n\n # Uncomment the next 8 lines to create a N = 3 parking lot topology\n s2 = self.addSwitch('s2')\n h2 = self.addHost('h2', **hconfig)\n self.addLink(s1, s2,\n port1=downlink, port2=uplink, **lconfig)\n self.addLink(h2, s2,\n port1=0, port2=hostlink, **lconfig)\n\n s3 = self.addSwitch('s3')\n h3 = self.addHost('h3', **hconfig)\n self.addLink(s2, s3,\n port1=downlink, port2=uplink, **lconfig)\n self.addLink(h3, s3,\n port1=0, port2=hostlink, **lconfig)\n \n # End: Template code\n '''","def __init__(self, dx = 1., dy = 1., nx = 1, ny = 1,\n _RepresentationClass=_Grid2DRepresentation, _TopologyClass=_Mesh2DTopology):\n\n self.args = {\n 'dx': dx,\n 'dy': dy,\n 'nx': nx,\n 'ny': ny\n }\n\n self.nx = nx\n self.ny = ny\n\n self.numberOfHorizontalFaces = self.nx * (self.ny + 1)\n self.numberOfVerticalFaces = self.ny * (self.nx + 1)\n self.numberOfEachDiagonalFaces = self.nx * self.ny\n\n self.dx = PhysicalField(value = dx)\n scale = PhysicalField(value = 1, unit = self.dx.unit)\n self.dx /= scale\n\n self.dy = PhysicalField(value = dy)\n if self.dy.unit.isDimensionless():\n self.dy = dy\n else:\n self.dy /= scale\n\n self.numberOfCornerVertices = (self.nx + 1) * (self. ny + 1)\n self.numberOfCenterVertices = self.nx * self.ny\n self.numberOfTotalVertices = self.numberOfCornerVertices + self.numberOfCenterVertices\n\n self.offset = (0, 0)\n\n vertices = self._createVertices()\n faces = self._createFaces()\n\n cells = self._createCells()\n cells = numerix.sort(cells, axis=0)\n\n Mesh2D.__init__(self, vertices, faces, cells,\n _RepresentationClass=_RepresentationClass, _TopologyClass=_TopologyClass)\n\n self.scale = scale","def fake_focalplane(\n samplerate=20,\n epsilon=0,\n net=1,\n fmin=0,\n alpha=1,\n fknee=0.05,\n fwhm=30,\n npix=7,\n fov=3.0\n):\n zaxis = np.array([0, 0, 1.0])\n \n pol_A = hex_pol_angles_qu(npix)\n pol_B = hex_pol_angles_qu(npix, offset=90.0)\n \n dets_A = hex_layout(npix, fov, \"\", \"\", pol_A)\n dets_B = hex_layout(npix, fov, \"\", \"\", pol_B)\n \n dets = dict()\n for p in range(npix):\n pstr = \"{:01d}\".format(p)\n for d, layout in zip([\"A\", \"B\"], [dets_A, dets_B]):\n props = dict()\n props[\"quat\"] = layout[pstr][\"quat\"]\n props[\"epsilon\"] = epsilon\n props[\"rate\"] = samplerate\n props[\"alpha\"] = alpha\n props[\"NET\"] = net\n props[\"fmin\"] = fmin\n props[\"fknee\"] = fknee\n props[\"fwhm_arcmin\"] = fwhm\n dname = \"{}{}\".format(pstr, d)\n dets[dname] = props\n return dets","def Planes(pi1, pi2):\n\n if not isinstance(p11, Plane):\n pi1 = Plane(arg.getvector(pi1, 4))\n if not isinstance(p12, Plane):\n pi2 = Plane(arg.getvector(pi2, 4))\n \n w = np.cross(pi1.n, pi2.n)\n v = pi2.d * pi1.n - pi1.d * pi2.n\n return Plucker(np.r_[v, w])","def topology(self, bonds_info, angles_info):\n return self.header() + self.defaults() +\\\n self.moleculetype() + self.atoms() +\\\n self.bonds(bonds_info) + self.angles(angles_info)","def PlotAntsPlane():\n\n # load and shrink airplane\n airplane = vtkInterface.PolyData(planefile)\n airplane.points /= 10\n # pts = airplane.GetNumpyPoints() # gets pointer to array\n # pts /= 10 # shrink\n\n # rotate and translate ant so it is on the plane\n ant = vtkInterface.PolyData(antfile)\n ant.RotateX(90)\n ant.Translate([90, 60, 15])\n\n # Make a copy and add another ant\n ant_copy = ant.Copy()\n ant_copy.Translate([30, 0, -10])\n\n # Create plotting object\n plobj = vtkInterface.PlotClass()\n plobj.AddMesh(ant, 'r')\n plobj.AddMesh(ant_copy, 'b')\n\n # Add airplane mesh and make the color equal to the Y position\n plane_scalars = airplane.points[:, 1]\n plobj.AddMesh(airplane, scalars=plane_scalars, stitle='Plane Y\\nLocation')\n plobj.AddText('Ants and Plane Example')\n plobj.Plot()","def two_plane_obj_points(grid_size, dx):\r\n objp_xy = np.zeros((grid_size[0]*grid_size[1], 3), np.float32)\r\n objp_yz = np.zeros((grid_size[1]*grid_size[2], 3), np.float32)\r\n objp_xy[:,:2] = np.mgrid[0:grid_size[0], 0:grid_size[1]].T.reshape(-1, 2)\r\n objp_yz[:,1:3] = np.mgrid[0:grid_size[1], 0:grid_size[2]].T.reshape(-1, 2)\r\n\r\n return objp_xy*dx, objp_yz*dx","def build_topo(self):\n super(EBGPTopo, self).build()","def patterning(mesh, operator):\n\n\n operators = {\n 'conway_dual': conway_dual,\n 'conway_join': conway_join,\n 'conway_ambo': conway_ambo,\n 'conway_kis': conway_kis,\n 'conway_needle': conway_needle,\n 'conway_zip': conway_zip,\n 'conway_truncate': conway_truncate,\n 'conway_ortho': conway_ortho,\n 'conway_expand': conway_expand,\n 'conway_gyro': conway_gyro,\n 'conway_snub': conway_snub,\n 'conway_meta': conway_meta,\n 'conway_bevel': conway_bevel\n }\n\n try:\n operators[operator](mesh)\n return mesh\n except:\n return mesh","def plane_desc(self) -> str:\n return self.planes[0].join(' ') + self.planes[1].join(' ') + self.planes[2].join(' ')","def create_partition(mesh,polygons,enforce_exact=False):","def MeshMachine(main):\n\n # oDesign definition\n oDesign = main['ANSYS']['oDesign']\n\n # Data for the rotor mesh\n RotorName = main['ANSYS']['Rotor&Magnets']['Name'][0]\n RotorNumMaxElem = main['ANSYS']['Mesh']['Rotor']['NumMaxElem']\n RotorMaxLength = main['ANSYS']['Mesh']['Rotor']['MaxLength']\n\n # Data for the magnets mesh\n PMNames = main['ANSYS']['Rotor&Magnets']['PMNames']\n PMNumMaxElem = main['ANSYS']['Mesh']['Magnets']['NumMaxElem']\n PMMaxLength = main['ANSYS']['Mesh']['Magnets']['MaxLength']\n\n # Data for the Stator mesh\n StatorName = main['ANSYS']['Stator']['Name']\n StatorNormalDev = main['ANSYS']['Mesh']['Stator']['NormalDev']\n StatorAspectRatio = main['ANSYS']['Mesh']['Stator']['AspectRatio']\n\n # Data for the Stator mesh\n CoilNames = main['ANSYS']['Winding']['CoilNames']\n WindingNumMaxElem = main['ANSYS']['Mesh']['Winding']['NumMaxElem']\n WindingMaxLength = main['ANSYS']['Mesh']['Winding']['MaxLength']\n\n WindingName = []\n for phase in CoilNames:\n for direction in phase:\n WindingName += direction\n\n # Creating meshes\n oModule = oDesign.GetModule(\"MeshSetup\")\n\n # Rotor meshes\n oModule.AssignLengthOp(\n [\n \"NAME:Rotor\",\n \"RefineInside:=\", True,\n \"Enabled:=\", True,\n \"Objects:=\", [RotorName],\n \"RestrictElem:=\", False,\n \"NumMaxElem:=\", str(RotorNumMaxElem),\n \"RestrictLength:=\", True,\n \"MaxLength:=\", str(RotorMaxLength)+\"mm\"\n ]\n )\n # Magnet meshes\n oModule.AssignLengthOp(\n [\n \"NAME:Magnets\",\n \"RefineInside:=\", True,\n \"Enabled:=\", True,\n \"Objects:=\", PMNames,\n \"RestrictElem:=\", False,\n \"NumMaxElem:=\", str(PMNumMaxElem),\n \"RestrictLength:=\", True,\n \"MaxLength:=\", str(PMMaxLength)+\"mm\"\n ]\n )\n # Stator meshes\n oModule.AssignTrueSurfOp(\n [\n \"NAME:Stator\",\n \"Objects:=\", [StatorName],\n \"CurvedSurfaceApproxChoice:=\", \"ManualSettings\",\n \"SurfDevChoice:=\", 0,\n \"NormalDevChoice:=\", 2,\n \"NormalDev:=\", str(StatorNormalDev) + \"deg\",\n \"AspectRatioChoice:=\", 2,\n \"AspectRatio:=\", str(StatorAspectRatio)\n ]\n )\n\n # Coil meshes\n oModule.AssignLengthOp(\n [\n \"NAME:Coils\",\n \"RefineInside:=\"\t, True,\n \"Enabled:=\"\t\t, True,\n \"Objects:=\"\t\t, WindingName,\n \"RestrictElem:=\"\t, False,\n \"NumMaxElem:=\"\t\t, str(WindingNumMaxElem),\n \"RestrictLength:=\"\t, True,\n \"MaxLength:=\"\t\t, str(WindingMaxLength) +\"mm\"\n ]\n )\n\n return main","def convert_topology(src_filename, set_backbone=True, in_place=False, split_dir=None):\n\n # Grab unit cell description (should be on first few lines:\n cryst = None\n with open(src_filename) as src:\n for line in src.readlines():\n if line.startswith('CRYST1'):\n cryst = line\n break\n\n # Read in source PDB (DEShaw original format)\n src_pdb = PdbStructure(open(src_filename))\n atoms = list(src_pdb.iter_atoms())\n topo = md.load(src_filename).top\n\n # Break into 4 segments\n segment_list = ['C1', 'C2', 'C3', 'C4']\n segment = {l:[] for l in segment_list}\n for i in atoms: \n segment[i.segment_id].append(i)\n\n # Set temperature factor (for gradual heating) \n if set_backbone:\n backbone = topo.select(\"backbone\")\n for i in range(0, len(segment['C1'])):\n if i in backbone:\n segment['C1'][i].location.temperature_factor = 1.0\n\n # Resort water segements and alias \"pseu\" to OM (tip4p forcefield)\n for wat in ['C2', 'C3']:\n segment[wat] = sorted(segment[wat], key = lambda i: i.residue_number)\n start_serial_num = min(segment[wat], key= lambda i: i.serial_number)\n for i in range(0, len(segment[wat])):\n newsn = i + start_serial_num.serial_number\n segment[wat][i].serial_number = newsn\n if segment[wat][i].get_name == 'pseu':\n segment[wat][i].set_name_with_spaces(' OM ')\n\n # FOR RE-RUNNING THE PSFGEN\n if split_dir is not None:\n for s in segment_list:\n with open(split_dir + '/%s.pdb' % s, 'w') as dest:\n for atom in segment[s]:\n _=dest.write(str(atom) + '\\n')\n\n # Writeout new file\n if in_place:\n dest = open(src_filename, 'w')\n if cryst is not None:\n dest.write(cryst)\n for s in segment_list:\n for atom in segment[s]:\n _=dest.write(str(atom) + '\\n')\n _=dest.write('END')\n dest.close()","def build_topology_vonneumann(config):\n\n width = config['VonNeumannTopology']['width']\n height = config['VonNeumannTopology']['height']\n periodic = config['VonNeumannTopology']['periodic']\n assert width > 0 and height > 0\n\n graph = nx.grid_2d_graph(m=width, n=height, periodic=periodic)\n graph = nx.convert_node_labels_to_integers(graph)\n graph.name = \"VonNeumann Lattice: {r} rows, {c} columns\".format(r=height,\n c=width)\n\n if periodic:\n graph.name += ' with periodic boundaries'\n\n for node in graph.nodes_iter():\n graph.node[node]['coords'] = divmod(node, width)\n\n return graph","def createTopology(self):\n\n # find DAG root\n dagRoot = None\n for mote in self.motes:\n if mote.id == 0:\n mote.role_setDagRoot()\n dagRoot = mote\n assert dagRoot\n\n if self.settings.mobilityModel == 'RPGM':\n # put DAG root at center of area\n dagRoot.setLocation(x=SimEngine.SimEngine().targets[0][0],\n y=SimEngine.SimEngine().targets[0][1])\n else:\n # put DAG root at center of area\n dagRoot.setLocation(x=self.squareSide/2,\n y=self.squareSide/2)\n\n # reposition each mote until it is connected\n connectedMotes = [dagRoot]\n motes_shuffled = copy.copy(self.motes)\n random.shuffle(motes_shuffled) # shuffle them around\n\n # for mote in self.motes:\n for mote in motes_shuffled:\n stableNeighbors = []\n if mote in connectedMotes:\n continue\n\n connected = False\n while not connected:\n # pick a random location\n # mote.setLocation(x=self.squareSide*random.random(),\n # y=self.squareSide*random.random())\n #\n # mote.setLocation(\n # x=self.settings.squareSide * random.random(),\n # y=self.settings.squareSide * random.random()\n # )\n\n newX = None\n newY = None\n # if no topology is not given, build the topology yourself\n if SimEngine.SimEngine().ilp_topology is None:\n newX = self.settings.squareSide * random.random()\n newY = self.settings.squareSide * random.random()\n else:\n # if no topology is given, use that topology\n newX = SimEngine.SimEngine().ilp_topology[str(mote.id)]['x']\n newY = SimEngine.SimEngine().ilp_topology[str(mote.id)]['y']\n\n mote.setLocation(\n x=newX,\n y=newY\n )\n\n numStableNeighbors = 0\n stableNeighbors = []\n\n # tryAgain = False\n # for cm in connectedMotes:\n # rssi = self._computeRSSI(mote, cm)\n # if rssi > -110:\n # tryAgain = True\n\n # if not tryAgain:\n # count number of neighbors with sufficient RSSI\n for cm in connectedMotes:\n\n rssi = self._computeRSSI(mote, cm)\n mote.setRSSI(cm, rssi)\n cm.setRSSI(mote, rssi)\n\n # save the intial RSSI values for future use in the mobility models\n mote.initialRSSI[cm] = rssi\n cm.initialRSSI[mote] = rssi\n\n if self.settings.individualModulations == 1:\n if self.rssiToPdr(rssi, modulation=Modulation.Modulation().minimalCellModulation[SimSettings.SimSettings().modulationConfig]) > self.settings.stableNeighborPDR:\n # if rssi > Modulation.Modulation().modulationStableRSSI[Modulation.Modulation().minimalCellModulation[SimSettings.SimSettings().modulationConfig]]:\n # print rssi\n numStableNeighbors += 1\n stableNeighbors.append(cm.id)\n else:\n if rssi > self.STABLE_RSSI:\n # print rssi\n numStableNeighbors += 1\n\n # make sure it is connected to at least STABLE_NEIGHBORS motes\n # or connected to all the currently deployed motes when the number of deployed motes\n # are smaller than STABLE_NEIGHBORS\n if numStableNeighbors >= self.stable_neighbors or numStableNeighbors == len(connectedMotes):\n print 'For mote {0}, stable neighbors {1}'.format(mote.id, stableNeighbors)\n connected = True\n\n connectedMotes += [mote]\n\n # for each mote, compute PDR to each neighbors\n for mote in self.motes:\n for m in self.motes:\n if mote == m:\n continue\n\n # set the distance to all other motes\n distance = math.sqrt((m.x - mote.x) ** 2 + (m.y - mote.y) ** 2)\n m.set_distance(mote, distance)\n mote.set_distance(m, distance)\n # print 'mote %d to mote %d: %.4f' % (m.id, mote.id, distance)\n if self.settings.individualModulations == 1:\n rssi_value = mote.getRSSI(m)\n # for modulationTmp in Modulation.Modulation().modulations:\n # if self.settings.ilpfile is not None:\n # ## I am not going to set this as this should be set by the ILP\n # pass\n # else:\n # # if the rssi value is higher than the minimal signal value required for this neighbor, take that modulation\n # # and compute the PDR using that modulation\n # pass\n # # if rssi_value > Modulation.Modulation().modulationStableRSSI[modulationTmp]:\n # # pdr = self._computePDR(mote, m, modulation=modulationTmp)\n # # mote.setPDR(m, pdr)\n # # m.setPDR(mote, pdr)\n # # mote.setModulation(m, modulationTmp)\n # # m.setModulation(mote, modulationTmp)\n else:\n if mote.getRSSI(m) > mote.minRssi:\n pdr = self._computePDR(mote, m)\n mote.setPDR(m, pdr)\n m.setPDR(mote, pdr)","def surfaceRender(nodal_mesh, focus, ax=None):\n\t# If no axes were passed, generate new set of axes\n\tif not ax:\n\t\tfig = mplt.figure()\n\t\tax = fig.add_subplot(111, projection='3d')\n\n\t# Sort the mesh by first 3 columns\n\tnodal_mesh = nodal_mesh[nodal_mesh[:, 0].argsort()]\n\tnodal_mesh = nodal_mesh[nodal_mesh[:, 1].argsort(kind='mergesort')]\n\tnodal_mesh = nodal_mesh[nodal_mesh[:, 2].argsort(kind='mergesort')]\n\t\n\t# Set up number of divisions and calculate e for each division (as a ratio)\n\tnum_div = 20\n\te = [i/num_div for i in range(num_div + 1)]\n\t# Convert angular values from degrees to radians\n\trads = math.pi/180\n\tnodal_mesh[:, 1:3] *= rads\n\t# Store the shapes and sizes of the mesh values\n\tm = nodal_mesh.shape[0]\n\tsize_nodal_nu = np.where(nodal_mesh[:, 2] == 0)[0].size\n\tsize_nodal_phi = m/size_nodal_nu\n\t# Get the mu and theta values from the mesh\n\tnodal_nu = nodal_mesh[:size_nodal_nu, 1]\n\tnodal_phi = nodal_mesh[::size_nodal_nu, 2]\n\t# Convert apex node from prolate to cartesian, then plot with scatter\n\tif min(nodal_nu) == 0:\n\t\tx, y, z = mathhelper.prolate2cart(nodal_mesh[0, 0], nodal_mesh[0, 1], nodal_mesh[0, 2], focus)\n\t\tax.scatter(z, y, -x)\n\t\tstart_nu = 1\n\telse:\n\t\tstart_nu = 0\n\t# Plot circumferential element boundaries\n\tfor i in range(start_nu, size_nodal_nu):\n\t\tfor j in range(int(size_nodal_phi)):\n\t\t\t# Define nodal values for interpolation\n\t\t\tif j == size_nodal_phi-1:\n\t\t\t\tind0 = i\n\t\t\t\tp0 = 2*math.pi\n\t\t\telse:\n\t\t\t\tind0 = (j+1)*size_nodal_nu + i\n\t\t\t\tp0 = nodal_phi[j+1]\n\t\t\tind1 = (j)*size_nodal_nu + i\n\t\t\tp1 = nodal_phi[j]\n\t\t\t# Get mu and dM/dm1\n\t\t\tm0 = nodal_mesh[ind0, 0]\n\t\t\tdm0 = nodal_mesh[ind0, 3]\n\t\t\tm1 = nodal_mesh[ind1, 0]\n\t\t\tdm1 = nodal_mesh[ind1, 3]\n\t\t\t# Convert to cartesian\n\t\t\tn0x, n0y, n0z = mathhelper.prolate2cart(nodal_mesh[ind0, 0], nodal_mesh[ind0, 1], nodal_mesh[ind0, 2], focus)\n\t\t\t# Plot the node\n\t\t\tax.scatter(n0z, n0y, -n0x)\n\t\t\t# Plot the arc segments\n\t\t\tfor k in range(2, len(e)):\n\t\t\t\t# Determine starting point to use\n\t\t\t\tif k == 2:\n\t\t\t\t\tpt_x, pt_y, pt_z = n0x, n0y, n0z\n\t\t\t\telse:\n\t\t\t\t\tpt_x, pt_y, pt_z = x_here, y_here, z_here\n\t\t\t\t# Get lambda\n\t\t\t\thm0 = 1 - 3*(e[k]**2) + 2*(e[k]**3)\n\t\t\t\thdm0 = e[k]*(e[k] - 1)**2\n\t\t\t\thm1 = (e[k]**2)*(3 - 2*e[k])\n\t\t\t\thdm1 = (e[k]**2)*(e[k] - 1)\n\t\t\t\tm = hm0 * m0 + hdm0 * dm0 + hm1 * m1 + hdm1 * dm1\n\t\t\t\t# Get theta\n\t\t\t\tp_here = p0 - e[k]*(p0 - p1)\n\t\t\t\t# Convert to cartesian\n\t\t\t\tx_here, y_here, z_here = mathhelper.prolate2cart(m, nodal_nu[i], p_here, focus)\n\t\t\t\t# Create vectors\n\t\t\t\tx = np.append(pt_x, x_here)\n\t\t\t\ty = np.append(pt_y, y_here)\n\t\t\t\tz = np.append(pt_z, z_here)\n\t\t\t\t# Plot segments\n\t\t\t\tax.plot(z, y, -x, 'k-.')\n\t# Plot longitudinal element boundaries\n\tfor i in range(int(size_nodal_phi)):\n\t\tfor j in range(size_nodal_nu-1):\n\t\t\t# Define nodal values needeed for interpolation\n\t\t\tind0 = i*size_nodal_nu + j\n\t\t\tind1 = ind0 + 1\n\t\t\tn0 = nodal_nu[j]\n\t\t\tn1 = nodal_nu[j+1]\n\t\t\t# Get lambda and dL/de2\n\t\t\tm0 = nodal_mesh[ind0, 0]\n\t\t\tdm0 = nodal_mesh[ind0, 4]\n\t\t\tm1 = nodal_mesh[ind1, 0]\n\t\t\tdm1 = nodal_mesh[ind1, 4]\n\t\t\t# Convert nodal points to cartesian\n\t\t\tn0x, n0y, n0z = mathhelper.prolate2cart(nodal_mesh[ind0, 0], nodal_mesh[ind0, 1], nodal_mesh[ind0, 2], focus)\n\t\t\t# Plot arc\n\t\t\tfor k in range(2, len(e)):\n\t\t\t\t# Determine point to use\n\t\t\t\tif k == 2:\n\t\t\t\t\tpt_x, pt_y, pt_z = n0x, n0y, n0z\n\t\t\t\telse:\n\t\t\t\t\tpt_x, pt_y, pt_z = x_here, y_here, z_here\n\t\t\t\t# Get lambda\n\t\t\t\thm0 = 1 - 3*(e[k]**2) + 2*(e[k]**3)\n\t\t\t\thdm0 = e[k]*(e[k] - 1)**2\n\t\t\t\thm1 = (e[k]**2)*(3 - 2*e[k])\n\t\t\t\thdm1 = (e[k]**2)*(e[k] - 1)\n\t\t\t\tm = hm0 * m0 + hdm0 * dm0 + hm1 * m1 + hdm1 * dm1\n\t\t\t\t# Get nu\n\t\t\t\tn_here = n0 + e[k]*(n1-n0)\n\t\t\t\t# Convert to cartesian\n\t\t\t\tx_here, y_here, z_here = mathhelper.prolate2cart(m, n_here, nodal_phi[i], focus)\n\t\t\t\t# Append the vectors for plotting\n\t\t\t\tx = np.append(pt_x, x_here)\n\t\t\t\ty = np.append(pt_y, y_here)\n\t\t\t\tz = np.append(pt_z, z_here)\n\t\t\t\t# Plot the segment\n\t\t\t\tax.plot(z, y, -x, 'k-.')\n\t\t\t\t\n\treturn(ax)","def planes_3d(self, quantity, xplane, yplane):\n xplane = int(xplane)\n yplane = int(yplane)\n # Get the scalar values\n # Get the data on the plane with a fixed x value. These means we'll\n # have changing (y, z) points\n xdata = self.get_plane(quantity, 'yz', xplane)\n # z first cuz we want y to be changing before z to correspond with the\n # way numpy flattens arrays. Note this means y points will be in the\n # 2nd column\n xplanepoints = np.array(list(itertools.product(self.Z, self.Y)))\n xdata = xdata.flatten()\n xplanexval = np.array(list(itertools.repeat(x[xplane], len(xdata))))\n xplanedata = np.zeros((xplanepoints.shape[0], 4))\n xplanedata[:, 0] = xplanexval\n xplanedata[:, 1] = xplanepoints[:, 1]\n xplanedata[:, 2] = xplanepoints[:, 0]\n xplanedata[:, 3] = xdata\n # Same procedure for fixed y plane\n ydata = self.get_plane(quantity, 'xz', yplane)\n yplanepoints = np.array(list(itertools.product(z, x)))\n ydata = ydata.flatten()\n yplaneyval = np.array(list(itertools.repeat(y[yplane], len(ydata))))\n yplanedata = np.zeros((yplanepoints.shape[0], 4))\n yplanedata[:, 0] = yplanepoints[:, 1]\n yplanedata[:, 1] = yplaneyval\n yplanedata[:, 2] = yplanepoints[:, 0]\n yplanedata[:, 3] = ydata\n labels = ('X [um]', 'Y [um]', 'Z [um]', quantity)\n # Now stack them vertically and plot!\n all_data = np.vstack((xplanedata, yplanedata))\n self.scatter3d(all_data[:, 0], all_data[:, 1], all_data[:, 2],\n all_data[:, 3], labels, 'planes_3d')","def RoadRiverTab():\n\n # Main layout\n mainTab = cmds.columnLayout(adjustableColumn=True, columnAttach=('both', 20))\n \n ### Geo parameters\n cmds.separator(height=10, style=\"none\")\n cmds.text(label=\"Generate road and rivers:\", align=\"left\")\n RoadRiverTab.roadWidth = cmds.floatSliderGrp(label=\"Road Width\", field=True, value=1, min=.01, max=100)\n RoadRiverTab.roadQuality = cmds.intSliderGrp(label=\"Curve Quality\", field=True, value=20, min=2, max=100)\n\n ### Choose which king of geo\n cmds.separator(height=5, style=\"none\")\n cmds.rowLayout(numberOfColumns=3, adjustableColumn=2)\n cmds.button(label='Create Road', width=200, command=buildRoad)\n cmds.separator(style=\"none\")\n cmds.button(label=\"Create River\", width=200, command=buildRiver)\n\n cmds.setParent('..')\n cmds.setParent('..')\n\n return mainTab","def create_spacecraft_geometry():\r\n\r\n bounds_lower = [3, 7, 33]\r\n funcs_lower = [0, lambda y: y ** 1.5, 0]\r\n\r\n bounds_upper = None\r\n funcs_upper = 100\r\n\r\n x_max = 10\r\n x_min = 0\r\n resolution = 200\r\n\r\n spacecraft = Geometry(x_max, x_min, resolution,\r\n bounds_upper, funcs_upper,\r\n bounds_lower, funcs_lower)\r\n\r\n return spacecraft","def shapebuild_PlaneXOY(*args):\n return _ShapeBuild.shapebuild_PlaneXOY(*args)","def __init__(self, spread, depth, bandwidth, delay, loss, fpga, fpga_bandwidth=None, fpga_delay=None,\n fpga_loss=None, poisson=None):\n logger = logging.getLogger(__name__)\n\n # Initialize topology #\n Topo.__init__(self)\n\n # Setup parameters\n fpga_bandwidth = bandwidth if fpga_bandwidth is None else fpga_bandwidth\n fpga_delay = delay if fpga_delay is None else halve_delay(fpga_delay)\n fpga_loss = loss * 2 if fpga_loss is None else fpga_loss\n\n if poisson:\n link_opts = dict(bw=bandwidth, delay=get_poisson_delay(delay), loss=loss, use_htb=True)\n fpga_link_opts = dict(bw=fpga_bandwidth, delay=get_poisson_delay(fpga_delay),\n loss=fpga_loss, use_htb=True)\n else:\n link_opts = dict(bw=bandwidth, delay=delay, loss=loss, use_htb=True)\n fpga_link_opts = dict(bw=fpga_bandwidth, delay=fpga_delay, loss=fpga_loss, use_htb=True)\n cloud_link_opts = dict(bw=1000, delay='0ms', loss=0, use_htb=True)\n\n # Add hosts and switches #\n\n # switch naming convention:\n # s[level][switch_number]\n\n switches = [[None for _ in range(spread ** (depth - 1))] for _ in range(depth - 1)]\n hosts = [None for _ in range(spread ** (depth - 1))]\n\n for i in range(depth):\n for j in range(spread ** i):\n if i == (depth - 1):\n hosts[j] = self.addHost('h' + str(j))\n else:\n sw_name = 's' + str(i) + str(j)\n switches[i][j] = self.addSwitch(sw_name)\n if fpga is not None and fpga == i:\n # Create host to serve as FPGA in switch\n # Will have one link to the relevant FPGA\n # The link will have the bandwidth and loss specified by the user, and half\n # the delay\n # These parameters are as if they were caused by the FPGA, rather than a\n # link\n # As a result, latency is halved since it will essentially be doubled by the\n # packet flowing in\n # and out of the host\n self.addHost('f{}'.format(j))\n self.addLink(sw_name, 'f{}'.format(j), **fpga_link_opts)\n\n # Add host to serve as cloud\n # Will have one high bandwidth, 0 latency link to root switch\n self.addHost('cloud')\n self.addLink(switches[0][0], 'cloud', **cloud_link_opts)\n\n # Add links #\n\n for i, row in enumerate(switches):\n for j, switch in enumerate(row):\n if switch is None:\n break\n if i == (depth - 2):\n for k in range(spread):\n # add a link between the current switch, and all hosts\n # directly beneath it.\n # (spread * j) + k will get all the appropriate hosts\n logger.debug(\"Adding standard link from switch[{}][{}] to \"\n \"host[{}]\".format(i, j, (spread * j) + k))\n self.addLink(switch, hosts[(spread * j) + k], **link_opts)\n\n else:\n for k in range(spread):\n # add a link between the current switch, and all\n # switches directly beneath it.\n # i + 1 refers to 1 level deeper in the tree, and\n # (spread * j) + k will get all the appropriate child\n # switches on that level.\n logger.debug(\"Adding standard link from switch[{}][{}] to \"\n \"switch[{}][{}]\".format(i, j, i + 1, (spread * j) + k))\n self.addLink(switch, switches[i + 1][(spread * j) + k], **link_opts)","def set_topology(self, topo):\n self.topo = topo","def __init__(self, mesh, out_dir='./results/', use_periodic=False):\n s = \"::: INITIALIZING 2D MODEL :::\"\n print_text(s, cls=self)\n \n Model.__init__(self, mesh, out_dir, use_periodic)","def __init__(self, planes, cosmology):\r\n self.planes = planes\r\n self.plane_redshifts = [plane.redshift for plane in planes]\r\n self.cosmology = cosmology","def parse(cls, vmf_file: VMF, tree: Keyvalues) -> 'Side':\n # planes = \"(x1 y1 z1) (x2 y2 z2) (x3 y3 z3)\"\n verts = tree[\"plane\", \"(0 0 0) (0 0 0) (0 0 0)\"][1:-1].split(\") (\")\n if len(verts) != 3:\n raise ValueError('Wrong number of solid planes in \"' +\n tree['plane', ''] +\n '\"')\n planes = [\n Vec.from_str(verts[0]),\n Vec.from_str(verts[1]),\n Vec.from_str(verts[2]),\n ]\n\n side: Side = cls(\n vmf_file,\n planes,\n tree.int('id', -1),\n tree.int('lightmapscale', 16),\n tree.int('smoothing_groups'),\n tree['material', ''],\n tree.float('rotation'),\n UVAxis.parse(tree['uaxis', '[0 1 0 0] 0.25']),\n UVAxis.parse(tree['vaxis', '[0 0 -1 0] 0.25']),\n )\n\n try:\n disp_tree = tree.find_key('dispinfo')\n except LookupError: # Not a displacement.\n return side\n\n # Deal with displacements.\n disp_power = disp_tree.int('power', 4)\n if disp_power in (0, 1, 2, 3, 4):\n side.disp_power = disp_power # type: ignore\n else:\n raise ValueError(f'Invalid displacement power {disp_power}!')\n side.disp_pos = disp_tree.vec('startposition')\n side.disp_elevation = disp_tree.float('elevation')\n disp_flag_ind = disp_tree.int('flags')\n if 0 <= disp_flag_ind <= 16:\n side.disp_flags = _DISP_FLAG_TO_COLL[disp_flag_ind]\n else:\n raise ValueError(f'Invalid displacement flags {disp_flag_ind} in side {side.id}!')\n if disp_tree.bool('subdiv'):\n side.disp_flags |= DispFlag.SUBDIV\n\n # This always has a key of '10', with 10 '-1's...\n vert_key = disp_tree.find_key('allowed_verts')\n allowed_vert = Array('i', map(int, vert_key['10'].split()))\n if len(allowed_vert) != 10:\n raise ValueError(\n f'Displacement allowed_verts in side {side.id} '\n f'must be 10 long!'\n )\n side.disp_allowed_vert = allowed_vert\n\n size = side.disp_size\n side._disp_verts = [\n DispVertex(x, y)\n for y in range(size)\n for x in range(size)\n ]\n # Parse all the rows..\n side._parse_disp_vecrow(disp_tree, 'normals', 'normal')\n side._parse_disp_vecrow(disp_tree, 'offsets', 'offset')\n side._parse_disp_vecrow(disp_tree, 'offset_normals', 'offset_norm')\n\n for y, row in side._iter_disp_row(disp_tree, 'alphas', size):\n try:\n for x, alpha in enumerate(row):\n side._disp_verts[y * size + x].alpha = float(alpha)\n except ValueError as exc:\n raise ValueError(\n f'Displacement array for alpha in side {side.id}, '\n f'row {y} had invalid number: {exc.args[0]}'\n ) from None\n\n for y, row in side._iter_disp_row(disp_tree, 'distances', size):\n try:\n for x, alpha in enumerate(row):\n side._disp_verts[y * size + x].distance = float(alpha)\n except ValueError as exc:\n raise ValueError(\n f'Displacement array for distances in side {side.id}, '\n f'row {y} had invalid number: {exc.args[0]}'\n ) from None\n\n # Not the same, 1 less row and column since it's per-quad.\n tri_tags_count = 2 ** disp_power\n for y, row in side._iter_disp_row(disp_tree, 'triangle_tags', 2 * tri_tags_count):\n try:\n for x in range(tri_tags_count):\n vert = side._disp_verts[y * size + x]\n vert.triangle_a = TriangleTag(int(row[2 * x]))\n vert.triangle_b = TriangleTag(int(row[2 * x + 1]))\n except ValueError as exc:\n raise ValueError(\n f'Displacement array for triangle tags in side {side.id}, '\n f'row {y} had invalid number: {exc.args[0]}'\n ) from None\n\n if 'multiblend' not in disp_tree:\n return side\n # Else: Parse multiblend too.\n # First initialise this list.\n for vert in side._disp_verts:\n vert.multi_colors = [Vec(1, 1, 1), Vec(1, 1, 1), Vec(1, 1, 1), Vec(1, 1, 1)]\n for i in range(4):\n side._parse_disp_vecrow(disp_tree, 'multiblend_color_' + str(i), i)\n\n for y, split in side._iter_disp_row(disp_tree, 'multiblend', 4 * size):\n try:\n for x in range(size):\n side._disp_verts[y * size + x].multi_blend = Vec4(\n float(split[4*x]),\n float(split[4*x + 1]),\n float(split[4*x + 2]),\n float(split[4*x + 3]),\n )\n except ValueError as exc:\n raise ValueError(\n f'Displacement array for multiblend in side {side.id}, '\n f'row {y} had invalid number: {exc.args[0]}'\n ) from None\n\n for y, split in side._iter_disp_row(disp_tree, 'alphablend', 4 * size):\n try:\n for x in range(size):\n side._disp_verts[y * size + x].multi_alpha = Vec4(\n float(split[4*x]),\n float(split[4*x + 1]),\n float(split[4*x + 2]),\n float(split[4*x + 3]),\n )\n except ValueError as exc:\n raise ValueError(\n f'Displacement array for multiblend in side {side.id}, '\n f'row {y} had invalid number: {exc.args[0]}'\n ) from None\n return side","def __init__(self, n=1, delay='1ms', z=1, bw=1, cpu=.1, max_queue_size=None, **params):\n\n # Initialize topo\n Topo.__init__(self, **params)\n\n #TODO: Create your Dynamic Mininet Topology here!\n #NOTE: You MUST label switches as s1, s2, ... sz\n #NOTE: You MUST label hosts as h1-1, h1-2, ... hz-n \n #HINT: Use a loop to construct the topology in pieces.","def is_intersection_plane_plane(plane1, plane2, epsilon=1e-6):\n # check for parallelity of planes\n if abs(dot_vectors(plane1[1], plane2[1])) > 1 - epsilon:\n return False\n return True","def __getPlaneName(self):\n item = self._item()\n planeNormal = item.getNormal() if item is not None else None\n\n for name, normal in self._PLANES.items():\n if numpy.array_equal(planeNormal, normal):\n return name\n return '-'","def make_fake_topology(density=.02, lower_left=ORIGIN, upper_right=Point2D(30, 30), max_z=None):\n styles = ['cone', 'pyramid']\n if not max_z:\n biggest_axis = max(upper_right.x - lower_left.x, upper_right.y - lower_left.y)\n max_z = round(biggest_axis / 1.2) # Just need a rule here. how about max height is half width?\n\n factory = TopologyFactory(lower_left, upper_right)\n number_of_seeds = round(factory.cell_count * density) # how many seeds depends on density and area\n\n # Produce roughly (due to rounding) the number of seeds. We will perform multiple passes,\n # generating random x,y,z values and adding them as peaks on the map. With each pass, the\n # range of z values tends to get smaller (though there is randomness).\n # Also, each pass has a random steepness value, which is essentially the step height if we\n # are walking up an Aztec pyramid\n seeds_per_pass = 5 # a decent-looking value\n passes = round(number_of_seeds // seeds_per_pass)\n\n for i in range(1, passes + 1):\n # get a z-range for this pass\n max_z_pass = round(max_z / i)\n min_z_pass = max_z_pass // 2\n\n seeds = factory._random_points_3d(seeds_per_pass, min_z_pass, max_z_pass)\n steepness = random.uniform(1, 4) # the resulting step height between adjacent cells\n factory._add_peaks_from_seed_points3d(seeds, random.choice(styles), steepness=steepness)\n return factory._tm","def __init__(self, radius, dimensions, index=N_HPFS):\n _OpticalElement.__init__(self, 'itop mirror', index)\n self.add_boundary(SphericalSurface(\n [0., 0., radius - dimensions[2]], float(radius), name='-z',\n reflective=True))\n self.add_boundary(PlaneSurface(\n [0., 0., 1.], [0., 0., 0.], name='+z'))\n self.add_boundary(PlaneSurface(\n [0., 1., 0.], [0., dimensions[1]/2., 0.], name='+y'))\n self.add_boundary(PlaneSurface(\n [0., -1., 0.], [0., -dimensions[1]/2., 0.], name='-y'))\n self.add_boundary(PlaneSurface(\n [1., 0., 0.], [dimensions[0]/2., 0., 0.], name='+x'))\n self.add_boundary(PlaneSurface(\n [-1., 0., 0.], [-dimensions[0]/2., 0., 0.], name='-x'))","def __init__(self, file_data, x0, x1, y0, y1, scan_dir=0):\n\n x0 = self.nm2pnt(x0, file_data)\n x1 = self.nm2pnt(x1, file_data)\n y0 = self.nm2pnt(y0, file_data, axis='y')\n y1 = self.nm2pnt(y1, file_data, axis='y')\n\n self.topo_info = file_data[scan_dir].info\n self.x_res = self.topo_info['xres']\n self.y_res = self.topo_info['yres']\n\n self.x_range = np.arange(0, self.x_res, 1)\n self.y_range = np.arange(0, self.y_res, 1)\n\n self.topo_data = file_data[scan_dir].data\n\n self.param_init = [1, 1, 1]\n\n self.topo_plane_lsq = leastsq(self.topo_plane_residuals, self.param_init,\n args=(self.topo_data, x0, x1, y0, y1))[0]\n self.topo_plane_fit = self.topo_plane_paramEval(self.topo_plane_lsq)\n self.topo_data_flattened = self.topo_data - self.topo_plane_fit\n self.topo_data_flattened = self.topo_data_flattened - np.amin(self.topo_data_flattened)\n\n self.get_data()","def get_pipeline_topology(account_name: Optional[str] = None,\n pipeline_topology_name: Optional[str] = None,\n resource_group_name: Optional[str] = None,\n opts: Optional[pulumi.InvokeOptions] = None) -> AwaitableGetPipelineTopologyResult:\n __args__ = dict()\n __args__['accountName'] = account_name\n __args__['pipelineTopologyName'] = pipeline_topology_name\n __args__['resourceGroupName'] = resource_group_name\n opts = pulumi.InvokeOptions.merge(_utilities.get_invoke_opts_defaults(), opts)\n __ret__ = pulumi.runtime.invoke('azure-native:videoanalyzer/v20211101preview:getPipelineTopology', __args__, opts=opts, typ=GetPipelineTopologyResult).value\n\n return AwaitableGetPipelineTopologyResult(\n description=pulumi.get(__ret__, 'description'),\n id=pulumi.get(__ret__, 'id'),\n kind=pulumi.get(__ret__, 'kind'),\n name=pulumi.get(__ret__, 'name'),\n parameters=pulumi.get(__ret__, 'parameters'),\n processors=pulumi.get(__ret__, 'processors'),\n sinks=pulumi.get(__ret__, 'sinks'),\n sku=pulumi.get(__ret__, 'sku'),\n sources=pulumi.get(__ret__, 'sources'),\n system_data=pulumi.get(__ret__, 'system_data'),\n type=pulumi.get(__ret__, 'type'))","def polyPlanarProjection(*args, projectionHorizontalSweep: Union[float, bool]=0.0, seamCorrect:\n bool=True, caching: bool=True, constructionHistory: bool=True,\n createNewMap: bool=True, imageCenter: Union[List[float, float],\n bool]=None, imageCenterX: Union[float, bool]=0.0, imageCenterY:\n Union[float, bool]=0.0, imageScale: Union[List[float, float],\n bool]=None, imageScaleU: Union[float, bool]=0.0, imageScaleV:\n Union[float, bool]=0.0, insertBeforeDeformers: bool=True,\n keepImageRatio: bool=True, mapDirection: AnyStr=\"\", name: AnyStr=\"\",\n nodeState: Union[int, bool]=0, perInstance: bool=True,\n projectionCenter: Union[List[float, float, float], bool]=None,\n projectionCenterX: Union[float, bool]=0.0, projectionCenterY:\n Union[float, bool]=0.0, projectionCenterZ: Union[float, bool]=0.0,\n projectionHeight: Union[float, bool]=0.0, projectionScale:\n Union[List[float, float], bool]=None, rotate: Union[List[float, float,\n float], bool]=None, rotateX: Union[float, bool]=0.0, rotateY:\n Union[float, bool]=0.0, rotateZ: Union[float, bool]=0.0,\n rotationAngle: Union[float, bool]=0.0, smartFit: bool=True,\n worldSpace: bool=True, q=True, query=True, e=True, edit=True,\n **kwargs)->Union[AnyStr, Any]:\n pass","def xyplane(draw, r, x, shift = np.array([1000, 1000, 0, 0]), scale = 300):\n extent = 2.8\n pln = np.array(\n [\n [x,-extent,0],\n [x,extent,0],\n [x,extent,extent*2],\n [x,-extent,extent*2]\n ]\n )\n pln = np.dot(pln,np.transpose(r))\n pln = pln * scale + shift[:3]\n draw.polygon([(pln[0][0],pln[0][1]),(pln[1][0],pln[1][1]),(pln[2][0],pln[2][1]),(pln[3][0],pln[3][1])], (0,102,255,70))","def plot_phase_plane(self , x_axis = 0 , y_axis = 1 ):\n\n pp = phaseanalysis.PhasePlot( self , x_axis , y_axis )\n \n pp.plot()"],"string":"[\n \"def WritePlane(self):\\n if not self.__train:\\n print('ERROR: Must use Train before WritePlane')\\n sys.exit(-1)\\n if not self.__openPlaneO:\\n print('ERROR: Must use OpenPlaneO before WritePlane')\\n sys.exit(-1)\\n\\n # Defines angular dimensions\\n self.__nc_RSoft_O.createDimension('type', self.__n_type)\\n\\n # Defines variables\\n if self.__containsRadial:\\n rad_plane_id = self.__nc_RSoft_O.createVariable(\\\\\\n 'radial_plane', 'f4', \\\\\\n ('type','radial_structure_functions'))\\n rad_plane_id[:] = self.radial_plane\\n if self.__containsAngular:\\n ang_plane_id = self.__nc_RSoft_O.createVariable(\\\\\\n 'angular_plane', 'f4', \\\\\\n ('type','angular_structure_functions'))\\n ang_plane_id[:] = self.angular_plane\\n intercept_id_O = self.__nc_RSoft_O.createVariable(\\\\\\n 'intercept', 'f4', ('type'))\\n intercept_id_O[:] = self.intercept\",\n \"def polyPlane(*args, axis: Union[List[float, float, float], bool]=None, createUVs: Union[int,\\n bool]=1, height: Union[float, bool]=1.0, subdivisionsHeight: Union[int, bool]=0,\\n subdivisionsWidth: Union[int, bool]=10, subdivisionsX: Union[int, bool]=5,\\n subdivisionsY: Union[int, bool]=5, texture: Union[int, bool]=1, width:\\n Union[float, bool]=1.0, caching: bool=True, constructionHistory: bool=True, name:\\n AnyStr=\\\"\\\", nodeState: Union[int, bool]=0, object: bool=True, q=True, query=True,\\n e=True, edit=True, **kwargs)->Union[List[AnyStr], Any]:\\n pass\",\n \"def _prepare_plane(self):\\n verticies = [\\n # main plane - note that the mainplane is scaled so the mat_plane\\n # matrix will it transform to the correct coordinates\\n -self.i_border[0]/self._scaling[0], self.i_border[1]/self._scaling[1],\\n -self.i_border[0]/self._scaling[0], -(self.o_wh[1]-self.i_border[1])/self._scaling[1],\\n (self.o_wh[0]-self.i_border[0])/self._scaling[0], -(self.o_wh[1]-self.i_border[1])/self._scaling[1],\\n (self.o_wh[0]-self.i_border[0])/self._scaling[0], -(self.o_wh[1]-self.i_border[1])/self._scaling[1],\\n (self.o_wh[0]-self.i_border[0])/self._scaling[0], self.i_border[1]/self._scaling[1],\\n -self.i_border[0]/self._scaling[0], self.i_border[1]/self._scaling[1],\\n\\n # coord plane\\n 0, 0,\\n 0, -self.o_wh[1],\\n self.o_wh[0], -self.o_wh[1],\\n self.o_wh[0], -self.o_wh[1],\\n self.o_wh[0], 0,\\n 0, 0,\\n\\n # axes\\n 0, -self.o_wh[1], self.o_wh[0], -self.o_wh[1], #x\\n 0, 0, 0, -self.o_wh[1], #y\\n ]\\n\\n colors = [\\n 1.0, 1.0, 1.0, 1.0, # outer box XXX Remove outer box...\\n 1.0, 1.0, 1.0, 1.0,\\n 1.0, 1.0, 1.0, 1.0,\\n 1.0, 1.0, 1.0, 1.0,\\n 1.0, 1.0, 1.0, 1.0,\\n 1.0, 1.0, 1.0, 1.0,\\n .9, .9, .9, 9.0, # plot box\\n .9, .9, .9, 9.0,\\n .9, .9, .9, 9.0,\\n .9, .9, .9, 9.0,\\n .9, .9, .9, 9.0,\\n .9, .9, .9, 9.0,\\n 0.0, 0.0, 0.0, 1.0, #lines\\n 0.0, 0.0, 0.0, 1.0,\\n 0.0, 0.0, 0.0, 1.0,\\n 0.0, 0.0, 0.0, 1.0,\\n ]\\n\\n self._fonts = []\\n for u in range(1, self._unit_count[0]+1):\\n verticies.append(self._unit_w[0]*u)\\n verticies.append(-self.o_wh[1]+0.02)\\n verticies.append(self._unit_w[0]*u)\\n verticies.append(-self.o_wh[1]-0.02)\\n colors += [0.0, 0.0, 0.0, 1.0]\\n colors += [0.0, 0.0, 0.0, 1.0]\\n self._fonts.append([\\n '{:.2f}'.format(u*(self.i_axis[0]/self._unit_count[0])-self.i_origin[0]),\\n (self._unit_w[0]*u+self.i_border[0]-0.05)*self._scaling[0],\\n (-self.o_wh[1]+(self.i_border[3])*0.5)\\n ])\\n for u in range(0, self._unit_count[1]):\\n verticies.append(0.02)\\n verticies.append(-self._unit_w[1]*u)\\n verticies.append(-0.02)\\n verticies.append(-self._unit_w[1]*u)\\n colors += [0.0, 0.0, 0.0, 1.0]\\n colors += [0.0, 0.0, 0.0, 1.0]\\n self._fonts.append([\\n '{:.2f}'.format(self.i_axis[1]-u*self.i_axis[1]/self._unit_count[1]-self.i_origin[1]),\\n (0.025)*self._scaling[0],\\n (-(self._unit_w[1])*u-self.i_border[1]+0.01)*self._scaling[1]\\n ])\\n\\n self._draw_plane_indicies = (0, 12)\\n self._draw_line_indicies = (12, 4+self._unit_count[0]*2+self._unit_count[1]*2)\\n\\n # convert data into valid data format\\n verticies = numpy.array(verticies, dtype=numpy.float32)\\n colors = numpy.array(colors, dtype=numpy.float32)\\n\\n self._plane_vao = util.VAO()\\n self._plane_vbo = util.VBO(2)\\n\\n with self._plane_vao:\\n # plane verticies\\n with self._plane_vbo.get(0):\\n glBufferData(GL_ARRAY_BUFFER, ArrayDatatype.arrayByteCount(verticies), verticies, GL_STATIC_DRAW)\\n glVertexAttribPointer(self.plane_shader.attributeLocation('vertex_position'), 2, GL_FLOAT, GL_FALSE, 0, None)\\n glEnableVertexAttribArray(0)\\n\\n # place vertex colors\\n with self._plane_vbo.get(1):\\n glBufferData(GL_ARRAY_BUFFER, ArrayDatatype.arrayByteCount(colors), colors, GL_STATIC_DRAW)\\n glVertexAttribPointer(self.plane_shader.attributeLocation('vertex_color'), 4, GL_FLOAT, GL_FALSE, 0, None)\\n glEnableVertexAttribArray(1)\",\n \"def vplane(self, fig=None):\\n #TODO more general multi-axis layout...\\n figsize = (9, 6.5) # good for letter paper\\n if fig is None: fig = plt.figure(figsize=figsize)\\n else: fig.set_size_inches(*figsize)\\n axkw = dict(frameon = True)\\n left, width = 0.075, 0.6\\n bh = 0.11\\n pad = 0.04\\n depth_ax = fig.add_axes((left, 6*pad+4.5*bh, width, bh*2), **axkw)\\n axkw.update(dict(sharex = depth_ax))\\n pitch_ax = fig.add_axes((left, 5*pad+3.5*bh, width, bh), **axkw)\\n buoyancy_ax = fig.add_axes((left, 4*pad+2.5*bh, width, bh), **axkw)\\n mass_ax = fig.add_axes((left, 3*pad + 1.5*bh, width, bh), **axkw)\\n control_surface_ax = fig.add_axes((left, 2*pad + bh/2, width, bh), **axkw)\\n control_mode_ax = fig.add_axes((left, pad, width, bh/2), **axkw)\\n # TODO adjust scale and coverage for each axes\\n # TODO do this again now that middle labels are removed\\n\\n self.plot_timeseries('depth', '-', axes=depth_ax)\\n self.plot_timeseries('platform_pitch_angle', axes=pitch_ax)\\n self.plot_timeseries('platform_mass_position', axes=mass_ax)\\n self.plot_timeseries('platform_buoyancy_position', axes=buoyancy_ax)\\n self.plot_timeseries('platform_elevator_angle', axes=control_surface_ax)\\n # TODO Include another panel with VerticalControl mode (iff present)\\n\\n # TODO only if engineering data is requested...\\n ### add to depth axes ###\\n depth_science = {\\n 'Depth_Keller/depth': 'c-',\\n 'CTD_NeilBrown/depth': 'k-',\\n 'Depth_MSI_US300/depth': 'm-'}\\n for k, v in depth_science.items():\\n try: self.plot_timeseries(k, v, axes=depth_ax)\\n except: print('no {0}'.format(k))\\n\\n depth_engineering = {\\n 'VerticalControl/smoothDepthInternal': 'r-',\\n 'VerticalControl/depthCmd': 'g-',\\n 'VerticalControl/depthErrorInternal': 'g:'}\\n for k, v in depth_engineering.items():\\n try: self.plot_timeseries(k, v, axes=depth_ax)\\n except: print('no {0}'.format(k))\\n # TODO only if sw debug flag is set \\n depth_rate_engineering = {\\n 'VerticalControl/depthRateCmd': 'gray',\\n 'VerticalControl/depth_rate': 'gray', # XXX why same color?\\n }\\n for k, v in depth_rate_engineering.items():\\n try: \\n self.plot_timeseries(k, vi, axes=depth_ax, \\n convert=oalib.make_multiplier(100))\\n except: print('no {0}'.format(k))\\n ### add to pitch axes ###\\n pitch_engineering = {\\n 'AHRS_sp3003D/platform_pitch_angle': 'k-', \\n 'DVL_micro/platform_pitch_angle': 'm-',\\n 'AHRS_3DMGX3/platform_pitch_angle': 'c-',\\n 'InternalSim/platform_pitch_angle': ':r',\\n }\\n for k, v in pitch_engineering.items():\\n try: self.plot_timeseries(k, v, axes=pitch_ax)\\n except: print('no {0}'.format(k))\\n ### add to mass axes ###\\n mass_engineering = {\\n 'VerticalControl/massPositionAction': 'g-', \\n 'VerticalControl/massIntegralInternal': 'c-',\\n 'MassServo/platform_mass_position': 'r-',\\n #'VerticalControl/massPitchErrorInternal': ':r',\\n }\\n for k, v in mass_engineering.items():\\n try: self.plot_timeseries(k, v, axes=mass_ax)\\n except: print('no {0}'.format(k))\\n ### add to buoyancy axes ###\\n buoyancy_engineering = {\\n 'VerticalControl/buoyancyAction': 'm-',\\n 'BuoyancyServo/platform_buoyancy_position': 'b-',\\n }\\n for k, v in buoyancy_engineering.items():\\n try: \\n self.plot_timeseries(k, v,\\n# convert=oalib.make_multiplier(-10), \\n axes=buoyancy_ax)\\n except: print('no {0}'.format(k))\\n ### add to control surface axes ###\\n control_surface_engineering = {\\n 'VerticalControl/elevatorAngleAction': 'm-', \\n 'VerticalControl/elevatorIntegralInternal': 'm:',\\n 'ElevatorServo/platform_elevator_angle': 'c-',\\n }\\n for k, v in control_surface_engineering.items():\\n try: \\n self.plot_timeseries(k, v, convert = np.rad2deg, \\n axes=control_surface_ax)\\n except: print('no {0}'.format(k))\\n \\n\\n # TODO only if supporting data is requested\\n ### add other supporting data ###\\n try: self.plot_timeseries('CTD_NeilBrown/depth', 'k-', axes=depth_ax)\\n except: print('no CTD_NeilBrown/depth')\\n try: self.plot_timeseries('Depth_MSI_US300', 'm-', axes=depth_ax)\\n except: print('no Depth_MSI_US300')\\n\\n\\n ### print additional information ###\\n buoyancyNeutral = ('Config/Control/buoyancyNeutral',\\n 'Config/Servo/buoyancyNeutral')\\n for s in buoyancyNeutral:\\n try:\\n print('{0} = {1} {2}'.format(s, self[s+'/value'], self[s+'/units']))\\n except:\\n print('{0} not found'.format(s))\\n \\n# VertMd(0=N/A,1=Surf,2=Dep,3=DepRt,4=Pit0,5=Pit,6=PitRt,7=M&E,8=Flt),\\n# VertHoldMd(0=N/A,1=Ms,2=El,3=Both)\\n try:\\n v, t = self.timeseries('VerticalControl/verticalMode')\\n oalib.plot_date_blocks(t, v, axes=control_mode_ax, colormap=mpl.cm.jet)\\n except: print('VerticalControl/verticalMode not found')\\n\\n depth_ax.invert_yaxis()\\n for ax in fig.get_axes():\\n ax.grid(True)\\n try:\\n ax.legend(loc='center left', bbox_to_anchor=(1, 0.5),\\n fontsize='small')\\n except:\\n print('uncaught exception for legend...')\\n for ax in fig.get_axes()[:-1]:\\n plt.setp(ax.get_xticklabels(), visible=False)\\n\\n depth_ax.set_title(os.path.basename(self.filename))\\n control_mode_ax.xaxis.set_major_formatter(mpl.dates.DateFormatter('%H:%M'))\\n plt.setp(control_mode_ax.get_xticklabels(), rotation=30,\\n fontsize='small')\",\n \"def create_surface_plane(align_to = None, axis = 'x', width = 0.5, freeze_tm = True):\\n axis_dict = {'x': (1, 0, 0), 'y': (0, 1, 0), 'z': (0, 0, 1)}\\n res = pm.nurbsPlane(\\n axis = axis_dict[axis],\\n width = width,\\n degree = 1,\\n constructionHistory = False\\n )[0]\\n if align_to is not None:\\n transformation.align(res, align_to)\\n if freeze_tm:\\n transformation.freeze_transform(res)\\n return res\",\n \"def test_create(self):\\n f = azplugins.restrain.plane(group=hoomd.group.all(), point=(0,0,0), normal=(1,0,0), k=2.0)\\n\\n f.set_params(k=5.0)\\n f.set_params(k=8)\\n\\n f.set_params(point=(0,0,1))\\n f.set_params(point=[0,0,1])\\n f.set_params(point=np.array([0,0,1]))\\n\\n f.set_params(normal=(0,0,1))\\n f.set_params(normal=[0,0,1])\\n f.set_params(normal=np.array([0,0,1]))\\n\\n f.set_params(point=(0,0,0), normal=(1,0,0), k=10.0)\",\n \"def build_topology(self):\\n# errstr = \\\"build_topology() is not implemented.\\\\n\\\"\\n# errstr += textwrap.dedent(self.build_topology.__doc__)\\n# raise NotImplementedError(errstr)\\n pass # May be a 1-compartment neuron. No need to abstract. \",\n \"def create_plane(self):\\n\\n # First we calculate our point increment for both the x and y values\\n inc_x = (self.xmax - self.xmin)/(self.xlen - 1)\\n inc_y = (self.ymax - self.ymin)/(self.ylen - 1)\\n\\n # This for-loop will add every x-value with every y-value, saving the values column wise\\n # i.e. (-10,-10), (-10,-9), (-10.-8),...,(-10,n) for n = our y-values.\\n # store these combinations into a list, and add that to our plane. \\n # The nested loop will then traverse again and will get the combinations for the next x-value.\\n # The loop will continue until all x-values and y-value combinations are added to our plane.\\n for y in range(0, self.ylen + 1):\\n temp_list = []\\n for x in range(0, self.xlen + 1):\\n temp_list.append(self.f((self.xmin + x*inc_x) + (self.ymin + y*inc_y)*1j))\\n self.plane.append(temp_list)\",\n \"def plane(self):\\n return plane(self.N, self.o)\",\n \"def GetPlane(plane):\\r\\n pass\",\n \"def plane(*args, length: float=0.0, name: AnyStr=\\\"\\\", position: List[float, float, float]=None,\\n rotation: List[float, float, float]=None, size: float=0.0, width: float=0.0,\\n **kwargs)->AnyStr:\\n pass\",\n \"def plane(self):\\r\\n from lsst.analysis import utils\\r\\n return utils.fitplane(self.points, self.z)\",\n \"def SetPlaneMode(self, *args):\\n return _ShapeUpgrade.ShapeUpgrade_ShapeConvertToBezier_SetPlaneMode(self, *args)\",\n \"def build_topology(config):\\n top_type = config['Metapopulation']['topology']\\n assert top_type.lower() in ['moore', 'vonneumann', 'smallworld',\\n 'complete', 'regular']\\n\\n if top_type.lower() == 'moore':\\n return build_topology_moore(config)\\n elif top_type.lower() == 'vonneumann':\\n return build_topology_vonneumann(config)\\n elif top_type.lower() == 'smallworld':\\n return build_topology_smallworld(config)\\n elif top_type.lower() == 'complete':\\n return build_topology_complete(config)\\n elif top_type.lower() == 'regular':\\n return build_topology_regular(config)\",\n \"def create_plot_plane_2d(axis=(1.0, 1.0), origin=(0.0,0.0), size=(2.0,2.0)):\\n ft = ImageFont.truetype (FONT_RESOURCES_DIR+\\\"/courier.ttf\\\", 12)\\n gl_font = GlFont('', ft)\\n gl_font.color = [0.0, 0, 0, 1.0]\\n gl_plot = PlotPlane2d(gl_font)\\n gl_plot.i_axis = axis\\n gl_plot.i_origin = origin\\n gl_plot.o_wh = size\\n gl_plot.i_axis_units = (axis[0]/10, axis[1]/10)\\n\\n gl_plot.prepare()\\n return gl_plot\",\n \"def nurbsPlane(*args, axis: Union[List[float, float, float], bool]=None, caching: bool=True,\\n degree: Union[int, bool]=3, lengthRatio: Union[float, bool]=1.0, nodeState:\\n Union[int, bool]=0, patchesU: Union[int, bool]=1, patchesV: Union[int, bool]=1,\\n pivot: Union[List[float, float, float], bool]=None, width: Union[float,\\n bool]=1.0, constructionHistory: bool=True, name: AnyStr=\\\"\\\", object: bool=True,\\n polygon: int=0, q=True, query=True, e=True, edit=True,\\n **kwargs)->Union[List[AnyStr], Any]:\\n pass\",\n \"def image_plane_mesh_grid_from(\\r\\n self,\\r\\n image_plane_data_grid: Grid2D,\\r\\n adapt_data: np.ndarray = None,\\r\\n settings=SettingsPixelization(),\\r\\n ):\\r\\n return None\",\n \"def SetPlaneMode(self, *args):\\n return _ShapeUpgrade.ShapeUpgrade_ConvertSurfaceToBezierBasis_SetPlaneMode(self, *args)\",\n \"def p(self):\\n return 'Plane'\",\n \"def GetPlaneMode(self, *args):\\n return _ShapeUpgrade.ShapeUpgrade_ShapeConvertToBezier_GetPlaneMode(self, *args)\",\n \"def create_fixed_distance_to_plane_constraint():\\n return FixedDistanceToPlaneConstraint()\",\n \"def __init__(self):\\n Page.__init__(self, u\\\"Paraboloide Elíptico<br><br>F(x,y)=(x, y, x<sup>2</sup>/a<sup>2</sup> + y<sup>2</sup>/b<sup>2</sup>)\\\")\\n\\n z = 0.5\\n par = RevolutionPlot3D(lambda r, t: r ** 2 + z, (0, 1), (0, 2 * pi))\\n\\n x, y, z2, u, v, cose, sen, t = createVars(['x', 'y', 'z', 'u', 'v', 'cos', 'sen', 't'])\\n\\n mesh1 = Plot3D(lambda x, y, h: h * (x ** 2 + y ** 2 + z - .01), (-1, 1), (-1, 1))\\n mesh1.addEqn(x**2+y**2 - z2**2 == 1)\\n mesh1.addFunction(lambda x, y, h: h * (x ** 2 + y ** 2 + z + .01))\\n mesh1.setLinesVisible(True)\\n mesh1.setMeshVisible(False)\\n mesh1.setBoundingBox(zrange=(-1, 1.5))\\n par.setAmbientColor(_1(145, 61, 74))\\n par.setDiffuseColor(_1(145, 61, 74))\\n par.setSpecularColor(_1(145, 61, 74))\\n baseplane = BasePlane()\\n baseplane.setHeight(0)\\n baseplane.setRange((-2, 2, 7))\\n\\n self.addChild(par)\\n self.addChild(mesh1)\\n self.addChild(baseplane)\",\n \"def plane(self):\\n return Plane(Point(0, self.evaluations.exposedWing.edges[2].point1.y, 0), Vector(0, 1, 0),\\n hidden=True)\",\n \"def network_topology(voxels, clusters, primaries, edges, mode='sphere'):\\n # Define the arrays of node positions (barycenter of voxels in the cluster)\\n pos = np.array([voxels[c].cpu().numpy().mean(0) for c in clusters])\\n\\n # Define the node features (label, color)\\n n = len(clusters)\\n node_labels = ['%d (%0.1f, %0.1f, %0.1f)' % (i, pos[i,0], pos[i,1], pos[i,2]) for i in range(n)]\\n \\n node_colors = ['#ff7f0e' if i in primaries else '#1f77b4' for i in range(n)]\\n\\n # Define the nodes and their connections\\n graph_data = []\\n edge_vertices = []\\n if mode == 'sphere':\\n # Define the node size\\n logn = np.array([np.log(len(c)) for c in clusters])\\n node_sizes = np.interp(logn, (logn.min(), logn.max()), (5, 50))\\n \\n # Define the nodes as sphere of radius proportional to the log of the cluster voxel content\\n graph_data.append(go.Scatter3d(x = pos[:,0], y = pos[:,1], z = pos[:,2],\\n name = 'clusters',\\n mode = 'markers',\\n marker = dict(\\n symbol = 'circle',\\n size = node_sizes,\\n color = node_colors,\\n colorscale = 'Viridis',\\n line = dict(color='rgb(50,50,50)', width=0.5)\\n ),\\n text = node_labels,\\n hoverinfo = 'text'\\n ))\\n\\n # Define the edges center to center\\n edge_vertices = np.concatenate([[pos[i], pos[j], [None, None, None]] for i, j in zip(edges[0], edges[1])])\\n\\n elif mode == 'hull':\\n # For each cluster, add the convex hull of all its voxels\\n graph_data += [go.Mesh3d(alphahull =10.0,\\n name = '',\\n x = voxels[c][:,0],\\n y = voxels[c][:,1],\\n z = voxels[c][:,2],\\n color = node_colors[i],\\n opacity = 0.3,\\n text = node_labels[i],\\n hoverinfo = 'text'\\n ) for i, c in enumerate(clusters)]\\n\\n # Define the edges closest pixel to closest pixel\\n import scipy as sp\\n edge_vertices = []\\n for i, j in zip(edges[0], edges[1]):\\n vi, vj = voxels[clusters[i]], voxels[clusters[j]]\\n d12 = sp.spatial.distance.cdist(vi, vj, 'euclidean')\\n i1, i2 = np.unravel_index(np.argmin(d12), d12.shape)\\n edge_vertices.append([vi[i1].cpu().numpy(), vj[i2].cpu().numpy(), [None, None, None]])\\n \\n edge_vertices = np.concatenate(edge_vertices)\\n \\n else:\\n raise ValueError\\n \\n # Initialize a graph that contains the edges\\n graph_data.append(go.Scatter3d(x = edge_vertices[:,0], y = edge_vertices[:,1], z = edge_vertices[:,2],\\n mode = 'lines',\\n name = 'edges',\\n line = dict(\\n color = 'rgba(50, 50, 50, 0.5)',\\n width = 1\\n ),\\n hoverinfo = 'none'\\n ))\\n\\n # Return\\n return graph_data\",\n \"def set_topology(self, mapsize = None, mapshape = 'planar', lattice = 'rect', mask = None, compname = None):\\n self.mapshape = mapshape\\n self.lattice = lattice\\n \\n #to set mask\\n if mask == None: \\n self.mask = np.ones([1,self.dim])\\n else:\\n self.mask = mask\\n \\n \\n #to set map size\\n if mapsize == None: \\n tmp = int(round(np.sqrt(self.dlen)))\\n self.nnodes = tmp\\n self.mapsize = [int(3./5*self.nnodes), int(2./5*self.nnodes)]\\n else:\\n if len(mapsize)==2:\\n if np.min(mapsize) == 1:\\n self.mapsize = [1, np.max(mapsize)]\\n else: \\n self.mapsize = mapsize\\n elif len(mapsize) == 1:\\n #s = int (mapsize[0]/2)\\n self.mapsize = [1 ,mapsize[0]]\\n print 'input was considered as node numbers'\\n print 'map size is [{0},{1}]'.format(s,s) \\n self.nnodes = self.mapsize[0]*self.mapsize[1]\\n \\n # to set component names\\n if compname == None: \\n try:\\n cc = list()\\n for i in range(0,self.dim):\\n cc.append ('Variable-'+ str(i+1))\\n self.compname = np.asarray(cc)[np.newaxis,:]\\n except:\\n pass\\n print 'no data yet: plesae first set trainign data to the SOM'\\n else:\\n try:\\n dim = getattr(self,'dim')\\n if len(compname) == dim:\\n self.compname = np.asarray(compname)[np.newaxis,:]\\n else:\\n print 'compname should have the same size'\\n except:\\n pass\\n print 'no data yet: plesae first set trainign data to the SOM'\",\n \"def get_plane(dset, xaxis, yaxis, slices, **kw):\\n\\n # Build quad meshes from sorted grids\\n xgrid = dset.dims[xaxis][0][indices[xaxis]]\\n ygrid = dset.dims[yaxis][0][indices[yaxis]]\\n xorder = np.argsort(xgrid)\\n yorder = np.argsort(ygrid)\\n xmesh, ymesh = quad_mesh(xgrid[xorder], ygrid[yorder], **kw)\\n\\n # Select and arrange data\\n data = dset[slices]\\n if xi < yi:\\n data = data.T\\n data = data[yorder]\\n data = data[:, xorder]\\n\\n return xmesh, ymesh, data\",\n \"def plot_mpr_topology(options, tags=None, cursor=None):\\n options['cur_src'] = 'topo'\\n options['prefix'] = \\\"mpr\\\"\\n ################################################################################\\n locs = options['locs']\\n colors = options['color2'](pylab.linspace(0, 1, 101))\\n ################################################################################\\n circ_max = 5\\n line_max = 10\\n floor_factor = 2\\n floor_skew = -0.25\\n line_min = 1\\n\\n hosts = get_hosts(options)\\n mprs = cursor.execute('''\\n SELECT DISTINCT(host)\\n FROM nhdp_mpr_selectors\\n ''').fetchall()\\n\\n for q, (tag_key, tag_id, nhdp_hi, nhdp_ht, mpr_minpdr) in enumerate(tags):\\n logging.info('tag_id=\\\\\\\"%s\\\\\\\" (%d/%d)', tag_id, q+1, len(tags))\\n min_max_time = cursor.execute('''\\n SELECT min(time), max(time)\\n FROM nhdp_he\\n WHERE tag=?\\n ''',(tag_key,)).fetchone()\\n fig2d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate')\\n fig3d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate', ThreeD=True)\\n if not q:\\n fig3d_onlynodes = MyFig(options, xlabel='x Coordinate [m]', ylabel='y Coordinate [$m$]', ThreeD=True)\\n\\n min_x = min_y = min_z = numpy.infty\\n max_x = max_y = max_z = 0\\n\\n # first draw the edges...\\n for nr, (host) in enumerate(hosts):\\n logging.info(' [%d/%d] drawing edges for host=%s', nr+1, len(hosts), host)\\n try:\\n host_xpos, host_ypos, host_zpos = locs[host]\\n except KeyError:\\n logging.warning('no position found for node %s', host)\\n continue\\n ################################################################################\\n # host is the receiving router, i.e. in our case the MPR\\n # src is the sending router, i.e. the MPR selector\\n # We only want to draw an edge if it connects an MPR with its SELECTOR.\\n #\\n ################################################################################\\n cursor.execute('''\\n SELECT DISTINCT(src), pdr\\n FROM eval_helloPDR AS pdr JOIN nhdp_mpr_selectors AS mpr\\n ON pdr.host = mpr.host AND pdr.tx_if = mpr.mprselector\\n WHERE pdr.tag_key=? AND pdr.host=? AND mpr.time BETWEEN ? AND ?\\n ''', (tag_key, host, min_max_time[0], min_max_time[1]))\\n for src, pdr in cursor.fetchall():\\n try:\\n src_xpos, src_ypos, src_zpos = locs[src]\\n except KeyError:\\n logging.warning('no position found for node %s', src)\\n continue\\n\\n fig2d.ax.plot(\\n [host_xpos+host_zpos*floor_skew*floor_factor, src_xpos+src_zpos*floor_skew*floor_factor],\\n [host_ypos+host_zpos*floor_factor, src_ypos+src_zpos*floor_factor],\\n linestyle='-', color=colors[pdr*100], linewidth=max(line_max*pdr, line_min), alpha=0.3)\\n\\n fig3d.ax.plot(\\n [host_xpos, src_xpos],\\n [host_ypos, src_ypos],\\n [host_zpos, src_zpos],\\n linestyle='-', color=colors[pdr*100], linewidth=max(line_max*pdr, line_min), alpha=0.3)\\n\\n # draw the nodes\\n for host in hosts:\\n logging.info(' [%d/%d] drawing node %s', nr+1, len(hosts), host)\\n try:\\n xpos, ypos, zpos = locs[host]\\n except KeyError:\\n logging.warning('no position found for node %s', host)\\n continue\\n\\n max_x = max(xpos, max_x)\\n max_y = max(ypos, max_y)\\n min_x = min(xpos, min_x)\\n min_y = min(ypos, min_y)\\n max_z = max(zpos, max_z)\\n min_z = max(zpos, min_z)\\n if (host,) in mprs:\\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='blue', ms=circ_max)\\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color='blue', ms=circ_max)\\n else:\\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='black', ms=circ_max)\\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color='black', ms=circ_max)\\n if not q:\\n color = 'black'\\n if host.startswith('a6'):\\n color = 'red'\\n elif host.startswith('a3'):\\n color = 'blue'\\n elif host.startswith('a7'):\\n color = 'orange'\\n fig3d_onlynodes.ax.plot([xpos], [ypos], [zpos], 'o', color=color, ms=circ_max)\\n fig2d.colorbar = fig2d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\\n fig3d.colorbar = fig3d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\\n drawBuildingContours(fig3d.ax, options)\\n drawBuildingContours(fig3d_onlynodes.ax, options)\\n\\n alinspace = numpy.linspace(0, 1, 100)\\n alinspace = numpy.vstack((alinspace, alinspace))\\n for tax in [fig2d.colorbar, fig3d.colorbar]:\\n tax.imshow(alinspace, aspect='auto', cmap=options['color2'])\\n tax.set_xticks(pylab.linspace(0, 100, 5))\\n tax.set_xticklabels(['$%.2f$' % l for l in pylab.linspace(0, 1, 5)], fontsize=0.8*options['fontsize'])\\n tax.set_yticks([])\\n tax.set_title('$PDR$', size=options['fontsize'])\\n fig2d.ax.axis((min_x-10, max_x+10, min_y-10, max_y+10+max_z*floor_factor+10))\\n fig2d.save('2d_topology_hi_%d_ht_%d_minpdr_%.2f' % (nhdp_hi, nhdp_ht, mpr_minpdr))\\n fig3d.save('3d_topology_hi_%d_ht_%d_minpdr_%.2f' % (nhdp_hi, nhdp_ht, mpr_minpdr))\\n if not q:\\n fig3d_onlynodes.save('3d_topology_only_nodes_hi_%d_ht_%d_minpdr_%.2f' % (nhdp_hi, nhdp_ht, mpr_minpdr))\",\n \"def cal_topology_feature(self):\\n self.NPL()\\n self.topo_efficiency_cal()\\n self.efficiency_cal()\\n self.cluster_cal()\\n self.topo_diameter()\\n self.spatial_diameter()\",\n \"def ggpl_bone_structure(file_name):\\n def planeStructure(beamSection, pillarSection, distancePillars, intersectHeights):\\n fStructs = []\\n \\n \\\"\\\"\\\" createFinalStruct\\n \\n Questo metodo crea una pilastro senza travi\\n \\n @param startPoint: Il punto di intersezione del pilastro con la base del piano di lavoro\\n @param height: L'altezza del pilastro\\n @returns: Il pilastro\\n \\\"\\\"\\\"\\n def createFinalStruct(startPoint, height):\\n pillar = CUBOID([pillarSection[0], pillarSection[1], height])\\n return STRUCT([T(2)(startPoint), pillar])\\n\\n \\\"\\\"\\\" createFStruct\\n \\n Questo metodo crea la struttura portante con il pilastro e le travi di riferimento\\n \\n @param startPoint: Il punto di intersezione del pilastro con la base del piano di lavoro\\n @param height: L'altezza del pilastro\\n @param lengthBeam: La lunghezza delle travi\\n @returns: Il pilastro\\n \\\"\\\"\\\"\\n def createFStruct(startPoint, height, lengthBeam):\\n fStruct = []\\n\\n fStruct.append(createFinalStruct(startPoint, height))\\n hPillar = 0\\n for i in range(len(intersectHeights)):\\n beam = CUBOID([beamSection[1], lengthBeam, beamSection[0]])\\n hPillar += intersectHeights[i]\\n fStruct.append(STRUCT([\\n T(3)(hPillar),\\n T(2)(pillarSection[1] + startPoint),\\n beam\\n ]))\\n return STRUCT(fStruct)\\n\\n height = SUM(intersectHeights) + beamSection[1]\\n\\n startDistance = 0\\n for iterator in range(len(distancePillars)):\\n fStructs.append(createFStruct(startDistance, height, distancePillars[iterator]))\\n\\n startDistance = startDistance + pillarSection[1] + distancePillars[iterator]\\n\\n fStructs.append(createFinalStruct(startDistance, height))\\n\\n return STRUCT(fStructs)\\n \\n \\\"\\\"\\\" createTrasversalBeam\\n \\n Questa funzione crea le travi di collegamento tra una parete e l'altra\\n \\n @param beanSection: una tupla (bx,bz) che contiene la dimensione delle travi\\n @param pillarSection: una tupla (px,py) che contiene la dimensione dei pilastri\\n @param distancePillars: una lista di distanze relative tra un pilastro e l'altro\\n @param intersectHeights: una lista di altezze relative che indicano la distranza tra una trave e l'altra sull'asse x\\n @returns: la struttura base, che corrisponde ad una parete dell'edificio\\n \\\"\\\"\\\"\\n def createTrasversalBeam(distance, beamSection, pillarSection, distancePillars, intersectHeights):\\n y = []\\n for index in range(len(distancePillars)):\\n y.append(pillarSection[1])\\n y.append(- distancePillars[index])\\n y.append(pillarSection[1])\\n\\n x = [\\n - pillarSection[0],\\n distance\\n ]\\n\\n z = []\\n for i in range(len(intersectHeights)):\\n if i == 0:\\n z.append(-intersectHeights[i])\\n else:\\n z.append(-intersectHeights[i] + beamSection[1])\\n z.append(beamSection[1])\\n\\n return PROD([\\n PROD([QUOTE(x), QUOTE(y)]),\\n QUOTE(z)\\n ])\\n \\n \\\"\\\"\\\" parseCSV\\n \\n Questo metodo prende in input un file_name che indica il file csv da parsare per avere le informazioni della struttura\\n \\n Argomenti:\\n file_name (string): il file name del file csv\\n \\n Yields:\\n transaction: il vettore di traslazione tra una parete e l'altra\\n beanSection: una tupla (bx,bz) che contiene la dimensione delle travi\\n pillarSection: una tupla (px,py) che contiene la dimensione dei pilastri\\n distancePillars: una lista di distanze relative tra un pilastro e l'altro\\n intersectHeights: una lista di altezze relative che indicano la distranza tra una trave e l'altra sull'asse x\\n \\\"\\\"\\\"\\n def parseCSV(file_name):\\n odd = True\\n transaction = None\\n with open(file_name, 'rb') as csvfile:\\n builderreader = csv.reader(csvfile)\\n\\n for row in builderreader:\\n if odd:\\n odd = False\\n transaction = [float(row[0]), float(row[1]), float(row[2])]\\n else:\\n odd = True\\n beamSection = [float(row[0]), float(row[1])]\\n pillarSection = [float(row[2]), float(row[3])]\\n\\n distancePillars = []\\n start_point = 5\\n finish_point = int(row[4]) + start_point\\n for index in range(start_point, finish_point):\\n distancePillars.append(int(row[index]))\\n\\n intersectHeights = []\\n start_point = finish_point + 1\\n finish_point = int(row[finish_point]) + start_point\\n for index in range(start_point, finish_point):\\n intersectHeights.append(int(row[index]))\\n\\n yield transaction, beamSection, pillarSection, distancePillars, intersectHeights\\n\\n frames = []\\n for transaction, beamSection, pillarSection, distancePillars, intersectHeights in parseCSV(file_name):\\n frames.append(T(2)(transaction[1]))\\n\\n if transaction[0] != 0:\\n frames.append(\\n createTrasversalBeam(\\n transaction[0], beamSection, pillarSection, distancePillars,intersectHeights\\n )\\n )\\n\\n frames.append(T([1, 3])([transaction[0], transaction[2]]))\\n frames.append(\\n planeStructure(beamSection, pillarSection, distancePillars, intersectHeights)\\n )\\n\\n return STRUCT(frames)\",\n \"def get_plane(\\n self,\\n pos=None,\\n norm=None,\\n plane=None,\\n sx=None,\\n sy=None,\\n color=\\\"lightgray\\\",\\n alpha=0.25,\\n **kwargs,\\n ):\\n axes_pairs = dict(sagittal=(0, 1), horizontal=(2, 0), frontal=(2, 1))\\n\\n if pos is None:\\n pos = self.root._mesh.centerOfMass()\\n\\n try:\\n norm = norm or self.space.plane_normals[plane]\\n except KeyError: # pragma: no cover\\n raise ValueError( # pragma: no cover\\n f\\\"Could not find normals for plane {plane}. Atlas space provides these normals: {self.space.plane_normals}\\\" # pragma: no cover\\n )\\n\\n # Get plane width and height\\n idx_pair = (\\n axes_pairs[plane]\\n if plane is not None\\n else axes_pairs[\\\"horizontal\\\"]\\n )\\n\\n bounds = self.root.bounds()\\n root_bounds = [\\n [bounds[0], bounds[1]],\\n [bounds[2], bounds[3]],\\n [bounds[4], bounds[5]],\\n ]\\n\\n wh = [float(np.diff(root_bounds[i])) for i in idx_pair]\\n if sx is None:\\n sx = wh[0]\\n if sy is None:\\n sy = wh[1]\\n\\n # return plane\\n return Actor(\\n Plane(pos=pos, normal=norm, sx=sx, sy=sy, c=color, alpha=alpha),\\n name=f\\\"Plane at {pos} norm: {norm}\\\",\\n br_class=\\\"plane\\\",\\n )\",\n \"def __init__(self, **params):\\n\\n # Initialize topo\\n Topo.__init__(self, **params)\\n\\n # Host and link configuration\\n hostConfiguration = {'cpu': cpuShare()}\\n linkConfiguration = {'bw': args.bandwidth, 'delay': delay(), 'max_queue_len': args.input_queue_size }\\n \\n # Create the actual topology\\n client = self.add_host( 'client0', **hostConfiguration )\\n \\n switch = self.add_switch('switch0' )\\n \\n self.add_link( switch, client, port1=0, port2=0, **linkConfiguration )\\n \\n for i in range(1,args.servers+1):\\n server = self.add_host( 'server%d' % i, **hostConfiguration )\\n self.add_link( switch, server, port1=i, port2=0, **linkConfiguration )\",\n \"def plane_2d(self, quantity, plane, pval, draw=False, fixed=None):\\n self.log.info('Plotting plane')\\n pval = int(pval)\\n # x = np.arange(0, self.period, self.dx)\\n # y = np.arange(0, self.period, self.dy)\\n # z = np.arange(0, self.height + self.dz, self.dz)\\n x = self.X\\n y = self.Y\\n z = self.Z\\n # Get the scalar values\\n freq = self.conf['Simulation']['params']['frequency']\\n wvlgth = (consts.c / freq) * 1E9\\n title = 'Frequency = {:.4E} Hz, Wavelength = {:.2f} nm'.format(\\n freq, wvlgth)\\n # Get the plane we wish to plot\\n cs = self.get_plane(quantity, plane, pval)\\n self.log.info('DATA SHAPE: %s' % str(cs.shape))\\n show = self.conf['General']['show_plots']\\n p = False\\n sim_dir = os.path.expandvars(self.conf['General']['sim_dir'])\\n if plane == 'yz' or plane == 'zy':\\n labels = ('y [um]', 'z [um]', quantity, title)\\n if self.conf['General']['save_plots']:\\n p = os.path.join(sim_dir,\\n '%s_plane_2d_yz_pval%s.png' % (quantity,\\n str(pval)))\\n self.heatmap2d(y, z, cs, labels, plane, pval,\\n save_path=p, show=show, draw=draw, fixed=fixed)\\n elif plane == 'xz' or plane == 'zx':\\n labels = ('x [um]', 'z [um]', quantity, title)\\n if self.conf['General']['save_plots']:\\n p = os.path.join(sim_dir,\\n '%s_plane_2d_xz_pval%s.png' % (quantity,\\n str(pval)))\\n self.heatmap2d(x, z, cs, labels, plane, pval,\\n save_path=p, show=show, draw=draw, fixed=fixed)\\n elif plane == 'xy' or plane == 'yx':\\n labels = ('y [um]', 'x [um]', quantity, title)\\n if self.conf['General']['save_plots']:\\n p = os.path.join(sim_dir,\\n '%s_plane_2d_xy_pval%s.png' % (quantity,\\n str(pval)))\\n self.heatmap2d(x, y, cs, labels, plane, pval,\\n save_path=p, show=show, draw=draw, fixed=fixed)\",\n \"def polyAutoProjection(*args, layoutMethod: Union[int, bool]=0, pivot: Union[List[float, float,\\n float], bool]=None, pivotX: Union[float, bool]=0.0, pivotY: Union[float,\\n bool]=0.0, pivotZ: Union[float, bool]=0.0, rotate: Union[List[float,\\n float, float], bool]=None, rotateX: Union[float, bool]=0.0, rotateY:\\n Union[float, bool]=0.0, rotateZ: Union[float, bool]=0.0, scale:\\n Union[List[float, float, float], bool]=None, scaleX: Union[float,\\n bool]=1.0, scaleY: Union[float, bool]=1.0, scaleZ: Union[float,\\n bool]=1.0, translate: Union[List[float, float, float], bool]=None,\\n translateX: Union[float, bool]=0.0, translateY: Union[float, bool]=0.0,\\n translateZ: Union[float, bool]=0.0, caching: bool=True,\\n constructionHistory: bool=True, createNewMap: bool=True,\\n insertBeforeDeformers: bool=True, layout: Union[int, bool]=0, name:\\n AnyStr=\\\"\\\", nodeState: Union[int, bool]=0, optimize: Union[int, bool]=0,\\n percentageSpace: Union[float, bool]=0.0, planes: Union[int, bool]=6,\\n projectBothDirections: bool=True, scaleMode: Union[int, bool]=0,\\n skipIntersect: bool=True, uvSetName: AnyStr=\\\"\\\", worldSpace: bool=True,\\n q=True, query=True, e=True, edit=True, **kwargs)->Union[AnyStr, Any]:\\n pass\",\n \"def plot_plane(unit_normal, x_array, y_array, fore):\\n # print'unit normal = ', unit_normal\\n z = (((unit_normal[0] * (fore[0] - x_array)) + (unit_normal[1] * (fore[1] - y_array))) / unit_normal[2]) + fore[2]\\n # print 'plane numbers\\\\n', z\\n return z\",\n \"def _repr_(self):\\n return \\\"Hyperbolic plane\\\"\",\n \"def addPlaneToScene(self, foot, x, y):\\r\\n #research\\r\\n profprint()\\r\\n scene = slicer.mrmlScene\\r\\n # Create model node\\r\\n model = slicer.vtkMRMLModelNode()\\r\\n model.SetScene(scene)\\r\\n model.SetName(scene.GenerateUniqueName(\\\".ObturatorPlane\\\"))\\r\\n\\r\\n planeSource = vtk.vtkPlaneSource()\\r\\n foot-=25*(x+y)\\r\\n #planeSource.SetOrigin(np.array(foot))\\r\\n planeSource.SetOrigin(list(foot))\\r\\n planeSource.SetPoint1(np.array(foot)+50*x)\\r\\n planeSource.SetPoint2(np.array(foot)+50*y)\\r\\n planeSource.Update()\\r\\n model.SetAndObservePolyData(planeSource.GetOutput())\\r\\n\\r\\n # Create display node\\r\\n modelDisplay = slicer.vtkMRMLModelDisplayNode()\\r\\n modelDisplay.SetColor(1,1,0) # yellow\\r\\n modelDisplay.SetBackfaceCulling(0)\\r\\n modelDisplay.SetScene(scene)\\r\\n scene.AddNode(modelDisplay)\\r\\n model.SetAndObserveDisplayNodeID(modelDisplay.GetID())\\r\\n\\r\\n # Add to scene\\r\\n scene.AddNode(model)\\r\\n # transform = slicer.vtkMRMLLinearTransformNode()\\r\\n # scene.AddNode(transform)\\r\\n # model.SetAndObserveTransformNodeID(transform.GetID())\\r\\n #\\r\\n # vTransform = vtk.vtkTransform()\\r\\n # vTransform.Scale(50,50,50)\\r\\n # #vTransform.RotateX(30)\\r\\n # transform.SetAndObserveMatrixTransformToParent(vTransform.GetMatrix())\\r\",\n \"def show_plane(axis, plane, cmap=\\\"gray\\\", title=None):\\n axis.imshow(plane, cmap=cmap)\\n axis.set_xticks([])\\n axis.set_yticks([])\\n\\n if title:\\n axis.set_title(title)\\n\\n return None\",\n \"def _make_exclusion_plane(args):\\n cls_dict = _load_subset(args.cls_file, args.regions)\\n\\n ex_plane = planeplt.CLsExclusionPlane(interpolation=args.interpolation)\\n cls_list = []\\n if args.band_region:\\n for sp in cls_dict[args.band_region]:\\n sch, lsp = sp['scharm_mass'], sp['lsp_mass']\\n low, high = sp['exp_d1s'], sp['exp_u1s']\\n cls_list.append( (sch, lsp, low, high))\\n ex_plane.add_band(cls_list)\\n\\n # add middle band\\n def get_tup(x):\\n return (x['scharm_mass'], x['lsp_mass'], x['cls_exp'])\\n for conf_name, cls_list in sorted(cls_dict.items()):\\n cls_tup = [get_tup(x) for x in cls_list]\\n style = '-k' if conf_name == args.band_region else None\\n ex_plane.add_config(cls_tup,conf_name, style=style, )\\n\\n ex_plane.save(args.output_plot)\",\n \"def GetPlaneMode(self, *args):\\n return _ShapeUpgrade.ShapeUpgrade_ConvertSurfaceToBezierBasis_GetPlaneMode(self, *args)\",\n \"def get_plane_of_points(\\n self,\\n normal_vector=\\\"z\\\",\\n planar_coordinate=None,\\n ):\\n # Get results vectors\\n if (normal_vector == \\\"z\\\"):\\n x_flat = self.floris.grid.x_sorted_inertial_frame[0, 0].flatten()\\n y_flat = self.floris.grid.y_sorted_inertial_frame[0, 0].flatten()\\n z_flat = self.floris.grid.z_sorted_inertial_frame[0, 0].flatten()\\n else:\\n x_flat = self.floris.grid.x_sorted[0, 0].flatten()\\n y_flat = self.floris.grid.y_sorted[0, 0].flatten()\\n z_flat = self.floris.grid.z_sorted[0, 0].flatten()\\n u_flat = self.floris.flow_field.u_sorted[0, 0].flatten()\\n v_flat = self.floris.flow_field.v_sorted[0, 0].flatten()\\n w_flat = self.floris.flow_field.w_sorted[0, 0].flatten()\\n\\n # Create a df of these\\n if normal_vector == \\\"z\\\":\\n df = pd.DataFrame(\\n {\\n \\\"x1\\\": x_flat,\\n \\\"x2\\\": y_flat,\\n \\\"x3\\\": z_flat,\\n \\\"u\\\": u_flat,\\n \\\"v\\\": v_flat,\\n \\\"w\\\": w_flat,\\n }\\n )\\n if normal_vector == \\\"x\\\":\\n df = pd.DataFrame(\\n {\\n \\\"x1\\\": y_flat,\\n \\\"x2\\\": z_flat,\\n \\\"x3\\\": x_flat,\\n \\\"u\\\": u_flat,\\n \\\"v\\\": v_flat,\\n \\\"w\\\": w_flat,\\n }\\n )\\n if normal_vector == \\\"y\\\":\\n df = pd.DataFrame(\\n {\\n \\\"x1\\\": x_flat,\\n \\\"x2\\\": z_flat,\\n \\\"x3\\\": y_flat,\\n \\\"u\\\": u_flat,\\n \\\"v\\\": v_flat,\\n \\\"w\\\": w_flat,\\n }\\n )\\n\\n # Subset to plane\\n # TODO: Seems sloppy as need more than one plane in the z-direction for GCH\\n if planar_coordinate is not None:\\n df = df[np.isclose(df.x3, planar_coordinate)] # , atol=0.1, rtol=0.0)]\\n\\n # Drop duplicates\\n # TODO is this still needed now that we setup a grid for just this plane?\\n df = df.drop_duplicates()\\n\\n # Sort values of df to make sure plotting is acceptable\\n df = df.sort_values([\\\"x2\\\", \\\"x1\\\"]).reset_index(drop=True)\\n\\n return df\",\n \"def construct_mpi_topology(self, dico):\\n period = [True]*self.dim\\n\\n if dico is None:\\n comm = mpi.COMM_WORLD\\n else:\\n comm = dico.get('comm', mpi.COMM_WORLD)\\n self.mpi_topo = MPI_topology(self.dim, period, comm)\",\n \"def get_transformable_plane(self, x_range = None, y_range = None):\\n plane_config = dict(self.plane_config)\\n shift_val = ORIGIN\\n if x_range is not None:\\n x_min, x_max = x_range\\n plane_config[\\\"x_radius\\\"] = x_max - x_min\\n shift_val += (x_max+x_min)*RIGHT/2.\\n if y_range is not None:\\n y_min, y_max = y_range\\n plane_config[\\\"y_radius\\\"] = y_max - y_min\\n shift_val += (y_max+y_min)*UP/2.\\n plane = ComplexPlane(**plane_config)\\n plane.shift(shift_val)\\n if self.use_multicolored_plane:\\n self.paint_plane(plane)\\n return plane\",\n \"def plotWholeRoom(mesh):\\r\\n fig = plt.figure()\\r\\n ax = fig.gca(projection='3d')\\r\\n X = np.arange(0, mesh.xLength+mesh.meshsize, mesh.meshsize)\\r\\n Y = np.arange(0, mesh.yLength+mesh.meshsize, mesh.meshsize)\\r\\n X, Y = np.meshgrid(X,Y)\\r\\n numberOfXNodes = mesh.x_res#round(mesh.xLength/mesh.meshsize)+1\\r\\n numberOfYNodes = mesh.y_res#round(mesh.yLength/mesh.meshsize)+1\\r\\n Z = np.array([[mesh.grid[i,j].funcVal for i in range(numberOfYNodes)] for j in range(numberOfXNodes)])\\r\\n if mesh.y_res==2:\\r\\n print()\\r\\n surf = ax.plot_surface(X, Y, Z, rstride=1, cstride=1, cmap=cm.coolwarm,\\r\\n linewidth=0, antialiased=False)\\r\\n # add vmin=4, vmax=41, to define lower and upper value for the color-scheme\\r\\n # set limits for z-axis\\r\\n ax.set_zlim(np.amin(Z)-mesh.meshsize, np.amax(Z)+mesh.meshsize)\\r\\n # don't know what these two lines are for\\r\\n # x.zaxis.set_major_locator(LinearLocator(10))\\r\\n # ax.zaxis.set_major_formatter(FormatStrFormatter('%.02f'))\\r\\n # don't know what these two lines are for\\r\\n fig.colorbar(surf, shrink=0.5, aspect=5)\\r\\n plt.show() \\r\\n return fig\",\n \"def plot_nhdp_hello_topology(options, tags=None, cursor=None):\\n options['cur_src'] = 'topo'\\n options['prefix'] = \\\"nhdp\\\"\\n ################################################################################\\n locs = options['locs']\\n colors = options['color2'](pylab.linspace(0, 1, 101))\\n ################################################################################\\n circ_max = 5\\n line_max = 10\\n floor_factor = 2\\n floor_skew = -0.25\\n line_min = 1\\n\\n hosts = get_hosts(options)\\n\\n for q, (tag_key, tag_id, nhdp_hi, nhdp_ht, mpr_minpdr) in enumerate(tags):\\n logging.info('tag_id=\\\\\\\"%s\\\\\\\" (%d/%d)', tag_id, q+1, len(tags))\\n fig2d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate')\\n fig3d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate', ThreeD=True)\\n if not q:\\n fig3d_onlynodes = MyFig(options, xlabel='x Coordinate [m]', ylabel='y Coordinate [$m$]', ThreeD=True)\\n\\n min_x = min_y = min_z = numpy.infty\\n max_x = max_y = max_z = 0\\n\\n # draw the nodes\\n for host in hosts:\\n try:\\n xpos, ypos, zpos = locs[host]\\n except KeyError:\\n logging.warning('no position found for node %s', host)\\n continue\\n\\n max_x = max(xpos, max_x)\\n max_y = max(ypos, max_y)\\n min_x = min(xpos, min_x)\\n min_y = min(ypos, min_y)\\n max_z = max(zpos, max_z)\\n min_z = max(zpos, min_z)\\n\\n fig2d.ax.plot(\\n xpos+zpos*floor_skew*floor_factor,\\n ypos+zpos*floor_factor,\\n 'o', color='black', ms=circ_max)\\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='black', ms=circ_max)\\n if not q:\\n color = 'black'\\n if host.startswith('a6'):\\n color = 'red'\\n elif host.startswith('a3'):\\n color = 'blue'\\n elif host.startswith('a7'):\\n color = 'orange'\\n fig3d_onlynodes.ax.plot([xpos], [ypos], [zpos], 'o', color=color, ms=circ_max)\\n fig2d.colorbar = fig2d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\\n fig3d.colorbar = fig3d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\\n drawBuildingContours(fig3d.ax, options)\\n drawBuildingContours(fig3d_onlynodes.ax, options)\\n\\n alinspace = numpy.linspace(0, 1, 100)\\n alinspace = numpy.vstack((alinspace, alinspace))\\n for tax in [fig2d.colorbar, fig3d.colorbar]:\\n tax.imshow(alinspace, aspect='auto', cmap=options['color2'])\\n tax.set_xticks(pylab.linspace(0, 100, 5))\\n tax.set_xticklabels(['$%.2f$' % l for l in pylab.linspace(0, 1, 5)], fontsize=0.8*options['fontsize'])\\n tax.set_yticks([])\\n tax.set_title('$PDR$', size=options['fontsize'])\\n fig2d.ax.axis((min_x-10, max_x+10, min_y-10, max_y+10+max_z*floor_factor+10))\\n fig2d.save('2d_%s' % (tag_id))\\n fig3d.save('3d_%s' % (tag_id))\\n if not q:\\n fig3d_onlynodes.save('3d')\",\n \"def automatic_partitioning():\\n def draw_labels(labels_vector):\\n labs = {node: labels_vector[i] for i, node in enumerate(router.graph.nodes())}\\n coord = {touple: list(touple) for touple in router.graph.nodes()}\\n nx.draw_networkx(router.graph, coord, labels=labs)\\n plt.show()\\n\\n file_path = PROJECT_PATH + \\\"/geographycal_data/adjacency_matrix/Howgrp.txt\\\"\\n router = Router(adjacency_metrix=file_path)\\n draw_labels(router.louvain_clustering(router.graph, weight='weight'))\",\n \"def plot_mpr_topology_per_mpr(options, tags=None, cursor=None):\\n interval = 600\\n options['cur_src'] = 'topo'\\n options['prefix'] = \\\"mpr\\\"\\n ################################################################################\\n locs = options['locs']\\n colors = options['color2'](pylab.linspace(0, 1, 101))\\n ################################################################################\\n circ_max = 5\\n line_max = 10\\n floor_factor = 2\\n floor_skew = -0.25\\n line_min = 1\\n cur_time = cursor.execute('''\\n SELECT min(time)\\n FROM nhdp_mpr_selectors\\n ''').fetchone()\\n mprs = cursor.execute('''\\n SELECT DISTINCT(host)\\n FROM nhdp_mpr_selectors\\n ''').fetchall()\\n hosts = get_hosts(options)\\n\\n min_x = min_y = min_z = numpy.infty\\n max_x = max_y = max_z = 0\\n\\n # first draw the edges...\\n for i, (mpr,) in enumerate(mprs):\\n logging.info('[%d/%d] plotting host=%s', i+1, len(mprs), mpr)\\n fig2d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate')\\n fig3d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate', ThreeD=True)\\n try:\\n host_xpos, host_ypos, host_zpos = locs[mpr]\\n except KeyError:\\n logging.warning('no position found for node %s', mpr)\\n continue\\n ################################################################################\\n # host is the receiving router, i.e. in our case the MPR\\n # src is the sending router, i.e. the MPR selector\\n # We only want to draw an edge if it connects an MPR with its SELECTOR.\\n #\\n ################################################################################\\n cursor.execute('''\\n SELECT src, AVG(pdr)\\n FROM eval_helloPDR AS pdr JOIN nhdp_mpr_selectors AS mpr\\n ON pdr.host = mpr.host AND pdr.tx_if = mpr.mprselector\\n WHERE pdr.host=?\\n GROUP BY src\\n ''', (mpr, ))\\n\\n for src, pdr in cursor.fetchall():\\n try:\\n src_xpos, src_ypos, src_zpos = locs[src]\\n except KeyError:\\n logging.warning('no position found for node %s', src)\\n continue\\n\\n fig2d.ax.plot(\\n [host_xpos+host_zpos*floor_skew*floor_factor, src_xpos+src_zpos*floor_skew*floor_factor],\\n [host_ypos+host_zpos*floor_factor, src_ypos+src_zpos*floor_factor],\\n linestyle='-', color=colors[pdr*100], linewidth=max(line_max*pdr, line_min), alpha=0.3)\\n\\n fig3d.ax.plot(\\n [host_xpos, src_xpos],\\n [host_ypos, src_ypos],\\n [host_zpos, src_zpos],\\n linestyle='-', color=colors[pdr*100], linewidth=max(line_max*pdr, line_min), alpha=0.3)\\n\\n # draw all other nodes\\n for host in hosts:\\n try:\\n xpos, ypos, zpos = locs[host]\\n except KeyError:\\n logging.warning('no position found for node %s', host)\\n continue\\n\\n max_x = max(xpos, max_x)\\n max_y = max(ypos, max_y)\\n min_x = min(xpos, min_x)\\n min_y = min(ypos, min_y)\\n max_z = max(zpos, max_z)\\n min_z = max(zpos, min_z)\\n if host == mpr:\\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='blue', ms=circ_max)\\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color='blue', ms=circ_max)\\n else:\\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='black', ms=circ_max)\\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color='black', ms=circ_max)\\n fig2d.colorbar = fig2d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\\n fig3d.colorbar = fig3d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\\n drawBuildingContours(fig3d.ax, options)\\n alinspace = numpy.linspace(0, 1, 100)\\n alinspace = numpy.vstack((alinspace, alinspace))\\n for tax in [fig2d.colorbar, fig3d.colorbar]:\\n tax.imshow(alinspace, aspect='auto', cmap=options['color2'])\\n tax.set_xticks(pylab.linspace(0, 100, 5))\\n tax.set_xticklabels(['$%.2f$' % l for l in pylab.linspace(0, 1, 5)], fontsize=0.8*options['fontsize'])\\n tax.set_yticks([])\\n tax.set_title('$PDR$', size=options['fontsize'])\\n fig2d.ax.axis((min_x-10, max_x+10, min_y-10, max_y+10+max_z*floor_factor+10))\\n fig2d.save('2d_topology_per_mpr_%s' % (mpr))\\n fig3d.save('3d_topology_per_mpr_%s' % (mpr))\",\n \"def ProjectToPlane(self):\\n\\n self.__do_essential_memebers_exist__()\\n if self.element_type != \\\"tri\\\":\\n raise ValueError(\\\"Project to plane is only applicable to triangles\\\")\\n\\n imesh = deepcopy(self)\\n coordinates = []\\n connectivities = []\\n for counter, elem in enumerate(imesh.elements):\\n\\n elementCoordinates = imesh.points[elem,:]\\n\\n A = elementCoordinates[0,:]\\n B = elementCoordinates[1,:]\\n C = elementCoordinates[2,:]\\n\\n X = (B - A); X /= np.linalg.norm(X)\\n Z = np.cross(X, C - A); Z /= np.linalg.norm(Z)\\n Y = np.cross(Z, X)\\n\\n # PROJECT THE TRIANGLE TO THIS BASES\\n a = [0., 0.]\\n b = [np.linalg.norm((B - A)), 0.]\\n c = [(C - A).dot(X), (C - A).dot(Y)]\\n\\n coordinates.append(a)\\n coordinates.append(b)\\n coordinates.append(c)\\n\\n elementConnectivity = [3 * counter, 3 * counter + 1, 3 * counter + 2]\\n connectivities.append(elementConnectivity)\\n\\n coordinates = np.array(coordinates)\\n connectivities = np.array(connectivities)\\n imesh.points = coordinates\\n imesh.elements = connectivities\\n imesh.nelem = imesh.elements.shape[0]\\n imesh.nnode = imesh.points.shape[0]\\n\\n return imesh\",\n \"def topology(self, topo_file: str, *args: str):\\n pass\",\n \"def plot_mpr_topology_per_node(options, tags=None, cursor=None):\\n interval = 600\\n options['cur_src'] = 'topo'\\n options['prefix'] = \\\"mpr\\\"\\n ################################################################################\\n locs = options['locs']\\n colors = options['color2'](pylab.linspace(0, 1, 101))\\n colors_mprs = ['green', 'red', 'cyan', 'magenta', 'yellow', 'grey']\\n #colors_mprs = ['#222222', '#444444', '#666666', '#888888', '#aaaaaa', '#cccccc']\\n ################################################################################\\n circ_max = 5\\n line_max = 10\\n floor_factor = 2\\n floor_skew = -0.25\\n line_min = 1\\n wait_time = 30\\n measure_time = wait_time + 20\\n draw_non_mpr_neighbors = False\\n\\n hosts = get_hosts(options)\\n\\n min_x = min_y = min_z = numpy.infty\\n max_x = max_y = max_z = 0\\n\\n for q, (tag_key, tag_id, nhdp_hi, nhdp_ht, mpr_minpdr) in enumerate(tags):\\n # first draw the edges...\\n for host in hosts:\\n logging.info(\\\"Plotting tag_id: %s host: %s\\\" % (tag_id, host))\\n tx_if, = cursor.execute('''\\n SELECT tx_if\\n FROM he\\n WHERE host=?\\n ''',(host,)).fetchone()\\n fig2d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate')\\n fig3d = MyFig(options, rect=[0.1, 0.1, 0.8, 0.7], xlabel='x Coordinate', ylabel='y Coordinate', ThreeD=True)\\n try:\\n host_xpos, host_ypos, host_zpos = locs[host]\\n except KeyError:\\n logging.warning('no position found for node %s', host)\\n continue\\n ################################################################################\\n # src is the receiving router, i.e. in our case the MPR\\n # host is the sending router, i.e. the MPR selector\\n # We only want to draw an edge if it connects a host with its MPR.\\n #\\n ################################################################################\\n\\n neighbors = cursor.execute('''\\n SELECT DISTINCT(host)\\n FROM rh\\n WHERE prev = ?\\n ''', (tx_if,)).fetchall()\\n min_time, = cursor.execute('''\\n SELECT min(time)\\n FROM nhdp_he\\n WHERE tag = ?\\n ''',(tag_key,)).fetchone()\\n mprs = cursor.execute('''\\n SELECT pdr.host, AVG(pdr)\\n FROM eval_helloPDR AS pdr JOIN nhdp_mpr_selectors AS mpr\\n ON pdr.host = mpr.host AND pdr.tx_if = mpr.mprselector\\n WHERE pdr.tx_if = ? AND pdr.tag_key = ? AND mpr.time BETWEEN ? AND ?\\n GROUP BY pdr.host\\n ''', (tx_if, tag_key, min_time + wait_time, min_time + measure_time)).fetchall()\\n logging.info(\\\"Host is %s...\\\" % host)\\n mpr_list = []\\n for mpr, pdr in mprs:\\n mpr_list.append(mpr)\\n try:\\n src_xpos, src_ypos, src_zpos = locs[mpr]\\n except KeyError:\\n logging.warning('no position found for node %s', mpr)\\n continue\\n\\n fig2d.ax.plot(\\n [host_xpos+host_zpos*floor_skew*floor_factor, src_xpos+src_zpos*floor_skew*floor_factor],\\n [host_ypos+host_zpos*floor_factor, src_ypos+src_zpos*floor_factor],\\n linestyle='-', color=colors[pdr*100], linewidth=max(line_max*pdr, line_min), alpha=0.3, label=tag_id)\\n\\n fig3d.ax.plot(\\n [host_xpos, src_xpos],\\n [host_ypos, src_ypos],\\n [host_zpos, src_zpos],\\n linestyle='-', color=colors[pdr*100], linewidth=max(line_max*pdr, line_min), alpha=0.3, label=tag_id)\\n if draw_non_mpr_neighbors == True:\\n for _host, in neighbors:\\n try:\\n src_xpos, src_ypos, src_zpos = locs[_host]\\n except KeyError:\\n logging.warning('no position found for node %s', _host)\\n continue\\n\\n fig2d.ax.plot(\\n [host_xpos+host_zpos*floor_skew*floor_factor, src_xpos+src_zpos*floor_skew*floor_factor],\\n [host_ypos+host_zpos*floor_factor, src_ypos+src_zpos*floor_factor],\\n linestyle='-', color='black', linewidth=line_min, alpha=0.3)\\n\\n fig3d.ax.plot(\\n [host_xpos, src_xpos],\\n [host_ypos, src_ypos],\\n [host_zpos, src_zpos],\\n linestyle='-', color='black', linewidth=line_min, alpha=0.3)\\n # draw nodes\\n color_idx = 0;\\n skip_list = []\\n n2_list = []\\n for _host in hosts:\\n if _host in skip_list:\\n continue\\n try:\\n xpos, ypos, zpos = locs[_host]\\n except KeyError:\\n logging.warning('no position found for node %s', _host)\\n continue\\n\\n max_x = max(xpos, max_x)\\n max_y = max(ypos, max_y)\\n min_x = min(xpos, min_x)\\n min_y = min(ypos, min_y)\\n max_z = max(zpos, max_z)\\n min_z = max(zpos, min_z)\\n if _host == host:\\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='blue', ms=circ_max*2)\\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color='blue', ms=circ_max*2)\\n elif _host in mpr_list:\\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color=colors_mprs[color_idx], ms=circ_max)\\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color=colors_mprs[color_idx], ms=circ_max)\\n mpr_tx_if, = cursor.execute('''\\n SELECT tx_if\\n FROM he\\n WHERE host=? AND time BETWEEN ? AND ?\\n ''',(_host, min_time + wait_time, min_time + measure_time)).fetchone()\\n n2_ifs = list(pylab.flatten(cursor.execute('''\\n SELECT DISTINCT(n2)\\n FROM nhdp_mpr_n2\\n WHERE host = ? AND time BETWEEN ? AND ?\\n ''', (_host, min_time + wait_time, min_time + measure_time)).fetchall()))\\n\\n n2s = cursor.execute('''\\n SELECT DISTINCT(host)\\n FROM he\\n WHERE tx_if IN (%s)\\n ''' % ','.join('?'*len(n2_ifs)), n2_ifs).fetchall()\\n #n2 = cursor.execute('''\\n #SELECT DISTINCT(host)\\n #FROM rh\\n #WHERE prev = ? AND time BETWEEN ? AND ?\\n #''', (mpr_tx_if, min_time + wait_time, min_time + measure_time)).fetchall()\\n mpr_xpos, mpr_ypos, mpr_zpos = locs[_host]\\n for __host, in n2s:\\n __host = unicodedata.normalize('NFKD', __host).encode('ascii','ignore')\\n if __host in n2_list:\\n continue\\n if __host in mpr_list or __host == host:\\n continue\\n n2_list.append(__host)\\n skip_list.append(__host)\\n try:\\n _xpos, _ypos, _zpos = locs[__host]\\n except KeyError:\\n logging.warning('no position found for node %s', __host)\\n continue\\n max_x = max(_xpos, max_x)\\n max_y = max(_ypos, max_y)\\n min_x = min(_xpos, min_x)\\n min_y = min(_ypos, min_y)\\n max_z = max(_zpos, max_z)\\n min_z = max(_zpos, min_z)\\n fig3d.ax.plot([_xpos], [_ypos], [_zpos], 'o', color=colors_mprs[color_idx], ms=circ_max)\\n fig2d.ax.plot(_xpos+_zpos*floor_skew*floor_factor,_ypos+_zpos*floor_factor,'o', color=colors_mprs[color_idx], ms=circ_max)\\n\\n n2_xpos, n2_ypos, n2_zpos = locs[__host]\\n\\n fig2d.ax.plot(\\n [n2_xpos+n2_zpos*floor_skew*floor_factor, mpr_xpos+mpr_zpos*floor_skew*floor_factor],\\n [n2_ypos+n2_zpos*floor_factor, mpr_ypos+mpr_zpos*floor_factor],\\n linestyle='-', color=colors_mprs[color_idx], linewidth=line_min, alpha=0.3)\\n\\n fig3d.ax.plot(\\n [n2_xpos, mpr_xpos],\\n [n2_ypos, mpr_ypos],\\n [n2_zpos, mpr_zpos],\\n linestyle='-', color=colors_mprs[color_idx], linewidth=line_min, alpha=0.3)\\n\\n color_idx = color_idx + 1;\\n if color_idx > 5:\\n color_idx = 0\\n else:\\n fig3d.ax.plot([xpos], [ypos], [zpos], 'o', color='black', ms=circ_max)\\n fig2d.ax.plot(xpos+zpos*floor_skew*floor_factor,ypos+zpos*floor_factor,'o', color='black', ms=circ_max)\\n\\n\\n fig2d.colorbar = fig2d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\\n fig3d.colorbar = fig3d.fig.add_axes([0.1, 0.875, 0.8, 0.025])\\n drawBuildingContours(fig3d.ax, options)\\n alinspace = numpy.linspace(0, 1, 100)\\n alinspace = numpy.vstack((alinspace, alinspace))\\n for tax in [fig2d.colorbar, fig3d.colorbar]:\\n tax.imshow(alinspace, aspect='auto', cmap=options['color2'])\\n tax.set_xticks(pylab.linspace(0, 100, 5))\\n tax.set_xticklabels(['$%.2f$' % l for l in pylab.linspace(0, 1, 5)], fontsize=0.8*options['fontsize'])\\n tax.set_yticks([])\\n tax.set_title('$PDR$', size=options['fontsize'])\\n fig2d.ax.axis((min_x-10, max_x+10, min_y-10, max_y+10+max_z*floor_factor+10))\\n logging.info(\\\"saving %s\\\" %(host))\\n fig2d.save('2d_mpr_topology_%s' % (host))\\n fig3d.save('3d_mpr_topology_%s' % (host))\",\n \"def plot_sag_plane(self, P0=None, sag_pl=None):\\n if P0 is None: P0 = np.array([0,0,0])\\n if sag_pl is None: sag_pl = self.sp\\n norm, d = sag_pl[:3], sag_pl[3]\\n import matplotlib.pyplot as plt\\n from mpl_toolkits.mplot3d import Axes3D\\n plt.ion()\\n # create x,y\\n xypts = 10\\n xrng = 300\\n yrng = 130\\n xrng_mesh = np.linspace(P0[0], P0[0]-xrng, xypts)\\n yrng_mesh = np.linspace(P0[1]-yrng/2., P0[1]+yrng, xypts)\\n xx, yy = np.meshgrid(xrng_mesh, yrng_mesh)\\n # calculate corresponding z\\n zz = -1 * (norm[0] * xx + norm[1] * yy + d) / norm[2]\\n # plot the surface\\n self.fig = plt.figure()\\n self.fig_ax = self.fig.add_subplot(111, projection='3d')\\n self.fig_ax.plot_wireframe(xx, yy, zz, color='gray')\\n #ax.quiver(P0[0], P0[1], norm[0], norm[1])\\n self.fig_ax.set_xlabel('X')\\n self.fig_ax.set_ylabel('Y')\\n self.fig_ax.set_zlabel('Z')\\n self.fig_ax.set_zlim(P0[2]-xrng, P0[2]+yrng)\\n plt.show()\",\n \"def plane_generator():\\n\\n planarRadius = np.sqrt(N / (np.pi * pointDensity)) # <-- convert pointDensity into radius\\n planarThreshold = planarRadius * np.sqrt(thresholdFrac)\\n\\n # distance function (law of cosines)\\n def dist(rTheta1, rTheta2): # rThetai is a coordinate tuple: (r, theta)\\n a, b = rTheta1[0], rTheta2[0]\\n theta1, theta2 = rTheta1[1], rTheta2[1]\\n return np.sqrt(a ** 2 + b ** 2 - 2 * a * b * np.cos(theta1 - theta2)) # <-- law of cosines\\n\\n # computes the adjacency matrices\\n data_plane = []\\n for r in range(num_graphs):\\n\\n # generates dictionary of positions for each node: node_pos = {node_i: (radius, theta)}\\n node_pos = {}\\n for i in range(N):\\n rnd_angle = np.random.random() * 2 * np.pi\\n rnd_radii = np.random.random() * planarRadius\\n node_pos.update({i: (rnd_radii, rnd_angle)})\\n\\n Adj_Matrix = np.zeros((N, N))\\n for i in range(N):\\n for j in range(N):\\n ij_dist = dist(node_pos[i], node_pos[j])\\n if ij_dist < planarThreshold:\\n Adj_Matrix[i, j] = 1 # nodes that are connected are assigned a 1 in the matrix\\n\\n data_plane.append(Adj_Matrix)\\n\\n return data_plane\",\n \"def resMode(mode): \\n if mode==0:\\n makeMesh(r0x, r0y)\\n elif mode==1:\\n makeMesh(r1x, r1y)\\n elif (mode==2):\\n makeMesh(r2x, r2y)\",\n \"def topo_plane_paramEval(self, param):\\n # Create an empty numpy array with the same number as pixels as the real data.\\n self.topo_plane_fit_data = np.zeros((self.y_res, self.x_res))\\n for y in range(0, self.y_res): # Iterate over the y-axis pixels.\\n for x in range(0, self.x_res): # Iterate over the x-axis pixels.\\n self.topo_plane_fit_data[y, x] = param[0]*x + param[1]*y + param[2] # Generate plane value.\\n return self.topo_plane_fit_data # Return entire array.\",\n \"def load_plane(image):\\n pixels = image.getPrimaryPixels()\\n return pixels.getPlane(0, 0, 0)\",\n \"def build_topology_moore(config):\\n columns = config['MooreTopology']['width']\\n rows = config['MooreTopology']['height']\\n radius = config['MooreTopology']['radius']\\n assert rows > 0 and columns > 0 and radius > 0\\n\\n periodic = config['MooreTopology']['periodic']\\n\\n top = nx.empty_graph()\\n top.name = \\\"Moore Lattice: {r} rows, {c} columns, radius={rx}\\\".format(r=rows,\\n c=columns,\\n rx=radius)\\n if periodic:\\n top.name += ' with periodoc boundaries'\\n\\n top.add_nodes_from(list(range(rows * columns)))\\n\\n for node in top.nodes_iter():\\n (myrow, mycol) = divmod(node, columns)\\n top.node[node]['coords'] = (myrow, mycol)\\n\\n for r in range(myrow - radius, myrow + radius + 1):\\n if periodic == False and (r < 0 or r >= rows):\\n continue\\n\\n for c in range(mycol - radius, mycol + radius + 1):\\n if periodic == False and (c < 0 or c >= columns):\\n continue\\n\\n neighbor = (columns * (r % rows)) + (c % columns)\\n\\n if node != neighbor:\\n top.add_edge(node, neighbor)\\n\\n return top\",\n \"def mesh_slicer(self, plane, opt):\\n\\n # get plane coefficients\\n a = plane[0]\\n b = plane[1]\\n c = plane[2]\\n\\n # create vtk plane object\\n VTKplane = vtk.vtkPlane()\\n # for now we choose the center point as the point of rotation\\n VTKplane.SetOrigin(self.mesh_poly.GetCenter())\\n VTKplane.SetNormal(a, b, c)\\n VTKplane.SetOrigin(self.epi_apex_node)\\n\\n # create cutter\\n cutEdges = vtk.vtkCutter()\\n cutEdges.SetInputData(self.mesh_poly)\\n cutEdges.SetCutFunction(VTKplane)\\n cutEdges.GenerateCutScalarsOn()\\n cutEdges.SetValue(0, 0.5)\\n\\n # create renderer\\n ren = vtk.vtkRenderer()\\n ren.SetBackground(0.0, 0.0, 0.0)\\n\\n # create mapper\\n mapper = vtk.vtkPolyDataMapper()\\n mapper.SetInputConnection(cutEdges.GetOutputPort())\\n\\n # create actor\\n actor = vtk.vtkActor()\\n actor.SetMapper(mapper)\\n actor.GetProperty().SetColor(0.0, 0.0, 1.0)\\n actor.GetProperty().SetLineWidth(2)\\n\\n # display apex point\\n apexA = include_points(list(self.epi_apex_node), 1, 15, (0, 0, 1))\\n\\n if (opt == 'mesh'):\\n meshMapper = vtk.vtkPolyDataMapper()\\n meshMapper.SetInputData(self.mesh_poly)\\n meshActor = vtk.vtkActor()\\n meshActor.SetMapper(meshMapper)\\n meshActor.GetProperty().SetColor(1.0, 0.0, 0.0)\\n\\n # generate renderer\\n ren.AddActor(self.meshActor)\\n ren.AddActor(actor)\\n ren.AddActor(apexA)\\n\\n else:\\n ren.AddActor(actor)\\n ren.AddActor(apexA)\\n\\n # display\\n vtk_show(ren)\",\n \"def build_planar_mesh(cellWidth, x, y, geom_points, geom_edges,\\n out_filename='base_mesh.nc', logger=None):\\n\\n with LoggingContext(__name__, logger=logger) as logger:\\n\\n da = xarray.DataArray(cellWidth,\\n dims=['y', 'x'],\\n coords={'y': y, 'x': x},\\n name='cellWidth')\\n cw_filename = 'cellWidthVsXY.nc'\\n da.to_netcdf(cw_filename)\\n\\n logger.info('Step 1. Generate mesh with JIGSAW')\\n jigsaw_driver(cellWidth, x, y, on_sphere=False,\\n geom_points=geom_points, geom_edges=geom_edges,\\n logger=logger)\\n\\n logger.info('Step 2. Convert triangles from jigsaw format to netcdf')\\n jigsaw_to_netcdf(msh_filename='mesh-MESH.msh',\\n output_name='mesh_triangles.nc', on_sphere=False)\\n\\n logger.info('Step 3. Convert from triangles to MPAS mesh')\\n args = ['MpasMeshConverter.x',\\n 'mesh_triangles.nc',\\n out_filename]\\n check_call(args=args, logger=logger)\",\n \"def PlotAirplane():\\n airplane = vtkInterface.PolyData(planefile)\\n airplane.Plot()\",\n \"def fig4():\\n # fmt: off\\n tpm = np.array([\\n [0, 0, 0],\\n [0, 0, 1],\\n [1, 0, 1],\\n [1, 0, 0],\\n [1, 0, 0],\\n [1, 1, 1],\\n [1, 0, 1],\\n [1, 1, 0],\\n ])\\n cm = np.array([\\n [0, 1, 1],\\n [1, 0, 1],\\n [1, 1, 0],\\n ])\\n # fmt: on\\n return Network(tpm, cm=cm, node_labels=LABELS[:tpm.shape[1]])\",\n \"def createTopology(self):\\n\\n # find DAG root\\n dagRoot = None\\n for mote in self.motes:\\n if mote.id == 0:\\n mote.role_setDagRoot()\\n dagRoot = mote\\n assert dagRoot\\n\\n if self.settings.mobilityModel == 'RPGM':\\n # put DAG root at center of area\\n dagRoot.setLocation(x=SimEngine.SimEngine().targets[0][0],\\n y=SimEngine.SimEngine().targets[0][1])\\n else:\\n # put DAG root at center of area\\n dagRoot.setLocation(x=self.squareSide/2,\\n y=self.squareSide/2)\\n\\n # reposition each mote until it is connected\\n connectedMotes = [dagRoot]\\n for mote in self.motes:\\n if mote in connectedMotes:\\n continue\\n\\n connected = False\\n while not connected:\\n # pick a random location\\n mote.setLocation(x=self.squareSide*random.random(),\\n y=self.squareSide*random.random())\\n\\n # if mote.id == 1:\\n # mote.setLocation(\\n # x=self.squareSide / 2.5 + 0.02,\\n # y=self.squareSide / 2.5 + 0.3\\n # )\\n # elif mote.id == 2:\\n # mote.setLocation(\\n # x=self.squareSide / 2.5 + 0.3,\\n # y=self.squareSide / 2.5 + 0.3\\n # )\\n #\\n # elif mote.id == 3:\\n # mote.setLocation(\\n # x=self.squareSide / 2.5 + 0.1,\\n # y=self.squareSide / 2.5 + 0.4\\n # )\\n\\n # elif mote.id == 4:\\n # mote.setLocation(\\n # x=self.squareSide / 2.5 + 0.2,\\n # y=self.squareSide / 2.5 + 0.65\\n # )\\n # else:\\n\\n mote.setLocation(\\n x=self.settings.squareSide * random.random(),\\n y=self.settings.squareSide * random.random()\\n )\\n\\n numStableNeighbors = 0\\n\\n # count number of neighbors with sufficient RSSI\\n for cm in connectedMotes:\\n\\n rssi = self._computeRSSI(mote, cm)\\n mote.setRSSI(cm, rssi)\\n cm.setRSSI(mote, rssi)\\n\\n # save the intial RSSI values for future use in the mobility models\\n mote.initialRSSI[cm] = rssi\\n cm.initialRSSI[mote] = rssi\\n\\n if rssi > self.STABLE_RSSI:\\n numStableNeighbors += 1\\n\\n # make sure it is connected to at least stable_neighbors motes\\n # or connected to all the currently deployed motes when the\\n # number of deployed motes are smaller than stable_neighbors\\n if (numStableNeighbors >= self.stable_neighbors or\\n numStableNeighbors == len(connectedMotes)):\\n print 'moteid %d, mote x %.4f, mote y %.4f: valid %s' % (mote.id, mote.x, mote.y , SimEngine.SimEngine().checkValidPosition(mote.x, mote.y, countSquare=True, placement=True))\\n if self.settings.mobilityModel == 'RPGM' and SimEngine.SimEngine().checkValidPosition(mote.x, mote.y, countSquare=True, placement=True):\\n connected = True\\n elif self.settings.mobilityModel != 'RPGM':\\n connected = True\\n\\n connectedMotes += [mote]\\n\\n # self.motes[3].setRSSI(self.motes[0], -96)\\n # self.motes[0].setRSSI(self.motes[3], -96)\\n\\n # for each mote, compute PDR to each neighbors\\n for mote in self.motes:\\n for m in self.motes:\\n if mote == m:\\n continue\\n if mote.getRSSI(m) > mote.minRssi:\\n pdr = self._computePDR(mote, m)\\n mote.setPDR(m, pdr)\\n m.setPDR(mote, pdr)\",\n \"def __init__(self, initial_surfaces):\\n\\n nsurf = len(initial_surfaces)\\n nvert, nedge, ngroup, \\\\\\n surf_ptrs, edge_ptrs, \\\\\\n surf_group, edge_group \\\\\\n = self._compute_topology(initial_surfaces)\\n\\n self._num = {\\n 'surf': len(initial_surfaces),\\n 'vert': nvert,\\n 'edge': nedge,\\n 'group': ngroup,\\n }\\n\\n self._topo = {\\n 'surf_ptrs': surf_ptrs,\\n 'edge_ptrs': edge_ptrs,\\n 'surf_group': surf_group,\\n 'edge_group': edge_group,\\n }\\n\\n self._mult = {\\n 'vert': numpy.zeros(nvert, int),\\n 'edge': numpy.zeros(nedge, int),\\n 'diff_vert': numpy.zeros(nvert, int),\\n 'diff_edge': numpy.zeros(nedge, int),\\n }\\n\\n self._bspline = {\\n 'order': 4 * numpy.ones(ngroup, int),\\n 'num_cp': 4 * numpy.ones(ngroup, int),\\n 'num_pt': 10 * numpy.ones(ngroup, int),\\n }\\n\\n self._surf_indices = {\\n 'df': numpy.zeros((nsurf, 2), int, 'F'),\\n 'cp': numpy.zeros((nsurf, 2), int, 'F'),\\n 'pt': numpy.zeros((nsurf, 2), int, 'F'),\\n }\\n\\n self._edge_indices = {\\n 'df': numpy.zeros((nedge, 2), int, 'F'),\\n 'cp': numpy.zeros((nedge, 2), int, 'F'),\\n 'pt': numpy.zeros((nedge, 2), int, 'F'),\\n }\\n\\n self._str_indices = {\\n 'cp': numpy.zeros((nsurf, 2), int, 'F'),\\n 'pt': numpy.zeros((nsurf, 2), int, 'F'),\\n }\\n\\n self._vert_indices = numpy.zeros(nvert, int)\\n\\n self._size = {\\n 'df_str': 0,\\n 'df': 0,\\n 'cp': 0,\\n 'cp_str': 0,\\n 'pt_str': 0,\\n 'pt': 0,\\n }\\n\\n self.diff = {\\n 'surf': numpy.zeros((nsurf, 3, 3), bool, 'F'),\\n 'edge': numpy.zeros((nedge, 2), bool, 'F'),\\n }\\n\\n self.hidden = numpy.zeros(nsurf, bool)\\n\\n self.jac = {\\n 'd(df)/d(df_str)': None,\\n 'd(cp)/d(df)': None,\\n 'd(cp_str)/d(cp)': None,\\n 'd(pt_str)/d(cp_str)': None,\\n 'd(pt)/d(pt_str)': None,\\n }\\n\\n self.vec = {\\n 'df_str': None,\\n 'df': None,\\n 'cp': None,\\n 'cp_str': None,\\n 'pt_str': None,\\n 'pt': None,\\n }\",\n \"def topology(self, topo_file: str, *args: str):\\n self.scion_sh('topology', '-c', topo_file, '-d', *args)\",\n \"def plane_OLS(x,y,z, print_distances=False):\\n A = np.array([x, y]).T\\n B = z.T\\n\\n #solve Ax=B\\n p = np.matmul(np.matmul(linalg.inv(np.matmul(A.T, A)), A.T), B.T) #uses left pseudo-inverse {(A^T * A)^-1 * A^T} due to system being overconstrained (A doesn't have a true inverse)\\n params = [-float(p[0]), -float(p[1]), 1.0] #c=1.0 by default\\n bottom = np.sqrt(params[0]*params[0] + params[1]*params[1] + params[2]*params[2])\\n for i in range(len(params)): params[i] = params[i]/bottom\\n print(\\\"# - Normalized best-fit plane parameters: {0}\\\".format(params))\\n if print_distances:\\n for i in range(len(x)):\\n print(plane_dist(x[i], y[i], z[i], params))\\n return params\",\n \"def __init__(self, constraints=[], infeasiblePoints=[], feasiblePoints=[], optimalPoint=None, costVector=None, zoom=1.0, frameTime=0.0): \\n super(PacmanPlotLP, self).__init__(zoom, frameTime)\\n\\n xmin = 100000\\n ymin = 100000\\n xmax = -100000\\n ymax = -100000\\n\\n for point in feasiblePoints:\\n if point[0] < xmin:\\n xmin = point[0]\\n if point[0] > xmax:\\n xmax = point[0]\\n if point[1] < ymin:\\n ymin = point[1]\\n if point[1] > ymax:\\n ymax = point[1]\\n\\n if len(feasiblePoints) == 0:\\n for point in infeasiblePoints:\\n if point[0] < xmin:\\n xmin = point[0]\\n if point[0] > xmax:\\n xmax = point[0]\\n if point[1] < ymin:\\n ymin = point[1]\\n if point[1] > ymax:\\n ymax = point[1]\\n\\n xmin = int(math.floor(xmin)) - 3\\n ymin = int(math.floor(ymin)) - 3\\n xmax = int(math.ceil(xmax)) + 3\\n ymax = int(math.ceil(ymax)) + 3\\n width = xmax-xmin+1\\n height = ymax-ymin+1\\n\\n# p = feasiblePoints[2]\\n# print(\\\"p={}\\\".format(p))\\n# print(\\\"feasible={}\\\".format(self.pointFeasible(p, constraints)))\\n# g = self.cartesianToLayout(xmin, ymin, xmax, ymax, p)\\n# print(\\\"g={}\\\".format(g))\\n# gr = (int(round(g[0])), int(round(g[1])))\\n# p2 = self.layoutToCartesian(xmin, ymin, xmax, ymax, gr)\\n# print(\\\"p2={}\\\".format(p2))\\n# print(\\\"p2 feasible={}\\\".format(self.pointFeasible(p2, constraints)))\\n\\n layoutLists = self.blankLayoutLists(width, height)\\n\\n self.addInfeasibleGhosts(layoutLists, constraints, xmin, ymin, xmax, ymax)\\n\\n layoutLists = self.changeBorderGhostsToWall(layoutLists)\\n \\n for point in infeasiblePoints:\\n self.addCartesianPointToLayout(layoutLists, point, '.', xmin, ymin, xmax, ymax)\\n\\n for point in feasiblePoints:\\n self.addCartesianPointToLayout(layoutLists, point, 'o', xmin, ymin, xmax, ymax)\\n\\n if optimalPoint is not None:\\n self.addCartesianPointToLayout(layoutLists, optimalPoint, 'P', xmin, ymin, xmax, ymax)\\n\\n if graphicsUtils._canvas is not None:\\n graphicsUtils.clear_screen()\\n \\n # Initialize GameStateData with blank board with axes \\n self.width = width\\n self.height = height\\n\\n self.zoom = min(30.0/self.width, 20.0/self.height)\\n self.gridSize = graphicsDisplay.DEFAULT_GRID_SIZE * self.zoom\\n\\n maxNumGhosts = 10000\\n layout = Layout(layoutLists)\\n self.blankGameState = GameStateData()\\n self.blankGameState.initialize(layout, maxNumGhosts)\\n self.initialize(self.blankGameState)\\n title = 'Pacman Plot LP'\\n graphicsUtils.changeText(self.infoPane.scoreText, title)\\n graphicsUtils.refresh()\\n graphicsUtils.sleep(1)\\n\\n if costVector is not None:\\n self.shadeCost(layoutLists, constraints, costVector, feasiblePoints, xmin, ymin, xmax, ymax)\",\n \"def generateTopology():\\n switches = {}\\n interfaces = {}\\n links = {}\\n return (switches,links)\",\n \"def __init__(self, n=1, cpu=.1, bw=10, delay=None,\\n max_queue_size=None, **params):\\n\\n # Initialize topo\\n Topo.__init__(self, **params)\\n\\n # Host and link configuration\\n hconfig = {'cpu': cpu}\\n lconfig = {'bw': bw, 'delay': delay,\\n 'max_queue_size': max_queue_size }\\n\\n # Create the actual topology\\n receiver = self.addHost('receiver')\\n\\n # Switch ports 1:uplink 2:hostlink 3:downlink\\n uplink, hostlink, downlink = 1, 2, 3\\n\\n # The following template code creates a parking lot topology\\n # TODO: Replace the template code to create a parking lot topology for any arbitrary N (>= 1)\\n if n < 1: # network must have at least 1 host\\n return -1\\n\\n s = [] # Python list of switches\\n h = [] # Python list of hosts\\n\\n # dynamically add all hosts and switches to network backbone first\\n for i in range(n):\\n switch_name = 's%s' % (i+1)\\n host_name = 'h%s' % (i+1)\\n\\n s.append( self.addSwitch(switch_name) ) # s[0] is switch1\\n h.append( self.addHost(host_name) ) # h[0] is host1\\n\\n # Wire up clients\\n self.addLink(h[i], s[i], port1=0, port2=hostlink, **lconfig)\\n \\n # link to previous switch\\n if i > 0:\\n self.addLink(s[i-1], s[i], port1=downlink, port2=uplink, **lconfig)\\n\\n \\n # Wire up receiver to first switch\\n self.addLink(receiver, s[0], port1=0, port2=uplink, **lconfig)\\n\\n '''\\n # for N = 1\\n # Begin: Template code\\n s1 = self.addSwitch('s1')\\n h1 = self.addHost('h1', **hconfig)\\n\\n # Wire up receiver\\n self.addLink(receiver, s1, port1=0, port2=uplink, **lconfig)\\n\\n # Wire up clients\\n self.addLink(h1, s1, port1=0, port2=hostlink, **lconfig)\\n\\n # Uncomment the next 8 lines to create a N = 3 parking lot topology\\n s2 = self.addSwitch('s2')\\n h2 = self.addHost('h2', **hconfig)\\n self.addLink(s1, s2,\\n port1=downlink, port2=uplink, **lconfig)\\n self.addLink(h2, s2,\\n port1=0, port2=hostlink, **lconfig)\\n\\n s3 = self.addSwitch('s3')\\n h3 = self.addHost('h3', **hconfig)\\n self.addLink(s2, s3,\\n port1=downlink, port2=uplink, **lconfig)\\n self.addLink(h3, s3,\\n port1=0, port2=hostlink, **lconfig)\\n \\n # End: Template code\\n '''\",\n \"def __init__(self, dx = 1., dy = 1., nx = 1, ny = 1,\\n _RepresentationClass=_Grid2DRepresentation, _TopologyClass=_Mesh2DTopology):\\n\\n self.args = {\\n 'dx': dx,\\n 'dy': dy,\\n 'nx': nx,\\n 'ny': ny\\n }\\n\\n self.nx = nx\\n self.ny = ny\\n\\n self.numberOfHorizontalFaces = self.nx * (self.ny + 1)\\n self.numberOfVerticalFaces = self.ny * (self.nx + 1)\\n self.numberOfEachDiagonalFaces = self.nx * self.ny\\n\\n self.dx = PhysicalField(value = dx)\\n scale = PhysicalField(value = 1, unit = self.dx.unit)\\n self.dx /= scale\\n\\n self.dy = PhysicalField(value = dy)\\n if self.dy.unit.isDimensionless():\\n self.dy = dy\\n else:\\n self.dy /= scale\\n\\n self.numberOfCornerVertices = (self.nx + 1) * (self. ny + 1)\\n self.numberOfCenterVertices = self.nx * self.ny\\n self.numberOfTotalVertices = self.numberOfCornerVertices + self.numberOfCenterVertices\\n\\n self.offset = (0, 0)\\n\\n vertices = self._createVertices()\\n faces = self._createFaces()\\n\\n cells = self._createCells()\\n cells = numerix.sort(cells, axis=0)\\n\\n Mesh2D.__init__(self, vertices, faces, cells,\\n _RepresentationClass=_RepresentationClass, _TopologyClass=_TopologyClass)\\n\\n self.scale = scale\",\n \"def fake_focalplane(\\n samplerate=20,\\n epsilon=0,\\n net=1,\\n fmin=0,\\n alpha=1,\\n fknee=0.05,\\n fwhm=30,\\n npix=7,\\n fov=3.0\\n):\\n zaxis = np.array([0, 0, 1.0])\\n \\n pol_A = hex_pol_angles_qu(npix)\\n pol_B = hex_pol_angles_qu(npix, offset=90.0)\\n \\n dets_A = hex_layout(npix, fov, \\\"\\\", \\\"\\\", pol_A)\\n dets_B = hex_layout(npix, fov, \\\"\\\", \\\"\\\", pol_B)\\n \\n dets = dict()\\n for p in range(npix):\\n pstr = \\\"{:01d}\\\".format(p)\\n for d, layout in zip([\\\"A\\\", \\\"B\\\"], [dets_A, dets_B]):\\n props = dict()\\n props[\\\"quat\\\"] = layout[pstr][\\\"quat\\\"]\\n props[\\\"epsilon\\\"] = epsilon\\n props[\\\"rate\\\"] = samplerate\\n props[\\\"alpha\\\"] = alpha\\n props[\\\"NET\\\"] = net\\n props[\\\"fmin\\\"] = fmin\\n props[\\\"fknee\\\"] = fknee\\n props[\\\"fwhm_arcmin\\\"] = fwhm\\n dname = \\\"{}{}\\\".format(pstr, d)\\n dets[dname] = props\\n return dets\",\n \"def Planes(pi1, pi2):\\n\\n if not isinstance(p11, Plane):\\n pi1 = Plane(arg.getvector(pi1, 4))\\n if not isinstance(p12, Plane):\\n pi2 = Plane(arg.getvector(pi2, 4))\\n \\n w = np.cross(pi1.n, pi2.n)\\n v = pi2.d * pi1.n - pi1.d * pi2.n\\n return Plucker(np.r_[v, w])\",\n \"def topology(self, bonds_info, angles_info):\\n return self.header() + self.defaults() +\\\\\\n self.moleculetype() + self.atoms() +\\\\\\n self.bonds(bonds_info) + self.angles(angles_info)\",\n \"def PlotAntsPlane():\\n\\n # load and shrink airplane\\n airplane = vtkInterface.PolyData(planefile)\\n airplane.points /= 10\\n # pts = airplane.GetNumpyPoints() # gets pointer to array\\n # pts /= 10 # shrink\\n\\n # rotate and translate ant so it is on the plane\\n ant = vtkInterface.PolyData(antfile)\\n ant.RotateX(90)\\n ant.Translate([90, 60, 15])\\n\\n # Make a copy and add another ant\\n ant_copy = ant.Copy()\\n ant_copy.Translate([30, 0, -10])\\n\\n # Create plotting object\\n plobj = vtkInterface.PlotClass()\\n plobj.AddMesh(ant, 'r')\\n plobj.AddMesh(ant_copy, 'b')\\n\\n # Add airplane mesh and make the color equal to the Y position\\n plane_scalars = airplane.points[:, 1]\\n plobj.AddMesh(airplane, scalars=plane_scalars, stitle='Plane Y\\\\nLocation')\\n plobj.AddText('Ants and Plane Example')\\n plobj.Plot()\",\n \"def two_plane_obj_points(grid_size, dx):\\r\\n objp_xy = np.zeros((grid_size[0]*grid_size[1], 3), np.float32)\\r\\n objp_yz = np.zeros((grid_size[1]*grid_size[2], 3), np.float32)\\r\\n objp_xy[:,:2] = np.mgrid[0:grid_size[0], 0:grid_size[1]].T.reshape(-1, 2)\\r\\n objp_yz[:,1:3] = np.mgrid[0:grid_size[1], 0:grid_size[2]].T.reshape(-1, 2)\\r\\n\\r\\n return objp_xy*dx, objp_yz*dx\",\n \"def build_topo(self):\\n super(EBGPTopo, self).build()\",\n \"def patterning(mesh, operator):\\n\\n\\n operators = {\\n 'conway_dual': conway_dual,\\n 'conway_join': conway_join,\\n 'conway_ambo': conway_ambo,\\n 'conway_kis': conway_kis,\\n 'conway_needle': conway_needle,\\n 'conway_zip': conway_zip,\\n 'conway_truncate': conway_truncate,\\n 'conway_ortho': conway_ortho,\\n 'conway_expand': conway_expand,\\n 'conway_gyro': conway_gyro,\\n 'conway_snub': conway_snub,\\n 'conway_meta': conway_meta,\\n 'conway_bevel': conway_bevel\\n }\\n\\n try:\\n operators[operator](mesh)\\n return mesh\\n except:\\n return mesh\",\n \"def plane_desc(self) -> str:\\n return self.planes[0].join(' ') + self.planes[1].join(' ') + self.planes[2].join(' ')\",\n \"def create_partition(mesh,polygons,enforce_exact=False):\",\n \"def MeshMachine(main):\\n\\n # oDesign definition\\n oDesign = main['ANSYS']['oDesign']\\n\\n # Data for the rotor mesh\\n RotorName = main['ANSYS']['Rotor&Magnets']['Name'][0]\\n RotorNumMaxElem = main['ANSYS']['Mesh']['Rotor']['NumMaxElem']\\n RotorMaxLength = main['ANSYS']['Mesh']['Rotor']['MaxLength']\\n\\n # Data for the magnets mesh\\n PMNames = main['ANSYS']['Rotor&Magnets']['PMNames']\\n PMNumMaxElem = main['ANSYS']['Mesh']['Magnets']['NumMaxElem']\\n PMMaxLength = main['ANSYS']['Mesh']['Magnets']['MaxLength']\\n\\n # Data for the Stator mesh\\n StatorName = main['ANSYS']['Stator']['Name']\\n StatorNormalDev = main['ANSYS']['Mesh']['Stator']['NormalDev']\\n StatorAspectRatio = main['ANSYS']['Mesh']['Stator']['AspectRatio']\\n\\n # Data for the Stator mesh\\n CoilNames = main['ANSYS']['Winding']['CoilNames']\\n WindingNumMaxElem = main['ANSYS']['Mesh']['Winding']['NumMaxElem']\\n WindingMaxLength = main['ANSYS']['Mesh']['Winding']['MaxLength']\\n\\n WindingName = []\\n for phase in CoilNames:\\n for direction in phase:\\n WindingName += direction\\n\\n # Creating meshes\\n oModule = oDesign.GetModule(\\\"MeshSetup\\\")\\n\\n # Rotor meshes\\n oModule.AssignLengthOp(\\n [\\n \\\"NAME:Rotor\\\",\\n \\\"RefineInside:=\\\", True,\\n \\\"Enabled:=\\\", True,\\n \\\"Objects:=\\\", [RotorName],\\n \\\"RestrictElem:=\\\", False,\\n \\\"NumMaxElem:=\\\", str(RotorNumMaxElem),\\n \\\"RestrictLength:=\\\", True,\\n \\\"MaxLength:=\\\", str(RotorMaxLength)+\\\"mm\\\"\\n ]\\n )\\n # Magnet meshes\\n oModule.AssignLengthOp(\\n [\\n \\\"NAME:Magnets\\\",\\n \\\"RefineInside:=\\\", True,\\n \\\"Enabled:=\\\", True,\\n \\\"Objects:=\\\", PMNames,\\n \\\"RestrictElem:=\\\", False,\\n \\\"NumMaxElem:=\\\", str(PMNumMaxElem),\\n \\\"RestrictLength:=\\\", True,\\n \\\"MaxLength:=\\\", str(PMMaxLength)+\\\"mm\\\"\\n ]\\n )\\n # Stator meshes\\n oModule.AssignTrueSurfOp(\\n [\\n \\\"NAME:Stator\\\",\\n \\\"Objects:=\\\", [StatorName],\\n \\\"CurvedSurfaceApproxChoice:=\\\", \\\"ManualSettings\\\",\\n \\\"SurfDevChoice:=\\\", 0,\\n \\\"NormalDevChoice:=\\\", 2,\\n \\\"NormalDev:=\\\", str(StatorNormalDev) + \\\"deg\\\",\\n \\\"AspectRatioChoice:=\\\", 2,\\n \\\"AspectRatio:=\\\", str(StatorAspectRatio)\\n ]\\n )\\n\\n # Coil meshes\\n oModule.AssignLengthOp(\\n [\\n \\\"NAME:Coils\\\",\\n \\\"RefineInside:=\\\"\\t, True,\\n \\\"Enabled:=\\\"\\t\\t, True,\\n \\\"Objects:=\\\"\\t\\t, WindingName,\\n \\\"RestrictElem:=\\\"\\t, False,\\n \\\"NumMaxElem:=\\\"\\t\\t, str(WindingNumMaxElem),\\n \\\"RestrictLength:=\\\"\\t, True,\\n \\\"MaxLength:=\\\"\\t\\t, str(WindingMaxLength) +\\\"mm\\\"\\n ]\\n )\\n\\n return main\",\n \"def convert_topology(src_filename, set_backbone=True, in_place=False, split_dir=None):\\n\\n # Grab unit cell description (should be on first few lines:\\n cryst = None\\n with open(src_filename) as src:\\n for line in src.readlines():\\n if line.startswith('CRYST1'):\\n cryst = line\\n break\\n\\n # Read in source PDB (DEShaw original format)\\n src_pdb = PdbStructure(open(src_filename))\\n atoms = list(src_pdb.iter_atoms())\\n topo = md.load(src_filename).top\\n\\n # Break into 4 segments\\n segment_list = ['C1', 'C2', 'C3', 'C4']\\n segment = {l:[] for l in segment_list}\\n for i in atoms: \\n segment[i.segment_id].append(i)\\n\\n # Set temperature factor (for gradual heating) \\n if set_backbone:\\n backbone = topo.select(\\\"backbone\\\")\\n for i in range(0, len(segment['C1'])):\\n if i in backbone:\\n segment['C1'][i].location.temperature_factor = 1.0\\n\\n # Resort water segements and alias \\\"pseu\\\" to OM (tip4p forcefield)\\n for wat in ['C2', 'C3']:\\n segment[wat] = sorted(segment[wat], key = lambda i: i.residue_number)\\n start_serial_num = min(segment[wat], key= lambda i: i.serial_number)\\n for i in range(0, len(segment[wat])):\\n newsn = i + start_serial_num.serial_number\\n segment[wat][i].serial_number = newsn\\n if segment[wat][i].get_name == 'pseu':\\n segment[wat][i].set_name_with_spaces(' OM ')\\n\\n # FOR RE-RUNNING THE PSFGEN\\n if split_dir is not None:\\n for s in segment_list:\\n with open(split_dir + '/%s.pdb' % s, 'w') as dest:\\n for atom in segment[s]:\\n _=dest.write(str(atom) + '\\\\n')\\n\\n # Writeout new file\\n if in_place:\\n dest = open(src_filename, 'w')\\n if cryst is not None:\\n dest.write(cryst)\\n for s in segment_list:\\n for atom in segment[s]:\\n _=dest.write(str(atom) + '\\\\n')\\n _=dest.write('END')\\n dest.close()\",\n \"def build_topology_vonneumann(config):\\n\\n width = config['VonNeumannTopology']['width']\\n height = config['VonNeumannTopology']['height']\\n periodic = config['VonNeumannTopology']['periodic']\\n assert width > 0 and height > 0\\n\\n graph = nx.grid_2d_graph(m=width, n=height, periodic=periodic)\\n graph = nx.convert_node_labels_to_integers(graph)\\n graph.name = \\\"VonNeumann Lattice: {r} rows, {c} columns\\\".format(r=height,\\n c=width)\\n\\n if periodic:\\n graph.name += ' with periodic boundaries'\\n\\n for node in graph.nodes_iter():\\n graph.node[node]['coords'] = divmod(node, width)\\n\\n return graph\",\n \"def createTopology(self):\\n\\n # find DAG root\\n dagRoot = None\\n for mote in self.motes:\\n if mote.id == 0:\\n mote.role_setDagRoot()\\n dagRoot = mote\\n assert dagRoot\\n\\n if self.settings.mobilityModel == 'RPGM':\\n # put DAG root at center of area\\n dagRoot.setLocation(x=SimEngine.SimEngine().targets[0][0],\\n y=SimEngine.SimEngine().targets[0][1])\\n else:\\n # put DAG root at center of area\\n dagRoot.setLocation(x=self.squareSide/2,\\n y=self.squareSide/2)\\n\\n # reposition each mote until it is connected\\n connectedMotes = [dagRoot]\\n motes_shuffled = copy.copy(self.motes)\\n random.shuffle(motes_shuffled) # shuffle them around\\n\\n # for mote in self.motes:\\n for mote in motes_shuffled:\\n stableNeighbors = []\\n if mote in connectedMotes:\\n continue\\n\\n connected = False\\n while not connected:\\n # pick a random location\\n # mote.setLocation(x=self.squareSide*random.random(),\\n # y=self.squareSide*random.random())\\n #\\n # mote.setLocation(\\n # x=self.settings.squareSide * random.random(),\\n # y=self.settings.squareSide * random.random()\\n # )\\n\\n newX = None\\n newY = None\\n # if no topology is not given, build the topology yourself\\n if SimEngine.SimEngine().ilp_topology is None:\\n newX = self.settings.squareSide * random.random()\\n newY = self.settings.squareSide * random.random()\\n else:\\n # if no topology is given, use that topology\\n newX = SimEngine.SimEngine().ilp_topology[str(mote.id)]['x']\\n newY = SimEngine.SimEngine().ilp_topology[str(mote.id)]['y']\\n\\n mote.setLocation(\\n x=newX,\\n y=newY\\n )\\n\\n numStableNeighbors = 0\\n stableNeighbors = []\\n\\n # tryAgain = False\\n # for cm in connectedMotes:\\n # rssi = self._computeRSSI(mote, cm)\\n # if rssi > -110:\\n # tryAgain = True\\n\\n # if not tryAgain:\\n # count number of neighbors with sufficient RSSI\\n for cm in connectedMotes:\\n\\n rssi = self._computeRSSI(mote, cm)\\n mote.setRSSI(cm, rssi)\\n cm.setRSSI(mote, rssi)\\n\\n # save the intial RSSI values for future use in the mobility models\\n mote.initialRSSI[cm] = rssi\\n cm.initialRSSI[mote] = rssi\\n\\n if self.settings.individualModulations == 1:\\n if self.rssiToPdr(rssi, modulation=Modulation.Modulation().minimalCellModulation[SimSettings.SimSettings().modulationConfig]) > self.settings.stableNeighborPDR:\\n # if rssi > Modulation.Modulation().modulationStableRSSI[Modulation.Modulation().minimalCellModulation[SimSettings.SimSettings().modulationConfig]]:\\n # print rssi\\n numStableNeighbors += 1\\n stableNeighbors.append(cm.id)\\n else:\\n if rssi > self.STABLE_RSSI:\\n # print rssi\\n numStableNeighbors += 1\\n\\n # make sure it is connected to at least STABLE_NEIGHBORS motes\\n # or connected to all the currently deployed motes when the number of deployed motes\\n # are smaller than STABLE_NEIGHBORS\\n if numStableNeighbors >= self.stable_neighbors or numStableNeighbors == len(connectedMotes):\\n print 'For mote {0}, stable neighbors {1}'.format(mote.id, stableNeighbors)\\n connected = True\\n\\n connectedMotes += [mote]\\n\\n # for each mote, compute PDR to each neighbors\\n for mote in self.motes:\\n for m in self.motes:\\n if mote == m:\\n continue\\n\\n # set the distance to all other motes\\n distance = math.sqrt((m.x - mote.x) ** 2 + (m.y - mote.y) ** 2)\\n m.set_distance(mote, distance)\\n mote.set_distance(m, distance)\\n # print 'mote %d to mote %d: %.4f' % (m.id, mote.id, distance)\\n if self.settings.individualModulations == 1:\\n rssi_value = mote.getRSSI(m)\\n # for modulationTmp in Modulation.Modulation().modulations:\\n # if self.settings.ilpfile is not None:\\n # ## I am not going to set this as this should be set by the ILP\\n # pass\\n # else:\\n # # if the rssi value is higher than the minimal signal value required for this neighbor, take that modulation\\n # # and compute the PDR using that modulation\\n # pass\\n # # if rssi_value > Modulation.Modulation().modulationStableRSSI[modulationTmp]:\\n # # pdr = self._computePDR(mote, m, modulation=modulationTmp)\\n # # mote.setPDR(m, pdr)\\n # # m.setPDR(mote, pdr)\\n # # mote.setModulation(m, modulationTmp)\\n # # m.setModulation(mote, modulationTmp)\\n else:\\n if mote.getRSSI(m) > mote.minRssi:\\n pdr = self._computePDR(mote, m)\\n mote.setPDR(m, pdr)\\n m.setPDR(mote, pdr)\",\n \"def surfaceRender(nodal_mesh, focus, ax=None):\\n\\t# If no axes were passed, generate new set of axes\\n\\tif not ax:\\n\\t\\tfig = mplt.figure()\\n\\t\\tax = fig.add_subplot(111, projection='3d')\\n\\n\\t# Sort the mesh by first 3 columns\\n\\tnodal_mesh = nodal_mesh[nodal_mesh[:, 0].argsort()]\\n\\tnodal_mesh = nodal_mesh[nodal_mesh[:, 1].argsort(kind='mergesort')]\\n\\tnodal_mesh = nodal_mesh[nodal_mesh[:, 2].argsort(kind='mergesort')]\\n\\t\\n\\t# Set up number of divisions and calculate e for each division (as a ratio)\\n\\tnum_div = 20\\n\\te = [i/num_div for i in range(num_div + 1)]\\n\\t# Convert angular values from degrees to radians\\n\\trads = math.pi/180\\n\\tnodal_mesh[:, 1:3] *= rads\\n\\t# Store the shapes and sizes of the mesh values\\n\\tm = nodal_mesh.shape[0]\\n\\tsize_nodal_nu = np.where(nodal_mesh[:, 2] == 0)[0].size\\n\\tsize_nodal_phi = m/size_nodal_nu\\n\\t# Get the mu and theta values from the mesh\\n\\tnodal_nu = nodal_mesh[:size_nodal_nu, 1]\\n\\tnodal_phi = nodal_mesh[::size_nodal_nu, 2]\\n\\t# Convert apex node from prolate to cartesian, then plot with scatter\\n\\tif min(nodal_nu) == 0:\\n\\t\\tx, y, z = mathhelper.prolate2cart(nodal_mesh[0, 0], nodal_mesh[0, 1], nodal_mesh[0, 2], focus)\\n\\t\\tax.scatter(z, y, -x)\\n\\t\\tstart_nu = 1\\n\\telse:\\n\\t\\tstart_nu = 0\\n\\t# Plot circumferential element boundaries\\n\\tfor i in range(start_nu, size_nodal_nu):\\n\\t\\tfor j in range(int(size_nodal_phi)):\\n\\t\\t\\t# Define nodal values for interpolation\\n\\t\\t\\tif j == size_nodal_phi-1:\\n\\t\\t\\t\\tind0 = i\\n\\t\\t\\t\\tp0 = 2*math.pi\\n\\t\\t\\telse:\\n\\t\\t\\t\\tind0 = (j+1)*size_nodal_nu + i\\n\\t\\t\\t\\tp0 = nodal_phi[j+1]\\n\\t\\t\\tind1 = (j)*size_nodal_nu + i\\n\\t\\t\\tp1 = nodal_phi[j]\\n\\t\\t\\t# Get mu and dM/dm1\\n\\t\\t\\tm0 = nodal_mesh[ind0, 0]\\n\\t\\t\\tdm0 = nodal_mesh[ind0, 3]\\n\\t\\t\\tm1 = nodal_mesh[ind1, 0]\\n\\t\\t\\tdm1 = nodal_mesh[ind1, 3]\\n\\t\\t\\t# Convert to cartesian\\n\\t\\t\\tn0x, n0y, n0z = mathhelper.prolate2cart(nodal_mesh[ind0, 0], nodal_mesh[ind0, 1], nodal_mesh[ind0, 2], focus)\\n\\t\\t\\t# Plot the node\\n\\t\\t\\tax.scatter(n0z, n0y, -n0x)\\n\\t\\t\\t# Plot the arc segments\\n\\t\\t\\tfor k in range(2, len(e)):\\n\\t\\t\\t\\t# Determine starting point to use\\n\\t\\t\\t\\tif k == 2:\\n\\t\\t\\t\\t\\tpt_x, pt_y, pt_z = n0x, n0y, n0z\\n\\t\\t\\t\\telse:\\n\\t\\t\\t\\t\\tpt_x, pt_y, pt_z = x_here, y_here, z_here\\n\\t\\t\\t\\t# Get lambda\\n\\t\\t\\t\\thm0 = 1 - 3*(e[k]**2) + 2*(e[k]**3)\\n\\t\\t\\t\\thdm0 = e[k]*(e[k] - 1)**2\\n\\t\\t\\t\\thm1 = (e[k]**2)*(3 - 2*e[k])\\n\\t\\t\\t\\thdm1 = (e[k]**2)*(e[k] - 1)\\n\\t\\t\\t\\tm = hm0 * m0 + hdm0 * dm0 + hm1 * m1 + hdm1 * dm1\\n\\t\\t\\t\\t# Get theta\\n\\t\\t\\t\\tp_here = p0 - e[k]*(p0 - p1)\\n\\t\\t\\t\\t# Convert to cartesian\\n\\t\\t\\t\\tx_here, y_here, z_here = mathhelper.prolate2cart(m, nodal_nu[i], p_here, focus)\\n\\t\\t\\t\\t# Create vectors\\n\\t\\t\\t\\tx = np.append(pt_x, x_here)\\n\\t\\t\\t\\ty = np.append(pt_y, y_here)\\n\\t\\t\\t\\tz = np.append(pt_z, z_here)\\n\\t\\t\\t\\t# Plot segments\\n\\t\\t\\t\\tax.plot(z, y, -x, 'k-.')\\n\\t# Plot longitudinal element boundaries\\n\\tfor i in range(int(size_nodal_phi)):\\n\\t\\tfor j in range(size_nodal_nu-1):\\n\\t\\t\\t# Define nodal values needeed for interpolation\\n\\t\\t\\tind0 = i*size_nodal_nu + j\\n\\t\\t\\tind1 = ind0 + 1\\n\\t\\t\\tn0 = nodal_nu[j]\\n\\t\\t\\tn1 = nodal_nu[j+1]\\n\\t\\t\\t# Get lambda and dL/de2\\n\\t\\t\\tm0 = nodal_mesh[ind0, 0]\\n\\t\\t\\tdm0 = nodal_mesh[ind0, 4]\\n\\t\\t\\tm1 = nodal_mesh[ind1, 0]\\n\\t\\t\\tdm1 = nodal_mesh[ind1, 4]\\n\\t\\t\\t# Convert nodal points to cartesian\\n\\t\\t\\tn0x, n0y, n0z = mathhelper.prolate2cart(nodal_mesh[ind0, 0], nodal_mesh[ind0, 1], nodal_mesh[ind0, 2], focus)\\n\\t\\t\\t# Plot arc\\n\\t\\t\\tfor k in range(2, len(e)):\\n\\t\\t\\t\\t# Determine point to use\\n\\t\\t\\t\\tif k == 2:\\n\\t\\t\\t\\t\\tpt_x, pt_y, pt_z = n0x, n0y, n0z\\n\\t\\t\\t\\telse:\\n\\t\\t\\t\\t\\tpt_x, pt_y, pt_z = x_here, y_here, z_here\\n\\t\\t\\t\\t# Get lambda\\n\\t\\t\\t\\thm0 = 1 - 3*(e[k]**2) + 2*(e[k]**3)\\n\\t\\t\\t\\thdm0 = e[k]*(e[k] - 1)**2\\n\\t\\t\\t\\thm1 = (e[k]**2)*(3 - 2*e[k])\\n\\t\\t\\t\\thdm1 = (e[k]**2)*(e[k] - 1)\\n\\t\\t\\t\\tm = hm0 * m0 + hdm0 * dm0 + hm1 * m1 + hdm1 * dm1\\n\\t\\t\\t\\t# Get nu\\n\\t\\t\\t\\tn_here = n0 + e[k]*(n1-n0)\\n\\t\\t\\t\\t# Convert to cartesian\\n\\t\\t\\t\\tx_here, y_here, z_here = mathhelper.prolate2cart(m, n_here, nodal_phi[i], focus)\\n\\t\\t\\t\\t# Append the vectors for plotting\\n\\t\\t\\t\\tx = np.append(pt_x, x_here)\\n\\t\\t\\t\\ty = np.append(pt_y, y_here)\\n\\t\\t\\t\\tz = np.append(pt_z, z_here)\\n\\t\\t\\t\\t# Plot the segment\\n\\t\\t\\t\\tax.plot(z, y, -x, 'k-.')\\n\\t\\t\\t\\t\\n\\treturn(ax)\",\n \"def planes_3d(self, quantity, xplane, yplane):\\n xplane = int(xplane)\\n yplane = int(yplane)\\n # Get the scalar values\\n # Get the data on the plane with a fixed x value. These means we'll\\n # have changing (y, z) points\\n xdata = self.get_plane(quantity, 'yz', xplane)\\n # z first cuz we want y to be changing before z to correspond with the\\n # way numpy flattens arrays. Note this means y points will be in the\\n # 2nd column\\n xplanepoints = np.array(list(itertools.product(self.Z, self.Y)))\\n xdata = xdata.flatten()\\n xplanexval = np.array(list(itertools.repeat(x[xplane], len(xdata))))\\n xplanedata = np.zeros((xplanepoints.shape[0], 4))\\n xplanedata[:, 0] = xplanexval\\n xplanedata[:, 1] = xplanepoints[:, 1]\\n xplanedata[:, 2] = xplanepoints[:, 0]\\n xplanedata[:, 3] = xdata\\n # Same procedure for fixed y plane\\n ydata = self.get_plane(quantity, 'xz', yplane)\\n yplanepoints = np.array(list(itertools.product(z, x)))\\n ydata = ydata.flatten()\\n yplaneyval = np.array(list(itertools.repeat(y[yplane], len(ydata))))\\n yplanedata = np.zeros((yplanepoints.shape[0], 4))\\n yplanedata[:, 0] = yplanepoints[:, 1]\\n yplanedata[:, 1] = yplaneyval\\n yplanedata[:, 2] = yplanepoints[:, 0]\\n yplanedata[:, 3] = ydata\\n labels = ('X [um]', 'Y [um]', 'Z [um]', quantity)\\n # Now stack them vertically and plot!\\n all_data = np.vstack((xplanedata, yplanedata))\\n self.scatter3d(all_data[:, 0], all_data[:, 1], all_data[:, 2],\\n all_data[:, 3], labels, 'planes_3d')\",\n \"def RoadRiverTab():\\n\\n # Main layout\\n mainTab = cmds.columnLayout(adjustableColumn=True, columnAttach=('both', 20))\\n \\n ### Geo parameters\\n cmds.separator(height=10, style=\\\"none\\\")\\n cmds.text(label=\\\"Generate road and rivers:\\\", align=\\\"left\\\")\\n RoadRiverTab.roadWidth = cmds.floatSliderGrp(label=\\\"Road Width\\\", field=True, value=1, min=.01, max=100)\\n RoadRiverTab.roadQuality = cmds.intSliderGrp(label=\\\"Curve Quality\\\", field=True, value=20, min=2, max=100)\\n\\n ### Choose which king of geo\\n cmds.separator(height=5, style=\\\"none\\\")\\n cmds.rowLayout(numberOfColumns=3, adjustableColumn=2)\\n cmds.button(label='Create Road', width=200, command=buildRoad)\\n cmds.separator(style=\\\"none\\\")\\n cmds.button(label=\\\"Create River\\\", width=200, command=buildRiver)\\n\\n cmds.setParent('..')\\n cmds.setParent('..')\\n\\n return mainTab\",\n \"def create_spacecraft_geometry():\\r\\n\\r\\n bounds_lower = [3, 7, 33]\\r\\n funcs_lower = [0, lambda y: y ** 1.5, 0]\\r\\n\\r\\n bounds_upper = None\\r\\n funcs_upper = 100\\r\\n\\r\\n x_max = 10\\r\\n x_min = 0\\r\\n resolution = 200\\r\\n\\r\\n spacecraft = Geometry(x_max, x_min, resolution,\\r\\n bounds_upper, funcs_upper,\\r\\n bounds_lower, funcs_lower)\\r\\n\\r\\n return spacecraft\",\n \"def shapebuild_PlaneXOY(*args):\\n return _ShapeBuild.shapebuild_PlaneXOY(*args)\",\n \"def __init__(self, spread, depth, bandwidth, delay, loss, fpga, fpga_bandwidth=None, fpga_delay=None,\\n fpga_loss=None, poisson=None):\\n logger = logging.getLogger(__name__)\\n\\n # Initialize topology #\\n Topo.__init__(self)\\n\\n # Setup parameters\\n fpga_bandwidth = bandwidth if fpga_bandwidth is None else fpga_bandwidth\\n fpga_delay = delay if fpga_delay is None else halve_delay(fpga_delay)\\n fpga_loss = loss * 2 if fpga_loss is None else fpga_loss\\n\\n if poisson:\\n link_opts = dict(bw=bandwidth, delay=get_poisson_delay(delay), loss=loss, use_htb=True)\\n fpga_link_opts = dict(bw=fpga_bandwidth, delay=get_poisson_delay(fpga_delay),\\n loss=fpga_loss, use_htb=True)\\n else:\\n link_opts = dict(bw=bandwidth, delay=delay, loss=loss, use_htb=True)\\n fpga_link_opts = dict(bw=fpga_bandwidth, delay=fpga_delay, loss=fpga_loss, use_htb=True)\\n cloud_link_opts = dict(bw=1000, delay='0ms', loss=0, use_htb=True)\\n\\n # Add hosts and switches #\\n\\n # switch naming convention:\\n # s[level][switch_number]\\n\\n switches = [[None for _ in range(spread ** (depth - 1))] for _ in range(depth - 1)]\\n hosts = [None for _ in range(spread ** (depth - 1))]\\n\\n for i in range(depth):\\n for j in range(spread ** i):\\n if i == (depth - 1):\\n hosts[j] = self.addHost('h' + str(j))\\n else:\\n sw_name = 's' + str(i) + str(j)\\n switches[i][j] = self.addSwitch(sw_name)\\n if fpga is not None and fpga == i:\\n # Create host to serve as FPGA in switch\\n # Will have one link to the relevant FPGA\\n # The link will have the bandwidth and loss specified by the user, and half\\n # the delay\\n # These parameters are as if they were caused by the FPGA, rather than a\\n # link\\n # As a result, latency is halved since it will essentially be doubled by the\\n # packet flowing in\\n # and out of the host\\n self.addHost('f{}'.format(j))\\n self.addLink(sw_name, 'f{}'.format(j), **fpga_link_opts)\\n\\n # Add host to serve as cloud\\n # Will have one high bandwidth, 0 latency link to root switch\\n self.addHost('cloud')\\n self.addLink(switches[0][0], 'cloud', **cloud_link_opts)\\n\\n # Add links #\\n\\n for i, row in enumerate(switches):\\n for j, switch in enumerate(row):\\n if switch is None:\\n break\\n if i == (depth - 2):\\n for k in range(spread):\\n # add a link between the current switch, and all hosts\\n # directly beneath it.\\n # (spread * j) + k will get all the appropriate hosts\\n logger.debug(\\\"Adding standard link from switch[{}][{}] to \\\"\\n \\\"host[{}]\\\".format(i, j, (spread * j) + k))\\n self.addLink(switch, hosts[(spread * j) + k], **link_opts)\\n\\n else:\\n for k in range(spread):\\n # add a link between the current switch, and all\\n # switches directly beneath it.\\n # i + 1 refers to 1 level deeper in the tree, and\\n # (spread * j) + k will get all the appropriate child\\n # switches on that level.\\n logger.debug(\\\"Adding standard link from switch[{}][{}] to \\\"\\n \\\"switch[{}][{}]\\\".format(i, j, i + 1, (spread * j) + k))\\n self.addLink(switch, switches[i + 1][(spread * j) + k], **link_opts)\",\n \"def set_topology(self, topo):\\n self.topo = topo\",\n \"def __init__(self, mesh, out_dir='./results/', use_periodic=False):\\n s = \\\"::: INITIALIZING 2D MODEL :::\\\"\\n print_text(s, cls=self)\\n \\n Model.__init__(self, mesh, out_dir, use_periodic)\",\n \"def __init__(self, planes, cosmology):\\r\\n self.planes = planes\\r\\n self.plane_redshifts = [plane.redshift for plane in planes]\\r\\n self.cosmology = cosmology\",\n \"def parse(cls, vmf_file: VMF, tree: Keyvalues) -> 'Side':\\n # planes = \\\"(x1 y1 z1) (x2 y2 z2) (x3 y3 z3)\\\"\\n verts = tree[\\\"plane\\\", \\\"(0 0 0) (0 0 0) (0 0 0)\\\"][1:-1].split(\\\") (\\\")\\n if len(verts) != 3:\\n raise ValueError('Wrong number of solid planes in \\\"' +\\n tree['plane', ''] +\\n '\\\"')\\n planes = [\\n Vec.from_str(verts[0]),\\n Vec.from_str(verts[1]),\\n Vec.from_str(verts[2]),\\n ]\\n\\n side: Side = cls(\\n vmf_file,\\n planes,\\n tree.int('id', -1),\\n tree.int('lightmapscale', 16),\\n tree.int('smoothing_groups'),\\n tree['material', ''],\\n tree.float('rotation'),\\n UVAxis.parse(tree['uaxis', '[0 1 0 0] 0.25']),\\n UVAxis.parse(tree['vaxis', '[0 0 -1 0] 0.25']),\\n )\\n\\n try:\\n disp_tree = tree.find_key('dispinfo')\\n except LookupError: # Not a displacement.\\n return side\\n\\n # Deal with displacements.\\n disp_power = disp_tree.int('power', 4)\\n if disp_power in (0, 1, 2, 3, 4):\\n side.disp_power = disp_power # type: ignore\\n else:\\n raise ValueError(f'Invalid displacement power {disp_power}!')\\n side.disp_pos = disp_tree.vec('startposition')\\n side.disp_elevation = disp_tree.float('elevation')\\n disp_flag_ind = disp_tree.int('flags')\\n if 0 <= disp_flag_ind <= 16:\\n side.disp_flags = _DISP_FLAG_TO_COLL[disp_flag_ind]\\n else:\\n raise ValueError(f'Invalid displacement flags {disp_flag_ind} in side {side.id}!')\\n if disp_tree.bool('subdiv'):\\n side.disp_flags |= DispFlag.SUBDIV\\n\\n # This always has a key of '10', with 10 '-1's...\\n vert_key = disp_tree.find_key('allowed_verts')\\n allowed_vert = Array('i', map(int, vert_key['10'].split()))\\n if len(allowed_vert) != 10:\\n raise ValueError(\\n f'Displacement allowed_verts in side {side.id} '\\n f'must be 10 long!'\\n )\\n side.disp_allowed_vert = allowed_vert\\n\\n size = side.disp_size\\n side._disp_verts = [\\n DispVertex(x, y)\\n for y in range(size)\\n for x in range(size)\\n ]\\n # Parse all the rows..\\n side._parse_disp_vecrow(disp_tree, 'normals', 'normal')\\n side._parse_disp_vecrow(disp_tree, 'offsets', 'offset')\\n side._parse_disp_vecrow(disp_tree, 'offset_normals', 'offset_norm')\\n\\n for y, row in side._iter_disp_row(disp_tree, 'alphas', size):\\n try:\\n for x, alpha in enumerate(row):\\n side._disp_verts[y * size + x].alpha = float(alpha)\\n except ValueError as exc:\\n raise ValueError(\\n f'Displacement array for alpha in side {side.id}, '\\n f'row {y} had invalid number: {exc.args[0]}'\\n ) from None\\n\\n for y, row in side._iter_disp_row(disp_tree, 'distances', size):\\n try:\\n for x, alpha in enumerate(row):\\n side._disp_verts[y * size + x].distance = float(alpha)\\n except ValueError as exc:\\n raise ValueError(\\n f'Displacement array for distances in side {side.id}, '\\n f'row {y} had invalid number: {exc.args[0]}'\\n ) from None\\n\\n # Not the same, 1 less row and column since it's per-quad.\\n tri_tags_count = 2 ** disp_power\\n for y, row in side._iter_disp_row(disp_tree, 'triangle_tags', 2 * tri_tags_count):\\n try:\\n for x in range(tri_tags_count):\\n vert = side._disp_verts[y * size + x]\\n vert.triangle_a = TriangleTag(int(row[2 * x]))\\n vert.triangle_b = TriangleTag(int(row[2 * x + 1]))\\n except ValueError as exc:\\n raise ValueError(\\n f'Displacement array for triangle tags in side {side.id}, '\\n f'row {y} had invalid number: {exc.args[0]}'\\n ) from None\\n\\n if 'multiblend' not in disp_tree:\\n return side\\n # Else: Parse multiblend too.\\n # First initialise this list.\\n for vert in side._disp_verts:\\n vert.multi_colors = [Vec(1, 1, 1), Vec(1, 1, 1), Vec(1, 1, 1), Vec(1, 1, 1)]\\n for i in range(4):\\n side._parse_disp_vecrow(disp_tree, 'multiblend_color_' + str(i), i)\\n\\n for y, split in side._iter_disp_row(disp_tree, 'multiblend', 4 * size):\\n try:\\n for x in range(size):\\n side._disp_verts[y * size + x].multi_blend = Vec4(\\n float(split[4*x]),\\n float(split[4*x + 1]),\\n float(split[4*x + 2]),\\n float(split[4*x + 3]),\\n )\\n except ValueError as exc:\\n raise ValueError(\\n f'Displacement array for multiblend in side {side.id}, '\\n f'row {y} had invalid number: {exc.args[0]}'\\n ) from None\\n\\n for y, split in side._iter_disp_row(disp_tree, 'alphablend', 4 * size):\\n try:\\n for x in range(size):\\n side._disp_verts[y * size + x].multi_alpha = Vec4(\\n float(split[4*x]),\\n float(split[4*x + 1]),\\n float(split[4*x + 2]),\\n float(split[4*x + 3]),\\n )\\n except ValueError as exc:\\n raise ValueError(\\n f'Displacement array for multiblend in side {side.id}, '\\n f'row {y} had invalid number: {exc.args[0]}'\\n ) from None\\n return side\",\n \"def __init__(self, n=1, delay='1ms', z=1, bw=1, cpu=.1, max_queue_size=None, **params):\\n\\n # Initialize topo\\n Topo.__init__(self, **params)\\n\\n #TODO: Create your Dynamic Mininet Topology here!\\n #NOTE: You MUST label switches as s1, s2, ... sz\\n #NOTE: You MUST label hosts as h1-1, h1-2, ... hz-n \\n #HINT: Use a loop to construct the topology in pieces.\",\n \"def is_intersection_plane_plane(plane1, plane2, epsilon=1e-6):\\n # check for parallelity of planes\\n if abs(dot_vectors(plane1[1], plane2[1])) > 1 - epsilon:\\n return False\\n return True\",\n \"def __getPlaneName(self):\\n item = self._item()\\n planeNormal = item.getNormal() if item is not None else None\\n\\n for name, normal in self._PLANES.items():\\n if numpy.array_equal(planeNormal, normal):\\n return name\\n return '-'\",\n \"def make_fake_topology(density=.02, lower_left=ORIGIN, upper_right=Point2D(30, 30), max_z=None):\\n styles = ['cone', 'pyramid']\\n if not max_z:\\n biggest_axis = max(upper_right.x - lower_left.x, upper_right.y - lower_left.y)\\n max_z = round(biggest_axis / 1.2) # Just need a rule here. how about max height is half width?\\n\\n factory = TopologyFactory(lower_left, upper_right)\\n number_of_seeds = round(factory.cell_count * density) # how many seeds depends on density and area\\n\\n # Produce roughly (due to rounding) the number of seeds. We will perform multiple passes,\\n # generating random x,y,z values and adding them as peaks on the map. With each pass, the\\n # range of z values tends to get smaller (though there is randomness).\\n # Also, each pass has a random steepness value, which is essentially the step height if we\\n # are walking up an Aztec pyramid\\n seeds_per_pass = 5 # a decent-looking value\\n passes = round(number_of_seeds // seeds_per_pass)\\n\\n for i in range(1, passes + 1):\\n # get a z-range for this pass\\n max_z_pass = round(max_z / i)\\n min_z_pass = max_z_pass // 2\\n\\n seeds = factory._random_points_3d(seeds_per_pass, min_z_pass, max_z_pass)\\n steepness = random.uniform(1, 4) # the resulting step height between adjacent cells\\n factory._add_peaks_from_seed_points3d(seeds, random.choice(styles), steepness=steepness)\\n return factory._tm\",\n \"def __init__(self, radius, dimensions, index=N_HPFS):\\n _OpticalElement.__init__(self, 'itop mirror', index)\\n self.add_boundary(SphericalSurface(\\n [0., 0., radius - dimensions[2]], float(radius), name='-z',\\n reflective=True))\\n self.add_boundary(PlaneSurface(\\n [0., 0., 1.], [0., 0., 0.], name='+z'))\\n self.add_boundary(PlaneSurface(\\n [0., 1., 0.], [0., dimensions[1]/2., 0.], name='+y'))\\n self.add_boundary(PlaneSurface(\\n [0., -1., 0.], [0., -dimensions[1]/2., 0.], name='-y'))\\n self.add_boundary(PlaneSurface(\\n [1., 0., 0.], [dimensions[0]/2., 0., 0.], name='+x'))\\n self.add_boundary(PlaneSurface(\\n [-1., 0., 0.], [-dimensions[0]/2., 0., 0.], name='-x'))\",\n \"def __init__(self, file_data, x0, x1, y0, y1, scan_dir=0):\\n\\n x0 = self.nm2pnt(x0, file_data)\\n x1 = self.nm2pnt(x1, file_data)\\n y0 = self.nm2pnt(y0, file_data, axis='y')\\n y1 = self.nm2pnt(y1, file_data, axis='y')\\n\\n self.topo_info = file_data[scan_dir].info\\n self.x_res = self.topo_info['xres']\\n self.y_res = self.topo_info['yres']\\n\\n self.x_range = np.arange(0, self.x_res, 1)\\n self.y_range = np.arange(0, self.y_res, 1)\\n\\n self.topo_data = file_data[scan_dir].data\\n\\n self.param_init = [1, 1, 1]\\n\\n self.topo_plane_lsq = leastsq(self.topo_plane_residuals, self.param_init,\\n args=(self.topo_data, x0, x1, y0, y1))[0]\\n self.topo_plane_fit = self.topo_plane_paramEval(self.topo_plane_lsq)\\n self.topo_data_flattened = self.topo_data - self.topo_plane_fit\\n self.topo_data_flattened = self.topo_data_flattened - np.amin(self.topo_data_flattened)\\n\\n self.get_data()\",\n \"def get_pipeline_topology(account_name: Optional[str] = None,\\n pipeline_topology_name: Optional[str] = None,\\n resource_group_name: Optional[str] = None,\\n opts: Optional[pulumi.InvokeOptions] = None) -> AwaitableGetPipelineTopologyResult:\\n __args__ = dict()\\n __args__['accountName'] = account_name\\n __args__['pipelineTopologyName'] = pipeline_topology_name\\n __args__['resourceGroupName'] = resource_group_name\\n opts = pulumi.InvokeOptions.merge(_utilities.get_invoke_opts_defaults(), opts)\\n __ret__ = pulumi.runtime.invoke('azure-native:videoanalyzer/v20211101preview:getPipelineTopology', __args__, opts=opts, typ=GetPipelineTopologyResult).value\\n\\n return AwaitableGetPipelineTopologyResult(\\n description=pulumi.get(__ret__, 'description'),\\n id=pulumi.get(__ret__, 'id'),\\n kind=pulumi.get(__ret__, 'kind'),\\n name=pulumi.get(__ret__, 'name'),\\n parameters=pulumi.get(__ret__, 'parameters'),\\n processors=pulumi.get(__ret__, 'processors'),\\n sinks=pulumi.get(__ret__, 'sinks'),\\n sku=pulumi.get(__ret__, 'sku'),\\n sources=pulumi.get(__ret__, 'sources'),\\n system_data=pulumi.get(__ret__, 'system_data'),\\n type=pulumi.get(__ret__, 'type'))\",\n \"def polyPlanarProjection(*args, projectionHorizontalSweep: Union[float, bool]=0.0, seamCorrect:\\n bool=True, caching: bool=True, constructionHistory: bool=True,\\n createNewMap: bool=True, imageCenter: Union[List[float, float],\\n bool]=None, imageCenterX: Union[float, bool]=0.0, imageCenterY:\\n Union[float, bool]=0.0, imageScale: Union[List[float, float],\\n bool]=None, imageScaleU: Union[float, bool]=0.0, imageScaleV:\\n Union[float, bool]=0.0, insertBeforeDeformers: bool=True,\\n keepImageRatio: bool=True, mapDirection: AnyStr=\\\"\\\", name: AnyStr=\\\"\\\",\\n nodeState: Union[int, bool]=0, perInstance: bool=True,\\n projectionCenter: Union[List[float, float, float], bool]=None,\\n projectionCenterX: Union[float, bool]=0.0, projectionCenterY:\\n Union[float, bool]=0.0, projectionCenterZ: Union[float, bool]=0.0,\\n projectionHeight: Union[float, bool]=0.0, projectionScale:\\n Union[List[float, float], bool]=None, rotate: Union[List[float, float,\\n float], bool]=None, rotateX: Union[float, bool]=0.0, rotateY:\\n Union[float, bool]=0.0, rotateZ: Union[float, bool]=0.0,\\n rotationAngle: Union[float, bool]=0.0, smartFit: bool=True,\\n worldSpace: bool=True, q=True, query=True, e=True, edit=True,\\n **kwargs)->Union[AnyStr, Any]:\\n pass\",\n \"def xyplane(draw, r, x, shift = np.array([1000, 1000, 0, 0]), scale = 300):\\n extent = 2.8\\n pln = np.array(\\n [\\n [x,-extent,0],\\n [x,extent,0],\\n [x,extent,extent*2],\\n [x,-extent,extent*2]\\n ]\\n )\\n pln = np.dot(pln,np.transpose(r))\\n pln = pln * scale + shift[:3]\\n draw.polygon([(pln[0][0],pln[0][1]),(pln[1][0],pln[1][1]),(pln[2][0],pln[2][1]),(pln[3][0],pln[3][1])], (0,102,255,70))\",\n \"def plot_phase_plane(self , x_axis = 0 , y_axis = 1 ):\\n\\n pp = phaseanalysis.PhasePlot( self , x_axis , y_axis )\\n \\n pp.plot()\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5991863","0.5981517","0.59631455","0.5854901","0.58076966","0.5753462","0.56212896","0.5567714","0.55646545","0.55594105","0.55340147","0.551879","0.54897666","0.5471865","0.5409033","0.53919226","0.5324614","0.53135514","0.5296597","0.5288494","0.52642614","0.5252399","0.52334726","0.521043","0.5176542","0.5149132","0.5137906","0.5127393","0.51065546","0.5097846","0.5090994","0.5081946","0.50530857","0.5046951","0.50436246","0.5036304","0.50169307","0.50100595","0.5008374","0.49979436","0.4992863","0.49871722","0.49718532","0.49596983","0.4947392","0.4947156","0.49399287","0.49352446","0.49317822","0.4925205","0.49207312","0.49185026","0.48913085","0.4882188","0.48687202","0.48676476","0.48610485","0.48598954","0.4855208","0.48507613","0.48436835","0.4841052","0.48317778","0.48186287","0.4815154","0.48143542","0.4808101","0.48024732","0.47922146","0.4783738","0.47804233","0.4778059","0.47512004","0.4751039","0.47466877","0.4734245","0.47161657","0.47142956","0.47028878","0.46984896","0.4694205","0.46922997","0.46880665","0.46682236","0.466177","0.46607506","0.46601704","0.46575525","0.4657336","0.46494013","0.46479908","0.46439198","0.4643234","0.46400487","0.46156704","0.460865","0.4603622","0.4599509","0.45985046","0.45955977"],"string":"[\n \"0.5991863\",\n \"0.5981517\",\n \"0.59631455\",\n \"0.5854901\",\n \"0.58076966\",\n \"0.5753462\",\n \"0.56212896\",\n \"0.5567714\",\n \"0.55646545\",\n \"0.55594105\",\n \"0.55340147\",\n \"0.551879\",\n \"0.54897666\",\n \"0.5471865\",\n \"0.5409033\",\n \"0.53919226\",\n \"0.5324614\",\n \"0.53135514\",\n \"0.5296597\",\n \"0.5288494\",\n \"0.52642614\",\n \"0.5252399\",\n \"0.52334726\",\n \"0.521043\",\n \"0.5176542\",\n \"0.5149132\",\n \"0.5137906\",\n \"0.5127393\",\n \"0.51065546\",\n \"0.5097846\",\n \"0.5090994\",\n \"0.5081946\",\n \"0.50530857\",\n \"0.5046951\",\n \"0.50436246\",\n \"0.5036304\",\n \"0.50169307\",\n \"0.50100595\",\n \"0.5008374\",\n \"0.49979436\",\n \"0.4992863\",\n \"0.49871722\",\n \"0.49718532\",\n \"0.49596983\",\n \"0.4947392\",\n \"0.4947156\",\n \"0.49399287\",\n \"0.49352446\",\n \"0.49317822\",\n \"0.4925205\",\n \"0.49207312\",\n \"0.49185026\",\n \"0.48913085\",\n \"0.4882188\",\n \"0.48687202\",\n \"0.48676476\",\n \"0.48610485\",\n \"0.48598954\",\n \"0.4855208\",\n \"0.48507613\",\n \"0.48436835\",\n \"0.4841052\",\n \"0.48317778\",\n \"0.48186287\",\n \"0.4815154\",\n \"0.48143542\",\n \"0.4808101\",\n \"0.48024732\",\n \"0.47922146\",\n \"0.4783738\",\n \"0.47804233\",\n \"0.4778059\",\n \"0.47512004\",\n \"0.4751039\",\n \"0.47466877\",\n \"0.4734245\",\n \"0.47161657\",\n \"0.47142956\",\n \"0.47028878\",\n \"0.46984896\",\n \"0.4694205\",\n \"0.46922997\",\n \"0.46880665\",\n \"0.46682236\",\n \"0.466177\",\n \"0.46607506\",\n \"0.46601704\",\n \"0.46575525\",\n \"0.4657336\",\n \"0.46494013\",\n \"0.46479908\",\n \"0.46439198\",\n \"0.4643234\",\n \"0.46400487\",\n \"0.46156704\",\n \"0.460865\",\n \"0.4603622\",\n \"0.4599509\",\n \"0.45985046\",\n \"0.45955977\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.59658796"},"document_rank":{"kind":"string","value":"2"}}},{"rowIdx":6196,"cells":{"query":{"kind":"string","value":"Comparison of two topologies. Two topos are equal if they have the same mesh, shape and domain."},"document":{"kind":"string","value":"def __eq__(self, other):\n if self.__class__ != other.__class__:\n return False\n return self.mesh == other.mesh and \\\n npw.equal(self.shape, other.shape).all() and \\\n self.domain == other.domain"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def have_same_topology(first_mesh, second_mesh):\n return attr_has_same_shape(first_mesh, second_mesh, \"v\") and attr_is_equal(\n first_mesh, second_mesh, \"f\"\n )","def equivalent(kls, first, second):\n if first.empty() and second.empty():\n return True\n elif first.vertices.shape[0] != second.vertices.shape[0]:\n return False\n elif first.edges.shape[0] != second.edges.shape[0]:\n return False\n\n EPSILON = 1e-7\n\n vertex1, ct1 = np.unique(first.vertices, axis=0, return_counts=True)\n vertex2, ct2 = np.unique(second.vertices, axis=0, return_counts=True)\n \n vertex_match = np.all(np.abs(vertex1 - vertex2) < EPSILON)\n ct_match = np.all(ct1 == ct2)\n if not (vertex_match and ct_match):\n return False\n\n g1 = nx.Graph()\n g1.add_edges_from(first.edges)\n g2 = nx.Graph()\n g2.add_edges_from(second.edges)\n edges_match = nx.is_isomorphic(g1, g2)\n del g1 \n del g2\n\n if not edges_match:\n return False\n\n second_verts = {}\n for i, vert in enumerate(second.vertices):\n second_verts[tuple(vert)] = i\n \n attrs = [ attr['id'] for attr in first.extra_attributes ]\n for attr in attrs:\n buf1 = getattr(first, attr)\n buf2 = getattr(second, attr)\n if len(buf1) != len(buf2):\n return False\n\n for i in range(len(buf1)):\n i2 = second_verts[tuple(first.vertices[i])]\n if buf1[i] != buf2[i2]:\n return False\n\n return True","def compare_topology(tree1, tree2):\n n2p1, n2p2 = ({node.name: node.parent.name\n for node in tree.traverse() if not node.is_root()}\n for tree in (tree1, tree2))\n return n2p1 == n2p2","def _shape_compare(shape1, shape2):\n if len(shape1) != len(shape2):\n return False\n for s1, s2 in zip(shape1, shape2):\n if s1 != s2:\n return False\n return True","def __eq__(self, other) -> bool:\n if not isinstance(other, self.__class__):\n return False\n\n if self.number_of_nodes() != other.number_of_nodes():\n return False\n if self.number_of_edges() != other.number_of_edges():\n return False\n\n if list(self.nodes) != list(other.nodes):\n return False\n\n # Compare node data.\n for i in self.nodes:\n # We may want to exclude the 'name' attribute from comparisons, assuming\n # it has no logical meaning.\n if self.nodes[i] != other.nodes[i]:\n return False\n\n if list(self.edges) != list(other.edges):\n return False\n\n for i, j in self.edges:\n # Compare edge data.\n if self.edges[i, j] != other.edges[i, j]:\n return False\n\n return True","def compareGrids(grid1, grid2):\n if axis_utils.areAxesIdentical(grid1.getLatitude(),\n grid2.getLatitude(), check_id=False)==False:\n return False\n if axis_utils.areAxesIdentical(grid1.getLongitude(),\n grid2.getLongitude(), check_id=False)==False:\n return False\n return True","def __eq__(self, other):\n return self.position.data == other.position.data and \\\n self.velocity.data == other.velocity.data","def __eq__(self, other) -> bool:\n if other is None or not isinstance(other, Graph):\n name = other.name if other else None\n print(f'{name} is not a Graph object.')\n return False\n\n def match(op1: Operator, op2: Operator) -> bool:\n if not op1.equals(op2):\n print(f'{op1.name} is different.')\n return False\n\n # check input nodes and further\n for i1, i2 in zip(op1.input_ops.values(), op2.input_ops.values()):\n if not match(i1, i2):\n return False\n return True\n\n for o1, o2 in zip(self.get_outputs(), other.get_outputs()):\n if not match(o1, o2):\n return False\n return True","def __eq__(self, other):\n return np.all(self.grid == other.grid) and np.all(self.pos == other.pos)","def proj_is_same(p1, p2):\n if has_gdal:\n # this is more robust, but gdal is a pain\n s1 = osr.SpatialReference()\n s1.ImportFromProj4(p1.srs)\n s2 = osr.SpatialReference()\n s2.ImportFromProj4(p2.srs)\n return s1.IsSame(s2) == 1 # IsSame returns 1 or 0\n else:\n # at least we can try to sort it\n p1 = '+'.join(sorted(p1.srs.split('+')))\n p2 = '+'.join(sorted(p2.srs.split('+')))\n return p1 == p2","def compare(self, other, enforce_mask=False, enforce_grid=False,\n enforce_area=False, enforce_aream=False, enforce_all=False):\n eps_mask = 1.0e-6\n eps_grid = 1.0e-2\n eps_area = 1.0e-1\n\n # Do a global gather to create a non-distributed attribute vector\n debugPrint( \"self.lgrid:\\n\",self.lgrid )\n debugPrint( \"other.lgrid:\\n\",other.lgrid )\n gGrid1 = attributevector.AttributeVector(self.ifields, self.rfields, self.lsize())\n gGrid1.initv(self.lgrid, self.lgrid.lsize())\n gGrid1.gather(self.lgrid, self.gsMap, comm.world_pe0, comm.component_pid, comm.local_comm) \n gGrid2 = attributevector.AttributeVector(other.ifields, other.rfields, other.lsize())\n gGrid2.initv( other.lgrid, other.lgrid.lsize() )\n gGrid2.gather(other.lgrid, self.gsMap,comm.world_pe0, comm.component_pid, comm.local_comm)\n\n # From here on, everything is done by the root pe\n if( comm.component_pid != comm.world_pe0 ):\n return\n\n # Compare size of domain\n npts1 = gGrid1.lsize()\n npts2 = gGrid2.lsize()\n npts = npts1\n\n if ( npts1 == npts2 ):\n debugPrint( \"the domain size is \",npts )\n else:\n debugPrint( \"domain size #1 = \", npts1 )\n debugPrint( \"domain size #2 = \", npts2 )\n debugPrint( \"ERROR: domain size mis-match\" )\n # call shr_sys_abort(subName // \"ERROR: domain size mis-match\")\n # Exceptions?\n\n # If there was no problem, continue:\n # Compare Domain masks:\n debugPrint(\"gData1:\\n\",gGrid1)\n debugPrint(\"gData2:\\n\",gGrid2)\n data1,data1_size = gGrid1.exportRAttr(\"mask\")#rcode)?\n data2,data2_size = gGrid2.exportRAttr(\"mask\")#rcode)?\n \n ndiff = 0\n debugPrint( \"npts:\",npts )\n debugPrint( \"length of data1:\",data1_size )\n for n in xrange(0,npts-1):\n if ( (( (abs(data1[n])) > eps_mask ) and (abs(data1[n]) < eps_mask )) or \n ( (( abs(data1[n])) < eps_mask ) and (( abs(data1[n])) > eps_mask) ) ):\n ndiff = ndiff + 1\n\n # Enforce consistency: \n # Nested function declaration\n def enforce_consistency(msg,exception=None):\n if (enforce_mask or enforce_all):\n if (ndiff > 0):\n debugPrint( msg )\n # Raise Exception\n \n enforce_consistency(\"ERROR: incompatible domain masks\")\n \n # Compute Maximum Latitude and Longitude Differences\n mask = data1\n ndiff = 0\n data1,data1_size = gGrid1.exportRAttr(\"lat\")#,rcode))\n data2,data2_size = gGrid2.exportRAttr(\"lat\")#,rcode))\n diff = 0\n max_diff = 0.0\n for n in xrange(npts):\n if( abs( mask[n] ) > eps_mask ):\n diff = abs( data1[n] - data2[n] )\n max_diff = max(max_diff, diff)\n if( diff > eps_grid ):\n ndiff = ndiff + 1\n debugPrint( \"Maximum latitude difference = \",max_diff )\n\n data1,data1_size = gGrid1.exportRAttr(\"lon\")#,rcode))\n data2,data2_size = gGrid2.exportRAttr(\"lon\")#,rcode))\n max_diff = 0.0\n\n for n in xrange(npts):\n if( abs( mask[n] ) > eps_mask ):\n x1 = data1[n]\n x2 = data2[n]\n if( x1 > x2 ): #make sure x1 < x2\n # swap(x1,x2)\n x1 = data2[n]\n x2 = data1[n]\n while( (x1+360.0) < (x2+180.0) ):#longitude is periodic\n x1 = x1 + 360.0\n diff = abs( x2 - x1 )\n max_diff = max(max_diff,diff)\n \n if (diff > eps_grid):\n ndiff = ndiff + 1\n debugPrint( \"Maximum longitude difference = \",max_diff )\n\n enforce_consistency(\"ERROR: incompatible domain grid coordinates!\")\n\n # Compare Area:\n data1,data1_size = gGrid1.exportRAttr( \"area\" )#, rcode )\n data2,data2_size = gGrid2.exportRAttr( \"area\" )#, rcode )\n\n ndiff = 0\n max_diff = 0.0\n\n for n in xrange(npts):\n if( abs( mask[n] ) > eps_mask ):\n if( data2[n] != 0.0 ):\n diff = abs( (data2[n] - data1[n]) / data2[n] )\n max_diff = max(max_diff,diff)\n if( diff > eps_area ):\n ndiff = ndiff + 1\n debugPrint( \"Maxium relative error of area (model) = \", max_diff )\n\n enforce_consistency(\"ERROR: icompatible domain area(model)\")\n\n # Compare aream\n data1,data1_size = gGrid1.exportRAttr(\"aream\")#,rcode))\n data2,data2_size = gGrid2.exportRAttr(\"aream\")#,rcode))\n\n ndiff = 0\n max_diff = 0.0\n for n in xrange(npts):\n if ( abs( mask[n] ) > eps_mask ):\n if( data2[n] != 0.0 ):\n diff = abs((data2[n] - data1[n])/data2[n])\n max_diff = max(max_diff,diff)\n if( diff > eps_area ):\n ndiff = ndiff + 1\n debugPrint( \"maximum relative error of area(map) = \",max_diff )\n\n enforce_consistency(\"ERROR: incompatible domain area (map)\")\n\n # Clean up, we're finished!\n return","def assertNodesEqual(self, a, b):\n self.assertEqual((a.version, a.address, a.service, a.properties),\n (b.version, b.address, b.service, b.properties))","def __eq__(self, other):\n return (type(self) == type(other) and\n (self.from_grid == other.from_grid) and\n (self.to_grid == other.to_grid))","def __eq__(self, other) -> bool:\n if not isinstance(other, NilpotentOrbit):\n return False\n if self.my_type != other.my_type:\n return False\n if self.lie_rank != other.lie_rank:\n return False\n if self.decorator != other.decorator:\n return False\n return self.my_diagram == other.my_diagram","def __eq__(self, other):\n return (type(self) == type(other) and\n self.from_grid == other.from_grid and\n self.to_grid == other.to_grid)","def __eq__(self, other):\n return (type(self) == type(other) and\n self.from_grid == other.from_grid and\n self.to_grid == other.to_grid)","def compare_graphs(self):\n\t\tpass","def __eq__(self, other):\n if not isinstance(other, RackTopoWhereInput):\n return False\n\n return self.to_dict() == other.to_dict()","def test_topology_handles_out_of_order_nodes(self, db_session, topology, second_topology, dbview):\n # Fill two networks simultaneously with newly created nodes\n self.nodes(topology, db_session, n=2)\n self.nodes(second_topology, db_session, n=2)\n self.nodes(topology, db_session, n=1)\n self.nodes(second_topology, db_session, n=1)\n\n # These topologies have non-contiguous node ids\n assert {node.id for node in topology.nodes()} == {1, 2, 5}\n assert {node.id for node in second_topology.nodes()} == {3, 4, 6}\n\n # Their edge graph is still internally consistent\n assertItemsEqual([\n set(neighbor.id for neighbor in node.neighbors())\n for node in topology.nodes()\n ],\n [{2, 5}, {1}, {1}]\n )\n\n assertItemsEqual([\n set(neighbor.id for neighbor in node.neighbors())\n for node in second_topology.nodes()\n ],\n [{4, 6}, {3}, {3}]\n )","def __eq__(self, other):\n return self.master.abs2phy(pos=other)","def test_point_relations(p1, p2):\n assert p1.left_of(p2) or p1.x >= p2.x\n assert p1.is_right_of(p2) or p1.x <= p2.x\n\n assert p1.left_of(p2) == p2.is_right_of(p1) or p1.x == p2.x\n assert not p1.left_of(p2) or not p1.is_right_of(p2)\n assert not p2.left_of(p1) or not p2.is_right_of(p1)","def are_equal(self, sp1, sp2):\n return True","def __eq__(self, other):\n return (type(self) == type(other) and\n self.n == other.n and self.m == other.m and\n self.from_grid == other.from_grid and\n self.to_grid == other.to_grid)","def test_transposition(self):\n\n World.reset()\n\n\n def inside(x, y):\n centers_distance = tf.sqrt(tf.reduce_sum(tf.squared_difference(x[:, 0:2], y[:, 0:2]), axis=1) + 1e-6)\n return tf.cast((centers_distance + x[:, 2]) < y[:, 2], tf.float32)\n\n circles = tfl.Domain(label=\"Circles\", data=[[0., 0, 1], [0,0, 2], [0,0, 3]])\n inside = tfl.Predicate(label=\"inside\", domains=[\"Circles\", \"Circles\"], function=inside)\n tfl.setTNorm(id=tfl.SS, p=1)\n sess = tf.Session()\n\n\n # Constraint 1\n x = tfl.variable(circles, name=\"x\")\n y = tfl.variable(circles, name=\"y\")\n a = tfl.atom(inside, (x,y))\n b = tfl.atom(inside, (y,x))\n rule = tfl.and_n(a, b)\n\n assert np.greater(sess.run(rule), np.zeros(shape=[3,3,3])).all()\n assert len(World._predicates_cache)==1","def compareNodes(x, y):\n return x.pathValue - y.pathValue","def compare_plane_data(pd1, pd2):\n raise NotImplementedError","def __eq__(self, other):\n\n # Attributes defining the instance\n ckeys = ['x0', 'y0', 'nx', 'ny', 'dx', 'dy', 'origin']\n\n a = dict((k, getattr(self.corner_grid, k)) for k in ckeys)\n b = dict((k, getattr(other.corner_grid, k)) for k in ckeys)\n p1 = self.corner_grid.proj\n p2 = other.corner_grid.proj\n return (a == b) and proj_is_same(p1, p2)","def __eq__(self, other):\n return (self.vertices == other.vertices and self.weight == other.weight)","def __eq__(self, other):\n return (type(self) == type(other) and\n self.from_grid == other.from_grid and\n self.to_grid == other.to_grid and\n self.m == other.m and\n self.n == other.n)","def __eq__(self, other):\r\n\r\n if type(other) != type(self):\r\n return False\r\n if other.loss_list != self.loss_list:\r\n return False\r\n if other.meshsol_list != self.meshsol_list:\r\n return False\r\n if other.loss_index != self.loss_index:\r\n return False\r\n if other.logger_name != self.logger_name:\r\n return False\r\n if other.axes_dict != self.axes_dict:\r\n return False\r\n if other.Pstator != self.Pstator:\r\n return False\r\n if other.Protor != self.Protor:\r\n return False\r\n if other.Pmagnet != self.Pmagnet:\r\n return False\r\n if other.Pprox != self.Pprox:\r\n return False\r\n if other.Pjoule != self.Pjoule:\r\n return False\r\n if other.coeff_dict != self.coeff_dict:\r\n return False\r\n return True","def __eq__(self, other):\n return self.master.phy2abs(pos=other)","def __eq__(self, other):\r\n return abs(self.x - other.x) + abs(self.y - other.y) < Vertex.epsilon","def are_equal(self, sp1, sp2):\n return","def __ne__(self, other):\n if not isinstance(other, RackTopoWhereInput):\n return True\n\n return self.to_dict() != other.to_dict()","def is_same_as(self, other) -> bool:\n return self.x == other.x and self.y == other.y","def similar(g1, g2):\r\n return all(t1 == t2 for (t1, t2) in _squashed_graphs_triples(g1, g2))","def test_1(self):\r\n r1, r2, r5 = MyVariable(1), MyVariable(2), MyVariable(5)\r\n o = MyOp.make_node(r1, r1)\r\n o2 = MyOp.make_node(o.outputs[0], r5)\r\n all = general_toposort(o2.outputs, prenode)\r\n assert all == [r5, r1, o, o.outputs[0], o2, o2.outputs[0]]","def __eq__(self, other):\n\t\treturn self._coords == other._coords","def __eq__(self, other):\n if isinstance(other, DirectedGraphEdge):\n return self.head_vertex == other.head_vertex and self.tail_vertex == other.tail_vertex\n return NotImplemented","def test_eq(self, tdim, tdim2):\n assert tdim != tdim2\n assert tdim == copy.deepcopy(tdim)","def __eq__(self, second):\r\n\t\treturn self.x == other.x and self.y == other.y","def test_hash_equality(self):\n origin = np.random.randn(3)\n normal = np.random.randn(3)\n up_vector = np.random.randn(3)\n up_vector2 = np.random.randn(3)\n p1 = shapes_3d.CoordinatePlane(origin, normal, up_vector)\n p2 = shapes_3d.CoordinatePlane(origin, normal, up_vector)\n p3 = shapes_3d.CoordinatePlane(origin, normal, up_vector2)\n \n self.assertEqual(p1, p2)\n self.assertNotEqual(p1, p3)","def __eq__(self, other):\n\n if not isinstance(other, Zone):\n return False\n if self.rdclass != other.rdclass or \\\n self.origin != other.origin or \\\n self.nodes != other.nodes:\n return False\n return True","def _compare(self, boxlist1, boxlist2):\n\n ycenter1, xcenter1, _, _ = BoxList.get_center_coordinates_and_sizes(boxlist1)\n ycenter2, xcenter2, _, _ = BoxList.get_center_coordinates_and_sizes(boxlist2)\n\n centers1 = tf.transpose(tf.stack((ycenter1, xcenter1)))\n centers2 = tf.transpose(tf.stack((ycenter2, ycenter2)))\n\n centers_diff = tf.expand_dims(centers1, 1) - tf.expand_dims(centers2, 0)\n neg_l2_distance = -tf.norm(centers_diff, axis=2)\n return neg_l2_distance\n #return box_list_ops.iou(boxlist1, boxlist2)","def is_connected(object_one, object_two):\n\n for vert_one in object_one.Vertexes:\n for vert_two in object_two.Vertexes:\n if (vert_one.X == vert_two.X) and (vert_one.y == vert_two.y):\n return True\n\n return False","def __eq__(self, other):\n s = len(self)\n r = len(other)\n\n if s != r:\n raise(VetorError, \"Vetor dimensions are not equal\")\n\n # Two vectors are numericaly the same if the difference\n # between both of them are smaller than given precisao\n for i in range(s):\n if not comozero(self[i] - other[i]):\n return False\n\n return True","def __eq__(self, other):\n # check equality of the nodesets\n return self.nodeset.__eq__(other.get_nodeset())","def is_equal(self, other) -> bool:\n if isinstance(other, numbers.Number):\n return not self.num_variables and bool(self.offset == other)\n # todo: performance\n\n try:\n if callable(other.vartype):\n vartype_eq = all(self.vartype(v) == other.vartype(v) for v in self.variables)\n else:\n vartype_eq = all(self.vartype(v) == other.vartype for v in self.variables)\n\n return (vartype_eq\n and self.shape == other.shape # redundant, fast to check\n and self.offset == other.offset\n and self.linear == other.linear\n and self.adj == other.adj)\n except AttributeError:\n return False","def __eq__(A, B):\n if not isinstance(A, type(B)):\n return NotImplemented\n return A.domain == B.domain and A.rep == B.rep","def IsEqualOrder(self,other):\n return self.InferPolynomialDegree() == other.InferPolynomialDegree()","def isomorphic(graph1, graph2):\r\n\r\n gd1 = _TripleCanonicalizer(graph1).to_hash()\r\n gd2 = _TripleCanonicalizer(graph2).to_hash()\r\n return gd1 == gd2","def __eq__(self, other):\n if type(other) != type(self):\n return False\n # Check the properties inherited from Data\n if not super(DataND, self).__eq__(other):\n return False\n if other.axes != self.axes:\n return False\n if other.normalizations != self.normalizations:\n return False\n if other.FTparameters != self.FTparameters:\n return False\n if not array_equal(other.values, self.values):\n return False\n return True","def __eq__(self, other):\n return self._coords == other._coords","def __eq__(self, other):\n return self._coords == other._coords","def __eq__(self, other):\n for ls, lo in zip(self.leaderboard_names, other.leaderboard_names):\n if ls != lo:\n return False\n for ls, lo in zip(self.leaderboard_groups, other.leaderboard_groups):\n if ls != lo:\n return False\n if self.top_left != other.top_left:\n return False\n if self.bottom_right != other.bottom_right:\n return False\n return True","def compare_networks(model_1, model_2, pos=None, showfig=True, figsize=(15, 8), verbose=3):\n [scores, adjmat_diff] = network.compare_networks(model_1['adjmat'], model_2['adjmat'], pos=pos, showfig=showfig, width=figsize[0], height=figsize[1], verbose=verbose)\n return(scores, adjmat_diff)","def is_equal (self, p):\n assert isinstance (p, Problem), \"Must be comparing two of same type\"\n if self.objects != p.objects:\n print(\"objects\")\n return False\n\n if self.init != p.init:\n #print \"init\"\n #print \"*self*\"\n #print self.init\n #print \"*p*\"\n #print p.init\n return False\n\n if self.goal != p.goal:\n print(\"goal\")\n return False\n\n if not all ([sa == pa for sa, pa in zip (self.actions, p.actions)]):\n print(\"actions\")\n return False\n\n if not all ([sp == pp for sp, pp in zip (self.predicates, p.predicates)]):\n print(\"predicates\")\n return False\n\n if self.types != p.types or self.parent_types != p.parent_types:\n print(\"types\")\n return False\n\n return True","def is_equivalent(self, other):\n A = self.minimization().relabeled()\n [initial] = A.initial_states()\n address = {initial: ()}\n for v in A.digraph().breadth_first_search(initial.label()):\n state = A.state(v)\n state_address = address[state]\n for t in A.iter_transitions(state):\n if t.to_state not in address:\n address[t.to_state] = state_address + tuple(t.word_in)\n\n B = other.minimization().relabeled()\n labels = {B.process(path)[1].label(): state.label()\n for (state, path) in address.iteritems()}\n try:\n return A == B.relabeled(labels=labels)\n except KeyError:\n return False","def __eq__(self, other):\n if self.get_dimensions() == other.get_dimensions():\n is_equal = (np.allclose(self.lon_arr, other.lon_arr) and\n np.allclose(self.lat_arr, other.lat_arr))\n else:\n is_equal = False\n return is_equal","def _exact_compare(tree1, tree2):\n attrs = ['name', 'length', 'support']\n for n1, n2 in zip(tree1.postorder(), tree2.postorder()):\n for attr in attrs:\n if getattr(n1, attr, None) != getattr(n2, attr, None):\n return False\n return True","def almost_equal(self, other, rtol=1e-05, atol=1e-08):\n\n # float attributes defining the instance\n fkeys = ['x0', 'y0', 'dx', 'dy']\n # unambiguous attributes\n ckeys = ['nx', 'ny', 'origin']\n\n ok = True\n for k in fkeys:\n ok = ok and np.isclose(getattr(self.corner_grid, k),\n getattr(other.corner_grid, k),\n rtol=rtol, atol=atol)\n for k in ckeys:\n _ok = getattr(self.corner_grid, k) == getattr(other.corner_grid, k)\n ok = ok and _ok\n p1 = self.corner_grid.proj\n p2 = other.corner_grid.proj\n return ok and proj_is_same(p1, p2)","def equals(\n self, other, rtol=None, atol=None, verbose=None, ignore_type=False\n ):\n pp = super()._equals_preprocess(\n other, verbose=verbose, ignore_type=ignore_type\n )\n if pp is True or pp is False:\n return pp\n\n other = pp\n\n coords0 = self.coordinates()\n coords1 = other.coordinates()\n if len(coords0) != len(coords1):\n logger.info(\n f\"{self.__class__.__name__}: Different sized collections of \"\n f\"coordinates ({coords0}, {coords1})\"\n )\n\n return False\n\n if not self.coordinate_conversion.equals(\n other.coordinate_conversion,\n rtol=rtol,\n atol=atol,\n verbose=verbose,\n ignore_type=ignore_type,\n ):\n logger.info(\n f\"{self.__class__.__name__}: Different coordinate conversions\"\n )\n\n return False\n\n if not self.datum.equals(\n other.datum,\n rtol=rtol,\n atol=atol,\n verbose=verbose,\n ignore_type=ignore_type,\n ):\n logger.info(f\"{self.__class__.__name__}: Different datums\")\n\n return False\n\n # Still here? Then the two coordinate references are as equal\n # as can be ascertained in the absence of domains.\n return True","def __eq__(self, other):\n if not isinstance(other, NodeProperties):\n return False\n\n return self.__dict__ == other.__dict__","def verticesEqual(self, v1, v2, eps=1e-8):\n if abs(v1[0] - v2[0]) > eps:\n return False\n if abs(v1[1] - v2[1]) > eps:\n return False\n if abs(v1[2] - v2[2]) > eps:\n return False\n return True","def __eq__(self, other):\n return self.abs2phy.__eq__(other)","def __eq__(self, other):\n return self.abs2phy.__eq__(other)","def _compare_attributes(self, first: Node, second: Node) -> bool:\n # If opsets of nodes are different, then nodes have different attributes.\n fst_opset = first.get_opset()\n snd_opset = second.get_opset()\n if fst_opset != snd_opset:\n return False\n\n if fst_opset not in ['opset1', 'opset4']:\n fst_name = first.soft_get('name', first.id)\n snd_name = second.soft_get('name', second.id)\n raise Error('Unsupported opset {} for nodes with names {} and {}'.format(fst_opset, fst_name, snd_name))\n\n if fst_opset == 'opset1':\n return self._compare_attributes_of_interpolate1(first, second)\n else:\n return self._compare_attributes_of_interpolate4(first, second)","def __eq__(self, other):\n\n return (self.nodes[0].id == other.nodes[0].id) & \\\n (self.nodes[1].id == other.nodes[1].id) & \\\n (self.name == other.name)","def are_the_same(node_before, node_after) -> bool:\n\n if node_before.algorithm != node_after.algorithm:\n return False\n elif not _is_output_name_same(node_before, node_after):\n return False\n else:\n for attr in interested_attrs:\n if _exists_attr(attr, node_before, node_after) == 1 or \\\n _exists_attr(attr, node_before, node_after) == 2:\n return False\n elif _exists_attr(attr, node_before, node_after) == 12 and \\\n node_before.attributes[attr] != node_after.attributes[attr]:\n return False\n return True","def __eq__(self, other):\n return type(self) == type(other) and self.node is other.node","def __eq__(self, other):\n return self.conn == other.conn and self.p1 == other.p1 and self.p2 == other.p2","def check_topology(self, *args, **kwargs):\n return _TestA_swig.cleanslate_sptr_check_topology(self, *args, **kwargs)","def __eq__(self, other):\n if isinstance(other, type(self)):\n same_edges = self._edges == other._edges\n same_weights = self._weights == other._weights\n return same_edges and same_weights\n else:\n return False","def __eq__(self, other):\n if isinstance(other, DenseUnit):\n return (Counter(self.dimension) == Counter(other.dimension) and Counter(self.points) == Counter(\n other.points))\n return False","def _match_identical_nodes(self):\n\n for job_name_b in self._topo_b_nodes:\n for job_name_a in self._unresolved_a_nodes:\n if self._is_node_identical(job_name_a, job_name_b):\n self._identical_nodes[job_name_b] = job_name_a\n self._unresolved_a_nodes.remove(job_name_a)\n self._unresolved_b_nodes.remove(job_name_b)\n break","def __eq__(self, other):\n if isinstance(other, UnDirectedWeightedGraphEdge):\n if self.head_vertex != other.head_vertex:\n return False\n elif self.tail_vertex != other.tail_vertex:\n return False\n elif self.weight != other.weight:\n return False\n return True\n return NotImplemented","def test_to_from_topology(self, molecule):\n topology = molecule.to_topology()\n molecule_copy = Molecule.from_topology(topology)\n assert molecule == molecule_copy","def test_to_from_topology(self, molecule):\n topology = molecule.to_topology()\n molecule_copy = Molecule.from_topology(topology)\n assert molecule == molecule_copy","def __eq__(self, other):\n if isinstance(other, DirectedWeightedGraphEdge):\n if self.head_vertex != other.head_vertex:\n return False\n elif self.tail_vertex != other.tail_vertex:\n return False\n elif self.weight != other.weight:\n return False\n return True\n return NotImplemented","def __eq__(self, other):\n x_eq = self.x == other.x\n y_eq = self.y == other.y\n return x_eq and y_eq","def __eq__(self, other):\n x_eq = self.x == other.x\n y_eq = self.y == other.y\n return x_eq and y_eq","def __ne__(self, other):\n return np.all(self.grid != other.grid) or np.all(self.pos != other.pos)","def __eq__(self, other):\n if not isinstance(other, DFM):\n return NotImplemented\n # Compare domains first because we do *not* want matrices with\n # different domains to be equal but e.g. a flint fmpz_mat and fmpq_mat\n # with the same entries will compare equal.\n return self.domain == other.domain and self.rep == other.rep","def are_similar(first_coords: List[Tuple[int, int]], second_coords: List[Tuple[int, int]]) -> bool:\n # Step 1: Get angles of each triangle\n # Step 2: Compare grades of two triangles\n # Step 3: If two angles are equal then first triangle is similar to second triangle\n pass","def assert_source_space_equal(src1, src2, msg=\"SourceSpace Dimension objects \"\n \"unequal\"):\n msg = \"%s:\" % msg\n assert_array_equal(src1.vertno[0], src2.vertno[0], \"%s unequal lh vertno \"\n \"(%r vs %r)\" % (msg, src1.vertno[0], src2.vertno[0]))\n assert_array_equal(src1.vertno[1], src2.vertno[1], \"%s unequal rh vertno \"\n \"(%r vs %r)\" % (msg, src1.vertno[1], src2.vertno[1]))\n assert_equal(src1.subject, src2.subject, \"%s unequal subject (%r vs %r\"\n \")\" % (msg, src1.subject, src2.subject))\n assert_equal(src1.src, src2.src, \"%s unequal names (%r vs %r\"\n \")\" % (msg, src1.src, src2.src))\n assert_equal(src1.subjects_dir, src2.subjects_dir, \"%s unequal names (%r \"\n \"vs %r)\" % (msg, src1.subjects_dir, src2.subjects_dir))","def test_compare_old_to_new_method_to_create_trees(self):\n nodes = util.generate_sequence_of_points(2, 2)\n tree1 = kdtree.createNewTree(nodes)\n kdtree.visualize(tree1)\n \n sel_axis = (lambda axis: axis)\n tree2 = kdtree.createNewTree([[0.5, 0.5]],axis = 0, sel_axis= sel_axis)\n tree2.split2([0.25, 0.5], axis = 1)\n tree2.split2([0.75, 0.5], axis = 1)\n \n #left\n tree2.split2([0.25, 0.25], axis = 0, sel_axis = sel_axis)\n tree2.split2([0.25, 0.75], axis = 0, sel_axis = sel_axis)\n \n #right\n tree2.split2([0.75, 0.25], axis = 0, sel_axis = sel_axis)\n tree2.split2([0.75, 0.75], axis = 0, sel_axis = sel_axis)\n \n kdtree.visualize(tree2)\n \n for n in zip(kdtree.level_order(tree1), kdtree.level_order(tree2)):\n self.assertEqual(n[0].data, n[1].data, \"elements not equal\")\n \n if n[0].data is not None and n[1].data is not None:\n self.assertEqual(n[0].axis, n[1].axis, \"elements not equal\")","def assertNodesEqual(self, first, second):\n def get_attrs(l):\n result = []\n for n in l:\n result.append((n.service, n.address, n.version, n.properties))\n return result\n self.assertEqual(get_attrs(first), get_attrs(second))","def is_equal_to(self, another_labyrinth):\n \n if self.equals_list_nodes(self.list_empty_nodes, another_labyrinth.list_empty_nodes) and \\\n self.equals_list_nodes(self.list_wall_nodes, another_labyrinth.list_wall_nodes) and \\\n self.start_point.position_is_equal_to(another_labyrinth.start_point) and \\\n self.exit_point.position_is_equal_to(another_labyrinth.exit_point):\n return True\n \n else:\n return False","def test_other_side_mesh(self):\n layered_volume = np.array(\n [\n [\n [0, 0, 0, 0, 0],\n [0, 0, 1, 1, 1],\n [0, 1, 1, 0, 0],\n [0, 1, 1, 1, 0],\n [0, 0, 0, 0, 0],\n ]\n ]\n )\n\n def quad(v1, v2, v3, v4):\n \"\"\"counterclockwise winding faces to make quad\"\"\"\n return [[v3, v2, v1], [v4, v3, v2]]\n\n top_mesh = trimesh.Trimesh(\n vertices=np.array(\n [\n [0, 1, 5],\n [1, 1, 5],\n [0, 1, 2],\n [1, 1, 2],\n [0, 3.5, 1.5],\n [1, 3.5, 1.5],\n ]\n ),\n faces=np.concatenate([quad(0, 1, 3, 2), quad(2, 3, 5, 4)], axis=0),\n )\n\n bot_mesh = trimesh.Trimesh(\n vertices=np.array([[0, 2, 5], [1, 2, 5], [0, 4, 2], [1, 4, 2]]),\n faces=quad(0, 1, 3, 2),\n )\n\n up = [0, -1, 0]\n dup = [0, -np.sqrt(0.5), -np.sqrt(0.5)]\n nanvec = [np.nan, np.nan, np.nan]\n vectors = np.array(\n [\n [\n [nanvec, nanvec, nanvec, nanvec, nanvec],\n [nanvec, nanvec, dup, up, up],\n [nanvec, dup, dup, nanvec, nanvec],\n [nanvec, dup, up, up, nanvec],\n [nanvec, nanvec, nanvec, nanvec, nanvec],\n ]\n ]\n )\n\n distances, something_wrong = tested.distances_from_voxels_to_meshes_wrt_dir(\n layered_volume, [top_mesh, bot_mesh], vectors\n )\n\n npt.assert_array_almost_equal(distances, get_expected_distances_to_meshes())\n assert not np.any(something_wrong)","def __eq__(self, other):\n if isinstance(other, GraphEdge):\n return self.head_vertex == other.head_vertex and self.tail_vertex == other.tail_vertex\n return NotImplemented","def check_form_match(\n cls,\n tensor1=None,\n tensor2=None,\n qhape1=None,\n shape1=None,\n dirs1=None,\n qhape2=None,\n shape2=None,\n dirs2=None,\n qodulus=None,\n ):\n if tensor1 is not None:\n qhape1 = tensor1.qhape\n shape1 = tensor1.shape\n dirs1 = tensor1.dirs\n if tensor2 is not None:\n qhape2 = tensor2.qhape\n shape2 = tensor2.shape\n dirs2 = tensor2.dirs\n if not (\n len(qhape1)\n == len(qhape2)\n == len(shape1)\n == len(shape2)\n == len(dirs1)\n == len(dirs2)\n ):\n return False\n # Loop over the indices of both tensors in tandem.\n for d1, qim1, dim1, d2, qim2, dim2 in zip(\n dirs1, qhape1, shape1, dirs2, qhape2, shape2\n ):\n # This is almost like compatible_indices, but for the missing minus\n # sign when building o_qim.\n qim2 = [d1 * d2 * q for q in qim2]\n if qodulus is not None:\n qim2 = [q % qodulus for q in qim2]\n qimdim1 = set(zip(qim1, dim1))\n qimdim2 = set(zip(qim2, dim2))\n if not qimdim1 == qimdim2:\n return False\n return True","def test_basic_two_point_graph(self):\n self.assertEquals(\n Dijkstras().dijkstras(self.g1, 'a', 'b'), (1, ['a', 'b']))","def __eq__(self, other):\r\n try:\r\n return self.gd == other.gd and self.boundariesrules == other.boundariesrules\r\n except AttributeError:\r\n return False","def test_canonize_neighborhood_same_graph(nauty, ref_graph, ref_graph2):\n key = nauty.canonize_neighborhood(ref_graph, 2, 1)\n key2 = nauty.canonize_neighborhood(ref_graph2, 3, 1)\n assert key == key2","def _vertices_are_equal(\n vertices1: List[np.ndarray], vertices2: List[np.ndarray]\n) -> bool:\n if len(vertices1) != len(vertices2):\n return False\n diff = vertices1 - vertices2\n if np.abs(np.max(diff)) < ways_are_equal_tolerance:\n return True\n return False","def __eq__(self, other):\n # check equality of names since names are unique identifiers of nodes\n return self.name.__eq__(other.get_name())","def __eq__(self, other):\n # check equality of names since names are unique identifiers of nodes\n return self.name.__eq__(other.get_name())","def brepalgo_IsTopologicallyValid(*args):\n return _BRepAlgo.brepalgo_IsTopologicallyValid(*args)","def __eq__(self, other):\n from numpy.linalg import norm\n from numpy import array\n\n # Upcast to an Atom\n othercomp = Atom(other)\n\n # Compare Symbols\n sym1 = self.sym\n sym2 = othercomp.sym\n if sym1 != sym2:\n return False\n\n # Compare position\n pos1 = array(self.get_position())\n pos2 = array(othercomp.get_position())\n\n return norm(pos1 - pos2) < 1e-3","def __eq__(self, other):\n return self.x == other.x and self.y == other.y"],"string":"[\n \"def have_same_topology(first_mesh, second_mesh):\\n return attr_has_same_shape(first_mesh, second_mesh, \\\"v\\\") and attr_is_equal(\\n first_mesh, second_mesh, \\\"f\\\"\\n )\",\n \"def equivalent(kls, first, second):\\n if first.empty() and second.empty():\\n return True\\n elif first.vertices.shape[0] != second.vertices.shape[0]:\\n return False\\n elif first.edges.shape[0] != second.edges.shape[0]:\\n return False\\n\\n EPSILON = 1e-7\\n\\n vertex1, ct1 = np.unique(first.vertices, axis=0, return_counts=True)\\n vertex2, ct2 = np.unique(second.vertices, axis=0, return_counts=True)\\n \\n vertex_match = np.all(np.abs(vertex1 - vertex2) < EPSILON)\\n ct_match = np.all(ct1 == ct2)\\n if not (vertex_match and ct_match):\\n return False\\n\\n g1 = nx.Graph()\\n g1.add_edges_from(first.edges)\\n g2 = nx.Graph()\\n g2.add_edges_from(second.edges)\\n edges_match = nx.is_isomorphic(g1, g2)\\n del g1 \\n del g2\\n\\n if not edges_match:\\n return False\\n\\n second_verts = {}\\n for i, vert in enumerate(second.vertices):\\n second_verts[tuple(vert)] = i\\n \\n attrs = [ attr['id'] for attr in first.extra_attributes ]\\n for attr in attrs:\\n buf1 = getattr(first, attr)\\n buf2 = getattr(second, attr)\\n if len(buf1) != len(buf2):\\n return False\\n\\n for i in range(len(buf1)):\\n i2 = second_verts[tuple(first.vertices[i])]\\n if buf1[i] != buf2[i2]:\\n return False\\n\\n return True\",\n \"def compare_topology(tree1, tree2):\\n n2p1, n2p2 = ({node.name: node.parent.name\\n for node in tree.traverse() if not node.is_root()}\\n for tree in (tree1, tree2))\\n return n2p1 == n2p2\",\n \"def _shape_compare(shape1, shape2):\\n if len(shape1) != len(shape2):\\n return False\\n for s1, s2 in zip(shape1, shape2):\\n if s1 != s2:\\n return False\\n return True\",\n \"def __eq__(self, other) -> bool:\\n if not isinstance(other, self.__class__):\\n return False\\n\\n if self.number_of_nodes() != other.number_of_nodes():\\n return False\\n if self.number_of_edges() != other.number_of_edges():\\n return False\\n\\n if list(self.nodes) != list(other.nodes):\\n return False\\n\\n # Compare node data.\\n for i in self.nodes:\\n # We may want to exclude the 'name' attribute from comparisons, assuming\\n # it has no logical meaning.\\n if self.nodes[i] != other.nodes[i]:\\n return False\\n\\n if list(self.edges) != list(other.edges):\\n return False\\n\\n for i, j in self.edges:\\n # Compare edge data.\\n if self.edges[i, j] != other.edges[i, j]:\\n return False\\n\\n return True\",\n \"def compareGrids(grid1, grid2):\\n if axis_utils.areAxesIdentical(grid1.getLatitude(),\\n grid2.getLatitude(), check_id=False)==False:\\n return False\\n if axis_utils.areAxesIdentical(grid1.getLongitude(),\\n grid2.getLongitude(), check_id=False)==False:\\n return False\\n return True\",\n \"def __eq__(self, other):\\n return self.position.data == other.position.data and \\\\\\n self.velocity.data == other.velocity.data\",\n \"def __eq__(self, other) -> bool:\\n if other is None or not isinstance(other, Graph):\\n name = other.name if other else None\\n print(f'{name} is not a Graph object.')\\n return False\\n\\n def match(op1: Operator, op2: Operator) -> bool:\\n if not op1.equals(op2):\\n print(f'{op1.name} is different.')\\n return False\\n\\n # check input nodes and further\\n for i1, i2 in zip(op1.input_ops.values(), op2.input_ops.values()):\\n if not match(i1, i2):\\n return False\\n return True\\n\\n for o1, o2 in zip(self.get_outputs(), other.get_outputs()):\\n if not match(o1, o2):\\n return False\\n return True\",\n \"def __eq__(self, other):\\n return np.all(self.grid == other.grid) and np.all(self.pos == other.pos)\",\n \"def proj_is_same(p1, p2):\\n if has_gdal:\\n # this is more robust, but gdal is a pain\\n s1 = osr.SpatialReference()\\n s1.ImportFromProj4(p1.srs)\\n s2 = osr.SpatialReference()\\n s2.ImportFromProj4(p2.srs)\\n return s1.IsSame(s2) == 1 # IsSame returns 1 or 0\\n else:\\n # at least we can try to sort it\\n p1 = '+'.join(sorted(p1.srs.split('+')))\\n p2 = '+'.join(sorted(p2.srs.split('+')))\\n return p1 == p2\",\n \"def compare(self, other, enforce_mask=False, enforce_grid=False,\\n enforce_area=False, enforce_aream=False, enforce_all=False):\\n eps_mask = 1.0e-6\\n eps_grid = 1.0e-2\\n eps_area = 1.0e-1\\n\\n # Do a global gather to create a non-distributed attribute vector\\n debugPrint( \\\"self.lgrid:\\\\n\\\",self.lgrid )\\n debugPrint( \\\"other.lgrid:\\\\n\\\",other.lgrid )\\n gGrid1 = attributevector.AttributeVector(self.ifields, self.rfields, self.lsize())\\n gGrid1.initv(self.lgrid, self.lgrid.lsize())\\n gGrid1.gather(self.lgrid, self.gsMap, comm.world_pe0, comm.component_pid, comm.local_comm) \\n gGrid2 = attributevector.AttributeVector(other.ifields, other.rfields, other.lsize())\\n gGrid2.initv( other.lgrid, other.lgrid.lsize() )\\n gGrid2.gather(other.lgrid, self.gsMap,comm.world_pe0, comm.component_pid, comm.local_comm)\\n\\n # From here on, everything is done by the root pe\\n if( comm.component_pid != comm.world_pe0 ):\\n return\\n\\n # Compare size of domain\\n npts1 = gGrid1.lsize()\\n npts2 = gGrid2.lsize()\\n npts = npts1\\n\\n if ( npts1 == npts2 ):\\n debugPrint( \\\"the domain size is \\\",npts )\\n else:\\n debugPrint( \\\"domain size #1 = \\\", npts1 )\\n debugPrint( \\\"domain size #2 = \\\", npts2 )\\n debugPrint( \\\"ERROR: domain size mis-match\\\" )\\n # call shr_sys_abort(subName // \\\"ERROR: domain size mis-match\\\")\\n # Exceptions?\\n\\n # If there was no problem, continue:\\n # Compare Domain masks:\\n debugPrint(\\\"gData1:\\\\n\\\",gGrid1)\\n debugPrint(\\\"gData2:\\\\n\\\",gGrid2)\\n data1,data1_size = gGrid1.exportRAttr(\\\"mask\\\")#rcode)?\\n data2,data2_size = gGrid2.exportRAttr(\\\"mask\\\")#rcode)?\\n \\n ndiff = 0\\n debugPrint( \\\"npts:\\\",npts )\\n debugPrint( \\\"length of data1:\\\",data1_size )\\n for n in xrange(0,npts-1):\\n if ( (( (abs(data1[n])) > eps_mask ) and (abs(data1[n]) < eps_mask )) or \\n ( (( abs(data1[n])) < eps_mask ) and (( abs(data1[n])) > eps_mask) ) ):\\n ndiff = ndiff + 1\\n\\n # Enforce consistency: \\n # Nested function declaration\\n def enforce_consistency(msg,exception=None):\\n if (enforce_mask or enforce_all):\\n if (ndiff > 0):\\n debugPrint( msg )\\n # Raise Exception\\n \\n enforce_consistency(\\\"ERROR: incompatible domain masks\\\")\\n \\n # Compute Maximum Latitude and Longitude Differences\\n mask = data1\\n ndiff = 0\\n data1,data1_size = gGrid1.exportRAttr(\\\"lat\\\")#,rcode))\\n data2,data2_size = gGrid2.exportRAttr(\\\"lat\\\")#,rcode))\\n diff = 0\\n max_diff = 0.0\\n for n in xrange(npts):\\n if( abs( mask[n] ) > eps_mask ):\\n diff = abs( data1[n] - data2[n] )\\n max_diff = max(max_diff, diff)\\n if( diff > eps_grid ):\\n ndiff = ndiff + 1\\n debugPrint( \\\"Maximum latitude difference = \\\",max_diff )\\n\\n data1,data1_size = gGrid1.exportRAttr(\\\"lon\\\")#,rcode))\\n data2,data2_size = gGrid2.exportRAttr(\\\"lon\\\")#,rcode))\\n max_diff = 0.0\\n\\n for n in xrange(npts):\\n if( abs( mask[n] ) > eps_mask ):\\n x1 = data1[n]\\n x2 = data2[n]\\n if( x1 > x2 ): #make sure x1 < x2\\n # swap(x1,x2)\\n x1 = data2[n]\\n x2 = data1[n]\\n while( (x1+360.0) < (x2+180.0) ):#longitude is periodic\\n x1 = x1 + 360.0\\n diff = abs( x2 - x1 )\\n max_diff = max(max_diff,diff)\\n \\n if (diff > eps_grid):\\n ndiff = ndiff + 1\\n debugPrint( \\\"Maximum longitude difference = \\\",max_diff )\\n\\n enforce_consistency(\\\"ERROR: incompatible domain grid coordinates!\\\")\\n\\n # Compare Area:\\n data1,data1_size = gGrid1.exportRAttr( \\\"area\\\" )#, rcode )\\n data2,data2_size = gGrid2.exportRAttr( \\\"area\\\" )#, rcode )\\n\\n ndiff = 0\\n max_diff = 0.0\\n\\n for n in xrange(npts):\\n if( abs( mask[n] ) > eps_mask ):\\n if( data2[n] != 0.0 ):\\n diff = abs( (data2[n] - data1[n]) / data2[n] )\\n max_diff = max(max_diff,diff)\\n if( diff > eps_area ):\\n ndiff = ndiff + 1\\n debugPrint( \\\"Maxium relative error of area (model) = \\\", max_diff )\\n\\n enforce_consistency(\\\"ERROR: icompatible domain area(model)\\\")\\n\\n # Compare aream\\n data1,data1_size = gGrid1.exportRAttr(\\\"aream\\\")#,rcode))\\n data2,data2_size = gGrid2.exportRAttr(\\\"aream\\\")#,rcode))\\n\\n ndiff = 0\\n max_diff = 0.0\\n for n in xrange(npts):\\n if ( abs( mask[n] ) > eps_mask ):\\n if( data2[n] != 0.0 ):\\n diff = abs((data2[n] - data1[n])/data2[n])\\n max_diff = max(max_diff,diff)\\n if( diff > eps_area ):\\n ndiff = ndiff + 1\\n debugPrint( \\\"maximum relative error of area(map) = \\\",max_diff )\\n\\n enforce_consistency(\\\"ERROR: incompatible domain area (map)\\\")\\n\\n # Clean up, we're finished!\\n return\",\n \"def assertNodesEqual(self, a, b):\\n self.assertEqual((a.version, a.address, a.service, a.properties),\\n (b.version, b.address, b.service, b.properties))\",\n \"def __eq__(self, other):\\n return (type(self) == type(other) and\\n (self.from_grid == other.from_grid) and\\n (self.to_grid == other.to_grid))\",\n \"def __eq__(self, other) -> bool:\\n if not isinstance(other, NilpotentOrbit):\\n return False\\n if self.my_type != other.my_type:\\n return False\\n if self.lie_rank != other.lie_rank:\\n return False\\n if self.decorator != other.decorator:\\n return False\\n return self.my_diagram == other.my_diagram\",\n \"def __eq__(self, other):\\n return (type(self) == type(other) and\\n self.from_grid == other.from_grid and\\n self.to_grid == other.to_grid)\",\n \"def __eq__(self, other):\\n return (type(self) == type(other) and\\n self.from_grid == other.from_grid and\\n self.to_grid == other.to_grid)\",\n \"def compare_graphs(self):\\n\\t\\tpass\",\n \"def __eq__(self, other):\\n if not isinstance(other, RackTopoWhereInput):\\n return False\\n\\n return self.to_dict() == other.to_dict()\",\n \"def test_topology_handles_out_of_order_nodes(self, db_session, topology, second_topology, dbview):\\n # Fill two networks simultaneously with newly created nodes\\n self.nodes(topology, db_session, n=2)\\n self.nodes(second_topology, db_session, n=2)\\n self.nodes(topology, db_session, n=1)\\n self.nodes(second_topology, db_session, n=1)\\n\\n # These topologies have non-contiguous node ids\\n assert {node.id for node in topology.nodes()} == {1, 2, 5}\\n assert {node.id for node in second_topology.nodes()} == {3, 4, 6}\\n\\n # Their edge graph is still internally consistent\\n assertItemsEqual([\\n set(neighbor.id for neighbor in node.neighbors())\\n for node in topology.nodes()\\n ],\\n [{2, 5}, {1}, {1}]\\n )\\n\\n assertItemsEqual([\\n set(neighbor.id for neighbor in node.neighbors())\\n for node in second_topology.nodes()\\n ],\\n [{4, 6}, {3}, {3}]\\n )\",\n \"def __eq__(self, other):\\n return self.master.abs2phy(pos=other)\",\n \"def test_point_relations(p1, p2):\\n assert p1.left_of(p2) or p1.x >= p2.x\\n assert p1.is_right_of(p2) or p1.x <= p2.x\\n\\n assert p1.left_of(p2) == p2.is_right_of(p1) or p1.x == p2.x\\n assert not p1.left_of(p2) or not p1.is_right_of(p2)\\n assert not p2.left_of(p1) or not p2.is_right_of(p1)\",\n \"def are_equal(self, sp1, sp2):\\n return True\",\n \"def __eq__(self, other):\\n return (type(self) == type(other) and\\n self.n == other.n and self.m == other.m and\\n self.from_grid == other.from_grid and\\n self.to_grid == other.to_grid)\",\n \"def test_transposition(self):\\n\\n World.reset()\\n\\n\\n def inside(x, y):\\n centers_distance = tf.sqrt(tf.reduce_sum(tf.squared_difference(x[:, 0:2], y[:, 0:2]), axis=1) + 1e-6)\\n return tf.cast((centers_distance + x[:, 2]) < y[:, 2], tf.float32)\\n\\n circles = tfl.Domain(label=\\\"Circles\\\", data=[[0., 0, 1], [0,0, 2], [0,0, 3]])\\n inside = tfl.Predicate(label=\\\"inside\\\", domains=[\\\"Circles\\\", \\\"Circles\\\"], function=inside)\\n tfl.setTNorm(id=tfl.SS, p=1)\\n sess = tf.Session()\\n\\n\\n # Constraint 1\\n x = tfl.variable(circles, name=\\\"x\\\")\\n y = tfl.variable(circles, name=\\\"y\\\")\\n a = tfl.atom(inside, (x,y))\\n b = tfl.atom(inside, (y,x))\\n rule = tfl.and_n(a, b)\\n\\n assert np.greater(sess.run(rule), np.zeros(shape=[3,3,3])).all()\\n assert len(World._predicates_cache)==1\",\n \"def compareNodes(x, y):\\n return x.pathValue - y.pathValue\",\n \"def compare_plane_data(pd1, pd2):\\n raise NotImplementedError\",\n \"def __eq__(self, other):\\n\\n # Attributes defining the instance\\n ckeys = ['x0', 'y0', 'nx', 'ny', 'dx', 'dy', 'origin']\\n\\n a = dict((k, getattr(self.corner_grid, k)) for k in ckeys)\\n b = dict((k, getattr(other.corner_grid, k)) for k in ckeys)\\n p1 = self.corner_grid.proj\\n p2 = other.corner_grid.proj\\n return (a == b) and proj_is_same(p1, p2)\",\n \"def __eq__(self, other):\\n return (self.vertices == other.vertices and self.weight == other.weight)\",\n \"def __eq__(self, other):\\n return (type(self) == type(other) and\\n self.from_grid == other.from_grid and\\n self.to_grid == other.to_grid and\\n self.m == other.m and\\n self.n == other.n)\",\n \"def __eq__(self, other):\\r\\n\\r\\n if type(other) != type(self):\\r\\n return False\\r\\n if other.loss_list != self.loss_list:\\r\\n return False\\r\\n if other.meshsol_list != self.meshsol_list:\\r\\n return False\\r\\n if other.loss_index != self.loss_index:\\r\\n return False\\r\\n if other.logger_name != self.logger_name:\\r\\n return False\\r\\n if other.axes_dict != self.axes_dict:\\r\\n return False\\r\\n if other.Pstator != self.Pstator:\\r\\n return False\\r\\n if other.Protor != self.Protor:\\r\\n return False\\r\\n if other.Pmagnet != self.Pmagnet:\\r\\n return False\\r\\n if other.Pprox != self.Pprox:\\r\\n return False\\r\\n if other.Pjoule != self.Pjoule:\\r\\n return False\\r\\n if other.coeff_dict != self.coeff_dict:\\r\\n return False\\r\\n return True\",\n \"def __eq__(self, other):\\n return self.master.phy2abs(pos=other)\",\n \"def __eq__(self, other):\\r\\n return abs(self.x - other.x) + abs(self.y - other.y) < Vertex.epsilon\",\n \"def are_equal(self, sp1, sp2):\\n return\",\n \"def __ne__(self, other):\\n if not isinstance(other, RackTopoWhereInput):\\n return True\\n\\n return self.to_dict() != other.to_dict()\",\n \"def is_same_as(self, other) -> bool:\\n return self.x == other.x and self.y == other.y\",\n \"def similar(g1, g2):\\r\\n return all(t1 == t2 for (t1, t2) in _squashed_graphs_triples(g1, g2))\",\n \"def test_1(self):\\r\\n r1, r2, r5 = MyVariable(1), MyVariable(2), MyVariable(5)\\r\\n o = MyOp.make_node(r1, r1)\\r\\n o2 = MyOp.make_node(o.outputs[0], r5)\\r\\n all = general_toposort(o2.outputs, prenode)\\r\\n assert all == [r5, r1, o, o.outputs[0], o2, o2.outputs[0]]\",\n \"def __eq__(self, other):\\n\\t\\treturn self._coords == other._coords\",\n \"def __eq__(self, other):\\n if isinstance(other, DirectedGraphEdge):\\n return self.head_vertex == other.head_vertex and self.tail_vertex == other.tail_vertex\\n return NotImplemented\",\n \"def test_eq(self, tdim, tdim2):\\n assert tdim != tdim2\\n assert tdim == copy.deepcopy(tdim)\",\n \"def __eq__(self, second):\\r\\n\\t\\treturn self.x == other.x and self.y == other.y\",\n \"def test_hash_equality(self):\\n origin = np.random.randn(3)\\n normal = np.random.randn(3)\\n up_vector = np.random.randn(3)\\n up_vector2 = np.random.randn(3)\\n p1 = shapes_3d.CoordinatePlane(origin, normal, up_vector)\\n p2 = shapes_3d.CoordinatePlane(origin, normal, up_vector)\\n p3 = shapes_3d.CoordinatePlane(origin, normal, up_vector2)\\n \\n self.assertEqual(p1, p2)\\n self.assertNotEqual(p1, p3)\",\n \"def __eq__(self, other):\\n\\n if not isinstance(other, Zone):\\n return False\\n if self.rdclass != other.rdclass or \\\\\\n self.origin != other.origin or \\\\\\n self.nodes != other.nodes:\\n return False\\n return True\",\n \"def _compare(self, boxlist1, boxlist2):\\n\\n ycenter1, xcenter1, _, _ = BoxList.get_center_coordinates_and_sizes(boxlist1)\\n ycenter2, xcenter2, _, _ = BoxList.get_center_coordinates_and_sizes(boxlist2)\\n\\n centers1 = tf.transpose(tf.stack((ycenter1, xcenter1)))\\n centers2 = tf.transpose(tf.stack((ycenter2, ycenter2)))\\n\\n centers_diff = tf.expand_dims(centers1, 1) - tf.expand_dims(centers2, 0)\\n neg_l2_distance = -tf.norm(centers_diff, axis=2)\\n return neg_l2_distance\\n #return box_list_ops.iou(boxlist1, boxlist2)\",\n \"def is_connected(object_one, object_two):\\n\\n for vert_one in object_one.Vertexes:\\n for vert_two in object_two.Vertexes:\\n if (vert_one.X == vert_two.X) and (vert_one.y == vert_two.y):\\n return True\\n\\n return False\",\n \"def __eq__(self, other):\\n s = len(self)\\n r = len(other)\\n\\n if s != r:\\n raise(VetorError, \\\"Vetor dimensions are not equal\\\")\\n\\n # Two vectors are numericaly the same if the difference\\n # between both of them are smaller than given precisao\\n for i in range(s):\\n if not comozero(self[i] - other[i]):\\n return False\\n\\n return True\",\n \"def __eq__(self, other):\\n # check equality of the nodesets\\n return self.nodeset.__eq__(other.get_nodeset())\",\n \"def is_equal(self, other) -> bool:\\n if isinstance(other, numbers.Number):\\n return not self.num_variables and bool(self.offset == other)\\n # todo: performance\\n\\n try:\\n if callable(other.vartype):\\n vartype_eq = all(self.vartype(v) == other.vartype(v) for v in self.variables)\\n else:\\n vartype_eq = all(self.vartype(v) == other.vartype for v in self.variables)\\n\\n return (vartype_eq\\n and self.shape == other.shape # redundant, fast to check\\n and self.offset == other.offset\\n and self.linear == other.linear\\n and self.adj == other.adj)\\n except AttributeError:\\n return False\",\n \"def __eq__(A, B):\\n if not isinstance(A, type(B)):\\n return NotImplemented\\n return A.domain == B.domain and A.rep == B.rep\",\n \"def IsEqualOrder(self,other):\\n return self.InferPolynomialDegree() == other.InferPolynomialDegree()\",\n \"def isomorphic(graph1, graph2):\\r\\n\\r\\n gd1 = _TripleCanonicalizer(graph1).to_hash()\\r\\n gd2 = _TripleCanonicalizer(graph2).to_hash()\\r\\n return gd1 == gd2\",\n \"def __eq__(self, other):\\n if type(other) != type(self):\\n return False\\n # Check the properties inherited from Data\\n if not super(DataND, self).__eq__(other):\\n return False\\n if other.axes != self.axes:\\n return False\\n if other.normalizations != self.normalizations:\\n return False\\n if other.FTparameters != self.FTparameters:\\n return False\\n if not array_equal(other.values, self.values):\\n return False\\n return True\",\n \"def __eq__(self, other):\\n return self._coords == other._coords\",\n \"def __eq__(self, other):\\n return self._coords == other._coords\",\n \"def __eq__(self, other):\\n for ls, lo in zip(self.leaderboard_names, other.leaderboard_names):\\n if ls != lo:\\n return False\\n for ls, lo in zip(self.leaderboard_groups, other.leaderboard_groups):\\n if ls != lo:\\n return False\\n if self.top_left != other.top_left:\\n return False\\n if self.bottom_right != other.bottom_right:\\n return False\\n return True\",\n \"def compare_networks(model_1, model_2, pos=None, showfig=True, figsize=(15, 8), verbose=3):\\n [scores, adjmat_diff] = network.compare_networks(model_1['adjmat'], model_2['adjmat'], pos=pos, showfig=showfig, width=figsize[0], height=figsize[1], verbose=verbose)\\n return(scores, adjmat_diff)\",\n \"def is_equal (self, p):\\n assert isinstance (p, Problem), \\\"Must be comparing two of same type\\\"\\n if self.objects != p.objects:\\n print(\\\"objects\\\")\\n return False\\n\\n if self.init != p.init:\\n #print \\\"init\\\"\\n #print \\\"*self*\\\"\\n #print self.init\\n #print \\\"*p*\\\"\\n #print p.init\\n return False\\n\\n if self.goal != p.goal:\\n print(\\\"goal\\\")\\n return False\\n\\n if not all ([sa == pa for sa, pa in zip (self.actions, p.actions)]):\\n print(\\\"actions\\\")\\n return False\\n\\n if not all ([sp == pp for sp, pp in zip (self.predicates, p.predicates)]):\\n print(\\\"predicates\\\")\\n return False\\n\\n if self.types != p.types or self.parent_types != p.parent_types:\\n print(\\\"types\\\")\\n return False\\n\\n return True\",\n \"def is_equivalent(self, other):\\n A = self.minimization().relabeled()\\n [initial] = A.initial_states()\\n address = {initial: ()}\\n for v in A.digraph().breadth_first_search(initial.label()):\\n state = A.state(v)\\n state_address = address[state]\\n for t in A.iter_transitions(state):\\n if t.to_state not in address:\\n address[t.to_state] = state_address + tuple(t.word_in)\\n\\n B = other.minimization().relabeled()\\n labels = {B.process(path)[1].label(): state.label()\\n for (state, path) in address.iteritems()}\\n try:\\n return A == B.relabeled(labels=labels)\\n except KeyError:\\n return False\",\n \"def __eq__(self, other):\\n if self.get_dimensions() == other.get_dimensions():\\n is_equal = (np.allclose(self.lon_arr, other.lon_arr) and\\n np.allclose(self.lat_arr, other.lat_arr))\\n else:\\n is_equal = False\\n return is_equal\",\n \"def _exact_compare(tree1, tree2):\\n attrs = ['name', 'length', 'support']\\n for n1, n2 in zip(tree1.postorder(), tree2.postorder()):\\n for attr in attrs:\\n if getattr(n1, attr, None) != getattr(n2, attr, None):\\n return False\\n return True\",\n \"def almost_equal(self, other, rtol=1e-05, atol=1e-08):\\n\\n # float attributes defining the instance\\n fkeys = ['x0', 'y0', 'dx', 'dy']\\n # unambiguous attributes\\n ckeys = ['nx', 'ny', 'origin']\\n\\n ok = True\\n for k in fkeys:\\n ok = ok and np.isclose(getattr(self.corner_grid, k),\\n getattr(other.corner_grid, k),\\n rtol=rtol, atol=atol)\\n for k in ckeys:\\n _ok = getattr(self.corner_grid, k) == getattr(other.corner_grid, k)\\n ok = ok and _ok\\n p1 = self.corner_grid.proj\\n p2 = other.corner_grid.proj\\n return ok and proj_is_same(p1, p2)\",\n \"def equals(\\n self, other, rtol=None, atol=None, verbose=None, ignore_type=False\\n ):\\n pp = super()._equals_preprocess(\\n other, verbose=verbose, ignore_type=ignore_type\\n )\\n if pp is True or pp is False:\\n return pp\\n\\n other = pp\\n\\n coords0 = self.coordinates()\\n coords1 = other.coordinates()\\n if len(coords0) != len(coords1):\\n logger.info(\\n f\\\"{self.__class__.__name__}: Different sized collections of \\\"\\n f\\\"coordinates ({coords0}, {coords1})\\\"\\n )\\n\\n return False\\n\\n if not self.coordinate_conversion.equals(\\n other.coordinate_conversion,\\n rtol=rtol,\\n atol=atol,\\n verbose=verbose,\\n ignore_type=ignore_type,\\n ):\\n logger.info(\\n f\\\"{self.__class__.__name__}: Different coordinate conversions\\\"\\n )\\n\\n return False\\n\\n if not self.datum.equals(\\n other.datum,\\n rtol=rtol,\\n atol=atol,\\n verbose=verbose,\\n ignore_type=ignore_type,\\n ):\\n logger.info(f\\\"{self.__class__.__name__}: Different datums\\\")\\n\\n return False\\n\\n # Still here? Then the two coordinate references are as equal\\n # as can be ascertained in the absence of domains.\\n return True\",\n \"def __eq__(self, other):\\n if not isinstance(other, NodeProperties):\\n return False\\n\\n return self.__dict__ == other.__dict__\",\n \"def verticesEqual(self, v1, v2, eps=1e-8):\\n if abs(v1[0] - v2[0]) > eps:\\n return False\\n if abs(v1[1] - v2[1]) > eps:\\n return False\\n if abs(v1[2] - v2[2]) > eps:\\n return False\\n return True\",\n \"def __eq__(self, other):\\n return self.abs2phy.__eq__(other)\",\n \"def __eq__(self, other):\\n return self.abs2phy.__eq__(other)\",\n \"def _compare_attributes(self, first: Node, second: Node) -> bool:\\n # If opsets of nodes are different, then nodes have different attributes.\\n fst_opset = first.get_opset()\\n snd_opset = second.get_opset()\\n if fst_opset != snd_opset:\\n return False\\n\\n if fst_opset not in ['opset1', 'opset4']:\\n fst_name = first.soft_get('name', first.id)\\n snd_name = second.soft_get('name', second.id)\\n raise Error('Unsupported opset {} for nodes with names {} and {}'.format(fst_opset, fst_name, snd_name))\\n\\n if fst_opset == 'opset1':\\n return self._compare_attributes_of_interpolate1(first, second)\\n else:\\n return self._compare_attributes_of_interpolate4(first, second)\",\n \"def __eq__(self, other):\\n\\n return (self.nodes[0].id == other.nodes[0].id) & \\\\\\n (self.nodes[1].id == other.nodes[1].id) & \\\\\\n (self.name == other.name)\",\n \"def are_the_same(node_before, node_after) -> bool:\\n\\n if node_before.algorithm != node_after.algorithm:\\n return False\\n elif not _is_output_name_same(node_before, node_after):\\n return False\\n else:\\n for attr in interested_attrs:\\n if _exists_attr(attr, node_before, node_after) == 1 or \\\\\\n _exists_attr(attr, node_before, node_after) == 2:\\n return False\\n elif _exists_attr(attr, node_before, node_after) == 12 and \\\\\\n node_before.attributes[attr] != node_after.attributes[attr]:\\n return False\\n return True\",\n \"def __eq__(self, other):\\n return type(self) == type(other) and self.node is other.node\",\n \"def __eq__(self, other):\\n return self.conn == other.conn and self.p1 == other.p1 and self.p2 == other.p2\",\n \"def check_topology(self, *args, **kwargs):\\n return _TestA_swig.cleanslate_sptr_check_topology(self, *args, **kwargs)\",\n \"def __eq__(self, other):\\n if isinstance(other, type(self)):\\n same_edges = self._edges == other._edges\\n same_weights = self._weights == other._weights\\n return same_edges and same_weights\\n else:\\n return False\",\n \"def __eq__(self, other):\\n if isinstance(other, DenseUnit):\\n return (Counter(self.dimension) == Counter(other.dimension) and Counter(self.points) == Counter(\\n other.points))\\n return False\",\n \"def _match_identical_nodes(self):\\n\\n for job_name_b in self._topo_b_nodes:\\n for job_name_a in self._unresolved_a_nodes:\\n if self._is_node_identical(job_name_a, job_name_b):\\n self._identical_nodes[job_name_b] = job_name_a\\n self._unresolved_a_nodes.remove(job_name_a)\\n self._unresolved_b_nodes.remove(job_name_b)\\n break\",\n \"def __eq__(self, other):\\n if isinstance(other, UnDirectedWeightedGraphEdge):\\n if self.head_vertex != other.head_vertex:\\n return False\\n elif self.tail_vertex != other.tail_vertex:\\n return False\\n elif self.weight != other.weight:\\n return False\\n return True\\n return NotImplemented\",\n \"def test_to_from_topology(self, molecule):\\n topology = molecule.to_topology()\\n molecule_copy = Molecule.from_topology(topology)\\n assert molecule == molecule_copy\",\n \"def test_to_from_topology(self, molecule):\\n topology = molecule.to_topology()\\n molecule_copy = Molecule.from_topology(topology)\\n assert molecule == molecule_copy\",\n \"def __eq__(self, other):\\n if isinstance(other, DirectedWeightedGraphEdge):\\n if self.head_vertex != other.head_vertex:\\n return False\\n elif self.tail_vertex != other.tail_vertex:\\n return False\\n elif self.weight != other.weight:\\n return False\\n return True\\n return NotImplemented\",\n \"def __eq__(self, other):\\n x_eq = self.x == other.x\\n y_eq = self.y == other.y\\n return x_eq and y_eq\",\n \"def __eq__(self, other):\\n x_eq = self.x == other.x\\n y_eq = self.y == other.y\\n return x_eq and y_eq\",\n \"def __ne__(self, other):\\n return np.all(self.grid != other.grid) or np.all(self.pos != other.pos)\",\n \"def __eq__(self, other):\\n if not isinstance(other, DFM):\\n return NotImplemented\\n # Compare domains first because we do *not* want matrices with\\n # different domains to be equal but e.g. a flint fmpz_mat and fmpq_mat\\n # with the same entries will compare equal.\\n return self.domain == other.domain and self.rep == other.rep\",\n \"def are_similar(first_coords: List[Tuple[int, int]], second_coords: List[Tuple[int, int]]) -> bool:\\n # Step 1: Get angles of each triangle\\n # Step 2: Compare grades of two triangles\\n # Step 3: If two angles are equal then first triangle is similar to second triangle\\n pass\",\n \"def assert_source_space_equal(src1, src2, msg=\\\"SourceSpace Dimension objects \\\"\\n \\\"unequal\\\"):\\n msg = \\\"%s:\\\" % msg\\n assert_array_equal(src1.vertno[0], src2.vertno[0], \\\"%s unequal lh vertno \\\"\\n \\\"(%r vs %r)\\\" % (msg, src1.vertno[0], src2.vertno[0]))\\n assert_array_equal(src1.vertno[1], src2.vertno[1], \\\"%s unequal rh vertno \\\"\\n \\\"(%r vs %r)\\\" % (msg, src1.vertno[1], src2.vertno[1]))\\n assert_equal(src1.subject, src2.subject, \\\"%s unequal subject (%r vs %r\\\"\\n \\\")\\\" % (msg, src1.subject, src2.subject))\\n assert_equal(src1.src, src2.src, \\\"%s unequal names (%r vs %r\\\"\\n \\\")\\\" % (msg, src1.src, src2.src))\\n assert_equal(src1.subjects_dir, src2.subjects_dir, \\\"%s unequal names (%r \\\"\\n \\\"vs %r)\\\" % (msg, src1.subjects_dir, src2.subjects_dir))\",\n \"def test_compare_old_to_new_method_to_create_trees(self):\\n nodes = util.generate_sequence_of_points(2, 2)\\n tree1 = kdtree.createNewTree(nodes)\\n kdtree.visualize(tree1)\\n \\n sel_axis = (lambda axis: axis)\\n tree2 = kdtree.createNewTree([[0.5, 0.5]],axis = 0, sel_axis= sel_axis)\\n tree2.split2([0.25, 0.5], axis = 1)\\n tree2.split2([0.75, 0.5], axis = 1)\\n \\n #left\\n tree2.split2([0.25, 0.25], axis = 0, sel_axis = sel_axis)\\n tree2.split2([0.25, 0.75], axis = 0, sel_axis = sel_axis)\\n \\n #right\\n tree2.split2([0.75, 0.25], axis = 0, sel_axis = sel_axis)\\n tree2.split2([0.75, 0.75], axis = 0, sel_axis = sel_axis)\\n \\n kdtree.visualize(tree2)\\n \\n for n in zip(kdtree.level_order(tree1), kdtree.level_order(tree2)):\\n self.assertEqual(n[0].data, n[1].data, \\\"elements not equal\\\")\\n \\n if n[0].data is not None and n[1].data is not None:\\n self.assertEqual(n[0].axis, n[1].axis, \\\"elements not equal\\\")\",\n \"def assertNodesEqual(self, first, second):\\n def get_attrs(l):\\n result = []\\n for n in l:\\n result.append((n.service, n.address, n.version, n.properties))\\n return result\\n self.assertEqual(get_attrs(first), get_attrs(second))\",\n \"def is_equal_to(self, another_labyrinth):\\n \\n if self.equals_list_nodes(self.list_empty_nodes, another_labyrinth.list_empty_nodes) and \\\\\\n self.equals_list_nodes(self.list_wall_nodes, another_labyrinth.list_wall_nodes) and \\\\\\n self.start_point.position_is_equal_to(another_labyrinth.start_point) and \\\\\\n self.exit_point.position_is_equal_to(another_labyrinth.exit_point):\\n return True\\n \\n else:\\n return False\",\n \"def test_other_side_mesh(self):\\n layered_volume = np.array(\\n [\\n [\\n [0, 0, 0, 0, 0],\\n [0, 0, 1, 1, 1],\\n [0, 1, 1, 0, 0],\\n [0, 1, 1, 1, 0],\\n [0, 0, 0, 0, 0],\\n ]\\n ]\\n )\\n\\n def quad(v1, v2, v3, v4):\\n \\\"\\\"\\\"counterclockwise winding faces to make quad\\\"\\\"\\\"\\n return [[v3, v2, v1], [v4, v3, v2]]\\n\\n top_mesh = trimesh.Trimesh(\\n vertices=np.array(\\n [\\n [0, 1, 5],\\n [1, 1, 5],\\n [0, 1, 2],\\n [1, 1, 2],\\n [0, 3.5, 1.5],\\n [1, 3.5, 1.5],\\n ]\\n ),\\n faces=np.concatenate([quad(0, 1, 3, 2), quad(2, 3, 5, 4)], axis=0),\\n )\\n\\n bot_mesh = trimesh.Trimesh(\\n vertices=np.array([[0, 2, 5], [1, 2, 5], [0, 4, 2], [1, 4, 2]]),\\n faces=quad(0, 1, 3, 2),\\n )\\n\\n up = [0, -1, 0]\\n dup = [0, -np.sqrt(0.5), -np.sqrt(0.5)]\\n nanvec = [np.nan, np.nan, np.nan]\\n vectors = np.array(\\n [\\n [\\n [nanvec, nanvec, nanvec, nanvec, nanvec],\\n [nanvec, nanvec, dup, up, up],\\n [nanvec, dup, dup, nanvec, nanvec],\\n [nanvec, dup, up, up, nanvec],\\n [nanvec, nanvec, nanvec, nanvec, nanvec],\\n ]\\n ]\\n )\\n\\n distances, something_wrong = tested.distances_from_voxels_to_meshes_wrt_dir(\\n layered_volume, [top_mesh, bot_mesh], vectors\\n )\\n\\n npt.assert_array_almost_equal(distances, get_expected_distances_to_meshes())\\n assert not np.any(something_wrong)\",\n \"def __eq__(self, other):\\n if isinstance(other, GraphEdge):\\n return self.head_vertex == other.head_vertex and self.tail_vertex == other.tail_vertex\\n return NotImplemented\",\n \"def check_form_match(\\n cls,\\n tensor1=None,\\n tensor2=None,\\n qhape1=None,\\n shape1=None,\\n dirs1=None,\\n qhape2=None,\\n shape2=None,\\n dirs2=None,\\n qodulus=None,\\n ):\\n if tensor1 is not None:\\n qhape1 = tensor1.qhape\\n shape1 = tensor1.shape\\n dirs1 = tensor1.dirs\\n if tensor2 is not None:\\n qhape2 = tensor2.qhape\\n shape2 = tensor2.shape\\n dirs2 = tensor2.dirs\\n if not (\\n len(qhape1)\\n == len(qhape2)\\n == len(shape1)\\n == len(shape2)\\n == len(dirs1)\\n == len(dirs2)\\n ):\\n return False\\n # Loop over the indices of both tensors in tandem.\\n for d1, qim1, dim1, d2, qim2, dim2 in zip(\\n dirs1, qhape1, shape1, dirs2, qhape2, shape2\\n ):\\n # This is almost like compatible_indices, but for the missing minus\\n # sign when building o_qim.\\n qim2 = [d1 * d2 * q for q in qim2]\\n if qodulus is not None:\\n qim2 = [q % qodulus for q in qim2]\\n qimdim1 = set(zip(qim1, dim1))\\n qimdim2 = set(zip(qim2, dim2))\\n if not qimdim1 == qimdim2:\\n return False\\n return True\",\n \"def test_basic_two_point_graph(self):\\n self.assertEquals(\\n Dijkstras().dijkstras(self.g1, 'a', 'b'), (1, ['a', 'b']))\",\n \"def __eq__(self, other):\\r\\n try:\\r\\n return self.gd == other.gd and self.boundariesrules == other.boundariesrules\\r\\n except AttributeError:\\r\\n return False\",\n \"def test_canonize_neighborhood_same_graph(nauty, ref_graph, ref_graph2):\\n key = nauty.canonize_neighborhood(ref_graph, 2, 1)\\n key2 = nauty.canonize_neighborhood(ref_graph2, 3, 1)\\n assert key == key2\",\n \"def _vertices_are_equal(\\n vertices1: List[np.ndarray], vertices2: List[np.ndarray]\\n) -> bool:\\n if len(vertices1) != len(vertices2):\\n return False\\n diff = vertices1 - vertices2\\n if np.abs(np.max(diff)) < ways_are_equal_tolerance:\\n return True\\n return False\",\n \"def __eq__(self, other):\\n # check equality of names since names are unique identifiers of nodes\\n return self.name.__eq__(other.get_name())\",\n \"def __eq__(self, other):\\n # check equality of names since names are unique identifiers of nodes\\n return self.name.__eq__(other.get_name())\",\n \"def brepalgo_IsTopologicallyValid(*args):\\n return _BRepAlgo.brepalgo_IsTopologicallyValid(*args)\",\n \"def __eq__(self, other):\\n from numpy.linalg import norm\\n from numpy import array\\n\\n # Upcast to an Atom\\n othercomp = Atom(other)\\n\\n # Compare Symbols\\n sym1 = self.sym\\n sym2 = othercomp.sym\\n if sym1 != sym2:\\n return False\\n\\n # Compare position\\n pos1 = array(self.get_position())\\n pos2 = array(othercomp.get_position())\\n\\n return norm(pos1 - pos2) < 1e-3\",\n \"def __eq__(self, other):\\n return self.x == other.x and self.y == other.y\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7391109","0.69211054","0.66308445","0.6267532","0.6095765","0.5980267","0.5966569","0.5945673","0.59418166","0.5940273","0.59177405","0.5912851","0.59052336","0.59029365","0.5899751","0.5899751","0.589094","0.587771","0.58488256","0.5842145","0.5818348","0.5813265","0.5811964","0.5805476","0.5787111","0.5774935","0.577336","0.5771975","0.57696676","0.57564896","0.5743296","0.5742526","0.5733099","0.57326764","0.5713856","0.57041633","0.56934845","0.56815714","0.567927","0.5678706","0.56779504","0.5671088","0.56705916","0.56583005","0.5654814","0.56537473","0.5653324","0.56402177","0.5639907","0.56384695","0.5635804","0.5629337","0.562037","0.562037","0.56089336","0.5605169","0.5602651","0.5594647","0.5590881","0.55801964","0.5576192","0.55750465","0.5573356","0.55681205","0.5561084","0.5561084","0.5558202","0.55570614","0.5553649","0.5552477","0.5550244","0.5537166","0.55367064","0.5533059","0.5530732","0.5528893","0.5526104","0.5526104","0.5516893","0.5513675","0.5513675","0.5507421","0.55036205","0.54999924","0.54953986","0.549401","0.5493579","0.54898095","0.5483943","0.5482341","0.5477842","0.54772615","0.54676944","0.5459728","0.54583055","0.54557234","0.54557234","0.54542905","0.5453643","0.5449166"],"string":"[\n \"0.7391109\",\n \"0.69211054\",\n \"0.66308445\",\n \"0.6267532\",\n \"0.6095765\",\n \"0.5980267\",\n \"0.5966569\",\n \"0.5945673\",\n \"0.59418166\",\n \"0.5940273\",\n \"0.59177405\",\n \"0.5912851\",\n \"0.59052336\",\n \"0.59029365\",\n \"0.5899751\",\n \"0.5899751\",\n \"0.589094\",\n \"0.587771\",\n \"0.58488256\",\n \"0.5842145\",\n \"0.5818348\",\n \"0.5813265\",\n \"0.5811964\",\n \"0.5805476\",\n \"0.5787111\",\n \"0.5774935\",\n \"0.577336\",\n \"0.5771975\",\n \"0.57696676\",\n \"0.57564896\",\n \"0.5743296\",\n \"0.5742526\",\n \"0.5733099\",\n \"0.57326764\",\n \"0.5713856\",\n \"0.57041633\",\n \"0.56934845\",\n \"0.56815714\",\n \"0.567927\",\n \"0.5678706\",\n \"0.56779504\",\n \"0.5671088\",\n \"0.56705916\",\n \"0.56583005\",\n \"0.5654814\",\n \"0.56537473\",\n \"0.5653324\",\n \"0.56402177\",\n \"0.5639907\",\n \"0.56384695\",\n \"0.5635804\",\n \"0.5629337\",\n \"0.562037\",\n \"0.562037\",\n \"0.56089336\",\n \"0.5605169\",\n \"0.5602651\",\n \"0.5594647\",\n \"0.5590881\",\n \"0.55801964\",\n \"0.5576192\",\n \"0.55750465\",\n \"0.5573356\",\n \"0.55681205\",\n \"0.5561084\",\n \"0.5561084\",\n \"0.5558202\",\n \"0.55570614\",\n \"0.5553649\",\n \"0.5552477\",\n \"0.5550244\",\n \"0.5537166\",\n \"0.55367064\",\n \"0.5533059\",\n \"0.5530732\",\n \"0.5528893\",\n \"0.5526104\",\n \"0.5526104\",\n \"0.5516893\",\n \"0.5513675\",\n \"0.5513675\",\n \"0.5507421\",\n \"0.55036205\",\n \"0.54999924\",\n \"0.54953986\",\n \"0.549401\",\n \"0.5493579\",\n \"0.54898095\",\n \"0.5483943\",\n \"0.5482341\",\n \"0.5477842\",\n \"0.54772615\",\n \"0.54676944\",\n \"0.5459728\",\n \"0.54583055\",\n \"0.54557234\",\n \"0.54557234\",\n \"0.54542905\",\n \"0.5453643\",\n \"0.5449166\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.651133"},"document_rank":{"kind":"string","value":"3"}}},{"rowIdx":6197,"cells":{"query":{"kind":"string","value":"Not equal operator. Seems to be required in addition to __eq__ to avoid 'cornercase' behaviors."},"document":{"kind":"string","value":"def __ne__(self, other):\n result = self.__eq__(other)\n if result is NotImplemented:\n return result\n return not result"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def __ne__(self, other):\n return not (self == other) # opposite of __eq__","def __ne__(self, other):\n return not (self == other) # opposite of __eq__","def __ne__(self, rhs):\n return not self.__eq__(rhs)","def __ne__(self, other):\r\n return not self.__eq__(other)","def __ne__(self, other):\r\n return not self.__eq__(other)","def __ne__(self, other):\r\n return not self.__eq__(other)","def __ne__(self, other):\r\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def ne (self, other):\n return not (self == other) # opposite of eq","def __ne__(self, other):\n return not(self == other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self.__eq__(other)","def __ne__(self, other):\n return not self == other","def __ne__(self,other):\n return not (self == other)","def __ne__(self, other):\n return not_equal(self, other)","def __ne__(self, other):\n\t\treturn not self.__eq__(other)","def __neq__(self, other): \n return not self == other","def __ne__(self, other):\r\n\t\treturn not(self.__eq__(other))","def __ne__(self, other):\r\n return not (self == other)","def __ne__(self,other):\n return not self == other","def __ne__(self, other):\n return not (self == other)","def __ne__(self, other):\n return not (self == other)","def __ne__(self, other):\n return not (self == other)","def __ne__(self, other):\r\n return not self == other","def __ne__(self, other):\r\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n\n return not self.__eq__(other)","def __ne__(self, other):\n\n return not self.__eq__(other)","def not_equal(lhs, rhs):\n return _make.not_equal(lhs, rhs)","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other","def __ne__(self, other):\n return not self == other"],"string":"[\n \"def __ne__(self, other):\\n return not (self == other) # opposite of __eq__\",\n \"def __ne__(self, other):\\n return not (self == other) # opposite of __eq__\",\n \"def __ne__(self, rhs):\\n return not self.__eq__(rhs)\",\n \"def __ne__(self, other):\\r\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\r\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\r\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\r\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def ne (self, other):\\n return not (self == other) # opposite of eq\",\n \"def __ne__(self, other):\\n return not(self == other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self,other):\\n return not (self == other)\",\n \"def __ne__(self, other):\\n return not_equal(self, other)\",\n \"def __ne__(self, other):\\n\\t\\treturn not self.__eq__(other)\",\n \"def __neq__(self, other): \\n return not self == other\",\n \"def __ne__(self, other):\\r\\n\\t\\treturn not(self.__eq__(other))\",\n \"def __ne__(self, other):\\r\\n return not (self == other)\",\n \"def __ne__(self,other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not (self == other)\",\n \"def __ne__(self, other):\\n return not (self == other)\",\n \"def __ne__(self, other):\\n return not (self == other)\",\n \"def __ne__(self, other):\\r\\n return not self == other\",\n \"def __ne__(self, other):\\r\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n\\n return not self.__eq__(other)\",\n \"def __ne__(self, other):\\n\\n return not self.__eq__(other)\",\n \"def not_equal(lhs, rhs):\\n return _make.not_equal(lhs, rhs)\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\",\n \"def __ne__(self, other):\\n return not self == other\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.8394335","0.8386683","0.8160081","0.81121725","0.81121725","0.81121725","0.81121725","0.8075682","0.80685496","0.80672383","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8056072","0.8032567","0.8025684","0.80254567","0.80094445","0.80091685","0.8005091","0.79911494","0.7986639","0.7986177","0.7986177","0.7986177","0.79824907","0.79824907","0.7960055","0.7960055","0.79299897","0.7900583","0.7900583","0.78992826","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294","0.78978294"],"string":"[\n \"0.8394335\",\n \"0.8386683\",\n \"0.8160081\",\n \"0.81121725\",\n \"0.81121725\",\n \"0.81121725\",\n \"0.81121725\",\n \"0.8075682\",\n \"0.80685496\",\n \"0.80672383\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8056072\",\n \"0.8032567\",\n \"0.8025684\",\n \"0.80254567\",\n \"0.80094445\",\n \"0.80091685\",\n \"0.8005091\",\n \"0.79911494\",\n \"0.7986639\",\n \"0.7986177\",\n \"0.7986177\",\n \"0.7986177\",\n \"0.79824907\",\n \"0.79824907\",\n \"0.7960055\",\n \"0.7960055\",\n \"0.79299897\",\n \"0.7900583\",\n \"0.7900583\",\n \"0.78992826\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\",\n \"0.78978294\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":6198,"cells":{"query":{"kind":"string","value":"True if ghost layer length is not zero."},"document":{"kind":"string","value":"def has_ghosts(self):\n return not np.all(self.mesh.discretization.ghosts == 0)"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def empty(self):\n return len(self.layers) == 0","def is_empty(self):\n return ch.prod(ch.tensor(self.x.shape)).item() == 0","def is_ghost(self):\n\t\treturn False","def is_trivial(self):\n return self.dims == 0","def is_empty(self) -> bool:\n return self.num_grna() == 0","def _is_empty(self):\n if self.allocated_spaces == 0:\n return True\n else:\n return False","def is_ghost(self):\n return self._is_ghost","def is_empty(self):\n return self._connected and self._length == 1 and self._degree > 1","def is_full_dimensional(self):\n\n return self.affine_dimension() == self.space_dimension()","def _is_empty(shape):\n return F.shape_mul(shape) == 0","def is_empty (self):\n return len(self.network) == 0","def empty(self) -> bool:\n return self.sk1_len==0","def empty(self):\n return self.numba_rtree._bounds_tree.shape[0] == 0","def is_buffer_empty(self): \n if self.buffer.shape == (0, 5):\n return True\n else:\n return False","def _is_empty(self):\n return self.size == 0","def empty(self):\r\n return self.getSize() == 0","def is_full(self):\n return self.remaining_space_in_hold() == 0","def isEmpty(self):\n return len(self.mask) == 0","def is_empty(self):\n if numpy.any(numpy.logical_not(self.shape)):\n return True\n if len(self.__m__) == 0:\n return True\n return False","def is_empty(self):\n\t\treturn (self._size == 0)","def is_empty(self):\n return self.fodder == 0","def is_null(self):\n return self.length2 < pygonal.EPSILON2","def is_empty(self):\n\t\treturn self._size == 0","def is_empty(self):\n return self.size == 0","def is_empty(self):\n return self.size == 0","def is_empty(self):\n return self.size == 0","def is_empty(self):\n return self.size == 0","def is_empty(self):\n return self.size == 0","def is_zero(self):\n return self._x == 0 and self._y == 0","def is_empty(self):\n return len(self.__nodes) == 0","def is_empty(self):\n return self._size == 0","def isEmpty(self):\n return self._N == 0","def is_Empty(self):\n return self.size == 0","def is_empty(self):\r\n return self._size == 0","def is_empty(self):\r\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return self._size == 0","def is_empty(self):\n return len(self.container) == 0","def is_empty(self):\n return self.__size == 0","def is_full(self):\n return len(self.__occupied_slots__) >= self.__size__","def is_empty(self):\r\n\r\n return self._size == 0","def CheckGhost(self,G):\n\t\tif(P.x==G.x and P.y==G.y):\n\t\t\treturn 1\n\t\treturn 0","def is_full(self):\n return len(self.walls) == 4","def is_empty(self) -> bool:\n return self.size_bytes == 0","def is_dicotic(G):\n return G.n == 0","def empty(self):\n return self._size is 0","def is_empty(self):\r\n if self.size == 0:\r\n return True\r\n return False","def is_compact(self):\n return self.n_rays()==0 and self.n_lines()==0","def _is_full(self):\n if self.allocated_spaces == self.capacity:\n return True\n elif self.allocated_spaces < self.capacity:\n return False","def is_empty(self):\n return self.n==0","def empty(self):\n return self.size == 0","def empty(self):\n return self.size == 0","def isZero(self):\n return self.count == 0","def is_empty(self):\n if self._size == 0:\n return True\n return False","def is_empty(self):\n return self.size == []","def check_empty(self, coord):\n x, y, z = coord\n if self.perlin_3d(x, y, z) <= 0:\n return True\n else:\n return False","def isEmpty(self):\n\t\tif len(self.chickWeight) == 0:\n\t\t\treturn True\n\t\telse:\n\t\t\treturn False","def filled(self):\n return len(self) == self.length","def isDimensionless(self):\n return _libsbml.Unit_isDimensionless(self)","def is_empty(self) -> bool:\r\n return self.size == 0","def is_empty(self):\n return self._sum() == 0","def is_empty(self):\n return len(self.steps) == 0","def has_zero_length_leaves(self):\n for l in self.leaves():\n if l.has_zero_length:\n return True\n return False","def empty(self) -> bool:\n return self.data.get_size() == 0","def isFull(self) -> bool:\n return self.size == self.maxlen","def empty(self) -> bool:\n return len(self.input_stack) == 0 and len(self.output_stack) == 0","def is_full(self):\n return len(self._data) == 1","def is_full(self):\n return self.idx == self.len","def is_empty(self):\n return self.__len__() == 0","def isFull(self):\n if len(self._data) == self._length:\n return True\n else:\n return False","def is_full(self):\n\n return self.count == len(self.array)","def is_empty(self):\n return not self.size()","def is_full(self):\n return self.top == self.size - 1","def isEmpty(self):\n\n if hasattr(self, \"e0\"):\n return False\n else:\n if not self.e0.isEmpty():\n return False\n\n if hasattr(self, \"e1\"):\n return False\n else:\n if not self.e2.isEmpty():\n return False\n\n if hasattr(self, \"e2\"):\n return False\n else:\n if not self.e2.isEmpty():\n return False\n\n if hasattr(self, \"maximumHorizontalProjection\"):\n return False\n\n if hasattr(self, \"maximumVerticalProjection\"):\n return False\n\n if hasattr(self, \"equivalentHorizontalRadius\"):\n return False\n\n return True","def isFull(self):\n return self.rear == self.size","def is_empty(self):\n if self.length == 0:\n return True\n else:\n return False","def not_empty(entry):\n gt_boxes = entry['boxes']\n return gt_boxes.shape[0] > 0","def has_geom(self):\n return bool(self.give_geom())","def is_empty( self ):\n \n return len(self.__deck) == 0","def isEmpty(self):\n return self.__size == 0","def is_empty(self) -> bool:\n if (self._pax_with_carry_on.is_empty()\n and self._pax_without_carry_on.is_empty()):\n\n # no pax in the plane\n return True\n\n return False","def is_empty(self):\n return len(self.top) == 0","def isEmpty(self):\n return self.size == 0","def isEmpty(self):\n return self.size == 0","def is_full(self) -> bool:\n return self._array[0].all()","def _has_coordinates_and_gradient(self) -> bool:\n return self._coords is not None and self._coords.g is not None"],"string":"[\n \"def empty(self):\\n return len(self.layers) == 0\",\n \"def is_empty(self):\\n return ch.prod(ch.tensor(self.x.shape)).item() == 0\",\n \"def is_ghost(self):\\n\\t\\treturn False\",\n \"def is_trivial(self):\\n return self.dims == 0\",\n \"def is_empty(self) -> bool:\\n return self.num_grna() == 0\",\n \"def _is_empty(self):\\n if self.allocated_spaces == 0:\\n return True\\n else:\\n return False\",\n \"def is_ghost(self):\\n return self._is_ghost\",\n \"def is_empty(self):\\n return self._connected and self._length == 1 and self._degree > 1\",\n \"def is_full_dimensional(self):\\n\\n return self.affine_dimension() == self.space_dimension()\",\n \"def _is_empty(shape):\\n return F.shape_mul(shape) == 0\",\n \"def is_empty (self):\\n return len(self.network) == 0\",\n \"def empty(self) -> bool:\\n return self.sk1_len==0\",\n \"def empty(self):\\n return self.numba_rtree._bounds_tree.shape[0] == 0\",\n \"def is_buffer_empty(self): \\n if self.buffer.shape == (0, 5):\\n return True\\n else:\\n return False\",\n \"def _is_empty(self):\\n return self.size == 0\",\n \"def empty(self):\\r\\n return self.getSize() == 0\",\n \"def is_full(self):\\n return self.remaining_space_in_hold() == 0\",\n \"def isEmpty(self):\\n return len(self.mask) == 0\",\n \"def is_empty(self):\\n if numpy.any(numpy.logical_not(self.shape)):\\n return True\\n if len(self.__m__) == 0:\\n return True\\n return False\",\n \"def is_empty(self):\\n\\t\\treturn (self._size == 0)\",\n \"def is_empty(self):\\n return self.fodder == 0\",\n \"def is_null(self):\\n return self.length2 < pygonal.EPSILON2\",\n \"def is_empty(self):\\n\\t\\treturn self._size == 0\",\n \"def is_empty(self):\\n return self.size == 0\",\n \"def is_empty(self):\\n return self.size == 0\",\n \"def is_empty(self):\\n return self.size == 0\",\n \"def is_empty(self):\\n return self.size == 0\",\n \"def is_empty(self):\\n return self.size == 0\",\n \"def is_zero(self):\\n return self._x == 0 and self._y == 0\",\n \"def is_empty(self):\\n return len(self.__nodes) == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def isEmpty(self):\\n return self._N == 0\",\n \"def is_Empty(self):\\n return self.size == 0\",\n \"def is_empty(self):\\r\\n return self._size == 0\",\n \"def is_empty(self):\\r\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return self._size == 0\",\n \"def is_empty(self):\\n return len(self.container) == 0\",\n \"def is_empty(self):\\n return self.__size == 0\",\n \"def is_full(self):\\n return len(self.__occupied_slots__) >= self.__size__\",\n \"def is_empty(self):\\r\\n\\r\\n return self._size == 0\",\n \"def CheckGhost(self,G):\\n\\t\\tif(P.x==G.x and P.y==G.y):\\n\\t\\t\\treturn 1\\n\\t\\treturn 0\",\n \"def is_full(self):\\n return len(self.walls) == 4\",\n \"def is_empty(self) -> bool:\\n return self.size_bytes == 0\",\n \"def is_dicotic(G):\\n return G.n == 0\",\n \"def empty(self):\\n return self._size is 0\",\n \"def is_empty(self):\\r\\n if self.size == 0:\\r\\n return True\\r\\n return False\",\n \"def is_compact(self):\\n return self.n_rays()==0 and self.n_lines()==0\",\n \"def _is_full(self):\\n if self.allocated_spaces == self.capacity:\\n return True\\n elif self.allocated_spaces < self.capacity:\\n return False\",\n \"def is_empty(self):\\n return self.n==0\",\n \"def empty(self):\\n return self.size == 0\",\n \"def empty(self):\\n return self.size == 0\",\n \"def isZero(self):\\n return self.count == 0\",\n \"def is_empty(self):\\n if self._size == 0:\\n return True\\n return False\",\n \"def is_empty(self):\\n return self.size == []\",\n \"def check_empty(self, coord):\\n x, y, z = coord\\n if self.perlin_3d(x, y, z) <= 0:\\n return True\\n else:\\n return False\",\n \"def isEmpty(self):\\n\\t\\tif len(self.chickWeight) == 0:\\n\\t\\t\\treturn True\\n\\t\\telse:\\n\\t\\t\\treturn False\",\n \"def filled(self):\\n return len(self) == self.length\",\n \"def isDimensionless(self):\\n return _libsbml.Unit_isDimensionless(self)\",\n \"def is_empty(self) -> bool:\\r\\n return self.size == 0\",\n \"def is_empty(self):\\n return self._sum() == 0\",\n \"def is_empty(self):\\n return len(self.steps) == 0\",\n \"def has_zero_length_leaves(self):\\n for l in self.leaves():\\n if l.has_zero_length:\\n return True\\n return False\",\n \"def empty(self) -> bool:\\n return self.data.get_size() == 0\",\n \"def isFull(self) -> bool:\\n return self.size == self.maxlen\",\n \"def empty(self) -> bool:\\n return len(self.input_stack) == 0 and len(self.output_stack) == 0\",\n \"def is_full(self):\\n return len(self._data) == 1\",\n \"def is_full(self):\\n return self.idx == self.len\",\n \"def is_empty(self):\\n return self.__len__() == 0\",\n \"def isFull(self):\\n if len(self._data) == self._length:\\n return True\\n else:\\n return False\",\n \"def is_full(self):\\n\\n return self.count == len(self.array)\",\n \"def is_empty(self):\\n return not self.size()\",\n \"def is_full(self):\\n return self.top == self.size - 1\",\n \"def isEmpty(self):\\n\\n if hasattr(self, \\\"e0\\\"):\\n return False\\n else:\\n if not self.e0.isEmpty():\\n return False\\n\\n if hasattr(self, \\\"e1\\\"):\\n return False\\n else:\\n if not self.e2.isEmpty():\\n return False\\n\\n if hasattr(self, \\\"e2\\\"):\\n return False\\n else:\\n if not self.e2.isEmpty():\\n return False\\n\\n if hasattr(self, \\\"maximumHorizontalProjection\\\"):\\n return False\\n\\n if hasattr(self, \\\"maximumVerticalProjection\\\"):\\n return False\\n\\n if hasattr(self, \\\"equivalentHorizontalRadius\\\"):\\n return False\\n\\n return True\",\n \"def isFull(self):\\n return self.rear == self.size\",\n \"def is_empty(self):\\n if self.length == 0:\\n return True\\n else:\\n return False\",\n \"def not_empty(entry):\\n gt_boxes = entry['boxes']\\n return gt_boxes.shape[0] > 0\",\n \"def has_geom(self):\\n return bool(self.give_geom())\",\n \"def is_empty( self ):\\n \\n return len(self.__deck) == 0\",\n \"def isEmpty(self):\\n return self.__size == 0\",\n \"def is_empty(self) -> bool:\\n if (self._pax_with_carry_on.is_empty()\\n and self._pax_without_carry_on.is_empty()):\\n\\n # no pax in the plane\\n return True\\n\\n return False\",\n \"def is_empty(self):\\n return len(self.top) == 0\",\n \"def isEmpty(self):\\n return self.size == 0\",\n \"def isEmpty(self):\\n return self.size == 0\",\n \"def is_full(self) -> bool:\\n return self._array[0].all()\",\n \"def _has_coordinates_and_gradient(self) -> bool:\\n return self._coords is not None and self._coords.g is not None\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7561698","0.72112876","0.7065583","0.7046145","0.7030016","0.69214237","0.6830907","0.6792221","0.67822015","0.67809653","0.67568576","0.6733361","0.6685363","0.6656976","0.6638194","0.6637561","0.6615059","0.660577","0.65900713","0.6586594","0.658374","0.65624404","0.6556189","0.6555887","0.6555887","0.6555887","0.6555887","0.6555887","0.6554751","0.6553147","0.65424526","0.6529356","0.6527895","0.6522761","0.6522761","0.65139335","0.65139335","0.65139335","0.65139335","0.65139335","0.65139335","0.65139335","0.65139335","0.65139335","0.65139335","0.65139335","0.65139335","0.65139335","0.65139335","0.65139335","0.65139335","0.6506465","0.6496786","0.6494738","0.6485843","0.64812475","0.6473082","0.6467284","0.6452752","0.6443414","0.6434815","0.6417093","0.6413712","0.6413563","0.64111716","0.64111716","0.6410123","0.64054316","0.6391819","0.6389463","0.638181","0.6381135","0.63801223","0.6374314","0.63723606","0.6370839","0.636772","0.63646597","0.6364129","0.6361815","0.63601375","0.63595015","0.6357582","0.635688","0.63555336","0.63554543","0.6349201","0.6348019","0.6343928","0.6341595","0.63391954","0.63207173","0.6313549","0.6310862","0.63082886","0.63030326","0.6302988","0.6302988","0.63005644","0.6299385"],"string":"[\n \"0.7561698\",\n \"0.72112876\",\n \"0.7065583\",\n \"0.7046145\",\n \"0.7030016\",\n \"0.69214237\",\n \"0.6830907\",\n \"0.6792221\",\n \"0.67822015\",\n \"0.67809653\",\n \"0.67568576\",\n \"0.6733361\",\n \"0.6685363\",\n \"0.6656976\",\n \"0.6638194\",\n \"0.6637561\",\n \"0.6615059\",\n \"0.660577\",\n \"0.65900713\",\n \"0.6586594\",\n \"0.658374\",\n \"0.65624404\",\n \"0.6556189\",\n \"0.6555887\",\n \"0.6555887\",\n \"0.6555887\",\n \"0.6555887\",\n \"0.6555887\",\n \"0.6554751\",\n \"0.6553147\",\n \"0.65424526\",\n \"0.6529356\",\n \"0.6527895\",\n \"0.6522761\",\n \"0.6522761\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.65139335\",\n \"0.6506465\",\n \"0.6496786\",\n \"0.6494738\",\n \"0.6485843\",\n \"0.64812475\",\n \"0.6473082\",\n \"0.6467284\",\n \"0.6452752\",\n \"0.6443414\",\n \"0.6434815\",\n \"0.6417093\",\n \"0.6413712\",\n \"0.6413563\",\n \"0.64111716\",\n \"0.64111716\",\n \"0.6410123\",\n \"0.64054316\",\n \"0.6391819\",\n \"0.6389463\",\n \"0.638181\",\n \"0.6381135\",\n \"0.63801223\",\n \"0.6374314\",\n \"0.63723606\",\n \"0.6370839\",\n \"0.636772\",\n \"0.63646597\",\n \"0.6364129\",\n \"0.6361815\",\n \"0.63601375\",\n \"0.63595015\",\n \"0.6357582\",\n \"0.635688\",\n \"0.63555336\",\n \"0.63554543\",\n \"0.6349201\",\n \"0.6348019\",\n \"0.6343928\",\n \"0.6341595\",\n \"0.63391954\",\n \"0.63207173\",\n \"0.6313549\",\n \"0.6310862\",\n \"0.63082886\",\n \"0.63030326\",\n \"0.6302988\",\n \"0.6302988\",\n \"0.63005644\",\n \"0.6299385\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.72264445"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":6199,"cells":{"query":{"kind":"string","value":"return the id of the present topology. This id is unique among all defined topologies."},"document":{"kind":"string","value":"def get_id(self):\n return self.__id"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["def unique_id(self) -> str:\n return str(self.coordinator.gios.station_id)","def topology_name(self):\n return self._topology_name","def topology(self):\n return self._topology","def portlet_id(self):\n return id(self)","def establish_id(self):\n if self.config.node_id is None:\n self.config.node_id = str(uuid4()).replace('-', '')\n return self.config.node_id","def id(self):\n return self.proto.id","def id(self):\n if self.cloudserver:\n return self.cloudserver.id\n else:\n return None","def idstring(self):\n return self.server.idstring(self)","def unique_id(self) -> str | None:\n return f\"{self._station_id}_{self._fuel_type}\"","def id(self):\n return id(self._component)","def unique_id(self) -> str:\n return f\"{self._host}_{self._name}_{self._unique_id}\"","def station_id(self) -> str:\n return self._station_id","def unique_id(self):\n return '{}-{}-{}'.format(self.airly.latitude, self.airly.longitude,\n self.type)","def unique_id(self):\n return self.heater.id + \"_switch\"","def depmap_id(self) -> str:\n return self._depmap_id","def unique_id(self) -> str:\n return f\"{self._device.mac}_{self._router.config_entry.entry_id}\"","def unique_id(self):\n return '{}-{}-{}'.format(self._latitude, self._longitude, self._type)","def topology(self):\n return self._h5[TOPOLOGY][()]","def id(self) -> int:\n\t\t# pylint: disable=invalid-name\n\t\treturn self._oid","def transit_router_id(self) -> pulumi.Output[str]:\n return pulumi.get(self, \"transit_router_id\")","def transit_router_id(self) -> pulumi.Output[str]:\n return pulumi.get(self, \"transit_router_id\")","def id(self): \n if self.cloudnet:\n return self.cloudnet.id\n else:\n return None","def id(self) -> str:\n return self._pipeline_definition.get(\"id\")","def dag_id(self):\n if self.parallelize_task:\n return f'{self.job_id_extension.get_parallel(self.job_id)}'\n else:\n return f'{self.job_id_extension.get_preparation(self.job_id)}'","def unique_id(self) -> str | None:\n return self._config[CONF_ID]","def get_id(self):\n\n\t\treturn self.__id","def host_id(self) -> str:\n return pulumi.get(self, \"host_id\")","def getid(self):\n if self.Id is None:\n return self.internalid\n else:\n return self.Id","def getid(self):\n if self.Id is None:\n return self.internalid\n else:\n return self.Id","def getid(self):\n if self.Id is None:\n return self.internalid\n else:\n return self.Id","def getid(self):\n if self.Id is None:\n return self.internalid\n else:\n return self.Id","def getid(self):\n if self.Id is None:\n return self.internalid\n else:\n return self.Id","def getid(self):\n if self.Id is None:\n return self.internalid\n else:\n return self.Id","def getId(self):\n return _libsbml.Port_getId(self)","def unique_id(self):\n return self._id","def unique_id(self):\n return self._id","def id(self) -> Optional[int]:\n return self.__id","def id(self) -> str:\n return self._id # type: ignore[return-value]","def mesh_id(self) -> pulumi.Output[str]:\n return pulumi.get(self, \"mesh_id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")","def id(self) -> str:\n return pulumi.get(self, \"id\")"],"string":"[\n \"def unique_id(self) -> str:\\n return str(self.coordinator.gios.station_id)\",\n \"def topology_name(self):\\n return self._topology_name\",\n \"def topology(self):\\n return self._topology\",\n \"def portlet_id(self):\\n return id(self)\",\n \"def establish_id(self):\\n if self.config.node_id is None:\\n self.config.node_id = str(uuid4()).replace('-', '')\\n return self.config.node_id\",\n \"def id(self):\\n return self.proto.id\",\n \"def id(self):\\n if self.cloudserver:\\n return self.cloudserver.id\\n else:\\n return None\",\n \"def idstring(self):\\n return self.server.idstring(self)\",\n \"def unique_id(self) -> str | None:\\n return f\\\"{self._station_id}_{self._fuel_type}\\\"\",\n \"def id(self):\\n return id(self._component)\",\n \"def unique_id(self) -> str:\\n return f\\\"{self._host}_{self._name}_{self._unique_id}\\\"\",\n \"def station_id(self) -> str:\\n return self._station_id\",\n \"def unique_id(self):\\n return '{}-{}-{}'.format(self.airly.latitude, self.airly.longitude,\\n self.type)\",\n \"def unique_id(self):\\n return self.heater.id + \\\"_switch\\\"\",\n \"def depmap_id(self) -> str:\\n return self._depmap_id\",\n \"def unique_id(self) -> str:\\n return f\\\"{self._device.mac}_{self._router.config_entry.entry_id}\\\"\",\n \"def unique_id(self):\\n return '{}-{}-{}'.format(self._latitude, self._longitude, self._type)\",\n \"def topology(self):\\n return self._h5[TOPOLOGY][()]\",\n \"def id(self) -> int:\\n\\t\\t# pylint: disable=invalid-name\\n\\t\\treturn self._oid\",\n \"def transit_router_id(self) -> pulumi.Output[str]:\\n return pulumi.get(self, \\\"transit_router_id\\\")\",\n \"def transit_router_id(self) -> pulumi.Output[str]:\\n return pulumi.get(self, \\\"transit_router_id\\\")\",\n \"def id(self): \\n if self.cloudnet:\\n return self.cloudnet.id\\n else:\\n return None\",\n \"def id(self) -> str:\\n return self._pipeline_definition.get(\\\"id\\\")\",\n \"def dag_id(self):\\n if self.parallelize_task:\\n return f'{self.job_id_extension.get_parallel(self.job_id)}'\\n else:\\n return f'{self.job_id_extension.get_preparation(self.job_id)}'\",\n \"def unique_id(self) -> str | None:\\n return self._config[CONF_ID]\",\n \"def get_id(self):\\n\\n\\t\\treturn self.__id\",\n \"def host_id(self) -> str:\\n return pulumi.get(self, \\\"host_id\\\")\",\n \"def getid(self):\\n if self.Id is None:\\n return self.internalid\\n else:\\n return self.Id\",\n \"def getid(self):\\n if self.Id is None:\\n return self.internalid\\n else:\\n return self.Id\",\n \"def getid(self):\\n if self.Id is None:\\n return self.internalid\\n else:\\n return self.Id\",\n \"def getid(self):\\n if self.Id is None:\\n return self.internalid\\n else:\\n return self.Id\",\n \"def getid(self):\\n if self.Id is None:\\n return self.internalid\\n else:\\n return self.Id\",\n \"def getid(self):\\n if self.Id is None:\\n return self.internalid\\n else:\\n return self.Id\",\n \"def getId(self):\\n return _libsbml.Port_getId(self)\",\n \"def unique_id(self):\\n return self._id\",\n \"def unique_id(self):\\n return self._id\",\n \"def id(self) -> Optional[int]:\\n return self.__id\",\n \"def id(self) -> str:\\n return self._id # type: ignore[return-value]\",\n \"def mesh_id(self) -> pulumi.Output[str]:\\n return pulumi.get(self, \\\"mesh_id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\",\n \"def id(self) -> str:\\n return pulumi.get(self, \\\"id\\\")\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.69869524","0.66642356","0.6493194","0.6485879","0.64025915","0.63910806","0.6356197","0.62523925","0.62455714","0.62014794","0.6190886","0.61564124","0.6125926","0.60740584","0.6072235","0.60693944","0.60588557","0.6046706","0.60322815","0.60287","0.60287","0.60107666","0.60096306","0.600709","0.59968144","0.5994115","0.59852785","0.59701437","0.59701437","0.59701437","0.59701437","0.59701437","0.59701437","0.5958455","0.59568506","0.59568506","0.5955803","0.5944371","0.5943218","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329","0.5942329"],"string":"[\n \"0.69869524\",\n \"0.66642356\",\n \"0.6493194\",\n \"0.6485879\",\n \"0.64025915\",\n \"0.63910806\",\n \"0.6356197\",\n \"0.62523925\",\n \"0.62455714\",\n \"0.62014794\",\n \"0.6190886\",\n \"0.61564124\",\n \"0.6125926\",\n \"0.60740584\",\n \"0.6072235\",\n \"0.60693944\",\n \"0.60588557\",\n \"0.6046706\",\n \"0.60322815\",\n \"0.60287\",\n \"0.60287\",\n \"0.60107666\",\n \"0.60096306\",\n \"0.600709\",\n \"0.59968144\",\n \"0.5994115\",\n \"0.59852785\",\n \"0.59701437\",\n \"0.59701437\",\n \"0.59701437\",\n \"0.59701437\",\n \"0.59701437\",\n \"0.59701437\",\n \"0.5958455\",\n \"0.59568506\",\n \"0.59568506\",\n \"0.5955803\",\n \"0.5944371\",\n \"0.5943218\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\",\n \"0.5942329\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":61,"numItemsPerPage":100,"numTotalItems":95772,"offset":6100,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3Mzk0MTY5MCwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1weXRob24tdjEiLCJleHAiOjE3NzM5NDUyOTAsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.68OC3Vkh49dcqauDoNuEQjVDLCE7Xg-A443ZcwTxusGqGXZS1j1EHZL8eFY9_atLF507E2Vj0gYY1e9ta0qLAw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":95772,"numBytesParquet":1928375891}]},"discussionsStats":{"closed":1,"open":1,"total":2},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
query stringlengths 9 3.4k | document stringlengths 9 87.4k | metadata dict | negatives listlengths 4 101 | negative_scores listlengths 4 101 | document_score stringlengths 3 10 | document_rank stringclasses 102
values |
|---|---|---|---|---|---|---|
Function to test add furniture functionality. | def test_add_furniture(self):
add_furniture('invoice.csv', 'Elisa Miles', 'LR04', 'Leather Sofa', 25)
add_furniture('invoice.csv', 'Edward Data', 'KT78', 'Kitchen Table', 10)
add_furniture('invoice.csv', 'Alex Gonzales', 'BR02', 'Queen Mattress', 17)
# Generate list of rentals
with open('invoice.csv', 'r') as csvfile:
rentals = []
for row in csvfile:
rentals.append(row)
print(rentals)
# Assert statements
self.assertEqual(rentals[0], ('Elisa Miles,LR04,Leather Sofa,25\n'))
self.assertEqual(rentals[1], ('Edward Data,KT78,Kitchen Table,10\n'))
self.assertEqual(rentals[2], ('Alex Gonzales,BR02,Queen Mattress,17\n')) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_add_data():\n add_furniture(\"invoice_file.csv\", \"Elisa Miles\", \"LR04\", \"Leather Sofa\", 25.00)\n add_furniture(\"invoice_file.csv\", \"Edward Data\", \"KT78\", \"Kitchen Table\", 10.00)\n add_furniture(\"invoice_file.csv\", \"Alex Gonzales\", \"BR02\", \"Queen Mattress\", 17.00)",
"def s... | [
"0.80027395",
"0.70377046",
"0.6918816",
"0.68016565",
"0.6707079",
"0.66921055",
"0.66690326",
"0.6534658",
"0.6481919",
"0.6451947",
"0.64004886",
"0.63858724",
"0.63445914",
"0.6246608",
"0.6238948",
"0.62372917",
"0.6225444",
"0.62142056",
"0.6196843",
"0.61662406",
"0.61... | 0.7485811 | 1 |
Tests single customer functionality. | def test_single_customer(self):
create_invoice = single_customer("Susan Wong", "invoice.csv")
create_invoice("test_items.csv")
# Generate list of rentals
with open('invoice.csv', 'r') as csvfile:
rentals = []
for row in csvfile:
rentals.append(row)
print(rentals)
# Assert statements
self.assertEqual(rentals[3], ('Susan Wong,AT92,Office Chair,13\n'))
self.assertEqual(rentals[4], ('Susan Wong,KE25,Espresso Machine,30\n')) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_get_customer(self):\n # get the id of a customer\n test_customer = self._create_customers(\"Alex\")\n logging.debug(test_customer)\n test_customer.create() \n resp = self.app.get(\n \"/customers/{}\".format(test_customer.id), content_type=\"application/json\"\n ... | [
"0.79642403",
"0.76802677",
"0.75478774",
"0.7539025",
"0.73661083",
"0.7350192",
"0.7332087",
"0.72675115",
"0.72450405",
"0.7234708",
"0.72308517",
"0.71525866",
"0.7051875",
"0.6995165",
"0.6978112",
"0.69741607",
"0.69428545",
"0.6925339",
"0.6922476",
"0.6905763",
"0.690... | 0.7136031 | 12 |
Return the match method once, then stop | def __iter__(self):
yield self.match
raise StopIteration | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def match(self) -> bool:",
"def handleMatch(self, m):\r\n pass",
"def match(self) -> \"MatchResult\":\n raise NotImplementedError",
"def continue_running(self, method):",
"def __iter__(self): \n yield self.match \n raise StopIteration",
"def __iter__(self):\n ... | [
"0.6595691",
"0.6266482",
"0.62587726",
"0.621846",
"0.61685926",
"0.60233533",
"0.5958962",
"0.5932863",
"0.5927277",
"0.5927277",
"0.5921931",
"0.5910934",
"0.590172",
"0.5840986",
"0.5780704",
"0.57200015",
"0.5675008",
"0.5612232",
"0.5565016",
"0.55173606",
"0.5446127",
... | 0.5906426 | 18 |
Indicate whether or not to enter a case suite | def match(self, *args):
if self.fall or not args:
return True
elif self.value in args: # changed for v1.5, see below
self.fall = True
return True
else:
return False | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_case(self) -> bool:\n return pulumi.get(self, \"test_case\")",
"def should_run(self, case: Tuple[Dict[str, Any], ...]) -> bool:\n return True",
"def CASE10( self, main ):\n import time\n from tests.CHOTestMonkey.dependencies.events.Event import EventType\n from tests... | [
"0.7348757",
"0.64489675",
"0.6420823",
"0.6398555",
"0.63852155",
"0.6344665",
"0.6292689",
"0.6013752",
"0.594612",
"0.59133625",
"0.5888049",
"0.58311087",
"0.5821088",
"0.58115166",
"0.5791672",
"0.5789133",
"0.57623816",
"0.5759933",
"0.5748338",
"0.5702276",
"0.5696946"... | 0.0 | -1 |
runs an automatic check to see if any transcriptions need to be started or are already finished and need to be reuploded\n\n Needs dbConnection & an integer representing the max concurrent transcriptons that can be ran at a time\n\n This is a function that you dont want to parse and upload files from the 'transcripts' folder into. because you really dont know which files are in progress or not whatever. ill fix later . | def runAutoCheck(dbConnection, maxConcurrent):
# checks if any shows are pending.
fileContent = DatabaseInteract.checkPre(dbConnection)
if(len(fileContent) > 0 and Tools.numRunningProcesses() < maxConcurrent):
cursor = dbConnection.cursor()
cursor.execute("UPDATE transcriptions SET pending = TRUE WHERE id = '" + str(fileContent[1]) + "';")
dbConnection.commit()
cursor.close()
url = fileContent[0]
indexID = str(fileContent[1]) # get the ID instead of the filename
service = str(fileContent[3])
# podcastName = fileContent[2]
Tools.transcribeAll(service, url, indexID) # download the mp3 will print when done | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def parseUpload(dbconnection, fileName):\n nhContent = ParseText.nohupTranscriptionContent(fileName)\n count = 0\n while count < len(nhContent[0]):\n try:\n rtf = nhContent[0][count]\n transcription = nhContent[1][count].replace(\"'\", \"''\").replace(\... | [
"0.5762406",
"0.56196094",
"0.5543294",
"0.54251677",
"0.54135394",
"0.53959346",
"0.5356444",
"0.5315741",
"0.5314573",
"0.5207271",
"0.5122057",
"0.510715",
"0.50821364",
"0.50786346",
"0.5072173",
"0.50637865",
"0.50570357",
"0.505323",
"0.50277853",
"0.5014339",
"0.497700... | 0.7170837 | 0 |
scans all rss feeds for new | def updateScript(dbconnection):
cursor = dbconnection.cursor()
cursor.execute("select rss, name, source from podcasts;")
rssArray = cursor.fetchall()
for rss in rssArray:
print("chekcing name " + str(rss[1]))
url = str(rss[0])
name = str(rss[1])
source = str(rss[2])
rssArray = DatabaseInteract.rssCheck(name, source, url)
for item in rssArray:
if(DatabaseInteract.checkIfExists(dbconnection, item[0]) == False):
DatabaseInteract.insertClip(dbconnection, item[2], name, item[3], item[1], item[0]) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def scanFeedList(self): \r\n data = self.feed_handler.listScanFeeds()\r\n data = data[:MAX_FEEDS_SCAN]\r\n for idx, feed in enumerate(data):\r\n print \"feeds ... / [%s/%s] (%s docs:%s passed)\" % (idx, len(data),self.feed_item_ctr, self.fe... | [
"0.7721408",
"0.7200292",
"0.6963098",
"0.67966145",
"0.67705613",
"0.6618283",
"0.6454477",
"0.6439002",
"0.6414561",
"0.63198656",
"0.62931746",
"0.6283974",
"0.6249403",
"0.62478334",
"0.62359893",
"0.6225703",
"0.6203846",
"0.6194489",
"0.6180839",
"0.6162735",
"0.6159219... | 0.0 | -1 |
Waits for the running transcription processes to end (2 min intervals). \n Then deletes everything in the 'podcasts' folder, parses all transcripts, and updates the databases | def resetScript(dbConnection, maxConcurrent):
while (Tools.numRunningProcesses() != 0): # wait for the transcriptions to end. Pings every 2 mins
time.sleep(120)
emptyPodcastFolder = Tools.cleanupFolder("podcasts")
DatabaseInteract.refreshDatabase(dbConnection) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def task_queue_podcasts():\n data = get_task_arguments()\n user_uid = data[\"user_uid\"]\n\n client = google.cloud.storage.Client()\n bucket = client.get_bucket(settings.PODCAST_STORAGE_BUCKET)\n podcasts = Podcast.get_user_podcasts(user_uid)\n for podcast in podcasts:\n old_entries = [ent... | [
"0.5957652",
"0.5755388",
"0.54659915",
"0.5391661",
"0.5354948",
"0.5351097",
"0.5270798",
"0.5212245",
"0.5207515",
"0.5192871",
"0.5167002",
"0.5137688",
"0.5125688",
"0.51148933",
"0.5111066",
"0.5101877",
"0.5099718",
"0.509771",
"0.50841075",
"0.5051348",
"0.5043869",
... | 0.67138106 | 0 |
Requires dbconnection and the filename (location) of the file being parsed | def parseUpload(dbconnection, fileName):
nhContent = ParseText.nohupTranscriptionContent(fileName)
count = 0
while count < len(nhContent[0]):
try:
rtf = nhContent[0][count]
transcription = nhContent[1][count].replace("'", "''").replace("_", "")
dbID = nhContent[2][count].replace(".", "")
duration = nhContent[3][count]
DatabaseInteract.insertTranscription(dbconnection, rtf, transcription, duration, dbID)
count += 1
except:
print("couldnt upload one at index " + str(count))
count += 1 | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def __init__(self, db_file):\n pass",
"def import_db(import_file):\n import_data(import_file)",
"def load_file():\n global list_of_table, data_base, new_data\n open_name = askopenfilename()\n\n if Path(open_name).suffix == '.db':\n data_base = open_name\n data_base = str(data_bas... | [
"0.67936474",
"0.6777492",
"0.6385129",
"0.6375183",
"0.63454866",
"0.6284782",
"0.6269853",
"0.6250333",
"0.6244061",
"0.6234011",
"0.6226429",
"0.6214333",
"0.6204602",
"0.61976486",
"0.61935747",
"0.61779267",
"0.61766285",
"0.6129",
"0.6126773",
"0.60768723",
"0.60636026"... | 0.0 | -1 |
This parses the content of nohup. The size of nohup is basically unlimited but each line has to be under 300000 characters(?). This then returns the following...\n\n index 0 a list of all the occurences of realTimeFactor\n index 1 a list of all the occurences of transcriptions\n index 2 a list of all the occurences of the transcription ID\n index 3 a list of all the occurences of the total transcription time.\n\n \n\n \\Example usage\n parsedContent = nohupTranscriptionContent("ok.txt") | def nohupTranscriptionContent(filePath):
try:
continu = True
fileContent = ""
f = open(filePath, 'r')
while (continu):
temp = f.readline(900000)
if(len(temp) == 0):
continu = False
else:
fileContent += temp
results = []
realTimeFactor = re.findall(r'Timing stats: real-time factor for offline decoding was (.*?) = ', fileContent)
results.append(realTimeFactor)
transcription = re.findall(r'utterance-id(.*?) (.*?)\n', fileContent)
transcriptionList = []
transcriptionIDList = []
for item in transcription:
if(len(item[1]) > 1000):
transcriptionIDList.append(item[0])
transcriptionList.append(item[1])
results.append(transcriptionList)
results.append(transcriptionIDList)
transcriptionTime = re.findall(r'seconds / (.*?) seconds\.', fileContent)
results.append(transcriptionTime)
return results
except Exception as e:
Tools.writeException("nohupTranscriptionContent", e)
return False | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def fileTranscriptionContent(filePath):\n try:\n continu = True\n f = open(filePath, 'r')\n fileContent = \"\"\n while (continu):\n temp = f.readline(300000)\n if(len(temp) == 0):\n continu = False\n ... | [
"0.5664039",
"0.5516081",
"0.520067",
"0.50546473",
"0.5002102",
"0.49736872",
"0.48318633",
"0.47706318",
"0.47663316",
"0.4757304",
"0.47494912",
"0.47263288",
"0.47130182",
"0.47129261",
"0.4693467",
"0.46848562",
"0.46799994",
"0.4672537",
"0.46613166",
"0.4635302",
"0.46... | 0.754473 | 0 |
This parses the content of the transcription file. The size of the file can basically be unlimited but each line has to be under 300000 characters(?). This then returns the following...\n\n index 0 url\n index 1 realTimeFactor\n index 2 transcription\n | def fileTranscriptionContent(filePath):
try:
continu = True
f = open(filePath, 'r')
fileContent = ""
while (continu):
temp = f.readline(300000)
if(len(temp) == 0):
continu = False
else:
fileContent += temp
results = []
f.close()
url = re.findall(r'URL:(.*?)\n', fileContent)
results.append(url)
realTimeFactor = re.findall(r'Timing stats: real-time factor for offline decoding was (.*?) = ', fileContent)
results.append(realTimeFactor)
transcription = re.findall(r'utterance-id1 (.*?)\n', fileContent)
for item in transcription:
if(len(item) > 500):
results.append(item.replace("'", "''"))
if((len(results[0]) > 0) and (len(results[1]) > 0) and (len(results[2]) > 0)):
return results
else:
Tools.writeException("fileTranscriptionContent", "ERROR attempted to parse " + filePath + " but got " + str(results))
return False
except Exception as e:
Tools.writeException("fileTranscriptionContent", e) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def nohupTranscriptionContent(filePath):\n try:\n continu = True\n fileContent = \"\"\n f = open(filePath, 'r')\n while (continu):\n temp = f.readline(900000)\n if(len(temp) == 0):\n continu = False\n ... | [
"0.67881304",
"0.626287",
"0.6229017",
"0.615032",
"0.61068505",
"0.61058336",
"0.60824823",
"0.6019963",
"0.59705794",
"0.5939803",
"0.5923286",
"0.5885868",
"0.5883228",
"0.583081",
"0.5810255",
"0.5807429",
"0.5763637",
"0.5748194",
"0.5746666",
"0.5737573",
"0.5734013",
... | 0.7538108 | 0 |
deletes all contents of the specified folder (but not the folder itself).\n returns true if successful. False if an error was thrown or the number of running processes is not = 0 | def cleanupFolder(folderName):
try:
if(Tools.numRunningProcesses() == 0):
process = subprocess.call('rm -r ./' + folderName + '/*', shell=True)
return True
else:
return False
except Exception as e:
Tools.writeException("cleanupFolder", e)
return False | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def delete_folder(path: str):\n try:\n if os.path.exists(path):\n shutil.rmtree(path)\n return True\n except:\n print(\"An error occured.\")",
"def _rm(folder):\n import os\n import shutil\n for the_file in os.listdir(folder):\n file_path = os... | [
"0.65608245",
"0.6207403",
"0.60895413",
"0.6053084",
"0.60113263",
"0.5985281",
"0.5914889",
"0.58811086",
"0.58790207",
"0.5868364",
"0.5852713",
"0.5824594",
"0.5818425",
"0.58163047",
"0.5810179",
"0.57717085",
"0.5769049",
"0.5744798",
"0.5744438",
"0.5740823",
"0.572649... | 0.70612246 | 0 |
gets the number of runnning transcription processes | def numRunningProcesses():
try:
proc = subprocess.run("ps -Af|grep -i \"online2-wav-nnet3-latgen-faster\"", stdout=subprocess.PIPE, shell=True)
np = (len(str(proc.stdout).split("\\n")) - 3)
if(np == None):
np = 0
return np
except Exception as e:
Tools.writeException("numRunningProcesses", e)
return -1 | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def num_processes():\n return 1",
"def num_processes(self):\n return 1",
"def num_processes(self, new_value):",
"def n_worker(self):\n return self.redis.pubsub_numsub(MSG)[0][-1]",
"def GetNumberOfResultsProcessed(self) -> int:\n return self.i",
"def numRunning(self):\n #with self.... | [
"0.7056694",
"0.6808125",
"0.6725539",
"0.66032845",
"0.64222586",
"0.6406968",
"0.6369945",
"0.6350684",
"0.6319151",
"0.6316894",
"0.631224",
"0.62300086",
"0.62215966",
"0.6156739",
"0.6135421",
"0.6128718",
"0.61258286",
"0.611203",
"0.6101045",
"0.60927176",
"0.6082708",... | 0.73324955 | 0 |
Writes Exception given the string format of the class name and the 'e' in any Exception as e premise | def writeException(className, exceptionString):
errorFile = open("error.log", 'a')
errorFile.write("ERROR occured in " + className + " at " + str(datetime.now()) + " with the following message\n" + str(exceptionString) + "\n\n")
errorFile.close() | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def log_format_error(caught_exception, event_str):\n\tcheck_type(caught_exception, Exception)\n\tcheck_type(event_str, StringType)\n\t\n\treturn '{0}, Class: {1}:{2}'.format(event_str, str(type(caught_exception)), caught_exception)",
"def create_exception(self, msg: str):",
"def format_exception(exception_type... | [
"0.6879372",
"0.66124326",
"0.66071355",
"0.6428653",
"0.6300448",
"0.62846094",
"0.617269",
"0.60398024",
"0.60369265",
"0.5990471",
"0.59839076",
"0.5983831",
"0.5976452",
"0.5947421",
"0.59470266",
"0.5942072",
"0.5938443",
"0.58877414",
"0.58695066",
"0.58431464",
"0.5832... | 0.65568435 | 3 |
Returns with the filename of the first file in the given directory. Just provide the directory's name with no leading './' | def getFirstFile(folderName):
listFiles = subprocess.run("ls ./" + folderName, shell=True, stdout=subprocess.PIPE)
fileName = re.search(r"b'(.*?)\\n", str(listFiles.stdout))[1]
if(len(fileName) > 0):
return fileName
else:
return False | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_filename(self):\n \n for f in os.listdir(self.get_directory()):\n if os.path.isfile(os.path.join(self.get_directory(), f)):\n return f\n \n return None",
"def get_first_file(cmds):\n for cmd in cmds:\n all_files = glob.glob(c... | [
"0.7349085",
"0.7295504",
"0.7234868",
"0.6979272",
"0.6957857",
"0.68544894",
"0.6841921",
"0.67179877",
"0.66709983",
"0.66419125",
"0.65900755",
"0.65814984",
"0.65654624",
"0.65107995",
"0.6479264",
"0.64599794",
"0.6448274",
"0.64449316",
"0.6437284",
"0.6429767",
"0.640... | 0.6773866 | 7 |
Does everything you need to transcribe a podcast given the filename\n Download podcast, wait 40 seconds, change podcast to .wav, wait 10 seconds, remove the .mp3 file, run the transcription | def transcribeAll(service, url, fileName):
if(service == "omny.fm"):
url = url.replace(".mp3","") + ".mp3"
subprocess.Popen("wget -c -O ./podcasts/" + fileName + ".mp3 " + url + " && sleep 40 && ffmpeg -i ./podcasts/"
+ fileName + ".mp3 -acodec pcm_s16le -ac 1 -ar 8000 ./podcasts/" + fileName + ".wav && sleep 10 && rm ./podcasts/"
+ fileName + ".mp3 && nohup ./online2-wav-nnet3-latgen-faster --online=false --do-endpointing=false "
+ "--frame-subsampling-factor=3 --config=online.conf --max-mem=2000000000 --max-active=7000 --beam=15.0 --lattice-beam=6.0 "
+ "--acoustic-scale=1.0 --word-symbol-table=words.txt final.mdl HCLG.fst 'ark:echo utterance-id" + fileName
+ " utterance-id" + fileName + "|' 'scp:echo utterance-id" + fileName + " ./podcasts/" + fileName + ".wav|' 'ark:/dev/null' &", shell=True) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def transcribe_audio_file(filename):\n url = 'https://api.nexiwave.com/SpeechIndexing/file/storage/' + USERNAME +'/recording/?authData.passwd=' + PASSWORD + '&auto-redirect=true&response=application/json'\n\n # To receive transcript in plain text, instead of html format, comment this line out (for SMS, for e... | [
"0.66069883",
"0.6560382",
"0.6439472",
"0.626135",
"0.61909765",
"0.6083509",
"0.6073147",
"0.5968924",
"0.5962577",
"0.5942388",
"0.58873165",
"0.58815217",
"0.5879562",
"0.5855016",
"0.5853225",
"0.5847647",
"0.58247757",
"0.5802723",
"0.5779541",
"0.5740425",
"0.57340455"... | 0.7504941 | 0 |
HomePage > the homepage of the podcast (NOT NULL)\n Name > The name of the podcast (NOT NULL)\n Description > a short description of the podcast\n Category > The category of the podcast\n Source > The service of which the podcast is being accessed through\n ImageURI > Podcast cover art\n Web > The website of the podcaster\n Twitter > The twitter account of the podcaster\n Facebook > the facebook account of the podcaster\n LastUpdated > the date that this was last updated.\n RSS > The URL of the podcasts RSS feed\n If you dont have values for a certain field just pass it in as an empty string | def uploadPodcast(dbConnection, homepage, name, description, category, source, imageurl, web, twitter, facebook, rss):
try:
cursor = dbConnection.cursor()
name = name.replace("'", "''")
description = description.replace("'", "''")
cursor.execute("""INSERT INTO podcasts(homepage, name, description, category, source, imageuri, web, twitter, Facebook, rss) VALUES(%s, %s, %s, %s, %s, %s, %s, %s, %s, %s);""", (homepage, name, description, category, source, imageurl, web, twitter, facebook, rss))
dbConnection.commit()
cursor.close()
return True
except Exception as e:
Tools.writeException("insertHeader", "e")
return False | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def homepage():\n return (\n f\"Welcome to Hawaii - Climate Page<br/>\"\n f\"<br/>\"\n f\"This site has data from 01-01-2010 to 08-23-2017<br/>\"\n f\"<br/>\"\n f\"Available Pages:<br/>\"\n f\"<br/>\"\n f\"<br/>\"\n f\" Station Information<br/>\"\n ... | [
"0.5254778",
"0.522776",
"0.5127181",
"0.50627685",
"0.48750266",
"0.4832583",
"0.4781134",
"0.47785923",
"0.47693622",
"0.47292462",
"0.47047243",
"0.46810403",
"0.4663331",
"0.46538934",
"0.4653328",
"0.46179616",
"0.45948377",
"0.4588498",
"0.45725253",
"0.45705068",
"0.45... | 0.52180666 | 2 |
audiourl > url of the transcriptions mp3 is stored here (NOT NULL)\n PodcastName > THe name of the show (references podcast(name))\n Description > The provided summary of that days podcast\n Date > The date that podcast aired (parsed to mmddyyyy\n Title > The title of that specific podcast\n Duration > the running time of that podcast (use strptime to parse, need mmddyyyy\n pending > right now will be false because were not transcribing\n (dateTranscribed) > date of transcription (updated later)\n | def insertClip(dbConnection, audiourl, podcastName, description, parsedDate, title):
try:
cursor = dbConnection.cursor()
title = title.replace("'", "''")
cursor.execute("INSERT INTO transcriptions(audiourl, realtimefactor, podcastname, transcription, description, date, title, pending, datetranscribed) VALUES('" + audiourl + "', NULL, '" + podcastName + "', NULL, '" + description + "', '" + parsedDate + "', '" + title + "', FALSE, NULL);")
dbConnection.commit()
cursor.close()
return True
except:
return False
return False | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def tokenize_podcast_transcript(args):\n DATA_DIR = os.path.join(os.getcwd(), 'data', args.project_id)\n story_file = os.path.join(DATA_DIR, 'podcast-transcription.txt')\n\n # Read all words and tokenize them\n with open(story_file, 'r') as fp:\n data = fp.readlines()\n\n data = [item.spl... | [
"0.5720898",
"0.56445146",
"0.5573998",
"0.55513567",
"0.55373365",
"0.5462284",
"0.5397166",
"0.53909075",
"0.5349029",
"0.53120935",
"0.51405776",
"0.51242185",
"0.51071036",
"0.50734013",
"0.5052101",
"0.50449437",
"0.50282156",
"0.5022951",
"0.49973148",
"0.49737933",
"0.... | 0.5656862 | 1 |
This basically uploads the arguents to the database, returning false and throwing an error if unsuccesful (or true otherwise)\n | def insertTranscription(dbConnection, realtimefactor, transcription, duration, dbID):
try:
cursor = dbConnection.cursor()
cursor.execute("UPDATE transcriptions SET realtimefactor = '" + realtimefactor + "', transcription = '" + transcription + "', datetranscribed = now(), duration = '" + duration + "' WHERE id = '" + str(dbID) + "';")
dbConnection.commit()
cursor.close()
return True
except Exception as e:
Tools.writeException("uploadTranscriptionData", e)
return False | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def write_to_db( self, *args ):\n try:\n toSave = [ a for a in args ]\n # save them\n self.session.add_all( toSave )\n self.session.commit()\n self._fire_save_notification()\n return True\n except Exception as e:\n print( \"... | [
"0.6018636",
"0.56575793",
"0.5548777",
"0.5302964",
"0.52453786",
"0.52212244",
"0.5169866",
"0.51535535",
"0.5146376",
"0.5134887",
"0.5131358",
"0.51230496",
"0.51160276",
"0.5075478",
"0.506222",
"0.5057487",
"0.5046628",
"0.50436354",
"0.50288576",
"0.50007904",
"0.49962... | 0.0 | -1 |
checks the database for empty transcription entries, returns a list with \n\n index 0 audiourl\n index 1 id\n index 2 podcast name\n index 3 service of podcast | def checkPre(dbConnection):
cursor = dbConnection.cursor()
cursor.execute("SELECT audiourl, T.id, podcastName, source FROM transcriptions AS T JOIN podcasts as P ON P.name = T.podcastname WHERE COALESCE(T.transcription, '') = '' AND pending = FALSE LIMIT 1;")
entry = cursor.fetchone()
cursor.close()
return entry | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def listMissingItems():\n global doc\n texts = doc.getElementsByTagName(\"text\")\n for t in texts:\n xmlid = t.getAttribute(\"id\")\n for table in langtables:\n execute(\"SELECT * FROM %s WHERE xmlid=\\\"%s\\\"\" % (table, xmlid))\n rows = cursor.fetchall()\n ... | [
"0.5676291",
"0.5263004",
"0.5223297",
"0.52066535",
"0.5155342",
"0.51544493",
"0.51198375",
"0.50936806",
"0.50230044",
"0.49982882",
"0.49966055",
"0.49849313",
"0.4925892",
"0.48985046",
"0.48830864",
"0.48502585",
"0.48242763",
"0.48231605",
"0.48141956",
"0.4793201",
"0... | 0.6268205 | 0 |
This is to be used when both the podcasts folder and transcripts folder are empty.\n For every entry in the database that has an empty transcript and a pending flag set to true, change the pending flag to false. Honestly this is used to deal with a weird bug and should be run every now and then | def refreshDatabase(dbConnection):
try:
cursor = dbConnection.cursor()
cursor.execute("UPDATE transcriptions SET pending = FALSE WHERE COALESCE(transcription, '') = '';")
dbConnection.commit()
cursor.close()
except Exception as e:
Tools.writeException("refreshDatabase", e) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def checkPre(dbConnection):\n cursor = dbConnection.cursor()\n cursor.execute(\"SELECT audiourl, T.id, podcastName, source FROM transcriptions AS T JOIN podcasts as P ON P.name = T.podcastname WHERE COALESCE(T.transcription, '') = '' AND pending = FALSE LIMIT 1;\")\n entry = cursor.fetchone()\... | [
"0.56695527",
"0.5449261",
"0.5254157",
"0.52069896",
"0.519826",
"0.5033168",
"0.4992053",
"0.4885781",
"0.48527905",
"0.48117176",
"0.48087612",
"0.4767459",
"0.47640154",
"0.47548455",
"0.47459507",
"0.47442943",
"0.47228667",
"0.47036612",
"0.46930197",
"0.468822",
"0.467... | 0.503461 | 5 |
given title, if the podcast is in the database already return true. False if the podcast does not exist in the database | def checkIfExists(dbconnection, title):
cursor = dbconnection.cursor()
output = ""
title = title.replace("'", "''")
try:
cursor.execute("SELECT * FROM transcriptions WHERE title = '" + title + "';")
dbconnection.commit()
output = cursor.fetchone()
cursor.close()
if(output is None):
return False
else:
return True
except:
dbconnection.rollback()
cursor.execute("SELECT * FROM transcriptions WHERE title = '" + title + "';")
dbconnection.commit()
output = cursor.fetchone()
cursor.close()
if(output is None):
return False
else:
return True | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def check_if_entry_exists(title: str) -> bool:\n conn = sqlite3.connect('rss.db')\n c = conn.cursor()\n try:\n c.execute(\n \"\"\"select * from entries where title = ?\"\"\",\n (title,)\n )\n records = c.fetchall()\n return len(records) > 0\n except... | [
"0.7373473",
"0.63370997",
"0.6241188",
"0.62162536",
"0.6169572",
"0.6139767",
"0.6122975",
"0.5888012",
"0.5878836",
"0.58756447",
"0.58756447",
"0.58615744",
"0.58349437",
"0.583252",
"0.5811973",
"0.5811524",
"0.58094037",
"0.57614815",
"0.57470703",
"0.57385516",
"0.5726... | 0.7353994 | 1 |
Checks the rss urls in the database and returns an array of each of the important fields | def rssCheck(podcastName, source, url):
try:
headers = {'Accept':'text/html, application/xhtml+xml, application/xml; q=0.9, */*; q=0.8' ,'User-Agent': 'Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/64.0.3282.140 Safari/537.36 Edge/18.17763'}
req = requests.get(url, headers=headers)
root = etree.fromstring(req.text)
rssArray = []
for element in root[0].iter('item'):
try:
title = element.find("title").text.replace("''", "'")
description = element.find("description").text.replace("<strong>", "").replace("</strong>", "").replace("&", "and").replace("'","''")
date = element.find("pubDate").text
date = date.split(" ")
date = datetime.strptime(date[1] + date[2] + date[3], "%d%b%Y")
dateString = str(date.month) + "-" + str(date.day) + "-" + str(date.year)
url = ResolveRouter.urlRouter(podcastName, source, element)
except:
print("error in XMLDetailsDebug parsing issue")
if(len(title) > 0 and len(description) > 0 and len(dateString) > 0 and len(url) > 0):
rssArray.append([title, dateString, url, description])
else:
print("error in XMLDetailsDebug parsing issue")
return rssArray
except Exception as e:
print(e)
Tools.writeException("getXMLDetailsDebug", e) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_rss_infos():\n\n url_rss_lib = \"http://www.liberation.fr/rss\"\n soup = utils.recovery_flux_url_rss(url_rss_lib)\n\n rss_items = soup.find_all(\"li\")\n\n rss_list = []\n\n link_rss = []\n\n for ri in rss_items:\n if ri.get(\"class\") == ['rss-item']:\n rss_list.append(... | [
"0.7014149",
"0.65106124",
"0.6413672",
"0.63931924",
"0.6380389",
"0.6300671",
"0.6237712",
"0.62265265",
"0.62018305",
"0.6194729",
"0.6165013",
"0.61139023",
"0.6107573",
"0.6098303",
"0.60845596",
"0.6067579",
"0.60539395",
"0.6052752",
"0.60521805",
"0.58949435",
"0.5880... | 0.64719254 | 2 |
generate the CUSPARSE FFI definition | def generate_cffi_cdef(
cuda_include_path=cuda_include_path, cusparse_header=cusparse_header,
cffi_out_file=None):
with open(cusparse_header, 'r') as f:
cusparse_hdr = f.readlines()
# in some version cusparse_v2.h just points to cusparse.h, so read it
# instead
for line in cusparse_hdr:
# if v2 header includes cusparse.h, read that one instead
if line.startswith('#include "cusparse.h"'):
cusparse_header = os.path.join(cuda_include_path, 'cusparse.h')
with open(cusparse_header, 'r') as f:
cusparse_hdr = f.readlines()
cusparse_hdr = [_remove_comment(l) for l in cusparse_hdr]
# skip lines leading up to first typedef
for idx, line in enumerate(cusparse_hdr):
if line.startswith('typedef'):
start_line = idx
break
# skip closing #if defined logic
for idx, line in enumerate(cusparse_hdr[start_line:]):
if line.startswith('#if defined(__cplusplus)') or \
'Define the following symbols for the new API' in line:
# second match is to avoid CFFI compilation errror due to the final
# define statements in v4.1 through v5.5
end_line = start_line + idx
break
# define other data types needed by FFI
# ... will be filled in from cuComplex.h by the C compiler
cffi_cdef = """
typedef struct CUstream_st *cudaStream_t;
typedef struct float2 {
...;
} float2;
typedef float2 cuFloatComplex;
typedef float2 cuComplex;
typedef struct double2 {
...;
} double2;
typedef double2 cuDoubleComplex;
typedef float cufftReal;
typedef double cufftDoubleReal;
typedef cuComplex cufftComplex;
typedef cuDoubleComplex cufftDoubleComplex;
typedef enum cudaDataType_t
{
CUDA_R_16F= 2, // real as a half
CUDA_C_16F= 6, // complex as a pair of half numbers
CUDA_R_32F= 0, // real as a float
CUDA_C_32F= 4, // complex as a pair of float numbers
CUDA_R_64F= 1, // real as a double
CUDA_C_64F= 5, // complex as a pair of double numbers
CUDA_R_8I= 3, // real as a signed char
CUDA_C_8I= 7, // complex as a pair of signed char numbers
CUDA_R_8U= 8, // real as a unsigned char
CUDA_C_8U= 9, // complex as a pair of unsigned char numbers
CUDA_R_32I= 10, // real as a signed int
CUDA_C_32I= 11, // complex as a pair of signed int numbers
CUDA_R_32U= 12, // real as a unsigned int
CUDA_C_32U= 13 // complex as a pair of unsigned int numbers
} cudaDataType;
typedef enum libraryPropertyType_t //GRL: added this for cuda 8.0
{
MAJOR_VERSION,
MINOR_VERSION,
PATCH_LEVEL
} libraryPropertyType;
/* definitions from cusparse header below this point */
"""
cffi_cdef += ''.join(cusparse_hdr[start_line:end_line])
"""
don't use the _v2 versions of the function names defined in CUDA v4.1
through v5.5
"""
cffi_cdef = cffi_cdef.replace('_v2(', '(')
if os.name == 'nt': # Win
cffi_cdef = cffi_cdef.replace('CUSPARSEAPI', '__stdcall')
else: # posix, etc
cffi_cdef = cffi_cdef.replace('CUSPARSEAPI', '')
if cffi_out_file is not None:
# create specified output directory if it doesn't already exist
out_dir = os.path.dirname(cffi_out_file)
if out_dir and not os.path.exists(out_dir):
os.makedirs(out_dir)
with open(cffi_out_file, 'w') as f:
f.write(cffi_cdef)
return cffi_cdef | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def make_c_header(self):\n res = \\\n\"\"\"PyThreadState* ___madz_LANG_python_thread_state; //Holds Thread State for this interpreter\nPyObject *___madz_LANG_python_wrapper_module; //Hold Pointer to the _madz.py file representing this plugin\ntypedef struct{{\n{function_pointers}\n}}___madz_LANG_python_TYPE... | [
"0.6575036",
"0.6416403",
"0.62135506",
"0.61577857",
"0.6081804",
"0.6024244",
"0.58753806",
"0.5823587",
"0.573958",
"0.5726746",
"0.56846005",
"0.56105137",
"0.55705476",
"0.5551445",
"0.5547371",
"0.55256623",
"0.55013",
"0.54184884",
"0.539809",
"0.53861326",
"0.5378367"... | 0.6747278 | 0 |
generate python_wrapper function body | def build_func_body(func_name, arg_dict, return_type):
body = ""
arg_list = ""
# the following are pointers to scalar outputs
# Note: pBufferSize was renamed pBufferSizeInBytes in v6.5
scalar_ptr_outputs = ['nnzTotalDevHostPtr',
'pBufferSize',
'pBufferSizeInBytes',
'resultDevHostPtr']
is_creator = 'cusparseCreate' in func_name
is_getter = 'cusparseGet' in func_name
if return_type == 'cusparseStatus_t' and not (is_creator or is_getter):
is_return = False
else:
is_return = True
# else:
return_str = ''
for k, v in arg_dict.items():
"""
set some flags based on the name/type of the argument
will use these flags to determine whether and how to call ffi.new or
ffi.cast on each variable
"""
is_ptr = '*' in v
is_cusparse_type = '_t' in v
is_cusparse_ptr = is_ptr and is_cusparse_type
is_output_scalar = k in scalar_ptr_outputs
if k in ['alpha', 'beta']:
is_scalar = True
else:
is_scalar = False
if is_getter:
is_gpu_array = False
else:
is_gpu_array = is_ptr and (not is_cusparse_ptr) and (not is_scalar)
if 'Complex' in v:
is_complex = True
else:
is_complex = False
# convert variable to appropriate type for the FFI
if is_output_scalar:
# for scalar outputs make a new pointer
body += "%s = ffi.cast('%s', %s)\n" % (k, v, k)
elif is_getter and is_ptr and (return_type == 'cusparseStatus_t'):
# any pointers in cusparseGet* are new outputs to be created
body += "%s = ffi.new('%s')\n" % (k, v)
elif is_gpu_array:
# pass pointer to GPU array data (use either .ptr or .gpudata)
body += "%s = ffi.cast('%s', %s.ptr)\n" % (k, v, k)
elif is_cusparse_ptr:
if is_creator:
# generate custom cusparse type
body += "%s = ffi.new('%s')\n" % (k, v)
else:
# cast to the custom cusparse type
body += "%s = ffi.cast('%s', %s)\n" % (k, v, k)
elif is_ptr and is_scalar:
# create new pointer, with value initialized to scalar
if is_complex:
# complex case is a bit tricky. requires ffi.buffer
body += "%sffi = ffi.new('%s')\n" % (k, v)
if 'cusparseC' in func_name:
body += "ffi.buffer(%sffi)[:] = \
np.complex64(%s).tostring()\n" % (k, k)
elif 'cusparseZ' in func_name:
body += "ffi.buffer(%sffi)[:] = \
np.complex128(%s).tostring()\n" % (k, k)
else:
body += "%s = ffi.new('%s', %s)\n" % (k, v, k)
elif is_ptr or v == 'cudaStream_t':
# case non-scalar pointer to appropriate type
body += "%s = ffi.cast('%s', %s)\n" % (k, v, k)
else:
# don't need explicit cast for plain int, float, etc
pass
# build the list of arguments to pass to the API
if is_ptr and is_scalar and is_complex:
# take into account modified argument name for complex scalars
arg_list += "%sffi, " % k
else:
arg_list += "%s, " % k
# add the function call and optionally return the result
last_key = k
arg_list = arg_list[:-2] # remove trailing ", "
if is_getter and return_type != 'cusparseStatus_t':
body += "return ffi_lib.%s(%s)\n" % (func_name, arg_list)
else:
# check cusparseStatus_t state before returning
call_str = "status = ffi_lib.%s(%s)\n" % (func_name, arg_list)
body += split_line(call_str, break_pattern=', ', nmax=76)
body += "cusparseCheckStatus(status)\n"
if is_return:
# len(arg_dict) == 2) is to avoid return for cusparseGetLevelInfo
if is_creator or (is_getter and (len(arg_dict) == 2)):
body += "return %s[0]\n" % last_key
else:
body += "#TODO: return the appropriate result"
body += '\n\n'
return reindent(body, numSpaces=4, lstrip=False) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def wrapper(*args):",
"def make_c_function_stubs(self):\n fn =\\\n\"\"\"{rettype} {fnname}({args}){{\n {rettype} ret;\n\n ret = {cast_and_deref}___madz_LANG_python_OUTPUT.{nodename}({argnames});\n\n return ret;\n}}\n\n\"\"\"\n fn_no_return =\\\n\"\"\"{rettype} {fnname}({args}){{\n ___ma... | [
"0.6718689",
"0.6527611",
"0.64795184",
"0.6186041",
"0.6184181",
"0.61080533",
"0.60333836",
"0.5982096",
"0.59634656",
"0.5940715",
"0.5934572",
"0.59340453",
"0.59037447",
"0.59012115",
"0.58594495",
"0.585627",
"0.58455956",
"0.5824993",
"0.58232915",
"0.5799322",
"0.5793... | 0.54531014 | 47 |
Test that both transformer implementations produce the same outputs when applied to a properlysized sequence. | def test_basic_equivalence(cell_cls, num_layers):
with tf.Graph().as_default():
with tf.Session() as sess:
pos_enc = positional_encoding(4, 6, dtype=tf.float64)
in_seq = tf.get_variable('in_seq',
shape=(3, 4, 6),
initializer=tf.truncated_normal_initializer(),
dtype=tf.float64)
cell = cell_cls(pos_enc, num_layers=num_layers, num_heads=2, hidden=24)
actual, _ = tf.nn.dynamic_rnn(cell, in_seq, dtype=tf.float64)
with tf.variable_scope('rnn', reuse=True):
with tf.variable_scope('transformer', reuse=True):
expected = in_seq + pos_enc
for _ in range(num_layers):
expected = transformer_layer(expected, num_heads=2, hidden=24)
sess.run(tf.global_variables_initializer())
actual, expected = sess.run((actual, expected))
assert not np.isnan(actual).any()
assert not np.isnan(expected).any()
assert actual.shape == expected.shape
assert np.allclose(actual, expected) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_random_transform_generator():\n # Check shapes are correct Batch Size = 1 - Pass\n batch_size = 1\n transforms = layer_util.random_transform_generator(batch_size, 0)\n assert transforms.shape == (batch_size, 4, 3)\n\n # Check numerical outputs are correct for a given seed - Pass\n batch_... | [
"0.6028225",
"0.5944386",
"0.58593905",
"0.5800506",
"0.57926905",
"0.57714605",
"0.5770468",
"0.57545334",
"0.57405823",
"0.57333404",
"0.5712127",
"0.5697243",
"0.56768686",
"0.56742346",
"0.56673914",
"0.56589234",
"0.5644305",
"0.56440634",
"0.5639191",
"0.56258535",
"0.5... | 0.5383693 | 61 |
Test the cell when the input sequence is longer than the time horizon. | def test_past_horizon(cell_cls):
with tf.Graph().as_default():
with tf.Session() as sess:
pos_enc = positional_encoding(4, 6, dtype=tf.float64)
in_seq = tf.get_variable('in_seq',
shape=(3, 5, 6),
initializer=tf.truncated_normal_initializer(),
dtype=tf.float64)
cell = cell_cls(pos_enc, num_layers=3, num_heads=2, hidden=24)
actual, _ = tf.nn.dynamic_rnn(cell, in_seq, dtype=tf.float64)
def apply_regular(sequence):
with tf.variable_scope('rnn', reuse=True):
with tf.variable_scope('transformer', reuse=True):
expected = sequence + pos_enc
for _ in range(3):
expected = transformer_layer(expected, num_heads=2, hidden=24)
return expected
expected = tf.concat([apply_regular(in_seq[:, :-1]),
apply_regular(in_seq[:, 1:])[:, -1:]], axis=1)
sess.run(tf.global_variables_initializer())
actual, expected = sess.run((actual, expected))
assert not np.isnan(actual).any()
assert not np.isnan(expected).any()
assert actual.shape == expected.shape
assert np.allclose(actual, expected) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def exceeded(self):\r\n return int(time.time()) - self.start_time >= self.length",
"def is_time(self) -> bool:\n return self.times > 1",
"def check_time():\n times = get_times()\n time_difference = abs((times['local'] - times['target']).total_seconds())\n return time_difference < post_ti... | [
"0.6468879",
"0.6448804",
"0.5934962",
"0.5849655",
"0.57931024",
"0.57145846",
"0.5672567",
"0.56684816",
"0.5625143",
"0.56138664",
"0.5613715",
"0.55911756",
"0.55447626",
"0.55374813",
"0.5525327",
"0.5507069",
"0.54900634",
"0.54690355",
"0.54398084",
"0.5436942",
"0.543... | 0.0 | -1 |
Test the cell when the states are split up and recombined from different timesteps. | def test_mismatched_starts(cell_cls):
with tf.Graph().as_default():
with tf.Session() as sess:
pos_enc = positional_encoding(5, 6, dtype=tf.float64)
in_seq = tf.get_variable('in_seq',
shape=(3, 5, 6),
initializer=tf.truncated_normal_initializer(),
dtype=tf.float64)
cell = cell_cls(pos_enc, num_layers=3, num_heads=2, hidden=24)
_, states_1 = tf.nn.dynamic_rnn(cell, in_seq[:, :1], dtype=tf.float64)
_, states_2 = tf.nn.dynamic_rnn(cell, in_seq[:, :2], dtype=tf.float64)
_, states_3 = tf.nn.dynamic_rnn(cell, in_seq[:, :3], dtype=tf.float64)
new_states = tuple(tf.stack([s2[0], s3[1], s1[2]], axis=0)
for s1, s2, s3 in zip(states_1, states_2, states_3))
full_seq, _ = tf.nn.dynamic_rnn(cell, in_seq, dtype=tf.float64)
expected = tf.stack([full_seq[0, 2:4], full_seq[1, 3:5], full_seq[2, 1:3]], axis=0)
inputs = tf.stack([in_seq[0, 2:4], in_seq[1, 3:5], in_seq[2, 1:3]], axis=0)
actual, _ = tf.nn.dynamic_rnn(cell, inputs, initial_state=new_states)
sess.run(tf.global_variables_initializer())
actual, expected = sess.run((actual, expected))
assert not np.isnan(actual).any()
assert not np.isnan(expected).any()
assert actual.shape == expected.shape
assert np.allclose(actual, expected) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def test_transition_function_empty_grid(self):\r\n map_file_path = os.path.abspath(os.path.join(__file__, MAPS_DIR, 'empty-8-8/empty-8-8.map'))\r\n grid = MapfGrid(parse_map_file(map_file_path))\r\n\r\n # agents are starting a\r\n agent_starts = ((0, 0), (7, 7))\r\n agents_goals ... | [
"0.62299633",
"0.6125553",
"0.59904784",
"0.5965185",
"0.5964256",
"0.59597164",
"0.5947608",
"0.5937805",
"0.58110744",
"0.5780508",
"0.5778231",
"0.5771809",
"0.57424587",
"0.5713898",
"0.57090956",
"0.5698011",
"0.567906",
"0.56286466",
"0.5621524",
"0.56178564",
"0.561581... | 0.5819505 | 8 |
Set up the Opple light platform. | def setup_platform(
hass: HomeAssistant,
config: ConfigType,
add_entities: AddEntitiesCallback,
discovery_info: DiscoveryInfoType | None = None,
) -> None:
name = config[CONF_NAME]
host = config[CONF_HOST]
entity = OppleLight(name, host)
add_entities([entity])
_LOGGER.debug("Init light %s %s", host, entity.unique_id) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def configure(self):\n\n self.platform.configure()",
"def platform_start(self):\n self.platform.start()",
"def setUp(self):\n self.hass = get_test_home_assistant()\n controller_mock = mock.MagicMock()\n dev_dict = {\"address\": \"a1\", \"name\": \"fake_light\", \"brightness_l... | [
"0.670556",
"0.669467",
"0.64281476",
"0.6402788",
"0.6392791",
"0.6329436",
"0.6317174",
"0.6247289",
"0.61651385",
"0.6147113",
"0.6105949",
"0.60822815",
"0.6056726",
"0.60057616",
"0.5982987",
"0.5977405",
"0.59728897",
"0.5957383",
"0.59512126",
"0.59488773",
"0.59368527... | 0.73331904 | 0 |
Initialize an Opple light. | def __init__(self, name, host):
self._device = OppleLightDevice(host)
self._name = name
self._is_on = None
self._brightness = None
self._color_temp = None | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def __init__(self, **kwargs) -> None:\n super(Light, self).__init__(**kwargs)\n\n get = kwargs.get\n if get('light') is None:\n raise Exception('Light is required')\n if get('button') is None:\n raise Exception('Button is required')\n\n self._light: LED = LE... | [
"0.72170395",
"0.717331",
"0.69877267",
"0.69179374",
"0.67970073",
"0.6705011",
"0.6625122",
"0.662029",
"0.6540736",
"0.6490158",
"0.64509183",
"0.6437352",
"0.6358101",
"0.63348967",
"0.6321011",
"0.6236198",
"0.62147874",
"0.6201365",
"0.6063074",
"0.6034815",
"0.6011192"... | 0.69397825 | 3 |
Return True if light is available. | def available(self) -> bool:
return self._device.is_online | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def light_is_on(self):\r\n return self._light == \"ON\"",
"def light_is_on(self):\n return self._light == \"ON\"",
"def have_light(self, light):\n if light > 1:\n return False\n return bool(self.light_array[light])",
"def is_light(self) -> bool:\n return ATTRIBUT... | [
"0.7484702",
"0.73775405",
"0.7287511",
"0.72777367",
"0.72777367",
"0.7260376",
"0.72128695",
"0.6995078",
"0.692183",
"0.6848789",
"0.68302953",
"0.6803893",
"0.6738999",
"0.6737111",
"0.67068386",
"0.6706666",
"0.669279",
"0.66660124",
"0.6653982",
"0.6653982",
"0.66485125... | 0.6739951 | 12 |
Return unique ID for light. | def unique_id(self):
return self._device.mac | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def unique_id(self):\n return self._light.address",
"def unique_id(self):\n return self.heater.id + \"_switch\"",
"def unique_id(self) -> str:\n return 'remo_device_' + self._remo_device.id + '_' + self._sensor_class",
"def unique_id(self) -> str:\n return get_frigate_entity_uniqu... | [
"0.7778015",
"0.72051173",
"0.7008974",
"0.69517404",
"0.69132495",
"0.6900635",
"0.6889376",
"0.6859422",
"0.6858554",
"0.68494785",
"0.6847968",
"0.68355125",
"0.68354523",
"0.68086004",
"0.6788117",
"0.67518526",
"0.6732352",
"0.6727304",
"0.66908014",
"0.6683743",
"0.6648... | 0.0 | -1 |
Return the display name of this light. | def name(self):
return self._name | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def name(self):\n return self._light.name",
"def get_display_name(self):\n return DisplayText(self._display_name)",
"def name(self):\n return f\"{get_device_name(self._data, self._device.id)} Light\"",
"def get_display_name(self):\n return self.display_name",
"def get_display_na... | [
"0.8419186",
"0.79949266",
"0.7932655",
"0.7864694",
"0.77409434",
"0.7726647",
"0.7726647",
"0.7726647",
"0.7726647",
"0.7726647",
"0.7726647",
"0.7726647",
"0.7726647",
"0.7726647",
"0.7726647",
"0.7726647",
"0.7726647",
"0.7716824",
"0.7705757",
"0.76947725",
"0.7663317",
... | 0.0 | -1 |
Return true if light is on. | def is_on(self):
return self._is_on | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def light_is_on(self):\r\n return self._light == \"ON\"",
"def light_is_on(self):\n return self._light == \"ON\"",
"def is_on(self):\n return self._light_on",
"def is_light(self) -> bool:\n return ATTRIBUTE.Light.value in self.type_data.attributes",
"def is_light(self) -> bool:\... | [
"0.9035416",
"0.89275813",
"0.86664206",
"0.8008696",
"0.8008696",
"0.78880787",
"0.7866302",
"0.7610281",
"0.7565963",
"0.7415077",
"0.7345493",
"0.7335999",
"0.73116577",
"0.7303292",
"0.72991306",
"0.7243393",
"0.71792775",
"0.71722543",
"0.7157757",
"0.7157757",
"0.715775... | 0.67288214 | 71 |
Return the brightness of the light. | def brightness(self):
return self._brightness | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def brightness(self):\n return brightness_from_percentage(self._brightness_pct)",
"def brightness(self):\n return self.get_value('bri')",
"def brightness(self):\n return round((self._device.current_percentage / 100) * 255)",
"def get_brightness(self):\n _lib.caca_get_dither_bright... | [
"0.8602627",
"0.84503806",
"0.8426228",
"0.8375639",
"0.8349791",
"0.8339884",
"0.83344954",
"0.8283124",
"0.81917197",
"0.79680145",
"0.7894601",
"0.78586304",
"0.78586304",
"0.77162117",
"0.76703614",
"0.7597096",
"0.75513947",
"0.7543812",
"0.7524217",
"0.7521598",
"0.7497... | 0.8533625 | 12 |
Return the color temperature of this light. | def color_temp(self):
return kelvin_to_mired(self._color_temp) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def color_temp(self):\n return self._color_temp",
"def getTemperature(self):\n return self.temperature",
"def temperature(self):\n return self._temperature",
"def temperature(self):\n return self._temperature",
"def temperature(self):\n return float(self._current_observat... | [
"0.8550451",
"0.75972027",
"0.75929296",
"0.75929296",
"0.7584848",
"0.7554157",
"0.74379694",
"0.7430193",
"0.73825926",
"0.7336957",
"0.73212904",
"0.72820795",
"0.72075",
"0.72032225",
"0.71964854",
"0.71878976",
"0.7180456",
"0.7172465",
"0.7114398",
"0.7094845",
"0.70741... | 0.8436134 | 1 |
Return minimum supported color temperature. | def min_mireds(self):
return 175 | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def min_temperature(self):\n mini, maxi = ct.c_int(), ct.c_int()\n self.lib.GetTemperatureRange(ct.pointer(mini), ct.pointer(maxi))\n return mini.value",
"def min_temp(self):\n if self.temperature_unit == UnitOfTemperature.CELSIUS:\n return MIN_TEMP_C\n return MIN_TE... | [
"0.75069237",
"0.7210723",
"0.7091037",
"0.70822674",
"0.70354617",
"0.6973797",
"0.682857",
"0.6697634",
"0.66812134",
"0.66597176",
"0.65733534",
"0.6456474",
"0.6444758",
"0.6424821",
"0.6410424",
"0.63718545",
"0.6371298",
"0.63557136",
"0.6349745",
"0.6336295",
"0.631036... | 0.0 | -1 |
Return maximum supported color temperature. | def max_mireds(self):
return 333 | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def max_temperature(self):\n mini, maxi = ct.c_int(), ct.c_int()\n self.lib.GetTemperatureRange(ct.pointer(mini), ct.pointer(maxi))\n return maxi.value",
"def max_temp(self):\n if self.temperature_unit == UnitOfTemperature.CELSIUS:\n return MAX_TEMP_C\n return MAX_TE... | [
"0.75112236",
"0.72960573",
"0.7186571",
"0.7073784",
"0.6881457",
"0.683345",
"0.6819592",
"0.6797262",
"0.6717002",
"0.6712087",
"0.6707936",
"0.6685103",
"0.66778046",
"0.66512823",
"0.66321784",
"0.65648353",
"0.6525134",
"0.64380866",
"0.63266563",
"0.6323054",
"0.630750... | 0.0 | -1 |
Instruct the light to turn on. | def turn_on(self, **kwargs: Any) -> None:
_LOGGER.debug("Turn on light %s %s", self._device.ip, kwargs)
if not self.is_on:
self._device.power_on = True
if ATTR_BRIGHTNESS in kwargs and self.brightness != kwargs[ATTR_BRIGHTNESS]:
self._device.brightness = kwargs[ATTR_BRIGHTNESS]
if ATTR_COLOR_TEMP in kwargs and self.color_temp != kwargs[ATTR_COLOR_TEMP]:
color_temp = mired_to_kelvin(kwargs[ATTR_COLOR_TEMP])
self._device.color_temperature = color_temp | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def set_light_on(self):\r\n self._light = \"ON\"",
"def set_light_on(self):\n self._light = \"ON\"",
"def turn_on(self):\n GPIO.output(self.gpio, True) # turn on light",
"def turn_on(self, **kwargs: Any) -> None:\n self._set_light(ON_STATE)",
"def lightning_turnon(self):\n ... | [
"0.8915807",
"0.8871167",
"0.88496405",
"0.88148886",
"0.86926144",
"0.8564589",
"0.82041657",
"0.819282",
"0.8009568",
"0.7997265",
"0.798326",
"0.7978372",
"0.7975517",
"0.7933295",
"0.79127806",
"0.7911189",
"0.7742512",
"0.7726695",
"0.76945895",
"0.76829916",
"0.7646578"... | 0.7831892 | 16 |
Instruct the light to turn off. | def turn_off(self, **kwargs: Any) -> None:
self._device.power_on = False
_LOGGER.debug("Turn off light %s", self._device.ip) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def turn_off(self):\n GPIO.output(self.gpio, False) # turn off light",
"def set_light_off(self):\n self._light = \"OFF\"",
"def set_light_off(self):\r\n self._light = \"OFF\"",
"def lightning_turnoff(self):\n self.turnOff()",
"def turn_off(self, **kwargs: Any) -> None:\n ... | [
"0.9141917",
"0.89695406",
"0.89557284",
"0.89015293",
"0.8897358",
"0.8873913",
"0.8805522",
"0.87862444",
"0.86670524",
"0.86476165",
"0.847877",
"0.8473624",
"0.84669805",
"0.8463841",
"0.8435901",
"0.8370482",
"0.83494097",
"0.8275936",
"0.82717854",
"0.82705396",
"0.8253... | 0.87764317 | 8 |
Synchronize state with light. | def update(self) -> None:
prev_available = self.available
self._device.update()
if (
prev_available == self.available
and self._is_on == self._device.power_on
and self._brightness == self._device.brightness
and self._color_temp == self._device.color_temperature
):
return
if not self.available:
_LOGGER.debug("Light %s is offline", self._device.ip)
return
self._is_on = self._device.power_on
self._brightness = self._device.brightness
self._color_temp = self._device.color_temperature
if not self.is_on:
_LOGGER.debug("Update light %s success: power off", self._device.ip)
else:
_LOGGER.debug(
"Update light %s success: power on brightness %s color temperature %s",
self._device.ip,
self._brightness,
self._color_temp,
) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def light_sync(self):",
"async def async_update(self):\n self._state = await self._gate.is_light_on(self._light_id)",
"def update(self) -> None:\n self._light.update()\n self._state = self._light.is_on()\n self._brightness = self._light.brightness",
"def lock (self):\n self... | [
"0.83932275",
"0.730228",
"0.6771389",
"0.6599177",
"0.6598202",
"0.65861017",
"0.65388566",
"0.6511652",
"0.65106404",
"0.65080667",
"0.646516",
"0.64101493",
"0.6382941",
"0.63396305",
"0.63342994",
"0.6315549",
"0.6311331",
"0.630048",
"0.62958086",
"0.6278275",
"0.6262956... | 0.6158366 | 29 |
This function returns the number of elements in the numbers list that are divisible by divide. | def listDivide(numbers, divide = 2):
divisible_count = 0
for i in numbers:
if i % divide == 0:
divisible_count += 1
return divisible_count | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def listDivide(numbers, divide=2): \n counter = 0\n for num in numbers:\n if num % divide == 0:\n counter+=1\n return counter",
"def listDivide(numbers, divide=2):\n newList = []\n for i in numbers:\n if i % divide == 0:\n newList.append(i)\n return len(newL... | [
"0.82095575",
"0.8028148",
"0.7676638",
"0.724413",
"0.7203808",
"0.6955737",
"0.6939475",
"0.6889885",
"0.6795731",
"0.6774087",
"0.6745991",
"0.6704762",
"0.66760755",
"0.66736186",
"0.6646036",
"0.65987384",
"0.6588523",
"0.6577694",
"0.6576061",
"0.6554679",
"0.64939314",... | 0.8605654 | 0 |
This function tests the listDivide function. | def testListDivide():
assert listDivide([1,2,3,4,5]) == 2
assert listDivide([2,4,6,8,10]) == 5
assert listDivide([30, 54, 63,98, 100], divide = 10) == 2
assert listDivide([]) == 0
assert listDivide([1,2,3,4,5], 1) == 5 | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def testListDivide():\n listDivide([1, 2, 3, 4, 5])\n listDivide([2, 4, 6, 8, 10])\n listDivide([30, 54, 63, 98, 100], divide=10)\n listDivide([])\n listDivide([1, 2, 3, 4, 5], 1)",
"def testListDivide():\n #a\n numbers = [1,2,3,4,5]\n expected = 2\n \n try:\n assert listDivi... | [
"0.8978412",
"0.8315685",
"0.72600734",
"0.7163162",
"0.6961623",
"0.69122976",
"0.6898121",
"0.68613684",
"0.68511623",
"0.6756895",
"0.6750342",
"0.66283035",
"0.66096985",
"0.65842646",
"0.6559477",
"0.64508224",
"0.6335196",
"0.6329726",
"0.6322206",
"0.6280527",
"0.62706... | 0.88921094 | 1 |
saves the source content of the webpage to a file | def url_to_file(url):
try:
r = get(url)
print(r.status_code)
if r.status_code == 200:
try:
with open(f'print-{date}.html', 'w') as f:
f.write(r.text)
except UnicodeEncodeError as e:
print("Unicode error :using encodeing utf-8")
with open(f'print-{date}.html', 'w', encoding="utf-8") as f:
f.write(r.text)
else:
print("passing headers")
headers = {"user-agent":"Edg/87.0.664.66"}
r = get(url, headers=headers)
print(r.status_code)
if r.status_code == 200:
try:
with open(f'print-{date}.html', 'w') as f:
f.write(r.text)
except UnicodeEncodeError as e:
print("Unicode error: using encodeing utf-8")
with open(f'print-{date}.html', 'w', encoding="utf-8") as f:
f.write(r.text)
else:
print(f"Unable to send requests {r.status_code}")
return r
except Exception as e:
print("Error occured",e) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def save_page_as(browser, file_name):\n\n with open(file_name, \"w\") as fout:\n fout.write(browser.find_element_by_tag_name(\"pre\").text)",
"def save(self, filename):\n outfile = open(filename, \"w\")\n outfile.write(self.html.encode('utf8'))\n outfile.close()",
"def saveToFile... | [
"0.7480921",
"0.70431954",
"0.6845408",
"0.67692447",
"0.6768163",
"0.67273104",
"0.66346675",
"0.65480995",
"0.64376026",
"0.6430084",
"0.64230853",
"0.6403235",
"0.6334453",
"0.63271886",
"0.6322628",
"0.63213557",
"0.62946224",
"0.62572914",
"0.62547946",
"0.62540007",
"0.... | 0.5828391 | 45 |
Drops an Operation, identified by it's Operation Id and it's children recursively Drop deletes the Operations from Database | def drop_operation(cls,operation_id):
db = cls._core.get_db()
stmnt = "SELECT OPE_ID FROM OPERATIONS WHERE OPE_OPE_PARENT = ? AND OPE_STATUS IN (0, 2) ;"
cur = db.query(cls._core,stmnt,(operation_id,))
for row in cur.fetchallmap():
cls.drop_operation(row["OPE_ID"])
stmnt = "DELETE FROM OPERATIONS WHERE OPE_ID = ? AND OPE_STATUS IN (0, 2) ;"
db.query(cls._core,stmnt,(operation_id,),commit=True) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def cancel_operation(cls,operation_id):\n db = cls._core.get_db()\n\n stmnt = \"SELECT OPE_ID FROM OPERATIONS WHERE OPE_OPE_PARENT = ? AND OPE_STATUS = 0 ;\"\n cur = db.query(cls._core,stmnt,(operation_id,))\n for row in cur.fetchallmap():\n cls.cancel_operation(row[\"OPE_ID\... | [
"0.68534726",
"0.59218234",
"0.5495888",
"0.5355895",
"0.5291793",
"0.5289697",
"0.52653944",
"0.52528286",
"0.5250576",
"0.52433366",
"0.5235218",
"0.5228821",
"0.5226976",
"0.522246",
"0.5191076",
"0.5159619",
"0.5126623",
"0.50397605",
"0.50218856",
"0.50218856",
"0.502188... | 0.79740757 | 0 |
Resets the state of an operation and it's children recursively to 0 (PENDING) The operation is identified by a given operationId | def retry_operation(cls,operation_id):
db = cls._core.get_db()
stmnt = "SELECT OPE_ID FROM OPERATIONS WHERE OPE_OPE_PARENT = ? AND OPE_STATUS = 2 ;"
cur = db.query(cls._core,stmnt,(operation_id,))
for row in cur.fetchallmap():
cls.retry_operation(row["OPE_ID"])
stmnt = "UPDATE OPERATIONS SET OPE_STATUS = 0 WHERE OPE_ID = ? AND OPE_STATUS = 2 ;"
db.query(cls._core,stmnt,(operation_id,),commit=True) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def cancel_operation(cls,operation_id):\n db = cls._core.get_db()\n\n stmnt = \"SELECT OPE_ID FROM OPERATIONS WHERE OPE_OPE_PARENT = ? AND OPE_STATUS = 0 ;\"\n cur = db.query(cls._core,stmnt,(operation_id,))\n for row in cur.fetchallmap():\n cls.cancel_operation(row[\"OPE_ID\... | [
"0.6283896",
"0.55792785",
"0.5552252",
"0.55377895",
"0.55284655",
"0.53993994",
"0.5203521",
"0.5042159",
"0.50319934",
"0.50242394",
"0.5023247",
"0.5015806",
"0.50039274",
"0.4977529",
"0.4977529",
"0.4977529",
"0.4977529",
"0.48844925",
"0.4862212",
"0.48437867",
"0.4841... | 0.6371056 | 0 |
Cancels an Operation, identified by it's Operation Id and it's children recursively Cancel Deletes the Operation from Database | def cancel_operation(cls,operation_id):
db = cls._core.get_db()
stmnt = "SELECT OPE_ID FROM OPERATIONS WHERE OPE_OPE_PARENT = ? AND OPE_STATUS = 0 ;"
cur = db.query(cls._core,stmnt,(operation_id,))
for row in cur.fetchallmap():
cls.cancel_operation(row["OPE_ID"])
stmnt = "DELETE FROM OPERATIONS WHERE OPE_ID = ? AND OPE_STATUS = 0 ;"
db.query(cls._core,stmnt,(operation_id,),commit=True) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def drop_operation(cls,operation_id):\n db = cls._core.get_db()\n\n stmnt = \"SELECT OPE_ID FROM OPERATIONS WHERE OPE_OPE_PARENT = ? AND OPE_STATUS IN (0, 2) ;\"\n cur = db.query(cls._core,stmnt,(operation_id,))\n for row in cur.fetchallmap():\n cls.drop_operation(row[\"OPE_I... | [
"0.66223377",
"0.63557035",
"0.63557035",
"0.63557035",
"0.62062633",
"0.5849474",
"0.5820822",
"0.57708067",
"0.5647814",
"0.56469494",
"0.55416864",
"0.55382013",
"0.54923594",
"0.54598767",
"0.5451226",
"0.5448454",
"0.54425424",
"0.54425424",
"0.54425424",
"0.5434237",
"0... | 0.8243501 | 0 |
Restore an Operationobject stored in the database by a Dataset consisting of | def restore_operation(cls, operation_record):
classname = operation_record["OPE_TYPE"]
module = "" #TODO Implement modulename from database if Operation belongs to Module
is_operation_of_module = False
exec """
try:
type(%(class)s)
except NameError,e:
is_operation_of_module = True"""%{'class':classname}
if is_operation_of_module:
exec """
from %(module)s import %(class)s
operation = %(class)s(cls._core)"""%{'class':classname,'module':module}
else:
exec """
operation = %(class)s(cls._core)"""%{'class':classname}
operation.set_id(operation_record['OPE_ID'])
db = cls._core.get_db()
stmnt = "SELECT OPD_KEY, OPD_VALUE, OPD_TYPE FROM OPERATIONDATA WHERE OPD_OPE_ID = ? ;"
cur = db.query(cls._core,stmnt,(operation_record["OPE_ID"],))
for row in cur.fetchallmap():
val = row["OPD_VALUE"]
exec """val = %s(val)"""%row["OPD_TYPE"]
operation.set_value(row["OPD_KEY"], val)
return operation | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def restore(self, oid, serial, data, version, prev_txn, transaction):\n assert not version\n self._check_trans(transaction, 'restore')\n self._async('restorea', oid, serial, data, prev_txn, id(transaction))",
"def restore(self, checkpoint):\n raise NotImplementedError",
"def mos_object(... | [
"0.6201652",
"0.6147818",
"0.5943375",
"0.5855127",
"0.5704961",
"0.56648844",
"0.56335723",
"0.55953205",
"0.55918145",
"0.55536777",
"0.55432135",
"0.5536391",
"0.5470216",
"0.54262424",
"0.539617",
"0.5361314",
"0.5206639",
"0.51915765",
"0.5184326",
"0.5164573",
"0.514952... | 0.6955749 | 0 |
Recursively executes the workloads of Operation's Childoperations It hereby catches exceptions in the workloads, sets the OPE_STATUS to 2 (FAILED) if a catch occurs, then passes the exception on to the higher layer. If an Operation succeeds, it's entry in DB gets deleted | def process_children(cls, operation):
db = cls._core.get_db()
stmnt = "SELECT OPE_ID, OPE_TYPE FROM OPERATIONS WHERE OPE_OPE_PARENT = ? ORDER BY OPE_INVOKED ;"
stmnt_lock = "UPDATE OPERATIONS SET OPE_STATUS = 1 WHERE OPE_ID = ? ;"
cur = db.query(cls._core,stmnt,(operation.get_id(),))
for row in cur.fetchallmap():
child_operation = cls.restore_operation(row)
db.query(cls._core,stmnt_lock,(child_operation.get_id(),),commit=True)
try:
cls.process_children(child_operation)
child_operation.do_workload()
except Exception,e:
stmnt_err = "UPDATE OPERATIONS SET OPE_STATUS = 2 WHERE OPE_ID = ? ;"
db.query(cls._core,stmnt_err,(int(row["OPE_ID"]),),commit=True)
#TODO GENERATE ERROR IN LOG
raise e
stmnt_delete = "DELETE FROM OPERATIONS WHERE OPE_ID = ?;"
db.query(cls._core,stmnt_delete,(child_operation.get_id(),),commit=True) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def retry_operation(cls,operation_id):\n db = cls._core.get_db()\n\n stmnt = \"SELECT OPE_ID FROM OPERATIONS WHERE OPE_OPE_PARENT = ? AND OPE_STATUS = 2 ;\"\n cur = db.query(cls._core,stmnt,(operation_id,))\n for row in cur.fetchallmap():\n cls.retry_operation(row[\"OPE_ID\"]... | [
"0.6481785",
"0.6258558",
"0.6212218",
"0.5927201",
"0.5507661",
"0.5277229",
"0.5242107",
"0.5207474",
"0.51513904",
"0.5112994",
"0.5106702",
"0.5086462",
"0.50150937",
"0.4995987",
"0.49878561",
"0.497371",
"0.49726665",
"0.4905259",
"0.49032328",
"0.48811585",
"0.48808104... | 0.766613 | 0 |
Sets the status of the next toplevel operation to 1 (ACTIVE) Fetches the next topleveloperation from the database, applies a FILESYSTEMLOCK! Which is /tmp/scv_operating.lck !!! | def process_next(cls):
db = cls._core.get_db()
configuration = cls._core.get_configuration()
if os.path.exists(configuration.get_entry("core.webpath")+"/scv_operating.lck"):
return False
lockfile = open(configuration.get_entry("core.webpath")+"/scv_operating.lck","w")
lockfile.close()
stmnt_lock = "UPDATE OPERATIONS SET OPE_STATUS = 1 \
WHERE OPE_ID IN ( \
SELECT OPE_ID FROM OPERATIONS \
WHERE OPE_OPE_PARENT IS NULL AND OPE_STATUS = 0 \
AND OPE_INVOKED = ( \
SELECT MIN(OPE_INVOKED) FROM OPERATIONS \
WHERE OPE_OPE_PARENT IS NULL AND OPE_STATUS = 0) \
) ;"
stmnt = "SELECT OPE_ID, OPE_TYPE FROM OPERATIONS WHERE OPE_OPE_PARENT IS NULL AND OPE_STATUS = 1 ;"
db.query(cls._core,stmnt_lock,commit=True)
cur = db.query(cls._core,stmnt)
res = cur.fetchallmap()
if len(res) > 0:
operation = cls.restore_operation(res[0])
try:
cls.process_children(operation)
operation.do_workload()
except Exception, e:
stmnt_err = "UPDATE OPERATIONS SET OPE_STATUS = 2 WHERE OPE_ID = ? ;"
db.query(cls._core,stmnt_err,(operation.get_id(),),commit=True)
error = StringIO()
print_exc(None,error)
cls._core.log(error.getvalue())
ret = True
else:
ret = False
stmnt_delete = "DELETE FROM OPERATIONS WHERE OPE_STATUS = 1 ;"
db.query(cls._core,stmnt_delete,commit=True)
db.commit()
try:
os.unlink(configuration.get_entry("core.webpath")+"/scv_operating.lck")
except OSError,e :
raise OperationException(OperationException.get_msg(0))
return ret | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def arm_oplock_future(self):\n self.oplock_future = self.tree.session.client.oplock_break_future(self.file_id)",
"def processLock(self):\r\n self.controller.executionLock()",
"def active(value):\r\n self.context.active = threading.BoundedSemaphore(value=value)",
"def state_wait_enter(cfg, ap... | [
"0.54746443",
"0.5449821",
"0.54388434",
"0.5305737",
"0.52546555",
"0.52230906",
"0.5174595",
"0.5144526",
"0.5143462",
"0.5060711",
"0.5041392",
"0.50204164",
"0.5015011",
"0.5006248",
"0.50048566",
"0.5001075",
"0.49896038",
"0.4973004",
"0.49551147",
"0.49547556",
"0.4952... | 0.7192307 | 0 |
Returns all Operations in an associative array. The array's indices are the operationIDs The Objects contain all information about the operations, including the Data | def get_current_operations_for_gui(cls, operation_types=None):
db = cls._core.get_db()
#TODO CHECK HOW LISTS ARE HANDLED IN FDB
if operation_types is not None and type(operation_types) == list:
stmnt = "SELECT OPE_ID, OPE_OPE_PARENT, OPE_INVOKED, OPE_TYPE, OPE_STATUS FROM OPERATIONS WHERE OPE_TYPE IN (?) ORDER BY OPE_INVOKED ;"
cur = db.query(cls._core,stmnt,(operation_types))
else:
stmnt = "SELECT OPE_ID, OPE_OPE_PARENT, OPE_INVOKED, OPE_TYPE, OPE_STATUS FROM OPERATIONS ORDER BY OPE_INVOKED ;"
cur = db.query(cls._core,stmnt)
ret = {}
for row in cur.fetchallmap():
operation = cls.restore_operation(row)
custom_values = operation.get_values()
ret[row["OPE_ID"]] = {"id":row["OPE_ID"],
"parent":row["OPE_OPE_PARENT"],
"invoked":str(row["OPE_INVOKED"]),
"type":row["OPE_TYPE"],
"status":row["OPE_STATUS"],
"data":custom_values}
return ret | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def operation_list(self):\n return self._operation_list",
"def operation_list(self):\n return self._operation_list",
"def operation_list(self):\n return self._operation_list",
"def operation_list(self):\n return self._operation_list",
"def get_operations(self):\n return s... | [
"0.7069516",
"0.7069516",
"0.7069516",
"0.7069516",
"0.6523942",
"0.6325791",
"0.63029575",
"0.6191638",
"0.6191638",
"0.61165065",
"0.60694075",
"0.6018854",
"0.60050935",
"0.5908322",
"0.58018446",
"0.5792496",
"0.5778409",
"0.5778409",
"0.5778409",
"0.575747",
"0.5727349",... | 0.628271 | 7 |
Get a new Operation Id from the Database and assign it to this Operation if this Operation's id is null. Afterwards return the new Id | def set_db_id(self):
if self._id is None:
db = self._core.get_db()
self._id = db.get_seq_next('OPE_GEN')
return self._id | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def operation_id(self) -> Optional[str]:\n return pulumi.get(self, \"operation_id\")",
"def get_unique_operation_id(self) -> np.uint64:\n\n counter_key = serialize_key('counter')\n\n # Incrementer row keys start with an \"i\"\n row_key = serialize_key(\"ioperations\")\n append_... | [
"0.7058039",
"0.6560749",
"0.64451057",
"0.63077974",
"0.6068187",
"0.5920608",
"0.58303344",
"0.58039576",
"0.5725634",
"0.5725634",
"0.56132185",
"0.55941796",
"0.55935115",
"0.55935115",
"0.55935115",
"0.55935115",
"0.55935115",
"0.55935115",
"0.5580039",
"0.55765927",
"0.... | 0.0 | -1 |
Stores this Operation to database. Also saves every user defined value in $_values as long as it is a valid type | def store(self):
db = self._core.get_db()
if self._id is None:
db = self._core.get_db()
self._id = db.get_seq_next('OPE_GEN')
stmnt = "UPDATE OR INSERT INTO OPERATIONS (OPE_ID, OPE_OPE_PARENT, OPE_INVOKED, OPE_TYPE) \
VALUES (?,?,CURRENT_TIMESTAMP,?) MATCHING (OPE_ID);"
db.query(self._core,stmnt,(self._id,self._parent,self.__class__.__name__),commit=True)
stmnt = "UPDATE OR INSERT INTO OPERATIONDATA (OPD_OPE_ID, OPD_KEY, OPD_VALUE, OPD_TYPE) \
VALUES ( ?, ?, ?, ?) MATCHING(OPD_OPE_ID,OPD_KEY);"
for key, value in self._values.items():
typ = str(type(value)).replace("<type '","",1).replace("'>","",1)
if typ not in Operation.VALID_STORAGE_TYPES:
continue
db.query(self._core,stmnt,(self._id,key,value,typ),commit=True) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def save_vals (self):\n raise NotImplementedError",
"def save(self, values):",
"def persist(self, values):\n pass",
"def save(self):\n data = self.serialize()\n\n self.validate(data)\n\n saved_data = DATABASE_CONNECTION.insert(self.__class__.__name__, data)\n\n self.... | [
"0.74617493",
"0.7196511",
"0.7009068",
"0.6361609",
"0.62717307",
"0.6257779",
"0.6165036",
"0.608339",
"0.60653645",
"0.60352385",
"0.6013189",
"0.5978669",
"0.59265023",
"0.58840144",
"0.58840144",
"0.58840144",
"0.5868349",
"0.5846248",
"0.58364046",
"0.5794738",
"0.57928... | 0.6750283 | 3 |
This method must be overridden by inheriting classes. The code inside this method will be executed when the | def do_workload(self):
pass | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def override(self):\n return None",
"def __call__(self):\r\n raise NotImplementedError('override me')",
"def __call__(self):\n\t\treturn",
"def run(self):\n raise Exception('derived class should redefine this function')",
"def __call__( self ):\n pass",
"def runThis(self):\n ... | [
"0.75245625",
"0.7466125",
"0.73410434",
"0.7315841",
"0.7287032",
"0.72735256",
"0.7255045",
"0.72209936",
"0.7202259",
"0.7187639",
"0.71060145",
"0.7067497",
"0.7067497",
"0.70535463",
"0.6988847",
"0.6977445",
"0.6951473",
"0.6951473",
"0.6951473",
"0.6951473",
"0.6951473... | 0.0 | -1 |
Sets this operations values from module metadata | def set_values(self,module):
if type(module) == dict:
self.set_value("name",module["name"])
self.set_value("hrname",module["hrname"])
self.set_value("version_major",module["version_major"])
self.set_value("version_minor",module["version_minor"])
self.set_value("revision",module["revision"])
if module.has_key("signature"):
self.set_value("signature",module["signature"])
elif module.__class__.__name__ == "Module":
pass #TODO IMPLEMENT / DISCUSS AFTER IMPLEMENTING MODULE-SUBSYSTEM | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def set_metadata(self, data):\r\n pass",
"def __init__(self):\n\n self.operations = {}",
"def PopulateModuleMetadata(self, mod, mojom_file):\n mod.name = os.path.basename(mojom_file.file_name)\n mod.path = mojom_file.file_name\n mod.namespace = mojom_file.module_namespace\n if mojom_f... | [
"0.59990793",
"0.58392733",
"0.5662214",
"0.5603085",
"0.55330473",
"0.55237305",
"0.5490515",
"0.5485604",
"0.5479347",
"0.54730034",
"0.54730034",
"0.54730034",
"0.54730034",
"0.54730034",
"0.54730034",
"0.5461847",
"0.54556865",
"0.54516035",
"0.54180896",
"0.54075307",
"0... | 0.6323762 | 0 |
Returns an Array of ModuleOperationObjects that are currently listedin the queue | def get_currently_processed_modules(cls):
db = cls._core.get_db()
stmnt = "SELECT OPE_ID, OPE_OPE_PARENT, OPE_TYPE FROM OPERATIONS \
WHERE OPE_TYPE = 'ModuleInstallOperation' \
or OPE_TYPE = 'ModuleUninstallOperation' ;"
cur = db.query(cls._core,stmnt);
ret = []
for row in cur.fetchallmap():
ret.append(Operation.restore_operation(row).get_meta())
return ret | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def operation_list(self):\n return self._operation_list",
"def operation_list(self):\n return self._operation_list",
"def operation_list(self):\n return self._operation_list",
"def operation_list(self):\n return self._operation_list",
"def get_queue_list(self):\n return s... | [
"0.63590986",
"0.63590986",
"0.63590986",
"0.63590986",
"0.6177426",
"0.5978019",
"0.5920926",
"0.5920926",
"0.5920926",
"0.5920926",
"0.5920926",
"0.5920926",
"0.5920926",
"0.5920926",
"0.5920926",
"0.5798638",
"0.57853013",
"0.5771161",
"0.5731278",
"0.5724055",
"0.56982976... | 0.7111473 | 0 |
tell the module manager to install a specific module. | def do_workload(self):
module_manager = self._core.get_module_manager()
module_manager.install_module(self.get_meta()) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def install_package(self, package):\n raise NotImplementedError(\"install_package not implemented!\")",
"def install(*module_names):\n for m_name in module_names:\n if not find_spec(m_name):\n if input(NOT_FOUND_MSG.format(m_name)).lower() not in 'Nn':\n if main(['insta... | [
"0.6969152",
"0.69388556",
"0.6872978",
"0.68555695",
"0.6801365",
"0.67761844",
"0.6767428",
"0.6733695",
"0.6714173",
"0.66525847",
"0.6616081",
"0.65094006",
"0.6481745",
"0.64168596",
"0.63249385",
"0.6309751",
"0.6267477",
"0.6245471",
"0.6231327",
"0.6215618",
"0.620006... | 0.6157249 | 21 |
tell the module manager to install a specific module. | def do_workload(self):
module_manager = self._core.get_module_manager()
module = module_manager.get_module_by_name(self._values["name"])
module_manager.uninstall_module(module) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def install_package(self, package):\n raise NotImplementedError(\"install_package not implemented!\")",
"def install(*module_names):\n for m_name in module_names:\n if not find_spec(m_name):\n if input(NOT_FOUND_MSG.format(m_name)).lower() not in 'Nn':\n if main(['insta... | [
"0.6969152",
"0.69388556",
"0.6872978",
"0.68555695",
"0.6801365",
"0.67761844",
"0.6767428",
"0.6733695",
"0.6714173",
"0.66525847",
"0.6616081",
"0.65094006",
"0.6481745",
"0.64168596",
"0.63249385",
"0.6309751",
"0.6267477",
"0.6245471",
"0.6231327",
"0.6215618",
"0.620006... | 0.0 | -1 |
tell the module manager to install a specific module. | def do_workload(self):
module_manager = self._core.get_module_manager()
module = module_manager.get_module_by_name(self._values["name"])
module_manager.update_module(module) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def install_package(self, package):\n raise NotImplementedError(\"install_package not implemented!\")",
"def install(*module_names):\n for m_name in module_names:\n if not find_spec(m_name):\n if input(NOT_FOUND_MSG.format(m_name)).lower() not in 'Nn':\n if main(['insta... | [
"0.6969152",
"0.69388556",
"0.6872978",
"0.68555695",
"0.6801365",
"0.67761844",
"0.6767428",
"0.6733695",
"0.6714173",
"0.66525847",
"0.6616081",
"0.65094006",
"0.6481745",
"0.64168596",
"0.63249385",
"0.6309751",
"0.6267477",
"0.6245471",
"0.6231327",
"0.6215618",
"0.620006... | 0.0 | -1 |
Do work if there is work to do, otherwise check every two seconds for new work. | def run(self):
operation_manager = self._core.get_operation_manager()
while True:
while operation_manager.process_next():
pass
sleep(2) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def run_checks():\n while True:\n if datetime.now() > core.misc_data.check_date+timedelta(minutes=45):\n for stuff in stuff_to_do:\n threading.Thread(target=stuff).start()\n core.misc_data.check_date = datetime.now() + config.utils.tasks.repeat_every\n time.sle... | [
"0.6984714",
"0.6409769",
"0.6315232",
"0.62860876",
"0.6256095",
"0.62228227",
"0.61101943",
"0.60830945",
"0.6035169",
"0.60236955",
"0.59735036",
"0.59445417",
"0.5925701",
"0.5867354",
"0.5861029",
"0.5783809",
"0.5782785",
"0.5782785",
"0.5774008",
"0.57409346",
"0.57183... | 0.5247155 | 97 |
Return squarefree decomposition of a polynomial in ``K[X]``. Examples ======== >>> R, x, y = ring('x y', ZZ) >>> R.sqf_list(x5 + 2x4y + x3y2) (1, [(x + y, 2), (x, 3)]) >>> R, x, y = ring('x y', FF(5)) >>> f = x5y5 + 1 | def sqf_list(self, f):
domain = self.domain
if domain.is_Field:
coeff, f = f.LC, f.monic()
else:
coeff, f = f.primitive()
if domain.is_FiniteField:
return coeff, self._gf_sqf_list(f)
return coeff, self._rr_yun0_sqf_list(f) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def zzX_sqr(f):\n if poly_univariate_p(f):\n return zzx_sqr(f)\n\n if zzX_zero_p(f):\n return f\n\n df = zzX_degree(f)\n l = poly_level(f)-1\n\n h = []\n\n for i in xrange(0, 2*df+1):\n coeff = zzX_zero(l)\n\n jmin = max(0, i-df)\n jmax = min(i, df)\n\n n... | [
"0.58898497",
"0.5696768",
"0.55792755",
"0.5505899",
"0.53948593",
"0.53656983",
"0.51418346",
"0.51252043",
"0.5098417",
"0.50928617",
"0.50540054",
"0.5037502",
"0.49890068",
"0.48362672",
"0.48262566",
"0.48185673",
"0.4812812",
"0.48055914",
"0.47933468",
"0.47783032",
"... | 0.55302864 | 3 |
Compute squarefree decomposition of the monic ``f`` in ``GF(q)[X]``. Notes ===== Uses a modified version of Musser's algorithm for squarefree decomposition of univariate polynomials over finite fields. References ========== | def _gf_sqf_list(self, f):
domain = self.domain
n, factors, p = 1, [], int(domain.characteristic)
m = int(domain.order // p)
while not f.is_ground:
df = [f.diff(x) for x in self.gens]
if any(_ for _ in df):
g = f
for q in df:
g = self.gcd(g, q)
h, f, i = f // g, g, 1
while h != 1:
g = self.gcd(f, h)
h //= g
if not h.is_ground:
factors.append((h, i*n))
f //= g
h = g
i += 1
n *= p
g = self.zero
for monom, coeff in f.items():
g[tuple(_ // p for _ in monom)] = coeff**m
f = g
return factors | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def is_squarefree(self, f):\n if f.is_ground:\n return True\n g = f\n for x in self.gens:\n g = self.gcd(g, f.diff(x))\n if g.is_ground:\n return True\n return False",
"def sqf_part(self, f):\n domain = self.domain\n\n if d... | [
"0.6348645",
"0.6082395",
"0.60524696",
"0.60362184",
"0.5977433",
"0.5936218",
"0.5890577",
"0.58653134",
"0.5856254",
"0.57929945",
"0.5784882",
"0.5635512",
"0.56248885",
"0.554542",
"0.55379504",
"0.5530155",
"0.5527634",
"0.55048215",
"0.54990107",
"0.5371403",
"0.536764... | 0.6371153 | 0 |
Compute squarefree decomposition of ``f`` in zerocharacteristic ring ``K[X]``. References ========== | def _rr_yun0_sqf_list(self, f):
if f.is_ground:
return []
result, count = [], 1
qs = [f.diff(x) for x in self.gens]
g = f
for q in qs:
g = self.gcd(g, q)
while f != 1:
qs = [q // g for q in qs]
f //= g
qs = [q - f.diff(x) for x, q in zip(self.gens, qs)]
g = f
for q in qs:
g = self.gcd(g, q)
if g != 1:
result.append((g, count))
count += 1
return result | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def vsfun(Q_slm, theta, phi,f=[]):\n vsf_th=numpy.zeros(theta.shape, dtype='complex')\n vsf_ph=numpy.zeros(theta.shape, dtype='complex')\n for (s,l,m) in Q_slm:\n vsh_th,vsh_ph=K(s, l, m, theta, phi)\n c_slm=Q_slm.getBysnm(s, l, m) if not(f) else Q_slm.getBysnm(s, l, m)(f)\n vsf_th=vsf_th+c_slm*vsh_th\... | [
"0.5876295",
"0.5828523",
"0.58153415",
"0.57921195",
"0.5763062",
"0.5645726",
"0.5505161",
"0.54806006",
"0.54626274",
"0.5399158",
"0.5388178",
"0.53604126",
"0.53176093",
"0.5301814",
"0.52727515",
"0.5272213",
"0.52575696",
"0.52096814",
"0.52035517",
"0.51917213",
"0.51... | 0.0 | -1 |
Return ``True`` if ``f`` is a squarefree polynomial in ``K[X]``. Examples ======== >>> _, x, y = ring('x y', ZZ) >>> ((x + y)2).is_squarefree False >>> (x2 + y2).is_squarefree True | def is_squarefree(self, f):
if f.is_ground:
return True
g = f
for x in self.gens:
g = self.gcd(g, f.diff(x))
if g.is_ground:
return True
return False | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def is_squarefree_hilbert_number(n):\n return is_hilbert_number(n) and is_hilbert_squarefree_number(n)",
"def isNodeSheaf(_session, _node):\n return checkIncToSets(_session, _node, [keynodes.info.stype_sheaf], sc.SC_A_CONST | sc.SC_POS)",
"def is_sqf(f):\n return dmp_sqf_p(f.rep, f.lev, f.dom)",
... | [
"0.56360364",
"0.5465797",
"0.5397887",
"0.5356589",
"0.533036",
"0.51120263",
"0.50754285",
"0.5052217",
"0.49830848",
"0.49745223",
"0.49274656",
"0.4885014",
"0.48708126",
"0.484963",
"0.48122284",
"0.47914714",
"0.47727177",
"0.47523925",
"0.47462133",
"0.47416347",
"0.47... | 0.74997777 | 0 |
Returns squarefree part of a polynomial in ``K[X]``. Examples ======== >>> R, x, y = ring('x y', ZZ) >>> R.sqf_part(x3 + 2x2y + xy2) x2 + xy | def sqf_part(self, f):
domain = self.domain
if domain.is_FiniteField:
g = self.one
for f, _ in self.sqf_list(f)[1]:
g *= f
return g
if not f:
return f
gcd = f
for x in self.gens:
gcd = self.gcd(gcd, f.diff(x))
sqf = f // gcd
if domain.is_Field:
return sqf.monic()
return sqf.primitive()[1] | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def zzX_sqf_part(f):\n quo = zzX_quo(f, zzX_gcd(f, zzX_diff(f)))\n return zzX_primitive(quo)[1]",
"def rfpart(x):\n return 1 - fpart(x)",
"def sqf_part(f):\n return f.per(dmp_sqf_part(f.rep, f.lev, f.dom))",
"def zzx_sqf_part(f):\n quo = zzx_quo(f, zzx_gcd(f, zzx_diff(f)))\n return zzx_... | [
"0.59264237",
"0.5611723",
"0.55813473",
"0.5479996",
"0.5371169",
"0.51204914",
"0.50550634",
"0.50538117",
"0.49067897",
"0.47249427",
"0.4711605",
"0.46479887",
"0.46400973",
"0.4625992",
"0.4623234",
"0.45929667",
"0.4567981",
"0.45518592",
"0.45361853",
"0.4516747",
"0.4... | 0.50990486 | 6 |
Squarefree norm of ``f`` in ``K[X]``, useful over algebraic domains. Returns ``s``, ``f``, ``r``, such that ``g(x) = f(xsa)`` and ``r(x) = Norm(g(x))`` is a squarefree polynomial over K, where ``a`` is the algebraic extension of ``K``. Examples ======== >>> _, x, y = ring('x y', QQ.algebraic_field(I)) >>> (xy + y2).sqf_norm() (1, xy Ix + y2 3Iy 2, x2y2 + x2 + 2xy3 + 2xy + y4 + 5y2 + 4) | def sqf_norm(self, f):
domain = self.domain
if not domain.is_AlgebraicField:
raise DomainError(f'ground domain must be algebraic, got {domain}')
new_ring = self.to_ground().inject(*domain.symbols, front=True)
g = domain.mod.set_ring(new_ring)
s = 0
while True:
h = f.inject(front=True)
r = g.resultant(h)
if r.is_squarefree:
return s, f, r
f = f.compose({x: x - domain.unit for x in self.gens})
s += 1 | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def sqf_norm(f):\n s, g, r = dmp_sqf_norm(f.rep, f.lev, f.dom)\n return s, f.per(g), f.per(r, dom=f.dom.dom)",
"def squared_frobenius_norm(x):\n # http://mathworld.wolfram.com/FrobeniusNorm.html\n # The gradient of KL[p,q] is not defined when p==q. The culprit is\n # tf.norm, i.e., we cann... | [
"0.6828397",
"0.6347827",
"0.58674204",
"0.58420646",
"0.57301825",
"0.56841624",
"0.56582105",
"0.56257766",
"0.5603542",
"0.55873054",
"0.5552461",
"0.55447716",
"0.55371946",
"0.5521278",
"0.5477447",
"0.54771346",
"0.5461877",
"0.54501307",
"0.54418135",
"0.53796417",
"0.... | 0.7036989 | 0 |
tries number of times to retry starting the broker. < 0 means infinitely many. delay number of seconds to wait after the first failed attempt backoff factor by which the delay will be incremented after a failure. | def startSTOMPBroker(config, serverUpEvent, tries=-1, delay=1, backoff=1.5):
#stomp broker
mtries = tries
mdelay = delay
coilserver = None
from coilmq.config import config as coilconfig
if config.has_section('coilmq'):
for k,v in config.items('coilmq'):
coilconfig.set('coilmq', k, v)
logger.debug("Set %s to %s for coilmq config." % (k,v))
while True:
try:
coilserver = coilmq.start.server_from_config(coilconfig)
logger.info("Stomp server listening on %s:%s" % \
coilserver.server_address)
serverUpEvent.set()
coilserver.serve_forever()
except IOError as ex:
logger.error("Exception while starting coilmq broker: '%s'", ex)
if mtries != 0:
logger.debug("Retrying coilmq startup in %.1f seconds...", mdelay)
time.sleep(mdelay)
mdelay *= backoff
mtries -= 1
else:
logger.debug("Ran out of trials (tried %d times) for coilmq startup. Giving up.", tries)
break
finally:
if coilserver: coilserver.server_close() | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_retry_delay(self, last_delay):\n return last_delay * 2",
"def retry(times):\n return repeat_with_success_at_least(times, 1)",
"def retry(tries, delay=3, backoff=2):\n tries = math.floor(tries)\n if tries < 0:\n raise ValueError(\"tries must be 0 or greater\")\n\n\n ... | [
"0.68163663",
"0.67791754",
"0.6515797",
"0.64622295",
"0.64621955",
"0.6419269",
"0.6208343",
"0.6206229",
"0.61321574",
"0.60527027",
"0.60336995",
"0.6022903",
"0.594526",
"0.5920799",
"0.58964133",
"0.5895078",
"0.5889684",
"0.5877148",
"0.5873413",
"0.58332604",
"0.58207... | 0.0 | -1 |
Start twisted event loop and the fun should begin... brokerTimeout how long to wait for a broker a negative number upon failure. Otherwise, it never returns. | def start(config, brokerTimeout = 60.0):
manager = multiprocessing.Manager()
serverUpEvent = manager.Event()
broker = multiprocessing.Process(target=startSTOMPBroker, args=(config,serverUpEvent))
broker.daemon = True
broker.name = 'STOMP-Broker'
broker.start()
serverUpEvent.wait(brokerTimeout)
if not serverUpEvent.is_set():
logger.fatal("Broker not available after %.1f seconds. Giving up", brokerTimeout)
return -1
#host side logic
host = config.get('Broker', 'host')
port = int(config.get('Broker', 'port'))
username = config.get('Broker', 'username')
password = config.get('Broker', 'password')
hostEngine = HostStompEngine(config)
stompProtocolFactory = StompProtocolFactory(hostEngine, username, password)
HostXMLRPCService(config).makeEngineAccesible(hostEngine)
reactor.connectTCP(host, port, stompProtocolFactory)
reactor.run() | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def on_running():\n log.msg('reactor_loop Starting')\n try:\n conn = client.connect(reactor)\n si446x_do = Si446xComponent(conn)\n conn.addCallback(si446x_do.start)\n conn.addErrback(si446x_do.on_error)\n except error.DBusException, e:\n l... | [
"0.6220351",
"0.62159324",
"0.61877704",
"0.6160593",
"0.61132985",
"0.59028834",
"0.58682054",
"0.5843688",
"0.5822215",
"0.5798466",
"0.57124496",
"0.57084095",
"0.566796",
"0.56646776",
"0.56603914",
"0.5605297",
"0.55968124",
"0.55797726",
"0.55603266",
"0.55498093",
"0.5... | 0.6690256 | 0 |
Initializes the object with a tuple of information. | def __init__(self, info=None):
self.astral = None
if info is None:
self.name = 'Greenwich'
self.country = 'England'
self._latitude = 51.168
self._longitude = 0
self._timezone_group = 'Europe'
self._timezone_location = 'London'
else:
self._latitude = 0
self._longitude = 0
self._timezone_group = ''
self._timezone_location = ''
try:
self.name = info[0].encode('utf-8')
self.country = info[1].encode('utf-8')
self.latitude = info[2]
self.longitude = info[3]
self.timezone = info[4]
except:
pass | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def __init__(self, fields):\n self.__init_handle_by_constructor__(_make.TupleType, fields)",
"def __init__(self, *args):\n _snap.TAttrPair_swiginit(self, _snap.new_TAttrPair(*args))",
"def __init__(self, config: Tuple):",
"def __init__(self):\n\n data_extract=DataExtracter()\n sel... | [
"0.76838994",
"0.6909169",
"0.69027334",
"0.6892625",
"0.6837433",
"0.6632949",
"0.65825474",
"0.656346",
"0.6476574",
"0.6431456",
"0.6426662",
"0.6349654",
"0.6341158",
"0.63148826",
"0.6312479",
"0.62745905",
"0.6267313",
"0.62587535",
"0.6253988",
"0.6251733",
"0.6246671"... | 0.6001026 | 64 |
Calculates the time in the morning when the sun is a certain number of degrees below the horizon. By default this is 6 degrees but can be changed | def dawn(self, date=None, local=True):
if self.astral is None:
self.astral = Astral()
if date is None:
date = datetime.date.today()
dawn = self.astral.dawn_utc(date, self.latitude, self.longitude)
if local:
return dawn.astimezone(self.tz)
else:
return dawn | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def equation_of_time(cls, date):\n offset = cls.sine(cls.mean_position(date, cls.ANOMALISTIC_YEAR))\n equation_sun = (offset * angle(57, 18, 0) * (14/360 - (abs(offset) / 1080)))\n return ((cls.daily_motion(date) / 360) * (equation_sun / 360) * cls.SIDEREAL_YEAR)",
"def sundial_time(cls, tee... | [
"0.6528656",
"0.63950557",
"0.60731083",
"0.5948047",
"0.58831996",
"0.58726454",
"0.586126",
"0.58426833",
"0.58409107",
"0.5811609",
"0.57901573",
"0.5728057",
"0.56637347",
"0.56392944",
"0.56149286",
"0.5611691",
"0.55851465",
"0.5576015",
"0.55250823",
"0.5508363",
"0.54... | 0.0 | -1 |
Return sunrise time. Calculates the time in the morning when the sun is a 0.833 degrees below the horizon. This is to account for refraction. | def sunrise(self, date=None, local=True):
if self.astral is None:
self.astral = Astral()
if date is None:
date = datetime.date.today()
sunrise = self.astral.sunrise_utc(date, self.latitude, self.longitude)
if local:
return sunrise.astimezone(self.tz)
else:
return sunrise | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def alt_sunrise(cls, date):\n rise = cls.UJJAIN.dawn(date, angle(0, 47, 0))\n return 1/24 * 1/60 * iround(rise * 24 * 60)",
"def sundial_time(cls, tee):\n date = Clock.fixed_from_moment(tee)\n time = mod(tee, 1)\n q = ifloor(4 * time)\n if q == 0:\n a = cls... | [
"0.7141806",
"0.7119291",
"0.70426834",
"0.68516636",
"0.6563814",
"0.64964134",
"0.6399623",
"0.6321392",
"0.63076687",
"0.60870713",
"0.5994337",
"0.59702235",
"0.5949885",
"0.5923036",
"0.5906305",
"0.5899862",
"0.5849699",
"0.57508343",
"0.57498085",
"0.5634182",
"0.55695... | 0.53256434 | 39 |
Calculates the solar noon (the time when the sun is at its highest point.) | def solar_noon(self, date=None, local=True):
if self.astral is None:
self.astral = Astral()
if date is None:
date = datetime.date.today()
noon = self.astral.solar_noon_utc(date, self.longitude)
if local:
return noon.astimezone(self.tz)
else:
return noon | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def solar_noon_local(LonDegE):\n return 12.",
"def solar_noon_utc(self, date, longitude):\n \n julianday = self._julianday(date.day, date.month, date.year)\n\n newt = self._jday_to_jcentury(julianday + 0.5 + longitude / 360.0)\n\n eqtime = self._eq_of_time(newt)\n timeUTC = ... | [
"0.6816998",
"0.66865885",
"0.6304783",
"0.6012745",
"0.60126984",
"0.59854287",
"0.592383",
"0.585429",
"0.5843106",
"0.5810727",
"0.58008647",
"0.5759068",
"0.5738313",
"0.57033736",
"0.570194",
"0.56586534",
"0.5638657",
"0.5631576",
"0.5618385",
"0.5601817",
"0.55713826",... | 0.6865988 | 0 |
Calculates sunset time (the time in the evening when the sun is a 0.833 degrees below the horizon. This is to account for refraction.) | def sunset(self, date=None, local=True):
if self.astral is None:
self.astral = Astral()
if date is None:
date = datetime.date.today()
sunset = self.astral.sunset_utc(date, self.latitude, self.longitude)
if local:
return sunset.astimezone(self.tz)
else:
return sunset | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def sundial_time(cls, tee):\n date = Clock.fixed_from_moment(tee)\n time = mod(tee, 1)\n q = ifloor(4 * time)\n if q == 0:\n a = cls.sunset(date - 1)\n b = cls.sunrise(date)\n t = Clock.days_from_hours(-6)\n elif q == 3:\n a = cls.su... | [
"0.74437636",
"0.6815162",
"0.6379348",
"0.6302862",
"0.6234464",
"0.61841786",
"0.61803925",
"0.591679",
"0.57105523",
"0.57086027",
"0.5666004",
"0.5648924",
"0.56333864",
"0.5610499",
"0.55877644",
"0.55800503",
"0.556043",
"0.5549913",
"0.55466384",
"0.5520775",
"0.549118... | 0.5021731 | 80 |
Calculates the dusk time (the time in the evening when the sun is a certain number of degrees below the horizon. By default this is 6 degrees but can be changed | def dusk(self, date=None, local=True):
if self.astral is None:
self.astral = Astral()
if date is None:
date = datetime.date.today()
dusk = self.astral.dusk_utc(date, self.latitude, self.longitude)
if local:
return dusk.astimezone(self.tz)
else:
return dusk | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def dusk_utc(self, date, latitude, longitude):\n \n julianday = self._julianday(date.day, date.month, date.year)\n\n if latitude > 89.8:\n latitude = 89.8\n \n if latitude < -89.8:\n latitude = -89.8\n \n t = self._jday_to_jcentury(julianda... | [
"0.6691584",
"0.6364968",
"0.6130741",
"0.59310466",
"0.583694",
"0.5834618",
"0.5786861",
"0.5731586",
"0.56987673",
"0.5689336",
"0.568822",
"0.56476253",
"0.56455123",
"0.56278443",
"0.5611392",
"0.5609227",
"0.5550629",
"0.5508177",
"0.55058354",
"0.5498458",
"0.54921347"... | 0.0 | -1 |
Returns dawn, sunrise, noon, sunset and dusk as a dictionary. | def sun(self, date=None, local=True):
if self.astral is None:
self.astral = Astral()
if date is None:
date = datetime.date.today()
sun = self.astral.sun_utc(date, self.latitude, self.longitude)
if local:
for key, dt in sun.items():
sun[key] = dt.astimezone(self.tz)
return sun | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def sun_utc(self, date, latitude, longitude):\n \n dawn = self.dawn_utc(date, latitude, longitude)\n sunrise = self.sunrise_utc(date, latitude, longitude)\n noon = self.solar_noon_utc(date, longitude)\n sunset = self.sunset_utc(date, latitude, longitude)\n dusk = self.dusk... | [
"0.6244639",
"0.5948716",
"0.5810174",
"0.5733287",
"0.5685426",
"0.5663543",
"0.56323534",
"0.5594207",
"0.55913526",
"0.5588648",
"0.5566428",
"0.555051",
"0.5539472",
"0.5533902",
"0.5526651",
"0.5480028",
"0.5478169",
"0.54696566",
"0.5455117",
"0.54445684",
"0.5444169",
... | 0.0 | -1 |
Calculates the period of rahukaalam. | def rahukaalam(self, date=None, local=True):
if self.astral is None:
self.astral = Astral()
if date is None:
date = datetime.date.today()
rahukaalam = self.astral.rahukaalam_utc(date, self.latitude, self.longitude)
if local:
for key, dt in rahukaalam.items():
rahukaalam[key] = dt.astimezone(self.tz)
return rahukaalam | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def period(self) -> int:",
"def generate_rapel(self):\n config = self.env['ka_hr_payroll.config'].default_config()\n last_period = self.get_last_period(self.status_id.id, self.company_payroll_id.id, config=config)\n if last_period:\n date_done = datetime.strptime(self.date_done, D... | [
"0.68010175",
"0.60649586",
"0.59108144",
"0.58845204",
"0.58199346",
"0.5665051",
"0.56304914",
"0.562789",
"0.5617035",
"0.55706686",
"0.5552009",
"0.5500564",
"0.5400052",
"0.53994274",
"0.53955257",
"0.5372322",
"0.5367489",
"0.5362566",
"0.5361659",
"0.5354063",
"0.53483... | 0.0 | -1 |
Calculates the solar azimuth angle for a specific date/time. | def solar_azimuth(self, dateandtime=None):
if self.astral is None:
self.astral = Astral()
if dateandtime is None:
dateandtime = datetime.datetime.now(tz=self.tz)
return self.astral.solar_azimuth(dateandtime, self.latitude, self.longitude) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def solar_azimuth(self, dateandtime, latitude, longitude):\n \n if latitude > 89.8:\n latitude = 89.8\n \n if latitude < -89.8:\n latitude = -89.8\n \n zone = -dateandtime.utcoffset().seconds / 3600.0\n utc_datetime = dateandtime.astimezone(pytz.ut... | [
"0.78250027",
"0.67446834",
"0.6695796",
"0.64115757",
"0.6395283",
"0.63717794",
"0.63140875",
"0.62267244",
"0.6145953",
"0.6141899",
"0.6060071",
"0.598316",
"0.5980102",
"0.59746766",
"0.5884954",
"0.58290213",
"0.5812057",
"0.58084035",
"0.57966334",
"0.5779464",
"0.5756... | 0.7764275 | 1 |
Calculates the solar elevation angle for a specific time. | def solar_elevation(self, dateandtime=None):
if self.astral is None:
self.astral = Astral()
if dateandtime is None:
dateandtime = datetime.datetime.now(tz=self.tz)
return self.astral.solar_elevation(dateandtime, self.latitude, self.longitude) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def solar_elevation(self, dateandtime, latitude, longitude):\n \n if latitude > 89.8:\n latitude = 89.8\n \n if latitude < -89.8:\n latitude = -89.8\n\n zone = -dateandtime.utcoffset().seconds / 3600.0\n utc_datetime = dateandtime.astimezone(pytz.utc)... | [
"0.71530664",
"0.67977107",
"0.67431724",
"0.6220381",
"0.61309683",
"0.6082073",
"0.6003304",
"0.5945914",
"0.5920471",
"0.58973986",
"0.5858497",
"0.58510685",
"0.58294576",
"0.579033",
"0.57864755",
"0.57316357",
"0.5688304",
"0.56844896",
"0.56828004",
"0.56804633",
"0.56... | 0.70600396 | 1 |
Access to each timezone group. For example London is in timezone group Europe. Attribute lookup is case insensitive | def __getattr__(self, key):
key = str(key).lower().encode('utf-8')
for name, value in self._groups.items():
if name == key:
return value
raise AttributeError('Group \'%s\' not found' % key) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_athlete_zones(self):\n pass",
"def grouping_timezone(self):\n return tz.gettz(self._summariser.grouping_time_zone)",
"def associate_timezones_to_countries(self):\n\t\t\n\t\tresult = {}\n\t\twith open(\"/usr/share/zoneinfo/zone.tab\", \"r\") as f:\n\t\t\tfor line in f.readlines():\n\t\t\t\... | [
"0.5835346",
"0.57775724",
"0.57361513",
"0.5698909",
"0.55084604",
"0.55003285",
"0.545441",
"0.5390807",
"0.53817374",
"0.5315582",
"0.526018",
"0.52240425",
"0.51877755",
"0.5176649",
"0.516878",
"0.51196074",
"0.5056693",
"0.50521755",
"0.49813348",
"0.49468496",
"0.49349... | 0.45075953 | 76 |
Lookup a city within all timezone groups. Item lookup is case insensitive. | def __getitem__(self, key):
key = str(key).lower().encode('utf-8')
for group in self._groups.values():
try:
return group[key]
except KeyError:
pass
raise KeyError('Unrecognised city name - %s' % key) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_cities(self, city_name: str = None):",
"def get_cities(self, city_name: str = \"\"):",
"async def _timein_city(self, *, city_name):\n\t\t\n\t\tapiKey = self.settings['api_key']\n\t\tif \".com\" in apiKey:\n\t\t\tawait self.bot.say(\"You have to set your API key, see data/timein/settings.json for detail... | [
"0.65049624",
"0.63830185",
"0.6244422",
"0.61362547",
"0.61103976",
"0.5962785",
"0.5956759",
"0.5944463",
"0.5939915",
"0.5865012",
"0.58639216",
"0.58566123",
"0.5840458",
"0.58180654",
"0.58092016",
"0.58036107",
"0.58036107",
"0.5790917",
"0.57779676",
"0.5772209",
"0.57... | 0.61644584 | 3 |
Initialise the city database and set the default depression. | def __init__(self):
self._citydb = CityDB()
self._depression = 6 # Set default depression in degrees | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def setUp(self):\n self.my_city = City()",
"def initialize():\n sql_db = SQLConnection()\n with SQLCursor(sql_db) as cur:\n cur.execute('SELECT position from govt_info')\n row = cur.fetchone()\n for pos in Government.positions:\n if row is None or len(row) != len(Gove... | [
"0.6182034",
"0.6132606",
"0.60481834",
"0.60060346",
"0.5950479",
"0.5950479",
"0.59373367",
"0.59160274",
"0.5874279",
"0.58517987",
"0.5830317",
"0.58109874",
"0.5791189",
"0.57841307",
"0.5774677",
"0.57559514",
"0.5754031",
"0.57528317",
"0.5746476",
"0.5727893",
"0.5670... | 0.77128774 | 0 |
Returns the City instance specified by ``key``. | def __getitem__(self, key):
city = self._citydb[key]
city.astral = self
return city | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_city(self, name: str):\n key = name.lower()\n try:\n return self._cities[key]\n except KeyError:\n city = City(name=name, state=self)\n self._cities[key] = city\n return city",
"def __getitem__(self, key):\n \n key = str(key).... | [
"0.6803799",
"0.64028823",
"0.61282915",
"0.6064786",
"0.598396",
"0.5972638",
"0.59683293",
"0.59556264",
"0.5922655",
"0.5832542",
"0.5792213",
"0.5784531",
"0.57582283",
"0.573862",
"0.57019925",
"0.5670712",
"0.56591344",
"0.56591344",
"0.56481266",
"0.56079686",
"0.55630... | 0.769488 | 0 |
Calculate all the info for the sun at once. | def sun_utc(self, date, latitude, longitude):
dawn = self.dawn_utc(date, latitude, longitude)
sunrise = self.sunrise_utc(date, latitude, longitude)
noon = self.solar_noon_utc(date, longitude)
sunset = self.sunset_utc(date, latitude, longitude)
dusk = self.dusk_utc(date, latitude, longitude)
return {'dawn': dawn, 'sunrise': sunrise, 'noon': noon, 'sunset': sunset, 'dusk': dusk} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def computeSunTime(self, latitude, longitude, startDate, endDate): \n self.sun = sun(lat=latitude, long=longitude)\n dateTime = datetime.datetime.combine(startDate, datetime.time(hour=8))\n while dateTime.date() <= endDate: \n daytimeStart, daytimeEnd = self.computeDaytime... | [
"0.60909706",
"0.6054457",
"0.5922382",
"0.56137407",
"0.5576481",
"0.5530526",
"0.55205214",
"0.5497912",
"0.5490896",
"0.5478395",
"0.5460385",
"0.5441609",
"0.54134166",
"0.5389697",
"0.53693914",
"0.53531724",
"0.5340516",
"0.53140557",
"0.5308317",
"0.52656955",
"0.52567... | 0.56515837 | 3 |
Calculate dawn time in the UTC timezone. | def dawn_utc(self, date, latitude, longitude):
julianday = self._julianday(date.day, date.month, date.year)
if latitude > 89.8:
latitude = 89.8
if latitude < -89.8:
latitude = -89.8
t = self._jday_to_jcentury(julianday)
eqtime = self._eq_of_time(t)
solarDec = self._sun_declination(t)
try:
hourangle = self._hour_angle_sunrise(latitude, solarDec)
except:
raise AstralError('Sun remains below horizon on this day, at this location.')
delta = longitude - degrees(hourangle)
timeDiff = 4.0 * delta
timeUTC = 720.0 + timeDiff - eqtime
newt = self._jday_to_jcentury(self._jcentury_to_jday(t) + timeUTC / 1440.0)
eqtime = self._eq_of_time(newt)
solarDec = self._sun_declination(newt)
hourangle = self._hour_angle_dawn(latitude, solarDec, self._depression)
delta = longitude - degrees(hourangle)
timeDiff = 4 * delta
timeUTC = 720 + timeDiff - eqtime
timeUTC = timeUTC/60.0
hour = int(timeUTC)
minute = int((timeUTC - hour) * 60)
second = int((((timeUTC - hour) * 60) - minute) * 60)
if second > 59:
second -= 60
minute += 1
elif second < 0:
second += 60
minute -= 1
if minute > 59:
minute -= 60
hour += 1
elif minute < 0:
minute += 60
hour -= 1
if hour > 23:
hour -= 24
date += datetime.timedelta(days=1)
elif hour < 0:
hour += 24
date -= datetime.timedelta(days=1)
dawn = datetime.datetime(date.year, date.month, date.day, hour, minute, second, tzinfo=pytz.utc)
return dawn | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def dawn(self, date=None, local=True):\n\n if self.astral is None:\n self.astral = Astral()\n\n if date is None:\n date = datetime.date.today()\n\n dawn = self.astral.dawn_utc(date, self.latitude, self.longitude)\n\n if local:\n return dawn.astimezone(se... | [
"0.628965",
"0.59754497",
"0.58763033",
"0.5851417",
"0.5806555",
"0.5735901",
"0.56585526",
"0.56538594",
"0.55857354",
"0.55760634",
"0.5519843",
"0.55160165",
"0.55128175",
"0.55116653",
"0.53910935",
"0.5379949",
"0.536428",
"0.5360612",
"0.53601545",
"0.5338035",
"0.5333... | 0.76470286 | 0 |
Calculate sunrise time in the UTC timezone. | def sunrise_utc(self, date, latitude, longitude):
julianday = self._julianday(date.day, date.month, date.year)
t = self._jday_to_jcentury(julianday)
eqtime = self._eq_of_time(t)
solarDec = self._sun_declination(t)
try:
hourangle = self._hour_angle_sunrise(latitude, solarDec)
except:
raise AstralError('Sun remains below horizon on this day, at this location.')
delta = longitude - degrees(hourangle)
timeDiff = 4.0 * delta
timeUTC = 720.0 + timeDiff - eqtime
newt = self._jday_to_jcentury(self._jcentury_to_jday(t) + timeUTC / 1440.0)
eqtime = self._eq_of_time(newt)
solarDec = self._sun_declination(newt)
hourangle = self._hour_angle_sunrise(latitude, solarDec)
delta = longitude - degrees(hourangle)
timeDiff = 4 * delta
timeUTC = 720 + timeDiff - eqtime
timeUTC = timeUTC/60.0
hour = int(timeUTC)
minute = int((timeUTC - hour) * 60)
second = int((((timeUTC - hour) * 60) - minute) * 60)
if second > 59:
second -= 60
minute += 1
elif second < 0:
second += 60
minute -= 1
if minute > 59:
minute -= 60
hour += 1
elif minute < 0:
minute += 60
hour -= 1
if hour > 23:
hour -= 24
date += datetime.timedelta(days=1)
elif hour < 0:
hour += 24
date -= datetime.timedelta(days=1)
sunrise = datetime.datetime(date.year, date.month, date.day, hour, minute, second, tzinfo=pytz.utc)
return sunrise | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def _get_sun_rise_set_time(self, sun_time):\n if sun_time:\n return datetime.fromtimestamp(sun_time).strftime(self.time_format)\n return sun_time",
"def alt_sunrise(cls, date):\n rise = cls.UJJAIN.dawn(date, angle(0, 47, 0))\n return 1/24 * 1/60 * iround(rise * 24 * 60)",
... | [
"0.74266624",
"0.7356725",
"0.72597265",
"0.7091791",
"0.70251125",
"0.7006317",
"0.6827473",
"0.68216705",
"0.68117666",
"0.66464955",
"0.65655184",
"0.6516135",
"0.6488186",
"0.6406055",
"0.63925016",
"0.6312478",
"0.62507564",
"0.6104449",
"0.60976666",
"0.6094293",
"0.605... | 0.79015124 | 0 |
Calculate solar noon time in the UTC timezone. | def solar_noon_utc(self, date, longitude):
julianday = self._julianday(date.day, date.month, date.year)
newt = self._jday_to_jcentury(julianday + 0.5 + longitude / 360.0)
eqtime = self._eq_of_time(newt)
timeUTC = 720.0 + (longitude * 4.0) - eqtime
timeUTC = timeUTC/60.0
hour = int(timeUTC)
minute = int((timeUTC - hour) * 60)
second = int((((timeUTC - hour) * 60) - minute) * 60)
if second > 59:
second -= 60
minute += 1
elif second < 0:
second += 60
minute -= 1
if minute > 59:
minute -= 60
hour += 1
elif minute < 0:
minute += 60
hour -= 1
if hour > 23:
hour -= 24
date += datetime.timedelta(days=1)
elif hour < 0:
hour += 24
date -= datetime.timedelta(days=1)
noon = datetime.datetime(date.year, date.month, date.day, hour, minute, second, tzinfo=pytz.utc)
return noon | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def solar_noon(self, date=None, local=True):\n \n if self.astral is None:\n self.astral = Astral()\n\n if date is None:\n date = datetime.date.today()\n\n noon = self.astral.solar_noon_utc(date, self.longitude)\n\n if local:\n return noon.astimezo... | [
"0.6777714",
"0.6724988",
"0.6343755",
"0.626581",
"0.62460506",
"0.59971875",
"0.59616363",
"0.594989",
"0.5928303",
"0.5893481",
"0.5877765",
"0.58015263",
"0.5749765",
"0.5749219",
"0.5719723",
"0.571865",
"0.571865",
"0.56694263",
"0.5617303",
"0.5612241",
"0.56063336",
... | 0.74279106 | 0 |
Calculate sunset time in the UTC timezone. | def sunset_utc(self, date, latitude, longitude):
julianday = self._julianday(date.day, date.month, date.year)
t = self._jday_to_jcentury(julianday)
eqtime = self._eq_of_time(t)
solarDec = self._sun_declination(t)
try:
hourangle = self._hour_angle_sunset(latitude, solarDec)
except:
raise AstralError('Sun remains below horizon on this day, at this location.')
delta = longitude - degrees(hourangle)
timeDiff = 4.0 * delta
timeUTC = 720.0 + timeDiff - eqtime
newt = self._jday_to_jcentury(self._jcentury_to_jday(t) + timeUTC / 1440.0)
eqtime = self._eq_of_time(newt)
solarDec = self._sun_declination(newt)
hourangle = self._hour_angle_sunset(latitude, solarDec)
delta = longitude - degrees(hourangle)
timeDiff = 4 * delta
timeUTC = 720 + timeDiff - eqtime
timeUTC = timeUTC/60.0
hour = int(timeUTC)
minute = int((timeUTC - hour) * 60)
second = int((((timeUTC - hour) * 60) - minute) * 60)
if second > 59:
second -= 60
minute += 1
elif second < 0:
second += 60
minute -= 1
if minute > 59:
minute -= 60
hour += 1
elif minute < 0:
minute += 60
hour -= 1
if hour > 23:
hour -= 24
date += datetime.timedelta(days=1)
elif hour < 0:
hour += 24
date -= datetime.timedelta(days=1)
sunset = datetime.datetime(date.year, date.month, date.day, hour, minute, second, tzinfo=pytz.utc)
return sunset | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def sunset(self, date=None, local=True):\n \n if self.astral is None:\n self.astral = Astral()\n\n if date is None:\n date = datetime.date.today()\n\n sunset = self.astral.sunset_utc(date, self.latitude, self.longitude)\n\n if local:\n return suns... | [
"0.65699303",
"0.64950114",
"0.63881093",
"0.61808205",
"0.61730003",
"0.6134258",
"0.60923696",
"0.60374415",
"0.60219973",
"0.5875478",
"0.5835468",
"0.5818931",
"0.5818664",
"0.58087045",
"0.5799634",
"0.57659054",
"0.57374483",
"0.5717565",
"0.5715173",
"0.5711675",
"0.57... | 0.74293166 | 0 |
Calculate dusk time in the UTC timezone. | def dusk_utc(self, date, latitude, longitude):
julianday = self._julianday(date.day, date.month, date.year)
if latitude > 89.8:
latitude = 89.8
if latitude < -89.8:
latitude = -89.8
t = self._jday_to_jcentury(julianday)
eqtime = self._eq_of_time(t)
solarDec = self._sun_declination(t)
try:
hourangle = self._hour_angle_sunset(latitude, solarDec)
except:
raise AstralError('Sun remains below horizon on this day, at this location.')
delta = longitude - degrees(hourangle)
timeDiff = 4.0 * delta
timeUTC = 720.0 + timeDiff - eqtime
newt = self._jday_to_jcentury(self._jcentury_to_jday(t) + timeUTC / 1440.0)
eqtime = self._eq_of_time(newt)
solarDec = self._sun_declination(newt)
hourangle = self._hour_angle_dusk(latitude, solarDec, self._depression)
delta = longitude - degrees(hourangle)
timeDiff = 4 * delta
timeUTC = 720 + timeDiff - eqtime
timeUTC = timeUTC/60.0
hour = int(timeUTC)
minute = int((timeUTC - hour) * 60)
second = int((((timeUTC - hour) * 60) - minute) * 60)
if second > 59:
second -= 60
minute += 1
elif second < 0:
second += 60
minute -= 1
if minute > 59:
minute -= 60
hour += 1
elif minute < 0:
minute += 60
hour -= 1
if hour > 23:
hour -= 24
date += datetime.timedelta(days=1)
elif hour < 0:
hour += 24
date -= datetime.timedelta(days=1)
dusk = datetime.datetime(date.year, date.month, date.day, hour, minute, second, tzinfo=pytz.utc)
return dusk | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def utcTime():\r\n return calendar.timegm(time.gmtime())",
"def _get_tz():\n return 'UTC'",
"def get_time():\n\teastern = timezone('US/Eastern')\n\tnow = datetime.datetime.now(eastern).time()\n\treturn(now)",
"def timezone():\n \n pass",
"def nowUTC():\n return datetime.datetime.now(pytz.utc)... | [
"0.69508314",
"0.6756243",
"0.646933",
"0.64476836",
"0.64054435",
"0.6378315",
"0.6367498",
"0.6344899",
"0.630024",
"0.6293508",
"0.62492496",
"0.62225604",
"0.6172558",
"0.615256",
"0.6152383",
"0.6115891",
"0.61116207",
"0.610577",
"0.6104182",
"0.6066876",
"0.606603",
... | 0.7123817 | 0 |
Calculate ruhakaalam times in the UTC timezone. | def rahukaalam_utc(self, date, latitude, longitude):
if date is None:
date = datetime.date.today()
try:
sunrise = self.sunrise_utc(date, latitude, longitude)
sunset = self.sunset_utc(date, latitude, longitude)
except:
raise AstralError('Sun remains below horizon on this day, at this location.')
octant_duration = (sunset - sunrise) / 8
# Mo,Sa,Fr,We,Th,Tu,Su
octant_index = [1,6,4,5,3,2,7]
weekday = date.weekday()
octant = octant_index[weekday]
start = sunrise + (octant_duration * octant)
end = start + octant_duration
return {'start': start, 'end': end} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def rahukaalam(self, date=None, local=True):\n\n if self.astral is None:\n self.astral = Astral()\n\n if date is None:\n date = datetime.date.today()\n\n rahukaalam = self.astral.rahukaalam_utc(date, self.latitude, self.longitude)\n\n if local:\n for key... | [
"0.6330134",
"0.61681116",
"0.60523003",
"0.59781736",
"0.5969716",
"0.56076247",
"0.55986744",
"0.55825686",
"0.5552908",
"0.5434768",
"0.53342485",
"0.53334755",
"0.53267014",
"0.5321076",
"0.5287703",
"0.5276938",
"0.5276938",
"0.5272016",
"0.52586037",
"0.5246418",
"0.522... | 0.6230036 | 1 |
Calculate the azimuth of the sun in the UTC timezone. | def solar_azimuth(self, dateandtime, latitude, longitude):
if latitude > 89.8:
latitude = 89.8
if latitude < -89.8:
latitude = -89.8
zone = -dateandtime.utcoffset().seconds / 3600.0
utc_datetime = dateandtime.astimezone(pytz.utc)
timenow = utc_datetime.hour + (utc_datetime.minute / 60.0) + (utc_datetime.second / 3600)
JD = self._julianday(dateandtime.day, dateandtime.month, dateandtime.year)
t = self._jday_to_jcentury(JD + timenow / 24.0)
theta = self._sun_declination(t)
Etime = self._eq_of_time(t)
eqtime = Etime
solarDec = theta # in degrees
solarTimeFix = eqtime - (4.0 * longitude) + (60 * zone)
trueSolarTime = dateandtime.hour * 60.0 + dateandtime.minute + dateandtime.second / 60.0 + solarTimeFix
# in minutes
while trueSolarTime > 1440:
trueSolarTime = trueSolarTime - 1440
hourangle = trueSolarTime / 4.0 - 180.0
# Thanks to Louis Schwarzmayr for the next line:
if hourangle < -180:
hourangle = hourangle + 360.0
harad = radians(hourangle)
csz = sin(radians(latitude)) * sin(radians(solarDec)) + \
cos(radians(latitude)) * cos(radians(solarDec)) * cos(harad)
if csz > 1.0:
csz = 1.0
elif csz < -1.0:
csz = -1.0
zenith = degrees(acos(csz))
azDenom = (cos(radians(latitude)) * sin(radians(zenith)))
if (abs(azDenom) > 0.001):
azRad = ((sin(radians(latitude)) * cos(radians(zenith))) - sin(radians(solarDec))) / azDenom
if abs(azRad) > 1.0:
if azRad < 0:
azRad = -1.0
else:
azRad = 1.0
azimuth = 180.0 - degrees(acos(azRad))
if hourangle > 0.0:
azimuth = -azimuth
else:
if latitude > 0.0:
azimuth = 180.0
else:
azimuth = 0#
if azimuth < 0.0:
azimuth = azimuth + 360.0
return azimuth | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def solar_azimuth(self, dateandtime=None):\n\n if self.astral is None:\n self.astral = Astral()\n\n if dateandtime is None:\n dateandtime = datetime.datetime.now(tz=self.tz)\n \n return self.astral.solar_azimuth(dateandtime, self.latitude, self.longitude)",
"... | [
"0.67131555",
"0.6504118",
"0.64523375",
"0.6439935",
"0.6436878",
"0.641925",
"0.6345609",
"0.6120051",
"0.6109093",
"0.6081307",
"0.6055947",
"0.6041341",
"0.6014488",
"0.5996403",
"0.5920246",
"0.5873155",
"0.586566",
"0.5822988",
"0.58073103",
"0.5778373",
"0.573385",
"... | 0.6639568 | 1 |
Calculate the elevation of the sun. | def solar_elevation(self, dateandtime, latitude, longitude):
if latitude > 89.8:
latitude = 89.8
if latitude < -89.8:
latitude = -89.8
zone = -dateandtime.utcoffset().seconds / 3600.0
utc_datetime = dateandtime.astimezone(pytz.utc)
timenow = utc_datetime.hour + (utc_datetime.minute / 60.0) + (utc_datetime.second / 3600)
JD = self._julianday(dateandtime.day, dateandtime.month, dateandtime.year)
t = self._jday_to_jcentury(JD + timenow / 24.0)
theta = self._sun_declination(t)
Etime = self._eq_of_time(t)
eqtime = Etime
solarDec = theta # in degrees
solarTimeFix = eqtime - (4.0 * longitude) + (60 * zone)
trueSolarTime = dateandtime.hour * 60.0 + dateandtime.minute + dateandtime.second / 60.0 + solarTimeFix
# in minutes
while trueSolarTime > 1440:
trueSolarTime = trueSolarTime - 1440
hourangle = trueSolarTime / 4.0 - 180.0
# Thanks to Louis Schwarzmayr for the next line:
if hourangle < -180:
hourangle = hourangle + 360.0
harad = radians(hourangle)
csz = sin(radians(latitude)) * sin(radians(solarDec)) + \
cos(radians(latitude)) * cos(radians(solarDec)) * cos(harad)
if csz > 1.0:
csz = 1.0
elif csz < -1.0:
csz = -1.0
zenith = degrees(acos(csz))
azDenom = (cos(radians(latitude)) * sin(radians(zenith)))
if (abs(azDenom) > 0.001):
azRad = ((sin(radians(latitude)) * cos(radians(zenith))) - sin(radians(solarDec))) / azDenom
if abs(azRad) > 1.0:
if azRad < 0:
azRad = -1.0
else:
azRad = 1.0
azimuth = 180.0 - degrees(acos(azRad))
if hourangle > 0.0:
azimuth = -azimuth
else:
if latitude > 0.0:
azimuth = 180.0
else:
azimuth = 0
if azimuth < 0.0:
azimuth = azimuth + 360.0
exoatmElevation = 90.0 - zenith
if exoatmElevation > 85.0:
refractionCorrection = 0.0
else:
te = tan(radians(exoatmElevation))
if exoatmElevation > 5.0:
refractionCorrection = 58.1 / te - 0.07 / (te * te * te) + 0.000086 / (te * te * te * te * te)
elif exoatmElevation > -0.575:
step1 = (-12.79 + exoatmElevation * 0.711)
step2 = (103.4 + exoatmElevation * (step1))
step3 = (-518.2 + exoatmElevation * (step2))
refractionCorrection = 1735.0 + exoatmElevation * (step3)
else:
refractionCorrection = -20.774 / te
refractionCorrection = refractionCorrection / 3600.0
solarzen = zenith - refractionCorrection
solarelevation = 90.0 - solarzen
return solarelevation | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def elevation(self):\n return self.altitude - self.heightAboveGround",
"def elevation(x, y):\n file = os.path.abspath(\"..\") + \"\\Shape\\Shape.vrt\"\n layer = gdal.Open(file)\n gt = layer.GetGeoTransform()\n rasterx = int((x - gt[0]) / gt[1])\n rastery = int((y - gt[3]) / gt[5])\n prin... | [
"0.6999895",
"0.668499",
"0.6425622",
"0.6422953",
"0.6396147",
"0.6377398",
"0.63741803",
"0.61598486",
"0.61377054",
"0.61298066",
"0.5996655",
"0.59889287",
"0.5973628",
"0.58740777",
"0.58685416",
"0.5855382",
"0.58081555",
"0.57917005",
"0.5758174",
"0.5704655",
"0.57044... | 0.5579604 | 27 |
Calculates the phase of the moon on the specified date. | def moon_phase(self, date):
jd = self._julianday(date.day, date.month, date.year)
DT = pow((jd - 2382148), 2) / (41048480*86400)
T = (jd + DT - 2451545.0) / 36525
T2 = pow(T,2)
T3 = pow(T,3)
D = 297.85 + (445267.1115*T) - (0.0016300*T2) + (T3/545868)
D = radians(self._proper_angle(D))
M = 357.53 + (35999.0503*T)
M = radians(self._proper_angle(M))
M1 = 134.96 + (477198.8676*T) + (0.0089970*T2) + (T3/69699)
M1 = radians(self._proper_angle(M1))
elong = degrees(D) + 6.29*sin(M1)
elong -= 2.10*sin(M)
elong += 1.27*sin(2*D - M1)
elong += 0.66*sin(2*D)
elong = self._proper_angle(elong)
moon = int(floor(((elong + 6.43) / 360) * 28))
if moon == 28:
moon = 0
return moon | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def moon_phase(self, date=None):\n self._set_site_date(date)\n self.moon.compute(self.site)\n return self.moon.moon_phase",
"def equation_of_time(cls, date):\n offset = cls.sine(cls.mean_position(date, cls.ANOMALISTIC_YEAR))\n equation_sun = (offset * angle(57, 18, 0) * (14/360... | [
"0.7753409",
"0.64832145",
"0.6266615",
"0.6266615",
"0.5898424",
"0.5834775",
"0.5758287",
"0.5736949",
"0.5586432",
"0.5580027",
"0.5443291",
"0.5376677",
"0.53231025",
"0.53126574",
"0.5306432",
"0.5282793",
"0.52764946",
"0.5266146",
"0.5248463",
"0.5236514",
"0.5230845",... | 0.7782467 | 0 |
Reorder 'shape' according to the chosen data layout to optimize data distribution. | def _optimizeshape(shape):
shape.sort()
if ORDER == 'C':
shape[:] = shape[::-1] | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def unchanged_shape(input_shape):\n return input_shape",
"def restore_backup_shape(self):\n\n self.shape = self.shape_backup",
"def backup_shape(self):\n\n self.shape_backup = np.copy(self.shape)",
"def set_shape(self, shape):\n self._shape = self._shape.merge_with(shape)",
"def change_... | [
"0.601357",
"0.6012796",
"0.59265906",
"0.59111005",
"0.58404654",
"0.5758127",
"0.57051116",
"0.5653655",
"0.5619018",
"0.5616662",
"0.5612885",
"0.56128573",
"0.561095",
"0.5574861",
"0.5568789",
"0.55197614",
"0.5517362",
"0.551245",
"0.54615873",
"0.54567415",
"0.54471827... | 0.7083111 | 0 |
returns the communicator used to build this topology | def parent(self):
return self._mpis.comm | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_comm() -> Communication:\n return __default_comm",
"def get_comm(self):\n return self.comm",
"def comm(self):\n return self._comm",
"def GetComm(self):\n return _hypre.HypreParMatrix_GetComm(self)",
"def topology(self):\n return self._topology",
"def object_communic... | [
"0.72166127",
"0.6937673",
"0.66808903",
"0.65805095",
"0.65750676",
"0.6487292",
"0.62338114",
"0.62185067",
"0.5998818",
"0.5994917",
"0.59699655",
"0.5910966",
"0.5877223",
"0.5876523",
"0.58492416",
"0.58371776",
"0.58371776",
"0.58371776",
"0.58118683",
"0.5713875",
"0.5... | 0.64308983 | 6 |
returns ghost layer width. | def ghosts(self):
return self.mesh.discretization.ghosts | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def get_width(self):\n\t\treturn len(self._background) if self._background else 0",
"def get_dimension_width(self):\n pass",
"def width(self) -> int:\n return self._obj[self.x_dim].size",
"def getWidth(self):\n return _libsbml.Dimensions_getWidth(self)",
"def getWidth(self):\n r... | [
"0.74909455",
"0.73224",
"0.71234566",
"0.7045834",
"0.69717586",
"0.6938515",
"0.69376487",
"0.693364",
"0.693364",
"0.69244164",
"0.692004",
"0.68859637",
"0.6870889",
"0.6870504",
"0.6858993",
"0.6841644",
"0.68349195",
"0.68349195",
"0.68349195",
"0.6833873",
"0.68273956"... | 0.0 | -1 |
returns id of the task that owns this topology | def task_id(self):
return self._mpis.task_id | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def task_id(self):\n return self._task_id",
"def task_id(self):\n return self._task_id",
"def task_id(self):\n return self._task_id",
"def task_id(self):\n return self._task_id",
"def taskid(self):\n raise NotImplementedError('Must be implemented by subclass.')",
"def t... | [
"0.75476515",
"0.75476515",
"0.75476515",
"0.75476515",
"0.7357828",
"0.72557056",
"0.7198645",
"0.6637944",
"0.6620676",
"0.65653884",
"0.6474",
"0.6436455",
"0.63189775",
"0.6293882",
"0.6293882",
"0.62764555",
"0.6194142",
"0.61492884",
"0.6114325",
"0.611248",
"0.60441566... | 0.75019264 | 4 |
Defines a 'plane' (1D) topology for a given mesh resolution. This function is to be used when topo/discretization features come from an external routine (e.g. scales or fftw) | def plane_precomputed(cls, localres, global_start, cdir=None, **kwds):
msg = 'parameter is not required for plane_precomputed'
msg += ' topology construction.'
assert 'dim' not in kwds, 'dim ' + msg
assert 'shape ' not in kwds, 'shape ' + msg
assert 'cutdir ' not in kwds, 'cutdir ' + msg
# Local mesh :
global_start = npw.asdimarray(global_start)
localres = npw.asdimarray(localres)
mesh = Mesh(kwds['domain'], kwds['discretization'],
localres, global_start)
# MPI layout
domain = kwds['domain']
cutdir = npw.zeros(domain.dimension, dtype=npw.bool)
if cdir is not None:
cutdir[cdir] = True
else:
if ORDER == 'C':
cutdir[0] = True
else:
cutdir[-1] = True
return cls(mesh=mesh, cutdir=cutdir, **kwds) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def WritePlane(self):\n if not self.__train:\n print('ERROR: Must use Train before WritePlane')\n sys.exit(-1)\n if not self.__openPlaneO:\n print('ERROR: Must use OpenPlaneO before WritePlane')\n sys.exit(-1)\n\n # Defines angular dimensions\n self.__nc_RSoft_O.createDimension('typ... | [
"0.5991863",
"0.5981517",
"0.59631455",
"0.5854901",
"0.58076966",
"0.5753462",
"0.56212896",
"0.5567714",
"0.55646545",
"0.55594105",
"0.55340147",
"0.551879",
"0.54897666",
"0.5471865",
"0.5409033",
"0.53919226",
"0.5324614",
"0.53135514",
"0.5296597",
"0.5288494",
"0.52642... | 0.59658796 | 2 |
Comparison of two topologies. Two topos are equal if they have the same mesh, shape and domain. | def __eq__(self, other):
if self.__class__ != other.__class__:
return False
return self.mesh == other.mesh and \
npw.equal(self.shape, other.shape).all() and \
self.domain == other.domain | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def have_same_topology(first_mesh, second_mesh):\n return attr_has_same_shape(first_mesh, second_mesh, \"v\") and attr_is_equal(\n first_mesh, second_mesh, \"f\"\n )",
"def equivalent(kls, first, second):\n if first.empty() and second.empty():\n return True\n elif first.vertices.shape[0] ... | [
"0.7391109",
"0.69211054",
"0.66308445",
"0.6267532",
"0.6095765",
"0.5980267",
"0.5966569",
"0.5945673",
"0.59418166",
"0.5940273",
"0.59177405",
"0.5912851",
"0.59052336",
"0.59029365",
"0.5899751",
"0.5899751",
"0.589094",
"0.587771",
"0.58488256",
"0.5842145",
"0.5818348"... | 0.651133 | 3 |
Not equal operator. Seems to be required in addition to __eq__ to avoid 'cornercase' behaviors. | def __ne__(self, other):
result = self.__eq__(other)
if result is NotImplemented:
return result
return not result | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def __ne__(self, other):\n return not (self == other) # opposite of __eq__",
"def __ne__(self, other):\n return not (self == other) # opposite of __eq__",
"def __ne__(self, rhs):\n return not self.__eq__(rhs)",
"def __ne__(self, other):\r\n return not self.__eq__... | [
"0.8394335",
"0.8386683",
"0.8160081",
"0.81121725",
"0.81121725",
"0.81121725",
"0.81121725",
"0.8075682",
"0.80685496",
"0.80672383",
"0.8056072",
"0.8056072",
"0.8056072",
"0.8056072",
"0.8056072",
"0.8056072",
"0.8056072",
"0.8056072",
"0.8056072",
"0.8056072",
"0.8056072... | 0.0 | -1 |
True if ghost layer length is not zero. | def has_ghosts(self):
return not np.all(self.mesh.discretization.ghosts == 0) | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def empty(self):\n return len(self.layers) == 0",
"def is_empty(self):\n return ch.prod(ch.tensor(self.x.shape)).item() == 0",
"def is_ghost(self):\n\t\treturn False",
"def is_trivial(self):\n return self.dims == 0",
"def is_empty(self) -> bool:\n return self.num_grna() == 0",
... | [
"0.7561698",
"0.72112876",
"0.7065583",
"0.7046145",
"0.7030016",
"0.69214237",
"0.6830907",
"0.6792221",
"0.67822015",
"0.67809653",
"0.67568576",
"0.6733361",
"0.6685363",
"0.6656976",
"0.6638194",
"0.6637561",
"0.6615059",
"0.660577",
"0.65900713",
"0.6586594",
"0.658374",... | 0.72264445 | 1 |
return the id of the present topology. This id is unique among all defined topologies. | def get_id(self):
return self.__id | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"def unique_id(self) -> str:\n return str(self.coordinator.gios.station_id)",
"def topology_name(self):\n return self._topology_name",
"def topology(self):\n return self._topology",
"def portlet_id(self):\n return id(self)",
"def establish_id(self):\n if self.config.node_i... | [
"0.69869524",
"0.66642356",
"0.6493194",
"0.6485879",
"0.64025915",
"0.63910806",
"0.6356197",
"0.62523925",
"0.62455714",
"0.62014794",
"0.6190886",
"0.61564124",
"0.6125926",
"0.60740584",
"0.6072235",
"0.60693944",
"0.60588557",
"0.6046706",
"0.60322815",
"0.60287",
"0.602... | 0.0 | -1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.